February 2007 - Boost-users - lists.preview.boost.org

Re: [Boost-users] How to access bundled properties individually?
by Shufei Fan 22 Feb '07

22 Feb '07

This question is regarding to BGL, I should have included it on the title. Actually, thank goes to Aaron Windsor. From: fansf(a)hotmail.comTo: boost-users(a)lists.boost.orgSubject: How to access bundled properties individually?Date: Thu, 22 Feb 2007 19:39:10 +0000 First, Thank Doug for answering my previous question on parallel edges. Now, my question is:How to access bundled property individually? I defined my graph like this: struct Node{ int label; int mode[3]; //...;};struct Edge{ double nCommBord;}; typedef boost::adjacency_list< boost::setS, boost::vecS, boost::undirectedS, Node, Edge> Graph;but when I want to access property nCommBord of Edge, there seems to be wrong with my property_map type definition. Anyone can point out for me, what is the right version(I cannot seem to find any comment on this kind of usage)? //get edgeWeight propertyproperty_map<Graph, &Edge::nCommBord>::type p_e = get(&Edge::nCommBord, *rowGraph); The error:c:\...\VCProjects\...xxx.cpp(55) : error C2974: 'boost::property_map' : invalid template argument for 'Property', type expected c:\Boost\include\boost-1_33_1\boost\graph\properties.hpp(205) : see declaration of 'boost::property_map'Thanks, Shufei Connect to the next generation of MSN Messenger Get it now! _________________________________________________________________ Explore the seven wonders of the world http://search.msn.com/results.aspx?q=7+wonders+world&mkt=en-US&form=QBRE

1 0

How to access bundled properties individually?
by Shufei Fan 22 Feb '07

22 Feb '07

First, Thank Doug for answering my previous question on parallel edges. Now, my question is: How to access bundled property individually? I defined my graph like this: struct Node{ int label; int mode[3]; //...;};struct Edge{ double nCommBord;}; typedef boost::adjacency_list< boost::setS, boost::vecS, boost::undirectedS, Node, Edge> Graph; but when I want to access property nCommBord of Edge, there seems to be wrong with my property_map type definition. Anyone can point out for me, what is the right version(I cannot seem to find any comment on this kind of usage)? //get edgeWeight propertyproperty_map<Graph, &Edge::nCommBord>::type p_e = get(&Edge::nCommBord, *rowGraph); The error: c:\...\VCProjects\...xxx.cpp(55) : error C2974: 'boost::property_map' : invalid template argument for 'Property', type expected c:\Boost\include\boost-1_33_1\boost\graph\properties.hpp(205) : see declaration of 'boost::property_map' Thanks, Shufei _________________________________________________________________ Connect to the next generation of MSN Messenger http://imagine-msn.com/messenger/launch80/default.aspx?locale=en-us&source=…

1 0

[mpl::math] exponential metafunction for complex types
by Chris Weed 22 Feb '07

22 Feb '07

Hi, I am getting the wrong result for the exponential of complex numbers such as the following: #include <boost/mpl/math/double.hpp> #include <boost/mpl/math/complex_number.hpp> #include <iostream> int main() { typedef boost::mpl::math::string_c_to_double<'-',2,'.',0>::type minus_two; typedef boost::mpl::times<minus_two,boost::mpl::math::pi<boost::mpl::math::double_tag> >::type minus_two_pi; typedef boost::mpl::math::complex_number<double_zero,minus_two_pi> imag_minus_two_pi; std::cout << imag_minus_two_pi() << std::endl; std::cout << boost::mpl::math::exponential<imag_minus_two_pi>::type() << std::endl; return 0; } This prints: 0-6.28319i 1.0329-0.0109834i which should be 0-6.28319i 1.0000-0.00000i Chris

3 6

[multi_index] view with less items than in container possible?
by Boris 22 Feb '07

22 Feb '07

The various indexes of the multi_index_container help to access items in a container differently. Is it also possible to create an index somehow with access to less items in the container? If there is for example a container with employees and I often need to iterate over female employees only is there a way to create an index for this (there could be a bool in the employee class to indicate who is female)? Boris

2 1

boost_1_30_0\boost\crc.hpp(389) : warning C4245: 'initializing' : conversion from 'int' to 'const boost::detail::mask_uint_t<16>::least', signed/unsigned mismatch
by ERIC BERTRAND 22 Feb '07

22 Feb '07

I have this warning on Visual studio 2005. I want to get rid of theses warning. It apperas at line BOOST_STATIC_CONSTANT( least, sig_bits = (~( least(0u) )) ); if I cast (least)(~( least(0u) )) I have not the warning. I want to be sure this is acceptable. Can someone confirm to me? Thanks -- --------------------------------------------------------- erbere erbere(a)gmail.com

2 1

sub_range, assign and permutation_iterator related problem
by abir basak 22 Feb '07

22 Feb '07

Hi, It is an extension to one my previous post, where I needed help while giving access to a sub_range for of an container. In that problem , Mr Thorsten Ottosen, provided answer to all of my queries (Many thanks to him ). This time I am interested to provide indexed access to a vector with a sub_range ,using permutation_iterator. Here some codes are creating problem, while I am using sub_range with permutation iterator. To specify, I am providing a small test code. typedef std::pair<std::size_t,std::size_t> pair_t; template<typename T> class vector_e : private std::vector<T>{ public: typedef vector_e<T> self_type; typedef typename std::vector<T>::iterator iterator; typedef typename std::vector<T>::const_iterator const_iterator; typedef boost::sub_range<self_type> range; typedef boost::sub_range<const self_type> const_range; typedef typename std::vector<T>::size_type size_type; typedef std::vector<int> index_type; typedef typename boost::permutation_iterator<typename iterator,index_type::const_iterator> index_iterator; typedef typename boost::permutation_iterator<typename const_iterator,index_type::const_iterator> const_index_iterator; vector_e() : std::vector<T>(){} using std::vector<T>::begin; using std::vector<T>::end; using std::vector<T>::operator []; using std::vector<T>::insert; index_iterator begin_i(const index_type& i){ return boost::make_permutation_iterator(begin(),i.begin()); } const_index_iterator begin_i(const index_type& i)const{ return boost::make_permutation_iterator(begin(),i.begin()); } index_iterator end_i(const index_type& i){ return boost::make_permutation_iterator(begin(),i.end()); } const_index_iterator end_i(const index_type& i)const{ return boost::make_permutation_iterator(begin(),i.end()); } range get_range(const pair_t& range){ return boost::make_iterator_range(begin()+range.first,begin()+range.second); } const_range get_range(const pair_t& range)const{ return boost::make_iterator_range(begin()+range.first,begin()+range.second); } range get_range(const index_type& i){ return boost::make_iterator_range(boost::make_permutation_iterator(begin(),i.begin()), boost::make_permutation_iterator(begin(),i.end())); } }; int main(int argc,char** argv) { using namespace boost; using namespace boost::assign; using namespace boost::lambda; using boost::lambda::_1; typedef vector_e<int> elem_t; typedef std::vector<int> index_t; elem_t v; int a[] = {00,10,20,30,40,50,60,70,80,90,100}; v.insert(v.end(),a,a+11); const elem_t& cv = const_cast<elem_t&>(v); //v+= 00,10,20,30,40,50,60,70,80,90,100; std::cout<<"original array : "; std::for_each(v.begin(),v.end(),std::cout<<_1<<" "); ///For continuous ranges. elem_t::range r = v.get_range(std::make_pair(1,5)); std::cout<<std::endl<<" range (1,5) : "; ///working fine std::for_each(r.begin(),r.end(),std::cout<<_1<<" "); ///working fine elem_t::const_range cr = v.get_range(std::make_pair(1,5)); std::cout<<std::endl<<" c_range (1,5) : "; std::for_each(cr.begin(),cr.end(),std::cout<<_1<<" "); ///working fine elem_t::const_range cr1 = cv.get_range(std::make_pair(1,5)); std::cout<<std::endl<<" c_range1 (1,5) : "; std::for_each(cr1.begin(),cr1.end(),std::cout<<_1<<" "); index_t i; i+=0,2,6,4,9; std::cout<<std::endl<<" index : "; std::for_each(i.begin(),i.end(),std::cout<<_1<<" "); std::cout<<std::endl<<"index range "; //working fine std::for_each(v.begin_i(i),v.end_i(i),std::cout<<_1 << " "); std::cout<<std::endl<<"c index range "; ///working fine std::for_each(cv.begin_i(i),cv.end_i(i),std::cout<<_1 << " "); ///not working (and its const counter part ) elem_t::range ir = v.get_range(i); } The error it is giving in visual studio 7.1 for sub_range of permutation_iterator is, E:\boost_1_33_1\boost\range\iterator_range.hpp(60): error C2440: 'type cast' : cannot convert from 'boost::range_iterator<C>::type' to 'boost::range_iterator<C>::type' with [ C=const boost::iterator_range<vector_e<int>::index_iterator> ] and [ C=vector_e<int>::self_type ] The questions are 1) Can anyone point out the problem ? (Is sub_range is typed by iterator by any chance, or typed by container only ? ) 2) This is aux question. How to make assign library work for my inherited container (vector_e here ), like the commented line ? any help is appreciated, and thanks to the community . abir -- Abir Basak, Member IEEE Software Engineer, Read Ink Technologies B. Tech, IIT Kharagpur email: abir(a)abirbasak.com homepage: www.abirbasak.com

1 1

[BGL] Dijkstra visitor for examine edge event
by Alejandro Marcos Aragón 22 Feb '07

22 Feb '07

Hi everyone, I posted this message but I haven't received any response so I decided to post it again. I am trying to store all the vertices with their respective distances from a source within the Dijkstra shortest path algorithm. For that I plan to use a std::vector<std::queue > >. I was able to have the visitor working but I don't know how to access to those values that are computed automatically by the algorithm (d_v, d_u, for example). The code I wrote is as follows: template <class Tag> struct vis : public default_dijkstra_visitor { vis() { } template <class Edge, class Graph> void edge_relaxed(Edge e, Graph& g){ cout<<"VISITOR!!!"<<endl; cout<<"Edge -> "<<e<<endl; } private: std::vector<std::queue<Vertex> > storage; }; template <class Tag> vis<Tag> target_visit(Tag) { return vis<Tag>(); } void Dijkstra() { // maps needed by the algorithm IndexMap indexmap = get(vertex_index, *gPtr); WeightMap weightmap = get(edge_weight, *gPtr); // define containers for the predecessor vertices and // for distances std::vector<Vertex> pred(num_vertices(*gPtr)); std::vector<double> dist(num_vertices(*gPtr)); // vertex to compute Dijkstra's algorithm on Vertex source = vertex(get_source(), *gPtr); // Dijkstra's algorithm dijkstra_shortest_paths(*gPtr, source, predecessor_map(&pred[0]).distance_map(&dist[0]).visitor(target_visit(on_examine_edge()))); ... Any help will be appreciated. a^2

2 3

[BGL] merger parallel edges
by Shufei Fan 22 Feb '07

22 Feb '07

Hi, I am new to Boost Graph Library. I have two questions. I defined my graph like this: struct Node{ int label; int mode[3]; //...;}; struct Edge{ double nCommBord;}; typedef boost::adjacency_list< boost::vecS, boost::vecS, boost::undirectedS, Node, Edge> Graph;Somewhere in my program, I construct it using add_edge() method. What I want is, I allow parallel edges, but I all parallel ones being merged(weight summed together). Can I add edges one by one, and use an general method to 'magically' merge them?(is there a function doing merging?) My second question is, where should I find a complete list of usage of all the library methods(say, manual for add_edge) Thanks, Regards, Shufei _________________________________________________________________ Invite your mail contacts to join your friends list with Windows Live Spaces. It's easy! http://spaces.live.com/spacesapi.aspx?wx_action=create&wx_url=/friends.aspx…

2 1

[signals] connection::add_tracked() proposal
by Frank Mori Hess 21 Feb '07

21 Feb '07

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I'd like to propose we add an add_tracked() function to the connection object. This would allow an arbitrary shared_ptr/weak_ptr to be added to the list of objects tracked for the slot. The justification is to allow for situations where an object needed by the slot is not directly owned by a shared_ptr, or doesn't directly correspond to an argument of the bound function. For example, the bound argument might be contained inside another object which is in turn managed by a shared_ptr. We could actually dump boost::track() entirely if we wanted, if we have add_tracked(). - -- Frank -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.1 (GNU/Linux) iD8DBQFF3Gxq5vihyNWuA4URAmS+AJkB3tgE/8p7GlCY+xq+UwfTFjZwigCgoQh0 fgQdVgH73Oh3j1g34HNy+JY= =3UVL -----END PGP SIGNATURE-----

4 9

Serialization newbie question
by Surya Kiran Gullapalli 21 Feb '07

21 Feb '07

Hello all, I'm a newbie to boost serialization and i need some help. I'm using boost serialization, to serialize a class, which contains 3 std::string members. After i serialize i add it to a database. The database I'm using is berkeley-db. The database API needs key/data pair, both in void* type. Now for my problem, the key is std::string, so I'm passing in key as (void *)key.c_str(), I know its crude, but i'm just starting. Now for the data part, I've to serialize the complete class. As, boost::archive::binary_oarchive, takes ostream& as argument for constructor, I've done like this. std::ostringstream os ; boost::archive::binary_oarchive oa (os) ; oa << class_obj ; so the class_obj has been written to os. so i'm sending data to db api as (void *)os.str().c_str(). To retrieve data, I'm using something like this data=db.get_data() ; istringstream is((char *)data) ; boost::archive::binary_iarchive (is) ; The code compiled fine and at run time i'm getting exception basic::string::resize during construction of binary_iarchive. Obviously i was doing wrong. My question is how to serialize data and write it to memory than to a file? and how do i access it again? Thanks in advance, Surya

2 3

Boost Serialization library with Berkeley-DB
by Surya Kiran Gullapalli 21 Feb '07

21 Feb '07

Hello all, Has any body ever used Boost serialization library with Berkeley-DB database to store/retrieve data. I'd like some pointers on how to use it?. Sample code would be most appreciated. Thanks, Surya

1 0

How to build guid lib?
by Christian Henning 21 Feb '07

21 Feb '07

Hi there, it's not as easy as I thought it would be. I copied the guid files in the appropriate folders in my boost/ directory. And then I tried: bjam -sTOOLS=vc-7_1 --with-guid But that doesn't work. So, how do I do that? I really have no clue about bjam, etc. Thanks in advance, Christian

4 10

[graph] Crash in breadth_first_search
by Jens Müller 21 Feb '07

21 Feb '07

Can someone help me with the following program? It crashes with Boost 1.33.1 on gcc34 (GCC) 3.4.3 20050113 (Red Hat 3.4.3-16): $ ./1 make_map_as_colormap entered writing something to MapAsColorMap Speicherzugriffsfehler I have tracked down the crash to this line in <boost/graph/breadth_first_search.hpp>: for (tie(ei, ei_end) = out_edges(u, g); ei != ei_end; ++ei) { But I don't know what happens there ... I'm quite sure the bug is NOT in my color map proxy ... Thanks a lot in advance! Cheers, Jens // //======================================================================= // Copyright 2007 University of Karlsruhe // Author: Jens Mueller // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) //======================================================================= // #ifndef BFS_DISTMAP_8737 #define BFS_DISTMAP_8737 /* Use distance map (or anything else which suits the following requirements) as a color map. Write operations are just ignored. Read operations work as follows: When the value in the underlying map equals a specified value, e.g. -1 in a distance map, or the null pointer in a predecessor map, the 'White' value is returned, otherwise the 'Black' value is returned. Note: This only is usable for application where there is no need to distinguish gray and black non-tree edge targets. Note: Setting the value in the underlying map so that it no longer corresponds to a 'White' value will have to be done by the visitor on the discover_vertex event. */ /* Template parameters: - ColorValue (default value used by helper function: default_color_type) - ReadablePropertyMap (underlying map) */ /* Runtime parameters: - ReadablePropertyMap pm - ReadablePropertyMap::value_type white (must be == comparable) */ #include <boost/property_map.hpp> #include <iostream> template<typename ReadablePropertyMap, typename ColorValue> class MapAsColorMap { private: typename boost::property_traits<ReadablePropertyMap>::value_type white_; const ReadablePropertyMap& pm_; public: typedef typename boost::property_traits<ReadablePropertyMap>::key_type key_type; typedef ColorValue value_type; typedef ColorValue reference; typedef boost::read_write_property_map_tag category; ColorValue get(key_type key); MapAsColorMap(const ReadablePropertyMap& pm, typename boost::property_traits<ReadablePropertyMap>::value_type white): white_(white), pm_(pm) { /* nothing */ }; }; template<typename ReadablePropertyMap> MapAsColorMap<ReadablePropertyMap, boost::default_color_type> make_map_as_colormap(const ReadablePropertyMap& pm, typename boost::property_traits<ReadablePropertyMap>::value_type white) { std::cout << "make_map_as_colormap entered" << std::endl; return MapAsColorMap<ReadablePropertyMap, boost::default_color_type>(pm, white); } template<typename ReadablePropertyMap, typename ColorValue> ColorValue MapAsColorMap<ReadablePropertyMap, ColorValue>::get(key_type key) { std::cout << "get entered" << std::endl; std::cout << key << " " << boost::get(pm_, key) << std::endl; return (boost::get(pm_, key)==white_) ? boost::color_traits<ColorValue>::white() : boost::color_traits<ColorValue>::black(); } template<typename ReadablePropertyMap, typename ColorValue> ColorValue get(MapAsColorMap<ReadablePropertyMap, ColorValue> pmap, typename boost::property_traits<ReadablePropertyMap>::key_type key) { return pmap.get(key); } template<typename ReadablePropertyMap, typename ColorValue> void put(MapAsColorMap<ReadablePropertyMap, ColorValue> pmap, typename boost::property_traits<ReadablePropertyMap>::key_type key, typename boost::property_traits<ReadablePropertyMap>::value_type value) { std::cout << "writing something to MapAsColorMap" << std::endl; /* nothing */ } #endif

3 7

local variable shadow
by Chris Saunders 21 Feb '07

21 Feb '07

I find local variable shadow warnings helpful, but when I include various boost libraries, I have to remove a lot of shadowing within the boost functions themselves. Note that I'm not refering to name conflicts with my own code. How can I submit patches to remove these type of warnings? Thanks, -Chris

3 3

[boost::program_options] got stuck with some options scenario
by Ovanes Markarian 21 Feb '07

21 Feb '07

I have some requirement for input parameters: Some of my input parameters represent a pair of files. Is there any way to parse this kind of a form: -I "file1" "file1_related_file" Trying to use the construct with: po::value< std::pair<std::string,std::string> >() produces a compilation error within a lexical cast, that there is no operator >> defined. I know I could pass smth like: -I "fiel1+related_file", but then I would need to split the string, what I would like to do, since I see this as a task of program_options lib. With Kind Regards, Ovanes Markarian

1 0

question about pool::get_next_size/set_next_size
by Stefan Felkel 21 Feb '07

21 Feb '07

Hi, is there a way to access pool::get_next_size, pool::set_next_size from my own fast_pool_allocator without modifying the boost source (1.33.1). This my_fast_pool_allocator is a copy of fast_pool_allocator that tries to allocate the requested memory with next_size divided by 2 if malloc returns NULL. I added static member functions get_next_size/set_next_size to singleton_pool which works, but is there a way without modifying the boost source. If not, would it make sense to add these two methods in a future boost release. This is the allocate method of my_fast_pool_alloctor: template <typename T, typename UserAllocator, typename Mutex, unsigned NextSize> class my_fast_pool_allocator { ... static pointer allocate(const size_type n) { typedef boost::singleton_pool<boost::fast_pool_allocator_tag, sizeof(T), UserAllocator, Mutex, NextSize> mypool; pointer ret = NULL; for( ; !ret; ) { if (n == 1 ) { ret = static_cast<pointer>( mypool::malloc() ); } else { ret = static_cast<pointer>( mypool::ordered_malloc(n) ); } size_t nsize = mypool::get_next_size(); if( !ret ) // not enough memory available { if( nsize <= n ) // even less than we really need break; nsize >>= 1; // request half the size nsize = std::max( nsize, n ); // at least as much as we really need } mypool::set_next_size(nsize); } if (ret == 0) throw std::bad_alloc(); return ret; } ... }; Regards, Stefan

1 0

question about boost::interval
by Marco Correia 21 Feb '07

21 Feb '07

Hi, I'm a little bit confused about the documentation in http://www.boost.org/libs/numeric/interval/doc/rounding.htm, in the subsection "Transcendental functions". Does the "Please note" paragraph means that the provided classes for transcendal functions (_opp and _std) do not guarantee the inclusion property? From what I understood it says that it depends on the implementation of the std::* math functions, that, in most cases, don't obey current rounding mode. Am I getting this right? In case I am, does anyone knows if I'm safe with gcc std library (perhaps by using the -frounding-math switch)? Thanks! Marco -- Marco Correia <mvc(a)di.fct.unl.pt>

2 2

missing files?
by Jan Van den bosch 21 Feb '07

21 Feb '07

Hi, I'm trying to build the examples of the Channel event framework ( channel.sourceforge.net) Apparently, the Boost archives at sourceforge (.zip, .tar.gz and .tar.bz2 files) are missing several necessary files, like serialization/array.hpp. When I do a CVS checkout of Boost however, those files are included. Are they still part of Boost? Thanks in advance, Jan

1 0

split_iterator<string::iterator> example
by Meryl Silverburgh 21 Feb '07

21 Feb '07

hi, Can someone please tell me where I can find example of split_iterator<string::iterator> If I have 2 split_iterator<string::iterator>s, how can I compare the 2 strings that the split_iterator pointing to? Thank you.

2 13

[Boost][bind] problem using bind with non-copyable class members?
by Darren Garvey 21 Feb '07

21 Feb '07

Hi, I'm trying to use bood::bind and I'm having a problem with compilation when I'm passing an object that holds a std::stringstream. The errors are to do with std::ios_base and std::streambuf's copy constructors being private, but as far as I knew (and understand from the docs), boost::bind passes by reference, so nothing should be copied. I'm sure I'm missing something fundamental here, so any enlightening would be very welcome. My setup is gcc 4.1.2 on Ubuntu 6.10. Here's an example program that fails: #include <sstream> > #include <boost/bind.hpp> > #include <boost/thread.hpp> > > using namespace boost; // sorry > using namespace std; // oops > > > struct holder > { > std::ostringstream oss; > }; > > void sub_main( holder& h ) > { > return; > } > > class event_handler > { > public: > void operator() ( holder& h ) > { > thread t( bind( &sub_main, h ) ); > t.join(); > } > }; > > int main( int, char** ) > { > event_handler e_h; > holder h; > > e_h(h); > > return 0; > } Regards, Darren

2 2

[signals] building sandbox documentation?
by Frank Mori Hess 20 Feb '07

20 Feb '07

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Timmo, Do you know a bjam command to build the signals documentation in boost-sandbox/libs/signals/doc ? I'd like to update them to reflect the changes we've made for thread safety. Do I have to copy the files over to a real boost source tree to get them to build? I am not very familiar with bjam. - -- Frank -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.1 (GNU/Linux) iD8DBQFF2xd85vihyNWuA4URAkBBAJ43BFzalbQSbzMaKNWuaEPR3tEpUQCdE67i 7ozVU/0NcLWKVW8gNv4KR5E= =WB61 -----END PGP SIGNATURE-----

2 2

Re: [Boost-users] Cannot build boost on MSVS8 per instructions
by DAVID CRAVEY 20 Feb '07

20 Feb '07

Hi All, I am having the same errors as in this post: http://lists.boost.org/boost-users/2006/09/22001.php I have tried downloading the boost-jam both binary: boost-jam-3.1.13-1-ntx86.zip (I get the same error as the above post) And from source: boost-jam-3.1.13.zip I get a "Debug Assertion Failed!" error when I run build.bat Program: C:\Boost\boost-jam-3.1.13\bootstrap\jam0.exe File: dtoxtm64.c Line: 67 Expression: ( ( ( long )( yr - 1990) >= BASE_YEAR) && ( ( long )( yr - 1990 ) <= _MAX_YEAR64 ) ) Running the prebuilt bjam.exe file in the Threads build directory (running from Visual Studio 2005 Command Prompt): C:\Boost\boost_1_33_1\libs\thread\build>bjam "-sTOOLS=vc-8_0" Built three library files. So I think the bjam.exe file probably is not corrupt. If I run (from Visual Studio 2005 Command Prompt): C:\Boost\boost_1_33_1>bjam "-sTOOLS=vc-8_0 --with-threads" I get the same 00012f2a error as before. Other Notes: I have Visual C++ 2003 Standard and Visual Studio 2005 Pro Installed. Starting with the appropriate command prompt, I get the same error on both at Offset 0001f2fa. My machine is an Dell Latitude Centrinio Running Windows XP Pro SP2. Any help would be greatly appreciated! Thanks, David Cravey

3 2

Boost serilaization onexit problem
by gast128 20 Feb '07

20 Feb '07

Dear all, We use (too many) singletons in our program and now the program crashes in Boost Serialization because in an onexit function a static member (oserializer::instantiate) of Boost Serialization is already destroyed. Is there a way to force an intialisation of these static members so that they are destroyed after my singleton destroys? The code can be reproduced by the follwing snippet: // #define BOOST_ALL_DYN_LINK #define BOOST_LIB_DIAGNOSTIC #include <fstream> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/xml_oarchive.hpp> #include <boost/serialization/base_object.hpp> #include <boost/serialization/version.hpp> struct Foo { Foo() : m_i(0) {} template <class Archive> void serialize(Archive& ar, const unsigned int /*version*/) { ar & BOOST_SERIALIZATION_NVP(m_i); } int m_i; }; void f (); void test_serialize (); //---------------------------------------------------------------------------- // Function main //---------------------------------------------------------------------------- // Description : main //---------------------------------------------------------------------------- int main() { atexit(&f); test_serialize(); return 0; } void f() { test_serialize(); } void test_serialize() { std::ofstream ofs("test.xml"); boost::archive::xml_oarchive oa(ofs); const Foo foo; oa << BOOST_SERIALIZATION_NVP(foo); } wkr, me

2 2

[Review][Bimap] Reviewers needed for Bimap review
by Ion Gaztañaga 20 Feb '07

20 Feb '07

Hi to all, Bimap review started 5 days ago and we're having some good comments but no thorough reviews. I would like to encourage people to write a Bimap review, because we still have five more days and I would propose extending that if that's necessary. Container and STL experts, we need you! I think that Bimap is a great library and I'm pretty sure you'll be happy to review it once you start reading the docs. Start reading the documentation here: http://tinyurl.com/y95qng And download the library here: http://boost-consulting.com/vault/index.php?&directory=Containers Regards, Ion

1 0

Using Boost string library
by Meryl Silverburgh 20 Feb '07

20 Feb '07

Hi, I need to compare 2 strings in this format (a integer separator by '/': /1/1 /1/1/2 /1/1/3 so "/1/1" is less than "/1/1/2" and "/1/1/2" is less than " "/1/1/3". Is there anything in Boost string library to help me to write such a comparison? Is there a string iterator which literates base on the separator '/'? My idea is to find an iterator to loop thru the string based on separator '/'. Thanks for any idea.

3 14