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

Design for boost::serialization of STL iterators.
by Carlo Wood 23 May '09

23 May '09

On Sat, Mar 11, 2006 at 11:45:36PM +0200, Peter Dimov wrote: > Carlo Wood wrote: > > > 1) WHY does boost::serialization not support serialization > > of iterators? > > It's very hard, if not impossible, in general. It is either impossible or possible. When it is possible, it can't be hard :p I think that at the moment of serialization, the actual container needs to be known. So, only concentrating on the syntax of the code that serializes an iterator, the following cannot work: ar & iter; However, the container will be known at that point (or at least, we might as well assume that). Therefore, I could imagine a syntax like: ar & foobar(container, iter); where 'foobar' is some template function (that will be part of boost::serialization in the future). Lets start with the last one (have to start somewhere). In order to deserialize the iterator (and taken into account that we already have the container) -- which makes me think that it might be better to pass a functor to operator& above. In other words, (at least for writing), use: template<class Container> struct Foobar { Foobar(Container const&, typename Container::const_iterator& iter) : M_container(container), M_iter(iter); private: Container const& M_container; Container::const_iterator& M_iter; }; and then assign to M_iter, whatever we find in M_container. > If you have access to the container to which the iterator i refers: > > a) if the container is a map, you can serialize i->first, then on > deserialization look up the key in the map using .find(); > > b) if the container is a sequence, and it has the same contents on > deserialization as it does on serialization, you can serialize the index of > the element - distance( c.begin(), i ). I don't think that it is a requirement that the whole container has to be read: either it's a map or set, in which case later insertions will not invalidate the container, or it is a vector, in which case we use an index, from which we can construct the end iterators before the whole container is reconstructed. Therefore, the following syntax can work imho: ar & FooBar(container, iter); Would you agree? There are a zillion questions and implementation details open - but I'd like to get anyones feedback about this type of interface for iterators before continuing. Current questions: What is a good name for Foobar? Am I right when I think that Foobar needs to be declared in boost::serialization? Now the hard part (for me) is that part that involves the internals of the boost library. At the moment one tries to serialize an iterator, it is possible (though not necessarily) that the object that the iterator points to is already serialized. In the case that we are dealing with an associative container (map or set etc), we don't want to store the contents of the object (or key part, in the case of a map) again: I'd like to just store that once, and store a reference in the archive at the other place. How can I make the library store an object only the first time and the store a reference the second time? This would be for an object of arbitrary type thus. I think that it is only feasible to do this when it's actually the same object (same memory address), which is the case; but while storing the object element of the container, the address of it isn't stored as well, is it? Is there a way to make: std::set<SomeData> s; [...] ar << s; Store the address of s (&s) along with the contents of s? And would that then automatically cause the library to not store that same object again when I do: std::set<SomeData>::iterator iter = s.find(...); [...] ar << *iter; Because then, &*iter would again be the same memory address as what was stored before. -- Carlo Wood <carlo(a)alinoe.com>

3 2

Boost Graph Library and Boehm Garbage Collector
by FBSL 08 Sep '08

08 Sep '08

Hello I am having trouble to garbage-collect adjacency_list<>. I have instanciated it with correctly garbage-collected vectors and lists (I have copied vecS and listS definitions, and added Boehm GC's default allocator so that they are garbage-collected). In my application I need to dynamically allocate many graphs, but it does not work, there is a (big) memory leak. Unfortunately, there is no template argument in adjacency_list<> to specify Boehm GC's allocator. Does anyone have a hint ? Snippet code "main.cpp" follows, compiled with Boost Graph Library 1.32, Boehm GC 6.4 and G++ 3.3.5, with command line : $ g++ -o main main.cpp -lgc -lgccpp -- #include <boost/graph/adjacency_list.hpp> #include <gc/gc_allocator.h> #include <gc/gc_cpp.h> #include <iostream> #include <vector> #include <list> using namespace std; using namespace boost; namespace boost { struct collected_vecS {}; struct collected_listS {}; template <class ValueType> struct container_gen<collected_vecS, ValueType> { typedef vector<ValueType,gc_allocator<ValueType> > type; }; template <class ValueType> struct container_gen<collected_listS, ValueType> { typedef list<ValueType,gc_allocator<ValueType> > type; }; template <> struct parallel_edge_traits<collected_vecS> { typedef allow_parallel_edge_tag type; }; template <> struct parallel_edge_traits<collected_listS> { typedef allow_parallel_edge_tag type; }; namespace detail { template <> struct is_random_access<collected_vecS> { enum { value = true }; typedef true_type type; }; } } typedef adjacency_list<collected_vecS, collected_vecS, directedS, no_property, no_property, no_property, collected_listS> graph; int main() { // leaks... while(true){ graph * g=new (UseGC) graph; for(unsigned int i=0; i<100; ++i){ add_vertex(*g); } for(unsigned int i=0; i<100; ++i){ for(unsigned int j=0; j<100; ++j){ add_edge(i,j,*g); } } } }

3 4

[statechart] history transitions make state-local-storage "un-cool"
by Mick Hollins 26 Jun '08

26 Jun '08

Apologies if this has been discussed before, but I couldn't find any mention of it: I am currently using the history facility of boost::fsm. I've discovered that when I re-enter a state, X, via a history transition I don't actually re-enter the same instance of X that I was in before, but instead enter a newly constructed instance of X. I just checked the UML spec regarding history transitions and it says that "Any necessary entry actions are performed", so given that boost::fsm uses constructors to represent entry actions I guess a new instance of X has to be constructed to ensure UML compliance. My actual concern is the effect this has on the "coolness" of state-local-storage (see http://boost-sandbox.sourceforge.net/libs/statechart/doc/faq.html#Whats_so_…) It seems to me that state-local-storage, which I agree is generally cool, is particularly un-cool (and bug-inducing) in the presence of history transitions. I'm not sure what a good alternative is, but just thought I'd raise the discussion. cheers, mick PS: does the history facility display the same semantics in boost::statechart? I plan to move to statechart real soon now ...

4 19

BGL: INTERNAL COMPILER ERROR in VC7.1
by Yariv Tal 10 Jun '07

10 Jun '07

This one was already posted by Nicholas Burlett awhile back (see http://lists.boost.org/MailArchives/boost-users/msg06534.php) but I have some new info that may help. The problem: ========= When compiling code that uses the boost.graph library the VC7.1 compiler shouts: c:\boost_1_32_0\boost\mpl\aux_\preprocessed\plain\apply_wrap.hpp(48) : fatal error C1001: INTERNAL COMPILER ERROR As Nicholas already noted, this seems to be due to some compiler problem with the boost.graph out_edge_iterators since it is caused by the following lines in my code: (FilteredGraphGenerator::FilteredGraph is a typedef of a boost::filtered_graph) typedef boost::graph_traits<FilteredGraphGenerator::FilteredGraph> ::out_edge_iterator oedge_iterator; oedge_iterator edgesItr, edgesEnd; boost::tie(edgesItr, edgesEnd) = boost::out_edges(itr->first, m_g.m_filteredGraph); while (edgesItr != edgesEnd) { // do anything! } In fact, it seems to be related to the operator!= between iterators (if the while loop is commented out it compiles). How ever, the error persists even after changing the operator!= to operator== : while (edgesItr == edgesEnd) { // do anything! } ========================================================================== Some findings: =========== * We used to use boost_1_30_0 and the code used to compile PERFECTLY. The problem only appeared after migrating to boost_1_32_0. * Calling directly to the "equal" function in iterator_core_access instead of the operator== works. typedef boost::graph_traits<FilteredGraphGenerator::FilteredGraph> ::out_edge_iterator oedge_iterator; oedge_iterator edgesItr, edgesEnd; boost::tie(edgesItr, edgesEnd) = boost::out_edges(itr->first,m_g.m_filteredGraph); while (boost::iterator_core_access::equal(edgesItr, edgesEnd, boost::mpl::true_())) { // do somthing } * The error message location is at the mpl::apply_wrap2 function. Any relation to the mpl::apply2 function used for declaring the operator== in the BOOST_ITERATOR_FACADE_INTEROP_HEAD macro? Have these functions changed since v1.30.0?

9 8

[Threads] Conditions and avoiding lengthy mutex locks (background loading for a game)
by Peter Mackay 11 Mar '07

11 Mar '07

Hello, I'm trying to use the Boost Threads library to help me implement a background loading system for a game I'm writing. I want to enqueue load requests while the main game thread is running, and have a separate thread load the data and pass back the appropriate objects. Currently when I enqueue a new request, I notify a 'something to do' condition, which my loading thread waits on. The trouble is, when I notify it, the loader could be loading in the background, and has a lock on the mutex connected with the condition. Would anyone be able to offer me any advice on how to solve this? Many thanks, Peter P.S. Please find attached my current implementation. begin 666 loader.cpp M(VEN8VQU9&4@(FQO861E<BYH<' B#0H-"B-I;F-L=61E(#QB;V]S="]B:6YD M+FAP<#X-"@T*;&]A9&5R.CIL;V%D97(H*0T*.B!T:')E861?<VAO=6QD7V5X M:70H9F%L<V4I#0I[#0H)=&AR96%D+G)E<V5T*&YE=R!B;V]S=#HZ=&AR96%D M*&)O;W-T.CIB:6YD*"9L;V%D97(Z.G1H<F5A9%]P<F]C+"!T:&ES*2DI.PT* M?0T*#0IL;V%D97(Z.GYL;V%D97(H*0T*>PT*"2\O(%-I9VYA;"!T:&4@=&AR M96%D('1O(&5X:70N#0H)>PT*"0EB;V]S=#HZ;75T97(a)Z.G-C;W!E9%]L;V-K M(&QO8VLH;75T97(a)I.PT*"0ET:')E861?<VAO=6QD7V5X:70@/2!T<G5E.PT* M"0ES;VUE=&AI;F=?=&]?9&\N;F]T:69Y7V%L;"@I.PT*"7T-"@T*"2\O(%=A M:70@9F]R('1H92!T:')E860@=&\@97AI="X-"@ET:')E860M/FIO:6XH*3L- M"GT-"@T*=F]I9"!L;V%D97(Z.G1H<F5A9%]P<F]C*"D-"GL-"@DO+R!792=R M92!L;V-K960@=6YL97-S('=E)W)E('=A:71I;F<@9F]R('-O;65T:&EN9R!T M;R!D;RX-"@EB;V]S=#HZ;75T97@Z.G-C;W!E9%]L;V-K(&QO8VLH;75T97@I M.PT*#0H)+R\@4G5N('5N=&EL('=E)W)E('1O;&0@=&\@97AI="XN+@T*"69O M<B H.SLI#0H)>PT*"0DO+R!786ET('5N=&EL('=E(&=E="!S;VUE=&AI;F<@ M=&\@9&\N#0H)"7-O;65T:&EN9U]T;U]D;RYW86ET*&QO8VLI.PT*#0H)"2\O M(%-H;W5L9"!W92!E>&ET/PT*"0EI9B H=&AR96%D7W-H;W5L9%]E>&ET*0T* M"0E[#0H)"0DO+R!%>&ET('1H92!T:')E860N#0H)"0ER971U<FX[#0H)"7T- M"@T*"0DO+R!T;V1O.B!$;R!A;&P@<&5N9&EN9R!L;V%D<R!H97)E("AC;W5L C9"!B92!A(&QE;F=T:'D@;W!E<F%T:6]N*2X-"@E]#0I]#0H` ` end begin 666 loader.hpp M(VEF;F1E9B!,3T%$15)?2%!0#0HC9&5F:6YE($Q/041%4E](4% -"@T*(VEN M8VQU9&4@/'%U975E/@T*(VEN8VQU9&4@/&)O;W-T+W-H87)E9%]P='(N:'!P M/@T*(VEN8VQU9&4@/&)O;W-T+W1H<F5A9"]C;VYD:71I;VXN:'!P/@T*(VEN M8VQU9&4@/&)O;W-T+W1H<F5A9"]M=71E>"YH<' ^#0HC:6YC;'5D92 \8F]O M<W0O=&AR96%D+W1H<F5A9"YH<' ^#0H-"F-L87-S(&QO861E<B Z('!R:79A M=&4@8F]O<W0Z.FYO;F-O<'EA8FQE#0I[#0IP=6)L:6,Z#0H-"@EL;V%D97(H M*3L-"@EV:7)T=6%L('YL;V%D97(H*3L-"@T*<')I=F%T93H-"@T*"79O:60) M=&AR96%D7W!R;V,H*3L-"@T*"2\O($%C8V5S<VEB;&4@8GD@86YY('1H<F5A M9"X-"@EB;V]S=#HZ;75T97@)"6UU=&5X.PT*"6)O;W-T.CIC;VYD:71I;VX) M<V]M971H:6YG7W1O7V1O.PT*"6)O;VP)"0D)=&AR96%D7W-H;W5L9%]E>&ET M.PT*"7-T9#HZ<75E=64\:6YT/@D)<&5N9&EN9U]L;V%D<SL-"@T*"2\O($%C M8V5S<VEB;&4@8GD@=&AE(&UA:6X@=&AE860@;VYL>2X-"@EB;V]S=#HZ<VAA M<F5D7W!T<CQB;V]S=#HZ=&AR96%D/@ET:')E860[#0I].PT*#0HC96YD:68- !"@`` ` end

4 6

How can we serialize pointer of type base abstract class pointing to Derived concrete class
by Piyush Kapadia 18 Jan '07

18 Jan '07

We have a situation where there is BaseAbstract class and Derived concrete class. Interface requires that we pass BaseAbstractClassPointer, using which user can provide any of Derived Concrete class pointer and Interface remain generic to them. However serializing BaseAbstractPointer is throwing following error - *A unregistered class* How do we handle this situation ? #include <iostream> #include <fstream> #include <boost/archive/text_iarchive.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/xml_iarchive.hpp> #include <boost/archive/xml_oarchive.hpp> #include <boost/archive/binary_iarchive.hpp> #include <boost/archive/binary_oarchive.hpp> #include <boost/serialization/vector.hpp> #include <boost/serialization/map.hpp> #include <vector> #include <map> #include <boost/archive/archive_exception.hpp> #include <boost/archive/basic_xml_archive.hpp> class BaseAbstract { public : virtual void setRate(double rate) = 0; virtual double getRate(int) = 0; }; class DerivedConcrete : public BaseAbstract { std::vector<double> rateVec; friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & BOOST_SERIALIZATION_NVP(rateVec); } public: DerivedConcrete(double rate) {rateVec.push_back(rate);} DerivedConcrete(){} virtual ~DerivedConcrete(){} void setRate(double rate){ rateVec.push_back(rate); }; double getRate(int idx){ return rateVec[idx]; }; }; class AnyClass { friend class boost::serialization::access; BaseAbstract* rate; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & BOOST_SERIALIZATION_NVP(rate); } public: AnyClass(BaseAbstract* rateInput){ rate = rateInput; }; AnyClass() {}; setRate(BaseAbstract* rateInput){ rate = rateInput; }; }; int main(int argc, char* argv[]) { try { DerivedConcrete* fr = new DerivedConcrete(12.12); fr->setRate(14.5); AnyClass ac; ac.setRate(fr); std::ofstream ofs("AC.xml"); assert(ofs.good()); boost::archive::xml_oarchive oa(ofs); oa << BOOST_SERIALIZATION_NVP(ac); ofs.close(); } catch (boost::archive::xml_archive_exception ex) { std::cerr << " X " << ex.what() << std::endl; } catch (boost::archive::archive_exception ex) { std::cerr << " A " << ex.what() << std::endl; } catch (std::exception ex) { std::cerr << " E " << ex.what() << std::endl; } catch (...) { std::cerr << "Unknown Exception " << std::endl; } return 0; }

3 4

Re: [Boost-users] Visual C++ 2005 help installing Boost
by Harry Georgakopoulos 17 Jan '07

17 Jan '07

I am having exactly the same problem as a previous user. Could you please show me how you fixed your boost build? I'm getting the following errors ...failed updating 120 targets ...skipped 80 targets... ...updated 847 targets... I don't know how to open the vsvars32.bat file in order to change the paths that Mr Kozicki suggested. Any help would be greatly appreciated. I have installed the latest SDK. Also, how do i get rid of the warnings? I know i need to define _SCL_SECURE_NO_DEPRECATE globally, but how do i do that exactly? Finally, how do i know i have a correct build install? How do i test it? Thank you Please send your response to hgeorgako(a)hotmail.com harry g.

5 5

vertex descriptors
by Luis Quesada 18 Dec '06

18 Dec '06

Dear all, Sorry for the newbie question! Given the index of a vertex, how can I get its descriptor? I guess function vertex (page 225 of The Boost Graph Library) does that but the function is not defined. In fact, what I want to do is to check whether an edge belongs to a graph in a context where descriptors get invalidated after vertex removals? Suppose I have done this: // create a typedef for the Graph type typedef adjacency_list<vecS, vecS, bidirectionalS> Graph; // Make convenient labels for the vertices enum { A, B, C, D, E, N }; const int num_vertices = N; const char* name = "ABCDE"; // writing out the edges in the graph typedef std::pair<int, int> Edge; Edge edge_array[] = { Edge(A,B), Edge(A,D), Edge(C,A), Edge(D,C), Edge(C,E), Edge(B,D), Edge(D,E) }; const int num_edges = sizeof(edge_array)/sizeof(edge_array[0]); // declare a graph object Graph g(num_vertices); Then I remove some vertices. Now I want to check whether edge <A,B> is still there. Calling edge(A,B,g) would not be OK because the descriptors are no longer referring to the same vertices.... Thanks in advance for your answer, Luis

6 15

The fibonacci heap is behaving strange
by Magnus Ekdahl 15 Dec '06

15 Dec '06

Hi, I put in 0,1,2,3,4 into a Fibonacci heap, manipulate some and get 0,2,4,1,25 back. With the relaxed heap I get 0,2,4,1,3 back, which is as expected with my code. AFAIK this is due to a bug in the Fibonacci heap? Anyway here is code adopted from the cvs (fibonacci_heap.cpp) that reproduces the result on two different machines (intel/amd), where the programs are compiled using g++ 4.0.4. Any help in clearing out this confusing result is appreciated :) #include <iostream> #include <cstdlib> #include <vector> #include <boost/pending/Fibonacci_heap.hpp> #include <boost/pending/relaxed_heap.hpp> #include <boost/graph/graph_utility.hpp> #include <boost/pending/indirect_cmp.hpp> using namespace std; using namespace boost; int main(int argc, char *argv[]) { typedef indirect_cmp<unsigned*,std::less<unsigned> > ICmp; unsigned current; const unsigned N=5; vector<unsigned> w(N); ICmp cmp(&w[0], std::less<unsigned>()); Fibonacci_heap<unsigned, ICmp> Q(N, cmp); //relaxed_heap<unsigned, ICmp> Q(N, cmp); Q.push(0); current=Q.top(); cout << current << " "; Q.pop(); w[1]=180428938; Q.push(1); w[2]=84693088; Q.push(2); w[3]=168169277; Q.push(3); w[4]=171463691; Q.push(4); current = Q.top(); cout << current << " "; Q.pop(); w[3]=164976049; Q.update(3); w[4]=59651664; Q.update(4); current = Q.top(); cout << current << " "; Q.pop(); w[1]=71988538; Q.update(1); w[3]=118964142; Q.update(3); current = Q.top(); cout << current << " "; Q.pop(); w[3]=42423833; Q.update(3); current = Q.top(); cout << current << " "; Q.pop(); return EXIT_SUCCESS; }

4 5

[BGL] how to actually search with DFS/BFS?
by martin f krafft 22 Nov '06

22 Nov '06

This may seem like a silly question, but how does one actually search with DFS or BFS? Say I want to find the first node for which a predicate returns true in a BFS traversal starting at node N... The function signatures don't have a parameter for "criteria" or "predicate", so I guess it's up for a Visitor to implement such a check. What is not clear to me is how the visitor functions can break out of the search once a condition is true. Thanks, -- martin; (greetings from the heart of the sun.) \____ echo mailto: !#^."<*>"|tr "<*> mailto:" net@madduck invalid/expired pgp subkeys? use subkeys.pgp.net as keyserver! spamtraps: madduck.bogus(a)madduck.net "information superhighway" is just an anagram for "i'm on a huge wispy rhino fart".

9 12

Serialization problem on 64-bit Windows release
by Sigurd Saue 31 Oct '06

31 Oct '06

We've started to use boost serialization and I've run into problems with serialization of derived classes. The "funny" thing is that this happens only on 64-bit Windows release compiled with MS Visual 2005. The same code works fine on Linux 32/64 bit debug/release, on Windows 32-bit debug/release and on Windows 64-bit debug. But not Windows 64-bit release. We use boost version 1.33.1. Here's the code that causes problems (Parameter is the base class, ParamCollection is a vector of Parameters): template<class Archive> static void serialize(Archive & ar, ParamCollection & col, const unsigned int /*version*/) { ar.register_type(static_cast<FloatParameter*>(NULL)); ar.register_type(static_cast<IntParameter*>(NULL)); ar.register_type(static_cast<ChoiceParameter*>(NULL)); ar.register_type(static_cast<StringParameter*>(NULL)); ar.register_type(static_cast<BlobParameter*>(NULL)); ar & boost::serialization::base_object<std::vector<Parameter*> >(col); } When serializing the ParamCollection (serializing, not deserializing) an archive exception is thrown: unregistered class. I've tried to use both abstract and non-abstract base class without any success. I did some research in the boost code and found that the exception was thrown in polymorphic::save (oserializer.hpp) by the last condition (NULL == bpos_ptr). Any clues? Is there a workaround? Thanks, Sigurd

3 4

Converting epoch(long) to ptime in Boost.Date_Time
by gdprosch＠micron.com 23 Aug '06

23 Aug '06

I would like to convert epoch(long) time values to boost ptime and vice versa. On the surface this seems relatively easy but some of the functions needed are missing and there is an issue ensuring that the local time is properly applied. Has someone come up with an easy way to do this? I can convert to ptime like this... long epoch_in = 1140411002; // 2006-Feb-19 21:50:02 std::time_t stdtime ( epoch_in ); ptime = from_time_t( stdtime ); To convert from ptime back to epoch(long) there is no conversion provided the other way. I found some code the author supplied a few years ago here: http://lists.boost.org/MailArchives/boost-users/msg07254.php Unfortunately, the result does not correctly apply local time. The following code... std::time_t to_time_t(ptime t) { ptime start(gregorian::date(1970,1,1),time_duration(0,0,0)); return (t-start).total_seconds(); } ... produces a date with the value: 2006-Feb-20 04:50:02 and not 2006-Feb-19 21:50:02 (I am in US MST). I've played around with applying the local offset but I end up with a lot of lines of code that leave me wondering if there is a better way. It would be nice if it were simple like this (assuming local time adjustment is correctly applied)... long epoch_in = 1140411002; // 2006-Feb-19 21:50:02 ptime pt = from_epoch( epoch_in ); long epoch_out = to_epoch( pt ); Many thanks, > Greg Prosch > Micron Technology, Inc.

2 1

segfault and no segfault with 2 different boost versions.
by Thierry Dumont 22 Aug '06

22 Aug '06

I develop a C++ code which uses boost::threads * This code performs perfectly well with the boost library wich comes with Debian sarge (libboost-thread1.32.0 for thread library). But I want a more complete implementation of boost (I want to use property tree library). So I have installed and compiled boost_1_33_1. * Using this library, all the programs which use the thread library segfault (at thread-create). Where is the problem ? With the Debian sarge library, I compile with the options: -DBOOST_HAS_THREADS -D_REENTRANT -O2 -funroll-all-loops -fomit-frame-pointer Do I need to change something? Did I missed something when I installed boost_1_33_1? In both cases, g++ version is 3.3.5. -- Thierry Dumont. Institut Camille Jordan -- Mathematiques-- Univ. Lyon I,43 Bd du 11 Novembre 1918, 69622 - Villeurbanne Cedex - France. Thierry.Dumont(a)maply.univ-lyon1.fr web: http://maply.univ-lyon1.fr/~tdumont

2 1

Building boost for 64-bit on AIX
by Patrik Jonsson 17 Aug '06

17 Aug '06

Hi, I'm trying to build boost (1.32.0) on an IBM SP2 under AIX5, using the 64-bit ABI. This is troublesome. I do: bjam "-sTOOLS=gcc" "-sGXX=g++ -maix64 -pthread" --prefix=$HOME --libdir=$HOME/lib64-gcc --includedir=$HOME/include-gcc install But it doesn't work. I get loads of errors like: gcc-Link-action bin/boost/libs/date_time/build/libboost_date_time.so/gcc/debug/shared-linkable-true/libboost_date_time-gcc-d-1_32.so ld: 0711-738 ERROR: Input file bin/boost/libs/date_time/build/libboost_date_time.so/gcc/debug/shared-linkable-true/greg_month.o: XCOFF32 object files are not allowed in 64-bit mode. collect2: ld returned 8 exit status set -e LIBPATH=bin/boost/libs/date_time/build/libboost_date_time.so/gcc/debug/shared-linkable-true:$LIBPATH export LIBPATH "g++" -maix64 -pthread -g -fPIC -shared -o "bin/boost/libs/date_time/build/libboost_date_time.so/gcc/debug/shared-linkable-true/libboost_date_time-gcc-d-1_32.so" "bin/boost/libs/date_time/build/libboost_date_time.so/gcc/debug/shared-linkable-true/greg_month.o" "bin/boost/libs/date_time/build/libboost_date_time.so/gcc/debug/shared-linkable-true/greg_weekday.o" "bin/boost/libs/date_time/build/libboost_date_time.so/gcc/debug/shared-linkable-true/date_generators.o" ...failed gcc-Link-action bin/boost/libs/date_time/build/libboost_date_time.so/gcc/debug/shared-linkable-true/libboost_date_time-gcc-d-1_32.so... ...skipped <@boost!lib64-gcc>libboost_date_time-gcc-d-1_32.so for lack of <@boost!libs!date_time!build/libboost_date_time.so/gcc/debug/shared-linkable-true>libboost_date_time-gcc-d-1_32.so... It seems it's using -maix64 ok when trying to build the library, but not when compiling... Can anyone tell me what the proper way of building boost under these conditions are? Thanks, /Patrik Jonsson

5 16

[array] VC++ 7.1 bug and a proposed fix
by Johan Råde 08 Aug '06

08 Aug '06

The following code does not compile with VC++ 7.1 and Boost 1.33.1. I believe the code should compile, and that this is a VC++ 7.1 bug. ----------------------------------------------------- #include <boost/array.hpp> using boost::array; struct X { array<int,4> f() { return array<int,4>(); } }; template<class X, class T> void g(X& x, T (X::*h)()) {} void f() { X x; g(x, &X::f); } ------------------------------------------------------ When I compile the code I get the bizarre error message error C2664: 'g' : cannot convert parameter 2 from 'boost::array<T,N> (__thiscall X::* )(void)' to 'boost::array<T,N> (__thiscall X::* )(void)' with [T=int,N=4] and [T=int, N=4] Types pointed to are unrelated; conversion requires reinterpret_cast, C-style cast or function-style cast If I modify the array class by adding a non-templatized assignment operator, as follows, then the code does compile. --------------------------------------------------------- namespace boost { template<class T, std::size_t N> class array { ... array<T,N>& operator=(const array<T,N>& rhs) { std::copy(rhs.begin(), rhs.end(), begin()); return *this; } ... }; } ---------------------------------------------------------- So I propose that this assignment operator is added, as a VC++ 7.1 bug workaround, to the array class. I have contacted Nicolai Josuttis concerning this, and he told me he is not maintaining the array library anymore. --Johan Råde

6 33

shmem on multi-user machine
by Steven Wooding 07 Aug '06

07 Aug '06

Hi Ion, I've noticed that the "file" /dev/shmem/sem.boost_shmem_shm_global_mutex keeps hanging around after my program finishes. This file has write permission only for the user that created it. When different user comes along a runs another program that uses shmem, it seg faults on sem_wait(), probably due to the file permissions. Should this global mutex be cleaned up after use? Or could the permissions be changed somehow to let other use it (though probably not a good idea if user A and user B run a shmem based program at the same time). Thanks for your advice. Cheers, Steve.

4 7

boost-python Newbie tutorial needed.
by chun ping wang 06 Aug '06

06 Aug '06

Hmm k i have a simple question, how would I build boost.python given this following information. I am using dev-cpp and its install in "c:\dev-cpp" folder. IN it contains the mingw32 sub directory My project folder is "c:\cs classes\cs386\c++". In it contains FiniteAutomta.cpp which maps to python module... my boost folder is "C:\boost_1_33_1" in it contains the bjam.exe file. PYTHON_ROOT = "C:\python24" Thanks for the help. I look at the tutorial but is confused on how I can build my project.

3 2

tsp 2-approximation using triangle inequality
by Matyas W Egyhazy 04 Aug '06

04 Aug '06

Hello, I recently implemented an approximation for the traveling salesperson using the boost graph library. The interface as well as the implementation are not polished and they require improvement, mostly due to the work being part of a school homework assignment. If anyone is interested, I would like outside comments before spending (or wasting, if no one is interested) effort to fix it up. I have attached the .h,a driver .cpp, and a sample input file. The driver program will produce output files that are viewable in a neato dot renderer. I have tested this only on VC++ 2005 (8.0) although I cannot think of any specific reason why it would not compile on other compilers. The approximation algorithm runs in polynomial time and solves the TSP problem with the worst possible solution producing a path twice as long as the optimal solution. More information can be found regarding the algorithm/heuristic on page 1028 in "Introduction to Algorithms" by Cormen, Leiserson, Rivest, and Stein. A slightly different description can be found on Wikipedia: http://en.wikipedia.org/wiki/Traveling_salesperson_problem#Triangle_inequal… My implementation matches the Introduction to Algorithms description as I use a preorder walk of the MST without bothering to create an Euler tour. I believe the Euler tour part of the algorithm is only used to prove the limit on the length of the produced solution. Regards, Matt //tsp_2_approximation //Takes a sequence of simple_points and performs 2-approximation triangle inequality to //generate a solution for the traveling salesperson problem. //Outputs the graphs in dot format to passed ostream objects //Also returns the MST generated as part of the approximation and a predecessor map //for a tour #include <algorithm> #include <vector> #include <map> #include <string> #include <iostream> #include <complex> #include <boost/graph/graph_as_tree.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/prim_minimum_spanning_tree.hpp> #include <boost/graph/simple_point.hpp> #include <boost/graph/graphviz.hpp> #include <boost/graph/iteration_macros.hpp> #include <boost/graph/graph_traits.hpp> template<typename Pt> std::istream& operator >> (std::istream& is, const boost::simple_point<Pt>& p) { return is >> boost::lexical_cast<std::string>(p.x) >> std::string(", ") >> boost::lexical_cast<std::string>(p.y); } template<typename Pt> std::ostream& operator << (std::ostream& os, const boost::simple_point<Pt>& p) { return os << boost::lexical_cast<std::string>(p.x) << std::string(",") << boost::lexical_cast<std::string>(p.y) << "!"; } //g is returned as the MST //preds is the predecessor map for the TSP approximation tour //the PositionMap is a coordinate map of the vertices represented as simple_points //the ostreams are optional, if they are provided the dot graphs are printed to them template<typename Graph, typename PositionMap, typename PredecessorMap> void tsp_2_approximation(Graph& g, const PositionMap& pos, PredecessorMap preds, std::ostream& pts_out = std::ostream(), std::ostream& mst_out = std::ostream(), std::ostream& tour_out = std::ostream()) { using namespace boost; using namespace std; typedef graph_traits<Graph>::vertex_iterator VertexItr; typedef graph_traits<Graph> GraphTraits; typedef property_map<Graph, vertex_index_t>::type IndexMap; typedef graph_traits<Graph>::vertex_descriptor Vertex; typedef iterator_property_map<vector<Vertex>::iterator, property_map<Graph, vertex_index_t>::type> ParentMap; typedef graph_as_tree<Graph, ParentMap> Tree; typedef tree_traits<Tree>::node_descriptor Node; typedef graph_traits <Graph>::edge_descriptor Edge; typedef vector<simple_point<double> > PositionVec; typedef iterator_property_map<PositionVec::iterator, property_map<Graph, vertex_index_t>::type> PositionMap; int cnt(0); property_map<Graph, vertex_name_t>::type name_map(get(vertex_name, g)); //setup name map for the vertices IndexMap index(get(vertex_index, g)); for (pair<VertexItr, VertexItr> vp(vertices(g)); vp.first != vp.second; ++vp.first) { cnt++; name_map[*(vp.first)] = lexical_cast<string>(index[*(vp.first)]); } //print point layout to dot format if (pts_out) { dynamic_properties dp; dp.property("pos", pos); dp.property("id", get(vertex_name, g)); write_graphviz(pts_out, g, dp, string("id")); } property_map<Graph, edge_weight_t>::type weight_map(get(edge_weight, g)); graph_traits<Graph>::edge_iterator ei, ei_end; for (int q(0); q < cnt; ++q) { for (int i(q); i < cnt; ++i) { if (q != i) { //Calculate distance double weight(sqrt(pow(static_cast<double>(pos[q].x - pos[i].x), 2.0) + pow(static_cast<double>(pos[i].y - pos[q].y), 2.0))); graph_traits<Graph>::edge_descriptor e; bool inserted; tie(e, inserted) = add_edge(q, i, g); weight_map[e] = weight; } } } index = get(vertex_index, g); //extract the mst using prim's minimum spanning tree algorithm vector<Vertex> p(num_vertices(g)); prim_minimum_spanning_tree(g, &p[0]); Graph mst(cnt); vector<Vertex> parent(num_vertices(mst)); Tree t(mst, 0, make_iterator_property_map(parent.begin(), get(vertex_index, mst))); property_map<Graph, edge_weight_t>::type mst_weight_map(get(edge_weight, mst)); //build mst graph using the predecessor map from prim's mst algorithm for (tie(ei, ei_end) = edges(g); ei != ei_end; ++ei) { Edge e(*ei); Vertex u(source(e, g)); Vertex v(target(e, g)); if (p[v] == u || p[u] == v) { add_edge(u, v, mst); } } name_map = get(vertex_name, mst); for (tie(ei, ei_end) = edges(mst); ei != ei_end; ++ei) { Edge e(*ei); Vertex u(source(e, g)); Vertex v(target(e, g)); double weight(sqrt(pow(static_cast<double>(pos[u].x - pos[v].x), 2.0) + pow(static_cast<double>(pos[u].y - pos[v].y), 2.0))); mst_weight_map[e] = weight; preds[v] = u; name_map[u] = lexical_cast<string>(u); name_map[v] = lexical_cast<string>(v); } //print mst in dot format if (mst_out) { dynamic_properties dp; dp.property("pos", pos); dp.property("label", get(edge_weight, mst)); dp.property("id", get(vertex_name, mst)); write_graphviz(mst_out, mst, dp, string("id")); } //create tour using a preorder traversal of the mst property_map<Graph, edge_weight_t>::type tour_weight_map(get(edge_weight, mst)); PreorderTraverser<Node, Tree> vis; traverse_tree_ref(0, t, vis); const vector<Node>& v(vis.getPath()); Graph tour(cnt); //print out tour in dot format for (vector<Node>::const_iterator itr(v.begin()); itr != v.end() - 1; ++itr) { Node s(*itr); Node d(*(itr + 1)); add_edge(s, d, tour); } add_edge(*(v.end() - 1), *(v.begin()), tour); name_map = get(vertex_name, tour); for (tie(ei, ei_end) = edges(tour); ei != ei_end; ++ei) { Edge e(*ei); Vertex u(source(e, g)); Vertex v(target(e, g)); double weight(sqrt(pow(static_cast<double>(pos[u].x - pos[v].x), 2.0) + pow(static_cast<double>(pos[u].y - pos[v].y), 2.0))); tour_weight_map[e] = weight; name_map[u] = lexical_cast<string>(u); name_map[v] = lexical_cast<string>(v); } if (tour_out) { dynamic_properties dp; dp.property("pos", pos); dp.property("label", get(edge_weight, tour)); dp.property("id", get(vertex_name, tour)); write_graphviz(tour_out, tour, dp, string("id")); } g = mst; } //Recursive function that traverses a tree with a custom visttor template <class Tree, class TreeVisitor> void traverse_tree_ref(typename boost::tree_traits<Tree>::node_descriptor v, Tree& t, TreeVisitor& visitor) { visitor.preorder(v, t); typename boost::tree_traits<Tree>::children_iterator i, end; tie(i, end) = children(v, t); if (i != end) { traverse_tree_ref(*i++, t, visitor); visitor.inorder(v, t); while (i != end) { traverse_tree_ref(*i++, t, visitor); } } else { visitor.inorder(v, t); } visitor.postorder(v, t); } //Keeps track of a preorder traversal of a tree template<typename Node, typename Tree> class PreorderTraverser { private: std::vector<Node> path_; public: void preorder(Node n, Tree& t) { path_.push_back(n); } void inorder(Node n, Tree& t) {} void postorder(Node, Tree& t) {} const std::vector<Node>& getPath() { return path_; } }; //Main test harness for the tsp_2_approximation solution generator #include <iostream> #include <utility> #include <vector> #include <fstream> #include <boost/lexical_cast.hpp> #include "tsp_2_approximation.h" int main(int,char*[]) { using namespace boost; using namespace std; typedef adjacency_list<vecS, vecS, directedS, property <vertex_name_t, string>, property <edge_weight_t, double > > Graph; typedef vector<simple_point<double> > PositionVec; typedef iterator_property_map<PositionVec::iterator, property_map<Graph, vertex_index_t>::type> PositionMap; ifstream fin("graph.txt"); if (!fin) { cerr << "To run this program properly please place a file called graph.txt" << endl << "into the current working directory." << endl << "Each line of this file should be a coordinate specifying the" << endl << "location of a vertex" << endl << "For example: " << endl << "1,2" << endl << "20,4" << endl << "15,7" << endl << endl << "The output of the program will be three DOT formatted files in the" << endl << "current working directory: " << endl << "pts.dot - Only displays the points as described in graph.txt" << endl << "mst.dot - Displays an MST for the points in graph.txt" << endl << "tour.dot - Displays the TSP 2-approximation triangle inequality tour " << endl << "for the points in graph.txt" << endl << endl << "These files should be viewed with a 'neato'" << "DOT graph viewer" << endl << "as it can handle forced coordinates" << endl; return -1; } ofstream ptsOut("pts.dot"); ofstream mstOut("mst.dot"); ofstream tourOut("tour.dot"); string line; PositionVec position_vec; int n(0); while (getline(fin, line)) { simple_point<double> vertex; size_t idx(line.find(",")); string xStr(line.substr(0, idx)); string yStr(line.substr(idx + 1, line.size() - idx)); vertex.x = lexical_cast<double>(xStr); vertex.y = lexical_cast<double>(yStr); position_vec.push_back(vertex); n++; } fin.close(); Graph g(n); PositionMap pos(position_vec.begin(), get(vertex_index, g)); vector<graph_traits<Graph>::vertex_descriptor> preds(n); tsp_2_approximation(g, pos, &preds.front(), ptsOut, mstOut, tourOut); return 0; } 1,2 2,4 10,20 45,20 15,1 17,20 20,25 30,20

3 2

[Graph] float/double weights and brandes_betweenness_centrality
by Ioannis Filippis 03 Aug '06

03 Aug '06

Hi, I wonder whether float/double weights may cause a bug in brandes_betweenness_centrality. In the brandes_dijkstra_visitor, in the case where edge is not relaxed, there is an equality check if (d_w == combine(d_v, w_e)) in order to find if there is equally-short path from v to w. If d_w, d_v, w_e are float/doubles, isn't there gonna be a problem with the "=="? Thanks Ioannis

2 1

filtered graph with bundled properties
by moritz Hilger 03 Aug '06

03 Aug '06

hi, i hava a problem using bundled properties with filtered graph. i've modified the example from the filtered-graph page ( http://www.boost.org/libs/graph/doc/filtered_graph.html) to use edge properties and woul like to create a filter using these bundled properties, but am experiencing problems with the types of the property_map and/or filter. since i'm quite new to c++ and boost i would aprectiate any suggestin, thanks in advance i'm using gcc-3.3.5 and boost-1.34 moritz modified code: struct myEdge { int id; int weight; }; template <typename EdgeWeightMap> struct positive_edge_weight { positive_edge_weight() { } positive_edge_weight(EdgeWeightMap weight) : m_weight(weight) { } template <typename Edge> bool operator()(const Edge& e) const { return 0 < boost::get(m_weight, e); } EdgeWeightMap m_weight; }; int main() { using namespace boost; typedef adjacency_list<vecS, vecS, directedS, //no_property, property<edge_weight_t, int> > Graph; no_property, myEdge > Graph; typedef property_map<Graph, int myEdge::*>::type EdgeWeightMap; typedef graph_traits<Graph>::edge_iterator edge_iter_t; typedef filtered_graph<Graph,positive_edge_weight<EdgeWeightMap> > f_graph_t; typedef graph_traits<Graph>::edge_descriptor Edge; enum { A, B, C, D, E, N }; const char* name = "ABCDE"; Graph g(N); Edge e; bool ins; tie(e,ins)=add_edge(A, B, g); /.../ positive_edge_weight<EdgeWeightMap> filter(get(&myEdge::weight, g)); f_graph_t fg(g, filter); std::cout << "filtered edge set: "; print_edges(fg, name); std::cout << "filtered out-edges:" << std::endl; print_graph(fg, name); return 0; } g++ output: error: no matching function for call to ` boost::bundle_property_map<main()::Graph, boost::detail::edge_desc_impl<boost::directed_tag, size_t>, myEdge, int>:: bundle_property_map()' /homes/combi/Software/Boost/boost/graph/properties.hpp:330: error: candidates are: boost::bundle_property_map<main()::Graph, boost::detail::edge_desc_impl<boost::directed_tag, size_t>, myEdge, int>::bundle_property_map(const boost::bundle_property_map<main()::Graph, boost::detail::edge_desc_impl<boost::directed_tag, size_t>, myEdge, int>&) /homes/combi/Software/Boost/boost/graph/properties.hpp:336: error: boost::bundle_property_map<Graph, Descriptor, Bundle, T>::bundle_property_map(Graph*, T Bundle::*) [with Graph = main()::Graph, Descriptor = boost::detail::edge_desc_impl<boost::directed_tag, size_t>, Bundle = myEdge, T = int] -- /* ICQ 291996214 */ /* MSN moritz.hilger(a)gmail.com */ /* moe1234(a)jabber.ccc.de */ /* del.icio.us/new/moritz.hilger */

2 1

astar-cities.cpp internal compile error
by bringiton bringiton 03 Aug '06

03 Aug '06

Hi, I'm trying to compile the sample from astar-cities.cpp. I however get a INTERNAL COMPILER ERROR. I'm using ms vc++ 6. Can I assume the sample does not run on the old vc++ version? Anything I can do to get around this? Test5.cpp xxx\boost\random\lagged_fibonacci.hpp(81) : fatal error C1001: INTERNAL COMPILER ERROR (compiler file 'msc1.cpp', line 1794) Please choose the Technical Support command on the Visual C++ Help menu, or open the Technical Support help file for more information Generating Code... Error executing cl.exe. Test2.exe - 1 error(s), 1 warning(s)

3 2

[bgl documentation] corrections (?) and improvements to help new users
by David Baird 03 Aug '06

03 Aug '06

Hi! I'm a new user of the BGL. I've attached a couple patches to the BGL documentaion which I think will be very helpful to new users. For example, one of the websites, http://www.boost.org/libs/graph/doc/file_dependency_example.html seems to contain a simple, but confusing (for new users) error: Graph g(N, used_by, used_by + sizeof(used_by) / sizeof(Edge)); In boost-1.33.0, the correct line AFAICT is, Graph g(used_by, used_by + sizeof(used_by) / sizeof(Edge), N); I successfully tested the new instructions in the documentation (which the attached patches apply to) with boost-1.33.0 under Gentoo Linux. If this is the wrong list to post this, please direct me toward the correct place. -David

2 1

[BGL] traversing edges in the graph
by Alejandro Aragón 03 Aug '06

03 Aug '06

Hello, I'm working with undirected graphs and I was wondering if there is an algorithm that traverses all the edges in the graph in such a way that this task is optimized. That is, if you draw a graph with a pencil, the number of times that you should lift the tip of the pencil is minimized. Can anyone give me a hint on this? Thanks, Alex

2 1

[bgl] user defined vertex_descriptor?
by timblech 03 Aug '06

03 Aug '06

hi all, i'm curious, if it's possible to change the type, that a graph uses as vertex_descriptor... i went through the examples, where usually int values are used, which seems to be the default ... for my application, i'd like to use a class pointer as vertex_descriptor, though... the problem i had with property map is, that i was only able to look up a property by vertex_descriptor, but not the other way round... it's possibly only a problem caused by my limited knowledge of the bgl, but it would be very nice, if someone could enlighten me. thanks in advance ... tim -- View this message in context: http://www.nabble.com/-bgl--user-defined-vertex_descriptor--tf2008709.html#… Sent from the Boost - Users forum at Nabble.com.

2 1

help building shared library for lib/filesystem on RHEL4 with gcc 3.4.4
by William Deegan 03 Aug '06

03 Aug '06

Greetings, When I do the following: pushd libs/filesystem/build bjam "-sTOOLS=gcc" I only end up with the /boost-1.30.2/libs/filesystem/build/bin/libboost_filesystem.a/gcc/release/runtime-link-dynamic/libboost_filesystem.a Built and no .so What am I missing? Thanks, Bill

2 3

[test] how to use register_exception_translator with auto_test?
by Jörg Becker 03 Aug '06

03 Aug '06

How can I use the the register_exception_translater with the Auto unit test framework? With boost 1.31 / VC7.1 I wrote a dummy test only containing the register_exception_translator call. This works fine, but with boost 1.33 / gcc3.3 this workaround does not work. Any Suggestions? Jörg

3 6

Re: [Boost-users] [multi_index] illegal indirection compile error
by JOAQUIN LOPEZ MU?Z 01 Aug '06

01 Aug '06

----- Mensaje original ----- De: Themistoklis Bourdenas <themis(a)ics.forth.gr> Fecha: Lunes, Julio 31, 2006 4:47 pm Asunto: [Boost-users] [multi_index] illegal indirection compile error > Could you help me understand what I'm doing wrong in the code > below? I'm > trying to setup a multi_index structure of class B. > > class A > { > const std::string& ID(void) const; > ... > }; > > class B : public A > { > ... > }; > > typedef boost::multi_index::multi_index_container< > B*, > boost::multi_index::indexed_by< > boost::multi_index::ordered_unique< > boost::multi_index::const_mem_fun<A, const > std::string&, &A::ID> > > > > > > BSet; > > However when I compile VS2005 returns me an "illegal indirection" > compile error. Any thoughts? Hello Themistoklis, You've found a limitation in Boost.MultiIndex (as of Boost 1.33.1) by which one cannot specifiy a key in a given base class and pass derived classes as elements. This is solved in what will become Boost 1.34, please read bullet 3 of Boost.MultiIndex release notes at: http://boost- consulting.com/boost/libs/multi_index/doc/release_notes.html#boost_1_34 Until this release is out, you can use the following workarond: simply define a custom key extractor like this (warning, I haven't compiled it, beware typos): struct pB_ID_extractor { typedef std::string result_type; const std::string& operator()(const B* pb)const { return pb->ID(); } }; typedef boost::multi_index::multi_index_container< B*, boost::multi_index::indexed_by< boost::multi_index::ordered_unique< pB_ID_extractor > > > BSet; Does this help? Thank you for using Boost.MultiIndex, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

in_edges inconsitency
by Louis Lavery 01 Aug '06

01 Aug '06

p219 of the BGL book says that in_edges(...) is available for bidirectional graphs but that in_degree(...) is not. Shouldn't both or neither be available? Louis.

2 1

boost.program_options gives ./first: free(): invalid pointer with g++ 4.0.3 and 4.1.0
by William Lederer 01 Aug '06

01 Aug '06

In compiling and testing the 'first.cpp' program from the example directory of the program_options directory, the program fails with the message: *** glibc detected *** ./first: free(): invalid pointer: 0x00000000005104e8 *** I built g++ version 4.1.0 and received the same result. The hardware is AMD opteron 64 bit, the OS is Linux fedora core 4. I had upgraded the compiler earlier to 4.0.3, and all other compiles/execution work fine and also tried 4.1.0 gcc. Nonetheless, I cannot shake the notion that this might be related to the compiler. Are there any ideas regarding what I might try next? Thanks -- William Lederer <wgl(a)ciexinc.com> CIEX, Incorporated

2 1

Re: [Boost-users] performance of template expression
by Sohail Somani 01 Aug '06

01 Aug '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > divyank shukla > Sent: Monday, July 31, 2006 8:06 AM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] performance of template expression > > snip.... > > My question is does the performance penalty still > exist with g++(4.1) compilers as against boost::lambda > functions. Where are your performance results (hard numbers)? Have you measured them as compared to the rest of your algorithm? For example, if you do the general QR decomposition, chances are that's going to be the slow part. One should usually profile after coding, rather than optimizing prematurely. Generally it's the algorithm that is slow.

2 1

TR: [Serialisation] error with xml_iarchive
by Bruno Poinas 31 Jul '06

31 Jul '06

Hello, I just recently began using the boost library, I want to write and read string to serialized objects with the function 'xml_oarchive' and 'xml_iarchive'. When I execute this code (with visual c++.net v. 7.1) : std::ofstream ofs("C:\\Save.xml"); const wchar_t * ptr; ptr=m_strEdit.GetBuffer(); assert(ofs.good()); boost::archive::xml_oarchive oa(ofs); oa.save(ptr); wchar_t str[512]; std::ifstream ifs("C:\\Save.xml"); boost::archive::xml_iarchive ia(ifs,0); ia.load(str); ifs.close(); the programm failed : Thanks and regards, Bruno POINAS ActiCM S.A. 122, rue du Rocher de Lorzier - Centr'Alp - 38430 - MOIRANS

2 1

[multi_index] illegal indirection compile error
by Themistoklis Bourdenas 31 Jul '06

31 Jul '06

Could you help me understand what I'm doing wrong in the code below? I'm trying to setup a multi_index structure of class B. class A { const std::string& ID(void) const; ... }; class B : public A { ... }; typedef boost::multi_index::multi_index_container< B*, boost::multi_index::indexed_by< boost::multi_index::ordered_unique< boost::multi_index::const_mem_fun<A, const std::string&, &A::ID> > > > BSet; However when I compile VS2005 returns me an "illegal indirection" compile error. Any thoughts? Thanks

2 1

Implementing copy_if using boost::lambda
by Minkoo Seo 31 Jul '06

31 Jul '06

Hi list. I'm trying to implment copy_if using boost::lambda: #include <iostream> #include <string> #include <vector> #include <algorithm> #include <iterator> #include <map> #include <boost/lambda/lambda.hpp> #include <boost/lambda/if.hpp> #include <boost/format.hpp> #include <boost/lambda/bind.hpp> #include <boost/lambda/algorithm.hpp> using namespace std; using namespace boost::lambda; int main() { vector<int> vi; vi.push_back(1); vi.push_back(2); vi.push_back(3); vi.push_back(4); vi.push_back(5); vector<int> vi2; for_each(vi.begin(), vi.end(), if_then(_1 == 1, vi2.push_back(_1))); return EXIT_SUCCESS; } This fails with the errors: lambda_test.cpp: In function 'int main()': lambda_test.cpp:30: error: no matching function for call to 'std::vector<int, std::allocator<int> >::push_back(const boost::lambda::lambda_functor<boost::lambda::placeholder<1> >&)' /usr/lib/gcc/x86_64-redhat-linux/4.0.2/../../../../include/c++ ]/4.0.2/bits/stl_vector.h:602: note: candidates are: void std::vector<_Tp, _Alloc>::push_back(const _Tp&) [with _Tp = int, _Alloc = std::allocator<int>] Does anybody know how to push _1 into vi2? I've tried bind( ), but no luck. Sincerely, Minkoo Seo

2 1

boost::bind question
by Surya Kiran Gullapalli 31 Jul '06

31 Jul '06

Hi, I've a std::map with the following structure. std::map < int, tuple<std::string, std::string> > mapTuple ; typedef map < int, tuple<string, string> > mapTuple ; Now i've say 10 elements in this container. Now i'd like to iterate thru this container and find a specific element which matches a certain criteria. Right now I'm doing this. MapIntTuple::iterator iter ; for (iter = mymap.begin(); iter != mymap.end(); ++iter) { if (iter->second.get<0>() == current_field) break ; } I'd like to iterate thru the container and find the element whose first string in the tuple matches with my search string. How can i do this using boost::lamdba::bind and std::find_if. May be that will help me in understanding boost::bind better. iter = find_if (mymap.begin(), mymap.end(), ???) ; Thanks in advance, Surya

1 0

g++ warning: comparing floating point with == or != is unsafe
by cybernet＠interia.pl 31 Jul '06

31 Jul '06

In: /usr/include/boost/test/floating_point_comparison.hpp inside: template<typename FPT> inline FPT safe_fpt_division( FPT f1, FPT f2 ){ the warning is cause by the code: // Avoid underflow. if( f1 == static_cast<FPT>(0) || f2 > static_cast<FPT>(1) && f1 < f2 * (std::numeric_limits<FPT>::min)() ) return static_cast<FPT>(0); Could someone modify the code to allow it to compile without warnings on g++? Latest CVS version still has this problem. I'm too dumb to think of a reasonable patch to submit - sorry. ---------------------------------------------------------------------- PS. Fajny portal... >>> http://link.interia.pl/f196a

4 4

FW: BOOST_CHECK vs. BOST_CHECK_EQUAL, checking equality of wchar_ts
by Tan Zhi 31 Jul '06

31 Jul '06

According to the document, BOOST_CHECK is the same as BOST_CHECK_EQUAL. However,I found an exception. Which is listed below, where m_mmf.SetLngGetString(1033, 1) returns a const wchar_t* type. Interestingly, the first two tests fail, while the last two pass. BOOST_CHECK(L"A" == m_mmf.SetLngGetString(1033, 1)); BOOST_CHECK(m_mmf.SetLngGetString(1033, 1) == L"A" ); BOOST_CHECK_EQUAL(L"A", m_mmf.SetLngGetString(1033, 1)); BOOST_CHECK_EQUAL(m_mmf.SetLngGetString(1033, 1), L"A"); Can any one please help to explain it? Thanks

3 4

Problems Building Boost 1.33.1 on Ubuntu 5.10 x86 From Scratch
by kfjethro 30 Jul '06

30 Jul '06

I know that there are probably packages available for this platform but for several reasons I need to build Boost 1.33.1 from scratch. I have no problems with compiliing from scratch on Ubuntu 6.06. After unpacking the source files and placing the precompiled bjam executable in the boost source directory, I run the following: cd ./boost_1_33_1 ./bjam -sTOOLS=gcc –-prefix=/usr/local/boost-1.33.1 install My /usr/local/boost-1.33.1 is owned by me and writeable. Any suggestions ? Thanks. The truncated bjam output is : Building Boost.Regex with the optional Unicode/ICU support disabled. Please refer to the Boost.Regex documentation for more information (and if you don't know what ICU is then you probably don't need it). --------------------------------------------------------------------- *** If you don't need Boost.Python, you can ignore this section *** *** pass --without-python to suppress this message in the future *** skipping Boost.Python library build due to missing or incorrect configuration couldn't find Python.h in "/usr/include/python2.4" You can configure the location of your python installation by setting: PYTHON_VERSION - The 2-part python Major.Minor version number (e.g. "2.2", NOT "2.2.1") - currently "2.4" PYTHON_ROOT - currently "/usr" The following are automatically configured from PYTHON_ROOT if not otherwise set: PYTHON_LIB_PATH - path to Python library object; currently "/usr/lib/python2.4/config" PYTHON_INCLUDES - path to Python #include directories; currently "/usr/include/python2.4" --------------------------------------------------------------------- Jamfile:278: in load-jamfiles *** argument error * rule stage ( name : sources + : requirements * : local-build * ) * called with: ( : /home/lawrence/boost_1_33_1/boost/compatibility/cpp_c_headers/cwchar /home/lawrence/boost_1_33_1/boost/compatibility/cpp_c_headers/csignal /home/lawrence/boost_1_33_1/boost/compatibility/cpp_c_headers/climits /home/lawrence/boost_1_33_1/boost/compatibility/cpp_c_headers/cfloat /home/lawrence/boost_1_33_1/b <<<< middle truncated >>>>>> r_traits.hpp /home/lawrence/boost_1_33_1/boost/pending/bucket_sorter.hpp /home/lawrence/boost_1_33_1/boost/pending/fibonacci_heap.hpp /home/lawrence/boost_1_33_1/boost/pending/iterator_tests.hpp /home/lawrence/boost_1_33_1/boost/pending/detail/int_iterator.hpp /home/lawrence/boost_1_33_1/boost/pending/detail/property.hpp /home/lawrence/boost_1_33_1/boost/pending/detail/disjoint_sets.hpp : <locate>/usr/local <tree-subdirs>/home/lawrence/boost_1_33_1 <target>install : ) * missing argument name /home/lawrence/boost_1_33_1/tools/build/v1/boost-base.jam:2330:see definition of rule 'stage' being called /home/lawrence/boost_1_33_1/tools/build/v1/bootstrap.jam:21: in boost-build /home/lawrence/boost_1_33_1/boost-build.jam:16: in module scope

3 3

basic_string literals
by Johan Råde 30 Jul '06

30 Jul '06

Does Boost offer any facility for declaring basic_string literals in templates, i.e. something like basic_string<CharType> s = BOOST_STRING("foo"); Thank you, Johan Råde

4 6

Re: [Boost-users] g++ warning: comparing floating point with == or!= is unsafe
by Nat Goodspeed 30 Jul '06

30 Jul '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] On Behalf Of David Abrahams > Sent: Saturday, July 29, 2006 5:15 PM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] g++ warning: comparing floating point with == > or!= is unsafe > > > the warning is cause by the code: > > > > // Avoid underflow. > > if( f1 == static_cast<FPT>(0) || > > f2 > static_cast<FPT>(1) && f1 < f2 * > > (std::numeric_limits<FPT>::min)() ) > > return static_cast<FPT>(0); > > > > Could someone modify the code to allow it to compile without warnings on > > g++? > > Try replacing > > f1 == static_cast<FPT>(0) > > with > > f1 [Nat] Maybe (! f1) instead?

1 0

boost::bind question / bug(?)
by Michael Nicolella 30 Jul '06

30 Jul '06

Having trouble compiling this code. Only tested in VC8: Removing 'const' from only the static class function seems to allow it to compile. Below is the error messages... #include <boost/bind.hpp> #include <boost/function.hpp> struct A { static void foo( const int ) { } }; void bar( const int ) { } int main() { boost::bind( &A::foo, _1 ) ; boost::bind( &bar, _1 ) ; } ------------- 1>------ Rebuild All started: Project: test_vc8, Configuration: Debug Win32 ------ 1>Deleting intermediate and output files for project 'test_vc8', configuration 'Debug|Win32' 1>Compiling... 1>main6.cpp 1>c:\projects\test_vc8\test_vc8\main6.cpp(17) : error C2665: 'boost::bind' : none of the 2 overloads could convert all the argument types 1> c:\projects\boost\boost\bind.hpp(1400): could be 'boost::_bi::bind_t<R,F,L> boost::bind<void(*)(int),boost::arg<I>>(F,A1)' 1> with 1> [ 1> R=boost::_bi::unspecified, 1> F=void (*)(int), 1> L=boost::_bi::list1<boost::arg<1>>, 1> I=1, 1> A1=boost::arg<1> 1> ] 1> c:\projects\boost\boost\bind\bind_cc.hpp(26): or 'boost::_bi::bind_t<R,F,L> boost::bind<void,int,boost::arg<I>>(R (*)(B1),A1)' 1> with 1> [ 1> R=void, 1> F=void (*)(int), 1> L=boost::_bi::list1<boost::arg<1>>, 1> I=1, 1> B1=int, 1> A1=boost::arg<1> 1> ] 1> while trying to match the argument list '(void (*)(const int), boost::arg<I>)' 1> with 1> [ 1> I=1 1> ] 1>Build log was saved at "file://c:\projects\test_vc8\test_vc8\Debug\BuildLog.htm" 1>test_vc8 - 1 error(s), 0 warning(s) ========== Rebuild All: 0 succeeded, 1 failed, 0 skipped ==========

3 2

seeking a better way of regex replacing!
by llwaeva＠21cn.com 30 Jul '06

30 Jul '06

Hi there, boost:regex is powerful in string replacing. I am working with a complicate case which need a faster method in replacing substring. Here is my problem. I have a big string contains some pattern %K{xxx}, where xxx is a filename which may vary from place to place. e.g. BIG_STRING = ... ... %K{abc.txt} ... ... ... ... %K{foo.ini} ... ... OK, what complicated is that: I must retrieve the filename from %K{xxx}, load the content of the file and then replace %K{xxx} with the content. I search the code with a loop string::const_iterator start, end; string filename, content; boost::regex re("%K\\{(.*)\\}"); boost::match_results<std::string::const_iterator> what; boost::match_flag_type flags = boost::match_default; start = BIG_STRING.begin(); end = BIG_STRING.end(); while ( regex_search(start, end, what, re, flags) ) { if (what[1].first!=what[1].second) { filename = string(what[1].first, what[1].second); } content = LoadFile(filename); // transform the const_iterator to iterator string::iterator sbegin(BIG_STRING.begin()), send(BIG_STRING.begin()); std::advance(sbegin, distance<string::const_iterator>(sbegin, what[0].first)); std::advance(send, distance<string::const_iterator>(send, what[0].second)); // replace the content BIG_STRING.replace( sbegin, send, content ); // reset the current position of the source string to search the next pattern start = what[1].second; // I copy the code from the document of boost, don't know what the following code for flags |= boost::match_prev_avail; flags |= boost::match_not_bob; } The second approach is to retrieve the filename and load the content seperately, build the substitute format and replace all the patterns with replace_all_regex, e.g. string& escape_format( string& input ) { replace_all( input, "$", "$$" ); replace_all( input, "\\", "\\\\" ); replace_all( input, ":", "\\:" ); replace_all( input, "?", "\\?" ); replace_all( input, "(", "\$" ); replace_all( input, ")", "\$" ); return input; } stringstream reformat; string regex_text; int n=0; while ( regex_search(start, end, what, re, flags) ) { if (what[1].first!=what[1].second) { filename = string(what[1].first, what[1].second); } content = LoadFile(filename); regex_text += string(what[0].first, what[0].second); reformat << "(?" << ++n << " " << escape_format( content ) << ")"; // reset the current position of the source string to search the next pattern start = what[1].second; // I copy the code from the document of boost, don't know what the following code for flags |= boost::match_prev_avail; flags |= boost::match_not_bob; } // replace the whole string at last replace_all_regex( BIG_STRING, boost::regex(regex_text), reformat.str(), format_all ); But this approach cause exception!!! Any better idea for my problem? Thanks in advance.

2 1

BOOST_CHECK problem!
by 袁晓辉 30 Jul '06

30 Jul '06

The doc says "It(BOOST_CHECK) also increments an error count<http://www.boost.org/libs/test/doc/components/minimal_testing/index.html>", but it seems not: #include <boost/test/included/unit_test_framework.hpp> using boost::unit_test::test_suite; void test1() { BOOST_CHECK(false); } test_suite* init_unit_test_suite( int, char* [] ) { test_suite* test= BOOST_TEST_SUITE( "Unit test ); test->add( BOOST_TEST_CASE( &test1), 1); return test; } Output: ----------------------------------------------------- Running 1 test case... xxx.cpp(171): error in "test1": check false failed *** No errors detected ----------------------------------------------------- ps. I am using boost-1_33_1.

2 4

replace_all_regex help
by llwaeva＠21cn.com 30 Jul '06

30 Jul '06

Hi there, I wrote a piece of code to handle MIME header based on boost. The program subsitite the MIME header (from, to, subject, etc.) into a template with specific macro. Because the macro may occur everywhere in the template once or more, so I apply replace_all_regex. First of all, I need to transform the substitute string to escape special characters // input is a substitute string that will replace the macro string& escape_format( string& input ) { replace_all( input, "$", "$$" ); replace_all( input, "\\", "\\\\" ); replace_all( input, ":", "\\:" ); replace_all( input, "?", "\\?" ); replace_all( input, "(", "\$" ); replace_all( input, ")", "\$" ); return input; } There are some macros definied, some of them are listed below %s represents the subject (e.g. Re: hi philip!) %S represents the subject without prefix "Re:" (e.g hi philip!) %f represents the "form" (e.g. tom(a)hotmail.com) %t represents the "to" (e.g. philip(a)hotmail.com) ... With regex, I can replace all the macros with the help of format, something like replace_all_regex( source, boost::regex("(%f)|(%t)|(%s)|(%S)"), "(?1 xxx)(?2 yyy)(?3 aaa)(?4 bbb)", format_all ); In order to get the subject without prefix "Re:", I use erase_regex as follow string& deRe(string& input) { boost::regex regexp("^[[:space:]]*Re:[[:space:]]*"); erase_regex( input, regexp ); return input; } So simple!!! However, the order and number of macro will be changed sometimes. So I need a better way to build regex and format. I've got a function to do that // rformat is a stringstream for building a format // text is a substitute string // re_text is a string for building a regular expression // re is a string or regular expression, i.e. the macro // format_num is an global integer to hold the current number of format items (initialize to zero) void format_text(stringstream& rformat, string& text, string& re_text, const string& re) { format_num++; rformat << "(?" << format_num << " " << escape_format(text) << ")"; if (format_num>1) re_text += "|"; re_text += "(" + re + ")"; } Now, it's ready to build the regular expression and subsitiude formation dynamically. Here is an example, string regex_text; stringstream reformat; string source; // source is a string containing text and macros // spHeader is char* which is obtained from MIME parser. // if (spHeader) { format_text( reformat, string(spHeader), regex_text, "%s" ); // for %s format_text( reformat, deRe(string(spHeader)), regex_text, "%S" ); // for %S // Suppose spHeader is "Re: hi philp!", then // regex_text = "(%s)|(%S)" // reformat.str() = "(?1 Re: hi philip!)(?2 hi philip!)" replace_all_regex( source, boost::regex(regex_text), reformat.str(), format_all ); } Everything is fine except that there are some meaningless characters at the end of the output string (still source). By checking the code carefully, I found that the problem maybe caused by the format_text for %S. Hiding the second format_text solve the problem. However, just hiding the first format_text also solve the problem. It is confusing me! Someone please give me a direction. Thanks.

1 0

[Regex]Converting from old style to new style
by John Grabner 29 Jul '06

29 Jul '06

I used to be able to write this : void LineTracker::Analyse(const std::string &Buffer) { std::string::const_iterator start, end; start = Buffer.begin(); end = Buffer.end(); boost::regex_grep(std::bind1st(std::mem_fun(&LineTracker::grep_callback), this), start, end, expression); } to get the regex to call back into my class. With the change to the new style using iterator I can do this. void LineTracker::Analyse(const std::string &Buffer) { boost::sregex_iterator m1(Buffer.begin(), Buffer.end(), expression); boost::sregex_iterator m2; std::for_each(m1, m2, *this); } However for_each makes a copy of my class, so at the end it does not update the current instance with the results. What do I need to do to have the the current instance receive the call back from regex? John.

3 2

Re: [Boost-users] Problem with boost::multi_index
by JOAQUIN LOPEZ MU?Z 29 Jul '06

29 Jul '06

René ha escrito: > Joaquín ha escrito: > > * What happens if you fully qualify mem_fun, i.e. if > you write ::boost::multi_index::mem_fun? > > Well, when I tried this option it worked! > > It looks like gcc missed the "using boost::multi_index" > declaration. > > In order to gain experience: If you have any idea what > was the problem it will be appreciated. Not really :( Maybe the compiler gets confused by the presence of the template function std::mem_fun (does your "Item.h" explicitly or implicitly include <functional>?), but this is only a wild guess. In any case, this is a compiler bug, likely to solve if you upgrade your GCC copy. Sorry I can't give a more conclusive answer. > Thanks again. > > René Good luck with your project, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

[mpl] Collapsing sequences of integer constants
by Eric Lemings 29 Jul '06

29 Jul '06

Greetings, I'm trying to come up with an algorithm that will "collapse" a sequence of integer constants by adding like elements together. For example, typedef vector_c< int, 1,1,1,3,5,5,7,10,10 > input; would become: typedef vector_c< int, 3, 3, 10, 7, 20 > result; You can assume the sequence is already sorted. Would appreciate any tips. Thanks, Eric.

2 1

Re: [Boost-users] Problem with boost::multi_index
by JOAQUIN LOPEZ MU?Z 28 Jul '06

28 Jul '06

Rene Tarantino wrote: > Hi : > > I'm just starting to use boost utility library and it > seems very promising. I am trying to define a new > multi_index type and gcc it's giving me error messages. > > First I properly added the includes for boost::multi_index : > > #include <boost/multi_index_container.hpp> > #include <boost/multi_index/mem_fun.hpp> > #include <boost/multi_index/hashed_index.hpp> > > then the includes for "Item" and "ObjectId" declarations: > > #include "Item.h" > > following that appears this: > > typedef multi_index_container< > Item*, > indexed_by< > hashed_unique<mem_fun<Item, ObjectId, &Item::getId> > > > > > ItemsContainer; > > When I try to compile this code gcc reports the following errors: > > error: 'mem_fun' was not declared in this scope > error: template argument 1 is invalid > error: type/value mismatch at argument 3 in template parameter > list for 'template<class Arg1, class Arg2, class Arg3, class Arg4> > struct boost::multi_index::hashed_unique' > error: expected a type, got '&emedia::lumiere::Item::getId' > error: template argument 1 is invalid > error: template argument 2 is invalid > error: expected unqualified-id before '>' token > > It seems that I'm forgetting something. It's very strange because > all ready compilled this code in another project but I can't find > any difference with this one. Hello René, I really can't reproduce the problem you describe. The attached file tries to mimic your scenario (with a dummy Item definition) and here everything works OK. Could you please try it in your environment? I guess the problem is not in what you describe, but in what you don't, I mean, sorrounding details that you're taking for granted. Things to check: * Are you using some using directive? Which one? * Are you doing some funny thing with the "mem_fun" identifier inside "Item.h"? * What happens if you fully qualify mem_fun, i.e. if you write ::boost::multi_index::mem_fun? I hope some of the above rings a bell for you. Please report back. Best, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

Problem with boost::multi_index
by Rene Tarantino 28 Jul '06

28 Jul '06

Hi : I'm just starting to use boost utility library and it seems very promising. I am trying to define a new multi_index type and gcc it's giving me error messages. First I properly added the includes for boost::multi_index : #include <boost/multi_index_container.hpp> #include <boost/multi_index/mem_fun.hpp> #include <boost/multi_index/hashed_index.hpp> then the includes for "Item" and "ObjectId" declarations: #include "Item.h" following that appears this: typedef multi_index_container< Item*, indexed_by< hashed_unique<mem_fun<Item, ObjectId, &Item::getId> > > > ItemsContainer; When I try to compile this code gcc reports the following errors: error: 'mem_fun' was not declared in this scope error: template argument 1 is invalid error: type/value mismatch at argument 3 in template parameter list for 'template<class Arg1, class Arg2, class Arg3, class Arg4> struct boost::multi_index::hashed_unique' error: expected a type, got '&emedia::lumiere::Item::getId' error: template argument 1 is invalid error: template argument 2 is invalid error: expected unqualified-id before '>' token It seems that I'm forgetting something. It's very strange because I all ready compilled this code in another project but I can't find any difference with this one. Any idea. Thanks in advance. René

1 0

[license] Why is the Boost license not an official Open Source license?
by Stephen Toledo-Brown 28 Jul '06

28 Jul '06

I'm wondering why the Boost license is not listed at http://www.opensource.org/licenses/index.html (And is there any idea to submit it for inclusion there?)

7 10

Question about program_options
by Drumheller, Michael 28 Jul '06

28 Jul '06

Regarding boost::program_options: I would like to parse (and then store) some command-line options that potentially contain unregistered flags, and I understand from <<http://www.boost.org/doc/html/program_options/howto.html#id2716386>> that the way to do this is: basic_command_line_parser<char> parser(argc, argv); basic_parsed_options<char> parsed(parser.options(options).allow_unregistered().run()); Indeed this works--for parsing. But how do I store the resulting parsed options (in a way that ignores the unregistered ones)? Simply calling store(parsed, vm); throws a boost::program_options::unknown_option exception. I can take the (brute force) step of erasing from parsed.options all elements for which the unregistered attribute is true, and then calling store(parsed, vm). That seems to work, but it so clumsy that it makes me think I'm using the system in a way that was not intended. Can anyone help? Thank you. MD P.S. There is a bug in the doc: "collect_arguments(...)" on the last line of the above link should be collect_unrecognized(...); similarly, in the source code parsers.hpp (line 158) there is a mention of the nonexistent function "collect_unregistered"). Michael Drumheller Boeing Phantom Works Mathematics and Engineering Analysis 425.865.3520 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.

1 1

(de)serializing map<const A*>
by Cheok Yan Cheng 28 Jul '06

28 Jul '06

By refering to message http://groups.google.com/group/boost-list/browse_frm/thread/79dba906901d039… I am also facing similar problem. I need to iterate through the content of map, and remove the constantness before deserialization. Due to this, I need to save the map size into disk as well. I know that there is no obvious fix for this. However, I was wondering whether is there any much better workaround? Thank you very much! yccheok

2 1

Re: [Boost-users] XML Serialization Traits Question
by William Bardon 28 Jul '06

28 Jul '06

Robert, I forced a crude solution by defining a custom XML output archive and defining My_Archive::save_override(const nvp<T>&, int) as below. This would double the class information in some objects, so I also set the BOOST_CLASS_IMPLEMENTATION to object_serializable for my serialized classes. It is crude, but seems to give me the results I need. class My_Archive : public boost::archive::xml_oarchive_impl<OArchive_Versioned> { ... template<class T> void save_override( #ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING const #endif ::boost::serialization::nvp<T> & t, int) { save_start(t.name()); if (boost::serialization::implementation_level<T>::value >= boost::serialization::object_serializable) { write_attribute("version", boost::serialization::version<T>::value, "=\""); } boost::archive::save(* this->This(), t.const_value()); save_end(t.name()); } // redeclared fall thru versions of all specialized versions of save_override omitted for space }; By examining the library's source code, I have determined that the tracking of class traits in serialization occurs in basic_oarchive_impl::save_object, defined in basic_oarchive.cpp. It uses the class cobject_type to track classes it has seen. Because basic_archive_impl and cobject_type are completely defined within basic_archive.cpp, the ability to customize XML attributes is limited. Perhaps future versions of Serialization could look into making the XML optionally generate an XML schema for interoperation with other XML-based applications. Thanks, Bill -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Robert Ramey Sent: Wednesday, July 26, 2006 5:57 PM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] XML Serialization Traits Question I would have to go back and study the code again to give a good answer and I'm not up to this right now. But I can offer a suggestion in the short term. I use VC 7.1 debugger. Set a trap at save_override(const version ... When the program traps in the debugger. examine the stack trace to see the chain of overrides and specializations whch got you there. Robert Ramey William Bardon wrote: > Robert, > > Thanks for the example; it helped clear up some uncertainty about the > template arguments in the derived class. > > Regarding save_override, I see where specialized versions for the > different trait types are defined in basic_xml_oarchive.ipp. I also > see that save_override is called from the operator<< redefinition in > interface_oarchive.hpp. What I'm missing is the link between > serializing a user-defined class object and the traits of that object. > > template<class Archive> > BOOST_ARCHIVE_OR_WARCHIVE_DECL(void) > basic_xml_oarchive<Archive>::save_override(const version_type & t, > int) { > int i = t.t; // extra .t is for borland > write_attribute(VERSION(), i); > } > > This function already displays a version attribute in the XML. How do > I make sure this is called for every element? I'm sorry, but I can't > figure out how to modify chain of control to force output of class > traits. > > Starting in oserializer.hpp, boost::archive::save<Archive,T> calls > static save_non_pointer_type<Archive, T>::invoke calls serialize_adl > calls boost::serialization::serialize<Archive, T> calls > access::serialize calls myClass::serialize<Archive> (Archive& ar, > unsigned int version) > > There is also a function oserializer<Archive,T>::save_object_data that > calls serialize_adl, but I can't find anything that calls it. > > The struct save_non_pointer_type<Archive, T> in oserializer.hpp may be > the key, but I'm not sure how it works. > > In oserializer.hpp, struct > save_non_pointer_type<Archive,T>::save_standard::invoke calls > Archive::save_object, but I do not see an implementation of the > function anywhere: > > $ find /usr/include/boost -type f -exec grep -H save_object {} \;| > grep -v save_object_ | more > /usr/include/boost/archive/polymorphic_oarchive.hpp: virtual void > save_object( > /usr/include/boost/archive/detail/oserializer.hpp: > ar.save_object(& t, oserializer<Archive, T>::instantiate()); > /usr/include/boost/archive/detail/basic_oarchive.hpp: void > save_object( > /usr/include/boost/archive/detail/polymorphic_oarchive_impl.hpp: > virtual void save_object( > /usr/include/boost/archive/detail/polymorphic_oarchive_impl.hpp: > ArchiveImplementation::save_object(x, bos); > > I'd appreciate any suggestions. Am I even looking in the right place? > > Thanks in advance, > Bill > > -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Robert Ramey > Sent: Wednesday, July 26, 2006 12:14 PM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] XML Serialization Traits Question > > > "William Bardon" <wbardon(a)cabcds.org> wrote in message > news:C73E689C9FCF884B9A550ECFADA0721C087D3E@exchange.cab-cds.org... > I have read both the Boost Serialization online documentation and the > archives of the Boost-Users mailing list looking for guidance, but I > haven't found anything relevant. I see how to use > BOOST_CLASS_TRACKING and BOOST_CLASS_IMPLEMENTATION to remove version > tracking attributes from the XML tags. > > Usage of these macros does a lot more than remove attributes from the > tags. > > I want to go in the opposite direction. I notice that the class_id > and version attributes only appear the first time an object of a > particular class is serialized. I want to force the version attribute > to appear in every object's attribute list. > > Do I need to derive a custom archive to do this? > > yes > > I have looked at the source code for serialization, but I have trouble > plowing through all of the macros, template expansions, and overloaded > functions to locate the specific part that controls whether class > traits are stored as attributes in a particular XML tag. > > I sympathize - its hard to follow. And I wrote it. Here are some > hints: > > a) look at demo_fast_archive.cpp to see a model of how one can derive > from an existing archive. > b) You'll want to derive from xml_oarchive_impl<...> to create > my_xml_oarchive > c) add a "save_override" function to my_xml_oarchive which replaces > the "save_override" function in > basic_xml_oarchive.ipp. Implement this using functions defined > basic_xml_oarchive.ipp > > Good luck - > > Robert Ramey > > > Thanks in advance, > Bill > > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users > > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

regex problem in multithreading...
by yogendra karki 28 Jul '06

28 Jul '06

Hello all, i am using boost regex to check the syntax of a URL. the regex is as :- static const char *URLSYNTAXREGEX = "^((file|https?|ftp)://)?(([-a-zA-Z0-9_]+[.]{1})+(([-a-zA-Z0-9]+))([:]{1}([0-9]+)){0,1})([?/][^[:space:]]*)?" the function for evaluation is:- bool URLHandler::EvaluateRegex(const char *regularexp,std::string url){ boost::smatch what; boost::regex exp(regularexp,boost::regex::extended); boost::regex_search(url,what,exp); std::string search=(std::string)what[0]; if(search.length() == url.length()) { return true; } else { return false; } } when i am running this code with single thread it is running fine. But when i am integrating this code with a multithreaded application it is giving this error:- terminate called after throwing an instance of 'boost::regex_error' what(): Invalid content of repeat range Aborted Can you please help me in this. Its very urgent for me. Thanks. Yogendra --------------------------------- Do you Yahoo!? Everyone is raving about the all-new Yahoo! Mail Beta.

2 3

regular expression for random word wrap to multiple line
by Winson Yung 28 Jul '06

28 Jul '06

Hi all, I am not sure this is an old topic or not, but I cannot seem to find an answer for this. I have a table, because of the table column width restriction, some of the line in a table row/field gets wrapped around to second/third lines. Here is a simple illustrated the issue: sales and marketing (excludes stock-based compensation of $817, $369 and $113 for 2005, 2004 AND 2003, RESPECTIVELY) 74,823 36,000 21,162 As you can see the description txt gets break down into three lines. If I write something like this "^sales and marketing (excludes stock-based compensation of", it's not gonna capture the entire line that ended with numbers. The exact location where the line gets wrapped around is not known, so it's impossible to craft the regular expression like this beforehand. Is there a way to write *ONE* regular expression to handle this? /Winson.

2 3

Re: [Boost-users] default copy constructors
by Andrew McDonald 28 Jul '06

28 Jul '06

> I have a specific c++ question, and was wondering whether someone > could offer some advice. It is probably better to post such questions to comp.lang.c++ or comp.lang.c++.moderated > ie is it safe to assume that Test's copy constructor will call the > copy constructor of all the above attributes. >From the C++ standard ISO/IEC 14882:1998(E) Section 12.8.8; The implicitly defined copy constructor for class X performs a memberwise copy of its subobjects. The order of copying is the same as the order of initialization of bases and members in a user defined constructor (see 12.6.2). Each subobject is copied in the manner appropriate to its type: - if the subobject is of class type, the copy constructor for the class is used; - if the subobject is an array, each element is copied, in the manner appropriate to the element type; - if the subobject is of scalar type, the builtin assignment operator is used. Virtual base class subobjects shall be copied only once by the implicitly defined copy constructor (see 12.6.2). regards, Andrew McDonald System Architect Norwood Systems Australia Pty Ltd Level 1, 71 Troy Terrace PO Box 1281 Subiaco, WA 6904 Tel +61 8 9380 7766 Fax +61 8 9380 7733 The information in this email, and any attachments, may contain confidential information and is intended solely for the attention and use of the named addressee (s). It must not be disclosed to any person(s) without authorization. If you are not the intended recipient, or a person responsible for delivering it to the intended recipient, you are not authorized to, and must not, disclose, copy, distribute, or retain this message or any part of it. If you have received this communication in error, please notify the sender immediately.

2 1

regular expression help
by llwaeva＠21cn.com 28 Jul '06

28 Jul '06

Hi there, I am going to retrieve the following pattern %K{xxx} where xxx can be anything except line break. I find and modify the following code from document, is that right for my case? boost::regex expK("[^%]*%K{([^\r\n])}"); std::string::const_iterator start, end; start = sourcesrc.begin(); end = sourcesrc.end(); boost::match_results<std::string::const_iterator> what; boost::match_flag_type flags = boost::match_default; while ( regex_search(start, end, what, expK, flags) ) { // handle the match string, i.e. xxx my_fun( std::string( what[1].first, what[1].second ) ); start = what[1].second; flags |= boost::match_prev_avail; flags |= boost::match_not_bob; } Here, expK found all the substring matching %K{xxx} (not including double % case). But the program didn't give me what I want, I guess the problem is from the expression where { and } is not expressed correctly. However, I didn't found how to express { and } in the document. Here is my guess of the correct form, tell me if it is correct or not 1) boost::regex expK("[^%]*%K\{([^\r\n])\}"); // here \{ represents { and \} represents } 2) boost::regex expK("[^%]*%K[{]{1}([^\r\n])[}]{1}"); // use [{]{1} and [}]{1} to limit the { and } occur once exactly 3) boost::regex expK("[^%]*%K\\{([^\r\n])\\}"); // here \\{ represents { and \\} represents } which one is correct? or all is wrong? Please help! Thanks in advance.

2 1

error in regex_replace!?
by llwaeva＠21cn.com 28 Jul '06

28 Jul '06

Hi there, I am using regex_replace to find_replace a pattern. The code is shown below string src = "xxx%R__xy\r\n%\r\nRyyyy% A__%%A\r\n%Rzzz%C%Appp_%C0123\r\n%Rooo"; re = "(%R)|(%A)|(%C)"; format = "(?1#R)(?2#A)(?3#C)"; cout << "SOURCE:" << endl << src << endl << endl; regex_replace( src.begin(), src.begin(), src.end(), re, format, format_all ); cout << "OUTPUT:" << endl << src << endl << endl; 1) For replacing %R with #R, %A with #A and %C with #C, and the output string save back to the source string, the above code do a good job. And the output is xxx#R__xy % Ryyyy% A__%#A #Rzzz#C#Appp_#C0123 #Rooo NOTE that %%A is replaced with %#A 2) If I change the format so that the length of format longer than that of subsitute string, e.g. re = "(%R)|(%A)|(%C)"; format = "(?1#RRR)(?2#AAA)(?3#CCC)"; regex_replace raise an error. I think the error is come from the original string is not long enough to store the output string. The problem can be solved by the following code string src = "xxx%R__xy\r\n%\r\nRyyyy% A__%%A\r\n%Rzzz%C%Appp_%C0123\r\n%Rooo"; string output=src; re = "(%R)|(%A)|(%C)"; format = "(?1#RRR)(?2#AAA)(?3#CCC)"; cout << "SOURCE:" << endl << src << endl << endl; regex_replace( output.begin(), src.begin(), src.end(), re, format, format_all); cout << "OUTPUT:" << endl << output << endl << endl; But I do want the output store in the original string. Reassigning the source string slove the problem, i.e. src = output, but for a large input string (for my case , >5M), this way is not that good. I am looking for a better approach. BTW, if the length of the output string shorter than the original string, the output carry some other extra characerts. e.g. string src = "xxx%Ry%Az%Ce"; string output=src; re = "(%R)|(%A)|(%C)"; format = "(?1R)(?2A)(?3C)"; The output is "xxxRyAzCe%Ce" where the last %Ce are extra characters from source string. How can I kill the extra characters? 3) Finally, I will modify the search condition to make sure that only %X rather than %%X (X can be R, A or C) is replaced. I try the following regular expression re = "([^%]%R)|([^%]%A)|([^%]%C)"; but it doesn't work properly for my problem. e.g. for src = "xxx%R %%R", for the format "(?1#R)(?2#A)(?3#C)"; the regular expression will kill the 'x' before %R, i..e. the output is "xx#R %%R" rather than "xxx#R %%R" Please help! Thanks in advance.

2 1

Labeling patched Boost versions
by Daniel Krügler 28 Jul '06

28 Jul '06

Hello, Recently I had a discussion with a colleague concerning the possibility to influence the resulting file names of the default boost output. This discussion was actually inspired by the outcome of thread "[thread] Keeping leak detectors still..." on 2006-07-11 where we had the situation of an inofficial patch which we would like to use. The problem is: How can/should I signal a patched boost version? According to the naming scheme described in http://boost.org/more/getting_started.html one could change the boost subminor version. Regrettably we found out that most programmers actually expect that such a number belongs to one of the *official* boost versions provided by http://boost.org/, (most probably because the naming scheme smoothly integrates). Now I had the idea of an optional "build id", which is a well-known tool in many projects to signal a given state or "snap shot". The very advantage of a build id - which's format is usually not fixed, but typically is a string of numbers, letters and some file-name compatible characters like '-', normally without any white spaces and of arbitrary length - is, that it accentuates and differs very strongly from the regular pattern of the subdivided version number. Ideally it should be possible to define a kind of bjam constant, e.g -sBUILD_ID=string (I'm not a bjam expert and I hope that the above proposed name does not violate any naming policies of such configuration parameters), which would allow to explicitly set build id for a bjam build. I have no strong opinion concerning the exact position of that build id in a lib name, but probably the most resonable one would be just after the version number, e.g. libboost_date_time-gcc-mt-d-1_31_M20060721.a for -sBUILD_ID=M20060721 Does there already exist such a possibility to do that and if not: I would really appreciate such a general available "callback" for injecting a build id (a sequence of characters) into the final output. Standard behaviour would of course be, *not* to attach such id, but the possibility to do that via a userdefined program parameter of bjam would be fantastic! The problem is: If I would manually hack the boost bjam files to do just this, I could never update to the next boost version without fears, because I always would need to manipulate the new version also. Since I assume that this request is of general interest for the community I would like to humbly ask for support of it. What do you think? Any chances for that idea? Or better ones? Greetings from Bremen, Daniel Krügler

1 1

DateTime: Seconds until next month
by Olaf van der Spek 28 Jul '06

28 Jul '06

Hi, I'm currently using the following code to calculate the number of seconds until the next month. I'm wondering whether there's an easier way. date d(day_clock::universal_day()); d += months(1); cout << duration2a((ptime(date(d.year(), d.month(), 1)) - second_clock::universal_time()).total_seconds()) + " until ladders reset" << endl; return 0;

2 1

regex_replace help
by llwaeva＠21cn.com 28 Jul '06

28 Jul '06

Hi there, I am using regex_replace for string replacing. I am working with a very large string (about 3M) and need to do the following replacment %R% --> #R# %A% --> #R1# %C% --> #R2# and so on. I am new to regular express and regex. After having read the document, I know how regex works, but still not sure if regex_replace meet my demand 1) I invoke regex_replace several times to replace difference patterns. For a large input string, the operation is very slow. Can I call regex_replace once to do the several replacments. i.e. calling regex_replace( output, begin, end, "%R ,%A ,%C", "#R#, #R1#, #R2#", match_default); for replacing %R% with #R# %A% with #R1# %C% with #R2# 2) According to the document, the output fashion depends on the match_flag_type, for my case, I hope the output string, including both matched and nonmatched part, replace the whole input string. e.g. SourceStr = "xxxx%R%yyy%A%zzz%C%" Apply regex_replace( output_string, SourceStr.begin, SourceStr.end, ... ) We have , output_string = "xxxx#R#yyy#R1#zzz#R2#" rather than #R#, #R1# and #R2# Any reply will be highly appreciated.

2 2

default copy constructors
by bringiton bringiton 28 Jul '06

28 Jul '06

I have a specific c++ question, and was wondering whether someone could offer some advice. Is is safe to assume that modern compilers will supply a default copy constructor and default assignment operator that will copy all attributes? Or may I run into undefined behaviour between compilers. class Test: public: int v1; char v2; float v3 std::string v4; std::vector<int> v5; boost::shared_ptr<int> v6; }; ie is it safe to assume that Test's copy constructor will call the copy constructor of all the above attributes. NOTE: i am only talking about attributes that are already copiable. i understand that if a class manages it's own memory, the copy constructor will need to be defined. **Just so we are using the same terminology, does c++ have a pattern to define concrete objects that are copiable? ie your basic types, int, char, float. and classes that have been designed to be copiable: ie std::string, std::vector etc. **Maybe it's called concrete type.

1 0

Re: [Boost-users] [license] Why is the Boost license not anofficial Open Source license?
by Sohail Somani 27 Jul '06

27 Jul '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Gennaro Prota > Sent: Thursday, July 27, 2006 10:05 AM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] [license] Why is the Boost license > not anofficial Open Source license? > > With a terminology stress which (to me) twists the meaning of "free > software" it could be classified as "non-copylefted free software" > (which basically means, anyone can redistribute it under a non free > license; in the case of boost they can do that only if they don't > redistribute the source code) So if you use boost in your interfaces, you've gotta redistribute your source code too?

3 2

Re: [Boost-users] [license] Why is the Boost license not anofficial Open Source license?
by Sohail Somani 27 Jul '06

27 Jul '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Sebastian Redl > Sohail Somani wrote: > > >So if you use boost in your interfaces, you've gotta > redistribute your > >source code too? > > > > > No. All he said is that you may not distribute the Boost > sources under > any license but the Boost license. It doesn't affect your own > stuff at all. Gotcha.

1 0

converting a string to an enum
by Elisabeth Benoit 27 Jul '06

27 Jul '06

Hi, Does boost offer some kind of functionality allowing to transform a string into an enum? thanks.

2 1

using boost
by Fred J. 27 Jul '06

27 Jul '06

Hi could some one point to a link how how to link/compile with boost? or tell me whats missing from the makefile below? thanks alot #include <converter_policies.hpp> using boost::floor; ... cout << floor(12.45) << endl; ... the make file; OBJS := $(patsubst %.cpp,%.o,$(wildcard *.cpp)) COMP = g++ proj: $(OBJS) $(COMP) -Wall -o proj $(OBJS) #-Wall turns on all warnings clean: rm -rf *.o proj --------------------------------- Do you Yahoo!? Next-gen email? Have it all with the all-new Yahoo! Mail Beta.

2 1

[Boost.Python/Bjam] How to wrap a binary only dll ?
by michael_gruner＠arcor.de 27 Jul '06

27 Jul '06

Hello, I'm new to boost and did sucessfully complete the installation of boost and the boost.python hello world example. However, I'm wondering how to wrap a shared library I get as a binary and a header file to access it. Can anyone point me to any documentation about this? little example: I own a library "mylib.dll" and a header file "mylib.h" without any source code for my platform. Now I'd like to build a python wrapper to access this mylib.dll. I already wrote a "mywrapper.cpp" that includes the mylib.h file. But however bjam tries to build a mylib.pyd instead of using just the dll. can anyone help me with this? thank you Michael

2 2

[regex] boost::match_extra vc 8.0 express access violation
by Ovanes Markarian 27 Jul '06

27 Jul '06

Hi! I am trying to match a function body and find out if the params or return type have specific class name patterns. Therefore I did a really huge regex... sorry if is not so readable, but I used defines to make as little errors as possible... //non marking group #define NMG_S(s) "(?:"+s+")" #define NMG_S_0N(s) NMG_S(s)"*" #define NMG_S_1N(s) NMG_S(s)"+" #define NMG_S_01(s) NMG_S(s)"?" #define NMG(s) "(?:"s")" #define NMG_0N(s) NMG(s)"*" #define NMG_1N(s) NMG(s)"+" #define NMG_01(s) NMG(s)"?" #define RE_OR "|" #define RE_SPACE "[[:space:]]" #define RE_SPACE_01 RE_SPACE "?" #define RE_SPACE_0N RE_SPACE "*" #define RE_SPACE_1N RE_SPACE "+" #define RE_START_WORD "\\<" #define RE_END_WORD "\\>" #define RE_ID "[[:alpha:]]" NMG_0N("[_a-zA-Z0-9]") #define RE_CONST "const" #define RE_VOLATILE "volatile" #define RE_ANY "." #define RE_ANY_0N ".*" #define RE_ANY_1N ".+" #define RE_ANY_01 ".?" #define RE_PTR "\\*" #define RE_PTR_0N RE_PTR "*" #define RE_PTR_1N RE_PTR "+" #define RE_PTR_01 RE_PTR "?" #define RE_REF "&" #define RE_REF_0N RE_REF "*" #define RE_REF_1N RE_REF "+" #define RE_REF_01 RE_REF "?" #define RE_LINE_START "^" #define ONE_OF_PROTOCOLS NMG_S(strings::Name1) RE_OR NMG_S(strings::Name2) RE_OR NMG_S(strings::Name3) RE_OR \ NMG_S(strings::Name4) RE_OR NMG_S(strings::Name5) RE_OR NMG_S(strings::Name6) RE_OR \ NMG_S(strings::Name7) RE_OR NMG_S(strings::Name8) RE_OR NMG_S(strings::Name9) RE_OR \ NMG_S(strings::Name10) #define MATCH_PROTOCOL RE_START_WORD \ NMG_01(RE_ANY_0N "(" ONE_OF_PROTOCOLS ")" RE_ANY_0N) RE_OR \ NMG_01(RE_ANY_1N) \ RE_END_WORD RE_SPACE_0N Name1 to Name10 are static const std::string definitions within a class. A have the following regex defined to match params and function return type const boost::regex strings::regex_fct ( //possibly leading whitespace or const RE_LINE_START RE_SPACE_0N NMG_01(RE_CONST RE_SPACE_1N) //result type MATCH_PROTOCOL //return type can be a pointer or reference with const qualifier NMG_01(RE_CONST RE_SPACE_0N) RE_PTR_0N RE_SPACE_0N RE_REF_01 RE_SPACE_0N NMG_01(RE_CONST) RE_SPACE_1N //function name RE_START_WORD NMG_01(RE_ID) RE_END_WORD RE_SPACE_0N //function params "\$" //open function params brace //param type (can be repeated 0 to N times) NMG_0N( RE_SPACE_0N MATCH_PROTOCOL RE_SPACE_0N //may be a ptr or ref type NMG_01(RE_CONST RE_SPACE_0N) RE_PTR_0N RE_SPACE_0N RE_REF_01 RE_SPACE_0N NMG_01(RE_CONST) RE_SPACE_1N //(?: still open //param name and default initializations are not important RE_ANY_0N //params can be comma separated in case of more then 1 param NMG_01(",") //close NMG_0N ) //terminate in "\$" ); Now I have the following test string: using namespace std; string search_where_fct1("CName1_Setup const* someFct(){}"); set<string> uniques_names; find_protocols(search_where_fct1, strings::regex_fct, uniques_names); void find_protocols(const std::string& str, const boost::regex& expression, std::set<std::string>& log) { boost::smatch what; IdentifyProtocolUsage usage(log); if(boost::regex_match(str, what, expression, boost::match_extra)) //<<<<< crash!!!! { usage(what); } } This is the boost::regex function where it crashes: template <class BidiIterator, class Allocator, class traits> bool perl_matcher<BidiIterator, Allocator, traits>::match_imp() { // initialise our stack if we are non-recursive: #ifdef BOOST_REGEX_NON_RECURSIVE save_state_init init(&m_stack_base, &m_backup_state); used_block_count = BOOST_REGEX_MAX_BLOCKS; #if !defined(BOOST_NO_EXCEPTIONS) try{ #endif #endif // reset our state machine: position = base; search_base = base; state_count = 0; m_match_flags |= regex_constants::match_all; //LINE 162 perl_matcher_common.hpp !!! m_presult->set_size((m_match_flags & match_nosubs) ? 1 : re.mark_count(), search_base, last); m_presult->set_base(base); if(m_match_flags & match_posix) m_result = *m_presult; verify_options(re.flags(), m_match_flags); if(0 == match_prefix()) return false; return m_result[0].second == last; #if defined(BOOST_REGEX_NON_RECURSIVE) && !defined(BOOST_NO_EXCEPTIONS) } catch(...) { // unwind all pushed states, apart from anything else this // ensures that all the states are correctly destructed // not just the memory freed. while(unwind(true)){} throw; } #endif } Call from this line causes access violation: Unhandled exception at 0x104817fd in some_app.exe: 0xC0000005: Access violation writing location 0x56394ab7. I re-built regex with BOOST_REGEX_MATCH_EXTRA uncommented in user.hpp. Would be really nice to receive some comments or suggestions. With Kind Regards, Ovanes Markarian

2 1

[Boost compilation on SGI] Problems compiling boost on SGI
by Sebastien Fortier 27 Jul '06

27 Jul '06

Can anyone help with this, I have been trying to compile boost on an SGI machine. Boost source taken from cvs. IRIX version: IRIX Release 6.5 IP35 MIPSpro compiler version: MIPSpro Compilers: Version 7.4.2m attached is the log of my last compilation effort. Here is a short sorted list of the reoccurring errors ----------------------------------------------------------------------------------------------------------------------------------- cc-1004 CC: ERROR File = /data/cmdwx4/pst/package/boost_cvs/boost/type_traits/is_arithmetic.hpp, Line = 37 Not enough memory is available. BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_arithmetic,T,::boost::detail::is_arithmetic_impl<T>::value) ^ 1 catastrophic error detected in the compilation of [...] ----------------------------------------------------------------------------------------------------------------------------------- cc-1004 CC: ERROR File = /data/cmdwx4/pst/package/boost_cvs/boost/type_traits/is_same.hpp, Line = 37 Not enough memory is available. BOOST_TT_AUX_BOOL_TRAIT_DEF2(is_same,T,U,false) ^ 1 catastrophic error detected in the compilation of [...] ----------------------------------------------------------------------------------------------------------------------------------- cc-1282 CC: ERROR File = /data/cmdwx4/pst/package/boost_cvs/boost/test/utils/named_params.hpp, Line = 307 More than one instance of overloaded function "boost::nfp::optionally_assign" matches the argument list. Function symbol function template "boost::nfp::optionally_assign(T &, boost::nfp::nfp_detail::nil)" is ambiguous by inheritance. Function symbol function template "boost::nfp::optionally_assign(T &, const Source &)" is ambiguous by inheritance. The argument types are: (std::size_t, boost::nfp::nfp_detail::nil ). optionally_assign( target, p[k] ); ^ ----------------------------------------------------------------------------------------------------------------------------------- cc-1384 CC: ERROR File = /data/cmdwx4/pst/package/boost_cvs/boost/test/impl/unit_test_suite.ipp, Line = 124 Protected member "boost::unit_test::class_property<boost::unit_test::test_unit_id>::va lue" is not accessible through a "boost::unit_test::readwrite_property<boost::unit_test::counter_t>" pointer or object. tu->p_expected_failures.value = expected_failures; ^ ----------------------------------------------------------------------------------------------------------------------------------- cc-1384 CC: ERROR File = /data/cmdwx4/pst/package/boost_cvs/boost/test/impl/unit_test_suite.ipp, Line = 126 Protected member "boost::unit_test::class_property<boost::unit_test::test_unit_id>::va lue" is not accessible through a "boost::unit_test::readwrite_property<boost::unit_test::counter_t>" pointer or object. p_expected_failures.value += tu->p_expected_failures; ^ These errors reoccur throughout the compilation process, is there a fix for this ? the skipped libraries are libboost_test_exec_monitor libboost_unit_test_framework libboost_wave I already compiled the library under Linux and everything worked fine. I was hoping to use the unit testing library from boost instead of cppunit but if I cant compile it I will have no choice in the matter. -- Sébastien Fortier

1 0

Re: [Boost-users] [boost] BGL - cycles in an undirected graph
by Aaron Windsor 27 Jul '06

27 Jul '06

On 7/20/06, Michal <simecek(a)gmx.de> wrote: > my task is to find cycles in an undirected graph and to assign a cycle id > to each > vertex in this cycle. It is still a bit more complicated, because I do not > need just the simple cycles, but all simple cycles which are sharing > edges, must > get the same cycle id. > > I think this problem is already solved somewhere, but I cann not find the > right > approach, thus I am asking here if somebody have an idea how to solve it > best > with BGL. Michal, If you want to label the edges of a graph such that (1) any two edges that are on a simple cycle together get the same label, and (2) any two edges not on any cycle together get distinct labels then you simply want to find the biconnected components of the graph - there's a way to do this in linear time using depth-first search, and the algorithm is in the BGL: http://www.boost.org/libs/graph/doc/biconnected_components.html However, the fact that you said that you want to label all vertices in the graph with a distinct label subject to condition (1) above is a little confusing - you can have two cycles that don't meet in any edges but share a common vertex, and in that case, which of the two labels would you want to use for that vertex? Aaron

2 1

[mpl] A partioning unique/non-unique algorithm
by Eric Lemings 27 Jul '06

27 Jul '06

Greetings, How would you combine the boost::mpl::partition and boost::mpl::unique algorithms such that an element that is not placed into the first inserter (for unique elements) is placed into the second inserter (for non-unique elements)? Thanks, Eric.

2 1

error in compiling lambda on solaris
by Mr Abhinav Rai 26 Jul '06

26 Jul '06

I am trying to compile C++ code with lambda included. I am using following version of compiler on Solaris: CC: Sun C++ 5.5 Patch 113817-12 2005/03/08 I get following compile error: /boost/lambda/detail/is_instance_of.hpp", line 90: Error: "{" expected instead of ">" Does this version of solaris compiler not able to compile lambda? are there any defines needed to fix this? __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

Re: [Boost-users] [serialization] basic_xml_iarchive tag checkingbugs
by Todd Greer 26 Jul '06

26 Jul '06

Robert Ramey wrote: Todd Greer wrote: >> 1. The sense of the check of the flags against no_xml_tag_checking is >> reversed. By default, checking of xml tag names is not done, contrary >> to the documentation. If no_xml_tag_checking is passed in as a flag, >> tag checking is enabled. >> My recommended fix for (1) would be to change no_xml_tag_checking to >> check_xml_tags, and to change the documentation to reflect this. While >> the more obvious solution would be to simply fix the comparison, this >> would introduce a silent behavioral change. My recommended fix will >> fail to compile for those that have specified no_xml_tag_checking, >> thus alerting them to the change. > I prefer the more obvious fix as I don't want to change the docs and all > the other switches are no_... I have no objection to that. >> My recommended fix for (2) is to replace the excerpted code with: >> if(0 != (this->get_flags() & check_xml_tags) && rv.object_name != >> name) > > Hmmm - don't we have the same problem here? That is if the object name > read is larger than "name" we could still overflow something. In this case, rv.object_name is a std::string. std::string defines an operator!=(string const& a, char const* b) that has well defined semantics regardless of the lengths of a and b. It just requires that b is a valid c-style string. -- Todd Greer <tgreer <at> affinegy dot com> Senior Software Developer, Affinegy LLC

1 0

boost lambda with proxy reference object
by Nathan Thomas 26 Jul '06

26 Jul '06

Hi all, I'm trying to use boost lambda to aggregate several functor calls together in one pass over my data with a std::for_each(..) (using bind and the lambda comma operator). I'm running into problems because I use an iterator (over type T) where the dereference operator doesn't return a T& but instead an object of type proxy<T>. This proxy class handles marshaling the object from another address space & setting up a temporary copy on its construction and subsequently writes back on destruction. Lambda expects (as it should) a T& from the deference attempt to invoke functors which are set to expect the proxy type. Is there a template I can specialize for this case or some type I could but am not reflecting out of my iterator class to make this work. Or is there better way to write this iterator that would allow me to properly pass a T& while still allowing some pre & post processing on the dereference? Thanks for you time / help, --Nathan Thomas Texas A&M University

1 0

Re: [Boost-users] XML Serialization Traits Question
by William Bardon 26 Jul '06

26 Jul '06

Robert, Thanks for the example; it helped clear up some uncertainty about the template arguments in the derived class. Regarding save_override, I see where specialized versions for the different trait types are defined in basic_xml_oarchive.ipp. I also see that save_override is called from the operator<< redefinition in interface_oarchive.hpp. What I'm missing is the link between serializing a user-defined class object and the traits of that object. template<class Archive> BOOST_ARCHIVE_OR_WARCHIVE_DECL(void) basic_xml_oarchive<Archive>::save_override(const version_type & t, int) { int i = t.t; // extra .t is for borland write_attribute(VERSION(), i); } This function already displays a version attribute in the XML. How do I make sure this is called for every element? I'm sorry, but I can't figure out how to modify chain of control to force output of class traits. Starting in oserializer.hpp, boost::archive::save<Archive,T> calls static save_non_pointer_type<Archive, T>::invoke calls serialize_adl calls boost::serialization::serialize<Archive, T> calls access::serialize calls myClass::serialize<Archive> (Archive& ar, unsigned int version) There is also a function oserializer<Archive,T>::save_object_data that calls serialize_adl, but I can't find anything that calls it. The struct save_non_pointer_type<Archive, T> in oserializer.hpp may be the key, but I'm not sure how it works. In oserializer.hpp, struct save_non_pointer_type<Archive,T>::save_standard::invoke calls Archive::save_object, but I do not see an implementation of the function anywhere: $ find /usr/include/boost -type f -exec grep -H save_object {} \;| grep -v save_object_ | more /usr/include/boost/archive/polymorphic_oarchive.hpp: virtual void save_object( /usr/include/boost/archive/detail/oserializer.hpp: ar.save_object(& t, oserializer<Archive, T>::instantiate()); /usr/include/boost/archive/detail/basic_oarchive.hpp: void save_object( /usr/include/boost/archive/detail/polymorphic_oarchive_impl.hpp: virtual void save_object( /usr/include/boost/archive/detail/polymorphic_oarchive_impl.hpp: ArchiveImplementation::save_object(x, bos); I'd appreciate any suggestions. Am I even looking in the right place? Thanks in advance, Bill -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Robert Ramey Sent: Wednesday, July 26, 2006 12:14 PM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] XML Serialization Traits Question "William Bardon" <wbardon(a)cabcds.org> wrote in message news:C73E689C9FCF884B9A550ECFADA0721C087D3E@exchange.cab-cds.org... I have read both the Boost Serialization online documentation and the archives of the Boost-Users mailing list looking for guidance, but I haven't found anything relevant. I see how to use BOOST_CLASS_TRACKING and BOOST_CLASS_IMPLEMENTATION to remove version tracking attributes from the XML tags. Usage of these macros does a lot more than remove attributes from the tags. I want to go in the opposite direction. I notice that the class_id and version attributes only appear the first time an object of a particular class is serialized. I want to force the version attribute to appear in every object's attribute list. Do I need to derive a custom archive to do this? yes I have looked at the source code for serialization, but I have trouble plowing through all of the macros, template expansions, and overloaded functions to locate the specific part that controls whether class traits are stored as attributes in a particular XML tag. I sympathize - its hard to follow. And I wrote it. Here are some hints: a) look at demo_fast_archive.cpp to see a model of how one can derive from an existing archive. b) You'll want to derive from xml_oarchive_impl<...> to create my_xml_oarchive c) add a "save_override" function to my_xml_oarchive which replaces the "save_override" function in basic_xml_oarchive.ipp. Implement this using functions defined basic_xml_oarchive.ipp Good luck - Robert Ramey Thanks in advance, Bill _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

[serialization] basic_xml_iarchive tag checking bugs
by Todd Greer 26 Jul '06

26 Jul '06

Hi, While developing skip_xml_iarchive, I noticed to bugs in basic_xml_iarchive::load_end(). 1. The sense of the check of the flags against no_xml_tag_checking is reversed. By default, checking of xml tag names is not done, contrary to the documentation. If no_xml_tag_checking is passed in as a flag, tag checking is enabled. 2. If tag checking is enabled, and a tag name is encountered that is longer than the name passed in, the name string is accessed past the end of the array. In the expression "name[this->This()->gimpl->rv.object_name.size()]", the index is the size of the encountered name, and could be arbitrarily large. The relevant portion of basic_xml_iarchive::load_end() is included here: if(0 != (this->get_flags() & no_xml_tag_checking)){ if(0 != name[this->This()->gimpl->rv.object_name.size()] || ! std::equal( this->This()->gimpl->rv.object_name.begin(), this->This()->gimpl->rv.object_name.end(), name ) My recommended fix for (1) would be to change no_xml_tag_checking to check_xml_tags, and to change the documentation to reflect this. While the more obvious solution would be to simply fix the comparison, this would introduce a silent behavioral change. My recommended fix will fail to compile for those that have specified no_xml_tag_checking, thus alerting them to the change. My recommended fix for (2) is to replace the excerpted code with: if(0 != (this->get_flags() & check_xml_tags) && rv.object_name != name) The Boost FAQ recommends posting bug reports to the mailing list. Let me know if you would like for me to submit this to the bug repository. -- Todd Greer <tgreer <at> affinegy dot com> Senior Software Developer, Affinegy LLC

2 1

Re: [Boost-users] [serialization] Skipping unexpected elements inXMLarchive
by Todd Greer 26 Jul '06

26 Jul '06

Robert Ramey wrote: > Sounds to me that others might find this useful. How about making a > little write up, and maybe a small test/demo, zipping it up and uploading > to the serialization section of the boost vault? I've uploaded skip_xml_iarchive.zip to the vault in serialization. I've fixed several issues from the version I posted here, and have added a bit of testing and explanation. I hope that people find it useful. Please let me know if you have any questions, or find any problems. If you do find it useful, please let me know that as well. -- Todd Greer <tgreer <at> affinegy dot com> Senior Software Developer, Affinegy LLC

1 0

Re: [Boost-users] how to see the actual value of a'boost::optional<__int64>' in VS2005 debugger
by David Klein 26 Jul '06

26 Jul '06

boost-users-bounces(a)lists.boost.org wrote: > Hi Catherine, > > I am sorry that I don't have any idea about a solution to > your problem. Instead, I myself have a problem to ask for > help to solve. If you happen to know anything about it and > would kindly to help me, I would appreciate it very much. > > I am trying to port Bayes++ into a Visual C++ 2005 project. > The version of Boost library is the latest ( v1.33.1). > However, I came cross a C2064 error that tells "term does not > evaluate to a function taking 0 arguments" when I was > compiling the BayesFilter project, which integrates Boost > header libraries. The error referred to the sentence > > BOOST_UBLAS_INLINE > const_iterator (const iterator &it): > container_const_reference<self_type> (it ()), it_ (it.it _) {} > > at line 293 in file "boost_1_33_1\boost\numeric\ublas\vector.hpp". > > I guess that the problem is related to an incompatibility > between Visual C++ 2005 and the Boost C++ package, and might > be cracked by setting appropriate VC 2005 compiling options > or Boost C++ #dehine's. But I don't have any right ideas to > do so. If you could help, it will be very helpful for me. > > Sincerely, > > Jason Zhang > hi jason, see http://thread.gmane.org/gmane.comp.lib.boost.ublas/2472/focus=2472. btw: you better post UBLAS related questions to the ublas mailing list (ublas <at> lists.boost.org) -- HTH dave

2 1

XML Serialization Traits Question
by William Bardon 26 Jul '06

26 Jul '06

I have read both the Boost Serialization online documentation and the archives of the Boost-Users mailing list looking for guidance, but I haven't found anything relevant. I see how to use BOOST_CLASS_TRACKING and BOOST_CLASS_IMPLEMENTATION to remove version tracking attributes from the XML tags. I want to go in the opposite direction. I notice that the class_id and version attributes only appear the first time an object of a particular class is serialized. I want to force the version attribute to appear in every object's attribute list. Do I need to derive a custom archive to do this? I have looked at the source code for serialization, but I have trouble plowing through all of the macros, template expansions, and overloaded functions to locate the specific part that controls whether class traits are stored as attributes in a particular XML tag. Thanks in advance, Bill

2 1

how to see the actual value of a 'boost::optional<__int64>' in VS2005 debugger
by Catherine 26 Jul '06

26 Jul '06

Hi boost experts, Recently, I noticed that I no longer see the actual value of a 'boost::optional<__int64>'variable in VS2005 debugger. My program is in C++. I recalled that I could find the actual value from the data field of the variable... Anyone encounted this problem? Other than cast the value to be _int64, is there any other way I can work around it? Thanks in advance, Catherine

3 2

Re: [Boost-users] how to see the actual value of a 'boost::optional<__int64>' in VS2005 debugger
by David Klein 26 Jul '06

26 Jul '06

boost-users-bounces(a)lists.boost.org wrote: > Hi boost experts, > > Recently, I noticed that I no longer see the actual value of > a 'boost::optional<__int64>'variable in VS2005 debugger. My program > is in C++. > > I recalled that I could find the actual value from the data field of > the variable... > > Anyone encounted this problem? Other than cast the value to > be _int64, is there any other way I can work around it? > > Thanks in advance, > Catherine > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users hi catherine, +my_int64 +boost::optional_detail::optional_base ... +- +- +m_storage +dummy_ +data +aligner_ +t0 +... +t23 in case of an int64 it is in t4. but this only seems to work for ints. you could also add the following line to %YOUR_MSVS8_DIR%/common7/packages/debugger/autoexp.dat: <snip> boost::optional<__int64>= initialized=<m_initialized> value=<m_storage.dummy_.aligner_.t4> </snip> this changes the display of {...} to f.ex. {initialized=true value=42} -- HTH dave

1 0

uBlas matrix * matrix operation
by Dave Steffen 26 Jul '06

26 Jul '06

Hi Folks, This is my first excursion into uBlas. I'm getting an "ambiguous overload for 'operator*' in 'a * b' " sort of error out of this: #include <boost/numeric/ublas/vector.hpp> #include <boost/numeric/ublas/matrix.hpp> #include <boost/numeric/ublas/matrix_expression.hpp> namespace UB { using namespace boost::numeric::ublas; template <int N> struct Type { typedef matrix<double, row_major, bounded_array<double, N*N> > matrix; }; } // elsewhere... typename UB::Type<N>::matrix a(N,N), b(N,N); for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) { a(i,j) = 1.0 / (i + j+1); b(i,j) = 1.0 / (i + j+1); } a * b; The error (from GCC 3.4.6) is this ugly thing: /usr/local/home/dgsteffen/local/GCC34/Boost/1_32/boost/numeric/ublas/matrix_expression.hpp:3632: note: candidates are: typename boost::numeric::ublas::matrix_binary_scalar2_traits<E1, const T2, boost::numeric::ublas::scalar_multiplies<typename E1::value_type, T2>, boost::numeric::ublas::scalar_reference<const T2> >::result_type boost::numeric::ublas::operator*(const boost::numeric::ublas::matrix_expression<E>&, const T2&) [with E1 = boost::numeric::ublas::matrix<double, boost::numeric::ublas::row_major, boost::numeric::ublas::bounded_array<double, 441u, std::allocator<double> > >, T2 = boost::numeric::ublas::matrix<double, boost::numeric::ublas::row_major, boost::numeric::ublas::bounded_array<double, 441u, std::allocator<double> > >] /usr/local/home/dgsteffen/local/GCC34/Boost/1_32/boost/numeric/ublas/matrix_expression.hpp:3162: note: typename boost::numeric::ublas::matrix_binary_scalar1_traits<const T1, E2, boost::numeric::ublas::scalar_multiplies<T1, typename E2::value_type>, boost::numeric::ublas::scalar_reference<const T1> >::result_type boost::numeric::ublas::operator*(const T1&, const boost::numeric::ublas::matrix_expression<E2>&) [with T1 = boost::numeric::ublas::matrix<double, boost::numeric::ublas::row_major, boost::numeric::ublas::bounded_array<double, 441u, std::allocator<double> > >, E2 = boost::numeric::ublas::matrix<double, boost::numeric::ublas::row_major, boost::numeric::ublas::bounded_array<double, 441u, std::allocator<double> > >] Any thoughts on what I'm doing wrong? Thanks! ---------------------------------------------------------------------- Dave Steffen, Ph.D. Software Engineer IV Disobey this command! Numerica Corporation ph (970) 419-8343 x27 fax (970) 223-6797 - Douglas Hofstadter dgsteffen(a)numerica.us ___________________ Numerica Disclaimer: This message and any attachments are intended only for the individual or entity to which the message is addressed. It is proprietary and may contain privileged information. If you are neither the intended recipient nor the agent responsible for delivering the message to the intended recipient, you are hereby notified that any review, retransmission, dissemination, or taking of any action in reliance upon, the information in this communication is strictly prohibited, and may be unlawful. If you feel you have received this communication in error, please notify us immediately by returning this Email to the sender and deleting it from your computer.

1 0

How to cast form string to number safely?
by 袁晓辉 26 Jul '06

26 Jul '06

Dear boost-users: I am really sorry for asking shch a silly question, but I really need your help! boost::lexical_cast is a great function to do casting. If I want is to cast from string to a "long long" type value, I can use the follow: long long llVar = lexical_cast<long long>("123456789"); It is alright in this circs, but what if: lexical_cast<long long>("9999999999999999999999999999999999999999999999999999999999999999999999999999"); This is an obvious overflow, but I have no way to handle this error, it returns a wrong number without throwing an exception! Any suggestion? Thank you very much!!! Kevin

4 5

Re: [Boost-users] shared_ptr and inheritance of the raw pointer
by Nat Goodspeed 26 Jul '06

26 Jul '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] On Behalf Of Yossi.Itzkovich(a)ecitele.com > Sent: Wednesday, July 26, 2006 3:03 AM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] shared_ptr and inheritance of the raw pointer > > I have this code: > > #include <boost/shared_ptr.hpp> > > class A{ // base class > public: virtual ~A(); // otherwise A isn't polymorphic, can't downcast > }; > > class B : public A{ > public: > int b1; > }; > > typedef boost::shared_ptr<A> tSmartA; > typedef boost::shared_ptr<B> tSmartB; > > void foo (const tSmartB& smartOne); // need ; for syntax ^^^^^ permits passing an expression > > int main () { > tSmartA a(new B); foo(boost::dynamic_pointer_cast<B>(a)); ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ > return 0; > } > > > How can I then send a to foo() ? [Nat] With the three changed lines shown above, this compiles for me under MSVC 7.1.

1 0

Boost MultiIndex container - using multiple composite keys
by Charitha Herath 26 Jul '06

26 Jul '06

Hi All, I'm new to this mailing list. I have been using the boost multi index container for a while. I now have requirement where I need to create multiple composite keys. The example 7 (composite keys example) in the multi index container documentation shows that it is possible to define multiple composite keys. But how do we use a specific composite key when searching the data. Does the container differentiate the composite keys using the key data types? Thanks, Charitha --------------------------------- How low will we go? Check out Yahoo! Messengers low PC-to-Phone call rates.

2 1

shared_ptr and inheritance of the raw pointer
by Yossi.Itzkovich＠ecitele.com 26 Jul '06

26 Jul '06

Hi, I have this code: #include <boost/shared_ptr.hpp> class A{ // base class public: }; class B : public A{ public: int b1; }; typedef boost::shared_ptr<A> tSmartA; typedef boost::shared_ptr<B> tSmartB; void foo (tSmartB& smartOne) // should get a pointer to derived { } int main () { tSmartA a(new B); foo(a); // This line doesn't compile because foo expects to get tSmartB return 0; } How can I then send a to foo() ? Thanks Yossi

2 1

[Lambda] find_if + vector of arrays
by Sohail Somani 25 Jul '06

25 Jul '06

Hi, Why can't lambda figure out the return type of operator[] for array? Does it know about vectors? I know I can fix the compile error by using bl::ret<double>(bl::_1[0])... But for obvious reasons, I'd much rather not! #include <vector> #include <algorithm> #include <boost/array.hpp> #include <boost/lambda/lambda.hpp> int main() { namespace bl=boost::lambda; using std::vector; using boost::array; array<double,3> cpy = {1}; vector<vector<double> > a(10,vector<double>(3,1)); vector<array<double,3> > b(10,cpy); std::find_if(a.begin(),a.end(),bl::_1[0]==5); std::find_if(b.begin(),b.end(),bl::_1[0]==5); } Thanks! Sohail

1 0

Re: [Boost-users] [serialization] Skipping unexpected elements inXMLarchive
by Todd Greer 25 Jul '06

25 Jul '06

Robert Ramey wrote: > Sounds to me that others might find this useful. How about making a > little write up, and maybe a small test/demo, zipping it up and uploading > to the serialization section of the boost vault? I'll do that. Unfortunately, I noticed that I use putback twice in a row, which I understand is not guaranteed to work. I'm working on fixing that now, and will put the code in the vault once that's fixed. I've fixed a couple of other things as well, and will include those fixes in the vault upload. -- Todd Greer <tgreer <at> affinegy dot com> Senior Software Developer, Affinegy LLC

1 0

reading data into vector/matirx
by Fred J. 25 Jul '06

25 Jul '06

dear boost users is there a library where it will take a file name and gives a vector/matrix of the data in the file. data formate is space delimited name age location hairColour thanks --------------------------------- Do you Yahoo!? Get on board. You're invited to try the new Yahoo! Mail Beta.

1 0

Grep() question
by Winson Yung 25 Jul '06

25 Jul '06

Hello all, I have the following regular expression, but it doesn't match to this text "REVENUE ................................................... $10,481.1" const char* pattern[] = "Revenue[\s\.]*\$?\s*([0-9,\.]*)"; my code looks something like this: std::vector <unsigned int> v; boost::RegEx expr(pattern, true); v.clear(); unsigned int result = expr.Grep(v, pBuf); if (result != 0) { std::string s = expr[0]; s = expr[1]; ............ Why expr[0] and expr[1] weren't return the aboved mention text as the first match? I think set 'true' in expr constructor means do case insensitve match. /Winson.

2 7

Newbie String Splitting Question
by Seth Nielson 25 Jul '06

25 Jul '06

Hi Two questions related to string tokenization. 1. Which is preferred? using "split" or the "tokenizer class"? 2. Both of these methods seem geared towards splitting on characters rather than splitting on substrings. Is there yet another method that is preferred for splitting a string on an exact substring? If I want to split "I<mark>Am<mark>A<mark>Test" into I, Am, A, Test, what is the best way? It seems that for split I'll have to write my own predicate, and for tokenizer, I'll have to write my own tokenizerFunction. -- Seth N.

7 11

[shmem] compile time error with mingw (uint64_t)
by Sascha Lumma 25 Jul '06

25 Jul '06

Hi, Thats my second posting for this error, but in the first one I've done a error in reasoning. I get this error when I try to compile my application with mingw in Windows. ./boost/shmem/sync/xtime.hpp: In function `int boost::shmem::xtime_get(boost::shmem::xtime*, int)': ./boost/shmem/sync/xtime.hpp:91: error: integer constant is too large for "long" type The line which produce this error message is the following. static const boost::uint64_t timespec_to_filetime_offset = (boost::uint64_t)(116444736000000000); Firstly I thought that I've a configuration problem and uint64_t is defined with "long" or "unsigned long" and cannot hold this 64 bit constant, but it was wrong. uint64_t has just like the constant 64 bit - sizeof(boost::uint64_t) returns 8. If I replace boost::uint64_t with "unsigned long long" the same error occures. But unsigned has no sign bit and should hold exactly 64 bit values. I've absolutely no idea. What's wrong??? Thank you in advance for every reply, Sascha

3 4

How to build only one library ?
by Hrvoje Ban 25 Jul '06

25 Jul '06

I'm using MinGW and I want to build only Pointer Container library but I can't find way to configure Boost build system (I'm using Jam). Also, I noticed that Jam builds eight version of each library, get it be configured to only make one or two version since I don't need the others?

2 2

Re: [Boost-users] [Test] BOOST_*_COLLECTIONS
by Sohail Somani 25 Jul '06

25 Jul '06

Err. Nm. Brain fart... Const ostream! > -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Sohail Somani > Sent: Tuesday, July 25, 2006 10:00 AM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] [Test] BOOST_*_COLLECTIONS > > Sorry, I should have sent this email here: > --- > Hi, > > With the following test case: > > #include <boost/array.hpp> > > template<typename T,size_t N> > std::ostream operator<<(const std::ostream & os, const > boost::array<T,N> & arr) > { > os << "[ "; > for(size_t i = 0 ; i < N-1; ++i) > { > os << arr[i] << ", "; > } > os << arr[N-1] << " ]"; > return os; > } > > BOOST_AUTO_UNIT_TEST ( test_boost_test_array ) > { > boost::array<double,3> arr1[] = { > {{1,0,0}}, > {{1,2,2}} > }; > > boost::array<double,3> arr2[] = { > {{1,0,0}}, > {{1,2,2}} > }; > > BOOST_REQUIRE_EQUAL_COLLECTIONS(arr1,arr1+2, > arr2,arr2+2); > } > > I'm getting odd compile errors at this line: > > res.message() << "\nMismatch in a position " << pos << ": " > << *left_begin << " != " << *right_begin; > > gcc.compile.c++ bjam-build/gcc/release/unit_tests/data_utils.o > external/boost/include/boost/test/utils/wrap_stringstream.hpp: > In function âboost::basic_wrap_stringstream<CharT>& > boost::operator<<(boost::basic_wrap_stringstream<CharT>&, > const T&) [with CharT = char, T = boost::array<double, 3u>]â: > external/boost/include/boost/test/test_tools.hpp:495: > instantiated from âboost::test_tools::predicate_result > boost::test_tools::tt_detail::equal_coll_impl(Left, Left, > Right, Right) [with Left = boost::array<double, 3u>*, Right = > boost::array<double, 3u>*]â > unit_tests/data_utils.cpp:62: instantiated from here > external/boost/include/boost/test/utils/wrap_stringstream.hpp: > 66: error: no match for âoperator<<â in â(+ > targ)->boost::basic_wrap_stringstream<CharT>::stream [with > CharT = char]() << tâ > > What am I missing here? > > Sorry for the long email! > > TIA, > > Sohail > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users >

1 0

[Test] BOOST_*_COLLECTIONS
by Sohail Somani 25 Jul '06

25 Jul '06

Sorry, I should have sent this email here: --- Hi, With the following test case: #include <boost/array.hpp> template<typename T,size_t N> std::ostream operator<<(const std::ostream & os, const boost::array<T,N> & arr) { os << "[ "; for(size_t i = 0 ; i < N-1; ++i) { os << arr[i] << ", "; } os << arr[N-1] << " ]"; return os; } BOOST_AUTO_UNIT_TEST ( test_boost_test_array ) { boost::array<double,3> arr1[] = { {{1,0,0}}, {{1,2,2}} }; boost::array<double,3> arr2[] = { {{1,0,0}}, {{1,2,2}} }; BOOST_REQUIRE_EQUAL_COLLECTIONS(arr1,arr1+2, arr2,arr2+2); } I'm getting odd compile errors at this line: res.message() << "\nMismatch in a position " << pos << ": " << *left_begin << " != " << *right_begin; gcc.compile.c++ bjam-build/gcc/release/unit_tests/data_utils.o external/boost/include/boost/test/utils/wrap_stringstream.hpp: In function âboost::basic_wrap_stringstream<CharT>& boost::operator<<(boost::basic_wrap_stringstream<CharT>&, const T&) [with CharT = char, T = boost::array<double, 3u>]â: external/boost/include/boost/test/test_tools.hpp:495: instantiated from âboost::test_tools::predicate_result boost::test_tools::tt_detail::equal_coll_impl(Left, Left, Right, Right) [with Left = boost::array<double, 3u>*, Right = boost::array<double, 3u>*]â unit_tests/data_utils.cpp:62: instantiated from here external/boost/include/boost/test/utils/wrap_stringstream.hpp:66: error: no match for âoperator<<â in â(+ targ)->boost::basic_wrap_stringstream<CharT>::stream [with CharT = char]() << tâ What am I missing here? Sorry for the long email! TIA, Sohail

1 0

Re: [Boost-users] Boost-users Digest, Vol 976, Issue 2
by Wu Yinghui, Freddie 25 Jul '06

25 Jul '06

> Wu Yinghui, Freddie wrote: >> Hi all, >> >> I'm just starting to try out Boost.Date_time library. As a newbie, I >> want to know if there is any good tutorial or "get started" guide >> somewhere that I can refer to. >> >> I've checked out the Data_time library documentation, as well as done >> some search on Google. Yet I cannot find useful information for an >> absolute beginner. >> >> Simple operation such as "Get the current time in the current time zone, > > http://www.boost.org/doc/html/date_time/posix_time.html#ptime_from_clock > >> and print it out using ISO format" is not achievable from reading the >> documentation-- > > http://www.boost.org/doc/html/date_time/posix_time.html#ptime_to_string > >> It is helpful to an experienced user, but not at all to a >> newbie. >> >> So any hints on how I should get started with Boost.Date_time library? > > Read the docs and examples a little deeper. > >> Cheers, >> >> Freddie >> >> P.S. I found one very annoying fact that most examples in Boost >> documentation do not indicate the namespace and/or header file to use >> for all those classes and types. This makes it very difficult for a >> beginner to get started in general. Any comments on this? > > All of the following examples clearly show the header and namespace: > > http://www.boost.org/doc/html/date_time/examples/general_usage_examples.html > > http://www.boost.org/doc/html/date_time/examples.html > > Overall I've never had a problem with this in Boost docs. > > Jeff Thanks for the pointers Jeff. You can pinpoint where the docs is for that specific task, because you had experience with the library (BTW, that task is just "for example," and I have a lot more doubts regarding the usage of the library). Thanks for the efforts on the library as well as the documentation. I guess it's time for me to refresh our local document cache with the ones on boost.org. :p I think the docs now look a lot more approachable. Sorry for the noise. Regarding the namespace/header file problem, it is not fair to say that all docs had me confused on it. But I did face problems previously when I was going through the references for certain functions I needed. Sometimes, I simply cannot find out the exact namespace/header to use without grepping the source tree (or go back to read the docs in full). Cheers, Freddie

2 1

(no subject)
by Jason Zhang 25 Jul '06

25 Jul '06

Hi everybody, I came cross the error C2064 "term does not evaluate to a function taking 0 arguments" when I was compiling "boost_1_33_1\boost\numeric\ublas\vector.hpp". The error is referred to the sentence BOOST_UBLAS_INLINE const_iterator (const iterator &it): container_const_reference<self_type> (it ()), it_ (it.it_) {} at line 293. Could anybody help provide hints to solve the problem? Many thanks, Jason

1 0

[shmem] error: constant is too large for long type
by Sascha Lumma 25 Jul '06

25 Jul '06

Hi all, I try to port my application to windows and use mingw 3.4.2 (32 bit machine). I get the following error at compilation time and I'm not sure, is that a misconfiguration or bug? ./boost/shmem/sync/xtime.hpp: In function `int boost::shmem::xtime_get(boost::shmem::xtime*, int)': ./boost/shmem/sync/xtime.hpp:89: error: integer constant is too large for "long" type The variable which should take this big decimal number (116444736000000000 -> exactly 32 bit) in line 89 is from type uint64_t and should have 64 bit unsigned. But that isn't so, it's just only long=int type (31 bit). If I look to the definition from uint64_t (boost/cstdint.hpp), there are much possibilities. With the GNU compiler it should be used the unsigned long long type as uint64_t and that are 64 bits. In worst case it should be used a 32 bit unsigned long type. Why I've only a long type? Thank you very much for reply, Sascha

2 1

[Date_time] How to Get Started?
by Wu Yinghui, Freddie 25 Jul '06

25 Jul '06

Hi all, I'm just starting to try out Boost.Date_time library. As a newbie, I want to know if there is any good tutorial or "get started" guide somewhere that I can refer to. I've checked out the Data_time library documentation, as well as done some search on Google. Yet I cannot find useful information for an absolute beginner. Simple operation such as "Get the current time in the current time zone, and print it out using ISO format" is not achievable from reading the documentation--It is helpful to an experienced user, but not at all to a newbie. So any hints on how I should get started with Boost.Date_time library? Cheers, Freddie P.S. I found one very annoying fact that most examples in Boost documentation do not indicate the namespace and/or header file to use for all those classes and types. This makes it very difficult for a beginner to get started in general. Any comments on this? -- Wu Yinghui, Freddie Research & Development Software Engineer Volume Interactions Pte Ltd 1 Kim Seng Promenade, #12-01 Great World City East Tower Singapore 237994 Tel: +65 62226962 (Ext 216) Fax: +65 62226215 Email: yhwu(a)volumeinteractions.com URL: http://www.volumeinteractions.com Important: This message is intended for the recipient(s) addressed above. It contains privileged and confidential information. If you are not the intended recipient, please notify the sender immediately by replying to this message and then delete it from your system. You must not read, copy, use, or disseminate this communication in any form. Thank you.

2 1

1.34.0 release schedule
by TOL Tsagarakis Manos 25 Jul '06

25 Jul '06

Hello every one, I just want to ask if there is any schedule for the final release 1.34.0 I'm particularly interesting in Robert Ramey's serialization library... Is it safe to use the RC? How mush different will the final release be? Thank you in advanced Emmanuil Tsagarakis

1 0

Re: [Boost-users] match multiline regular expression
by Ovanes Markarian 25 Jul '06

25 Jul '06

Winson, Please take a look at the regex character class names at: http://www.boost.org/libs/regex/doc/syntax_perl.html And especially at: http://www.boost.org/libs/regex/doc/character_class_names.html At the second location is written that [[:space:]] char class name is: "Any whitespace character." For [[:blank:]] is written: "Any whitespace character that is not a line separator." So space includes line separators At the first location URL is stated: "Escape sequence Equivalent to \s [[:space:]]" So using \s or [[:space:]] will consider line breaks. Now to the partial expression: Net income per common share:? This will not work as desired since '?' states only for the colon zero or more times to be matched, all other words must be there once. Please read from the first location URL about Perl Extended Patterns, especially: "Non-marking grouping (?:pattern) lexically groups pattern, without generating an additional sub-expression." So in your case you need to write: (?:Net income per common share:)? Non-marking grouping should be used, because you are not interested in remembering this pattern, but would like to ensure, that this pattern is there 0 or more times. With Kind Regards, Ovanes Markarian >I am trying to match (case insenstive) the following two lines with a >single regular expression, but somehow it doesn't work using boot >regex: > >NET INCOME PER COMMON SHARE: > Basic .................................................. $ >4.38 $ 3.90 $ 3.37 > >where: >1) there might be spaces before "NET INCOME PER COMMON SHARE" >2) there might be spaces after "NET INCOME PER COMMON SHARE" >3) the semicolon might be optional > >^(\\s*)?Net income per common share:?(\\s*)?\\r\\n( *)?basic > >Any one has suggestions? > >/Winson

1 0

[mpl] Placeholders substitution and template partial specialization
by Andriy Tylychko (mail.ru) 25 Jul '06

25 Jul '06

Hi All Consider following example: BOOST_MPL_ASSERT((boost::is_same< mpl::apply<mpl::apply<_1, _2>::type, boost::add_pointer<_1>, int>::type , int*>)); It should apply "add_pointer" to "int" and receive "int*", but it doesn't work. It returns just "int". Consider another example: template <class F, class X> struct apply1: mpl::lambda<F>::type::template apply<X> {}; BOOST_MPL_ASSERT((boost::is_same< mpl::apply<apply1<mpl::_1, mpl::_2>/*nothing here*/, boost::add_pointer<mpl::_1>, int>::type , int*>)); Handmade apply1 is used instead of mpl::apply. And this example works. What difference? Usage of nested "::type" of apply metafunction. As result: BOOST_MPL_ASSERT((boost::is_same< mpl::apply<apply1<mpl::_1, mpl::_2>::type, boost::add_pointer<mpl::_1>, int>::type , int*>)); doesn't work. Seems like this change affects time of placeholders substitution. Can anybody explain this in detail? So, since apply1 is just simplified version of mpl::apply, why we cannot use mpl::apply w/o "::type"? Because it cannot be compiled, at least using VC8. And seems like the main difference is that apply1 is primary template but mpl::apply is partial template specialization. Is such behavior standard? Can anybody explain the logic? Best regards, Andriy Tylychko, telya(a)mail.ru

2 1

[mpl] pop_back<range_c> is forbidden?
by Andriy Tylychko (mail.ru) 25 Jul '06

25 Jul '06

Hi. Reading "C++ Template Metaprogramming" book: "Though not extensible, range_c supports pop_front and pop_back, because contracting a range is easy" But following code doesn't work (at least using MSVC 8.0): #include <boost/mpl/range_c.hpp> #include <boost/mpl/pop_back.hpp> using namespace boost::mpl; typedef range_c<int, 0, 1> r; typedef pop_back<r>::type p; Can anybody explain? Thank you in advance, Andriy Tylychko, telya(a)mail.ru

2 1

bool_testable / safe bool idiom
by Gottlob Frege 25 Jul '06

25 Jul '06

What ever happened to bool_testable or some other answer to the safe bool idiom? I followed archived emails for a while, but thought it best to just bring up anew. Is a general solution not possible? How about a couple of solutions, where you pick the right one for your case? Or a solution with variations that you pick (policy based)? Anything? Thanks, Tony

1 0

match multiline regular expression
by Winson Yung 25 Jul '06

25 Jul '06

I am trying to match (case insenstive) the following two lines with a single regular expression, but somehow it doesn't work using boot regex: NET INCOME PER COMMON SHARE: Basic .................................................. $ 4.38 $ 3.90 $ 3.37 where: 1) there might be spaces before "NET INCOME PER COMMON SHARE" 2) there might be spaces after "NET INCOME PER COMMON SHARE" 3) the semicolon might be optional ^(\\s*)?Net income per common share:?(\\s*)?\\r\\n( *)?basic Any one has suggestions? /Winson

1 0

version specific "boost-<version>" source header subdirectory
by Noel Yap 25 Jul '06

25 Jul '06

Is there any way _not_ to get the version specific subdirectory? I prefer embedding that information within the --prefix argument. Thanks, Noel

2 1

iterate over key_type of map
by gast128 24 Jul '06

24 Jul '06

Dear all, in our company we use the STL map frequently. However one often wants to iterate over the key_type only (or mapped type, or make desicions for the key type, and take action on its corresponded map type). With the transform_iterator this is possible, but the resulting code is not an improvement over writing the loop explicitly. For example I want to search for the maximum string length: typedef std::map<std::string, double> StringDoubleMap; typedef boost::function<StringDoubleMap::key_type (const StringDoubleMap::value_type&)> Function; typedef boost::transform_iterator<Function, StringDoubleMap::const_iterator> TransformIterator; StringDoubleMap mp = boost::assign::map_list_of("George", 0.0) ("Bill", 0.0) ("Ronald", 0.0) ("Jimmy", 0.0); Function fc = boost::bind(&StringDoubleMap::value_type::first, _1); TransformIterator itBegin(mp.begin(), fc); TransformIterator itEnd(mp.end(), fc); TransformIterator it = std::max_element(itBegin, itEnd, boost::bind (&std::string::length, _1) < boost::bind(&std::string::length, _2)); if (it != itEnd) { std::cout << it->c_str() << ' ' << it->length() << std::endl; } A select1st or select2nd would already a great help. Wkr, me

2 1

Re: [Boost-users] shared_ptr compile error ms vc++ 8
by Andrew McDonald 24 Jul '06

24 Jul '06

you misunderstand....I was answering a prior question posted by bringiton asking how to diagnose the specific source code location of such errors when compiled using vc++ 8... not a question regarding whether or not such code is in error... My posting was an example confirming for bringiton that the error output produced by vc++ 8 specifically also referenced the module/line number that attempted to instantiate the shared_ptr template, rather than just the error location inside the shared_ptr header. Although I am now regretting posting.... ;) regards, Andrew > -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org]On Behalf Of > Bronek Kozicki > Sent: Monday, 24 July 2006 6:37 PM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] shared_ptr compile error ms vc++ 8 > > > Andrew McDonald wrote: > > Was an answer to a previous question regarding locating the > source of the error using vc++ 8 > > >>> When compiling the following line in a file example.cpp; > >>> > >>> boost::shared_ptr<int> p(new std::string) > > you would have error from any compiler, because this code is > illformed. There is > no conversion from std::string* to int* . > > > B. > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users >

3 2

How to detect overflow when use lexical_cast??
by 袁晓辉 24 Jul '06

24 Jul '06

Hi,all I want to cast string to long long type and handle overflow. I tested as follow. long long somevar = lexical_cast<long long>("123456789789789798879977978789787987879879787977897897897899879978798798798");//!!!!!!!!!!!!!! But it does not throw an exception!! It seem that casting to int does not have this kind of problem. int somevar2 = lexical_cast<int>("123456789789789798879977978789787987879");//will throw an exception

1 0

Re: [Boost-users] shared_ptr compile error ms vc++ 8
by Andrew McDonald 24 Jul '06

24 Jul '06

Was an answer to a previous question regarding locating the source of the error using vc++ 8 regards, Andrew > -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org]On Behalf Of > Mateusz Loskot > Sent: Monday, 24 July 2006 5:02 PM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] shared_ptr compile error ms vc++ 8 > > > Andrew McDonald wrote: > > I am using VC++ 2005 Express Edition v 8.0.050727.42. > > > > When compiling the following line in a file example.cpp; > > > > boost::shared_ptr<int> p(new std::string) > --------------------^^^-------------^^^^^^ > > int type is not a string type, and the other way. > > Best regards > -- > Mateusz Loskot > http://mateusz.loskot.net > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users >

2 1

Re: [Boost-users] shared_ptr compile error ms vc++ 8
by Andrew McDonald 24 Jul '06

24 Jul '06

I am using VC++ 2005 Express Edition v 8.0.050727.42. When compiling the following line in a file example.cpp; boost::shared_ptr<int> p(new std::string) the following error is produced (note the explicit mention of example.cpp(10) ): c:\Projects\boost\shared_ptr.hpp(125) : error C2440: 'initializing' : cannot convert from 'std::string *' to 'int *' Types pointed to are unrelated; conversion requires reinterpret_cast, C-style cast or function-style cast .\example.cpp(10) : see reference to function template instantiation 'boost::shared_ptr<T>::shared_ptr<std::string>(Y *)' being compiled with [ T=int, Y=std::string ] regards, Andrew McDonald System Architect Norwood Systems Australia Pty Ltd Level 1, 71 Troy Terrace PO Box 1281 Subiaco, WA 6904 Tel +61 8 9380 7766 Fax +61 8 9380 7733 The information in this email, and any attachments, may contain confidential information and is intended solely for the attention and use of the named addressee (s). It must not be disclosed to any person(s) without authorization. If you are not the intended recipient, or a person responsible for delivering it to the intended recipient, you are not authorized to, and must not, disclose, copy, distribute, or retain this message or any part of it. If you have received this communication in error, please notify the sender immediately.

2 1

manually calling constructor?
by bringiton bringiton 24 Jul '06

24 Jul '06

Is it possible to manually call the constructor of an object. It is possible to call the destructor (a trick i found from std::vector<T>::pop_back()) I stepped through the std::vector<T>::push_back() to find how they call the constructor for memory that has already been allocated, but I could not follow the code. Test3 t; t.~Test3(); // OK t.Test3(); // compile error

2 1

shared_ptr compile error ms vc++ 8
by bringiton bringiton 24 Jul '06

24 Jul '06

boost::shared_ptr<int> p(new std::string); In MS VC++ 6, the above will throw the following compile error: >>error C2440: 'initializing' : cannot convert from 'class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > *' to 'int *' The above is not very useful because it catches the error in the shared_ptr.hpp file. However, it is OK because because the compiler also has a reference to my line of code above: >>see reference to function template instantiation '__thiscall boost::shared_ptr<int>::boost::shared_ptr<int>(class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > *)' being compiled The above is all good. I however do not get the luxury of the additional reference in MS VC++ 8. Instead I just get the initial reference to shared_ptr.hpp. This makes it extremely difficult to track where the error because I have many pages that use the shared_ptr. - Can anyone suggest how I can get the 2nd reference to my own code in MS VC++ 8. - Am I missing something obvious? - BTW, in vc++ 8 i'm viewing the errors in a list (instead of the text dump). - I may need to look at the text dump to get the 2nd reference but was wondering if there was an easier solution - Sorry, I dont have vc++ 8 in front of me to give you the error

2 2

Re: [Boost-users] serialization on const member and map<const CLASS*, CLASS>
by Cheok Yan Cheng 24 Jul '06

24 Jul '06

Please take note that even the following simplest form won't work. Here is the full source code. Any suggestion? Thank you very much! #include <iostream> #include <sstream> #include <fstream> using namespace std; #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> class dd { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & i; } int i; }; class dummy { public: dummy() : d(0){} ~dummy(){} private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & const_cast<dd *>(d); } const dd *d; }; int main() { const dummy w; dummy r; // make an archive std::ofstream ofs("dummy"); boost::archive::text_oarchive oa(ofs); oa << w; std::ifstream ifs("dummy"); boost::archive::text_iarchive ia(ifs); ia >> r; } c:\Documents and Settings\yccheok\Desktop\xxx\main.cpp(34): error C2679: binary '&' : no operator found which takes a right-hand operand of type 'dd *' (or there is no acceptable conversion) __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

just starting with boost
by Fred J. 24 Jul '06

24 Jul '06

Hi I installed boost on my debian testing and read some examples and docs., however I failed to find some example on how one can read a data file in a matrix in-order to do some coloum arithmatics. any pointers will be appriciated. thanks --------------------------------- See the all-new, redesigned Yahoo.com. Check it out.

1 0

Re: [Boost-users] [multi_index] - duplicates_iterator.hpp issue?
by JOAQUIN LOPEZ MU?Z 23 Jul '06

23 Jul '06

Bogdan M. ha escrito: > > Hi, > > I am trying to serialize a multi-indexed container defined as > below ( I am using boost 1.33.1 ): [...] > > While serializing this container containing ===> several nodes > with the same key <===, I get an access violation exception > somewhere deep in the multi_index library. > Tracing a little bit back the stack I noticed something unusual in > boost_1_33_1\install\include\boost\multi_index\detail\ > duplicates_iterator.hpp > in the duplicates_iterator::sync() member function (around line 80): > > void sync() > { > if(pred(begin_chunk->value,node->value))advance(); > } > > This function seems to advance the iterator within a chunk of equal > keys. However, the if clause does not consider the case where > node == end. These are exactly the circumstances under which my > program crashes in 'pred(begin_chunk...)'. > Changing the if condition into > > void sync() > { > if( (node != end) && pred(begin_chunk->value,node->value)) > advance(); > } > > seems to fix the problem. However, I am not familiar with the > overall implementation and therefore I cannot tell whether this > is indeed the cause or whether there are side-effects > to my patch. > Has anyone else experienced a situation similar to this one? Hello Bogdan, You have certainly spotted a bug in duplicates_iterator.hpp, and the fix you propose is correct. As it happens, this was first reported some months ago: http://lists.boost.org/boost-users/2006/01/16710.php and the bug was fixed since then in the CVS, in what will become Boost 1.34. Until that release comes out, your local fix is perfect. Anyway, in case you can afford it, I recommend you switch now to the CVS version, as it contains a few other bugfixes. > Is there something wrong with my container definition, to > begin with? I don't see anything wrong with your container definition. > I really appreciate any feedback. > Thanks, > Bogdan Thank you for using Boost.MultiIndex, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

serialization on const member and map<const CLASS*, CLASS>
by Cheok Yan Cheng 23 Jul '06

23 Jul '06

Hi, I am trying to perform serialization on a const member const ImageRegion* imageRegion; By refering to http://www.boost.org/libs/serialization/doc/serialization.html#const, I thought the following code would work. friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & const_cast<ImageRegion *>(imageRegion); } However, I still get the following error is VC++ 2003 c:\yccheok\pcbvisionlib\FiducialPair.h(42): error C2679: binary '&' : no operator found which takes a right-hand operand of type 'ImageRegion *' (or there is no acceptable conversion) I had fully tested the ImageRegion class. Before this const member variable, it can be fully serialized with no problem. Any suggestion? Thank you! p/s By refering to the mailing list "(de)serializing vector<const A*>" http://groups.google.com/group/boost-list/browse_frm/thread/79dba906901d039…, does it mean that boost is also not allow to (de)serialize map<const CLASS*, CLASS> directly? Must I iterate through the map elements one by one to serialize them manually? __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

[multi_index] - duplicates_iterator.hpp issue?
by Bogdan M. 23 Jul '06

23 Jul '06

Hi, I am trying to serialize a multi-indexed container defined as below ( I am using boost 1.33.1 ): ____________________________________________________________________________ ___ /** Shorter id of namespaces. */ namespace bmi = boost::multi_index; /** Tags for accessing several indices defined below */ struct name_tag {}; class string_node { public: std::string m_name; friend class boost::serialization::access; void serialize ( boost::archive::polymorphic_iarchive & ar, const unsigned int file_version); void serialize ( boost::archive::polymorphic_oarchive & ar, const unsigned int file_version); }; /** Container of children of a node in the string tree */ typedef boost::multi_index_container< string_node*, bmi::indexed_by< bmi::sequenced<>, // sequenced type bmi::ordered_non_unique< bmi::tag<name_tag>, BOOST_MULTI_INDEX_MEMBER( string_node, const std::string, m_name)> > > node_set; ____________________________________________________________________________ ___ While serializing this container containing ===> several nodes with the same key <===, I get an access violation exception somewhere deep in the multi_index library. Tracing a little bit back the stack I noticed something unusual in boost_1_33_1\install\include\boost\multi_index\detail\duplicates_iterator.hp p in the duplicates_iterator::sync() member function (around line 80): ____________________________________________________________________________ ___ void sync() { if(pred(begin_chunk->value,node->value))advance(); } ____________________________________________________________________________ ___ This function seems to advance the iterator within a chunk of equal keys. However, the if clause does not consider the case where node == end. These are exactly the circumstances under which my program crashes in 'pred(begin_chunk...)'. Changing the if condition into ____________________________________________________________________________ ___ void sync() { if( (node != end) && pred(begin_chunk->value,node->value)) advance(); } ____________________________________________________________________________ ___ seems to fix the problem. However, I am not familiar with the overall implementation and therefore I cannot tell whether this is indeed the cause or whether there are side-effects to my patch. Has anyone else experienced a situation similar to this one? Is there something wrong with my container definition, to begin with? I really appreciate any feedback. Thanks, Bogdan

1 0

Re: [Boost-users] [Serialization] Problem serializing via baseclassptr
by Guy Létourneau 22 Jul '06

22 Jul '06

Robert, I've created a simple test as you suggested. The problem is that the test does not even build (in oserializer.hpp, there are 2 conditions for this to happen but none seems to match my test..). Here's what the compiler gives me: C:/Boost/include/boost-1_33_1/boost/archive/detail/oserializer.hpp: In function `void boost::archive::save(Archive&, T&) [with Archive = boost::archive::text_oarchive, T = A]': C:/Boost/include/boost-1_33_1/boost/archive/basic_text_oarchive.hpp:78: instantiated from `void boost::archive::basic_text_oarchive<Archive>::save_override(T&, int) [with T = A, Archive = boost::archive::text_oarchive]' C:/Boost/include/boost-1_33_1/boost/archive/detail/interface_oarchive.hpp:78: instantiated from `Archive& boost::archive::detail::interface_oarchive<Archive>::operator<<(T&) [with T = A, Archive = boost::archive::text_oarchive]' ../main.cpp:90: instantiated from here C:/Boost/include/boost-1_33_1/boost/archive/detail/oserializer.hpp:567: error: incomplete type `boost::STATIC_ASSERTION_FAILURE<false>' does not have member `value' #include <iostream> #include <fstream> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/serialization/export.hpp> class A { public: A() { i = 1; }; virtual ~A() { }; virtual void Dummy() = 0; private: int i; }; BOOST_IS_ABSTRACT(A) class B : public A { public: B() { }; virtual ~B() { }; void Dummy() { }; void SetValue( std::string& value ) { Data = value; } private: friend class boost::serialization::access; template <class Archive> void serialize( Archive& ar, const unsigned int version ) { ar & boost::serialization::base_object<A>( *this ); ar& Data; std::cout << "Serialization of B" << std::endl; std::cout.flush(); } std::string Data; }; BOOST_CLASS_EXPORT(B); int main() { // Create a B object B* Child = new B; // Set some data std::string Data = "test"; Child->SetValue( Data ); // Assign it to a A ptr A* Parent = Child; // create and open a character archive for output std::ofstream ofs( "filename" ); // save data to archive { try { boost::archive::text_oarchive oa( ofs ); // write class instance to archive oa << *Parent; } catch( boost::archive::archive_exception& e ) { std::cout << "Save failed! : " << e.what(); std::cout.flush(); return false; } catch( ... ) { std::cerr << "Unknown Exception " << std::endl; return false; } // archive and stream closed when destructors are called } delete Child; } The example is very simple. Again, I have problems only when serializing via a base class ptr (serializing object "directly" works fine). Thanks again for your help, Guy >Hmm - looks like it should work to me. > >I would try the following: > >a) make a tiny test - a main which which does nothing but tests the >serialization. >This you can ship to us in necessary. >b) For now - remove all the BOOST_CLASS_TRACKING macros. >It shouldn't make a difference but let's start simple. >c) You'll have to add BOOST_CLASS_EXPORT for SomeData >d) double check that everything is in the same namespace. >e) try removing the friend class boost::serialization::access; from >the base class. NonVolatileData::serialize(..) should never be called >by the serialization library in this case - so if this traps during >compile, >it will show a chain of "compile time calls". By looking at this chain >one can see where things went wrong. Unfortunately this requires >looking at the header source code - oh well. >f) double check that the test corresponding to your example builds >and runs in your environment. If that passes, but yours does not, try >modifying the test bit by bit by commenting out the code that is there >and replacing it with your own code. If you finish this and the test >still works - then just remove all the commented code and you'll be >done. > >Robert Ramey Guy Létourneau wrote: > Robert, > I've tried to include your changes but it doesn't solve the problem. > I had to add the following line: BOOST_IS_ABSTRACT(NonVolatileData) > for the program to compile. I agree with you, to have an abstract > class is what is needed in that case as the NonVolatileData class is > not intended to do something useful except for allowing my data > storage layer to be generic. However, abstract or not, I still have > the same problem: when serializing my SomeData object through a > pointer to the NonVolatileData, only the data of the parent class > gets serialized. Anything else you want me to try? > > Thanks, > Guy > >> Try making the base class polymorphic - that it define at least >> one abstract function. See my changes below. This will have >> the beneficial effect of inhibiting anyone from creating an instance >> of your base class directly. >> Robert Ramey > >> Guy Létourneau wrote: >>> Hello, >>> >>> I need to develop a generic data storage layer. Its job is to handle >>> the serialization of all objects that need to be persistent in my >>> system and handle management of archives, backups and restores and >>> so forth. The most important point is that it must stay generic, >>> i.e. have no knowledge of the type of objects being passed by other >>> modules in the system. Because of this, I define a base class >>> NonVolatileData from which all data classes in the system will >>> derive: >>> >>> /////////////////////////////////////////////////////////////////////// >>> // Base class >>> class NonVolatileData >>> { >>> friend >>> class boost::serialization::access; >>> >>> public: >>> >>> NonVolatileData(){ i = 1; }; >>> virtual ~NonVolatileData() = 0; // Note - pure virtual function >>> make class abstract- >>> >>> >>> protected: >>> >>> virtual void Dummy() =0; // Note - pure virtual function make >>> class abstract- >> ; >>> >>> int i; >>> template <class Archive> >>> void serialize( Archive& ar, const unsigned int version ) >>> { >>> ar & i; >>> } >>> }; >>> BOOST_CLASS_TRACKING(NonVolatileData, >>> boost::serialization::track_never) >>> >>> >>> class SomeData: public NonVolatileData >>> { >>> friend >>> class boost::serialization::access; >>> >>> public: >>> >>> SomeData () >>> { >>> }; >>> >>> ~SomeData () >>> { >>> }; >>> >>> void SetValue( std::string& Address ) >>> { >>> this->Address = Address; >>> } >>> >>> void Dummy() >>> { >>> } >>> >>> private: >>> >>> template <class Archive> >>> void serialize( Archive& ar, const unsigned int version ) >>> { >>> ar & >>> >>> boost::serialization::base_object<NonVolatileData>(*this); >>> ar& Address; } >>> >>> std::string Address; >>> }; >>> BOOST_CLASS_TRACKING(SomeData, boost::serialization::track_never) >>> ///////////////////////////////////////////////////////////////// >>> >>> My data storage interface will take a ptr to the base class i.e. >>> Save(NonVolatileData* data) so the serialization will be performed >>> through a ptr to the base class. I've read the documentation >>> multiple times and I'm still unable to make that work correctly. >>> When a do a save, only the base class is serialized even though the >>> base class is polymorphic. I've tried using the >>> BOOST_CLASS_EXPORT_GUID macro the force a registration of my derived >>> class without success. I've also checked the example from demo.cpp. >>> It uses the direct call to register_type() but in my case, I don't >>> want to change the code everytime a new class is defined in the >>> system so I went with option 2 (the macro). There's probably a >>> subtle detail I do not do correctly (polite way of saying I'm >>> missing something :-)). >>> >>> Thanks for your help, >>> >>> Guy Letourneau =

2 1

[serialization] Skipping unexpected elements in XML archive
by Todd Greer 22 Jul '06

22 Jul '06

Hi, I'm using the Serialization library, but need to skip unrecognized data when reading in an archive. This is for forward compatability purposes; I need for older versions of my software to consume files produced by newer ones, which may have added elements. As this functionality is not currently in the library, I have created a new archive type (as I think Robert Ramey suggested at some point). It inherits from xml_iarchive_impl and overrides load_override to identify when it has just read an opening tag with an unexpected name. It then skips whatever XML it finds within the unexpected element, reads the closing tag, and returns to normal processing. I use it with the unaltered xml_oarchive, and the pair satisfy my requirements. I'm including it below in the hopes that someone will find it useful. I've tested it on MSVC 7.1 (Visual Studio .NET 2003) with a reasonably complex XML file with both nested and non-nested unexpected elements. If you'd like, I can post some tests as well (I just need to strip out some project-specific details). Please let me know if you see any places where it could be improved, or where I've completely missed something; this is my first use of the serialization library, and my understanding is far from comprehensive. Many thanks to all who've contributed to the Serialization library, Todd Greer <tgreer <at> affinegy dot com> Senior Software Developer, Affinegy LLC #include <boost/archive/xml_iarchive.hpp> #include <boost/range/end.hpp> #include <algorithm> const char whitespace[] = " \t\n\r"; //Skip whitespace, then return true if we're looking at '</'. //Leave the stream right before the '<'. template<class IStream> bool at_close_tag(IStream& is) { char ch; using boost::end; do { ch = is.get(); } while(std::find(whitespace, end(whitespace), ch) != end(whitespace)); assert(ch == '<'); ch = is.get(); bool const end_tag = ch == '/'; is.putback(ch); is.putback('<'); return end_tag; } template<class Archive> class skip_xml_iarchive_impl: public boost::archive::xml_iarchive_impl<Archive> { #if BOOST_WORKAROUND(BOOST_MSVC, <= 1300) //see xml_iarchive_impl public: #elif defined(BOOST_MSVC) friend boost::archive::detail::interface_iarchive<Archive>; protected: #else friend class boost::archive::detail::interface_iarchive<Archive>; protected: #endif skip_xml_iarchive_impl(std::istream & is, unsigned int flags = 0): xml_iarchive_impl<Archive>(is, flags) {} void skip_all_elements() { std::string ignore; if(this->This()->gimpl->parse_string(this->This()->get_is(), ignore) && ignore.npos != ignore.find_first_not_of(whitespace)) return; //We're either looking at a start tag or an end tag. while(!at_close_tag(this->This()->get_is())) {//It's a start tag. if(!this->This()->gimpl->parse_start_tag(this->This()->get_is())) boost::throw_exception(archive_exception(archive_exception::stream_error )); ++depth; std::string const name = this->This()->gimpl->rv.object_name; skip_all_elements(); load_end(name.c_str()); } } template<class T> void load_override( #ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING const #endif boost::serialization::nvp<T> & t, int ){ if(!t.name()) return xml_iarchive_impl<Archive>::load_override(t, 0); load_start(t.name()); // don't check start tag at highest level const std::string name_found = this->This()->gimpl->rv.object_name; bool const skip = depth > 1 && 0 != (this->get_flags() & no_xml_tag_checking) && name_found != t.name(); if(skip) skip_all_elements(); else boost::archive::load(* this->This(), t.value()); load_end(skip ? name_found.c_str() : t.name()); if(skip) //We still haven't loaded t... load_override(t, 0); //...so load t. } template<class T> void load_override(T & t, BOOST_PFTO int i) { xml_iarchive_impl<Archive>::load_override(t, i); } }; class skip_xml_iarchive: public skip_xml_iarchive_impl<skip_xml_iarchive> { public: skip_xml_iarchive(std::istream & is, unsigned int flags = 0) : skip_xml_iarchive_impl<skip_xml_iarchive>(is, flags) {} }; -- Todd Greer <tgreer <at> affinegy dot com> Senior Software Developer, Affinegy LLC

3 2

bjam crashes when building Boost on Windows
by Adam Wright 22 Jul '06

22 Jul '06

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi all, When trying to build boost 1.33.1 this afternoon, I encountered a problem with bjam just crashing every time I invoked it when targeting Windows. I've debugged the problem as being files with dates < 1900 in directories being searched by the glob expansions (I had a rogue file from 1757 in C:\Windows\). file_dirscan in filent.c invokes the MSCRT function _tfindnext64i32, which will eventually assert if the date is too far back in time. It's a documented limitation of the function, so my suggestion would be to FAQ this "bug" for the (very few) people it's likely to bite. Thanks, adamw -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.2.3 (MingW32) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org iD8DBQFEwlW/9mihfAI44D0RAtyDAJ46wfH9UBhsz58nNTtKTyftI0l1igCghVD1 s18ec8+vbIevjIskC40W9Rc= =i7Ap -----END PGP SIGNATURE-----

1 0

[mpl] Combining Type Sequences
by Eric Lemings 22 Jul '06

22 Jul '06

Giving the following code: #include <boost/mpl/integral_c.hpp> namespace mpl = boost::mpl; template < unsigned U, int I = 1 > struct T : mpl::integral_c< unsigned, U > { BOOST_STATIC_CONST(int, N = I); }; and two vectors of type T of varying lengths: typedef mpl::vector < T<0>, T<1>, T<2> > t1; typedef mpl::vector < T<2, 2>, T<0, 0> > t2; How would you create a joint view of t1 and t2, sorted by increasing U values, where all elements of t1 and t2 that have the same U value have their N constants added together. In the example above, the resulting type t0 would be equivalent to: typedef mpl::vector < T<0, 1>, T<1, 1>, T<2, 3> > t0; Thanks, Eric.

2 1

[iterator]counting_iterator question
by Sean Huang 22 Jul '06

22 Jul '06

I encountered some problems while using counting_iterator. Suppose we have a range called RangeType, and we define: typedef boost::counting_iterator< boost::range_value< RangeType >::type > MyCountingIterator; if I do: std::vector< int > vec( 100 ); std::vector< int >:: iterator iter = vec.begin() + ( countingIter2 - counitingIter1 ); VC8 would then complain about a conversion from __int64 to int because the difference type of MyCountingIterator (using default) is __int64. Since we treat warnings as errors. I then changed MyCountingIterator to typedef boost::counting_iterator< boost::range_value< RangeType >::type, boost::use_default, boost::range_difference< RangeType >::type > MyCountingIterator; This time I got a different error: iterator_facade.hpp(554) : error C2784: '__w64 int boost::counting_iterator<Incrementable,CategoryOrTraversal,Difference>::distance_to(const boost::counting_iterator<OtherIncrementable> &) const' : could not deduce template argument for 'const boost::counting_iterator<OtherIncrementable> &' from 'const boost::counting_iterator<Incrementable,CategoryOrTraversal,Difference>' My question is why limiting the last three template parameters to default in counting_iterator::distance_to. Thanks, Sean

2 3

cast shared_array<T> to shared_array<const T>
by Jarda Grešula 21 Jul '06

21 Jul '06

Hello, is there any reason, why the conversion below is not supported, whereas the same conversion works for shared_ptr? shared_array<int> i; shared_array<const int> ci(i); // not possible Thanks, Jarda.

1 0

newbie:BoostGraphLibrary - brandes_betweenness -> closenness
by Ioannis Filippis 21 Jul '06

21 Jul '06

Hi all, I wonder whether it is possible to calculate the closenness centrality using the brandes_betweenness_centrality. The closeness centrality of a vertex is defined by the inverse of the average length of the shortest paths to/from all the other vertices in the graph. I know that in theory this is possible and it would actually save a lot of time if someone wants to calculate both properties. Currently I am running brandes_betweenness like this brandes_betweenness_centrality(g, get(&VertexInfo::betweenness, g), get(&EdgeInfo::betweenness, g)); I prefer bundled properties as for me are more clear in concept. I wonder whether: a.I could use Util parameters like DistanceMap to calculate closenness. However, I can not really understand how I can create an iterator_property_map using bundled properties. OR b.I have to modify the brandes_betweenness_centrality to calculate also closenness. I apologise in case the answer to my problem is trivial but I am just newbie in the Boost Graph Library. Thanks for your help. Ioannis

1 0

BGL serialization
by Camilo Melani 21 Jul '06

21 Jul '06

Hello, I'd like to save and restore a adjacency_list graph in a XML file, Does anyone has some example code or can help me? I can serialize std::map and others classes, but when I try to serialize the graph I get compiler errors. Thank for the help!! Camilo Some part of the code: #include <boost/config.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/adj_list_serialize.hpp> #include <boost/dynamic_bitset.hpp> #include <boost/archive/xml_iarchive.hpp> #include <boost/serialization/map.hpp> typedef adjacency_list< vecS, vecS, bidirectionalS, no_property, no_property > Graph; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & BOOST_SERIALIZATION_NVP(graph); } Error!!! C:\Boost\include\boost-1_35\boost/archive/basic_xml_oarchive.hpp(86) : error C2664: 'boost::mpl::assertion_failed' : cannot convert parameter 1 from 'boost::mpl::failed ************boost::serialization::is_wrapper<T>::* ***********' to 'boost::mpl::assert<false>::type' with [ T=boost::no_property ] No constructor could take the source type, or constructor overload resolution was ambiguous __________________________________________________ Preguntá. Respondé. Descubrí. Todo lo que querías saber, y lo que ni imaginabas, está en Yahoo! Respuestas (Beta). ¡Probalo ya! http://www.yahoo.com.ar/respuestas

1 0

Re: [Boost-users] [Serialization] Problem serializing via baseclassptr
by Guy Létourneau 21 Jul '06

21 Jul '06

Any updates on my problem Robert? Thanks, Guy > >Robert, > >I've created a simple test as you suggested. The problem is that the test >does not even build (in oserializer.hpp, there are 2 conditions for this to >happen but none seems to match my test..). Here's what the compiler gives >me: > >C:/Boost/include/boost-1_33_1/boost/archive/detail/oserializer.hpp: In >function `void boost::archive::save(Archive&, T&) [with Archive = >boost::archive::text_oarchive, T = A]': >C:/Boost/include/boost-1_33_1/boost/archive/basic_text_oarchive.hpp:78: >instantiated from `void >boost::archive::basic_text_oarchive<Archive>::save_override(T&, int) [with >T = A, Archive = boost::archive::text_oarchive]' >1_33_1/boost/archive/detail/interface_oarchive.hpp:78: instantiated from >`Archive& >boost::archive::detail::interface_oarchive<Archive>::operator<<(T&) [with T >= A, Archive = boost::archive::text_oarchive]' >../main.cpp:90: instantiated from here >C:/Boost/include/boost-1_33_1/boost/archive/detail/oserializer.hpp:567: >error: incomplete type `boost::STATIC_ASSERTION_FAILURE<false>' does not >have member `value' >#include <iostream> >#include <fstream> >#include <boost/archive/text_oarchive.hpp> >#include <boost/archive/text_iarchive.hpp> >#include <boost/serialization/export.hpp> > >class A >{ > public: > > A() > { > i = 1; > }; > > virtual ~A() > { > }; > > virtual void Dummy() = 0; > > private: > > int i; >}; >BOOST_IS_ABSTRACT(A) > >class B : public A >{ > public: > > B() > { > }; > > virtual ~B() > { > }; > > void Dummy() > { > }; > > void SetValue( std::string& value ) > { > Data = value; > } > > private: > > friend > class boost::serialization::access; > > template <class Archive> > void serialize( Archive& ar, const unsigned int version ) > { > ar & boost::serialization::base_object<A>( *this ); > ar& Data; > std::cout << "Serialization of B" << std::endl; > std::cout.flush(); > } > > std::string Data; >}; >BOOST_CLASS_EXPORT(B); >int main() >{ > // Create a B object > B* Child = new B; > > // Set some data > std::string Data = "test"; > Child->SetValue( Data ); > > // Assign it to a A ptr > A* Parent = Child; > > // create and open a character archive for output > std::ofstream ofs( "filename" ); > > // save data to archive > { > try > { > boost::archive::text_oarchive oa( ofs ); > // write class instance to archive > oa << *Parent; > } > catch( boost::archive::archive_exception& e ) > { > std::cout << "Save failed! : " << e.what(); > std::cout.flush(); > > return false; > } > catch( ... ) > { > std::cerr << "Unknown Exception " << std::endl; > > return false; > } > > // archive and stream closed when destructors are called > } > > delete Child; >} > >The example is very simple. Again, I have problems only when serializing >via a base class ptr (serializing object "directly" works fine). > >Thanks again for your help, > >Guy >Hmm - looks like it should work to me. > >I would try the following: > >a) make a tiny test - a main which which does nothing but tests the >serialization. >This you can ship to us in necessary. >b) For now - remove all the BOOST_CLASS_TRACKING macros. >It shouldn't make a difference but let's start simple. >c) You'll have to add BOOST_CLASS_EXPORT for SomeData >d) double check that everything is in the same namespace. >e) try removing the friend class boost::serialization::access; from >the base class. NonVolatileData::serialize(..) should never be called >by the serialization library in this case - so if this traps during >compile, >it will show a chain of "compile time calls". By looking at this chain >one can see where things went wrong. Unfortunately this requires >looking at the header source code - oh well. >f) double check that the test corresponding to your example builds >and runs in your environment. If that passes, but yours does not, try >modifying the test bit by bit by commenting out the code that is there >and replacing it with your own code. If you finish this and the test >still works - then just remove all the commented code and you'll be >done. > >Robert Ramey Guy Létourneau wrote: > Robert, > I've tried to include your changes but it doesn't solve the problem. > I had to add the following line: BOOST_IS_ABSTRACT(NonVolatileData) > for the program to compile. I agree with you, to have an abstract > class is what is needed in that case as the NonVolatileData class is > not intended to do something useful except for allowing my data > storage layer to be generic. However, abstract or not, I still have > the same problem: when serializing my SomeData object through a > pointer to the NonVolatileData, only the data of the parent class > gets serialized. Anything else you want me to try? > > Thanks, > Guy > >> Try making the base class polymorphic - that it define at least >> one abstract function. See my changes below. This will have >> the beneficial effect of inhibiting anyone from creating an instance >> of your base class directly. >> Robert Ramey > >> Guy Létourneau wrote: >>> Hello, >>> >>> I need to develop a generic data storage layer. Its job is to handle >>> the serialization of all objects that need to be persistent in my >>> system and handle management of archives, backups and restores and >>> so forth. The most important point is that it must stay generic, >>> i.e. have no knowledge of the type of objects being passed by other >>> modules in the system. Because of this, I define a base class >>> NonVolatileData from which all data classes in the system will >>> derive: >>> >>> /////////////////////////////////////////////////////////////////////// >>> // Base class >>> class NonVolatileData >>> { >>> friend >>> class boost::serialization::access; >>> >>> public: >>> >>> NonVolatileData(){ i = 1; }; >>> virtual ~NonVolatileData() = 0; // Note - pure virtual function >>> make class abstract- >>> >>> >>> protected: >>> >>> virtual void Dummy() =0; // Note - pure virtual function make >>> class abstract- >> ; >>> >>> int i; >>> template <class Archive> >>> void serialize( Archive& ar, const unsigned int version ) >>> { >>> ar & i; >>> } >>> }; >>> BOOST_CLASS_TRACKING(NonVolatileData, >>> boost::serialization::track_never) >>> >>> >>> class SomeData: public NonVolatileData >>> { >>> friend >>> class boost::serialization::access; >>> >>> public: >>> >>> SomeData () >>> { >>> }; >>> >>> ~SomeData () >>> { >>> }; >>> >>> void SetValue( std::string& Address ) >>> { >>> this->Address = Address; >>> } >>> >>> void Dummy() >>> { >>> } >>> >>> private: >>> >>> template <class Archive> >>> void serialize( Archive& ar, const unsigned int version ) >>> { >>> ar & >>> >>> boost::serialization::base_object<NonVolatileData>(*this); >>> ar& Address; } >>> >>> std::string Address; >>> }; >>> BOOST_CLASS_TRACKING(SomeData, boost::serialization::track_never) >>> ///////////////////////////////////////////////////////////////// >>> >>> My data storage interface will take a ptr to the base class i.e. >>> Save(NonVolatileData* data) so the serialization will be performed >>> through a ptr to the base class. I've read the documentation >>> multiple times and I'm still unable to make that work correctly. >>> When a do a save, only the base class is serialized even though the >>> base class is polymorphic. I've tried using the >>> BOOST_CLASS_EXPORT_GUID macro the force a registration of my derived >>> class without success. I've also checked the example from demo.cpp. >>> It uses the direct call to register_type() but in my case, I don't >>> want to change the code everytime a new class is defined in the >>> system so I went with option 2 (the macro). There's probably a >>> subtle detail I do not do correctly (polite way of saying I'm >>> missing something :-)). >>> >>> Thanks for your help, >>> >>> Guy Letourneau =

1 0

Re: [Boost-users] [serialization] Skipping unexpected elements in XMLarchive
by Todd Greer 21 Jul '06

21 Jul '06

Peter wrote: > The additional need I'm trying to solve is that the XML elements can be > reordered, i.e. come in a different order than the serialization lib > expects them. You could store whatever XML elements you skip. Then, every time you get a request to read something, first check the stored XML. You would need to have a stack of storage locations to correspond to how deep you are in the XML hierarchy and discard the XML elements on the top of the stack when you parse an end tag. I think that would work, as long as you don't mind having to buffer some XML. Another approach would be to store pointers to the variables that are passed into the serialization library, rather than storing the XML. Then, when reading an XML open tag, look in your set of stored pointers for a match and deserialize into it. I'm not sure whether or not this could be made to work with the current Serialization library. Basically, to support reordering, you need to buffer one side or the other. Buffering the XML would probably work better with the current Serialization library, but would be less efficient. HTH, Todd Greer <tgreer <at> affinegy dot com> Senior Software Developer, Affinegy LLC

1 0

Re: [Boost-users] [python], [regex] Segmentation fault when deallocating match_results in a python extension module
by bernhard.maeder＠zkb.ch 21 Jul '06

21 Jul '06

Arrr, I've now compiled the example on different machines (Windows, MacOS) and it seems I'm only getting into troubles on my target system (Debian)... I've used ldd to get the library dependencies of my extension modules; the difference between building with gcc3.3 and gcc3.4 is with the libstdc++, which is used in version 5 and 6, respectively. But since python doesn't use this library, this should make no difference at all. Is there anything else I could possibly try? Thanks Bernhard "John Maddock" <john(a)johnmaddock.co.uk> Gesendet von: boost-users-bounces(a)lists.boost.org 19.07.2006 13:53 Bitte antworten an boost-users An: <boost-users(a)lists.boost.org> Kopie: Thema: Re: [Boost-users] [python], [regex] Segmentation fault when deallocating match_results in a python extension module bernhard.maeder(a)zkb.ch wrote: >> Hello everybody >> The program aborts when exiting test_func(), during deallocation of >> match_results. The error occurs somewhere in _M_deallocate of >> stl_vector.h. >> >> Can anybody help me with this problem? What could possibly go wrong >> here? In theory not much :-( >> One thing I noted: python is compiled using GCC3.3 on our system, >> while we are using GCC3.4, is this a problem? (But, trying the same >> on a system with GCC 4 for both, python and our app, also fails, so >> it seems like the problem is to be sought elsewhere). It does sound like the std::vector is allocating with one one allocator and deallocating with another. But I know nothing about python extension modules and what can go wrong there. John. _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

File Manipulation
by Simon Reye 21 Jul '06

21 Jul '06

I've had a look through the iostream stuff but my head can't think straight this late in the week. I require two things: 1. The ability to truncate and grow a file. I see the seek/write functions which I'm guessing will take care of my growth needs but what about truncation? 2. The ability to memory map a file. I saw mapped_file which I guess is the one. Simon

3 10

Re: [Boost-users] Valid arguments for boost::math::gcd()
by james.jones＠firstinvestors.com 20 Jul '06

20 Jul '06

From: "Matthias Hofmann" <hofmann(a)anvil-soft.com> > Also, I would like to know how the greatest common divisor is defined when > one or both of the arguments are zero. In that case, boost::math::gcd() > seems to return the nonzero argument, if there is any - but is this > mathematically correct? Yes, it's correct. gcd(a,b) is the greatest integer n such that n|a and n|b. Every integer n has the property that n|0, so gcd(a,0) = a. - James Jones Administrative Data Mgmt. Webmaster 375 Raritan Center Pkwy, Suite A Data Architect Edison, NJ 08837

2 1

[endian] Endian types in union
by Dave Dribin 20 Jul '06

20 Jul '06

Hello, This may be more appropriate for the devel list, but someone just pointed out on this list that an endian library has been submitted for approval. I've *just* needed classes like this (actually I wrote my own similar classes), and decided to see how the Boost library stacked up. It looks quite nice, and I'd be excited to see this included. One suggestion I would make is that the endian classes should not have constructors. As of version 0.5, trying to put them into a union causes a compiler error. Take the struct from the example, and add a union: struct header { big4_t file_code; big4_t file_length; little4_t version; little4_t shape_type; union { big4_t foo; little4_t bar; } baz; }; I get the following errors: endian_example.cpp:37: error: member 'boost::integer::big4_t <unnamed>::header::<anonymous union>::foo' with constructor not allowed in union endian_example.cpp:38: error: member 'boost::integer::little4_t <unnamed>::header::<anonymous union>::bar' with constructor not allowed in union By removing all constructors, the errors go away. I cam across this very issue when developing my classes, and found the answer in this comp.lang.c++.moderated post: <http://groups.google.com/group/comp.lang.c++.moderated/msg/ 103835a7b493723e?hl=en&> As an experiment, I modified boost/integer/endian.hpp to remove the constructors, and add an operator=() to see if this worked, and it did: template <typename T, std::size_t n_bytes> class endian< big, T, n_bytes, unaligned > : cover_operators< endian< big, T, n_bytes >, T > { public: typedef T value_type; operator T() const { return detail::load_big_endian<T, n_bytes>(bytes); } void operator=(T i) { detail::store_big_endian<T, n_bytes> (bytes, i); } private: char bytes[n_bytes]; }; I'd suggest making this change to all classes so that they can be used in unions. -Dave

2 7

boost::minmax_element 2D points bounding box
by Tomas Rapkauskas 20 Jul '06

20 Jul '06

Hello, I am newbie using boost library. I have tried to use boost::minmax_element to calculate bounding box of 2D Points, but I failed... Here is some code: struct S2DPoint { int x; int y; }; typedef std::vector<S2DPoint > Poly; Poly vect; ... std::pair<iterator, iterator> result = boost::minmax_element(poly.begin(), poly.end()); this code does not compiles I need to define BinaryPredicate.. My code with out boost looks: bool CalcPolyMinMax(const S2DPoint poly[], int nCount, S2DPoint &ptMin, S2DPoint &ptMax) { if ( nCount < 1 ) { return false; } ptMin = poly[0]; ptMax = poly[0]; S2DPoint pt; for ( int i1 = 0; i1 < nCount; ++i1 ) { pt = poly[i1]; UpdateMinMaxPoints(ptMin, ptMax, pt); } return true; } void UpdateMinMaxPoints(S2DPoint &ptMin, S2DPoint &ptMax, const S2DPoint &pt) { if ( ptMin.x > pt.x ) { ptMin.x = pt.x; } if ( ptMax.x < pt.x ) { ptMax.x = pt.x; } if ( ptMin.y > pt.y ) { ptMin.y = pt.y; } if ( ptMax.y < pt.y ) { ptMax.y = pt.y; } } Question: How to transform UpdateMinMaxPoints function to the BinaryPredicate? Thanks, Tomas

2 1

Valid arguments for boost::math::gcd()
by Matthias Hofmann 20 Jul '06

20 Jul '06

Hello everybody, I just learned that boost offers a function to determine the greatest common divisor of two integers, as described here: http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_math/g reatest_common_divisor_and_least_common_multiple.html However, this documentation is not very clear about which arguments are valid for boost::math::gcd(). In particular, it does not specify that the first argument has to be greater than the second one, although this seems to be a requirement with the current implementation. Also, I would like to know how the greatest common divisor is defined when one or both of the arguments are zero. In that case, boost::math::gcd() seems to return the nonzero argument, if there is any - but is this mathematically correct? -- Matthias Hofmann Anvil-Soft, CEO http://www.anvil-soft.com - The Creators of Toilet Tycoon http://www.anvil-soft.de - Die Macher des Klomanagers

1 0

[bgl] Problem with topological_sort
by Loïc Joly 20 Jul '06

20 Jul '06

Hello, When I run the example code of topo_sort.cpp in the BGL examples folder, it works perfectly. However, if I replace in this example: typedef adjacency_list<vecS, vecS, directedS, property<vertex_color_t, default_color_type> > Graph; By: typedef adjacency_list<listS, listS, directedS, property<vertex_color_t, default_color_type, property<vertex_index_t, int > > > Graph; It compiles, but during execution, some assert occurs. This assert occurs deep within my std::vector implementation (msvc8.0), in the call stack, the latest reference to boost is > TopoSort.exe!boost::iterator_property_map<std::_Vector_iterator<enum boost::default_color_type,std::allocator<enum boost::default_color_type> >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<enum boost::vertex_color_t,enum boost::default_color_type,boost::property<enum boost::vertex_index_t,int,boost::no_property> >,boost::no_property,boost::no_property,boost::listS>,int,int const &,enum boost::vertex_index_t>,enum boost::default_color_type,enum boost::default_color_type &>::operator[](void * v=0x00355eb8) Line 349 + 0x67 bytes C++ Or, for people who don't read msvc on a daily basis, it indicated the line 350 of property_map.cpp : /*template<...> class iterator_property_map : ... { */ inline R operator[](key_type v) const { return *(iter + get(index, v)) ; } Does anybody have any idea of what the problem might be ? Best regards, -- Loïc

2 2

[function]unwanted conversion
by Sean Huang 20 Jul '06

20 Jul '06

I was surprised that the following code compiled: #include <boost/function.hpp> int main(int argc, char argv[]) { typedef boost::function< void ( void ) > MyFunction; MyFunction test1 = char(); MyFunction test2 = 0; return 0; } Is there any reason why boost::function allows such conversions? Thanks, Sean

2 2

Re: [Boost-users] [function]unwanted conversion
by Sohail Somani 19 Jul '06

19 Jul '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Sean Huang > Sent: Wednesday, July 19, 2006 1:22 PM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] [function]unwanted conversion > > I was surprised that the following code compiled: > > #include <boost/function.hpp> > > int main(int argc, char argv[]) > { > typedef boost::function< void ( void ) > MyFunction; > MyFunction test1 = char(); > MyFunction test2 = 0; > return 0; > } That is a funny one... I wonder if its interpreting it as a function pointer because its 0. If you try it with a non-zero value it doesn't work.

1 0

Re: [Boost-users] Asio & strand & threads
by Zola 19 Jul '06

19 Jul '06

Boosters, Ok -- turns out I really didn't know what I was doing. And I really didn't want strand at all- I'm still fuzzy on strand. But here's the code for what I really did want. And the thread group is handling the Handlers properly. Now my question is... Why is a deadline timer the way it is? What's it good for? Why isn't a delay/timer like a wrapper, that you can give a function object to, and then push that into the io_service queue with a delay? So you could do something like, io_s.post(deadline_timer(boost::posix_time::milliseconds(100), &f)); ? - Zola #include <iostream> #include <boost/asio.hpp> #include <boost/thread/thread.hpp> #include <boost/thread/mutex.hpp> #include <boost/thread/xtime.hpp> #include <boost/bind.hpp> #include <boost/function.hpp> #include <boost/ref.hpp> #include <boost/date_time/posix_time/posix_time.hpp> #include <vector> namespace asio = boost::asio; int const num_threads = 10; std::vector<boost::thread*> tv(num_threads); boost::mutex tv_mutex; boost::mutex io_mutex; class Test { public: Test(asio::io_service& io_s, unsigned int n) : io_s(io_s), n(n), f(boost::bind(&Test::print, this)) { io_s.post(f); } void print() { if (n >= 0) { { boost::mutex::scoped_lock lock(io_mutex); std::cout << "(thread=" << thread_num() << ") "; std::cout << "Timer: " << n << std::endl; } { boost::mutex::scoped_lock lock(m_mutex); io_s.post(f); --n; } boost::xtime xt; boost::xtime_get(&xt, boost::TIME_UTC); xt.sec += 1; boost::thread::sleep(xt); } } int thread_num() { boost::thread t; for (int i=0; i<num_threads; ++i) { boost::mutex::scoped_lock lock(tv_mutex); if (tv[i] && (*tv[i] == t)) { return i; } } return -1; } private: asio::io_service& io_s; unsigned int n; boost::function<void()> f; boost::mutex m_mutex; }; int main() { asio::io_service io_s; Test t(io_s, 1000); boost::thread_group threads; for (int i=0; i<num_threads; ++i) { boost::mutex::scoped_lock lock(tv_mutex); tv[i] = threads.create_thread(boost::bind(&asio::io_service::run, boost::ref(io_s))); } threads.join_all(); }

1 0

Asio & strand & threads
by Zola 19 Jul '06

19 Jul '06

Hi Boosters, I'm trying to figure out how Asio's strand works. My concept of strand is a bit blurry. Asio's Timer.5 tutorial says: "An boost::asio::strand<http://asio.sourceforge.net/boost_asio_0_3_7/libs/asio/doc/reference/a00260…>guarantees that, for those handlers that are dispatched through it, an executing handler will be allowed to complete before the next one is started. This is guaranteed irrespective of the number of threads that are calling boost::asio::io_service::run()<http://asio.sourceforge.net/boost_asio_0_3_7/libs/asio/doc/reference/a00139…>. Of course, the handlers may still execute concurrently with other handlers that were *not* dispatched through an boost::asio::strand<http://asio.sourceforge.net/boost_asio_0_3_7/libs/asio/doc/reference/a00260…>, or were dispatched through a different boost::asio::strand<http://asio.sourceforge.net/boost_asio_0_3_7/libs/asio/doc/reference/a00260…>object." Asio's documentation for boost::asio::io_service::run says: "Run the io_service's event processing loop. The run()<http://asio.sourceforge.net/boost_asio_0_3_7/libs/asio/doc/reference/a00139…>function blocks until all work has finished and there are no more handlers to be dispatched, or until the io_service<http://asio.sourceforge.net/boost_asio_0_3_7/libs/asio/doc/reference/a00139…>has been interrupted. Multiple threads may call the run()<http://asio.sourceforge.net/boost_asio_0_3_7/libs/asio/doc/reference/a00139…>function to set up a pool of threads from which the io_service<http://asio.sourceforge.net/boost_asio_0_3_7/libs/asio/doc/reference/a00139…>may execute handlers." The key here is "Multiple threads may call the run()<http://asio.sourceforge.net/boost_asio_0_3_7/libs/asio/doc/reference/a00139…>function to set up a pool of threads from which the io_service<http://asio.sourceforge.net/boost_asio_0_3_7/libs/asio/doc/reference/a00139…>may execute handlers." -- This implies to me that it's automatic, and the thread pool will take whatever work it can. I've created a little example which has ten threads calling io_service::run, and printing out which thread is calling a handler given to the deadline timer. The issue here is that when I run this Test, the same thread is calling print() every time, no matter what I do. My understanding of this Test is as so: io_service holds a queue of asynchronous events. You fill up the io service with events, and then you call run on it. If multiple threads call run, they'll do whatever work they can. I'm calling run from 10 threads: Each thread will see what events are there, and handle them if possible. The asynchronous waits are calling a strand wrapper. The strand wrapper is like a mutex, and ensures that no two threads will call print() at the same time. What is going on, and why is the same thread calling print() every time? Is my understanding here completely wrong? - Zola // The Test: #include <iostream> #include <boost/asio.hpp> #include <boost/thread/thread.hpp> #include <boost/bind.hpp> #include <boost/function.hpp> #include <boost/date_time/posix_time/posix_time.hpp> #include <vector> namespace asio = boost::asio; int const num_threads = 10; std::vector<boost::thread*> tv(num_threads); class Test { public: Test(asio::io_service& io, int n, int ms) : n(n), ms(ms), s(io), dt(io, boost::posix_time::milliseconds(ms)), f(boost::bind(&Test::print, this)) { dt.async_wait(s.wrap(f)); } void print() { if (n >= 0) { boost::thread t; for (int i=0; i<num_threads; ++i) { if (tv[i] && (*tv[i] == t)) { std::cout << "(thread=" << i << ") "; break; } } std::cout << "Timer: " << n << std::endl; --n; dt.expires_at(dt.expires_at() + boost::posix_time::milliseconds(ms)); dt.async_wait(s.wrap(f)); } } private: int n; unsigned int ms; asio::strand s; asio::deadline_timer dt; boost::function<void (asio::error&)> f; }; int main() { asio::io_service io; Test t(io, 1000, 5); // 1000 iterations, every 5 ms. boost::thread_group threads; for (int i=0; i<num_threads; ++i) { tv[i] = threads.create_thread(boost::bind(&asio::io_service::run, &io)); } threads.join_all(); }

1 0

adding -fPIC flag for AMD64
by Scott Amort 19 Jul '06

19 Jul '06

Hi All, I am trying to statically link a shared library I am developing with the Boost Regex library. I get the following error: /usr/lib/gcc/x86_64-pc-linux-gnu/4.1.1/../../../../x86_64-pc-linux-gnu/bin/ld: /usr/lib64/libboost_regex.a(instances.o): relocation R_X86_64_32 against `boost::object_cache<boost::re_detail::cpp_regex_traits_base<char>, boost::re_detail::cpp_regex_traits_implementation<char> >::do_get(boost::re_detail::cpp_regex_traits_base<char> const&, unsigned long)::s_data' can not be used when making a shared object; recompile with -fPIC I have run across this once before, and although I am not really clear why, it appears that on my AMD64 platform, if I try to link a static library into a shared library, that static library needs to be compiled with -fPIC (this requirement does not exist for normal x86 platforms). My question is: is there an already available option that I can add when compiling the Boost libraries to enable this setting? I am not at all familiar with the BJam build system. Thanks for any assistance! Best, Scott

3 3

binary streams?
by bringiton bringiton 19 Jul '06

19 Jul '06

I'm wondering whether boost has binary streams (or whether the standard library does and i missed it). I had a quick look at boost serialisation. looks like it maybe too involved for my needs. my only needs would be something as follows: outstream s; s << (int)3; s << (float)4.0; s << std::string("hello"); void* data = s.buffer(); int size = s.size(); instream s(data, size); int a << s; float b << s; std::string b << s; I plan on sending the data over TCP. Portability would also be handy (ie endian issues). I may use asio when it is avail in the next boost release. does that support binary streams?

2 1

Re: [Boost-users] [thread] Keeping leak detectors still... - Results
by Daniel Krügler 19 Jul '06

19 Jul '06

Hello, I apologize for the late response to the original thread "Re: [thread] Keeping leak detectors still..." but we had some hard time to bring the boost tests to run and I hope we did that correctly... Furtheron I would like to thank my colleague Rüdiger Dreier for his patience for doing all this testing work. Please note, that the bjam boost tests where performed twice, each one with compiler MSVC 8.00.50727.42 on Windows XP SP2 and the official release of boost 1.33.1. The only difference was that the original file libs/thread/src/tss_hooks.cpp was replaced by the version posted by Peter Dimov on 2006-07-15T18:31 (where the leading and trailing html tags have been removed). All 14 thread-related tests passed the tests for both situations. If anyone is interested in the complete test output (which includes the results of all other libs), please don't resist to ask for them (I didn't want to pollute the news group space without explicit invitation to do that...) Additionally to the boost test, we run a homegrewn, simple threading-mutex-locking test, which also passed successfully for the old and new tss_hooks.cpp version. We could also observe that the standard leak reporter did *not* choke anymore ;-) Greetings from Bremen, Daniel Krügler

1 0

[python], [regex] Segmentation fault when deallocating match_results in a python extension module
by bernhard.maeder＠zkb.ch 19 Jul '06

19 Jul '06

Hello everybody I have a problem in a boost.python module that makes use of the boost.regex library. I'm not sure how much the problem is related to those two libraries or whether I'm just doing something wrong in the build setup. I have the following two python modules: *** test2.cpp *** #include <string> #include<boost/python.hpp> #include<boost/regex.hpp> using namespace boost; using namespace boost::python; void test_func(std::string const & in) { boost::regex expr("^(.*)\\[.*\\]$"); boost::match_results<std::string::const_iterator> match; boost::regex_match(in.begin(), in.end(), match, expr); } BOOST_PYTHON_MODULE(test2) { def("testFunc", &test_func); } *** Build command *** g++-3.4 -Wall -pthread -fPIC -I. -I/usr/include/python2.3 -c -otest2.os test2.cpp g++-3.4 -pthread -shared -o test2.so test2.os -lpython2.3 -lboost_python-gcc-mt-1_33 -lboost_regex-gcc-mt-1_33 *** test.py *** from test2 import * testFunc('justastring') *** output *** >>> from test2 import * >>> testFunc('justastring') Segmentation fault The program aborts when exiting test_func(), during deallocation of match_results. The error occurs somewhere in _M_deallocate of stl_vector.h. Can anybody help me with this problem? What could possibly go wrong here? One thing I noted: python is compiled using GCC3.3 on our system, while we are using GCC3.4, is this a problem? (But, trying the same on a system with GCC 4 for both, python and our app, also fails, so it seems like the problem is to be sought elsewhere). Thanks a lot! Bernhard

2 1

date_time compilation errors on gcc/STLport (time_formatters.hpp)
by Sagnes, Frederic 19 Jul '06

19 Jul '06

<<log.txt>> Hello, I had some troubles compiling my software with the date_time boost library. I attached the build log, I'm using STLport 5.1.0 RC1 (but 5.0.2 has the same troubles), GCC 4.0.1, Boost 1.33.1 and Linux Mandriva 2006.0. It is related to the use of STLport streams by date_time in time_formatters.hpp. It says "ambiguous overload for 'operator<<'". I don't know if it's related to the way I compiled Boost and/or STLport, but this error is generated by the compiler, not the linker. This problem doesn't show up on Visual Studio 2003. Best regards _______________________________________________ Frédéric Sagnes, A&D AS RD DH K3 Siemens AG Karlsruhe

1 0

Re: [Boost-users] how do I access m_property on an edge_descriptor
by Daniel Mitchell 18 Jul '06

18 Jul '06

> How do I access the m_property value of an edge_descriptor. > > I'm using an undirected graph and I need to get a unique identifier for > each edge in the graph. The vertex pair I currently use for edges create > two possible identifiers for each edge, but the m_property value of > each edge appears unique only I cannot access it. Why wouldn't you use the edge descriptor itself as the unique identifier? It should be the case that (u,v) == (v,u). D.

2 1

Re: [Boost-users] A question about shared_ptr(Zhuo Hao)
by Zhuo Hao 18 Jul '06

18 Jul '06

But consider the following code: #include<iostream> using namespace std; class CMutex{};//Hide all the implementations for convience template<class Y> void world(Y * p) { } void hello(int *x){ } int main(){ hello(0); world<CMutex>(0); return 1; } It compiles and runs without problems.So you see I can pass zero as a pointer to Y, and as a pointer to int. That's OK. I wonder how it is implemented that we cannot pass zero as a pointer to Y in the constructor of shared_ptr. Thanks Zhuo Hao On 14/07/06, Tommy Hinks <tommy.hinks(a)gmail.com> replied: You can't pass 0 because the Type passed must be an Investment*, not just a type that could be cast to one. This is why you have to explicitly cast it yourself.

4 3

Re: [Boost-users] [Serialization] Problem serializing via base class ptr
by Guy Létourneau 18 Jul '06

18 Jul '06

Robert, I've tried to include your changes but it doesn't solve the problem. I had to add the following line: BOOST_IS_ABSTRACT(NonVolatileData) for the program to compile. I agree with you, to have an abstract class is what is needed in that case as the NonVolatileData class is not intended to do something useful except for allowing my data storage layer to be generic. However, abstract or not, I still have the same problem: when serializing my SomeData object through a pointer to the NonVolatileData, only the data of the parent class gets serialized. Anything else you want me to try? Thanks, Guy >Try making the base class polymorphic - that it define at least >one abstract function. See my changes below. This will have >the beneficial effect of inhibiting anyone from creating an instance >of your base class directly. >Robert Ramey >Guy Létourneau wrote: >> Hello, >> >> I need to develop a generic data storage layer. Its job is to handle >> the serialization of all objects that need to be persistent in my >> system and handle management of archives, backups and restores and so >> forth. The most important point is that it must stay generic, i.e. >> have no knowledge of the type of objects being passed by other >> modules in the system. Because of this, I define a base class >> NonVolatileData from which all data classes in the system will >> derive: >> >> /////////////////////////////////////////////////////////////////////// >> // Base class >> class NonVolatileData >> { >> friend >> class boost::serialization::access; >> >> public: >> >> NonVolatileData(){ i = 1; }; >> virtual ~NonVolatileData() = 0; // Note - pure virtual function >> make class abstract- >> >> >> protected: >> >> virtual void Dummy() =0; // Note - pure virtual function make >> class abstract- >; >> >> int i; >> template <class Archive> >> void serialize( Archive& ar, const unsigned int version ) >> { >> ar & i; >> } >> }; >> BOOST_CLASS_TRACKING(NonVolatileData, >> boost::serialization::track_never) >> >> >> class SomeData: public NonVolatileData >> { >> friend >> class boost::serialization::access; >> >> public: >> >> SomeData () >> { >> }; >> >> ~SomeData () >> { >> }; >> >> void SetValue( std::string& Address ) >> { >> this->Address = Address; >> } >> >> void Dummy() >> { >> } >> >> private: >> >> template <class Archive> >> void serialize( Archive& ar, const unsigned int version ) >> { >> ar & >> >> boost::serialization::base_object<NonVolatileData>(*this); >> ar& Address; } >> >> std::string Address; >> }; >> BOOST_CLASS_TRACKING(SomeData, boost::serialization::track_never) >> ///////////////////////////////////////////////////////////////// >> >> My data storage interface will take a ptr to the base class i.e. >> Save(NonVolatileData* data) so the serialization will be performed >> through a ptr to the base class. I've read the documentation >> multiple times and I'm still unable to make that work correctly. >> When a do a save, only the base class is serialized even though the >> base class is polymorphic. I've tried using the >> BOOST_CLASS_EXPORT_GUID macro the force a registration of my derived >> class without success. I've also checked the example from demo.cpp. >> It uses the direct call to register_type() but in my case, I don't >> want to change the code everytime a new class is defined in the >> system so I went with option 2 (the macro). There's probably a >> subtle detail I do not do correctly (polite way of saying I'm missing >> something :-)). >> >> Thanks for your help, >> >> Guy Letourneau

2 1

Re: [Boost-users] [test] running tests by name
by Sohail Somani 18 Jul '06

18 Jul '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Perepelitsa Roman > Sent: Tuesday, July 18, 2006 5:33 AM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] [test] running tests by name > > Hi, > > I have implementation of feature which was requested several times. It > allows you to run tests (implemented with the help of boost.tests) by > name. > > I attached 3 files. > > 1. filter.hpp should be copied to boost/test/detail. > 2. framework.ipp should be copied to boost/test/impl. > (after copying files you will probably need to rebuild boost.test) > 3. example.cpp contains example of usage. Me likey. This is what I needed. I'm not going to go the regex way, rather I'll explicitly require test suites, or tests. After all, its reasonable to have one test suite per executable imho, but its quite a lot more common to run a single test from a test suite. Thank you very much! Sohail

1 0

how do I access m_property on an edge_descriptor
by kellygp 18 Jul '06

18 Jul '06

Hi, How do I access the m_property value of an edge_descriptor. I'm using an undirected graph and I need to get a unique identifier for each edge in the graph. The vertex pair I currently use for edges create two possible identifiers for each edge, but the m_property value of each edge appears unique only I cannot access it. Thanks, any help appreciated. George

1 0

[test] running tests by name
by Perepelitsa Roman 18 Jul '06

18 Jul '06

Hi, I have implementation of feature which was requested several times. It allows you to run tests (implemented with the help of boost.tests) by name. I attached 3 files. 1. filter.hpp should be copied to boost/test/detail. 2. framework.ipp should be copied to boost/test/impl. (after copying files you will probably need to rebuild boost.test) 3. example.cpp contains example of usage. Here is how it works. Each test case receives the name in the form Suite1/Suite2/.../SuiteN/CaseName. For example there is test cases is example.cpp with name "Master Test Suite/A/Foo". Test executable accepts new argument --filter=<regex>. It allows you to run that and only that tests which names match given regex. Note: library implicitly adds ".*" to the beginning and to the end of given regex expression. For example if you run example.cpp without arguments, you will see: Foo in A Bar in A Foo in B Bar in B If you run it with argument "--filter=Foo", you will see: Foo in A Foo in B If you want to run all tests in the suite "A", you can try "--filter=/A/" or "--filter=^Master Test Suite/A/". P.S. You can use this feature without modification of boost.test sources. Just call boost::test_suite_detail::filter in your implementation of init_unit_test_suite. HTH, Roman Perepelitsa.

1 0

boost::thread and member function
by King, Steven R 17 Jul '06

17 Jul '06

Hello All, Newbie question, thanks for your patience. I'm trying to pass a member function as the callback in boost::thread. Given this: class my_class { ... void foo(void); ... }; Instincts told me to do this: boost::thread my_thread( std::mem_fun(&my_class::foo) ); That didn't work and I discovered that boost::thread expects a boost::function0<void> instead. Can somebody please help me bridge the gap between std::mem_fun and boost::function0? I'm using gcc 4.1 on Linux and Boost 1.33.1 Cheers, -steve

4 4

[Serialization] Problem serializing via base class ptr
by Guy Létourneau 17 Jul '06

17 Jul '06

Hello, I need to develop a generic data storage layer. Its job is to handle the serialization of all objects that need to be persistent in my system and handle management of archives, backups and restores and so forth. The most important point is that it must stay generic, i.e. have no knowledge of the type of objects being passed by other modules in the system. Because of this, I define a base class NonVolatileData from which all data classes in the system will derive: /////////////////////////////////////////////////////////////////////// // Base class class NonVolatileData { friend class boost::serialization::access; public: NonVolatileData(){ i = 1; }; virtual ~NonVolatileData(){}; protected: virtual void Dummy(){}; int i; template <class Archive> void serialize( Archive& ar, const unsigned int version ) { ar & i; } }; BOOST_CLASS_TRACKING(NonVolatileData, boost::serialization::track_never) class SomeData: public NonVolatileData { friend class boost::serialization::access; public: SomeData () { }; ~SomeData () { }; void SetValue( std::string& Address ) { this->Address = Address; } void Dummy() { } private: template <class Archive> void serialize( Archive& ar, const unsigned int version ) { ar & boost::serialization::base_object<NonVolatileData>(*this); ar& Address; } std::string Address; }; BOOST_CLASS_TRACKING(SomeData, boost::serialization::track_never) ///////////////////////////////////////////////////////////////// My data storage interface will take a ptr to the base class i.e. Save(NonVolatileData* data) so the serialization will be performed through a ptr to the base class. I've read the documentation multiple times and I'm still unable to make that work correctly. When a do a save, only the base class is serialized even though the base class is polymorphic. I've tried using the BOOST_CLASS_EXPORT_GUID macro the force a registration of my derived class without success. I've also checked the example from demo.cpp. It uses the direct call to register_type() but in my case, I don't want to change the code everytime a new class is defined in the system so I went with option 2 (the macro). There's probably a subtle detail I do not do correctly (polite way of saying I'm missing something :-)). Thanks for your help, Guy Letourneau

2 1

[serialization] Difficulty getting serialization to work.
by Dieter Buys 17 Jul '06

17 Jul '06

Hi, I am experiencing difficulties in getting the Boost serialization library to work. There seems to be an error related to object tracking, as I am getting BOOST_STATIC_ASSERTION_FAILURE<x>. I am trying to figure it out using the attached test code. The documentation claims I should be putting a BOOST_SERIALIZATION_TRACKING() macro in my file (presumably directly after my class definition). I did a full text search over the entire source of the library and nowhere did this preprocessor macro exist. There is a BOOST_CLASS_TRACKING() macro, which I tried putting in my source with tracking_never. That seems to have made no appreciable difference. I have absolutely no idea what I am supposed to do. :( Any help would be appreciated. Thanks, ~ Dieter Buys #include <fstream> #include <boost/shared_ptr.hpp> #include <boost/serialization/serialization.hpp> #include <boost/serialization/tracking.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> class gps_position { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & degrees; ar & minutes; ar & seconds; } int degrees; int minutes; float seconds; public: gps_position() {}; gps_position(int d, int m, float s) : degrees(d), minutes(m), seconds(s) {} }; // BOOST_CLASS_TRACKING(gps_position, track_never) int main(void) { std::ofstream ofs("serial.txt"); gps_position *g = new gps_position(35, 59, 24.567f); // const gps_position g(35, 59, 24.567f); { boost::archive::text_oarchive oa(ofs); oa << g; } delete g; gps_position *newg; // gps_position newg; { std::ifstream ifs("serial.txt", std::ios::binary); boost::archive::text_iarchive ia(ifs); ia >> newg; } delete newg; return 0; }

2 5

Re: [Boost-users] [Test] Running individual test cases
by Sohail Somani 17 Jul '06

17 Jul '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Gennadiy Rozental > Sent: Monday, July 17, 2006 10:19 AM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] [Test] Running individual test cases > > If you could tell me what to read or change to get the > framework to do > > this, I'd be happy. > > It's not simple chnage. It requires modifications on many > levels. You will > have to wait will 1.35. Sorry. That's alright. If I can help in any way, feel free to ask :)

1 0

Re: [Boost-users] [Test] Running individual test cases
by Sohail Somani 17 Jul '06

17 Jul '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Gennadiy Rozental > Sent: Monday, July 17, 2006 9:31 AM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] [Test] Running individual test cases > > > "Sohail Somani" <s.somani(a)fincad.com> wrote in message > news:1C1EBEF8DBACDC439D038EA051674EC735B941@xbox.financialcad.com... > > Hi, > > > > I recall a thread about running individual test cases by name. Might > > even have been yesterday. Anyway, I'd like to put in a "me > too" vote for > > that and also ask what I can currently do to continue using the auto > > registration capability but perhaps modify it to only > register certain > > functions? Would I need to create my own test suite? > > I could always use compile time switches This *could* work, but imho it really prevents the quick turn around you need when debugging unit tests. I personally would prefer the test runner to by default run all tests and given a bunch of --run_test=test1 --run_test=test2 command line arguments, it runs only those tests. If you could tell me what to read or change to get the framework to do this, I'd be happy. Thanks Sohail

2 1

Boost Test usage
by Matt Schuckmann 17 Jul '06

17 Jul '06

I've been looking into using the boost test library to start testing some of our code and it looks pretty good. I've gone through the documentation and several of the examples and there are a couple of things I don't really get I don't see how the test_suite class lets you create do anything special with regards to building multi-level tests, none of the examples really show multilevel test hierarchy and how it really helps me. It looks like it's really just a way of using a class to group test functions instead of a series of free functions, am I missing something here? I really expected more from a feature like this, I'm thinking of things like Command line control over which test suites to run, I mean you name the test suites but you don't appear to do anything with that name Reporting success and failure grouped by test suite Am I missing something here, is this stuff possible and the examples don't show it or are these feature that are yet to come or haven't been thought of? I don't see a good example for how I should setup a unit test for a real world type project you know an extensive example that covers inputs, outputs, multiple test suites, etc all in one example. In my case I've a got a library with several independent classes and functions that I'd like to test and I'm not sure if I should be creating multiple executables (1 for each test case) or a single executable that tests everything, I don't understand the pros and cons of either case. It seems like I want the single executable that can test everything or that can test just want I tell it to test. Any info would be appreciated. Matt S.

2 4

[Test] Running individual test cases
by Sohail Somani 17 Jul '06

17 Jul '06

Hi, I recall a thread about running individual test cases by name. Might even have been yesterday. Anyway, I'd like to put in a "me too" vote for that and also ask what I can currently do to continue using the auto registration capability but perhaps modify it to only register certain functions? Would I need to create my own test suite? By the way, boost test has been really great to me so far, its been very useful while testing my latest project. Keep up the good work! Thanks, Sohail

2 1

[thread] Keeping leak detectors still...
by Daniel Krügler 17 Jul '06

17 Jul '06

Hello!, Its a well-known issue, that Boost-Thread users on Windows machines have observed that popular leak reporting tools loudly notify a missing delete for the dynamically allocated mutex in tss_hooks.cpp. A good overview for this discussion can be found in: http://groups.google.de/group/boost-list/browse_thread/thread/f5788746e458d… While I don't want to heat up the discussion whether this is actually a "leak" or not, many code style guides of companies give very bad points on such behaviour, so I would like to ask whether it is possible to ensure a proper clean-up of this by code (before the system does), to keep those detector programs quiet... Simple question of a non-expert: Couldn't one simply change the current impl of on_process_exit in tss_hooks.cpp to extern "C" BOOST_THREAD_DECL void on_process_exit(void) { { // Wrap into scope boost::call_once(init_threadmon_mutex, once_init_threadmon_mutex); boost::mutex::scoped_lock lock(*threadmon_mutex); BOOST_ASSERT(attached_thread_count == 0); //Free the tls slot if one was allocated. if (tls_key != invalid_tls_key) { TlsFree(tls_key); tls_key = invalid_tls_key; } } delete threadmon_mutex; // Shouldn't that be the last point of access?? threadmon_mutex = 0; // For those who prefer a defined value... } OK, I see that the docs for this function says: "Must not be omitted; may be called multiple times." Question is: Does there exist at least the guarantee, that there is always the same number of on_process_enter and on_process_exit calls? If yes: Wouldn't a simply reference counting scheme using one of the atomic integer incrementing/decrementing functions (also provided by boost via interlocked.hpp) allow a thread-save deletion of that mutex object? Thanks for your patience, Daniel Krügler

2 6

[filesystem] Is it a bug or not
by Ovanes Markarian 17 Jul '06

17 Jul '06

Hi! On my Windows computer I have cygwin installed and it created the following file names in directory c:\ %backup%~ .emacs .emacs~ .tcltcinfo.txt The last file was created by some cygwin app. Now if I try to iterate through this directory: for(fs::directory_iterator dir_itr( full_path ), end_iter; dir_itr != end_iter; ++dir_itr) { try { if(!fs::is_directory(*dir_itr)) { std::pair<std::string, std::string> file_name( fs::basename(dir_itr->leaf()), fs::extension(dir_itr->leaf()) ); std::cout << "fname: " << file_name.first << ", extension: " << file_name.second << std::endl; } } catch(std::exception const& ex ) { std::cout << dir_itr->leaf() << " " << ex.what() << std::endl; } } Exceptions are thrown: %backup%~ boost::filesystem::path: invalid name "%backup%~" in path: "%backup%~" .emacs boost::filesystem::path: invalid name ".emacs" in path: ".emacs" .emacs~ boost::filesystem::path: invalid name ".emacs~" in path: ".emacs~" .tcltcinfo.txt boost::filesystem::path: invalid name ".tcltcinfo.txt" in path: ".tcltcinfo.txt" I know that it is impossible to create these file manually, but software is allowed to do this. Therefore I don't think these exceptions are correct. With Kind Regards, Ovanes Markarian

2 1

bjam w/ minggc g++-3.4.5-20060117: undefined reference
by Jeffrey Chang 17 Jul '06

17 Jul '06

Hi, I'm building boost_1_33_1 on mingw win32 environment via: boost-jam-3.1.3-1-ntx86/bjam.exe -sTOOLS=mingw stage Everything goes fine and most libraries are built and run without problems, except for link-time errors of "undefined references" for the following functions: "boost::filesystem::detail::system_error_code()" "boost::filesystem::filesystem_error::~filesystem_error()" "boost::filesystem::filesystem_error::filesystem_error(...)" "vtable for boost::filesystem::filesystem_error" "boost::archive::ARCHIVE_VERSION()" "boost::archive::ARCHIVE_SIGNATURE()" "boost::signals::trackable::signal_connected(...)" It seems some of the object files doesn't get picked up while building their corresponding libraries; for example, ARCHIVE_VERSION() and ARCHIVE_SIGNATURE() are defined in libs/serialization/src/basic_archive.cpp file, which are compiled correctly into basic_archive.obj, yet somehow the bjam link process cannot find it while building the Serialization library. If I inline the definition of ARCHIVE_VERSION() and ARCHIVE_SIGNATURE() into its declaration header file of boost/archive/basic_archive.hpp, the the Serialization library is built without problem. This shows that I'm probably missing something for the above build command. Also, in my mingw win32 build output of stage/lib directory, the corresponding libraries with the above "undefined references" (libboost_filesystem-mgw-*, libboost_serialization-mgt-*, and libboost_signals-mgw-*) are generated as a result of the above bjam build command, even though mingw's ld.exe doesn't recognize these lib files. Is this a bug in bjam logic? Here's my mingw win32 environment: * MSYS-1.0.11-2004.04.30-1 * msysDTK-1.0.1 * binutils-2.16.91-20060119-1 * gcc-core-3.4.5-20060117-1 * gcc-g++-3.4.5-20060117-1 * w32api-3.7 * mingw-runtime-3.10 * mingw-utils-0.3 Attached is the excerpt of above undefined reference errors. I'm not familiar with bjam; it'd be great if someone can shed lights on what's wrong. (please cc me as I'm not subscribed to the list) ------------- begin: bjam build output ------------ FileClone stage\lib\boost_date_time-mgw-mt-d-1_33_1.lib gcc-Link-action bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\debug\boost_filesystem-mgw-d-1_33_1.dll bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\debug\boost_filesystem-mgw-d-1_33_1.lib Creating library file: bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\debug\boost_filesystem-mgw-d-1_33_1.lib bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\debug\operations_posix_windows.obj: In function `ZN5boost10filesystem6detail12dir_itr_initERNS_10shared_ptrINS1_11dir_itr_impEEERKNS0_4pathE':c:/e2e/win32/ref/boost/boost_1_33_1/libs/filesystem/build/../src/operations_posix_windows.cpp:308: undefined reference to `boost::filesystem::detail::system_error_code()' :c:/e2e/win32/ref/boost/boost_1_33_1/libs/filesystem/build/../src/operations_posix_windows.cpp:308: undefined reference to `boost::filesystem::filesystem_error::filesystem_error(std::string const&, boost::filesystem::path const&, int)' :c:/e2e/win32/ref/boost/boost_1_33_1/libs/filesystem/build/../src/operations_posix_windows.cpp:308: undefined reference to `boost::filesystem::filesystem_error::~filesystem_error()' .... :c:/e2e/win32/ref/boost/boost_1_33_1/boost/iterator/iterator_facade.hpp:(.text$_ZN5boost10filesystem16filesys tem_errorC1ERKS1_[boost::filesystem::filesystem_error::filesystem_error(boost::filesystem::filesystem_error const&)]+0x4c): undefined reference to `vtable for boost::filesystem::filesystem_error' .... "g++" "-Wl,--enable-auto-image-base" "-Wl,--exclude-symbols,_bss_end__:_bss_start__:_data_end__:_data_start__" "-Wl,--out-implib,bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\release\threading-multi\boost_filesystem-mgw-mt-1_33_1.lib" -mthreads -s -shared -Wl,--allow-multiple-definition -mno-cygwin -o "bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\release\threading-multi\boost_filesystem-mgw-mt-1_33_1.dll" -L"" "bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\release\threading-multi\exception.obj" "bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\release\threading-multi\operations_posix_windows.obj" "bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\release\threading-multi\path_posix_windows.obj" "bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\release\threading-multi\convenience.obj" ...failed gcc-Link-action bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\release\threading-multi\boost_filesystem-mgw-mt-1_33_1.dll bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\release\threading-multi\boost_filesystem-mgw-mt-1_33_1.lib... ...removing bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\release\threading-multi\boost_filesystem-mgw-mt-1_33_1.lib ...skipped <@boost!lib>boost_filesystem-mgw-mt-1_33_1.dll for lack of <@boost!libs!filesystem!build\boost_filesystem.dll\mingw\release\threading-multi>boost_filesystem-mgw-mt-1_33_1.dll... ...skipped <@boost!lib>boost_filesystem-mgw-mt-1_33_1.lib for lack of <@boost!libs!filesystem!build\boost_filesystem.dll\mingw\release\threading-multi>boost_filesystem-mgw-mt-1_33_1.lib... FileClone stage\lib\boost_program_options-mgw-d-1_33_1.lib FileClone stage\lib\boost_program_options-mgw-mt-d-1_33_1.lib FileClone stage\lib\boost_python-mgw-d-1_33_1.lib FileClone stage\lib\boost_python-mgw-mt-d-1_33_1.lib FileClone stage\lib\boost_python-mgw-1_33_1.lib FileClone stage\lib\boost_python-mgw-mt-1_33_1.lib FileClone stage\lib\boost_regex-mgw-d-1_33_1.lib FileClone stage\lib\boost_regex-mgw-mt-d-1_33_1.lib FileClone stage\lib\boost_regex-mgw-1_33_1.lib gcc-Link-action bin\boost\libs\serialization\build\boost_serialization.dll\mingw\debug\boost_serialization-mgw-d-1_33_1.dll bin\boost\libs\serialization\build\boost_serialization.dll\mingw\debug\boost_serialization-mgw-d-1_33_1.lib Creating library file: bin\boost\libs\serialization\build\boost_serialization.dll\mingw\debug\boost_serialization-mgw-d-1_33_1.lib bin\boost\libs\serialization\build\boost_serialization.dll\mingw\debug\basic_iarchive.obj: In function `ZSt38__copy_backward_output_normal_iteratorIPN5boost7archive6detail19basic_iarchive_impl10cobject_idEN9__gnu_cxx17__normal_iteratorIS5_St6vectorIS4_SaIS4_EEEEET0_T_SD_SC_11__true_type':c:/e2e/win32/ref/boost/boost_1_33_1/libs/serialization/build/../src/basic_iarchive.cpp:(.text$_ZN5boost7archive6detail19basic_iarchive_implC1Ej[boost::archive::detail::basic_iarchive_impl::basic_iarchive_impl(unsigned int)]+0x52): undefined reference to `boost::archive::ARCHIVE_VERSION()' ..... ' bin\boost\libs\serialization\build\boost_serialization.dll\mingw\debug\binary_iarchive.obj: In function `ZN5boost7archive20binary_iarchive_implINS0_15binary_iarchiveEE13load_overrideINS0_13tracking_typeEEEvRT_i':c:/e2e/win32/ref/boost/boost_1_33_1/boost/archive/binary_iarchive.hpp:(.text$_ZN5boost7archive21basic_binary_iarchiveINS0_15binary_iarchiveEE4initEv[boost::archive::basic_binary_iarchive<boost::archive::binary_iarchive>::init()]+0x6e): undefined reference to `boost::archive::ARCHIVE_SIGNATURE()' ..... "g++" "-Wl,--enable-auto-image-base" "-Wl,--exclude-symbols,_bss_end__:_bss_start__:_data_end__:_data_start__" "-Wl,--out-implib,bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\boost_serialization-mgw-mt-1_33_1.lib" -mthreads -s -shared -Wl,--allow-multiple-definition -mno-cygwin -o "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\boost_serialization-mgw-mt-1_33_1.dll" -L"" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\basic_archive.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\basic_archive_impl.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\basic_iarchive.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\basic_oarchive.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\basic_iserializer.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\basic_oserializer.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\basic_pointer_iserializer.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\basic_pointer_oserializer.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\basic_serializer_map.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\basic_text_iprimitive.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\basic_text_oprimitive.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\basic_xml_archive.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\binary_iarchive.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\binary_oarchive.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\extended_type_info.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\extended_type_info_no_rtti.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\extended_type_info_typeid.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\polymorphic_iarchive.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\polymorphic_oarchive.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\stl_port.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\text_iarchive.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\text_oarchive.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\void_cast.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\xml_grammar.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\xml_iarchive.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\xml_oarchive.obj" ...failed gcc-Link-action bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\boost_serialization-mgw-mt-1_33_1.dll bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\boost_serialization-mgw-mt-1_33_1.lib... ...removing bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\boost_serialization-mgw-mt-1_33_1.lib ...skipped <@boost!lib>boost_serialization-mgw-mt-1_33_1.dll for lack of <@boost!libs!serialization!build\boost_serialization.dll\mingw\release\threading-multi>boost_serialization-mgw-mt-1_33_1.dll... ...skipped <@boost!lib>boost_serialization-mgw-mt-1_33_1.lib for lack of <@boost!libs!serialization!build\boost_serialization.dll\mingw\release\threading-multi>boost_serialization-mgw-mt-1_33_1.lib... gcc-Link-action bin\boost\libs\signals\build\boost_signals.dll\mingw\debug\boost_signals-mgw-d-1_33_1.dll bin\boost\libs\signals\build\boost_signals.dll\mingw\debug\boost_signals-mgw-d-1_33_1.lib Creating library file: bin\boost\libs\signals\build\boost_signals.dll\mingw\debug\boost_signals-mgw-d-1_33_1.lib bin\boost\libs\signals\build\boost_signals.dll\mingw\debug\slot.obj: In function `ZN5boost7signals6detail9slot_base17create_connectionEv':c:/e2e/win32/ref/boost/boost_1_33_1/libs/signals/build/../src/slot.cpp:47: undefined reference to `boost::signals::trackable::signal_connected(boost::signals::connection, boost::signals::detail::bound_object&) const' collect2: ld returned 1 exit status ...... ...failed gcc-Link-action bin\boost\libs\signals\build\boost_signals.dll\mingw\release\threading-multi\boost_signals-mgw-mt-1_33_1.dll bin\boost\libs\signals\build\boost_signals.dll\mingw\release\threading-multi\boost_signals-mgw-mt-1_33_1.lib... ...removing bin\boost\libs\signals\build\boost_signals.dll\mingw\release\threading-multi\boost_signals-mgw-mt-1_33_1.lib ...skipped <@boost!lib>boost_signals-mgw-mt-1_33_1.dll for lack of <@boost!libs!signals!build\boost_signals.dll\mingw\release\threading-multi>boost_signals-mgw-mt-1_33_1.dll... ...skipped <@boost!lib>boost_signals-mgw-mt-1_33_1.lib for lack of <@boost!libs!signals!build\boost_signals.dll\mingw\release\threading-multi>boost_signals-mgw-mt-1_33_1.lib... FileClone stage\lib\boost_thread-mgw-mt-d-1_33_1.lib HardLink stage\lib\boost_date_time-mgw-mt-d.lib ...skipped <@boost!lib>boost_filesystem-mgw-d.lib for lack of <@boost!lib>boost_filesystem-mgw-d-1_33_1.lib... ...skipped <@boost!lib>boost_filesystem-mgw-mt-d.lib for lack of <@boost!lib>boost_filesystem-mgw-mt-d-1_33_1.lib... ...skipped <@boost!lib>boost_filesystem-mgw.lib for lack of <@boost!lib>boost_filesystem-mgw-1_33_1.lib... ...skipped <@boost!lib>boost_filesystem-mgw-mt.lib for lack of <@boost!lib>boost_filesystem-mgw-mt-1_33_1.lib... HardLink stage\lib\boost_program_options-mgw-d.lib HardLink stage\lib\boost_program_options-mgw-mt-d.lib HardLink stage\lib\boost_python-mgw-d.lib HardLink stage\lib\boost_python-mgw-mt-d.lib HardLink stage\lib\boost_python-mgw.lib HardLink stage\lib\boost_python-mgw-mt.lib HardLink stage\lib\boost_regex-mgw-d.lib HardLink stage\lib\boost_regex-mgw-mt-d.lib HardLink stage\lib\boost_regex-mgw.lib ...skipped <@boost!lib>boost_serialization-mgw-d.lib for lack of <@boost!lib>boost_serialization-mgw-d-1_33_1.lib... ...skipped <@boost!lib>boost_serialization-mgw-mt-d.lib for lack of <@boost!lib>boost_serialization-mgw-mt-d-1_33_1.lib... ...skipped <@boost!lib>boost_serialization-mgw.lib for lack of <@boost!lib>boost_serialization-mgw-1_33_1.lib... ...skipped <@boost!lib>boost_serialization-mgw-mt.lib for lack of <@boost!lib>boost_serialization-mgw-mt-1_33_1.lib... ...skipped <@boost!lib>boost_signals-mgw-d.lib for lack of <@boost!lib>boost_signals-mgw-d-1_33_1.lib... ...skipped <@boost!lib>boost_signals-mgw-mt-d.lib for lack of <@boost!lib>boost_signals-mgw-mt-d-1_33_1.lib... ...skipped <@boost!lib>boost_signals-mgw.lib for lack of <@boost!lib>boost_signals-mgw-1_33_1.lib... ...skipped <@boost!lib>boost_signals-mgw-mt.lib for lack of <@boost!lib>boost_signals-mgw-mt-1_33_1.lib... HardLink stage\lib\boost_thread-mgw-mt-d.lib ...failed updating 24 targets... ...skipped 36 targets... ...updated 22 targets... ------------- end: bjam build output ------------ Thanks, --- Jeffrey

1 0

asio and boost
by bringiton bringiton 17 Jul '06

17 Jul '06

I'm just wondering when the asio networking library will become part of the boost library. I read in the link below that the library has been accepted. http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n1974.html

2 2

Re: [Boost-users] [iterator] reverse_iterator from iterators thatreturn references to data in self.
by Seb Martel 17 Jul '06

17 Jul '06

"David Abrahams" <dave(a)boost-consulting.com> wrote in message news:<uwtafgdi0.fsf(a)boost-consulting.com>... > "Seb Martel" <smartel(a)real.com> writes: > > > Hello, > > > > given something like: > > > > class ProxyIterator > > : public boost::iterator_facade<ProxyIterator, Costly, boost::random_access_traversal_tag> > > { > > public: > > ProxyIterator(FactoryOfCostly* pF, int i ) : m_pFactory( pF ), m_index( i ) > > {} > > private: > > friend class boost::iterator_core_access; > > void decrement() {--m_index;} > > // ... and others > > > > Costly& dereference() const > > { > > m_value = m_pFactory->MakeCostlyAtIndex( m_index ); > > return m_value; > > } > > private: > > FactoryOfCostly* m_pFactory; > > int m_index; > > mutable Costly m_value; > > }; > > You might need to do something to prevent this from being reported as > a valid random access (or even forward) iterator. 24.1.3: > > --- If a and b are both dereferenceable, then a == b if and only if *a > and *b are the same object. > As in &(*a) == &(*b) ? That's just cruel. But then again, vector<bool> comes to mind... Which reminds me: Is http://boost.org/libs/iterator/doc/new-iter-concepts.html making any progress ? > > You could build a reverse_iterator like the one you propose by storing > the inner iterator within a boost::optional wrapper, and only > initializing it upon dereference. > I might just name it the DamnYou2413ReverseIterator. Tx! -seb

2 1

Macro to contruct/allocate a shared_ptr?
by bringiton bringiton 17 Jul '06

17 Jul '06

I'm trying to define a MACRO that creates a shared_ptr and hides memory allocation. Here is what i have so far: #define NEW0(T) boost::shared_ptr<T>(new T()); #define NEW1(T, p1) boost::shared_ptr<T>(new T(p1)); #define NEW2(T, p1, p2) boost::shared_ptr<T>(new T(p1, p2)); #define NEW3(T, p1, p2, p3) boost::shared_ptr<T>(new T(p1, p2, p3)); --------------------------------- Example of usage for the type Test: class Test { public: Test() {;} Test(int p1) {;} Test(int p1, char p2) {;} Test(int p1, char p2, std::string p3) {;} }; boost::shared_ptr<Test> p0 = NEW0(Test); boost::shared_ptr<Test> p1 = NEW1(Test, 100); boost::shared_ptr<Test> p2 = NEW2(Test, 100, 'a'); boost::shared_ptr<Test> p3 = NEW3(Test, 100, 'a', "hello"); --------------------------------- Is there a better way to do this? I would prefer to use a function instead of a MACRO. But I don't think it is possible because it is not know how many paramaters are in T's constructor. // not sure how to do this (or whether possible) // i am not sure how to implement the variable parameters // (hense the .. in my syntax) template <class T> boost::shared_ptr<T> New(...) { boost::shared_ptr<T> p(new T(...)); return p; } Any ideas? I often have problems with the c++ syntax when creating my own containers because i want to allocate T within the implementation (instead of passing pointers and having the user manage the memory).

6 13

Regex build problem using g++ under cygwin
by Nindi Singh 16 Jul '06

16 Jul '06

Hi Darren .... I had problems with Boost Python which i think which were similar to yours .... i managed to get around them .... take a look at the subject 'Boost Python not linking under Cygwin' posted 16 Jul 14:16 let me know if indeed it is the same problem .. and if the soltuion works for you N

1 0

Fw: [regex]How to get Content-Type's parameter pairs using boost.regex?
by Mockey Chen 16 Jul '06

16 Jul '06

Hi, experts, I using boost.regex parse the content-type header's value in MIME. A typical content-type's BNF like following: Content-Type = "Content-Type:" SP media-type media-type = type "/" subtype *( ";" gen-param ) type = token subtype = token gen-param = pname [ "=" pval ] pname = token pval = token / quoted-string An example content-type as following: multipart/mixed; boundary="theboundary" ;id=33 There may be zero or one more parameters in content-type. My parse code as following: #include <boost/regex.hpp> #include <iostream> #include <string> #define COUT(x) std::cout << x << std::endl #define VAR(v) std::cout << #v << ": " << v << std::endl #define TOKEN "[a-zA-Z0-9]+" #define TYPE "(" TOKEN ")" #define SUBTYPE "(" TOKEN ")" #define PNAME "(" TOKEN ")" #define PVALUE "(" TOKEN ")" #define PARAM "(;" PNAME "=" PVALUE ")" #define CONTENT_TYPE_EXPRESS TYPE "/" SUBTYPE PARAM "*" int main() { std::string ct("multipart/mixed;boundary=theboundary;id=33"); COUT(CONTENT_TYPE_EXPRESS); boost::regex regex_content_type(CONTENT_TYPE_EXPRESS); boost::smatch result; if (boost::regex_match(ct, result, regex_content_type)) { VAR(result.size()); for (unsigned int i=0; i<result.size(); ++i) { if (result[i].matched) { COUT("result[" << i << "] = " << result[i]); } } } else { COUT("match failed."); } return 0; } /** output: ([a-zA-Z0-9]+)/([a-zA-Z0-9]+)(;([a-zA-Z0-9]+)=([a-zA-Z0-9]+))* result.size(): 6 result[0] = multipart/mixed;boundary=theboundary;id=33 result[1] = multipart result[2] = mixed result[3] = ;id=33 result[4] = id result[5] = 33 */ I want to get the parameter "boundary" and its value. Any way to do it? Sebastian Redl said: Not really. Regex doesn't support getting each submatch in a repeated expression. Xpressive does, but in this case, I think you'd be better off modelling the content-type grammar in Spirit and using that. Anyway, this question should have gone to boost-users, so I forward this to boost-users. Thanks in advance. -- Regards. Mockey Chen

2 1

Boost Python not linking uder Cygwin
by Nindi Singh 16 Jul '06

16 Jul '06

Apologies for resending this email ... but for some reason my last email ended up as a reply for a completely disconnected subject.... TWICE. I am able to build my Python Extension Module under MSVC 7.1, MSVC 8.0 and GCC (LINUX). However I cannot seem to build it under Cygwin gcc. The output of uname is CYGWIN_NT-5.1 The output of gcc -v is : Reading specs from /usr/lib/gcc/i686-pc-cygwin/3.4.4/specs Configured with: /gcc/gcc-3.4.4/gcc-3.4.4-1/configure --verbose --prefix=/usr --exec-prefix=/usr --sysconfdir=/etc --libdir=/usr/lib --libexecdir=/usr/lib --mandir=/usr/share/man --infodir=/usr/ info --enable-languages=c,ada,c++,d,f77,java,objc --enable-nls --without-included-gettext --enable-version-specific-runtime-libs --without-x --enable-libgcj --disable-java-awt --with-system-zlib ble-interpreter --disable-libgcj-debug --enable-threads=posix --enable-java-gc=boehm --disable-win32-registry --enable-sjlj-exceptions --enable-hash-synchronization --enable-libstdcxx-debug : (r gured) Thread model: posix gcc version 3.4.4 (cygming special) (gdc 0.12, using dmd 0.125) My compile command line is : g++ -o /cygdrive/c/Build/cygwin/gcc/3.4.4/Debug/Intermediate/PythonPapa/PythonPapa.dll -shared /cygdrive/c/Build/cygwin/gcc/3.4.4/Debug/Intermediate/PythonPapa/main.os /cygdrive/c/Build/cygwin/gcc/3. .4/Debug/Intermediate/PythonPapa/StdVector.os -L/cygdrive/c/Build/cygwin/gcc/3.4.4/Debug -L/usr/local/lib -L/lib/python2.4/config -lPapaGateWay -lboost_python-gcc-mt-d-1_33_1 -lpython2.4 -lPapaGa eWay Then there are ALOT of errors .. here are the last few lines : /usr/local/include/boost-1_33_1/boost/python/object/make_ptr_instance.hpp:(.text$_ZN5boost6python7objects14pointer_holderIPSt6vectorIdSaIdEES5_ED1Ev[boost::python::objects::pointer_holder<std::vector< double, std::allocator<double> >*, std::vector<double, std::allocator<double> > >::~pointer_holder()]+0x16): undefined reference to `__imp___ZN5boost6python15instance_holderD2Ev' /usr/local/include/boost-1_33_1/boost/python/object/make_ptr_instance.hpp:(.text$_ZN5boost6python7objects14pointer_holderIPSt6vectorIdSaIdEES5_ED0Ev[boost::python::objects::pointer_holder<std::vector< double, std::allocator<double> >*, std::vector<double, std::allocator<double> > >::~pointer_holder()]+0x16): undefined reference to `__imp___ZN5boost6python15instance_holderD2Ev' /usr/local/include/boost-1_33_1/boost/python/object/make_ptr_instance.hpp:(.text$_ZN5boost6python7objects14pointer_holderIPSt6vectorImSaImEES5_ED1Ev[boost::python::objects::pointer_holder<std::vector< unsigned long, std::allocator<unsigned long> >*, std::vector<unsigned long, std::allocator<unsigned long> > >::~pointer_holder()]+0x16): undefined reference to `__imp___ZN5boost6python15instance_holde rD2Ev' /usr/local/include/boost-1_33_1/boost/python/object/make_ptr_instance.hpp:(.text$_ZN5boost6python7objects14pointer_holderIPSt6vectorImSaImEES5_ED0Ev[boost::python::objects::pointer_holder<std::vector< unsigned long, std::allocator<unsigned long> >*, std::vector<unsigned long, std::allocator<unsigned long> > >::~pointer_holder()]+0x16): undefined reference to `__imp___ZN5boost6python15instance_holde rD2Ev' /usr/local/include/boost-1_33_1/boost/python/object/make_ptr_instance.hpp:(.text$_ZN5boost6python7objects14pointer_holderIPSt6vectorIN17__papa__namespace16pTemplateVariantINS4_14pTemplateArrayIdEENS4_ 15pTemplateMatrixIdEEEESaISA_EESC_ED1Ev[boost::python::objects::pointer_holder<std::vector<__papa__namespace::pTemplateVariant<__papa__namespace::pTemplateArray<double>, __papa__namespace::pTemplateMa trix<double> >, std::allocator<__papa__namespace::pTemplateVariant<__papa__namespace::pTemplateArray<double>, __papa__namespace::pTemplateMatrix<double> > > >*, std::vector<__papa__namespace::pTemplat eVariant<__papa__namespace::pTemplateArray<double>, __papa__namespace::pTemplateMatrix<double> >, std::allocator<__papa__namespace::pTemplateVariant<__papa__namespace::pTemplateArray<double>, __papa__ namespace::pTemplateMatrix<double> > > > >::~pointer_holder()]+0x16): undefined reference to `__imp___ZN5boost6python15instance_holderD2Ev' /cygdrive/c/Build/cygwin/gcc/3.4.4/Debug/Intermediate/PythonPapa/StdVector.os:/usr/local/include/boost-1_33_1/boost/python/object/make_ptr_instance.hpp:(.text$_ZN5boost6python7objects14pointer_holderI PSt6vectorIN17__papa__namespace16pTemplateVariantINS4_14pTemplateArrayIdEENS4_15pTemplateMatrixIdEEEESaISA_EESC_ED0Ev[boost::python::objects::pointer_holder<std::vector<__papa__namespace::pTemplateVar iant<__papa__namespace::pTemplateArray<double>, __papa__namespace::pTemplateMatrix<double> >, std::allocator<__papa__namespace::pTemplateVariant<__papa__namespace::pTemplateArray<double>, __papa__name space::pTemplateMatrix<double> > > >*, std::vector<__papa__namespace::pTemplateVariant<__papa__namespace::pTemplateArray<double>, __papa__namespace::pTemplateMatrix<double> >, std::allocator<__papa__n amespace::pTemplateVariant<__papa__namespace::pTemplateArray<double>, __papa__namespace::pTemplateMatrix<double> > > > >::~pointer_holder()]+0x16): more undefined references to `__imp___ZN5boost6pytho n15instance_holderD2Ev' follow /cygdrive/c/Build/cygwin/gcc/3.4.4/Debug/Intermediate/PythonPapa/StdVector.os: In function `_ZN5boost6python7objects17make_ptr_instanceIN17__papa__namespace16pTemplateVariantINS3_14pTemplateArrayIdEEN S3_15pTemplateMatrixIdEEEENS1_14pointer_holderIPS9_S9_EEE9constructISB_EEPSC_PvP7_objectRT_': /usr/local/include/boost-1_33_1/boost/python/object/make_ptr_instance.hpp:(.text$_ZN5boost6python7objects14pointer_holderIPSt6vectorIN17__papa__namespace16pTemplateVariantINS4_14pTemplateArrayIdEENS4_ 15pTemplateMatrixIdEEEESaISA_EESC_E5holdsENS0_9type_infoEb[boost::python::objects::pointer_holder<std::vector<__papa__namespace::pTemplateVariant<__papa__namespace::pTemplateArray<double>, __papa__nam espace::pTemplateMatrix<double> >, std::allocator<__papa__namespace::pTemplateVariant<__papa__namespace::pTemplateArray<double>, __papa__namespace::pTemplateMatrix<double> > > >*, std::vector<__papa__ namespace::pTemplateVariant<__papa__namespace::pTemplateArray<double>, __papa__namespace::pTemplateMatrix<double> >, std::allocator<__papa__namespace::pTemplateVariant<__papa__namespace::pTemplateArra y<double>, __papa__namespace::pTemplateMatrix<double> > > > >::holds(boost::python::type_info, bool)]+0xea): undefined reference to `__imp___ZN5boost6python7objects17find_dynamic_typeEPvNS0_9type_info ES3_' /usr/local/include/boost-1_33_1/boost/python/object/make_ptr_instance.hpp:(.text$_ZN5boost6python7objects14pointer_holderIPSt6vectorImSaImEES5_E5holdsENS0_9type_infoEb[boost::python::objects::pointer_ holder<std::vector<unsigned long, std::allocator<unsigned long> >*, std::vector<unsigned long, std::allocator<unsigned long> > >::holds(boost::python::type_info, bool)]+0xea): undefined reference to ` __imp___ZN5boost6python7objects17find_dynamic_typeEPvNS0_9type_infoES3_' /usr/local/include/boost-1_33_1/boost/python/object/make_ptr_instance.hpp:(.text$_ZN5boost6python7objects14pointer_holderIPSt6vectorIdSaIdEES5_E5holdsENS0_9type_infoEb[boost::python::objects::pointer_ holder<std::vector<double, std::allocator<double> >*, std::vector<double, std::allocator<double> > >::holds(boost::python::type_info, bool)]+0xea): undefined reference to `__imp___ZN5boost6python7obje cts17find_dynamic_typeEPvNS0_9type_infoES3_' collect2: ld returned 1 exit status Also I expected to see an import library build for the boost_python.dll, but i can't see that it is .. this is the contents of my /usr/local/lib libboost_python-gcc-1_33_1.a libboost_python-gcc-d-1_33_1.dll libboost_python-gcc-mt-1_33_1.dll libboost_python-gcc-mt-d.a libcppunit.a libboost_python-gcc-1_33_1.dll libboost_python-gcc-d.a libboost_python-gcc-mt-d-1_33_1.a libboost_python-gcc-mt.a libcppunit.la libboost_python-gcc-d-1_33_1.a libboost_python-gcc-mt-1_33_1.a libboost_python-gcc-mt-d-1_33_1.dll libboost_python-gcc.a I cannot see any .dll.lib or .dll.a I would appricate any comments on this problems. Thanx Ninds

2 2

[shmem] error while closing the segment
by Sascha Lumma 16 Jul '06

16 Jul '06

Hi, I get an error when I try to close the shared memory segment. My destructor calls simply mysegm.close(). I get the message below, but I can't interpret it so that I can do anything with it. It happens only if before a child process, that works in this segment too, is terminated erroneous and subsequently a faultless run was done. But to close the segment should be possible after errors too and at any time. When I restart my application without deleting the segment by hand it hangs in the constructor and I can wait forever, without any message. Thanks a lot, Sascha boost/shmem/detail/segment_manager.hpp:698: bool boost::shmem::detail::segment_manager<CharType, MemoryAlgorithm, IndexType>::priv_generic_named_destroy(const CharT*, typename boost::shmem::detail::segment_manager<CharType, MemoryAlgorithm, IndexType>::index_traits<CharT>::index_type&) [with T = std::pair<int, int>, CharT = char, CharType = char, MemoryAlgorithm = boost::shmem::simple_seq_fit<boost::shmem::shared_mutex_family, boost::shmem::offset_ptr<void, boost::shmem::offset_1_null_ptr> >, IndexType = boost::shmem::flat_map_index]: Assertion `0' failed. Program received signal SIGABRT, Aborted. [Switching to Thread 1076082048 (LWP 6141)] 0xffffe410 in ?? () (gdb) backtrace #0 0xffffe410 in ?? () #1 0xbfffead0 in ?? () #2 0x00000006 in ?? () #3 0x000017fd in ?? () #4 0x4014d7a1 in raise () from /lib/tls/libc.so.6 #5 0x4014ef79 in abort () from /lib/tls/libc.so.6 #6 0x40146fe3 in __assert_fail () from /lib/tls/libc.so.6 #7 0x41b6f53e in priv_generic_named_destroy<std::pair<int, int>, char> (this=0x30000008, name=Variable "name" is not available. ) at lock.hpp:85 #8 0x41b64c45 in ~Mosilapy (this=Variable "this" is not available. ) at segment_manager.hpp:432

4 12

templates for class member functions
by bringiton bringiton 15 Jul '06

15 Jul '06

sorry this is not a boost question, but wondering whether you guys could help with templates. I want to place template parameters on a class's member function. however it does not work: class Test { public: template <class T> void DoTest(T t) { cout << t; } }; Test t; t.DoTest<int>(2); //error C2062: type 'int' unexpected is it possible to do this?

4 4

enable thread safety
by Winson Yung 15 Jul '06

15 Jul '06

Hello, I am building boost regex using VC6, and I am not sure BOOST_HAS_THREADS is enabled by default or not. Reading http://www.boost.org/libs/regex/doc/thread_safety.html, it doesn't tell me which file to look, and how to enable it under VC6 if disabled by default. Could somebody help me on this please? Thanks! /Winson

1 0

Linking libboost...
by Martin Kardigen 15 Jul '06

15 Jul '06

Hello, I'm using test test libraries from boost to testing my code. I want to create Makefile.am rules for my project but I don't know how to define needed libboost libraries because all of boost libraries have -gcc suffix. What I have to do if I want to have code that would be compiled and linked in other compilers then gcc ??? Where can I find some clues about linking BOOST?

2 2

[mpl] Help with simple algorithm needed
by Stephan Tolksdorf 15 Jul '06

15 Jul '06

Hi I'm trying to build a mpl::vector which looks like [(a,1),(a,2),...,(a,a),(a+1,1),...,(b,b)], where a < b are int's and (x,y) stands for mpl::pair< int_<x>, int_<y> >. The following code does not compile with MSVC 8. Could somebody tell me what's wrong with my code? Does someone have an idea how to solve this problem more elegantly with MPL? Any help is much appreciated. Code snippet with the vector named "ListofNMPairs": template <typename N> struct NPush : mpl::lambda< mpl::push_front< mpl::_1, mpl::pair<N, mpl::_2> > >::type { }; template <typename S> struct MyRange : mpl::reverse_fold< mpl::range_c<int, 1, S::value + 1>, mpl::vector< >, NPush<S> >::type { }; typedef mpl::reverse_fold< mpl::range_c<int, 16, 66>, // a=16, b=65 mpl::vector< >, mpl::insert_range< mpl::_1, mpl::begin<mpl::_1>, MyRange<mpl::_2> > >::type ListofNMPairs; Regards, Stephan

2 2

[iterator] reverse_iterator from iterators that return references to data in self.
by Seb Martel 15 Jul '06

15 Jul '06

Hello, given something like: class ProxyIterator : public boost::iterator_facade<ProxyIterator, Costly, boost::random_access_traversal_tag> { public: ProxyIterator(FactoryOfCostly* pF, int i ) : m_pFactory( pF ), m_index( i ) {} private: friend class boost::iterator_core_access; void decrement() {--m_index;} // ... and others Costly& dereference() const { m_value = m_pFactory->MakeCostlyAtIndex( m_index ); return m_value; } private: FactoryOfCostly* m_pFactory; int m_index; mutable Costly m_value; }; I cannot use this ProxyIterator with a boost::reverse_iterator adaptor because the implementation of reverse_iterator's dereference dereferences a temporary: // from reverse_iterator.hpp typename super_t::reference dereference() const { return *boost::prior(this->base()); } and in ProxyIterator, this dereference returns a reference to an internal member, m_value, that will immediately vanish out of existence. Bummer. What if reverse_iterator carried as member the decremented iterator instead of decrementing to a temporary on a dereference? In the current reverse_iterator implementation, decrement must behave properly on an end iterator, but not on a begin iterator. Can a begin iterator be decremented and still used for comparison purposes? -seb

2 1

force inline
by Artem Alimarine 15 Jul '06

15 Jul '06

Hi all, Is there a macro in boost for something like MSVC __forceinline. Currently I have in the project: #if defined __GNUC__ #define FORCE_INLINE __attribute__((always_inline)) #define NO_INLINE __attribute__((noinline)) #elif defined _MSC_VER #define FORCE_INLINE __forceinline #define NO_INLINE __declspec(noinline) #else //#error "no inlines" #define FORCE_INLINE inline #define NO_INLINE #endif I am wondering whether I can get rid of it and use boost for it? Artem

3 3

boost::lambda performance
by Aleksey Loginov 15 Jul '06

15 Jul '06

Where I can find benchmark sources for boost::lambda?

1 0

Re: [Boost-users] Macro to contruct/allocate a shared_ptr?
by David Klein 15 Jul '06

15 Jul '06

boost-users-bounces(a)lists.boost.org wrote: > Hi Dave. That code went over the top of my head. Do you mind > giving me an example of the usage? > > On 7/14/06, David Klein <d.klein(a)ascaron.com> wrote: >> [snip] >> >>> I just have a problem with having the user manage the memory. >>> ie I'd rather do the following: >>> >>> shared_ptr<Test> p(1, 'a', "hello"); >>> or: >>> shared_ptr<Test> p = newptr<Test>(1, 'a', "hello"); >>> >>> instead of: >>> >>> shared_ptr<Test> p(new p(1, 'a', "hello")); >>> >>> but i guess that's a limitation of the language. to get >> >> hi, >> >> have a look at shared_new.zip in the vault. >> >> http://tinyurl.com/khd8v >> >> -- >> HTH dave well, i just tried to compile the shared_new_test.cc, but it failed using vc71 and vc8 (boost 1.33.1). anyway, its quite similiar to the code Roman Perepelitsa posted. a short example using his newptr: struct X { X( int _x, double _y, const std::string & _z ) { ... } } shared_ptr<X> x = newptr<X>(42, 42.0, "hello world");

2 1

stlport?
by bringiton bringiton 14 Jul '06

14 Jul '06

i'm porting my app so that it now uses stl and boost. can someone please give advise on what stl i should be using? i hear about stlport all the time, but not sure why it is used? ie is it better that the version that comes with the compilers? im using ms vc++ 6 at the moment and plan to upgrade to 7.1. should i use the default stl, or install stlport?

3 5

Spirit based shell command interpreter
by George M. Garner Jr. 14 Jul '06

14 Jul '06

Has anyone implemented a shell command interpreter using the boost spirit library? Yes, I am aware of jam/bjam. There is also a calculator example available on the web and the process doesn't seem all that difficult. I just want to see whether this specific application has already been done (before I reinvent the wheel). Regards, George.

1 0

Re: [Boost-users] Boost Test usage
by Matt Schuckmann 14 Jul '06

14 Jul '06

Actually right now we are using 1.32.0, I've downloaded 1.33.1 but I'll have to convince the rest of my group that it's worth it to update to 1.33.1 or I maybe able to use 1.33.1 just for the test library, I don't know yet. IMO Example 3 doesn't really show building a multilevel hierarchy it just shows how to derive from test_suite and add that to the master test_suite. Yes you could create multiple test_suites and add them together in interesting ways but what does that buy you? Now that I see the detailed report level I see some use for hierarchy's, maybe the documentation should mention this and provide some example output. It took me a while to find the command line documentation you might consider making it stand out more in the documentation and maybe even add a standard "-h --help" option so that the test executables are self documenting, if your using boost::program_options this is pretty easy. Thanks for quick feedback I'll see what I can do. I really hate creating a bunch of executables (especially in MS .NET 2003) but I also don't really want to always run all my tests I'll watch for version 1.35. Thanks Matt S.

1 0

A question about shared_ptr
by Zhuo Hao 14 Jul '06

14 Jul '06

In file <boost/shared_ptr.hpp>, I find the following function: /begin quote template<class Y, class D> shared_ptr(Y * p, D d): px(p), pn(p, d) { detail::sp_enable_shared_from_this( pn, p, p ); } /end quote If I use it as follows:"boost::shared_ptr<Investment> pInv(0,getRidOfInvestment)",it will not compile.But when I use:"boost::shared_ptr<Investment> pInv(static_cast<Investment*>(0),getRidOfInvestment)",it can be compiled. The constructor's first parameter is Y*,i.e.,a pointer to Y.And 0 can be interpreted as a pointer to Y,too. Why can't zero be treated as a pointer to Y here? I will be appreciative if anyone can give me some suggestions.Thank you! hzhuo July,14th

3 2

Re: [Boost-users] serialization-lib add user info to XML format
by Eduardo Ferro Aldama 14 Jul '06

14 Jul '06

Hi! Thank very much for the help I am study the lib implementation, and trying to extend xml_oarchive (as you suggest)... Bye >I don't know that I can offer you a good solution. But here is what I can >come up with. > >First a couple of relevant facts about the serialization library. > >a) generally it saves in the archive only that information absolutely >required >to be able to recover the data. This is basad on design/efficiency >considerations. > >b) In some cases it stores "optional" information. That it is, the archive >may be written to save and recover this information. Normally these >are just stubbed out as no ops. > >c) In xml archives, information about object and class id and their >references is included in the xml. I'm don't remember whether its done >in the "optional" types or not. > >c) class name was not considered as one of these optional types > i) it wasn't deemed necessary > ii) it is not always available. Many types (e.g. primitives) are >serialized >without calling the library code. For these cases the "optional" data >is not called. > >So back to your situation. > >What is really needed for you is the following: > >a) some sort reflection for C++ so that you can write something like >t.name(). >b) derive from xml_oarchive to invoke t.name() and insert it into >the xml stream output. Examples of deriving from one archive >type to produce another are in the documentation. > >So the problem is "reduced" to making/finding something like t.name() >which returns a text string which can be inserted into the output stream. > >This already exists on one form - the RTTI implementation uses >type_id(t).name to return a pointer to a name. This may be sufficient >for your needs. The only problem with it is that > >a) the name will be mangled to a unique C++ name. This may not always >be user friendly. >b) the name will be mangled differently for each compiler. > >If you can work with the above limitations - perhaps by massaging the >mangled name to something readable - this can probably be made to work >for you. > >If not - you can use the name passed by BOOST_CLASS_EXPORT which >was "invented" to address the issues above. The only problem is that >BOOST_CLASS_EXPORT might not bedefined for all your types. > >You should have enough here to craft a solution to your problem. > >Good Luck > >Robert Ramey > Ce message ?lectronique et tous les fichiers attach?s sont confidentiels et destin?s exclusivement ? l'usage de la personne ? laquelle ils sont adress?s. Si vous n'?tes pas le destinataire de ce message, merci d'avertir ou de le retourner ? son ?metteur et d?truire ce message ?lectronique et tous les fichiers attach?s de votre syst?me informatique. La publication, l'usage, la distribution, l'impression ou la copie non autoris?e de ce message et des attachements qu'il contient sont strictement interdits. This e-mail and any attachment are confidential and intended solely for the use of the individual to whom it is addressed. If you are not the intended recipient, please telephone or email the sender and delete this message and any attachment from your system. Unauthorized publication, use, dissemination, forwarding, printing or copying of this e-mail and its associated attachments is strictly prohibited. Este correo electr?nico y todos los ficheros adjuntos son confidenciales y destinados exclusivamente al uso de la persona a la cual han sido remitidos. Si Usted no es el destinatario del mensaje, agradecemos advierta al remitente y elimine el mensaje y sus adjuntos de su sistema. La publicaci?n, distribuci?n, impresi?n o copia no autorizada de este mensaje y de sus adjuntos queda estrictamente prohibida.

1 0

Installation on Macintosh
by John Christopher 14 Jul '06

14 Jul '06

Hello I am trying to install boost on a macintosh (Tiger). I downloaded the boost-jam-3.1.13-1-macosxppc.tgz file and uncompressed it in a folder: /Developer/Libraries/boost there I installed bjam and in the Terminal I typed: ./bjam "-sTOOLS=darwin" install everything things run smoothly until I get a lot of error messages like: ...skipped <@boost!include!boost-1_33_1!boost!wave!util>symbol_table.hpp for lack of <directory-grist>/usr/local/include/boost-1_33_1/boost/wave/util... ...skipped <@boost!include!boost-1_33_1!boost!wave!util>time_conversion_helper.hpp for lack of <directory-grist>/usr/local/include/boost-1_33_1/boost/wave/util... ...skipped <@boost!include!boost-1_33_1!boost!wave!util>transform_iterator.hpp for lack of <directory-grist>/usr/local/include/boost-1_33_1/boost/wave/util... ...skipped <@boost!include!boost-1_33_1!boost!wave!util>unput_queue_iterator.hpp for lack of <directory-grist>/usr/local/include/boost-1_33_1/boost/wave/util... and the installation process ends with ...failed updating 8 targets... ...skipped 3649 targets... ...updated 709 targets... Any idea on what I am doing wrong? Thanks in advance

1 1

Re: [Boost-users] Macro to contruct/allocate a shared_ptr?
by Perepelitsa Roman 14 Jul '06

14 Jul '06

> Thanks Roman. > > so is this how i would use your implementation? > > boost::shared_ptr<Test> t = newptr<int, char, std::string>(1, 'a', "hello"); > > that is getting a lot closer to what i need. and is far better that a > MACRO. declaring the types may annoying however. > > the good thing about this approach it that is will also be exception > safe: ie i dont need to declare a variable for the shared_ptr. and > will be cleaned up if g() fails > > // exception safe > fn(newptr<int, char, std::string>(1, 'a', "hello"), g()); You can omit all but the first template parameters because they can be deduced by compiler. shared_ptr<Test> t = newptr<Test>(1, 'a', "hello"); which is equivalent to shared_ptr<Test> t = shared_ptr<Test>(new Test(1, 'a', "hello")); HTH, Roman Perepelitsa.

1 0

Re: [Boost-users] Macro to contruct/allocate a shared_ptr?
by David Klein 14 Jul '06

14 Jul '06

[snip] > I just have a problem with having the user manage the memory. > ie I'd rather do the following: > > shared_ptr<Test> p(1, 'a', "hello"); > or: > shared_ptr<Test> p = newptr<Test>(1, 'a', "hello"); > > instead of: > > shared_ptr<Test> p(new p(1, 'a', "hello")); > > but i guess that's a limitation of the language. to get hi, have a look at shared_new.zip in the vault. http://tinyurl.com/khd8v -- HTH dave

2 1

library to workig with ip-addresses & ranges
by Alex Ott 14 Jul '06

14 Jul '06

Hallo all Is anybody knows a library to manipulate IP-addresses and their ranges. for example, to look ip address N.N.N.N in network specified by X.X.X.X/27, etc. -- With best wishes, Alex Ott Jet Infosystems, Head of software development group, MBA +7 (495) 411 76 01 http://www.jetsoft.ru/

1 0

bug in documentation
by Ovanes Markarian 14 Jul '06

14 Jul '06

Hi! there is currently a bug in boost::lambda documentation ( <http://www.boost.org/doc/html/lambda/s03.html> http://www.boost.org/doc/html/lambda/s03.html) Current version: template <class T> : public binary_function<T, T, T> struct plus { T operator()(const T& i, const T& j) const { return i + j; } }; should be: template <class T> struct plus : public binary_function<T, T, T> { T operator()(const T& i, const T& j) const { return i + j; } }; With Kind Regards, Ovanes

2 1

problem building boost's bjam for boost-1.32.0 on solaris with gcc
by William Deegan 14 Jul '06

14 Jul '06

Greetings, Here's whats happening: bash ./build.sh ### ### Using 'gcc' toolset. ### rm -rf bootstrap.gcc mkdir bootstrap.gcc gcc -o bootstrap.gcc/jam0 command.c compile.c execnt.c execunix.c execvms.c expand.c filent.c fileos2.c fileunix.c filevms.c glob.c hash.c hdrmacro.c headers.c jam.c jambase.c jamgram.c lists.c make.c make1.c newstr.c option.c parse.c pathunix.c pathvms.c regexp.c rules.c scan.c search.c subst.c timestamp.c variable.c modules.c strings.c filesys.c builtins.c pwd.c ./bootstrap.gcc/jam0 -f build.jam --toolset=gcc --toolset-root= build.jam:66: in module scope *** argument error * rule toolset ( name command : opt.out + : opt.define + : release-flags * : debug-flags * : linklibs * ) * called with: ( cc /eng/tools/cm/solaris/bin/gcc -m64 : -o : -D : -s -O : -g : ) * extra argument build.jam:39:see definition of rule 'toolset' being called This is run via script. If I run it interactively it builds fine. I'm trying to script up building boost+ many other third party packages for many platforms. Any idea why it fails when run via a script? Thanks, Bill

2 5

boost regex seg fault, can't run a single example....
by paulo.fernando.silva＠sapo.pt 13 Jul '06

13 Jul '06

Greetings I've just emerged (I'm using gentoo) boost, once using bjam and another time without it. In both cases (not that it could make a difference) I just can't get the boost_regex to work. It blows... After compiling a few examples (captures_example, and grep) in both my home and work pc. I get the same result... segmentation fault. While running captures_example in the line std::cout << " $" << i << " = \"" << what[i] << "\"\n"; After doing some debug, I was able to find only the consequence. (I didn't search that hard...) In sub_match.hpp:73 result.append(1, *i); the value of i is 0x1<address out of bounds>. the line match_results.hpp:123 supposly returns const boost::sub_match<__gnu_cxx::__normal_iterator<char const*, std::string> > &) @0x804ded8: {<std::pair<__gnu_cxx::__normal_iterator<char const*, std::string>, __gnu_cxx::__normal_iterator<char const*, std::string> >> = { first = {<std::iterator<std::random_access_iterator_tag, char, int, char const*, char const&>> = {<No data fields>}, _M_current = 0x1 <Address 0x1 out of bounds>}, second = {<std::iterator<std::random_access_iterator_tag, char, int, char const*, char const&>> = {<No data fields>}, _M_current = 0x804d067 "eeeeeeee"}}, matched = 111, m_captures = {ptr = 0x1}} strangely enough, in the debuger, after returning from line match_results.hpp:123 the execution jumps to match_results.hpp:125 and return return m_null; but the cpu registers don't change... the truth is that I get this Program received signal SIGSEGV, Segmentation fault. 0x0804a6d6 in boost::sub_match<__gnu_cxx::__normal_iterator<char const*, std::string> >::str ( this=0x804ded8) at sub_match.hpp:73 73 result.append(1, *i); for no apparent reason. Any ideas? I'm using gcc 4.1 in my home pc and gcc 3.3.6 in my office pc. PIII800MHz and PIV1.5GHz both with 512MB ram. ___________________________________________________________________ O SAPO já está livre de vírus com a Panda Software, fique você também! Clique em: http://antivirus.sapo.pt

2 2

vector vs list speed test
by bringiton bringiton 13 Jul '06

13 Jul '06

I'm just wondering what your thoughts are on my findings. I need a container that meets the following: - forward iteration only - insert to end only - no random access - delete from any position - average size of list will be 64 items I would first say use list over vector. because no random access and delete from any position. I ran some performance tests, which proved otherwise. The test builds a list by inserting to end. And then removes all items from the front until size == 0. (note: removing from index [0] should provide worst case linear complexity for vector) Here are my finding for containers of size 64, 256 and 1024. first result uses vector, 2nd uses list. i ran the test in release mode in ms vc++ 6. Test build/remove 64 0.062 0.234 Test build/remove 256 0.422 0.938 Test build/remove 1024 5.844 3.75 - it seems vector is best for smaller lists. even at 256 items, the vector is twice as fast at building at contant time and deleting and worst case linear time. - is this strange behaviour? is my test correct or do i have a bug? - i am also curious to how this runs on other compilers (esp later version of ms vc++) For those curious, here is my code. feel free to pick at it ;) void TestVectBuildDelete(int redoCount, int listSize) { boost::timer t; for (int i = 0; i < redoCount; i++) { // build the list std::vector<int> vect; for (int j = 0; j < listSize; j++) { vect.push_back(j); //vect.insert(vect.begin(), j); //.push_front(j); } // remove all elements in list while (!vect.empty()) { vect.erase(vect.begin()); } } std::cout << t.elapsed() << std::endl; } void TestListBuildDelete(int redoCount, int listSize) { boost::timer t; for (int i = 0; i < redoCount; i++) { // build the list std::list<int> vect; for (int j = 0; j < listSize; j++) { vect.push_back(j); } // remove all elements in list while (!vect.empty()) { vect.pop_front(); } } std::cout << t.elapsed() << std::endl; } void Test() { std::cout << "Test build/remove 64" << std::endl; TestVectBuildDelete(10000, 64); TestListBuildDelete(10000, 64); std::cout << "Test build/remove 256" << std::endl; TestVectBuildDelete(10000, 256); TestListBuildDelete(10000, 256); std::cout << "Test build/remove 1024" << std::endl; TestVectBuildDelete(10000, 1024); TestListBuildDelete(10000, 1024); }

6 10

boost windows installer problem
by Ovanes Markarian 13 Jul '06

13 Jul '06

Hello, is there any way to specify the proxy server to the installer provided by boost-consulting? At work I can access inet via some proxy server only. Now I have to rebuild the entire boost lib again... May be boost-consulting should offer big old monolithic single file installations for vc8.0 or vc7.1 for those who cannot easily access network and still require all libs. With Kind Regards, Ovanes Markarian

4 5

Boost::Spirit - Just enough to match a term?
by Eric Hill 13 Jul '06

13 Jul '06

I'm past the initial learning curve with Spirit, but would like to see how the pros handle this problem. I have the following simple command structure: show queues show users show processes start process foo queue user bar to process foo ...etc I would like to parse these commands with Spirit. Easy enough. Since this is being entered from a keyboard, it would be nice to short-circuit the parser so you only have to enter enough of the command for the parser to reliably figure out what you want. e.g. "sh qu" would parse as "show queues", and "st pr foo" would parse as "start process foo". I can easily model the whole "show queues" command word with: str_p("show") >> str_p("queues") But how do I match "just enough" instead of "whole word" without doing it manually? TIA, Eric

3 4

serialization-lib add user info to XML format
by Eduardo Ferro Aldama 13 Jul '06

13 Jul '06

Hi! We are trying the boost's serialization-lib to serialize C++ objets to send them throw the network. Initialy, we are use xml-serialization to facilitate the inspect the comunications. We are trying to develop a little tool to work/inspect this messages (xml-serializated) but we need to develop this tool in another languaje (in this case python) and We want that this tool don't need to know nothing about the original C++ clases.... In order to develop this tool we need add to the output xml string information about the names of the class that we are serializing -Is possible to configure something to add the class name in the xml output format? -Can we add any other information to taht format without disturb the deserialization process?? Some hint/tipo/doc to add this functionality without changing the boost-lib source? Thanks in advance Please accept my apologies for my poor english -- Eduardo Ferro Aldama Desarrollo TPVs (Gestión Stock) Tlf 91 5142101 Ext:2101 Ce message électronique et tous les fichiers attachés sont confidentiels et destinés exclusivement à l'usage de la personne à laquelle ils sont adressés. Si vous n'êtes pas le destinataire de ce message, merci d'avertir ou de le retourner à son émetteur et détruire ce message électronique et tous les fichiers attachés de votre système informatique. La publication, l'usage, la distribution, l'impression ou la copie non autorisée de ce message et des attachements qu'il contient sont strictement interdits. This e-mail and any attachment are confidential and intended solely for the use of the individual to whom it is addressed. If you are not the intended recipient, please telephone or email the sender and delete this message and any attachment from your system. Unauthorized publication, use, dissemination, forwarding, printing or copying of this e-mail and its associated attachments is strictly prohibited. Este correo electrónico y todos los ficheros adjuntos son confidenciales y destinados exclusivamente al uso de la persona a la cual han sido remitidos. Si Usted no es el destinatario del mensaje, agradecemos advierta al remitente y elimine el mensaje y sus adjuntos de su sistema. La publicación, distribución, impresión o copia no autorizada de este mensaje y de sus adjuntos queda estrictamente prohibida.

2 1

[regex] matchinf info with merged regex
by Line Oddskool 13 Jul '06

13 Jul '06

Hi boost.regex gurus, I'm stuck with a problem dealing with some kind of regex merging (using boost 1.33). I don't know if the way I took is viable, so any ideas and advice will be appreciated. To give you some insight, i have a set of a hundred matching (ei) and formating (ri) "rules" e.g. e1 : (a)(?=ll) r1 : (?1o) e1/r1 should mean "matching 'a' of some string like 'all' should be replaced by 'o'" I merge all my e/r into one big regex using regex_merge (for performance), so the resulting matching/formating regex is like : e : e1|e2|...|en r: r1r2...rn I'm getting weird behaviour with this, as the resulting string is sometimes filled with sequences like 'u4u5u6u7u8u9u' or other "trash". So to debug this, I'd like to know which rule (i.e. which ei) matched on what part of the string. I'm unsure if it's possible to get some kind of iterator on the rules that have matched using regex_merge ? I also looked at the match_results returned by the simpler method regex_match(), but I can't figure out how to know which part of my matching regex matched (i.e. which ei) ? Otherwise, is there a way to analyse or dump the matching/replacing behaviour of such a complex regex ? Thanks Line.

2 3

[Iterator] const and an iterator's value_type
by Daniel Mitchell 13 Jul '06

13 Jul '06

In the documentation of iterator_facade it is stated that: "The C++ standard requires an iterator's value_type not be const-qualified, so iterator_facade strips the const from its Value parameter in order to produce the iterator's value_type. Making the Value argument const provides a useful hint to iterator_facade that the iterator is a constant iterator, and the default Reference argument will be correct for all lvalue iterators." and "when defining a constant lvalue iterator, the user can pass a const-qualified version of the iterator's value_type as iterator_facade's Value parameter and omit the Reference parameter which follows." Am I to understand from this that iterator_facade<Derived,T const,Category> is equivalent to iterator_facade<Derived,T,Category,T const&>, and likewise for iterator_adaptor? D.

1 0

Re: [Boost-users] c array parameter in resize method of multi_array
by Manuel.Yguel＠inrialpes.fr 13 Jul '06

13 Jul '06

I think that any container that have the proper size would be ok. I would like to know too, if there are some compile flags that will prevent me to do: void outOfBound() { typedef boost::multi_array<double, 3> array_type; array_type A( boost::extents[3][4][2] ); A[12][3][43] = 8.0; printf( "Value: %f\n", A[12][3][43] ); } either at compile-time or at run time.

1 0

[lambda] ->* vs. bind
by Christian Rössel 13 Jul '06

13 Jul '06

Hello, assume I want to do a std::find_if on a container of A* with struct A { int foo; }; Now I have two ways of writing the predicate for find_if: 1. find_if (cont.begin (), cont.end (), _1 ->* &A::foo == 42); 2. find_if (cont.begin (), cont.end (), bind (&A::foo, _1) == 42); They both perform as expected. Are there any differences that make one of them preferrable? Thanks, Christian

1 0

__fastcall warning when compiling boost in managed c++
by ChuMing 13 Jul '06

13 Jul '06

Hi, I am handling some project which mixes managed and unmanaged C++ code. With boost 1.33 I’m hitting problems with the header is_mem_fun_pointer_tester.hpp. There are warnings popping up due to the use of __fastcall calling convertion in boost and its incompatible with compiling some of our code with the /clr flag turned on. Managed C++ is incompatible with the __fastcall calling convention because what it does is it preloads certain registers with the function parameters but for /clr compilation it is compiling to MSIL so this cannot be done and upon encountering any __fastcall the Managed C++ compiler will change it to __stdcall. Does anyone know the implications of disabling these warnings and whether it is safe to do that? I did not get these warnings with the previous versions of boost though. Thanks and regards, Chu-Ming

2 3

Regex build problem using g++ under cygwin
by Darren.Moore＠csiro.au 13 Jul '06

13 Jul '06

Hi, I've just started trying to use the Regex library with g++ 3.4.4 under cygwin. I am using the boost 1_33_1 libraries that are installed by cygwin's setup program. For some reason that I cannot figure out, building fails for this simple program test-regex.cpp : #include <boost/regex.hpp> using namespace boost; int main() { regex re; re.assign("hey"); } My build command is: g++ -I/usr/include/boost-1_33_1 -lboost_regex-gcc-mt-s test-regex.cpp Compilation is ok, but during linking I get: /cygdrive/d/temp/ccrjdFg7.o:test-regex.cpp:(.text$_ZN5boost11basic_regex IcNS_12regex_traitsIcNS_16cpp_regex_traitsIcEEEEE6assignEPKcS7_j[boost:: basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::assign(char const*, char const*, unsigned int)]+0x22): undefined reference to `boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::do_assign(char const*, char const*, unsigned int)' collect2: ld returned 1 exit status I cannot figure out how to solve this problem, and would be grateful if anyone can offer any help. Thanks, Darren Moore.

4 3

[thread] TSS locking?
by Cory Nelson 13 Jul '06

13 Jul '06

Hello! The documentation doesn't seem to mention this. Does thread_specific_ptr have any guarantees about locking (mutex etc) when you call get() or reset()? I'd like to use it in a library but if locks I'll have to roll my own. Thanks! -- Cory Nelson http://www.int64.org

1 0

Seg faults when using boost::regex_replace in multiple threads
by mailinglist＠kamba.net.nz 12 Jul '06

12 Jul '06

Hello, I'm having a few problems with boost::regex_replace seg faulting when used in a multithreaded program. The problem seems to be identical to the one described in http://lists.boost.org/boost-users/2006/06/20235.php, with a seg fault on line 133 of regex_format.hpp, though I have linked against the multithreaded version of libboost_regex.so and the problem is still happening. Unfortunately, I never saw any definitive answer for what was causing the original poster's problems. =========================================== Stack trace: =========================================== Program received signal SIGSEGV, Segmentation fault. [Switching to Thread -584664144 (LWP 28385)] 0x080520e0 in boost::re_detail::basic_regex_formatter<boost::re_detail::string_out_ite rator<std::string>, boost::match_results<char const*, std::allocator<boost::sub_match<char const*> > >, boost::regex_traits_wrapper<boost::regex_traits<char, boost::cpp_regex_traits<char> > > >::format_all (this=0xdd26b8d0) at regex_format.hpp:133 133 switch(*m_position) (gdb) where #0 0x080520e0 in boost::re_detail::basic_regex_formatter<boost::re_detail::string_out_ite rator<std::string>, boost::match_results<char const*, std::allocator<boost::sub_match<char const*> > >, boost::regex_traits_wrapper<boost::regex_traits<char, boost::cpp_regex_traits<char> > > >::format_all (this=0xdd26b8d0) at regex_format.hpp:133 #1 0x080518be in boost::re_detail::basic_regex_formatter<boost::re_detail::string_out_ite rator<std::string>, boost::match_results<char const*, std::allocator<boost::sub_match<char const*> > >, boost::regex_traits_wrapper<boost::regex_traits<char, boost::cpp_regex_traits<char> > > >::format (this=0xdd26b8d0, p1=0xd55005dc "$1", p2=0xd55005de "", f=format_all) at regex_format.hpp:123 #2 0x08051073 in boost::re_detail::regex_format_imp<boost::re_detail::string_out_iterator <std::string>, char const*, std::allocator<boost::sub_match<char const*> >, char, boost::regex_traits_wrapper<boost::regex_traits<char, boost::cpp_regex_traits<char> > > > (out= {<std::iterator<std::output_iterator_tag, char, int, char*, char&>> = {<No data fields>}, out = 0xdd26ba70}, m=@0xd5500518, p1=0xd55005dc "$1", p2=0xd55005de "", flags=format_all, t=@0x8064140) at regex_format.hpp:569 #3 0x08050710 in format<boost::re_detail::string_out_iterator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > > > (this=0xd5500518, out={<std::iterator<std::output_iterator_tag, char, int, char*, char&>> = {<No data fields>}, out = 0xdd26ba70}, fmt=@0xdd26b990, flags=format_all, re=@0x805f6ec) at match_results.hpp:170 #4 0x0804fe35 in boost::regex_replace<boost::re_detail::string_out_iterator<std::string>, char const*, boost::regex_traits<char, boost::cpp_regex_traits<char> >, char> (out= {<std::iterator<std::output_iterator_tag, char, int, char*, char&>> = {<No data fields>}, out = 0xdd26ba70}, first=0xd550048c "abcdefgh", last=0xd5500494 "", e=@0x805f6ec, fmt=0x805a2a9 "$1", flags=format_all) at regex_replace.hpp:53 #5 0x0804f7e1 in boost::regex_replace<boost::regex_traits<char, boost::cpp_regex_traits<char> >, char> (s=@0xdd26ba80, e=@0x805f6ec, fmt=0x805a2a9 "$1", flags=format_all) at regex_replace.hpp:84 #6 0x0804f3c4 in test_fn () at regexTest.C:32 #7 0xf63e5dec in start_thread () from /lib/tls/libpthread.so.0 #8 0xf6385a2a in clone () from /lib/tls/libc.so.6 (gdb) print *this $1 = {m_traits = @0x8064140, m_results = @0xd5500518, m_out = {<std::iterator<std::output_iterator_tag, char, int, char*, char&>> = {<No data fields>}, out = 0xdd26ba70}, m_position = 0xd44ff5d6 <Address 0xd44ff5d6 out of bounds>, m_end = 0xd55005de "", m_flags = format_all, m_state = output_copy, m_have_conditional = false} ========================================== GCC version is 3.2.3 20030502 (Red Hat Linux 3.2.3-42), with Boost 1.33.1, on a 4 CPU machine. We're using the STL from RogueWave, though since the post from a couple of weeks ago had the same problem with both GCC and STLport libraries I don't think that's the problem. This problem also occurs with version 1.33.0, but not with 1.32 or earlier. Does anyone know if there is a known problem with using these new versions of boost::regex_replace in multiple threads? If it's helpful, I have a very simple test program that demonstrates the problem. Any help on this would be greatly appreciated. Kind regards, Alistair Potts

3 2

serialization with hash_map problem
by Van Kincaid 12 Jul '06

12 Jul '06

Hi, I just started learning to use serialization and having problems with compiling for hash_map (map/deque/etc all work fine for me). I found your discussion a while ago relating to this http://thread.gmane.org/gmane.comp.lib.boost.user/12609/focus=12609 So I built my test program with g++ -D__GLIBCPP__ -DBOOST_HAS_HASH -DBOOST_STD_EXTENSION_NAMESPACE=__gnu_cxx -c test.cpp -o test.o And I still have the following compile errors saying that serialize function for hash_map is not defined. I also looked at the preprocessor output and did find the definition for hash_map serialize() function. It doesn't make sense to me why this happens. Any help is greatly appreciated. The test file is attached at the end. /usr/local/include/boost/serialization/access.hpp: In static member function 'static void boost::serialization::access::serialize(Archive&, T&, unsigned int) [with Archive = boost::archive::text_oarchive, T = __gnu_cxx::hash_map<int, boost::shared_ptr<DaoData>, __gnu_cxx::hash<int>, std::less<int>, std::allocator<boost::shared_ptr<DaoData> > >]': /usr/local/include/boost/serialization/serialization.hpp:81: instantiated from 'void boost::serialization::serialize(Archive&, T&, unsigned int) [with Archive = boost::archive::text_oarchive, T = __gnu_cxx::hash_map<int, boost::shared_ptr<DaoData>, __gnu_cxx::hash<int>, std::less<int>, std::allocator<boost::shared_ptr<DaoData> > >]' /usr/local/include/boost/serialization/serialization.hpp:140: instantiated from 'void boost::serialization::serialize_adl(Archive&, T&, unsigned int) [with Archive = boost::archive::text_oarchive, T = __gnu_cxx::hash_map<int, boost::shared_ptr<DaoData>, __gnu_cxx::hash<int>, std::less<int>, std::allocator<boost::shared_ptr<DaoData> > >]' /usr/local/include/boost/archive/detail/oserializer.hpp:148: instantiated from 'void boost::archive::detail::oserializer<Archive, T>::save_object_data(boost::archive::detail::basic_oarchive&, const void*) const [with Archive = boost::archive::text_oarchive, T = __gnu_cxx::hash_map<int, boost::shared_ptr<DaoData>, __gnu_cxx::hash<int>, std::less<int>, std::allocator<boost::shared_ptr<DaoData> > >]' test.cpp:157: instantiated from here /usr/local/include/boost/serialization/access.hpp:109: error: 'class __gnu_cxx::hash_map<int, boost::shared_ptr<DaoData>, __gnu_cxx::hash<int>, std::less<int>, std::allocator<boost::shared_ptr<DaoData> > >' has no member named 'serialize' ----------------------------------- test.cpp #include <fstream> #include <map> #include <iostream> #include <ext/hash_map> #include <boost/serialization/shared_ptr.hpp> #include <boost/serialization/map.hpp> #include <boost/serialization/hash_map.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/serialization/serialization.hpp> using namespace std; using namespace __gnu_cxx; using namespace boost; using namespace boost::serialization; template<typename DataType, typename KeyType, typename CompareType> class DAO { friend class serialization::access; public: typedef shared_ptr<DataType> DataTypePtr; typedef pair<KeyType, DataTypePtr> KeyDataPair; #if 0 typedef map<KeyType, DataTypePtr> DataTypeMap; #else typedef hash_map<KeyType, DataTypePtr, hash<KeyType>, CompareType> DataTypeMap; #endif typedef typename DataTypeMap::iterator DataTypeMapIter; typedef typename DataTypeMap::const_iterator DataTypeMapConstIter; DAO() {} ~DAO() {} template <class Archive> void serialize( Archive& ar, const unsigned int version ) { ar & m_dataTypeMap; } void insertData( DataTypePtr dataPtr ) { m_dataTypeMap.insert( KeyDataPair( dataPtr->getKey(), dataPtr ) ); } void display() const { DataTypeMapConstIter iter = m_dataTypeMap.begin(); while ( iter != m_dataTypeMap.end() ) { iter->second->display(); iter++; } } void save_binary( const char* filename ) { ofstream ofs(filename); archive::text_oarchive oa(ofs); oa & *this; } bool load_binary( const char* filename ) { try { ifstream ifs( "test.dat", ios::binary ); archive::text_iarchive ia( ifs ); ia & *this; display(); return true; } catch ( exception& e ) { cerr << "Exception caught: " << e.what() << endl; return false; } } private: DataTypeMap m_dataTypeMap; }; class DaoData { public: int m_key; string m_keyStr; DaoData() {} DaoData( int key, const string& keyStr ) : m_key( key ), m_keyStr( keyStr ) { } DaoData( DaoData& daoData ) { m_key = daoData.m_key; m_keyStr = daoData.m_keyStr; } ~DaoData() {} int getKey() const { return m_key; } void display() const { cout << "key = " << m_key << endl; cout << "keyStr = " << m_keyStr << endl; } template <class Archive> void serialize( Archive& ar, const unsigned int version ) { ar & m_key; ar & m_keyStr; } }; void test_dao_serialize() { DAO<DaoData, int, less<int> > myDao; shared_ptr<DaoData> dataPtr( new DaoData( 1, "ONE" ) ); myDao.insertData( dataPtr ); shared_ptr<DaoData> dataPtr2( new DaoData( 2, "TWO" ) ); myDao.insertData( dataPtr2 ); myDao.save_binary( "test.dat" ); //myDao.load_binary( "test.dat" ); } int main() { test_dao_serialize(); return 0; }

1 0

Re: [Boost-users] shared_ptr implicit dynamic cast
by Andrew Holden 12 Jul '06

12 Jul '06

Scott McMurray wrote > My apologies, I didn't know that. Certainly a very nice feature as it > means that even without the virtual destructor both would be safe. > > Promises to double-check the documentation before replying next time, No worries. It wasn't exactly a highly advertised feature. Besides, the note implied that older versions of shared pointer didn't do that, so I just figured you learned about shared pointers before they added it. Andrew

1 0