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

[proto] Wrapper compile error
by David A. Greene 02 Feb '10

02 Feb '10

Eric, Here's a message I've owed you for a while. I mentioned a compile error with the ADL example for expression wrappers. I've attached a testcase. Uncommenting the commented bits and compiling with g++ results in an error message which leads me to believe that somewhere in the guts of proto there's an expectation that wrappers have one template argument. Usually this gets solved by using metafunction classes. Or, more likely, I'm just doing something wrong. :) -Dave

2 1

Help with custom classes PLEASE!!
by Daniel Veneros 02 Feb '10

02 Feb '10

Hi, I am trying to create a shared memory segment where I can share a STRING between 2 process, I tried using the following code: *In the "main" process:* #include <boost/interprocess/managed_shared_memory.hpp> #include <boost/interprocess/containers/vector.hpp> #include <boost/interprocess/allocators/allocator.hpp> #include <cstdlib> #include <string> #include <iostream> using namespace boost::interprocess; typedef allocator<std::string, managed_shared_memory::segment_manager> ShMemAllocator; typedef vector<std::string, ShMemAllocator> MyVector; int main(int argc, char** argv) { struct shm_remove { shm_remove() {shared_memory_object::remove("MySharedMemory"); } ~shm_remove() {shared_memory_object::remove("MySharedMemory"); } }remover; managed_shared_memory segment(create_only, "MySharedMemory", 65536); const ShMemAllocator alloc_inst(segment.get_segment_manager()); MyVector *myVector = segment.construct<MyVector>("MyVector" )(alloc_inst); myVector->push_back("a"); int stop; //this line helps me wait until i run the other process std::cin >> stop; return (EXIT_SUCCESS); } *at the "client" process:* #include <boost/interprocess/managed_shared_memory.hpp> #include <boost/interprocess/containers/vector.hpp> #include <boost/interprocess/allocators/allocator.hpp> #include <cstdlib> #include <string> #include <iostream> using namespace boost::interprocess; typedef allocator<std::string, managed_shared_memory::segment_manager> ShMemAllocator; typedef vector<std::string, ShMemAllocator> MyVector; int main(int argc, char** argv) { managed_shared_memory segment(open_only, "MySharedMemory"); MyVector *myVector = segment.find<MyVector>("MyVector").first; std::cout << "myVector size: " << myVector->at(0) << std::endl; return (EXIT_SUCCESS); } When I run both I receive an error "Segmentation Fault, Core Dumped"... Does anyone know how to solve this? Thanks Dann

2 5

Re: [Boost-users] generate structs with all combinations of members from a given struct
by Hicham Mouline 02 Feb '10

02 Feb '10

----- Original Message ----- From: Hicham Mouline To: boost-users(a)lists.boost.org Sent: Monday, February 01, 2010 12:09 PM Subject: Re: [Boost-users] generate structs with all combinations of members from a given struct My previous runtime solution was wrong. I just fixed it now. #include <iostream> #include <list> typedef std::list< std::list<size_t> > main_list_t; void combinations(main_list_t& m, const size_t* arr, size_t arrsize) { if (arrsize==0) return; const std::list<size_t> empty_list; std::list<size_t> l( m.empty()? empty_list: m.back() ); for (size_t s=0; s<arrsize; ++s) { l.push_back( arr[s] ); m.push_back(l); l.pop_back(); combinations(m, arr+s+1, arrsize-s-1); } } int main() { const size_t arr[] = { 1, 2, 3, 4, 5 }; const size_t arrsize = sizeof(arr)/sizeof(size_t); main_list_t mm; combinations(mm, arr, arrsize); std::cout<< "size="<< mm.size() <<std::endl; for (main_list_t::const_iterator i = mm.begin(); i!=mm.end(); ++i) { const std::list<size_t>& l = *i; for (std::list<size_t>::const_iterator ii = l.begin(); ii!=l.end(); ++ii) { std::cout<< *ii << '\t'; } std::cout<<std::endl; } }

3 4

More problems...
by Daniel Veneros 02 Feb '10

02 Feb '10

Sorry to bother with this questions... What I am trying to do is: Share MAP objects between several process, the map I need to share is something like this: map<string, Employee> myMap; String is the key and the value has to be a custom class or a struct... I tried this but I got lots of errors: struct Employee { std::string name; int age; }; managed_shared_memory segment(create_only, "MySharedMemory", 65536); typedef std::pair<boost::interprocess::basic_string, Employee> ValueType; typedef allocator<ValueType, managed_shared_memory::segment_manager> ShMemAllocator; typedef map<StrAllocator, EmpAllocator, NULL, ShMemAllocator> MyMap; ShMemAllocator alloc_inst (segment.get_segment_manager()); MyMap m*mymap = segment.construct<MyMap>("MyMap")(alloc_inst); //to insert just one value: Employee John; john.name = "Johnny"; john.age = 25; mymap->insert(std::pair<"Hello", john>(boost::interprocess::basic_string, Employee); Actually I don't know what other path should I take on this... Could anyone please help me fix this portion of code? Thank you very much. Dann

2 1

xlC 6.0 building math lib - Errors
by Radha 02 Feb '10

02 Feb '10

Hi Team, I am trying to compile boost math library using xlC version 6 on Aix 5.3. I get the following error: "./boost/fusion/sequence/intrinsic/begin.hpp", line 54.88: 1540-0408 (S) The base class "apply<const boost::fusion::tuple<double,double,double,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_> >" is declared but not defined. "./boost/fusion/container/vector/detail/vector_n.hpp", line 65.41: 1540-0700 (I) The previous message was produced while processing "struct boost::fusion::result_of::begin<const boost::fusion::tuple<double,double,double,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_> >". "./boost/fusion/sequence/intrinsic/at.hpp", line 58.26: 1540-0408 (S) The base class "apply<const boost::fusion::tuple<double,double,double,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_>,mpl_::int_<0> >" is declared but not defined. "./boost/fusion/sequence/intrinsic/at.hpp", line 63.15: 1540-0700 (I) The previous message was produced while processing "struct boost::fusion::result_of::at<const boost::fusion::tuple<double,double,double,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_>,mpl_::int_<0> >". "./boost/fusion/sequence/intrinsic/at.hpp", line 62.16: 1540-0700 (I) The previous message was produced while processing "struct boost::fusion::result_of::at_c<const boost::fusion::tuple<double,double,double,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_>,0>". "./boost/math/tools/roots.hpp", line 41.13: 1540-0700 (I) The previous message was produced while processing "boost::math::tools::detail::unpack_0<boost::fusion::tuple<double,double,double,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_>,double>(const tuple<double,double,double,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_> &, double &)". "./boost/math/tools/roots.hpp", line 45.6: 1540-0700 (I) The previous message was produced while processing "boost::math::tools::detail::handle_zero_derivative<boost::math::detail::cbrt_functor<double>,double>(cbrt_functor<double>, double &, const double &, double &, double &, double &, const double &, const double &)". "./boost/math/tools/roots.hpp", line 274.3: 1540-0700 (I) The previous message was produced while processing "boost::math::tools::halley_iterate<boost::math::detail::cbrt_functor<double>,double>(cbrt_functor<double>, double, double, double, int, uintmax_t &)". "./boost/math/tools/roots.hpp", line 418.10: 1540-0700 (I) The previous message was produced while processing "boost::math::tools::halley_iterate<boost::math::detail::cbrt_functor<double>,double>(cbrt_functor<double>, double, double, double, int)". "./boost/math/special_functions/cbrt.hpp", line 52.18: 1540-0700 (I) The previous message was produced while processing "boost::math::detail::cbrt_imp<double,boost::math::policies::policy<boost::math::policies::domain_error<1>,boost::math::policies::pole_error<1>,boost::math::policies::overflow_error<1>,boost::math::policies::evaluation_error<1>,boost::math::policies::rounding_error<1>,boost::math::policies::default_policy,boost::math::policies::default_policy,boost::math::policies::default_policy,boost::math::policies::default_policy,boost::math::polici...". "./boost/math/special_functions/cbrt.hpp", line 61.11: 1540-0700 (I) The previous message was produced while processing "boost::math::cbrt<double,boost::math::policies::policy<boost::math::policies::domain_error<1>,boost::math::policies::pole_error<1>,boost::math::policies::overflow_error<1>,boost::math::policies::evaluation_error<1>,boost::math::policies::rounding_error<1>,boost::math::policies::default_policy,boost::math::policies::default_policy,boost::math::policies::default_policy,boost::math::policies::default_policy,boost::math::policies::default_...". "libs/math/build/../src/tr1/c_policy.hpp", line 129.1: 1540-0700 (I) The previous message was produced while processing "c_policies::cbrt<double>(double)". "libs/math/build/../src/tr1/cbrt.cpp", line 16.11: 1540-0700 (I) The previous message was produced while processing "cbrt(double)". "./boost/math/tools/roots.hpp", line 42.9: 1540-0218 (S) The call does not match any parameter list for "std::tr1::get<0>". "./boost/fusion/tuple/tuple.hpp", line 82.5: 1540-1283 (I) "template <int N, class Tuple> boost::fusion::get(const Tuple &)" is not a viable candidate. "./boost/fusion/tuple/tuple.hpp", line 75.5: 1540-1283 (I) "template <int N, class Tuple> boost::fusion::get(Tuple &)" is not a viable candidate. "./boost/math/tools/roots.hpp", line 41.13: 1540-0700 (I) The previous message was produced while processing "boost::math::tools::detail::unpack_0<boost::fusion::tuple<double,double,double,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_>,double>(const tuple<double,double,double,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_> &, double &)". "./boost/math/tools/roots.hpp", line 45.6: 1540-0700 (I) The previous message was produced while processing "boost::math::tools::detail::handle_zero_derivative<boost::math::detail::cbrt_functor<double>,double>(cbrt_functor<double>, double &, const double &, double &, double &, double &, const double &, const double &)". "./boost/math/tools/roots.hpp", line 274.3: 1540-0700 (I) The previous message was produced while processing "boost::math::tools::halley_iterate<boost::math::detail::cbrt_functor<double>,double>(cbrt_functor<double>, double, double, double, int, uintmax_t &)". "./boost/math/tools/roots.hpp", line 418.10: 1540-0700 (I) The previous message was produced while processing "boost::math::tools::halley_iterate<boost::math::detail::cbrt_functor<double>,double>(cbrt_functor<double>, double, double, double, int)". "./boost/math/special_functions/cbrt.hpp", line 52.18: 1540-0700 (I) The previous message was produced while processing "boost::math::detail::cbrt_imp<double,boost::math::policies::policy<boost::math::policies::domain_error<1>,boost::math::policies::pole_error<1>,boost::math::policies::overflow_error<1>,boost::math::policies::evaluation_error<1>,boost::math::policies::rounding_error<1>,boost::math::policies::default_policy,boost::math::policies::default_policy,boost::math::policies::default_policy,boost::math::policies::default_policy,boost::math::polici...". "./boost/math/special_functions/cbrt.hpp", line 61.11: 1540-0700 (I) The previous message was produced while processing "boost::math::cbrt<double,boost::math::policies::policy<boost::math::policies::domain_error<1>,boost::math::policies::pole_error<1>,boost::math::policies::overflow_error<1>,boost::math::policies::evaluation_error<1>,boost::math::policies::rounding_error<1>,boost::math::policies::default_policy,boost::math::policies::default_policy,boost::math::policies::default_policy,boost::math::policies::default_policy,boost::math::policies::default_...". "libs/math/build/../src/tr1/c_policy.hpp", line 129.1: 1540-0700 (I) The previous message was produced while processing "c_policies::cbrt<double>(double)". "libs/math/build/../src/tr1/cbrt.cpp", line 16.11: 1540-0700 (I) The previous message was produced while processing "cbrt(double)". Is there any patch i need to apply? Any help would be much appreciated! All my search on this error didn't get me anywhere; if there is prior post on same topic and solution please let me know! Thanks, Radha

3 3

[proto] Manipulating _data
by David A. Greene 01 Feb '10

01 Feb '10

So I've had fun tinkering with my lambda-like language. I moved on to try to introduce scoping, but I'm having some trouble. I've attached a simplified example. Compiling as-is, the test outputs what I would expect. It seems like the LookupSymbol transform works brilliantly, so symbol lookup is a go. However, convincing the grammar to match an expression that invokes the AddScope transform seems more difficult. Commenting the #if clause results in an error about converting a Wrapper<...> to a shared_ptr<Base> which I can only guess means the grammar is not matching the proto expression. I've tried all sorts of different things. I don't think the UnaryPassThrough transform should be neccessary, but maybe it does't hurt either. With or without it, the error is the same. What am I missing here? Thanks! -Dave

3 2

boost::weak_ptr usage in multithreaded environments
by Virgil Palanciuc 01 Feb '10

01 Feb '10

Hello all, [long story short: I'd like to know whether a weak_ptr.lock() counts as a "shared pointer read" or as a "shared pointer write" ] I'm using boost shared pointers in an multi-threaded app. Basically, my app maintains a "forest" of "context trees" - i.e. I have a map from a "file name" to a "global context" that organizes the information for that file. The "global context" in the map is basically the root node of a tree of "local contexts" in that file. The tree is kept with boost:shared_ptr<> on the way down (father-son relations) and boost::weak_ptr<> on the way up (son->father pointers). I have added proper synchronization to the data structure... I think. I use reader/writer locks (only one writer allowed, but arbitrary number of readers) and I'm still getting sporadic crashes, especially when constructing a "global context" (root node) shared_ptr<> from a weak_ptr<> - using lock(). I am assuming in my app. that weak_ptr<>.lock() only requires a "read lock", not a "write lock".. is this true? I've checked out the page at http://www.boost.org/doc/libs/1_41_0/libs/smart_ptr/shared_ptr.htm#ThreadSa…, but there's nothing about weak_ptr there... Thanks, Virgil.

4 5

BoostCon 2010 preliminary program
by Hartmut Kaiser 01 Feb '10

01 Feb '10

Hey all, please find below a list of accepted submissions to BoostCon 2010. A tentative, fully scheduled program will be available soon. The keynote will be held by Maurice Herlihy. Maurice Herlihy is a computer scientist active in the field of multiprocessor synchronization. Herlihy has contributed to the design of concurrent algorithms, and in particular to the exposition and quantification of the properties and uses of hardware synchronization operations. He is currently (2009) a professor of computer science at Brown University and one of the leading visionaries in the field of transactional memory. Following up on this keynote we will have a full day sessions and panel discussion where we plan for 4 different groups to talk about their work on transactional memory (Mark Moir (Sun), Tatiana Shpeisman (Intel), Michael Wong (IBM), Vicente Botet (TBoost.STM)) In addition we have a high quality, distinctive, fully packed, and very diverse list of accepted talks: João P. R. Abecasis: Cross-platform development with Qt and Boost Ruediger Berlich: Distributed parametric optimization with the Geneva library Dean Michael Berris: Techniques in Flexible Header-Only C++ Network Library Implementations Michael Caisse: Using Spirit 2.1: Qi and Karma An Asio Based Flash XML Server Marshall Clow: A (proposed) MIME library for Boost Tony Van Eerd: The Basics of Lock-free Programming Joel Falcou and Jean-Thierry Lapresté: The Numerical Template Toolbox: BOOST'ed Generic Array Library for High Performance Computing Joachim Faulhaber: Boost.Alabaster (proposed): A Law Based Tester Barend Gehrels, Bruno Lalande and Mateusz Loskot: Generic Programming for Geometry Justin Gottschlich: TBoost.STM's Engine: An Efficient Software Transactional Memory Using Commit-Time Invalidatio Douglas Gregor: Clang: An Open-Source C++ Compiler Library C++ Tool-Builders Workshop Christophe Henry: Tutorial: The Meta State Machine Library V2 Ken Joyner: Revisiting Guidelines to Using Exceptions in C++ Hartmut Kaiser and Joel de Guzman: RAD Spirit Spirit History and Evolution Zachary Laine and Matt Calabrese: Instantiations Must Go! Stephan Lavavej: Data Structure Visualizers in Visual Studio 2010 Nevin Liber: Type Erasure Eric Niebler: Practical DSEL Design with Proto Roshan Naik: Logic Paradigm for C++ Stjepan Rajko: Patterns Library: a generic library for modeling, recognition, and synthesis of sequential patterns Gennadiy Rozental: Production use of Boost.Test David Sankel: Functional Programming in C++ Jeremy Siek: Generic Programming and the Boost Graph Library Robert Ramey: Is Boost Broken? Michael Wong: C++0x Update C++0x Concurrency We believe this program is reason enough to come to BoostCon this year (Aspen, CO, USA, May 10-14th)! For registration, accommodation, and more information please visit the conference website at http://www.boostcon.com. Please note the reduced early registration fee! Regards Hartmut Program Chair BoostCon 2010 --------------- Meet me at BoostCon www.boostcon.com

1 0

boost::random: get same number sequences 32/64 bit?
by Sebastian Mach 01 Feb '10

01 Feb '10

Hello list, today I found out that boost::random, at least the combination boost::mt19937 rng(<seed>); typedef boost::uniform_int<int> dist_t; dist_t dist (<min>, <max>); boost::variate_generator< boost::mt19937&, dist_t > rand_ (rng, dist); will give me different results depending on whether I use "g++ (Debian 4.3.2-1.1) 4.3.2" (with sizeof(long)=8) or "g++.exe (TDM-2 mingw32) 4.4.1" (with sizeof(long)=4). This testcase: ++ #include <boost/random.hpp> boost::mt19937 rng(1); typedef boost::uniform_int<int> dist_t; dist_t dist (0, 16); boost::variate_generator< boost::mt19937&, dist_t > rand_ (rng, dist); int main () { for (int i=0; i<6; ++i) { std::cout << rand_() << std::endl; } } -- will print 16 8 1 6 0 12 with the 64bit variant variant, but 7 16 12 15 0 2 with the 32bit variant. Is there a (preferably portable) way to ensure that they will be the same on all 32bit+ machines? Otherwise this would be a real stopper to use boost::random for me, and I'd have to go back to libcoyotl's Mersenne Twister, which gives consistent results, upon which I really depend. Sincerely Sebastian Mach phresnel(a)gmail.com

2 4

PP: how to use automatic recursion
by Hicham Mouline 01 Feb '10

01 Feb '10

Hello, I am trying to generate many types from 1 struct (for full background, please see thread "generate structs with all combinations of members from a given struct"), with the help of Boost.PP #include <boost/preprocessor/control/if.hpp> #include <boost/preprocessor/seq/size.hpp> #include <boost/preprocessor/seq/seq.hpp> #include <boost/preprocessor/seq/elem.hpp> #include <boost/preprocessor/arithmetic/sub.hpp> #include <boost/preprocessor/seq/pop_front.hpp> #include <boost/preprocessor/seq/push_back.hpp> #define STRUCTMEMBERS ((double,m1))((double,m2))((double,m3))((double,m4))((double,m5)) #define SEQ_LAST_ELEM(seq) \ BOOST_PP_SEQ_ELEM( BOOST_PP_SUB(BOOST_PP_SEQ_SIZE(seq), 1), seq) #define UPDATE_MAIN_SEQ(mainseq, globalseq)\ BOOST_PP_IF( BOOST_PP_SEQ_SIZE(mainseq),\ BOOST_PP_SEQ_PUSH_BACK(\ mainseq,\ ((SEQ_LAST_ELEM(mainseq))(BOOST_PP_SEQ_HEAD(globalseq)))\ ),\ ((BOOST_PP_SEQ_HEAD(globalseq)))\ ) #define COMBINATIONS(seq, combseq)\ BOOST_PP_IF( BOOST_PP_SEQ_SIZE(seq),\ COMBINATIONS( UPDATE_MAIN_SEQ(combseq,seq), BOOST_PP_SEQ_POP_FRONT(seq) ), \ combseq\ ) #define COMBOS COMBINATIONS(STRUCTMEMBERS, BOOST_PP_SEQ_NIL) COMBOS Reading PP docs, I just realized that the preprocessor disallows recursion ( the COMBINATIONS macro calls itself in my case), but I didn't understand the reentrancy topic page. How can I change the above code to make the recursive COMBINATIONS possible? regards,

3 2

[range_ex]"Practical" Status of boost::range, boost::range_ex, and associated algorithms
by Jesse Perla 01 Feb '10

01 Feb '10

Hi there, I am excited to start using ranges in user code with standard algorithms (mostly copy, transform, binary_searches). Is it safe for me to start using code with range/range_ex? Since the http://www.boostpro.com/vault/index.php?directory=Algorithms version hasn't been updated for a while, I was worried that there could be interface changes. I am perfectly willing to use a subset of algorithms that are expected to remain stable -Jesse

3 7

mix usage of boost.thread and pthread?
by Hua Su 01 Feb '10

01 Feb '10

Hi all, Is it OK to use both pthread and boost.thread in the same program under linux? E.g., there are two cases: 1. use pthread api to create/join/detach/cancel threads but use boost.thread's mutex/condition_variable etc. to do thread synchronization, and this_thread/sleep/get_id/thread_local_storage etc.. 2. use boost.thread api to create/join/detach/interrupt thread but use pthread api to do thread synchronization. I know boost.thread is a pthread api wrapper under linux, but I'm afraid of that the two cases above aren't safe if boost.thread uses some tricks I don't understand. Would you kindly give any hints? Thanks! Hua

5 9

[property_tree]problem with equal_range
by Ken Murphy 01 Feb '10

01 Feb '10

Hello all, I am getting an error while trying to compile the following program: #include "boost/property_tree/ptree.hpp" int main(int argc, char* argv[]) { boost::property_tree::ptree t; t.equal_range("KEY"); return 0; } Compiler output: 1>c:\hibbettlinux\src\boost-1.41.0\boost\property_tree\detail\ptree_impl 1>emen tation.hpp(448) : error C2039: 'base' : is not a member of 'boost::multi_index::detail::bidir_node_iterator<Node>' 1> with 1> [ 1> Node=boost::multi_index::detail::ordered_index_node<boost::multi_index::deta il::index_node_base<std::pair<const std::string,boost::property_tree::basic_ptree<std::string,std::string>>,std: :allocator<std::pair<const std::string,boost::property_tree::basic_ptree<std::string,std::string>>>>> 1> ] 1> c:\hibbettlinux\src\boost-1.41.0\boost\property_tree\detail\ptree_implementa tion.hpp(444) : while compiling class template member function 'std::pair<_Ty1,_Ty2> boost::property_tree::basic_ptree<Key,Data>::equal_range(const std::basic_string<_Elem,_Traits,_Ax> &)' 1> with 1> [ 1> _Ty1=boost::property_tree::basic_ptree<std::string,std::string>::assoc_itera tor, 1> _Ty2=boost::property_tree::basic_ptree<std::string,std::string>::assoc_itera tor, 1> Key=std::string, 1> Data=std::string, 1> _Elem=char, 1> _Traits=std::char_traits<char>, 1> _Ax=std::allocator<char> 1> ] 1> c:\hibbettlinux\src\platform\vc80\test\test.cpp(9) : see 1> reference to class template instantiation 'boost::property_tree::basic_ptree<Key,Data>' being compiled 1> with 1> [ 1> Key=std::string, 1> Data=std::string 1> ] 1>c:\hibbettlinux\src\boost-1.41.0\boost\property_tree\detail\ptree_impl 1>emen tation.hpp(449) : error C2039: 'base' : is not a member of 'boost::multi_index::detail::bidir_node_iterator<Node>' 1> with 1> [ 1> Node=boost::multi_index::detail::ordered_index_node<boost::multi_index::deta il::index_node_base<std::pair<const std::string,boost::property_tree::basic_ptree<std::string,std::string>>,std: :allocator<std::pair<const std::string,boost::property_tree::basic_ptree<std::string,std::string>>>>> 1> ] I am using boost 1.41 with VC 7.1 Any help is appreciated!!!!!! Ken Murphy

3 3

Re: [Boost-users] [boost.asio] Flush serial port buffers?
by Pascal Kesseli 01 Feb '10

01 Feb '10

No ideas on this one? > Hi everyone > > My program currently writes some characters to a > device connected over the serial interface and > subsequently changes the baud rate, followed by > sending some more characters. > > The problem is that the first transfer does not > seem to complete before the baud rate switch and > thus is sent with the new baud rate, which is not > supposed to happen. What I am looking for is > something like a flush() before changing the baud > rate. Using: > > boost::asio::write(*port, buffer(buf, size), transfer_all()); > > does not seem to work. Any suggestions? > > Thanks and best regards > Pascal

2 1

Mingw: build, install, .LIB files and boost-config?
by John Pye 01 Feb '10

01 Feb '10

Hi all While I'm aware that MinGW is not one of the 'primary' platforms for MinGW, I wanted to ask a few questions to help me in the task of building a binary copy of Boost for this platform that's as good as it can be. Firstly, what would be the correct build commands to build Boost for MinGW such that I end up with both shared libraries and static libraries? What I've worked out so far is shown here: http://ascendwiki.cheme.cmu.edu/Binary_installer_for_Boost_on_MinGW Secondly, to install Boost at an arbitrary path under MinGW, what is the correct BJAM command? On MinGW, I'm not running ./configure, so the suggestions from the Unix build documentation don't make sense. By default under MinGW, if I run "bjam install", my files end up in c:\Boost but I'd like too have another target directory, so that it's possible to build even without write privileges to that folder. Is there such a thing as "bjam --install-prefix=c:/MinGW install"? Is there a way to strip out all the redundant folder levels like "release" and "gcc-mingw-3.4.5" etc? Third, using BJAM on MinGW results in .LIB files being generated. These .LIB files are NOT correctly names for use with MinGW. As far as I can tell, I have to rename them as .A files, or else do something else with them so that they'll correctly be detected by the the GCC "-l" linker flag. Finally, there was a bit of discussion on the mailing list about a year ago about providing a "boost-config" script. With the ever-changing naming conventions for Boost libs, and the possible presence of static libraries, shared libraries, -mt, -d, and other file suffixes, such a script would be INVALUABLE for people looking to access pre-built Boost binaries for their projects. It would be an almost trivial task to implement such a script -- has there been any progress on this anywhere? Can I suggest that for MinGW, a native shell script, with file paths constructed relative to the boost-config path, would probably be the best way, rather than pkg-config, which is not available in MinGW/MSYS by default. Feel free to direct me to the online documentation of this stuff if it exists -- I couldn't find it though. Cheers JP -- John Pye Dept of Engineering Australian National University http://pye.dyndns.org/

3 4

boost serialization stream error question
by Gabe Sibley 01 Feb '10

01 Feb '10

Dear All, I'm using boost serialization and have come across issues with "steam error" when I try to deseriailze from an xml or text archive. Binary archives are fine, but I can't use binary because my users need xml archives. The problem is caused by double values less than DBL_MIN. Apparently, streaming such values in causes the input stream fail_bit to be set, which causes the serialization lib to throw an exception. One work around is to make sure all double values are clamped and finite when the archive is created. I can live with this, esp. since I have algorithms that will from time to time produce non-finite results. So far what I've done is just replace BOOST_SERIALIZATION_NVP macro with the following MAKE_NVP macro that calls "FixReal": #define BOOST_SERIALIZATION_NVP(name) \ boost::serialization::make_nvp(BOOST_PP_STRINGIZE(name), name ) // Use this macro instead of BOOST_SERIALIZATION_NVP because it fixes doubles that are not streamable. // That is, it fixes double values that cause streaming errors. #define MAKE_NVP(name) \ boost::serialization::make_nvp(BOOST_PP_STRINGIZE(name), FixReal(name) ) // note the call to FixReal // does nothing -- just pass all non-double types through template<class T> inline T& FixReal( T& t ) { return t; } /// Routine to make sure doubles are streamable -- Nan, Inf, etc. cause stream errors, so we prevent them. inline double& FixReal( double& d ) { if( d < DBL_MIN ) { d = DBL_MIN; } if( d > DBL_MAX ) { d = DBL_MAX; } if( std::isnan(d) ) { d = 0; } if( std::isinf(d) ){ d = DBL_MAX; } return d; } /// We also need to fix double arrays. The ugly syntax is because // we have to pass and return a reference to an array. inline double (&FixReal( double (&d)[2] ))[2] { for( size_t ii = 0; ii < 2; ii++ ){ FixReal(d[ii]); } return d; } Ok, here's my question: How can I get the "FixReal" functionality above without having to write a specialized function for every possible double signature? For instance, I don't want to have to write inline double (&FixReal( double (&d)[3] ))[3] inline double (&FixReal( double (&d)[4] ))[4] ... etc. or any of the other POD double signatures possible. I just want the serialization library to fix the errant double values when I create the archive. I guess I could modify the "void save(const double t)" function in basic_text_oprimitive.hpp to check all doubles, but that seems like a bad plan. Any suggestions? thanks for your help, Gabe

3 7

Strange output from boost::exception diagnostic_information
by pholding 01 Feb '10

01 Feb '10

-------------------------------------------------------------------------------- I've been having a look at the diagnostic_information function in the boost exception library, but seem to be getting a strangely formatted output. The code I'm using is as follows Code: #include <boost/exception/diagnostic_information.hpp> #include <stdexcept> #include <iostream> void myerror(){ throw boost::enable_error_info(std::range_error("blah")); } int main(){ try{ myerror(); } catch(boost::exception & e){ std::cerr << diagnostic_information(e) << std::endl; } return 0; }The output is as follows: Quote: Throw in function (unknown) Dynamic exception type: N5boost16exception_detail19error_info_injectorISt1 1range_errorEE std::exception::what: blah What I don't understand is why I'm getting N5, 16, 19, ISt11 and EE between the details of the exception type. To rule out my code, I compiled the example_io.cpp file provided in the boost example documentation and I'm getting a similar output. Does anyone what is causing the strange characters displayed? I'm running Ubuntu 9.10 and the version of g++ is 4.4.1 -- View this message in context: http://old.nabble.com/Strange-output-from-boost%3A%3Aexception-diagnostic_i… Sent from the Boost - Users mailing list archive at Nabble.com.

5 5

Re: [Boost-users] [BGL] Color Maps
by pablo barrio lópez-cortijo 31 Jan '10

31 Jan '10

Hi Andrew, thanks for your help. > I would recommend using the named parameter version of the call since it lets you omit optional parameters. It seems like the right approach. So now my code is as follows: typedef graph_traits<graph_t>::vertex_descriptor Vertex; Vertex source; ... some code that finds the appropriate vertex // DFSActions is the DFS visitor, with actions on vertex discover and finish DFSActions actions(this); // Calling DFS with named parameters depth_first_search(*g, visitor(actions), root_vertex(source)); Problem: the code doesn't compile, and I'm sure the fault is in "root_vertex(source)". This is the (very synthesized) error thrown by the compiler: property_map.hpp: In instantiation of ‘boost::property_traits<boost::bgl_named_params<long unsigned int, boost::root_vertex_t, boost::no_property> >’: depth_first_search.hpp:192: instantiated from ‘void boost::depth_first_search( long line ) [ with REALLY long line ]’ depth_first_search.hpp:222: instantiated from ‘void boost::depth_first_search( long line ) [ with REALLY long line ]’ graphdef.cpp:134: instantiated from here graphdef.cpp:134: instantiated from here property_map.hpp:31: error: no type named ‘key_type’ in ‘struct boost::bgl_named_params<long unsigned int, boost::root_vertex_t, boost::no_property>’ property_map.hpp:33: error: no type named ‘reference’ in ‘struct boost::bgl_named_params<long unsigned int, boost::root_vertex_t, boost::no_property>’ property_map.hpp:34: error: no type named ‘category’ in ‘struct boost::bgl_named_params<long unsigned int, boost::root_vertex_t, boost::no_property>’ And many other errors, but this is the first one. To check if the problem was in my "source" vertex, I changed the call to DFS with the default value for the root_vertex (looked up in the header file): depth_first_search(*g, visitor(actions), root_vertex(*vertices(*g).first)); The error keeps showing. Having a look at the DFS source code, it seems that the named param function expects a root_vertex of type root_vertex_t, which appears several times in the error msg. The Boost docs specify a type of graph_traits<graph_t>::vertex_descriptor, which is what I'm using now. I suppose it's the same type, but I've not found the type definition. I'm sure it must be a very stupid mistake, but I can't see it. Any clues?

2 1

[circular_buffer] Serialization support for circular_buffer
by Brian Wood 31 Jan '10

31 Jan '10

B"H Shalom, Boost, The C++ Middleware Writer now supports marshalling circular_buffers. This is done by transmitting a circular buffer's capacity, then size, followed by it's elements. An example of the code used when marshalling a circular_buffer is here -- http://webEbenezer.net/posts/cirbuf.hh. -- Brian Wood http://www.webEbenezer.net (651) 251-9384

1 0

Can someone provide an Asio Serial Port example?
by Jeff 30 Jan '10

30 Jan '10

I would like to use Asio to connect to a microcontroller to send and read from, but there are no serial_port samples available. For instance, I would like to type an ‘a’ into the keyboard and have the microcontroller return 1. The microcontroller is already programmed for this but I need to create an interface for it. A sample that does this or any working sample at all would be sincerely appreciated. Thank you, Jeff

5 4

std::list customization
by Etienne Philip Pretorius 30 Jan '10

30 Jan '10

Hello List, I know this is not boost specific, but I would appreciate any comments about the following. I have a specific set of values stored in a std::list<unsigned char>. As expected I can delete and add items anywhere, since I am using the std::list object rearrange its own contents. But here is the problem - when I have already decided that item at position 13 should always remain at position 13 if the list has 13 or more objects in it... If I remove an item from the beginning then the item at position 13 becomes the item at position 12, while this is undesired - the effect of shifting everything else on by one value is desired. Some examples of what I require: Fixed position marked with []. a,b,c,[d],e,f pop_front() is called b,c,e,[d],f This list object should also work when inserting items and keep those with fixed positions at their position if the object size allows it. Any suggestions, Ideas on how to implement this would be greatly appreciated. Kind Regards, Etienne

2 2

[mpl - function_types] Generate typedef from operator() of a functor
by Olivier Tournaire 30 Jan '10

30 Jan '10

Hi all, Given an mpl sequence of types such as: typedef mpl::vector<T0, T1, T2, T3> arg_types; 1) the users of my library provide functors such as F (where T0 and T1 may have been any of the types of arg_types: class F { typedef mpl::pair<T0,T1> signature_type; double operator()(const T0& t0, T1& t1); }; is there a way to generate signature_type automatically ? 2) if the operator() is overloaded, the user class currently has to typedef an mpl::vector of mpl::pairs such as class G { typedef mpl::vector<mpl::pair<T2,T3>, mpl::pair<T1,T1>, mpl::pair<T3,T1> > signature_type; double operator()(const T2& t2, T3& t3); double operator()(const T1& t1, T1& t1); double operator()(const T3& t3, T1& t1); }; in this case, is it also possible to generate signature_type automatically ? Regrads, Olivier

2 3

[function_types] About parameter_types
by Olivier Tournaire 30 Jan '10

30 Jan '10

Hi all, I am trying to extract the parameters types of a given function/functor in a mpl sequence. Digging boost libraries, I came across function_types, and in particular parameter_types, which might be the right tool. However, I cannot figure how to use it. Could you please help ? Suppose I have: void foo(int, double); And would like to generate the following sequence: mpl::vector<int, double> How can I do that ? Regards, Olivier

2 2

[doc] Add "Last Update" information
by Marco Guazzone 30 Jan '10

30 Jan '10

Dear Boosters, In my opinion it would be very helpful if the documentation include for each library the version of the last update. For instance, one could add this information in the summary page (http://www.boost.org/doc/libs/1_41_0) --- [snip] --- uBLAS uBLAS provides matrix and vector classes ... Author(s)...........Joerg Walter and Mathias Koch First Release...1.29.0 -> Last Update......1.40.0 <- Standard Build & Link......Header only Categories........Math and numerics --- [/snip] --- The reason for this is that it should simplify the discovery of what version of Boost one needs for his own software project. As a matter of fact, the use of "First Release" might not be sufficient because after the initial release of a library many other features could have been added. So the need for this additional piece of information. What do you think? Regards, -- Marco

1 0

asio UDP local port binding issue on Windows
by akos＠maroy.hu 30 Jan '10

30 Jan '10

Hi, I seem to encounter an issue when using boost asio. I'm trying to create a UDP client-server environment, where for the client I'm creating an asio socket like this: io_service _io_service; ip::udp::socket _socket(_io_service, ip::udp::v4()); my expectation at this point is that the _socket is created, and it can send and receive UDP packets. this includes receiving packets, which also means that the socket is bound to some random port on the local network interface. now this is all true on Linux and MacOS, but on Windows, the socket does not seem to bind to a port. interestingly, for _socket.is_open() I get true in return. but for _socket.local_endpoint(), I get an error excaption with the error code 10022, which is defined as WSAEINVAL. I also tried the following, and got the same results: io_service _io_service; ip::udp::socket _socket(_io_service); _socket.open(ip::udp::v4()); is my assumption that the above should result in a socket bound to a local random port incorrect? Akos

1 0

Property Tree - adding child nodes to a parent
by Jon Shuler 30 Jan '10

30 Jan '10

I am trying to build a property tree from hierarchy data in a database. I want to be able to add a child at a given node using something similar to: parentNode.add_child("child name", data_type). There is a add_child method but it expects the path to add the child at. I looked at the examples and did not see anything. Is this possible? Jon This e-mail message and any attachment(s) transmitted with it are intended only for the use of the recipient(s) named above.This message may be privileged and/or confidential. If you are not an intended recipient, you may not review, copy or distribute this message. If you have received this communication in error, please notify us immediately by e-mail and delete the original message.

2 1

Re: [Boost-users] Detect specialized template function?
by Andrew Chinkoff 30 Jan '10

30 Jan '10

Hi, Daniel. This is your example: template <class T> void S::f() { if(g is specialized) // (1) callbacks_ready=true; // else wait for a callback object to be registered } At (1) the runtime detection is used, but "S:g()" was specialized at compile time. Templates are specialized and compiled at compile time, but not runtime. We can't write "if(g is specialized)" - it is impossible to realize it at runtime (and it is senseless). So let me to recommend you some books of H. Sutter and A. Alexandrescu. There are a lot of recommendations about templates, their specializations, overloads, static/dynamic polymorphisms and more. 1st book: [http://www.gotw.ca/publications/xc++s.htm] Pay attention to this chapter of the book: "Item 7: Why Not Specialize Function Templates?" 2nd book; "C++ Coding Standards: 101 Rules, Guidelines, and Best Practices" (authors H. Sutter and A. Alexandrescu) Pay attention to 64, 65, 66 and 67 chapters. I hope you will find some useful ideas about templates in these books. There are also Boost libraries targeted to realize static polymorphism: 1) http://www.boost.org/doc/libs/1_40_0?view=category_Generic 2) http://www.boost.org/doc/libs/1_40_0?view=category_Metaprogramming Best, Andrew. > Slightly OT, but I was hoping someone here might know the magic incantation > (which may involve a Boost library). > Given a template class such as > template <class T> > struct S > { > void f(); > void g() { T t(h()); cb(t) } > T & h(); > boost::function1<void, T &> cb; > }; > Is there a way to have S.f() behave differently depending on whether S.g() uses > the default definition or whether it is specialized for this particular type? > This detection needs to occur before S.g() is ever called. > For example, the mere existance of the specialization > template <> void S<int>::g() { ... } > should trigger special logic in S<int>::f(). > Thanks, > Daniel > P.S. The motivation for this is an attempt to retrofit a callback API that > allows specialization of S.g() or the registration of a boost::function that > gets called by the default S.g(). We need to disable callbacks until an actual > function is registered via either method. It is easy to dispatch on > registration of the boost::function; I don't know how to detect the > specialization.

1 0

Boost 1.36.0 with Linux 64bits
by JongKwan Kim 29 Jan '10

29 Jan '10

Hi all, I would like to know if the boost 1.36.0 is working well with Linux 64 bits. If I want to compile with boost 1.36.0 and Linux 64 bits, how should I install the boost 1.36.0? Is it the same to 32 bits machine? Please, if someone knows that, let me know. Thanks,

5 8

fusion sequences, type erasure across translation units
by Hicham Mouline 29 Jan '10

29 Jan '10

Hello, I have a .cpp file which a sort of top level driver. I have say 100 different struct param_i {...}; where 1<=i<=100 Each param_i is defined in a param_i.hpp and param_i.cpp invokes metafunctions to obtain typedef fusion< variant< vector<double>, triplet<double>, pair<double>, double>, variant<...>, ..., variant<...> > seq_i_t; this sequence type is visible only in the param_i.cpp, not the header file. Generation of this sequence is The size of these sequences = number of members of param_i. The toplevel driver and other .cpp need to move instances of these types around to other .cpp. To avoid having the compiler call the metafunctions for these middle translation units, but only at the generating .cpp and at the consuming .cpp, I created a tag struct fusion_seq_tag {}; typedef <typename Arg> struct make_fusion_seq_i { typedef <undefined> type; }; typedef <typename Arg> struct make_fusion_seq_tag { typedef typename make_fusion_seq_i<Arg>::type base_type; struct type : fusion_seq_tag, base_type { type(...) : base_type(...) {} }; }; return smart_ptr<fusion_seq_tag>( new make_fusion_seq_tag<...>::type ); // this was the generating .cpp The function returns smart_ptr<fusion_seq_tag> which can move around in other .cpp without any metaprogramming until reaching the consuming .cpp Is this type erasure? I don't know how I can get the actual type back in the consuming .cpp if I don't know the originator but if I know only the shape of the fusion sequence. How to dynamic cast the type back to its unerased type? If I know the originator .cpp then I would know the exact fusion sequence and therefore I would just dynamic_cast the fusion_seq_tag. Regards,

2 1

[boost][task] task and fiber do not compile
by Kishalay Kundu 29 Jan '10

29 Jan '10

Hi Oliver, I have boost 1.41.0 installed. I have been trying to build boost-task and boost-fiber (I guess this is the pre-req for building boost-task). However when I do: "./bjam threading=multi --with-task", the compiler errors out with a long list of compiler errors. I have gcc 4.4.1 installed on my Fedore 11 system. Could you please let me know what I am doing wrong? Thank you. regards, Kishalay

1 0

[BGL] Color Maps
by pablo barrio lópez-cortijo 29 Jan '10

29 Jan '10

Hi there! I'm new to Boost (and also to this mailing list). I'm using depth_first_search and it's vital for me to be able to specify the root vertex (4th argument), and that means also specifying the Color Map, which I don't care too much about. It'd be great to have a default color map but I'm a newbie and I didn't found anything in the docs. My initial options were: a) Using sth like a "default_color_map" class. I ignore if there is such thing. b) Creating a property map out of a vector, something like "vector_property_map<default_color_type>". I tried and it didn't work. c) Including a property in my graph called "color" of type "default_color_type", and creating a property map out of it. Didn't work either. Actually, I get an error when trying to include the property with that type (compiles if the property is an int). d) Just copying the color map that the algorithm uses when called without the color map argument. Hoping to find out how the BGL code works was simply unrealistic so I abandoned the idea. Is there any way to easily instantiate a Color Map? I'd post my code, but I have 6 or 7 versions none of which work. Any help will be much appreciated. Thanks ahead!

2 1

Detect specialized template function?
by dherring＠ll.mit.edu 29 Jan '10

29 Jan '10

Slightly OT, but I was hoping someone here might know the magic incantation (which may involve a Boost library). Given a template class such as template <class T> struct S { void f(); void g() { T t(h()); cb(t) } T & h(); boost::function1<void, T &> cb; }; Is there a way to have S.f() behave differently depending on whether S.g() uses the default definition or whether it is specialized for this particular type? This detection needs to occur before S.g() is ever called. For example, the mere existance of the specialization template <> void S<int>::g() { ... } should trigger special logic in S<int>::f(). Thanks, Daniel P.S. The motivation for this is an attempt to retrofit a callback API that allows specialization of S.g() or the registration of a boost::function that gets called by the default S.g(). We need to disable callbacks until an actual function is registered via either method. It is easy to dispatch on registration of the boost::function; I don't know how to detect the specialization.

2 1

[boost::function] Is there a way to assign a generic function, regardless number of parameters?
by Matheus Araújo Aguiar 29 Jan '10

29 Jan '10

Hello list, My doubt is simple. We need to implement some callbacks, but we don't want to declare a boost::function to every different callback, we just want to declare one generic boost::function to receive any function, with any number of parameters (the return type may be one well defined, no problem with that in our case). Is there a way to do this? What we want to do is something like is done in the asynchronous methods of boost::asio when passing the callback to the async operation. TIA, -- Matheus Araújo Aguiar Computer Scientist matheus.pit(a)gmail.com

3 5

[UTF] Provide a custom init_unit_test
by Ahmed Badran 29 Jan '10

29 Jan '10

Hi, I have a single test module (defined via BOOST_TEST_MODULE), then multiple test suites, each defined in its own .cpp file and I am using a single header variant of the unit test framework. Is there an easy way to provide my own init_unit_test and have it plug into the rest of the system, with main and everything else provided by the utf library? I've looked at the headers of utf and it seemed that the generation of main and other initialization routines are tied to also providing an "init_unit_test" which causes a multiple definition problem at link stage. Regards, Ahmed

2 1

Operator overloading of a class template in a namespace
by Surya Kiran Gullapalli 29 Jan '10

29 Jan '10

Hello all, Let me give you a heads up first. This is a general c++ question. not a boost one. But posting it here as we've C++ gurus out there. I've this piece of code http://paste.pocoo.org/show/171324/ The code fails to compile when *St.1 *is uncommented. I read some documents on operator overloading and namespaces and moved the output operator into the same namespace as the class (skg). This works fine. But my question is different. If the output operator is in global namespace and class in skg namespace *St. 2 * (cout statement) works fine, but not the copy statement. Why ? Thanks in advance, and apologies for offtopic. Surya

1 0

Re: [Boost-users] [multi_array] compiling and changing an example
by Steven Watanabe 29 Jan '10

29 Jan '10

AMDG sean farrow wrote: > I'm trying to use boost::multi_array, I've included boost/multi_array.hpp > in the file and have the following code: > > private: > > typedef boost::multi_array<double, 3> array_type; > > typedef array_type::index index; > > array_type test(boost::extents[3][4][2]); > > Commenting out the third line compiles fine, but leaving this in gives a > c2061 error. It seems there is an issue with boost::extents, which header > is this in? I don't have a using boost; earlier, should I have? I'm using > visual c+ 2008. > It compiles fine for me with the trunk: #include <boost/multi_array.hpp> int main() { typedef boost::multi_array<double, 3> array_type; typedef array_type::index index; array_type test(boost::extents[3][4][2]); } What version of boost are you using? What is your code exactly (with #includes)? What is the exact error message? In Christ, Steven Watanabe

1 0

The Boost difference b/w 32 and 64 bits
by JongKwan Kim 29 Jan '10

29 Jan '10

Hello, I am running my own C and C++ code using the Boost Library. First, I run the my code with Boost Library 1.36.0 on the 32 bits linux (Ubuntu) computer, so it is working well. However, I need to move the same code on the 64 bits linux (RedHat) computer. So, I am trying to run the code with Boost Library 1.41.0 on the 64 bits linux machine. At that time, the compiling is well, but when I run it, there is segmentation fault. I do not know if the problem is because of the difference between 32 bits and 64 bits or between 1.36.0 and 1.41.0 versions. Could you guys please let me know what is problem? When I type "make install" on the prompt window, I got messages like below.... ............................. /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libz.a(crc32.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(s_atan.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(s_cos.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(s_sin.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(w_exp.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(w_fmod.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(w_log.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(w_log10.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(w_pow.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(w_sqrt.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(s_round.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(m_isnan.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(m_finite.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(s_ceilf.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(s_cosf.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(s_floorf.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(s_sinf.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(w_expf.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(w_fmodf.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(w_logf.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(w_log10f.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(w_powf.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(w_sqrtf.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(s_roundf.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(m_isnanf.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(m_finitef.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(k_standard.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(s_lib_version.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(s_matherr.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(e_exp.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(e_fmod.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(e_log.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(e_log10.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(e_pow.o)' is incompatible with i386:x86-64 output /usr/bin/ld: warning: i386 architecture of input file `/usr/lib/libm.a(s_rint.o)' is incompatible with i386:x86-64 output ...............etc............. Thanks,

2 2

[Boost Circular Buffer] Warning C4099 when compiling with boost/circular_buffer.hpp
by Lloyd Zslnka 28 Jan '10

28 Jan '10

Boost Version: 1.35.0 Compiler: Visual Studio 2008 Version 9.0.30729.1 SP OS: Windows XP SP3 Hello, I'm compiling boost/circular_buffer.hpp with my project and am getting the following warning message: ...\boost\boost_1_35_0\boost\circular_buffer\base.hpp(180) : warning C4099: 'boost::cb_details::iterator' : type name first seen using 'class' now seen using 'struct' ...\boost\boost_1_35_0\boost\circular_buffer\details.hpp(187) : see declaration of 'boost::cb_details::iterator' ...\boost\boost_1_35_0\boost\circular_buffer\base.hpp(2477) : see reference to class template instantiation 'boost::circular_buffer<T,Alloc>' being compiled In looking at details.hpp, I see that iterator is declared as a class on line 187, but in base.hpp it is declared as a struct on line 180. Is this a mistake or am I missing something? Thanks, Lloyd --------------------------------------------------------------------- This transmission (including any attachments) may contain confidential information, privileged material (including material protected by the solicitor-client or other applicable privileges), or constitute non-public information. Any use of this information by anyone other than the intended recipient is prohibited. If you have received this transmission in error, please immediately reply to the sender and delete this information from your system. Use, dissemination, distribution, or reproduction of this transmission by unintended recipients is not authorized and may be unlawful.

2 2

Boost, bjam, and symbolic links
by svdbg＠free.fr 28 Jan '10

28 Jan '10

Hello, I generated some Boost librairies with bjam, and I get many symbolic links. For date_time : libboost_date_time-gcc41-mt-1_39.a libboost_date_time-gcc41-mt-1_39.so -> libboost_date_time-gcc41-mt-1_39.so.1.39.0 libboost_date_time-gcc41-mt-1_39.so.1.39.0 libboost_date_time-gcc41-mt.a -> libboost_date_time-gcc41-mt-1_39.a libboost_date_time-gcc41-mt.so -> libboost_date_time-gcc41-mt-1_39.so.1.39.0 Why don't I just get the .a and .so ? Why these 3 symbolic links ? And why do the original files have a so complicated name for the .so, with the release version mentionned twice ? Isn't it possible to just have : libboost_date_time-gcc41-mt-1_39.a libboost_date_time-gcc41-mt-1_39.so Thanks for help. I don't know what to do of these symbolic links. Note : I am a newbie in Linux.

2 1

[Boost.Thread]
by Andrew Chinkoff 28 Jan '10

28 Jan '10

Hi. There is a test program I would to be explained to me: *** BEGIN OF TEST PROGRAM *** #include <stdio.h> #include <boost/thread.hpp> #define USE_SPINLOCKS //#define USE_MUTEXES boost::thread th1; boost::thread th2; boost::mutex mutex; int global_int = 0; bool IsNotEven(int code) { boost::mutex::scoped_lock locker(mutex); bool ret = (code & 1); return ret; } void thread_func() { for(int i = 0; i < 1000000; ++i) { #ifdef USE_MUTEXES if(IsNotEven(global_int)) // (1) #elif defined USE_SPINLOCKS if(__sync_fetch_and_and(&global_int, 1)) // (2) #else ERROR__WRONG_COMPILED; #endif global_int+=9; else global_int+=1; } } int main() { th1 = boost::thread(&thread_func); th2 = boost::thread(&thread_func); th1.join(); th2.join(); printf("global_int = %d\n", global_int); return 0; } *** END OF TEST PROGRAM *** Results of test program: 1) Test program compiled with USE_SPINLOCKS. Outputs are always: "global_int = 10" "global_int = 10" "global_int = 10" 2) Test program compiled with USE_MUTEXES. Outputs differ from each other: "global_int = 10000008" "global_int = 10000000" "global_int = 9763210" Could you explain me why outputs produced with USE_SPINLOCKS compilation differ from USE_MUTEXES ones? And what is the difference between (1) and (2) lines? Best, Andrew. P.S.: I use guest Ubuntu-8.04 installed on VirtualBox. Host OS = Vista.

2 1

Problem compiling boost libraries
by Daniel Veneros 28 Jan '10

28 Jan '10

Hi, I´m trying to compile a simple example in NetBeans 6.8 on Solaris platform, the code is: struct shm_remove { shm_remove() { shared_memory_object::remove("MySharedMemory"); } ~shm_remove(){ shared_memory_object::remove("MySharedMemory"); } } remover; //Create a shared memory object. shared_memory_object shm (create_only, "MySharedMemory", read_write); //Set size shm.truncate(1000); //Map the whole shared memory in this process mapped_region region(shm, read_write); //Write all the memory to 1 std::memset(region.get_address(), 1, region.get_size()); //Launch child process std::string s(argv[0]); s += " child "; if(0 != std::system(s.c_str())) return 1; That's it, no big deal, but when I try to build this I receive the error: Undefinded first referenced symbol in file shm_unlink, sched_yield, shm_open Anyone knows how can I fix this?? Thanks!!! Dann

4 4

Program options support for wide char
by Bo Jensen 28 Jan '10

28 Jan '10

Program options::options_description has a output operator for std::ostream, but none for std::wostream (if I am mistaken, please correct me). Shouldn't there be one ? I could surely need one :-) Regards Bo

2 1

[asio] Detecting tcp peer disconnection
by Igor R 28 Jan '10

28 Jan '10

Hello, This issue has previously been discussed in details, and IIRC, the conclusion was that the reliable method to detect peer disconnection is to try reading from the socket. Now I encountered strange situation: I connect tcp socket to some proprietry server, then pull out the ethernet cable from the server side. If async_read_some was in progress - nothing happens, no handler is called. If I start an additional async_read_some - nothing happens. I tried to set SO_KEEPALIVE option and waited - nothing happened. My machine runs WinXPSP3, so async_read_some is delegated to WSARecv(). I'd appreciate any idea on the subj. Thanks.

2 3

[boost-build] boost projects, like boost/python/boost_python
by Simon Pickles 28 Jan '10

28 Jan '10

Hello, Can anyone tell me how I find which jamfile is run when the line: <library>boost/python/boost_python is encountered by bjam? And are there equivalent 'shortcuts' to other boost libraries, particularly boost unit test framework? Many thanks Si

2 1

[String Algo] error in ireplace_first or ireplace_all with std::wstring under gcc 3.4.2 (MingW)
by Doug Swanson 28 Jan '10

28 Jan '10

I hope this is the appropriate place to post -- I apologize in advance if it is not! The following code compiles and runs without error under g++ in Windows, GCC 3.4.2 (MingW): <code> #include <cstdio> #include <string> #include <boost/algorithm/string.hpp> using namespace std; using namespace boost; int main( void ) { string test = "This is a test"; ireplace_first( test, "test", "success" ); printf( "%s\r\n", test.c_str() ); return 0; } </code> The output is correct: "This is a success". If I change the above code to use a std::wstring instead, it will compile, but it will crash on execution: <code> #include <cstdio> #include <string> #include <boost/algorithm/string.hpp> using namespace std; using namespace boost; int main( void ) { wstring test = L"This is a test"; ireplace_first( test, L"test", L"success" ); printf( "%ws\r\n", test.c_str() ); return 0; } </code> Setting a breakpoint on std::terminate() in gdb gives the following backtrace: Breakpoint 1, 0x00407ae6 in std::terminate() () (gdb) bt #0 0x00407ae6 in std::terminate() () #1 0x00404dc2 in __cxa_throw () #2 0x004021d2 in std::__throw_bad_cast() () #3 0x00434c69 in std::ctype<wchar_t> const& std::use_facet<std::ctype<wchar_t> >(std::locale const&) (__loc=@0x22fe8c) at C:/Applications/Dev-Cpp/bin/../lib/gcc/mingw32/3.4.2/../../../../include/c++/3.4.2/bits/locale_facets.tcc:112 #4 0x0043415c in wchar_t std::toupper<wchar_t>(wchar_t, std::locale const&) ( __c=84, __loc=@0x22fe8c) at C:/Applications/Dev-Cpp/bin/../lib/gcc/mingw32/3.4.2/../../../../include/c++/3.4.2/bits/locale_facets.h:4553 #5 0x0041648c in bool boost::algorithm::is_iequal::operator()<wchar_t, wchar_t> (wchar_t const&, wchar_t const&) const (this=0x22fe8c, Arg1=@0x3e3df4, Arg2=@0x43702e) at C:/Applications/Boost_new/boost/algorithm/string/compare.hpp:71 #6 0x004163fb in boost::iterator_range<__gnu_cxx::__normal_iterator<wchar_t*, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > > > boost::algorithm::detail::first_finderF<wchar_t const*, boost::algorithm::is_iequal>::operator()<__gnu_cxx::__normal_iterator<wchar_t*, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > > >(__gnu_cxx::__normal_iterator<wchar_t*, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > >, __gnu_cxx::__normal_iterator<wchar_t*, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > >) const (this=0x22fe80, Begin={_M_current = 0x3e3df4}, End={_M_current = 0x3e3e10}) at C:/Applications/Boost_new/boost/algorithm/string/detail/finder.hpp:76 #7 0x00413fe8 in void boost::algorithm::find_format<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, boost::algorithm::detail::first_finderF<wchar_t const*, boost::algorithm::is_iequal>, boost::algorithm::detail::const_formatF<boost::iterator_range<wchar_t const*> > >(std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >&, boost::algorithm::detail::first_finderF<wchar_t const*, boost::algorithm::is_iequal>, boost::algorithm::detail::const_formatF<boost::iterator_range<wchar_t const*> >) ( Input=@0x22ff50, Finder=@0x22fe80, Formatter={m_Format = {m_Begin = 0x43701e, m_End = 0x43702e, singular = false}}) at C:/Applications/Boost_new/boost/algorithm/string/find_format.hpp:146 #8 0x004141b5 in void boost::algorithm::ireplace_first<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, wchar_t[5], wchar_t[8]> (std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >&, wchar_t[5] const&, wchar_t[8] const&, std::locale const&) (Input=@0x22ff50, Search=@0x43702e, Format=@0x43701e, Loc=@0x22ff40) at C:/Applications/Boost_new/boost/algorithm/string/replace.hpp:259 #9 0x004014e8 in main () at test.cpp:11 I am not competent enough with Boost to understand what the call stack is telling me, except that __throw_bad_cast( ) is the source of the crash. ireplace_all gives the same behavior as ireplace_first above. Furthermore, the problem does not arise if I use replace_first or replace_all instead of ireplace_first or ireplace_all. It compiles and runs correctly. Finally, the problem does not arise if I compile using MSVC 2008. It compiles and runs correctly. Does this indicate a problem with gcc (MingW) unicode support? Is there an easy way to circumvent it? Thank you very much for any suggestions!

2 1

Re: [Boost-users] [date_time][serialization] Fast persistence ofboost::date_time::ptime
by pete＠pcbartlett.com 28 Jan '10

28 Jan '10

On Thu 28/01/10 13:20 , Jeff Garland <azswdude(a)gmail.com> wrote: > Igor R wrote: > >> However on this glance this doesn’t seem possible > non-intrusively. Perhaps > >> I’ve missed something, perhaps there’s a third way > – I would be grateful if > >> any could share any ideas. > > > > Yes, it was already discussed here: > > > http://groups.google.com/group/boost-list/browse_thread/thread/d799ca831185 > 01e4/04b184b4c7af8c0b?show_docid=04b184b4c7af8c0b> > > I believe nothing changed since then. > There's not a direct way to get at the internal representation of a > ptime, > which varies based on how the library is compiled (64 or 96 bits > depending on > settings -- the thread above isn't completely accurate on this > point). If > it's critically important, of course, you could modify the source > directly to > fit your particular setup and provide the internal representation > for your app > to serialize (add a to_int64 for example). As a general rule, > however, it's > unwise to store these values as integers since future versions of > the library > might, for example, expand the epoch range and hence these > serialized values > wouldn't be compatible -- that, and the aforementioned fact that the > internal > size isn't fixed are a couple of the reasons there isn't direct > access. > Jeff Thank you both for your helpful replies (and for the helpful library!) They are good reasons. The Boost.Serialization library has it versioning mechanisms so it would be possible for a more intrusive set of load/save functions to be future- and config-proof as well as being fast. However whilst that would suit me, it has its costs - I am sure many like the readability of the current archives and I am sure the maintainer likes that the serialization functions only need to use public members of the date_time classes!

1 0

bjam --address-model=64 doesn't work anymore?
by Daher 28 Jan '10

28 Jan '10

Using msvc100 building with: bjam --address-model=64 and unable to link output libs in my project. msvc saying its X86 and not X64 am i missing something?

2 2

C++ and quality of software
by Peter Foelsche 28 Jan '10

28 Jan '10

I was thinking. There should be some C++ software quality assurance institution. They would give a stamp of approval to software written in C++. Criteria would be: a.. no usage fixed-sized buffers b.. no usage of functions from the c library, which do not check for correct type, like *printf(), *scanf(). c.. no dangling resources, no resource leaks in any case d.. usage of C++ Exception Handling for reporting errors (all fallible OS-calls are wrapped into C++, this can be checked by denying read/write permissions on some object, the software is trying to read/write to) e.. clean design -- e.g. no protocols (no protocols is my way of saying, that all methods of classes can be used and make sense to be used, as soon as this object exists) What do you think? I also published this on my blog: http://foelsche.spaces.live.com/blog/cns!2BFA22F3AB9E833!921.entry

15 31

[date_time][serialization] Fast persistence of boost::date_time::ptime
by Pete Bartlett 28 Jan '10

28 Jan '10

I am interested in serializing data structures like vector< pair< boost::date_time::ptime , double> > as quickly as possible. I see that ptime is a serializable object (in the Boost.Serialization sense) but on the surface this implementation looks slow - we first get a date and time_duration and then serialize the various components (mins,secs,subsecs) separately for the latter and construct a full ISO string for the date. Something faster is surely possible - digging into the implementation it looks like a (non-special) ptime is represented as boost::uint64_t so if we were privy to all implementation details we could use serialize that. However on this glance this doesn't seem possible non-intrusively. Perhaps I've missed something, perhaps there's a third way - I would be grateful if any could share any ideas. Thanks, Pete

3 2

passing socket descriptor to a function
by pedro chaparro 28 Jan '10

28 Jan '10

Hi, i have the code below, i want to separate the open socket code from the writting fucntions, i want to call a escribir() function from the main but i¡m not clear the value i have to pass the function, inthe way i have below it has not work. thanks #include <ctime> #include <iostream> #include <string> #include <boost/asio.hpp> using boost::asio::ip::tcp; void escribir( tcp::socket socket){ std::string message = "mensaje"; boost::system::error_code ignored_error; boost::asio::write(socket, boost::asio::buffer(message), boost::asio::transfer_all(), ignored_error); } int main() { int contador=0; try { boost::asio::io_service io_service; tcp::acceptor acceptor(io_service, tcp::endpoint(tcp::v4(), 5544)); for (;;) { tcp::socket socket(io_service); acceptor.accept(socket); escribir(socket); } } catch (std::exception& e) { std::cerr << e.what() << std::endl; } return 0; } -- Ing Pedro Alonso Chaparro Valero Ciudad Politecnica de la Innovación iTEAM - Mobile Communications Group Polytechnic University of Valencia C\ Camino de Vera S/N, Edificio 8G 46022 Valencia, Spain

2 5

Re: [Boost-users] [interprocess] shared_memory_object constructor with create_only parameter
by Philipp Hamann 28 Jan '10

28 Jan '10

Hi all, I am sorry. I made a mistake. My first problem is solved. It is not a bug. > I have some problems using the shared_memory_object constructor with the > create_only parameter. > The goal is to allow only one process to write to the shared memory. So > I create a shared_memory_object with the create_only parameter. For the > first process this is successful (as I assumed), but for the second > process (same parameters) this is successful, too (not as I assumed). > The documentation of boost says that it should throw an exception, if > the shared memory is allready created. Is this a bug or a misuse or > understanding of the library? But the second problem concerning shared_memory_object::remove(const char* name) is still present. > I realized another problem. If I call the static function > shared_memory_object::remove(const char* name), the memory should be > removed only when no further process has access to the memory. This > seems also not to work. I did the following: > 1. create shared memory for writing. > 2. open shared memory for reading > 3. shared_memory_object::remove(const char* name) (from the reading > process) > 4. reopen the shared memory for reading -> exception: can not find the file Thanks for your help and apoligizes for bothering you with my first problem. Philipp

2 4

serialization: pointer reconstruction
by Noah Roberts 27 Jan '10

27 Jan '10

A while back I asked about saving a pointer to an item in another class that is stored as a direct instance variable (no pointer). Here's a brief illustration: struct A { }; struct B { A a; }; struct C { A * a; // points to a B::a. }; I have an idea how to store and restore these relationships but I'd like to see if there are any improvement ideas and/or direction to existing behavior I'm not seeing in the documentation. My idea is to first store B::a (which simply makes sense in my problem anyway) and when I do this to call some custom support functions to generate a unique ID for the object at that address and store it first, then the rest of the data in A. This would appear in A::serialize and the unique ID would be stored in the Archive (added behavior) as a map from address to uid. Then when storing C I would request the unique ID for the address the pointer stores and store it. On reading I read B::a first and it sort of reverses the process. The uid is read and then A::serialize stores the uid and 'this' in the archive map in a uid->address format. I then read the uid on reading C::a and request the address from the archive using that value. I've already subclassed the Archive in order to pass around other load information needed by classes that didn't have local copies, so that's the easy part (though it wasn't a straight forward operation). The question I have though is that since the pointer archiving already must use some similar type of API, can I use it instead of rolling my own and how would I do that?

2 3

Issues with unnamed enums
by Kyle Altendorf 27 Jan '10

27 Jan '10

I have just tried to use Boost for the first time and it appears to not take kindly to unnamed enums from another library I use and (once those were named) some Microsoft SDK. I am using: Windows XP SP3 Visual Studio 2008 SP1 Boost 1.41.0 More specifically, after adding '#include <boost/foreach.hpp>' I started getting compilation errors such as: 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : error C2332: 'class' : missing tag name 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : error C2011: '<unnamed-tag>' : 'enum' type redefinition 1> c:\korvis\korvislibs\khmilib\kvdisplay.h(18) : see declaration of '<unnamed-tag>' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : error C2143: syntax error : missing ',' before 'constant' kvdisplay.h(18) is the definition of an unnamed enum in another library I use. iterator_facade.hpp(43) is (including comments before it): > // This forward declaration is required for the friend declaration > // in iterator_core_access > template <class I, class V, class TC, class R, class D> class iterator_facade; I went through and named a each of the unnamed enums as the compiler referenced them until I got to an issue with shlwapi.h from a Microsoft SDK. Here's the complete compiler error list at that point: 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : error C2332: 'class' : missing tag name 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : error C2011: '<unnamed-tag>' : 'enum' type redefinition 1> c:\program files\microsoft sdks\windows\v6.0a\include\shlwapi.h(1550) : see declaration of '<unnamed-tag>' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : error C2143: syntax error : missing ',' before 'constant' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(479) : error C2332: 'class' : missing tag name 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(479) : error C2011: '<unnamed-tag>' : 'enum' type redefinition 1> c:\program files\microsoft sdks\windows\v6.0a\include\shlwapi.h(1550) : see declaration of '<unnamed-tag>' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(479) : error C2143: syntax error : missing ',' before 'constant' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(484) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(484) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(485) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(485) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(487) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(487) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(488) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(488) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(489) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(489) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(490) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(490) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(494) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(494) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(501) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(508) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(566) : error C2332: 'class' : missing tag name 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(566) : error C2011: '<unnamed-tag>' : 'enum' type redefinition 1> c:\program files\microsoft sdks\windows\v6.0a\include\shlwapi.h(1550) : see declaration of '<unnamed-tag>' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(566) : error C2143: syntax error : missing ',' before 'constant' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(567) : error C2988: unrecognizable template declaration/definition 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(567) : error C2059: syntax error : 'constant' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(567) : error C2065: 'V' : undeclared identifier 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(567) : error C2065: 'TC' : undeclared identifier 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(567) : error C2065: 'R' : undeclared identifier 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(567) : error C2065: 'D' : undeclared identifier 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(572) : error C2332: 'class' : missing tag name 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(572) : error C2011: '<unnamed-tag>' : 'enum' type redefinition 1> c:\program files\microsoft sdks\windows\v6.0a\include\shlwapi.h(1550) : see declaration of '<unnamed-tag>' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(573) : error C2065: 'V' : undeclared identifier 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(573) : error C2065: 'TC' : undeclared identifier 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(573) : error C2065: 'R' : undeclared identifier 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(573) : error C2065: 'D' : undeclared identifier 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(574) : error C2334: unexpected token(s) preceding '{'; skipping apparent function body 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(721) : error C3855: 'boost::iterator_facade': template parameter '__formal' is incompatible with the declaration 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(721) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(601) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(724) : error C2332: 'class' : missing tag name 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(724) : error C2011: '<unnamed-tag>' : 'enum' type redefinition 1> c:\program files\microsoft sdks\windows\v6.0a\include\shlwapi.h(1550) : see declaration of '<unnamed-tag>' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(724) : error C2143: syntax error : missing ',' before 'constant' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(725) : error C2065: 'V' : undeclared identifier 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(725) : error C2065: 'R' : undeclared identifier 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(725) : error C2065: 'TC' : undeclared identifier 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(726) : fatal error C1903: unable to recover from previous error(s); stopping compilation Am I correct that the unnamed enums are somehow causing the problem? Any help you can offer understanding or resolving this issue would be greatly appreciated. Thanks for your time, -kyle

2 2

Query re connected components in the Boost Graph Library
by Christopher Henrich 27 Jan '10

27 Jan '10

The connected_components function in the BGL returns the connected component information in a "ComponentMap," in which the value for node i is the number c[i] of the component containing that node. Is the sequence of component numbers "restricted growth" ? That is, can I assume that c[0] = 0 and for i > 0, c[i] <= 1 + max(c[0], ..., c[i-1])? It would appear that this would be true, as a consequence of the easiest way to use depth-first search to find the components. And a brief attempt to read the source code encourages me to believe it. But I may not have understood the source code. And I do not find it stated in the boost documentation, nor in /The Boost Graph Library/. Thanks in advance for clarification on this point. Christopher Henrich chenrich(a)monmouth.com mathinteract.com

1 0

[thread] Is a call to interrupt_all blocking?
by Sachin Garg 27 Jan '10

27 Jan '10

Does a call to interrupt_all blocks the calling thread, waiting for all threads to be interrupted? Or is it supposed to return immediately and let the threads hit their interruption points later? I have a thread_group and I want to call interrupt_all to stop all threads in the group from 'within' one of the threads in that group. This would be possible only if interrupt_all in not blocking, otherwise I will need to somehow signal some other thread to do the interrupt_all on that group. SG

4 8

Question on grammar
by Manjunath Kudlur 27 Jan '10

27 Jan '10

I am sure this has been asked before, but I am not able to find an answer to my specific question in the archives. I wanted to create a grammar that can accept statements like if_(expr)[ statement-list ].else_[statement-list]. I created a if_expr type using proto::extends, and added a member called else_ to it, of type proto::function<proto::terminal<if_then_else>, Expr const&>. The code is given below. I am trying to match statements of the above form. Look for if_only_grammar and if_grammar below. The main function has 2 cases, one with just if_ and another with if_ and else_. My grammar matches neither of them. What am I doing wrong? I am quite the newbie to proto, so I am not still able to parse the compiler error message and understand it yet. I will be grateful for any help. Thanks, Manjunath #include <boost/proto/proto.hpp> #include <boost/mpl/bool.hpp> #include <boost/mpl/assert.hpp> #include <iostream> #include <sstream> #include <string> using namespace boost; using namespace std; unsigned int ids; template<typename VT> struct Var { unsigned int id; Var() { id = ++ids; } }; struct if_fun {}; struct program {}; struct if_then_else {}; struct if_domain; template <typename Expr> struct if_expr : proto::extends<Expr, if_expr<Expr>, if_domain> { typedef proto::extends<Expr, if_expr<Expr>, if_domain> base_type; using base_type::operator =; typedef typename proto::result_of::make_expr<proto::tag::function, if_then_else, Expr const &>::type else_type; else_type else_; if_expr(Expr const &e = Expr()) : base_type(e) , else_(proto::make_expr<proto::tag::function>(if_then_else(), boost::ref(e))) {} }; struct if_domain : proto::domain<proto::generator<if_expr> > { }; struct napl_grammar; struct arith_expr_grammar; struct rel_expr_grammar; struct assign_grammar; struct statement_grammar; struct bb_grammar; struct if_only_grammar : proto::or_< proto::subscript<proto::function<if_expr<proto::terminal<if_fun>::type>, rel_expr_grammar >, bb_grammar> > { }; struct if_grammar : proto::or_< if_only_grammar, proto::subscript<proto::function<proto::terminal<if_then_else>, if_only_grammar>, bb_grammar> > { }; struct arith_expr_grammar : proto::or_< proto::plus< arith_expr_grammar, arith_expr_grammar>, proto::minus< arith_expr_grammar, arith_expr_grammar>, proto::multiplies< arith_expr_grammar, arith_expr_grammar>, proto::divides< arith_expr_grammar, arith_expr_grammar>, proto::terminal<Var<int> >, proto::terminal<int>, rel_expr_grammar > { }; struct rel_expr_grammar : proto::or_< proto::less< arith_expr_grammar, arith_expr_grammar>, proto::greater< arith_expr_grammar, arith_expr_grammar>, proto::less_equal< arith_expr_grammar, arith_expr_grammar>, proto::greater_equal< arith_expr_grammar, arith_expr_grammar>, proto::equal_to< arith_expr_grammar, arith_expr_grammar>, proto::not_equal_to< arith_expr_grammar, arith_expr_grammar>, proto::logical_not< rel_expr_grammar> > { }; struct assign_grammar : proto::or_< proto::assign<proto::terminal<Var<int> >, arith_expr_grammar>, proto::assign<proto::terminal<Var<int> >, rel_expr_grammar> > { }; struct statement_grammar : proto::or_< assign_grammar, if_grammar > { }; struct bb_grammar : proto::or_< statement_grammar, proto::comma<bb_grammar, statement_grammar> > { }; struct napl_grammar : proto::or_< proto::terminal<program>, proto::subscript<proto::terminal<program>, bb_grammar> > { }; template<typename Expr> void check_and_execute(const Expr &e, mpl::true_) { cout << "Program printer TBD.\n"; } template<typename Expr> void check_and_execute(const Expr &e, mpl::false_) { cout << "Should not be here\n"; } template<typename Expr> void check_grammar(const Expr &e) { BOOST_MPL_ASSERT_MSG((proto::matches<Expr, napl_grammar>::value), SYNTAX_NOT_CORRECT, (void)); check_and_execute(e, proto::matches<Expr, napl_grammar>()); //cout << napl_grammar()(e) << "\n"; } int main() { proto::terminal<Var<int> >::type i1, i2, i3, i4, i5; proto::terminal<program>::type Program; if_expr<proto::terminal<if_fun>::type> if_; int i=4242; check_grammar( Program[ if_(i1 < i2) [ i2 ] ]); /* check_grammar( Program[ if_(i1 < i2) [ i2 ].else_[ i3 ] ]); */ }

2 2

[multi_index] modify_key with an iterator to composite_key
by Christian Holmquist 27 Jan '10

27 Jan '10

Hi, >From what I've found on the net (here: http://groups.google.com/group/boost-list/browse_thread/thread/687ce9662a4c…) about this problem, Joaquin explains that modify_key on a composite_key isn't supported. Relevant part from that thread is: When you use modify_key, you modifier functor is passed > *the key* rather than the whole element as is the case > with modify. In this particular situation, the key is > a composite key; so the key object (defined privately > by composite_key) is some entity that somehow references > entry::m_x and entry::m_y. This object is not exposed > to the public and you're not supposed to try to use > it or modify it, hence the problems you're seeing. > In short, when using composite_key you cannot use > modify_key. The alternative must be to use modify() instead, so I'd like to know how to get the best performance in the following scenario: My index is specified as. namespace bmi = boost::multi_index; struct Index : boost::mpl::vector2 < bmi::hashed_unique<bmi::member<Entry, std::string, &Entry::m_Name> >, bmi::ordered_non_unique < bmi::composite_key < Entry, bmi::member<Entry, int, &Entry::m_State>, bmi::member<Entry, int, &Entry::m_Timestamp> > > > {}; I frequently updated Entry::m_State and Entry::m_Timestamp, but never Entry::m_Name during the lifetime of an entry, thus I expected modify_key to be faster since the expensive hash index don't need to be updated. Since I cannot tell modify() which parts of the Entry I'm about to update, I don't see how I can avoid the rehashing. Maybe there's a better way to configure the index? I'm using Entry::m_State for an equal_range() search, while Entry::m_Timestamp is only for ordering (I bump the timestamp everytime I change m_State). I am using boost.1.35 btw Any response much appreciated, Christian

3 4

Is it possible to sort the vertices in adjacency_list ?
by Konstantin Silav 27 Jan '10

27 Jan '10

Hi, we have a graph with bundled properties for vertices, edges and graph it self. The vertices have X and Y Cartesian coordinates. Now I'd like to SORT them along one of the axis. Is it possible to do it "inside" the graph? Which container should i choose? Custom one? Does this change the edge mapping? Or do I need to copy the vertices in one external container? Thanks in advance!

1 0

Designing a table-like data structure with Fusion
by Matthias Vallentin 27 Jan '10

27 Jan '10

I am in the process of designing a table-like data structure and would like to hear your feedback on the choice of Fusion for this task. In the context of databases, a table contains multiple columns that exhibit different types (short, unsigned int, long long, etc...). Columns must be added at runtime. The table is column-oriented in that it stores each column individually, yet provides a row-oriented interface to add data. The table structure (aka. schema) remains immutable once all columns have been added. To benefit from the heterogeneous nature of Fusion, I would consider a table row a fusion::vector, maybe created using fusion::vector_tie from some arbitrary data. At the very high level, I think of something along the lines of: template <typename T> struct column { void write(const T& x) { // Store x in some fashion (memory or disk). } }; struct table { --> fusion::vector<???> cols; template <typename C> void add_column(C* c) { fusion::push_back(cols, c); } template<typename R> void write(const R& row) { // Writer simply calls c->write(x). fusion::for_each(fusion::zip(row, cols), writer()); } }; int main() { table t; ... auto* ic = new column<int>(); auto* dc = new column<double>(); t.add_column(ic); t.add_column(dc); ... } As you can see (at the mark -->), I need to cross at some point the compile-time/runtime boundary but I am having trouble designing that interface. Perhaps boost::variant might help here to bound the potential number of types? Any kind of thoughts are appreciated. Matthias -- Matthias Vallentin vallentin(a)icsi.berkeley.edu http://www.icir.org/matthias

2 2

BOOST_FUSION_ADAPT_STRUCT: non intrusive macro, get a fusion sequence of struct member types and member names
by Hicham Mouline 27 Jan '10

27 Jan '10

Hello, I am aware that it is planned to implement metafunctions that returned the list of member types of a struct, as well as members names, as fusion/mpl sequences. The macro uses some PP magic. My project has progressed that I think I need this feature to proceed. I may try my hand at implementing these features... Which files in boost/fusion are involved in the implementation of the macro? regards,

4 8

concise error messages
by Manjunath Kudlur 27 Jan '10

27 Jan '10

Hello, I wrote a small DSEL with proto. An example program can be found in the main function below. I use BOOST_MPL_ASSERT_MSG to check an expression against a grammar, and can make the compiler output a small string if the syntax is wrong. But I can do it only for the entire program. Is there a way to do finer grain grammar checking with proto? For example, I haven't defined the "<" operator for expressions, but when I use it in the DSEL code, I get 10 pages of error messages from g++, with the SYNTAX_NOT_CORRECT string somewhere. I would like to get somewhat more accurate than this. Any pointers? Thanks, Manjunath #include <boost/proto/proto.hpp> #include <boost/mpl/assert.hpp> #include <iostream> #include <sstream> #include <string> using namespace boost; using namespace std; unsigned int ids; template<typename VT> struct Var { unsigned int id; Var() { id = ++ids; } }; struct if_fun {}; struct program {}; struct VarName : proto::callable { typedef string result_type; template<typename T> result_type operator()(const Var<T> &v) { stringstream s; s << "V" << v.id; return string(s.str()); } result_type construct(string &l, string op, string &r) { return string(l + op + r); } result_type operator()(proto::tag::plus, string l, string r) { return construct(l, string(" + "), r); } result_type operator()(proto::tag::minus, string l, string r) { return construct(l, string(" - "), r); } result_type operator()(proto::tag::divides, string l, string r) { return construct(l, string(" / "), r); } result_type operator()(proto::tag::multiplies, string l, string r) { return construct(l, string(" * "), r); } result_type operator()(proto::tag::assign, string l, string r) { return string(construct(l, string(" = "), r) + string(";")); } result_type operator()(const int &x) { stringstream s; s << x; return string(s.str()); } result_type operator()(const if_fun&) { return string("if"); } result_type operator()(const program&) { return string("program"); } result_type operator()(proto::tag::function, string l, string r) { stringstream s; s << l << "(" << r << ")"; return string(s.str()); } result_type operator()(proto::tag::subscript, string l, string r) { stringstream s; s << l << " [\n"; s << r; s << "\n]\n"; return string(s.str()); } result_type operator()(proto::tag::comma, string l, string r) { stringstream s; s << l << "\n"; s << r; return string(s.str()); } }; struct napl_grammar; struct expr_grammar; struct bb_grammar; struct if_grammar : proto::or_< proto::when<proto::terminal<if_fun>, VarName(proto::_value)>, proto::when<proto::function<proto::terminal<if_fun>, expr_grammar>, VarName(proto::tag_of<proto::_expr>(), if_grammar(proto::_left), expr_grammar(proto::_right))> > { }; struct expr_grammar : proto::or_< proto::when<proto::plus< expr_grammar, expr_grammar>, VarName(proto::tag_of<proto::_expr>(), expr_grammar(proto::_left), expr_grammar(proto::_right))>, proto::when<proto::minus< expr_grammar, expr_grammar>, VarName(proto::tag_of<proto::_expr>(), expr_grammar(proto::_left), expr_grammar(proto::_right))>, proto::when<proto::multiplies< expr_grammar, expr_grammar>, VarName(proto::tag_of<proto::_expr>(), expr_grammar(proto::_left), expr_grammar(proto::_right))>, proto::when<proto::divides< expr_grammar, expr_grammar>, VarName(proto::tag_of<proto::_expr>(), expr_grammar(proto::_left), expr_grammar(proto::_right))>, proto::when<proto::assign< proto::terminal<Var<int> >, expr_grammar>, VarName(proto::tag_of<proto::_expr>(), expr_grammar(proto::_left), expr_grammar(proto::_right))>, proto::when<proto::terminal<Var<int> >, VarName(proto::_value)>, proto::when<proto::terminal<int>, VarName(proto::_value)>, proto::when<proto::subscript<if_grammar, bb_grammar>, VarName(proto::tag_of<proto::_expr>(), if_grammar(proto::_left), bb_grammar(proto::_right))> > { }; struct bb_grammar : proto::or_< proto::when<expr_grammar, expr_grammar(proto::_expr)>, proto::when<proto::comma<bb_grammar, expr_grammar>, VarName(proto::tag_of<proto::_expr>(), bb_grammar(proto::_left), expr_grammar(proto::_right))> > { }; struct napl_grammar : proto::or_< proto::when<proto::terminal<program>, VarName(proto::_value)>, proto::when<proto::subscript<proto::terminal<program>, bb_grammar>, VarName(proto::tag_of<proto::_expr>(), napl_grammar(proto::_left), bb_grammar(proto::_right))> > { }; template<typename Expr> void check_grammar(const Expr &e) { BOOST_MPL_ASSERT_MSG((proto::matches<Expr, napl_grammar>::value), SYNTAX_NOT_CORRECT, (void)); cout << napl_grammar()(e) << "\n"; } template<typename Expr> void check_if_grammar(const Expr&) { BOOST_MPL_ASSERT_MSG((proto::matches<Expr, if_grammar>::value), IF_SYNTAX_NOT_CORRECT, (if_grammar)); } template<typename Expr> void check_expr_grammar(const Expr &e) { BOOST_MPL_ASSERT_MSG((proto::matches<Expr, expr_grammar>::value), EXPR_SYNTAX_NOT_CORRECT, (expr_grammar)); cout << expr_grammar()(e) << "\n"; } template<typename Expr> void check_bb_grammar(const Expr &e) { BOOST_MPL_ASSERT_MSG((proto::matches<Expr, bb_grammar>::value), BB_SYNTAX_NOT_CORRECT, (bb_grammar)); cout << bb_grammar()(e) << "\n"; } int main() { proto::terminal<Var<int> >::type i1, i2, i3, i4, i5; proto::terminal<program>::type Program; proto::terminal<if_fun>::type if_; check_grammar( Program[ i2 = 1 + i2, i3 = i3 * i3, i3=i4/i4, i3=i5-23, if_(i1) [ i2=1, i2, if_(i2) [ i3=1, i3=i5, if_(i3) [ i1=1, i4=42+i4 ] ] ] ] ); /* check_if_grammar( if_(i1)); check_bb_grammar((i4=i1+i2+42, i2=2, i3=i2/42, if_(i1)[i2=3, i3=0])); */ }

4 4

Newbie: Compiling Boost 1.28.0 or later for 64-bit Solaris 10
by Gregory Tyler 27 Jan '10

27 Jan '10

Hi, I'm new to Boost, and I have not used C++ in years. I have been asked to determine whether Boost 1.28.0 (or a later version, if necessary) can be compiled for 64-bit Solaris 10, and if so, then what precautions must be taken. I found this page, which seems to suggest that Boost cannot currently be compiled for Solaris 10: http://groups.google.com/group/boost-list/browse_thread/thread/091716aaf543… On the other hand, this page seem to suggest that it is possible: http://shoaibmir.wordpress.com/2009/08/12/building-boost-under-solaris/ Does anyone have any advice or suggestions? If it matters, I have a Java/JEE background. Thanks in advance, Greg _________________________________________________________________ Hotmail: Trusted email with Microsoft’s powerful SPAM protection. http://clk.atdmt.com/GBL/go/196390706/direct/01/

2 1

[libboost_mpi-vc90-mt-gd-1_40 . lib]Where can I get this library?
by Juliet Villanueva 27 Jan '10

27 Jan '10

Hi: I am trying to configure MPI boost, when you finish all the steps that come within the documentation, and try to compile a simple example, visual compiler tells me that the library lacks libboost_mpi-vc90-mt-gd-1_40 . lib, which is not where you get, I already have installed JAM on my computer, along with the installation of MPI and MPICH2 Boost, recognizes all of MPI include, with out any problem, it only takes me that library, I hope I can help. Tania. Encuentra las mejores recetas en Yahoo! Cocina. http://mx.mujer.yahoo.com/cocina/

2 1

help
by sebastian cheung 27 Jan '10

27 Jan '10

where to begin? I think I have downloaded Boost 1_40 zip, not sure how to start anything with it or do useful appplications? Help

3 3

Re: [Boost-users] C++ and quality of software
by Kenneth Laskoski 26 Jan '10

26 Jan '10

I risk keeping on spamming, but anyway, here are some words from inside Google. Sean Parent once worked at Adobe, where it acted as Adobe Source ibraries developer. ASL is a fine library that I often use as a complement to boost. He recently (Oct 2009) wrote in the asl-devel mailing list: <citation> I'm now at Google working on ChromeOS. The Google style guide (adhered to by most of Google) has made it a bit difficult for me to spend too much time on ASL. [...] Some of the more challenging parts are - limited use of Boost, no exception handling, and discouraged copy and assignment. Right now I feel like I'm coding with one hand behind my back </citation> I think that style guide is pretty phased out by now, almost twelve years after the C++98 Standard. Yours, Kenneth

1 0

Thread-safe singleton pattern
by Andrew Chinkoff 26 Jan '10

26 Jan '10

Having considered [ http://www.research.ibm.com/designpatterns/pubs/ph-jun96.txt] I propose singleton implementation. I had attached "singleton.hpp" to this letter. Below is the test program: #include <stdio.h> #include <singleton.hpp> class A : public boost::Singleton<A> { // // Only Singleton class can create and delete us! // SINGLETON_IS_MY_FRIEND; public: void foo(){ printf("foo!\n"); } A(){ printf("A()\n"); } ~A(){ printf("~A()\n"); } }; void main() { // It is not compiled: //A a = A::Instance(); // That is exactly as it should be used: A::Instance().foo(); } Test program outputs: A() foo! ~A() Does Boost community think that boost::Singleton is convenient solution?

2 1

[boost-users][propertytree] How to access xml attributes.
by Germán Diago 26 Jan '10

26 Jan '10

Hello. I've been reading the docs for boost.ptree and I couldn't find how to access xml attributes. I just found how to access the text for the elements. Is it possible to access attributes? Thanks in advance.

1 0

[function] rare crash on destroy
by Igor R 26 Jan '10

26 Jan '10

Hello, In my application I use to "post" a pointer to a dynamically allocated boost::function to a hidden window in the following manner (WinXP, MSVC9.0, 1.41): typedf function<void(void)> Functor; #define AM_FUNCTOR (WM_USER+79) // called from some "worker" thread void post(const Functor &func) { Functor *f = new Functor(func); PostMessage(hWind_, AM_FUNCTOR, 0, reinterpret_cast<LPARAM>(f)); } // Window procedure, called from the window thread LRESULT CALLBACK WndProc(HWND hwnd, UINT msg, WPARAM wParam, LPARAM lParam) { switch(msg) { case AM_FUNCTOR: { Functor *f = reinterpret_cast<Functor *>(lParam); (*f)(); delete f; } //.... } post() is called several times per second. Sometimes - but *very* rarely - the line "delete f" causes a crash (Access violation reading location 0xfeeefef6). The application is compiled with /Ox /GL, linked with /LTCG. What could be wrong with this code? Callstack: function_base.hpp, line 323: functor_manager_common::manage_small(): reinterpret_cast<functor_type*>(&out_buffer.data)->~Functor(); // THIS LINE CRASHES function_base.hpp, line 432: functor_manager::manage(): manager(in_buffer, out_buffer, op, tag_type()); The assembly code looks like this: 100134C9 mov esi,dword ptr [esi+0Ch] 100134CC test esi,esi 100134CE je boost::detail::function::functor_manager_common::manage_small+9Eh 100134D0 mov eax,dword ptr [esi] 100134D2 mov ecx,dword ptr [eax+8] // CRASHES HERE, as eax == 0xfeeefeee 100134D5 push esi 100134D6 call ecx Thanks in advance.

3 6

multi_index_container assertion after crash
by Eli Zakashansky 26 Jan '10

26 Jan '10

Hi, I have an application which uses a persistent multi_index_container (I am using bip::managed_mapped_file && after openning the file I do "container = mappedFile->find_or_construct(...)"). I have an interesting behavior when my process crashes/stopped during massive use of the multi_index_container after the process restarts I don't experience any problems reading or inserting new elements to the container but if I try to erase elements or call mutli_index_container::clear (Debug mode only BOOST_MULTI_INDEX_ENABLE_SAFE_MODE is defined) an assertion pops up (safe_mode::Check_same_owner / safe_mode::Check_valid_iterator). At first I thought that this kind of assertion fails due to concurrency issue, but it is not the case (I verified that this data structure is not accessed from more than one thread at a time, during this time the container is locked). Does anyone has any idea what can cause this situation? Or has a resolution ? Thanks a lot in advance, Eli.

5 16

Tracking down a race condition
by Stephen Torri 26 Jan '10

26 Jan '10

In the logging example I have been working on to learn more about boost threads I have run across what I think is a race condition. If I compile and run this sample program it will sometimes write out an error message to a file. For example: 2010-01-23_16:2:23 (pid=10948 thread_id=0x92ce448) (II) funky Other times I see the file is blank. So can I say conclusively that its a race condition? No. Either what is happening is a race condition where the file is closed before the contents are written to the file or something else is causing the logging message to be written sometimes and not at others. So to recap: --- How can you track down a race condition? --- Can I use 'strace' or 'gdb'? Stephen ------------------------------------------- #include <boost/cstdint.hpp> #include <boost/shared_ptr.hpp> #include <boost/thread/mutex.hpp> #include <boost/thread/condition_variable.hpp> #include <boost/thread/thread.hpp> #include <boost/utility.hpp> #include <boost/thread/once.hpp> #include <boost/scoped_ptr.hpp> #include <boost/type_traits/aligned_storage.hpp> #include <boost/bind.hpp> #include <boost/format.hpp> #include <boost/date_time/posix_time/posix_time.hpp> #include <boost/cstdint.hpp> #include <fstream> #include <sstream> #include <vector> namespace myproject { namespace api { /*! * \brief Trace level constants * \date 2003 * \author Stephen Torri */ class TraceLevel { public: enum Values { NONE = 0, WARN = 10, ERROR = 20, INFO = 30, DEBUG = 40, DETAIL = 50, DATA = 60 }; }; } // namespace api } // namespace myproject namespace myproject { namespace interface { class ITraceable { public: typedef boost::shared_ptr<ITraceable> ptr_t; virtual std::string get_Formatted_String() = 0; virtual boost::uint32_t getLevel() = 0; virtual boost::uint32_t getPID() = 0; virtual boost::thread::id getThreadID() = 0; }; } // namespace interface } // namespace myproject namespace myproject { namespace trace { class StringTraceable : public interface::ITraceable { public: StringTraceable ( boost::uint32_t area, boost::uint32_t level, std::string name ) : m_area ( area ), m_level ( level ), m_name ( name ) { #ifndef WIN32 m_pid = getpid(); #else m_pid = GetCurrentProcessId(); #endif /* WIN32 */ m_thread_id = boost::this_thread::get_id(); } virtual ~StringTraceable(){} virtual std::string get_Formatted_String() { return m_name; } virtual boost::uint32_t getLevel() { return m_level; } virtual boost::uint32_t getPID() { return m_pid; } virtual boost::thread::id getThreadID() { return m_thread_id; } private: boost::uint32_t m_area; boost::uint32_t m_level; boost::uint32_t m_pid; boost::thread::id m_thread_id; std::string m_name; }; template <typename UnsignedType> class NumberTraceable : public interface::ITraceable { public: NumberTraceable ( boost::uint32_t area, boost::uint32_t level, std::string name, UnsignedType line ) : m_area ( area ), m_level ( level ), m_name ( name ), m_line ( line ) { #ifndef WIN32 m_pid = getpid(); #else m_pid = GetCurrentProcessId(); #endif /* WIN32 */ m_thread_id = boost::this_thread::get_id(); } virtual ~NumberTraceable(){} virtual std::string get_Formatted_String() { return m_name; } virtual boost::uint32_t getLevel() { return m_level; } virtual boost::uint32_t getPID() { return m_pid; } virtual boost::thread::id getThreadID() { return m_thread_id; } private: boost::uint32_t m_area; boost::uint32_t m_level; boost::uint32_t m_pid; boost::thread::id m_thread_id; std::string m_name; UnsignedType m_line; }; template <typename T> struct storage_for { boost::aligned_storage<sizeof(T), boost::alignment_of<T>::value> data; }; template <typename T> class Singleton : boost::noncopyable { public: static T& Instance() { boost::call_once ( init, m_flag ); return *m_obj; } static void init () { m_obj.reset ( new T() ); } protected: ~Singleton(){} Singleton(){} private: static boost::scoped_ptr<T> m_obj; static boost::once_flag m_flag; }; } // namespace trace } // namespace trace template <typename T> boost::scoped_ptr<T> myproject::trace::Singleton<T>::m_obj ( 0 ); template <typename T> boost::once_flag myproject::trace::Singleton<T>::m_flag = BOOST_ONCE_INIT; namespace myproject { namespace trace { class Trace_State_Utils { public: static std::string get_Level_String ( boost::uint32_t level ) { // Write message prefix if ( level == api::TraceLevel::WARN ) { return "(WW) "; } else if ( level == api::TraceLevel::ERROR ) { return "(EE) "; } else if ( level == api::TraceLevel::INFO ) { return "(II) "; } else if ( level == api::TraceLevel::DEBUG ) { return "(DEBUG) "; } else if ( level == api::TraceLevel::DETAIL ) { return "(DETAIL) "; } else if ( level == api::TraceLevel::DATA ) { return "(DATA) "; } else { // We should not be here abort(); } } }; /* Idea taken from http://www.codeproject.com/debug/xytrace.asp * (28 Jan 2002 - Xiangyang Liu) * * I have modified this so that we don't use varargs and use constant types */ class Trace_State { public: typedef boost::shared_ptr<Trace_State> ptr_t; Trace_State() : m_file_prefix ( "Trace" ) {} virtual ~Trace_State(); Trace_State ( std::string prefix ); void set_Trace_File_Prefix ( std::string name ); void set_Trace_Level ( boost::uint32_t level ); void set_Trace_Area_Mask ( boost::uint32_t mask ); void open_Trace_File ( void ); std::string get_ID_String ( void ); void close_Trace_File ( void ); boost::uint32_t get_Trace_Level ( void ) const; boost::uint32_t get_Trace_Area_Mask ( void ) const; bool is_Valid_Level ( boost::uint32_t lvl ); bool is_Valid_Area_Mask ( boost::uint32_t mask ); void write_Message ( interface::ITraceable::ptr_t trace ) { // Write ID m_log_stream << boost::format("%s (pid=%d thread_id=" ) % this->get_ID_String() % trace->getPID() << trace->getThreadID() << ") " << std::flush; m_log_stream << Trace_State_Utils::get_Level_String(trace->getLevel()) << trace->get_Formatted_String() << std::endl << std::flush; } private: std::string m_file_prefix; std::ofstream m_log_stream; }; } /* namespace trace */ } /* namespace trace */ namespace myproject { namespace trace { Trace_State::Trace_State( std::string prefix ) : m_file_prefix ( prefix ) {} Trace_State::~Trace_State() { this->close_Trace_File(); } void Trace_State::set_Trace_File_Prefix ( std::string name ) { } bool Trace_State::is_Valid_Level ( boost::uint32_t lvl ) { return true; } bool Trace_State::is_Valid_Area_Mask ( boost::uint32_t ) { return true; } void Trace_State::set_Trace_Level ( boost::uint32_t level ) { } void Trace_State::set_Trace_Area_Mask ( boost::uint32_t mask ) { } void Trace_State::open_Trace_File ( void ) { if ( ! m_log_stream.is_open() ) { // Create file name std::stringstream name; name << boost::format("%s_%s.txt") % m_file_prefix % this->get_ID_String(); std::string file_name = name.str(); m_log_stream.open ( file_name.c_str() ); } } std::string Trace_State::get_ID_String ( void ) { // Create id string std::stringstream name; // Get current time boost::posix_time::ptime now = boost::posix_time::second_clock::local_time(); std::tm tm_ref = boost::posix_time::to_tm ( now ); boost::gregorian::date today = now.date(); name << boost::format ( "%1%_%2%:%3%:%4%" ) % boost::gregorian::to_iso_extended_string ( today ) % tm_ref.tm_hour % tm_ref.tm_min % tm_ref.tm_sec; return name.str(); } void Trace_State::close_Trace_File ( void ) { if ( m_log_stream.is_open() ) { m_log_stream << std::flush; m_log_stream.close(); } } boost::uint32_t Trace_State::get_Trace_Level ( void ) const { return 0; } boost::uint32_t Trace_State::get_Trace_Area_Mask ( void ) const { return 0; } } /* namespace trace */ } /* namespace trace */ namespace myproject { namespace trace { // // Turn Trace into a singleton class that contains a worker thread // - Wait for data // - If data exists then process // - Else wait // Add method for adding a ITraceable object. This will lock the logging vector, add // element then signal the boost condition variable class Trace : public Singleton<Trace> { friend class Singleton<Trace>; public: ~Trace(); static void write_Trace ( boost::uint32_t area, boost::uint32_t level, std::string name ) { interface::ITraceable::ptr_t string_ptr ( new StringTraceable ( area, level, name ) ); Trace::Instance().add_Trace ( string_ptr ); } template <typename UnsignedType> static void write_Trace ( boost::uint32_t area, boost::uint32_t level, std::string format, UnsignedType value ) { interface::ITraceable::ptr_t unsigned_ptr ( new NumberTraceable<UnsignedType> ( area, level, format, value ) ); Trace::Instance().add_Trace ( unsigned_ptr ); } void add_Trace ( interface::ITraceable::ptr_t trace ); void set_Trace_Level ( boost::uint32_t level ); void set_Trace_Area_Mask ( boost::uint32_t mask ); void open_Trace_File (); void close_Trace_File(); private: Trace(); // Worker thread functions void threadMain(); void processTraces(boost::unique_lock<boost::mutex>& lock); // Synchronization variables boost::mutex m_lock; boost::condition_variable m_condition; // Data variables typedef std::vector < myproject::interface::ITraceable::ptr_t > QueueType; QueueType m_queue; // Thread variables boost::shared_ptr<boost::thread> m_thread; bool m_hasWork; // Logging Trace_State m_state; }; } /* namespace trace */ } /* namespace myproject */ namespace myproject { namespace trace { Trace::Trace () : m_hasWork ( true ), m_state ( "Trace" ) { // start thread m_thread = boost::shared_ptr<boost::thread> ( new boost::thread ( boost::bind ( &Trace::threadMain, this ) ) ); } Trace::~Trace() { // stop thread { boost::lock_guard<boost::mutex> lock ( m_lock ); m_hasWork = false; } m_condition.notify_one(); m_thread->join(); } void Trace::add_Trace ( interface::ITraceable::ptr_t trace ) { // lock queue { boost::lock_guard<boost::mutex> lock ( m_lock ); m_queue.push_back ( trace ); } m_condition.notify_one(); } void Trace::threadMain() { boost::unique_lock<boost::mutex> lock ( m_lock ); while ( m_hasWork ) { if ( m_queue.size() == 0 ) { m_condition.wait ( lock ); } else { this->processTraces(lock); } } } void Trace::processTraces(boost::unique_lock<boost::mutex>& lock) { assert ( lock.owns_lock() ); QueueType local_queue ( m_queue.begin(), m_queue.end() ); m_queue.clear(); lock.unlock(); for ( QueueType::iterator pos = local_queue.begin(); pos != local_queue.end(); pos++ ) { myproject::interface::ITraceable::ptr_t trace_obj = (*pos); m_state.write_Message ( trace_obj ); } lock.lock(); } void Trace::set_Trace_Level ( boost::uint32_t level ) { m_state.set_Trace_Level ( level ); } void Trace::set_Trace_Area_Mask ( boost::uint32_t mask ) { m_state.set_Trace_Area_Mask ( mask ); } void Trace::open_Trace_File() { m_state.open_Trace_File(); } void Trace::close_Trace_File() { m_state.close_Trace_File(); } } /* namespace trace */ } /* namespace myproject */ int main ( int, char** ) { namespace trace = myproject::trace; namespace api = myproject::api; trace::Trace::Instance().open_Trace_File(); myproject::interface::ITraceable::ptr_t tmp_ptr ( new trace::StringTraceable( 0, api::TraceLevel::INFO, "funky" ) ); trace::Trace::Instance().add_Trace ( tmp_ptr ); trace::Trace::Instance().close_Trace_File(); }

3 4

[chrono] v0.3.2 New frequency, lifetime and percentage stopwatch_accumulator features
by vicente.botet 26 Jan '10

26 Jan '10

Hi, I have update the Boost.Chrono library with some minor features, a lot of bug fixes, and started the tutorial with some examples of features interesting people since the last version. New Features: * Added overloading for operator/(Integer/Duration) (used to get the frequency) * Added frequency, lifetime and percentage to the stopwatch_accumulator. The default format is "%c times, sum%ss, min%ms, max%Ms, mean%as, frequency%fherzs, lifetime%ls, percentage=%p%\n", where %c : the counter of the number of times the pair start/stop has been called. %s : the sum of the samples of elapsed time between the call to start/stop. %m : the min of the samples of elapsed time between the call to start/stop. %M : the max of the samples of elapsed time between the call to start/stop. %a : the mean of the samples of elapsed time between the call to start/stop. %f : the frequency of calls to start. %l : the lifetime of the stopwatch_accumulator. %p : the percentage of time spent by this stopwatch respect to its lifetime. Bug Fixes * Specific formatters didn't work completly * Replace duration(0) by duration::zero() on template classes. * suspend didn't work: partial_ not initialized neither taken in account by the elapsed function. The library can be downloaded from http://www.boostpro.com/vault/index.php?action=downloadfile&filename=chrono… and the documentation is online on the sandbox http://svn.boost.org/svn/boost/sandbox/chrono/libs/chrono/doc/html/index.ht…. SVN repository http://svn.boost.org/svn/boost/sandbox/chrono. I would like to thanks particularly Andrew Chinkoff for his suggestion of the frequency feature and all those that have tried the library and reported the bugs they found, either on this ML or personally. I would really appreciate if people having the possibility to test on other platforms/compilers report me how the library works. As you can see the library is already on the review schedule, waiting for a review manager and a date for the review. I expect to add yet some features for the review release as thread clocks, and suspensible clocks i.e. clocks that can be suspended/resumed. Any idea for better naming the concepts/classes is welcome. Hoping this release works better for you, Vicente (See below the contents of preceding releases) ----- Original Message ----- From: "vicente.botet" <vicente.botet(a)wanadoo.fr> To: <boost-users(a)lists.boost.org>; <boost(a)lists.boost.org> Sent: Wednesday, January 20, 2010 11:02 PM Subject: [chrono] v0.3.1 Support for wide characters Hi, this new version includes: * Added support for wide characters on formatters. * Added chrono.hpp and stopwatches.hpp header files at the boost level. * Update of the doc taking care of preceding comments. Comments are welcome :) Best, Vicente ----- Original Message ----- From: "vicente.botet" <vicente.botet(a)wanadoo.fr> To: <boost(a)lists.boost.org>; <boost-users(a)lists.boost.org> Sent: Sunday, January 17, 2010 9:14 PM Subject: [chrono] v0.3 New Stopwatch Feature Hi, I'm pleased to announce the new version of the Boost.Chrono library. The implementaton is quite stable; the new interface could suffer of some modifications, renaming, ... as far as you submit some proposals. I would request a formal review soon and I will need a review manager. I know that review managers are hard to find, so if you are interested in the library, please the Review Wizards. The library can be downloaded from http://www.boostpro.com/vault/index.php?action=downloadfile&filename=chrono… and the documentation is online on the sandbox http://svn.boost.org/svn/boost/sandbox/chrono/libs/chrono/doc/html/index.ht…. I've tested it with gcc and MSVC. Previoous version of the library have been testted on Mac, but I'm not able to test this platform. Could someone check if there are some regressions on Mac? New Features: * Process cpu clocks * Independent process cpu clocks for real, user, system process CPU time * Global process cpu clock for real, user, system process CPU time * Stopwatch concept measuring elapsed time between different points in time associated to the operations start, stop, suspend and resume. * stopwatch is a model Stopwatch measuring the elapsed time between the start and the stop operations. * stopwatch_accumulator is a model Stopwatch allowing to accumulate several time samples and give the average, ... * Scoped helper classes allowing to pairwise start/stop operations, suspend/resume and resume/suspend a Stopwatch. * Stopwatch Formatter concept * stopwatch formatter "%ds\n" * stopwatch accumulator formatter "%c times, sum%ss, min%ms, max%Ms, mean%as\n" * time formatter "real %rs, cpu %cs (%p%), user %us, system %ss\n" * digital_time decomposition class separating days, hours,minutes,seconds, nanoseconds from any duration class (looking for a better name) * digital_time formatter "%d days(s) %h:%m:%s.%n\n" * stopwatch_reporter is a convenient generic class reporting elapsed time for the Stopwatch concept. * stopclock<Clock> shortcut stopwatch_reporter<stopwatch<Clcok>> * typeof registration for classes duration and time_point Depreceated Features: * The classes process_times, process_clock, process_timer, timer and run_timer are now deprecated as the preceding additions are more generic. However for backward compatibility they are preserved until inclusion of the library in Boost. Next follows the equivalences: timer<> ~ stopwatch<> process_timer ~ stopwatch<process_cpu_clock> run_timer ~ stopclock<> Bug Fixes * Try to correct warning C4251: 'boost::chrono::run_timer::m_format' : class 'std::basic_string<_Elem,_Traits,_Ax>' needs to have dll-interface to be used by clients of class 'boost::chrono::run_timer', by don't including inlines functions using the std::string m_format. For people that doesn't know it yet, Boost.Chrono library provides: * The C++0x Standard Library's common_type. * The C++0x Standard Library's compile-time rational arithmetic. * The C++0x Standard Library's time utilities, including: * Class template duration * Class template time_point * Clocks: * system_clock * monotonic_clock * high_resolution_clock * typeof registration for classes duration and time_point * Process clocks: * process_real_CPU_clocks, capturing real-CPU times. * process_user_CPU_clocks, capturing user-CPU times. * process_system_CPU_clocks, capturing system-CPU times. * process_cpu_clock, tuple-like class capturing at once real, user-CPU, and system-CPU times. * Stopwatches: * stopwatch, capturing elapsed Clock times. * stopwatch_accumulator, capturing cummulated elapsed Clock times. * scoped helper classes allowing to pairwise start/stop operations, suspend/resume and resume/suspend a Stopwatch. * Stopclocks or Stopwatch reporters: * stopwatch_reporter, convenient reporting of models of Stopwatch results. * stopclock<Clock> shortcut of stopwatch_reporter<stopwatch<Clock>> Best regards, _____________________ Vicente Juan Botet Escribá

1 0

Boost::Asio - blocking read on socket does not disconnect when socket closed from other thread
by Nick Aschberger 25 Jan '10

25 Jan '10

Hi Folks, Boost version is 1.36, OS is linux rhel-4. I have an application with two threads. The secondary thread is a worker thread that manages a boost::asio tcp/ip socket. The worker thread performs blocking reads as per: try { boost::system::error_code error; boost::asio::read(mysocket, boost::asio::buffer(inputbuffer, size_to_read), boost::asio::transfer_all(), error); if(error) { throw boost::system::system_error(error); } } catch(boost::system::system_error se){ // log error here return false; } In the main application thread, in response to the user choosing to close the connection, I do: mysocket.cancel(); mysocket.close(); I would expect the worker thread to return from the blocking boost::asio::read call, with an error. This occurs on windows, but does not happen on the linux build of my app - it never returns from the above call. Why does the second thread never return? What am I doing wrong? I have considered: - implementing a timeout - but I don't want to move to async sockets. - It seems SO_RCVTIMEO, is wrapped by boost::asio::read, so no hope there. - I could kill the thread but that means it isn't cleaned up properly, so that is no good. What am I doing wrong? cheers Nick Aschberger

2 3

Boost 1.33.1 on 64-Bit Solaris/GNU gcc 3.4.6/BJam 3.1.11
by Gregory Tyler 25 Jan '10

25 Jan '10

Hi, I'm new to Boost, and I have not used C++ in years. I have been asked to determine whether Boost 1.33.1 can be compiled for 64-bit Solaris, and if so, then what precautions must be taken. I found this page, which seems to suggest that Boost cannot currently be compiled for Solaris 10: http://groups.google.com/group/boost-list/browse_thread/thread/091716aaf543… On the other hand, this page seem to suggest that it is possible: http://shoaibmir.wordpress.com/2009/08/12/building-boost-under-solaris/ With GNU gcc 3.4.6, I seem to have successfully built BJam 3.1.11, the version of Boost Jam which is contemporary with Boost 1.33.1. When I try to build Boost, I'm getting the following error: PATH_TO_BOOST_HOME/tools/build/v1/boost-base.jam:1585: in find-compatible-subvariant *** argument error * rule split-target-subvariant ( target-var properties-var toolset-var variant-var : subvariant ) * called with: ( sv-target sv-properties sv-toolset sv-variant : <@boost!libs!serialization!build>libboost_serialization.a|gcc//<cxxflags>-Wno-non-virtual-dtor -Wno-ctor-dtor-privacy/<define>BOOST_LIB_DIAGNOSTIC=1/<sysinclude>PATH_TO_BOOST_HOME/<tag><prefix>-gcc-1_33_1/<address-model>default/<architecture>native/<build>yes/<debug-symbols>on/<inlining>off/<instruction-set>default/<object-model>default/<optimization>off/<profiling>off/<rtti>on/<runtime-link>dynamic/<shared-linkable>false/<target-type>LIB/<threading>single/<vtable-thunks>default|gcc| <@boost!libs!serialization!build>libboost_serialization.a|gcc/debug/<address-model>default/<architecture>native/<debug-symbols>on/<inlining>off/<instruction-set>default/<object-model>default/<optimization>off/<profiling>off/<rtti>on/<shared-linkable>false/<threading>single/<vtable-thunks>default/<cxxflags>-Wno-non-virtual-dtor -Wno-ctor-dtor-privacy/<define>BOOST_LIB_DIAGNOSTIC=1/<sysinclude>PATH_TO_BOOST_HOME/<tag><prefix>-gcc-d-1_33_1/<build>yes/<runtime-link>dynamic/<target-type>LIB|gcc|debug ) * extra argument <@boost!libs!serialization!build>libboost_serialization.a|gcc/debug/<address-model>default/<architecture>native/<debug-symbols>on/<inlining>off/<instruction-set>default/<object-model>default/<optimization>off/<profiling>off/<rtti>on/<shared-linkable>false/<threading>single/<vtable-thunks>default/<cxxflags>-Wno-non-virtual-dtor -Wno-ctor-dtor-privacy/<define>BOOST_LIB_DIAGNOSTIC=1/<sysinclude>PATH_TO_BOOST_HOME/<tag><prefix>-gcc-d-1_33_1/<build>yes/<runtime-link>dynamic/<target-type>LIB|gcc|debug PATH_TO_BOOST_HOME/tools/build/v1/boost-base.jam:2032:see definition of rule 'split-target-subvariant' being called PATH_TO_BOOST_HOME/tools/build/v1/boost-base.jam:1654: in link-libraries PATH_TO_BOOST_HOME/tools/build/v1/boost-base.jam:1857: in generate-dependencies PATH_TO_BOOST_HOME/tools/build/v1/boost-base.jam:1964: in subvariant-target PATH_TO_BOOST_HOME/tools/build/v1/boost-base.jam:2406: in stage Jamfile:226: in load-jamfiles PATH_TO_BOOST_HOME/tools/build/v1/bootstrap.jam:21: in boost-build PATH_TO_BOOST_HOME/boost-build.jam:16: in module scope Does this look familiar to anyone? What am I doing incorrectly? Thanks in advance, Greg _________________________________________________________________ Hotmail: Free, trusted and rich email service. http://clk.atdmt.com/GBL/go/196390708/direct/01/

2 1

[smart pointer] need .get() to access derived class method?
by Diederick C. Niehorster 25 Jan '10

25 Jan '10

Hi All, I am trying to wrap my head around using shared pointer, but I find the documentation hard to follow, not being a professional programmer. I have a base class, from which many classes are derived and I hold the derived class instance as a point of type baseclass. Usually, I only need access to the base class methods, but now i need to access some of the derived class's methods. How do I do that from a shared pointer? I now have some mix of shared_pointer and "old style" pointer logic in my code, what am I missing? --- _pcStim = boost::shared_ptr<CStim>(new CStimUniform2D()); // create derived instance and store as base CStim* pCStimU = _pcStim.get(); // get raw pointer ((boost::shared_ptr<CStimUniform2D>)(_pcStim))->setNPointGround()=300; // this does not work, what do I need here? ((CStimUniform2D*)pCStimU)->SetPointColor()=_pRoomData->dotColor(); // casting the raw pointer I am fine. --- Best regards and thank you for your reply, Diederick Niehorster

2 3

bjam with cross toolchain
by Pascal Kesseli 25 Jan '10

25 Jan '10

Hi everyone Currently, I am trying to get bjam compile boost using an embedded toolchain. The toolchain runs on windows, but the target is a linux device. The toolchain behaves more or less like a normal linux toolchian and I am using msys to simulate the shell environment. Trying to compile boost immediately issues the following errors: "g++" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -mthreads -Winvalid-pch -DBOOST_ALL_NO_LIB=1 -DBOOST_BUILD_PCH_ENABLED -I"bin.v2\libs\math\build\gcc-3.3.2\debug\link-static\threading-multi\..\src \tr1" -I"." -I"libs\math\src\tr1" -c -o "bin.v2\libs\math\build\gcc-3.3.2\debug\link-static\threading-multi\ellint_2 f.o" "libs\math\build\..\src\tr1\ellint_2f.cpp" ...failed gcc.compile.c++ bin.v2\libs\math\build\gcc-3.3.2\debug\link-static\threading-multi\ellint_2f .o... gcc.compile.c++ bin.v2\libs\math\build\gcc-3.3.2\debug\link-static\threading-multi\ellint_3f .o cc1plus: error: invalid option `threads' cc1plus: error: unrecognized option `-Winvalid-pch' >From what I perceive here, I would say bjam tries to use the toolchain as a MinGW toolchain. How can I tell boost to use Linux toolchain settings, so use -pthread instead of -mthread and omit that strange "-Winvalid-pch" parameter? Thanks for any suggestions and best regards Pascal

2 1

[bind][make_shared] compilation failure with ref arg
by Jeff Flinn 25 Jan '10

25 Jan '10

The last statement below fails to compile with boost 1.39.0 on MSVC 8. Am I doing anything obviously wrong? Any help is appreciated. Jeff #include <boost/bind.hpp> #include <boost/smart_ptr/make_shared.hpp> struct X { X(const int* ) {} }; struct Y { Y(int& ) {} }; int _main(int argc, char* argv[]) { int i = 123; boost::bind(&boost::make_shared<int>); boost::bind(&boost::make_shared<int, int>, i); boost::bind(&boost::make_shared<int, int>, 123); boost::bind(&boost::make_shared<X, int*>, &i); boost::bind(&boost::make_shared<Y, int&>, boost::ref(i)); return 0; }

2 2

[interprocess] shared_memory_object constructor with create_only parameter
by Philipp Hamann 25 Jan '10

25 Jan '10

Hi all, I have some problems using the shared_memory_object constructor with the create_only parameter. The goal is to allow only one process to write to the shared memory. So I create a shared_memory_object with the create_only parameter. For the first process this is successful (as I assumed), but for the second process (same parameters) this is successful, too (not as I assumed). The documentation of boost says that it should throw an exception, if the shared memory is allready created. Is this a bug or a misuse or understanding of the library? I am using WinXP, boost 1.41 and MinGW 5.1.6. Probably this is a problem concerning the special handling of the shared memory using Windows? I realized another problem. If I call the static function shared_memory_object::remove(const char* name), the memory should be removed only when no further process has access to the memory. This seems also not to work. I did the following: 1. create shared memory for writing. 2. open shared memory for reading 3. shared_memory_object::remove(const char* name) (from the reading process) 4. reopen the shared memory for reading -> exception: can not find the file Any suggestions to my issues? Thanks in advance Philipp

1 0

[Test] Problem with autolink
by Simon Pickles 25 Jan '10

25 Jan '10

Hello, I have been using boost.test with reasonable success, then all of a sudden I have a link error. Obviously I have changed something aobut my project settings. Perhaps someone could help me identify what I have done. I am using boost 1.41.0 on msvc 9.0. The linker is looking for LINK : fatal error LNK1104: cannot open file 'boost_unit_test_framework-vc90-mt-gd-1_41.lib' This lib is not built by running bjam. I have tried all manner of bjam arguments even: bjam --build-type=complete but I only get boost*.dll and libboost*.lib libraries built. I have tried adding #define BOOST_TEST_DYN_LINK and removing it! All this has no effect on my link error, or the file to which the linker is linking. Thanks for any guidance. Si

2 1

Re: [Boost-users] what is template<typename> struct +; ?
by Tan, Tom (Shanghai) 25 Jan '10

25 Jan '10

>I don't see this in adapt_struct.hpp. Which version of Boost are you >finding this in ? Oops, It's my mistake, it seems I accidently replaced "sequence_tag" with "+" in the editor without noticing it.

1 0

Integrating Boost::Test into a logger
by Charles Solar 25 Jan '10

25 Jan '10

I am wondering if its possible to integrate boost::test into my logging system so I can segregate the log messages into the individual tests. Right now I have the results redirecting to a file, but all I get is 'this succeeded, this failed' and there is no way to go into my apps log file and tie the failed tests to the log messages. I was wondering if there is some mechanism I can write up that will allow me to log the test name at the beginning and end of the test so I end up with output like: LOG_INFO: Starting test 'zero_length_string_test' LOG_ERROR: String is zero length! LOG_WARN: Could not create new string LOG_INFO: End test 'zero_length_string_test' Then when I go to my results I can do a quick search of my apps log to find out why something failed. So is there someway to get a hold of the current test name in a fixture, or is there someway to setup a global fixture that is executed for each test and has this information? Thanks

2 1

what is template<typename> struct +; ?
by Tan, Tom (Shanghai) 25 Jan '10

25 Jan '10

While trying to read \boost\fusion adapt_struct.hpp and understand the internals of BOOST_FUSION_ADAPT_STRUCT. I came across this code: namespace boost { namespace mpl \ { \ template<typename> \ struct +; \ \ //.... }} Can anyone please explain what " template<typename> struct +; " means here? I am puzzled how it ever compiles as an operator is used as a class name. Thanks.

2 1

Specific Time Zone In boost::posix_time::ptime
by Yan Cheng Cheok 25 Jan '10

25 Jan '10

I have the following time : 2010-01-25 03:13:34.384 - GMT Time Zone 2010-01-25 11:13:34.384 - My Local I wish to convert to timestamp in ms. However, since I only obtain local time string from caller "2010-01-25 11:13:34.384" If I do it this way : // ts is "2010-01-25 11:13:34.384" (My Local) boost::posix_time::ptime t(boost::posix_time::time_from_string(ts)); boost::posix_time::ptime end(boost::gregorian::date(1970,1,1)); boost::posix_time::time_duration dur = t - end; // epoch is 1264418014384 // 2010-01-25 11:13:34.384 (GMT) -- But I want 2010-01-25 03:13:34.384 // 2010-01-25 19:13:34.384 (My Local) -- But I want 2010-01-25 11:13:34.384 long long epoch = dur.total_milliseconds(); Is there any way to tell boost::posix_time, that the ts string which it receives, is belong to My Local timezone?

2 1

Re: [Boost-users] binary size:boost::serialization and boost::variant
by Brian Wood 25 Jan '10

25 Jan '10

Robert Ramey writes: > It's not a question of the symbols. with MSVC 7.1 at least, > Release mode optimization collapses all the inline template > instantiations down to code which is no larger than one > would write by hand. This can be verified by adding the > debug symbols to the release mode and disassembling at > the point where serialization is invoked. In MSVC the > debug symbols are a separate file. The "code bloat" > results from that fact that inline template code is not > optimized by the comiler in Debug builds. In the tests I've done on Windows Vista and MSVC++ 10 with -O2, executables built with release version of Boost Serialization are more than two times the size of executables built with Ebenezer Enterprises' approach. On Linux the stripped Boost executables are more than 4 times larger than their Ebenezer counterparts. http://webEbenezer.net/comparison.html Regards, Brian Wood http://www.webEbenezer.net (651) 251-9384 <http://frankrosenbloom.com>

2 1

[multi_array] compiling and changing an example
by sean farrow 25 Jan '10

25 Jan '10

Hi: I'm tryingto use boost::multi_array, I've included boost/multi_array.hpp in the file and have the following code: private: typedef boost::multi_array<double, 3> array_type; typedef array_type::index index; array_type test(boost::extents[3][4][2]); Commenting out the third line compiles fine, but leaving this in gives a c2061 error. It seems there is an issue with boost::extents, which header is this in? I don't have a using boost; earlier, should I have? I'm using visual c+ 2008. Any help apreciated. Sean.

1 0

[asio] Throwing an exception on timeout
by Pascal Kesseli 24 Jan '10

24 Jan '10

Hi folks While reading out a serial interface with boost asio, I used the following timeout protection: const boost::function<void(const error_code &)> SerialInterface::ON_TIMEOUT(if_then(_1 != error::operation_aborted, throw_exception(bind(constructor< SerialInterfaceTimeoutException> ())))); // ... void SerialInterface::read(void *buf, size_t size) throw(SerialInterfaceTimeoutException) { charTimeout.expires_from_now(maxCharDelay); charTimeout.async_wait(ON_TIMEOUT); // ... If a timeout occurs, the exception is thrown as expected. However, it is not handed any further from read, but instead the program terminates with a message concerning the exception. Is there any method having a throw() constraint in this async_wait chain? Thanks for any hint and best regards Pascal _________________________________________________________________ Personalisiere dein Messenger, inklusive persönliche Smileys ;-) Überrasche deine Freunde - wir zeigen dir wie's geht. http://rubrik.ch.msn.com/reportagen/personalisieren.aspx

3 2

[BGL] astar_search with VertexList=listS and bundled properties - binary '[' : no operator found
by liong＠gmx.ch 24 Jan '10

24 Jan '10

Hi all I'm stuck trying to get astar_search with VertexList=listS to compile properly with MS VC 2008SP1 or gcc version 4.4.1 (Ubuntu 4.4.1-4ubuntu9)gcc-4.4.1 using boost_1_41_0: I tried two approaches: The first is to have the vertex index as a member of the bundled vertex properties and the second is to have the vertex index as an exterior property map. Both approaches result in the same errors (with VC) and after reading a lot of docs, i'm even more confused and still cannot figure how to get rid of them. I'm new to BGL and and thankful for any suggestions. Lion **************************************************************************** vertex index as member of bundled vertex property **************************************************************************** #include <iostream> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/astar_search.hpp> using namespace std; using namespace boost; // bundled properties typedef float TCost; struct Fork { Fork() {}; Fork(float p_x, float p_y, string p_Name) : x(p_x) , y(p_y) , Name(p_Name) {}; string Name; float x; float y; // tmp size_t VertexIdx; }; struct Street { Street() {}; Street(TCost p_Weight) : Weight(p_Weight) {}; TCost Weight; }; // define the graph // 2do: what to change when using listS for vertices typedef adjacency_list<listS, listS, bidirectionalS, Fork, Street, no_property, listS> Graph; // declare the graph Graph g; // construct a graph object typedef graph_traits<Graph>::vertex_descriptor Vertex; typedef graph_traits<Graph>::edge_descriptor Edge; // A* specific // ************************************************************************* // euclidean distance heuristic template <class Graph, class CostType, class LocMap> class distance_heuristic : public astar_heuristic<Graph, CostType> { public: typedef typename graph_traits<Graph>::vertex_descriptor Vertex; distance_heuristic(LocMap l, Vertex goal) : m_location(l), m_goal(goal) {} CostType operator()(Vertex u) { CostType dx = m_location[m_goal].x - m_location[u].x; CostType dy = m_location[m_goal].y - m_location[u].y; return ::sqrt(dx * dx + dy * dy); } private: LocMap m_location; Vertex m_goal; }; // A* termination (goal) struct found_goal {}; // exception for termination // visitor that terminates when we find the goal template <class Vertex> class astar_goal_visitor : public boost::default_astar_visitor { public: astar_goal_visitor(Vertex goal) : m_goal(goal) {} template <class Graph> void examine_vertex(Vertex u, Graph& g) { if(u == m_goal) throw found_goal(); } private: Vertex m_goal; }; // ************************************************************************* int main(int argc, char* argv[]) { Fork vpLH(-1, 1, "LH"); Fork vpLT(-1, -1, "LT"); Fork vpO(0, 2, "O"); Fork vpRH(1, 1, "RH"); Fork vpRT(1, -1, "RT"); Fork vpU(0, -2, "U"); Vertex vlh = add_vertex(vpLH, g); Vertex vlt = add_vertex(vpLT, g); Vertex vo = add_vertex(vpO, g); Vertex vrh = add_vertex(vpRH, g); Vertex vrt = add_vertex(vpRT, g); Vertex vu = add_vertex(vpU, g); Street epULT(1); Street epLTLH(2); Street epLHO(3); Street epURT(4); Street epRTRH(5); Street epRHO(6); bool inserted; Edge eult, eltlh, elho, eurt, ertrh, erho; tie(eult, inserted) = add_edge(vu, vlt, epULT, g); tie(eltlh, inserted) = add_edge(vlt, vlh, epLTLH, g); tie(elho, inserted) = add_edge(vlh, vo, epLHO, g); tie(eurt, inserted) = add_edge(vu, vrt, epURT, g); tie(ertrh, inserted) = add_edge(vrt, vrh, epRTRH, g); tie(erho, inserted) = add_edge(vrh, vo, epRHO, g); Edge eltrt; Street epLTRT(2); tie(eltrt, inserted) = add_edge(vlt, vrt, epLTRT, g); // do a A* search // ********************************************************************* Vertex start = vu; Vertex goal = vo; property_map<Graph, vertex_bundle_t>::type Forks = get(vertex_bundle, g); property_map<Graph, edge_bundle_t>::type Streets = get(edge_bundle, g); vector<Vertex> predecessors(num_vertices(g)); vector<float> ranks(num_vertices(g)); vector<float> distances(num_vertices(g)); vector<boost::default_color_type> colors(num_vertices(g)); typedef boost::property_map<Graph, TCost Street::*>::type EdgeWeightMap; EdgeWeightMap edgeWeightMap = get(&Street::Weight, g); typedef boost::property_map<Graph, size_t Fork::*>::type VertexIndexmap; VertexIndexmap vertexIndexmap = get(&Fork::VertexIdx, g); iterator_property_map < vector<Vertex>::iterator, VertexIndexmap, Vertex, Vertex& > ipm_predecessors(predecessors.begin()); iterator_property_map < vector<float>::iterator, VertexIndexmap, float, float& > ipm_ranks(ranks.begin()); iterator_property_map < vector<float>::iterator, VertexIndexmap, float, float& > ipm_distances(distances.begin()); iterator_property_map < vector<boost::default_color_type>::iterator, VertexIndexmap, default_color_type, default_color_type& > ipm_colors(colors.begin()); try { // initialize the vertex_index property values // (when using listS for vertices) graph_traits<Graph>::vertex_iterator vi, vend; graph_traits<Graph>::vertices_size_type cnt = 0; for (tie(vi,vend) = vertices(g); vi != vend; ++vi) put(vertexIndexmap, *vi, cnt++); astar_search (g, start, distance_heuristic<Graph, TCost, property_map<Graph, vertex_bundle_t>::type> (Forks, goal), astar_goal_visitor<Vertex>(goal), ipm_predecessors, ipm_ranks, ipm_distances, edgeWeightMap, vertexIndexmap, ipm_colors, std::less<TCost>(), closed_plus<TCost>(), std::numeric_limits<TCost>::max BOOST_PREVENT_MACRO_SUBSTITUTION (), std::numeric_limits<TCost>::min() ); } catch (found_goal fg) { // found a path to the goal } return 0; } ---------------------------------------------------------------------------- compiler output from MS VC 2008SP1 ---------------------------------------------------------------------------- 1>C:\Data\_dev\SW_Libs\boost_1_41_0\boost/property_map/property_map.hpp(324) : error C2679: binary '[' : no operator found which takes a right-hand operand of type 'Vertex ' (or there is no acceptable conversion) 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/property_map/vector_property_map.hpp(69): could be 'unsigned int &boost::vector_property_map<T>::operator [](const unsigned int &) const' 1> with 1> [ 1> T=size_t 1> ] 1> while trying to match the argument list '(const boost::vector_property_map<T>, Vertex )' 1> with 1> [ 1> T=size_t 1> ] 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/graph/detail/d_ary_heap.hpp(116) : see reference to function template instantiation 'void boost::put<boost::vector_property_map<T>,unsigned int&,Value,unsigned int>(const boost::put_get_helper<Reference,LvaluePropertyMap> &,K,const V &)' being compiled 1> with 1> [ 1> T=size_t, 1> Value=Vertex, 1> Reference=unsigned int &, 1> LvaluePropertyMap=boost::vector_property_map<size_t>, 1> K=Vertex, 1> V=unsigned int 1> ] 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/graph/detail/d_ary_heap.hpp(113) : while compiling class template member function 'void boost::d_ary_heap_indirect<Value,Arity,IndexInHeapPropertyMap,DistanceMap,Compare>::push(const Value &)' 1> with 1> [ 1> Value=Vertex, 1> Arity=4, 1> IndexInHeapPropertyMap=IndexInHeapMap, 1> DistanceMap=boost::iterator_property_map<std::_Vector_iterator<float,std::allocator<float>>,VertexIndexmap,float,float &>, 1> Compare=std::less<TCost> 1> ] 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/graph/astar_search.hpp(251) : see reference to class template instantiation 'boost::d_ary_heap_indirect<Value,Arity,IndexInHeapPropertyMap,DistanceMap,Compare>' being compiled 1> with 1> [ 1> Value=Vertex, 1> Arity=4, 1> IndexInHeapPropertyMap=IndexInHeapMap, 1> DistanceMap=boost::iterator_property_map<std::_Vector_iterator<float,std::allocator<float>>,VertexIndexmap,float,float &>, 1> Compare=std::less<TCost> 1> ] 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/graph/astar_search.hpp(298) : see reference to function template instantiation 'void boost::astar_search_no_init<VertexListGraph,AStarHeuristic,AStarVisitor,PredecessorMap,CostMap,DistanceMap,WeightMap,ColorMap,VertexIndexMap,CompareFunction,CombineFunction,CostInf,CostZero>(VertexListGraph &,void *,AStarHeuristic,AStarVisitor,PredecessorMap,CostMap,DistanceMap,WeightMap,ColorMap,VertexIndexMap,CompareFunction,CombineFunction,CostInf,CostZero)' being compiled 1> with 1> [ 1> VertexListGraph=Graph, 1> AStarHeuristic=distance_heuristic<Graph,TCost,boost::adj_list_vertex_property_map<Graph,Fork,Fork &,boost::vertex_bundle_t>>, 1> AStarVisitor=astar_goal_visitor<Vertex>, 1> PredecessorMap=boost::iterator_property_map<std::_Vector_iterator<Vertex ,std::allocator<boost::detail::adj_list_gen<boost::adjacency_list<boost::listS,boost::listS,boost::bidirectionalS,Fork,Street,RoadNetwork,boost::listS>,boost::listS,boost::listS,boost::bidirectionalS,boost::property<boost::vertex_bundle_t,Fork>,boost::property<boost::edge_bundle_t,Street>,RoadNetwork,boost::listS>::config::vertex_ptr >>,VertexIndexmap,Vertex,Vertex &>, 1> CostMap=boost::iterator_property_map<std::_Vector_iterator<float,std::allocator<float>>,VertexIndexmap,float,float &>, 1> DistanceMap=boost::iterator_property_map<std::_Vector_iterator<float,std::allocator<float>>,VertexIndexmap,float,float &>, 1> WeightMap=EdgeWeightMap, 1> ColorMap=boost::iterator_property_map<std::_Vector_iterator<boost::default_color_type,std::allocator<boost::default_color_type>>,VertexIndexmap,boost::default_color_type,boost::default_color_type &>, 1> VertexIndexMap=VertexIndexmap, 1> CompareFunction=std::less<TCost>, 1> CombineFunction=boost::closed_plus<TCost>, 1> CostInf=std::numeric_limits<float>::_Ty, 1> CostZero=std::numeric_limits<float>::_Ty 1> ] 1> .\boost_graph.cpp(233) : see reference to function template instantiation 'void boost::astar_search<Graph,distance_heuristic<Graph,CostType,LocMap>,astar_goal_visitor<Vertex>,boost::iterator_property_map<RandomAccessIterator,IndexMap,T,R>,boost::iterator_property_map<std::_Vector_iterator<_Ty,_Alloc>,IndexMap,float,float &>,boost::iterator_property_map<std::_Vector_iterator<_Ty,_Alloc>,IndexMap,float,float &>,EdgeWeightMap,VertexIndexmap,boost::iterator_property_map<std::_Vector_iterator<boost::default_color_type,std::allocator<boost::default_color_type>>,IndexMap,boost::default_color_type,boost::default_color_type &>,std::less<_Ty>,boost::closed_plus<TCost>,std::numeric_limits<float>::_Ty,std::numeric_limits<float>::_Ty>(VertexListGraph &,void *,AStarHeuristic,AStarVisitor,PredecessorMap,CostMap,DistanceMap,WeightMap,VertexIndexMap,ColorMap,CompareFunction,CombineFunction,CostInf,CostZero)' being compiled 1> with 1> [ 1> Graph=Graph, 1> CostType=TCost, 1> LocMap=boost::adj_list_vertex_property_map<Graph,Fork,Fork &,boost::vertex_bundle_t>, 1> Vertex=Vertex, 1> RandomAccessIterator=std::_Vector_iterator<Vertex ,std::allocator<boost::detail::adj_list_gen<boost::adjacency_list<boost::listS,boost::listS,boost::bidirectionalS,Fork,Street,RoadNetwork,boost::listS>,boost::listS,boost::listS,boost::bidirectionalS,boost::property<boost::vertex_bundle_t,Fork>,boost::property<boost::edge_bundle_t,Street>,RoadNetwork,boost::listS>::config::vertex_ptr >>, 1> IndexMap=VertexIndexmap, 1> T=Vertex, 1> R=Vertex &, 1> _Ty=float, 1> _Alloc=std::allocator<float>, 1> VertexListGraph=Graph, 1> AStarHeuristic=distance_heuristic<Graph,TCost,boost::adj_list_vertex_property_map<Graph,Fork,Fork &,boost::vertex_bundle_t>>, 1> AStarVisitor=astar_goal_visitor<Vertex>, 1> PredecessorMap=boost::iterator_property_map<std::_Vector_iterator<Vertex ,std::allocator<boost::detail::adj_list_gen<boost::adjacency_list<boost::listS,boost::listS,boost::bidirectionalS,Fork,Street,RoadNetwork,boost::listS>,boost::listS,boost::listS,boost::bidirectionalS,boost::property<boost::vertex_bundle_t,Fork>,boost::property<boost::edge_bundle_t,Street>,RoadNetwork,boost::listS>::config::vertex_ptr >>,VertexIndexmap,Vertex,Vertex &>, 1> CostMap=boost::iterator_property_map<std::_Vector_iterator<float,std::allocator<float>>,VertexIndexmap,float,float &>, 1> DistanceMap=boost::iterator_property_map<std::_Vector_iterator<float,std::allocator<float>>,VertexIndexmap,float,float &>, 1> WeightMap=EdgeWeightMap, 1> VertexIndexMap=VertexIndexmap, 1> ColorMap=boost::iterator_property_map<std::_Vector_iterator<boost::default_color_type,std::allocator<boost::default_color_type>>,VertexIndexmap,boost::default_color_type,boost::default_color_type &>, 1> CompareFunction=std::less<TCost>, 1> CombineFunction=boost::closed_plus<TCost>, 1> CostInf=std::numeric_limits<float>::_Ty, 1> CostZero=std::numeric_limits<float>::_Ty 1> ] 1>C:\Data\_dev\SW_Libs\boost_1_41_0\boost/property_map/property_map.hpp(324) : error C2679: binary '[' : no operator found which takes a right-hand operand of type 'void *' (or there is no acceptable conversion) 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/property_map/vector_property_map.hpp(69): could be 'unsigned int &boost::vector_property_map<T>::operator [](const unsigned int &) const' 1> with 1> [ 1> T=size_t 1> ] 1> while trying to match the argument list '(const boost::vector_property_map<T>, void *)' 1> with 1> [ 1> T=size_t 1> ] 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/graph/detail/d_ary_heap.hpp(133) : see reference to function template instantiation 'void boost::put<boost::vector_property_map<T>,unsigned int&,void*,int>(const boost::put_get_helper<Reference,LvaluePropertyMap> &,K,const V &)' being compiled 1> with 1> [ 1> T=size_t, 1> Reference=unsigned int &, 1> LvaluePropertyMap=boost::vector_property_map<size_t>, 1> K=void *, 1> V=int 1> ] 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/graph/detail/d_ary_heap.hpp(129) : while compiling class template member function 'void boost::d_ary_heap_indirect<Value,Arity,IndexInHeapPropertyMap,DistanceMap,Compare>::pop(void)' 1> with 1> [ 1> Value=Vertex, 1> Arity=4, 1> IndexInHeapPropertyMap=IndexInHeapMap, 1> DistanceMap=boost::iterator_property_map<std::_Vector_iterator<float,std::allocator<float>>,VertexIndexmap,float,float &>, 1> Compare=std::less<TCost> 1> ] 1>2 error(s) **************************************************************************** vertex index as exterior property map **************************************************************************** #include <iostream> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/astar_search.hpp> using namespace std; using namespace boost; // bundled properties typedef float TCost; struct Fork { Fork() {}; Fork(float p_x, float p_y, string p_Name) : x(p_x) , y(p_y) , Name(p_Name) {}; string Name; float x; float y; }; struct Street { Street() {}; Street(TCost p_Weight) : Weight(p_Weight) {}; TCost Weight; }; // define the graph // 2do: what to change when using listS for vertices typedef adjacency_list<listS, listS, bidirectionalS, Fork, Street, no_property, listS> Graph; // declare the graph Graph g; // construct a graph object typedef graph_traits<Graph>::vertex_descriptor Vertex; typedef graph_traits<Graph>::edge_descriptor Edge; // exterior property maps typedef std::map<Vertex, size_t> MapVertexIndex; MapVertexIndex mapVertexIndex; typedef boost::associative_property_map<MapVertexIndex> VertexIndexmap; VertexIndexmap vertexIndexmap(mapVertexIndex); // A* specific // ************************************************************************* // euclidean distance heuristic template <class Graph, class CostType, class LocMap> class distance_heuristic : public astar_heuristic<Graph, CostType> { public: typedef typename graph_traits<Graph>::vertex_descriptor Vertex; distance_heuristic(LocMap l, Vertex goal) : m_location(l), m_goal(goal) {} CostType operator()(Vertex u) { CostType dx = m_location[m_goal].x - m_location[u].x; CostType dy = m_location[m_goal].y - m_location[u].y; return ::sqrt(dx * dx + dy * dy); } private: LocMap m_location; Vertex m_goal; }; // A* termination (goal) struct found_goal {}; // exception for termination // visitor that terminates when we find the goal template <class Vertex> class astar_goal_visitor : public boost::default_astar_visitor { public: astar_goal_visitor(Vertex goal) : m_goal(goal) {} template <class Graph> void examine_vertex(Vertex u, Graph& g) { if(u == m_goal) throw found_goal(); } private: Vertex m_goal; }; // ************************************************************************* int main(int argc, char* argv[]) { Fork vpLH(-1, 1, "LH"); Fork vpLT(-1, -1, "LT"); Fork vpO(0, 2, "O"); Fork vpRH(1, 1, "RH"); Fork vpRT(1, -1, "RT"); Fork vpU(0, -2, "U"); Vertex vlh = add_vertex(vpLH, g); Vertex vlt = add_vertex(vpLT, g); Vertex vo = add_vertex(vpO, g); Vertex vrh = add_vertex(vpRH, g); Vertex vrt = add_vertex(vpRT, g); Vertex vu = add_vertex(vpU, g); Street epULT(1); Street epLTLH(2); Street epLHO(3); Street epURT(4); Street epRTRH(5); Street epRHO(6); bool inserted; Edge eult, eltlh, elho, eurt, ertrh, erho; tie(eult, inserted) = add_edge(vu, vlt, epULT, g); tie(eltlh, inserted) = add_edge(vlt, vlh, epLTLH, g); tie(elho, inserted) = add_edge(vlh, vo, epLHO, g); tie(eurt, inserted) = add_edge(vu, vrt, epURT, g); tie(ertrh, inserted) = add_edge(vrt, vrh, epRTRH, g); tie(erho, inserted) = add_edge(vrh, vo, epRHO, g); Edge eltrt; Street epLTRT(2); tie(eltrt, inserted) = add_edge(vlt, vrt, epLTRT, g); // do a A* search // ********************************************************************* Vertex start = vu; Vertex goal = vo; property_map<Graph, vertex_bundle_t>::type Forks = get(vertex_bundle, g); property_map<Graph, edge_bundle_t>::type Streets = get(edge_bundle, g); vector<Vertex> predecessors(num_vertices(g)); vector<float> ranks(num_vertices(g)); vector<float> distances(num_vertices(g)); vector<boost::default_color_type> colors(num_vertices(g)); typedef boost::property_map<Graph, TCost Street::*>::type EdgeWeightMap; EdgeWeightMap edgeWeightMap = get(&Street::Weight, g); iterator_property_map < vector<Vertex>::iterator, VertexIndexmap, Vertex, Vertex& > ipm_predecessors(predecessors.begin()); iterator_property_map < vector<float>::iterator, VertexIndexmap, float, float& > ipm_ranks(ranks.begin()); iterator_property_map < vector<float>::iterator, VertexIndexmap, float, float& > ipm_distances(distances.begin()); iterator_property_map < vector<default_color_type>::iterator, VertexIndexmap, default_color_type, default_color_type& > ipm_colors(colors.begin()); try { // initialize the vertex_index property values // (when using listS for vertices) graph_traits<Graph>::vertex_iterator vi, vend; graph_traits<Graph>::vertices_size_type cnt = 0; for (tie(vi,vend) = vertices(g); vi != vend; ++vi) put(vertexIndexmap, *vi, cnt++); astar_search (g, start, distance_heuristic<Graph, TCost, property_map<Graph, vertex_bundle_t>::type> (Forks, goal), astar_goal_visitor<Vertex>(goal), ipm_predecessors, ipm_ranks, ipm_distances, edgeWeightMap, vertexIndexmap, ipm_colors, std::less<TCost>(), closed_plus<TCost>(), std::numeric_limits<TCost>::max BOOST_PREVENT_MACRO_SUBSTITUTION (), std::numeric_limits<TCost>::min() ); } catch (found_goal fg) { // found a path to the goal } return 0; } ---------------------------------------------------------------------------- compiler output from MS VC 2008SP1 ---------------------------------------------------------------------------- 1>C:\Data\_dev\SW_Libs\boost_1_41_0\boost/property_map/property_map.hpp(324) : error C2679: binary '[' : no operator found which takes a right-hand operand of type 'Vertex ' (or there is no acceptable conversion) 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/property_map/vector_property_map.hpp(69): could be 'unsigned int &boost::vector_property_map<T>::operator [](const unsigned int &) const' 1> with 1> [ 1> T=size_t 1> ] 1> while trying to match the argument list '(const boost::vector_property_map<T>, Vertex )' 1> with 1> [ 1> T=size_t 1> ] 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/graph/detail/d_ary_heap.hpp(116) : see reference to function template instantiation 'void boost::put<boost::vector_property_map<T>,unsigned int&,Value,unsigned int>(const boost::put_get_helper<Reference,LvaluePropertyMap> &,K,const V &)' being compiled 1> with 1> [ 1> T=size_t, 1> Value=Vertex, 1> Reference=unsigned int &, 1> LvaluePropertyMap=boost::vector_property_map<size_t>, 1> K=Vertex, 1> V=unsigned int 1> ] 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/graph/detail/d_ary_heap.hpp(113) : while compiling class template member function 'void boost::d_ary_heap_indirect<Value,Arity,IndexInHeapPropertyMap,DistanceMap,Compare>::push(const Value &)' 1> with 1> [ 1> Value=Vertex, 1> Arity=4, 1> IndexInHeapPropertyMap=IndexInHeapMap, 1> DistanceMap=boost::iterator_property_map<std::_Vector_iterator<float,std::allocator<float>>,VertexIndexmap,float,float &>, 1> Compare=std::less<TCost> 1> ] 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/graph/astar_search.hpp(251) : see reference to class template instantiation 'boost::d_ary_heap_indirect<Value,Arity,IndexInHeapPropertyMap,DistanceMap,Compare>' being compiled 1> with 1> [ 1> Value=Vertex, 1> Arity=4, 1> IndexInHeapPropertyMap=IndexInHeapMap, 1> DistanceMap=boost::iterator_property_map<std::_Vector_iterator<float,std::allocator<float>>,VertexIndexmap,float,float &>, 1> Compare=std::less<TCost> 1> ] 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/graph/astar_search.hpp(298) : see reference to function template instantiation 'void boost::astar_search_no_init<VertexListGraph,AStarHeuristic,AStarVisitor,PredecessorMap,CostMap,DistanceMap,WeightMap,ColorMap,VertexIndexMap,CompareFunction,CombineFunction,CostInf,CostZero>(VertexListGraph &,void *,AStarHeuristic,AStarVisitor,PredecessorMap,CostMap,DistanceMap,WeightMap,ColorMap,VertexIndexMap,CompareFunction,CombineFunction,CostInf,CostZero)' being compiled 1> with 1> [ 1> VertexListGraph=Graph, 1> AStarHeuristic=distance_heuristic<Graph,TCost,boost::adj_list_vertex_property_map<Graph,Fork,Fork &,boost::vertex_bundle_t>>, 1> AStarVisitor=astar_goal_visitor<Vertex>, 1> PredecessorMap=boost::iterator_property_map<std::_Vector_iterator<Vertex ,std::allocator<boost::detail::adj_list_gen<boost::adjacency_list<boost::listS,boost::listS,boost::bidirectionalS,Fork,Street,RoadNetwork,boost::listS>,boost::listS,boost::listS,boost::bidirectionalS,boost::property<boost::vertex_bundle_t,Fork>,boost::property<boost::edge_bundle_t,Street>,RoadNetwork,boost::listS>::config::vertex_ptr >>,VertexIndexmap,Vertex,Vertex &>, 1> CostMap=boost::iterator_property_map<std::_Vector_iterator<float,std::allocator<float>>,VertexIndexmap,float,float &>, 1> DistanceMap=boost::iterator_property_map<std::_Vector_iterator<float,std::allocator<float>>,VertexIndexmap,float,float &>, 1> WeightMap=EdgeWeightMap, 1> ColorMap=boost::iterator_property_map<std::_Vector_iterator<boost::default_color_type,std::allocator<boost::default_color_type>>,VertexIndexmap,boost::default_color_type,boost::default_color_type &>, 1> VertexIndexMap=VertexIndexmap, 1> CompareFunction=std::less<TCost>, 1> CombineFunction=boost::closed_plus<TCost>, 1> CostInf=std::numeric_limits<float>::_Ty, 1> CostZero=std::numeric_limits<float>::_Ty 1> ] 1> .\boost_graph.cpp(237) : see reference to function template instantiation 'void boost::astar_search<Graph,distance_heuristic<Graph,CostType,LocMap>,astar_goal_visitor<Vertex>,boost::iterator_property_map<RandomAccessIterator,IndexMap,T,R>,boost::iterator_property_map<std::_Vector_iterator<_Ty,_Alloc>,IndexMap,float,float &>,boost::iterator_property_map<std::_Vector_iterator<_Ty,_Alloc>,IndexMap,float,float &>,EdgeWeightMap,VertexIndexmap,boost::iterator_property_map<std::_Vector_iterator<boost::default_color_type,std::allocator<boost::default_color_type>>,IndexMap,boost::default_color_type,boost::default_color_type &>,std::less<_Ty>,boost::closed_plus<TCost>,std::numeric_limits<float>::_Ty,std::numeric_limits<float>::_Ty>(VertexListGraph &,void *,AStarHeuristic,AStarVisitor,PredecessorMap,CostMap,DistanceMap,WeightMap,VertexIndexMap,ColorMap,CompareFunction,CombineFunction,CostInf,CostZero)' being compiled 1> with 1> [ 1> Graph=Graph, 1> CostType=TCost, 1> LocMap=boost::adj_list_vertex_property_map<Graph,Fork,Fork &,boost::vertex_bundle_t>, 1> Vertex=Vertex, 1> RandomAccessIterator=std::_Vector_iterator<Vertex ,std::allocator<boost::detail::adj_list_gen<boost::adjacency_list<boost::listS,boost::listS,boost::bidirectionalS,Fork,Street,RoadNetwork,boost::listS>,boost::listS,boost::listS,boost::bidirectionalS,boost::property<boost::vertex_bundle_t,Fork>,boost::property<boost::edge_bundle_t,Street>,RoadNetwork,boost::listS>::config::vertex_ptr >>, 1> IndexMap=VertexIndexmap, 1> T=Vertex, 1> R=Vertex &, 1> _Ty=float, 1> _Alloc=std::allocator<float>, 1> VertexListGraph=Graph, 1> AStarHeuristic=distance_heuristic<Graph,TCost,boost::adj_list_vertex_property_map<Graph,Fork,Fork &,boost::vertex_bundle_t>>, 1> AStarVisitor=astar_goal_visitor<Vertex>, 1> PredecessorMap=boost::iterator_property_map<std::_Vector_iterator<Vertex ,std::allocator<boost::detail::adj_list_gen<boost::adjacency_list<boost::listS,boost::listS,boost::bidirectionalS,Fork,Street,RoadNetwork,boost::listS>,boost::listS,boost::listS,boost::bidirectionalS,boost::property<boost::vertex_bundle_t,Fork>,boost::property<boost::edge_bundle_t,Street>,RoadNetwork,boost::listS>::config::vertex_ptr >>,VertexIndexmap,Vertex,Vertex &>, 1> CostMap=boost::iterator_property_map<std::_Vector_iterator<float,std::allocator<float>>,VertexIndexmap,float,float &>, 1> DistanceMap=boost::iterator_property_map<std::_Vector_iterator<float,std::allocator<float>>,VertexIndexmap,float,float &>, 1> WeightMap=EdgeWeightMap, 1> VertexIndexMap=VertexIndexmap, 1> ColorMap=boost::iterator_property_map<std::_Vector_iterator<boost::default_color_type,std::allocator<boost::default_color_type>>,VertexIndexmap,boost::default_color_type,boost::default_color_type &>, 1> CompareFunction=std::less<TCost>, 1> CombineFunction=boost::closed_plus<TCost>, 1> CostInf=std::numeric_limits<float>::_Ty, 1> CostZero=std::numeric_limits<float>::_Ty 1> ] 1>C:\Data\_dev\SW_Libs\boost_1_41_0\boost/property_map/property_map.hpp(324) : error C2679: binary '[' : no operator found which takes a right-hand operand of type 'void *' (or there is no acceptable conversion) 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/property_map/vector_property_map.hpp(69): could be 'unsigned int &boost::vector_property_map<T>::operator [](const unsigned int &) const' 1> with 1> [ 1> T=size_t 1> ] 1> while trying to match the argument list '(const boost::vector_property_map<T>, void *)' 1> with 1> [ 1> T=size_t 1> ] 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/graph/detail/d_ary_heap.hpp(133) : see reference to function template instantiation 'void boost::put<boost::vector_property_map<T>,unsigned int&,void*,int>(const boost::put_get_helper<Reference,LvaluePropertyMap> &,K,const V &)' being compiled 1> with 1> [ 1> T=size_t, 1> Reference=unsigned int &, 1> LvaluePropertyMap=boost::vector_property_map<size_t>, 1> K=void *, 1> V=int 1> ] 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/graph/detail/d_ary_heap.hpp(129) : while compiling class template member function 'void boost::d_ary_heap_indirect<Value,Arity,IndexInHeapPropertyMap,DistanceMap,Compare>::pop(void)' 1> with 1> [ 1> Value=Vertex, 1> Arity=4, 1> IndexInHeapPropertyMap=IndexInHeapMap, 1> DistanceMap=boost::iterator_property_map<std::_Vector_iterator<float,std::allocator<float>>,VertexIndexmap,float,float &>, 1> Compare=std::less<TCost> 1> ] 1>2 error(s) ---------------------------------------------------------------------------- compiler output from gcc-4.4.1 ---------------------------------------------------------------------------- In file included from /usr/include/c++/4.4/backward/hash_set:59, from /home/zaphod/data/dev/boost_1_41_0/boost/graph/adjacency_list.hpp:25, from bundled_list_not_working_exterior.cpp:6: /usr/include/c++/4.4/backward/backward_warning.h:28:2: warning: #warning This file includes at least one deprecated or antiquated header which may be removed without further notice at a future date. Please use a non-deprecated interface with equivalent functionality instead. For a listing of replacement headers and interfaces, consult the file backward_warning.h. To disable this warning use -Wno-deprecated. In file included from /home/zaphod/data/dev/boost_1_41_0/boost/graph/adjacency_list.hpp:42, from bundled_list_not_working_exterior.cpp:6: /home/zaphod/data/dev/boost_1_41_0/boost/property_map/property_map.hpp: In function ‘void boost::put(const boost::put_get_helper<Reference, PropertyMap>&, K, const V&) [with PropertyMap = boost::vector_property_map<long unsigned int, boost::identity_property_map>, Reference = long unsigned int&, K = void*, V = size_t]’: /home/zaphod/data/dev/boost_1_41_0/boost/graph/detail/d_ary_heap.hpp:116: instantiated from ‘void boost::d_ary_heap_indirect<Value, Arity, IndexInHeapPropertyMap, DistanceMap, Compare, Container>::push(const Value&) [with Value = void*, long unsigned int Arity = 4ul, IndexInHeapPropertyMap = boost::vector_property_map<long unsigned int, boost::identity_property_map>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, Compare = std::less<float>, Container = std::vector<void*, std::allocator<void*> >]’ /home/zaphod/data/dev/boost_1_41_0/boost/graph/breadth_first_search.hpp:73: instantiated from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Buffer = boost::astar_search_no_init(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, AStarHeuristic, AStarVisitor, PredecessorMap, CostMap, DistanceMap, WeightMap, ColorMap, VertexIndexMap, CompareFunction, CombineFunction, CostInf, CostZero) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, AStarHeuristic = distance_heuristic<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, float, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Fork, Fork&, boost::vertex_bundle_t> >, AStarVisitor = astar_goal_visitor<void*>, PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, void*, void*&>, CostMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, WeightMap = boost::bundle_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Street, float>, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>, VertexIndexMap = boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, CompareFunction = std::less<float>, CombineFunction = boost::closed_plus<float>, CostInf = float, CostZero = float]::MutableQueue, BFSVisitor = boost::detail::astar_bfs_visitor<distance_heuristic<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, float, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Fork, Fork&, boost::vertex_bundle_t> >, astar_goal_visitor<void*>, boost::d_ary_heap_indirect<void*, 4ul, boost::vector_property_map<long unsigned int, boost::identity_property_map>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, std::less<float>, std::vector<void*, std::allocator<void*> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, void*, void*&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, boost::bundle_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Street, float>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>, boost::closed_plus<float>, std::less<float> >, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>]’ /home/zaphod/data/dev/boost_1_41_0/boost/graph/astar_search.hpp:259: instantiated from ‘void boost::astar_search_no_init(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, AStarHeuristic, AStarVisitor, PredecessorMap, CostMap, DistanceMap, WeightMap, ColorMap, VertexIndexMap, CompareFunction, CombineFunction, CostInf, CostZero) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, AStarHeuristic = distance_heuristic<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, float, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Fork, Fork&, boost::vertex_bundle_t> >, AStarVisitor = astar_goal_visitor<void*>, PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, void*, void*&>, CostMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, WeightMap = boost::bundle_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Street, float>, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>, VertexIndexMap = boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, CompareFunction = std::less<float>, CombineFunction = boost::closed_plus<float>, CostInf = float, CostZero = float]’ /home/zaphod/data/dev/boost_1_41_0/boost/graph/astar_search.hpp:296: instantiated from ‘void boost::astar_search(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, AStarHeuristic, AStarVisitor, PredecessorMap, CostMap, DistanceMap, WeightMap, VertexIndexMap, ColorMap, CompareFunction, CombineFunction, CostInf, CostZero) [with VertexListGraph = Graph, AStarHeuristic = distance_heuristic<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, float, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Fork, Fork&, boost::vertex_bundle_t> >, AStarVisitor = astar_goal_visitor<void*>, PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, void*, void*&>, CostMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, WeightMap = boost::bundle_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Street, float>, VertexIndexMap = boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>, CompareFunction = std::less<float>, CombineFunction = boost::closed_plus<float>, CostInf = float, CostZero = float]’ bundled_list_not_working_exterior.cpp:237: instantiated from here /home/zaphod/data/dev/boost_1_41_0/boost/property_map/property_map.hpp:324: error: invalid conversion from ‘void*’ to ‘size_t’ /home/zaphod/data/dev/boost_1_41_0/boost/property_map/property_map.hpp:324: error: initializing argument 1 of ‘typename std::iterator_traits<typename std::vector<T, std::allocator<_CharT> >::iterator>::reference boost::vector_property_map<T, IndexMap>::operator[](const typename boost::property_traits<IndexMap>::key_type&) const [with T = long unsigned int, IndexMap = boost::identity_property_map]’ /home/zaphod/data/dev/boost_1_41_0/boost/property_map/property_map.hpp: In function ‘void boost::put(const boost::put_get_helper<Reference, PropertyMap>&, K, const V&) [with PropertyMap = boost::vector_property_map<long unsigned int, boost::identity_property_map>, Reference = long unsigned int&, K = void*, V = int]’: /home/zaphod/data/dev/boost_1_41_0/boost/graph/detail/d_ary_heap.hpp:133: instantiated from ‘void boost::d_ary_heap_indirect<Value, Arity, IndexInHeapPropertyMap, DistanceMap, Compare, Container>::pop() [with Value = void*, long unsigned int Arity = 4ul, IndexInHeapPropertyMap = boost::vector_property_map<long unsigned int, boost::identity_property_map>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, Compare = std::less<float>, Container = std::vector<void*, std::allocator<void*> >]’ /home/zaphod/data/dev/boost_1_41_0/boost/graph/breadth_first_search.hpp:75: instantiated from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Buffer = boost::astar_search_no_init(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, AStarHeuristic, AStarVisitor, PredecessorMap, CostMap, DistanceMap, WeightMap, ColorMap, VertexIndexMap, CompareFunction, CombineFunction, CostInf, CostZero) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, AStarHeuristic = distance_heuristic<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, float, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Fork, Fork&, boost::vertex_bundle_t> >, AStarVisitor = astar_goal_visitor<void*>, PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, void*, void*&>, CostMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, WeightMap = boost::bundle_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Street, float>, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>, VertexIndexMap = boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, CompareFunction = std::less<float>, CombineFunction = boost::closed_plus<float>, CostInf = float, CostZero = float]::MutableQueue, BFSVisitor = boost::detail::astar_bfs_visitor<distance_heuristic<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, float, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Fork, Fork&, boost::vertex_bundle_t> >, astar_goal_visitor<void*>, boost::d_ary_heap_indirect<void*, 4ul, boost::vector_property_map<long unsigned int, boost::identity_property_map>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, std::less<float>, std::vector<void*, std::allocator<void*> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, void*, void*&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, boost::bundle_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Street, float>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>, boost::closed_plus<float>, std::less<float> >, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>]’ /home/zaphod/data/dev/boost_1_41_0/boost/graph/astar_search.hpp:259: instantiated from ‘void boost::astar_search_no_init(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, AStarHeuristic, AStarVisitor, PredecessorMap, CostMap, DistanceMap, WeightMap, ColorMap, VertexIndexMap, CompareFunction, CombineFunction, CostInf, CostZero) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, AStarHeuristic = distance_heuristic<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, float, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Fork, Fork&, boost::vertex_bundle_t> >, AStarVisitor = astar_goal_visitor<void*>, PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, void*, void*&>, CostMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, WeightMap = boost::bundle_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Street, float>, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>, VertexIndexMap = boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, CompareFunction = std::less<float>, CombineFunction = boost::closed_plus<float>, CostInf = float, CostZero = float]’ /home/zaphod/data/dev/boost_1_41_0/boost/graph/astar_search.hpp:296: instantiated from ‘void boost::astar_search(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, AStarHeuristic, AStarVisitor, PredecessorMap, CostMap, DistanceMap, WeightMap, VertexIndexMap, ColorMap, CompareFunction, CombineFunction, CostInf, CostZero) [with VertexListGraph = Graph, AStarHeuristic = distance_heuristic<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, float, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Fork, Fork&, boost::vertex_bundle_t> >, AStarVisitor = astar_goal_visitor<void*>, PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, void*, void*&>, CostMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, WeightMap = boost::bundle_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Street, float>, VertexIndexMap = boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>, CompareFunction = std::less<float>, CombineFunction = boost::closed_plus<float>, CostInf = float, CostZero = float]’ bundled_list_not_working_exterior.cpp:237: instantiated from here /home/zaphod/data/dev/boost_1_41_0/boost/property_map/property_map.hpp:324: error: invalid conversion from ‘void*’ to ‘size_t’ /home/zaphod/data/dev/boost_1_41_0/boost/property_map/property_map.hpp:324: error: initializing argument 1 of ‘typename std::iterator_traits<typename std::vector<T, std::allocator<_CharT> >::iterator>::reference boost::vector_property_map<T, IndexMap>::operator[](const typename boost::property_traits<IndexMap>::key_type&) const [with T = long unsigned int, IndexMap = boost::identity_property_map]’ /home/zaphod/data/dev/boost_1_41_0/boost/property_map/property_map.hpp: In function ‘Reference boost::get(const boost::put_get_helper<Reference, PropertyMap>&, const K&) [with PropertyMap = boost::vector_property_map<long unsigned int, boost::identity_property_map>, Reference = long unsigned int&, K = void*]’: /home/zaphod/data/dev/boost_1_41_0/boost/graph/detail/d_ary_heap.hpp:146: instantiated from ‘void boost::d_ary_heap_indirect<Value, Arity, IndexInHeapPropertyMap, DistanceMap, Compare, Container>::update(const Value&) [with Value = void*, long unsigned int Arity = 4ul, IndexInHeapPropertyMap = boost::vector_property_map<long unsigned int, boost::identity_property_map>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, Compare = std::less<float>, Container = std::vector<void*, std::allocator<void*> >]’ /home/zaphod/data/dev/boost_1_41_0/boost/graph/astar_search.hpp:182: instantiated from ‘void boost::detail::astar_bfs_visitor<AStarHeuristic, UniformCostVisitor, UpdatableQueue, PredecessorMap, CostMap, DistanceMap, WeightMap, ColorMap, BinaryFunction, BinaryPredicate>::gray_target(Edge, Graph&) [with Edge = boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Graph = const boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, AStarHeuristic = distance_heuristic<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, float, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Fork, Fork&, boost::vertex_bundle_t> >, UniformCostVisitor = astar_goal_visitor<void*>, UpdatableQueue = boost::d_ary_heap_indirect<void*, 4ul, boost::vector_property_map<long unsigned int, boost::identity_property_map>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, std::less<float>, std::vector<void*, std::allocator<void*> > >, PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, void*, void*&>, CostMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, WeightMap = boost::bundle_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Street, float>, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>, BinaryFunction = boost::closed_plus<float>, BinaryPredicate = std::less<float>]’ /home/zaphod/data/dev/boost_1_41_0/boost/graph/breadth_first_search.hpp:83: instantiated from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Buffer = boost::astar_search_no_init(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, AStarHeuristic, AStarVisitor, PredecessorMap, CostMap, DistanceMap, WeightMap, ColorMap, VertexIndexMap, CompareFunction, CombineFunction, CostInf, CostZero) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, AStarHeuristic = distance_heuristic<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, float, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Fork, Fork&, boost::vertex_bundle_t> >, AStarVisitor = astar_goal_visitor<void*>, PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, void*, void*&>, CostMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, WeightMap = boost::bundle_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Street, float>, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>, VertexIndexMap = boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, CompareFunction = std::less<float>, CombineFunction = boost::closed_plus<float>, CostInf = float, CostZero = float]::MutableQueue, BFSVisitor = boost::detail::astar_bfs_visitor<distance_heuristic<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, float, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Fork, Fork&, boost::vertex_bundle_t> >, astar_goal_visitor<void*>, boost::d_ary_heap_indirect<void*, 4ul, boost::vector_property_map<long unsigned int, boost::identity_property_map>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, std::less<float>, std::vector<void*, std::allocator<void*> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, void*, void*&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, boost::bundle_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Street, float>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>, boost::closed_plus<float>, std::less<float> >, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>]’ /home/zaphod/data/dev/boost_1_41_0/boost/graph/astar_search.hpp:259: instantiated from ‘void boost::astar_search_no_init(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, AStarHeuristic, AStarVisitor, PredecessorMap, CostMap, DistanceMap, WeightMap, ColorMap, VertexIndexMap, CompareFunction, CombineFunction, CostInf, CostZero) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, AStarHeuristic = distance_heuristic<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, float, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Fork, Fork&, boost::vertex_bundle_t> >, AStarVisitor = astar_goal_visitor<void*>, PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, void*, void*&>, CostMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, WeightMap = boost::bundle_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Street, float>, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>, VertexIndexMap = boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, CompareFunction = std::less<float>, CombineFunction = boost::closed_plus<float>, CostInf = float, CostZero = float]’ /home/zaphod/data/dev/boost_1_41_0/boost/graph/astar_search.hpp:296: instantiated from ‘void boost::astar_search(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, AStarHeuristic, AStarVisitor, PredecessorMap, CostMap, DistanceMap, WeightMap, VertexIndexMap, ColorMap, CompareFunction, CombineFunction, CostInf, CostZero) [with VertexListGraph = Graph, AStarHeuristic = distance_heuristic<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, float, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Fork, Fork&, boost::vertex_bundle_t> >, AStarVisitor = astar_goal_visitor<void*>, PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, void*, void*&>, CostMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, WeightMap = boost::bundle_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Street, float>, VertexIndexMap = boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>, CompareFunction = std::less<float>, CombineFunction = boost::closed_plus<float>, CostInf = float, CostZero = float]’ bundled_list_not_working_exterior.cpp:237: instantiated from here /home/zaphod/data/dev/boost_1_41_0/boost/property_map/property_map.hpp:317: error: invalid conversion from ‘void* const’ to ‘size_t’ /home/zaphod/data/dev/boost_1_41_0/boost/property_map/property_map.hpp:317: error: initializing argument 1 of ‘typename std::iterator_traits<typename std::vector<T, std::allocator<_CharT> >::iterator>::reference boost::vector_property_map<T, IndexMap>::operator[](const typename boost::property_traits<IndexMap>::key_type&) const [with T = long unsigned int, IndexMap = boost::identity_property_map]’ -- Haiti-Nothilfe! Helfen Sie per SMS: Sende UIHAITI an die Nummer 81190. Von 5 Euro je SMS (zzgl. SMS-Gebühr) gehen 4,83 Euro an UNICEF.

1 0

[BoostCon 2010] Final Call for Participation
by Hartmut Kaiser 24 Jan '10

24 Jan '10

Please distribute! -------------------------------- 4th Annual Boost Conference 2010 -------------------------------- Aspen CO, USA, May 10-14, 2010, www.boostcon.com Final Call for Participation -------------------------------- Important dates: Proposal submissions Extended to January 3, 2010 Proposals decisions sent January 25, 2010 (tentative program available) Fully scheduled program available February 10, 2010 Session materials due April 15, 2010 -------------------------------- We invite you to submit session proposals to the 4th Annual Boost Conference: BoostCon 2010 (Aspen CO, USA, May 10-14, 2010). Traditionally the main face-to-face event for all things Boost (www.boost.org) BoostCon 2010 will present leading speakers from the whole C++ community. From using the Boost libraries to writing and maintaining them, from evangelizing to deploying Boost within your organization, from infrastructure and process to vision and mission, and the new C++ Standard, BoostCon brings together the sessions, the colleagues, and the inspiration to support your work with C++ and Boost in particular for the next year. To reflect the breadth of the Boost community, the conference includes sessions aimed at two constituencies: Boost end-users and hard-core Boost library and tool developers. The program fosters interaction and engagement within and across those two groups, with an emphasis on hands-on, participatory sessions. Session topics -------------- Topics of interest include, but are not restricted to, the following: * General tutorial sessions introducing one or more Boost libraries * In-depth sessions on using specific Boost libraries * Case studies on using Boost * Experts panels * Advanced sessions on implementation techniques used within Boost libraries * C++0x and how it will change life for users and library writers * Development workshops to extend or enhance existing Boost libraries * Workshops on design process * Infrastructure workshops such as Build tools, Website, Testing * Concepts and Generic Programming * Hardware and infrastructure presentations focused on how libraries can make better use of the technology * Other topics likely to be of great interest to Boost users and developers Interactive and collaborative sessions are encouraged, as this is the nature of both the on-line Boost community and the style of learning and participation that has proven most successful at such events. Sessions can be tutorial based, with an emphasis on interaction and participant involvement, or workshop based, whether hands-on programming or paper-based, discussion-driven collaborative work. Session formats --------------- Presentations Presentations focus on a practitioner's ideas and experience with anything relevant to Boost and Boost users. Panels Panels feature three or four people presenting their ideas and experiences relating to Boost's relevant, controversial, emerging, or unresolved issues. Panels may be conducted in several ways, such as comparative, analytic, or historic. Tutorials Tutorials are sessions at which instructors teach conference participants specific Boost-relevant skills. Workshops Workshops provide an active arena for advancements in Boost- relevant topics. Workshops provide the opportunity for experienced practitioners to develop new ideas about a topic of common interest and experience. Author's Corner Presentations These were introduced at BoostCon 2008, and were a great success. They are short (30 minute) sessions, focusing on tips on usage and design. In addition, we're looking to uncover the hidden design gems in Boost libraries. Tool Vendors Presentations We actively encourage tool vendors and ISP's to submit proposals for a special Tool Vendors Session Track aimed at products related to Boost and C++ (compilers, libraries, tools, etc.). Other formats may also be of interest. Don't hold back a proposal just because it doesn't fit into a pigeonhole. Submitting a proposal --------------------- Standard Sessions are 90 minutes. You may submit a proposal for fractions or multiples of 90-minutes. Fractional proposals will be grouped into 90 minute sessions covering related topics. Longer sessions, such as tutorials and classes, will be assigned 90 minute, three hour (i.e. half day), or six hour (i.e. full day) time slots. Please include: * The working title. * Type of session: presentation, panel, tutorial, workshop, authors corner, vendor track, other. * A paragraph or two describing the topic covered, suitable for the conference web site. * Proposed length: 10-20 minute short talks, 45 minutes, 90 minutes, half day, full day. * Alternate lengths, if you are willing to make adjustments: 10-20 minute short-talks, 45 minutes, 90 minutes, half-day, full day. * Audience: users, developers, both. * Level: basic, intermediate, advanced. * A biography, suitable for the conference web site. * Your contact information (will not be made public). Submission details ------------------ All submissions have to be done through the EasyChair conference management system: http://www.easychair.org/conferences/?conf=boostcon10. If you have not already registered at EasyChair, you will need to do so in order to submit your proposal. All submissions will go through a peer review process. Authors are invited (but are not required) to submit PDF versions of full papers of up to 10 pages in ACM conference proceedings format (see http://www.acm.org/sigs/publications/proceedings-templates) The full papers are not required unless you want them published in the proceedings. All accepted proposals will be made available in the Association for Computing Machinery (ACM) Digital Library (approval pending). Best papers, after further reviews, will be considered to be book chapters or journal articles in a renowned journal. The session materials go on the BoostCon website and will be available to attendees. For general information on the BoostCon 2010 paper submission or the scope of technical papers solicited, please refer to the conference website at www.boostcon.com. For any other questions about the submission process or paper format, please contact the Program Committee at boostcon10(a)easychair.com. If you have any technical problems with EasyChair, please contact EasyChair for help. Note: Presenters must agree to grant a non-exclusive perpetual license to publish submitted materials, either electronically or in print, in any media related to BoostCon. Hartmut Kaiser, email: hartmut.kaiser(a)gmail.com (Program Committee Chair) David Abrahams, email: dave(a)boostpro.com (Conference Chair) On behalf of the conference organizers

5 4

binary size:boost::serialization and boost::variant
by Tyler Littlefield 24 Jan '10

24 Jan '10

Hello, When working with the serialization my project's binary isn't overly bloated, until I add in the serialization. The debug size becomes about 13M with the size of the binary with symbols stripped being about 1.1M larger than before I included the variant.hpp. Is there any reason for this, or a way it can be solved? I'd rather not distribute a binary this large if I can help it. Thanks, Tyler Littlefield http://tds-solutions.net Twitter: sorressean

2 3

[1.42] The PDF build of the docs for the 1.42 BETA available
by John Maddock 24 Jan '10

24 Jan '10

The PDF build of the docs for 1.42 BETA are now available for download from the sourceforge download page https://sourceforge.net/projects/boost/files/boost-docs/1.42.0/boost_pdf_1_…. Please let me know if you spot any issues, Thanks, John Maddock.

1 0

generate an n-deep runtime for loop
by Hicham Mouline 24 Jan '10

24 Jan '10

Hello, I have a fusion sequence of optionals, for e.g. fusion::vector< optional< variant< std::vector<double>, triplet<double>, pair<double>, double> >, optional< variant< std::vector<int>, triplet<int>, pair<int>, int> >, optional< variant< std::vector<double>, triplet<double>, pair<double>, double> > > The size of fusion::vector is variable. The optionals are never empty. In 1 possible instance of this fusion vector, we have these runtime values { 5.5, 10.1, 15.7, 30.9 //std::vector<double> v1 5:15:5 // triplet<int> range from 5 to 10 incrementing with 4 5.4 // double, value fixed at 5.4 } I wish to generate at runtime the following code (not always 3-deep for loops, the 3 would be known at compile time, but the bounds of the indices in the for loops are only known at runtime) for (size_t index1=0; index1< v1.size(); ++index1) { for (int index2=5; index2<=15; index2+=5) { for (double index3=5.4; index3<=5.4; ++index3) { // some code } } } is this possible? regards,

2 5

bjam library build problem in 1.41 for VS 2005?
by Jeff 24 Jan '10

24 Jan '10

After installing Boost 1.41, I am having some library file problems which I think were caused by not building boost correctly. I built boost using the following commands: bootstrap .\bjam When I link an application that uses Regex, this is what happens: LINK : fatal error LNK1104: cannot open file 'libboost_regex-vc80-mt-s-1_41.lib' Please note that I have included the stage\lib into my VS library include options. The problem is that that file does not exist but this one does: C:\boost_1_41_0\stage\lib\libboost_regex-vc80-mt.lib How do I get the *mt-s-1_41.lib versions to build? Thank you Running Visual Studio 2005, Windows XP

2 2

Build boost library on 64 bit linux
by JongKwan Kim 23 Jan '10

23 Jan '10

Hi all, I would like to build boost library 1.36.0 on the 64 bits linux machine. In fact, I install it, but when I run my code, I got the segmentation faults. So, I found the web site to solve this problem... http://old.nabble.com/How-to-build-32-bits-boost-library-on-a-64-bits-platf… At this site, they say I have to use "address-model=32 architecture=x86" arguments to bjam, but I do not know how can I use this arguments. Do I have to install the bjam separately? If someone knows that, please let me know. Thanks,

2 1

Fw: generate an n-deep runtime for loop
by Hicham Mouline 23 Jan '10

23 Jan '10

----- Original Message ----- From: "Hicham Mouline" <hicham(a)mouline.org> To: <boost-users(a)lists.boost.org> Sent: Saturday, January 23, 2010 8:56 PM Subject: Re: [Boost-users] generate an n-deep runtime for loop > I have a fusion sequence (const Seq& seq), and during the recursion > process, I want to process the front element, then pass to the next step, > the remainder of the seq. > > I can't seem to find the algorithm for this, > > rds, pop_front it is, I was sure I had seen something before, rds,

1 0

Adding a thread to a Singleton class
by Stephen Torri 23 Jan '10

23 Jan '10

I would like to have a logging class, called Trace, that I can off load the string formatting of logging the status of my program to a separate thread. Right now my logging class is written as a singleton object. This code is located within a shared library and used extensively in it to write tracing information to a file. Right now all the string formatting occurs on the main thread which degrades performance. QUESTION #1: I was wondering if the way in which I am attempting to have a central point for logging information via a Singleton without passing around a variable is a practical solution to this problem? I followed the Singleton guideline from Boost cookbook ( http://www.boostcookbook.com/Recipe:/1235044 ) of how to implement my singleton. I was thinking that I could add a boost::thread to my logging class, called Trace, and use a queue to pass objects over to be logged. A boost::condition would be used to signal the boost::thread to wake up and lock the queue, copy the contents then start writing the string formatted to a file. Below is my initial code. I would appreciate comments on the design, ideas for better designs and suggestions. Stephen Torri ---------------- SINGLETON class ---------------------------- #ifndef SINGLETON_H #define SINGELTON_H #include <boost/utility.hpp> #include <boost/thread/once.hpp> #include <boost/scoped_ptr.hpp> namespace myproject { namespace trace { template <typename T> class Singleton : boost::noncopyable { public: static T& Instance() { boost::call_once ( init, m_flag ); return *m_obj; } static void init () { m_obj.reset ( new T () ); } protected: ~Singleton(){} Singleton(){} private: static boost::scoped_ptr<T> m_obj; static boost::once_flag m_flag; }; } // namespace trace } // namespace trace template <typename T> boost::scoped_ptr<T> myproject::trace::Singleton<T>::m_obj ( 0 ); template <typename T> boost::once_flag myproject::trace::Singleton<T>::m_flag = BOOST_ONCE_INIT; #endif // define SINGELTON_H ---------------- Trace class ----------------------- #ifndef myproject_TRACE_H #define myproject_TRACE_H #include <boost/cstdint.hpp> #include <boost/shared_ptr.hpp> #include <boost/thread/mutex.hpp> #include <boost/thread/condition_variable.hpp> #include <boost/thread/thread.hpp> #include <boost/utility.hpp> #include <vector> #include "Trace_State.h" namespace myproject { namespace trace { // // Turn Trace into a singleton class that contains a worker thread // - Wait for data // - If data exists then process // - Else wait // Add method for adding a ITraceable object. This will lock the logging vector, add // element then signal the boost condition variable class Trace : public Singleton<Trace> { friend class Singleton<Trace>; public: void add_Trace ( interface::ITraceable::ptr_t trace ); private: Trace(); // Worker thread functions void threadMain(); void processTraces(); // Synchronization variables boost::mutex m_lock; boost::condition_variable m_condition; // Data variables typedef std::vector < interface::ITraceable::ptr_t > QueueType; QueueType m_queue; // Thread variables boost::shared_ptr<boost::thread> m_thread; volatile bool m_hasWork; // Logging Trace_State m_state; }; } /* namespace trace */ } /* namespace myproject */ #endif /* myproject_TRACE_H */ ----------------- Trace Source ----------------------- #include "Trace.h" #include "myproject/errors/Internal_Exception.h" #include <boost/bind.hpp> namespace myproject { namespace trace { Trace::Trace () : m_hasWork ( true ), m_state ( "Trace", "Trace" ) { m_thread = boost::shared_ptr<boost::thread> ( new boost::thread ( boost::bind ( &Trace::threadMain, this ) ) ); } Trace::~Trace() { // stop thread m_hasWork = false; } void Trace::add_Trace ( boost::shared_ptr<interface::ITraceable> trace ) { // Add ITraceable object to the queue { // lock queue { boost::lock_guard<boost::mutex> lock ( m_lock ); m_queue.push_back ( trace ); } m_condition.notify_one(); } } void Trace::threadMain() { boost::unique_lock<boost::mutex> lock ( m_lock ); while ( m_hasWork ) { while ( m_queue.size() == 0 ) { m_condition.wait ( lock ); } this->processTraces(); } } void Trace::processTraces() { QueueType local_queue; // Lock queue and copy { boost::lock_guard<boost::mutex> lock ( m_lock ); std::copy ( m_queue.begin(), m_queue.end(), local_queue.begin() ); } for ( QueueType::iterator pos = local_queue.begin(); pos != local_queue.end(); pos++ ) { // Process ITraceable object and write to a file } } } /* namespace trace */ } /* namespace myproject */

2 6

[program_options] prompt for a password
by "Stanisław T. Findeisen" 23 Jan '10

23 Jan '10

[This question is about Boost.program_options library.] Sometimes you need a password option, but you don't want it specified as a program parameter (so that it won't be visible to other users via, for example, ps(1)). Is prompting for an option supported by Boost.program_options? STF http://eisenbits.homelinux.net/~stf/ OpenPGP: DFD9 0146 3794 9CF6 17EA D63F DBF5 8AA8 3B31 FE8A

2 1

[Asio] read_some throws exception with IOCP disabled
by Collin Dauphinee 22 Jan '10

22 Jan '10

I have a piece of code that works completely fine with IOCP enabled, but when I disable it via the BOOST_ASIO_DISABLE_IOCP define, any attempts to call socket.read_some will throw an exception. This exception states that "An operation was attempted on something that is not a socket." However, I am able to write to this socket without problems; no exception is thrown and the data is received by the server. I've also tried reading and writing with the native Windows socket. Any calls to send() will succeed, but calls to recv() will return the error given above. This includes a write, read, write sequence; the first write will succeed, the read will fail, the second write will succeed even though the read told me that the handle isn't a socket. Only synchronous operations are being done on this socket. It's connected normally, no strange options are set on it, etc; the code is more or less the same as that found in the synchronous TCP client examples. Any solutions or workarounds to this problem would be greatly appreciated. I need to have IOCP disabled, so re-enabling it isn't a solution.

2 1

[uBLAS] howto combine sparse AND symmetric?
by Tim Odenthal 22 Jan '10

22 Jan '10

Hi! I need to solve the classical linear equation A*x=b with x the unknown vector and A a very large, sparse and symmetrical matrix. I want to try the conjugate gradient iterative method to solve the problem (unless somebody knows a definitely much better one). Now I've seen that uBLAS provides the symmetric_adaptor class - should I use this one in combination with one of the sparse matrix classes? Does this reduce the memory usage as compared to only using a sparse matrix? Many thanks in advance Tim Odenthal

2 1

[BGL] bundled GraphProperties
by Damien Maupu 22 Jan '10

22 Jan '10

Dear all, Are bundled properties available for GraphProperties (for adjacency list)? If no, why? Thank you Damien

2 3

advance calculation statistical calculation
by eial＠cs.bgu.ac.il 22 Jan '10

22 Jan '10

hello. using boost::math::normal, mean and sd can I retrieve the value corresponding with percentage of the space of the created by the function which is bounded by the bell borders and a straight vertical line? e.g. the corresponding x value of the red line (by calculation of the space between the blue bell borders and the red vertical line in this picture http://img714.imageshack.us/img714/4789/normal2.png thanks

2 1

[1.42.0] Beta 1 available on Sourceforge
by Beman Dawes 22 Jan '10

22 Jan '10

1.42.0 beta 1 is now available. This release contains one new library and numerous bug fixes for existing libraries. For details, including download links, see http://beta.boost.org/users/news/version_1_42_0 The release can also be downloaded directly from SourceForge. See http://sourceforge.net/projects/boost/files/ There are a few known problems in the beta: * An odd 'simplesectsep' tag that doxygen creates which has turned up in the generated documentation, such as at http://tinyurl.com/ygbgkge. * Doxygen isn't expanding some of the macros in Boost.Accumulators. * A nasty bug in Spirit affecting copy construction of rules (rev. 50156) has been tracked down and fixed, but the fix was too late for the beta. These will be fixed in the final release. Please report any other problems by responding to this message on either the users or the main developers mailing lists. Thanks, --The Boost release team

1 0