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

[boost][filesystem] re-assign a recursive_directory_iterator
by Sascha Ochsenknecht 14 Oct '09

14 Oct '09

Hi, should it be possible to re-assign a filesystem::recursive_directory_iterator? I tried something like the following (could strip out my code and build a small test case if needed but this would take some time): fs::path aPath = ...; // assign to some valid path const fs::recursive_directory_iterator initial(path); const fs::recursive_directory_iterator end(); fs::recursive_directory_iterator current(path); // now increment current and do something with it (traverse directories etc). // ... // Later I want to go back to initial position with: current = initial; // but this causes a crash later when traversing again, seems that the (current == end) check gives wrong results and I dereference invalid current // I tried also the following: current = fs::recursive_directory_iterator(path); // this doesn't crash but (current == end) seems to give also wrong results I don't want to create 'current' as a temporary, so constructing a new 'current' when needed. In my case it is a class member. Anyhow, I can implement a workaround for me. Is it a bug or is it not wanted to re-assign the iterator? If it is not wanted to re-assign, maybe the assignment operator should be disabled? Thanks in advance, Sascha

2 1

[log] Status & getting started?
by Allen Cronce 13 Oct '09

13 Oct '09

Hi all, Currently we're using the John Torjo boost log implementation. Nothing seems to be happening with that library, so I'm exploring moving to a different logging solution. The Andrey Semashev log candidate seems to have some steam behind it. It got reviewed in February, an "RC3" version was deposited in the vault in August, and it looks like there's recent activity in its svn repository. But it's hard to get a clear picture as to its status. Can someone (Andrey?) give me some idea as to where this library is in the acceptance process? Assuming that this library is moving forward, what's the best way to get started with it? One advantage of the Torjo library was that it was header only. Looks like the Semashev version requires building. I have some reluctant experience with building boost as a whole (because I seem to end up doing it once a year or so). But I have no experience with building individual pieces like this. We're still using boost 1.36. I can see a post from Boris Schaeling indicating that the log library from February seems to work with this version. That's good news. But we're moving to 1.40 shortly. Does it make sense to take the 1.40 sources, graft in the log candidate sources in the expected places, then turn a build of the whole shebang? If not, can someone provide pointers regarding building individual libraries? Thanks in advance for information regarding the logging library's status, and any suggestions getting started with it. Best, -- Allen Cronce

1 0

New library for RPC-calls using only boost and C++0x
by Siegfried Kettlitz 13 Oct '09

13 Oct '09

Hello boost users and developers, i'm currently writing a library for making remote procedure calls to C++ objects. The library is based on the variadic templates extension coming with C++0x (already present in GCC 4.3) in conjunction with the boost library (threads, serialization, asio). The aim is to have a library, that is easy to integrate and doesn't require additional tools. Writing it, so far, has thaught me a lot about C++, templates, variadic templates, threading, networking etc.. I post this message, because i think that this library is quite handy in situations, where a developer already uses boost libraries and wants to add some networking functionality to his/her project and the usage of variadic templates instead of additional tools is quite new. One example would be remote monitoring an application by adding a "std::string get_status()"-function to some object. Implemented as example is a chat-system with a server and clients interacting by remote calls. This example is tested with a x64-linux and win32 using the portable boost-text-serialization. Multiple clients can connect to the server via the TCP/IP-acceptor (and disconnect without crashing the system). Implemented is a console-client for text input and display and a morse client, that interacts via a digital output device (relais card), which is connected via a serial port. The serial port and the digital output driver are both also connected via the rpc-system and can be physically located on separate computers. At this point, i have the basic bits together and a working rpc-library, that needs to be cleaned, refined and extended to match the practical needs. This means, that some programs and libraries have to be written, which use the rpc-library and show its bugs and limitations. The downside of it is, that the interface of the rpc-library may change one more time until it can be considered stable. Therefore it would not be good to test it widely in libraries posing similar requirements, but to test it with a variety of possible applications and provide the implementations as examples and (regression-/unit-)tests. - One library for Measurement/Automation is already in development. - The chat-server/client exists. - A transaction based game server is under consideration. - Some distributed parallel computing application with dynamic joining/leaving of clients. Can you give me some more ideas of different applications, which are easy to implement but yet useful? What would you like to have implemented and accessible by an rpc-library? One speed measurement using local (shared memory) channels resulted in 20000 calls/s and 60000 messages/s on a 1.8GHz Opteron. Do you know how this compares to other implementations on similar hardware? The TCP/IP-channel implementation using ASIO resulted in only about 100 synchronous calls/second regardless of the payload and almost no CPU load, which suggests that ASIO somewhere "sleeps" on linux systems for a few milliseconds. This would be fixed in some future implementation. Using asynchronous calls (1000 open calls) again leads to about 10000 calls/s. I'll have a closer look on what can be merged with "channels" from the boost vault[1], but from the first look it seems that "channels" targets a much more general approach. After the first tries, i realized, that my implemention has to be very specific (e.g. templates only where necessary). So, the design approaches might be too different. After the refinement, cleanup, some testing and documenting, i'd like to publish the rpc-library (and libraries based on it) under GPL- or boost-license. Then you'll hear from me again. In future i'll probably work 2-8 hours per week on the library and use it in some projects, but there's plenty of work left to do in various regions. This will leave space for other developers who might want to use and modify it to fit their needs. Some of the harder parts that would need implementation are redundant parallel connections and advanced routing, authentication of nodes, signing of messages, encryption of payload, access restriction to objects. Please let me know if * you are interested in this library in some way * have comments * know very similar libraries or * are interested in serialization using variadic function templates. Regards, Siegfried Kettlitz --- A short introduction on the library: * "nodes" are the central parts. They contain a factory for objects, store objects and forward "messages" to objects or other nodes in the network and contain a "scheduler" for executing function calls. The nodes are connected by "channels", which forward messages between the two connected nodes. Currently there is a TCP/IPv4 implementation using ASIO and direct forwarding. * Nodes connected by channels form a network, create and monitor virtual connections between each other. The network map is used to route messages between connected nodes. * An object has to supply a template for a class name (only if it can be constructed by the factory) and a template for registering the callable functions (also for abstract base classes which can't be constructed). * A function call is executed asynchronously (wrapper for synchronous call exists). The call to node.call(...) returns a "link_caller"-object. The function to be executed itself can optionally have "link_callee" as the first argument (which is invisible for the caller). The "link_caller"/"link_callee" is used for synchronization (wait for call to begin/finish execution), message forwarding (push/pop strings at caller/callee) and transfer/extraction of the return value. * Objects of class hierarchies with abstract base classes are possible and handled transparently. * Objects can be constructed by the factory of a node or an existing (externally constructed) object can be registered by the node. * Objects don't necessarily need to know (be modified, inherit something etc.) that they are part of the RPC-system and some of their functions are called remotely. * Objects can be aware that they are constructed by the factory and can, on construction be informed about their identity and get a reference to the node to make remote calls themselves. * An object is identified by a "reference" consisting of the "node_id" and the "object_id". * Parameters are passed (serialized, deserialized) by value. All function parameters must have the possibility to be serialized. Modifying referenced parameters won't affect the parameter at the caller. Pointers obviously won't work between nodes not sharing the same memory-address-space. * Called functions can use "link_callee" to make remote calls themselves, regardless of the object. * Priorities are assigned to calls and affect message forwarding and scheduling. * Calls to objects can be transformed into a boost::function using node.bind(...). * If a called function throws, the exception is forwarded as rpc::exception or a more specialized exception class. The exception is thrown at the caller, when waiting for interaction with the callee (e.g. wait for return value). * Template functions as targets are possible when specifying the template parameters of the function pointer when registering the function. * There is no need to use macros at all, although macros could be used to simplify some things. ---------- // Example for creating and calling an object. // Create a service. boost::asio::io_service node_io_service; // Create a node. rpc::node node_s(node_io_service, config); // Register the builder in order to build the server object later. node_s.register_builder<devicelib::chat_server_impl>(); // Register the interface of the client to be able to make calls to it. node_s.register_interface<devicelib::chat_client>(); // Create the server object. rpc::reference cs( node_s.get_id(), node_s.allocate_object_template<devicelib::chat_server_impl>() ); // Store the server in name server. // rpc::reference( node_s.get_id(), rpc::oid_simple_object_name_server ) -> A reference to the object_name_server. // rpc::sched_default() -> Default scheduling parameters. // &rpc::simple_object_name_server::store, cs -> function to call. // cs, "chat_server_object" -> function parameters. node_s.wrap_call( rpc::reference( node_s.get_id(), rpc::oid_simple_object_name_server ), rpc::sched_default(), &rpc::simple_object_name_server::store, cs, "chat_server_object" ); ---------- // Example for abstract base class. namespace devicelib { class chat_server : public chat_types { public: virtual void receive( std::string xml_message ) = 0; virtual user_id_t connect_user( rpc::reference a_client, std::string xml_user_info ) = 0; virtual std::string query_user( user_id_t id ) = 0; virtual void disconnect_user( user_id_t user ) = 0; virtual void join_room( user_id_t user, room_id_t room ) = 0; virtual std::list<user_id_t> list_users( ) = 0; virtual std::list<room_id_t> list_rooms( ) = 0; }; } --------------- // Example for registering the interface of the server object. // The template is declared in namespace rpc, therefore we need to define it there. namespace rpc { // For the base object. template<> void register_proxy_functions<devicelib::chat_server>( function_call_proxy<devicelib::chat_server>& ar_proxy ) { // Register the functions of the abstract base object using unique strings. ar_proxy.register_interface( &devicelib::chat_server::connect_user, "&chat_server::connect_user" ); ar_proxy.register_interface( &devicelib::chat_server::query_user, "&chat_server::query_user" ); ar_proxy.register_interface( &devicelib::chat_server::disconnect_user, "&chat_server::disconnect_user" ); ar_proxy.register_interface( &devicelib::chat_server::join_room, "&chat_server::join_room" ); ar_proxy.register_interface( &devicelib::chat_server::list_users, "&chat_server::list_users" ); ar_proxy.register_interface( &devicelib::chat_server::list_rooms, "&chat_server::list_rooms" ); } // For each implementation. template<> void register_proxy_functions<devicelib::chat_server_impl>( function_call_proxy<devicelib::chat_server_impl>& ar_proxy ) { // Register the functions of the base object. register_proxy_functions<devicelib::chat_server>( (function_call_proxy<devicelib::chat_server>&) ar_proxy ); // Make the functions of this object available. ar_proxy.register_interface( &devicelib::chat_server_impl::connect_user, &devicelib::chat_server::connect_user ); ar_proxy.register_interface( &devicelib::chat_server_impl::disconnect_user, &devicelib::chat_server::disconnect_user ); ar_proxy.register_interface( &devicelib::chat_server_impl::join_room, &devicelib::chat_server::join_room ); ar_proxy.register_interface( &devicelib::chat_server_impl::list_users, &devicelib::chat_server::list_users ); ar_proxy.register_interface( &devicelib::chat_server_impl::list_rooms, &devicelib::chat_server::list_rooms ); } // The implementation can be built, the base object not. template<> std::string class_builder_name<devicelib::chat_server_impl>() { // Give it an unique name here. return "chat_server_impl"; } } ----------------- 1: http://www.boostpro.com/vault/index.php?&direction=0&order=&directory=Distr…

8 12

[iterators] advance and distance with custom random-access iterators
by Sebastian Weber 13 Oct '09

13 Oct '09

Hi! Is there any progress in the bug #2539 ?? It seems that the patch published there which is against a rather antiquated boost version is the only solution to the problem of iterator_adaptor/facade constructs which are random_access-tagged in order to make use of true random access operations in distance/advance operations. This is critical in performance relevant code... So is there any progress in incorporating some fixes in the public trunk? I understand that the problem is a misconception of the stl there, but an official solution would be great here... Sebastian

1 0

[BGL] saving all-pair shortest paths
by Shyamendra Solanki 13 Oct '09

13 Oct '09

Hi, I understand that both the floyd-warshall and johnson algorithms populate the DistanceMatrix for shortest distances between any pair of vertices. Could you give some hint how to get the actual shortest paths? Thanks, Shyam

2 5

Multi Index with BOOST_AUTO question.
by Surya Kiran Gullapalli 13 Oct '09

13 Oct '09

Hello all,I'm a newbie to multi-index. I ran into a strange problem with VS2008. When using BOOST_AUTO with multi-index I'm getting compilation errors (C2248) . Please see the following code. *<snip>* * * #include <iostream> #include <string> using namespace std ; #include <boost/multi_index_container.hpp> #include <boost/multi_index/mem_fun.hpp> #include <boost/multi_index/ordered_index.hpp> #include <boost/multi_index/identity.hpp> #include <boost/multi_index/member.hpp> #include <boost/foreach.hpp> #include <boost/typeof/typeof.hpp> using namespace boost ; using namespace boost::multi_index ; class Test { friend bool operator< (const Test& p_lhs, const Test& p_rhs) { return p_lhs._i < p_rhs._i ; } friend ostream& operator << (ostream& os, const Test& p_test) { os << "Integer: " << p_test._i << "\tString: " << p_test._s ; return os ; } private: int _i ; string _s ; public: Test (int i, string s): _i(i), _s(s) { } string getString (void) const { return _s ; } } ; struct byNumber { } ; struct byString { } ; int main (void) { typedef multi_index_container <Test, indexed_by < ordered_unique<tag<byNumber>, identity <Test> > , ordered_non_unique < tag<byString>, BOOST_MULTI_INDEX_CONST_MEM_FUN(Test, string, getString) > > > Container ; typedef Container::index<byNumber>::type TestByNumber ; typedef Container::index<byString>::type TestByString ; Container c ; c.insert (Test(5, "Surya")) ; c.insert (Test(15, "Kiran")) ; //TestByNumber& tests = c.get<byNumber>() ; BOOST_AUTO(tests, c.get<byNumber>()) ; BOOST_FOREACH (Test t, tests) cout << t << endl ; return 0 ; } *</snip>* * * Compilation for this case fails with C2248. If I replace the BOOST_AUTO with the previous line's statement, compilation goes well. This happens with VS2008 only. with VS2005, there's no issue with BOOST_AUTO. Am I missing something here? Thanks, Surya

2 6

C# LINQ is cool. What about boost.qlang?
by Germán Diago 13 Oct '09

13 Oct '09

Hello. I've been reading a bit about C#'s linq and it's very cool in my opinion. I would like to see something similar in c++, and boost is the ideal place I think. As I would like to see something similar, I started a prototype adapted to c++. For now I've been playing with the basics: -from, where and select operators. -it just can be used (for now) with from, where and select, all in a row, but this will change. -it should work with any range: containers, boost.range, etc. -it's just a c++0x version. It works great with lambdas (gcc svn has lambdas). -Can use any boost.fusion sequence as the object type to query. (Although the plan is to be able to give data providers to use to query any type of source. The prototype works in the following way. For example (C++0x) : vector<int> numbers = {1, 2, 3, 4, 8, 5, 9 , 24, 19, 15, 12 } auto query = from(numbers).where([](int i) { return i < 15 && i > 10}). select(fields::full_object); This will construct an object with the query (without evaluating it). The original Range CANNOT be modified. If you want to modify , copy the result to a new container (in the future call query.to_vector(), query.to_list() to return a list or vector of objects. This will evaluate everything: for (auto it = query.begin(); it != query.end(); ++it) cout << *it << endl; You can traverse the range as many times as you like, and If you have, for example: struct Doctor { string name_; string surname_; string specializedin_; }; BOOST_FUSION_ADAPT_STRUCT(Doctor...) you can do, for example: vector<Doctor> doctors = {....}; auto query = from(doctors).where([](const Doctor & d) { return d.surname_ == "Smith"; }). select(fields::_1); The plan to improve readability is to use fusion associative sequence to do: auto query = from(doctors).where([](const Doctor & d) { return d.surname_ == "Smith"; }). select(Doctorfields::name, Doctorfields::specializedin); The query will return a tuple<string, string> in this case (the one before this would return tuple<string>. Queries with multiple fields don't work for now. A first implementation with the ability to select the full object or a field number (not several, but planned) is attached. Test it if you want and tell me what you think. The plan would be the same as the .NET platform: to be able to query XML, text files, objects, databases... giving extension points to add data providers. Another thing that doesn't work right now is to nest a query inside another query, but I'll work on it. Feedback is welcome.

2 2

Re: [Boost-users] 1.40 and pch - gcc problems?
by Vial, Florent 13 Oct '09

13 Oct '09

Hi everyone, I downloaded and built bjam-3.17 under linux x86_64 (RHEL 4.6). I then built boost 1.40.0 using following command line: ../boost-jam-3.1.17/bin.linuxx86_64/bjam --build-dir=/tmp/build-boost-1_40_0 stage --build-type=complete --layout=tagged My user-config.jam has just been modified so that the toolset used is gcc4.2.3. I got following warnings in the math library: gcc.compile.c++ /tmp/build-boost-1_40_0/boost/bin.v2/libs/math/build/gcc-4.2.3/release/l ink-static/assoc_laguerrel.o libs/math/build/../src/tr1/assoc_laguerrel.cpp:6:21: warning: /tmp/build-boost-1_40_0/boost/bin.v2/libs/math/build/gcc-4.2.3/release/l ink-static/../src/tr1/pch.hpp.gch: created and used with different settings of -fpic gcc.compile.c++ /tmp/build-boost-1_40_0/boost/bin.v2/libs/math/build/gcc-4.2.3/release/l ink-static/assoc_legendrel.o libs/math/build/../src/tr1/assoc_legendrel.cpp:6:21: warning: /tmp/build-boost-1_40_0/boost/bin.v2/libs/math/build/gcc-4.2.3/release/l ink-static/../src/tr1/pch.hpp.gch: created and used with different settings of -fpic gcc.compile.c++ /tmp/build-boost-1_40_0/boost/bin.v2/libs/math/build/gcc-4.2.3/release/l ink-static/betal.o [snip lots of them] Then the serialization library reports following warnings: gcc.compile.c++ /tmp/build-boost-1_40_0/boost/bin.v2/libs/serialization/build/gcc-4.2.3/ release/link-static/xml_grammar.o In file included from ./boost/archive/impl/basic_xml_grammar.hpp:59, from libs/serialization/src/xml_grammar.cpp:16: ./boost/spirit/core/non_terminal/rule.hpp:18:4: warning: #warning "This header is deprecated. Please use: boost/spirit/include/classic_rule.hpp" In file included from libs/serialization/src/basic_xml_grammar.ipp:20, from libs/serialization/src/xml_grammar.cpp:63: ./boost/spirit/core/composite/operators.hpp:18:4: warning: #warning "This header is deprecated. Please use: boost/spirit/include/classic_operators.hpp" In file included from libs/serialization/src/basic_xml_grammar.ipp:21, from libs/serialization/src/xml_grammar.cpp:63: ./boost/spirit/core/composite/actions.hpp:18:4: warning: #warning "This header is deprecated. Please use: boost/spirit/include/classic_actions.hpp" In file included from libs/serialization/src/basic_xml_grammar.ipp:22, from libs/serialization/src/xml_grammar.cpp:63: ./boost/spirit/core/primitives/numerics.hpp:18:4: warning: #warning "This header is deprecated. Please use: boost/spirit/include/classic_numerics.hpp" gcc.compile.c++ /tmp/build-boost-1_40_0/boost/bin.v2/libs/serialization/build/gcc-4.2.3/ release/link-static/xml_iarchive.o In file included from ./boost/archive/impl/basic_xml_grammar.hpp:59, from ./boost/archive/impl/xml_iarchive_impl.ipp:41, from libs/serialization/src/xml_iarchive.cpp:32: ./boost/spirit/core/non_terminal/rule.hpp:18:4: warning: #warning "This header is deprecated. Please use: boost/spirit/include/classic_rule.hpp" However, the build seems to go through. Then i do following: ../boost-jam-3.1.17/bin.linuxx86_64/bjam --build-dir=/tmp/build-boost-1_40_0 --build-type=complete --layout=tagged stage I then get following messages for the math library: gcc.compile.c++ /tmp/build-boost-1_40_0/boost/bin.v2/libs/math/build/gcc-4.2.3/debug/lin k-static/runtime-link-static/assoc_laguerre.o libs/math/build/../src/tr1/assoc_laguerre.cpp:6:21: warning: /tmp/build-boost-1_40_0/boost/bin.v2/libs/math/build/gcc-4.2.3/debug/lin k-static/runtime-link-static/../src/tr1/pch.hpp.gch: not used because `_REENTRANT' not defined gcc.compile.c++ /tmp/build-boost-1_40_0/boost/bin.v2/libs/math/build/gcc-4.2.3/debug/lin k-static/runtime-link-static/assoc_legendre.o libs/math/build/../src/tr1/assoc_legendre.cpp:6:21: warning: /tmp/build-boost-1_40_0/boost/bin.v2/libs/math/build/gcc-4.2.3/debug/lin k-static/runtime-link-static/../src/tr1/pch.hpp.gch: not used because `_REENTRANT' not defined gcc.compile.c++ /tmp/build-boost-1_40_0/boost/bin.v2/libs/math/build/gcc-4.2.3/debug/lin k-static/runtime-link-static/beta.o libs/math/build/../src/tr1/beta.cpp:6:21: warning: /tmp/build-boost-1_40_0/boost/bin.v2/libs/math/build/gcc-4.2.3/debug/lin k-static/runtime-link-static/../src/tr1/pch.hpp.gch: not used because `_REENTRANT' not defined [snip lots of them] I then type as root: ../boost-jam-3.1.17/bin.linuxx86_64/bjam install --prefix=/usr/local/boost1400-gcc423 And get following installation: [snip] common.copy /usr/local/boost1400-gcc423/lib/libboost_iostreams.a common.copy /usr/local/boost1400-gcc423/lib/libboost_math_tr1.a common.copy /usr/local/boost1400-gcc423/lib/libboost_math_tr1f.a common.copy /usr/local/boost1400-gcc423/lib/libboost_math_tr1l.a ...on 7500th target... common.copy /usr/local/boost1400-gcc423/lib/libboost_math_c99.a common.copy /usr/local/boost1400-gcc423/lib/libboost_math_c99f.a common.copy /usr/local/boost1400-gcc423/lib/libboost_math_c99l.a common.copy /usr/local/boost1400-gcc423/lib/libboost_program_options.a common.copy /usr/local/boost1400-gcc423/lib/libboost_python.a common.copy /usr/local/boost1400-gcc423/lib/libboost_serialization.a common.copy /usr/local/boost1400-gcc423/lib/libboost_wserialization.a common.copy /usr/local/boost1400-gcc423/lib/libboost_signals.a common.copy /usr/local/boost1400-gcc423/lib/libboost_prg_exec_monitor.a common.copy /usr/local/boost1400-gcc423/lib/libboost_unit_test_framework.a common.copy /usr/local/boost1400-gcc423/lib/libboost_thread.a common.copy /usr/local/boost1400-gcc423/lib/libboost_wave.a ...updated 7511 targets... However, for each library, i only have 2 files installed + 1 symbolic link: -rw-r--r-- 1 root root 148826 Oct 13 17:22 libboost_date_time.a lrwxrwxrwx 1 root root 28 Oct 13 17:22 libboost_date_time.so -> libboost_date_time.so.1.40.0 -rwxr-xr-x 1 root root 74552 Oct 13 17:22 libboost_date_time.so.1.40.0 Any idea what i might have done wrong ? (compiling under Win32/MSVC90 was no problem at all surprisingly) Thanks in advance, Florent ---------- Forwarded message ---------- From: "John Maddock" <j...(a)johnmaddock.co.uk> Date: 4 sep, 10:25 Subject: 1.40 and pch - gcc problems? To: BOOST Archives >I just got1.40and tried building. I kept having some pieces fail > with a complete build, sometimes I had gcc that ran until resources > exausted, sometimes the compiler would segfault. Eventaully I tracked > it down to the math library. After noticing the many errors from the > gch (things like : error _REENTERANT not defined or used diffrent > -fpic). I disabledpchfor the math library (actually the boost > project and the libs/math/test) and I did not have any more issues. Can you be more specific about the error messages? A: bjam --with-math will build just the math lib, if you could post the complete output that would be most helpful. There's something strange going on here though as it builds just fine locally here (ubuntu Linux), and on our regression test machines (various Linux flavours). Thanks, John. JOIN US FOR THE JOURNEY. View Our New Digital Cameras: www.arridigital.com Arnold & Richter Cine Technik GmbH & Co. Betriebs KG Sitz: Munchen - Registergericht: Amtsgericht Munchen - Handelsregisternummer: HRA 57918 Personlich haftender Gesellschafter: Arnold & Richter Cine Technik GmbH Sitz: Munchen - Registergericht: Amtsgericht Munchen - Handelsregisternummer: HRB 54477 Geschaftsfuhrer: Franz Kraus; Dr. Martin Prillmann

1 0

[Property map] 1.40.0 breaks boost.graph python bindings
by John Reid 13 Oct '09

13 Oct '09

I'm using gcc 4.2.4 on Ubuntu. The boost.graph python bindings (http://www.osl.iu.edu/~dgregor/bgl-python/) work fine with boost 1.39. When I try with boost 1.40 I get many errors such as the following: ./boost/graph/python/resizable_property_map.hpp:101: error: ‘class boost::vector_property_map< boost::default_color_type, boost::graph::python::basic_index_map< boost::graph::python::basic_descriptor<boost::detail::edge_desc_impl<boost::bidirectional_tag, void *>, boost::bidirectionalS>, boost::adj_list_edge_property_map< boost::bidirectional_tag, long unsigned int, const long unsigned int &, void *, const boost::property<boost::edge_index_t, long unsigned int, boost::no_property>, boost ::edge_index_t>>>’ has no member named ‘get_store’ Does anyone know what changed between 1.39 and 1.40 to break this? The Readme.txt that comes with boost 1.40 suggests that nothing was updated in the property map library. BTW it doesn't compile with gcc 4.3 either but then neither does it compile with boost 1.39 (albeit for different reasons). I can provide all of the error messages if needed. John.

2 11

Re: [Boost-users] [Boost.MPL]is it possible to generate types
by Tan, Tom (Shanghai) 13 Oct '09

13 Oct '09

Thanks, it works like a charm. Tan, Tom (Shanghai) wrote: > I have a templated class > > template<class U, class V, class W> > class S > { > //... implementations > }; > > and some stock type implementations for type U, V and W: > > typedef boost::mpl::vector<U0, U1> u_types; > typedef boost::mpl::vector<V0, V1, V2, V3, V4> u_types; > typedef boost::mpl::vector<W0, W1, W2, W3, W4> w_types; > > I want to test class S with all possible combinations of the template > arguments, > > typedef boost::mpl::vector< > S<U0,V0,W0>, > S<U0,V0,W1>, > // ... > S<U1,V4,W4>, > > s_types; > > like this: > boost::mpl::for_each<s_types>(test_func). > > The only problem is there are 2*5*5 = 50 combinations that I do not > wish to type in one by one. > > Is there a way to generate all the combinations with boost::mpl or > Boost.Preprocessor? >> Look at BOOST_PP_SEQ_FOR_EACH_PRODUCT In Christ, Steven Watanabe ***************************************

1 0

Re: [Boost-users] Boost-users Digest, Vol 2134, Issue 4
by Tan, Tom (Shanghai) 13 Oct '09

13 Oct '09

Thanks, it works like a charm. Tan, Tom (Shanghai) wrote: > I have a templated class > > template<class U, class V, class W> > class S > { > //... implementations > }; > > and some stock type implementations for type U, V and W: > > typedef boost::mpl::vector<U0, U1> u_types; > typedef boost::mpl::vector<V0, V1, V2, V3, V4> u_types; > typedef boost::mpl::vector<W0, W1, W2, W3, W4> w_types; > > I want to test class S with all possible combinations of the template > arguments, > > typedef boost::mpl::vector< > S<U0,V0,W0>, > S<U0,V0,W1>, > // ... > S<U1,V4,W4>, > > s_types; > > like this: > boost::mpl::for_each<s_types>(test_func). > > The only problem is there are 2*5*5 = 50 combinations that I do not > wish to type in one by one. > > Is there a way to generate all the combinations with boost::mpl or > Boost.Preprocessor? >> Look at BOOST_PP_SEQ_FOR_EACH_PRODUCT In Christ, Steven Watanabe ***************************************

1 0

[boost C++] algorithm for shortest path
by Boost lzw 13 Oct '09

13 Oct '09

Hi there, For the following unidirectional (one-direct only) pairs: A-B; G-H; B-D; D-G; H-K; K-D; The shortest path between A and D is: A-B-D, but none between A and H. Which Boost library should I use to develop such an algorithm or any hint on design it ? Thanks in advance. Robert

2 1

Formal Review of Boost.Polygon extended one more week: until September 9, 2009
by Fernando Cacciola 13 Oct '09

13 Oct '09

Dear boost users, The review of Boost.Polygon was initially scheduled to end today. However, the discussions are in their best moment only now so the review period was extended by one week, until September 9, 2009 (that is next Wednesday). Best Fernando Cacciola Review Manager

9 12

[python] Alternative to explicitly defining function pointers?
by Boris Schaeling 13 Oct '09

13 Oct '09

Is it possible to simplify this code without defining a function pointer? ----- struct X { void y(std::string) { } std::string y() { return ""; } }; std::string (X::*get_y)() = &X::y; class_<X>("X").add_property("y", get_y); ----- I tried to set the signature but if the documentation is right signatures only make sense for function objects - so this code doesn't work: class_<X>("X").add_property("y", make_function(&X::y, default_call_policies(), mpl::vector<std::string>())); Anything else Boost.Python offers to make adding properties even easier? If there is nothing I know at least that I didn't miss a shortcut and have to define function pointers myself. Boris

2 1

[PREPROCESSOR] Working around the 256 element limit for sequences
by Rush Manbert 13 Oct '09

13 Oct '09

We define exception error codes and other useful information like this: #define EXCEPTION_TABLE \ ( (enumName0, "description string", "another sting", "yet another string") ) \ ( (enumName1, "description string", "another sting", "yet another string") ) \ . . . // End EXCEPTION_TABLE def Then we write a macro that creates an enum like this: #define ENUM_ERROR_CODES(EXCEPTION_TABLE_MACRO_NAME, firstErrorCodeValue)\ public: typedef enum \ { \ \ BOOST_PP_SEQ_FOR_EACH_I(MAKE_EXCEPTION_CODE_ENUM, ~, EXCEPTION_TABLE_MACRO_NAME) \ } ErrorCodesT; \ // End macro definition and we invoke ENUM_ERROR_CODES as: ENUM_EROR_CODEAS(EXCEPTION_TABLE, 1) This has worked just beautifully until recently. Now we're trying to use this code to define an enum (and other things) based on an EXCEPTION_TABLE that carries error code for a hardware device. There are about 500 of them. I ran into the 256 element limitation for sequences. I have tried rewriting the enum macro like this: #define ENUM_ERROR_CODES(EXCEPTION_TABLE_MACRO_NAME, firstErrorCodeValue)\ public: typedef enum \ { \ \ BOOST_PP_SEQ_FOR_EACH_I(MAKE_EXCEPTION_CODE_ENUM, ~, BOOST_PP_SEQ_SUBSEQ(EXCEPTION_TABLE_MACRO_NAME, 0, 250))\ BOOST_PP_SEQ_FOR_EACH_I(MAKE_EXCEPTION_CODE_ENUM, ~, BOOST_PP_SEQ_SUBSEQ(EXCEPTION_TABLE_MACRO_NAME, 250, 250))\ BOOST_PP_SEQ_FOR_EACH_I(MAKE_EXCEPTION_CODE_ENUM, ~, BOOST_PP_SEQ_SUBSEQ(EXCEPTION_TABLE_MACRO_NAME, 500, 250))\ BOOST_PP_SEQ_FOR_EACH_I(MAKE_EXCEPTION_CODE_ENUM, ~, BOOST_PP_SEQ_SUBSEQ(EXCEPTION_TABLE_MACRO_NAME, 750, 250))\ } ErrorCodesT; \ // End macro definition thinking that I could just peel off groups of 250, but that doesn't work. I can peel off the first N, where N is <= the size of the sequence, but I certainly can't do what I wrote. Each of our exception classes is defined this way, and the number of elements in each EXCEPTION_TABLE is different for each. Is there some standard method for working around this problem? Thanks, Rush

1 0

exception error_info list?
by denis 12 Oct '09

12 Oct '09

Hi, what do you think about exposing the error_info-map of boost::exception? I would like to get all attached error infos from one exception. Then, everyone could implement his own version of diagnostic_information() without relying on boost internals. Beside that, I had another idea: When translating an exception it would be possible to copy all error_infos from the originating exception to the new one. How do you handle this loss of information at the time? thanks.

3 6

Numpy ndarray as argument or return value using boost python
by Pim Schellart 12 Oct '09

12 Oct '09

Hi Everyone, I tried to find a good example for this but after spending two days on google and one day getting pyublas to compile I decided to call for help. I want to give a numpy ndarray as an argument to a c++ method, calculate something and return the output as an ndarray to Python. I would prefer not to use another library (such as PyUblas) for this so I do not have to add another dependency to my program. Since the latest information on boost python is quite outdated (uses numeric) I would like to know the following. 1. Is boost python still maintained or should I switch to another tool. 2. Is numpy supported, and if so, 3. can someone give me a basic example of how to use it. Kind regards, Pim Schellart

2 1

[BGL] read_graphviz and Bundle Properties
by Giuseppe Di Guglielmo 12 Oct '09

12 Oct '09

Dear all, here http://www.boost.org/doc/libs/1_40_0/libs/graph/doc/read_graphviz.html is reported how to use the read_graphviz function with old style "property list". How can I use the read_graphviz() function with bundle properties? This is my graph-type definition --- struct VertexId_t { std::size_t id; }; struct EdgeId_t { std::size_t id; }; typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, VertexId_t, EdgeId_t> Graph_t; --- And this is the DOT file: --- G { 0 [id="v0"]; 1 [id="v1"]; 0->0 [id="e0"]; 0->0 [id="e1"]; 0->1 [id="e2"]; } --- Cheers, G.

1 0

[Proto] proto::function and constness
by Kim Kuen Tang 12 Oct '09

12 Oct '09

Hi all, let _o_ be any proto terminal and v a vector. I would like to extract the vector v from the expression _o_(v) to do some modification on this vector. For this purpose i defined a grammar Rhs to extract the most right hand side of the tree. But unfortunately the compiler is asking me for constness for this code: boost::result_of<Rhs(Expr)>::type & result = Rhs()(expr); Whereas the expression _o_ + v compiles fine without asking me for constness. Am I missing something? Best regards, Kim Here is the code to demonstrate the problem. # include <vector> # include <iostream> # include <algorithm> # include <boost/proto/proto.hpp> namespace proto = boost::proto; namespace mpl = boost::mpl; using proto::_; template<typename Expr> struct MixedExpr; struct MixedDomain : proto::domain<proto::generator<MixedExpr> > {}; template<typename Expr> struct MixedExpr : proto::extends<Expr, MixedExpr<Expr>, MixedDomain> { explicit MixedExpr(Expr const &expr) : proto::extends<Expr, MixedExpr<Expr>, MixedDomain>(expr) {} }; struct oo { friend std::ostream &operator<<(std::ostream &s, oo const&) { return s << "oo"; } }; proto::terminal<oo>::type const _o_ = {{}}; template<typename T> struct IsMixed : mpl::false_ {}; template<typename T, typename A> struct IsMixed<std::vector<T, A> > : mpl::true_ {}; namespace MixedOps { BOOST_PROTO_DEFINE_OPERATORS(IsMixed,MixedDomain) }; namespace boost { namespace proto { template<typename T, typename A> std::ostream &operator<<(std::ostream &s, std::vector<T, A> const& ) { return s << "std::vector"; } }} struct Rhs : proto::or_< proto::when<proto::terminal<_>, proto::_value > ,proto::when<_, Rhs(proto::_child1)> > {}; template<typename Expr> void o_o(Expr& expr) { proto::display_expr(expr); boost::result_of<Rhs(Expr)>::type & result = Rhs()(expr); std::fill(result.begin(), result.end(),2); }; int main() { using namespace MixedOps; std::vector<int> u(10),v(10); //o_o( _o_(v) ); //uncomment this won't compile o_o( u+v ); std::copy(v.begin(),v.end(),std::ostream_iterator<int>(std::cout,",") ); std::cout<<std::endl; return 1; }

2 2

graphlib changes in 1.40
by Ralph Gauges 12 Oct '09

12 Oct '09

Hi, I use the graph library in some of my programs and I recently moved to boost 1.40 because older version did not work on snow leopard. I noticed that although the changelog does not mention any changes in the graph library, some of the layout algorithms have changes (e.g. random layout and fruchterman reingold) in the way they are called. They seem to use some new topology concept, unfortunately the documentation for those algorithms have not been updated. I was wondering if there is any updated documentation especially on the fruchterman reingold algorithm. I tried to guess what the new parameters mean, but so far I have not been able to get the same results as with the graph library from 1.39. No matter how I set the values so far, all my nodes end up essentially in the same place, although they are all disconnected and I would expect them to be spread out. Thanks a lot Ralph

2 6

boost-users@lists.boost.org
by hamidouche 12 Oct '09

12 Oct '09

hello I wanna build boost1_40 on a linux 64 machine (this is the my machine configuration) 2.6.28-11-generic #42-Ubuntu SMP Fri Apr 17 01:58:03 UTC 2009 x86_64 GNU/Linux compiler Intel 11.0 when I run ./bjam --toolset=intel I have this error message "icpc" -c -xc++ -O3 -w1 -inline-level=2 -pthread -fPIC -DBOOST_ALL_NO_LIB=1 -DBOOST_SERIALIZATION_DYN_LINK=1 -DNDEBUG -I"." -c -o "bin.v2/libs/serialization/build/intel-linux/release/threading-multi/basic_text_iprimitive.o" "libs/serialization/src/basic_text_iprimitive.cpp" ...failed intel-linux.compile.c++ bin.v2/libs/serialization/build/intel-linux/release/threading-multi/basic_text_iprimitive.o... intel-linux.compile.c++ bin.v2/libs/serialization/build/intel-linux/release/threading-multi/basic_text_oprimitive.o (0): internal error: backend signals compilation aborted for libs/serialization/src/basic_text_oprimitive.cpp (code 4) "icpc" -c -xc++ -O3 -w1 -inline-level=2 -pthread -fPIC -DBOOST_ALL_NO_LIB=1 -DBOOST_SERIALIZATION_DYN_LINK=1 -DNDEBUG -I"." -c -o "bin.v2/libs/serialization/build/intel-linux/release/threading-multi/basic_text_oprimitive.o" "libs/serialization/src/basic_text_oprimitive.cpp" ...failed intel-linux.compile.c++ bin.v2/libs/serialization/build/intel-linux/release/threading-multi/basic_text_oprimitive.o... intel-linux.compile.c++ bin.v2/libs/serialization/build/intel-linux/release/threading-multi/binary_iarchive.o (0): internal error: backend signals Please what wrong with this installing ? what should I change ?? Thanks

4 4

Using fftw_complex with Boost.MultiArray?
by Rhys Ulerich 12 Oct '09

12 Oct '09

Has anyone successfully used FFTW's fftw_complex typedef[1] with Boost.MultiArray? Under the covers it is an array of length two, which seems to interact poorly with MultiArray's type assumptions. The attached test.cc fails to compile on g++ 4.3 and icpc 10.1. - Rhys [1] http://www.fftw.org/doc/Complex-numbers.html

1 0

[xpressive] Shouldn't external placeholder variables allow consts?
by Ami Ganguli 12 Oct '09

12 Oct '09

I came across an interesting problem: what.let(_placeholder = this); fails to compile, because 'this' is a const pointer. A simple workaround: MyClass *_this = this; what.let(_placeholder = _this); But surely this shouldn't be necessary? Couldn't the right hand side of the let be declared const? Regards, Ami.

2 2

[MPL] bitnot function??
by Sebastian Weber 12 Oct '09

12 Oct '09

Hi! I was wondering how come there is no bitwise not (~) operation in the mpl? Is there an equivalent statement? Thanks, Sebastian

1 0

[asio] crash on io_service object destruction.
by Alexander Gutenev 12 Oct '09

12 Oct '09

Hi This is probably bug in my app, but I need an idea how to track it down. Seen on MSVC8, XP Occurs after io_service, which is processing many timers, sockets and posts in one thread is stopped from another thread. It is stopped fine, however it crashes on service object destruction at this line: // Delete the timer. void destroy() { destroy_func_(this); //// } destroy_func_ is often 0xfeeefeee, but sometimes it is 0x0 or any other value. Call stack is: boost::asio::detail::timer_queue<boost::asio::time_traits<boost::posix_time::ptime> >::timer_base::destroy() Line 211 + 0xe bytes C++ boost::asio::detail::timer_queue<boost::asio::time_traits<boost::posix_time::ptime> >::destroy_timer_list(boost::asio::detail::timer_queue<boost::asio::time_traits<boost::posix_time::ptime> >::timer_base * & t=0x01acd090) Line 415 C++ boost::asio::detail::timer_queue<boost::asio::time_traits<boost::posix_time::ptime> >::destroy_timers() Line 189 C++ boost::asio::detail::win_iocp_io_service::shutdown_service() Line 148 + 0x2c bytes C++ boost::asio::detail::service_registry::~service_registry() Line 75 + 0xf bytes C++ boost::asio::detail::service_registry::`scalar deleting destructor'() + 0x2b bytes C++ boost::asio::io_service::~io_service() Line 52 + 0x2e bytes C++ Any ideas ?

2 1

How to delete the shared memory
by manish4gupta 12 Oct '09

12 Oct '09

Hi, I am working on shared memory and trying to delete the shared memory using ipcrm -m shmid command but it is not able to delete the shared memory. Even if I reboot my system, it does seem to be deleting the shared memory. I can not use sharedmemory:: remove function since i am not aware of shared memory region name now. Please help me. Thanks in advance. -- View this message in context: http://www.nabble.com/How-to-delete-the-shared-memory-tp25849509p25849509.h… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

[units] newbie : plane_angle
by Damien R 11 Oct '09

11 Oct '09

Hi, I just discover boost::units and I want to know how it works in this case : quantity<si::plane_angle> angle(45 * degree); When the constructor is called, is the argument converted in radian or not ? Moreover, it is possible to have : quantity<??::plane_angle> angle(45 * degree); angle += pi / 4 * radian; cout << angle << endl; cout << quantity<degree::plane_angle>(angle) << endl; cout << quantity<radian::plane_angle>(angle) << endl; cout << angle.value<degree>() << endl; cout << angle.value<radian>() << endl; output : 45 deg + pi / 4 rad 90 deg pi / 2 rad 90 1.57079632679 Thanks. -- Damien R

2 1

[shared_ptr] Using a custom delete function that is a class member function
by Ryan McConnehey 11 Oct '09

11 Oct '09

I have a class that provides a shared_ptr number. At the end of the number's life cycle it should be placed back on a list of available numbers. The shared_ptr's custom deleter function looks like what I need. I'm able to get a free function to compile as the deleter just fine. In trying to use a class member function as the custom deleter I've run into compile errors. I'm not sure where I'm going wrong. I know the custom deleter need to be copy constructible and I'm probably breaking some assumed requirement. Any help on what I'm doing wrong would be appreciated. Ryan class CTNGenerator { public: CTNGenerator(void) { m_AvailableCTNs.resize(20); unsigned short startValue = 15; for (ctns::iterator itor = m_AvailableCTNs.begin(); itor != m_AvailableCTNs.end(); ++itor) { //This compiles fine. boost::bind(boost::mem_fun(&CTNGenerator::makeCTNAvailable), this); //Placing the call as the custom delete function doesn't compile. *itor = bus(new unsigned short(startValue++), boost::bind(boost::mem_fun(&CTNGenerator::makeCTNAvailable, this))); } } private: void CTNGenerator::makeCTNAvailable(unsigned short * ctn) { m_AvailableCTNs.push_back(boost::shared_ptr<unsigned short>(ctn)); } private: typedef boost::shared_ptr<unsigned short> bus; typedef std::list<bus> ctns; ctns m_AvailableCTNs; };

5 6

Not able to use multiple cores with boost::asio::ssl
by Ramashish Baranwal 11 Oct '09

11 Oct '09

Hi, I have an application where I am planning to use boost::asio's ssl streams. There are two parts of the app, the initial connection establishment and ssl handshake is done by boost::asio::ssl and the connection is then transferred to the core application which does the the rest. I have written a prototype using multiple threads and io_services similar to io_service_pool example. I am using a dual quad core machine, however I am not able to get the cpu usage beyond one core (i.e. it never exceeds 12-14% in the top) no matter how much the load. On doing some profiling I found that the time taken from socket accept to ssl handshake completion deteriorates linearly with the number of connections without using the other cores. I am not using any explicit locks so expected the application to scale well with the number of cores available. Is is not possible to use multiple cores with boost::asio::ssl libraries or am I not doing it right? A pseudo-code of the app- start connection acceptors handle_accept() { new_conn = new Connection(io_service_pool.get_io_service()); new_conn->start(); } Connection::start() { ssl_socket_.async_handshake(handle_handshake); } Connection::handle_handshake(error) { if (!error) // transfer connection to the application core } Thanks in advance, Ramashish

2 2

[mpl] Syntax error with BOOST_MPL_ASSERT
by Jean-Louis Leroy 11 Oct '09

11 Oct '09

What's wrong with this ? template<class Expected, class T> void check_placeholders(const T&) { BOOST_MPL_ASSERT((is_same<typename T::placeholders, Expected>)); // * } struct Test { typedef int placeholders; }; void f() { check_placeholders<int>(Test()); } msvc9 complains about : error C2059: syntax error : ')' at the line marked with a star. I have put much more complex things inside BOOST_MPL_ASSERT though :-/ I use Boost 1.40. J-L

2 1

[fusion] C arrays in fusion::vector
by Jean-Louis Leroy 11 Oct '09

11 Oct '09

msvc9+fusion 1.40 reject this: fusion::vector<int, char[20]> v; 1>C:\Users\JLL\Documents\Visual Studio 2008\Projects\boost_1_40_0\boost/fusion/container/vector/detail/vector_n.hpp(43) : error C2440: '<function-style-cast>' : cannot convert from 'int' to 'char [20]' 1> There are no conversions to array types, although there are conversions to references or pointers to arrays 1> C:\Users\JLL\Documents\Visual Studio 2008\Projects\boost_1_40_0\boost/fusion/container/vector/detail/vector_n.hpp(42) : while compiling class template member function 'boost::fusion::vector_data2<Derived,T0,T1>::vector_data2(void)' 1> with 1> [ 1> Derived=boost::fusion::vector2<int,char [20]>, 1> T0=int, 1> T1=char [20] 1> ] Am I doing something wrong ? Anyway I can wrap the C array in a class (template)... Thanks, J-L

3 2

[python] Function objects in place of member functions
by Ravi 10 Oct '09

10 Oct '09

Hello, If a free function 'func' has X* as its first argument, then, boost.python allows it to be bound to a member function on the python side, i.e., the following is legal: void func( X* x, arg1_t arg ) { ... } class_<X>( "X" ).def( "func", &func ); In order to use a function object in place of a free function, one must specialize/overload boost::python::detail::get_signature which, for some reason, does not account for function objects. Here's a very simple example that works: ---------------------------------------------- #include <boost/mpl/vector.hpp> struct X { int y; }; // Function object struct Z { int operator()( X *x, int z ) { return z + x->y; } }; namespace boost { namespace python { namespace detail { mpl::vector<int, X*, int> get_signature( Z&, X* ) {return mpl::vector<int, X*, int>();} }}} #include <boost/python/class.hpp> #include <boost/python/module.hpp> BOOST_PYTHON_MODULE( mft ) { boost::python::class_<X>( "X" ) .def( "z", Z() ).def_readwrite( "y", &X::y ); } ------------------------------------------------- However, note that the overload of get_signature precedes the inclusion of the boost.python headers, which is extremely inconvenient. However, if the headers are moved to their proper location as in the following, ---------------------------------------------- #include <boost/mpl/vector.hpp> #include <boost/python/class.hpp> #include <boost/python/module.hpp> struct X { int y; }; // Function object struct Z { int operator()( X *x, int z ) { return z + x->y; } }; namespace boost { namespace python { namespace detail { boost::mpl::vector<int, X*, int> get_signature( Z&, X* ) {return boost::mpl::vector<int, X*, int>();} }}} BOOST_PYTHON_MODULE( mft ) { boost::python::class_<X>( "X" ) .def( "z", Z() ).def_readwrite( "y", &X::y ); } ------------------------------------------------- the compilation fails with the following error message (gcc 4.4.1 with boost 1.37 or 1.39): $ g++ -Wall -shared -o mft.so memft.cc -lboost_python-mt - I/usr/include/python2.6 -fPIC In file included from memft.cc:1: /usr/include/boost/python/class.hpp: In member function ‘void boost::python::class_<T, X1, X2, X3>::def_impl(T*, const char*, Fn, const Helper&, ...) [with T = X, Fn = Z, Helper = boost::python::detail::def_helper<const char*, boost::python::detail::not_specified, boost::python::detail::not_specified, boost::python::detail::not_specified>, W = X, X1 = boost::python::detail::not_specified, X2 = boost::python::detail::not_specified, X3 = boost::python::detail::not_specified]’: /usr/include/boost/python/class.hpp:235: instantiated from ‘boost::python::class_<T, X1, X2, X3>& boost::python::class_<T, X1, X2, X3>::def(const char*, F) [with F = Z, W = X, X1 = boost::python::detail::not_specified, X2 = boost::python::detail::not_specified, X3 = boost::python::detail::not_specified]’ memft.cc:16: instantiated from here /usr/include/boost/python/class.hpp:536: error: no matching function for call to ‘get_signature(Z&, X*)’ Why is the overloaded get_signature not picked up when it is declared *after* the inclusion of the headers? The reason for using function objects is to change the argument types of a member function of X as seen by python; for example, the functor would have an argument type 'double' and would then internally convert the received 'double' argument from the python side into some custom type prior to passing it to the member function of X. In other words, the functor would act as a C++ equivalent of a python decorator. Regards, Ravi

1 0

asio tutorial question on
by Gavin Rogers 09 Oct '09

09 Oct '09

I am going through the tutorial on asio at http://www.boost.org/doc/libs/1_37_0/doc/html/boost_asio/tutorial/tutdaytim… and so far so good. I have a question, the end iterator doesn't seem to be assigned a value, in the examples. I was wondering how does it work.. e.g. tcp::resolver::iterator endpoint_iterator = resolver.resolve(query); tcp::resolver::iterator end; tcp::socket socket(io_service); boost::system::error_code error = boost::asio::error::host_not_found; while (error && endpoint_iterator != end) // <<< Question:here { socket.close(); socket.connect(*endpoint_iterator++, error); } thanks.

2 1

error: expected unqualified id before '=' token
by John Robertson 09 Oct '09

09 Oct '09

The following compiles OK typedef string Colour; struct edge_properties { vector < set< Colour > > eColours; } until I get to template < typename Graph > void populate_arrow_maps(const Graph & g) { typename graph_traits<Graph>::edge_iterator edge_iter, edges_end; typedef vector <set< string > > VCS; typedef vector <set< string > >::iterator vcs_iter, vcs_end; for (tie(edge_iter, edges_end) = edges(g); edge_iter != edges_end; ++edge_iter) { VCS & vcolour_set = get(m_eColours_map, *edge_iter); for(vcs_iter = vcolour_set.begin(); vcs_iter != vcolour_set.end(); ++vcs_iter) { ; } } } Then compiler says error: expected unqualified id before '=' token Referring to the line which is underlined above. So its referring to vcs_iter. Whats wrong? Thanks

2 2

[asio] "bad_descriptor" on async_send_to + socket.close
by Tacheon the Nucleid 09 Oct '09

09 Oct '09

[asio] "bad_descriptor" error on async_send_to + socket.close Hi, I am trying to close a UDP socket on which an async_send_to operation is running. The handler is like this: void Sender::handleSend(error_code const & e, size_t bt) { this_thread::sleep(posix_time::seconds(1)); socket.async_send_to(buffer, remoteEndpoint, bind(&Sender::handleSend, this, placeholders::error, placeholders::bytes_transferred)); } The sender itself is fine. But on some special occasions I have to close the socket. I do it like this: void Sender::do_close() { socket.close(); } void close() { socket.get_io_service().post( bind(&Sender::do_close, this)); } When close() is called, the async handler yields a "bad_descriptor" error. I would expect an "operation_aborted" error as stated in the documentation. For async_receive, everything is fine and works as expected. What am i getting wrong? Greetings, B. Haeberlein -- GRATIS für alle GMX-Mitglieder: Die maxdome Movie-FLAT! Jetzt freischalten unter http://portal.gmx.net/de/go/maxdome01

1 0

[BGL] reset of the random number generator in the sorted_erdos_renyi_iterator
by Marti Cuquet 09 Oct '09

09 Oct '09

Hi, I noticed that when generating several graphs with the sorted_erdos_renyi_iterator with the same random generator all of them happen to be the same. Looking at erdos_renyi_generator.hpp I see that there is a reset in the generator. This does not happens in the normal (unsorted) erdos_renyi_iterator since the generator is passed by reference in the constructor. I'm still not confortable with the BGL and the random libraries, but I might say that it is better to pass the random generator by reference. Is there a special reason for not doing so? Thank you, Martí

2 2

[BGL] Modern benchmarks available?
by Nathan Cooprider 08 Oct '09

08 Oct '09

I'm evaluating the Boost Graph Library for a project would like to present my manager with some benchmark numbers. The only ones I have been able to find are from the GGCL OOPSLA paper, and those are pretty out of date. Does anybody know of any modern work at benchmarking BGL performance? I am looking at adjacency lists with sets in particular, but anything is better than nothing. I realize that I may just have to give big-O estimates in the end (because it is all dependent on the graph structure), but any estimates would help me for my initial evaluation. I have generally steered clear of Parallel BGL because it does not seem as mature as BGL. Is this a false assumption? Should I look further into PBGL? Thank you very much. Nathan

3 2

[serialization?] converting utf8 string to unicode wstring
by Igor R 08 Oct '09

08 Oct '09

Hello, I try to accomplish the subj with help of boost's utf8_codecvt_facet. I based my code on this example: http://www.boost.org/doc/libs/1_40_0/libs/serialization/doc/codecvt.html . The only difference is that my utf8 text resides in std::string: #include <sstream> #include <iostream> #include "boost/archive/detail/utf8_codecvt_facet.hpp" // link with boost/libs/serialization/src/utf8_codecvt_facet.cpp int main() { std::string utf; utf.resize(11); // hardcode some utf8 text utf[0] = 0xd7; utf[1] = 0x90; utf[2] = 0xd7; utf[3] = 0x99; utf[4] = 0xd7; utf[5] = 0x92; utf[6] = 0xd7; utf[7] = 0x95; utf[8] = 0xd7; utf[9] = 0xa8; utf[10] = 0x0; std::locale old_locale; std::locale utf8_locale(old_locale, new boost::archive::detail::utf8_codecvt_facet()); std::locale::global(utf8_locale); std::stringstream in; in.imbue(utf8_locale); in.str(utf); std::wstringstream out; out << in; std::wcout << out.str() << std::endl; } The above code doesn't work: "out" buffer doesn't contain correct unicode interpretation of the string. Actually, all i want is a c++ equivalent to the following WinAPI: #include "windows.h" int main() { std::string utf; utf.resize(11); // hardcode some utf8 text utf[0] = 0xd7; utf[1] = 0x90; utf[2] = 0xd7; utf[3] = 0x99; utf[4] = 0xd7; utf[5] = 0x92; utf[6] = 0xd7; utf[7] = 0x95; utf[8] = 0xd7; utf[9] = 0xa8; utf[10] = 0x0; wchar_t outBuff[11]; MultiByteToWideChar(CP_UTF8, 0, utf.c_str(), -1, outBuff, 10); } ...which works well. Any idea would be greatly appreciated! Thanks.

3 3

newbie: help to start with object_pool
by Jenia 08 Oct '09

08 Oct '09

Hi this is my first try with boost. I need an object pool, where I can preallocate X objects and reuse them with ability to allocate more if the pool runs empty and shrink my pool if needed. My questions: 1. Is object_pool suitable for this purpose? 2. Does object_pool.free() returns object memory to the pool or return pool's memory to the system? 3. How do I use object_pool.construct()? I didn't get the number of parameters requirement in the documentation (http://www.boost.org/doc/libs/1_40_0/libs/pool/doc/interfaces/object_pool.h…)

2 1

Re: [Boost-users] error C2733 second C linkage of overloaded function InterlockedIncrement not allowed
by Darth Vader 08 Oct '09

08 Oct '09

This is an old thread (1 year old) I'm answering to: This is about compiling some of the Boost library (1.39) on Windows CE 6.0. I got the following error: error C2733 second C linkage of overloaded function _InterlockedIncrement not allowed It turns out that "_InterlockedIncrement" is already defined in winbase.h so I commented out: extern "C" long __cdecl InterlockedIncrement( long* ); extern "C" long __cdecl InterlockedDecrement( long* ); extern "C" long __cdecl InterlockedCompareExchange( long*, long, long ); extern "C" long __cdecl InterlockedExchange( long*, long ); extern "C" long __cdecl InterlockedExchangeAdd( long*, long ); In interlocked.hpp and everything compiled fine.

1 0

[xpressive] Calling a placeholder method from within an action?
by Ami Ganguli 08 Oct '09

08 Oct '09

Hi all, I'm using an object as a placeholder, and would like to call various methods to the object from within my actions. Something along the lines of: port = (s1= *digit) [ _placeholder->setPort( as<int>(s1) ) ]; I've found a way to do something equivalent using method pointers, but the resulting code is really opaque. I'm afraid nobody else will ever be able to figure out what I've done. I also know I can do this by creating separate function objects for each method that will be called. This is less opaque, but really verbose. I end up with hundreds of lines of boilerplate code. Is there a "right" way to achieve something similar? Regards, Ami.

2 2

Stripped down "runtime" version of boost
by Paul Moore 08 Oct '09

08 Oct '09

At the moment, I'm using boost by simply unpacking the archive (I've only needed the header-only libraries thus far). But it's a fairly large archive, full of things that aren't actually needed to simply *use* the libraries. Is there a means of creating a subset of the boost distribution with *just* the headers (and libraries, ultimately) needed to compile programs using boost? I'm guessing that all I'd need is the boost subdirectory (with the headers) plus whatever parts of the lib directory are created as part of the boost.build process. Is that right? Are there any more explicit instructions anywhere? Thanks, Paul.

3 2

BGL -- adjacency_matrix, graph concepts
by Raymond Wan 08 Oct '09

08 Oct '09

Hi all, I have a basic question about BGL, but I'm a bit too new with templating to understand some of the terms used in the documentation... :-( I'd like to build a graph using an adjacency matrix and the edge_iterator_constructor of the graph (or anything faster than repeated add_edge's). In the docs, I found this for adjacency_list: template <class EdgeIterator> adjacency_list(EdgeIterator first, EdgeIterator last, vertices_size_type n, edges_size_type m = 0, const GraphProperty& p = GraphProperty()) but the closest I found for adjacency_matrix is: template <typename EdgeIterator> adjacency_matrix(EdgeIterator first, EdgeIterator last, vertices_size_type n, const GraphProperty& p = GraphProperty()) It's not the same because of "typename"? As a toy example, I've taken the MST example and have modified it a lot to get this: ----- #include <boost/config.hpp> #include <boost/graph/adjacency_matrix.hpp> #include <boost/graph/graph_utility.hpp> #include <iostream> int main () { using namespace boost; typedef adjacency_matrix < undirectedS, no_property, property < edge_weight_t, int > > Graph; typedef graph_traits < Graph >::edge_descriptor Edge; typedef graph_traits < Graph >::vertex_descriptor Vertex; typedef std::pair<int, int> E; const int num_nodes = 5; E edges[] = { E(0, 2), E(1, 3), E(1, 4), E(2, 1), E(2, 3), E(3, 4), E(4, 0) }; int weights[] = { 1, 1, 2, 7, 3, 1, 1 }; std::size_t num_edges = sizeof(edges) / sizeof(E); Graph g1 (num_nodes); for (unsigned int i = 0; i < num_edges; i++) { add_edge (edges[i].first, edges[i].second, g1); } print_graph (g1); Graph g2 (num_nodes); // Graph g2 (edges, edges + num_edges, weights, num_nodes); print_graph (g2); return EXIT_SUCCESS; } ----- The 5th line from the end is what is causing me problems. It seemed to work with an adjacency_list. (I'd also would like to add weights, but I guess add_edge could support that...I just think that this way is faster based on the "Quick Tour of the BGL" page in the docs.) I looked in my examples directory [1.39] and simply grepped for "adjacency_matrix" and came up with only one file: adjacency_matrix.cpp . Other than the pros/cons of adjacency matrices and lists, is there something wrong with adjacency matrices; any reason for its absence in the examples directory? One final question -- in the documentation, it lists various graph concepts (http://www.boost.org/doc/libs/1_40_0/libs/graph/doc/graph_concepts.html) such as BidirectionalGraph, VertexAndEdgeListGraph, AdjacencyMatrix, etc. Are these concepts relevant to BGL or only in a general sense? What I mean is what is their relationship with adjacency_list and adjacency_matrix? Any pointers would be appreciated... Thank you! Ray

3 11

[lambda][shared_ptr] Creating a shared_ptr with a custom delete function using a lambda expression
by Ryan McConnehey 08 Oct '09

08 Oct '09

I have a class that maintains a list of available numbers. The user will ask for a number and receive a shared_ptr with a value. Once the user is done with the number it will be put back on the list of available numbers. I'm trying to initialize the list with numbers and a custom delete function for the shared_ptr to be return to the list. Any help would be appropriated in how to get the lambda and custom delete function to work. Ryan class CTNGenerator { public: CTNGenerator(void) { m_AvailableCTNs.resize(20); unsigned short startValue = 15; typedef boost::shared_ptr<unsigned short> bus; //The lambda function isn't compiling with how it's currently written. std::for_each(m_AvailableCTNs.begin(), m_AvailableCTNs.end(), _1 = bus(new bus(var(startValue++)), &makeCTNAvailable)); } private: void CTNGenerator::makeCTNAvailable(unsigned short * ctn) { m_AvailableCTNs.push_back(boost::shared_ptr<unsigned short>(ctn)); } private: std::list< boost::shared_ptr<unsigned short> > m_AvailableCTNs; };

1 0

error in recreation of shared memory using boost:: interprocess
by manish4gupta 07 Oct '09

07 Oct '09

Hi, I am creating shared memory with given name(by given file name with key value ) and creating the map in the shared region by parsing key-value from the file. First time it is ok. but when i try to do it again, I am getting following error. terminate called after throwing an instance of 'boost::interprocess::interprocess_exception' what(): File exists Aborted What is the cause of this error. Thanks in advance. -- View this message in context: http://www.nabble.com/error-in-recreation-of-shared-memory-using-boost%3A%3… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

Setting QOS doesn't work?
by Dominique Lacerte 07 Oct '09

07 Oct '09

Hi, I have some QOS code in a product that is working fine. We're porting that code to using the socket support in ASIO and the QOS code doesn't seem to be working any longer. We're using WinXP under both environments and running our old code works fine but the new code has issues. Setting the TOS bits via: ::setsockopt(mSocket.native(), IPPROTO_IP, IP_TOS, (char *)(&uiTOS), sizeof(uiTOS)) Works fine, but setting the service type does not. We're making the following call: DWORD dwBytesReturned = 0; bool bSuccess = (SOCKET_ERROR != ::WSAIoctl( mSocket.native(), SIO_SET_QOS, (void *)reinterpret_cast<const BYTE *>(&tQOS), sizeof(tQOS), NULL, 0, &dwBytesReturned, NULL, NULL )); With values such as: SocketAddress bytes: 0200fc22c0a863670000000000000000 ===RX=== TokenRate: -1 TokenBucketSize: -1 PeakBandwidth: -1 Latency: -1 DelayVariation: -1 ServiceType: 6 MaxSduSize: -1 MinimumPolicedSize: -1 ===TX=== TokenRate: 4600 TokenBucketSize: -1 PeakBandwidth: -1 Latency: -1 DelayVariation: -1 ServiceType: 2 MaxSduSize: -1 MinimumPolicedSize: -1 And it returns success, but the DSCP bits in the packets are not being set. If we call SIO_GET_QOS afterwards we always get back the default: SocketAddress bytes: <NULL> ===RX=== TokenRate: -1 TokenBucketSize: -1 PeakBandwidth: -1 Latency: -1 DelayVariation: -1 ServiceType: 1 MaxSduSize: -1 MinimumPolicedSize: -1 ===TX=== TokenRate: -1 TokenBucketSize: -1 PeakBandwidth: -1 Latency: -1 DelayVariation: -1 ServiceType: 1 MaxSduSize: -1 MinimumPolicedSize: -1 Is there something different about the sockets implementation used by ASIO that prevents the WSAIoctl() call from working correctly? Dominique Lacerte Senior Software Engineer CounterPath Corporation T 250.380.0584 x1368 M 250.595.1362 [cid:image001.png@01CA472D.8E379C30]<http://www.counterpath.com/>

1 0

[BGL] premature termination in dijkstra using visitor
by Ralf Goertz 07 Oct '09

07 Oct '09

Hi, I have some very large undirected graphs (half a million vertices). Edges have weight 0 or 1. For each vertex I need to find all vertices * that are in sum 2 edges away * whose distance is 0 Both tasks can be done with breadth-first searches but I don't know in advance how many edges in depth I have to traverse. That's why I thought of Dijkstra's algorithm. But in my case this is overkill as I am not interested in the exact distance of a vertex from a given vertex but only in if it is not farther than 0 or 2 away. Is it possible to use a visitor to alter the colormap to mark vertices as final that are too far even thought they are not final yet? Ralf

5 12

[proto] Question on grammar and operator overloading
by Hal Finkel 06 Oct '09

06 Oct '09

Hello, I'm writing a complex number class using boost::proto by extending proto::terminal< boost::array<_, 2> >. I've attached a copy of my current code, which compiles, runs, and (at least with both g++ and icc on my machine) demonstrates a significant speed improvement compared to std::complex. However, there is (at least) one thing which don't work as it should: In the grammar I have to specify lazy_complex< double > instead of lazy_complex< _ >, otherwise the compiler cannot find proto's operator overloads, why? Note: This code will not compile under 1.37, but will compile under 1.40, because of some issue in 1.37 which manifests itself as a problem with the overloading of the '<<' operator. I've not tested the releases in between 1.37 and 1.40. General suggestions are also welcome. I'd like to get this cleaned up for general redistribution. Thank you in advance, Hal

3 7

Newbie: Boost Graph example request
by Brian Troutwine 06 Oct '09

06 Oct '09

Hello all. I'm new to using the Boost Graph library and am bewildered by its (seemingly essential) complexity. A solution to the simplistic problem I pose below would help provide a workable context around which to wrap my brain and would be most appreciated. -- Let G be the undirected graph given by the following adjacency list: 0 -> 2, 3 1 -> 2, 4 2 -> 3, 4 3 -> 1 4 -> 3 5 -> 0 6 -> 7 7 -> 8, 9 9 -> 10 Using, say, a breadth first search, for any two random nodes in the graph print the shortest path between them. For example, the shortest path between 5 and 3 is: 5 -> 0 -> 3 My apologies if a similar question has been asked before. A search through the mailing list archive did not return promising results. Also, I have, incidentally, ordered The Boost Graph Library text and am very much looking forward to its arrival. Thank you. Brian Troutwine

2 2

Shared memory volatility
by manish4gupta 06 Oct '09

06 Oct '09

Is shared memory created by Interprocess communication gets deleted when system is switched off? -- View this message in context: http://www.nabble.com/Shared-memory-volatility-tp25764705p25764705.html Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

[iterator_transform]'s reference
by er 06 Oct '09

06 Oct '09

Hi All, It appears that transform_iterator's reference is F::result_type, not result_of<F(Ref)> where Ref = iterator_reference<It>::type. Did I misinterpret the documentation?

1 0

dynamic objects (was Re: PBGL / Dynamic Property Maps complexity)
by Mathieu Malaterre 05 Oct '09

05 Oct '09

Nick, [reviving an old thread] On Sat, Sep 12, 2009 at 9:39 PM, Nick Edmonds <ngedmond(a)cs.indiana.edu> wrote: <...> > If your graphs aren't static... PBGL doesn't do well with dynamic graphs at > the moment, they'll *sort of* work... *sometimes* :) What do you mean by that ? What does not work ? I am currently trying to understand whether or not I can use dynamic objects stored in bundled properties, or will there be an issue in PBGL (when the object will be copied over to another machine) ? Sorry for evasive question but I could not find any example of BGL or PBGL that did not use POD struct for storing the properties. Thanks, -- Mathieu

2 1

compatibility of boost 1.39
by manish4gupta 05 Oct '09

05 Oct '09

Is boost library 1.39 compatible on ia64 machine(itanium) with compiler gcc 3.4.6 on a Redhat Enterprise Linux 4 Update 5? -- View this message in context: http://www.nabble.com/compatibility-of-boost-1.39-tp25696866p25696866.html Sent from the Boost - Users mailing list archive at Nabble.com.

2 12

Re: [Boost-users] Boost unit_test.cpp problem when try to compile simple program
by Robert Matusewicz 04 Oct '09

04 Oct '09

Gennadiy Rozental writes: >> You need different include than. Can't have it both ways. Either you include >> library implementation or you link with it. >> >> Use boost/test/unit_test.hpp " Just to close the topic. We can use boost/test/included/unit_test.hpp with Boost DLLs. We have to define BOOST_TEST_SOURCE. RM -- My public key can be found at https://keyserver2.pgp.com

2 1

modify_key() for a composite_key of a multi_index_container that contains a shared_ptr
by Zsolt Vajna 04 Oct '09

04 Oct '09

I'd like to modify_key() for a composite_key of a multi_index_container that contains a shared_ptr. I found a thread in this mailing list dealing with a similar kind of situation, not totally the same though: "[Boost-users] [multi_index] modify problem with composite_key" My example: This compiles fine: struct entry { entry(int a, int b):m_x(a), m_y(b){} int m_x; int m_y; }; typedef multi_index_container< entry, indexed_by< ordered_unique< composite_key< entry, member<entry,int,&entry::m_x>, member<entry,int,&entry::m_y>>>>> C; void updateX(C::iterator iter,int x, C& m_c) { m_c.get<0>().modify( iter, (&ll::_1)->*&entry::m_x=x); } My first problem is if I change modify to modify_key I get the following error: operator_lambda_func_base.hpp(237) : error C3892: 'boost::lambda::detail::select' : you cannot assign to a variable that is const My second problem is that instead of typedef multi_index_container< entry, indexed_by< ordered_unique< composite_key< entry, member<entry,int,&entry::m_x>, member<entry,int,&entry::m_y>>>>> C; i want to have a typedef multi_index_container< shared_ptr<entry>, indexed_by< ordered_unique< composite_key< entry, member<entry,int,&entry::m_x>, member<entry,int,&entry::m_y>>>>> C; Note the shared_ptr added. In this later case I get another error: boost\lambda\detail\member_ptr.hpp(512) : error C2440: 'newline' : cannot convert from 'const rt0 ' to 'entry *const ' I assume I need to change something around the _1 bit, but have no idea what. Thanks

2 1

cmake can't find Boost 1.40.0
by Timothy Chan 04 Oct '09

04 Oct '09

Hi all, I have a newbie question here. I am installing a software called gazebo which uses cmake. The software requres boost 1.35+. I have 1.32 on the system, and 1.40 installed locally. Cmake seems to only be able to find 1.32 and is not able to find my local installation of 1.40. I have boost installed in: /home/timchan/boost_1_40_0 In my .bashrc file I put: export LD_LIBRARY_PATH=/home/timchan/boost_1_40_0/libs:$LD_LIBRARY_PATH export CPATH=/home/timchan/boost_1_40_0/boost:$CPATH When I run cmake, I get the following error: CMake Error at /usr/share/cmake/Modules/FindBoost.cmake:868 (message): Unable to find the requested Boost libraries. Boost version: 1.32.0 Boost include path: /usr/include Detected version of Boost is too old. Requested version was 1.35 (or newer). Any help would be greatly appreciated!!

3 2

Regarding address specified in fixed managed shared memory
by Hector Troy 04 Oct '09

04 Oct '09

Hi, I am trying to use Boost Interprocess library's fixed managed shared memory. The Boost documentation has given an example of fixed managed shared memory with an address of 0x30000000 . fixed_managed_shared_memory segment (open_only ,"MyFixedAddressSharedMemory" ,(void*)0x30000000 ) My question is how can we gaurentee that this address would be available in the process that would be mapping the shared memory to its address space. What would happen in that case ? Thanks,

1 0

Yahoo! Auto Response
by hardik.kheskani＠yahoo.com 03 Oct '09

03 Oct '09

I use hkheskani(a)gmail.com now, since yahoo doesn't allow me to forward my email there...I just have to inform you in this manner. sorry for the inconvenience. thanks

1 0

[Asio] when stopping io_service, I get a system_error : mutex: invalid argument
by philipp_muenzel＠web.de 03 Oct '09

03 Oct '09

Hello, I'm using asio for a udp receiver. I used the example code from http://www.boost.org/doc/libs/1_40_0/doc/html/boost_asio/example/multicast/… and created a class that in its contructor opens a socket, binds to it, calls async_receive_from, and in the receive handler again calls async_receive from. Now i have manager class that takes care of the io service, the thread, and an instance of the receiver class. Everything works fine until the moment I destroy the manager class. Here is what the destructor looks like: Manager::~Manager { // first, make sure that no further requests are handled that would prevent io_service from quitting m_receiver->getSock()->shutdown(boost::asio::ip::udp::socket::shutdown_both); m_receiver->getSock()->close(); // destroy the receiver by resetting its auto_ptr m_receiver.reset(); // reset the work auto_ptr, destroying the work for io_service, so that it can quit m_io_work.reset(0); // join the thread in which io_service.run() was called. m_receiver_thread.join(); // now stop the io // this line is commented, it has no effect whether i remove the slashes // m_io_service.stop(); } When I destroy the manager, i get the following error: "terminate called after throwing an instance of 'boost::exception_detail::clone_impl<boost::exception::detail::error_info_injector<boost::system::system_error> > ' what(): mutex: Invalid argument" It seems similar to the problem that was discussed here: http://lists.boost.org/Archives/boost/2008/03/134169.php But I'm pretty sure that given I destroy the instance that holds the socket first, the io_service has no work left. I tried catching the exception within the destructor and within the run() of the thread, but no luck. I cannot find the place where the exception is thrown, nor do I have an idea what else to do to ensure the io_service has no work left. Any help on fixing this is greatly appreciated. Regards, Philipp ________________________________________________________________ Neu: WEB.DE Doppel-FLAT mit Internet-Flatrate + Telefon-Flatrate für nur 19,99 Euro/mtl.!* http://produkte.web.de/go/02/

1 0

[Process (Vault)] child::wait error on OS X 10.6
by Rush Manbert 03 Oct '09

03 Oct '09

I am using the version of the Process library that was announced by Boris Schaeling in this document: http://www.highscore.de/cpp/process/ I used the link in the introduction to get the zip file, so I think I have the correct version. I am running the following test function: namespace bp = boost::process; namespace bios = boost::iostreams; int BoostProcessTest (void) { std::cout << "\nTesting launch of child process using Boost.Process\n"; std::string exec = bp::find_executable_in_path("svn"); std::vector<std::string> args; args.push_back("svn"); args.push_back("info"); // context bp::context ctx; // child launch bp::child c = bp::launch(exec, args, ctx); // sleep(1); //wait const bp::status s = c.wait(); // parse status if (s.exited() && s.exit_status() == EXIT_SUCCESS) std::cout << "Directory is a working copy." << std::endl; else std::cout << "Directory is not a working copy." << std::endl; std::cout << std::endl; return 0; } I call this function in a loop for as long as it returns 0, which should be forever. The test is run in a directory that is NOT a svn working copy, so all that the child process does is to write a line to stderr and exit. What I'm seeing, however is this message: Error: Caught an exception! boost::process::child::wait: waitpid(2) failed: Interrupted system call The only way I have found to make that go away is by adding the sleep (1) call (commented out above). Then it runs forever. I'm hoping Boris will read this and have some idea of what's happening. My google searches haven't turned up much of value. - Rush

2 1

[Graph] Type "VertexIndexMap"
by Alexandre Bos 03 Oct '09

03 Oct '09

Hello, I am trying to create an instance of edmonds_augmenting_path_finder : --------- test.cpp --------- #include <boost/graph/adjacency_list.hpp> #include <boost/graph/max_cardinality_matching.hpp> using namespace std; using namespace boost; typedef adjacency_list<vecS, vecS, undirectedS> custom_graph; [...] typedef std::vector<graph_traits<custom_graph>::vertex_descriptor> matemap_t; matemap_t mate(42); custom_graph g(42); edmonds_augmenting_path_finder<custom_graph, matemap_t, property_map<custom_graph, vertex_index_t>::type > augmentator(g, mate, get(vertex_index, g)); [...] --------------------------- The compiler (g++) returns the following error : /.../max_cardinality_matching.hpp: In constructor 'boost::edmonds_augmenting_path_finder<Graph, MateMap, VertexIndexMap>::edmonds_augmenting_path_finder(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::no_property, boost::no_property, boost::listS>, MateMap = std::vector<long unsigned int, std::allocator<long unsigned int> >, VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]': /.../convert.cpp:102: instantiated from here /.../max_cardinality_matching.hpp:190: error: no matching function for call to 'get(std::vector<long unsigned int, std::allocator<long unsigned int> >&, const long unsigned int&)' How can I fix this ? Thank you, Alexandre

2 2

[mpl] Discrepancy between documentation and code?
by James Knight 03 Oct '09

03 Oct '09

In looking at the documentation for the intrinsic metafunction mpl::at, it seems to suggest that a three argument version that returns a default type when a key is not found exists for associative sequences. I don't see this implemented anywhere in the code, and the simple example below doesn't compile. Am I missing something or is this an error in the documentation? Thanks, Nate #include <boost/mpl/map.hpp> #include <boost/mpl/at.hpp> #include <boost/mpl/pair.hpp> #include <boost/mpl/assert.hpp> #include <boost/mpl/int.hpp> #include <boost/type_traits/is_same.hpp> using namespace boost::mpl; int main() { typedef map< pair<int_<2>,int_<3> > > map_t; typedef at<map_t, int_<1>, int_<0> >::type missing; BOOST_MPL_ASSERT(( boost::is_same< missing, int_<0> > )); } With gcc 4.0.1 and Boost 1.37 on OS X I get test.cpp: In function 'int main()': test.cpp:12: error: wrong number of template arguments (3, should be 2) ../BoostInstall/boost_1_37_0/boost/mpl/at_fwd.hpp:20: error: provided for 'template<class Sequence, class N> struct boost::mpl::at' ...

1 0

problems with program_opsitons::parse_environment can't figure out how to do what I want.
by Caleb Cushing 02 Oct '09

02 Oct '09

variables_map vm_env; store(parse_environment(desc, "HOME"), vm_env); notify(vm_env); if(vm_env.count("HOME")) { path rcfile = ".koramarc"; path home; home = vm_env["HOME"].as<path>(); path tmp = home / rcfile; cout << "check" << endl; // just a retarted test to see if we're actually reaching the end of this... } -- Caleb Cushing http://xenoterracide.blogspot.com

2 3

Can't compile some boost code on Solaris
by Roger House 02 Oct '09

02 Oct '09

I'm attempting to build a quite large app on Solaris (which I know next to nothing about), and I'm getting compilation errors in a couple of boost files, seemingly related to stlport. The error message "exception is not a member of stlp_std" is issued for line 29 of archive_exception.hpp: class archive_exception : public virtual std::exception The same message (plus others which I think are spurious) is issued for line 55 of throw_exception.hpp: inline void throw_exception_assert_compatibility( std::exception const & ) { } All this code compiles okay with gcc on Linux and with cl on Windows, so I think it is specifically a Sun issue. A Google search led to some discussions on the boost site, but I could not determine from them what the fix is. The Sun compiler I'm using is version 5.9.0, and the boost version is 1.39.0. Any help on this will be greatly appreciated. Roger House Software Developer

1 0

How to use the shared region in append mode
by manish4gupta 02 Oct '09

02 Oct '09

First of all i would like to thank for previous answers. Now i am able to use the shared region to create a map, insert value into shared map and use the shared map. Now moving one step ahead. I am planning to use the shared region in append mode. For instance 1. create shared region if it is not used before // how to check this ? managed_shared_memory segment(create_only,MySharedMemory, 999999999); 2. create map in the region // done 3. open the map and use the map for retrieving and inserting values //done How i can that the given region already allocated to map so that i can insert the value in it otherwise i can create the that region and create tha map and insert the value in the map. Thanks in advance. -- View this message in context: http://www.nabble.com/How-to-use-the-shared-region-in-append-mode-tp2567740… Sent from the Boost - Users mailing list archive at Nabble.com.

2 5

[function/bind] function object type introspection
by Gennadiy Rozental 02 Oct '09

02 Oct '09

Hi, I've got couple questions. Might be someone can point me in right direction. Let's say I've got this class ConcreteFunctor which should handle all kinds of functions. I want to store the function as boost::function object, thus the class has template parameter - FunctionType: template<typename FuncType> ConcreteFunctor : public AbstractFunctor { ConcreteFunctor( FuncType f ) ... {} virtual invoke( std::vector<Object*> const& args ) { // here I can use FuncType::arity and FuncType's argument types // to properly convert arguments to desired types and invoke m_f } FuncType m_f; } Now I need to implement object maker template<typename F> boost::shared_ptr<AnstractFunctor> make_functor( F f ) { typedef boost::function<???> TypeName; return boost::shared_ptr<AbstrctFunctor>( new ConcreteFunctor<FuncType>( f ) ); } I was able to work fine with free functions by just removing pointer from F. Now to the questions: 1. How do I deduce boost::function type from pointer to member functions: Essentially if F is R (A::*)(T1,T2) I need to get boost::function<T (A*,T1,T2)> 2. This is more difficult: if f is bound object, how to I intrspect it's type: Essentially in use case like this: int foo( std::string, int ) {...} make_functor( boost::bind( &foo, "abc" ) ) I want to get FuncType as boost::function<int (int)> Regards, Gennadiy

3 5

[asio] async connect vs sync connect
by Mathieu Peyréga 02 Oct '09

02 Oct '09

Hello, I have a TCP client program using boost 1.40 asio framework and a question. I have an external LAN hosted TCP server ready to accept connexions (functionnal and tested with other means) On my client side, when using the async connect function, it sometimes take up to 2-3 seconds before the connexion handler is called. If I use the synchronous connect function, it is almost immediate. Is there a way to speed up the connexion time, while using the async method ? Regards, Mathieu

1 0

[asio] deadline_timer makes wrong delay when using date command
by Bjarne Laursen 02 Oct '09

02 Oct '09

I have used a deadline_timer to generate a polling every 1 second. Unfortunely when I use the linux date command the timing is curupted. (If I set the clock back 1 min. I will be missing 60 pollings). What can I do about that? -Bjarne

4 9

[BoostCon 2010] Call for Participation
by Hartmut Kaiser 02 Oct '09

02 Oct '09

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

1 0

[xpressive] Calling a function with captured text as a parameter from a rule action
by Ami Ganguli 01 Oct '09

01 Oct '09

Hi all, I've been trying to wrap my head around xpressive. I've got a rule that captures some text, calls a function as part of the action. The function call works, but as soon as I try to pass my captured text as a parameter to the function, I run into a rather long and incomprehensible compilation error. Are there working examples somewhere that do this? (There are examples on calling functions and examples on using captured text in the docs, but nothing that does both) Here's the important bits of my code: My function object: struct append_element_impl { typedef void result_type; void operator()(std::string& text) const { std::cout << "appending " << text; } }; function<append_element_impl>::type const append_element = {{}}; The part of the parser that calls the function: h1 = "=" >> +blank >> * (s1= ~_ln) >> eol [append_element(as<std::string>(s1))]; I've tried various variations on this (the "as<std::string>" is a recent addition, and doesn't seem to make much difference). If I get rid of the s1 parameter in both the function and the call, then everything works as expected. The last part of the error message (the part that I sort of understand) is: /usr/local/include/boost/proto/context/default.hpp:357: error: no match for call to ‘(const append_element_impl(std::basic_string<char, std::char_traits<char>, std::allocator<char> >)’ /home/ganguli/acms/plug-ins/wikitext/wikitext.C:27: note: candidates are: void append_element_impl::operator((std::string&) const /usr/local/include/boost/proto/context/default.hpp:357: error: return-statement with a value, in function returning 'void' I'd really appreciate any pointers on this, or just some examples on how to do something similar. Cheers, Ami.

2 2

Documentation correction
by Joseph Garvin 01 Oct '09

01 Oct '09

http://www.boost.org/doc/libs/1_40_0/doc/html/boost/interprocess/open_copy_… Reads: "Tag to indicate that the resource must be only opened for reading." I assume it should read: "Tag to indicate that the resource is copy on write."

1 0

Re: [Boost-users] Problem detecting python
by Christian O'Reilly 01 Oct '09

01 Oct '09

I seem to have a problem similar to the one first spoke about in this thread, however I have it with the version 1.4.0.I try co compile boost_python library with MinGW under XP. Here is the command I use : E:\PySide_dev\boost_1_40_0>bjam toolset=gcc --with-python --debug-configuration stage And here is a part of the output I get : notice: [python-cfg] Registry indicates Python 2.5 installed at "E:\Program File s\pythonxy\python\" notice: [python-cfg] Checking interpreter command "python"... notice: [python-cfg] running command 'DIR /-C /A:S "E:\Program Files\pythonxy\py thon\python.exe" 2>&1' notice: [python-cfg] running command '"python" -c "from sys import *; print 'ver sion=%d.%d\nplatform=%s\nprefix=%s\nexec_prefix=%s\nexecutable=%s' % (version_in fo[0],version_info[1],platform,prefix,exec_prefix,executable)" 2>&1' notice: [python-cfg] ...does not invoke a working interpreter notice: [python-cfg] Checking interpreter command "E:\Program Files\pythonxy\pyt hon\python"... notice: [python-cfg] running command 'DIR /-C /A:S "E:\Program Files\pythonxy\py thon\python.exe" 2>&1' notice: [python-cfg] running command '"E:\Program Files\pythonxy\python\python" -c "from sys import *; print 'version=%d.%d\nplatform=%s\nprefix=%s\nexec_prefix =%s\nexecutable=%s' % (version_info[0],version_info[1],platform,prefix,exec_pref ix,executable)" 2>&1' notice: [python-cfg] ...does not invoke a working interpreter notice: [python-cfg] No working Python interpreter found. notice: [python-cfg] running command 'DIR /-C /A:S "E:\Program Files\pythonxy\py thon\python.exe" 2>&1' notice: [python-cfg] falling back to "python" notice: [python-cfg] Details of this Python configuration: notice: [python-cfg] interpreter command: "python" notice: [python-cfg] include path: "Include" notice: [python-cfg] library path: "\libs" notice: [python-cfg] DLL search path: "<empty>" WARNING: No python installation configured and autoconfiguration failed. See http://www.boost.org/libs/python/doc/building.html for configuration instructions or pass --without-python to suppress this message and silently skip all Boost.Python targets Notice that the informations obtained from the command '"E:\Program Files\pythonxy\python\python" -c "from sys import *; print 'version=%d.%d\nplatform=%s\nprefix=%s\nexec_prefix =%s\nexecutable=%s' % (version_info[0],version_info[1],platform,prefix,exec_pref ix,executable)" 2>&1' are correct. Any idea how to solve this? -- View this message in context: http://www.nabble.com/Problem-detecting-python-tp25153064p25670428.html Sent from the Boost - Users mailing list archive at Nabble.com.

2 2

[spirit] Cannot find assig_a in spirit 2.1
by Christian Henning 01 Oct '09

01 Oct '09

Hi there, I really liked the assign_a actor in classic spirit. Is there something like that in spirit 2.1, aka, spirit::qi? Thanks, Christian

3 9

[interprocess] problem in HPUX
by Rui Pedro Fernandes 01 Oct '09

01 Oct '09

Hi, I've been trying boost.interprocess v. 1.40 in a HP-UX 11.23 IA64 machine. Firstly I tried a 64 bit compilation of the interprocess test with aCC compiler (v. A.06.15). It failed with error: "No atomic operations implemented for this platform, sorry!". Then I used gcc 4.1.2 and compilation did succeed. Many tests got passed, however some failed with "boost::interprocess_exception::library_error". Here is an output example of both cases: >>>>>> gcc.compile.c++ ../../../bin.v2/libs/interprocess/test/named_construct_test.test/gcc-4.1.2/debug/threading-multi/named_construct_test.o "g++" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -pthread -fPIC -mlp64 -DBOOST_ALL_NO_LIB=1 -DBOOST_THREAD_POSIX -DBOOST_THREAD_USE_DLL=1 -I"../../.." -c -o "../../../bin.v2/libs/interprocess/test/named_construct_test.test/gcc-4.1.2/debug/threading-multi/named_construct_test.o" "named_construct_test.cpp" gcc.link ../../../bin.v2/libs/interprocess/test/named_construct_test.test/gcc-4.1.2/debug/threading-multi/named_construct_test "g++" -o "../../../bin.v2/libs/interprocess/test/named_construct_test.test/gcc-4.1.2/debug/threading-multi/named_construct_test" "../../../bin.v2/libs/interprocess/test/named_construct_test.test/gcc-4.1.2/debug/threading-multi/named_construct_test.o" "../../../bin.v2/libs/thread/build/gcc-4.1.2/debug/threading-multi/libboost_thread-gcc41-mt-d-1_40.so.1.40.0" -lrt -g -fPIC -pthread -mlp64 testing.capture-output ../../../bin.v2/libs/interprocess/test/named_construct_test.test/gcc-4.1.2/debug/threading-multi/named_construct_test.run LD_LIBRARY_PATH="/usr/local/bin:/usr/local/lib:/usr/local/lib32:/usr/local/lib64:/usr/users/genesys/src/boost_1_40_0/bin.v2/libs/thread/build/gcc-4.1.2/debug/threading-multi:$LD_LIBRARY_PATH" export LD_LIBRARY_PATH "../../../bin.v2/libs/interprocess/test/named_construct_test.test/gcc-4.1.2/debug/threading-multi/named_construct_test" > "../../../bin.v2/libs/interprocess/test/named_construct_test.test/gcc-4.1.2/debug/threading-multi/named_construct_test.output" 2>&1 status=$? echo >> "../../../bin.v2/libs/interprocess/test/named_construct_test.test/gcc-4.1.2/debug/threading-multi/named_construct_test.output" echo EXIT STATUS: $status >> "../../../bin.v2/libs/interprocess/test/named_construct_test.test/gcc-4.1.2/debug/threading-multi/named_construct_test.output" if test $status -eq 0 ; then cp "../../../bin.v2/libs/interprocess/test/named_construct_test.test/gcc-4.1.2/debug/threading-multi/named_construct_test.output" "../../../bin.v2/libs/interprocess/test/named_construct_test.test/gcc-4.1.2/debug/threading-multi/named_construct_test.run" fi verbose=0 if test $status -ne 0 ; then verbose=1 fi if test $verbose -eq 1 ; then echo ====== BEGIN OUTPUT ====== cat "../../../bin.v2/libs/interprocess/test/named_construct_test.test/gcc-4.1.2/debug/threading-multi/named_construct_test.output" echo ====== END OUTPUT ====== fi exit $status ...on 100th target... **passed** ../../../bin.v2/libs/interprocess/test/named_construct_test.test/gcc-4.1.2/debug/threading-multi/named_construct_test.test echo passed > "../../../bin.v2/libs/interprocess/test/named_construct_test.test/gcc-4.1.2/debug/threading-multi/named_construct_test.test" gcc.compile.c++ ../../../bin.v2/libs/interprocess/test/named_mutex_test.test/gcc-4.1.2/debug/threading-multi/named_mutex_test.o "g++" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -pthread -fPIC -mlp64 -DBOOST_ALL_NO_LIB=1 -DBOOST_THREAD_POSIX -DBOOST_THREAD_USE_DLL=1 -I"../../.." -c -o "../../../bin.v2/libs/interprocess/test/named_mutex_test.test/gcc-4.1.2/debug/threading-multi/named_mutex_test.o" "named_mutex_test.cpp" gcc.link ../../../bin.v2/libs/interprocess/test/named_mutex_test.test/gcc-4.1.2/debug/threading-multi/named_mutex_test "g++" -o "../../../bin.v2/libs/interprocess/test/named_mutex_test.test/gcc-4.1.2/debug/threading-multi/named_mutex_test" "../../../bin.v2/libs/interprocess/test/named_mutex_test.test/gcc-4.1.2/debug/threading-multi/named_mutex_test.o" "../../../bin.v2/libs/thread/build/gcc-4.1.2/debug/threading-multi/libboost_thread-gcc41-mt-d-1_40.so.1.40.0" -lrt -g -fPIC -pthread -mlp64 testing.capture-output ../../../bin.v2/libs/interprocess/test/named_mutex_test.test/gcc-4.1.2/debug/threading-multi/named_mutex_test.run LD_LIBRARY_PATH="/usr/local/bin:/usr/local/lib:/usr/local/lib32:/usr/local/lib64:/usr/users/genesys/src/boost_1_40_0/bin.v2/libs/thread/build/gcc-4.1.2/debug/threading-multi:$LD_LIBRARY_PATH" export LD_LIBRARY_PATH "../../../bin.v2/libs/interprocess/test/named_mutex_test.test/gcc-4.1.2/debug/threading-multi/named_mutex_test" > "../../../bin.v2/libs/interprocess/test/named_mutex_test.test/gcc-4.1.2/debug/threading-multi/named_mutex_test.output" 2>&1 status=$? echo >> "../../../bin.v2/libs/interprocess/test/named_mutex_test.test/gcc-4.1.2/debug/threading-multi/named_mutex_test.output" echo EXIT STATUS: $status >> "../../../bin.v2/libs/interprocess/test/named_mutex_test.test/gcc-4.1.2/debug/threading-multi/named_mutex_test.output" if test $status -eq 0 ; then cp "../../../bin.v2/libs/interprocess/test/named_mutex_test.test/gcc-4.1.2/debug/threading-multi/named_mutex_test.output" "../../../bin.v2/libs/interprocess/test/named_mutex_test.test/gcc-4.1.2/debug/threading-multi/named_mutex_test.run" fi verbose=0 if test $status -ne 0 ; then verbose=1 fi if test $verbose -eq 1 ; then echo ====== BEGIN OUTPUT ====== cat "../../../bin.v2/libs/interprocess/test/named_mutex_test.test/gcc-4.1.2/debug/threading-multi/named_mutex_test.output" echo ====== END OUTPUT ====== fi exit $status ====== BEGIN OUTPUT ====== create_then_open_then_open_or_create<33named_mutex_creation_test_wrapper> Failed: false file: named_creation_template.hpp line : 34 boost::interprocess_exception::library_error EXIT STATUS: 1 ====== END OUTPUT ====== ...failed testing.capture-output ../../../bin.v2/libs/interprocess/test/named_mutex_test.test/gcc-4.1.2/debug/threading-multi/named_mutex_test.run... <<<<<< Could anyone explain this error? Is it possible to overcome the problem? Thanks in advance. Rui

6 18

Re: [Boost-users] Reference count in shared_ptr
by Daniele Barzotti 01 Oct '09

01 Oct '09

On Thu 01/10/09 17:47 , Roman Perepelitsa wrote: > > In this case, is 'delete' called twice for Impl2? > > Yes. When you passed a pointer to shared_ptr, you don't own this > pointer anymore, so you shouldn't delete it manually. > Roman Perepelitsa. > Thanks Roman! Now I tested it on my skin! :-) Regards, Daniele.

1 0

Reference count in shared_ptr
by Daniele Barzotti 01 Oct '09

01 Oct '09

Hi, I've a doubt about shared_ptr... Suppose to have something like this: template class Interface {..pure virtual..} template class Impl1 : public Interface {....} template class Impl2 : public Interface {....} class A { public: Interface* GetObjPtr() { return &obj; } private: Impl2 obj; }; class B { ~B() { delete a_ptr; } B() { a_ptr = new A; Int_ptr.reset( a_ptr->GetObjPtr ); } private: A* a_ptr; shared_ptr< Interface > Int_ptr; }; Where B creates and use A on its internal. In this case, is 'delete' called twice for Impl2? (When A is destroyed and when B, and its shared_ptr, is destroyed). Thanks, Daniele.

2 1

[asio] no error or exception sent ?
by Mathieu Peyréga 01 Oct '09

01 Oct '09

Hello, i'm using a tcp socket from asio 1.40 framework and i have the following behaviour : i establish a connection to a server and start receiving data i now want my software to be robust to server deconnexion/reset so i simulate it by shuting down the server equipment (which is an external hardware equipement) i would expect such operation to interrupt any pending async_read_some operation with an error code, but it doesn't is there some way to have the expected behaviour ? regards, Mathieu

2 3

spurious string
by Surya Kiran Gullapalli 01 Oct '09

01 Oct '09

Hello all, I'm reading an html file and parsing data from it. I've encountered a spurious string (researcherâ€™s). Notepad++ shows that string as *researcher's *. I'm reading the file using std::fstream class. Is there any way i can read the string and get the spurious characters replaced using boost string/regex algorithms ? Thanks, Surya

2 4

[boost.datetime] Formating dates as strings
by Sean Farrow 01 Oct '09

01 Oct '09

Hi: What is the best way to format a date in a specific way. For example I have a client who wants there dates formatted as 01/10/2009, and another who wants Thursday 01 October. These need to be output as std::wstrings. Any help appreciated. Sean.

2 1

How to install boost 1_39 on itanium server
by manish4gupta 01 Oct '09

01 Oct '09

I am installing the boost on itanium (64 bit red hat) machine. I am following the three steps. ./bootstrap.sh --prefix=/usr/local ./bjam ./bjam install After installation, libboost files are all located in /usr/lib. But i am trying to run one simple code. #include <boost/interprocess/managed_shared_memory.hpp> #include <boost/interprocess/allocators/allocator.hpp> #include <boost/interprocess/containers/map.hpp> #include <boost/interprocess/containers/string.hpp> #include <iostream> using namespace boost::interprocess; //Typedefs of allocators and containers typedef managed_shared_memory::segment_manager segment_manager_t; typedef allocator<void, segment_manager_t> void_allocator; typedef allocator<char, segment_manager_t> char_allocator; typedef basic_string<char, std::char_traits<char>, char_allocator> char_string; //Definition of the map holding a string as key and complex_data as mapped type typedef std:air<const char_string, int> map_value_type; typedef allocator<map_value_type, segment_manager_t> map_value_type_allocator; typedef map< char_string, int, std::less<char_string>, map_value_type_allocator> complex_map_type; int main () { shared_memory_object::remove("MySharedMemory"); //Create shared memory managed_shared_memory segment(create_only,"MySharedMemory", 65536); //An allocator convertible to any allocator<T, segment_manager_t> type void_allocator alloc_inst (segment.get_segment_manager()); //Construct the shared memory map and fill it complex_map_type *mymap = segment.construct<complex_map_type>("MyMap")(std:: less<char_string>(), alloc_inst); char_string cs("test", alloc_inst); for(int i = 0; i < 100; ++i) { mymap->insert(std:air<char_string, int>(cs , i)); } return 0; } with command g++ program_name.cpp -lrt It is showing error "No such file and directory" for every header file. This code is working fine on 32 bit (installed by other person).May i know what is the pblm? -- View this message in context: http://www.nabble.com/How-to-install-boost-1_39-on-itanium-server-tp2568059… Sent from the Boost - Users mailing list archive at Nabble.com.

5 15

asio - failed to compile "chat_client.cpp" example on Cygwin
by Steve Ong 30 Sep '09

30 Sep '09

Hi, I downloaded the "chat_client.cpp" from the boost website (http://www.boost.org/doc/libs/1_37_0/doc/html/boost_asio/examples.html) and try to compile it on Cygwin (see my compile statement below..), but it failed. It's worked on Linux (without the -D__USE_W32_SOCKETS -D_WIN32_WINNT=0x0501) , however. Thanks in advance for your help. Compile statement: g++ -o chat_client chat_client.cpp -D__USE_W32_SOCKETS -D_WIN32_WINNT=0x0501 -Wall -I/opt/boost/include -L/opt/boost/lib -lboost_thread -lboost_system -lboost_t hread Output message: /usr/lib/gcc/i686-pc-cygwin/3.4.4/../../../../i686-pc-cygwin/bin/ld: warning: au to-importing has been activated without --enable-auto-import specified on the co mmand line. This should work unless it involves constant data structures referencing symbols from auto-imported DLLs./cygdrive/c/DOCUME~1/steven/LOCALS~1/Temp/ccKpZSDF.o:ch at_client.cpp:(.text$_ZN5boost4asio6detail12winsock_initILi2ELi0EE7do_initC1Ev[b oost::asio::detail::winsock_init<2, 0>::do_init::do_init()]+0x1f): undefined ref erence to `_WSAStartup@8' /cygdrive/c/DOCUME~1/steven/LOCALS~1/Temp/ccKpZSDF.o:chat_client.cpp:(.text$_ZN5 boost4asio6detail10socket_ops5closeEjRNS_6system10error_codeE[boost::asio::detai l::socket_ops::close(unsigned int, boost::system::error_code&)]+0x18): undefined reference to `_closesocket@4' /cygdrive/c/DOCUME~1/steven/LOCALS~1/Temp/ccKpZSDF.o:chat_client.cpp:(.text$_ZN5 boost4asio6detail10socket_ops13error_wrapperIiEET_S4_RNS_6system10error_codeE[in t boost::asio::detail::socket_ops::error_wrapper<int>(int, boost::system::error_ code&)]+0x13): undefined reference to `_WSAGetLastError@0' /cygdrive/c/DOCUME~1/steven/LOCALS~1/Temp/ccKpZSDF.o:chat_client.cpp:(.text$_ZN5 boost4asio6detail10socket_ops11clear_errorERNS_6system10error_codeE[boost::asio: :detail::socket_ops::clear_error(boost::system::error_code&)]+0xf): undefined re ference to `_WSASetLastError@4' /cygdrive/c/DOCUME~1/steven/LOCALS~1/Temp/ccKpZSDF.o:chat_client.cpp:(.text$_ZN5 boost4asio6detail10socket_ops6socketEiiiRNS_6system10error_codeE[boost::asio::de tail::socket_ops::socket(int, int, int, boost::system::error_code&)]+0x3e): unde fined reference to `_WSASocketA@24' /cygdrive/c/DOCUME~1/steven/LOCALS~1/Temp/ccKpZSDF.o:chat_client.cpp:(.text$_ZN5 boost4asio6detail10socket_ops6socketEiiiRNS_6system10error_codeE[boost::asio::de tail::socket_ops::socket(int, int, int, boost::system::error_code&)]+0x9a): unde fined reference to `_setsockopt@20' /cygdrive/c/DOCUME~1/steven/LOCALS~1/Temp/ccKpZSDF.o:chat_client.cpp:(.text$_ZN5 boost4asio6detail10socket_ops13error_wrapperIjEET_S4_RNS_6system10error_codeE[un signed int boost::asio::detail::socket_ops::error_wrapper<unsigned int>(unsigned int, boost::system::error_code&)]+0x13): undefined reference to `_WSAGetLastErr or@0' /cygdrive/c/DOCUME~1/steven/LOCALS~1/Temp/ccKpZSDF.o:chat_client.cpp:(.text$_ZN5 boost4asio6detail10socket_ops12call_connectIiEEiMNS2_6msghdrET_jPK8sockaddrj[int boost::asio::detail::socket_ops::call_connect<int>(int boost::asio::detail::soc ket_ops::msghdr::*, unsigned int, sockaddr const*, unsigned int)]+0x1b): undefin ed reference to `_connect@12' /cygdrive/c/DOCUME~1/steven/LOCALS~1/Temp/ccKpZSDF.o:chat_client.cpp:(.text$_ZN5 boost4asio6detail10socket_ops5ioctlEjlPmRNS_6system10error_codeE[boost::asio::de tail::socket_ops::ioctl(unsigned int, long, unsigned long*, boost::system::error _code&)]+0x26): undefined reference to `_ioctlsocket@12' /cygdrive/c/DOCUME~1/steven/LOCALS~1/Temp/ccKpZSDF.o:chat_client.cpp:(.text$_ZN5 boost4asio6detail10socket_ops11getaddrinfoEPKcS4_PK8addrinfoPPS5_RNS_6system10er ror_codeE[boost::asio::detail::socket_ops::getaddrinfo(char const*, char const*, addrinfo const*, addrinfo**, boost::system::error_code&)]+0x2e): undefined refe rence to `_getaddrinfo@16' /cygdrive/c/DOCUME~1/steven/LOCALS~1/Temp/ccKpZSDF.o:chat_client.cpp:(.text$_ZN5 boost4asio6detail10socket_ops24translate_addrinfo_errorEi[boost::asio::detail::s ocket_ops::translate_addrinfo_error(int)]+0x228): undefined reference to `_WSAGe tLastError@0' /cygdrive/c/DOCUME~1/steven/LOCALS~1/Temp/ccKpZSDF.o:chat_client.cpp:(.text$_ZN5 boost4asio6detail10socket_ops4sendEjPK7_WSABUFjiRNS_6system10error_codeE[boost:: asio::detail::socket_ops::send(unsigned int, _WSABUF const*, unsigned int, int, boost::system::error_code&)]+0x57): undefined reference to `_WSASend@28' /cygdrive/c/DOCUME~1/steven/LOCALS~1/Temp/ccKpZSDF.o:chat_client.cpp:(.text$_ZN5 boost4asio6detail10socket_ops12freeaddrinfoEP8addrinfo[boost::asio::detail::sock et_ops::freeaddrinfo(addrinfo*)]+0xd): undefined reference to `_freeaddrinfo@4' /cygdrive/c/DOCUME~1/steven/LOCALS~1/Temp/ccKpZSDF.o:chat_client.cpp:(.text$_ZN5 boost4asio6detail10socket_ops15call_setsockoptIiEEiMNS2_6msghdrET_jiiPKvj[int bo ost::asio::detail::socket_ops::call_setsockopt<int>(int boost::asio::detail::soc ket_ops::msghdr::*, unsigned int, int, int, void const*, unsigned int)]+0x29): u ndefined reference to `_setsockopt@20' /cygdrive/c/DOCUME~1/steven/LOCALS~1/Temp/ccKpZSDF.o:chat_client.cpp:(.text$_ZN5 boost4asio6detail23win_iocp_socket_serviceINS0_2ip3tcpEE13async_receiveINS1_17co nsuming_buffersINS0_14mutable_bufferENS0_17mutable_buffers_1EEENS1_12read_handle rINS0_19basic_stream_socketIS4_NS0_21stream_socket_serviceIS4_EEEES9_NS1_14trans fer_all_tENS_3_bi6bind_tIvNS_4_mfi3mf1Iv11chat_clientRKNS_6system10error_codeEEE NSH_5list2INSH_5valueIPSL_EEPFNS_3argILi1EEEvEEEEEEEEEvRNS5_19implementation_typ eERKT_iT0_[void boost::asio::detail::win_iocp_socket_service<boost::asio::ip::tc p>::async_receive<boost::asio::detail::consuming_buffers<boost::asio::mutable_bu ffer, boost::asio::mutable_buffers_1>, boost::asio::detail::read_handler<boost:: asio::basic_stream_socket<boost::asio::ip::tcp, boost::asio::stream_socket_servi ce<boost::asio::ip::tcp> >, boost::asio::mutable_buffers_1, boost::asio::detail: :transfer_all_t, boost::_bi::bind_t<void, boost::_mfi::mf1<void, chat_client, bo ost::system::error_code const&>, boost::_bi::list2<boost::_bi::value<chat_client *>, boost::arg<1> (*)()> > > >(boost::asio::detail::win_iocp_socket_service<boos t::asio::ip::tcp>::implementation_type&, boost::asio::detail::consuming_buffers< boost::asio::mutable_buffer, boost::asio::mutable_buffers_1> const&, int, boost: :asio::detail::read_handler<boost::asio::basic_stream_socket<boost::asio::ip::tc p, boost::asio::stream_socket_service<boost::asio::ip::tcp> >, boost::asio::muta ble_buffers_1, boost::asio::detail::transfer_all_t, boost::_bi::bind_t<void, boo st::_mfi::mf1<void, chat_client, boost::system::error_code const&>, boost::_bi:: list2<boost::_bi::value<chat_client*>, boost::arg<1> (*)()> > >)]+0x41a): undefi ned reference to `_WSARecv@28' /cygdrive/c/DOCUME~1/steven/LOCALS~1/Temp/ccKpZSDF.o:chat_client.cpp:(.text$_ZN5 boost4asio6detail23win_iocp_socket_serviceINS0_2ip3tcpEE13async_receiveINS1_17co nsuming_buffersINS0_14mutable_bufferENS0_17mutable_buffers_1EEENS1_12read_handle rINS0_19basic_stream_socketIS4_NS0_21stream_socket_serviceIS4_EEEES9_NS1_14trans fer_all_tENS_3_bi6bind_tIvNS_4_mfi3mf1Iv11chat_clientRKNS_6system10error_codeEEE NSH_5list2INSH_5valueIPSL_EEPFNS_3argILi1EEEvEEEEEEEEEvRNS5_19implementation_typ eERKT_iT0_[void boost::asio::detail::win_iocp_socket_service<boost::asio::ip::tc p>::async_receive<boost::asio::detail::consuming_buffers<boost::asio::mutable_bu ffer, boost::asio::mutable_buffers_1>, boost::asio::detail::read_handler<boost:: asio::basic_stream_socket<boost::asio::ip::tcp, boost::asio::stream_socket_servi ce<boost::asio::ip::tcp> >, boost::asio::mutable_buffers_1, boost::asio::detail: :transfer_all_t, boost::_bi::bind_t<void, boost::_mfi::mf1<void, chat_client, bo ost::system::error_code const&>, boost::_bi::list2<boost::_bi::value<chat_client *>, boost::arg<1> (*)()> > > >(boost::asio::detail::win_iocp_socket_service<boos t::asio::ip::tcp>::implementation_type&, boost::asio::detail::consuming_buffers< boost::asio::mutable_buffer, boost::asio::mutable_buffers_1> const&, int, boost: :asio::detail::read_handler<boost::asio::basic_stream_socket<boost::asio::ip::tc p, boost::asio::stream_socket_service<boost::asio::ip::tcp> >, boost::asio::muta ble_buffers_1, boost::asio::detail::transfer_all_t, boost::_bi::bind_t<void, boo st::_mfi::mf1<void, chat_client, boost::system::error_code const&>, boost::_bi:: list2<boost::_bi::value<chat_client*>, boost::arg<1> (*)()> > >)]+0x428): undefi ned reference to `_WSAGetLastError@0' /cygdrive/c/DOCUME~1/steven/LOCALS~1/Temp/ccKpZSDF.o:chat_client.cpp:(.text$_ZN5 boost4asio6detail23win_iocp_socket_serviceINS0_2ip3tcpEE10async_sendINS1_17consu ming_buffersINS0_12const_bufferENS0_17mutable_buffers_1EEENS1_13write_handlerINS 0_19basic_stream_socketIS4_NS0_21stream_socket_serviceIS4_EEEES9_NS1_14transfer_ all_tENS_3_bi6bind_tIvNS_4_mfi3mf1Iv11chat_clientRKNS_6system10error_codeEEENSH_ 5list2INSH_5valueIPSL_EEPFNS_3argILi1EEEvEEEEEEEEEvRNS5_19implementation_typeERK T_iT0_[void boost::asio::detail::win_iocp_socket_service<boost::asio::ip::tcp>:: async_send<boost::asio::detail::consuming_buffers<boost::asio::const_buffer, boo st::asio::mutable_buffers_1>, boost::asio::detail::write_handler<boost::asio::ba sic_stream_socket<boost::asio::ip::tcp, boost::asio::stream_socket_service<boost ::asio::ip::tcp> >, boost::asio::mutable_buffers_1, boost::asio::detail::transfe r_all_t, boost::_bi::bind_t<void, boost::_mfi::mf1<void, chat_client, boost::sys tem::error_code const&>, boost::_bi::list2<boost::_bi::value<chat_client*>, boos t::arg<1> (*)()> > > >(boost::asio::detail::win_iocp_socket_service<boost::asio: :ip::tcp>::implementation_type&, boost::asio::detail::consuming_buffers<boost::a sio::const_buffer, boost::asio::mutable_buffers_1> const&, int, boost::asio::det ail::write_handler<boost::asio::basic_stream_socket<boost::asio::ip::tcp, boost: :asio::stream_socket_service<boost::asio::ip::tcp> >, boost::asio::mutable_buffe rs_1, boost::asio::detail::transfer_all_t, boost::_bi::bind_t<void, boost::_mfi: :mf1<void, chat_client, boost::system::error_code const&>, boost::_bi::list2<boo st::_bi::value<chat_client*>, boost::arg<1> (*)()> > >)]+0x3f4): undefined refer ence to `_WSASend@28' /cygdrive/c/DOCUME~1/steven/LOCALS~1/Temp/ccKpZSDF.o:chat_client.cpp:(.text$_ZN5 boost4asio6detail23win_iocp_socket_serviceINS0_2ip3tcpEE10async_sendINS1_17consu ming_buffersINS0_12const_bufferENS0_17mutable_buffers_1EEENS1_13write_handlerINS 0_19basic_stream_socketIS4_NS0_21stream_socket_serviceIS4_EEEES9_NS1_14transfer_ all_tENS_3_bi6bind_tIvNS_4_mfi3mf1Iv11chat_clientRKNS_6system10error_codeEEENSH_ 5list2INSH_5valueIPSL_EEPFNS_3argILi1EEEvEEEEEEEEEvRNS5_19implementation_typeERK T_iT0_[void boost::asio::detail::win_iocp_socket_service<boost::asio::ip::tcp>:: async_send<boost::asio::detail::consuming_buffers<boost::asio::const_buffer, boo st::asio::mutable_buffers_1>, boost::asio::detail::write_handler<boost::asio::ba sic_stream_socket<boost::asio::ip::tcp, boost::asio::stream_socket_service<boost ::asio::ip::tcp> >, boost::asio::mutable_buffers_1, boost::asio::detail::transfe r_all_t, boost::_bi::bind_t<void, boost::_mfi::mf1<void, chat_client, boost::sys tem::error_code const&>, boost::_bi::list2<boost::_bi::value<chat_client*>, boos t::arg<1> (*)()> > > >(boost::asio::detail::win_iocp_socket_service<boost::asio: :ip::tcp>::implementation_type&, boost::asio::detail::consuming_buffers<boost::a sio::const_buffer, boost::asio::mutable_buffers_1> const&, int, boost::asio::det ail::write_handler<boost::asio::basic_stream_socket<boost::asio::ip::tcp, boost: :asio::stream_socket_service<boost::asio::ip::tcp> >, boost::asio::mutable_buffe rs_1, boost::asio::detail::transfer_all_t, boost::_bi::bind_t<void, boost::_mfi: :mf1<void, chat_client, boost::system::error_code const&>, boost::_bi::list2<boo st::_bi::value<chat_client*>, boost::arg<1> (*)()> > >)]+0x402): undefined refer ence to `_WSAGetLastError@0' /cygdrive/c/DOCUME~1/steven/LOCALS~1/Temp/ccKpZSDF.o:chat_client.cpp:(.text$_ZN5 boost4asio6detail12winsock_initILi2ELi0EE7do_initD1Ev[boost::asio::detail::winso ck_init<2, 0>::do_init::~do_init()]+0x7): undefined reference to `_WSACleanup@0' /cygdrive/c/DOCUME~1/steven/LOCALS~1/Temp/ccKpZSDF.o:chat_client.cpp:(.text$_ZN5 boost4asio6detail25socket_select_interrupterC1Ev[boost::asio::detail::socket_sel ect_interrupter::socket_select_interrupter()]+0x17f): undefined reference to `_i net_addr@4' /cygdrive/c/DOCUME~1/steven/LOCALS~1/Temp/ccKpZSDF.o:chat_client.cpp:(.text$_ZN5 boost4asio6detail10socket_ops11call_acceptIiEEjMNS2_6msghdrET_jP8sockaddrPj[unsi gned int boost::asio::detail::socket_ops::call_accept<int>(int boost::asio::deta il::socket_ops::msghdr::*, unsigned int, sockaddr*, unsigned int*)]+0x4d): undef ined reference to `_accept@12' /cygdrive/c/DOCUME~1/steven/LOCALS~1/Temp/ccKpZSDF.o:chat_client.cpp:(.text$_ZN5 boost4asio6detail10socket_ops6listenEjiRNS_6system10error_codeE[boost::asio::det ail::socket_ops::listen(unsigned int, int, boost::system::error_code&)]+0x1f): u ndefined reference to `_listen@8' /cygdrive/c/DOCUME~1/steven/LOCALS~1/Temp/ccKpZSDF.o:chat_client.cpp:(.text$_ZN5 boost4asio6detail10socket_ops16call_getsocknameIiEEiMNS2_6msghdrET_jP8sockaddrPj [int boost::asio::detail::socket_ops::call_getsockname<int>(int boost::asio::det ail::socket_ops::msghdr::*, unsigned int, sockaddr*, unsigned int*)]+0x23): unde fined reference to `_getsockname@12' /cygdrive/c/DOCUME~1/steven/LOCALS~1/Temp/ccKpZSDF.o:chat_client.cpp:(.text$_ZN5 boost4asio6detail10socket_ops9call_bindIiEEiMNS2_6msghdrET_jPK8sockaddrj[int boo st::asio::detail::socket_ops::call_bind<int>(int boost::asio::detail::socket_ops ::msghdr::*, unsigned int, sockaddr const*, unsigned int)]+0x1b): undefined refe rence to `_bind@12' /cygdrive/c/DOCUME~1/steven/LOCALS~1/Temp/ccKpZSDF.o:chat_client.cpp:(.text$_ZN5 boost4asio6detail10socket_ops4recvEjP7_WSABUFjiRNS_6system10error_codeE[boost::a sio::detail::socket_ops::recv(unsigned int, _WSABUF*, unsigned int, int, boost:: system::error_code&)]+0x57): undefined reference to `_WSARecv@28' /cygdrive/c/DOCUME~1/steven/LOCALS~1/Temp/ccKpZSDF.o:chat_client.cpp:(.text$_ZNK 5boost4asio6detail18win_fd_set_adapter6is_setEj[boost::asio::detail::win_fd_set_ adapter::is_set(unsigned int) const]+0x14): undefined reference to `___WSAFDIsSe t@8' /cygdrive/c/DOCUME~1/steven/LOCALS~1/Temp/ccKpZSDF.o:chat_client.cpp:(.text$_ZN5 boost4asio6detail10socket_ops6selectEiP6fd_setS4_S4_P7timevalRNS_6system10error_ codeE[boost::asio::detail::socket_ops::select(int, fd_set*, fd_set*, fd_set*, ti meval*, boost::system::error_code&)]+0xe4): undefined reference to `_select@20' /cygdrive/c/DOCUME~1/steven/LOCALS~1/Temp/ccKpZSDF.o:chat_client.cpp:(.text$_ZN5 boost4asio6detail10socket_ops15call_getsockoptIiEEiMNS2_6msghdrET_jiiPvPj[int bo ost::asio::detail::socket_ops::call_getsockopt<int>(int boost::asio::detail::soc ket_ops::msghdr::*, unsigned int, int, int, void*, unsigned int*)]+0x31): undefi ned reference to `_getsockopt@20' Info: resolving vtable for boost::detail::thread_data_baseby linking to __imp___ ZTVN5boost6detail16thread_data_baseE (auto-import) collect2: ld returned 1 exit status make: *** [chat_client] Error 1

1 0

nested lambda::bind expression and ptr_vector
by Archie14 30 Sep '09

30 Sep '09

/* can't get the following code to compile. I need to find an templated instance in the list where id is equal 15. */ #include "stdafx.h" #include <boost/ptr_container/ptr_vector.hpp> #include <boost/lambda/bind.hpp> class A { public: int id() const {return _id;} private: int _id; }; template <typename T> class AA { public: const T& item() {return _item;} private: T _item; }; int _tmain(int argc, _TCHAR* argv[]) { typedef AA<A> thistype; boost::ptr_vector<thistype > lst; int comparewith (15); std::find (lst.begin(), lst.end(), (boost::lambda::bind (&A::id, boost::lambda::bind(&thistype::item, boost::lambda::_1)) == comparewith) ); return 0; }

1 0

(no subject)
by vicente.botet 30 Sep '09

30 Sep '09

Hi, is there a way to define a template that will generate a type _____________________ Vicente Juan Botet Escribá

3 2

[serialization] Support for boost classes
by Chard 30 Sep '09

30 Sep '09

Is there a particular reason why the serialization library does not provide serialization functions for types in other boost libraries? Unless I've missed them, but I find I've had to provide implementations for, e.g.: boost::filesystem::path - trivial. boost::multi_array - also seems straightforward, unless I'm missing something there. They don't require invasive techniques, so is it that it's being left up to the particular library owners to decide whether or not to support serialization? If it's an efficiency argument, e.g. one size doesn't fit all, I don't see why 'an' implementation could not be provided (perhaps in /serialization/boost/xyz.hpp). After all, no one would be forced to include/use that particular implementation.

3 4

Using Boost.asio with IGMPv3
by Steve T 30 Sep '09

30 Sep '09

Greetings, I am currently using Boost.asio to send and receive UDP multicast messages. I now have the requirement that all UDP messages use IGMPv3. Is IGMPv3 supported using the Boost.asio library? If not, how can I implement IGMPv3 in Boost.asio? It seems that adding IGMPv3 could be implemented by adding the IP_ADD_SOURCE_MEMBERSHIP option. What would be the best method for adding the socket option IP_ADD_SOURCE_MEMBERSHIP? Thanks in advance, Steve

1 0

[Boost.MPL]is it possible to generate types with all combinations of template arguments?
by Tan, Tom (Shanghai) 30 Sep '09

30 Sep '09

I have a templated class template<class U, class V, class W> class S { //... implementations }; and some stock type implementations for type U, V and W: typedef boost::mpl::vector<U0, U1> u_types; typedef boost::mpl::vector<V0, V1, V2, V3, V4> u_types; typedef boost::mpl::vector<W0, W1, W2, W3, W4> w_types; I want to test class S with all possible combinations of the template arguments, typedef boost::mpl::vector< S<U0,V0,W0>, S<U0,V0,W1>, // ... S<U1,V4,W4>, > s_types; like this: boost::mpl::for_each<s_types>(test_func). The only problem is there are 2*5*5 = 50 combinations that I do not wish to type in one by one. Is there a way to generate all the combinations with boost::mpl or Boost.Preprocessor? thanks.

2 1

Fix for intrusive on Sun CC
by Chris Hite 30 Sep '09

30 Sep '09

I'm not sure if it fixes everything, but I was able debug some of the meta-programming and find a discrepancy between gcc and Sun CC which causes normal usage to break. http://www.boost.org/doc/libs/1_39_0/boost/intrusive/detail/utilities.hpp template <class T> struct internal_base_hook_bool { template<bool Add> struct two_or_three {one _[2 + Add];}; template <class U> static one test(...); template <class U> static two_or_three<U::boost_intrusive_tags::is_base_hook> test (detail::bool_<U::boost_intrusive_tags::is_base_hook>* = 0); static const std::size_t value = sizeof(test<T>(0)); }; On gcc it does what it's suppose to; value = 1 - iff T has no boost_intrusive_tags::is_base_hook 2 - iff T::boost_intrusive_tags::is_base_hook=false 3 - iff T::boost_intrusive_tags::is_base_hook=true On Sun CC it's always 1. So this is a usage of SFINAE which doesn't seem to work on SunCC, but other examples do work just fine: class_has_move_assign here: http://www.boost.org/doc/libs/1_38_0/boost/unordered/detail/move.hpp Note how they use a second test(int) function. This works on Sun CC! 1) I've never submitted a change. Will someone else take this over or do I need to dive in and submit changes to the repository? Do I need to talk this library's owner first? 2) Is this a definite CC compiler bug?

3 3

[mpl] Can we generate this type in a simpler way?
by vicente.botet 30 Sep '09

30 Sep '09

Hi, I want to generate the following type R1::mth1_<T1, R3::mth1_<T3, C::mth1_> > > from mpl::vector<mpl::pair<R1, T1>, mpl::pair<R3, T3>, C and mth1_? I have started with this template <typename SequenceOfPairs, typename E, ??? MTH> struct generator { typedef ??? type; }; but I don't know what MTH'can be, because we have 3 different mth1_. So I have reached to make a specific mth1_generator (for the specific symbol 'mth1_') template <typename SequenceOfPairs, typename E> struct mth1_generator { typedef ??? type; // The details of the type are ommited using 'mth1' }; satisfying mth1_generate<mpl::vector<mpl::pair<R1, T1>, mpl::pair<R3, T3>, C>::type is equal to R1::mth1_<T1, R3::mth1_<T3, C::mth1_> > > ? As aal the mthX_generator follow the same structure, I have defined a macro DEFINE_GENERATOR which will define the specific generator for a symbol MTH #define DEFINE_GENERATOR(MTH) \ template <typename SequenceOfPairs, typename E> struct MTH##_generator { typedef ??? type; // The details of the type are ommited suing now MTH. } So the user will just have to do DEFINE_GENERATOR(mth1); Can I do it in a simpler way using some kind of traits or this is an inherent preprocessor problem? Thanks for clarifications, _____________________ Vicente Juan Botet Escribá

1 0

[Thread] Naming threads
by Kenneth Porter 30 Sep '09

30 Sep '09

Some platforms offer a way to name threads, for use in a debugger or in process information tools. It would be nice if Boost.Thread encapsulated this. Here's a page with links to methods for Windows, Linux, and BSD: http://stackoverflow.com/questions/778085/how-to-name-a-thread-in-linux

1 0

atomic_inc32 for fast integers
by Archie14 30 Sep '09

30 Sep '09

This boost::interprocess::detail function atomically increments fixed width integer returning old value. Questions: 1. Is there a version that uses fast integers defined in cstdint.hpp? 2. I don't think that it is safe to cast fixed width ints to fast ints. I did not find conversion functions/classes. Do they exists?

1 0

[Proto] Forwarding evaluation via tag
by Joel Falcou 30 Sep '09

30 Sep '09

I have the following grammar that handles the evaluation of various matrix classes: struct eval_xpr : bp::or_< bp::when< bp::terminal< block<bp::_,bp::_> > , _load(bp::_) > , bp::when< bp::plus< eval_xpr,eval_xpr > , bp::call< functor<bp::tag::plus>(eval_xpr(bp::_left ), eval_xpr(bp::_right) ) > > > {}; As you can see, the functor<T> class is a Callable object but not a primitive Transform so I use call to be able to forward the proper things to it. Currently I only play with + but I wanted to know how i can use proto::tag_of and a clever way to conserve the recursive look so it works for any operator of any tag. Basically what should I do to have : bp::when< bp::nary_expr< bp::_, bp::vararg< eval_xpr > > , bp::call< functor< ???? >( eval_xpr(????), ???, ??? ) > > to work for any tag and any number of parameters while typiong the less code possible. I *think* I should make a new Primitive Transform that extarct tags and arguments from bp::_expr and then perform the call to functor but doesn't this mean I have to explicitly write the code for 1,2,3 etc arguments ?

3 10

[Assign] Error using list_of() with Visual C++ 2010 Beta 1
by Paul Baker 30 Sep '09

30 Sep '09

In the Boost.Assign documentation, the following example of list_of() is given: const list<int> primes = list_of(2)(3)(5)(7)(11); However, I have tended to write this instead: const list<int> primes(list_of(2)(3)(5)(7)(11)); This is causing problems with the Microsoft Visual C++ 2010 Beta 1 compiler. Using Visual C++ 2008, both lines compile fine but with 2010 Beta 1, the second produces the following error: error C2668: 'std::list<_Ty>::list' : ambiguous call to overloaded function with [_Ty=int] could be 'std::list<_Ty>::list(std::list<_Ty> &&)' with [_Ty=int] or 'std::list<_Ty>::list(unsigned int)' with [_Ty=int] while trying to match the argument list '(boost::assign_detail::generic_list<T>)' with [T=int] Is this: a) My fault? Should I be using copy initialization rather than direct initialization? b) A problem with the 2010 beta compiler? or c) A problem with Boost.Assign? Thanks

3 3

Re: [Boost-users] request for help re:, brandes_betweenness_centrality for weighted graph
by Emily Greenfest-Allen 30 Sep '09

30 Sep '09

Thank you very much; I had a hunch it had something to do w/default parameters but was unsure how the library handled them. I appreciate the help, Emily Message: 3 Date: Tue, 29 Sep 2009 17:07:30 -0400 (EDT) From: Jeremiah Willcock <jewillco(a)osl.iu.edu> To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] request for help re: brandes_betweenness_centrality for weighted graph Message-ID: <alpine.OSX.1.10.0909291705020.77663(a)marvin.osl.iu.edu> Content-Type: TEXT/PLAIN; charset=US-ASCII; format=flowed On Tue, 29 Sep 2009, allenem(a)pcbi.upenn.edu wrote: > > Hi- > > > > I've just recently started to use the BGL and was wondering if someone could > > provide an example (and/or just let me know where I am going wrong) in trying > > to execute the brandes_betweenness_centrality algorithm for a weighted graph. > > Below are the relevant code snippets from my program. I am able to compile > > and run the code, and have successfully iterated over all elements (vertices, > > edges, and "interaction_weights" to verify that the data are stored > > correctly) but the calculated betweenness values are the same whether or not > > I use the edge weight map, which suggests that they are not being considered > > in the calculation even when passed as a parameter to the > > brandes_betweenness_centrality function. What am I missing? > The three-parameter version of brandes_betweenness_centrality has its third parameter as the (output) edge centrality map, not the weight map which you are trying to provide. Try using the named parameter version (as shown on <URL:http://www.boost.org/doc/libs/1_40_0/libs/graph/doc/betweenness_central…>). How to provide named parameters is described at <URL:http://www.boost.org/doc/libs/1_40_0/libs/graph/doc/bgl_named_params.ht…>. -- Jeremiah Willcock

1 0

[Boost Statechart] Execute Function
by Georg Gast 30 Sep '09

30 Sep '09

Hi, i try to build a easy statechart to learn and understand how to use boost::statechart. All i used until today was "homemade" statemachines. At some states i need a "Execute" function. In the FAQ i read, that therefore i should use a a thread and send there an event to the statemachine and process this event. So i wrote a timerclass which uses a thread to process an event via signals2. <code> ----------- timeout.h #ifndef __timeout_h__ #define __timeout_h__ #include <boost/thread.hpp> #include <boost/signals2.hpp> #include <boost/date_time/posix_time/posix_time.hpp> class Timeout { public: typedef boost::signals2::signal<void ()> signal_t; Timeout() : mp_thread(0) { lock lk(m_monitor); } ~Timeout() { lock lk(m_monitor); Terminate(); } boost::signals2::connection connect(const signal_t::slot_type &subscriber) { lock lk(m_monitor); return m_sig.connect(subscriber); } void Start(boost::posix_time::time_duration delta_time, bool repeat = false) { lock lk(m_monitor); if (mp_thread) { Terminate(); } m_repeat = repeat; m_delta_time = delta_time; mp_thread = new boost::thread( boost::bind( &Timeout::Execute, this)); } void Stop() { lock lk(m_monitor); if (mp_thread) { Terminate(); } } private: typedef boost::mutex::scoped_lock lock; void Execute() { try { do { boost::this_thread::sleep(m_delta_time); { lock lk(m_monitor); m_sig(); } } while (m_repeat); } catch(boost::thread_exception& /* e */) { // we got interrupted } } void Terminate() { if (mp_thread) { mp_thread->interrupt(); delete mp_thread; mp_thread = 0; } } signal_t m_sig; boost::thread* mp_thread; boost::mutex m_monitor; boost::posix_time::time_duration m_delta_time; bool m_repeat; }; ----------- main.cpp // SimpleBoostSCProblem // main.cpp #include "Timeout.h" #include <boost/statechart/event.hpp> #include <boost/statechart/transition.hpp> #include <boost/statechart/custom_reaction.hpp> #include <boost/statechart/state_machine.hpp> #include <boost/statechart/simple_state.hpp> #include <boost/statechart/state.hpp> #include <boost/mpl/list.hpp> namespace MyTest { namespace sc = boost::statechart; namespace mpl = boost::mpl; // Our objects struct Obj1 {}; // -------------------------------------------------- // Events // -------------------------------------------------- struct EvWork : sc::event< EvWork > {}; struct EvExit : sc::event< EvExit > {}; // -------------------------------------------------- // Forward deklaration of states // -------------------------------------------------- struct Active; struct DoStuff1; struct DoStuff2; struct Exit; // -------------------------------------------------- // Statemachine // -------------------------------------------------- struct TestMachine : sc::state_machine< TestMachine, Active > { TestMachine() { } ~TestMachine() { } }; // -------------------------------------------------- // States // -------------------------------------------------- // TestMachine / Active struct Active : sc::state<Active, TestMachine, mpl::list< DoStuff1 > > { typedef mpl::list< sc::transition< EvExit , Exit > > reactions; Active(my_context ctx) : my_base(ctx) { m_worker_connection = m_worker.connect(boost::bind(&Active::ProcessEvent<EvWork>, this)); } ~Active() { m_worker.Stop(); m_worker_connection.disconnect(); } template<typename ev> void ProcessEvent() { outermost_context().process_event(ev()); } Timeout m_worker; private: boost::signals2::connection m_worker_connection; }; // TestMachine / Active / DoStuff1 struct DoStuff1 : sc::state<DoStuff1, Active > { typedef mpl::list< sc::transition< EvWork, DoStuff2 > > reactions; DoStuff1(my_context ctx) : my_base(ctx) { // start work timeout : Repeat every 10 ms context< Active >().m_worker.Start(boost::posix_time::milliseconds(100)); } ~DoStuff1() { } }; // TestMachine / Active / DoStuff2 struct DoStuff2 : sc::state<DoStuff2, Active > { typedef mpl::list< sc::custom_reaction< EvWork > > reactions; DoStuff2(my_context ctx) : my_base(ctx) { // start work timeout : Repeat every 10 ms context< Active >().m_worker.Start(boost::posix_time::milliseconds(1),true); } ~DoStuff2() { } sc::result react( const EvWork & ) { // do stuff // .. // Nothing more to do with this event return discard_event(); } }; // TestMachine / Exit struct Exit : sc::state<Exit, TestMachine > { Exit(my_context ctx) : my_base(ctx) { } ~Exit() { } }; }; int main(int argc, char* argv[]) { MyTest::TestMachine machine; machine.initiate(); boost::this_thread::sleep(boost::posix_time::seconds(10)); machine.process_event(MyTest::EvExit()); return 0; } </code> It the statemachine exits, i get constantly crashes in the process_event<EvWork>() function, because the statemachine itself got destructed and outermost_context() is no more vaild, but the state which holds my timeout object (and the thread) did not yet got destructed and therefore the thread stopped. I dont have an idea to solve that problem. There is an assertion: "get_pointer( pOutermostUnstableState_ )==0" in state_machine.hpp. It does only happen if there was a transition from one state (DoStuff1) to DoState2. Thanks in advance! Georg Gast P.S.: My system: Windows XP / Visualstudio 2008 / Boost 1.40.0

2 1

Any complier can support lambda expression? Can any one with kindness help me?
by fmingu 30 Sep '09

30 Sep '09

I am using lambda expression under Dev-C++ for scientific computing. And the program run well. But the time consumed by the program is too much for data execution. I think this may be happened by the complier of Dev-C++(for compatibility). I am using C++ builder2009 for RAD. And this is said not suooprt Lambda expression. My computer is too limited for Visual C++ studio being installed ,which is supposed to support lambda expression. Can anyone with kindness tell me which complier can be used for lambda expression?

2 1

boost 1.40 build error with VC++ 2008
by Newsuser 30 Sep '09

30 Sep '09

Hi All, I encounter build error on Windows XP system when building with Visual Studio 2008 Profession (with Feature Pack, without SP1). Here is the trimmed output on my console window. Does someone know what is wrong here? I just run two commands "bootstrap.bat" and then ".\bjam" to build the library. Thanks a lot for your help. Setting environment for using Microsoft Visual Studio 2008 x86 tools. C:\>cd /d d:\opensource\boost_1_40_0 D:\opensource\boost_1_40_0>bootstrap.bat Building Boost.Jam build engine The system cannot find the file specified. Bootstrapping is done. To build, run: .\bjam D:\opensource\boost_1_40_0>.\bjam Building the Boost C++ Libraries. After the build, the headers will be located at D:\opensource\boost_1_40_0 The libraries will be located at D:\opensource\boost_1_40_0\stage\lib Use 'bjam install --prefix=<path>' if you wish to install headers and libraries to a different location and remove the source tree. warning: Building Boost.Regex with the optional Unicode/ICU support disabled. note: Please refer to the Boost.Regex documentation for more information note: this is a strictly optional feature. warning: Graph library does not contain optional GraphML reader. note: to enable GraphML support, set EXPAT_INCLUDE and EXPAT_LIBPATH to the note: directories containing the Expat headers and libraries, respectively. warning: Graph library does not contain MPI-based parallel components. note: to enable them, add "using mpi ;" to your user-config.jam warning: skipping optional Message Passing Interface (MPI) library. note: to enable MPI support, add "using mpi ;" to user-config.jam. note: to suppress this message, pass "--without-mpi" to bjam. note: otherwise, you can safely ignore this message. ...patience... ...patience... ...patience... ...found 6570 targets... ...updating 824 targets... common.mkdir stage ... common.mkdir bin.v2\libs\math\build\msvc-9.0\debug\link-static\threading-multi compile-c-c++-pch bin.v2\libs\math\build\msvc-9.0\debug\link-static\threading-multi\pch.pch cl : Command line error D8022 : cannot open 'bin.v2\libs\math\build\msvc-9.0\debug\link-static\threading-multi\pch.pch.rsp' call "C:\Program Files\Microsoft Visual Studio 9.0\VC\vcvarsall.bat" x86 >nul cl /Zm800 -nologo @"bin.v2\libs\math\build\msvc-9.0\debug\link-static\threading-multi\pch.pch.rsp" "bin.v2\libs\math\build\msvc-9.0\debug\link-static\threading-multi\pch.pch.cpp" ...failed compile-c-c++-pch bin.v2\libs\math\build\msvc-9.0\debug\link-static\threading-multi\pch.pch bin.v2\libs\math\build\msvc-9.0\debug\link-static\threading-multi\pch.obj... ...skipped <pbin.v2\libs\math\build\msvc-9.0\debug\link-static\threading-multi>ellint_1f.obj for lack of <pbin.v2\libs\math\build\msvc-9.0\debug\link-static\threading-multi>pch.pch... ...skipped <pstage\lib>libboost_math_tr1f-vc90-mt-gd-1_40.lib for lack of <pbin.v2\libs\math\build\msvc-9.0\debug\link-static\threading-multi>libboost_math_tr1f-vc90-mt-gd-1_40.lib... common.mkdir bin.v2\libs\math\config common.mkdir bin.v2\libs\math\config\msvc-9.0 common.mkdir bin.v2\libs\math\config\msvc-9.0\debug common.mkdir bin.v2\libs\math\config\msvc-9.0\debug\link-static common.mkdir bin.v2\libs\math\config\msvc-9.0\debug\link-static\threading-multi compile-c-c++ bin.v2\libs\math\config\msvc-9.0\debug\link-static\threading-multi\has_long_double_support.obj cl : Command line error D8022 : cannot open 'bin.v2\libs\math\config\msvc-9.0\debug\link-static\threading-multi\has_long_double_support.obj.rsp' call "C:\Program Files\Microsoft Visual Studio 9.0\VC\vcvarsall.bat" x86 >nul cl /Zm800 -nologo @"bin.v2\libs\math\config\msvc-9.0\debug\link-static\threading-multi\has_long_double_support.obj.rsp" ...failed compile-c-c++ bin.v2\libs\math\config\msvc-9.0\debug\link-static\threading-multi\has_long_double_support.obj... ...skipped <pbin.v2\libs\math\build\msvc-9.0\debug\link-static\threading-multi>assoc_laguerrel.obj for lack of <pbin.v2\libs\math\config\msvc-9.0\debug\link-static\threading-multi>has_long_double_support.obj... call "C:\Program Files\Microsoft Visual Studio 9.0\VC\vcvarsall.bat" x86 >nul cl /Zm800 -nologo @"bin.v2\libs\serialization\build\msvc-9.0\debug\link-static\threading-multi\extended_type_info.obj.rsp" ...failed compile-c-c++ bin.v2\libs\serialization\build\msvc-9.0\debug\link-static\threading-multi\extended_type_info.obj... ...interrupted compile-c-c++ bin.v2\libs\serialization\build\msvc-9.0\debug\link-static\threading-multi\extended_type_info_typeid.obj cl : Command line error D8022 : cannot open 'bin.v2\libs\serialization\build\msvc-9.0\debug\link-static\threading-multi\extended_type_info_typeid.obj.rsp' ...failed updating 55 targets... ...skipped 119 targets... ...updated 35 targets... D:\opensource\boost_1_40_0>

2 2

request for help re: brandes_betweenness_centrality for weighted graph
by allenem＠pcbi.upenn.edu 29 Sep '09

29 Sep '09

Hi- I've just recently started to use the BGL and was wondering if someone could provide an example (and/or just let me know where I am going wrong) in trying to execute the brandes_betweenness_centrality algorithm for a weighted graph. Below are the relevant code snippets from my program. I am able to compile and run the code, and have successfully iterated over all elements (vertices, edges, and "interaction_weights" to verify that the data are stored correctly) but the calculated betweenness values are the same whether or not I use the edge weight map, which suggests that they are not being considered in the calculation even when passed as a parameter to the brandes_betweenness_centrality function. What am I missing? Thank you, Emily #include <boost/graph/graph_traits.hpp> // iterator functions #include <boost/graph/adjacency_list.hpp> #include <boost/graph/betweenness_centrality.hpp> #include <map> #include <vector> using namespace std; using namespace boost; struct order_edges { template <typename T> bool operator() (const T& x, const T& y) const { return x.get_property() < y.get_property(); } }; /* ============================================================= Main ============================================================ */ int main(int argc, char **argv) { // Define the Graph typedef property < vertex_centrality_t, double > CentralityMap; typedef adjacency_list<vecS, vecS, bidirectionalS, CentralityMap> Graph; typedef graph_traits<Graph>::vertex_descriptor Vertex; typedef graph_traits<Graph>::edge_descriptor Edge; typedef map<Edge, double, order_edges> edge_weight_map_t; edge_weight_map_t base_map; associative_property_map<edge_weight_map_t> interaction_weight(base_map); Graph g; // instance of the graph // determine vertices based upon input from a file // add edges and assign values to associated interaction weights from a file .... brandes_betweenness_centrality(g, get(vertex_centrality,g), interaction_weight); }

2 1

how to concatenate program_options::parsed_options
by Caleb Cushing 29 Sep '09

29 Sep '09

this is a quick summation of the code I'm trying to build // get home directory parsed_options home = parse_environment(desc, "HOME"); // add the relative path to the home directory making it a full path parsed_options rcfile = home + "/.koramarc"; // parse the config file store(parse_config_file(rcfile, desc), vm); honestly all I need to do is parse a config that's in hidden file relative to the users home directory. so if there's a better way that'd work lete me know. -- Caleb Cushing http://xenoterracide.blogspot.com

1 0

[statechart] Passing parameters to state objects
by Robert Dailey 29 Sep '09

29 Sep '09

Hello, I was thinking of using Boost.Statechart as a state machine to manage widget states in my wxWidgets application. Depending on what menu options the user picks in my program, certain buttons on the main window will be enabled or disabled. I figured this would be a good opportunity to use Boost's state machine system. I would create states that would enable or disable certain buttons depending on what events I publish. For example, when the user chooses the "Edit Name" menu item, then buttons for editing a name would be enabled. This means I'd publish a EditNameEnabled event, or something, and then the EditNameMode state would become active, and its constructor would enable certain buttons. Of course, this means I'll need to be able to pass construction parameters to certain fsm state objects, and in the Statechart tutorial they only use default constructors. I'm not sure how I'd pass button object pointers to these state classes so they can work with them. I have two questions: First, does Boost.Statechart seem like the right tool for this job? If yes, then how can I pass parameters to state object constructors? Would I pass the parameters to the Event's constructor, and then somehow access that event instance from the state's constructor? Thanks in advance. --------- Robert Dailey

3 3

serialization of an dynamic array to read/write a image in xml
by Markus Bader 29 Sep '09

29 Sep '09

Hello I like to store and load images from a xml file. My problem is now the dynamic array which keeps the image data. I do not want to copy it into a container and I do not want to go in a for loop over every pixel. Any suggestions? Thanks Max #include <fstream> #include <boost/archive/xml_iarchive.hpp> #include <boost/archive/xml_oarchive.hpp> #include <boost/serialization/nvp.hpp> class Image { public: Image() : mWidth(0) , mHeight(0) , mpData(NULL) { } Image(int width, int height, char *pData) : mWidth(width) , mHeight(height) , mpData(pData) { } ~Image() { } template<class archive> void serialize(archive& ar, const unsigned int version) { int i; using boost::serialization::make_nvp; ar & make_nvp("width", mWidth); ar & make_nvp("height", mHeight); // ar & make_nvp("data", mpData, mWidth*mHeight); I know this can not work but --> is there something like this //** How can I serialize the serialization array without making a copy to a container **// } void save(const std::string& rFileName) { std::ofstream ofs(rFileName.c_str()); assert(ofs.good()); boost::archive::xml_oarchive xml(ofs); xml << boost::serialization::make_nvp("Image", this); } void load(const std::string& rFileName) { std::ifstream ifs(rFileName.c_str()); assert(ifs.good()); boost::archive::xml_iarchive xml(ifs); xml >> boost::serialization::make_nvp("Image", *this); } private: int mWidth; int mHeight; char *mpData; }; int main ( int argc, char** argv ) { int h = 640; int w = 480; char *p = new char[w*h]; Image img(w,h,p); img.save("/tmp/img.xml"); img.load("/tmp/img.xml"); delete p; return 0; }

5 7