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

[MSM] Unable to retrieve correct value of attribute of a state from within actions. (Possible Bug?)
by Deniz Bahadir 27 Feb '13

27 Feb '13

Hi everyone, Hi Christophe, Using Boost.MSM with eUML I tried to access the attribute of a state from within an action. However, the value is not what I expected when accessing the attribute of the state given as argument to the action. (It seems to be the default-parameter.) If I access the state directly (by name) and retrieve the value from it, it is set correctly as expected. Could it be that an action gets its arguments as copies? If so, I guess, the attributes of the copied arguments should be copied, too. This is the case for events. The attributes of an event given to the action seems to be set correctly. But the attributes of a state seem to be default-initialized. For clarification a simple example (this time tested and successfully compiled): #include <iostream> #define BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #include <boost/msm/back/state_machine.hpp> #include <boost/msm/front/euml/euml.hpp> using namespace boost::msm::front::euml; namespace msm = boost::msm; namespace mpl = boost::mpl; using namespace std; namespace { // The attribute: BOOST_MSM_EUML_DECLARE_ATTRIBUTE(int, Number) BOOST_MSM_EUML_ATTRIBUTES((attributes_ << Number), NumberAttr) // An event containing the attribute: BOOST_MSM_EUML_EVENT_WITH_ATTRIBUTES(event1, NumberAttr) // Two states with attributes: BOOST_MSM_EUML_STATE((no_action, no_action, attributes_ << Number), state1) BOOST_MSM_EUML_STATE((no_action, no_action, attributes_ << Number), state2) // Entry-action which initializes the attributes: BOOST_MSM_EUML_ACTION(init_events_and_states) { template <class Evt, class Fsm, class State> void operator()(Evt const&, Fsm&, State&) { event1.get_attribute(Number) = 100; state1.get_attribute(Number) = 1; state2.get_attribute(Number) = 2; }; }; // Action that prints the Number-attributes of event and state. // NOTE: The state-Numbers differ! BOOST_MSM_EUML_ACTION(printNumber) { template <class Fsm, class Evt, class SourceState, class TargetState> void operator()(Evt const& evt, Fsm&, SourceState& source, TargetState& target) { std::cout << "In action \"printNumber\"." << "\n event1.Number == " << event1.get_attribute(Number) << "\n evt.Number == " << evt.get_attribute(Number) << "\n state1.Number == " << state1.get_attribute(Number) << "\n source.Number == " << source.get_attribute(Number) << "\n state2.Number == " << state2.get_attribute(Number) << "\n target.Number == " << target.get_attribute(Number) << std::endl; }; }; // The transition table: BOOST_MSM_EUML_TRANSITION_TABLE(( state1 + event1 / printNumber == state2 ), stt) // The FSM front-end and back-end: BOOST_MSM_EUML_DECLARE_STATE_MACHINE(( stt, init_ << state1, init_events_and_states ), FsmFrontend); typedef msm::back::state_machine<FsmFrontend> Fsm; void test() { Fsm fsm; // needed to start the highest-level FSM. // This initializes all attributes. fsm.start(); // emit event1 fsm.process_event(event1); } } // namespace int main() { test(); return 0; } // This prints the following (except "//") on the cmdline : // In action "printNumber". // event1.Number == 100 // evt.Number == 100 // state1.Number == 1 // source.Number == 0 // state2.Number == 2 // target.Number == 0 As you can see, the attribute-values of "event1" and "evt" are the same. However, the attribute-values of "state1" and "source" differ although they should be the same, too. (The same applies to "state2" and "target".) I tried this example with a custom type as attribute-type which prints each constructor-call and assignment-call and I realized, the copy-constructor was never called. If you want to try it yourself, just replace the declaration of the attribute in the above example with the following code: class MyInt { int val_; public: MyInt() : val_(50) { std::cout << "MyInt()" << std::endl; } MyInt(const MyInt& obj) : val_(obj.val_) { std::cout << "MyInt(const MyInt&) - val_=" << val_ << std::endl; } MyInt(const int& i) : val_(i) { std::cout << "MyInt(const int&) - val_=" << val_ << std::endl; } MyInt& operator=(const MyInt& obj) { val_ = obj.val_; std::cout << "op=(const MyInt&) - val_=" << val_ << std::endl; return *this; } MyInt& operator=(const int& i) { val_ = i; std::cout << "op=(const int&) - val_=" << val_ << std::endl; return *this; } }; // The attribute: BOOST_MSM_EUML_DECLARE_ATTRIBUTE(MyInt, Number) This looks like a bug, but I am not sure. Maybe I have to write my transition-table differently? Ciao, Deniz PS: I am using Boost 1.53.0 with GCC 4.7.2 (and C++11 support activated, most of the time.)

2 4

Please help make this boost::bind example compile
by Chris Stankevitz 27 Feb '13

27 Feb '13

Hello, In the code below, the last function, "GetFunctionThatReturnsRefX_2", does not compile. It is attempting to use boost::bind to produce a boost::function that takes a pointer to an object and returns one of the object's member variables by reference. If it is possible, would you modify it so that it does compile? Note 1: No problem when returning a copy as in "GetFunctionThatReturnsCopyX_2" Note 2: I employ a workaround in "GetFunctionThatReturnsRefX_1" that uses a helper "facade" function. I'm hoping to avoid this. Similarly I'm hoping to not have to add member function TCObject::GetX. Invoked with "g++ -c test.cpp" using gcc 4.6.3. Thank you, Chris #include <boost/bind.hpp> #include <boost/function.hpp> //------------------------------------ //------------------------------------ struct TCObject { int x; }; //------------------------------------ //------------------------------------ int GetCopyX(TCObject* pClass) { return pClass->x; } //------------------------------------ //------------------------------------ boost::function<int(TCObject*)> GetFunctionThatReturnsCopyX_1() { return boost::bind(GetCopyX, _1); } //------------------------------------ //------------------------------------ boost::function<int(TCObject*)> GetFunctionThatReturnsCopyX_2() { return boost::bind(&TCObject::x, _1); } //------------------------------------ //------------------------------------ int& GetRefX(TCObject* pClass) { return pClass->x; } //------------------------------------ //------------------------------------ boost::function<int&(TCObject*)> GetFunctionThatReturnsRefX_1() { return boost::bind(GetRefX, _1); } //------------------------------------ //------------------------------------ boost::function<int&(TCObject*)> GetFunctionThatReturnsRefX_2() { //return boost::ref(boost::bind(&TCObject::x, _1)); return boost::bind(&TCObject::x, _1); }

1 1

Can boost help me organize/parse lots of binary data?
by Chris Stankevitz 27 Feb '13

27 Feb '13

I am receiving a "live" stream of binary data that represents the states of various objects. Sort of like this: Car Speed (m/s): float32 Temperature (deg): uint16 ... My real packets have hundreds of items in them. I will be decoding many of these "packets" and doing various things with them like printing their values to console, etc. My plan is just to make classes: class Car { public: void Decode(istream&); private: float speed; unsigned temperature ... }; But it will not be very extendable. Unfocused open-ended question: Does boost offer something that will help me with this? Thank you, Chris

6 16

[heap] How to orderly traverse a priority queue and update a given element?
by Francisco Lopes 27 Feb '13

27 Feb '13

I'm looking for a good data structure that can *maintain* its elements sorted. Currently I'm trying Boost.Heap<http://www.boost.org/doc/libs/1_53_0/doc/html/heap.html> . I frequently need to orderly traverse the data structure, find a element based on some property and update its priority when it matches. Boost.Heap priority queues provide ordered and non-ordered iterators. Element updates occurs through a element handle, a handle can be obtained from a ordinary non-ordered iterator, but not directly from a ordered one as in the following example: #include <iostream>#include <algorithm>#include <boost/heap/fibonacci_heap.hpp> using namespace boost::heap; int main(){ fibonacci_heap<int> fib_heap; fib_heap.push(1); fib_heap.push(2); fib_heap.push(3); for(auto i = fib_heap.ordered_begin(); i != fib_heap.ordered_end(); ++i) { auto h = fibonacci_heap<int>::s_handle_from_iterator(i); if(*h == 3) { fib_heap.increase(h, *h + 2); break; } } std::for_each(fib_heap.ordered_begin(), fib_heap.ordered_end(), [](const int &e) { std::cout << e << std::endl; });} How can I orderly traverse the queue and update an element in the traversal? Note that I leave traversal after the update. (Suggestions of alternative libraries for such purpose are welcome)

1 1

Errors compiling for Linux Ubuntu
by Michael Powell 26 Feb '13

26 Feb '13

Hello, Unless my compiler tool chain is off, I am just getting a ton of errors compiling Boost 1.53.0 for Linux Ubuntu. Ultimately, we'll want to cross-compile down to Arch Linux / ARM as well if it makes a difference (and it will). Errors saying failed updating 57 targets, skipped 10150 targets. I am building with all libraries and setting my prefix to /opt/boost_1_53_0. Then I run the ./b2 install. I am basically following the Linux instructions, but apparently, what am I missing? Thank you. Regards, Michael

1 0

Boost.MSM cc1plus.exe:: error: out of memory allocating 65532
by RaRi 26 Feb '13

26 Feb '13

Hi all, I'm using boost.msm from the boost 1.53.0 library. I have together 8 submachines and almost 50 states distributed between the differente submachines. The number of events is 44. Unfortunately I got the following compilation error: * cc1plus.exe:: error: out of memory allocating 65532* First of all I have observed the memory allocation while the compilation phase: It exceeded 2Gm memory and than I've received that error. So, my solution was to switch to an 64 bit system with 8 GB memory. But to hell, I still got this error. My system environment is configured as follows: Operating system : Windows 7 64-Bit MinGW32, gcc v.4.72 Is this an gcc bug or do I have to extend to 16 GB? But I don't think so, as the failue is always reported after almost 2 Gb memory allocation while the compilation phase... Thank you for your help in advance, BR, Rafael -- View this message in context: http://boost.2283326.n4.nabble.com/Boost-MSM-cc1plus-exe-error-out-of-memor… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

[units] Creating a velocity unit
by Ryan 26 Feb '13

26 Feb '13

Boost Community, I'm trying to create a custom velocity unit. I would like to create a unit that is in nautical miles per hour to represent my speed value. If I use pound_force.hpp as an example of units with more than one dimension I can create the following. BOOST_UNITS_DEFINE_BASE_UNIT_WITH_CONVERSIONS(metric, nautical_mile_per_hour, "nautical mile per hour", "nmi h^-1", factor, si::velocity, ???); If this is the right track, what id would I use and how do I know that it is unique? This seems forced. I would rather define this unit in terms of meters per second. Nautical miles is already in terms of meters and hours is also defined as a scale of seconds. Can I somehow use these two already defined units to create the new unit? How would I do this? Ryan

3 16

[PBGL] distributed property map problem
by bminano 26 Feb '13

26 Feb '13

Hello, I am having a problem trying to initialize the distributed property map in parallel code. I get a memory access violation when running this part of code: BGL_FORALL_EDGES(e, g, Graph) { remote_key k(rank, index); put(values, k, 0.1); index++; } I followed the distributed_property_map_test, but I cannot figure where is the problem. It fails at the first edge. The distributed map is defined as follows: typedef boost::parallel::distributed_property_map<mpi_process_group, remote_key_to_global, EdgeIndexMap> ValueMap; ValueMap values(g.process_group(), remote_key_to_global(), eindex); values.set_reduce(rank_accumulate_reducer<double>()); Where eindex is a local map with the local indices of the edges. Please, could someone help me? -- View this message in context: http://boost.2283326.n4.nabble.com/PBGL-distributed-property-map-problem-tp… Sent from the Boost - Users mailing list archive at Nabble.com.

1 1

[fusion, phoenix, spirit2] C++ orientation
by Michael Powell 26 Feb '13

26 Feb '13

Hello, It's been a little while since I've gone into much depth in C++. Been in the C# world for recent years and have a fairly advanced view of that world, through concepts like push-oriented dependency injection, pull-oriented inversion of control (less preferred), functional style programming using anonymous actions, functions, lambdas, and so on. I am working on a project now where we are adopting C++ into the mix, and I would like to get a much better sense for Spirit (likely Spirit2) for purposes of how to run sequences of complex data through various calculations, finds, counts, etc, probably needing to dynamically parse these calculations. Our data will be a series of spiked tuples (one or more) of n-dimensional packed values, and we'll probably need to dynamically parse calculations on the n-dimensions to determine did we satisfy the solution. I don't know if that makes any sense to anyone. It's all very conceptual, very abstract, at this stage of the game. I know, or have a sense, exactly how I might do it in C#, .NET 4, and so on. A little less so what's available in C++, much less boost, spirit, phoenix, fusion, etc. Any insight where to begin would be helpful. Regards, Michael

10 19

[Regex] MSVC 2008 (VC9) fails to compile regex_raw_buffer.hpp on 1_49
by Larry 26 Feb '13

26 Feb '13

I get an error just including regex.hpp in a program that used to work on earlier VC versions. 1>c:\boost\include\boost-1_49\boost\regex\v4\regex_raw_buffer.hpp(184) : error C2665: 'operator new' : none of the 6 overloads could convert all the argument types 1> c:\program files (x86)\microsoft visual studio 9.0\vc\include\new(57): could be 'void *operator new(size_t,void *) throw()' 1> c:\program files (x86)\microsoft visual studio 9.0\vc\include\new(86): or 'void *operator new(size_t,const std::nothrow_t &) throw()' 1> while trying to match the argument list '(const char [64], long)' 1>c:\boost\include\boost-1_49\boost\regex\v4\perl_matcher_non_recursive.hpp(110) : error C2059: syntax error : '*' inline raw_storage::raw_storage(size_type n) { start = end = static_cast<pointer>(::operator new(n)); <--- offending line for first error BOOST_REGEX_NOEH_ASSERT(start) last = start + n; } struct save_state_init { saved_state** stack; save_state_init(saved_state** base, saved_state** end) : stack(base) { *base = static_cast<saved_state*>(get_mem_block()); *end = reinterpret_cast<saved_state*>(reinterpret_cast<char*>(*base)+BOOST_REGEX_BLOCKSIZE); --(*end); (void) new (*end)saved_state(0); <---- offending line for second error ........... I looked to see if this was a known failure but apparently missed it if it was already covered. It is probably not a Boost problem. The earlier versions were compiled on 32 bit systems and this is a 64 bit system (Win7). I assume I have probably missed some configuration item to make this work. I am fairly certain I did compile this before under VC9 on a 32 bit system (Vista). (Boost was built from source on this system and this compiler.) Any pointers for resolution would be appreciated. Larry

3 4

Boost user's guide or getting started guide?
by John Lilley 25 Feb '13

25 Feb '13

Greetings! I feel that many questions I have about Boost.Geometry are really questions about the "Boost way and true path". Is there a good place to get started with Boost.Geometry specifically or Boost in general? I feel that I am locking in some basic understanding of how all of these templates fit together, what are Ranges, what are "concepts" etc. Where do I RTFM? Thanks, john

4 3

nest mpl::lambda
by Niitsuma Hirotaka 25 Feb '13

25 Feb '13

I would like to use mpl::lambda in nest. In this case works fine. --------- typedef boost::mpl::lambda<boost::mpl::max<boost::mpl::_1,boost::mpl::_2> > my_max; typedef boost::mpl::fold< boost::mpl::vector_c<int,1,7,0,-2,5,-1> , boost::mpl::int_<6> //, boost::mpl::max<boost::mpl::_1,boost::mpl::_2> , my_max >::type r2; BOOST_MPL_ASSERT(( boost::is_same< r2, boost::mpl::integral_c<int, 7> > )); --------- However --------- typedef boost::mpl::lambda< boost::mpl::fold< boost::mpl::_1 ,boost::mpl::front<boost::mpl::_1> ,my_max >::type >::type my_max_types; typedef my_max_types::apply<boost::mpl::vector_c<int,1,7,0,-2,5,-1> >::type r3; BOOST_MPL_ASSERT(( boost::is_same< r3, boost::mpl::integral_c<int, 7> > )); ///error => becomes boost::mpl::integral_c<int, 1> --------- How to define such nest lambda in mpl?

2 6

Re: [Boost-users] [parallel graph] error building parallel BGL
by The Maschine 25 Feb '13

25 Feb '13

Hi ./b2 libs/graph_parallel/example No it didnt work. Tasos ####### "typeinfo for boost::mpi::exception", referenced from: typeinfo for boost::exception_detail::error_info_injector<boost::mpi::exception>in dijkstra_shortest_paths.o "vtable for boost::mpi::exception", referenced from: boost::mpi::exception::exception(boost::mpi::exception const&)in dijkstra_shortest_paths.o NOTE: a missing vtable usually means the first non-inline virtual member function has no definition. ld: symbol(s) not found for architecture x86_64 collect2: ld returned 1 exit status "g++" -L"/usr/local/Cellar/open-mpi/1.6.3/lib" -o "bin.v2/libs/graph_parallel/example/darwin-4.2.1/debug/dijkstra_shortest_paths" "bin.v2/libs/graph_parallel/example/darwin-4.2.1/debug/dijkstra_shortest_paths.o" "bin.v2/libs/system/build/darwin-4.2.1/debug/libboost_system.dylib" "bin.v2/libs/graph_parallel/build/darwin-4.2.1/debug/libboost_graph_parallel.dylib" "bin.v2/libs/serialization/build/darwin-4.2.1/debug/libboost_serialization.dylib" -lm -lmpi -lmpi_cxx -g ...failed darwin.link bin.v2/libs/graph_parallel/example/darwin-4.2.1/debug/dijkstra_shortest_paths... ...failed updating 2 targets...

2 1

Re: [Boost-users] [parallel graph] error building parallel BGL
by The Maschine 25 Feb '13

25 Feb '13

Hi Jeremiah, I can confirm that ParallelBGL that comes with 1.53 compiles. The problem with this one is that when I try to compile the example (again from 1.53) I get this problem: /usr/local/include/boost/graph/distributed/mpi_process_group.hpp:419:28: No viable conversion from 'shared_ptr<boost::graph::distributed::mpi_process_group::impl>' to 'bool' 1) Any ideas? 2) Any location that I can find more examples of the Parallel BGL? Best, Tasos

3 3

Re: [Boost-users] [parallel graph] error building parallel BGL
by The Maschine 25 Feb '13

25 Feb '13

Hi, I used the BFS example from "lib/graph_parallel/example/" Maybe Im not linking the right files? Thanks, Tasos

2 1

MSVC Visualizer for Fusion Vectors
by Rodrigo Madera 25 Feb '13

25 Feb '13

Are there any plans (or actual implementations) for Visual Studio debug visualizers for Fusion Vectors? Thank you, Rodrigo

2 2

Re: [Boost-users] Boost-users Digest, Vol 3370, Issue 2
by Brammert Ottens 25 Feb '13

25 Feb '13

> Brammert Ottens > > Hi, > > I've had a closer look and I was too quick in dismissing your solution. however, the on_label_popped(cur_label) gets a const reference to the label. I've used a const_cast to remove the const (see code below), but now the code crashes when cleaning up the labels using deallocate. Any ideas on what could be wrong? > > template<class Label, class Graph> > void QRCSPPVisitor::on_label_popped( const Label& label, const Graph& graph ) > { > RCSPPVisitorData().IncrementLabelsPopped(); > > if ( TimedOut() || GetMillis(StartTime()) > MaxMillis() ) > { > this->SetTimedOut(); > const_cast<Label&>(label).b_is_dominated = true; > } > } I think you can just change the parameter declaration to be a non-const reference. Can you please check where the crash occurs and whatever information you can get about the cause? Thanks. -- Jeremiah Willcock Hi, The crash occurs in the final loop, where you are going over vec_vertex_labels. It crashes when calling l_alloc.deallocate( (*csi).get(), 1 );. We use the standard std::allocator. Unfortunately the code has been encapsulated into a much larger project, and the only information that I have is what windows gives me: Problem Event Name: APPCRASH Application Name: QServer_D64.exe Application Version: 2013.6.6145.0 Application Timestamp: 512b792f Fault Module Name: KERNELBASE.dll Fault Module Version: 6.1.7601.18015 Fault Module Timestamp: 50b8479b Exception Code: 40010006 Exception Offset: 0000000000009e5d OS Version: 6.1.7601.2.1.0.256.1 Locale ID: 1043 Additional Information 1: 02d5 Additional Information 2: 02d5a24c112729571ddd0daf5f60defb Additional Information 3: 563e Additional Information 4: 563e19c789cadcf1ddb48080eecb0875 Removing the const from Label doesn't help, the code still crashes. So if you can put a visitor that allows to jump out of the loop prematurely that would be immensely helpful! Thanks already for the quick help. Brammert

1 0

Re: [Boost-users] Boost-users Digest, Vol 3369, Issue 2
by John M. Dlugosz 25 Feb '13

25 Feb '13

On 2/24/2013 12:44 PM, boost-users-request-at-lists.boost.org |Boost/Allow to home| wrote: > Are you implying this of Boost libraries in general ? If so I beg to > differ. Boost libraries cover more than .Net libraries do in the realm > of general purpose programming. The .Net API very nicely covers APIs > specific to Windows programming and some general purpose APIs, but not > nearly so much as Boost does of the latter. > > I do not mean to start an opinion war but I think your reply above gives > the OP the wrong idea about the strengths of Boost libraries, especially > as he is new to Boost. And yes I have programmed in .Net ( both C# and > C++/CLI ) pretty extensively. <http://channel9.msdn.com/Events/GoingNative/GoingNative-2012/Interactive-Pa…> at about 30 Minutes, “no large libraries [for C++]” <http://channel9.msdn.com/Events/GoingNative/GoingNative-2012/C-11-VC-11-and…> Thesis starts at 1:15, lasts till nearly the end. Now I would agree that his counting picks up a lot of "bloat" from API wrappers, but he does mention more specific examples of libraries that are needed for standard C++. Could you elaborate on your remarks, using this as a starting point of where we are coming from? —John

1 0

[parallel graph] error building parallel BGL
by The Maschine 25 Feb '13

25 Feb '13

Hi all, My boost.mpi test seems ok: ####################### ➜ Temp mpic++ -I/usr/local/include/boost/mpi/ mpitest2.cc - L/usr/local/lib/ -lboost_mpi-mt -lboost_serialization-mt ➜ Temp ./a.out I am process 0 of 1. ➜ Temp mpirun -n 6 ./a.out I am process 1 of 6. I am process 4 of 6. I am process 0 of 6. I am process 3 of 6. I am process 5 of 6. I am process 2 of 6. ###################### But when I try to build parallelBGL I get the following error: ###################### ➜ parallelBGL-Mac cmake ../parallelBGL/ -- The C compiler identification is Clang 4.2.0 -- The CXX compiler identification is Clang 4.2.0 -- Check for working C compiler: /usr/bin/cc -- Check for working C compiler: /usr/bin/cc -- works -- Detecting C compiler ABI info -- Detecting C compiler ABI info - done -- Check for working CXX compiler: /usr/bin/c++ -- Check for working CXX compiler: /usr/bin/c++ -- works -- Detecting CXX compiler ABI info -- Detecting CXX compiler ABI info - done -- Boost version: 1.53.0 -- Found the following Boost libraries: -- mpi -- serialization -- filesystem -- system -- thread -- Configuring done -- Generating done -- Build files have been written to: /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL-Mac ➜ parallelBGL-Mac make Scanning dependencies of target boost_graph_mpi [ 2%] Building CXX object libs/graph_parallel/src/CMakeFiles/boost_graph_mpi.dir/mpi_process_group.cpp.o Linking CXX static library ../../../lib/libboost_graph_mpi.a [ 5%] Built target boost_graph_mpi Scanning dependencies of target adjlist_build_test [ 8%] Building CXX object libs/graph_parallel/test/CMakeFiles/adjlist_build_test.dir/adjlist_build_test.cpp.o In file included from /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL/libs/graph_parallel/test/adjlist_build_test.cpp:10: In file included from /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL/boost/graph/distributed/adjacency_list.hpp:51: /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL/boost/graph/distributed/named_graph.hpp:345:12: warning: reference 'self' is not yet bound to a value when used here [-Wuninitialized] : self(self), name(other.name), committed(other.committed) ^ In file included from /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL/libs/graph_parallel/test/adjlist_build_test.cpp:10: In file included from /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL/boost/graph/distributed/adjacency_list.hpp:3961: /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL/boost/graph/distributed/adjlist/serialization.hpp:97:27: error: no viable conversion from 'boost::filesystem::path' to 'std::string' (aka 'basic_string<char>') std::string process_name = i->path().filename(); ^ ~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/4.2.1/bits/basic_string.h:434:7: note: candidate constructor not viable: no known conversion from 'boost::filesystem::path' to 'const std::basic_string<char> &' for 1st argument basic_string(const basic_string& __str); ^ /usr/include/c++/4.2.1/bits/basic_string.h:469:7: note: candidate constructor not viable: no known conversion from 'boost::filesystem::path' to 'const char *' for 1st argument basic_string(const _CharT* __s, const _Alloc& __a = _Alloc()); ^ In file included from /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL/libs/graph_parallel/test/adjlist_build_test.cpp:10: In file included from /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL/boost/graph/distributed/adjacency_list.hpp:3961: /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL/boost/graph/distributed/adjlist/serialization.hpp:841:37: error: no type named 'retag_property_list' in namespace 'boost::detail' typedef typename boost::detail::retag_property_list< ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL/boost/graph/distributed/adjlist/serialization.hpp:841:56: error: expected unqualified-id typedef typename boost::detail::retag_property_list< ^ /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL/boost/graph/distributed/adjlist/serialization.hpp:876:25: error: unknown type name 'edge_property_type'; did you mean 'edge_property_tag'? , static_cast<edge_property_type const&>(get(edge_all_t(), g, e)) ^~~~~~~~~~~~~~~~~~ edge_property_tag /usr/local/include/boost/graph/properties.hpp:69:10: note: 'edge_property_tag' declared here struct edge_property_tag { }; ^ In file included from /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL/libs/graph_parallel/test/adjlist_build_test.cpp:10: In file included from /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL/boost/graph/distributed/adjacency_list.hpp:3961: /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL/boost/graph/distributed/adjlist/serialization.hpp:955:37: error: no type named 'retag_property_list' in namespace 'boost::detail' typedef typename boost::detail::retag_property_list< ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL/boost/graph/distributed/adjlist/serialization.hpp:955:56: error: expected unqualified-id typedef typename boost::detail::retag_property_list< ^ 1 warning and 6 errors generated. make[2]: *** [libs/graph_parallel/test/CMakeFiles/adjlist_build_test.dir/adjlist_build_test.cpp.o] Error 1 make[1]: *** [libs/graph_parallel/test/CMakeFiles/adjlist_build_test.dir/all] Error 2 make: *** [all] Error 2 ########################## Best, Tasos

2 1

Re: [Boost-users] time out for r_c_shortest_paths
by Brammert Ottens 25 Feb '13

25 Feb '13

> Hi, > > I want to be able to put a time out on the r_c_shortest_paths, and still > be able to get the optimal paths that have been found so far. Currently, > I changed the REF such that it always returns false as soon as the time > out has reach, in effect emptying the unprocessed_labels queue. The > problem with this is that the algorithm still needs quite some time to > actually empty the queue. > > I tried to have the on_label_popped(cur_label) throw an exception when > the timeout has been reached. The timeout itself works like a charm, but > because the pareto_optimal_solutions container is only filled after the > while loop I can't access the already found optimal solutions. You might want to have on_label_popped(l, g) take l by reference and set l.b_is_dominated to true. You'll still need to empty the queue, but (if that approach works) it should be faster that way. -- Jeremiah Willcock Hi Jeremiah, Thanks for your suggestion, but if I understand correctly it would mean a change to the code. I do not want to change the code, because if ever there is an update to boost I just want to be able to replace the old libraries with the new ones. If I would change the code, I would keep the exception and put a try/catch statement around the while-loop. Then you go around the problem of having to empty the queue. Is there any change to get something like a graceful timeout supported in the boost graph algorithms? Brammert Ottens Hi, I've had a closer look and I was too quick in dismissing your solution. however, the on_label_popped(cur_label) gets a const reference to the label. I've used a const_cast to remove the const (see code below), but now the code crashes when cleaning up the labels using deallocate. Any ideas on what could be wrong? template<class Label, class Graph> void QRCSPPVisitor::on_label_popped( const Label& label, const Graph& graph ) { RCSPPVisitorData().IncrementLabelsPopped(); if ( TimedOut() || GetMillis(StartTime()) > MaxMillis() ) { this->SetTimedOut(); const_cast<Label&>(label).b_is_dominated = true; } } regards, Brammert Ottens

2 1

Re: [Boost-users] time out for r_c_shortest_paths
by Brammert Ottens 25 Feb '13

25 Feb '13

On Thu, 21 Feb 2013, Brammert Ottens wrote: > Hi, > > I want to be able to put a time out on the r_c_shortest_paths, and still > be able to get the optimal paths that have been found so far. Currently, > I changed the REF such that it always returns false as soon as the time > out has reach, in effect emptying the unprocessed_labels queue. The > problem with this is that the algorithm still needs quite some time to > actually empty the queue. > > I tried to have the on_label_popped(cur_label) throw an exception when > the timeout has been reached. The timeout itself works like a charm, but > because the pareto_optimal_solutions container is only filled after the > while loop I can't access the already found optimal solutions. You might want to have on_label_popped(l, g) take l by reference and set l.b_is_dominated to true. You'll still need to empty the queue, but (if that approach works) it should be faster that way. -- Jeremiah Willcock Hi Jeremiah, Thanks for your suggestion, but if I understand correctly it would mean a change to the code. I do not want to change the code, because if ever there is an update to boost I just want to be able to replace the old libraries with the new ones. If I would change the code, I would keep the exception and put a try/catch statement around the while-loop. Then you go around the problem of having to empty the queue. Is there any change to get something like a graceful timeout supported in the boost graph algorithms? Brammert Ottens

2 1

Boost.Geometry: please help; using buffer() extensions
by John Lilley 25 Feb '13

25 Feb '13

Something of a repost, but I've learned a bit more on the path to being truly confused. It appears that boost\geometry\extensions\algorithms\buffer\buffer_inserter.hpp contains some specializations for buffering other shape types? But I'm out of my depth here... is there an example? What do I need to do in order to buffer: a point? A linestring? A vector of polygons? A heterogeneous collections of shapes? Is this generalization of buffer also going to work as a "deflate" for polygons? If someone can tell me "include these headers, use these algorithms", it will help a lot! Thanks John

2 1

[Fusion] Associate arbitrary compile/runtime annotations with members of fusion sequence
by Kozlov Taras 25 Feb '13

25 Feb '13

Started to use Boost.Fusion in my project I quick realized that it would be very convenient if fusion adapt macroses like BOOST_FUSION_DEFINE_STRUCT would give ability to associate additional information with members. Second problem is that BOOST_FUSION_DEFINE_STRUCT and such doesn`t support inheritance. So I did a small utility library that allow to define fusion sequences with arbitrary list of annotations associated with each member, and want to share it with community :) http://tarasko.github.com/cppan/ Will appreciate for any comments

3 6

[MSM] How to access event-attributes through a "kleene"-event?
by Deniz Bahadir 24 Feb '13

24 Feb '13

Hello everyone, I am trying to use Boost.MSM with the eUML front-end and I must say: That is a pretty cool thing! :-) However, I stumbled across some points that raised several questions, which I hoped someone of you could answer. One of these points is the usage of the "kleene" event (with eUML). The questions that came to mind are the following: 1. Is there a way to access an attribute of an (original) event if the transition-table uses the "kleene" event? 2. If there is a way, can I access it directly from the guard or actions-list in the transition-table? 3. If there is not a way, is it planned to be implemented (if possible) and when? For better understanding I insert here a simple example which explains what I am trying to do: In my special case, all my events have an attribute "EventNo" which is a unique number for each event(-type). Now, I need a transition for the events with "EventNo" greater than a special number (e.g. 7). So I thought, I could do something like this: // The attribute: BOOST_MSM_EUML_DECLARE_ATTRIBUTE(int, EventNo) BOOST_MSM_EUML_ATTRIBUTES((attributes_ << EventNo), EventNoAttr) // All events that contain this attribute: BOOST_MSM_EUML_EVENT_WITH_ATTRIBUTES(event1, EventNoAttr) BOOST_MSM_EUML_EVENT_WITH_ATTRIBUTES(event2, EventNoAttr) /* ... */ BOOST_MSM_EUML_EVENT_WITH_ATTRIBUTES(eventN, EventNoAttr) // Entry-action of FSM which initializes these event-numbers: BOOST_MSM_EUML_ACTION(init_all_events) { template <class Evt, class Fsm, class State> void operator()(Evt const&, Fsm&, State&) { event1.get_attribute(EventNo) = 1; event2.get_attribute(EventNo) = 2; /* ... */ eventN.get_attribute(EventNo) = N; }; } // Some states: BOOST_MSM_EUML_STATE((), State1) BOOST_MSM_EUML_STATE((), State2) // The transition table which contains all the logic: BOOST_MSM_EUML_TRANSITION_TABLE(( State1 + kleene [event_(EventNo) > Int_<7>()] // <-- Not working! == State2, State1 + event1 == State3 /* event2 to event7 are ignored! */ ), stt) // The FSM front-end and back-end: BOOST_MSM_EUML_DECLARE_STATE_MACHINE(( stt, init_ << init_all_events ), FsmFrontend; typedef msm::back::state_machine<FsmFrontend> Fsm; However, the expression "event_(EventNo)" in the transition-guard fails to compile with the following error: error: no match for call to ‘(boost::msm::front::euml::GetEvent_<EventNo_>) (const boost::msm::front::euml::kleene_&, boost::msm::back::state_machine< boost::msm::front::euml::func_state_machine<FsmFrontendtag, ...’ I read in the documentation of the Functor front-end that I should use boost::any::type() to access the original event in transition actions, but I do not really know how to go on with it. I am also not sure if this applies to the eUML front-end at all (especially in the transition-guard). I hope someone can help me and answer these questions!? Thanks in advance, Deniz Bahadir

2 6

[asio] Adding methods directly to the IO_Service for it to call.
by Ryan 24 Feb '13

24 Feb '13

Boost Community, I've created a basic class that wrapped the boost asio framework receive/send functionality. My wrapper class gave the packet buffer to whatever processing function that it was created with and when the function was done sent any buffers it was given. This let me create classes that processed data without any knowledge of the transport layer. This concept has worked well since the asio sockets have an async_receive and async_send. I was able to setup all of my classes and then call io_service.run() to get everything going. I now have to receive data from a customer dll and they only support polling. Is there a way to add to the io_service a specific method to call once the io_service is running. I've included the ReceiveProcessSend.hpp with a comment above the two async_receive calls I need to replace. Also, below is a very basic example of how I setup classes that I pass into the ReceiveProcessSend. Any help on how to add calling methods to the io_service would be really appreciated. Ryan class DoSomeProcessing { private: typedef std::vector<unsigned char> t_ucvector; typedef boost::shared_ptr<t_ucvector> t_boostVector; typedef std::list<t_boostVector> t_boostList; public: t_boostList const processMessage(t_boostVector message, t_ucvector::size_type messageSize) { t_boostList outputList; //Do processing here and create output buffer. return outputList; } }; int main(int argc, char * argv[]) { DoSomeProcessing myProcess; ReceiveProcessSend::Arguments myArguments; boost::asio::io_service io_service; ReceiveProcessSend rps( io_service, boost::bind(&DoSomeProcessing::processMessage, &myProcess, _1, _2), myArguments); io_service.run(); return 0; }

1 0

Comparing two mpl::vector types
by Rodrigo Madera 23 Feb '13

23 Feb '13

Hello all, Can anyone give me a hint on how to call a functor on the differences of two same size mpl::vector types? For example, given: typedef boost::mpl::vector<int, char, short, double> v0_type; typedef boost::mpl::vector<int, int, short, std::string> v1_type; We can see that the second and third elements don't match, so I wish to call a functor twice, with the following signature: struct SomeFunctor { template <typename T, typename U> void operator()(T t, U u) const { // do something nice here } }; In this example, functor would be called twice: once with [T=char, U=int] and another with [T=short, U=std::string], along with their values. Thanks for any light, Rodrigo

2 2

Geometry buffer algorithm: complete or not?
by John Lilley 22 Feb '13

22 Feb '13

I was looking here: http://www.boost.org/doc/libs/1_52_0/libs/geometry/doc/html/geometry/refere… And saw this: "The current implemetation only enlarges a box, which is not defined by OGC. A next version of the library will contain a more complete implementation" It looks like Boost::Geometry is incapable of buffering an arbitrary polygon. But various forum discussions refer to the buffer() algorithm like it actually works for the general case. Which is correct? John Lilley

2 8

Building / installing only the geometry library
by John Lilley 22 Feb '13

22 Feb '13

Is there a recommended approach to building/installing only the geometry library and its required headers? I understand that geometry is header-only, so I don't really need the libraries at all, but the build process that I am seeing to move the headers to the target folder builds them anyway. I am trying to get a minimal checkin to our version control that contains only those headers needed for geometry. Thanks, john

2 2

[LockFree] a queue of std::shared_ptr?
by Scott Smedley 22 Feb '13

22 Feb '13

Hi all, Is it possible to store std::shared_ptr objects in a boost::lockfree::queue? eg. boost::lockfree::queue<std::shared_ptr<Message>> q; gcc 4.7.2 with Boost 1.53.0 is giving a static assertion failure. It wants: boost::has_trivial_destructor<T>::value and boost::has_trivial_assign<T>::value Any help would be muchly appreciated. Scott.

4 4

scope_lock question
by Jeff Dunlap 22 Feb '13

22 Feb '13

I plan to start using Boost Thread, but for now I have a multithreaded Win32 application that does not use boost. Although the threads were not created with Boost Thread, can I use boost::mutex::scoped_lock to protect some new functions I write for the app? Example: boost::mutex mutex; void whatever() { boost::mutex::scoped_lock lock(mutex); // will this be protected even though the // thread was not created using Boost? } Thank you

3 2

[Building] Weird crash on windows while trying to build boost
by Alessandro Stamatto 21 Feb '13

21 Feb '13

Hi, I'm trying to build Boost on windows 7, I'm using rubenv mingw+gcc-4.8 (from here: http://sourceforge.net/projects/mingw-w64/files/Toolchains%20targetting%20W… ). I tried the usual way: "bootstrap gcc" and ".\b2". But at the beginning of the building process a weird crash happens with a windows message dialog of "Keyboard History Utility has stopped working". It happens even with the suppressing option ('-d0'). In the process list I see that this Keyboard Utility is called "doskey.exe". What is happening? Is it possible to build boost with gcc-4.8 on windows? Thanks for your attention, Alessandro Stamatto.

1 0

New gil::io has been added
by Christian Henning 21 Feb '13

21 Feb '13

Hi all, I have successfully replaced the old gil::io extension with the new gil::io. The new io has been developed on and off over the last few years and I believe it's a great improvement over the old one. Before going into details I like thank everyone that has been helping me out along the way. I have learned a lot of things and I'm very grateful for the experience! There are numerous improvements and perhaps it's best to study the documentation before using it. Here are some noteworthy points that come to my mind: * updating code that uses the old version only requires to change the header from "boost/extension/io/jpeg_io.hpp" to "boost/extension/io/jpeg/jpeg_io_old.hpp" * new formats: bmp, pnm, raw, targa * read numerous meta information from images. See boost/gil/extension/io/png_tags.hpp for example. * use all sorts of file metaphers or file names, like FILE*, ifstream, stringstream, wstring, filesystem::path, etc * in-memory images are supported * read large images with a scanline_read_iterator * have access to the file format backend * etc. There are some items left for which I need help from the boost maintainers. * How do I hook up the gil::io documentation so it's build when all boost documentation is build? * Same for the test suite. * Should I update boost_release? Or should the new extension "simmer" for a while? Again thanks for everything, Christian

2 1

time out for r_c_shortest_paths
by Brammert Ottens 21 Feb '13

21 Feb '13

Hi, I want to be able to put a time out on the r_c_shortest_paths, and still be able to get the optimal paths that have been found so far. Currently, I changed the REF such that it always returns false as soon as the time out has reach, in effect emptying the unprocessed_labels queue. The problem with this is that the algorithm still needs quite some time to actually empty the queue. I tried to have the on_label_popped(cur_label) throw an exception when the timeout has been reached. The timeout itself works like a charm, but because the pareto_optimal_solutions container is only filled after the while loop I can't access the already found optimal solutions. Does anybody have an idea on how to do this in a better way, without having to request an addition to the boost API? Regards, Brammert

2 1

upgrading lock
by Igor R 21 Feb '13

21 Feb '13

Hello, Just wanted to be sure that I'm doing this correctly. typedef boost::upgrade_lock<boost::shared_mutex> upgrade_lock; typedef boost::upgrade_to_unique_lock<boost::shared_mutex> upgrade_to_unique_lock; upgrade_lock readLock(mutex_); // accessing shared resources in read-only mode //... upgrade_to_unique_lock writeLock(readLock); // modifying shared resources Is the above correct? In particular, upgrade_lock acquires "read" lock in raii style (similarly to shared_lock), right? Thanks.

2 2

Re: [Boost-users] Can boost help me organize/parse lots of binary data?
by Gabriel Bizzotto 21 Feb '13

21 Feb '13

Chris, > class Item > { > virtual void Decode(istream& Stream) = 0; > } > class Double : public Item > class String : public Item > class EmployeePacket > { > std::vector<Item*> Items; ... Maybe boost::any will do better here ? http://www.boost.org/doc/libs/1_53_0/doc/html/any.html

2 1

[lockfree] compile-time capacity vs. run-time capacity
by Akira Takahashi 21 Feb '13

21 Feb '13

Hi, I confused with boost::lockfree::queue behavior. Fist, run-time capacity: #include <iostream> #include <boost/lockfree/queue.hpp> int main() { boost::lockfree::queue<int, boost::lockfree::fixed_sized<true>> que(3); std::cout << std::boolalpha; std::cout << que.push(1) << std::endl; // true std::cout << que.push(2) << std::endl; // true std::cout << que.push(3) << std::endl; // true std::cout << que.push(4) << std::endl; // false } I think this behavior is correct. But, compile-time capacity: #include <iostream> #include <boost/lockfree/queue.hpp> int main() { boost::lockfree::queue<int, boost::lockfree::capacity<3>> que; std::cout << std::boolalpha; std::cout << que.push(1) << std::endl; // true std::cout << que.push(2) << std::endl; // true std::cout << que.push(3) << std::endl; // false : why? std::cout << que.push(4) << std::endl; // false } Is this bug or specification? Thanks, Akira >>======================== Akira Takahashi mailto:faithandbrave@gmail.com site: https://sites.google.com/site/faithandbrave/about/en

1 1

Coroutine documentation question
by Brian Wood 21 Feb '13

21 Feb '13

I have a question about a sentence on this page: http://www.boost.org/doc/libs/1_53_0/libs/coroutine/doc/html/coroutine/intr… "The principal difference between coroutines and routines is that a coroutine enables explicit suspend and resume their progress via additional operations by preserving local state ..." I'm wondering if it would be accurate/helpful to change that to this: "The principal difference between coroutines and routines is that coroutines enable explicit suspend and resume of their progress via additional operations by preserving local state ..." Shalom Brian Wood Ebenezer Enterprises - so far G-d has helped us. http://webEbenezer.net (651) 251-9384

1 0

Boost.Geometry: Correct use of multi-part polygons
by John Lilley 20 Feb '13

20 Feb '13

Greetings, I am looking for some guidance around the correct creation and use of multi-part polygons. I am a bit confused about when to use each of the following: * Polygon with multiple rings * Vector of polygons * Polygon set * Set/vector of polygons, each potentially containing multiple rings I gather from this example picture: http://geometrylibrary.geodan.nl/03__polygon__example_8cpp-example.html That if one wants holes to be opened as a result of intersection, they need to be rings as opposed to polygon sets or vectors of polygons? An example would be polygon(s) representing an island chain. Some of the islands are atolls and as such have a hole in the middle. What would a representation of this set of islands look like? And, what If I don't know if I have "real" rings (interior) vs just a collection of polygons (like I got this from an external source that doesn't have the same model). If I just throw a pile of points at a polygon and call clean(), will that magic everything up for me? john

2 4

Boost.geometry intersection / difference question
by John Lilley 20 Feb '13

20 Feb '13

What types are the intersection and difference algorithms implemented for? In particular: Can polygons intersect with non-polygons (e.g. point sets to produce clipped point sets, or linestrings to produce clipped linestrings)? Similar question for difference, where polygon is the second input. Thanks John

2 1

Re: [Boost-users] [Atomic] [Tread] Proposal for Synchronized<T>
by Gabriel Bizzotto 20 Feb '13

20 Feb '13

Hi, > I've been working already on a synchronized_value class that is in trunk [1]. I plan to merge it to release branch as soon as I have finished the tests and the documentation. You can see some examples in [2] and [3]. > I've take a look to your class and I think my class provides everything yours provide. Surely your version has been given more thought. > My class allows in addition to lock several synchronized values using the deadlock free lock algorithm as e.g. I did not understand the unique_synchronize part, though. > Please could you compare your class to mine and let me know what do you think? I can't see any flaw right now, but I'm still playing with it. If anything shows up I'll let you know. Thanks !

2 1

Re: [Boost-users] [Atomic] [Tread] Proposal for, Synchronized<T>
by Gabriel Bizzotto 20 Feb '13

20 Feb '13

> I have one that does reader/writer locking. I'll pass it along for comparison along with design notes (it was done partially for teaching), if it's OK to send a zip file to you. > ?John Sure, let's take a look ! You also want to carbon-copy to vicente.botet(a)wanadoo.fr, which is putting the finishing touch on the future boost::synchronized_value.

2 1

Directed cycle detection in a DAG between two nodes
by Amanullah Yasin 20 Feb '13

20 Feb '13

Hi, In Hill Climbing algorithm, before applying an operation "add_edge", "reverse_edge" or "remove_edge", I need to check whether the graph will be a Directed Acyclic Graph (DAG) or not. So there is recursive function but in some cases it goes in infinite loop and gives "stack overflow" error. //======= Function ======= bool myAlgo::remainsADAG(const Node_type& nodeInit, const Node_type& node, const Graph_type& graph) { graph_traits<Graph_type>::adjacency_iterator vi, vi_end; tie(vi, vi_end) = adjacent_vertices(node, graph); for (; vi != vi_end; ++vi) { if ((*vi == nodeInit) || (!remainsADAG(nodeInit, *vi, graph))) return false; } return true; } ============== e.g. for Graph 12->19->20->23 19->24->31->18>19 18->32 To test if there is a directed path between v12 and v32 it goes as: 12->19->20->23 24->31->18>19 *There is an infinite loop{18->19->20->23, 24->31->18}.* ================= Can some one help me or is there any other easy way to find a directed path between two nodes in boost graph? Thanks in advance. YASIN

4 3

[Preprocessor] Generate #include directive with preprocessor
by Adam Badura 20 Feb '13

20 Feb '13

Is it possible to use preprocessor to generate #include directives (or in any other way include the files)? For example if I would have a sequence of strings (being file paths) what to do to include all those files? It is possible at all?

4 3

Sperical / geo coordinates question: crossing anti-meridian
by John Lilley 19 Feb '13

19 Feb '13

I am trying to determine if boost.geometry handles certain cases of spherical coordinates. Suppose you have county outlines of Alaska. The Aleutian Islands chain crosses the anti-meridian, and so contains latitudes that are in the ranges [ 180 - delta ... 180 ] and [ -180, -180 + delta ] where delta is < 20 degrees or so. Simple (2D planar) point-in-polygon and polygon intersection algorithms fall down on these cases due to anti-meridian crossings and flipping between +/- values. Does Boost geometry deal with these issues "correctly"? I put correctly in quotes because there is some real ambiguity in the coordinate system (maybe the polygon really does wrap around the world?), but one could apply a "minimum perimeter" heuristic and normalize the polygons before performing the computation by moving the [ 180 - delta ... 180 ] range over to [ -180 - delta ... -180 ] or vice-versa. Thanks, john

2 2

[Atomic] [Tread] Proposal for, Synchronized<T>
by John M. Dlugosz 19 Feb '13

19 Feb '13

On 2/19/2013 4:02 PM, boost-users-request-at-lists.boost.org |Boost/Allow to home| wrote: > Subject: Re: [Boost-users] [Atomic] [Tread] Proposal for > Synchronized<T> > Message-ID:<5123C32D.9020700(a)wanadoo.fr> > Content-Type: text/plain; charset="iso-8859-1"; Format="flowed" > > Le 19/02/13 17:58, Gabriel Bizzotto a ?crit : >> >Hi ! >> > >> >I've created two simples classes that helped me avoid data races when >> >sharing objects among threads. >> > >> >The idea is to declare objects that need for synchronization as >> >Synchronized<T>, which holds a T and a mutex. To use the T, a Get >> >function has to be called that returns a proxy, which holds a pointer >> >to the T and a scoped lock on the mutex. The proxy defines operator-> >> >and operator* to give access to the T. To have acces to the T, one has >> >to create the proxy. As long as the proxy exists, the mutex associated >> >with the T is locked, effectively preventing use by other threads. I have one that does reader/writer locking. I'll pass it along for comparison along with design notes (it was done partially for teaching), if it's OK to send a zip file to you. —John

1 0

[property_map] constructor of vector_property_map
by Andreas Fabri 19 Feb '13

19 Feb '13

Hello, Why is initial_size in the constructor __________________________________________________________________ vector_property_map(unsigned initial_size, const IndexMap& index = IndexMap()) This constructor version allows to specify maximum index of element that will be stored. Correct number will improve performance, but semantic is always the same. Source: http://www.boost.org/doc/libs/1_53_0/libs/property_map/doc/vector_property_… __________________________________________________________________ not std::size_t, for the simple reason that the std::vector might be bigger. best regards, andreas -- Andreas Fabri, PhD Chief Officer, GeometryFactory Editor, The CGAL Project phone: +33.492.954.912 skype: andreas.fabri

2 1

compiling error from code using boost::bind code in Vs2010
by Miguel Carvajal 19 Feb '13

19 Feb '13

hello, actually i am using boost 1.48 on vs2010 and the following code does not compile on boost #include<boost/bind.hpp> #include<boost/function.hpp> using namespace boost; class A { public: void evaluate(function<VectorClass(VectorClass,double)> f) }; class B { A a; public; VectorClass f(VectorClass,double); void test() { a.evaluate(bind(f,this,_1,_2)); } }; Any help?

2 1

[Atomic] [Tread] Proposal for Synchronized<T>
by Gabriel Bizzotto 19 Feb '13

19 Feb '13

Hi ! I've created two simples classes that helped me avoid data races when sharing objects among threads. The idea is to declare objects that need for synchronization as Synchronized<T>, which holds a T and a mutex. To use the T, a Get function has to be called that returns a proxy, which holds a pointer to the T and a scoped lock on the mutex. The proxy defines operator-> and operator* to give access to the T. To have acces to the T, one has to create the proxy. As long as the proxy exists, the mutex associated with the T is locked, effectively preventing use by other threads. For more details and examples, I've already published the classes here http://codereview.stackexchange.com/questions/15632/force-locking-for-threa… I find the scheme general purpose enough to fit the Atomic lib, or perhaps Thread. Please manifest yourselves if there is any interest in such device. Thx. Gabriel ++++++[>+++[>++++>++++++<<-]<-]>>-.>---.-------..>++++[<++++>-]<+. WebRep Classificação geral Este site não tem classificação (número de votos insuficientes) WebRep Classificação geral Este site não tem classificação (número de votos insuficientes) WebRep Classificação geral Este site não tem classificação (número de votos insuficientes) WebRep Classificação geral Este site não tem classificação (número de votos insuficientes) WebRep Classificação geral Este site não tem classificação (número de votos insuficientes) WebRep Classificação geral Este site não tem classificação (número de votos insuficientes) WebRep Classificação geral Este site não tem classificação (número de votos insuficientes) WebRep Classificação geral Este site não tem classificação (número de votos insuficientes) WebRep Classificação geral Este site não tem classificação (número de votos insuficientes)

3 2

[Property Tree] special character in XML tag
by Gábor Márton 19 Feb '13

19 Feb '13

Hi, I have the following property tree, dumped in INFO format: CudbAppServiceId=1 { userLabel "" sqlAppSrvPlSchema identities-pl.sql CudbAppServiceId CudbAppServiceId=1 } When I dump it in XML format, I got the following: <?xml version="1.0" encoding="utf-8"?> <CudbAppServiceId=1> <userLabel/> <sqlAppSrvPlSchema>identities-pl.sql</sqlAppSrvPlSchema> <CudbAppServiceId>CudbAppServiceId=1</CudbAppServiceId> </CudbAppServiceId=1> This is not a valid XML, because we have a tag "CudbAppServiceId=1". Of course, any other xml parser like xmllint will fail to parse it, because of the equality sign in the tag. Is there any solution to this problem? Like somehow emitting = instead of the raw '=' inside the tag and in the text? Thanks, Gabor

3 7

chaining functions input output
by MM 19 Feb '13

19 Feb '13

Hello, i have these 2 functions provided to me and I wonder whether they can somehow be chained without using intermediary memory? http://codepad.org/tTwkUQhp Rds, MM

4 7

[Lockfree] Interprocess Support
by Gábor Márton 19 Feb '13

19 Feb '13

Hi, In 1.53 documentation it is said: The boost.lockfree data structures have basic support for Boost.Interprocess. The only problem is the blocking emulation of lock-free atomics, which in the current implementation is not guaranteed to be interprocess-safe. What does that and interprocess-safety exactly mean? Is it possible to use an interprocess allocator (e.g. allocator<int, managed_shared_memory::segment_manager>) together with lockfree::queue? Or shall I expect unexpected behaviour? Thanks, Gabor

1 0

Thread safety in Boost msm
by Ukil, Soumya P 18 Feb '13

18 Feb '13

Hi, I am new to boost meta state library. I am building one app, where I have to use msm. My application has two threads, where they use same msm object as a shared resources. Now will the msm be thread safe if both threads call process_event on the same msm object? Any idea is welcome. Thanks, Soumya P. Ukil Morgan Stanley | ISG Technology Building #5. Sector 30 | Mindspace, Goregaon (West) Mumbai (Ex Bombay), 400 090 Phone: +91 22 6641-0038 Soumya.Ukil(a)morganstanley.com<mailto:Soumya.Ukil@morganstanley.com> Be carbon conscious. Please consider our environment before printing this email. ________________________________ NOTICE: Morgan Stanley is not acting as a municipal advisor and the opinions or views contained herein are not intended to be, and do not constitute, advice within the meaning of Section 975 of the Dodd-Frank Wall Street Reform and Consumer Protection Act. If you have received this communication in error, please destroy all electronic and paper copies and notify the sender immediately. Mistransmission is not intended to waive confidentiality or privilege. Morgan Stanley reserves the right, to the extent permitted under applicable law, to monitor electronic communications. This message is subject to terms available at the following link: http://www.morganstanley.com/disclaimers If you cannot access these links, please notify us by reply message and we will send the contents to you. By messaging with Morgan Stanley you consent to the foregoing.

2 1

[Boost.Coroutine] sample in docs
by Lukas Czaja 18 Feb '13

18 Feb '13

Hi, i would like to ask about sample in docs http://www.boost.org/doc/libs/1_53_0/libs/coroutine/doc/html/coroutine/intr… what if several threads run asio::io_service::run(), so is it safe to resume execution state in CompletionHandler in diffrent thread from when execution state was saved ? And what will happen if io_service completes before saving contex (look code below)? s_.async_read_some( boost::asio::buffer( buffer_ + pb_size, bf_size - pb_size), boost::bind( & coro_t::operator(), & coro_, _1, _2) ); // Q: what will happen if handler completes here, before contex switch ca_();

1 0

[Interprocess] managed_shared_memory between 32 & 64bit
by leunm 17 Feb '13

17 Feb '13

Hi, I am new to Boost and am looking for a way to pass xyz coordinates from a 32-bit application to a 64-bit one. I see two recent posts on this same topic, but the explanation, as well as the Boost documentation (on offset_ptr) is a bit sparse. Below is a simple example I modified from the Boost documentations <http://www.boost.org/doc/libs/1_53_0/doc/html/interprocess/quick_guide.html…> , which works for either 32-bit or 64-bit but not when the parent is 32-bit and child is 64-bit, and vice versa. Can someone tell me what I need to do enable this function? Thank you in advance, Mike ----------------------------------------------------------------- #define BOOST_DATE_TIME_NO_LIB #include <boost/interprocess/managed_shared_memory.hpp> #include <boost/interprocess/containers/vector.hpp> #include <boost/interprocess/allocators/allocator.hpp> #include <string> #include <cstdlib> //std::system #include <conio.h> #include <iostream> #include <windows.h> using namespace boost::interprocess; //Define an STL compatible allocator of ints that allocates from the managed_shared_memory. //This allocator will allow placing containers in the segment typedef allocator<float, managed_shared_memory::segment_manager> ShmemAllocator; //Alias a vector that uses the previous STL-like allocator so that allocates //its values from the segment typedef vector<float, ShmemAllocator> MyVector; //Main function. For parent process argc == 1, for child process argc == 2 int main(int argc, char *argv[]) { if(argc == 1){ //Parent process //Remove shared memory on construction and destruction struct shm_remove { shm_remove() { shared_memory_object::remove("MySharedMemory"); } ~shm_remove(){ shared_memory_object::remove("MySharedMemory"); } } remover; //Create a new segment with given name and size managed_shared_memory segment(create_only, "MySharedMemory", 65536); //Initialize shared memory STL-compatible allocator const ShmemAllocator alloc_inst (segment.get_segment_manager()); //Construct a vector named "MyVector" in shared memory with argument alloc_inst MyVector *myvector = segment.construct<MyVector>("MyVector")(alloc_inst); for(int i = 0; i < 100; ++i) //Insert data in the vector myvector->push_back(0.0); // Loop bool exitFlag = false; while (1) { // Store 3 values myvector->at(0) = rand() % 100; myvector->at(1) = rand() % 100; myvector->at(2) = rand() % 100; std::cout << "Parent: " << myvector->at(0) << ", " << myvector->at(1) << ", " << myvector->at(2) << std::endl; if (kbhit()) { switch (getch()) { default: exitFlag = true; break; } if (exitFlag) break; } Sleep(500); } //When done, destroy the vector from the segment segment.destroy<MyVector>("MyVector"); } else { //Child process //Open the managed segment managed_shared_memory segment(open_only, "MySharedMemory"); //Find the vector using the c-string name MyVector *myvector = segment.find<MyVector>("MyVector").first; //Loop bool exitFlag = false; while (1) { try { std::cout << "Child: " << myvector->at(0) << ", " << myvector->at(1) << ", " << myvector->at(2) << std::endl; } catch (...) { std::cout << "Error accessing vector, exiting..." << std::endl; exitFlag = true; } if (kbhit()) { switch (getch()) { default: exitFlag = true; break; } } if (exitFlag) break; Sleep(500); } } return 0; }; -- View this message in context: http://boost.2283326.n4.nabble.com/Interprocess-managed-shared-memory-betwe… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

Behaviour of asio
by ustulation 17 Feb '13

17 Feb '13

By going through the doc. i understand that async completion handlers will be called whenever io_service::run() reads posted events from the queue for which the corresponding handlers were registered by us. Now if i have a registered handler for some event (say async_wait() of deadline_timer) which does something time consuming, then event loop (io_service::run()) does not get a chance to read the event queue until the handler returns thus preventing calls to other handlers for which events are queued. I've tested this behaviour with timers and it works as expected. However i could not understand the behaviour of async_read_from() of udp::socket. void A::read() { udpSoc.async_receive_from( boost::asio::buffer(m_cRxData, 1024), m_endpoint, boost::bind(&A::readHandler, this, _1, _2) ); } ////////////////////////////// <1> /////////////////////////// void A::readHandler(......) { std::string szDatagram(m_cRxData, bytesReceived); std::cerr << "Rxd Datagram: " << szDatagram << std::endl; read(); //............ } ////////////////////////////// <2> /////////////////////////// void A::readHandler(......) { read(); std::string szDatagram(m_cRxData, bytesReceived); std::cerr << "Rxd Datagram: " << szDatagram << std::endl; //............ } in above when 2 datagrams arrive simultaneously, readHandler <1> works fine but <2> does not. In <1> std::cerr write 1st and 2nd Datagrams distinctly, but in <2> data gets corrupted and std::cerr writes a string that would be formed if the 1st datagram in it were overwritten by the 2nd datagram (ie., if 1st one was 12345 and 2nd one xyz then <2> above prints "xyz45".) This means that clearly m_cRxData (which is a private member) is getting overwritten. Why does this happen? async_read_from should return immediately without reading into m_cRxData, readHandler(..) should continue and complete, and control should reach event loop, and then finally async read should be done calling the completion handler. Is this explanation wrong? -- View this message in context: http://boost.2283326.n4.nabble.com/Behaviour-of-asio-tp4642911.html Sent from the Boost - Users mailing list archive at Nabble.com.

3 2

Re: [Boost-users] Question about installing and using boost library.
by Giovanni 16 Feb '13

16 Feb '13

Greetings Pan, I am using Ubuntu 12.04 with one of my machines. I used the Ubuntu Software Center to install the Boost C++ Libraries, which makes things so much easier. You can enter "Boost" into the search box on the top-right corner, and find the Boost C++ Libraries to install. There are a number of them, including versions that conflict with each other. I chose the default version, and packages that don't conflict with that. I suggest that you install Boost C++ that way. After you have installed Boost C++ with Ubuntu Software Center, you should/"should" (it depends on how you set things up and if you have root access) see the following. The collection of header files for the Boost C++ Libraries in the location: /usr/lib. The collection of dynamic libraries (to be dynamically linked) for the Boost C++ Libraries in the location: /usr/include/boost. To test if you have installed the Boost C++ Libraries correctly, run a very simple C++ program that includes one of the Boost C++ Libraries and calls a function from that library. For example, you can try my attached toy program. To compile and run the program, try: g++ -o static2.out get_sys_info.cpp -lboost_filesystem -lboost_system ./static2.out As for your specific problem, I am guessing that it is a linking error that I also had. You need to include the Boost C++ Libraries at the end of the compilation command (for GCC/g++). Hence, I placed the filename (C++ source file) before including the libraries. I suggest that you post your compilation/linking commands, or makefile or script for build automation, so that people can help you. In addition, I would include the relevant source code (make it a simple C++ program, like my example) to test your Boost C++ installation. Furthermore, I would include the transcript from the Terminal. Just copy and paste what appears on the Terminal as you compile the program. Good luck, and have a great weekend! Regards On Fri, Feb 15, 2013 at 8:47 AM, pan yi <outlook_eye(a)yahoo.com.cn> wrote: > Hi all, > > I'm a beginner to use boost library for my c++ coding project. After I > include the <boost/algorithm/string.hpp> in my cpp file and compile the > code, the compiling error indicates that: > fatal error: boost/algorithm/string.hpp: No such file or directory > I search on internet and knows that I need to install some boost library. > But which library should I install? (I tried to install the whole library > with "sudo apt-get install libboost*", but it doesn't work.) > > Can any one help me? I'm compiling and executing c++ on ubuntu Version12.04 > environment > > Thank you so much. > > Best Regards > Pan

2 1

Re: [Boost-users] [Chrono] Memory leak in Chrono?
by Don 16 Feb '13

16 Feb '13

On 2/16/2013 Vincent wrote: > Please, could you create a Trac ticket so this issue not lost? Submitted as ticket #8079 https://svn.boost.org/trac/boost/ticket/8079 Thanks, Don

1 0

Re: [Boost-users] [Chrono] Memory leak in Chrono?
by Don 16 Feb '13

16 Feb '13

-------- Original Message -------- Subject: Boost-users Digest, Vol 3358, Issue 4 From: boost-users-request(a)lists.boost.org To: boost-users(a)lists.boost.org Date: 2/13/2013 1:33 PM > Subject: Re: [Boost-users] [Chrono] Memory leak in Chrono? > From: "Vicente J. Botet Escriba" <vicente.botet(a)wanadoo.fr> > Date: 2/13/2013 1:11 PM > > Le 13/02/13 14:30, Don a écrit : >>> Subject: Re: [Boost-users] [Chrono] Memory leak in Chrono? >>> From: "Vicente J. Botet Escriba" <vicente.botet(a)wanadoo.fr> >>> Date: 2/12/2013 1:17 PM >>> >>> Le 12/02/13 18:13, gast128 a écrit : >>>> we use Boost.Chrono too. MFC applications incorrectly report memory leaks, which can easily be solved. >>> Hi, >>> >>> if you have some patches to propose to avoids this incorrect reports I would try to include them. >> >> Vincente, >> >> I am using MFC, but I don't believe this is a MFC false-leak report. >> >> I added a destructor for duration_units_default_initializer_t, like this (near the end of chrono/io/duration_units.hpp): >> >> ~duration_units_default_initializer_t() >> { >> if (duration_units_default_holder<CharT>::initialized_) >> { >> delete[] duration_units_default_holder<CharT>::n_d_valid_units_; >> duration_units_default_holder<CharT>::n_d_valid_units_ = 0; >> delete[] duration_units_default_holder<CharT>::valid_units_; >> duration_units_default_holder<CharT>::valid_units_ = 0; >> duration_units_default_holder<CharT>::initialized_ = false; >> } >> } >> >> This solves the memory leak, and seems to work fine for my simple test program. > I could add this is this helps on the MFC report. Thanks, that would be useful. It would probably help with other memory leak detectors, as well. Since you are allocating heap that you are never freeing, most leak detectors are going to report this. >> But n_d_valid_units_, valid_units_, and initialized_ are static >> variables, so I assume you want to only create these variables >> once. > > Right. > >> When run with my test program and step through it in the debugger, >> only one instantiation of duration_units_default_initializer_t >> occurs. (That is, once for each char type, single-byte and wide.) > This is the goal of the type (implement a singleton). This technique > is used in some Boost libraries already > >> This occurs when the duration_units_default_initializer is >> instantiated (at the very end of duration_units.hpp). Since this is >> a global variable, this occurs during application startup and the >> destructor runs during application shuttdown. > > Right, this was the reason the destructor didn't do anything. >> >> But presumably this can occur in some other situations, otherwise >> why would you have all the logic of making valid_units_ etc. >> class-static variables.> > On which other situation do you think this could occur? I have no idea, that's what confused me. If duration_units_default_initializer_t is only instantiated as a global (static) variable), then I don't see any reason for making n_d_valid_units_, valid_units_, and initialized_ static variables -- they could be regular member variables. Making them static doesn't hurt, but it's confusing (to me at least) because it looks like you want to share those variables among multiple instantiations, and there is only ever one instantiation. If one can somehow instantiate multiple duration_units_default_initializer_t objects, then making the member variables static does make this behave as a singleton. In that case the simple destructor I wrote will not work, since it will delete the member variables when the first object destructs, not the last. In that case I would use a reference count or smart pointers to only delete when the final object destructs. Thanks for your help, I appreciate your spending the time to answer my questions. Don

2 1

[Asio] How to implement my own TCP?
by Chengu Wang 16 Feb '13

16 Feb '13

Hi all, I'd like to implement the TCP over UDP, because I want to change TCP a little. The implementation includes the three-way handshake, retransmission, etc. My TCP must have the basic interfaces as the original TCP does, i.e. a my_tcp::acceptor class supporting bind, listen, accept, async_accept and close, and a my_tcp::socket supporting bind, connect, async_connect, send, async_send, receive, async_receive and close. Of course I can write these two classes from scratch, but can I do it in the framework of asio and reuse some codes of asio? What classes should I implement and what do the inherit from? Any help would be appreciated. -- Best, Chengu Wang

1 0

Ideas for UT needed
by Olaf Peter 15 Feb '13

15 Feb '13

Hello, for my project I use the ideas used on spirit's conjure2 example. Now I like to do some test with the lexer/grammar using boost::test. The example uses sequentially initializing all iterators, lexer and grammar. I like to put this into the fixture but I run into the problem that the error_handler requires begin/end of iterator. ---8<--- original from conjure2 main typedef std::string::const_iterator base_iterator_type; typedef client::lexer::conjure_tokens<base_iterator_type> lexer_type; typedef lexer_type::iterator_type iterator_type; lexer_type lexer; // Our lexer base_iterator_type first = source_code.begin(); base_iterator_type last = source_code.end(); iterator_type iter = lexer.begin(first, last); iterator_type end = lexer.end(); client::error_handler<base_iterator_type, iterator_type> error_handler(first, last); // Our error handler client::parser::function<iterator_type, lexer_type> function(error_handler, lexer); // Our parser --->8--- My fixture looks so far: ---8<--- typedef std::string::const_iterator base_iterator_type; typedef my_tokens<base_iterator_type> lexer_type; typedef lexer_type::iterator_type iterator_type; typedef error_handler<base_iterator_type, iterator_type> error_handler_type; struct fixture : private boost::base_from_member<error_handler_type>, private boost::base_from_member<lexer_type>, my_grammar<iterator_type, lexer_type> { typedef boost::base_from_member<lexer_type> lexer_base; typedef boost::base_from_member<error_handler_type> error_handler_base; typedef my_grammar<iterator_type, lexer_type> grammar_base; fixture() : grammar_base(error_handler_base::member, lexer_base::member) { } }; --->8--- error_handler_base::member requires therefore the iterators first/last. How to give them? In the UT I have further a "test" function object so I can use e.g. it like here: ---8<--- BOOST_FIXTURE_TEST_SUITE(parameter_test, fixture) BOOST_AUTO_TEST_CASE(my_test) { BOOST_CHECK(test(rule_to_test, "input to parse", "expected output")); } --->8--- The next problem is related to the original use case. conjure2 is design as a compiler: initialize, analyse, generate and exit - no reuse of the grammar. I like to instance the grammar once (static) and use it several times using the qi::parse function. Since the iterators are fixed, they can't be changed later to point to other sources, isn't it? Is this the right approach for my problem? Thanks, Olaf

2 3

Re: [Boost-users] [LockFree] a queue of std::shared_ptr?
by chris 15 Feb '13

15 Feb '13

Hello All, If we can't use shared_ptr in a lockfree queue, how can I share data between different queue ? I have some data that I have to be put in different queues and I want to avoid that I have to copy this data for each queue. -- View this message in context: http://boost.2283326.n4.nabble.com/LockFree-a-queue-of-std-shared-ptr-tp464… Sent from the Boost - Users mailing list archive at Nabble.com.

4 5

Question about installing and using boost library.
by pan yi 15 Feb '13

15 Feb '13

Hi all, I'm a beginner to use boost library for my c++ coding project. After I include the <boost/algorithm/string.hpp> in my cpp file and compile the code, the compiling error indicates that: fatal error: boost/algorithm/string.hpp: No such file or directory I search on internet and knows that I need to install some boost library. But which library should I install? (I tried to install the whole library with "sudo apt-get install libboost*", but it doesn't work.) Can any one help me? I'm compiling and executing c++ on ubuntu Version12.04 environment Thank you so much. Best Regards Pan

3 2

Re: [Boost-users] Boost-users Digest, Vol 3359, Issue 1
by John M. Dlugosz 14 Feb '13

14 Feb '13

On 2/14/2013 2:26 AM, boost-users-request-at-lists.boost.org |Boost/Allow to home| wrote: > Message: 5 > Date: Wed, 13 Feb 2013 19:20:40 -0500 > From: Edward Diener<eldiener(a)tropicsoft.com> > To:boost-users@lists.boost.org > Subject: Re: [Boost-users] [Preprocessor] Generate #include directive > with preprocessor > Message-ID:<kfhaku$ikt$1(a)ger.gmane.org> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > On 2/13/2013 6:43 AM, Adam Badura wrote: >> >Is it possible to use preprocessor to generate #include directives (or >> >in any other way include the files)? > No it is not possible. You cannot define a macro which expands to other > another macro definition or any other basic preprocessor construct, > including the #include. > > It is possible to use a macro as the name of the file to include. So you can choose the file via preprocessing logic, but not alter the fact that some file is to be included. So... given an empty file and a file with #include M1 #include M2 you can use recursion to include an arbitrary number of different files based on preprocessor logic. --John

1 0

[GIL] About `packed_channel_value` (possible improvement)
by TONGARI 14 Feb '13

14 Feb '13

Hi, I took a look into "channel.hpp" and found that packed_channel_value is not very efficient in construction. There are: packed_channel_value(integer_t v) { _value = static_cast< integer_t >( v % num_values ); } // I have no idea why this exists, seems OK to remove it template <typename Scalar> packed_channel_value(Scalar v) { _value = static_cast< integer_t >( v ) % num_values; } IIUC, "v % num_values" above could be replaced with a much cheaper "v & low_bits_mask_t<NumBits>::sig_bits_fast". That is: packed_channel_value(integer_t v) : _value(v & low_bits_mask_t<NumBits>::sig_bits_fast) {} What do you think? Am I missing some point? Thanks.

2 7

[ASIO] Any HTML5 video streaming server with boost asio?
by Goran 14 Feb '13

14 Feb '13

Hi all, do anybody knows something about HTML5 video streaming with boost::asio? I've looked into the tutorials and would like to use the html server examples to integrate into my app. So far anything is clear but video streaming is something I've never done. Are any resources out there? Thanks in advance! G.

1 0

Documentation Install
by Robert Patterson 14 Feb '13

14 Feb '13

I download a tar ball, configured, built and installed (thank you). I then removed the entire build tree and realised I no longer had the docs (linked via libs/index.html). Obviously I can explode the tar ball again, but is there a simple way of keeping the docs without the whole tree - something like ./make installdocs ? Thanks Robert Patterson

1 0

Re: [Boost-users] Boost.Move BOOST_MOVABLE_BUT_NOT_COPYABLE macro
by luke 14 Feb '13

14 Feb '13

(13/02/14 5:57), Ion Gaztañaga wrote:> El 13/02/2013 6:36, luke escribió: >> As deleting the copy constructor fixes the issue (i.e. test(test const&) >> =delete;), would it be at all possible for >> BOOST_MOVABLE_BUT_NOT_COPYABLE to do the same for compilers that support >> the syntax? > > Thanks for reporting it. It's already done. See: > > https://svn.boost.org/trac/boost/ticket/7969 > > If you can confirm the issue is fixed in trunk, I'll close the bug. > > Best, > > Ion Ah I guess I should have checked there first, sorry! http://svn.boost.org/svn/boost/trunk/boost/move/core.hpp works perfectly for me, thanks. Luke

1 0

Boost.Move BOOST_MOVABLE_BUT_NOT_COPYABLE macro
by luke 13 Feb '13

13 Feb '13

Due to GCC 4.7.2 and lower not supporting a change in template deduction rules as explained in the answer below http://stackoverflow.com/questions/14808663/stdunordered-mapemplace-issue-w… the following code will not compile: #include <utility> class test { public: test() =default; private: test(test const&); }; int main() { std::is_convertible<test&, test>::value; }; For the same reason, it is not possible to use classes which use the BOOST_MOVABLE_BUT_NOT_COPYABLE in situations where libstdc++ uses std::is_convertible, for instance when using piecewise construction in std::unordered_map::emplace() (I came across the issue when making an unordered_map of boost::file_mapping) As deleting the copy constructor fixes the issue (i.e. test(test const&) =delete;), would it be at all possible for BOOST_MOVABLE_BUT_NOT_COPYABLE to do the same for compilers that support the syntax?

2 1

[Contract] Eagerly waiting...
by Robert Jones 13 Feb '13

13 Feb '13

Hi Lorenzo (or anyone who knows) AFAICS your contract library seems to have been approved for a while, but not made it into a release. Do you have an ETA for this? Thx, Rob.

2 1

Communication between QThread and boost threads
by ustulation 13 Feb '13

13 Feb '13

The Gui is in Qt and Api is in boost. The Gui is meant to sit on top of Api. One of the functions of Api is to do network level data management, process data in certain ways and communicate with the Gui (ie., bridge Gui with other end of Api). To keep the GUI from freezing Api does it's work in a separate thread. If both Gui and Api had used Qt, communication would have been easier with cross-threaded signal-slot mechanism of Qt. Api emits and returns immediately and vice-versa. So none would be blocked unless explicitly specified (*Qt::BlockingQueuedConnection*). I've been using boost only since a while back as it was required to code new Api in boost. How do i achieve this mechanism in *boost <--> Qt communication*? Api is going to be header+static_library and so Gui and Api will produce single executable. I have to support Linux, Windows and Mac minimum. -- View this message in context: http://boost.2283326.n4.nabble.com/Communication-between-QThread-and-boost-… Sent from the Boost - Users mailing list archive at Nabble.com.

3 5

Re: [Boost-users] [Chrono] Memory leak in Chrono?
by Don 13 Feb '13

13 Feb '13

> Subject: Re: [Boost-users] [Chrono] Memory leak in Chrono? > From: "Vicente J. Botet Escriba" <vicente.botet(a)wanadoo.fr> > Date: 2/12/2013 1:17 PM > > Le 12/02/13 18:13, gast128 a écrit : >> we use Boost.Chrono too. MFC applications incorrectly report memory leaks, which can easily be solved. > Hi, > > if you have some patches to propose to avoids this incorrect reports I would try to include them. Vincente, I am using MFC, but I don't believe this is a MFC false-leak report. I added a destructor for duration_units_default_initializer_t, like this (near the end of chrono/io/duration_units.hpp): ~duration_units_default_initializer_t() { if (duration_units_default_holder<CharT>::initialized_) { delete[] duration_units_default_holder<CharT>::n_d_valid_units_; duration_units_default_holder<CharT>::n_d_valid_units_ = 0; delete[] duration_units_default_holder<CharT>::valid_units_; duration_units_default_holder<CharT>::valid_units_ = 0; duration_units_default_holder<CharT>::initialized_ = false; } } This solves the memory leak, and seems to work fine for my simple test program. But n_d_valid_units_, valid_units_, and initialized_ are static variables, so I assume you want to only create these variables once. When run with my test program and step through it in the debugger, only one instantiation of duration_units_default_initializer_t occurs. (That is, once for each char type, single-byte and wide.) This occurs when the duration_units_default_initializer is instantiated (at the very end of duration_units.hpp). Since this is a global variable, this occurs during application startup and the destructor runs during application shuttdown. But presumably this can occur in some other situations, otherwise why would you have all the logic of making valid_units_ etc. class-static variables. I don't think I understand enough about what is going on to propose a robust solution. Thanks for your help, Don

2 1

boost::thread include order error
by Rob Patro 13 Feb '13

13 Feb '13

Hi, I noticed that when I don't include <boost/thread/thread.hpp> before the standard library includes, I get the following errors: In file included from /fs/szattic-asmg6/rob/dist/include/boost/thread/lock_types.hpp:14:0, from /fs/szattic-asmg6/rob/dist/include/boost/thread/pthread/thread_data.hpp:12, from /fs/szattic-asmg6/rob/dist/include/boost/thread/thread.hpp:17, from /fs/szattic-asmg7/rob/countseq/include/iterative_optimizer.hpp:26, from /fs/szattic-asmg7/rob/countseq/src/sailfish.cpp:33: /fs/szattic-asmg6/rob/dist/include/boost/thread/lockable_traits.hpp:90:37: error: expected identifier before ‘*’ token /fs/szattic-asmg6/rob/dist/include/boost/thread/lockable_traits.hpp:114:37: error: expected identifier before ‘*’ token However, when I move the boost thread include to the top of the set of included headers (above the standard library), the program compiles and runs correctly. What is the reason for this frustrating requirement? Is it possible to eliminate this behavior, so that <boost/thread/thread.hpp> can be included anywhere (or at least after the standard library) ? Thanks, Rob

2 1

[Preprocessor] How to work around empty sequence?
by Adam Badura 13 Feb '13

13 Feb '13

I was using sequences happily until I realized that quite often I will have an empty collection. Yet empty sequences are not supported. So I switched to lists. But they are syntactically so much worse! You have to add that BOOST_PP_NIL. You have to take care of proper nesting of elements. Much less readable and editable in my opinion. This made me consider going back to sequences after all and requiring user to provide some kind of special symbol for empty sequence or end eery sequence with a fixed item so that I will now it is end and not a real item. In my opinion the extra effort would still be less than with the lists while overall "user experience" would be better. (At the expense of complicating my own code - but I'm ready to accept that.) Does anyone of you ever did something like that? Guidelines? Ideas? How do sequence function deal with empty sequences? If I would pass to BOOST_PP_SEQ_ENUM a result of BOOST_PP_SEQ_POP_FRONT on a single-element sequence would it work fine (enumerate nothing)? Or it is not guaranteed?

2 1

some questions about boost.log & boost.process
by niXman 13 Feb '13

13 Feb '13

For my project I needed a logger and the ability to run/manage processes. Since the project will use boost, I do not want to drag into it external libraries. I googled boost.process[1] and boost.log[2][3], and I have three questions: 1) whether these libraries are suitable for use in real projects? have anyone used them? 2) do I understand correctly that the boost.process library does not have open CVS? 3) do I understand correctly that for the boost.log library I should use bleeding-edge branch? Thanks. -- Regards, niXman ___________________________________________________ Dual-target(32 & 64-bit) MinGW compilers for 32 and 64-bit Windows: http://sourceforge.net/projects/mingwbuilds/ ___________________________________________________ Another online IDE: http://liveworkspace.org/

4 8

How to search multi_index container using composite key with date ranges
by Jeff 13 Feb '13

13 Feb '13

Hi, I am having syntax issues and wish to search a bmi container by the composite index defined below. I have read about boost::lambdas and understand how they work. I simply have gotten stuck in the syntax to perform the get on the index and how to create the tuple(s) containing the proper objects. I want to search such that searchKey1="key1" and searchKey2="key2" and ValidFrom is <= '2013-03-01' and ValidTo >= '2013-02-08'. Can anyone help me please? Many Thanks!! Jeff R. bmi=boost::multi_index bg=boost::gregorian typedef bmi::multi_index_container<TestRecord, bmi::indexed_by< bmi::ordered_non_unique< bmi::tag<idx_test >, bmi::composite_key<TestRecord, bmi::member<TestRecord, std::string, &TestRecord::searchKey1>, bmi::member<TestRecord, std::string, &TestRecord::searchKey2>, bmi::member<TestRecord, bg::date, &TestRecord::ValidFrom>, bmi::member<TestRecord, bg::date, &TestRecord::ValidTo> > > > > TestCache;

2 3

[python] boost-python headers - are they python version specific?
by Steve Lorimer 12 Feb '13

12 Feb '13

I have python 2.7.3 and 3.2.1 deployed in my environment. I want to build 2 variants of boost python - one for each python version. My question is - will the boost headers be different; or can I just use the same header location for the boost headers, and link against a different boost-python library depending on which python version I want? TIA Steve

2 3

unix tools
by gast128 12 Feb '13

12 Feb '13

Hello all, since Boost has marvelous cross platform libraries, wouldn't it be an idea to rewrite all the standard commandline unix tools (e.g. cp, grep, ps, ls, diff) in c++ with Boost? Libraries like program options, filesystem and regex already fullfill a lot of the functionality. Only thing left is a person with a good knowledge of the syntax of the cmd line tools and ofc a lot of time:). I mainly use Windows and i really miss these tools from time to time. And yes there is Cygwin but I would prefer just the tools without changing my environment.

6 8

[Chrono] Memory leak in Chrono?
by Don 12 Feb '13

12 Feb '13

Boost 1.53 Chrono version 2 VC 2008 Win7-64 If I #include <boost/chrono.hpp> and run my program, on program exit the VC debugger reports about 40 memory leaks. I don't have to actually use chrono, just include the header. A little trial-and-error with #include statements tracked this down to boost\chrono\io\duration_units.hpp. It looks like there are a couple of "new" allocations in the constructor for duration_units_default_initializer_t that are never deleted. As a test I added a destructor that did delete[] on them, and that fixed the memory leaks. However, there is some logic with the initialized_ variable in the constructor that leads me to suspect that this is not a viable solution for real code. :-) Can anyone suggest a better solution for this? Or failing that, give me any ideas about what this code is actually doing and/or how I might proceed? There is a good chance that someone will say "that's not a real memory leak, it's allocated once and never deleted, but it goes away when your program exits. Don't worry about it". The problem with that answer is that when you have 40 or 50 memory leaks that are "normal", everyone stops paying any attention to the memory leak report and you start adding (unintentionally) real memory leaks in your code. Thanks for your help, Don

4 4

[Preprocessor] Comma in sequence element
by Adam Badura 12 Feb '13

12 Feb '13

I have following code: #include <boost/preprocessor/seq/enum.hpp> #include <boost/preprocessor/seq/transform.hpp> template< int I, int J > struct Base { }; #define SEQ ( 1 ) ( 2 ) ( 3 ) ( 4 ) #define OP( s, data, elem ) Base< elem, elem > struct Derived : BOOST_PP_SEQ_ENUM( BOOST_PP_SEQ_TRANSFORM( OP, nil, SEQ ) ) { }; The Derived has bases classes generated from a sequence (SEQ). The bases classes themselves are instantiations of Base template type. I expected the code to be preprocessed into something like (just the important part): struct Derived : Base< 1, 1 >, Base< 2, 2 >, Base< 3, 3 >, Base< 4, 4 > { }; but instead it is preprocessed into: struct Derived : Base< 1, Base< 2, Base< 3, Base< 4 { }; This obviously is caused by Base being template with to parameters and thus having a comma. Adding parenthesis around Base in OP solves the issue by generating expected code fully. But it still does not compile because parenthesis are not allowed in that place (base classes list). Is there any other workaround? How to deal with it?

3 2

udp::socket::socket() vs udp::socket::open()
by Chris Stankevitz 11 Feb '13

11 Feb '13

Hello, The UDP async server example opens the udp socket like so: a) udp::socket::socket(io_service, udp::endpoint(udp::v4(), 13)) Boost's comment regarding this invocation: * This constructor creates a datagram socket and automatically opens it bound * to the specified endpoint on the local machine. The protocol used is the * protocol associated with the given endpoint. Please consider the udp::socket constructor that takes only an io_service: b) explicit basic_datagram_socket(boost::asio::io_service& io_service) Commented as: * This constructor creates a datagram socket without opening it. The open() * function must be called before data can be sent or received on the socket. And finally, udp::socket::open: (c) void open(const protocol_type & protocol = protocol_type()); Please note that (a) takes an endpoint while (c) takes a protocol. === Question: How can I effectively call (a) using the two-part invocation (b) then (c)? Answer: 1) Just call udp::socket::open(endpoint(udp::v4(), 13)); 2) This is impossible because (a) takes a endpoint while (c) wants a protocol 3) Why would you want to do that you moron? 4) Why don't you write your own udp::socket::open that takes an endpoint if you are so smart? Try giving back to the community instead of just taking. You are a leech and not worthy of reading this mailing list let alone posting to it. 5) none of the above Note: (1) fails with error: no matching function for call to 'boost::asio::basic_datagram_socket<boost::asio::ip::udp>::open(boost::asio::ip::udp::endpoint)' Thank you, Chris

1 0

Extracting subgrapshs
by dheeraj_kumar 11 Feb '13

11 Feb '13

Hello, It will very helpfull if anybody provide some sample code for Extracting list of subgraps's from a Graph. Regards, Dheeraj -- View this message in context: http://boost.2283326.n4.nabble.com/Extracting-subgrapshs-tp4642616.html Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

modifying default compiler path
by Mahmood Naderan 11 Feb '13

11 Feb '13

Hi I have an old version of boost 1.33.1. I want to build it with a custom gcc binary whih is in a path other than default. I could not find the page on the web so I paste the first part of the gcc-tools.jam form tools/build/v1/gcc-tools.jam. # singleton variables... set-as-singleton GCC_ROOT_DIRECTORY GCC_BIN_DIRECTORY GCC_INCLUDE_DIRECTORY GCC_STDLIB_DIRECTORY ; flags gcc GCC_BIN_DIRECTORY : $(GCC_BIN_DIRECTORY) ; flags gcc GCC_INCLUDE_DIRECTORY : $(GCC_INCLUDE_DIRECTORY) ; flags gcc GCC_STDLIB_DIRECTORY : $(GCC_STDLIB_DIRECTORY) ; GCC_BIN_DIRECTORY ?= $(GCC_ROOT_DIRECTORY)$(SLASH)bin ; GCC_BIN_DIRECTORY ?= "" ; # Don't clobber tool names if GCC_ROOT_DIRECTORY not set GCC_STDLIB_DIRECTORY ?= $(GCC_ROOT_DIRECTORY)$(SLASH)lib ; # Make sure this gets set "on" the target flags gcc GCC_BIN_DIR : $(GCC_BIN_DIRECTORY) ; In this part I can modify the default gcc/g++ to my own using the variables which are defined in the comment section. However I don't know How to do that. For example, I write GCC_BIN_DIRECTORY=/opt/gcc-4.1.2/installed But that gives me this error: rule GCC_ROOT_DIRECTORY=/opt/gcc-4.1.2/installed unknown in module So how can I do that? Regards, Mahmood

1 0

[Thread] 1.53 fails to compile working code
by Szymon Gatner 10 Feb '13

10 Feb '13

Hello, following minimal code compiles fine with 1.52 and BOOST_THREAD_VERSION defined to 3 but gives compilation error with 1.53 release (Visual Studio 2008 SP1, Win 7): #include <boost/move/move.hpp> #include <boost/thread/future.hpp> class Dummy { public: Dummy& operator=(BOOST_RV_REF(Dummy) other); Dummy& operator=(BOOST_COPY_ASSIGN_REF(Dummy) other); BOOST_COPYABLE_AND_MOVABLE(Dummy); }; Dummy createDummy(); int main() { boost::future<Dummy> df = boost::async(&createDummy); } Error message: 1>------ Build started: Project: boost_153_test, Configuration: Debug Win32 ------ 1>Compiling... 1>main.cpp 1>c:\devel\boost_1_53_0\boost\thread\future.hpp(661) : error C2665: 'boost::detail::future_traits<T>::init' : none of the 2 overloads could convert all the argument types 1> with 1> [ 1> T=Dummy 1> ] 1> c:\devel\boost_1_53_0\boost\thread\future.hpp(525): could be 'void boost::detail::future_traits<T>::init(boost::scoped_ptr<T> &,Dummy &)' 1> with 1> [ 1> T=Dummy 1> ] 1> c:\devel\boost_1_53_0\boost\thread\future.hpp(530): or 'void boost::detail::future_traits<T>::init(boost::scoped_ptr<T> &,boost::rv<T> &)' 1> with 1> [ 1> T=Dummy 1> ] 1> while trying to match the argument list '(boost::scoped_ptr<T>, const Dummy)' 1> with 1> [ 1> T=Dummy 1> ] 1> c:\devel\boost_1_53_0\boost\thread\future.hpp(655) : while compiling class template member function 'void boost::detail::future_object<T>::set_value_at_thread_exit(const T &)' 1> with 1> [ 1> T=Dummy 1> ] 1> c:\devel\boost_1_53_0\boost\thread\future.hpp(1542) : see reference to class template instantiation 'boost::detail::future_object<T>' being compiled 1> with 1> [ 1> T=Dummy 1> ] 1> c:\devel\boost_1_53_0\boost\thread\future.hpp(1415) : see reference to class template instantiation 'boost::shared_future<R>' being compiled 1> with 1> [ 1> R=Dummy 1> ] 1> c:\devel\boost_1_53_0\boost\thread\future.hpp(1413) : while compiling class template member function 'boost::future<R>::future(boost::rv<T> &)' 1> with 1> [ 1> R=Dummy, 1> T=boost::future<Dummy> 1> ] 1> c:\users\bravo\documents\visual studio 2008\projects\boost_153_test\boost_153_test\main.cpp(19) : see reference to class template instantiation 'boost::future<R>' being compiled 1> with 1> [ 1> R=Dummy 1> ] 1>Build log was saved at "file://c:\Users\Bravo\Documents\Visual Studio 2008\Projects\boost_153_test\boost_153_test\Debug\BuildLog.htm" 1>boost_153_test - 1 error(s), 0 warning(s) ========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ========== Btw: why BOOST_THREAD_VERSION is still 2 when documentation says it is 4.0.0 as of boost 1.53? Regards, Szymon Gatner -- Szymon Gatner The Lordz Games Studio www.thelordzgamesstudio.com

3 14

[Interprocess] WIN32 define case unaccessible ?
by Antoine Pédron 10 Feb '13

10 Feb '13

Hello, I'm using Boost.Interprocess in order to get a single portable source code between Windows and Linux using Mutexes and Shared Memory. Documentation says that, for Windows, the API default behaviour is emulation with mapped files, which is the case (:D). Though, having a look at interprocess' headers, i encountrered this case : from D:\Libraries\boost\boost_1_51\boost\interprocess\sync\named_mutex.hpp : ____________________________________________________________________________ #if defined(BOOST_INTERPROCESS_NAMED_MUTEX_USES_POSIX_SEMAPHORES) #include <boost/interprocess/sync/posix/named_mutex.hpp> #define BOOST_INTERPROCESS_USE_POSIX_SEMAPHORES #elif !defined(BOOST_INTERPROCESS_FORCE_GENERIC_EMULATION) && defined (BOOST_INTERPROCESS_WINDOWS) #include <boost/interprocess/sync/windows/named_mutex.hpp> #define BOOST_INTERPROCESS_USE_WINDOWS #else #include <boost/interprocess/sync/shm/named_mutex.hpp> #endif ____________________________________________________________________________ A case where BOOST_INTERPROCESS_FORCE_GENERIC_EMULATION is not defined and BOOST_INTERPROCESS_WINDOWS is, meaning that i can use Windows standard API. My problem is that i want to use this case and i wonder how to reach it. The former file includes boost/interprocess/detail/workaround.hpp where both symbols are defined : ____________________________________________________________________________ #if defined(_WIN32) || defined(__WIN32__) || defined(WIN32) #define BOOST_INTERPROCESS_WINDOWS #define BOOST_INTERPROCESS_FORCE_GENERIC_EMULATION #define BOOST_INTERPROCESS_HAS_KERNEL_BOOTTIME ____________________________________________________________________________ and i can't see an #undef anywhere to get into the case i want. Thanks in advance, Antoine

2 1

Testing whether result_of<F(U)> is a valid expression
by oswin krause 08 Feb '13

08 Feb '13

Hi, Is it possible to evaluate, whether a certain argument type given to a functor will lead to a valid expression with the result_of template? i am trying to achieve the following, maybe there is a better way to do it: template<class T, class F> Container< typename boost::result_of<F(T)>::type > transform( Container<T> c, F f, std::disable_if<valid_expression<F(Block<T>) > >::type* dummy = 0 ){ //slow default implementation Container<T> res(c.size()); std::transform(c.begin(),c.end(),res.begin(),f): return res; } //blocked implmentation of transform template<class T, class F> Container< typename boost::result_of<F(T)>::type > transform( Container<T>, F functor, std::enable_if<valid_expression<F(Block<T>) > >::type* dummy = 0 ){ //functor supports fast implementation Container<T> res(c.size()); std::transform(c.blocks().begin(),c.blocks().end(),res.blocks().begin(),functor): return res; } the question is, how valid_expression<F(Block<T>) > could be implemented and right now the only mechanism which get's close to what i want would be checking result_of<F(Block<T>)> is valid. Greetings, Oswin

4 4

Re: [Boost-users] How do you compile Boost C++ code in Ubuntu?
by Giovanni 08 Feb '13

08 Feb '13

Greetings All, Thank you so much, Mr. Maddock. I was able to compile my program successfully and resolve my linking errors with your help. Also, thank you very much, Mr. Loskot! I appreciate all the precious time that you have spent to help me out. Have an awesome weekend! Regards On Fri, Feb 8, 2013 at 8:20 AM, John Maddock <boost.regex(a)virgin.net> wrote: > It is a quirk of GCC that the libraries used by a source file must appear > *after* the source file. Nothing to do with Boost really... > > John. On Fri, Feb 8, 2013 at 9:45 AM, Mateusz Loskot <mateusz(a)loskot.net> wrote: > On 8 February 2013 16:03, Giovanni <giovanni.ong(a)comsoc.org> wrote: >> I followed your instructions to link the libraries, with the >> "-lboost_filesystem -lboost_system" sequence of linking the >> aforementioned Boost C++ libraries. >> >> However, I cannot resolve the linking error. I have included a >> snippet from my Terminal session below. > > No idea what's wrong really and have no time to investigate it. > But, I've done quick test on Ubuntu 10.04 using Boost 1.40 > installed from its packages and small sample from this book > http://en.highscore.de/cpp/boost/errorhandling.html > and it worked for me: > > Here is my console log: > > mloskot@vb-ubuntu104-x64:~/tmp$ /usr/bin/lsb_release -d > Description: Ubuntu 10.04.4 LTS > > mloskot@vb-ubuntu104-x64:~/tmp$ cat bsystem.cpp > #include <boost/system/error_code.hpp> > #include <iostream> > #include <string> > > class application_category : > public boost::system::error_category > { > public: > const char *name() const { return "application"; } > std::string message(int ev) const { return "error message"; } > }; > > application_category cat; > > int main() > { > boost::system::error_code ec(14, cat); > std::cout << ec.value() << std::endl; > std::cout << ec.category().name() << std::endl; > } > > mloskot@vb-ubuntu104-x64:~/tmp$ g++ -L/usr/lib -lboost_system bsystem.cpp > mloskot@vb-ubuntu104-x64:~/tmp$ ./a.out > 14 > application > > mloskot@vb-ubuntu104-x64:~/tmp$ ldd ./a.out |grep boost > libboost_system.so.1.40.0 => /usr/lib/libboost_system.so.1.40.0 > (0x00007f2df87b6000) > > > Perhaps something has changed in later versions. > I have no time to dig it deeper, sorry. > > Best regards,

1 0

Re: [Boost-users] How do you compile Boost C++ code in Ubuntu?
by Giovanni 08 Feb '13

08 Feb '13

Greetings, I realized that when I installed certain packages from the Ubuntu Software Center, I had broken some dependencies. That may have caused the problem. Now, I have reinstalled Boost C++. See the following for a snippet from the Terminal session that indicates the availability of the previously missing files. Go Bears >ls -al | grep libboost_system -rw-r--r-- 1 root root 48666 Jan 2 2012 libboost_system.a lrwxrwxrwx 1 root root 17 Jan 2 2012 libboost_system-mt.a -> libboost_system.a lrwxrwxrwx 1 root root 25 Jan 2 2012 libboost_system-mt.so -> libboost_system.so.1.46.1 lrwxrwxrwx 1 root root 25 Jan 2 2012 libboost_system.so -> libboost_system.so.1.46.1 -rw-r--r-- 1 root root 14568 Jan 2 2012 libboost_system.so.1.46.1 Go Bears > Go Bears >make all g++ -L/usr/lib -lboost_system get_sys_info.cpp /tmp/cckONUUl.o: In function `__static_initialization_and_destruction_0(int, int)': get_sys_info.cpp:(.text+0x13f): undefined reference to `boost::system::generic_category()' get_sys_info.cpp:(.text+0x14b): undefined reference to `boost::system::generic_category()' get_sys_info.cpp:(.text+0x157): undefined reference to `boost::system::system_category()' /tmp/cckONUUl.o: In function `boost::filesystem3::path::codecvt()': get_sys_info.cpp:(.text._ZN5boost11filesystem34path7codecvtEv[boost::filesystem3::path::codecvt()]+0x5): undefined reference to `boost::filesystem3::path::wchar_t_codecvt_facet()' collect2: ld returned 1 exit status make: *** [all] Error 1 Go Bears > So, I am back to square one with the "undefined reference" compilation error. Can you please kindly suggest how can I resolve this problem? Thank you. Regards On Thu, Feb 7, 2013 at 8:33 AM, Mateusz Loskot <mateusz(a)loskot.net> wrote: > On 7 February 2013 15:21, Giovanni <giovanni.ong(a)comsoc.org> wrote: >> >> I had set the shell variable $LD_LIBRARY_PATH to: >> /usr/lib/libboost_system.so. It was originally empty. I used the >> "echo" command to reflect the path that I had set it to. > > I tried to make a point not about how you did set the variable, > but about the fact it has incorrect value. > Let me copy it once again: > > "LD_LIBRARY_PATH, which is a colon-separated list of directories" [1] > > [1] http://tldp.org/HOWTO/Program-Library-HOWTO/shared-libraries.html > > And you may learn from that what the LD_LIBRARY_PATH is meant to be. > >> I had installed it with Ubuntu Software Center. >> Here is a snippet of: /usr/lib >> [...] >> -rw-r--r-- 1 root root 14568 Jan 2 2012 libboost_system.so.1.46.1 >> -rw-r--r-- 1 root root 14568 Jan 5 2012 libboost_system.so.1.48.0 > > You seem to be missing libboost_system.so library or symlink named > libboost_system.so with one of the two as a target. > It may look the installation is broken. > >> When I followed your instructions to install it (again), I couldn't. >> Here is the transcript from the Terminal. >> Go Bears >sudo apt-get install libboost-system-dev >> [sudo] password for arvind: >> Reading package lists... Done >> Building dependency tree >> Reading state information... Done >> Some packages could not be installed. This may mean that you have >> requested an impossible situation or if you are using the unstable >> distribution that some required packages have not yet been created >> or been moved out of Incoming. >> The following information may help to resolve the situation: >> >> The following packages have unmet dependencies: >> libboost-system-dev : Depends: libboost-system1.46-dev but it is not >> going to be installed >> E: Unable to correct problems, you have held broken packages. > > Clearly, something is broken with installation of boost packages in your system. > You should seek for help from Ubuntu folks, it's unrelated to Boost. >

3 4

[python] how to call python's built-in type() function
by Eric Niebler 08 Feb '13

08 Feb '13

In C++, I have a boost::python::object that is wrapping ... something. I'd like to find out what. If I were in python land, I'd call the built-in 'type' function on it. What do I do in C++? Thanks in advance, -- Eric Niebler Boost.org

2 1

Problem with boost 1.53 compilation in Windows
by DUNDEK Ivan 08 Feb '13

08 Feb '13

Hi. We are using boost in our project, and now with 1.53 and some added options we are unable to compile the boost in Windows. In Linux, the build is OK. It seems, that when compiling under Windows, the path for compiled boost obj files depends on the options specified, so if there are many options specified, the path become too long. With reduced number of options, the build is OK. Build environment: Windows7 64bit, Boost 1.53, VisualStudio 2010 Express Here is the build command: bjam -d2 --toolset=msvc-10.0 variant=debug,release threading=multi link=static runtime-link=shared install boost.locale.std=on boost.locale.icu=off boost.locale.winapi=off boost.locale.posix=off -a --with-log --with-thread --with-system --with-date_time --with-filesystem --with-program_options --with-iostreams --with-regex --with-serialization --with-locale --with-atomic define=BOOST_LOG_NO_SETTINGS_PARSERS_SUPPORT --prefix="c:\projects\cpce-cpp-stack\1.3.0\win" -sZLIB_SOURCE="c:\projects\cpce-cpp-stack\1.3.0\win\third-party\zlib-1.2.7" And the output: Performing configuration checks - iconv (libc) : no - iconv (separate) : no - has_icu builds : no Component configuration: - atomic : building - chrono : not building - context : not building - date_time : building - exception : not building - filesystem : building - graph : not building - graph_parallel : not building - iostreams : building - locale : building - log : building - math : not building - mpi : not building - program_options : building - python : not building - random : not building - regex : building - serialization : building - signals : not building - system : building - test : not building - thread : building - timer : not building - wave : not building ...patience... ...patience... ...patience... ...patience... ...found 30159 targets... ...updating 10944 targets... …. file bin.v2\libs\program_options\build\msvc-10.0\debug\boost.locale.icu-off\boost.locale.posix-off\boost.locale.std-on\boost.locale.winapi-off\link-static\threading-multi\split.obj.rsp "libs\program_options\src\split.cpp" -Fo"bin.v2\libs\program_options\build\msvc-10.0\debug\boost.locale.icu-off\boost.locale.posix-off\boost.locale.std-on\boost.locale.winapi-off\link-static\threading-multi\split.obj" -TP /Z7 /Od /Ob0 /W3 /GR /MDd /Zc:forScope /Zc:wchar_t /wd4675 /EHs -c -DBOOST_ALL_NO_LIB=1 -DBOOST_LOG_NO_SETTINGS_PARSERS_SUPPORT "-I." compile-c-c++ bin.v2\libs\program_options\build\msvc-10.0\debug\boost.locale.icu-off\boost.locale.posix-off\boost.locale.std-on\boost.locale.winapi-off\link-static\threading-multi\split.obj call "C:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\vcvarsall.bat" x86 >nul cl /Zm800 -nologo @"bin.v2\libs\program_options\build\msvc-10.0\debug\boost.locale.icu-off\boost.locale.posix-off\boost.locale.std-on\boost.locale.winapi-off\link-static\threading-multi\split.obj.rsp" split.cpp failed to write output file 'bin.v2\libs\program_options\build\msvc-10.0\debug\boost.locale.icu-off\boost.locale.posix-off\boost.locale.std-on\boost.locale.winapi-off\link-static\threading-multi\libboost_program_options-vc100-mt-gd-1_53.lib.rsp'! c:\projects\cpce-cpp-stack\1.3.0\src\boost_1_53_0>cd "c:\projects\cpce-cpp-stack\1.3.0\win" Thank you for advice Best regards Ivan Dundek.

2 2

Problem linking with boost 1, 51 64-bits from boostpro, VC10
by Alain Leblanc 07 Feb '13

07 Feb '13

Hi, I'm having some issues linking my code with the 64-bit version of boost 1.51 on windows with VC 10. I managed to write this small example that illustrates my problem. It is a project to create a DLL. I downloaded from boostpro.com. Here's the code: #include <boost/regex.hpp> #include <boost/filesystem.hpp> void useBoost() { } and the result. ------ Build started: Project: test-64, Configuration: Release x64 ------ UsesRegex.cpp UsesRegex.obj : error LNK2001: unresolved external symbol "class boost::system::error_category const & __cdecl boost::system::system_category(void)" (?system_category@system@boost@ @YAAEBVerror_category@12@XZ) UsesRegex.obj : error LNK2001: unresolved external symbol "class boost::system::error_category const & __cdecl boost::system::generic_category(void)" (?generic_category@system@boost@ @YAAEBVerror_category@12@XZ) C:\Users\aleblanc\projects\trunk\XDE\sandbox\alain\c-testing\test-64\x64\Release\test-64.dll : fatal error LNK1120: 2 unresolved externals ========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ========== However, if I comment out the include for filesystem.hpp it compiles ok. I have included the path to the boost libraries in the 'Additional Library Directories' property for the linker. otherwise it complains about not finding the library for boost_regex. Compiling for 32 bit (with the path for the libraries to a 32-bit installation of boost) works fine. Any suggestion would be appreciated. Thanks, a

3 3

boost compiler warnings
by Dave Dyer 07 Feb '13

07 Feb '13

Using boost 52 on OSX / 64 and xcode 4, the new mac compiler produces a lot of "semantic issue" warnings. I assume these are all not consequential, but is this lint being addressed? The two issues it is complaining about is that "long" is compiled as int64, and that using string literals as char * is deprecated.

2 1

Serialization: BOOST_CLASS_EXPORT changes between 1.38 and 1.52
by Nathan Whitehorn 07 Feb '13

07 Feb '13

I'm upgrading a large data analysis project from boost 1.38 to 1.52 (see this 2008 Boostcon talk for details: http://www.icecube.umd.edu/~troy/talks/icefishing.pdf) Everything has gone remarkably smoothly, with a minimal degree of #if, except for one thing: a change in the semantics of BOOST_CLASS_EXPORT. The software is organized into a number of shared libraries each of which have serializable classes that generally inherit from a shared base class, through pointers to which the derived classes are almost always [de]serialized to/from a custom archive type. When using 1.38, the BOOST_CLASS_EXPORT directive was kept in the implementation file for each serializable class. This almost still works for 1.52 but can result in strange behavior that took me two days to track down. Some of our classes would report through unregistered class errors on [de]serialization. Which ones would depend on circumstances, compiler version, linker, and operating system. The reason turns out to be changes in handling of the class GUID. This is associated to the pointer serializer by BOOST_CLASS_EXPORT -- but also now apparently by the first instantiated code [de]serializing the class through that archive directly based on the presence of a template specialization of boost::serialization::guid<T>() currently in scope, which is NULL by default. Once NULL is set as the GUID, it stays that way, regardless of a proper BOOST_CLASS_EXPORT later. This occurred in our case as a result of def_pickle() calls in boost.python bindings that used the same classes and archive type. This can be fixed by BOOST_CLASS_EXPORT_KEY in all appropriate header files. Adding it is a sizeable amount of work (hundreds of classes) but I'm more concerned the mechanism is very fragile in the case of templates and I'm not sure what to do there. For example, we have a generic serializable container. Any specialization of it needs to be registered with BOOST_CLASS_EXPORT, which is fine, but anyone using that specialization needs to also include a header file BOOST_CLASS_EXPORT_KEY() in it for that particular specialization as well. In other words, you can't just use container<Foo> and expect it to work reliably and, moreover, if you use it *once* without having seen the right in-scope macro, it will break serialization of that type globally if you happen to have linked against a library that made this mistake. Probably. Depending on initialization order. So my questions: 1. Is it possible for things that would return GUIDs of NULL to try harder and look in a global registry instead of silently breaking things? This kind of global lookup was how 1.38 always worked and it seems considerably less fragile. 2. Is there a way to handle BOOST_CLASS_EXPORT_KEY() sanely in the case of templates without the risk of silent serialization failures -- in all instances of that class -- that depend on global initialization order? 3. Is it possible to change the GUID set in the extended type info object of a pointer_[i/o]serializer at runtime after the class has been added to the export registry? 4. Are there any suggested mechanisms for local hacks, given that we control the archive implementation, to implement 1-3 without changes to boost? -Nathan

2 3

[serialization] Support for Boost.Container?
by Jensen, Erik A 07 Feb '13

07 Feb '13

I see that Boost.Serialization has support for serializing STL containers, such as std::vector. However, I can't seem to serialize a boost::container::vector. Do I need to do something special to get this to work, or is it not supported? I need guaranteed support for incomplete types, so I can't use an STL vector. If it is not supported, what is my best bet, for now? Are there any plans to do so? Using Boost.Serialization with Boost.Container is something I would expect to just work, and it seems like most of the STL code could be reused. Thanks.

6 7

Re: [Boost-users] enable_shared_from_this()
by John M. Dlugosz 07 Feb '13

07 Feb '13

Frank Mori Hess<fmh6jj(a)gmail.com> wrote: > That means > throwing exceptions from the constructor after using shared_from_raw > (or in any derived constructor since ithe derived constructor would be > called later) causes bad things to happen. That's no different from stashing away a raw pointer from a constructor (e.g. passing it as a "parent" pointer to a referenced object). But that could be improved upon: The collaborators can be given a weak_ptr only. But, we may require that collaborators have owning references. In my library, a "borrower" (weak_ptr) could optionally hold a strong reference as well, so the reference could be upgraded from weak to strong after a point of commitment is reached. If there were some kind of on-spec pending ptr type, they could be seen as strong references eventually and in normal use, but automatically cleared or committed by the Create wrapper. That is, you would not have to keep track of the collaborators and hook them up in a second stage; rather, all such pending ptrs would become solid (wherever they are) with one call made after the ctor is golden. I never had a problem with it, though. —John

1 0

Re: [Boost-users] How do you compile Boost C++ code in Ubuntu?
by Giovanni 07 Feb '13

07 Feb '13

Greetings, I am sorry for the confusion; I mean my code that uses Boost C++ Libraries. I had set the shell variable $LD_LIBRARY_PATH to: /usr/lib/libboost_system.so. It was originally empty. I used the "echo" command to reflect the path that I had set it to. I had installed it with Ubuntu Software Center. Here is a snippet of: /usr/lib -rw-r--r-- 1 root root 31152 Jan 5 2012 libboost_chrono.so.1.48.0 -rw-r--r-- 1 root root 68216 Jan 2 2012 libboost_date_time.so.1.46.1 -rw-r--r-- 1 root root 122280 Jan 2 2012 libboost_filesystem.so.1.46.1 -rw-r--r-- 1 root root 324192 Jan 2 2012 libboost_graph.so.1.46.1 -rw-r--r-- 1 root root 328328 Jan 5 2012 libboost_graph.so.1.48.0 -rw-r--r-- 1 root root 101592 Jan 2 2012 libboost_iostreams.so.1.46.1 -rw-r--r-- 1 root root 885000 Jan 5 2012 libboost_locale.so.1.48.0 -rw-r--r-- 1 root root 105264 Jan 2 2012 libboost_math_c99f.so.1.46.1 -rw-r--r-- 1 root root 109264 Jan 2 2012 libboost_math_c99l.so.1.46.1 -rw-r--r-- 1 root root 109312 Jan 2 2012 libboost_math_c99.so.1.46.1 -rw-r--r-- 1 root root 265088 Jan 2 2012 libboost_math_tr1f.so.1.46.1 -rw-r--r-- 1 root root 244536 Jan 2 2012 libboost_math_tr1l.so.1.46.1 -rw-r--r-- 1 root root 240440 Jan 2 2012 libboost_math_tr1.so.1.46.1 -rw-r--r-- 1 root root 89656 Jan 3 2012 libboost_mpi_python-py27.so.1.46.1 -rw-r--r-- 1 root root 89656 Jan 3 2012 libboost_mpi_python-py32.so.1.46.1 -rw-r--r-- 1 root root 180320 Jan 3 2012 libboost_mpi.so.1.46.1 -rw-r--r-- 1 root root 180320 Jan 5 2012 libboost_mpi.so.1.48.0 -rw-r--r-- 1 root root 116720 Jan 5 2012 libboost_prg_exec_monitor.a lrwxrwxrwx 1 root root 27 Jan 5 2012 libboost_prg_exec_monitor-mt.a -> libboost_prg_exec_monitor.a lrwxrwxrwx 1 root root 35 Jan 5 2012 libboost_prg_exec_monitor-mt.so -> libboost_prg_exec_monitor.so.1.48.0 lrwxrwxrwx 1 root root 35 Jan 5 2012 libboost_prg_exec_monitor.so -> libboost_prg_exec_monitor.so.1.48.0 -rw-r--r-- 1 root root 56352 Jan 2 2012 libboost_prg_exec_monitor.so.1.46.1 -rw-r--r-- 1 root root 56352 Jan 5 2012 libboost_prg_exec_monitor.so.1.48.0 -rw-r--r-- 1 root root 414280 Jan 2 2012 libboost_program_options.so.1.46.1 -rw-r--r-- 1 root root 311168 Jan 2 2012 libboost_python-py27.so.1.46.1 -rw-r--r-- 1 root root 315264 Jan 5 2012 libboost_python-py27.so.1.48.0 -rw-r--r-- 1 root root 307072 Jan 2 2012 libboost_python-py32.so.1.46.1 -rw-r--r-- 1 root root 311136 Jan 5 2012 libboost_python-py32.so.1.48.0 -rw-r--r-- 1 root root 10472 Jan 2 2012 libboost_random.so.1.46.1 -rw-r--r-- 1 root root 1054456 Jan 2 2012 libboost_regex.so.1.46.1 -rw-r--r-- 1 root root 1079096 Jan 5 2012 libboost_regex.so.1.48.0 -rw-r--r-- 1 root root 1240020 Jan 5 2012 libboost_serialization.a lrwxrwxrwx 1 root root 24 Jan 5 2012 libboost_serialization-mt.a -> libboost_serialization.a lrwxrwxrwx 1 root root 32 Jan 5 2012 libboost_serialization-mt.so -> libboost_serialization.so.1.48.0 lrwxrwxrwx 1 root root 32 Jan 5 2012 libboost_serialization.so -> libboost_serialization.so.1.48.0 -rw-r--r-- 1 root root 446584 Jan 2 2012 libboost_serialization.so.1.46.1 -rw-r--r-- 1 root root 446584 Jan 5 2012 libboost_serialization.so.1.48.0 -rw-r--r-- 1 root root 80600 Jan 2 2012 libboost_signals.so.1.46.1 -rw-r--r-- 1 root root 14568 Jan 2 2012 libboost_system.so.1.46.1 -rw-r--r-- 1 root root 14568 Jan 5 2012 libboost_system.so.1.48.0 -rw-r--r-- 1 root root 1635110 Jan 5 2012 libboost_test_exec_monitor.a lrwxrwxrwx 1 root root 28 Jan 5 2012 libboost_test_exec_monitor-mt.a -> libboost_test_exec_monitor.a -rw-r--r-- 1 root root 101304 Jan 2 2012 libboost_thread.so.1.46.1 -rw-r--r-- 1 root root 109536 Jan 5 2012 libboost_thread.so.1.48.0 -rw-r--r-- 1 root root 33102 Jan 5 2012 libboost_timer.a lrwxrwxrwx 1 root root 16 Jan 5 2012 libboost_timer-mt.a -> libboost_timer.a lrwxrwxrwx 1 root root 24 Jan 5 2012 libboost_timer-mt.so -> libboost_timer.so.1.48.0 lrwxrwxrwx 1 root root 24 Jan 5 2012 libboost_timer.so -> libboost_timer.so.1.48.0 -rw-r--r-- 1 root root 18832 Jan 5 2012 libboost_timer.so.1.48.0 -rw-r--r-- 1 root root 1879526 Jan 5 2012 libboost_unit_test_framework.a lrwxrwxrwx 1 root root 30 Jan 5 2012 libboost_unit_test_framework-mt.a -> libboost_unit_test_framework.a lrwxrwxrwx 1 root root 38 Jan 5 2012 libboost_unit_test_framework-mt.so -> libboost_unit_test_framework.so.1.48.0 lrwxrwxrwx 1 root root 38 Jan 5 2012 libboost_unit_test_framework.so -> libboost_unit_test_framework.so.1.48.0 -rw-r--r-- 1 root root 656824 Jan 2 2012 libboost_unit_test_framework.so.1.46.1 -rw-r--r-- 1 root root 669080 Jan 5 2012 libboost_unit_test_framework.so.1.48.0 -rw-r--r-- 1 root root 1320168 Jan 2 2012 libboost_wave.so.1.46.1 -rw-r--r-- 1 root root 845962 Jan 5 2012 libboost_wserialization.a lrwxrwxrwx 1 root root 25 Jan 5 2012 libboost_wserialization-mt.a -> libboost_wserialization.a lrwxrwxrwx 1 root root 33 Jan 5 2012 libboost_wserialization-mt.so -> libboost_wserialization.so.1.48.0 lrwxrwxrwx 1 root root 33 Jan 5 2012 libboost_wserialization.so -> libboost_wserialization.so.1.48.0 -rw-r--r-- 1 root root 323128 Jan 2 2012 libboost_wserialization.so.1.46.1 -rw-r--r-- 1 root root 323128 Jan 5 2012 libboost_wserialization.so.1.48.0 Here is a listing of the files in: /usr/include/boost Go Bears >ls -al total 1308 drwxr-xr-x 86 root root 12288 Feb 7 03:51 . drwxr-xr-x 121 root root 20480 Feb 7 03:50 .. drwxr-xr-x 5 root root 4096 Feb 7 03:50 accumulators drwxr-xr-x 3 root root 4096 Feb 7 03:50 algorithm -rw-r--r-- 1 root root 4297 Jan 5 2012 aligned_storage.hpp -rw-r--r-- 1 root root 6505 Jan 5 2012 any.hpp drwxr-xr-x 5 root root 4096 Feb 7 03:51 archive -rw-r--r-- 1 root root 15525 Jan 5 2012 array.hpp drwxr-xr-x 9 root root 4096 Feb 7 03:50 asio -rw-r--r-- 1 root root 4265 Jan 5 2012 asio.hpp -rw-r--r-- 1 root root 4120 Jan 5 2012 assert.hpp drwxr-xr-x 3 root root 4096 Feb 7 03:51 assign -rw-r--r-- 1 root root 614 Jan 5 2012 assign.hpp drwxr-xr-x 9 root root 4096 Feb 7 03:51 bimap -rw-r--r-- 1 root root 387 Jan 5 2012 bimap.hpp drwxr-xr-x 2 root root 4096 Feb 7 03:50 bind -rw-r--r-- 1 root root 581 Jan 5 2012 bind.hpp -rw-r--r-- 1 root root 618 Jan 5 2012 blank_fwd.hpp -rw-r--r-- 1 root root 1946 Jan 5 2012 blank.hpp -rw-r--r-- 1 root root 773 Jan 5 2012 call_traits.hpp -rw-r--r-- 1 root root 4455 Jan 5 2012 cast.hpp -rw-r--r-- 1 root root 4173 Jan 5 2012 cerrno.hpp -rw-r--r-- 1 root root 1589 Jan 5 2012 checked_delete.hpp drwxr-xr-x 4 root root 4096 Feb 7 03:50 chrono -rw-r--r-- 1 root root 706 Jan 5 2012 chrono.hpp drwxr-xr-x 2 root root 4096 Feb 7 03:50 circular_buffer -rw-r--r-- 1 root root 1157 Jan 5 2012 circular_buffer_fwd.hpp -rw-r--r-- 1 root root 2540 Jan 5 2012 circular_buffer.hpp drwxr-xr-x 3 root root 4096 Feb 7 03:50 compatibility -rw-r--r-- 1 root root 801 Jan 5 2012 compressed_pair.hpp drwxr-xr-x 3 root root 4096 Feb 7 03:50 concept -rw-r--r-- 1 root root 23671 Jan 5 2012 concept_archetype.hpp drwxr-xr-x 2 root root 4096 Feb 7 03:50 concept_check -rw-r--r-- 1 root root 32100 Jan 5 2012 concept_check.hpp drwxr-xr-x 7 root root 4096 Feb 7 03:51 config -rw-r--r-- 1 root root 2074 Jan 5 2012 config.hpp drwxr-xr-x 3 root root 4096 Feb 7 03:51 container -rw-r--r-- 1 root root 33373 Jan 5 2012 crc.hpp -rw-r--r-- 1 root root 721 Jan 5 2012 cregex.hpp -rw-r--r-- 1 root root 17287 Jan 5 2012 cstdint.hpp -rw-r--r-- 1 root root 1739 Jan 5 2012 cstdlib.hpp -rw-r--r-- 1 root root 1511 Jan 5 2012 current_function.hpp drwxr-xr-x 5 root root 4096 Feb 7 03:50 date_time -rw-r--r-- 1 root root 587 Jan 5 2012 date_time.hpp drwxr-xr-x 3 root root 4096 Feb 7 03:50 detail drwxr-xr-x 2 root root 4096 Feb 7 03:50 dynamic_bitset -rw-r--r-- 1 root root 675 Jan 5 2012 dynamic_bitset_fwd.hpp -rw-r--r-- 1 root root 560 Jan 5 2012 dynamic_bitset.hpp -rw-r--r-- 1 root root 530 Jan 5 2012 enable_shared_from_this.hpp drwxr-xr-x 3 root root 4096 Feb 7 03:50 exception -rw-r--r-- 1 root root 434 Jan 5 2012 exception.hpp -rw-r--r-- 1 root root 374 Jan 5 2012 exception_ptr.hpp drwxr-xr-x 5 root root 4096 Feb 7 03:50 filesystem -rw-r--r-- 1 root root 1340 Jan 5 2012 filesystem.hpp drwxr-xr-x 3 root root 4096 Feb 7 03:50 flyweight -rw-r--r-- 1 root root 622 Jan 5 2012 flyweight.hpp -rw-r--r-- 1 root root 2198 Jan 5 2012 foreach_fwd.hpp -rw-r--r-- 1 root root 45365 Jan 5 2012 foreach.hpp drwxr-xr-x 3 root root 4096 Feb 7 03:51 format -rw-r--r-- 1 root root 2179 Jan 5 2012 format.hpp drwxr-xr-x 3 root root 4096 Feb 7 03:50 function drwxr-xr-x 4 root root 4096 Feb 7 03:50 functional -rw-r--r-- 1 root root 18893 Jan 5 2012 functional.hpp -rw-r--r-- 1 root root 791 Jan 5 2012 function_equal.hpp -rw-r--r-- 1 root root 2200 Jan 5 2012 function.hpp -rw-r--r-- 1 root root 1574 Jan 5 2012 function_output_iterator.hpp drwxr-xr-x 4 root root 4096 Feb 7 03:51 function_types drwxr-xr-x 13 root root 4096 Feb 7 03:51 fusion -rw-r--r-- 1 root root 1859 Jan 5 2012 generator_iterator.hpp drwxr-xr-x 13 root root 4096 Feb 7 03:50 geometry -rw-r--r-- 1 root root 704 Jan 5 2012 geometry.hpp -rw-r--r-- 1 root root 921 Jan 5 2012 get_pointer.hpp drwxr-xr-x 3 root root 4096 Feb 7 03:50 gil drwxr-xr-x 7 root root 12288 Feb 7 03:50 graph drwxr-xr-x 6 root root 4096 Feb 7 03:50 icl -rw-r--r-- 1 root root 794 Jan 5 2012 implicit_cast.hpp -rw-r--r-- 1 root root 1039 Jan 5 2012 indirect_reference.hpp drwxr-xr-x 2 root root 4096 Feb 7 03:51 integer -rw-r--r-- 1 root root 4617 Jan 5 2012 integer_fwd.hpp -rw-r--r-- 1 root root 10877 Jan 5 2012 integer.hpp -rw-r--r-- 1 root root 8714 Jan 5 2012 integer_traits.hpp drwxr-xr-x 11 root root 4096 Feb 7 03:51 interprocess drwxr-xr-x 3 root root 4096 Feb 7 03:50 intrusive -rw-r--r-- 1 root root 499 Jan 5 2012 intrusive_ptr.hpp drwxr-xr-x 3 root root 4096 Feb 7 03:51 io -rw-r--r-- 1 root root 2381 Jan 5 2012 io_fwd.hpp drwxr-xr-x 5 root root 4096 Feb 7 03:51 iostreams -rw-r--r-- 1 root root 634 Jan 5 2012 is_placeholder.hpp drwxr-xr-x 3 root root 4096 Feb 7 03:50 iterator -rw-r--r-- 1 root root 466 Jan 5 2012 iterator_adaptors.hpp -rw-r--r-- 1 root root 1983 Jan 5 2012 iterator.hpp drwxr-xr-x 3 root root 4096 Feb 7 03:51 lambda -rw-r--r-- 1 root root 1271 Jan 5 2012 last_value.hpp -rw-r--r-- 1 root root 75248 Jan 5 2012 lexical_cast.hpp -rw-r--r-- 1 root root 6119 Jan 5 2012 limits.hpp drwxr-xr-x 3 root root 4096 Feb 7 03:50 locale -rw-r--r-- 1 root root 887 Jan 5 2012 locale.hpp drwxr-xr-x 2 root root 4096 Feb 7 03:51 logic -rw-r--r-- 1 root root 484 Jan 5 2012 make_shared.hpp drwxr-xr-x 10 root root 4096 Feb 7 03:50 math -rw-r--r-- 1 root root 2527 Jan 5 2012 math_fwd.hpp -rw-r--r-- 1 root root 596 Jan 5 2012 mem_fn.hpp -rw-r--r-- 1 root root 1273 Jan 5 2012 memory_order.hpp drwxr-xr-x 2 root root 4096 Feb 7 03:50 move drwxr-xr-x 5 root root 4096 Feb 7 03:50 mpi -rw-r--r-- 1 root root 1101 Jan 5 2012 mpi.hpp drwxr-xr-x 10 root root 12288 Feb 7 03:50 mpl drwxr-xr-x 5 root root 4096 Feb 7 03:50 msm drwxr-xr-x 2 root root 4096 Feb 7 03:50 multi_array -rw-r--r-- 1 root root 15351 Jan 5 2012 multi_array.hpp drwxr-xr-x 3 root root 4096 Feb 7 03:50 multi_index -rw-r--r-- 1 root root 3794 Jan 5 2012 multi_index_container_fwd.hpp -rw-r--r-- 1 root root 33455 Jan 5 2012 multi_index_container.hpp -rw-r--r-- 1 root root 1296 Jan 5 2012 next_prior.hpp -rw-r--r-- 1 root root 1014 Jan 5 2012 noncopyable.hpp -rw-r--r-- 1 root root 595 Jan 5 2012 nondet_random.hpp -rw-r--r-- 1 root root 773 Jan 5 2012 none.hpp -rw-r--r-- 1 root root 605 Jan 5 2012 none_t.hpp -rw-r--r-- 1 root root 619 Jan 5 2012 non_type.hpp drwxr-xr-x 5 root root 4096 Feb 7 03:50 numeric -rw-r--r-- 1 root root 38818 Jan 5 2012 operators.hpp drwxr-xr-x 2 root root 4096 Feb 7 03:50 optional -rw-r--r-- 1 root root 528 Jan 5 2012 optional.hpp drwxr-xr-x 3 root root 4096 Feb 7 03:51 parameter -rw-r--r-- 1 root root 724 Jan 5 2012 parameter.hpp drwxr-xr-x 3 root root 4096 Feb 7 03:50 pending drwxr-xr-x 12 root root 4096 Feb 7 03:51 phoenix -rw-r--r-- 1 root root 476 Jan 5 2012 phoenix.hpp -rw-r--r-- 1 root root 1821 Jan 5 2012 pointee.hpp -rw-r--r-- 1 root root 1124 Jan 5 2012 pointer_cast.hpp -rw-r--r-- 1 root root 1199 Jan 5 2012 pointer_to_other.hpp drwxr-xr-x 3 root root 4096 Feb 7 03:50 polygon drwxr-xr-x 3 root root 4096 Feb 7 03:50 pool drwxr-xr-x 19 root root 4096 Feb 7 03:50 preprocessor -rw-r--r-- 1 root root 486 Jan 5 2012 preprocessor.hpp drwxr-xr-x 3 root root 4096 Feb 7 03:51 program_options -rw-r--r-- 1 root root 819 Jan 5 2012 program_options.hpp -rw-r--r-- 1 root root 5510 Jan 5 2012 progress.hpp drwxr-xr-x 3 root root 4096 Feb 7 03:50 property_map drwxr-xr-x 3 root root 4096 Feb 7 03:51 property_tree drwxr-xr-x 6 root root 4096 Feb 7 03:50 proto drwxr-xr-x 3 root root 4096 Feb 7 03:50 ptr_container drwxr-xr-x 6 root root 4096 Feb 7 03:51 python -rw-r--r-- 1 root root 2868 Jan 5 2012 python.hpp drwxr-xr-x 3 root root 4096 Feb 7 03:50 random -rw-r--r-- 1 root root 3644 Jan 5 2012 random.hpp drwxr-xr-x 6 root root 4096 Feb 7 03:50 range -rw-r--r-- 1 root root 842 Jan 5 2012 range.hpp drwxr-xr-x 4 root root 4096 Feb 7 03:51 ratio -rw-r--r-- 1 root root 349 Jan 5 2012 ratio.hpp -rw-r--r-- 1 root root 19603 Jan 5 2012 rational.hpp -rw-r--r-- 1 root root 3926 Jan 5 2012 ref.hpp drwxr-xr-x 5 root root 4096 Feb 7 03:50 regex -rw-r--r-- 1 root root 693 Jan 5 2012 regex_fwd.hpp -rw-r--r-- 1 root root 2174 Jan 5 2012 regex.h -rw-r--r-- 1 root root 823 Jan 5 2012 regex.hpp -rw-r--r-- 1 root root 502 Jan 5 2012 scoped_array.hpp -rw-r--r-- 1 root root 491 Jan 5 2012 scoped_ptr.hpp -rw-r--r-- 1 root root 9936 Jan 5 2012 scope_exit.hpp drwxr-xr-x 3 root root 4096 Feb 7 03:51 serialization -rw-r--r-- 1 root root 552 Jan 5 2012 shared_array.hpp -rw-r--r-- 1 root root 2007 Jan 5 2012 shared_container_iterator.hpp -rw-r--r-- 1 root root 539 Jan 5 2012 shared_ptr.hpp -rw-r--r-- 1 root root 12795 Jan 5 2012 signal.hpp drwxr-xr-x 3 root root 4096 Feb 7 03:50 signals drwxr-xr-x 3 root root 4096 Feb 7 03:50 signals2 -rw-r--r-- 1 root root 752 Jan 5 2012 signals2.hpp -rw-r--r-- 1 root root 345 Jan 5 2012 signals.hpp drwxr-xr-x 3 root root 4096 Feb 7 03:50 smart_ptr -rw-r--r-- 1 root root 892 Jan 5 2012 smart_ptr.hpp drwxr-xr-x 17 root root 4096 Feb 7 03:50 spirit -rw-r--r-- 1 root root 1085 Jan 5 2012 spirit.hpp drwxr-xr-x 3 root root 4096 Feb 7 03:50 statechart -rw-r--r-- 1 root root 5244 Jan 5 2012 static_assert.hpp -rw-r--r-- 1 root root 3391 Jan 5 2012 strong_typedef.hpp -rw-r--r-- 1 root root 287 Jan 5 2012 swap.hpp drwxr-xr-x 2 root root 4096 Feb 7 03:51 system drwxr-xr-x 7 root root 4096 Feb 7 03:51 test drwxr-xr-x 5 root root 4096 Feb 7 03:51 thread -rw-r--r-- 1 root root 839 Jan 5 2012 thread.hpp -rw-r--r-- 1 root root 2652 Jan 5 2012 throw_exception.hpp drwxr-xr-x 2 root root 4096 Feb 7 03:50 timer -rw-r--r-- 1 root root 2663 Jan 5 2012 timer.hpp -rw-r--r-- 1 root root 19728 Jan 5 2012 token_functions.hpp -rw-r--r-- 1 root root 3742 Jan 5 2012 token_iterator.hpp -rw-r--r-- 1 root root 2783 Jan 5 2012 tokenizer.hpp drwxr-xr-x 4 root root 4096 Feb 7 03:50 tr1 drwxr-xr-x 3 root root 4096 Feb 7 03:51 tuple -rw-r--r-- 1 root root 481 Jan 5 2012 type.hpp drwxr-xr-x 5 root root 4096 Feb 7 03:51 typeof drwxr-xr-x 4 root root 12288 Feb 7 03:51 type_traits -rw-r--r-- 1 root root 4264 Jan 5 2012 type_traits.hpp drwxr-xr-x 6 root root 4096 Feb 7 03:51 units drwxr-xr-x 3 root root 4096 Feb 7 03:50 unordered -rw-r--r-- 1 root root 550 Jan 5 2012 unordered_map.hpp -rw-r--r-- 1 root root 550 Jan 5 2012 unordered_set.hpp drwxr-xr-x 3 root root 4096 Feb 7 03:51 utility -rw-r--r-- 1 root root 739 Jan 5 2012 utility.hpp drwxr-xr-x 2 root root 4096 Feb 7 03:50 uuid drwxr-xr-x 3 root root 4096 Feb 7 03:50 variant -rw-r--r-- 1 root root 883 Jan 5 2012 variant.hpp -rw-r--r-- 1 root root 1124 Jan 5 2012 version.hpp -rw-r--r-- 1 root root 719 Jan 5 2012 visit_each.hpp drwxr-xr-x 5 root root 4096 Feb 7 03:50 wave -rw-r--r-- 1 root root 926 Jan 5 2012 wave.hpp -rw-r--r-- 1 root root 474 Jan 5 2012 weak_ptr.hpp drwxr-xr-x 4 root root 4096 Feb 7 03:50 xpressive Go Bears >pwd /usr/include/boost I may be terribly wrong, but I believe that I have already installed Boost C++ Libraries. When I followed your instructions to install it (again), I couldn't. Here is the transcript from the Terminal. Go Bears >sudo apt-get install libboost-system-dev [sudo] password for arvind: Reading package lists... Done Building dependency tree Reading state information... Done Some packages could not be installed. This may mean that you have requested an impossible situation or if you are using the unstable distribution that some required packages have not yet been created or been moved out of Incoming. The following information may help to resolve the situation: The following packages have unmet dependencies: libboost-system-dev : Depends: libboost-system1.46-dev but it is not going to be installed E: Unable to correct problems, you have held broken packages. Go Bears > Can you please kindly tell me where did I go wrong, and what is wrong? Can you also please kindly tell me how can I compile my C++ code that uses Boost C++ Libraries? Thank you very much, and have an awesome day! Regards On Thu, Feb 7, 2013 at 6:18 AM, Mateusz Loskot <mateusz(a)loskot.net> wrote: > On 7 February 2013 10:06, Giovanni <giovanni.ong(a)comsoc.org> wrote: >> Greetings, >> I cannot compile my Boost C++ code. > > Do you mean Boost C++ code, thus building Boost libraries, > or you mean your code that *uses* Boost libraries? Unclear. > >> Initially, it complains of “undefined reference”. When I try to >> resolve this by including the library, I get the "/usr/bin/ld: cannot >> find -lboost_system" error. > > So, looks like the former, you are trying to use the libraries. > >> From the Terminal: >> Go Bears >echo $LD_LIBRARY_PATH >> /usr/lib/libboost_system.so > > Where do you get this from? > > "LD_LIBRARY_PATH, which is a colon-separated list of directories" [1] > > [1] http://tldp.org/HOWTO/Program-Library-HOWTO/shared-libraries.html > >> Go Bears >make all >> g++ -L/usr/lib -lboost_system get_sys_info.cpp > > Have you installed it first? > > sudo apt-get install libboost-system-dev > > Best regards, > -- > Mateusz Loskot, http://mateusz.loskot.net

2 1

Problem linking to serialisation library on Mac OSX
by Tim Burgess 07 Feb '13

07 Feb '13

Hi, I built my boost on Mac OSX 10.8 as follows: ./bootstrap.sh -prefix=/users/tim/developer/libraries/boost_1_50_0/stage ./b2 -address-model=32_64 stdlib=libc++ This ran boost.build with the Darwin toolset, as expected, and generated no errors. Checking the stage/lib folder revealed a complete set of static and dynamic library files with appropriate date-time stamps. I specified the linker as libc++ as the project I'm working on using XCode 4.6 uses wxWidgets 2.9.4, which requires that the project be compiled using Apple's GCC instead of the default compiler (this, in turn, means that libc++ becomes the linker used by the project). However, when I try to build my XCode project, I get errors of the form: Undefined symbols for architecture x86_64: "boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_sta rt(char All of the errors refer to boost::archive or boost::serialisation. My project also uses the boost FileSystem, IOStream and System libraries, which don't generate any errors. I've found an awful lot of references to this issue on the web (particularly StackOverflow), but have yet to find an answer/solution. I'm pretty sure that I'm using the correct command-line options (I didn't specify architecture=combined, as Mac OSX SDK 10.8 no longer supports PPC), but I'm confused by the plethora of available build options, as I'm a novice on this platform. The project is a cross-platform effort and the same source code presented to my Windows VS2010 32/64-bit project builds and runs. Similarly, the same project built and ran under Mac OSX 10.6 with XCode 3.6 - I'd gladly revert to the older Mac O/S and XCode except for the fact that I'm a blind developer and the debugger provided in XCode 3.6 is not accessible to me using Apple's VoiceOver speech output utility (the debugger in XCode 4.6 holds out more hope for being usable). I'd greatly appreciate any tips and tricks for resolving this problem, so many thanks in advance. Best wishes. Tim Burgess Raised Bar Ltd. Tel: +44 (0)1827 719822 Web: http://www.raisedbar.net We can supply Roland and Avid products with specialist pre and post-sales support for visually-impaired users - just drop us a line for a quote. Don't forget to sign our on-line petition to lobby for improved access to music education and music technology at: http://www.raisedbar.net/petition.htm

1 0

Re: [Boost-users] enable_shared_from_this()
by John M. Dlugosz 07 Feb '13

07 Feb '13

On 2/5/2013 9:43 AM, boost-users-request-at-lists.boost.org |Boost/Allow to home| wrote: From: Dominique Devienne<ddevienne(a)gmail.com> > Thanks for any insight on this. Could very well be I'm missing > something obvious (my C++ expertise doesn't rise to Boost levels), but > so far I fail to see the drawbacks. My old smart pointers (dating back to the '90's) had full support for initializing a smart pointer from a raw pointer even if it was already known to the smart pointer system. It was one of six _essential_ features (I called it “lost and found”) and I agree there were no troubles with it. It is easy to do when the class is derived from a helper base (like enable_shared_from_this does) and furthermore it doesn't need the CRTP. I agree that an extension to the now-standard enable_self_from_this could be implemented that gives a self_from_this that may be called during the constructor or as the first way to obtain a shared_ptr, also provide for "lost and found" usage, and not behave differently for any usage that is well-formed using the standard class (that is, it would be a pure extension). When changing some existing code to use shared_ptr, I've wished something like that was available, and missed my old class in this respect. For new code, in general use a Create static member that wraps the call to the (private) constructor so you can't create anything other than a shared_ptr, and the stuff that needs the shared ptr during "construction" gets moved to the stage 2, in the body of Create. In particular, if the object registers itself with collaborators (via shared pointers) you really wanted that part _in_ the constructor. —John

2 1

How do you compile Boost C++ code in Ubuntu?
by Giovanni 07 Feb '13

07 Feb '13

Greetings, I cannot compile my Boost C++ code. Initially, it complains of “undefined reference”. When I try to resolve this by including the library, I get the "/usr/bin/ld: cannot find -lboost_system" error. From the Terminal: Go Bears >echo $LD_LIBRARY_PATH /usr/lib/libboost_system.so Go Bears >make all g++ -L/usr/lib -lboost_system get_sys_info.cpp /usr/bin/ld: cannot find -lboost_system collect2: ld returned 1 exit status make: *** [all] Error 1 Go Bears > Do you know what stupid mistakes did I make? >From my Makefile: all: g++ -L/usr/lib -lboost_system get_sys_info.cpp ./a.out Thank you so much, and have an awesome day!

2 1

Using property_tree as json reader/writer
by niXman 07 Feb '13

07 Feb '13

Hi, Tell me please, anybody trying to use property_tree as json reader/writer for tasks more difficult than reading configuration files? Just wondering if anyone compared the performance of property_tree and other parsers? Thanks.

6 11

[BGL][Serialization] Reading a graph from a binary file: "vector subscript out of range error" and portability
by Nicholas Mario Wardhana 07 Feb '13

07 Feb '13

Hi all, I am trying to read a graph from a binary file. This file was previously generated by constructing a graph consisting of 1000 vertices and almost 10M edges. While vertices are properly loaded, I encountered a "vector subscript out of range error" when edges are being loaded in adj_list_serialize.hpp, line 97 (boost::tie(e,inserted) = add_edge(verts[u], verts[v], graph);). At this line, u and v are all in the order of millions, whereas I only have 1000 vertices. When I ran the program without debugging, it consumed the whole memory. I put a not-so-minimal working code at the end of my e-mail. Could somebody please point out any mistake in my code? FYI, I use Boost 1.52, Visual C++ 2010, Windows 7 64-bit. BTW, my aim is to generate save files which are fast to be read and can be read on different computers. I am aware that while this binary format can be processed fast, it is not portable. Can somebody please tell me how non-portable it is? If there are only a few things to be considered, for example architectural difference (32 vs 64-bit), it is fine as I only need to generate two files for one graph. But, if there are many of such factor, to the point that it is impossible to provide numerous save files, is there any equally fast format which is more portable? Thank you! Best regards, Nicholas Mario Wardhana //======================= CODE ===================================// #include <boost/graph/adjacency_list.hpp> #include <boost/graph/adj_list_serialize.hpp> #include <boost/archive/binary_oarchive.hpp> #include <boost/archive/binary_iarchive.hpp> #include <fstream> struct Point { Point() : x(0.0f), y(0.0f), z(0.0f) { } float x; float y; float z; }; struct Node { Point point; float maxRadius; int motionType; int label; int ID; }; struct Edge { float cost; short int type; bool kept; bool skip; int nodeID1; int nodeID2; }; namespace boost { namespace serialization { template<class Archive> void serialize(Archive & ar, Point & v, const unsigned int version) { ar & v.x; ar & v.y; ar & v.z; } template<class Archive> void serialize(Archive & ar, Node & n, const unsigned int version) { ar & n.point; ar & n.maxRadius; ar & n.motionType; ar & n.label; ar & n.ID; } template<class Archive> void serialize(Archive & ar, Edge & e, const unsigned int version) { ar & e.cost; ar & e.type; ar & e.kept; ar & e.skip; ar & e.nodeID1; ar & e.nodeID2; } } // namespace serialization } // namespace boost typedef boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, Node, // bundled data Edge, // bundled data boost::no_property, // not needed boost::listS> Graph; typedef boost::graph_traits<Graph>::vertex_iterator NodeIterator; typedef boost::graph_traits<Graph>::edge_iterator EdgeIterator; int main() { Graph g; for(int ID = 0; ID < 1000; ID++) { Node node; node.ID = ID; node.point.x = (float) ID; node.point.y = (float) ID; node.point.z = (float) ID; node.maxRadius = 1.0f; node.motionType = 0; node.label = 0; boost::add_vertex(node, g); } std::pair<NodeIterator, NodeIterator> vertexIterators = boost::vertices(g); NodeIterator nodeIterator1 = vertexIterators.first; for(; nodeIterator1 != vertexIterators.second; nodeIterator1++) { for(NodeIterator nodeIterator2 = nodeIterator1; nodeIterator2 != vertexIterators.second; nodeIterator2++) { if(*nodeIterator1 == *nodeIterator2) continue; Edge edge; edge.cost = 1.0f; edge.kept = true; edge.skip = false; edge.type = 0; edge.nodeID1 = g[*nodeIterator1].ID; edge.nodeID2 = g[*nodeIterator2].ID; boost::add_edge(*nodeIterator1, *nodeIterator2, edge, g); } } std::cout << "Number of nodes = " << boost::num_vertices(g) << std::endl; std::cout << "Number of edges = " << boost::num_edges(g) << std::endl; std::cout << "SAVE!" << std::endl; std::ofstream filename1("binary_serialization.txt"); boost::archive::binary_oarchive binary_oa(filename1); binary_oa & g; filename1.close(); std::cout << "LOAD!" << std::endl; Graph g3; std::ifstream filename2("binary_serialization.txt", std::ios::binary); try { boost::archive::binary_iarchive binary_ia(filename2); binary_ia & g3; // error here }catch (std::exception& e) { std::cout << e.what() << std::endl; } std::cout << "Number of nodes = " << boost::num_vertices(g3) << std::endl; std::cout << "Number of edges = " << boost::num_edges(g3) << std::endl; int a = 0; std::cin >> a; return 0; }

2 4