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

Building on OS X
by Stuart Dootson 09 Feb '09

09 Feb '09

So, I've installed Xcode 3.0, followed by Xcode 3.1.2. gcc is defaulting to 4.0, which builds Boost fine (using the configure & make install OR bjam routes). However, I would like to build boost with gcc 4.2, as installed with Xcode 3.1.2 - I've not managed to find the correct incantation yet to persuade Boost to use 4.2 vs 4.0 - help!!!! I guess I could just alter the gcc and g++ soft links in /usr/bin, but that seems...wrong. Assistance would be greatly appreciated. TIA!!! Stuart Dootson

4 5

Re: [Boost-users] Cycles of shared_ptr
by Alan M. Carroll 09 Feb '09

09 Feb '09

Detecting cycles at run time is expensive and rarely worth the effort. It is much better to have a clear understanding of your data structure and awareness of where cycles could arise and then break them using Boost.weak_ptr, as weak_ptr was created to deal with exactly this problem. For instance, if you have a tree that needs parent to child and child to parent links, then you can use shared_ptr in the parent class and weak_ptr in the child struct. The important thing is to be clear on the ownership semantics. There are so many possibilities that it's hard to be more specific without a lot of detail. At 12:01 PM 2/9/2009, you wrote: >I have recently started using boost::shared_ptr in my code. I >understand that cycles of shared_ptr will cause a problem. Now, I >strongly believe that such a situation has arisen in my code and am >wondering if there is any advice/tips on how one can detect when a >cycles of shared_ptr has occured. The code I am working on is >developed by several people and the shared_ptr of interest is passed >to many objects.

1 0

Cycles of shared_ptr
by Donovan Parks 09 Feb '09

09 Feb '09

Hello, I have recently started using boost::shared_ptr in my code. I understand that cycles of shared_ptr will cause a problem. Now, I strongly believe that such a situation has arisen in my code and am wondering if there is any advice/tips on how one can detect when a cycles of shared_ptr has occured. The code I am working on is developed by several people and the shared_ptr of interest is passed to many objects. Thanks for any and all help. Cheers, Donovan PS: This is my first time posting to boost-users.

1 0

Building boost regex on Vxworks compiler
by Raghavender Boorgapally 09 Feb '09

09 Feb '09

Hi, I am assigned the job of building the boost regex on VXworks gcc compiler. >From the boost regex documentation, I see that we need to have a make file corresponding to the platform to build the library. Can some one tell me how to build it for Vxworks gcc, if they have built the library earlier.

2 1

[regex] character sets
by Detlef Meyer-Eltz 09 Feb '09

09 Feb '09

I'm working with CBuilder6 and boost boost_1_34_1 and found, that regex expression1("[[:print:]]+"); matches with regex_search the whole string: testtext = "ab\r\ncd ef"; including the linebreak and the white space. I had assumed, that the print-class would consist exactly in the set of characters for which the standard function isprint returns true but isprint returns false for the space characters. Is there there any documentation with the exact enumerations of the different character sets? With Kind Regards, Detlef Meyer-Eltz

2 2

[Smart Ptr] make_shared for arrays
by Alexander 09 Feb '09

09 Feb '09

Why isn't there ? It looks easier to implement than for single objects as there would be only unary version which would take array size.

1 0

boost serialization not working unless you have at least one virtual function in base
by Martin Seiler 09 Feb '09

09 Feb '09

Hi all, Does anybody know why this is the case? Is there a way to make a class "polymorphic" without adding a dummy virtual function? Is this some "silly" optimization done by C++ compilers? Not generating vtables? It took me quite some time to figure this one out. It is mentioned in the documentation (2 lines, easily missed). http://www.boost.org/doc/libs/1_37_0/libs/serialization/doc/serialization.h… Maybe add a big huge WARNING? Also please mention this fact in the examples! (like in demo.cpp?) regards M. Seiler #include <boost/archive/xml_oarchive.hpp> #include <boost/archive/xml_iarchive.hpp> #include <boost/serialization/nvp.hpp> #include <boost/serialization/base_object.hpp> #include <boost/serialization/type_info_implementation.hpp> #include <boost/serialization/export.hpp> #include <boost/archive/archive_exception.hpp> #include <boost/archive/basic_xml_archive.hpp> class A { public: A() : test(33) { } int test; virtual void dummy(){} // if you comment this line it won't work }; class B : public A { public: B() : test_b(52) { } int test_b; virtual void foo(){}; }; namespace boost { namespace serialization { template<class Archive> void serialize(Archive & ar, A & o, const unsigned int version) { ar & make_nvp("test", o.test); } template<class Archive> void serialize(Archive & ar, B & o, const unsigned int version) { ar & boost::serialization::make_nvp("A", boost::serialization::base_object<A>(o)); ar & make_nvp("test_b", o.test_b); } } } BOOST_CLASS_EXPORT(B); // Should register B for all archives such that it can be serialized of the basepointers void main() { A* a = new B(); boost::archive::xml_oarchive archive(std::cout); archive.template register_type<B>(); // Should register B for this archive archive & boost::serialization::make_nvp ("a", a); // If you check the output, you see that `{B}.test_b' was not serialized int i; std::cin >> i; }

4 3

Need boost_regex_vc7_mssd.lib
by Dyuti Barma 09 Feb '09

09 Feb '09

Hi, I'm not sure where to find boost_regex_vc7_mssd.lib and the corresponding library for VC8. Can anyone let me know where to get the above libs from ? Thanks Dyuti

2 1

Boost.lambda: how to sort this vector with function?
by Joost Kraaijeveld 09 Feb '09

09 Feb '09

I want to sort a vector of Edges according to their remaining estimated distance to the finish point (an own implementation of a graph algorithm). How do I sort this vector with edges: // Returns the cost between start and finish, given a graph int CostEstimate( const Graph& aGraph, const Vertex& start, const Vertex& finish) ... // Member function of a graph std::vector< Edge > v = ...; // Sort them according to the cost std::sort( v.begin(), v.end(), boost::lambda::bind( CostEstimate( (*this), boost::lambda::bind( &Edge::otherSide, &start, boost::lambda::_1), finish)) < boost::lambda::bind( CostEstimate( (*this), boost::lambda::bind( &Edge::otherSide, &start, boost::lambda::_2), finish))); where otherSide is a const function of the class Edge which returns a "const Vertex&" Compiling this results in an error: error: invalid initialization of reference of type ‘const Vertex&’ from expression of type ‘const boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::action<3, boost::lambda::function_action<3, boost::lambda::detail::unspecified> >, boost::tuples::tuple<const Vertex& (Edge::* const)(const Vertex&)const, const Vertex* const, const boost::lambda::lambda_functor<boost::lambda::placeholder<1> >, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type> > >’ TIA -- Groeten, Joost Kraaijeveld Askesis B.V. Molukkenstraat 14 6524NB Nijmegen tel: 024-3888063 / 06-51855277 fax: 024-3608416 web: www.askesis.nl

3 4

[Graph] is it possible to define my own edge_descriptor
by George Slavov 09 Feb '09

09 Feb '09

Hello, I have a graph which corresponds to an n by m grid of vertices. Edges in this graph are only allowed to point from one vertex to an adjacent vertex. In this situation, it would be wonderful if I could define an edge, so that its target is not a vertex_descriptor but some other construct which would allow me to store the target in just one byte or less instead of the full unsigned int which I use to describe my vertices. That is, the edge could go from vertex 102 to a descriptor in the range [0,8] which would give you enough information to compute which vertex you're talking about. The graph I'm working with is rather large. It could have millions of vertices and saving this kind of space would be fantastic. If it's important at all, mostly I'll be doing topological sort on these graphs. Is this possible? Best, George Slavov

3 4

NURBS curves/surfaces
by Peter Barker 09 Feb '09

09 Feb '09

Hello, Is there anything in Boost current or planned to deal with NURBS curves/surfaces? Regards, Pete

5 11

[boost-users][asio] why boost::thread thread1(boost::bind(...)) doesn't start io_service on multicore machine?
by tomasz jankowski 09 Feb '09

09 Feb '09

I would like to test my class which implements shared data. because of it I have written test code which use boost::thread & boost asio (please see below). the problem is that threads are NOT started... on multicore machine. one one core machine it runs fine. any idea why? tom #include <iostream> #include <istream> #include <ostream> #include <string> #include <boost/asio.hpp> #include <boost/date_time/posix_time/posix_time.hpp> #include <boost/bind.hpp> #include <boost/thread.hpp> #include "shared.hpp" #include <boost/random/linear_congruential.hpp> #include <boost/random/uniform_real.hpp> #include <boost/random/variate_generator.hpp> SharedData replyToClients; void handle_timeout1(const boost::system::error_code&) { boost::minstd_rand generator(42u); boost::uniform_real<> uni_dist(0,1); boost::variate_generator<boost::minstd_rand, boost::uniform_real<> >uni(generator, uni_dist); std::string key = "ello";std::cout<<key<<std::endl; std::string value1 = "see you later aligator"; std::string value2 = "what do you want to eat today?"; double cond = 0.500000; while(true){ if(uni() >= cond){ replyToClients.set(key,value1); }else{ replyToClients.set(key,value2); } } } void handle_timeout2(const boost::system::error_code&) { std::string key = "ello"; while(true){ std::cout<<replyToClients.get(key); } } int main(int argc, char* argv[]) { try{ boost::asio::io_service io_service; boost::system::error_code error; //boost::asio::io_service::work work(io_service); io_service.post(boost::bind(handle_timeout1,error)); io_service.post(boost::bind(handle_timeout2,error)); io_service.post(boost::bind(handle_timeout2,error)); io_service.post(boost::bind(handle_timeout2,error)); boost::thread thread1(boost::bind(&boost::asio::io_service::run, &io_service)); boost::thread thread2(boost::bind(&boost::asio::io_service::run, &io_service)); boost::thread thread3(boost::bind(&boost::asio::io_service::run, &io_service)); boost::thread thread4(boost::bind(&boost::asio::io_service::run, &io_service)); //io_service.run(); std::cout<<"the end\n"; io_service.stop(); thread1.join(); thread2.join(); thread3.join(); thread4.join(); } catch (boost::system::system_error& er) {std::cout << "Exception er: " << er.what() << "\n"; } catch (std::exception& e) { std::cout << "Exception e: " << e.what() << "\n"; } return 0; } ---------------------------------------------------- Nużą Cię utarte scenariusze? Wymyśl własną grę flashową i wygraj główną nagrodę 5.500 Euro: http://klik.wp.pl/?adr=http%3A%2F%2Fwhosegame.pl%2Fcontestcard.php%3Fcontes…

2 2

[program_options] VM object unable to store the values of options
by Wenjing Jia 09 Feb '09

09 Feb '09

(Apologies if this message has come out for more than once, as I had problem with authorization and is unsure when the message is able to be seen by boost users!) Hi, I'm met a very weird thing when using the “Boost.Program_options” library. Somehow, the variable-map(VM) object is unable to store values of options which are fed in from the command line. I've been stuck in this stupid problem for two days and cannot find any clue about it. Can someone please give me a hint? I'm using the Visual Studio 2005 on Windows XP SP3 to compile some examples provided in Boost.Program_options Tutorial. The boost library was installed using the boost_1_34_1 installer. However, no matter what value I input to any option, the variable-map object "vm" I defined is unable to store it and output it correctly. For instance, I followed the instructions in the Tutorial of the Boost.Program_options and compiled the first simplest possible example "example/first.cpp". I then went to "start" of Windows XP and Run "cmd", then run: "first --compression 10". The output is always "Compression level was set to -858993460." regardless of what value I type after the "--compression". Below is the full codes of the program (copied from the "example/first.cpp"): ------------------------------------------------------------------------------- #include <boost/program_options.hpp> namespace po = boost::program_options; #include <iostream> #include <iterator> using namespace std; int main(int ac, char* av[]) { try { po::options_description desc("Allowed options"); desc.add_options() ("help", "produce help message") ("compression", po::value<int>(), "set compression level") ; po::variables_map vm; po::store(po::parse_command_line(ac, av, desc), vm); po::notify(vm); if (vm.count("help")) { cout << desc << "\n"; return 1; } if (vm.count("compression")) { cout << "Compression level was set to " << vm["compression"].as<int>() << ".\n"; } else { cout << "Compression level was not set.\n"; } } catch(exception& e) { cerr << "error: " << e.what() << "\n"; return 1; } catch(...) { cerr << "Exception of unknown type!\n"; } return 0; } ------------------------------------------------------------------------------- I also tried on the other examples mentioned on that web page, such as "example/options_description.cpp". When I type: "options_description --optimization 4 -I foo a.cpp", the output is: "Include paths are: Input files are: Optimization level is -858993460". That is the input values are not taken and stored by the vm object. Why such a simple example won't work on my machine!? Your suggestion would be most appreciated! Many thanks in advance! Wenjing

2 2

boost graph compiling problem with vc7.1
by liulewes 08 Feb '09

08 Feb '09

Dear there: I recently started to use the boost graph library and I got the following problem. I'v 2 projects A and B in my vc 7.1 solution. A uses boost graph lib while B is dependent on A. I'v no problem compiling A but got some errors in B like this: C:\Program Files\boost\boost_1_35_0\boost\graph\detail\adjacency_list.hpp(2292): error C2039: 'size_type' : is not a member of 'boost::vec_adj_list_impl<Graph,Config,Base>' with [ Graph=boost::adjacency_list<boost::vecS,boost::vecS,boost::undirectedS,boost::property<vmap_id_t,int,boost::property<boost::vertex_color_t,RGBColor,boost::property<vertex_feature_t,FeatureVector2D<double> *>>>,boost::property<boost::edge_weight_t,double>>, Config=boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS,boost::vecS,boost::undirectedS,boost::property<vmap_id_t,int,boost::property<boost::vertex_color_t,RGBColor,boost::property<vertex_feature_t,FeatureVector2D<double> *>>>,boost::property<boost::edge_weight_t,double>>,boost::vecS,boost::vecS,boost::undirectedS,boost::detail::retag_property_list<boost::vertex_bundle_t,boost::property<vmap_id_t,int,boost::property<boost::vertex_color_t,RGBColor,boost::property<vertex_feature_t,FeatureVector2D<double> *>>>>::type,boost::detail::retag_property_list<boost::edge_bundle_t,boost::property<boost::edge_weight_t,double>>::type,boost::no_property,boost::listS>::config, Base=boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS,boost::vecS,boost::undirectedS,boost::property<vmap_id_t,int,boost::property<boost::vertex_color_t,RGBColor,boost::property<vertex_feature_t,FeatureVector2D<double> *>>>,boost::property<boost::edge_weight_t,double>>,boost::vecS,boost::vecS,boost::undirectedS,boost::detail::retag_property_list<boost::vertex_bundle_t,boost::property<vmap_id_t,int,boost::property<boost::vertex_color_t,RGBColor,boost::property<vertex_feature_t,FeatureVector2D<double> *>>>>::type,boost::detail::retag_property_list<boost::edge_bundle_t,boost::property<boost::edge_weight_t,double>>::type,boost::no_property,boost::listS>::DirectedHelper ] and even like this: C:\Program Files\boost\boost_1_35_0\boost\pending\container_traits.hpp(150): error C2065: 'list' : undeclared identifier I think that I have all the standard headers included. Where mush I have been wrong? Thanks _________________________________________________________________ MSN资讯快递，帮助你第一时间了解最新资讯！ http://im.live.cn/newsexpress

2 1

Linking boost in iphone application
by Gustavo Garcia Bernardo 08 Feb '09

08 Feb '09

Hi, After building boost for the iphone following these instructions http://lists.boost.org/boost-users/2008/11/42094.php , I have a problem using it in my iphone application. If I link any part of boost with the application it crashes at startup. I don't have any problem linking other C++ library. Has anybody else faced the same problem? How to reproduce it: 1. Create a objective-c class in the application (Test.h, Test.mm) 2. Include "#import <boost/system/error_code.hpp>" in the Test.mm file. 3. Link libboost_system-xgcc40-mt_1.37.a Thank you very much for any clue, G.

1 0

string iterator not dereferencable
by Alessandro Condotta 07 Feb '09

07 Feb '09

Hi all, I am newbie and I am developing in C++ using VC9, Boost 1.37, CPLEX 11.1. I use date_time and program_options boost libraries and my program compiles fine. Date_time works perfectly while program_options gives me a runtime error saying "Debug assertion failed .... string iterator not dereferencable" every time I pass any argument in the command line. The assertion fails at line 112 of "C:\program files\microsoft visual studio 9.0\vc\include\xstring" So I try to figure out what was going on in the following way: - I tried "first.cpp" in program option example directory on a new project: it works with no problem. -Then I tried to replace the main function of my project with the exact code of "first.ccp" and I got "string iterator not dereferencable" again. Can anyone help me ? Many thanks in advance Alessandro

4 4

[thread_pool|range_ex|bind] Extrange behaviour with fibonacci example and parallel_sort
by vicente.botet 07 Feb '09

07 Feb '09

Hi, I have tried to do a parallel_sort using the Boost.ThreadPool library and I get some realy extrange. I have copied the fibonacci example and adapted it to do a parallel sort. See attached file. When I set the defines FIBO this works some times, don't finish others and crash the others. I have added some traces (define COUT) and I get better results but not always correct. I suspected that the threads in the thread pool needs to be stoped. I have added a pool shutdown but nothing changes. Oliver, could you take a look? When I define X_SORT the compilation even do not finish. What is wrong on my definition of parallel_sort? Am I using boost:bind incorrectly? Is there some issue with binding function templates? Can some one help me? Thanks in advance, Vicente P.S. I'm using Boost 1.37 + The file compiles only with the lates version of the Boost.Range library http://www.boostpro.com/vault/index.php?action=downloadfile&filename=range_… and the Boost.ThreadPool version 17 http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost-… $ gcc --version gcc (GCC) 3.4.4 (cygming special, gdc 0.12, using dmd 0.125) Copyright (C) 2004 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. Debug session $ gdb x_sort2 GNU gdb 6.8.0.20080328-cvs (cygwin-special) Copyright (C) 2008 Free Software Foundation, Inc. License GPLv3+: GNU GPL version 3 or later <http://gnu.org/licenses/gpl.html> This is free software: you are free to change and redistribute it. There is NO WARRANTY, to the extent permitted by law. Type "show copying" and "show warranty" for details. This GDB was configured as "i686-pc-cygwin"... (gdb) help List of classes of commands: aliases -- Aliases of other commands breakpoints -- Making program stop at certain points data -- Examining data files -- Specifying and examining files internals -- Maintenance commands obscure -- Obscure features running -- Running the program stack -- Examining the stack status -- Status inquiries support -- Support facilities tracepoints -- Tracing of program execution without stopping the program user-defined -- User-defined commands Type "help" followed by a class name for a list of commands in that class. Type "help all" for the list of all commands. Type "help" followed by command name for full documentation. Type "apropos word" to search for commands related to "word". Command name abbreviations are allowed if unambiguous. (gdb) run Starting program: /home/Vicente/SVN/bin.v2/vbe_interthreads/libs/interthreads/te st/x_sort2.test/gcc-3.4.4/debug/link-static/threading-multi/x_sort2.exe [New thread 3056.0x128] [New thread 3056.0x68c] std::sort: reverse 0..100000 0.05 s [New thread 3056.0xfe4] [New thread 3056.0x1c8] 55 Program exited normally. (gdb) run Starting program: /home/Vicente/SVN/bin.v2/vbe_interthreads/libs/interthreads/te st/x_sort2.test/gcc-3.4.4/debug/link-static/threading-multi/x_sort2.exe [New thread 4028.0xd48] [New thread 4028.0xef4] std::sort: reverse 0..100000 0.03 s [New thread 4028.0x9ec] [New thread 4028.0x5bc] [New thread 4028.0x3bc] [Switching to thread 4028.0x3bc] Quit (gdb) run The program being debugged has been started already. Start it from the beginning? (y or n) y Starting program: /home/Vicente/SVN/bin.v2/vbe_interthreads/libs/interthreads/te st/x_sort2.test/gcc-3.4.4/debug/link-static/threading-multi/x_sort2.exe [New thread 2220.0x4dc] [New thread 2220.0xe58] std::sort: reverse 0..100000 0.05 s [New thread 2220.0x9b0] [New thread 2220.0x778] [New thread 2220.0x264] Program received signal SIGINT, Interrupt. [Switching to thread 2220.0x264] 0x7c87635d in KERNEL32!GetConsoleCharType (Quit (gdb) run The program being debugged has been started already. Start it from the beginning? (y or n) y Starting program: /home/Vicente/SVN/bin.v2/vbe_interthreads/libs/interthreads/te st/x_sort2.test/gcc-3.4.4/debug/link-static/threading-multi/x_sort2.exe [New thread 3964.0xf40] [New thread 3964.0xedc] std::sort: reverse 0..100000 0.05 s [New thread 3964.0x320] [New thread 3964.0xe44] [New thread 3964.0x544] [Switching to thread 3964.0x544] Quit (gdb) q The program is running. Exit anyway? (y or n) y Vicente@viboes1 ~/SVN/bin.v2/vbe_interthreads/libs/interthreads/test/x_sort2.tes t/gcc-3.4.4/debug/link-static/threading-multi $ gdb x_sort2 GNU gdb 6.8.0.20080328-cvs (cygwin-special) Copyright (C) 2008 Free Software Foundation, Inc. License GPLv3+: GNU GPL version 3 or later <http://gnu.org/licenses/gpl.html> This is free software: you are free to change and redistribute it. There is NO WARRANTY, to the extent permitted by law. Type "show copying" and "show warranty" for details. This GDB was configured as "i686-pc-cygwin"... (gdb) run Starting program: /home/Vicente/SVN/bin.v2/vbe_interthreads/libs/interthreads/te st/x_sort2.test/gcc-3.4.4/debug/link-static/threading-multi/x_sort2.exe [New thread 1076.0x31c] [New thread 1076.0x9b8] std::sort: reverse 0..100000 0.05 s [New thread 1076.0xaec] [New thread 1076.0xdc0] 19239 [unknown (0xDC0)] x_sort2 1076 _cygtls::handle_exceptions: Exception: ST ATUS_ACCESS_VIOLATION 59227 [unknown (0xDC0)] x_sort2 1076 open_stackdumpfile: Dumping stack trace t o x_sort2.exe.stackdump Program received signal SIGSEGV, Segmentation fault. [Switching to thread 1076.0xdc0] 0x610b6132 in pthread_cond::~pthread_cond () from /usr/bin/cygwin1.dll (gdb) run The program being debugged has been started already. Start it from the beginning? (y or n) y Starting program: /home/Vicente/SVN/bin.v2/vbe_interthreads/libs/interthreads/te st/x_sort2.test/gcc-3.4.4/debug/link-static/threading-multi/x_sort2.exe [New thread 1876.0x8dc] [New thread 1876.0x938] std::sort: reverse 0..100000 0.05 s [New thread 1876.0x624] [New thread 1876.0xe28] 55 Program exited normally. (gdb) run Starting program: /home/Vicente/SVN/bin.v2/vbe_interthreads/libs/interthreads/te st/x_sort2.test/gcc-3.4.4/debug/link-static/threading-multi/x_sort2.exe [New thread 3240.0xef8] [New thread 3240.0xfb8] std::sort: reverse 0..100000 0.05 s [New thread 3240.0x5d4] [New thread 3240.0xe04] [New thread 3240.0x884] [Switching to thread 3240.0x884] Quit (gdb) q The program is running. Exit anyway? (y or n) y

1 0

Re: [Boost-users] Welcome to the "Boost-users" mailing list
by liulewes 07 Feb '09

07 Feb '09

Dear there: I recently started to use the boost graph library and I got the following problem. I'v 2 projects A and B in my vc 7.1 solution. A uses boost graph lib while B is dependent on A. I'v no problem compiling A but got some errors in B like this: C:\Program Files\boost\boost_1_35_0\boost\graph\detail\adjacency_list.hpp(2292): error C2039: 'size_type' : is not a member of 'boost::vec_adj_list_impl<Graph,Config,Base>' with [ Graph=boost::adjacency_list<boost::vecS,boost::vecS,boost::undirectedS,boost::property<vmap_id_t,int,boost::property<boost::vertex_color_t,RGBColor,boost::property<vertex_feature_t,FeatureVector2D<double> *>>>,boost::property<boost::edge_weight_t,double>>, Config=boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS,boost::vecS,boost::undirectedS,boost::property<vmap_id_t,int,boost::property<boost::vertex_color_t,RGBColor,boost::property<vertex_feature_t,FeatureVector2D<double> *>>>,boost::property<boost::edge_weight_t,double>>,boost::vecS,boost::vecS,boost::undirectedS,boost::detail::retag_property_list<boost::vertex_bundle_t,boost::property<vmap_id_t,int,boost::property<boost::vertex_color_t,RGBColor,boost::property<vertex_feature_t,FeatureVector2D<double> *>>>>::type,boost::detail::retag_property_list<boost::edge_bundle_t,boost::property<boost::edge_weight_t,double>>::type,boost::no_property,boost::listS>::config, Base=boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS,boost::vecS,boost::undirectedS,boost::property<vmap_id_t,int,boost::property<boost::vertex_color_t,RGBColor,boost::property<vertex_feature_t,FeatureVector2D<double> *>>>,boost::property<boost::edge_weight_t,double>>,boost::vecS,boost::vecS,boost::undirectedS,boost::detail::retag_property_list<boost::vertex_bundle_t,boost::property<vmap_id_t,int,boost::property<boost::vertex_color_t,RGBColor,boost::property<vertex_feature_t,FeatureVector2D<double> *>>>>::type,boost::detail::retag_property_list<boost::edge_bundle_t,boost::property<boost::edge_weight_t,double>>::type,boost::no_property,boost::listS>::DirectedHelper ] and even like this: C:\Program Files\boost\boost_1_35_0\boost\pending\container_traits.hpp(150): error C2065: 'list' : undeclared identifier I think that I have all the standard headers included. Where mush I have been wrong? Thanks. _________________________________________________________________ MSN热搜榜，每天最In的信息资讯和热点排行让您一览无余！ http://top.msn.com.cn

2 1

[date_time] Timer anomolies on Windows
by Rush Manbert 07 Feb '09

07 Feb '09

I am trying to implement an accurate cross-platform timer with microsecond resolution. I would like to use the Boost date_time library to replace our current platform-specific code. One reason to do this is because we currently use the Code Audio framework timing services on the Mac and we would like to get away from that. In general, we want to statically link our executables. The current implementation uses the Core Audio framework on the Mac and the QueryPerformanceCounter() API on Windows. Our experience with the Windows code is that it doesn't perform well when measuring any interval less that about 500 msec. I have written a number of tests that get the number of performance counter ticks over various intervals. One test uses the GetTickCount() millisecond timer to measure the intervals. Another test just uses a for loop that increments a variable, because I was suspicious that the millisecond timer was jittery. I have found that the QueryPerformanceCounter() results are unreliable. One test ran tests of durations from 100 msec to 2000 msec and calculated the error between the number of ticks reported and the counter frequence returned by the API QueryPerformanceFrequency call. After getting that result, I wrote the same test that counts boost::posix_time::microsec_clock::local_time() ticks against the millisecond clock. I was initially surprised to see that the error between the counts reported by the API calls and the 1 megahertz expected frequency are nearly identical to the errors I calculated for QueryPerformanceCounter(). This led me to believe that the date_time microsec_clock implementation must be using the QueryPerformanceCounter interface. I have searched the sources, however, and I don't find anything that is Windows-specific. One other odd thing that my tests reveal. If I run a test that times its duration using the GetTickCount() millisecond timer, and calls either QueryPerformanceCounter() or uses microsec_clock to get the number of ticks seen during the interval I find that the values returned by QueryPerformanceCounter() are different for each test duration, as one would expect. Conversely, the tick counts calculated for microsec_clock are identical (with the value 15625) for 1 msec through 16msec. Then at 17 msec test duration, the tick count jumps to 31250. The same count gets reported through durations of 31 msec. At 32 msec the count jumps to 46875 and remains there through a test duration of 47 msec... This looks like the Boost microsec_clock tick count is only updating at 60 Hz. Obviously, I am very bewildered by these results. I would really appreciate it if anyone can enlighten me on the following: 1) On Windows, what API is actually being used to read the clock ticks? 2) Where is the platform-specific code that date_time uses to actually read the counters? 3) Is there really a 60 Hz update to the microsec_clock count value? Here is an example of one of my tests. This one is for the QueryPerformanceCounter() API. The Boost microsec_clock test is nearly identical: int WindowsPerformanceTimerResolutionSubTest (unsigned int testDurationInMillisecs) { LARGE_INTEGER startHighRes; LARGE_INTEGER endHighRes; DWORD start; if (0 == testDurationInMillisecs) { testDurationInMillisecs = 1; } // Sync to clock edge using GetTickCount() windowsSyncToClockEdgeOneMillisecond (); // Get our start time for the performance clock, and the millisecond clock QueryPerformanceCounter (&startHighRes); start = GetTickCount(); // Wait for the required duration while ((GetTickCount() - start) < testDurationInMillisecs) { // Nothing to do } //Get the microsec time at end of test QueryPerformanceCounter (&endHighRes); // Difference divided by number of seconds is ticks per second uint64_t diffTicks = endHighRes.QuadPart - startHighRes.QuadPart; return diffTicks; } Thanks, Rush

1 0

[intrusive] first impression and constant-time removal
by Erik Cassel 07 Feb '09

07 Feb '09

Hello, I like the intrusive library. I'm refactoring my code to use it in many places. One of the benefits of boost::intrusive is the constant-time removal of items from a collection. The documentation doesn't tell you how to remove an element from a list in constant time, so I looked through the API. At first, "remove" looked like a good idea, but this function removes all instances that match a given value - so it is O(n). The unwary programmer will inadvertently use this function, not realizing the huge waste of CPU time. >From what I can tell, the way to remove an element in constant time is this: if (element.is_linked()) list.remove(list.iterator_to(element)); It requires 3 function calls. How about adding the something like the following function to list? void remove_member(reference value) It might follow the same pattern as std::set's erase, which returns the erasure count (0 or 1) as a size_t. Summary: 1) I found the remove() function's name ambiguous. It isn't clear that the complexity is linear time - that it compares elements to a value rather than taking a reference to an actual element. The only hint is the const_reference (rather than a reference) argument. Would "remove_all_matches" would be a better name? 2) Removing an element from a list requires 3 function calls. Wouldn't an std::set-style erase(reference) be a good addition to the API? It could be called "remove_member" or simply "erase". 3) If nothing else, it might be wise to have a small section in the documentation that demonstrates constant-time element removal and warns against improper use of "remove". -Erik

3 7

Compilation problem with 1.37.0 on OS X
by Stephen Blinkhorn 07 Feb '09

07 Feb '09

Hello Boost people, I have problems compiling a project after upgrading to Boost 1.37.0 from an earlier version, dating back to July 08 ish. This is on Mac OS X 10.5.6, XCode 3.1 etc. Swapping back to my older Boost install resolves all problems. Errors: Precompiling /Developer/SDKs/MacOSX10.5.sdk/System/Library/Frameworks/ AppKit.framework/Headers/AppKit.h powerpc-apple-darwin9-gcc-4.0.1: installation problem, cannot exec '/ Developer/usr/bin/../libexec/gcc/powerpc-apple-darwin9/4.0.1/cc1obj': Argument list too long I don't understand why this causes problems, happens on two different machines after reinstalling GCC etc. Curious. Stephen

2 1

Problem with Iterator passing inside an index... a little complex...
by Rodrigo Dias Ferreira 06 Feb '09

06 Feb '09

Hi There, I am using the Boost.MultiIndex and I am facing a problem that I am try to resolving (debbuging) already about 20 hours... I think I get the problem isolated, but I don't know how to solve, and I don't know if this it is implemented. So I decided to make a example, it is a little big, but I put it as resumed as I could and post here in order to know if anyone could help me out. I will try to explain briefly here, I will copy the main() code right under the explanation, but the whole code of the example is in the end of the e-mail (with the classes and functions) If you want you could try to run too see what is the problem that I am talking about.) When I try to access an pair of iterators pair<propIt,propIt> that I stored inside a class (propertystream_h), somehow is changing to where the iterator points, I think it could be because the object which has originate (Graph) the index is created, stored in in a static index (which I call _graphRep) from the DynamicGraphs, passed to a handler (Graph_h), and then after the Graph goes out of scope it is destroyed. When the Graph_h._localGraph (copy of the iterator->Graph returned by the insertion in the _graphRep) access its member _globalProperties (which is an index containing the fields: {string _key, string _value, propertystream_h _props} from the struct globalPropSchema) through a iterator (let's call it: gpit), then it is fine. But then when I try to access through the gpit->_props._propRangeIt.first, the iterator of the propertystream_h (_propRangeIt.first), then the iterators, some how are messed up. ( -> in this example it points to last element, and then when I get next, never finds the end(). (sometimes it return some trash, sometimes I get segmentation fault). So I would like to know why it is messing with the iterator? And how could I solve this problem? that's it, best regards, Rodrigo P.S.: I hope someone can help me... copy of the main(): int main(){ DynamicGraphs dg; Graph_h graph_h; propertystream_h propS; property_h prop_h; GlobalPropIterator gpit; GlobalProp_h gp_h; propertystream_h ps_h; property_h p_h; graph_h = dg.createGraph("COI:0351-123-4555"); if (!graph_h) cout << "Unsuccessful creation!"<<endl; else cout << "Successful creation!" <<endl; //It works, because it takes from the _localPropRep, and it passes it as value!!! ps_h = graph_h->lookupLocalProp("name"); while(!ps_h.end()){ cout << "LocalProperties: "; p_h=ps_h.next(); cout << "Key: " << p_h.key() << " Value: " << p_h.value() <<endl; } // It does not work, because is accessing the propertystream_h from // the _globalPropRep (index of the tuple // {string globalkey, string value, propertystream_h props} // the propertystream_h it has as member a pair of iterators for another index. // -> after a lot of debugging (about 16h) OI found out that // it seems that during the creation of a graph, // when it passes the graph to graph_h, and goes out of scope, it keep the // iterator reference to the first element, but just that... the next // gives me segmentation fault. Anyone knows how to pass the graph and the its members // the indexes-repositories as value, so it would not depend on the pointing to // the graph that was freed from the memory? gpit = graph_h->properties("*"); if (!gpit) cout << "Not found any property in the globalProperties Repository."<<endl; else{ int i=0; while (!gpit.end()) { gp_h = gpit.next(); cout << "While_1::Iteration_" << ++i << endl; cout << "GlobalProperty key: " << gp_h.key() << endl; cout << "GlobalProperty value: " << gp_h.value() << endl; ps_h = gp_h.propertyStreamHandler(); int j = 0; while (!ps_h.end()){ p_h = ps_h.next(); cout << "While_2::Iteration" << ++j << endl; cout << "GlobalProperty::PropertyStream: key " << p_h.key() << endl; cout << "GlobalProperty::PropertyStream: value " << p_h.value() << endl; } } } } Here it is the code: /* * IndexProblem.cpp * * Created on: Feb 6, 2009 * Author: rodrigo */ #include <boost/multi_index_container.hpp> #include <boost/multi_index/hashed_index.hpp> #include <boost/multi_index/member.hpp> #include <boost/multi_index/ordered_index.hpp> #include <boost/multi_index/composite_key.hpp> #include <boost/tuple/tuple.hpp> #include <boost/tokenizer.hpp> #include <boost/lambda/lambda.hpp> #include <climits> #include <iomanip> #include <iostream> #include <ctime> #include <string> #if !defined(NDEBUG) #define BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING #define BOOST_MULTI_INDEX_ENABLE_SAFE_MODE #endif using std::string; using std::pair; using std::ostream; using std::cout; using std::endl; using boost::multi_index_container; using namespace boost::multi_index; struct property { string _key; string _value; /// Default Constructor property(){} /// Constructor with parameters: initialize the name and graph property(string key, string value) : _key(key), _value(value) {} /// Copy Contructor property(const property &pm) : _key(pm._key), _value(pm._value) {} //For debugging TODO: delete later friend ostream& operator<<(ostream& os, const property &p){ os << "Key: " << p._key << " value: " << p._value << endl; return os; } }; /// Indexing in the data structure PropMap typedef multi_index_container< property, indexed_by< hashed_non_unique< BOOST_MULTI_INDEX_MEMBER(property, string, _key) > > > propIndex; typedef propIndex::iterator propIt; class property_h { private: /// Access to properties through the iterator propIt _pit; public: /// Default Constructor property_h(){} /// Constructor with Parameters: for lookup of Nodes property_h (const propIt &it) : _pit(it){} /// Constructor with Parameters: for lookup of Nodes property_h (const property_h &h) : _pit(h._pit){} /// Returns the key from the property being handled string key() const {return _pit->_key;} /// Returns the value from the property being handled string value() const {return _pit->_value;} }; class propertystream_h { /// _propRangeIt: for keeping a range in order to iterate over the graphs pair<propIt,propIt> _propRangeIt; /// _noMatches: true if there are no matches during the lookup function bool _noMatches; public: /// Default Constructor propertystream_h() : _noMatches(true){} /// Constructor with parameters for local lookup propertystream_h(pair<propIt,propIt> rangeIt, bool noMatches) : _propRangeIt(rangeIt), _noMatches(noMatches){ } /// Default Constructor propertystream_h(const propertystream_h &ps) : _propRangeIt(ps._propRangeIt), _noMatches(ps._noMatches){} // returns null_h on end of stream ... property_h next(){ return property_h(_propRangeIt.first++); } /// This function returns true whenever is the end of the stream bool end(){ return (_propRangeIt.first == _propRangeIt.second); } /// Overload operator!: shows if a creation was unsuccessful bool operator!(){ return _noMatches; } }; struct globalPropSchema{ string _key; string _value; propertystream_h _props; /// Default Constructor globalPropSchema() : _key(""), _value(""), _props(){} /// Parameter Constructor globalPropSchema(string k, string value, propertystream_h props) : _key(k), _value(value), _props(props){} /// Copy Constructor globalPropSchema(const globalPropSchema &gps) : _key(gps._key), _value(gps._value), _props(gps._props){} //TODO: Delete it: Debug friend ostream& operator<<(ostream &os, const globalPropSchema &gps){ os << "Key: " << gps._key << " Value: "<< gps._value << " PropertyStreamAdress: " << &gps._props <<endl; return os; } }; typedef multi_index_container< globalPropSchema, indexed_by< ordered_non_unique< composite_key< globalPropSchema, BOOST_MULTI_INDEX_MEMBER(globalPropSchema, string, _key), BOOST_MULTI_INDEX_MEMBER(globalPropSchema, string, _value) >, composite_key_compare< std::greater<string>, std::less<string> > > > > grobalProperties; /// Iterator for the data structure of the global properties index typedef grobalProperties::iterator globalPropIt; class GlobalProp_h{ private: /// Access to globalPropertiest items through the iterator globalPropIt _gpit; public: /// Default Constructor GlobalProp_h(){} /// Constructor with Parameters: for lookup of Nodes GlobalProp_h (const globalPropIt &it) : _gpit(it){} /// Copy Constructor GlobalProp_h (const GlobalProp_h &gph) : _gpit(gph._gpit){} /// Access to key of globalPropeties items string key(){ return _gpit->_key;} /// Access to value of globalPropeties items string value(){return _gpit->_value;} propertystream_h propertyStreamHandler(){ return _gpit->_props; } }; /// Iterator for the data structure of the global properties index typedef grobalProperties::iterator globalPropIt; class GlobalPropIterator{ private: /// _propRangeIt: for keeping a range in order to iterate over the graphs pair<globalPropIt,globalPropIt> _globalPropRangeIt; /// _noMatches: true if there are no matches during the lookup function bool _noMatches; public: /// Default Constructor GlobalPropIterator(){} /// Constructor with parameters for local lookup GlobalPropIterator(pair<globalPropIt,globalPropIt> rangeIt, bool noMatches) : _globalPropRangeIt(rangeIt), _noMatches(noMatches){} /// Default Constructor GlobalPropIterator(const GlobalPropIterator &gpi) : _globalPropRangeIt(gpi._globalPropRangeIt), _noMatches(gpi._noMatches){} // returns null_h on end of stream ... GlobalProp_h next(){ return GlobalProp_h(_globalPropRangeIt.first++); } /// This function returns true whenever is the end of the stream bool end(){ return (_globalPropRangeIt.first == _globalPropRangeIt.second); } /// Overload operator!: shows if a creation was unsuccessful bool operator!(){ return _noMatches; } }; class Graph { private: propIndex _localPropRep; /// Repository for the properties of the global properties related to the graph; grobalProperties _globalPropRep; public: // TODO: Really constructors /// Default Constructor Graph() {} /// Copy constructors Graph(const Graph &g) : _localPropRep(g._localPropRep), _globalPropRep(g._globalPropRep){} bool addProperty(string key, string value); GlobalPropIterator properties(string pattern) const; /// Function to lookup Local Properties propertystream_h lookupLocalProp(string pattern); friend class Graph_h; }; /// GraphMap: Data Structure for setting an index in the uniqueGraphName and retrieving handler Graph_h struct graphMap { string _name; Graph _graph; /// Default Constructor graphMap(){} /// Constructor with parameters: initialize the name and graph graphMap(string uniqueGraphName, Graph graph) : _name(uniqueGraphName), _graph (graph) {} /// Constructor with parameters: initialize the name and graph graphMap(const graphMap &gm) : _name(gm._name), _graph (gm._graph) {} }; ///ordered_unique Index in the data structure graph_hm typedef multi_index_container< graphMap, indexed_by< ordered_unique< BOOST_MULTI_INDEX_MEMBER(graphMap,string,_name) > > > graphIndex; /// Defing an iterator for the graphMapIndex typedef graphIndex::iterator graphIt; class Graph_h { private: /// \brief GraphIterator: Iterator pointing to the Graph graphIt _git; Graph _localGraph; bool _createSuccess; public: /// Default Constructor Graph_h() : _createSuccess(false) {} /// Constructor with Parameters: for creation of Graphs Graph_h ( pair<graphIt,bool> creation) : _git(creation.first), _createSuccess(creation.second){ _localGraph = creation.first->_graph; } /// Constructor with Parameters: for lookup of Graphs Graph_h (const graphIt &it) : _git(it), _createSuccess(false){ _localGraph = it->_graph; } /// Constructor with Parameters: for lookup of Graphs Graph_h (const Graph_h &h) : _git(h._git), _localGraph(h._localGraph), _createSuccess(h._createSuccess){} bool operator!(){ return !_createSuccess; } /// Operator-> overloading: allows access to graph members Graph* operator->() {return &_localGraph;} }; propertystream_h Graph::lookupLocalProp(string pattern){ pair<propIt,propIt> rangeIt; propIt rangeItfirst = _localPropRep.find(pattern); rangeIt.first = rangeItfirst; rangeIt.second = _localPropRep.end(); if (rangeIt.first != _localPropRep.end()) // second parameter means that the variable noMatches, so false in case that found the key return propertystream_h(rangeIt, false); else //No matches return propertystream_h(rangeIt, true); } GlobalPropIterator Graph::properties(string pattern) const{ pair<globalPropIt,globalPropIt> globalRangePropIt; bool noMatchesTmp=false; //Whole range if (!pattern.compare("*")){ globalRangePropIt.first = _globalPropRep.begin(); globalRangePropIt.second = _globalPropRep.end(); } if (globalRangePropIt.first == globalRangePropIt.second) noMatchesTmp = true; return GlobalPropIterator(globalRangePropIt, noMatchesTmp); } bool Graph::addProperty(string key, string value){ bool boolLocal, boolGlobal; pair <propIt,propIt> rangePropIt; string globalKey = "graph:"; globalKey.append(key); // "graph:namePorperty" boolLocal = _localPropRep.insert(property(key,value)).second; //Defining the whole range for iterate over the local properties rangePropIt.first = _localPropRep.begin(); rangePropIt.second = _localPropRep.end(); //Debug propIt it = rangePropIt.first; cout << "How it should be showed when accessing the iterator..."<<endl; while (rangePropIt.first != rangePropIt.second){ cout << "DEBUG@addProperty: " << *(rangePropIt.first++); } cout << endl; rangePropIt.first = it; //Debug boolGlobal = _globalPropRep.insert( globalPropSchema( globalKey, value, propertystream_h(rangePropIt, false) ) ).second; return (boolLocal && boolGlobal); } class DynamicGraphs { public: /// Data member to represent the graph repository (using ordered_unique index) static graphIndex _graphRep; Graph_h createGraph(string uniqueGraphName); }; graphIndex DynamicGraphs::_graphRep; /// Creation of Graph in DynamicGraphs Graph_h DynamicGraphs::createGraph(string uniqueGraphName){ Graph g; g.addProperty("name", uniqueGraphName); //Test g.addProperty("age", "Unknown"); g.addProperty("color", "blue"); return Graph_h( _graphRep.insert( graphMap( uniqueGraphName, g ) ) ); } int main(){ DynamicGraphs dg; Graph_h graph_h; propertystream_h propS; property_h prop_h; GlobalPropIterator gpit; GlobalProp_h gp_h; propertystream_h ps_h; property_h p_h; graph_h = dg.createGraph("COI:0351-123-4555"); if (!graph_h) cout << "Unsuccessful creation!"<<endl; else cout << "Successful creation!" <<endl; //It works, because it takes from the _localPropRep, and it passes it as value!!! ps_h = graph_h->lookupLocalProp("name"); while(!ps_h.end()){ cout << "LocalProperties: "; p_h=ps_h.next(); cout << "Key: " << p_h.key() << " Value: " << p_h.value() <<endl; } // It does not work, because is accessing the propertystream_h from // the _globalPropRep (index of the tuple // {string globalkey, string value, propertystream_h props} // the propertystream_h it has as member a pair of iterators for another index. // -> after a lot of debugging (about 16h) OI found out that // it seems that during the creation of a graph, // when it passes the graph to graph_h, and goes out of scope, it keep the // iterator reference to the first element, but just that... the next // gives me segmentation fault. Anyone knows how to pass the graph and the its members // the indexes-repositories as value, so it would not depend on the pointing to // the graph that was freed from the memory? gpit = graph_h->properties("*"); if (!gpit) cout << "Not found any property in the globalProperties Repository."<<endl; else{ int i=0; while (!gpit.end()) { gp_h = gpit.next(); cout << "While_1::Iteration_" << ++i << endl; cout << "GlobalProperty key: " << gp_h.key() << endl; cout << "GlobalProperty value: " << gp_h.value() << endl; ps_h = gp_h.propertyStreamHandler(); int j = 0; while (!ps_h.end()){ p_h = ps_h.next(); cout << "While_2::Iteration" << ++j << endl; cout << "GlobalProperty::PropertyStream: key " << p_h.key() << endl; cout << "GlobalProperty::PropertyStream: value " << p_h.value() << endl; } } } } -- ************************************************* Rodrigo Dias Ferreira Master Student of Computational Engineering Technische Universität Dresden - Germany Mobile Phone:+49 171 3158797 E-mail: rodrigodias(a)gmx.de ************************************************* Jetzt 1 Monat kostenlos! GMX FreeDSL - Telefonanschluss + DSL für nur 17,95 Euro/mtl.!* http://dsl.gmx.de/?ac=OM.AD.PD003K11308T4569a

2 1

boost::interprocess::managed_mapped_file and cross arch?
by Ben Martin 06 Feb '09

06 Feb '09

Hi, Has anyone got any tips on using boost::interprocess::managed_mapped_file with the managed_mapped_file::segment_manager allocators and the boost/interprocess/containers in a memory mapped file which can be used across x64 and arm platforms? As everything should be using offset pointers, I get the feeling that there should be some way to make this cross platform utopia happen but thought I'd ask before serious tinkering attempts.

2 1

std::back_inserter() with move semantics?
by Robert Dailey 06 Feb '09

06 Feb '09

Hi, I'm currently using std::back_inserter on a ptr_vector, and the values being inserted are boost::unique_ptr's. back_inserter does simple assignment but I need it to call boost::move() on the thing being assigned (inserted). Does boost have an algorithm that can do this?

1 1

boost::bind
by Hansi 06 Feb '09

06 Feb '09

Hello, I have a problem using boost::bind (version 1.34.1). I don't know whot I make wrong but I think that I can use it in my case. Or I'm wrong? I use VS2005. in some external header file I have the declaration typedef void (* FUNCTION)(int ,void *); void SetCallback(FUNCTION cb); Now I want to call a function inside my class. Maybe with bind? I have tested the following: SetCallback(boost::bind<void>(boost::mem_fn(&Program::OnCallback),this,_1,_2)); but this does not work..have anyone an hint how I can do that? Regards Hansjörg

3 3