September 2006 - Boost-users - lists.preview.boost.org

Newbie Jamfile author question
by Drumheller, Michael 13 Sep '06

13 Sep '06

Hello: I am trying to write some Jamfiles and I am finding that bjam tends to run my rules twice. Here is a tiny demo (using Boost 1.31.1 on Windows XP, with zsh/cygwin, bjam version "3.1.13. OS=NT".). % export BOOST_ROOT=c:/boost_1_33_1; cd c:/; rm -rf deleteme; mkdir deleteme; cd deleteme; echo 'Echo Hello Twice ;' > Jamfile; bjam Hello Twice Hello Twice ...found 8 targets... (Note: If the first statement is "export BOOST_ROOT=;" instead, I get the error "Unable to load Boost.Build: could not find "boost-build.jam...Attempted search from c:\deleteme up to the root...etc.") Notice the double-execution. Here is some potentially useful extra information. I ran it with -d5, and noticed that 'Echo Hello Twice ;' was getting executed at lines 1785 and 1797 of allyourbase.jam. Here is a snippet of the -d5 output: ---------------------------------------------------------output with -d5---------------------------------------------------------- <snip> c:\boost_1_33_1\tools/build/v1\allyourbase.jam:1784:>>>>|> set gINCLUDED_AS_DEPENDANT(Jamfile) = TRUE c:\boost_1_33_1\tools/build/v1\allyourbase.jam:1785:>>>>|> include Jamfile Jamfile:1:>>>>|> Echo Hello Twice Hello Twice c:\boost_1_33_1\tools/build/v1\allyourbase.jam:1791:>>>>|> set gIN_LIB_INCLUDE = c:\boost_1_33_1\tools/build/v1\allyourbase.jam:1796:>>>>|> set gINCLUDED(Jamfile) = TRUE c:\boost_1_33_1\tools/build/v1\allyourbase.jam:1797:>>>>|> include Jamfile Jamfile:1:>>>>|> Echo Hello Twice Hello Twice make -- all make -- all <snip> --------------------------------------------------------end output with -d5------------------------------------------------------ The file allyourbase.jam is too big for this email, but I'm including the relevant snippet here, with key lines marked with "<<<<<" : ------------------------------------------------------allyourbase.jam--- --------------------------------------------- <snip> # Load a user's Jamfile(s). # rule load-jamfiles ( jamfiles * ) { # First we load the Jamfiles without generation of main targets so that # dependencies are preloaded. Then we reload the files with target # generation enabled. local jamfile ; local as-dependant = $(gIN_LIB_INCLUDE) ; local gIN_LIB_INCLUDE ; gIN_LIB_INCLUDE = TRUE ; for jamfile-path in $(jamfiles) { if ! $(gINCLUDED_AS_DEPENDANT($(jamfile-path))) { gINCLUDED_AS_DEPENDANT($(jamfile-path)) = TRUE ; include $(jamfile-path) ; <<<<< line 1785 } } if ! $(as-dependant) { gIN_LIB_INCLUDE = ; for jamfile-path in $(jamfiles) { if ! $(gINCLUDED($(jamfile-path))) { gINCLUDED($(jamfile-path)) = TRUE ; include $(jamfile-path) ; <<<<< line 1797 } } } } <snip> ------------------------------------------------------end allyourbase.jam------------------------------------------------ Can anyone reproduce and/or explain this? Thank you. Michael Drumheller Boeing Phantom Works Mathematics and Engineering Analysis 425.373.2703 michael.drumheller(a)boeing.com This email may contain proprietary information. If you are not the intended recipient please delete it and notify the sender that you received it in error.

3 2

multi_index library, dynamic number of indices
by Adán Cosgaya 13 Sep '06

13 Sep '06

Hi, I am using multi_index to keep a set of d-dimensional points, where each point is a vector inside the multi_index container. e.g (3,5,8,9,5) is a 5-dimensional point (but this can vary and be 3-d, 7-d, etc..). I need to have the set sorted by each of the dimensions. I can do it statically if I know in advance how many dimensions I have, but I don't know how to make dynamic to any number of dimensions. I currently have: template<int N> struct nth_coordinate { typedef int result_type; int operator()(const vector<int>& x)const { return x[N]; } }; typedef multi_index_container< vector<int>, indexed_by< sequenced<>, ordered_non_unique<nth_coordinate<0> >, ordered_non_unique<nth_coordinate<1> >, ordered_non_unique<nth_coordinate<2> >, ordered_non_unique<nth_coordinate<3> >, ordered_non_unique<nth_coordinate<4> > > > multi_index_Points; is it possible do it without explicitly saying how many indices do I need? Also, I am trying to create a function which receives as a parameter the dimension I want to work with, but it seems that I need to explicitly say the number of the index in nth_index (it obviously needs a constant). For example: int median (int d){ ... typedef multi_index_Points::nth_index< d >::type multi_index_Points_it; ===> I would like to pass "d" as a parameter ... } is there any workaround for this issues? would you mind pointing me in the right direction with an example of how to do it with thelibrary? thanks in advance... Adan

1 0

RV: assign shared_ptr to 0 in initialization list
by Berenguer Blasi 13 Sep '06

13 Sep '06

Hi, I've been following this thread and been unable to do the same with: boost::shared_ptr< map<string,string> > () So I can't do: constructor ( boost::shared_ptr< map<string,string> > varName = boost::shared_ptr< map<string,string> > () ) The error I get is (why/how do I specify the missing params for map?): [cc] /home/bereng/blaseek/src/lib/cppToolkit/DBHelper.h:61: error: expected a,a or a...a before a>a token [cc] /home/bereng/blaseek/src/lib/cppToolkit/DBHelper.h:61: error: wrong number of template arguments (1, should be 4) [cc] /usr/lib/gcc/i386-redhat-linux/4.1.1/../../../../include/c++/4.1.1/bits/stl_ map.h:92: error: provided for atemplate<class _Key, class _Tp, class _Compare, class _Alloc> class std::mapa [cc] /home/bereng/blaseek/src/lib/cppToolkit/DBHelper.h:61: error: template argument 1 is invalid [cc] /home/bereng/blaseek/src/lib/cppToolkit/DBHelper.h:61: error: default argument missing for parameter 2 of aboost::shared_ptr<cppToolkit::ResultSet> cppToolkit::DBHelper::findObject(boost::shared_ptr<std::map<std::basic_strin g<char, std::char_traits<char>, std::allocator<char> >, std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > > >, std::string)a Thanks a lot in advance. -----Mensaje original----- De: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org]En nombre de Scott Amort Enviado el: lunes, 14 de agosto de 2006 1:09 Para: boost-users(a)lists.boost.org Asunto: Re: [Boost-users] assign shared_ptr to 0 in initialization list Hi Scott, Thanks for the quick reply! On Sun, 2006-08-13 at 18:11 -0400, me22 wrote: > Instead of > > if (writer_.get() == 0) { /* create default error writer */ } > Why not just use > if ( !writer_ ) { /* create default error writer */ } > instead? This would work with ordinary pointers too. Thanks, that is clearer! > > What is the equivalent to: > > > > Parser testParser(0); > > > Parser testParser( ErrorWriterPtr() ); // would work > > I'd be tempted instead to replace the constructor definition with > Parser(ErrorWriterPtr writer = ErrorWritePtr()) > : writer_(writer) > { > } > however, to be able to just say > Parser testParser; > if you don't want to specify the writer. Perfect! Thanks again. Best, Scott _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

Re: [Boost-users] bind, and member function with a parameter
by Nat Goodspeed 13 Sep '06

13 Sep '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] On Behalf Of Alexander Shyrokov > Sent: Wednesday, September 13, 2006 1:40 PM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] bind, and member function with a parameter > > void animation::advance(int ms); > std::vector<animation> anims; > std::for_each(anims.begin(), anims.end(), > boost::bind(&animation::advance, _1, ms)); > > I am using boost::lambda:: before _1. I get an error error C2825: > 'F::result_type': cannot form a qualified name [Nat] boost::bind defines _1 (etc.) placeholders that you must use with boost::bind(). boost::lambda defines _1 (etc.) placeholders that you must use with boost::lambda::bind(). Sadly, the two sets of placeholders are incompatible. Might that be your problem? Try explicitly qualifying your placeholder: ... boost::bind::_1 ... If that works, then adjust your using clauses appropriately.

1 0

[Regex] Japanese character equivalence is not working.
by Raveendra Madala 13 Sep '06

13 Sep '06

Hi, My name is Raveendra Madala. I work for Adobe Systems. We are using boost/regex 1.33.1 in one of our projects and we have encountered the following bug. Character Equivalence is supposed to find all variations of a given character. When we try to use this with Japanese characters regex is failing. To test this, if we have 0x30A2(Full width Katakana letter A), 0xFF71(Half width katakana letter A) and 0x32D0(Circled Katakana A) in the text and if we enter [[=a=]] where a is katakana a then regex is unable to find the three characters. This is just an example and is happening for all Japanese characters. How can we work around this issue? If you require more information on this, please do let me know. Thanks, Raveendra

3 3

Problems when compiling with Xcode
by Jaime Rios 13 Sep '06

13 Sep '06

Hi folks, I didn't see my post appear on the list, so I will post it again... This might be a silly question, or one that has already been addressed in the past, but here goes anyway. I have Xcode 2.4 and recently, I had to compile a static library for Universal code. I had to install the 10.2.8 Mac OS X sdk and when I went to compile my library, I got 66 errors :( Here is the first error I saw: from /Users/me/Documents/development/CPP/FMPlugIns/ FM85/FMPlugInSDK/plugin_u/Source/FMPlugInExample.cpp:41: from ../Libraries/FMWrapper.framework/Headers/ FMXTypes.h:15, from ../Libraries/FMWrapper.framework/Headers/ FMXClient.h:15, from /Developer/SDKs/MacOSX10.2.8.sdk/usr/include/ gcc/darwin/3.3/c++/stdexcept:45, from /Developer/SDKs/MacOSX10.2.8.sdk/usr/ include/gcc/darwin/3.3/c++/string:47, from /Developer/SDKs/MacOSX10.2.8.sdk/usr/ include/gcc/darwin/3.3/c++/bits/char_traits.h:46, from /Developer/SDKs/MacOSX10.2.8.sdk/usr/ include/gcc/darwin/3.3/c++/bits/fpos.h:45, from /Users/jaimerios/Documents/development/ cpp/Tools/boost_1_33_1/boost/compatibility/cpp_c_headers/cwchar:8, from /usr/include/wchar.h:71, from /usr/include/_types.h:27, from /usr/include/sys/_types.h:27, In file included from /usr/include/machine/_types.h:26, /usr/include/ppc/_types.h:73: error: conflicting types for `typedef union __mbstate_t __mbstate_t' The last error is the interesting one. I am assuming that the Boost sdk is forcing my compiler to look in the /usr/include path for the string header file instead of the Mac OS X 10.2.8 sdk path. Is this assumption correct? If so, how do I correct this problem? -Jaime

2 2

[fusion] transform a vector of values to refs
by Andy Little 13 Sep '06

13 Sep '06

Hi, I am trying to transform from a fusion vector of values to a fusion vector of non-const references to those values, the ultimate aim being to assign the original sequence from another sequence. The code below works ok with make_vector, but I want to be able to automate it for any fusion sequence. How can I do that? Current efforts follows: regards Andy Little #include <quan/out/current.hpp> #include <quan/matrix/out/matrix.hpp> #include <quan/operators/binary_operator_functors.hpp> #include <boost/fusion/sequence/io.hpp> #include <boost/fusion/sequence.hpp> #include <boost/ref.hpp> // try to make a function object to wrap references // in fusion style, with boost::ref struct add_reference_wrapper{ template <typename T> struct result{ typedef boost::reference_wrapper<T> type; }; template <typename T> typename result<T>::type operator()(T & t)const { return boost::ref(t); } }; int main() { using boost::fusion::at_c; typedef boost::fusion::vector4< quan::current::A, quan::current::mA, double,double > fusion_sequence_type; fusion_sequence_type sequence( quan::current::A(3), quan::current::mA(2), 1,1 ); std::cout << "before : " << sequence <<'\n'; // This works OK, and and assign the sequence to itself; std::cout << "after : " << boost::fusion::as_vector( boost::fusion::transform( boost::fusion::make_vector( boost::ref(at_c<0>(sequence)), boost::ref(at_c<1>(sequence)), boost::ref(at_c<2>(sequence)), boost::ref(at_c<3>(sequence)) ),sequence, quan::operator_plus_equals() ) ) <<'\n'; //############################################# // But cant make a vector of non const references boost::fusion::as_vector( boost::fusion::transform( sequence,add_reference_wrapper() ) ); //############################################# }

3 15

Re: [Boost-users] Library Interface Design
by Sohail Somani 13 Sep '06

13 Sep '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Roman Neuhauser > if (!initialized_) { > throw new exception("This object is broken."); > } > > That's somewhat like OOP in C, and FMPOV a huge step back. Actually, even in strict C, good programmers tend to do something like: T * make_T(T1 p1, T2 p2); T1 do_op1(T*this__,...) And make T opaque, i.e. C++ in C. Sohail

3 2

Iterating over MPL container
by Johan Torp 13 Sep '06

13 Sep '06

Given an MPL container: struct A{}; struct B{}; typedef boost::mpl::vector<A,B> AB and a templated function, specialized for all members of the MPL container: template<class T> void foo(); template<A> void foo(); template<B> void foo(); I would like to be able to generate the code: foo<A>(); foo<B>(); automatically using AB somehow. That is, I would like to iterate through the MPL container and generate a call to void Foo<T>(); for each member T in the container. How do I achieve this? Best Regards, Johan Torp -- System Developer TouchTable AB Tel: +46 (0)31 773 68 12 johan.torp(a)touchtable.se

2 1

Getting coverage results with boost.test on vc8
by imre＠u-tx.com 13 Sep '06

13 Sep '06

Hi, is such thing possible? If yes, then how can I do this? Thanks ImRe

2 1