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

Recent compilation troubles with gcc atomics
by tom fogal 02 May '09

02 May '09

Hello all, Recently I have noted more than one posting to this list with regards to compilation troubles on some platforms utilizing Gnu C++ or Intel's C++ compiler. Specifically, I am referring to linking errors with some of gcc's internal `atomics' functions, e.g. `__sync_fetch_and_add'. Some searching brings up: http://www.mail-archive.com/debian-bugs-closed@lists.debian.org/msg197119.h… http://www.nabble.com/Building-for-ARM926EJ-S-td16447579.html http://groups.google.com/group/boost-list/browse_thread/thread/8e757cc2788d… https://svn.boost.org/trac/boost/ticket/2525 http://www.nabble.com/issues-with-unit-tests-on-intel-32-bit,-gcc-4.3,-unde… I also happen to follow the libstdc++ mailing list, which has just seen an elucidating post by Joseph S. Myers: http://gcc.gnu.org/ml/gcc/2009-05/msg00039.html In it, he notes that the availability of these builtins is not solely a function of the compiler version. In particular, the platform (CPU, OS, runtime support) seems to be a factor, as well as the backend code generation options (i.e. -march gcc compiler option). He also suggests that the only reliable methodology for discovering the availability of these functions/builtins is by doing link-time tests. I mention as much because (unverified) I think boost's current solution is #ifdefs based on architecture and compiler version, which I think is fighting a losing battle. I hope this information is useful for those stuck on the problem, and/or boost developers. Cheers, -tom

1 0

[asio] async write handler is not called until the socket is not closed
by Roman Shmelev 02 May '09

02 May '09

Hi! I've got very strange problem - handler passed to async_write is not called in time. What I mean - it is called only when socket is closed - then handler is invoked many times. Sometimes it is so, sometimes everything is fine. The main thing is that traffic exists. I mean - async writes get completed. I call io_service.run() in proper time, etc. Another moment - the first two times the handler is invoked, but not more. As I guess, the problem is somewhere in my code. But I ask you to point to probable reasons of such behaviour that breaks asio rules..

2 7

[iterator] std::sort on zip_iterator
by Jeremiah Willcock 02 May '09

02 May '09

I would like to sort two separate vectors of numbers, treating corresponding elements of the two vectors as tuples and sorting the tuples. In particular, I am only comparing the first elements of the tuples; that may or may not be relevant to my problem. An example program is: #include <vector> #include <algorithm> #include <iostream> #include <boost/tuple/tuple.hpp> #include <boost/iterator/zip_iterator.hpp> struct compare_first_elements_in_tuples { template <typename Tuple> bool operator()(const Tuple& a, const Tuple& b) const { return (a.template get<0>()) < (b.template get<0>()); } }; int main(int, char**) { size_t a_data[5] = {0, 2, 1, 2, 4}; size_t b_data[5] = {1, 1, 5, 3, 7}; std::vector<size_t> a(a_data, a_data + 5); std::vector<size_t> b(b_data, b_data + 5); std::cout << "Before:"; for (size_t i = 0; i < a.size(); ++i) { std::cout << " (" << a[i] << ", " << b[i] << ")"; } std::cout << std::endl; typedef std::vector<size_t>::iterator vec_iter; typedef boost::zip_iterator<boost::tuple<vec_iter, vec_iter> > zip_iter; std::sort(zip_iter(boost::make_tuple(a.begin(), b.begin())), zip_iter(boost::make_tuple(a.end(), b.end())), compare_first_elements_in_tuples()); std::cout << "After:"; for (size_t i = 0; i < a.size(); ++i) { std::cout << " (" << a[i] << ", " << b[i] << ")"; } std::cout << std::endl; return 0; } On gcc 4.0.1, the sort operation results in the element (2, 1) (a pair of corresponding elements in a and b) being duplicated, while the element (1, 5) does not appear in the result at all: Before: (0, 1) (2, 1) (1, 5) (2, 3) (4, 7) After: (0, 1) (2, 1) (2, 1) (2, 3) (4, 7) I suspect the problem is related to the fact that zip_iterator does not return a "real" reference when dereferenced. Am I mistaken about this? Is the code above supposed to work? If not, is there an alternative way to sort one sequence while swapping elements in another in a corresponding way? I am not able to join the two input sequences into a single sequence of pairs because of other factors in the use case for this code. Thank you for your help. -- Jeremiah Willcock

1 0

General C++: Class Method Signatures Miss-Match
by Etienne Philip Pretorius 02 May '09

02 May '09

Hello list, I know this is not boost related, but I will appreciate it if anyone could shed some light on what is happening here? Compiler error: xml.cpp: In member function ‘xml::document& xml::document::parse(std::vector<unsigned char, std::allocator<unsigned char> >&)’: xml.cpp:25: error: no matching function for call to ‘xml::document::characters(std::basic_string<unsigned int, std::char_traits<unsigned int>, std::allocator<unsigned int> >)’ xml.hpp:24: note: candidates are: virtual void xml::document::characters(unicode::string) unicode::string definition starts: namespace unicode { typedef std::size_t code_point; class string : public std::basic_string<code_point> { Is "std::basic_string<unsigned int, std::char_traits<unsigned int>, std::allocator<unsigned int> >" not the same as "unicode::string"? If not why is it not? Etienne

7 15

[BGL] unordered_set<std::vector<edge_descriptor> >
by Johan Oudinet 02 May '09

02 May '09

Hi, I want to keep a set of paths, which are implemented as a vector of edge_descriptor. I don't care about the order. I just have to add paths and be able to know the number of different paths present in the set. So, I plan to use unordered_set but I'd like to know you opinion about a hash function, since AFAIK, unordered_set is like an hash_set? My main issue is to use as few memory as possible, because there will have a lot of paths in the set. Any idea? Thanks for your help. -- Johan

3 5

performance of dijkstra_shortest_paths
by Bhaskara Marthi 01 May '09

01 May '09

I recently ran into a situation where dijkstra_shortest_paths in the boost graph library was running very slowly. When I replaced the call to dijkstra_shortest_paths with the code below, things were a couple of orders magnitude faster. Any idea why? - Bhaskara Version 1: with dijkstra_shortest_paths ReachableCostVector GridGraph::singleSourceCosts (const Cell2D& source, const vector<Cell2D>& dests) { GridDistances distances; GridGraphVertex start = cellVertex(source); resetIndices(); typedef map<GridGraphVertex, GridGraphVertex> GridPreds; GridPreds predecessors; boost::dijkstra_shortest_paths (graph_, start, weight_map(get(&EdgeCost::cost, graph_)). vertex_index_map(get(&CellInfo::index, graph_)). distance_map(associative_property_map<GridDistances>(distances)). predecessor_map(associative_property_map<GridPreds>(predecessors)). // to avoid warnings visitor(GraphSearchVisitor())); ReachableCostVector v(dests.size()); transform (dests.begin(), dests.end(), v.begin(), bind(extractCost, this, distances, _1)); return v; } Version 2: without dijkstra_shortest_paths // Approximation to Dijkstra ReachableCostVector GridGraph::singleSourceCosts (const Cell2D& source, const vector<Cell2D>& dests) { GridDistances distances; GridGraphVertex start = cellVertex(source); typedef pair<GridGraphVertex, double> QueueItem; queue<QueueItem> q; set<GridGraphVertex> visited; q.push(QueueItem(start,0.0)); visited.insert(start); while (!q.empty()) { GridGraphVertex v; double d; tie(v,d) = q.front(); q.pop(); GridGraphAdjacencyIterator iter, end; for (tie(iter,end)=adjacent_vertices(v, graph_); iter!=end; iter++) { if (visited.find(*iter)==visited.end()) { double cost = d+graph_[edge(v,*iter,graph_).first].cost; q.push(QueueItem(*iter, cost)); visited.insert(*iter); distances[*iter] = cost; } } } ReachableCostVector costs; for (vector<Cell2D>::const_iterator iter=dests.begin(); iter!=dests.end(); ++iter) { GridDistances::iterator pos = distances.find(cellVertex(*iter)); if (pos==distances.end()) costs.push_back(ReachableCost(false,-42.0)); else costs.push_back(ReachableCost(true, pos->second)); } return costs; }

4 7

New declaration ambiguates old declaration mutant.hpp
by Celine.Murphy＠barclayscapital.com 01 May '09

01 May '09

/ThirdParty/include/boost-1.38.0/boost-1_38/boost/bimap/relation/detail/ mutant.hpp:68: new declaration `template<class View, class Type> boost::enable_if<boost::is_const<Reference>, const View&>::type boost::bimaps::relation::detail::mutate(Type&)' /ThirdParty/include/boost-1.38.0/boost-1_38/boost/bimap/relation/detail/ mutant.hpp:55: ambiguates old declaration `template<class View, class Type> boost::enable_if<boost::mpl::not_<boost::is_const<Reference> >, View&>::type boost::bimaps::relation::detail::mutate(Type&)' Hi, I am getting the above error when I try to compile a class that includes boost/bimap.hpp. It happens at the include stage. Has anyone seen this before? Gcc 3.2.3, boost 1.38. Thanks Celine _______________________________________________ This e-mail may contain information that is confidential, privileged or otherwise protected from disclosure. If you are not an intended recipient of this e-mail, do not duplicate or redistribute it by any means. Please delete it and any attachments and notify the sender that you have received it in error. Unless specifically indicated, this e-mail is not an offer to buy or sell or a solicitation to buy or sell any securities, investment products or other financial product or service, an official confirmation of any transaction, or an official statement of Barclays. Any views or opinions presented are solely those of the author and do not necessarily represent those of Barclays. This e-mail is subject to terms available at the following link: www.barcap.com/emaildisclaimer. By messaging with Barclays you consent to the foregoing. Barclays Capital is the investment banking division of Barclays Bank PLC, a company registered in England (number 1026167) with its registered office at 1 Churchill Place, London, E14 5HP. This email may relate to or be sent from other members of the Barclays Group. _______________________________________________

2 2

boost::posix_time::from_time_t bug ???
by Łukasz Majewski 01 May '09

01 May '09

Hello, i think that i've found bug in date time library or maybe i made something wrog. SAMPLE CODE: #include <boost/date_time/posix_time/posix_time.hpp> #include <iostream> using namespace boost::posix_time; int main( int argc, char** argv ) { time_t t = time( 0 ); std::cout << "time_t: " << ctime( &t ) << std::endl; struct tm* t2 = localtime( &t ); std::cout << "struct tm: " << asctime( t2 ) << std::endl; ptime t3 = from_time_t( t ); std::cout << "ptime from time_t: " << to_simple_string( t3 ) << std::endl; ptime t4 = ptime_from_tm( *t2 ); std::cout << "ptime from tm: " << to_simple_string( t4 ) << std::endl; return 0; } OUTPUT: time_t: Fri May 1 14:22:01 2009 struct tm: Fri May 1 14:22:01 2009 ptime from time_t: 2009-May-01 12:22:01 // incorrect result ptime from tm: 2009-May-01 14:22:01

2 2

[boost-users][StateChart] polymorphic_downcast failure
by Igor R 01 May '09

01 May '09

Hi, The above failure occurs in reaction_dispatcher::derived_with_action::react(). IIUC, state_machine tries to invoke in_state_reaction that's defined for an event, which is unrelated to the one being processed. What logical error in my state-machine might cause such a problem? Unfortunately, I don't have any self-contained code at the moment, so please treat my question as theoretical :). Thanks.

2 6

[boost-users][python]
by Germán Diago 01 May '09

01 May '09

I have a question about managing python objects. I have a base class implemented in c++, which I use in python. >From python I inherit that class. And the I try to use the python instance from c++, like this. //This class has a function which is registered in python. I want to //be able to register python instances with this class class AnotherClass { void registerobject(const std::string & name, MyBaseClass * a) { v.push_back(a); } }; //Interface class, which I inherit in python class MyBaseClass { virtual const std::string getData(Object * o) const = 0; }; >From python: class MyPyClass(MyBaseClass): def __init__(self): MyBaseClass.__init__(self) def getData(self, o): return "hello" My question is. In order to register that class, namely, MyPyClass(which is a python class): can I do it through registerobject? Or should I implement something like this?: class AnotherClass { void registerobject(const std::string & name, python::object & o) { MyBaseClass * m = extract<MyBaseClass>(o); v.push_back(m); } }; In all two cases I get error_already_set exception when I try to execute the registerobject function and don't know why.

1 1

[statechart] Asynch statechart in dll
by Bill Clark 01 May '09

01 May '09

I have modified the Pingpong sample (an asynchronous statechart) so that the statechart itself is in a dll, with the calling code (in PingPong.cpp) in an exe. This is using VS2005 sp1. I have used a macro in the usual way to mark the Player class as exported. The app builds and runs, but it seems that events don't get acted on. We hit Player's initiate_impl(), and we get to state_machine::process_event() with a BallReturned event passed in, but we never hit the handler for that event (Waiting::react(const BallReturned&)). Is this something that should work? Is it necessary to do something more than just export the necessary classes from the dll? Thanks, Bill **

2 4

Overloading errors
by A B 01 May '09

01 May '09

Does anyone know why the following sample fails (it was adapted from the boost overloading example) and how to do this correctly. Thanks in advance. #include <boost/python/module.hpp> #include <boost/python/def.hpp> #include <boost/python/args.hpp> #include <boost/python/tuple.hpp> #include <boost/python/class.hpp> #include <boost/python/overloads.hpp> #include <boost/python/return_internal_reference.hpp> using namespace boost::python; struct X { int f(int x, double y = 4.25, char const* z = "wow") { return x; } int f(int x, bool b = true) { return x; } }; BOOST_PYTHON_MEMBER_FUNCTION_OVERLOADS(f_member_overloads, X::f, 1, 3) BOOST_PYTHON_MODULE(args_ext) { class_<X>("X", "This is X's docstring") .def("f1", &X::f, f_member_overloads(args("x", "y", "z"), "f's docstring" )[return_internal_reference<>()] ) ; } g++ -fpic -shared -o test.so test.cpp -lpython2.4 -lboost_python -I/usr/include/python2.4 test.cpp: In function ‘void init_module_args_ext()’: test.cpp:31: error: no matching function for call to ‘boost::python::class_<X, boost::python::detail::not_specified, boost::python::detail::not_specified, boost::python::detail::not_specified>::def(const char [3], <unresolved overloaded function type>, boost::python::detail::overloads_proxy<boost::python::return_internal_reference<1ul, boost::python::default_call_policies>, f_member_overloads>)’

2 2

Boost.Date_Time building for Windows CE
by Tory Bjorklund 01 May '09

01 May '09

Hello, My application builds fine when using Boost.Date_Time with win32 but when building with a configuration for Windows CE I get the following errors: boost/date_time/c_time.hpp(83) : error C2039: 'localtime' : is not a member of 'std' boost/date_time/c_time.hpp(83) : error C2660: 'boost::date_time::c_time::localtime' : function does not take 1 arguments boost/date_time/c_time.hpp(92) : error C2039: 'gmtime' : is not a member of 'std' boost/date_time/c_time.hpp(92) : error C2660: 'boost::date_time::c_time::gmtime' : function does not take 1 arguments boost/date_time/gregorian/gregorian_io.hpp(12) : fatal error C1083: Cannot open include file: 'locale': No such file or directory Does anyone know how I may be able to build an app for CE that includes the Date_Time library? Thanks, Tory

1 0

Boost.MultiIndex question on merge
by arm2arm 01 May '09

01 May '09

Hello, Are there way to merge two multiindex objects ? suppouse we have : struct strData{ int id; float a, b; strData(int id_, float a_, float b_):a(a_),b(b_),id(id_){} }; typedef multi_index_container< strData, indexed_by< ordered_unique< tag<id>, BOOST_MULTI_INDEX_MEMBER(strData,int,id)>, ordered_non_unique< tag<snap>,BOOST_MULTI_INDEX_MEMBER(strData,float,a)> > > data_setA, data_setB; Are there way to do: data_setA.merge(data_setB) ? thank you beforehand. Arman. -- View this message in context: http://www.nabble.com/Boost.MultiIndex-question-on-merge-tp23277496p2327749… Sent from the Boost - Users mailing list archive at Nabble.com.

5 11

boost coroutine status
by Robert Ramey 30 Apr '09

30 Apr '09

This package has been in the vault or some time. At least one well known person on this list has indicated that the quality is good and that he is using it in production code. Turns out that I now have a need of this facility but I've got a couple of problems. a) When I try and build it, I get ConvertFiberToThread which looks to me that there is some bjam magic missing. b) I would like to look the documentation. But that's hard to do as it's in quick book files and I don't have a quick book reader. I don't know that I have the ability to generate html files from quickbook. Maybe I do, but I can't really figure this out. c) I don't think that this package has ever been reviews nor do I see it scheduled for review. What is the status of this library. Anyone having information on this topic is encouraged to bring me up to date. Robert Ramey

5 13

[lexical_cast] float-to-string rounding error (not found with cout)
by Grant Birchmeier 30 Apr '09

30 Apr '09

I'm seeing unexpected behavior when using lexical_cast<string>. This code: const float f = 00123.12300; cout << f << endl; cout << boost::lexical_cast<std::string>(f) << endl; gives the result: 123.123 123.123001 Two questions: (1) Is there a way to eliminate this trailing '1' with lexical_cast (presumably some wierd rounding error)? (2) When casting float-to-string, given this behavior, why should I use lexical_cast instead of, say, stringstream? Thanks -Grant

4 5

Default argument values with boost::function
by Artyom 30 Apr '09

30 Apr '09

Hi, Is there any way to set default argument values with Boost::Function? On VS2008 SP1 I tried: boost::function< void( unsigned i = 1 ) > increment; But this didn't work. Code such as increment( 1 ); compiles OK but if you try doing increment(); the following compiler error is triggered: error C2064: term does not evaluate to a function taking 0 arguments class does not define an 'operator()' or a user defined conversion operator to a pointer-to-function or reference-to-function that takes appropriate number of arguments Thanks, Artyom

5 4

[boost-users][python] Pointer argument failed conversion?
by Germán Diago 30 Apr '09

30 Apr '09

Hello. After much googling I didn't find anything useful. My problem is: I have a virtual function like this class MyClass { void monitor(Object * o); } I have wrapped another class, which inherits from Object: class Character : public Object {...}; which is also exposed to python. I register my virtual function as the documentation says I have to do: class_<MyClass, boost::noncopyable>("MyClass"). def("monitor", &MyClass::monitor); When I try to call it from python, I get the following error: a = MyClass() b = Character(....) a.monitor(b) MyClass.monitor(MyClass, Character) did not match C++ signature: monitorizar(MyClass {lvalue}, Object *) Shouldn't my Character be automatically converted to Object * and then to make a successful call to the function? Should I do anything special to use pointers as parameters of my functions? I don't know why it tries to pass a "Character". What I want is to get it converted to Object *. Thanks in advance.

2 1

Program options required arguments?
by David Doria 30 Apr '09

30 Apr '09

If I have a list of 10 parameters, and all are required, I end up with a giant block of these: if(!vm.count("input")) { std::cout << "Input was not set." << std::endl; exit(-1); } Is there a way to do something like: desc.add_options() ("input", po::value<std::string>(&InputFile)->required(), "Set input file.") That will perform that check for me? Thanks, David

2 1

[interprocess]message_queue multi-client
by Laurence Chambenois 30 Apr '09

30 Apr '09

Hi, I need to communicate from x clients processes to one server process. I want to use the message_queue to send messages from the clients to the server, and when the server is done, it sends back its answer to the client. Do you have any examples ? with one bidirectionnal message_queue, or do I have to create a message_queue for each "direction" ? How can I deal with one message_queue and multiple process so that the request sent to one process is read by the good process ? Thanks for your help Laurence

1 0

Boost (1.38) on Intel Compiler (11.0)
by Jared White 30 Apr '09

30 Apr '09

Hey there, Was curious if someone can answer for me, does Boost support the intel compiler? I seem to be having some trouble linking to the libraries that are created when I "bjam" on Mac OSX using the Intel compiler. It builds the libraries as you would expect, and a whole bunch of them get dropped into the "lib" folder. In VC++, I give the linker this path, and it finds the libs, just fine. However, When I compile my application (with XCode), it can't find the libs. It would appear that the <boost/auto_link.hpp> is configuring the lib name to have a toolset of "iw" and not "il", as expected for Mac OS X. Any help is appreciated, -Jared

2 1

German Boost book updated
by Boris Schaeling 30 Apr '09

30 Apr '09

For those who know German: I've added five more chapters to my Boost book at http://www.highscore.de/cpp/boost/. There are now altogether 16 chapters covering 29 Boost libraries. The book does not try to replace the documentation but is written in a tutorial style to give developers a kick start. It explains what the numerous libraries are good for and how they are used without going too much into detail. Any feedback is, as always, appreciated! Boris

3 2

Multi Index: Nested std::pair
by Etienne Philip Pretorius 30 Apr '09

30 Apr '09

Hello List, I would greatly appreciate if someone could assist me in getting this structure correct. boost::multi_index_container< std::list< std::pair< /*value*/ unsigned char, std::pair< /*x co-ordinate*/ unsigned char, /*y co-ordinate*/ unsigned char > > >, boost::multi_index::indexed_by< /*value*/ boost::multi_index::ordered_non_unique< boost::multi_index::identity<unsigned char> >, /*x co-ordinate*/ boost::multi_index::ordered_non_unique< boost::multi_index::identity<unsigned char> >, /*y co-ordinate*/ boost::multi_index::ordered_non_unique< boost::multi_index::identity<unsigned char> > > > m; I do not see how "boost::multi_index::ordered_non_unique" will index the appropriate field in the nested std::pair structures. This is why I suspect there to be a problem with this structure. So before I continue, could someone please tell me if I am on the correct path. Grateful, Etienne

7 24

[Serialization] Getting crash in serialization library specific to Linux and 1.37
by Reusser, Edward 29 Apr '09

29 Apr '09

I created several DLL's that save and restore data using the serialization library. These libraries can be used on both the Windows and Linux and have been quite reliable since they were first created using the 1.34 boost release. The purpose of these libraries is to read and write serialized versions of our projects. We are using both XML and Text archives. The problem I am now looking at is in reading a Text archive. We recently upgraded to boost release 1.37. On Windows we are still using the 7.1 compiler, while on Linux we are using the gcc 3.2 compiler. We had previoously upgraded compilers without any problems, so its not a compiler upgrade issue. Upon upgrading to boost release 1.37, everything has continued to work just fine on Windows. However in the Linux builds, any designs written with the older 1.34 boost release now cause segmentation faults when being read with the more recent build. I have attached a stack trace. To complicate this picture, I can take a project written using the older 1.34 release on Linux, read it in Windows, then write it using Windows, then read it just fine in the new Linux build. Any ideas? Edward Reusser Principal Engineer Actel Corporation (650) 318-4972 The information contained in or attached to this email may be subject to the Export Administration Regulations (EAR), administered by the U.S. Department of Commerce, or the International Traffic in Arms Regulations (ITAR), administered by the U.S. Department of State, and may require an export license from the Commerce or State Department prior to its export. An export can include a release or disclosure to a foreign national inside or outside the United States. Include this notice with any reproduced portion of this information.

1 0

Cannot find -lboost_thhread with upgrade from 1.35 to 1.37
by Johan Mazel 29 Apr '09

29 Apr '09

Hi I just upgraded my OS from Ubuntu 8.10 to 9.04 and Boost upgraded at the same time from 1.35 to 1.37. I get some errors linked to the compilation command with g++ : /usr/bin/ld: cannot find -lboost_thread /usr/bin/ld: cannot find -lboost_filesystem These compilation options were working with the 1.35 version of Boost. I'd like to know wether there has been a change in Boost concerning the compilation options or if anything else have changed that would cause that problem. Thanks in advance for the answers. Johan Mazel

4 6

building on mips
by Max Suraev 29 Apr '09

29 Apr '09

Hello. Could you please help me with bug #2972: https://svn.boost.org/trac/boost/ticket/2972 I'm trying to compile boost trunk on mips with cmake but got error described in this ticket. Have someone tried to cross-compile boost for mips? Any ideas will be welcomed - I'm afraid that I'm missing something obvious here. best regards, Max.

1 0

[GIL] How can I copy a subimage_view to a view?
by blp330 29 Apr '09

29 Apr '09

Hi, I wrapped boost::gil::rgb8_image_t::view_t as a simple class Image: class Image { public: // ... some methods here. private: boost::gil::rgb8_image_t::view_t view; }; And I have a method Crop, which is crop image to other image object, like this: void Image::Crop(int x, int y, int width, int height, Image& out) const { boost::gil::rgb8_image_t s(width, height); boost::gil::copy_pixels( boost::gil::subimage_view(view, x, y, width, height), boost::gil::view(s)); out.view = boost::gil::view(s); } I will get error after I run this code... But I can't understand what's wrong. So, how can I implement this? Thank you very much. -- View this message in context: http://www.nabble.com/-GIL--How-can-I-copy-a-subimage_view-to-a-view--tp232… Sent from the Boost - Users mailing list archive at Nabble.com.

2 15

Another BGL question
by Lindley M French 28 Apr '09

28 Apr '09

Here's my problem. I've got a very large graph (say a few thousand nodes). This graph is planar, although that doesn't really affect much. Small clusters of vertices are grouped into "regions". The edges within a region are marked as "on", and those between regions are marked as "off". I need to be able to pull all vertices from a region and some or all of its neighboring regions, as well as all induced edges, into a local graph that I do work on. At first I thought of using the subgraph function together with copy_graph, but the subgraph interface is pretty unintuitive, so I'm avoiding it for now. I have a mechanism to iterate over all the vertices in a region, but not the edges. How can I get an iterator to the edges around a given vertex or set of vertices? adjacency_iterator isn't the right tool. Is there an exhaustive list of all iterators available in BGL somewhere?

2 1

[BOOST THREAD] Threads Spawning Unexpectedly
by Terrimane Pritchett 28 Apr '09

28 Apr '09

Hello, I have taken interest in using Boost Threads in my project. I have a strange issue that I am trying to debug. I spawn N boost::thread instances because I know exactly how many I need. My program crashes after a time on a boost::bad_lexical_cast exception. I have placed a wrapper around boost::lexical_cast which uses a boost::recursive_mutex and boost::lock_guard combination to prevent multiple threads from calling boost::lexical_cast at the same time. Still, my project invariably chokes on boost::bad_lexical_cast being thrown when I can verify the cast should work i.e. everything works as expected in my single threaded implementation. My real cause for alarm is this....when I act to debug my project I always discover there are more active boost::thread instances than I have explicitly created. I only create boost::thread instances in one location. I have perused the documentation but as of yet cannot find an explanation for this behavior. My assumption is that unless I explicitly instantiate a boost::thread it should not exist. However, I want to ask if this is indeed the case? If not, how so and what is the rationale behind this behavior? Here is what my code more or less looks like - this is all I do with boost::threads currently - how are more than N boost::threads spawning where N is the number of elements in an arbitrary stl container which itself is not allowed to change in size? typedef boost::shared_ptr<boost::thread> THREADHANDLE; typedef std::vector<THREADHANDLE> THREADHANDLECONTAINER; THREADHANDLECONTAINER workerThreads; workerThreads.reserve(some_container.size()); ... workerThreads.push_back( THREADHANDLE(new THREADHANDLE::element_type( Callable, arg1, boost::ref(arg2)); ... BOOST_FOREACH(const THREADHANDLE &workerThread,workerThreads) { workerThread->join(); }//end loop ------------------------------------------ Here is my attempt at using boost::lexical_cast in a generic thread safe manner. I am expecting exactly one thread my call boost::lexical_cast at a time with this wrapper yet my application blows up solely on boost::bad_lexical_cast whenever I introduce Boost Threads. Am I missing the elephant in the room somehow? //LexicalCaster.h #include <boost/thread.hpp> struct LexicalCaster { template<typename TargetType,typename SourceType> inline static TargetType LexicalCast(const SourceType &source); private: static boost::recursive_mutex& GetMutex(); static int& GetCount(); }; //LexicalCaster.cpp #include "LexicalCast.h" boost::recursive_mutex _mtx; int count(0); //here for debugging purposes boost::recursive_mutex& LexicalCaster::GetMutex() { return _mtx; } int& LexicalCaster::GetCount() { return count; } //LexicalCaster.inl #include <boost/lexical_cast.hpp> template<typename TargetType,typename SourceType> TargetType LexicalCaster::LexicalCast(const SourceType &source) { boost::lock_guard<boost::recursive_mutex> guardian(LexicalCaster::GetMutex()); std::cerr<<"Count: "<<LexicalCaster::GetCount()++<<std::endl; //the count will display sequentially if only //one thread of execution has access at a time return boost::lexical_cast<TargetType>(source);

4 12

Re: [Boost-users] Serialization problem with DLL & EXE
by Andrei Popa 28 Apr '09

28 Apr '09

Hi Robert, With a class derived from DbObject and defined/implemented in my EXE (that use the DLL) I got archive_exception::unregistered_class. I tried to register it or to export it, but I could not make it work. *** So you put BOOST_CLASS_EXPORT(DbObject) in to a *.cpp file which is compiled as part of the exe? Yes, I do. Any Ideas? I use Version 1.38 of the library & VC8(2005). When I use BOOST_CLASS_TYPE_INFO(as in test_no_rtti.cpp sample ) for my EXE resident class, the ::get_key is never called. // get the eti record for the exported type "polymorphic_derived2" boost::serialization::extended_type_info const * const d2_eti = boost::serialization::extended_type_info::find( "polymorphic_derived2" ); works too before I start to serialize the collection. *** is this an attempt the issure raised above or is this a separate question. No separate question at all, this is the way I tried figure out if my class is really (and correctly) registered. Is this a correct way to test? How can I debug what's wrong? Thanks Andrei. _________________________________________________________________ News, entertainment and everything you care about at Live.com. Get it now! http://www.live.com/getstarted.aspx

2 1

Serialization problem with DLL & EXE
by Andrei Popa 28 Apr '09

28 Apr '09

Hi there, I have a dll that contain an abstract base class called DbObject and a DbDatabase class that contains a collection of shared_ptr<DbObject> . It dose work as long all derived classes are defined in the same dll. With a class derived from DbObject and defined/implemented in my EXE (that use the DLL) I got archive_exception::unregistered_class. I tried to register it or to export it, but I could not make it work. Any Ideas? I use Version 1.38 of the library & VC8(2005). When I use BOOST_CLASS_TYPE_INFO(as in test_no_rtti.cpp sample ) for my EXE resident class, the ::get_key is never called. // get the eti record for the exported type "polymorphic_derived2" boost::serialization::extended_type_info const * const d2_eti = boost::serialization::extended_type_info::find( "polymorphic_derived2" ); works too before I start to serialize the collection. Thanks, Andrei _________________________________________________________________ Show them the way! Add maps and directions to your party invites. http://www.microsoft.com/windows/windowslive/products/events.aspx

2 1

po::program_options
by Zarkvon 28 Apr '09

28 Apr '09

Hello, During using library 'program_options' we noticed some issues. The first one is that class 'duplicate_option_error' never uses. /** Class thrown when duplicate option description is found. */ class BOOST_PROGRAM_OPTIONS_DECL duplicate_option_error : public error { public: duplicate_option_error(const std::string& what) : error(what) {} }; And the second one which is critical for us. Is that all errors are forming as one sentence in ENGLISH. And it's an issue to get which exception exactly occured to form your own message in your desired language. For instance class - validation_error. I guess it's really hard and inconvinient to get what message should be thrown. So, what will you advise to do to make this library more "international", so all exception messages are put out in any language which programmer wants.

1 0

Boost Graph Library mysterious compile errors
by Lindley M French 28 Apr '09

28 Apr '09

Follow-up: It appears to be related to the edge_weight property. Judging by the documentation I was under the impression that this was a default property that all edges would have. Is this not the case? How would I add it? I already tried putting a "double edge_weight" field in my EdgeProperties struct, didn't help.

2 1

[graph] ColorMap
by liquid 28 Apr '09

28 Apr '09

Please, help me to declare correctly the ColorMap as the 3-rd parameter of depth_first_search function. Documentation does not explain it clearly. Regards liquid

2 1

Boost & Continuous Integration
by Robert Dailey 28 Apr '09

28 Apr '09

Hey guys, One of the requirements for a continuous integration process is that the build for a specific target be quick. Something under 10 minutes is ideal. I find that when not using precompiled headers, boost can significantly impact the compilation time of the project. I've experienced 20 minute compiles when using boost fairly extensively throughout the code base. So far I only see two obvious solutions to this problem. First, use precompiled headers. I really don't want to do this because it causes issues with include dependencies and makes the code not reusable as a result. The second option is to beef up the machines doing the compiles, however this can have diminishing returns. I am sure that a lot of people in the community have had this specific issue with Boost's compile times, as well as in many other areas. What would you guys recommend? Is there any other solution beyond the obvious? Thanks for your time.

9 12

Boost Graph Library mysterious compile errors
by Lindley M French 28 Apr '09

28 Apr '09

I'm getting some mysterious compile errors relating to boost::detail::error_property_not_found. Truely massive errors, well too large to get any useful information out of.....ah, templates. I eventually figured out that these sorts of errors are usually related to BGL algorithm calls which can't find the properties they need. (Wow, thanks for pointing me right at the source, template error...) Well, the only algorithms I'm calling right now are connected_component and kruskal_minimum_spanning_tree. One such instance occurs with a particular connected_component call: typedef boost::adjacency_list< boost::listS, boost::vecS, boost::undirectedS, RegionProperties, EdgeProperties> Graph; template <typename Graph> struct edge_on { edge_on(): m_G(NULL) { } edge_on(const Graph &G) : m_G(&G) { } template <typename Edge> bool operator()(const Edge& e) const { return (*m_G)[e].on; } const Graph *m_G; }; ... //function arg ....(Graph &G,... filtered_graph<Graph, edge_on<Graph> > G_on_edges(G, edge_on<Graph>(G)); std::vector<int> component(num_vertices(G_on_edges)); int num_comps = connected_components(G_on_edges, &component[0]); Do you see anything wrong there? The kruskel call (which is producing more such errors) is Graph comp_G; .... vector<Edge> mstedges; mstedges.reserve(num_vertices(comp_G)); kruskal_minimum_spanning_tree(comp_G,std::back_inserter(mstedges)); I really have no idea what might be wrong here.

1 0

filtered_graph question
by Lindley M French 28 Apr '09

28 Apr '09

If I construct a filtered_graph on some underlying graph, and then (either through it or via another interface) modify the underlying graph to change which edges make it through the filter....when is this change reflected? Do I have to construct another filtered_graph? Or is it immediate? Will it invalidate iterators or anything like that? I'm just trying to get my head around the conceptual workings here.

1 0

Use of Boost [threadpool] library w/ Windows Service Process
by Art Beall 27 Apr '09

27 Apr '09

Hello, Our application was in need of a thread pool for processing socket messages. During implementation and testing we were using the [threadpool] library along with Boost v36. We are using Visual Studio 2003 for building our application. Our target systems are running Windows Server 2003 or Windows XP Pro. The windows console version of our application runs great. No problems with thread pooling. However, once we use it inside a windows service, the application fails to load. No code is actually executed. After doing a lot of research into the problem, I narrowed it down to the inclusion of the threadpool object into the code. One caveat with using the application as a windows service, the main project is compiled /clr (managed code). However, I've placed all code that refers to boost in a separate library compiled as unmanaged code. This library is linked with both the console application (working), and the service application (won't load). Does anyone have any ideas what would cause this ? Thanks! Art Beall

1 0

[Fwd: io_service::strand - order of execution guarantees]
by Chris Hite 27 Apr '09

27 Apr '09

Can someone give me a guarantee about the order in which operations dispatched./posted to a strand are executed? Obviously if two different threads call post() or dispatch(), there is a race condition. However if one thread calls dispatch() twice, can it be sure that the first handler executes before the second? What happens if post() and dispatch() are mixed? Looking at the library it appears that a posted handler causes any subsequent dispatches to act exactly as posts. It appears as though a strong guarantee is being made: All handlers posted or dispatched will execute in order. If such a useful guarantee is required internally by asio, it should be made public and be documented. Christopher Hite RTS Realtime Systems Software GmbH, Rembrandtstrasse 13, D-60596 Frankfurt am Main T: +49.69.61009.0 / F: +49.69.61009.181 Sitz: Frankfurt am Main - HRB 84467 Amtsgericht Frankfurt am Main Geschäftsführer: Steffen Gemuenden, Igor Sluga www.rtsgroup.net This email and any attachments are for the exclusive and confidential use of the intended recipient. If you are not the intended recipient, or an employee or agent responsible for delivering this message to the intended recipient, please do not read, distribute or take action in reliance upon this message. If you have received this in error, please notify me immediately by return email and promptly delete this message and its attachments from your computer system.

1 0

[lambda] Return types in lambda expressions
by Michael Crawford 27 Apr '09

27 Apr '09

I'm trying to use bind and lambda to create a functor that can receive an event generated by my GUI library, and dispatch an appropriate event into a boost::statechart::state_machine. The GUI library requires the functor to have the signature bool (const CEGUI::EventArgs&). An example of what works: template<typename EventType> bool GuiEvent(const CEGUI::EventArgs&, GameStateMachine& gsm) { gsm.process_event(EventType( )); return true; } //usage: GameStateMachine sm; ... boost::bind(&GuiEvent<EventExitGame>, _1, boost::ref(sm)); But is it possible to use lambda to eliminate the need for the function? It looks like I would use something along the lines of boost::bind<bool>(boost::ref(sm).process_event(EventExitGame( )) /*somehow return true here*/, _1); I'm just not quite seeing how I would get the lambda expression to return true there. Cheers.

2 1

Re: [Boost-users] undefined reference to `__sync_fetch_and_add_4'
by Birju Prajapati 27 Apr '09

27 Apr '09

I figured it out. It was an obscure, seemingly undocumented option to bjam: instruction-set=i686 i.e bjam architecture=x86 address-model=32 instruction-set=i686 --stagedir=stage32 --with-filesystem --with-thread --with-signals --with-serialization --with-system --with-program_options --with-date_time stage Could anyone point me to where I would have found that without grepping gcc.jam? From: Birju Prajapati Sent: 24 April 2009 13:12 To: boost-users(a)lists.boost.org Subject: undefined reference to `__sync_fetch_and_add_4' Hi, I built boost 1.38 as so: bjam architecture=x86 address-model=32 --stagedir=stage32 --with-filesystem --with-thread --with-signals --with-serialization --with-system --with-program_options --with-date_time stage Copied the files over to /usr/local/lib32: sudo cp stage32/lib/* /usr/local/lib32/ Compiled object files, eg: g++ -m32 -c -g -D_LINUX -I. -I/opt/sts_vendor/onix-eurex/include -I/usr/local/include/boost-1_38 -MMD -MP -MF build/Debug/GNU-Linux-x86/reference/ReferenceData.o.d -o build/Debug/GNU-Linux-x86/reference/ReferenceData.o reference/ReferenceData.cpp Then linking does not work: g++ -m32 -o dist/Debug/GNU-Linux-x86/spreadx build/Debug/GNU-Linux-x86/multicast/MulticastChannel.o build/Debug/GNU-Linux-x86/reference/ReferenceData.o build/Debug/GNU-Linux-x86/reference/Strategy.o build/Debug/GNU-Linux-x86/executor/MessageExecutor.o build/Debug/GNU-Linux-x86/multicast/MulticastSelector.o build/Debug/GNU-Linux-x86/fast/FIXStreamSubscriber.o build/Debug/GNU-Linux-x86/reference/Product.o build/Debug/GNU-Linux-x86/spreadx.o build/Debug/GNU-Linux-x86/fast/FIXMessage.o build/Debug/GNU-Linux-x86/multicast/Message.o build/Debug/GNU-Linux-x86/fast/FastDecoder.o build/Debug/GNU-Linux-x86/reference/Outright.o -L/opt/sts_vendor/onix-eurex/lib -L/usr/tibco/tibrv/lib -L/usr/local/lib32 -lffCppFixEngine -lACE -lcrypto -lboost_serialization-gcc43-mt -lboost_system-gcc43-mt -lboost_thread-gcc43-mt /usr/local/lib32/libboost_serialization-gcc43-mt.so: undefined reference to `__sync_fetch_and_add_4' I've tried #define BOOST_SP_USE_PTHREADS in user.hpp, I've tried -march=i486, but neither works. What gives? My platform details: birju@xx:~$ g++ --version g++ (Ubuntu 4.3.2-1ubuntu12) 4.3.2 Copyright (C) 2008 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. birju@xx:~$ uname -a Linux xx 2.6.27-11-generic #1 SMP Wed Apr 1 20:53:41 UTC 2009 x86_64 GNU/Linux birju@xx:~$ Cheers, Birju Schneider Trading 4th Floor, 25 Copthall Avenue London EC2R 7BP -------------------------------------------------------- Message from: Birju.Prajapati(a)schneidertrading.com Message to: boost-users(a)lists.boost.org Attached files: 0 This e-mail and any files transmitted with it are confidential, may be legally privileged, and are for the sole use of the intended recipient. Copyright in this e-mail and any accompanying document created by us is owned by us. If you are not the intended recipient of this e-mail or any part of it please telephone our IT Department at the number shown above or by e-mail at info(a)schneidertrading.com. You should not use or disclose to any other person the contents of this e-mail or its attachments (if any), nor take copies. This e-mail is not a representation or warranty and is not intended nor should it be taken to create any legal relations, contractual or otherwise. Schneider Trading Associates Ltd (Registration No. 3692131) is incorporated in England and Wales and the registered office is at 25 Copthall Avenue, London EC2R 7BP. The company is authorised and regulated by the Financial Services Authority

2 2

[Statechart] Passing reference to create_processor()
by Hawkes Steve-FSH016 27 Apr '09

27 Apr '09

The Boost reference states that boost::ref can be used to pass an argument to statechart::fifo_scheduler::create_processor by reference instead of by value. I haven't been able to get this to work if the argument type derives from boost::noncopyable. It appears that the create_processor implementation instantiates code that attempts to copy the argument. Here's an example. Note that this compiles and runs sucessfully if Object does not derive from boost::noncopyable. Thanks, Steve Hawkes ---- #include <boost/statechart/asynchronous_state_machine.hpp> #include <boost/statechart/fifo_scheduler.hpp> #include <boost/statechart/simple_state.hpp> #include <boost/noncopyable.hpp> #include <boost/ref.hpp> #include <iostream> class Object : public boost::noncopyable { }; struct Initial; struct Test : boost::statechart::asynchronous_state_machine<Test, Initial> { public: Test(my_context ctx, Object& arg1) : my_base(ctx) { } }; struct Initial : boost::statechart::simple_state<Initial, Test> { }; int main() { Object value; boost::statechart::fifo_scheduler<> scheduler; const boost::statechart::fifo_scheduler<>::processor_handle processor1 = scheduler.create_processor <Test, Object&> (boost::ref(value)); return (0); } ---- Here's the compiler error: ---- g++ -Wall -lboost_system-mt -lboost_thread-mt -o test test.cc /usr/include/boost/noncopyable.hpp: In copy constructor 'Object::Object(const Object&)': test.cc:9: instantiated from 'typename boost::statechart::processor_container<boost::statechart::fifo_scheduler <FifoWorker, Allocator>, typename FifoWorker::work_item, Allocator>::processor_handle boost::statechart::fifo_scheduler<FifoWorker, Allocator>::create_processor(Arg1) [with Processor = Test, Arg1 = Object&, FifoWorker = boost::statechart::fifo_worker<std::allocator<void> >, Allocator = std::allocator<void>]' test.cc:36: instantiated from here /usr/include/boost/noncopyable.hpp:27: error: 'boost::noncopyable_::noncopyable::noncopyable(const boost::noncopyable_::noncopyable&)' is private test.cc:9: error: within this context /usr/include/boost/statechart/fifo_scheduler.hpp: In member function 'typename boost::statechart::processor_container<boost::statechart::fifo_scheduler <FifoWorker, Allocator>, typename FifoWorker::work_item, Allocator>::processor_handle boost::statechart::fifo_scheduler<FifoWorker, Allocator>::create_processor(Arg1) [with Processor = Test, Arg1 = Object&, FifoWorker = boost::statechart::fifo_worker<std::allocator<void> >, Allocator = std::allocator<void>]': /usr/include/boost/statechart/fifo_scheduler.hpp:63: note: synthesized method 'Object::Object(const Object&)' first required here /usr/include/boost/statechart/fifo_scheduler.hpp:63: error: initializing argument 3 of 'WorkItem boost::statechart::processor_container<Scheduler, WorkItem, Allocator>::create_processor(boost::weak_ptr<std::auto_ptr<boost::statec hart::event_processor<Scheduler> > >&, Scheduler&, Arg1) [with Processor = Test, Arg1 = Object, Scheduler = boost::statechart::fifo_scheduler<boost::statechart::fifo_worker<std::al locator<void> >, std::allocator<void> >, WorkItem = boost::function0<void>, Allocator = std::allocator<void>]'

5 10

[Review Results] Range.Ex library accepted into boost
by Thorsten Ottosen 27 Apr '09

27 Apr '09

Dear all, It is my pleasure that Neil Groves' RangeEx library has been accepted into boost. Congratulations Neil! There are quite a number of minor issues that need to be resolved before the library is release ready, see below for a summary. Review statistics ----------------- Full Reviews: 8. Discussion: extensive. I had the clear impression that everybody that participated in the discussion were in favor of this library, albeit they did not have time to submit a full review. I did not hear a single statement saying that this library should be rejected. Thanks to everybody that participated in the review and its discussions. Issue Summary ------------- Below is given a list of topics that must be adressed before the library can be included into boost. In general, we should try to discuss them one at a time in seperate threads. Many people suggested various extensions, new algorithms (e.g. from adope), etc. **In general we should not require Neil to add all these if he does not have the time currently: the basic infrastructure, the concepts, the naming and organization of the library is much more important. Then we can add all these things later.** 1: documentaion =============== The documentation should clearly reflect if an algorithm delegates to a standard algorithm. If the algorithm is new, then it should state complety and exception-safety. More examples would be welcome. Sometimes the rationale and explanations could be improved, e.g for operator|(). 2: return type specification for find() etc =========================================== There where no major objection to the mechanism, but some found the syntax ugly. I believe the suggested syntax (e.g.) boost::find[_f,_e]( range, x ) boost::find[_f+1,_e]( range, x ) was considered good by most. 3: namespace organization ========================= Currently the library uses the namspaces boost boost::adaptors Some raised concern about putting the algorithms straight in the boost namespace before we have a general agreement on where to put algorithms (e.g. in boost::algorithm or boost::ranges or whatever). I think it will make sense to put each algorithm in its own header, since we might have to include additional standard library headers for calling algorithms that are implemented as member functions (but see 7 below). Feedback is most welcome. 4: naming convention for adaptors ================================= The following have been proposed throughout the review (here examplified with "transform"): | transformed( fun ) | transform( fun ) | transform_view( fun ) | view::transform( fun ) There where no consensus during the review. Other libraries seem to use the _view suffix, which is a strong argument for that candidate (in that case, I suggest to drop the adaptors namespace). 5: naming convention for the adaptor generators =============================================== Many people like to be able to say make_transform_range(r,fun) instead of r | transformed( fun ). There was no concensus on how to name these functions. Here are some candidates: make_transform_range( r, fun ) transformed( r, fun ) transform( r, fun ) (*) transform_view( r, fun ) (*) was dislike by some because it has exactly the same spelling as the algorithm transform. Many felt that the confusion is too big if view generators are not named different from the actual algorithms. 6: reintroducing _if variants of algorithms =========================================== An important problem with the suggested approach was the the iterator returned by an algorithm after applying | filtered( pref ) are now filtered iterators and so one needs to manually unwrap the return iterator. This provided enough justification for reintroducing these algorithms. (One could imagine that this unwrapping was done automatically by a conversion operator such that iterator i = boost::find( r | boost::filtered( pred ), x ); "just worked". However, the syntax is still slightly worse than just using the original algorithm). Generic programming is concerned with the use of orthogonal concepts which put together yields all possible combinations of algorithms. If we reintroduce all _if algorithms, we have to aks ourselves "when does it end?". Should all new algorithms then simply add _if variants? This seems very much against the spirit of generic programming. The problem with the iterators being changed (as in the find example) seems to suggest the following guideline: "If the algorithm returns an iterator, it makes sense to provide an _if overload. Otherwise it does not." Under this guideline, find_if() should be there, but count_if() should not be provided. 7: should algorithms call member function when possible? ======================================================== I heard one strong voice against this. The reason was that the algorithm implemented as member function often has quite different guarantees w.r.t. complexity, reference and iterator stabililty. I think this is a very strong argument. Also, we can add this later if good arguments appear, but it is much harder to take away. We also have to remember Scott Meyers item "Beware of container independent code" which also suggest that this is a bad idea. At the very menimum, the original algorithm and the member function should have similar semantics. This seems to suggest that we can call set::lower_bound() from boost::lower_bound(). In that case, the best way would probably be to add these as overloads in the boost namespace: template< class T, class A > typename std::set<T,A>::iterator lower_bound( std::set<T,A>& s ); template< class T, class A > typename std::set<T,A>::const_iterator lower_bound( const std::set<T,A>& s ); 8: making return values of algorithms consistent/intuitive ========================================================== For example, sort(r) returns the sorted range, but sort_heap(r) does not. Similar issues for partial_sort(). Please go through all algorithms to see if this done correctly. 9: output range concept? ========================= It appears that the only use for an output iterator in the library was for boost::copy(rng,iter), and the only use for that function was for "sinks" like std::ostream_iterator<T>(...). This seems to be the only safety hole left in the library. Here's an idea to how we might remove that: create a new "copy sink" concept: struct array_copy_sink { ... template< class Iterator > copy( Iterator begin, Iterator end ) { ... } }; Then we might imagine boost::copy( rng, boost::ostream_sink(std::cout) ); boost::copy( rng, boost::array_sink(an_array) ); boost::copy( rng, boost::ptr_sink(begin,end) ); boost::copy( rng, boost::front_insert_sink(a_deque) ); ... For optimal performance, we also need a "nonoverlapping copy sink" concept, and an algorithm that expects that sink (or that boost::copy() determines the type of the sink automatically). 10: automatic projection ======================= Adope has algorithms overloaded such that projection is very easy: struct my_type { int member; double another_member; }; //... my_type a[] = { { 1, 2.5 }, ... }; // sort the array by the first member: sort(a, less(), &my_type::member); my_type* i = lower_bound(a, 5, less(), &my_type::member); We should be able to express this well, albeit not as concise, with my_type* i = boost::lower_bound( a | project( &my_type::member ), 5, less() ); where project( ... ) could simply return a transform iterator constructed with boost::bind(). There is another problem, however, because now the return value is a tranform_iterator of some form. Appending .base() would solve it, albeit it is somewhat ugly. Again this might raise the question of an implicit conversion. I just want to say this is not a critical issue as we can always add these overloads. --- End of Issues ---- Again, I would like to thank everybody that participated in the review. best regards Thorsten, review manager

1 0

[preprocessor] Nested FOR_EACHs
by Reimund Klemm 27 Apr '09

27 Apr '09

Hello, is it possible to nest FOR_EACH statements with the preprocessor? In my example it seems not to work: #include <boost/preprocessor/seq/for_each_i.hpp> #define DECLARE_TEST2(r,data,i,elem) \ 1; /**/ #define DECLARE_TEST(r,data,i,elem) \ BOOST_PP_SEQ_FOR_EACH_I(DECLARE_TEST2,data,data); /**/ #define SEQ ((1)(NACK_SN)(10)) ((1)(E1)(1)) ((1)(E2)(1)) int main(){ BOOST_PP_SEQ_FOR_EACH_I(DECLARE_TEST,SEQ,SEQ) return 0; } Thanks a lot for comments. Reimund

1 0

[Spirit] leaf_node_d compile time error
by Chris Uzdavinis 26 Apr '09

26 Apr '09

Hi, I'm upgrading some code from boost 1.33 to 1.38, and upgrading compilers from gcc 4.1 to 4.3.3. Code that used to work is no longer compiling, and I'm running out of ideas what might be the problem. While the real code is significantly larger, I've managed to extract the problem down to this short example. #define BOOST_SPIRIT_USE_OLD_NAMESPACE #include "boost/spirit/include/classic_core.hpp" #include "boost/spirit/include/classic_ast.hpp" using namespace boost::spirit; struct Test_Parser : public grammar<Test_Parser> { template <typename ScannerT> struct definition { definition(Test_Parser const & /*self*/) { test_filter = leaf_node_d[ ch_p('=') ] //<<<<<<< HERE ; } rule<ScannerT> test_filter; rule<ScannerT> const & start() const { return test_filter; } }; }; int main() { using namespace boost::spirit; char const * str = "="; Test_Parser parser; parse_info<> info = parse(str, parser, space_p); } When I use leaf_node_d[], it doesn't compile. Removing leaf_node_d, and all is well. The error is ugly, but ultimately is this: error: no type named node_factory_t in class boost::spirit::leaf_node_parser<T>::parse(const ScannerT&) const I've spent a few hours trying to grok the code and am falling short. Any help would be appreciated. g++ -I $BOOST_ROOT foo.cpp /usr/local43/include/boost-1_38/boost/spirit/home/classic/tree/common.hpp: In member function typename boost::spirit::parser_result<boost::spirit::leaf_node_parser<T>, ScannerT>::type boost::spirit::leaf_node_parser<T>::parse(const ScannerT&) const [with ScannerT = boost::spirit::scanner<const char*, boost::spirit::scanner_policies<boost::spirit::skipper_iteration_policy<boost::spirit::iteration_policy>, boost::spirit::match_policy, boost::spirit::action_policy> >, T = boost::spirit::chlit<char>]: /usr/local43/include/boost-1_38/boost/spirit/home/classic/core/non_terminal/impl/rule.ipp:235: instantiated from typename boost::spirit::match_result<ScannerT, ContextResultT>::type boost::spirit::impl::concrete_parser<ParserT, ScannerT, AttrT>::do_parse_virtual(const ScannerT&) const [with ParserT = boost::spirit::leaf_node_parser<boost::spirit::chlit<char> >, ScannerT = boost::spirit::scanner<const char*, boost::spirit::scanner_policies<boost::spirit::skipper_iteration_policy<boost::spirit::iteration_policy>, boost::spirit::match_policy, boost::spirit::action_policy> >, AttrT = boost::spirit::nil_t] foo.cpp:28: instantiated from here /usr/local43/include/boost-1_38/boost/spirit/home/classic/tree/common.hpp:903: error: no type named node_factory_t in class boost::spirit::leaf_node_parser<T>::parse(const ScannerT&) const [with ScannerT = boost::spirit::scanner<const char*, boost::spirit::scanner_policies<boost::spirit::skipper_iteration_policy<boost::spirit::iteration_policy>, boost::spirit::match_policy, boost::spirit::action_policy> >, T = boost::spirit::chlit<char>]::result_t make: *** [.obj/foo.o] Error 1 -- Chris

2 2

Boost Graph Library documentation unclear
by Lindley M French 26 Apr '09

26 Apr '09

I've been trying to use the Boost Graph Library. For the most part I'm working it out. However, I'm finding the documentation annoyingly decentralized....it isn't interlinked enough, at the very least. Too hard to go from "how do I use X" to "oh, here's the documentation on X." Took me half an hour just to find *something* on the add_edge function (turns out it's on the Concepts page?), and what's there *barely* qualifies as a prototype, much less a proper man page. My current question is regarding properties. Some of the algorithms specify the "edge_weight" property as if it's something all edges have, and the vertex_index property as if it's something all vecS-specified graphs have. Yet I can't find any documentation explicitly confirming this, and my compiler seems to disagree in any case. http://www.boost.org/doc/libs/1_38_0/libs/graph/doc/kruskal_min_spanning_tr… Can something be done about the state of the documentation, and is there a comprehensive list of default properties available somewhere (together with how those are replaced or supplemented when user properties are introduced)?

2 3

initializing intrusive_ptrs through library calls
by Zachary Turner 26 Apr '09

26 Apr '09

I frequently use COM, and I've written an add_ref() and release() so that I can use my COM objects with boost::intrusive_ptr. However, one generally obtains these pointers through a library call that accepts a T** or a void**, and returns a pointer that's already been AddRef'd the first time. Normally it would go something like this: template<typename T> d3d_ptr<T> take_ptr(T* t) { return d3d_ptr<T>(t, false); } ID3DXFont* pFont = NULL; D3DXCreateFontIndirect(m_pDeviceObject, &fontDesc, &pFont); m_spFont = take_ptr(pFont); To remove these extra 2 lines I wrote the following class / function: template<typename T> class recv_by_addr_t { public: recv_by_addr_t(d3d_ptr<T>& r) : m_auto(r), m_raw(NULL) {} ~recv_by_addr_t() {m_auto = take_ptr(m_raw);} operator T**() { return &m_raw; } private: T* m_raw; d3d_ptr<T>& m_auto; }; template<typename T> recv_by_addr_t<T> recv_by_addr(d3d_ptr<T>& rptr) { return recv_by_addr_t<T>(rptr); } And I can now call the function like this: D3DXCreateFontIndirect(m_pDeviceObject, &fontDesc, recv_by_addr(m_spFont)); I feel like this is pretty solid, but figured I should ask the gurus :) Even in the case where the function errors out and sets the thing to NULL, the original pointer should still get correctly released. Anything wrong with this approach?

1 0

Boost 1.39.0 beta 1 is available for download
by Beman Dawes 26 Apr '09

26 Apr '09

Boost 1.39.0 beta 1 is available for download from SourceForge. See http://sourceforge.net/project/showfiles.php?group_id=7586&package_id=8041&… New Libraries: Signals2. Updated Libraries: Asio, Flyweight, Foreach, Hash, Interprocess, Intrusive, Program.Options, Proto, PtrContainer, Range, Unordered, Xpressive. Updated Tools: Boostbook, Quickbook. Plus the usual bug fixes to numerous libraries. Please report any problems to the Boost users or developers mailing list. Thanks, --Beman Dawes, Daniel James, and all the other Boosters who help get releases out

1 0

Examples....
by Campagne 26 Apr '09

26 Apr '09

Dear all I am a quite new in Boost... Although I have experienced successfuly the smart_ptr library. Now, I would like to use IOSTREAM library. Even if the tutorial and User Guide are fine, they describe mostly how-to-write-xyz but very rarely how-to-use in practice. For instance I despearate to see an exmple on how-to-use the "line_wrapping_input_filter" example... Does someone can 1) tell me if there is somewhere example of how-to-use for end-user IOSTREAM features? 2) if someone as used the example and how... Best. JE -- +++++++++++++++++++++++++++++++++++++++ Jean-Eric Campagne Laboratoire de l'Accélérateur Linéaire d'Orsay IN2P3/CNRS et Université Paris XI LAL Orsay - B.P 34 91898 Orsay Cedex Tél: 0164468429 from abroad +3316.. Fax: 0164468397 +++++++++++++++++++++++++++++++++++++++

2 1

ASIO, boost::function in VC7.1
by Kimon Simons 26 Apr '09

26 Apr '09

Hi all, I started playing with ASIO timers and after scanning through the relevant docs, I set up a small case. Please find below the code snippet. The IntervalEvent class is supposed to fire the event provided on the construction at a frequency equal to the durationInterval. Somehow the code below fails to compile on VC7.1. I am getting several warnings and the error: c:\program files\boost\boost_1_38\boost\mem_fn.hpp(343) : error C4716: 'boost::_mfi::dm<void __thiscall IntervalEvent::(boost::system::error_code &),IntervalEvent>::operator()' : must return a value I have not tried yet gcc. Probably I am doing something stupid. Any ideas? Further to that, I am wondering, in principle should I cancel the deadline_timer on the destructor of the IntervalEvent class? Does the io_service class know when any of the deadline_timers that is being registered goes out of scope? Thank you very much in advance. Any help would be highly appreciated. Kimon #include <boost/function.hpp> #include <iostream> #include <boost/asio.hpp> #include <boost/thread.hpp> #include <boost/bind.hpp> #include <boost/date_time/posix_time/posix_time.hpp> class Counter { public: Counter():m_value(0) { } void onIncrement() { ++m_value; std::cout<<"Counter is "<<m_value<<std::endl; } protected: int m_value; }; class IntervalEvent { public: IntervalEvent(boost::asio::io_service &io, long durationSeconds, boost::function<void(void)> event): m_intervalDuration(durationSeconds), m_timer(io,boost::posix_time::seconds(m_intervalDuration)), m_event(event) { //io_service::run is running in only one thread m_timer.async_wait(boost::bind(&IntervalEvent::handler, this)); } ~IntervalEvent() { //should I call m_timer.cancel to notify the io_service? } void handler(boost::system::error_code& error) { if(error!= boost::asio::error::operation_aborted) { m_event(); reset(m_intervalDuration); } } void reset(long duration) { if (m_timer.expires_from_now(boost::posix_time::seconds(duration)) > 0) { m_intervalDuration = duration; //reset the async wait m_timer.async_wait(boost::bind(&IntervalEvent::handler, this)); } else { //Timer already canceled } } void cancel() { m_timer.cancel(); } size_t getCurrentInterval() const { return m_intervalDuration; } protected: long m_intervalDuration; boost::asio::deadline_timer m_timer; boost::function<void(void)> m_event; }; int main() { boost::asio::io_service io; boost::shared_ptr<boost::asio::io_service::work> work(new boost::asio::io_service::work(io)); boost::thread ioservice_thread(boost::bind(&boost::asio::io_service::run, &io)); std::vector<boost::shared_ptr<IntervalEvent> > events; Counter count; long duration = 1; boost::shared_ptr<IntervalEvent> firstEvent(new IntervalEvent(io, duration, boost::bind(&Counter::onIncrement,boost::ref(count) )) ); events.push_back(firstEvent); char response = 'N'; while(response == 'N') { std::cout<<"Create a new interval event? [Y/N]"<<std::endl; std::cin>>response; if(response == 'Y') { boost::shared_ptr<IntervalEvent> test(new IntervalEvent(io, duration, boost::bind(&Counter::onIncrement,boost::ref(count) )) ); events.push_back(test); } } //cancel interval events for(std::vector<boost::shared_ptr<IntervalEvent> >::iterator it = events.begin(), itEnd = events.end(); it!=itEnd; ++it) { (*it)->cancel(); } //reset ioservice_work work.reset(); ioservice_thread.join(); return 0; }

2 4

Boost 1.38.0 and gcc 4.3.2
by Brian Webb 26 Apr '09

26 Apr '09

I'm trying to build the boost libraries on Ubuntu 8.10 with gcc-4.3.2, and it's a mess! I think there are more failed compiles than there are successes. Is there something that I'm missing, or is this currently unsupported? This is the compile command that I'm using: bjam --toolset=gcc --prefix=$PREFIX --layout=system --user-config=`pwd`/user-config.jam stage This is user-config.jam: using gcc : : g++ : <compileflags>-I/swl/ix86-linux/include <linkflags>-L/swl/ix86-linux/lib ; using mpi ; Any pointers would be appreciated. Thanks, Brian

5 5

How to detect the presence of a particular type of constructor?
by Siegfried Kettlitz 25 Apr '09

25 Apr '09

Hello, what i like to do, is to detect the presence of a particular type of constructor for a class in a template. It is possible to use template overloading to detect the presence of members or member functions (like with::some_func(int) ), but since it is not possible(?) to take a pointer to a constructor ( like with::with(int) ), this method does not work to detect the present types of the templated class T. Consider this pseudocode: struct with { with( int ); } struct without { without( void ); } template<typename T> T* do_construct() { a) return new T(int) if T::T(int) present; b) return new T() if T::T(int) not present; } int main( void ) { do_construct<with>(); do_construct<without>(); } So far i did not find anything useful in type_traits to make the do_construct-function work without modifying the classes (adding inheritance or some static member). Does anyone know another possibility to do this, or is it not possible using the current standard of c++? Regards, Siegfried Kettlitz

3 4

undefined reference to `__sync_fetch_and_add_4'
by Birju Prajapati 24 Apr '09

24 Apr '09

Hi, I built boost 1.38 as so: bjam architecture=x86 address-model=32 --stagedir=stage32 --with-filesystem --with-thread --with-signals --with-serialization --with-system --with-program_options --with-date_time stage Copied the files over to /usr/local/lib32: sudo cp stage32/lib/* /usr/local/lib32/ Compiled object files, eg: g++ -m32 -c -g -D_LINUX -I. -I/opt/sts_vendor/onix-eurex/include -I/usr/local/include/boost-1_38 -MMD -MP -MF build/Debug/GNU-Linux-x86/reference/ReferenceData.o.d -o build/Debug/GNU-Linux-x86/reference/ReferenceData.o reference/ReferenceData.cpp Then linking does not work: g++ -m32 -o dist/Debug/GNU-Linux-x86/spreadx build/Debug/GNU-Linux-x86/multicast/MulticastChannel.o build/Debug/GNU-Linux-x86/reference/ReferenceData.o build/Debug/GNU-Linux-x86/reference/Strategy.o build/Debug/GNU-Linux-x86/executor/MessageExecutor.o build/Debug/GNU-Linux-x86/multicast/MulticastSelector.o build/Debug/GNU-Linux-x86/fast/FIXStreamSubscriber.o build/Debug/GNU-Linux-x86/reference/Product.o build/Debug/GNU-Linux-x86/spreadx.o build/Debug/GNU-Linux-x86/fast/FIXMessage.o build/Debug/GNU-Linux-x86/multicast/Message.o build/Debug/GNU-Linux-x86/fast/FastDecoder.o build/Debug/GNU-Linux-x86/reference/Outright.o -L/opt/sts_vendor/onix-eurex/lib -L/usr/tibco/tibrv/lib -L/usr/local/lib32 -lffCppFixEngine -lACE -lcrypto -lboost_serialization-gcc43-mt -lboost_system-gcc43-mt -lboost_thread-gcc43-mt /usr/local/lib32/libboost_serialization-gcc43-mt.so: undefined reference to `__sync_fetch_and_add_4' I've tried #define BOOST_SP_USE_PTHREADS in user.hpp, I've tried -march=i486, but neither works. What gives? My platform details: birju@xx:~$ g++ --version g++ (Ubuntu 4.3.2-1ubuntu12) 4.3.2 Copyright (C) 2008 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. birju@xx:~$ uname -a Linux xx 2.6.27-11-generic #1 SMP Wed Apr 1 20:53:41 UTC 2009 x86_64 GNU/Linux birju@xx:~$ Cheers, Birju Schneider Trading 4th Floor, 25 Copthall Avenue London EC2R 7BP -------------------------------------------------------- Message from: Birju.Prajapati(a)schneidertrading.com Message to: boost-users(a)lists.boost.org Attached files: 0 This e-mail and any files transmitted with it are confidential, may be legally privileged, and are for the sole use of the intended recipient. Copyright in this e-mail and any accompanying document created by us is owned by us. If you are not the intended recipient of this e-mail or any part of it please telephone our IT Department at the number shown above or by e-mail at info(a)schneidertrading.com. You should not use or disclose to any other person the contents of this e-mail or its attachments (if any), nor take copies. This e-mail is not a representation or warranty and is not intended nor should it be taken to create any legal relations, contractual or otherwise. Schneider Trading Associates Ltd (Registration No. 3692131) is incorporated in England and Wales and the registered office is at 25 Copthall Avenue, London EC2R 7BP. The company is authorised and regulated by the Financial Services Authority

3 6

BoostCon 2009 Registrar's Report
by Kim Scheibel 24 Apr '09

24 Apr '09

I'm very happy to report that, despite the current economic climate, we currently have a very solid number of confirmed registrations for BoostCon 2009. 84 registrations to be precise, of which 6 were registered in the last two days alone. You still have time to register at the discounted price of USD599 at http://www.boostcon.com/registration, on or before Apr. 26th. After that, the fee is USD699. Best regards, Kim Scheibel BoostCon 2009 Registrar

1 0

[signals] maximum combiner example calls slot twice
by Dominique Devienne 24 Apr '09

24 Apr '09

In http://www.boost.org/doc/libs/1_38_0/doc/html/signals/tutorial.html, once I read: "The input iterators passed to the combiner transform dereference operations into slot calls" I realized that the maximum<T> combiner introduced earlier is implemented using: if (max_value < *first) max_value = *first; Which ends up calling the slot twice. In this case it's harmless since the slot has no side effect, but it may not be a good example to follow, or maybe it should be pointed out a little later when the combiner deref statement quoted above is made. Just my $0.02. Thanks, --DD

2 2

How to use mpl::for_each with mpl::map
by Mark 24 Apr '09

24 Apr '09

Hi, I'm trying to use the runtime mpl::for_each algorithm on an mpl::map that I have which associates enumerated values to various types. I want to be able to call a functor for each of the enumerated key values in the mpl::map but can't get the syntax right, I get the following compiler error with MSVC 9.0 c:\source\vendor\boost\1_38_0\boost\mpl\pair.hpp(43) : error C2039: 'first' : is not a member of 'boost::mpl::arg<1>' Any help appreciated. Mark. #include <iostream> #include <string> #include <boost/mpl/map.hpp> #include <boost/mpl/at.hpp> #include <boost/mpl/for_each.hpp> #include <boost/mpl/key_type.hpp> namespace mpl = boost::mpl; enum FieldId { Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday, _DaysInWeek }; // Map of enumerated types typedef mpl::map < mpl::pair< mpl::int_< Monday >, mpl::identity< int > >, mpl::pair< mpl::int_< Tuesday >, mpl::identity< std::string > >, mpl::pair< mpl::int_< Wednesday >, mpl::identity< int > >, mpl::pair< mpl::int_< Thursday >, mpl::identity< __int64 > >, mpl::pair< mpl::int_< Friday >, mpl::identity< char > >, mpl::pair< mpl::int_< Saturday >, mpl::identity< bool > >, mpl::pair< mpl::int_< Sunday >, mpl::identity< int > > > _day_field_types; // Returns the type for the associated enumeration template< int FIELD_ID > struct FieldTypeT : mpl::at< _day_field_types, mpl::int_< FIELD_ID > >::type {}; // Prints value struct printer { template< typename T > void operator()( const T& x ) { std::cout << x << std::endl; } }; int main() { // Print the associated type for the 'Tuesday' enumeration std::cout << typeid( FieldTypeT< Tuesday >::type ).name() << std::endl;; // Print the list of enumerations mpl::for_each< _day_field_types, mpl::key_type< mpl::map<>, mpl::_1 > >( printer() ); // Compiler error! }

2 2

bjam - unable to generate "libboost_system-vc80-mt-gd-1_39.lib"
by Raja Koduru 24 Apr '09

24 Apr '09

Hi, I am new to boost. I compiled boost using bjam without giving any command line options. I was trying to run a simple asio's timer1.cpp tutorial given on the boost website. It failed with the error "LINK : fatal error LNK1104: cannot open file 'libboost_system-vc80-mt-gd-1_39.lib'" Looked in <BoostRootDir>\bin.v2 directory. There were library files with the format "libboost_system-vc80-mt-1_39.lib" My question is .. What other options needs to be given to bjam to generate suitable libs with "-gd" in the library name. ? "bjam's --help" has not helped on how to fine tune it. Please advice. with thanks & regards, raja koduru

2 2

Re: [Boost-users] Boost.Test error in Xcode debug build
by DeNigris Sean 24 Apr '09

24 Apr '09

>Can you give more details on your OS/compiler setup? Is it GCC version? >What version of Boost r u using? What usage variant of Boost.Test? Sure gcc 4.0.1 (Apple) Boost 1.38 Variant: libboost_unit_test_framework-xgcc40-mt-1_38.dylib > Can you post simplest example here. #define BOOST_TEST_MODULE example #include <boost/test/included/unit_test.hpp> // ____________________________________________________________________________ // BOOST_AUTO_TEST_CASE( free_test_function ) { BOOST_CHECK( true /* test assertion */ ); } > What is the value of id? What os the value of res? > You mean if line, right? Yes, correct. Sean DeNigris sean(a)clipperadams.com

1 0

Ideas for something that looks like metaprogramming
by John Dlugosz 24 Apr '09

24 Apr '09

I'm revamping my atomic_counter template (see < http://www.dlugosz.com/Repertoire/refman/Classics/atomic_counter_whitepa per.html#toptop>) and plan on exposing all the available "magic" (e.g. things you can't do in C++) op-codes in the atomic read-modify-write department, as primitives. Then, use those in the template class. But, I have gained a deeper appreciation for some of the LOCKable instructions I never thought were interesting. For example, you can LOCK ADD, which changes the value in memory but doesn't return back what it was or became. What good is that? Directly translating to C++, none at all. But... you do get back some information. In assembly language, you see the flags. So, a thread can add something to the location, and although doesn't know what it became in general, at least know if this thread is the one that made it zero. Or, overflowed, or whatever. Those flags are the basis of if-statements in assembly language. So, given primitive calls that return the whole set of flags, it occurs to me to be able to harness that with a metaprogramming-like interface. For example, I'm hesitant to implement something called operator &= that doesn't return the new value, but "something else" instead. I think the only interesting flag here is whether the result is zero. So bool operator&=(left,right) returning whether the result was non-zero would be very confusing, even if it did work right when used in an 'if' condition! So, just brainstorming, x&=y would return something not directly usable, but does work with an overloaded ==, so if you were to write (x&=y)==0 the result would be what you expect from C++. Maybe it's not worth the effort. But if anyone wants to discuss it... --John (sorry about the footer; it's not my idea) TradeStation Group, Inc. is a publicly-traded holding company (NASDAQ GS: TRAD) of three operating subsidiaries, TradeStation Securities, Inc. (Member NYSE, FINRA, SIPC and NFA), TradeStation Technologies, Inc., a trading software and subscription company, and TradeStation Europe Limited, a United Kingdom, FSA-authorized introducing brokerage firm. None of these companies provides trading or investment advice, recommendations or endorsements of any kind. The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon, this information by persons or entities other than the intended recipient is prohibited. If you received this in error, please contact the sender and delete the material from any computer.

2 1

[interprocess] Shared memory compile problem
by Po-Chun 23 Apr '09

23 Apr '09

I am a new user and try to write some codes with shared memory using boost.interprocess. Basically, I followed the examples and the allocation seems fine. But the use of shared-memory container gave me a bunch of error messages related to "instantiated from here." during compile. The error seems related to the template. But I have no idea how to fix it yet. Any suggestion would be helpful. Thanks. Po-Chun My code: struct LongIntLess { bool operator()(const uint64_t a, const uint64_t b) { return a < b; } }; main () { using namespace boost::interprocess; try{ shared_memory_object::remove("SharedMemory"); managed_shared_memory segment (create_only, "SharedMemory", sizeof (uint64_t)*200); typedef allocator< uint64_t, managed_shared_memory::segment_manager> shmAllocator_t; typedef set<uint64_t, shmAllocator_t> shrSet_t; const shmAllocator_t alloc_inst (segment.get_segment_manager()); shrSet_t *WrSet_1; WrSet_1 = segment.construct<shrSet_t> ("shrSet_t") ("LongIntLess", alloc_inst); // <= not sure about this // Is it right way to construct a set ? WrSet_1->insert(2); // <====== This line causes the error } catch (...){ shared_memory_object::remove("SharedMemory"); throw(); } shared_memory_object::remove("SharedMemory"); } The error messages are from these files: boost/interprocess/containers/ detail/tree.hpp: boost/intrusive/detail/tree_algorithms.hpp boost/intrusive/rbtree.hpp boost/interprocess/containers/detail/tree.hpp boost/interprocess/containers/set.hpp One of the error messges is like: tree.hpp:331: instantiated from 'bool boost::interprocess::detail::rbtree<Key, Value, KeyOfValue, KeyCompare, A>::key_node_compare<KeyValueCompare>::operator()(const KeyType&, const typename boost::interprocess::detail::node_alloc_holder<A, typename boost::interprocess::detail::intrusive_rbtree_type<A, boost::interprocess::detail::value_compare_impl<Key, Value, KeyCompare, KeyOfValue> >::type>::Node&) const [with KeyType = long unsigned int, KeyValueCompare = boost::interprocess::detail::value_compare_impl<long unsigned int, long unsigned int, boost::interprocess::allocator<long unsigned int, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0ul>, boost::interprocess::iset_index> >, boost::interprocess::detail::identity<long unsigned int> >, Key = long unsigned int, Value = long unsigned int, KeyOfValue = boost::interprocess::detail::identity<long unsigned int>, KeyCompare = boost::interprocess::allocator<long unsigned int, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0ul>, boost::interprocess::iset_index> >, A = std::allocator<long unsigned int>]'

2 3

using offset_ptr
by Rex Battenberg 23 Apr '09

23 Apr '09

Hi, I am having trouble using offset_ptr. I want to dynamically allocate memory in windows shared memory and create a point to it so it can be used by two different processes. I figures I would create a named object in the shaed memory to contain the pointer to the memmory, but when I try it I get a compile error. Here is the code I have so far. Note the the the shared memory is created elsewhere and it is big enough. bip::managed_windows_shared_memory* pAldisSharedMemory = new bip::managed_windows_shared_memory(bip::open_only, ALDIS_SHARED_MEMORY_NAME.c_str()); if (pAldisSharedMemory) { bip::offset_ptr<char> pImageData; // // This line causes the following error. Error 1 error C2440: 'initializing' : cannot convert from //' //boost::interprocess::offset_ptr<PointedType> *' to 'char *' //C:\stopbar\3rdParty\boost\include\boost\interprocess\offset_ptr.hpp 111 AldisHardware // pImageData = pAldisSharedMemory->find_or_construct<bip::offset_ptr<char>>("ImageData")(); // char * *pImageData = pAldisSharedMemory->find_or_construct<char *>("ImageData")(); if (pImageData == NULL) { // // This value will be unuseable by other processes, need to use an offset_ptr here, but I have not figured // out yet how to make them work. // pImageData = (char *)pAldisSharedMemory->allocate(1280 * 860 * 3); } I have really no idea what is wrong or how to do this. If anybody has any examples, that would be great. Thanks Rex

1 0

Re: [Boost-users] regular expression problems
by John Maddock 23 Apr '09

23 Apr '09

> Sorry, but this strays a little from actual boost. Since there are a > handful of you that are probably using regex, I was hoping someone could > help with syntax. > > I have a regex that validates a latitude format. > > > > These are the restrictions: > > Must have an N or S as first letter. > > It can be all values from 0.0 to 90.0 > > My first shot at it confirmed format, but not data constraints: > "(N|S)\\d{2}\\.\\d{1,6} <file:///\\d%7b2%7d\d%7b1,6%7d> " > > But any attempts to limit the constraints caused an exception in regex. > Is > there something wrong w/ how I formatted this: > "(N|S)(9[0]\\.0{1-6}|[0-8]\\d\\.\\d{1-6} > <file:///\\.0%7b1-6%7d|[0-8]\d\d%7b1-6%7d> )" > > > > To me, it reads: 1st char must be N|S > > If second char is 9, the next chars must be 0.0 through 0.000000 > > Else > > If char is 0-8, then the next just has to be digits [0-9].[0-9]{1-6} > > > > Can anyone tell me what I am doing wrong? There are no numeric constraints available in the regular expression language, and the {} operator are for constrained repeats with 1{1-6} not being a valid syntax. How about something like: (N|S)\\d(\\.\\d+|[1-8](\\.\\d+)?|9(\\.0+)?)? HTH, John.

3 2

[asio] Named pipes on Windows?
by Allen Cronce 23 Apr '09

23 Apr '09

Hi all, I'm working on a cross platform server daemon. Clients communicate with the daemon using boost asio. For the posix implementation, it's convenient and appropriate in our case to use Unix domain sockets. I've experimented with the related asio "local" sample code and verified that it will work for our purposes. For Windows it looks like named pipes are sort of the equivalent of Unix domain sockets. But while asio has a "stream_handle" interface that accepts a Windows handle, all of the sample and test code passes invalid handles. I haven't found any working sample or test code that specifically integrates named pipes with asio. All I've found so far is an email to this list on March 13th from Andrew Solodovnikov who was having problems getting named pipes to work with asio. Has anyone successfully used asio and Windows named pipes? If so, would you be willing to share some sample code that demonstrates the functionality? Thanks in advance. Best, -- Allen Cronce

2 1

[tuple][fusion] Creating tuple type from function type
by Jeremiah Willcock 23 Apr '09

23 Apr '09

I would like to take a given function type and create a (Fusion or Boost) tuple with its parameter types as members. This would be straightforward to do with function_types and Fusion, but I would also like to add a separate tag to each tuple type. For example, I would like to do the following: struct tag1 {}; struct tag2 {}; typedef tagged_function_tuple<tag1, void(int, double)>::type t1; typedef tagged_function_tuple<tag2, void(int, double)>::type t2; and have t1 and t2 be distinct types, each equivalent to fusion::vector<int, double> (or some kind of tuple<int, vector>). In particular, I would like to use the nice constructor syntax to allow things like t1(1, 2.5) to work, with as nice error messages as possible when incorrect argument counts or types are used. I would also like to "hide" the tags in the type, so just creating fusion::vector<tag1, int, double> would not be ideal. Is there a way to do this? Otherwise, I assume I can copy-and-paste the code for fusion::tuple and modify it to add a tag. Is that the recommended way? Thank you for your help. -- Jeremiah Willcock

1 0

Build and Install only a Specified Library from command line using bjam (newbie!)
by Agnel C J Kurian 23 Apr '09

23 Apr '09

Hi, I've been trying to build and install selected Boost libraries (regex, graph, program options) from the command line (MS VC9 Express) using the --with-library option of bjam. However I find that bjam copies headers for all boost libraries to the target location. How do I build and install only the specified library and it's headers? The same problem has been discussed by another user here: http://stackoverflow.com/questions/439402/building-a-subset-of-boost-in-win…

4 7

regular expression problems
by Green, Jason M NSWCDL, W33 23 Apr '09

23 Apr '09

Sorry, but this strays a little from actual boost. Since there are a handful of you that are probably using regex, I was hoping someone could help with syntax. I have a regex that validates a latitude format. These are the restrictions: Must have an N or S as first letter. It can be all values from 0.0 to 90.0 My first shot at it confirmed format, but not data constraints: "(N|S)\\d{2}\\.\\d{1,6} <file:///\\d%7b2%7d\d%7b1,6%7d> " But any attempts to limit the constraints caused an exception in regex. Is there something wrong w/ how I formatted this: "(N|S)(9[0]\\.0{1-6}|[0-8]\\d\\.\\d{1-6} <file:///\\.0%7b1-6%7d|[0-8]\d\d%7b1-6%7d> )" To me, it reads: 1st char must be N|S If second char is 9, the next chars must be 0.0 through 0.000000 Else If char is 0-8, then the next just has to be digits [0-9].[0-9]{1-6} Can anyone tell me what I am doing wrong? Just FYI, I am coding in VS 2005 C++ Thanks

1 0

Boost Thread with own Callback implementation
by programmine 23 Apr '09

23 Apr '09

I am using boost::thread for starting a member function of an object in a seperate thread. This works for an example like this: ProcessData *data = new ProcessData(); ProcessManager *pm = new ProcessManager(); boost::thread t1(&ProcessManager::start, boost::ref(pm), data); Unfortunately I am not using the ProcessManager directly but a Controller which uses a self implemented callback functionality. It looks like this: typedef Callback1 startProcessingEvent; startProcessingEvent::Signal onStartProcessing; The ProcessManager is binded to this event and I could call the method like myController->onStartProcessing(data); so in the end the ProcessManager->start is called through the Controller. If I know want to run the same thing in a separate thread I cannot just do this: boost::thread t1(&Controller::onStartProcessing, boost::ref(myController), data); because boost does not understand the whole callback thing. Does anyone has an idea how to solve the problem? Thanks -- View this message in context: http://www.nabble.com/Boost-Thread-with-own-Callback-implementation-tp23193… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

identity_property_map
by Andreas Fabri 23 Apr '09

23 Apr '09

Hello, Are the code and the documentation of the identity_property_map in sync. The documentation says that the class identity_property_map has a template member function operator[](T t) that for any type T, just returns t. In the .hpp file though I find //========================================================================= // A property map that applies the identity function to integers struct identity_property_map : public boost::put_get_helper<std::size_t, identity_property_map> { typedef std::size_t key_type; typedef std::size_t value_type; typedef std::size_t reference; typedef boost::readable_property_map_tag category; inline value_type operator[](const key_type& v) const { return v; } }; Best regards, andreas

2 1

Compiling Boost with PGI
by Ruediger Berlich 23 Apr '09

23 Apr '09

Hi there, I am trying to port my heavily Boost-based application to different compiler(-versions) . I was successful with Intel and various Linux-based gcc versions so far. Now I am trying my luck with the Portland group compiler in version 8. Corresponding compiler support seems to be available in Boost: ./tools/build/v2/tools/pgi.jam ./boost/config/compiler/pgi.hpp A "./configure --with-toolset=pgi" succeeds. The subsequent make, however, results in a plethora of error messages such as the following: gcc.compile.c++ bin.v2/libs/math/build/gcc/release/threading-multi/nextafter.o /bin/sh: line 1: -ftemplate-depth-128: command not found -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -pthread -fP IC -DBOOST_ALL_NO_LIB=1 -DBOOST_MATH_TR1_DYN_LINK=1 -DNDEBUG -I"." -c -o "bin. v2/libs/math/build/gcc/release/threading-multi/nextafter.o" "libs/math/build/../ src/tr1/nextafter.cpp" Looking into the pgi configuration files makes it appear as if the pgi support isn't finished yet. E.g. pgi.jam has a commented-out line # flags pgi.compile OPTIONS <threading>multi : -mt ; Indeed, pgCC does not accept this switch: $ pgCC -mt pgCC-Error-Unknown switch: -mt The above error message also makes it appear as if gcc options (e.g. "-Wall -pthread") are passed to pgCC. Can anyone comment on the status of PGI support by Boost ? The above happens on a system whose /etc/redhat-release states "Scientific Linux SL Release 4.0 (Beryllium)". The kernel is 2.6.9-42 . Scientific Linux is a Fedora-derivative, being used mostly in particle physics. Thanks and Best Regards, Ruediger

2 1

error while compiling application that uses a static lib that uses boost
by ChristinaDRS 23 Apr '09

23 Apr '09

Greetings all, I have a library called test which has a class that uses boost thread and mutex. here is how the includes in my .h file look: #include <boost/thread/mutex.hpp> #include <boost/thread.hpp> and here are the private vars: boost::mutex connectedPeersMutex_; boost::thread* listenThread_; in the .cpp file i have I use: #include <boost/bind.hpp> Now here is how I built my library with this Makefile: SRC = test1.cpp test2.cpp OBJ = $(SRC:.cpp=.o) OUT = libtest.a INCLUDES = -I. -I$$BOOST_ROOT CCFLAGS = -g CCC = g++ LDFLAGS = -g .SUFFIXES: .cpp default: $(OUT) .cpp.o: $(CCC) $(INCLUDES) $(CCFLAGS) -c $< -o $@ $(OUT): $(OBJ) ar rcs $(OUT) $(OBJ) clean: rm -f $(OBJ) $(OUT) Makefile.bak now I try to build a second application that simply uses the libtest.a like this: $ g++ -I ~/boost_1_38_0/ -I. main.cpp -omain -L/usr/local/lib/ -L. -ltest -lboost_thread-gcc41-mt-1_38 ./libtest.a(test1.o): In function `test1::StartServer(int, std::basic_string<char, std::char_traits<char>, std::allocator<char> >, int)': /home/chris/test1.cpp:337: undefined reference to `boost::thread::thread(boost::function0<void, std::allocator<boost::function_base> > const&)' ./libtest.a(test1.o): In function `~ test1': /home/chris/test1.cpp:36: undefined reference to `boost::mutex::~mutex()' /home/chris/test1.cpp:36: undefined reference to `boost::mutex::~mutex()' /home/chris/test1.cpp:36: undefined reference to `boost::mutex::~mutex()' /home/chris/test1.cpp:36: undefined reference to `boost::mutex::~mutex()' /home/chris/test1.cpp:36: undefined reference to `boost::mutex::~mutex()' ./libtest.a(test1.o):/home/chris/test1.cpp:36: more undefined references to `boost::mutex::~mutex()' follow ./libtest.a(test1.o): In function `test1': /home/chris/test1.cpp:8: undefined reference to `boost::mutex::mutex()' /home/chris/test1.cpp:8: undefined reference to `boost::mutex::mutex()' ./libtest.a(test1.o): In function `boost::detail::thread::lock_ops<boost::mutex>::lock(boost::mutex&)': /usr/include/boost/thread/detail/lock.hpp:33: undefined reference to `boost::mutex::do_lock()' ./libtest.a(test1.o): In function `boost::detail::thread::lock_ops<boost::mutex>::unlock(boost::mutex&)': /usr/include/boost/thread/detail/lock.hpp:45: undefined reference to `boost::mutex::do_unlock()' collect2: ld returned 1 exit status Any idea why I am getting these undefined references? Thanks! Christina -- View this message in context: http://www.nabble.com/error-while-compiling-application-that-uses-a-static-… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

how to use boost.phoenix with std:for_each?
by Bruce Laing 23 Apr '09

23 Apr '09

Hi, I would like to do something like this: struct a_name { std::string name; }; a_name names[] = { std::string("one"), std::string("two") }; std::for_each( &names[0], &names[1], if_(1) [ std::cout << arg1.name ] ); but VC8 complains "error C2039: 'name' : is not a member of 'boost::phoenix::actor<Eval>'" Can anyone tell me what I'm doing wrong here? Thanks for your insights, - Bruce

2 1

Re: [Boost-users] [Statechart] Passing reference tocreate_processor()
by Andreas Huber 22 Apr '09

22 Apr '09

Hi Igor > I've got the same problem now. Is there > any solution or workaround so far? No, sorry. I haven't yet had sufficient time to find the root cause. I hope I'll get to it tomorrow. Regards, Andreas

1 0

[statechart] Question about do activities
by Bill Clark 22 Apr '09

22 Apr '09

In the boost::statechart documentation, on the UML mapping page, it says this about do activities: “A do activity can be simulated with a separate thread that is started in the entry action and cancelled (!) in the exit action of a particular state.” What's the significance of the exclamation point here? Is it suggesting that the thread should be killed rather than joined? I'm considering boost::statechart for a design where do activities will be a fundamental feature, so I'm wondering whether we might run into problems with this.

3 5

binding to new
by Noah Roberts 22 Apr '09

22 Apr '09

I have a factory that returns an instance of a concrete under an abstraction. It works by matching a "command" string to a command handler that is created and returned to the client. It's basically a stack of regex->creator pairs. The creator is a function that returns a pointer to the abstract type. I'd like to provide that function by binding to the new operator. Currently I have a static function in each concrete type that just calls new and I bind to it. I can't think of what syntax I would use to bind to new and am inclined to think it impossible, but I thought I'd ask.

2 1

Compiling exception/get_error_info.hpp in Visual Stuido UNICODE project
by Oleg V. Zhylin 22 Apr '09

22 Apr '09

Hi, I'm trying to compile my project in MS Visual Studio 2008 with UNICODE and _UNICODE symbols defined. This automatically makes std::string resolve to std::wstring. I'm having a problem compiling exception/get_error_info.hpp because of the following code struct strwrap { std::string str; char const * ptr; explicit strwrap( char const * s ): str(s), ptr(&str[0]) { } Error messages quite predictably say about type inconsistency, there's a copy of them below my signature. Is there a known way to tweak boost to build seamlessly with Visual Studio Unicode projects? WBR Oleg V. Zhylin ovz(a)yahoo.com g:\Program Files\boost\boost_1_38\boost\exception\get_error_info.hpp(30) : error C2664: 'std::basic_string<_Elem,_Traits,_Ax>::basic_string(const std::basic_string<_Elem,_Traits,_Ax>::_Alloc &)' : cannot convert parameter 1 from 'const char *' to 'const std::basic_string<_Elem,_Traits,_Ax>::_Alloc &' with [ _Elem=wchar_t, _Traits=std::char_traits<wchar_t>, _Ax=std::allocator<wchar_t> ] and [ _Elem=wchar_t, _Traits=std::char_traits<wchar_t>, _Ax=std::allocator<wchar_t> ] Reason: cannot convert from 'const char *' to 'const std::basic_string<_Elem,_Traits,_Ax>::_Alloc' with [ _Elem=wchar_t, _Traits=std::char_traits<wchar_t>, _Ax=std::allocator<wchar_t> ] No constructor could take the source type, or constructor overload resolution was ambiguous g:\Program Files\boost\boost_1_38\boost\exception\get_error_info.hpp(30) : error C2440: 'initializing' : cannot convert from 'std::allocator<_Ty>::value_type *' to 'const char *' with [ _Ty=wchar_t ] Types pointed to are unrelated; conversion requires reinterpret_cast, C-style cast or function-style cast g:\Program Files\boost\boost_1_38\boost\exception\get_error_info.hpp(30) : error C2439: 'boost::exception_detail::strwrap::ptr' : member could not be initialized g:\Program Files\boost\boost_1_38\boost\exception\get_error_info.hpp(24) : see declaration of 'boost::exception_detail::strwrap::ptr' g:\Program Files\boost\boost_1_38\boost\exception\diagnostic_information.hpp(60) : error C2664: 'std::basic_string<_Elem,_Traits,_Ax>::basic_string(const std::basic_string<_Elem,_Traits,_Ax>::_Myt &)' : cannot convert parameter 1 from 'std::basic_ostringstream<_Elem,_Traits,_Alloc>::_Mystr' to 'const std::basic_string<_Elem,_Traits,_Ax>::_Myt &' with [ _Elem=wchar_t, _Traits=std::char_traits<wchar_t>, _Ax=std::allocator<wchar_t> ] and [ _Elem=char, _Traits=std::char_traits<char>, _Alloc=std::allocator<char> ] and [ _Elem=wchar_t, _Traits=std::char_traits<wchar_t>, _Ax=std::allocator<wchar_t> ] Reason: cannot convert from 'std::basic_ostringstream<_Elem,_Traits,_Alloc>::_Mystr' to 'const std::basic_string<_Elem,_Traits,_Ax>::_Myt' with [ _Elem=char, _Traits=std::char_traits<char>, _Alloc=std::allocator<char> ] and [ _Elem=wchar_t, _Traits=std::char_traits<wchar_t>, _Ax=std::allocator<wchar_t> ] No constructor could take the source type, or constructor overload resolution was ambiguous

2 1

Re: [Boost-users] unwanted exported symbols in a DLL which statically links to Boost.Library
by John Dlugosz 22 Apr '09

22 Apr '09

> Date: Wed, 22 Apr 2009 15:22:31 +0200 > From: "Luca Cappa" <luca.cappa(a)sequoia.it> > Subject: [Boost-users] unwanted exported symbols in a DLL which > statically links to Boost.Library > To: boost-users(a)lists.boost.org > Message-ID: <op.ussh3tr5r4jy9l(a)vortex.homenet.telecomitalia.it> > Hello, > > I am creating a DLL using the VisualC++ 8sp1, which statically links to > Boost.Library, and also to another static library, which links to > Boost.Library statically too. > > In the export section of the built DLL I see, among the few public > functions which it should export, hundreds of exported functions like > the > ones below. I would really like to export the symbols the DLL defines > as > exported, and not anything else which is unexpectly exported, like the > ones shown below: > I'm not familiar with Boost's libs, but I am good with Windows, and DLL stuff in particular. So maybe I can offer some advice, which may be of help when combined with some information from others. I would agree that if the library containing those functions is static, it should not export anything. It's difficult to cause anything to be exported (nearly impossible for C++ decorated names, IME) other than by decorating the declaration of that function or variable, or the class containing it. On VC++, the decoration appears at the beginning and takes the form __declspec(dllexport) To unravel the macros and conditional compilation, pass one of the files through the preprocessor only. Do this in Visual Studio by opening the properties window for just the one CPP file (not the project itself). Under C/C++, Command Line, add the "/E" option, without the quotes, where you can type Additional Options. Then right-click on the filename in the solution explorer and choose to compile just that file. It won't actually compile, but it will produce another text file (I forget where it puts it). Change it back before Visual Studio gets confused. If "dllimport" is in that text somewhere, it is indeed doing that on purpose. TradeStation Group, Inc. is a publicly-traded holding company (NASDAQ GS: TRAD) of three operating subsidiaries, TradeStation Securities, Inc. (Member NYSE, FINRA, SIPC and NFA), TradeStation Technologies, Inc., a trading software and subscription company, and TradeStation Europe Limited, a United Kingdom, FSA-authorized introducing brokerage firm. None of these companies provides trading or investment advice, recommendations or endorsements of any kind. The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon, this information by persons or entities other than the intended recipient is prohibited. If you received this in error, please contact the sender and delete the material from any computer.

1 0

error while loading shared libraries
by ChristinaDRS 22 Apr '09

22 Apr '09

Greetings all, I first created a class for a library like this: library.h: class Library { public: Library() { }; ~Library() { }; void testLib(); }; library.cpp: #include "library.h" #include <boost/thread/mutex.hpp> #include <boost/thread.hpp> #include <iostream> using namespace std; void Library::testLib() { boost::thread* lt; boost::mutex mu; boost::mutex::scoped_lock lock(mu); cout << "test!" << endl; } I then created the static library like so: g++ -I ~/boost_1_38_0/ -c library.cpp ar rcs libtest.a library.o and then I created a main.cpp like so: #include "library.h" #include <iostream> using namespace std; int main() { Library l; l.testLib(); } now when I try to compile main.cpp like this: $ g++ -I ~/boost_1_38_0/ -I. main.cpp -o main -L/usr/local/lib/ -L. -ltest -lboost_thread-gcc41- now when I run main: $ ./main ./main: error while loading shared libraries: libboost_thread-gcc41-mt-1_38.so.1.38.0: cannot open shared object file: No such file or directory I get that error. Can anyone explain why? -- View this message in context: http://www.nabble.com/error-while-loading-shared-libraries-tp23175557p23175… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

unwanted exported symbols in a DLL which statically links to Boost.Library
by Luca Cappa 22 Apr '09

22 Apr '09

Hello, I am creating a DLL using the VisualC++ 8sp1, which statically links to Boost.Library, and also to another static library, which links to Boost.Library statically too. In the export section of the built DLL I see, among the few public functions which it should export, hundreds of exported functions like the ones below. I would really like to export the symbols the DLL defines as exported, and not anything else which is unexpectly exported, like the ones shown below: boost::archive::detail::oserializer<class boost::archive::xml_oarchive,struct sqy::Vector2<float> >::oserializer<class boost::archive::xml_oarchive,struct sqy::Vector2<float> >(void) boost::archive::detail::oserializer<class boost::archive::xml_oarchive,struct sqy::Vector2<float> >::oserializer<class boost::archive::xml_oarchive,struct sqy::Vector2<float> >(void) boost::archive::detail::oserializer<class boost::archive::xml_oarchive,struct sqy::Vector2<double> >::oserializer<class boost::archive::xml_oarchive,struct sqy::Vector2<double> >(void) In my static library, which statically link to the Boost.Serialization library, I have the following code which explicitly instantiate some template type on a set of a priori known datatypes: template MYLIB_API struct sqy::Vector2<int>; template MYLIB_API struct sqy::Vector2<float>; template MYLIB_API struct sqy::Vector2<double>; template MYLIB_API struct sqy::Vector2<size_t>; #define INSTANTIATE_VECTOR2_SERIALIZATION(x)\ template void MYLIB_API Vector2<x>::serialize<boost::archive::xml_oarchive> (\ boost::archive::xml_oarchive&, const unsigned int);\ template void MYLIB_API Vector2<x>::serialize<boost::archive::xml_iarchive> (\ boost::archive::xml_iarchive&, const unsigned int); INSTANTIATE_VECTOR2_SERIALIZATION(int); INSTANTIATE_VECTOR2_SERIALIZATION(float); INSTANTIATE_VECTOR2_SERIALIZATION(double); INSTANTIATE_VECTOR2_SERIALIZATION(size_t); Notice that, when the DLL is created, MYLIB_API is defined like # define MYLIB_API so i wonder where those symbols above comes from? Anyone could help me to remove from the DLL exporting section those unwanted symbols? Many thanks in advance, Luca

2 1

[multi_array] warning #279 in icc 11.0
by Anton Daneyko 22 Apr '09

22 Apr '09

Hello, I get "warning #279: controlling expression is constant" (full text in attachment). Is there a way to disable that? I tried the following in my source, but it seem to have no effect. #pragma warning ( push ) #pragma warning ( disable: 279 ) #include "boost/multi_array.hpp" #pragma warning( pop ) My icc version: $icc --version icc (ICC) 11.0 20081105 Regards, Anton Daneyko.

2 1

ptime on Win32?
by Del 22 Apr '09

22 Apr '09

Hi, I've been trying to use the boost local_time() function in a win32 program using mingw. After I inserted the call into my program, the program started to crash. So, I wrote a very simple test program: #include <iostream> #include <boost/date_time/posix_time/posix_time.hpp> using namespace boost::posix_time; int WinMain(HINSTANCE,HINSTANCE,LPSTR,int) { ptime time = microsec_clock::local_time();; std::cout << "The current time is " << time << std::endl; return 0; } It compiles and links fine, but when I run the program, I end up with this error message: This application has requested the Runtime to terminate it in an unusual way. Please contact the application's support team for more information. Any ideas?

3 3

Modifying Dijkstra's Shortest Paths algorithm in Boost::Graph to not relax certain edges
by Artyom 22 Apr '09

22 Apr '09

Hi, I am using Boost::Graph and DSP which comes with it to work out shortest paths around my graph. The problem is there is a certain exceptional situation when certain vertices can become unreachable along certain paths. I.e. although there is a valid distance value for edge B ? C, the same edge can become invalid if B is reached along a specific path. If this happens, I want DSP to reject that edge. I attempted to create a list of visitors. EdgeRelaxed records how vertices in the DSP queue were reached. EdgeExamined checks for the exceptional situation and if it's detected, it temporarily changes the distance value of the edge in question to infinity. EdgeNotRelaxed then restores the distance value to it's original. Unfortunately this approach doesn't seem to work, I think the reason for this is because dijkstras_shortest_paths() function gets information about distances from the weight_map which is passed to it. Is there any way I can modify the values inside the weight_map in between DSP stages to invalidate certain paths which will result in them being rejected for relaxation? Or perhaps there is an easier and tidier way of achieving the same result? Thanks in advance, Arty

4 4

Why must a Single Pass Range be default constructible?
by athor 22 Apr '09

22 Apr '09

A Range does not require copy semantics according to the boost docs. http://www.boost.org/doc/libs/1_38_0/libs/range/doc/range.html The SinglePassRangeConcept (and all range concepts using it) requires a range to be default constructible. (There is a line "T a;" in the concept The default constructible requirement means an abstract base class can never implement any Range Concept. If a range does not require any copy semantics, I don't see why it must be default constructible? Are there any good reasons I don't know about? A change from "T a;" to "const T& a" in concepts.hpp would do the trick... Example: struct AbstractArraySlice { int* begin() const = 0; int* end() const = 0; }; // FAILS: BOOST_CONCEPT_ASSERT((SinglePassRangeConcept<AbstractArraySlice>)) Footnote: I often use abstract base classes to verify my algorithms do not use more functionality than necessary and it annoys me that I can't use the range concept check: struct TestSum { const AbstractArraySlice& r; void Test() { CalculateSum(r); } }; template<class T> T CalculateSum(const T& range) <... function requires SinglePassRangeConcept ...> -- View this message in context: http://www.nabble.com/Why-must-a-Single-Pass-Range-be-default-constructible… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

Scoped_array with constructors?
by Space Ship Traveller 21 Apr '09

21 Apr '09

Hi, I want to use scoped_ptr with std::vector or scoped_array, but the problem is that the type I want to allocate has a non-trivial constructor. What is the standard way to make this work? My current best guess is to use std::vector with boost::scoped_ptr in the following way: TextureUnitsController::TextureUnitsController () { GLint textureUnitCount = 1; glGetIntegerv(GL_MAX_TEXTURE_UNITS, &textureUnitCount); m_textureUnits.resize(textureUnitCount); for (unsigned i = 0; i < textureUnitCount; i += 1) { m_textureUnits[i].reset(new TextureUnit(GL_TEXTURE0 + i)); } std::cerr << "Found " << textureUnitCount << " texture units..." << std::endl; } But this doesn't work because scoped_ptr also has a non-trivial constructor, so resize fails. Thanks Samuel

5 5

How to build boost for iPhone?
by Manfred Schwind 21 Apr '09

21 Apr '09

Hi, I tried to build boost for iPhone on Mac OS X. If I try the following ... bjam --prefix=/somePath toolset=darwin target-os=iphone macosx- version=iphone-2.0 define=_LITTLE_ENDIAN link=static install ... the libraries will build fine, but they are i386 code, not arm, so there're unusable. But if I add architecture=arm ... bjam --prefix=/somePath toolset=darwin architecture=arm target- os=iphone macosx-version=iphone-2.0 define=_LITTLE_ENDIAN link=static install ... the whole thing just does not build. It fails very early with the following error: g++-4.0: installation problem, cannot exec '/usr/bin/arm-apple-darwin9- g++-4.0.1': No such file or directory Any ideas/hints how to build the boost libraries for the iPhone? (By the way, /usr/bin/arm-apple-darwin9-g++-4.0.1 is existing on my Mac.) Thanks in advance, Mani -- http://mani.de - friendly software iVolume - listen to music freehand Sahara - sand in your pocket Watchdog - baffle the curious LittleSecrets - the encrypted notepad

2 1

Re: [Boost-users] boost variant compile time visitation: verification
by Hicham Mouline 21 Apr '09

21 Apr '09

Following my prev message, I wrote the following test on a win platform, compiled with VS2005 /O2 in release mode #include <iostream> #include <boost/variant/variant.hpp> #include <windows.h> typedef boost::variant<int, double, char> VT; struct print_type : public boost::static_visitor<const char*> { const char* operator()( int ) { return "int"; } const char* operator()( double ) { return "double"; } const char* operator()( char ) { return "char"; } }; int main() { const VT v('c'); LARGE_INTEGER usec0, usec1; const char* volatile res; QueryPerformanceCounter( &usec0 ); for(size_t s=0; s<2000000; ++s) res = v.apply_visitor( print_type() ); QueryPerformanceCounter( &usec1 ); std::cout<< (usec1.QuadPart - usec0.QuadPart) <<std::endl; QueryPerformanceCounter( &usec0 ); for(size_t s=0; s<2000000; ++s) res = "char"; QueryPerformanceCounter( &usec1 ); std::cout<< (usec1.QuadPart - usec0.QuadPart) <<std::endl; } There is no statistically significant difference between the 2 cases. Can I deduce that at least on this platform, for this code, the visitation is done at compile-time? Rds,

3 3

Why doesn't boost use empty throws() list?
by Joseph Garvin 21 Apr '09

21 Apr '09

For example, all the smart pointer headers have: // never throws Next to their definitions, rather than an actual "throws()". I'd guess this has to do with compiler compatibility, but there are already plenty of macro hacks for enabling/disabling details like this on a compiler by compiler basis. Just curious.

4 3

[Graph] How to get the key given a value in property_map
by Phani Deepak Parasuramuni 21 Apr '09

21 Apr '09

hi, i want to name the vertices and add the edges between vertices by referring to their names dynamicaly. i 'll have something like this. typedef boost::property<boost::vertex_name_t, string> VName; typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, VName > Graph; typedef boost::property_map<Graph, boost::vertex_name_t>::type VertexNames; Graph g; VertexNames names = get(vertex_name, g); boost::add_vertex(VName("me") , g); boost::add_vertex(VName("myNeighbour") , g); i want to be able to do something like this. boost::add_edge( names.getKey("me"), names.getKey("myNeighbour") ,g); // but there is no any such kind of property_map i looked around and found that there are ways to get the name of vertex if i have a vertex_descriptor but how can i get a vertex_descriptor given the vertex_name there are only three ops defined on property_map :- get,put,iterator; is there any other way to get the key from value other than iterating through all the pairs in property_map & matching each pair.second with vertex_name? pardon me if it is a basic thing, i just cant able to get at it. Any help would be greatly appreciated. Thanks, Phani.

2 1

Blocking receive in message queue
by Johan Mazel 21 Apr '09

21 Apr '09

Hi I'm trying to use a message with a blocked (or timeout) receiver through the receive (or timed_receive) method(s). But the problem is that I can open the message once and then, I always get the "No such file or directory" message. It looks like the method can open the message queue on reading mode only once since each time that I launch it after, it ends right after the constructor of the message_queue object. I forced the program which send data on the message queue to be running through an infinite loop and I don't use a destructor on the message object inside the sending program. So I assume that the message_queue is still there. So, my question is : is there a real limitation which force me to open the message queue only one time in open_only mode ? Thanks in advance for the help. Johan Mazel

1 0

[graph]
by liquid 21 Apr '09

21 Apr '09

I'd like to have unique vertices in a graph based on index of type std::string. I did the following coding. typedef property<edge_weight_t,float> EProperty; typedef property<vertex_index_t,string> VIndex; typedef adjacency_list<setS,listS,directedS,VIndex,EProperty> Graph; typedef property_map<Graph, vertex_index_t>::type VIndexMap; graph_traits<Graph>::vertex_descriptor addv(property_traits<VIndexMap>::value_type v,Graph &g) { graph_traits<Graph>::vertex_descriptor vd; vd = add_vertex(VIndex(v),g); return vd; } Does "add_vertex" check the existence of added vertices of given index? No, it doesn't. Or I do something wrong. Regards liquid

2 3

boost variant compile time visitation: verification
by Hicham Mouline 21 Apr '09

21 Apr '09

Hello, #include <iostream> #include <boost/variant/variant.hpp> typedef boost::variant<int, double, char> VT; struct print_type : public boost::static_visitor<const char*> { const char* operator()( int ) { return "int"; } const char* operator()( double ) { return "double"; } const char* operator()( char ) { return "char"; } }; int main() { VT v('c'); std::cout<< v.apply_visitor( print_type() ) <<std::endl;; } If I understood the doc correctly, the visitation is supposed to be compile-time, that is, v.apply_visitor( print_type() ) is already "char" before the program start... Is this right? If so, is there a way to see this in the binary executable file? Maybe viewing symbols? I have access to vs2005 and g++3/4 /linux platforms. It would be so fantastic if compilers output _also_ the C++ source resulting from the template machinery! Best regards,

2 1

unordered_map serialization
by gtsml owevwr 21 Apr '09

21 Apr '09

Hi, I cannot find any serialization code for unordered_map in boost, am I missing something? I'm using boost 1.36, header <boost/unordered_map.hpp>. I could not find anything in 1.38 neither. Is the header <boost/serialization/hash_map> related? I have to say that I'm a bit confuse with the whole TR1 stuff (it seems to be related). Anyway, I can still convert to a list and serialize I guess, but if there's already something somewhere... Any suggestion welcome, Frank

2 2

[Boost-announce] Review Conclusion - Futures Library
by Tom Brinkman 21 Apr '09

21 Apr '09

Review Conclusion - Futures Library Braddock Gaskill http://braddock.com/~braddock/future Anthony Williams http://www.justsoftwaresolutions.co.uk/files/n2561_future.hpp The lack of examples and documentation made them difficult to review. Nevertheless, Anthony Williams futures library did receive almost unanimous and enthusiastic support. Unfortunately, the depth of the support was very shallow. I just finished my first read of Anthony's book "C++ Concurrency in Action and acknowledge his expertise in the areas of multi threaded and parallel programming. (http://www.manning.com/williams/) Anthony is the maintainer of boost::threads. Anthony's Future library has been approved for the next major release of c++ standard. Conclusion Braddock Gaskill - Rejected Anthony Williams - Approved Anthony's Futures library is approved for inclusion into boost::threads. As he is the maintainer of that library, he should be given maximum latitude about how that is to be done. In the future, if Anthony wants to re-publish the library as a top-level boost library, then he needs to resubmit it again with samples and test cases, which are lacking. Requirements As per the usual boost library requirements, examples and test cases are needed. Anthony should also improve the documentation, which should not be a problem as he is a prolific author in the area of multi threaded programming. Review Manager Tom Brinkman _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

1 0

[date_time] runtime error with intel c++ 11.0.072 (win32) and ptime's time_from_string()
by Edward Rankin 21 Apr '09

21 Apr '09

Hi all, I have encountered a runtime error when date_time tries to parse a time from a delimited string when compiled with intel c++ 11 in release mode. The following code is what I used to replicate the error: int main(int argc, char** argv) { using namespace boost::posix_time; ptime first = microsec_clock::local_time(); std::string temp = to_simple_string(first); ptime second = time_from_string(temp); // it crashes here } It works when using msvc9's compiler in debug and release mode and intel c++ 11 debug mode. Any idea how to resolve this? Thanks, Edward

1 0

[concept check][mpl] (Conditional) Concept checking for functions
by Jesse Perla 21 Apr '09

21 Apr '09

I have a variety of user defined function objects that I will need to call. Take the following examples:template<int N1, int N2 = 0> struct Func1{ double operator()(boost::array<double, N1>& x1, boost::array<double, N2>& x2){...}}; template<int N1> struct Func2{ double operator()(boost::array<double, N1>& x){...}}; With a function such as template<int N1, int N2 = 0, class F = boost::function<double (boost::array<double, N1>& x1, boost::array<double, N2>& x2)> class DPP{ void solve(){...... uses F...to be discussed} }; I have a few questions: 1) Is there a relatively easy way to use boost concept check to verify that F follows the first function signature so that I can detect compile time the problem? I can't figure out how to do it from the concept check docs, and they say they are out of date. Usage I want to check in the instantiation of DPP: F f; f(boost::array<double, N1>& x1, boost::array<double, N2>& x2) 2) I want the user to be able to pass in a simplified function type if N2 = 0 I assume that to call the actual function I would have some kind of impl function with partial specialization such as: template<bool use_simplified, int N1, int N2> struct use_f_impl(); template<int N1, int N2> struct use_f_impl<true, N1, N2>{ static double use_f() { STATIC_ASSERT(N2 == 0); F f; boost::array<double, N1> x; return f(x); } }; template<int N1, int N2> struct use_f_impl<false, N1, N2>{ static double use_f() { F f; boost::array<double, N1> x1; boost::array<double, N2> x2; return f(x1, x2); } }; And then in my solve() function I go: double val = use_f<(N2 == 0, N1, N2)>::use_f(); Is this the right idiom, pattern, etc? Do I need to use the struct with a static function since function templates don't have partial specialization? 3) Now what if I want to do a concept check on the F passed into DPP? It has to be conditional on the N2 value now. How would I do this? 4) Lets say that I don't want to force them to use the simplified version of the function signature if they don't want to. Can I automatically detect the signature and put it into a flag integer in the class? i.e. inside of the DPP class: static bool use_simple = IsSimple<F>::value; Then pass in the use_simple value when calling use_f_impl. If so, what would the IsSimple metafunction look like and can concept check help? Thanks, Jesse

9 29

[interprocess] 32 to 64 bit ?
by Stephan Menzel 20 Apr '09

20 Apr '09

Hi there, before holidays kick in I wondered whether I go for a strange problem in my usage of interprocess. Im using it within boost 1.38 on windows, msvc. Basically, I transfer data between two processes, which works great. So far, both have been built 32 bit release. But now since I exclusively use supposedly safe data types in the shared mem such as boost::uint32_t and friends I was wondering whether it's possible to have the data retrieving process built in 64 bit and access the same buffer. I just gave it a shot and it behaves different to what I had hoped for. In blocks during finding a struct with in a shared segment. ret = segment->find<struct my_buffer>(unique_instance).first; This operation blocks on a mutex in segment_manager.hpp: #ifdef BOOST_INTERPROCESS_RVALUE_REFERENCE scoped_lock<rmutex> #else detail::move_return<scoped_lock<rmutex> > #endif priv_get_lock(bool use_lock) { scoped_lock<rmutex> local(m_header, defer_lock); if(use_lock){ local.lock(); // <----- here! } return local; } .. never to return. The code is the same as in my 32 - 32 bit versions and known to work. Now I'm wondering, is this supposed to work or is 32 to 64 bit transfer not supported at all? Is this a bug or a feature? Do I have to have both applications in a 64 bit version? Cheers, Stephan

4 5

[repost][threads] recursive shared_mutex
by JOAQUIN M. LOPEZ MUÑOZ 20 Apr '09

20 Apr '09

Hi, allow me to repost this query of mine that went without much attention at first try... As the docs do not explicitly say otherwise, I guess I must assume that boost::shared_mutex is not recursive with respect to unique ownership, that is, the following behavior ensues: shared_mutex mutex; lock_guard<shared_mutex> lock1(mutex); lock_guard<shared_mutex> lock2(mutex); // DEADLOCK Is this so? In case boost::shared_mutex is indeed non-recursive, I've read the following assertion on Hinnant's paper N2406 (http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2406.html ): "A recursive shared mutex could be built upon shared_mutex if desired, but this is not proposed." Does anyone has a reference on how to construct a recursive shared_mutex from a non-recursive one? Thank you, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

[lexical_cast] How is the degenerate case handled?
by Robert Jones 20 Apr '09

20 Apr '09

If you use lexical_cast to cast between identical types, eg. lexical_cast< int >( 4 ); does it go through all the machinery of streaming out and back, or does it short circuit? In those circumstances, does the type need to be streamable? Thanks, Rob.

6 6

Serialization of intrusive_ptr's?
by Jared Lee Richardson 20 Apr '09

20 Apr '09

Hey, quick question, what do I need to do to serialize intrusive_ptr's? I don't see anything in the serialization documentation to indicate that it supports it, does it? If not, is there an easy way? Or do I need to serialize the raw pointers and re-construct the intrusive_ptr's one by one? I'm storing intrusive_ptr's inside std container classes(map, list). Thanks, Jared

2 2

[serialization] deriving from xml_iarchive
by Kenny Riddile 20 Apr '09

20 Apr '09

I have a situation where I want an additional piece of data to be owned by the archive type we're using. Previously, I had this typedef that's used throughout our code: typedef boost::archive::xml_iarchive IutputArchive; I changed it to something like this: class InputArchive : public boost::archive::xml_iarchive { public: InputArchive( std::istream& is, Foo bar ) : boost::archive::xml_iarchive( is ) , m_bar( bar ) Foo GetFoo() const { return m_bar; } private: Foo m_bar; }; The problem I'm seeing is that whenever a serializable class's serialize() method is invoked via an InputArchive object, the template parameter to serialize() is instantiated with boost::archive::xml_iarchive, not InputArchive, which I need. Is it possible to get the behavior I want through public derivation like this, or is there a better way?

4 11

who uses ASIO
by suresh k 20 Apr '09

20 Apr '09

hi , I'm not sure if this is the right forum to ask this question, so pls redirect or ignore this mail. Do we have any information on any popular/network-intensive software which uses Boost ASIO ? Is this published any where ? thanks, - Suresh

3 2