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

format precision specifiers and strings
by Jason Nye 09 Aug '06

09 Aug '06

Hello all, I'm having trouble with boost format and precision specifiers with strings. The problem is that if I don't specify the 's' in the format string, a precision specifier does not truncate the string as I would expect: format("%.4s") % some_string The above will truncate some_string to the first four chars. format("%|.4s|") % some_string Same thing. However, the following does not truncate: format("%|.4|") % some_string This is … [View More]

1 0

random number generator 160 bit.
by chun ping wang 09 Aug '06

09 Aug '06

Hi, I have a question how would i use boost to generate a 160 bit random integer. Heres the random number generator i wrote thanks to some of the boost community help. #ifndef RANDOM_NUMBER_HPP #define RANDOM_NUMBER_HPP #include <boost/random/shuffle_output.hpp> #include <boost/random/mersenne_twister.hpp> #include <boost/random/uniform_int.hpp> #include <boost/random/variate_generator.hpp> #include <Windows.h> #ifdef _linux_ #include <boost/nondet_random.… [View More]hpp> #endif #include <boost/cast.hpp> // credit and thanks to Andrew Holden for help on this. namespace Random { typedef boost::kreutzer1986 base_generator_type; // typedef boost::mt19937 base_generator_type; typedef boost::uniform_int<> distribution_type; typedef boost::variate_generator<base_generator_type&, distribution_type> gen_type; // boost::random_device nondet_generator; //Declare the generator as a global variable for easy reuse #ifdef __linux__ boost::random_device dev; base_generator_type generator(dev()); #else base_generator_type generator(GetTickCount()); #endif /*************************************************** * initializes the random number generator * **************************************************/ void initialize() { for (int i = 0; i < 900; ++i) { #ifdef __linux__ generator.seed(dev()); #else generator.seed(GetTickCount()); #endif } } /*************************************************** * generates a random number between a and b * * @param a the starting range * * @param b the integer ending range * * @return N such that a <= N <= b * **************************************************/ template <class T> T randint (const T& a, const T& b) { //Check the parameters BOOST_STATIC_ASSERT(boost::is_integral<T>::value); assert (b >= a); //Set up the desired distribution gen_type ran_gen(generator, distribution_type(a, b)); //Get a random number return ran_gen(); } } #endif /* RANDOM_NUMBER_HPP */ Heres a code to generate random prime number. /*************************************************** * n <- random number with num_digits digits * * if n is even then n = n + 1; * * while is_prime(n, 150) * * { * * n = n + 2; * * } * * return n; * ***************************************************/ template <typename T> T boost::random_prime(boost::function<bool(const T&, const T&)> f, const unsigned int& num_digits) { BOOST_STATIC_ASSERT(is_integral<T>::value); T n(Random::randint<T>(numeric_cast<T>(pow(2.0, num_digits - 1)), numeric_cast<T>(pow(2.0, num_digits))) ); if (n%2 == 0) { ++n; } while (f(n, 20)) { n += 2; } return n; } now num_digits is number of bits. If i pass 160 bit as like for DSA algorithm the program crashes. I pass 8 and it works, how come? Is there a better way to do this? Oh f is any function that can deteremine if a number is most likely a prime or not.... Thanks. [View Less]

1 0

regex users question
by gast128 09 Aug '06

09 Aug '06

Dear all, I want to misuse boost regex for pattern searching. The intermediate form will then be a string, but some of its characters can have multiple values, e.g: aaa aba aac abc Thus the string can be represented as a[a,b][a,c]. Still on this multiple string representation I want the full power of regular expressions, so I still want to search for aaa, or (a|b)* etc. Is it possible to create some sort of adjusted string and overload the operator== ? I know that as alternative I can … [View More]

3 5

[program_options] strange assertions
by Ovanes Markarian 09 Aug '06

09 Aug '06

Hi! I use MS VC8.0 (2005) Express Edition. This code sample causes the following assertion: int main(int argc, char* argv[]) { options_description generic("Generic options"); generic.add_options() ("version,v", "print version string") ("help,h", "produce help message") ; // Declare a group of options that will be // allowed both on command line and in // config file options_description config("Configuration"); config.add_options() ("… [View More]worker-threads,w", po::value<int>()->default_value(20), "Each worker thread starts parsing of one file.\ndefault: 20") ; options_description cmdline_opt, cfgf_opt; cmdline_opt.add(generic).add(config); cfgf_opt.add(config); variables_map vm; store(command_line_parser(argc, argv).options(cmdline_opt).run(), vm); ifstream ifs("scanning_options.cfg"); store(parse_config_file(ifs, cfgf_opt), vm); notify(vm); if(vm.count("help")) cout << config << endl; //... some other code return 0; } In this line: cout << config << endl; I receive an assertion: Debug Assertion Failed! Program: e:\projects\...\protocol_scanner.exe File: e:\program files\microsoft visual studio 8\vc\include\xstring Line: 173 Expression: ("_Myptr + _Off <= (((_Mystring *)this->_Mycont)->_Myptr() + ((_Mystring *)this->_Mycont)->_Mysize) && _Myptr + _Off >= ((_Mystring*)this->_Mycont)->_Myptr()",0) ... line 173 is part of a function in xstring _Myt& __CLR_OR_THIS_CALL operator+=(difference_type _Off) { // increment by integer if (this->_Mycont != _IGNORE_MYCONT) { _SCL_SECURE_VALIDATE(this->_Mycont != NULL); _SCL_SECURE_VALIDATE_RANGE( _Myptr + _Off <= (((_Mystring *)this->_Mycont)->_Myptr() + ((_Mystring *)this->_Mycont)->_Mysize) && _Myptr + _Off >= ((_Mystring *)this->_Mycont)->_Myptr()); // <- line 173 } _Myptr += _Off; return (*this); } Output in stdout window looks like: Generic options: -v [ --version ] print version string -h [ --help ] produce help message Configuration: -w [ --worker-threads ] arg (=20) -------------------------^^^^^^^^^^ this looks really weired!!! Here should be another message. Last line is really weired... Stack trace is: > protocol_scanner.exe!std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char> >::operator+=(int _Off=-1) Line 171 + 0x78 bytes C++ protocol_scanner.exe!std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char> >::operator-=(int _Off=1) Line 188 C++ protocol_scanner.exe!std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char> >::operator-(int _Off=1) Line 193 + 0xc bytes C++ protocol_scanner.exe!boost::program_options::`anonymous namespace'::format_paragraph(std::basic_ostream<char,std::char_traits<char> > & os={...}, std::basic_string<char,std::char_traits<char>,std::allocator<char> > par="Each worker thread starts parsing of one file.", unsigned int first_column_width=36, unsigned int line_length=79) Line 381 + 0x28 bytes C++ protocol_scanner.exe!boost::program_options::`anonymous namespace'::format_description(std::basic_ostream<char,std::char_traits<char> > & os={...}, const std::basic_string<char,std::char_traits<char>,std::allocator<char> > & desc="Each worker thread starts parsing of one file.\ndefault: 20", unsigned int first_column_width=36, unsigned int line_length=79) Line 453 + 0x34 bytes C++ protocol_scanner.exe!boost::program_options::`anonymous namespace'::format_one(std::basic_ostream<char,std::char_traits<char> > & os={...}, const boost::program_options::option_description & opt={...}, unsigned int first_column_width=36, unsigned int line_length=80) Line 489 + 0x1a bytes C++ protocol_scanner.exe!boost::program_options::options_description::print(std::basic_ostream<char,std::char_traits<char> > & os={...}) Line 522 + 0x1e bytes C++ protocol_scanner.exe!boost::program_options::operator<<(std::basic_ostream<char,std::char_traits<char> > & os={...}, const boost::program_options::options_description & desc={...}) Line 289 C++ protocol_scanner.exe!boost::program_options::options_description::print(std::basic_ostream<char,std::char_traits<char> > & os={...}) Line 528 + 0x34 bytes C++ protocol_scanner.exe!boost::program_options::operator<<(std::basic_ostream<char,std::char_traits<char> > & os={...}, const boost::program_options::options_description & desc={...}) Line 289 C++ protocol_scanner.exe!main(int argc=2, char * * argv=0x00353980) Line 128 + 0x13 bytes C++ Parameter of executable is: --help With Kind Regards, Ovanes Markarian [View Less]

1 1

Embedded development
by Michael Marcin 09 Aug '06

09 Aug '06

I've used boost (although very lightly) on Windows Mobile 5 via Visual Studio 2005. I've heard that Brew and Symbian could not in the past support boost because they had no static writeable data. Recently however with Series 60 v3/Symbian 9.1 and Brew elf2mod writeable static data is available on these platforms. Has anyone used boost on these platforms (ie Brew/Symbian/WM5)? What parts of boost are likely to work on these platforms? What parts of boost are likely to fail on these platforms? Thanks

1 0

Re: [Boost-users] regex users question
by james.jones＠firstinvestors.com 09 Aug '06

09 Aug '06

From: Roman Neuhauser <neuhauser(a)sigpipe.cz> > If so, what are you envisioning to construct those objects with > if not regular expression literals? You'll end up using > regex_match() in operator==() anyway, so again, what's the question > exactly? I suggest that the fundamental problem to be solved here is: given regular expressions X and Y, can some string matching X completely be a substring match for Y? In general, this sounds hard. Can we do better than … [View More]

1 0

boost on windows mobile
by hli＠cs.ucr.edu 09 Aug '06

09 Aug '06

Hi, I am a newbie of boost library. I use boost thread in a visual studio 2005 project for both PC and windows mobile 5.0. The applictication runs well on PC with boost library. But I have no idea on how to build boost library for windows mobile. Is there anyboday know that? Any suggestions are wecolme. Thanks in advance! Best regards, Haifeng

2 1

Question about boost::bind2nd
by Jan Ohlenburg 09 Aug '06

09 Aug '06

Hi everybody, I would like to bind a member function within the template function using the template argument. Please have a look at the following code: template<typename T> void Object::setField(FieldId fieldId, const T& fieldData) { // call for_each with setFieldImpl ... shadowCopies->for_each ( boost::bind2nd( boost::mem_fun(&Object::setFieldImpl<T>), fieldId, fieldData))); } template<typename T> void Object::setFieldImpl(FieldId fieldId, const T& … [View More]

2 2

Memory leak using boost::regex_replace in Visual Studio
by Mary Huther 09 Aug '06

09 Aug '06

Hi...I need help bad. I just started using boost and it seemed very useful for doing regular expressions. I do have a problem and that is I have tons of memory leaks and I am not sure how or if it can be fixed. I have isolated the leak to the following section of code: for(iter = mapData.begin(); iter != mapData.end(); iter++) { // MH: Leak here const wchar_t * expressionText = (wchar_t *)(*iter).first.c_str(); const wchar_t * formatText = (wchar_t *)(*iter).second.c_str(); boost::… [View More]

2 1

Re: [Boost-users] [Serialization] Problem serializingviabaseclassptr
by Guy Létourneau 09 Aug '06

09 Aug '06

Hello Robert, Sorry for not giving you feedback earlier, I was on vacation. I've included your proposed changes in my test application but I still get the same compile error: 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 = const A*]': C:/Boost/include/boost-1_33_1/boost/archive/basic_text_oarchive.hpp:78: instantiated from `void boost::archive::… [View More]basic_text_oarchive<Archive>::save_override(T&, int) [with T = const 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 = const A*, Archive = boost::archive::text_oarchive]' ../main.cpp:101: 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' make: *** [main.o] Error 1 Could you tell me what I'm missing? Thanks again for your help, Guy Letourneau Test application: #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; friend class boost::serialization::access; template <class Archive> void serialize( Archive& ar, const unsigned int version ) { std::cout << "Serialization of A" << std::endl; std::cout.flush(); } }; 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 const A* Parent = Child; // Parent is now const // 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; // Ptr dereferencing is performed by the library } 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; } -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Robert Ramey Sent: Saturday, July 22, 2006 6:43 PM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] [Serialization] Problem serializingviabaseclassptr Three show stopping problems in this code: a) A doesn't have serialize method even though such a method is invoked by base object. see: http://www.boost.org/libs/serialization/doc/serialization.html b) saving a non-const object - see rationale section c) Main show stopper: > 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 > // const A* Parent = Child; // ****** note new const - see rationale > > // 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 // *** big problem here. Dereferecing pointer to A yields a ref // *** to an A - regardless that ptr was a B. What you really want is: oa << Parent; // *** let serialization handle dererencing // *** instead of: > //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; > } > _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users [View Less]

4 4

[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 … [View More]

6 33

back_inserter and pointer container library
by gast128 08 Aug '06

08 Aug '06

Dear all, it seems that the pointer container library does not interfere well with back_inserter, i.e. boost::ptr_vector<int> v2; std::back_insert_iterator< boost::ptr_vector<int> > b(v2); b.operator=(new int); //forget it This is unfortunate, because now a lot of STL (or our own adapters) containers can't be used (e.g. std::transform, std::generate_n) Wkr, me

2 3

Re: [Boost-users] Ownership of Boost IP?
by Nat Goodspeed 08 Aug '06

08 Aug '06

________________________________________ From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Gottlob Frege Sent: Tuesday, August 08, 2006 3:20 PM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] Ownership of Boost IP? > The reasoning appears to be that some party might claim that an > individual developer, perhaps unknowingly, submitted code that > rightfully belongs to his employer. the employer would then sue > anyone … [View More]

1 0

[asio][iostream] trying to implement nntp-client
by Sascha Seewald 08 Aug '06

08 Aug '06

Hi Boosters, I´m playing around with the great boost::asio library but have problems using the boost::asio::ip::tcp::iostream. I try to implement a very simple nntp-client: <code> void connect_and_retrieve_list_of_newsgroups() { std::string line; // connect to server boost::asio::ip::tcp::iostream s("news.gmane.org", "nntp"); if (!s) return; // read connection ack std::getline(s, line); // log std::cout << line; // check return code here. we … [View More]

2 2

Re: [Boost-users] [array] VC++ 7.1 bug and a proposed fix
by Todd Greer 08 Aug '06

08 Aug '06

Johan Råde wrote: > We aren't actually testing static array initialization, are we? How do we > know that it works at all? :-) I can think of two tests that might be useful. I haven't had a chance to try either one yet. After adding in the appropriate #includes and namespace qualification, and following whatever the standard Boost test construction guidelines are, do these look like they would do the job? 1. Test that it is POD: struct x {}; BOOST_STATIC_ASSERT(!is_pod<x>::… [View More]

1 0

Ownership of Boost IP?
by Nat Goodspeed 08 Aug '06

08 Aug '06

My employer's legal department has just stated that we may not use Boost for product development because of a hypothetical lawsuit risk. The reasoning appears to be that some party might rise up and claim that parts of one or more Boost libraries actually belong to it: that an individual developer, perhaps unknowingly, submitted code that was not his to give away because it rightfully belongs to his employer. In this horrid fantasy, the employer would then sue many parties, including anyone who … [View More]

5 5

Re: [Boost-users] [Boost][multi_index] proper way to make a complex query
by JOAQUIN LOPEZ MU?Z 08 Aug '06

08 Aug '06

Sebastien Fortier ha escrito: > I will try to make this as simple as possible, > I have the following struct > > struct meteo_record { > public: > [...ctor...] > [...getters and setters...] > private: > string var_name; > string grid_type; > float ip1; > float ip2; > float ip3; > float ig1; > float ig2; > float ig3; > int ip1Kind; > int … [View More]data_key; > }; > > All these attributes are non-unique except for the data_key > which is not a sorting criteria. > > What I need to do is to be able to iterate over the whole > set by certain criteria. [...] > my criterias are > sort by same gryd_type group by var_name with same ip2 and > same ip1kind ordered on ip1 [...] Hello Sebastien, I'm not sure I've fully understood all the details of your problem, but seems to me that composite keys ( http://tinyurl.com/hdf3q ) might be of help here. A composite key accepts several attributes and presents the records sorted in lexicographical order with respect to them. In your particular case, suppose you've got an index (non-unique) whose key is composite_key< meteo_record, const_mem_fun<meteo_record,const string&,&meteo_record::get_grid_type>, const_mem_fun<meteo_record,const string&,&meteo_record::get_var_name>, const_mem_fun<meteo_record,float,&meteo_record::get_ip2>, const_mem_fun<meteo_record,int,&meteo_record::get_ip1Kind>, const_mem_fun<meteo_record,float,&meteo_record::get_ip1> > (where I've used some imaginary names for the attribute getters). This index sorts records lexicographically by grid_type,var_name,ip2,ip1Kind,ip1 which looks like what you're after, from what I understand about the description of your current query process. The different groups can be then traversed like follows (for simplicity I assume the composite key is used in index #0, you'll probably want to have it in an additional index): for(recordIter=set.begin();recordIter!=set.end();) { recordIter2=set.upper_range( boost::make_tuple( it->get_grid_type(), it->get_var_name(), it->get_ip2(), it->get_ipKind(), ) ); // [recorditer1,recorditer2) is a range of elements with equal // grid_type,var_name,ip2 and ipKind, sorted by ip1 process(recordIter1,recordIter2); recordIter1=recordIter2; } Is this what you were looking for? Thank you for using Boost.MultiIndex, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo [View Less]

2 1

[mpl] - erro if mpl::map ist included
by Oliver.Kowalke＠qimonda.com 08 Aug '06

08 Aug '06

Hello, if I only include (no instantiation) the header <boost/mpl/map.hpp> I get the following error: /opt/boost/include/boost-1_33_1/boost/mpl/map/aux_/iterator.hpp:45: error: template argument 1 is invalid /opt/boost/include/boost-1_33_1/boost/mpl/map/aux_/iterator.hpp:45: error: template argument 1 is invalid /opt/boost/include/boost-1_33_1/boost/mpl/map/aux_/iterator.hpp:48: error: expected `{' before '>' token /opt/boost/include/boost-1_33_1/boost/mpl/map/aux_/iterator.hpp:48: … [View More]

2 1

Re: [Boost-users] [Serialization] Problem serializingviabaseclassptr
by Guy Létourneau 08 Aug '06

08 Aug '06

Hello Robert, Just to let you know that everything works fine now. Thanks for your help, Guy -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Robert Ramey Sent: Monday, August 07, 2006 1:18 PM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] [Serialization] Problem serializingviabaseclassptr Guy Létourneau wrote: > Hello Robert, > > Sorry for not giving you feedback earlier, I was on … [View More]vacation. I've > included your proposed changes in my test application but I still get > the same compile error: > > 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 = const 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 = const 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 = const A*, Archive = boost::archive::text_oarchive]' > ../main.cpp:101: 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' > make: *** [main.o] Error 1 > > Could you tell me what I'm missing? > > Thanks again for your help, > > Guy Letourneau > > > Test application: > > #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; > > friend > class boost::serialization::access; > > template <class Archive> > void serialize( Archive& ar, const unsigned int version ) > { > std::cout << "Serialization of A" << std::endl; > std::cout.flush(); > } > }; > 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 **** // > const A* Parent = Child; // Parent is now const // nope- Parent is not const - it points to a const A - not the same thing !!! // try const A * const Parent = Child; // const pointer to a const A // also the following will work - I believe A * const 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; // Ptr dereferencing is performed by the > library } > 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; > } > > -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Robert > Ramey > Sent: Saturday, July 22, 2006 6:43 PM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] [Serialization] Problem > serializingviabaseclassptr > > Three show stopping problems in this code: > > a) A doesn't have serialize method even though > such a method is invoked by base object. see: > http://www.boost.org/libs/serialization/doc/serialization.html > > b) saving a non-const object - see rationale section > > c) Main show stopper: > >> 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 >> // const A* Parent = Child; // ****** note new const - see >> rationale >> >> // 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 > // *** big problem here. Dereferecing pointer to A > yields a > ref > // *** to an A - regardless that ptr was a B. What you > really want is: > oa << Parent; // *** let serialization handle > dererencing // *** instead of: >> //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; >> } >> > > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users [View Less]

1 0

Re: [Boost-users] Ownership of Boost IP?
by Sohail Somani 08 Aug '06

08 Aug '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Nat > Goodspeed > Sent: Tuesday, August 08, 2006 7:36 AM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Ownership of Boost IP? > > Well, I've talked this over with my boss, and he's at least willing to > go to bat for this. Many thanks for all your helpful suggestions! Looks like you got a good one then :)

1 0

Re: [Boost-users] Ownership of Boost IP?
by Nat Goodspeed 08 Aug '06

08 Aug '06

Well, I've talked this over with my boss, and he's at least willing to go to bat for this. Many thanks for all your helpful suggestions!

1 0

[Boost][multi_index] proper way to make a complex query
by Sebastien Fortier 08 Aug '06

08 Aug '06

I will try to make this as simple as possible, I have the following struct struct meteo_record { public: [...ctor...] [...getters and setters...] private: string var_name; string grid_type; float ip1; float ip2; float ip3; float ig1; float ig2; float ig3; int ip1Kind; int data_key; }; All these attributes are non-unique except for the data_key which is not a sorting criteria. What I need to do … [View More]is to be able to iterate over the whole set by certain criteria. lets say I have the following records [var_name grid_type ip1 ip2 ip3 ig1 ig2 ig3 ip1kind] >> 12345 12 34 5 0 0 0 1 ^^ 12345 12 34 5 0 0 0 1 GZ 12345 645 24 1 12 34 5 1 GZ 12345 646 24 1 12 34 5 1 GZ 12345 647 24 1 12 34 5 1 GZ 12345 645 24 1 12 34 5 2 GZ 12345 646 24 1 12 34 5 2 GZ 12345 647 24 1 12 34 5 2 GZ 12345 645 26 1 12 34 5 1 GZ 12345 646 26 1 12 34 5 1 GZ 12345 647 26 1 12 34 5 1 GZ 12345 645 26 1 12 34 5 2 GZ 12345 646 26 1 12 34 5 2 GZ 12345 647 26 1 12 34 5 2 TT 12345 645 24 1 12 34 5 1 TT 12345 646 24 1 12 34 5 1 TT 12345 647 24 1 12 34 5 1 TT 12345 645 24 1 12 34 5 2 TT 12345 646 24 1 12 34 5 2 TT 12345 647 24 1 12 34 5 2 TT 12345 645 26 1 12 34 5 1 TT 12345 646 26 1 12 34 5 1 TT 12345 647 26 1 12 34 5 1 TT 12345 645 26 1 12 34 5 2 TT 12345 646 26 1 12 34 5 2 TT 12345 647 26 1 12 34 5 2 [...same sequence again with different grid_type...] >> 33345 33 34 5 0 0 0 1 ^^ 33345 33 34 5 0 0 0 1 TT 33345 647 26 1 33 34 5 2 [...] the grid_type is derived from ip1 ip2 and ip3 in some cases and from ig1 ig2 and ig3 in some other cases my criterias are *sort by same _gryd_type_ group by _var_name_ with same _ip2_ and same _ip1kind_ ordered on _ip1_* What I have done is create a multi_index with the grid_type as an index and then I created views for all the other attributes. I first iterate over the grid_types and keep the unique ones in an array (only the keys) /// probably the wrong way to do this in this case I would keep 12345 and 33345 /// for (recordIter = set.begin(); recordIter != set.end(); recordIter = set.upper_bound( (*recordIter)->getgrid_type() ) ) /// /// returns only one of each duplicate grid_type /// for each grid_type I then create the var_name view and iterate over the unique var_names and so on and so on... until i get a grouping that looks like this [var_name grid_type ip1 ip2 ip3 ig1 ig2 ig3 ip1kind] GZ 12345 645 24 1 12 34 5 1 GZ 12345 646 24 1 12 34 5 1 GZ 12345 647 24 1 12 34 5 1 Once I get a grouping like this one, I extract the data_key for each record and read the data from a file. Then I construct a matrix for this grouping from the corresponding data that was read. There must be a better way of doing this, any help will be greatly appreciated! -- Sébastien Fortier [View Less]

1 0

[threads] extension proposal
by Ovanes Markarian 08 Aug '06

08 Aug '06

Hello, I would like to ask if it makes sence to introduce a data structure in boost::threads library, which implements a threads pool. Sometimes a system design can look like: Create a maximum of N threads and execute these threads with different tasks. If there more than N threads running then the threads_pool::get_thread(...) operation should block until one of threads gets ready. It is also possible to implement threads_pool::get_thread to use a policy which can block if the N is reached … [View More]

5 6

[Asio]How to compile the HelloWorld ?
by SP Z 08 Aug '06

08 Aug '06

Maybe this is a stupid problem , but I really don't konw how to find the right way. My compile environment is WinXP, Msys , MinGw , G++ 3.4.2, Boost 1.33.1, asio_0_3_7, bjam 3.1.13. I have already copy the header files of boost and asio into mingw/include I write the helloWorld.cpp follow the tutorial. #include <iostream> #include <boost/asio.hpp> #include <boost/date_time/posix_time/posix_time.hpp> int main() { boost::asio::io_service io; boost::asio::deadline_timer t(… [View More]io, boost::posix_time::seconds(5)); t.wait(); std::cout << "Hello, world!\n"; return 0; } I write Jamroot as follow: exe hello : hello.cpp ; then I compile it in Msys, but link wrong happened(wrong messages see the end of this Email). Would you please help me to solve this problem . Thank you for(;;){} //forever $ bjam ...found 11 targets... ...updating 5 targets... MkDir1 bin MkDir1 bin\gcc MkDir1 bin\gcc\debug gcc.compile.c++ bin\gcc\debug\hello.o In file included from e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/detail/win_local_free_on_block_exit.hpp:27, from e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/system_exception.hpp:33, from e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/detail/win_mutex.hpp:26, from e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/detail/mutex.hpp:27, from e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/detail/service_registry.hpp:25, from e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/io_service.hpp:32, from e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/basic_io_object.hpp:20, from e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/basic_socket.hpp:20, from e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/basic_datagram_socket.hpp:25, from e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio.hpp:18, from hello.cpp:11: e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/detail/socket_types.hpp:31:5: warning: #warning Please define _WIN32_WINNT or _WIN32_WINDOWS appropriately e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/detail/socket_types.hpp:32:5: warning: #warning Assuming _WIN32_WINNT=0x0500 (i.e. Windows 2000 target) hello.cpp:24:2: warning: no newline at end of file gcc.link bin\gcc\debug\hello.exe bin\gcc\debug\hello.o: In function `ZN5boost4asio6detail31reactive_deadline_timer_serviceINS0_11time_traitsINS_10posix_time5ptimeEEENS1_14select_reactorILb1EEEE16shutdown_serviceEv':e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail12winsock_initILi2ELi0EE7do_initC1Ev[boost::asio::detail::winsock_init<2, 0>::do_init::do_init()]+0x1f): undefined reference to `WSAStartup@8' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail10socket_ops6selectEiP6fd_setS4_S4_P7timeval[boost::asio::detail::socket_ops::select(int, fd_set*, fd_set*, fd_set*, timeval*)]+0xc9): undefined reference to `select@20' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail10socket_ops13error_wrapperIiEET_S4_[int boost::asio::detail::socket_ops::error_wrapper<int>(int)]+0x8): undefined reference to `WSAGetLastError@0' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail10socket_ops9set_errorEi[boost::asio::detail::socket_ops::set_error(int)]+0x17): undefined reference to `WSASetLastError@4' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail12winsock_initILi2ELi0EE7do_initD1Ev[boost::asio::detail::winsock_init<2, 0>::do_init::~do_init()]+0x7): undefined reference to `WSACleanup@0' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail10socket_ops5closeEj[boost::asio::detail::socket_ops::close(unsigned int)]+0x19): undefined reference to `closesocket@4' bin\gcc\debug\hello.o: In function `main':e:/job/word-online/source/cpp/hello.cpp:15: undefined reference to `inet_addr@4' :e:/job/word-online/source/cpp/hello.cpp:23: undefined reference to `getsockname@12' bin\gcc\debug\hello.o: In function `ZN5boost4asio6detail31reactive_deadline_timer_serviceINS0_11time_traitsINS_10posix_time5ptimeEEENS1_14select_reactorILb1EEEE16shutdown_serviceEv':e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../.. o `closesocket@4' bin\gcc\debug\hello.o: In function `main':e:/job/word-online/source/cpp/hello.cpp:15: undefined reference to `inet_addr@4' :e:/job/word-online/source/cpp/hello.cpp:23: undefined reference to `getsockname@12' bin\gcc\debug\hello.o: In function `ZN5boost4asio6detail31reactive_deadline_timer_serviceINS0_11time_traitsINS_10posix_time5ptimeEEENS1_14select_reactorILb1EEEE16shutdown_serviceEv':e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail10socket_ops5ioctlEjlPm[boost::asio::detail::socket_ops::ioctl(unsigned int, long, unsigned long*)]+0x27): undefined reference to `ioctlsocket@12' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail10socket_ops6acceptEjP8sockaddrPi[boost::asio::detail::socket_ops::accept(unsigned int, sockaddr*, int*)]+0x27): undefined reference to `accept@12' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail10socket_ops13error_wrapperIjEET_S4_[unsigned int boost::asio::detail::socket_ops::error_wrapper<unsigned int>(unsigned int)]+0x8): undefined reference to `WSAGetLastError@0' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail10socket_ops7connectEjPK8sockaddri[boost::asio::detail::socket_ops::connect(unsigned int, sockaddr const*, int)]+0x27): undefined reference to `connect@12' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail10socket_ops6listenEji[boost::asio::detail::socket_ops::listen(unsigned int, int)]+0x20): undefined reference to `listen@8' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail10socket_ops4bindEjPK8sockaddri[boost::asio::detail::socket_ops::bind(unsigned int, sockaddr const*, int)]+0x27): undefined reference to `bind@12' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail10socket_ops10setsockoptEjiiPKvj[boost::asio::detail::socket_ops::setsockopt(unsigned int, int, int, void const*, unsigned int)]+0x35): undefined reference to `setsockopt@20' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail10socket_ops9get_errorEv[boost::asio::detail::socket_ops::get_error()]+0x7): undefined reference to `WSAGetLastError@0' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail10socket_ops6socketEiii[boost::asio::detail::socket_ops::socket(int, int, int)]+0x3f): undefined reference to `WSASocketA@24' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail10socket_ops4recvEjP7_WSABUFji[boost::asio::detail::socket_ops::recv(unsigned int, _WSABUF*, unsigned int, int)]+0x58): undefined reference to `WSARecv@28' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZNK5boost4asio6detail14fd_set_adapter6is_setEj[boost::asio::detail::fd_set_adapter::is_set(unsigned int) const]+0x14): undefined reference to `__WSAFDIsSet@8' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail10socket_ops4sendEjPK7_WSABUFji[boost::asio::detail::socket_ops::send(unsigned int, _WSABUF const*, unsigned int, int)]+0x58): undefined reference to `WSASend@28' collect2: ld returned 1 exit status "g++" -o "bin\gcc\debug\hello.exe" -Wl,--start-group "bin\gcc\debug\hello.o" -Wl,--end-group -g ...failed gcc.link bin\gcc\debug\hello.exe... ...failed updating 1 target... ...updated 4 targets... -- I'm Earth-Man. 我是地球人. --zsp(张沈鹏) [View Less]

1 0

[Serialization] Non-standard extensions used.
by Stephen Hewitt 08 Aug '06

08 Aug '06

The following is a dead simple example of using Boost.Serialization using an XML output archive which follows the patterns laid down in examples: /* \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ */ #include <iostream> #include <boost/archive/xml_oarchive.hpp> #include <boost/serialization/nvp.hpp> // Warning level 4. #pragma warning(push, 4) #pragma message("********") struct MyData { MyData(int … [View More]val) : m_Value(val) {} template<typename Archive> void serialize(Archive & ar, const unsigned int) { ar & BOOST_SERIALIZATION_NVP(m_Value); // <-- Warning here. } int m_Value; }; void main() { using namespace std; MyData d(3); boost::archive::xml_oarchive oa(cout); oa << BOOST_SERIALIZATION_NVP(d); <-- Warning here. } // Warning level back to normal. #pragma warning(pop) /* \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ */ When compiling this code I get the following error: "warning C4239: nonstandard extension used : 'argument' : conversion from 'struct boost::serialization::nvp<struct MyData>' to 'struct boost::serialization::nvp<struct MyData> &' A reference that is not to 'const' cannot be bound to a non-lvalue" I tried MSVC 6 and "Visual C++ 2005" which can be downloaded from here: http://msdn.microsoft.com/vstudio/express/visualC/default.aspx Interestingly I could not get it to happen with "Microsoft Visual C++ Toolkit 2003". The warning seems valid to me. The "BOOST_SERIALIZATION_NVP" looks like this: -------------------------------------------------------------------------------------------------------------------------- #define BOOST_SERIALIZATION_NVP(name) \ boost::serialization::make_nvp(BOOST_PP_STRINGIZE(name), name) -------------------------------------------------------------------------------------------------------------------------- The "make_nvp" function looks like as follows: ------------------------------------------------------- nvp<T> make_nvp(const char * name, T & t){ return nvp<T>(name, t); } ------------------------------------------------------- "Operator<<", which is used in "main" is reproduced below: -------------------------------------------------------------------------------------- template<class Archive> class interface_oarchive { // ... Code removed ... // template<class T> Archive & operator<<(T & t){ this->This()->save_override(t, 0); return * this->This(); } // ... Code removed ... // }; -------------------------------------------------------------------------------------- So, to cut to the chase, "BOOST_SERIALIZATION_NVP" expands to a call to make_nvp" which returns a temporary which is bound to a non-const reference in "interface_oarchive::operator<<": this is not legal in standard C++ (unless I'm mistaken). It seems that if you follow to documentation and examples the resulting code isn't standard C++!?! [View Less]

2 2

[bgl] problem with topological_sort
by Renaud Lepere 08 Aug '06

08 Aug '06

I would like to use a graph and add/remove vertices frequently so i try to use a list for the vertices. At the begining, i would like to sort my vertices using dfs or topological_sort. But my program refuses to compile, apparently there is a problem with a property map for the colors. (c:/Boost/include/boost-1_33_1/boost/property_map.hpp:319: instantiated from `void boost::put....'). How can i make a dfs with such a graph ? Are there special requirements for using dfs or topologic_sort … [View More]

1 0

Re: [Boost-users] [threads] extension proposal
by Oliver.Kowalke＠qimonda.com 08 Aug '06

08 Aug '06

> looks like what I need ;) The only question is, what does > stop() function of a defer_point? defer_pool::stop deactivates the threaded queue. All threads are awakened. > Will it stop all tasks > immediately or will it wait until the task queue is empty and > stop it then? It waits until all tasks were removed and processed from the queue. > Are there some plans to integrate this into the official > boost release? not yet > It would be nice to provide … [View More]

2 1

Re: [Boost-users] [threads] extension proposal
by Oliver.Kowalke＠qimonda.com 08 Aug '06

08 Aug '06

Hello Ovanes, please look into the boost vault (Concurrent Programming). I think the defer library fits your needs. The thread pool pre-spawns N threads which operate on a special queue (inside of the pool). If no task (boost::function objects) is queued all threads are set to sleep - if a task arives the queue one thread is awakened and fetches the task item from the queue and executes it (after that the thread goes to sleep again). The library was originally developed by Simon Meiklejohn. I'… [View More]

2 1

[program_options] Issues with boost::program_options freezing
by Zachary Mark 07 Aug '06

07 Aug '06

Hello, Our application is using boost::program_options to parse commandline arguments. We have found that when we perform our own builds of boost from source code, program_options freezes the application hard at variable points in the code (a step through in GDB confirms this). However, when we use pre-built binaries of the program_options library for any of our target OSes (Debian stable, Centos 4, Fedora 4) the application runs properly. We are also using the boost::thread library. … [View More]

2 2

Need help in serialization
by Anil Krishna 07 Aug '06

07 Aug '06

Hi All, Currently I am using the boost serialization library to serialize and the following structure: typedef list<int> testList; typedef testList::iterator lIter; typedef map<int, testList> testMap; typedef testMap::iterator tIter; testMap _tMap; template<class Archive> void serialize(Archive &ar, const unsigned int version) { ar & _tMap; } int main() { test_map tm; ofstream ofs("map_details.txt"); tm.fillMap(); //tm.display(); boost::… [View More]

2 2

Re: [Boost-users] Need help in serialization
by Todd Greer 07 Aug '06

07 Aug '06

Anil Krishna wrote: > In the above code, I am saving the map to a binary file and retrieving it > from the file. Instead of that I would want to serialize the data into a > char buffer and restore it from the buffer. Serialize into a std::ostringstream, ship its buffer to the other receiver, construct a std::istringstream from the received buffer, then deserialize from the istringstream you just constructed. Read up on std::istringstream and std::ostringstream (in <sstream>) … [View More]

2 1

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 … [View More]

4 7

[Filesystem] Drive letter in argument for boost::filesystem::path
by Maarten Nieber 07 Aug '06

07 Aug '06

Dear boost users, can anybody explain how to pass a filename containing a (windows) drive letter into a boost::filesystem::path? For instance, if the path should point to c:\test.txt (on a Windows system), what is the portable filename that I should pass to the boost::filesystem::path constructor? Thanks in advance! Maarten __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 2

Portability of boost libs for "universal linux binary?"
by Zachary Mark 07 Aug '06

07 Aug '06

Details: I work on a project where one of the eventual goals is to have one binary for a given architecture that runs on multiple Linux distributions. This goal is currently accomplished by both Sun's Java VM as well as the cmake project ( http://www.cmake.org/HTML/Index.html ). We are in the process of evaluating how this goal is impacted by third party dependencies. We currently use the following boost libs: thread, program_options, regex, date_time, and filesystem. I strongly … [View More]

2 2

zlib memory leaks [RC_1_34_0]
by Thomas Pintaric 06 Aug '06

06 Aug '06

I noticed that /boost/boost/iostreams/filter/zlib.hpp (Revision 1.25.2.1) from the RC_1_33_0 branch, for which the zlib memory leaks were fixed, still needs to be merged with the MAIN branch.

1 0

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

[boost.python] void pointer argument problem
by michael_gruner＠arcor.de 06 Aug '06

06 Aug '06

Hello, I'm trying to use boost.python to wrap a C function that takes a pointer on a void pointer as an argument. But I'm going wrong to use the example from the FAQ. Could anyone help me on this? my code looks like this: struct void_; BOOST_PYTHON_OPAQUE_SPECIALIZED_TYPE_ID(void_); int myfunc(char * mychar, void ** mypointer); int myfunc_wrp(char * mychar, void_ ** mypointer){ return myfunc(mychar,(void ** ) mypointer); } ... BOOST_PYTHON_MODULE(mymodule){ def("myfunc", &… [View More]

2 2

using filesystem library
by Fred J. 06 Aug '06

06 Aug '06

hi this is given me some error I cannot locate a fix. thanks **************** code **************** #include <iostream> #include <string> #include "boost/filesystem/operations.hpp" // includes boost/filesystem/path.hpp #include "boost/filesystem/fstream.hpp" namespace fs = boost::filesystem; using namespace std; int main(){ fs::path full_path("../data"); if (exists(full_path)) cout << "yes" << endl; } //there exists data directory in the parent of … [View More]

2 1

[regex] compile issue
by Thomas Matelich 06 Aug '06

06 Aug '06

Finally got around to upgrading to 1.33.1 on HP 11i, g++ 4.1.1. in v4/regex_traits_defaults.hpp, the compiler was not happy with the WCHAR_MIN == 0 and WCHAR_MAX <= USHRT_MAX checks. This appears to be due to their definition: #define WCHAR_MIN (wchar_t)0 #define WCHAR_MAX (wchar_t)UINT_MAX I tried a few things I could think of, but ended up undef'ing and redefining them without the (wchar_t). Tom Matelich

2 3

Re: [Boost-users] Boost.Signals example/doc_view application question
by Wu Yinghui, Freddie 05 Aug '06

05 Aug '06

[snip] > The View abstract base class requires concrete bases to provide a > concrete implementation of the refresh() member function matching the > slot signature required. > > class View > { > public: > virtual void refresh(bool) const = 0; > // ... > }; > > Here's my problem. If I change the signal to take no args using the > preferred or portable syntax I get compilation errors: > > class Document > { > public: > typedef … [View More]

2 1

Testing Program Output
by Paulo J. Matos 05 Aug '06

05 Aug '06

Hi all, Is there support in Boost for testing program output, which depends exclusively in its arguments? Briefly, my program is not-interactive and its result (to stdout) depends uniquely on its input argument. Is there anything in Boost that can help me test my program this way? I've been using the Unit Testing Framework for unit tests and for the tests I've mentioned I've only found dejagnu up until now. Another solution would be bash-scripts that would run the program and check output, … [View More]

2 2

[BGL] connected components algorithm
by Alejandro Aragon 05 Aug '06

05 Aug '06

Hello everyone. I'm trying to implement Fleury's algorithm to find an Eulerian path in a graph. Every time I erase an edge in the graph, I need to check how many connected components I have (because I can't erase an edge that is a "bridge"). Also, I was using in the beginning graphs with VertexList=VecS but it turns out that when you erase an edge all the vertex descriptors are invalidated. Thus, I had to copy my graph to another one with VertexList=listS. I was wondering if the connected … [View More]

2 2

Jim Lear is out of the office.
by Jim.Lear＠legerity.com 05 Aug '06

05 Aug '06

I will be out of the office starting 08/05/2006 and will not return until 08/12/2006. I will respond to your message when I return.

1 0

assert when using cregex_iterator
by Winson Yung 05 Aug '06

05 Aug '06

I have a very simple test program using the latest 1.33 version of regex library. As soon as I run it, it assert (crash) at the line where std::string s = (*m1)[0]. I am doing something wrong? ============== #include "stdafx.h" #include <boost/regex.hpp> const char matchpattern[] = "\\s+kitty this"; const char astring[] = "hello Kitty this is a test"; using namespace boost; int main(int argc, char* argv[]) { regex header_expr(matchpattern, regex_constants::basic | regex_constants::… [View More]

2 1

boost python noobie questions
by chun ping wang 05 Aug '06

05 Aug '06

Hey I have several problem... A.) Can boost::python work with templated argument... Example: /************************************************ * rsa(p, q): * * let n = p * q * * let totient = (p-1)*(q-1) * * choose integer e between 1 and totient * * such that greatest common denominator is 1 * * d = (1 mod totient) / e * * return e, d, n … [View More]

2 2

Boost.Signals example/doc_view application question
by Allen Gooch 04 Aug '06

04 Aug '06

I have a quick question regarding connecting a bound member function. In the doc_view example application signals are defined as requiring a function taking a bool and returning nothing. class Document { public: typedef boost::signal< void (bool) > signal_t; // ... void append(const char* s) { m_text += s; m_sig(true); } // ... }; The View abstract base class requires concrete bases to provide a concrete implementation of the refresh()… [View More] member function matching the slot signature required. class View { public: virtual void refresh(bool) const = 0; // ... }; Here's my problem. If I change the signal to take no args using the preferred or portable syntax I get compilation errors: class Document { public: typedef boost::signal< void () > signal_t; // ... void append(const char* s) { m_text += s; m_sig(true); } // ... }; class View { public: virtual void refresh() const = 0; // ... }; Compilation output (msvc-7.1): Compiling... SignalTest.cpp c:\Boost\include\boost-1_33_1\boost\bind.hpp(63) : error C2825: 'F::result_type': cannot form a qualified name c:\Boost\include\boost-1_33_1\boost\bind\bind_template.hpp(15) : see reference to class template instantiation 'boost::_bi::result_traits<R,F>' being compiled with [ R=boost::_bi::unspecified, F=void (__thiscall View::* )(void) const ] c:\development\SignalTest\SignalTest.cpp(49) : see reference to class template instantiation 'boost::_bi::bind_t<R,F,L>' being compiled with [ R=boost::_bi::unspecified, F=void (__thiscall View::* )(void) const, L=boost::_bi::list2<boost::_bi::list_av_2<View *,boost::arg<1>>::B1,boost::_bi::list_av_2<View *,boost::arg<1>>::B2> ] c:\Boost\include\boost-1_33_1\boost\bind.hpp(63) : error C2039: 'result_type' : is not a member of 'operator``global namespace''' c:\Boost\include\boost-1_33_1\boost\bind.hpp(63) : error C2146: syntax error : missing ';' before identifier 'type' c:\Boost\include\boost-1_33_1\boost\bind.hpp(63) : error C2955: 'boost::_bi::type' : use of class template requires template argument list c:\Boost\include\boost-1_33_1\boost\bind.hpp(112) : see declaration of 'boost::_bi::type' c:\Boost\include\boost-1_33_1\boost\bind.hpp(63) : fatal error C1903: unable to recover from previous error(s); stopping compilation Observed with boost_1_33_1 release on cygwin/gcc-3.4.4 and msvc-7.1 platforms. Any ideas? Many thanks in advance, -allen [View Less]

1 0

Re: [Boost-users] Ownership of Boost IP?
by Nat Goodspeed 04 Aug '06

04 Aug '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] On Behalf Of Paul Giaccone > Sent: Friday, August 04, 2006 7:38 AM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Ownership of Boost IP? > > Nat Goodspeed wrote: > > I suppose the next round would involve my arguing that it would take me > > many months to implement even part of the functionality in question > > … [View More]> The answer to that would be to contact the Boost developers for all the > libraries you intend to or might use, and ask them how long it took them > to code up their respective libraries. [Nat] I'm hoping to avoid any approach that would add per-Boost-library overhead. Having to decide in advance the set of libraries I intend to use - and later facing additional internal battles to get permission to use one more -- would be discouraging. But I take your point: you're talking about an example set, not literally suggesting that I repeat the process every time I desire to incorporate another new Boost library. > Add it all up and present that > figure to your boss, pointing out that these people were at least as > competent as you or any other programmer he might care to employ. Does > he *really* want to wait a year or two for the code you are writing for > him? [Nat] Certainly he wouldn't want that. I guess I wasn't thinking clearly last night. The real problem is that nobody -- not me, not my boss, not the lawyers -- wants me to (attempt to) reimplement any Boost library. If we can't use Boost, then we must resort to the ugly hand-coded mechanisms that C++ programmers used before Boost emerged. No smart pointers? Delete the !@#? pointers yourself! No bind()? No boost::function? Quit griping and use the STL adapters! Can I make a case that the small incremental costs in coding time and reliability would add up to a bigger hit than the hypothetical risk of lawsuit? It seems doubtful, since all the factors involved in such an argument are sheer guesswork -- and every party will believe their own guesses rather than their opponents'. My boss might even be sympathetic. But my boss isn't the real problem here. > You might also want to ask your boss whether he is concerned that > Microsoft (or whoever wrote your compiler) might sue for use of their > version of C++, or whether he thinks Bjarne Stroustrup might be sending > you a writ... Of course, that would just be ridiculous, wouldn't it? ;) [Nat] Microsoft it is. I think I heard that Microsoft's licenses (purport to) protect you, the user of their products, from this kind of liability. That may be what raised this whole issue in our legal dept. in the first place. [View Less]

2 1

Re: [Boost-users] Ownership of Boost IP?
by james.jones＠firstinvestors.com 04 Aug '06

04 Aug '06

From: "Nat Goodspeed" <ngoodspeed(a)solidworks.com> > As the lawyers' position is "Don't use > Boost," I can't see them making that effort, so it would be up to me (or > other interested developers) to pursue it. Which leaves me/us vulnerable > to charges of "wasting time" that could "better" be spent reinventing > Boost technologies. How about mentioning that a bunch of Boost stuff (ideas, at least) is intended for use in TR1 and, AFAIK, TR2 and TRn. And that surely … [View More]

4 3

Re: [Boost-users] Ownership of Boost IP?
by Sohail Somani 04 Aug '06

04 Aug '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Robert Ramey > Sent: Friday, August 04, 2006 9:52 AM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Ownership of Boost IP? > > > Realistically, this situation isn't about the facts - its about > someone having authority beyond his expertise. Its a > political issue not a technical one. Boost and its … [View More]

1 0

Re: [Boost-users] Ownership of Boost IP?
by Nat Goodspeed 04 Aug '06

04 Aug '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] On Behalf Of Robert Ramey > Sent: Friday, August 04, 2006 11:18 AM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Ownership of Boost IP? > > Nat Goodspeed wrote: > > My employer's legal department has just stated that we may not use > > Boost for product development because of a hypothetical lawsuit risk. > > … [View More]

2 1

Re: [Boost-users] shared_ptr in API
by Sohail Somani 04 Aug '06

04 Aug '06

If the pointer is meant to be owned by the caller, you could consider references (assuming the objects are required of course). > -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Mikhail Kubzin > Sent: Thursday, August 03, 2006 3:45 AM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] shared_ptr in API > > Did you consider using weak_ptr in your API? > > &… [View More]

1 0

permutation_iterator: No conversion support
by Daniel Krügler 04 Aug '06

04 Aug '06

Hello, I observed this weekend, that permutation_iterator cannot provide compatible conversions, in constrast to all other iterators. The problem is due to access right violations in the "conversion" pseudo copy c'tor: template<class OtherElementIterator, class OtherIndexIterator> permutation_iterator( permutation_iterator<OtherElementIterator, OtherIndexIterator> const& r , typename enable_if_convertible<OtherElementIterator, ElementIterator>::… [View More]

2 1

MS VC2005 + Boost Setup
by Heiko Günther 04 Aug '06

04 Aug '06

Hello! I have some trouble to setup the Boost library with VC++ 2005. I am rather new to the library, so I could need some help. I have downloaded Version 1.33 and extracted the files to location A ("d:\programs\boost" in my case). Visual Studio is located in location B ("d:\programs\VS"). What is the best way to build the library files? I especially need the compiled library of the "signal" class. Since I have no experience with this bjam tool any help would be appreciated. I can't … [View More]

4 4

Re: [Boost-users] Ownership of Boost IP?
by Nat Goodspeed 04 Aug '06

04 Aug '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] On Behalf Of John Maddock > Sent: Friday, August 04, 2006 5:09 AM > To: boost-users > Subject: Re: [Boost-users] Ownership of Boost IP? > > Whew, of course now I feel like no one should write code, and I should go > look for another profession! But hopefully there is some ammunition in > there you can use. [Nat] Thank you!! I will … [View More]

1 0

Re: [Boost-users] Ownership of Boost IP?
by Nat Goodspeed 04 Aug '06

04 Aug '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] On Behalf Of Gennaro Prota > Sent: Thursday, August 03, 2006 9:13 PM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Ownership of Boost IP? > > On Thu, 3 Aug 2006 19:39:17 -0400, "Nat Goodspeed" wrote: > > >My employer's legal department has just stated that we may not use Boost > >for product development because … [View More]

4 3

How do I use regex to match two consecutive newlines?
by Tommy Li 04 Aug '06

04 Aug '06

I've tried matching like this: std::string input = filecontents; boost::regex re_paragraphs("\\n\\n"); boost::sregex_token_iterator input_token_it(input.begin(), input.end(), re_paragraphs, -1); boost::sregex_token_iterator end_token_it; for( ; input_token_it != end_token_it; input_token_it++ ) { output += "TOKEN FOUND" } return output; But this never works. It matches when I use a part of a word as a token. The problem is that it's just not matching the newlines. I've looked … [View More]

3 6

lexical_cast problem
by shams 04 Aug '06

04 Aug '06

Hi, Here is a sample custom string class that I am tring to get working with lexical_cast but it gives me compile errors. Can you please see what I am doing wrong here. More explanation below. OTOH if I use a custom lexical_cast using wstringstream it works fine. // main.cpp #include <string> #include <iostream> #include "boost_1_33_1/boost/lexical_cast.hpp" using namespace std; class String : public wstring { public: String() { } String(const wchar_t *str) : wstring(str) … [View More]

1 0

Subject: Serialization, text_Xarchive Why doesn't work?
by tkachenkok＠gmx.de 04 Aug '06

04 Aug '06

I've tried to write my first application with Boost.Serialization library. Here is the part of code, where the boost::text_iarchive throws an exception "boost::archive::archive_exception" "what(): stream error": [code] enum Origin { UNKNOWN=0, MEASURED, AVERAGE }; class OTCValue { friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & m_value; ar & m_orig; } double m_value; … [View More]

4 4

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 … [View More]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 [View Less]

3 2

[program_options] very long default values make formatting go nuts
by Andy Schlaikjer 03 Aug '06

03 Aug '06

Hi all, I have an option in my options_description which has a very long default value (an absolute pathname to a data file). When I print out the usage info via: cout << desc << endl; ..the formatting of the message is really bad; The long default value makes the option description text get squished to the far right: Allowed options: -h [ --help ] produce help … [View More]

1 0

[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: … [View More]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 */ [View Less]

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 … [View More]

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 … [View More]

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 … [View More]

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

checking validity
by Ovanes Markarian 03 Aug '06

03 Aug '06

Hello all, I have one specific question. Which I am uncertain if it can be solved anyway. Imagine the following class structure: struct A { some_field* x; }; struct B { optional<A> a_; }; struct C { optional<B> b_; }; Now I have an instance of struct C and would like to know if x is a valid pointer. this code is really ugly: if(c.b_) if(c.b_.a_) if(c.b_.a_.x) //do smth ... This will be really unpleasent if the structure is more deep then this one. Which is … [View More]

2 1

Re: [Boost-users] checking validity
by james.jones＠firstinvestors.com 03 Aug '06

03 Aug '06

From: "Ovanes Markarian" <om_boost(a)keywallet.com> > Now I have an instance of struct C and would like to know if x is a valid pointer. > this code is really ugly: > if(c.b_) > if(c.b_.a_) > if(c.b_.a_.x) > //do smth ... > The intention would be to write everything in one if-statement. It is not possible > to implement a bool or ! operator in these structures, since these are not the > only fields and these operators would not know which field should be … [View More]

2 1

[preprocessor] Enumerating sequence of pairs
by Roman Perepelitsa 03 Aug '06

03 Aug '06

Hello. I want to enumerate sequence of pairs but can't figure out how to do it using boost.preprocessor. Here is example. // sequence of pairs #define SEQ (a, b) (c, d) // How can I implement this macro? #define MAGIC(S) ... MAGIC(SEQ) expands to abcd. If I had possibility to convert SEQ to ((a, b)) ((c, d)) problem would be solved easily because it's standard sequence and thus can be enumerated using with BOOST_PP_SEQ_FOLD_LEFT or another boost.preprocessor algorithm. I have … [View More]

2 2

string_algo and utf8 locales
by Maik Beckmann 03 Aug '06

03 Aug '06

Hello list, this is my first post to you :) I've got a problem with handling locales and string_algo. As an example I want so make this string "hää?" uppercase (->"HÄÄ?") by using this piece of code: <code> #include <iostream> #include <locale> #include <string> #include <boost/algorithm/string.hpp> using namespace std; using namespace boost; int main(int argc, char** … [View More]

2 3

shared_ptr in API
by Philippe Lambert 03 Aug '06

03 Aug '06

Hello, We are a large team of C++ developers, using Boost at large. We have a philosophical issue about shared_ptr usage and I'm looking for external inputs. The 2 clans are opposed about a simple question: "Should we use shared_ptr in the API function signatures of a module (dll or else)". Both clan use a lot of Sutter/Meyers/other gurus and authors citation to support their view. 1- Pros: shared_ptr are everywhere in the current code. It is the best way to prevent resources leaks, it … [View More]

3 2

Re: [Boost-users] replace_all_regex on c-string help
by llwaeva＠21cn.com 03 Aug '06

03 Aug '06

> > > I got the string (char*s), which is too big (>10M), from an external > > library, it's too slow to convert the raw string to std::string before > > it is handled by replace_all_regex > > Here's your fundamental problem: regex does not do in-place search and > replace. It is boost::algorithm::replace_all_regex, not boost:regex_replace

3 2

regular expression on table data
by Winson Yung 03 Aug '06

03 Aug '06

Hello all, I have a follow table: OPERATING REVENUES: publishing $ 42,419 $ 44,754 $ 46,203 collegiate marketing and production services 97 ASSOCIATION MANAGEMENT SERVICES 16 wireless 8,883 8,129 7,507 51,302 52,883 53,823 All I know is that OPERATING REVENUES: will be always there, question is how to write a regular expression to capture the total (which is 51,302 here) There might be more/less than four rows in the … [View More]

2 5

[date_time] Warning in date_time/constrained_value.hpp
by Vsevolod Vlaskin 03 Aug '06

03 Aug '06

Hi, We run into a strange compilation warning, which we see on and off in one particular spot in our code: std::string str( /* initialized with a sane value */ ); ... double dbl( boost::lexical_cast<double>( str ) ); return dbl; The warning shows up only in release mode, NOT in debug: /usr/include/boost/date_time/constrained_value.hpp: In function int main(int, char**): /usr/include/boost/date_time/constrained_value.hpp:64: warning: year$D120988$value_ is used uninitialized in … [View More]

1 0

Re: [Boost-users] (de)serializing map<const A*>
by Cheok Yan Cheng 03 Aug '06

03 Aug '06

Hi Robert, I am using VC++ 2003 I must say, the following workaround just work :) :) :) void load(Archive & ar, const unsigned int version) { void * xptr; xptr = & fiducialPairSearchRegionMap; map<FiducialPair *, vector<RectPair> > *mptr; mptr = static_cast<map<FiducialPair *, vector<RectPair> > >(xptr); ar >> *mptr; } Btw, may I know what is the reason behind of using static_cast instead of … [View More]

2 1

boost::bind for returning a reference?
by Paul 03 Aug '06

03 Aug '06

Hi all, I understand why boost::bind() must return a const-reference or a value, but what I don't understand is, why must I do boost::bind<R&>(...) if I want it to return by reference? Why must I (the user) deduce the return type myself? Can't we have a boost::bind_return_reference(...) function that is the equivalent of boost::bind<R&>(...), so I don't have to do all the hard result_of type deduction manually? cheers Paul

2 3

Boost.Signals doc_view example application question?
by Allen Gooch 02 Aug '06

02 Aug '06

I have a quick question regarding connecting a bound member function. In the doc_view example application signals are defined as requiring a function taking a bool and returning nothing. class Document { public: typedef boost::signal< void (bool) > signal_t; // ... void append(const char* s) { m_text += s; m_sig(true); } // ... }; The View abstract base class requires concrete bases to provide a concrete implementation of the refresh() member … [View More]function matching the slot signature required. class View { public: virtual void refresh(bool) const = 0; // ... }; Here's my problem. If I change the signal to take no args using the preferred or portable syntax I get compilation errors: class Document { public: typedef boost::signal< void () > signal_t; // ... void append(const char* s) { m_text += s; m_sig(true); } // ... }; class View { public: virtual void refresh() const = 0; // ... }; Compilation output (msvc-7.1): Compiling... SignalTest.cpp c:\Boost\include\boost-1_33_1\boost\bind.hpp(63) : error C2825: 'F::result_type': cannot form a qualified name c:\Boost\include\boost-1_33_1\boost\bind\bind_template.hpp(15) : see reference to class template instantiation 'boost::_bi::result_traits<R,F>' being compiled with [ R=boost::_bi::unspecified, F=void (__thiscall View::* )(void) const ] c:\development\SignalTest\SignalTest.cpp(49) : see reference to class template instantiation 'boost::_bi::bind_t<R,F,L>' being compiled with [ R=boost::_bi::unspecified, F=void (__thiscall View::* )(void) const, L=boost::_bi::list2<boost::_bi::list_av_2<View *,boost::arg<1>>::B1,boost::_bi::list_av_2<View *,boost::arg<1>>::B2> ] c:\Boost\include\boost-1_33_1\boost\bind.hpp(63) : error C2039: 'result_type' : is not a member of 'operator``global namespace''' c:\Boost\include\boost-1_33_1\boost\bind.hpp(63) : error C2146: syntax error : missing ';' before identifier 'type' c:\Boost\include\boost-1_33_1\boost\bind.hpp(63) : error C2955: 'boost::_bi::type' : use of class template requires template argument list c:\Boost\include\boost-1_33_1\boost\bind.hpp(112) : see declaration of 'boost::_bi::type' c:\Boost\include\boost-1_33_1\boost\bind.hpp(63) : fatal error C1903: unable to recover from previous error(s); stopping compilation Observed with boost_1_33_1 release on cygwin/gcc-3.4.4 and msvc-7.1platforms. Any ideas? Many thanks in advance, -allen [View Less]

1 0

boost::filesystem::ifstream and .eof()
by pktao＠uwm.edu 02 Aug '06

02 Aug '06

Dear Boost users --I have a simple question about how to test for eof. I usually use: std::ifstream inputDataStream("path to file"); and test for EOF by: inputDataStream.eof() I tried the same thing using: boost::filesystem::basic_ifstream<char> inputDataStream("path to file", std::ios_base::in); and test for EOF by: inputDataStream.eof() but its not working. Am I using the .eof() correctly in the boost version of basic_ifstream? Here is the broken code using the boost version … [View More]

2 1

Lack of release() in scoped_ptr and scoped_array
by Milutin Jovanovic 02 Aug '06

02 Aug '06

I finally decided to switch to boost from my own implementation of some helper classes, and I noticed that scoped_ptr and scoped_array in boost lack the release method(). I had to fall back to std::auto_ptr. However, this seems like such a basic and fundamental problem that I have started to fear that I am missing something obvious... The usage I got used to was something like this: { scoped_ptr<A> temp( new A() ); verify( temp.get() ); // might throw … [View More]

3 2

boost::mpl::if_
by Noel Yap 02 Aug '06

02 Aug '06

I'd like to do something like: typedef typename boost::mpl::if_< typename base::is_container<T>::type, typename T::element_type, T>::type ElementType_; such that T may be a primitive type. The above doesn't work since, for example, there's no such thing as int::element_type. Is there a simple way (eg don't have to do template specialization for all container types) to do the above? Thanks, Noel

2 1

enable_if problem
by Imre 02 Aug '06

02 Aug '06

Hi I have some non-compiling code, and I'd like to know if it's a compiler bug, or something I'm doing wrong. In the following code (it's a simplified version of the real code where I met the problem) the call to F<int> instantiates S<int>. I think the compiler should choose the specialized version of S<>, but it seems to use the primary template instead, leading to an invalid non-lvalue int -> int& conversion. Strangely, if I explicitly instantiate S<int> … [View More]

1 0

regex_constants::perl
by Winson Yung 02 Aug '06

02 Aug '06

Hello, I saw the following thread talking about how to set regex to work in perl extended mode: http://groups.google.com/group/boost-list/browse_thread/thread/4d5588fb7021… I am using 1.28.0 and has coded something like this already: boost::RegEx expr(is10k ? keywords_10k[i].m_Key : keywords_10q[i].m_Key, true); // Pass callback, strings to RegEx library unsigned int result = … [View More]

2 3

replace_all_regex on c-string help
by llwaeva＠21cn.com 02 Aug '06

02 Aug '06

Hi there, I am using in-place replacement with replace_all_regex replace_all_regex( source, boost::regex("(%f)"), "(?1 xxx)", format_all); where source is of type std::string. But for some reason, I need to perform replacement on a C-string (char *), is replace_all_regex safe to do so? Will replace_all_regex handle memory issue for us? Thanks.

3 2

Re: [Boost-users] replace_all_regex on c-string help
by llwaeva＠21cn.com 02 Aug '06

02 Aug '06

>> But for some reason, I need to perform replacement on a >> C-string (char *), is replace_all_regex safe to do so? Will replace_all_regex handle memory >> issue for us? >Of course this would be impossible. Boost.Regex can't know how the >memory was allocated (e.g. malloc or new or some custom allocator), or >even if it *was* allocated. >Why do you need to operate on raw char*'s? Why can't you operate on >an std::string? I got the string (char*s), which is … [View More]

2 1

[shmem] problem retrieving objects from map
by Pataki Szilard 02 Aug '06

02 Aug '06

Hello, I have a problem retrieving objects from a map placed in shared memory. I have two processes: proc#1: creates the shared memory, puts a map into it and populates it with objects proc#2: connects to the shared memory and tries to read out the objects from the map Whenever I try to read out the objects from the map, I get zeroes for the internal members (a, b). The class definition for the objects: -------------------------------------------------- class ShmNode { private: int a; int … [View More]b; public: ShmNode(); ShmNode(int newa, int newb); ~ShmNode(); void set(int newa, int newb); int getA(); int getB(); }; -------------------------------------------------- I'm posting the source codes for the two programs. I removed the synchronization stuff with semaphores for the sake of clarity: Proc#1: -------------------------------------------------- #include <boost/shmem/named_shared_object.hpp> #include <boost/shmem/allocators/allocator.hpp> #include <boost/shmem/containers/vector.hpp> #include <boost/shmem/containers/map.hpp> #include <boost/shmem/sync/named_semaphore.hpp> #include <iostream> #include "../shmem/ShmNode.hpp" typedef std::pair< const int, ShmNode*> MyPair; typedef boost::shmem::allocator < MyPair, boost::shmem::named_shared_object::segment_manager> MyAlloc; typedef boost::shmem::map< const int, ShmNode*, std::less<const int>, MyAlloc> MyMap; int main() { boost::shmem::named_shared_object segment; segment.create("/myshmem", 20000); MyAlloc nodesAlloc(segment.get_segment_manager()); std::less<const int> comparator; MyMap *table = segment.construct<MyMap>("table")(comparator, nodesAlloc); MyPair myPair1(1, new ShmNode(1,2)); MyPair myPair2(2, new ShmNode(3,4)); MyPair myPair3(3, new ShmNode(5,6)); table->insert(myPair3); table->insert(myPair1); table->insert(myPair2); return 0; } -------------------------------------------------- Proc#2 -------------------------------------------------- /* same includes */ /* same typedefs */ int main() { boost::shmem::named_shared_object segment; segment.open("/myshmem"); MyMap *table = segment.find<MyMap>("table").first; std::cout << "table size: " << table->size() << std::endl; MyMap::iterator iter; for (iter = table->begin(); ; iter++) { if (iter == table->end()) break; std::cout << iter->second->getA() << " " << iter->second->getB() << std::endl; } return 0; } -------------------------------------------------- The problem once again: in proc#2, iter->second->getA() and iter->second->getB() return 0. If I put the same loop into proc#1, the correct values are returned. As a further hint, the size of the map object in proc#2 is returned correctly (=3). What am I doing wrong? Regards, Szilard [View Less]

3 3

[format] bind_arg with empty string
by Edson Tadeu 01 Aug '06

01 Aug '06

Boost.format bind_arg with an empty string is not working for Boost 1.33.1(it used to work in 1.32). The offending code is this one: format f("%s%-.32s:%|40t|%|.6|%|54t|%25s\n"); f.bind_arg(1,""); It crashes because of a null pointer in a buffer (buf_).

2 1

boost unit test compilation problem
by Minkoo Seo 01 Aug '06

01 Aug '06

Hi list. I'm trying to compile and run simple unit test, but only to fail: #include <boost/test/unit_test.hpp> using namespace std; using namespace boost::unit_test; using namespace boost; void force_division_by_zero() { BOOST_CHECKPOINT("About to force division by zero!"); int i = 1, j = 0; i = i / j; } test_suite* init_unit_test_suite(int, char*) { test_suite* test = BOOST_TEST_SUITE("Unit test example2"); test->add(BOOST_TEST_CASE(&… [View More]force_division_by_zero), 1); return test; } This does not compile though this is the program shown in the document. The errors are: /usr/lib/gcc/x86_64-redhat-linux/4.0.2/../../../../lib64/crt1.o (.text+0x20): In function `_start': : undefined reference to `main' /tmp/ccytTZBu.o(.text+0x8f): In function `force_division_by_zero()': backoff_ngram_lm_test.cpp: undefined reference to `boost::test_tools::tt_detail::check_impl(boost::test_tools:: predicate_result const&, boost::basic_wrap_stringstream<char>&, boost::unit_test::basic_cstring<char const>, unsigned long, boost::test_tools::tt_detail::tool_level, boost::test_tools::tt_detail::check_type, unsigned long, ...)' /tmp/ccytTZBu.o(.text+0x173): In function `init_unit_test_suite(int, char*)': backoff_ngram_lm_test.cpp: undefined reference to `boost::unit_test::test_suite::test_suite(boost::unit_test:: basic_cstring<char const>)' /tmp/ccytTZBu.o(.text+0x1e8):backoff_ngram_lm_test.cpp: undefined reference to `boost::unit_test::test_suite::add(boost::unit_test::test_unit*, unsigned long, unsigned int)' /tmp/ccytTZBu.o(.gnu.linkonce.t._ZN5boost9unit_test14make_test_case ERKNS0_9callback0INS0_9ut_detail6unusedEEENS0_13basic_cstringIKcEE [boost::unit_test::make_test_case(boost::unit_test::callback0 <boost::unit_test::ut_detail::unused> const&, boost::unit_test::basic_cstring<char const>)]+0x35): In function `boost::unit_test::make_test_case(boost::unit_test::callback0 <boost::unit_test::ut_detail::unused> const&, boost::unit_test::basic_cstring<char const>)': backoff_ngram_lm_test.cpp: undefined reference to `boost::unit_test::ut_detail::normalize_test_case_name(boost:: unit_test::basic_cstring<char const>)' /tmp/ccytTZBu.o(.gnu.linkonce.t._ZN5boost9unit_test14make_test_ caseERKNS0_9callback0INS0_9ut_detail6unusedEEENS0_13basic_cstring IKcEE[boost::unit_test::make_test_case(boost::unit_test::callback0 <boost::unit_test::ut_detail::unused> const&, boost::unit_test::basic_cstring<char const>)]+0x65):backoff_ngram_lm_test.cpp: undefined reference to `boost::unit_test::test_case::test_case(boost::unit_test::basic_ cstring<char const>, boost::unit_test::callback0<boost::unit_test::ut_detail:: unused> const&)' collect2: ld returned 1 exit status I'm compiling the sorce like g++ filename.cpp. My environments: $ g++ -v Using built-in specs. Target: x86_64-redhat-linux Configured with: ../configure --prefix=/usr --mandir=/usr/share/man --infodir=/usr/share/info --enable-shared --enable-threads=posix --enable-checking=release --with-system-zlib --enable-__cxa_atexit --disable-libunwind-exceptions --enable-libgcj-multifile --enable-languages=c,c++,objc,java,f95,ada --enable-java-awt=gtk --with-java-home=/usr/lib/jvm/java-1.4.2-gcj-1.4.2.0/jre --host=x86_64- redhat-linux Thread model: posix gcc version 4.0.2 20051125 (Red Hat 4.0.2-8) Any idea? Sincerely, Minkoo Seo [View Less]

4 6

[regex] Thread safety patch.
by John Maddock 01 Aug '06

01 Aug '06

With apologies to all concerned, and thanks to Aleksey Sanin for tracking down the problem, there is a const-correctness bug in Boost.Regex-1.33.x that strikes only in multithreaded programs on Unix platforms, if: * Multiple threads construct regexes concurrently, or * Multiple threads perform search and replace operations concurrently. There are two possible fixes: * Apply the attached patch (this has just gone into cvs along with an updated test case that detects the issue). Or, * … [View More]

2 2

boost::threads
by Noel Yap 01 Aug '06

01 Aug '06

I was just wondering what the status of boost::threads is. It looks like it hasn't been released since last year. Is there an ETA for the next release? Thanks, Noel

1 0

Re: [Boost-users] (de)serializing map<const A*>
by Cheok Yan Cheng 01 Aug '06

01 Aug '06

Hmmm - I think the map size is already saved to disk. If you just copy the current templated implementation for map loading and instantiate a specialized version for your case, I would think that would handle the job. Robert Ramey ------------------------------------------------------- I am sorry. However, I do not quite understand. Let me more specific to my case. I have a data structure: map<const FiducialPair *, vector<RectPair> > fiducialPairSearchRegionMap; Both … [View More]

2 1

bjam issues
by Daniel Krügler 01 Aug '06

01 Aug '06

Hello! Regrettably my posting "Labeling patched Boost versions" from 2006-07-21 got no response :-(( - so I would like to manipulate the boost bjam on my own to reach the effect that the build libraries will have a fixed character sequence suffix (aka "build id") but I got lost, when I tried this. My assumption was that I only need to modify Jamfile.v2 in the root directory where I found the promising rules beginning with line 92: # This rule is called by Boost.Build to determine the name … [View More]of # target. We use it to encode build variant, compiler name and # boost version in the target name rule tag ( name : type ? : property-set ) { if $(type) in STATIC_LIB SHARED_LIB IMPORT_LIB { if $(layout) = versioned { name = [ stage.add-variant-and-compiler $(name) : $(type) : $(property-set) ] ; local version-tag = [ MATCH "^([^.]+)[.]([^.]+)" : $(BOOST_VERSION[1]) ] ; version-tag = $(version-tag:J="_") ; # On NT, library with version suffix won't be recognized # by linkers. On CYGWIN, we get strage duplicate symbol # errors when library is generated with version suffix. # On OSX, version suffix is not needed -- the linker expets # libFoo.1.2.3.dylib format. # AIX linkers don't accept version suffixes either. if [ $(property-set).get <os> ] in NT CYGWIN MACOSX AIX { return $(name:B)-$(version-tag)$(name:S) ; } else { return $(name:B)-$(version-tag)$(name:S).$(BOOST_VERSION) ; } } else { return [ stage.add-variant-and-compiler $(name) : $(type) : $(property-set) ] ; } } } Naively I just tried to add a fixed string to the returned name, e.g. # This rule is called by Boost.Build to determine the name of # target. We use it to encode build variant, compiler name and # boost version in the target name rule tag ( name : type ? : property-set ) { if $(type) in STATIC_LIB SHARED_LIB IMPORT_LIB { if $(layout) = versioned { name = [ stage.add-variant-and-compiler $(name) : $(type) : $(property-set) ] ; local version-tag = [ MATCH "^([^.]+)[.]([^.]+)" : $(BOOST_VERSION[1]) ] ; version-tag = $(version-tag:J="_") ; # On NT, library with version suffix won't be recognized # by linkers. On CYGWIN, we get strage duplicate symbol # errors when library is generated with version suffix. # On OSX, version suffix is not needed -- the linker expets # libFoo.1.2.3.dylib format. # AIX linkers don't accept version suffixes either. if [ $(property-set).get <os> ] in NT CYGWIN MACOSX AIX { return $(name:B)-$(version-tag)$(name:S)."A" ; } else { return $(name:B)-$(version-tag)$(name:S).$(BOOST_VERSION)."B" ; } } else { return [ stage.add-variant-and-compiler $(name) : $(type) : $(property-set)."C" ] ; } } } but that did not influence the resulting names of a new bjam build at all. Could someone please help a dump bjam beginner to reach the wanted effect, e.g. to attach a given fixed string constant like "M20060801" to all created libraries?? Thank you very much for your patience, Daniel Krügler [View Less]

2 1

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 … [View More]

2 1

[boost ::threads] Different behaviour between packaged and compiled version.
by Thierry Dumont 01 Aug '06

01 Aug '06

My code (a very small piece of code) uses boost:threads; It performs perfectly with the Debian Sarge version of boost,but segfaults with the version I installed myself (using bjam "-sTOOLS=gcc"). The Boost version I installed is: 1_33_1; Debian Sarge version is 1_32_06. I tried to runs the tests from inside the compiled 1_33_1 version: it works perfectly; but when I copy, say tennis.cpp, in an other directory, and compile and link it with version 1_33_1 (the one I compiled), it segfaults. I … [View More]

3 3

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 … [View More]

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 … [View More]

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,… [View More]

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 … [View More]

2 1