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

Re: [Boost-users] [wave]include not found
by Ein Held 31 Mar '09

31 Mar '09

Here we go: http://rapidshare.com/files/215649826/wave.zip.html or http://uploaded.to/?id=ndz0tn

1 0

[Q] does map.erase destroy shared_ptr ?
by V S P 31 Mar '09

31 Mar '09

Hello, I am storing database streams as associated string tag as std::map< std::string, boost::shared_ptr<otl_stream> > once in a while I need to remove a stream based on the tag, so I do //find stream based on tag //close stream s->close //call map.erase can I expect that once I call map erase the destructor of the stream will get called? (for some reason I do not see my trace statement of the destructor, but the stream destruction are unfamiliar code to me.. so I may be just doing something wrong). thank you, Vlad -- V S P toreason(a)fastmail.fm -- http://www.fastmail.fm - Faster than the air-speed velocity of an unladen european swallow

2 1

Returning a shared_ptr or raw pointer from a template function
by Ryan McConnehey 31 Mar '09

31 Mar '09

I want to allow the user to specify if a function returns a raw pointer or a shared_ptr from a creation type function. The code I've started with is as follows: class Track{}; class Tm{}; template <class R, class T> R create(void) { R temp(new T()); return temp; } This allows to the user to call the function like: Tm* tm3 = create<Tm*, Tm>(); boost::shared_ptr<Tm> tm4 = create<boost::shared_ptr<Tm>, Tm>(); I would like to have a class that has this create function and upon creation of the class specify if the create function returns a raw pointer or shared_ptr. template <class U> //The U specifies is the create function returns a raw or shared pointer class Rdi { template <class S> U create(void) { U temp(new S()); return temp; } }; How would I modify this class to allow the user to make the following calls? Rdi<boost::shared_ptr> fun1; Tm* tm3 = fun1.create<Tm>(); Rdi<raw Pointer???> fun2; boost::shared_ptr<Tm> tm4 = fun2.create<Tm>(); Any help would be appreciated. Ryan

2 1

[wave]include not found
by Ein Held 31 Mar '09

31 Mar '09

Hello According to the wave documentation, the include folder functions of the context object work "are modelled after the command line behaviour implemented by the popular gcc compiler." Unfortunately this is wrong. By default gcc 4.x -Is' folders (when not used with -I-) are searched for "...." and <...> include files. Wave does not do so. Anyway, I am searching for a solution for this problem: Lets say I got a file named dub.cpp that I am parsing with wave and that looks like that: #include <foo/bar.hpp> int main{} bar.hpp looks like this: #include "test.hpp" extern int a; test.hpp is just an empty file in the same folder as bar.hpp I added the parent folder of foo to the wave context object via add_sysinclude_path . Unfortunately wave does not find the file test.hpp (exception - "error - could not find include file"). I tried nearly all possible combinations of add_include_path, add_sysinclude_path, set_sysinclude_delimiter - but I have not succeeded. This simple sample is still failing.. gcc -c -I"/foo/parent/folder" dub.cpp works fine though. Whats wrong?

2 1

Completely Perplexed Noob to BGL: Reachability Question
by Roshan Rammohan 31 Mar '09

31 Mar '09

Hi all, Although I was attracted to BGL since I have to use a lot of graph algorithms for my work, and I have managed to read through as much online documentation as possible, generic programming is still very mysterious to me. All I need to do is compute reachability from vertex B to vertex A before I add the edge A->B to a graph (directed and acyclic) so that I can maintain its acyclic property. I do not want to add the edge, discover a cycle and then remove it. I saw a very closely related example here. (thanks to Steven Watanabe) http://lists.boost.org/boost-users/2009/03/46396.php That was helpful, but I'm still not able to adapt this to my need mainly because I find the syntax and concepts of generic programming extremely confusing. I am not sure how I can pass an extra parameter into a BFSVisitor which the member function discover_vertex can use. Does discover_vertex have to have only a vertex_descriptor and a Graph? I want to pass another constant vertex to it so I can return on equality. I need to initiate a BFS from vertex B, (and not continue with new trees once the tree with B as root is finished) . On discovering vertex A in this search I need to return true, false for all other cases. Pretty simple, and I am hoping someone would write a code snippet for me that will solve the problem and also provide me with the baby step I need to wrap my head around this Visitor concept. Thanks in advance. - Roshan Rammohan PhD Candidate, A.I. lab, Dept of C.S., Univ. of New Mexico, USA

6 6

[statechart] state behaviour
by liquid 30 Mar '09

30 Mar '09

Hi, two questions about states in statechart: 1. How (if possible) to implement this: a state upon an event generates an event and transits to another state? 2. Can a state have private nondestroyable memory? Regards liquid

2 2

Re: [Boost-users] regex iterator question
by Mike Marchywka 30 Mar '09

30 Mar '09

---------------------------------------- > To: boost-users(a)lists.boost.org > Date: Mon, 30 Mar 2009 12:48:48 -0400 > From: dfs(a)savarese.org > Subject: Re: [Boost-users] regex iterator question > > > In message , "Robert Ramey" writes: >>Thinking about it, this problem must come very often. How is it usually >>addressed? There must be a simple bridge across this. In a pinch, I'll >>just have to load the whole file into some sort collection, but I prefer the >>ultimate unlimited file size solution. > I always like unbounded solutions too but if you try to stream a file past a regex-er it is likely to be slow, and as pointed out by others, not even reasonable in the general case although you may want to think about specialized cases that may benefit from any restricted set of regex'es you have. You would have to think about "strategies" or similar notions that look at the problem and pick an approach or specific implementation based on parameters. I originally came here to do 1000's of REGEX queries on megabyte strings and ultimately used Boost and Greta for testing but quickly found ways to compile query/sample vectors and implement restricted searches once I found all the not-so-regular expressions fit a given constraint or could even do simple things like sorts to preserve locality later. There are a lot of potential performance limitations depending on the specific task parameters and machine. But, yes, it would be nice if someone had a general "strategy" library. LOL. > In the worst case, if you're using Perl-style expressions (or any style > that isn't strictly "regular" and requires backtracking; lookahead > assertions are a common culprit), the entire input may have to be > consumed and buffered even if the expression ultimately matches only a > few characters (see "On the Use of Regular Expressions for Searching Text", > Clark and Cormack, ACM Transactions on Programming Languages and Systems, > Vol 19, No. 3, pp 413-426.). Therefore, if you're dealing with small > files, you may as well buffer the entire file in a char array and use > regex_token_iterator. If you're dealing with large files, > memory map the file instead. > > daniel > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users _________________________________________________________________ Internet Explorer 8 – Get your Hotmail Accelerated. Download free! http://clk.atdmt.com/MRT/go/141323790/direct/01/

2 2

Re: [Boost-users] Using boost regex dll in code
by John Maddock 30 Mar '09

30 Mar '09

> Is there a way to contact you directly? I believe my confusion can be > solved rather quickly w/o using the user groups. You can use the john - at - johnmaddock.co.uk address to mail me directly, but I'll be offline for the day very shortly, Regards, John.

1 0

regex iterator question
by Robert Ramey 30 Mar '09

30 Mar '09

I've got a need for regex and I would like to use it to extract tokens matching a regular expresssion from a file stream. Seems like this would be a common desire. So first shot is boost::regex_token_iterator<some_input_iterator> This doesn't work since regex_token_iterator requires a bidirectional iterator. Seems reasonable enough. So next I comb through boost and find #include <boost/spirit/iterator/multi_pass.hpp> and try boost::regex_token_iterator< boost::spirit::multi_pass<some_input_iterator> > I'm thinking this is veeeeeery cool - maybe a 1000 lines of free code included for the price of one. But, doesn't work. multi_pass is a forward_trasversal iterator while regex_token_iterator requires a bidirectional_trasversal_iterator. A huge disappoint to come soooo close. Thinking about it, this problem must come very often. How is it usually addressed? There must be a simple bridge across this. In a pinch, I'll just have to load the whole file into some sort collection, but I prefer the ultimate unlimited file size solution. Robert Ramey

3 3

boost.statechart - a data driven state machine
by dev＠kostiadis.com 30 Mar '09

30 Mar '09

Hello all, I'm using the statechart library to create a generic state machine that I can reuse in a number of projects. I'd like this state machine to be completely data driven because it will massively simplify testing and experimenting with different behaviours (i.e. I won't have to re-compile and produce new executables to try out a simple change). Instead of hard-coding all the states, events, transitions, etc., I would like to read all those in from a config file (text, csv, xml, whatever). I'm pretty sure I can't be the first person to want this. Is there an implementation of this out there somewhere? Are there any docs/links/etc. that will point me to the right direction? Thank you in advance, k.

1 0

Problem using Boost->String->Split
by professor rumsdiegeige 30 Mar '09

30 Mar '09

Hello, using Visual Studio 2005 and Boost 1.31, I'm trying to compile this: #include <boost/algorithm/string.hpp> #include <boost/algorithm/string/split.hpp> #include <vector> #include <string> using namespace boost::algorithm; typedef vector< string > split_vector_type; split_vector_type SplitVec; std::string r = std::string(sc); boost::algorithm::split( SplitVec, r, boost::algorithm::is_any_of(sep) ); But I get: error C2039: 'iterator': is not a member of "global namespace'' in iterator.hpp 37 What's wrong here? Thanx! Sabine Lorentz

2 3

Re: [Boost-users] Using boost regex dll in code
by John Maddock 30 Mar '09

30 Mar '09

> If I have the boost_regex 1_38 dll and lib for VC 8, what steps do I need > to > take in order to use it in my code? Is there anything else that I need > other than one of those? The headers would be a good start :-) You will need to define BOOST_REGEX_DYN_LINK when building so that the regex lib knows to import code from a dll, otherwise the default is for it to expect to static link. And also note that there are two dll's for VC8, one for the debug runtime and one for the release runtime. HTH, John.

2 1

[Intrusive] augmenting red black trees
by George Slavov 30 Mar '09

30 Mar '09

I want to know if it's possible to augment the red black tree structure offered by Boost.Intrusive. Specifically I need each node to contain some information like the max value of the subtree rooted at that node and this information should be updated during insert/delete operations. This is a fairly common thing, allowing you to do logarithmic queries that are specific to certain trees, so I'm surprised I couldn't find anything about it in the Boost.Intrusive docs. Regards, George Slavov

3 2

Thread local storage
by Oliver Abert 30 Mar '09

30 Mar '09

Hi Everyone, I am using Boost Threads (1.38) as threading library and I also use the thread_specific_ptr to store a minor amount of data per thread (I think currently it is like 5 different pointer values per thread). Technically everything works out fine, but I am having a performance problem on Mac OS X. On Linux the performance is 10 times faster than on Mac OS. If I use pthreads on Mac OS I have identical performance to the Linux version. Both versions are running on the same machine using 8 threads both. Is there any known problem with shared pointers on Mac OS? I have tried different versions of boost, compiled it myself and also used macports - every time same results on Mac OS. Any hit or possible workaround is very welcome :) Thanks and regards, Oliver

3 7

Re: [Boost-users] Using boost regex dll in code
by dhruva 30 Mar '09

30 Mar '09

Header files corresponding to regex and the dependencies if any (can be found through bcp) -dhruva ________________________________ From: "Green, Jason M NSWCDL, W33" <jason.m.green3(a)navy.mil> To: boost-users(a)lists.boost.org Sent: Monday, 30 March, 2009 6:12:41 PM Subject: [Boost-users] Using boost regex dll in code If I have the boost_regex 1_38 dll and lib for VC 8, what steps do I need to take in order to use it in my code? Is there anything else that I need other than one of those? Jason Unlimited freedom, unlimited storage. Get it now, on http://help.yahoo.com/l/in/yahoo/mail/yahoomail/tools/tools-08.html/

1 0

Using boost regex dll in code
by Green, Jason M NSWCDL, W33 30 Mar '09

30 Mar '09

If I have the boost_regex 1_38 dll and lib for VC 8, what steps do I need to take in order to use it in my code? Is there anything else that I need other than one of those? Jason

1 0

[asio] skipping data in tcp stream
by Roman Shmelev 30 Mar '09

30 Mar '09

HI! What we have: tcp connection, from which we read messages. each message = header(fixed len) + body(random len) header contains the length of body and crc to check if the header is not corrupted. Reading is done in two async steps - first the header is read, then memory for body is allocated and the body is read. Questions are: 1) if header is corrupted under some cases (header crc says body len could be wrong) then as I understand we must skip all body data and read the next message. How to skip? async_read_until seemed to be the solution, but manual told that it may read surplus data into streambuf - it will be hard to deal with that data because I am reading directly from socket to some allocated memory (as was told above) 2) actually, can it be that in tcp stream data will be corrupted? I guess, yes - so header contains bodylen and crc for body and for header? is such solution an overhead? 3) maybe I do some global design mistakes? Thank you!

3 4

String processing algorithms
by Aggelidis Nikos 30 Mar '09

30 Mar '09

hi to all,i am interested in implementing some string processing algorithms{eg boyer-moore , knuth morris prat} for educational purposes. This is the first "real" exposure i will have with boost. I've done a bit of searching and i think Xpressive is the corresponding library of boost, for string processing. From what i read Xpressive is a header-only template library, so i will have to study xpressive.hpp . Any other directions i should follow? thanks in advance for your trouble, nicolas

4 3

[boost][system] Linking problems with C++0x, boost 1.38, Intel C++ 11.0 on windows
by Jesse Perla 30 Mar '09

30 Mar '09

Just to see if it was possible and if I could use "auto", I tried to compile my program with /Qstd:C++0x on Intel Windows 11.0. I am using boost::filesystem (which I assume uses boost::system). I did not recompile these binaries with this flag turned on (partially because I don't know how to mess with bjam or if I needed to mess with settings). The only thing that appears to be failing is linking to boost system. I get the following unresolved externals: 1>sandbox.obj : error LNK2019: unresolved external symbol "class boost::system::error_category const & __cdecl boost::system::get_system_category(void)" (?get_system_category@system @boost@@YAABVerror_category@12@XZ) referenced in function ___sti__$E 1>sandbox.obj : error LNK2019: unresolved external symbol "class boost::system::error_category const & __cdecl boost::system::get_generic_category(void)" (?get_generic_category@system @boost@@YAABVerror_category@12@XZ) referenced in function ___sti__$E I thought maybe automatic linking was buggy, so I tried to add the following to linker inputs, but no luck: libboost_system-iw-mt-gd-1_38.lib Any ideas? Thanks, -Jesse

1 0

[boost] Any experiences with C++0x features with Intel C++ 11.0 on windows and boost?
by Jesse Perla 29 Mar '09

29 Mar '09

Has anyone tried messing around with the /Qstd:C++0x setting on Intel C++ 11.0 and used boost in the same project? I would love to use "auto" and simple "decltype" if possible, but I don't want to waste a bunch of time if this isn't likely to work with boost or is known to cause incomprehensible errors when mixed with older style generic programming. What about really simple use of the new lambdas? In practice, do you think this is premature and likely to cause major regressions in the future? I can't see how "auto" or "decltype" would change, but is simple lambda usage fairly stable in the converging C++0x specs? -Jesse

1 0

[parameter]Boost Parameter and template template arguments
by Jesse Perla 29 Mar '09

29 Mar '09

I have a class template with a large number of potential template parameters where I would like to use boost parameter. I understand that I can use integers with the int_<> wrapper, but is there any trick or design pattern to allow template template's? The problem is that I have class templates such as an interpolator which will take in a type and a dimension size, and a variety of function objects of the same type. If I can't use template templates, I am not sure how to make the design sane. For example, right now I have something like: template<int Dimension, class T = double, template <int Dim2, class T> template Interpolator = cubic_spline> class DPP; I don't think I can write a free function to solve the instantiation difficulty since many of the types are only used internally and I couldn't use function template argument deduction. -Jesse

2 1

Boost.lamba compile errror....
by Joost Kraaijeveld 29 Mar '09

29 Mar '09

Hi, I want to sort a Matrix of Vectors according to their difference in length to some arbitrary Vector. e.g: template< typename T> struct MatrixVector : std::vector< T > { ... double length() const; MatrixVector<T> difference(const MatrixVector< T>& rhs) const; ... } template< typename T > MatrixVector< T > operator-(const MatrixVector< T >& lhs, const MatrixVector< T >& rhs) { return lhs.difference(rhs); } typedef MatrixVector< double > Vector; typedef std::vector< Vector > Matrix; ... Matrix matrix; matrix.push_back(some vectors); // multiple! std::sort( matrix.begin(), matrix.end(), boost::lambda::bind(&Vector::difference, boost::lambda::_1, observation).length() < boost::lambda::bind(&Vector::difference, boost::lambda::_2, observation).length() ); Compiling this gives (GCC 4.3.2, Debian Lenny, Boost 1.35): g++ -DHAVE_CONFIG_H -I. -I../../src -I/usr/include -g -O2 -MT Main.o -MD -MP -MF .deps/Main.Tpo -c -o Main.o ../../src/Main.cpp ../../src/Main.cpp: In function ‘int main(int, char**)’: ../../src/Main.cpp:101: error: ‘const class boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::action<3, boost::lambda::function_action<3, boost::lambda::detail::unspecified> >, boost::tuples::tuple<MatrixVector<double> (MatrixVector<double>::* const)(const MatrixVector<double>&)const, const boost::lambda::lambda_functor<boost::lambda::placeholder<1> >, const MatrixVector<double>, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type> > >’ has no member named ‘length’ The error "has no member named ‘length’" is unexpected: a MatrixVector , the return value of the global operator is a MatrixVector, has a member length() . I have tried several syntax possibilities but with no luck. Does anyone has any suggestions? TIA -- Groeten, Joost Kraaijeveld Askesis B.V. Molukkenstraat 14 6524NB Nijmegen tel: 024-3888063 / 06-51855277 fax: 024-3608416 web: www.askesis.nl

2 1

Djikstra Algo
by madhav rao 29 Mar '09

29 Mar '09

I want the source code of djikstra algorithm.I also want to know how to contact the mentors. Can any one please help.I have written a too much optimized version of djikstra algorithm using a priority queue. Please do tell me How to contact the mentor's for this

2 1

Implementing matrix_as_graph to convert a boost::numeric::ublas::matrix to a "graph"
by John Burgoon 29 Mar '09

29 Mar '09

Hi all, I wrote a small program in C++ using boost to read a neural network file (directional graph of a feedforward multilayer perceptron) into boost::numeric::ublas::matrix. The typical file size creates matrices of various sizes, anywhere from a 36x36 to a 130x130 matrix (of floats - edge weights between 0 and 1 to four sig figs). About half to two-thirds of the values are 0 in a typical graph, so I think of them as sparse. There are thousands of such files, so I have been really thrilled with the speed of boost. (I was doing this work with Perl last year. Ahem.) Now I want to implement the boost matrix_as_graph library so that I can convert my matrix into a graph and then implement various network metrics on the graph (such as betweenness_centrality.hpp). However, when I looked in the docs at http://www.boost.org/doc/libs/1_38_0/boost/graph/matrix_as_graph.hpp I was dismayed to find only a code listing: no explanation, no examples. I'm not the strongest C++ coder. Can someone point me to an example or tutorial of how to implement matrix_as_graph to turn a ublas::matrix into a graph? I think I could puzzle it out if I could find an example to emulate. I'll repay the community with a simple blog tutorial of how I did it, if someone can only help me get started. Thanks in advance, John -- John Burgoon Indiana University Bloomington, IN, USA -- >>Insight without implementation is worthless. Get to work.

2 1

Error In undirected subgraph with no parallel edges
by Sandeep Gupta 28 Mar '09

28 Mar '09

Hi, I am using following declaration to define subgraphs over undirected graph such that parallel edges are disallowed: typedef boost::adjacency_list<vecS, setS, undirectedS, property<vertex_index_t,int>, property<edge_index_t,int> > ImplGraph_t; typedef boost::subgraph<ImplGraph_t> embeddedGraph_t; that is use setS for EdgeList instead of listS. However when I call the function local_to_global over the subgraph i end up following errors: /home/sandeep/Computing/boost_1_38_0/boost/graph/subgraph.hpp:147: error: passing ‘const std::vector<void*, std::allocator<void*> >’ as ‘this’ argument of ‘typename std::_Vector_base<_Tp, _Alloc>::_Tp_alloc_type::reference std::vector<_Tp, _Alloc>::operator[](size_t) [with _Tp = void*, _Alloc = std::allocator<void*>]’ discards qualifiers /home/sandeep/Computing/boost_1_38_0/boost/graph/subgraph.hpp:147: error: invalid conversion from ‘void*’ to ‘unsigned int’ /home/sandeep/Computing/boost_1_38_0/boost/graph/subgraph.hpp:147: error: initializing argument 1 of ‘typename std::_Vector_base<_Tp, _Alloc>::_Tp_alloc_type::reference std::vector<_Tp, _Alloc>::operator[](size_t) [with _Tp = void*, _Alloc = std::allocator<void*>]’ Please find the full code that creates the above scenario. Appreciate any help. -Thanks sandeep ///////////////-----------------------Undirected_Subgraph.cpp----------------------------- #include <boost/graph/subgraph.hpp> #include <boost/graph/adjacency_list.hpp> using namespace boost; typedef boost::adjacency_list<vecS, hash, undirectedS, property<vertex_index_t,int>, property<edge_index_t,int> > ImplGraph_t; typedef boost::subgraph<ImplGraph_t> embeddedGraph_t; int main() { embeddedGraph_t G; typedef graph_traits<embeddedGraph_t>::vertex_descriptor vertex_t; vertex_t v; embeddedGraph_t& G1 = G.create_subgraph(); G.local_to_global(v); return 0; }

1 0

MacOSX: problems linking with "universal binary" Boost and libstdc++-static.a
by FFT 28 Mar '09

28 Mar '09

I'm trying to link my "universal binary" program statically with both Boost and libstdc++-static.a to make the distribution easier, because, as I understand, /usr/lib/libstdc++.6.dylib isn't always there, especially, in versions prior to OSX-10.4 I can build Boost apparently successfully, but linking the regex example statically with libstdc++ causes errors. Perhaps someone here could point out what I'm doing wrong (if anything). Here's what I did to build "universal binary" Boost and compile the example (Btw, the documentation could use some clarity about the recipe): (1) Make sure "g++ --version" says i686-apple-darwin8-g++-4.0.1 (symlinks and PATH adjustments to avoid v3.3) (2) ../../bjam --prefix=~/local --build-dir=~/boost_build toolset=darwin link=static \ threading=multi architecture=combined stage install (I also tried adding runtime-link=static with similar results, see below) (3) g++ -static-libgcc -I ~/local/include/boost-1_38 example.cpp \ -o example /usr/lib/libstdc++-static.a ~/local/lib/libboost_regex-xgcc40-mt.a (I tried skipping /usr/lib/libstdc++-static.a, in which case the binary builds, but is linked with /usr/lib/libstdc++.6.dylib) The errors I get here take up many pages and start like this: /usr/libexec/gcc/i686-apple-darwin8/4.0.1/ld: warning multiple definitions of symbol std::codecvt<char, char, __mbstate_t>::~codecvt() /usr/lib/libstdc++-static.a(codecvt.o) private external definition of std::codecvt<char, char, __mbstate_t>::~codecvt()in section (__TEXT,__tex t) /usr/lib/gcc/i686-apple-darwin8/4.0.1/libstdc++.dylib(single module) definition of std::codecvt<char, char, __mbstate_t>::~codecvt() /usr/libexec/gcc/i686-apple-darwin8/4.0.1/ld: warning multiple definitions of symbol std::codecvt<char, char, __mbstate_t>::~codecvt() /usr/lib/libstdc++-static.a(codecvt.o) private external definition of std::codecvt<char, char, __mbstate_t>::~codecvt()in section (__TEXT,__tex t) /usr/lib/gcc/i686-apple-darwin8/4.0.1/libstdc++.dylib(single module) definition of std::codecvt<char, char, __mbstate_t>::~codecvt() When I use Boost built with "runtime-link=static", the errors look like this instead: /usr/libexec/gcc/i686-apple-darwin8/4.0.1/ld: warning multiple definitions of symbol std::codecvt<char, char, __mbstate_t>::~codecvt() /usr/lib/libstdc++-static.a(codecvt.o) private external definition of std::codecvt<char, char, __mbstate_t>::~codecvt()in section (__TEXT,__tex t) /usr/lib/gcc/i686-apple-darwin8/4.0.1/libstdc++.dylib(single module) definition of std::codecvt<char, char, __mbstate_t>::~codecvt() /usr/libexec/gcc/i686-apple-darwin8/4.0.1/ld: warning multiple definitions of symbol std::codecvt<char, char, __mbstate_t>::~codecvt() /usr/lib/libstdc++-static.a(codecvt.o) private external definition of std::codecvt<char, char, __mbstate_t>::~codecvt()in section (__TEXT,__tex t) Any suggestions?

1 0

Using boost across several different unix platforms
by Frank Meerkötter 28 Mar '09

28 Mar '09

Hello, i am currently looking into the possibility of using boost with a code base that needs to be compiled for a number of different unix platforms (AIX/HPUX/Solaris/Linux). Unfortunately i can't just use the gcc everywhere but i have to use the native compilers (XL/aCC/SunCC) instead. >From looking around the net i assume its not entirely impossible. There seems to be some (more or less official) effort from IBM and HP to have their compilers work with boost. My impression is that recent versions of XL and aCC are working quite OK with boost. I this impression correct? I am not so sure about the sunCC. I found a success story on the web but my general impression was that its not working so well? How are your experiences in that regard? In general, is someone using boost across a larger set (this set?) of compilers? What do you think? Doable with reasonable effort or hands off? Thanks for you insight. Frank

2 1

Trouble with regex
by Nathan Huesken 28 Mar '09

28 Mar '09

Hi, I have some trouble with regex. I have a string in this format: =?<encoding>?<Q or B>?<name>?= I want to extract the encoding, Q or B and name! I read the regex documentation and I try this: string mime_decode_field(string field) { boost::regex e("^=?([\x20-\x7E]*)?(Q|B)?([\x20-\x7E]*)?=$",boost::regex::perl|boost::regex::icase); boost::smatch what; if(boost::regex_match(field,what,e)) { //Now I expect <encoding> in what[1], <Q or B> in what[2] and <name> in what[3] } } But it is not as expected. what[2] and what[3] are empty, what[1] contains the whole string. What am I doing wrong? Thanks! nathan

2 1

FW: boost [regex] library icu building problems
by Alex Perry 28 Mar '09

28 Mar '09

Hi I hope this is the appropriate list for posting this message if not my apologies and could someone please redirect me. I seem to have a problem building the boost.regex library with icu support on windows with the msvc toolset (MS Visual Studio 2005 professional). Boost version is 1.35.0 (icu 3.8.1) I have built this using bjam with a command like:- bjam -sHAVE_ICU=1 --toolset=msvc stage This all seems to work perfectly well and the library boost_regex-vc80-mt-1_35.lib and .dll are created which work (very well) and give me the required unicode regex support. Unfortunately we have a memory leak in our application which I cant catch using valgrind on our linux version so am suspecting a problem with windows specific code. I was trying to recompile our application so that it used the debug version of the crt so that I could put in some memory tracking calls to find out what was wrong. However I have hit a snag with the boost library trying to do this. Compiling our application with _DEBUG, BOOST_REGEX_DYN_LINK defined and /MDd (debug crt ) boost swaps to using the boost_regex-vc80-mt-gd-1_35.lib library. I seem to have some difficulty building this version of the library with the optional icu support included. I did :- Bjam sHAVE_ICU=1 toolset=msvc build-type=complete stage But get an error in this case (I dont for build-type=minimal). The full output from bjam is below Im not quite sure what this error is meaning and what it is complaining about do I need to configure something in common properties here? - if someone with more experience of bjam than me could point me towards the problem I would be very grateful. The icuroot is pointing to where a copy of icu is living (d:/dependencies/icu/3.8.1/icu on this machine) and I have built a debug version of icu just in case this is what was wanted (using the provided allinone.sln shipped with the icu source) but doesnt appear to make any difference. Thanks in advance for your time Alex Perry Output from bjam:- bjam -sHAVE_ICU=1 --toolset=msvc --build-type=complete stage warning: Graph library does not contain optional GraphML reader. note: to enable GraphML support, set EXPAT_INCLUDE and EXPAT_LIBPATH to the note: directories containing the Expat headers and libraries, respectively. warning: skipping optional Message Passing Interface (MPI) library. note: to enable MPI support, add "using mpi ;" to user-config.jam. note: to suppress this message, pass "--without-mpi" to bjam. note: otherwise, you can safely ignore this message. Skipping build of: ./stage <build>no in common properties Skipping build of: ./stage <build>no in common properties Skipping build of: ./stage <build>no in common properties Skipping build of: ./stage <build>no in common properties Skipping build of: libs/regex/build/icucore <build>no in common properties Skipping build of: libs/regex/build/icuin <build>no in common properties Skipping build of: libs/regex/build/icudata <build>no in common properties D:/dependencies/Boost/boost_1_35_0/tools/build/v2/kernel\class.jam:93: in new *** argument error * rule object(searched-lib-target)(a)4237.__init__ ( name : project : shared ? : search * : action ) * called with: ( icudata icui18n icuuc : object(project-target)@209 : true : /D:/dependencies/ICU/3.8.1/icu/lib : object(null-ac tion)@4236 : : : : ) * extra argument icui18n D:/dependencies/Boost/boost_1_35_0/tools/build/v2/tools\builtin.jam:349:see definition of rule '__init__' being called D:/dependencies/Boost/boost_1_35_0/tools/build/v2/tools\builtin.jam:592: in object(searched-lib-generator)(a)6.run D:/dependencies/Boost/boost_1_35_0/tools/build/v2/build\generators.jam:859: in try-one-generator-really D:/dependencies/Boost/boost_1_35_0/tools/build/v2/build\generators.jam:920: in try-one-generator D:/dependencies/Boost/boost_1_35_0/tools/build/v2/build\generators.jam:1131: in construct-really D:/dependencies/Boost/boost_1_35_0/tools/build/v2/build\generators.jam:1204: in generators.construct D:/dependencies/Boost/boost_1_35_0/tools/build/v2/tools\builtin.jam:496: in object(lib-generator)(a)5.run D:/dependencies/Boost/boost_1_35_0/tools/build/v2/build\generators.jam:859: in try-one-generator-really D:/dependencies/Boost/boost_1_35_0/tools/build/v2/build\generators.jam:920: in try-one-generator D:/dependencies/Boost/boost_1_35_0/tools/build/v2/build\generators.jam:1131: in construct-really D:/dependencies/Boost/boost_1_35_0/tools/build/v2/build\generators.jam:1204: in generators.construct D:/dependencies/Boost/boost_1_35_0/tools/build/v2/build\targets.jam:1368: in construct D:/dependencies/Boost/boost_1_35_0/tools/build/v2/build\targets.jam:1206: in object(typed-target)(a)221.generate D:/dependencies/Boost/boost_1_35_0/tools/build/v2/build\targets.jam:742: in generate-really D:/dependencies/Boost/boost_1_35_0/tools/build/v2/build\targets.jam:715: in object(main-target)(a)818.generate D:/dependencies/Boost/boost_1_35_0/tools/build/v2/build\targets.jam:254: in object(project-target)(a)209.generate D:/dependencies/Boost/boost_1_35_0/tools/build/v2/build\targets.jam:858: in targets.generate-from-reference D:/dependencies/Boost/boost_1_35_0/tools/build/v2/build\targets.jam:1129: in generate-dependencies D:/dependencies/Boost/boost_1_35_0/tools/build/v2/build\targets.jam:1179: in object(install-target-class)(a)97.generate D:/dependencies/Boost/boost_1_35_0/tools/build/v2/build\targets.jam:742: in generate-really D:/dependencies/Boost/boost_1_35_0/tools/build/v2/build\targets.jam:715: in object(main-target)(a)365.generate D:/dependencies/Boost/boost_1_35_0/tools/build/v2/build\targets.jam:858: in targets.generate-from-reference D:/dependencies/Boost/boost_1_35_0/tools/build/v2/build\targets.jam:1129: in generate-dependencies D:/dependencies/Boost/boost_1_35_0/tools/build/v2/build\targets.jam:1179: in object(alias-target-class)(a)103.generate D:/dependencies/Boost/boost_1_35_0/tools/build/v2/build\targets.jam:742: in generate-really D:/dependencies/Boost/boost_1_35_0/tools/build/v2/build\targets.jam:715: in object(main-target)(a)369.generate D:/dependencies/Boost/boost_1_35_0/tools/build/v2\build-system.jam:658: in load D:\dependencies\Boost\boost_1_35_0\tools\build\v2/kernel\modules.jam:267: in import D:\dependencies\Boost\boost_1_35_0\tools\build\v2/kernel/bootstrap.jam:132: in boost-build D:\dependencies\Boost\boost_1_35_0\boost-build.jam:11: in module scope

1 0

Error building the libraries for iPhone
by Harald Maassen 28 Mar '09

28 Mar '09

Hello, I've recently added the Boost header libraries to my iPhone project, but I'd also like to use some of the compiled libraries. I've looked at the documentation and archives for the correct procedure, but I'm hitting a snag. I have added the following to the user-config.jam file: using darwin : 4.0.1~iphone : /Developer/Platforms/iPhoneOS.platform/Developer/usr/bin/g++ -arch arm : <striper> : <architecture>arm <target-os>iphone <macosx-version>iphone-2.0 ; using darwin : 4.0.1~iphonesim : /Developer/Platforms/iPhoneSimulator.platform/Developer/usr/bin/g++ : <striper> : <architecture>x86 <target-os>iphone <macosx-version>iphonesim-2.0 ; I then run bjam with the following parameters: bjam toolset=darwin architecture=arm target-os=iphone macosx-version=iphone-2.0 define=_LITTLE_ENDIAN Which fails on linking with the following message: darwin.link.dll bin.v2/libs/math/build/darwin-4.0.1~iphone/release/architecture-arm/macosx-version-iphone-2.0/target-os-iphone/threading-multi/libboost_math_c99-xgcc40-mt-1_38.so.1.38.0 lipo: /var/folders/1D/1DnUneWfGcCdxmoK6T0p2U+++TI/-Tmp-//ccpVFzN4.out and /var/folders/1D/1DnUneWfGcCdxmoK6T0p2U+++TI/-Tmp-//cciyh1K6.out have the same architectures (armv6) and can't be in the same fat output file "/Developer/Platforms/iPhoneOS.platform/Developer/usr/bin/g++" "-arch" "arm" -dynamiclib -Wl,-single_module -install_name "libboost_math_c99-xgcc40-mt-1_38.so.1.38.0" -o "bin.v2/libs/math/build/darwin-4.0.1~iphone/release/architecture-arm/macosx-version-iphone-2.0/target-os-iphone/threading-multi/libboost_math_c99-xgcc40-mt-1_38.so.1.38.0" "bin.v2/libs/math/build/darwin-4.0.1~iphone/release/architecture-arm/macosx-version-iphone-2.0/target-os-iphone/threading-multi/acosh.o" "bin.v2/libs/math/build/darwin-4.0.1~iphone/release/architecture-arm/macosx-version-iphone-2.0/target-os-iphone/threading-multi/asinh.o" "bin.v2/libs/math/build/darwin-4.0.1~iphone/release/architecture-arm/macosx-version-iphone-2.0/target-os-iphone/threading-multi/atanh.o" "bin.v2/libs/math/build/darwin-4.0.1~iphone/release/architecture-arm/macosx-version-iphone-2.0/target-os-iphone/threading-multi/cbrt.o" "bin.v2/libs/math/build/darwin-4.0.1~iphone/release/architecture-arm/macosx-version-iphone-2.0/target-os-iphone/threading-multi/copysign.o" "bin.v2/libs/math/build/darwin-4.0.1~iphone/release/architecture-arm/macosx-version-iphone-2.0/target-os-iphone/threading-multi/erfc.o" "bin.v2/libs/math/build/darwin-4.0.1~iphone/release/architecture-arm/macosx-version-iphone-2.0/target-os-iphone/threading-multi/erf.o" "bin.v2/libs/math/build/darwin-4.0.1~iphone/release/architecture-arm/macosx-version-iphone-2.0/target-os-iphone/threading-multi/expm1.o" "bin.v2/libs/math/build/darwin-4.0.1~iphone/release/architecture-arm/macosx-version-iphone-2.0/target-os-iphone/threading-multi/fmax.o" "bin.v2/libs/math/build/darwin-4.0.1~iphone/release/architecture-arm/macosx-version-iphone-2.0/target-os-iphone/threading-multi/fmin.o" "bin.v2/libs/math/build/darwin-4.0.1~iphone/release/architecture-arm/macosx-version-iphone-2.0/target-os-iphone/threading-multi/fpclassify.o" "bin.v2/libs/math/build/darwin-4.0.1~iphone/release/architecture-arm/macosx-version-iphone-2.0/target-os-iphone/threading-multi/hypot.o" "bin.v2/libs/math/build/darwin-4.0.1~iphone/release/architecture-arm/macosx-version-iphone-2.0/target-os-iphone/threading-multi/lgamma.o" "bin.v2/libs/math/build/darwin-4.0.1~iphone/release/architecture-arm/macosx-version-iphone-2.0/target-os-iphone/threading-multi/llround.o" "bin.v2/libs/math/build/darwin-4.0.1~iphone/release/architecture-arm/macosx-version-iphone-2.0/target-os-iphone/threading-multi/log1p.o" "bin.v2/libs/math/build/darwin-4.0.1~iphone/release/architecture-arm/macosx-version-iphone-2.0/target-os-iphone/threading-multi/lround.o" "bin.v2/libs/math/build/darwin-4.0.1~iphone/release/architecture-arm/macosx-version-iphone-2.0/target-os-iphone/threading-multi/nextafter.o" "bin.v2/libs/math/build/darwin-4.0.1~iphone/release/architecture-arm/macosx-version-iphone-2.0/target-os-iphone/threading-multi/nexttoward.o" "bin.v2/libs/math/build/darwin-4.0.1~iphone/release/architecture-arm/macosx-version-iphone-2.0/target-os-iphone/threading-multi/round.o" "bin.v2/libs/math/build/darwin-4.0.1~iphone/release/architecture-arm/macosx-version-iphone-2.0/target-os-iphone/threading-multi/tgamma.o" "bin.v2/libs/math/build/darwin-4.0.1~iphone/release/architecture-arm/macosx-version-iphone-2.0/target-os-iphone/threading-multi/trunc.o" -headerpad_max_install_names -Wl,-x -Wl,-dead_strip -no_dead_strip_inits_and_terms -isysroot /Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS2.0.sdk -arch armv6 ...failed darwin.link.dll bin.v2/libs/math/build/darwin-4.0.1~iphone/release/architecture-arm/macosx-version-iphone-2.0/target-os-iphone/threading-multi/libboost_math_c99-xgcc40-mt-1_38.so.1.38.0... Any insights on what I'm doing wrong here?

2 3

[StateChart] Broken link in online 1.38 doc
by Dominique Devienne 28 Mar '09

28 Mar '09

FYI: http://www.boost.org/development/tests/release-1_38_0/user/statechart_relea… contains only "Error extracting file: The specified zipfiles were not found." Thanks, --DD

2 1

Re: [Boost-users] How do i only get Regex??
by John Maddock 28 Mar '09

28 Mar '09

> Sorry for the mail bombing... > I am trying to run the exe and no matter what I try typing in, I get a > usage > error. > I have the path set to boost\boost_1_38\bin so I can run bcp anywhere. > > I go to boost\boost_1_38 and type: bcp boost\regex.hpp \temp (temp is > the > output dir for me), and I get the usage error? What am I doing wrong? Without the full error message it's hard to say, but I suspect that \temp isn't being seen as a valid path, try ./temp if that's what you want, or else a full path. HTH, John.

1 0

Re: [Boost-users] How do i only get Regex??
by John Maddock 28 Mar '09

28 Mar '09

> Nevermind about the bpc executable... The rest of the question still > stands Then I'm not sure what you're asking - if you mean "what are the dependencies of my executable" then the answer is normally nothing as the default belhaviour is to static link to Boost.Regex. Otherwise it's to a single dll - use the msvc depends tool to work out which one. HTH, John. > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of John Maddock > Sent: Friday, March 27, 2009 5:32 AM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] How do i only get Regex?? > >> I'm using VC++ 8 and I am trying to use the boost regex in order to use >> regular expressions. I can get it to work, but it requires 60mb of files! >> What is the simplest, smallest subset of files that I need to get this to >> work. If there is a way to only have to import a dll or lib, that would >> be >> ideal. I would like it to be separate and standalone from the massive >> file >> collection that comes with boost as a whole. > > You can use bcp to extract a subset of Boost: > http://www.boost.org/doc/libs/1_38_0/tools/bcp/bcp.html > > Of course your final executable will be the same size regardless of > whether > you extract out Boost.Regex or not :-) > > HTH John. > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users -------------------------------------------------------------------------------- No virus found in this incoming message. Checked by AVG - www.avg.com Version: 8.0.238 / Virus Database: 270.11.30/2026 - Release Date: 03/27/09 07:13:00

1 0

[Phoenix] Compilation problem, help?
by Brett Gmoser 28 Mar '09

28 Mar '09

Hello everybody. With my current project I'm unfortunately still using Spirit 1.8.x and Phoenix. Having a bit of trouble figuring out the correct way to do something, hoping somebody can help! It actually compiles with the exception of some warnings from MSVC - the whole "A non-const reference may only be bound to an lvalue" warning I'm thinking it should be an easy fix probably just adding ref() or var() in the right places, I just can't figure out where. Here's some source code. The idea is to parse out an expression, and while doing so, store the operation type for later use at the end of the parsing, to avoid verbosity in having to do this every time I parse a different type of expression. /* Some notes: * - The closure variable 'oper_function' for assignment_statement is a Boost.Function specifying a function that returns expression_value, and takes two arguments of type expression_value. * - expression_value is a Boost.Variant. * - The form of variant's apply_visitor used is "delayed visitation", which returns just a functor with operator() which will do the actual visitation later. This works fine. * - assign_variable and lookup_variable are Phoenix functions. * - lhs and rhs closure variables are both expression_value's. * - I've tried using combinations of var(), val(), and ref() in as many different places as I could think of. * - The problem is with each of the oper function assignment lines, as well as the "assignment_statement.rhs)," line, which is line 671 in the warnings. * - Warnings from MSVC are below the code. */ assignment_statement = (as_lower_d[str_p("set") | str_p("define")] >> +white_space >> (name[assignment_statement.name = arg1]) >> longest_d[ // Allow just the assignment of an expression by itself without an operator. (+white_space>> expression[assignment_statement.rhs = arg1])[assignment_statement.oper_function = actors::deferred_binary_visit<actors::binary_op<cwb::wtl::detail::binary_operations::right_assign> >()] | // Allow all different types of assignment operators. (*white_space >> ( str_p("=") [assignment_statement.oper_function = boost::apply_visitor(actors::binary_op<cwb::wtl::detail::binary_operations::right_assign>())] | str_p("+=")[assignment_statement.oper_function = boost::apply_visitor(actors::binary_op<cwb::wtl::detail::binary_operations::add>())] | str_p("-=")[assignment_statement.oper_function = boost::apply_visitor(actors::binary_op<cwb::wtl::detail::binary_operations::subtract>())] | str_p("/=")[assignment_statement.oper_function = boost::apply_visitor(actors::binary_op<cwb::wtl::detail::binary_operations::divide>())] | str_p("*=")[assignment_statement.oper_function = boost::apply_visitor(actors::binary_op<cwb::wtl::detail::binary_operations::multiply>())] | str_p("%=")[assignment_statement.oper_function = boost::apply_visitor(actors::binary_op<cwb::wtl::detail::binary_operations::modulus>())] ) >> *white_space >> expression[assignment_statement.rhs = arg1]) ])[assign_variable(assignment_statement.name, assignment_statement.oper_function( lookup_variable(assignment_statement.name, self._TemplatePtr), assignment_statement.rhs), self._TemplatePtr)] ; /******************************************************************************* 1>------ Build started: Project: spirit_web_template, Configuration: Debug x64 ------ 1>Compiling... 1>web_template.cpp 1>c:\devel\repositories\codexterous\spirit_web_template\trunk\source\../include/web_template/detail/grammar.hpp(659) : error C2220: warning treated as error - no 'object' file generated 1>c:\devel\repositories\codexterous\spirit_web_template\trunk\source\../include/web_template/detail/grammar.hpp(659) : warning C4239: nonstandard extension used : 'argument' : conversion from 'cwb::wtl::detail::actors::binary_op<_OpType>' to 'cwb::wtl::detail::actors::binary_op<_OpType> &' 1> with 1> [ 1> _OpType=cwb::wtl::detail::binary_operations::right_assign 1> ] 1> A non-const reference may only be bound to an lvalue 1> c:\devel\repositories\codexterous\spirit_web_template\trunk\source\../include/web_template/detail/grammar.hpp(123) : while compiling class template member function 'cwb::wtl::detail::wt_grammar::definition<ScannerT>::definition(const cwb::wtl::detail::wt_grammar&)' 1> with 1> [ 1> ScannerT=boost::spirit::scanner<std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>,boost::spirit::scanner_policies<>> 1> ] 1> c:\devel\repositories\codexterous\dependencies\boost\boost-1_37\include\boost/spirit/home/classic/core/non_terminal/impl/grammar.ipp(279) : see reference to class template instantiation 'cwb::wtl::detail::wt_grammar::definition<ScannerT>' being compiled 1> with 1> [ 1> ScannerT=boost::spirit::scanner<std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>,boost::spirit::scanner_policies<>> 1> ] 1> c:\devel\repositories\codexterous\dependencies\boost\boost-1_37\include\boost/spirit/home/classic/core/non_terminal/impl/grammar.ipp(298) : see reference to function template instantiation 'void boost::spirit::impl::call_helper<0>::do_<result_t,definition_t,ScannerT>(RT&,DefinitionT&,const ScannerT&)' being compiled 1> with 1> [ 1> ScannerT=boost::spirit::scanner<std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>,boost::spirit::scanner_policies<>>, 1> RT=result_t, 1> DefinitionT=definition_t 1> ] 1> c:\devel\repositories\codexterous\dependencies\boost\boost-1_37\include\boost/spirit/home/classic/core/non_terminal/grammar.hpp(55) : see reference to function template instantiation 'boost::spirit::match<boost::spirit::nil_t> boost::spirit::impl::grammar_parser_parse<0,cwb::wtl::detail::wt_grammar,boost::spirit::parser_context<>,ScannerT>(const boost::spirit::grammar<DerivedT> *,const ScannerT&)' being compiled 1> with 1> [ 1> ScannerT=boost::spirit::scanner<std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>,boost::spirit::scanner_policies<>>, 1> DerivedT=cwb::wtl::detail::wt_grammar 1> ] 1> c:\devel\repositories\codexterous\dependencies\boost\boost-1_37\include\boost/spirit/home/classic/core/non_terminal/grammar.hpp(65) : see reference to function template instantiation 'boost::spirit::match<boost::spirit::nil_t> boost::spirit::grammar<DerivedT>::parse_main<ScannerT>(const ScannerT&) const' being compiled 1> with 1> [ 1> DerivedT=cwb::wtl::detail::wt_grammar, 1> ScannerT=boost::spirit::scanner<std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>,boost::spirit::scanner_policies<>> 1> ] 1> c:\devel\repositories\codexterous\dependencies\boost\boost-1_37\include\boost/spirit/home/classic/core/impl/parser.ipp(30) : see reference to function template instantiation 'boost::spirit::match<boost::spirit::nil_t> boost::spirit::grammar<DerivedT>::parse<boost::spirit::scanner<IteratorT,PoliciesT>>(const ScannerT&) const' being compiled 1> with 1> [ 1> DerivedT=cwb::wtl::detail::wt_grammar, 1> IteratorT=std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>, 1> PoliciesT=boost::spirit::scanner_policies<>, 1> ScannerT=boost::spirit::scanner<std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>,boost::spirit::scanner_policies<>> 1> ] 1> .\source\web_template.cpp(98) : see reference to function template instantiation 'boost::spirit::parse_info<IteratorT> boost::spirit::parse<_IterType,DerivedT>(const IteratorT&,const IteratorT&,const boost::spirit::parser<DerivedT> &)' being compiled 1> with 1> [ 1> IteratorT=std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>, 1> _IterType=std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>, 1> DerivedT=cwb::wtl::detail::wt_grammar 1> ] 1> .\source\web_template.cpp(63) : see reference to function template instantiation 'void cwb::wtl::web_template::_Parse<std::_String_const_iterator<_Elem,_Traits,_Alloc>>(_IterType,_IterType)' being compiled 1> with 1> [ 1> _Elem=char, 1> _Traits=std::char_traits<char>, 1> _Alloc=std::allocator<char>, 1> _IterType=std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>> 1> ] 1>c:\devel\repositories\codexterous\spirit_web_template\trunk\source\../include/web_template/detail/grammar.hpp(660) : warning C4239: nonstandard extension used : 'argument' : conversion from 'cwb::wtl::detail::actors::binary_op<_OpType>' to 'cwb::wtl::detail::actors::binary_op<_OpType> &' 1> with 1> [ 1> _OpType=cwb::wtl::detail::binary_operations::add 1> ] 1> A non-const reference may only be bound to an lvalue 1>c:\devel\repositories\codexterous\spirit_web_template\trunk\source\../include/web_template/detail/grammar.hpp(661) : warning C4239: nonstandard extension used : 'argument' : conversion from 'cwb::wtl::detail::actors::binary_op<_OpType>' to 'cwb::wtl::detail::actors::binary_op<_OpType> &' 1> with 1> [ 1> _OpType=cwb::wtl::detail::binary_operations::subtract 1> ] 1> A non-const reference may only be bound to an lvalue 1>c:\devel\repositories\codexterous\spirit_web_template\trunk\source\../include/web_template/detail/grammar.hpp(662) : warning C4239: nonstandard extension used : 'argument' : conversion from 'cwb::wtl::detail::actors::binary_op<_OpType>' to 'cwb::wtl::detail::actors::binary_op<_OpType> &' 1> with 1> [ 1> _OpType=cwb::wtl::detail::binary_operations::divide 1> ] 1> A non-const reference may only be bound to an lvalue 1>c:\devel\repositories\codexterous\spirit_web_template\trunk\source\../include/web_template/detail/grammar.hpp(663) : warning C4239: nonstandard extension used : 'argument' : conversion from 'cwb::wtl::detail::actors::binary_op<_OpType>' to 'cwb::wtl::detail::actors::binary_op<_OpType> &' 1> with 1> [ 1> _OpType=cwb::wtl::detail::binary_operations::multiply 1> ] 1> A non-const reference may only be bound to an lvalue 1>c:\devel\repositories\codexterous\spirit_web_template\trunk\source\../include/web_template/detail/grammar.hpp(664) : warning C4239: nonstandard extension used : 'argument' : conversion from 'cwb::wtl::detail::actors::binary_op<_OpType>' to 'cwb::wtl::detail::actors::binary_op<_OpType> &' 1> with 1> [ 1> _OpType=cwb::wtl::detail::binary_operations::modulus 1> ] 1> A non-const reference may only be bound to an lvalue 1>c:\devel\repositories\codexterous\spirit_web_template\trunk\source\../include/web_template/detail/grammar.hpp(671) : warning C4239: nonstandard extension used : 'argument' : conversion from 'phoenix::actor<BaseT>' to 'phoenix::actor<BaseT> &' 1> with 1> [ 1> BaseT=phoenix::composite<cwb::wtl::detail::actors::lookup_variable_impl,phoenix::actor<phoenix::closure_member<0,phoenix::closure<cwb::wtl::web_template::qualified_name,boost::function<cwb::wtl::expression_value (cwb::wtl::expression_value,cwb::wtl::expression_value)>,cwb::wtl::expression_value>>>,phoenix::actor<phoenix::value<cwb::wtl::web_template *>>,phoenix::as_actor<phoenix::nil_t>::type> 1> ] 1> A non-const reference may only be bound to an lvalue 1>c:\devel\repositories\codexterous\spirit_web_template\trunk\source\../include/web_template/detail/grammar.hpp(659) : warning C4239: nonstandard extension used : 'argument' : conversion from 'cwb::wtl::detail::actors::binary_op<_OpType>' to 'cwb::wtl::detail::actors::binary_op<_OpType> &' 1> with 1> [ 1> _OpType=cwb::wtl::detail::binary_operations::right_assign 1> ] 1> A non-const reference may only be bound to an lvalue 1> c:\devel\repositories\codexterous\spirit_web_template\trunk\source\../include/web_template/detail/grammar.hpp(123) : while compiling class template member function 'cwb::wtl::detail::wt_grammar::definition<ScannerT>::definition(const cwb::wtl::detail::wt_grammar&)' 1> with 1> [ 1> ScannerT=boost::spirit::scanner<> 1> ] 1> c:\devel\repositories\codexterous\dependencies\boost\boost-1_37\include\boost/spirit/home/classic/core/non_terminal/impl/grammar.ipp(279) : see reference to class template instantiation 'cwb::wtl::detail::wt_grammar::definition<ScannerT>' being compiled 1> with 1> [ 1> ScannerT=boost::spirit::scanner<> 1> ] 1> c:\devel\repositories\codexterous\dependencies\boost\boost-1_37\include\boost/spirit/home/classic/core/non_terminal/impl/grammar.ipp(298) : see reference to function template instantiation 'void boost::spirit::impl::call_helper<0>::do_<result_t,definition_t,ScannerT>(RT&,DefinitionT&,const ScannerT&)' being compiled 1> with 1> [ 1> ScannerT=boost::spirit::scanner<>, 1> RT=result_t, 1> DefinitionT=definition_t 1> ] 1> c:\devel\repositories\codexterous\dependencies\boost\boost-1_37\include\boost/spirit/home/classic/core/non_terminal/grammar.hpp(55) : see reference to function template instantiation 'boost::spirit::match<boost::spirit::nil_t> boost::spirit::impl::grammar_parser_parse<0,cwb::wtl::detail::wt_grammar,boost::spirit::parser_context<>,ScannerT>(const boost::spirit::grammar<DerivedT> *,const ScannerT&)' being compiled 1> with 1> [ 1> ScannerT=boost::spirit::scanner<>, 1> DerivedT=cwb::wtl::detail::wt_grammar 1> ] 1> c:\devel\repositories\codexterous\dependencies\boost\boost-1_37\include\boost/spirit/home/classic/core/non_terminal/grammar.hpp(65) : see reference to function template instantiation 'boost::spirit::match<boost::spirit::nil_t> boost::spirit::grammar<DerivedT>::parse_main<ScannerT>(const ScannerT&) const' being compiled 1> with 1> [ 1> DerivedT=cwb::wtl::detail::wt_grammar, 1> ScannerT=boost::spirit::scanner<> 1> ] 1> c:\devel\repositories\codexterous\dependencies\boost\boost-1_37\include\boost/spirit/home/classic/core/impl/parser.ipp(30) : see reference to function template instantiation 'boost::spirit::match<boost::spirit::nil_t> boost::spirit::grammar<DerivedT>::parse<boost::spirit::scanner<>>(const ScannerT&) const' being compiled 1> with 1> [ 1> DerivedT=cwb::wtl::detail::wt_grammar, 1> ScannerT=boost::spirit::scanner<> 1> ] 1> .\source\web_template.cpp(98) : see reference to function template instantiation 'boost::spirit::parse_info<IteratorT> boost::spirit::parse<_IterType,DerivedT>(const IteratorT&,const IteratorT&,const boost::spirit::parser<DerivedT> &)' being compiled 1> with 1> [ 1> IteratorT=const char *, 1> _IterType=const char *, 1> DerivedT=cwb::wtl::detail::wt_grammar 1> ] 1> .\source\web_template.cpp(84) : see reference to function template instantiation 'void cwb::wtl::web_template::_Parse<const char*>(_IterType,_IterType)' being compiled 1> with 1> [ 1> _IterType=const char * 1> ] 1>c:\devel\repositories\codexterous\spirit_web_template\trunk\source\../include/web_template/detail/grammar.hpp(660) : warning C4239: nonstandard extension used : 'argument' : conversion from 'cwb::wtl::detail::actors::binary_op<_OpType>' to 'cwb::wtl::detail::actors::binary_op<_OpType> &' 1> with 1> [ 1> _OpType=cwb::wtl::detail::binary_operations::add 1> ] 1> A non-const reference may only be bound to an lvalue 1>c:\devel\repositories\codexterous\spirit_web_template\trunk\source\../include/web_template/detail/grammar.hpp(661) : warning C4239: nonstandard extension used : 'argument' : conversion from 'cwb::wtl::detail::actors::binary_op<_OpType>' to 'cwb::wtl::detail::actors::binary_op<_OpType> &' 1> with 1> [ 1> _OpType=cwb::wtl::detail::binary_operations::subtract 1> ] 1> A non-const reference may only be bound to an lvalue 1>c:\devel\repositories\codexterous\spirit_web_template\trunk\source\../include/web_template/detail/grammar.hpp(662) : warning C4239: nonstandard extension used : 'argument' : conversion from 'cwb::wtl::detail::actors::binary_op<_OpType>' to 'cwb::wtl::detail::actors::binary_op<_OpType> &' 1> with 1> [ 1> _OpType=cwb::wtl::detail::binary_operations::divide 1> ] 1> A non-const reference may only be bound to an lvalue 1>c:\devel\repositories\codexterous\spirit_web_template\trunk\source\../include/web_template/detail/grammar.hpp(663) : warning C4239: nonstandard extension used : 'argument' : conversion from 'cwb::wtl::detail::actors::binary_op<_OpType>' to 'cwb::wtl::detail::actors::binary_op<_OpType> &' 1> with 1> [ 1> _OpType=cwb::wtl::detail::binary_operations::multiply 1> ] 1> A non-const reference may only be bound to an lvalue 1>c:\devel\repositories\codexterous\spirit_web_template\trunk\source\../include/web_template/detail/grammar.hpp(664) : warning C4239: nonstandard extension used : 'argument' : conversion from 'cwb::wtl::detail::actors::binary_op<_OpType>' to 'cwb::wtl::detail::actors::binary_op<_OpType> &' 1> with 1> [ 1> _OpType=cwb::wtl::detail::binary_operations::modulus 1> ] 1> A non-const reference may only be bound to an lvalue 1>c:\devel\repositories\codexterous\spirit_web_template\trunk\source\../include/web_template/detail/grammar.hpp(671) : warning C4239: nonstandard extension used : 'argument' : conversion from 'phoenix::actor<BaseT>' to 'phoenix::actor<BaseT> &' 1> with 1> [ 1> BaseT=phoenix::composite<cwb::wtl::detail::actors::lookup_variable_impl,phoenix::actor<phoenix::closure_member<0,phoenix::closure<cwb::wtl::web_template::qualified_name,boost::function<cwb::wtl::expression_value (cwb::wtl::expression_value,cwb::wtl::expression_value)>,cwb::wtl::expression_value>>>,phoenix::actor<phoenix::value<cwb::wtl::web_template *>>,phoenix::as_actor<phoenix::nil_t>::type> 1> ] 1> A non-const reference may only be bound to an lvalue *******************************************************************************/

2 3

[asio] need help with timer crash please
by bnv＠nc.rr.com 28 Mar '09

28 Mar '09

I incorrectly posted this to the boost developer's list, and am posting here to rectify that... I'm seeing two distinct crashes (gdb output below) on expiration of a deadline timer, and could use some help identifying possible reasons. The timer has not been deleted. The timer expired once before and was later rescheduled using expires_from_now() and async_wait(). The timer is only accessed by threads in io_service::run(), and is protected by a mutex. Form the gdb output, I'm guessing the timer is being removed on expiration and the internal structures have somehow been trashed. Any pointers to possible explanations would be appreciated. crash 1... > Program received signal SIGSEGV, Segmentation fault. > [Switching to thread 3500.0x83c] > 0x5ae9a800 in ?? () > (gdb) bt full > #0 0x5ae9a800 in ?? () > No symbol table info available. > #1 0x005ae5f7 in > boost::asio::detail::timer_queue<boost::asio::time_traits<boos > t::posix_time::ptime> >::complete_timers (this=0x5387f74) > at /usr/local/include/boost-1_38/boost/asio/detail/timer_queue.hpp:205 > this = ( > timer_queue<boost::asio::time_traits<boost::posix_time::ptime> > * > const) 0x > 5387f74 > this_timer = ( > timer_queue<boost::asio::time_traits<boost::posix_time::ptime> > >::timer_base > *) 0x53a4faf > #2 0x053a4fb7 in ?? () > No symbol table info available. > #3 0x1dcdcb20 in ?? () > No symbol table info available. > #4 0x005bf1c0 in > boost::asio::detail::select_reactor<false>::complete_operation > s_and_timers (this=0x658, lock=@0x1dcd9498) > at /usr/lib/gcc/i686-pc-cygwin/3.4.4/include/c++/bits/stl_vector.h:462 > this = (class select_reactor< false> * const) 0x658 > this = (scoped_lock<boost::asio::detail::posix_mutex> * const) 0xa > i = 500011328 > #5 0x00000000 in ?? () > No symbol table info available. > (gdb) crash 2... > Program received signal SIGSEGV, Segmentation fault. > [Switching to thread 1320.0xa08] > 0x005adff1 in > boost::asio::detail::timer_queue<boost::asio::time_traits<boost::p > osix_time::ptime> >::remove_timer (this=0x5387f74, t=0x53aac70) > at /usr/local/include/boost-1_38/boost/asio/detail/timer_queue.hpp:399 > 399 t->prev_->next_ = t->next_; > (gdb) bt full > #0 0x005adff1 in > boost::asio::detail::timer_queue<boost::asio::time_traits<boos > t::posix_time::ptime> >::remove_timer (this=0x5387f74, t=0x53aac70) > at /usr/local/include/boost-1_38/boost/asio/detail/timer_queue.hpp:399 > this = ( > timer_queue<boost::asio::time_traits<boost::posix_time::ptime> > * > const) 0x > 5387f74 > index = 87735592 > it = {_M_node = 0x53aad20} > #1 0x00000002 in ?? () > No symbol table info available. > #2 0x00000000 in ?? () > No symbol table info available. > (gdb) Thanks, Brian

3 6

[Q] extendig lexical cast with custom classes
by V S P 28 Mar '09

28 Mar '09

I developed a class cmoney_t and would like to use it uniformly with all the other datatypes I am using One of the things I would like to use is boost::lexical_cast<std::string> (const cmoney_t& in) However, when I simply just try to specialize the tempalte function lexical_cast it tells me that I cannot define that function within my namepsace (I have my own namespace) so wanted to know if there is a way to extend lexical_cast to support my custom classes thanks in advance -- V S P toreason(a)fastmail.fm -- http://www.fastmail.fm - Send your email first class

3 2

[iostreams] Is it possible for a sink to get notified when the stream is closed?
by Bob van Manen 27 Mar '09

27 Mar '09

Hi All, I am trying out the Boost iostreams library to build a sink, text sent to this sink is split up in to lines of text and each line is then being send over to our logging server (the function I'm calling to do this is static). So far I've built the write method as mentioned in the documentation for my sink, and push all the characters I receive in a buffer inside my sink class. Then I look for the end of line characters and figure out the lines of text. The problem I'm having is when there is no end of line character and the stream gets closed. Is there a way to get notified when the stream gets closed? Is there a better way to do this? Here is the code I have: class logging_sink { public: typedef char char_type; typedef boost::iostreams::sink_tag category; std::streamsize write(const char* s, std::streamsize n) { buffer_.append(s, n); // loop over buffer and find end of lines, send them to logging service } void close() { // close is never called if (!buffer_.empty()) log_message(buffer_); } private: std::string buffer_; }; class logging_stream : public boost::iostreams::stream<logging_sink> { public: logging_stream() : boost::iostreams::stream<logging_sink>(logging_sink()) {} }; logging_stream s; s << "Hello World"; s.close(); Thank you for your help, bob

2 2

Please help! How to make g++ link to libboost_thread-mt.so instead of libboost_thread-mt.so.1.33.1
by Louis Chen 27 Mar '09

27 Mar '09

Hi, local machine(A): boost-1.33.1, suse 10.3, gcc-4.2.1 A:/home/aa # ldconfig -p | grep boost_thread libboost_thread-mt.so.1.33.1 (libc6) => /usr/lib/libboost_thread-mt.so.1.33.1 libboost_thread-mt.so (libc6) => /usr/lib/libboost_thread-mt.so remote machine(B): boost-1.34.1, fedora 10, gcc-4.3.2. And i can NOT configure B. B:/home/bb # ldconfig -p | grep boost_thread libboost_thread-mt.so.3 (libc6) => /usr/lib/libboost_thread-mt.so.3 libboost_thread-mt.so (libc6) => /usr/lib/libboost_thread-mt.so The problem is that i compile main in A with LDFLAGS=-lboost_thread-mt. And main is linked to libboost_thread-mt.so.1.33.1. A:~/aa> ldd main | grep boost_thread libboost_thread-mt.so.1.33.1 => /usr/lib/libboost_thread-mt.so.1.33.1 (0xb7ca6000) When i try to run main in B, it fails, of course, with message: "main: error while loading shared library: libboost_thread-mt.so.1.33.1: can not open shared object file: No such file or directory." How can i force g++ link main to libboost_thread-mt.so in A? Thanks in advance!:) -- Louis Chen Southeast University, Nanjing Email:cszzys@gmail.com <Email%3Acszzys(a)gmail.com>

2 1

Re: [Boost-users] How do i only get Regex??
by Peter Bartlett 27 Mar '09

27 Mar '09

Quoting "Green, Jason M NSWCDL, W33" <jason.m.green3(a)navy.mil>: > I go to boost\boost_1_38 and type: bcp boost\regex.hpp \temp (temp is the > output dir for me), and I get the usage error? What am I doing wrong? > > Jason I'd wager that you need to escape your '\' - bcp boost\\regex.hpp \\temp or bcp boost/regex.hpp /temp

1 0

Re: [Boost-users] [Graph] Compilation error with MinGW and Boost 1.33.1
by Florian.PONROY＠fr.thalesgroup.com 27 Mar '09

27 Mar '09

Weird. It has something to do with compiler optimizations. If -O2 is enabled, these errors disappear... I try to figure out why. > -----Message d'origine----- > De : PONROY Florian - CLB > Envoyé : vendredi 27 mars 2009 12:17 > À : boost-users(a)lists.boost.org > Objet : [Graph] Compilation error with MinGW and Boost 1.33.1 > > Hi, > > I have the following compilation error with MinGW 3.4.5, under Linux : > > /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_14vertex_index_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): multiple > definition of `_s_prop_not_found' > /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_14vertex_color_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): first > defined here > /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_13edge_weight_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): multiple > definition of `_s_prop_not_found' > /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_14vertex_color_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): first > defined here > /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_14buffer_param_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): multiple > definition of `_s_prop_not_found' > /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_14vertex_color_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): first > defined here > /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_18distance_compare_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): > multiple definition of `_s_prop_not_found' > /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_14vertex_color_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): first > defined here > /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_18distance_combine_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): > multiple definition of `_s_prop_not_found' > /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_14vertex_color_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): first > defined here > /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_14distance_inf_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): multiple > definition of `_s_prop_not_found' > /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_14vertex_color_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): first > defined here > /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_15distance_zero_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): multiple > definition of `_s_prop_not_found' > /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_14vertex_color_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): first > defined here > /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_15graph_visitor_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): multiple > definition of `_s_prop_not_found' > /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_14vertex_color_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): first > defined here > > The code compiles fine under Linux with g++ though. > > I use both the BGL and Dijkstra algorithm. The adjacency lists are defined > this way: > > typedef boost::adjacency_list<boost::listS, > boost::vecS, > boost::directedS > > tGraphReachable; > > typedef boost::adjacency_list<boost::listS, > boost::vecS, > boost::directedS, > boost::no_property, > boost::property<boost::edge_weight_t, > tLinkWeight> > > tGraphShortestpath; > > typedef tGraphReachable::vertex_descriptor tReachableVertex; > typedef tGraphShortestpath::vertex_descriptor tDijkstraVertex; > typedef std::vector<tDijkstraVertex> tPredecessorMap; > typedef std::vector<tLinkWeight> tDistanceMap; > > Call to BFS is done this way: > > tGraphReachable graph(m_nodeList.size()); > > // Graph construction > this->PrepareDataForComputeReachableNodes(graph); > > std::vector<tReachableVertex> reachableNodes; > reachableNodes.reserve(m_nodeList.size()); > > tReachableVertex sourceVertex(boost::vertex(m_localNodeId, > graph)); > > boost::breadth_first_search(graph, sourceVertex, > boost::visitor( > boost::make_bfs_visitor( > boost::write_property( > > boost::identity_property_map(), > > std::back_inserter(reachableNodes), > > boost::on_discover_vertex())))); > > > Call to Dijsktra: > > tGraphShortestpath graph; > > for (tLinkList::const_iterator itLink(links.begin()); > links.end() != itLink; > ++itLink) > { > boost::add_edge((*itLink)->m_sourceId, > (*itLink)->m_destinationId, > (*itLink)->m_weight, > graph); > } > > tDijkstraVertex sourceVertex(boost::vertex(sourceNode, graph)); > > tPredecessorMap predecessors(boost::num_vertices(graph)); > tDistanceMap distances(boost::num_vertices(graph)); > > boost::dijkstra_shortest_paths(graph, > sourceVertex, > > boost::predecessor_map(&predecessors[0]) > .distance_map(&distances[0])); > > What did I do wrong? > > Thanks very much for your help. > > -- > Florian PONROY > Thales Land & Joint France > Tel. : +33(0)1 41 304 363 > Fax : +33(0)1 41 303 560 > Email : florian.ponroy(a)fr.thalesgroup.com >

1 0

[Tuple] Problem with operator== and tuples
by Dominique Devienne 27 Mar '09

27 Mar '09

I'm trying to compare two tuple instances of the same type (indirectly by doing an == on std::set's of them), but this doesn't compile for me. The Tuple doc seems to indicate comparisons are supported. What am I missing? Thanks, --DD struct RowidTupleComparator { bool operator()( const boost::tuple<sqlite3_int64>& lhs, const boost::tuple<sqlite3_int64>& rhs ) const { return boost::get<0>(lhs) < boost::get<0>(rhs); } }; void TypeIdTests::test_rtti_vtable_text_vs_int() { typedef boost::tuple<sqlite3_int64> ROW; std::set<ROW, RowidTupleComparator> by_type_id; get_rows( "select rowid from rtti where type_id = :1", make_tuple(MyFoo::id().value()), by_type_id ); std::set<ROW, RowidTupleComparator> by_type; get_rows( "select rowid from rtti where type = :1", make_tuple(MyFoo::id().name().string()), by_type ); CPPUNIT_ASSERT_EQUAL(by_type_id.size(), by_type.size()); CPPUNIT_ASSERT(by_type_id == by_type); // <<< doesn't compile } c:\program files\microsoft visual studio 8\vc\include\utility(60) : see declaration of 'std::operator ==' c:\program files\microsoft visual studio 8\vc\include\xutility(2621) : error C2676: binary '==' : 'const boost::tuples::tuple<sqlite3_int64>' does not define this operator or a conversion to a type acceptable to the predefined operator // edited

2 2

multi-index:Q - Space and time efficiency
by dhruva 27 Mar '09

27 Mar '09

Hi, I have a struct with 2 members as follows: typedef struct time_series { time_t _time; double _value; } time_series_t; The data I get is sorted by time as it is a time series. I would like to maintain another index sorted by value. Since I need to keep removing the oldest records, I need the time based order and since I need to compute percentile, I need to sort it based on value. Would using multi-index save space (and time in insertion and removal) compared to having 2 vectors with different sort order? This is related to my implementation of percentile using boost::accumulators. I could not use the 'tail' or other equivalents as they expect window size (number of data) in advance and I will not know that. Hence, I need a container that can grow. -dhruva Unlimited freedom, unlimited storage. Get it now, on http://help.yahoo.com/l/in/yahoo/mail/yahoomail/tools/tools-08.html/

2 2

Re: [Boost-users] How do i only get Regex??
by John Maddock 27 Mar '09

27 Mar '09

> I'm using VC++ 8 and I am trying to use the boost regex in order to use > regular expressions. I can get it to work, but it requires 60mb of files! > What is the simplest, smallest subset of files that I need to get this to > work. If there is a way to only have to import a dll or lib, that would > be > ideal. I would like it to be separate and standalone from the massive > file > collection that comes with boost as a whole. You can use bcp to extract a subset of Boost: http://www.boost.org/doc/libs/1_38_0/tools/bcp/bcp.html Of course your final executable will be the same size regardless of whether you extract out Boost.Regex or not :-) HTH John.

2 2

[Graph] Compilation error with MinGW and Boost 1.33.1
by Florian.PONROY＠fr.thalesgroup.com 27 Mar '09

27 Mar '09

Hi, I have the following compilation error with MinGW 3.4.5, under Linux : /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_14 vertex_index_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): multiple definition of `_s_prop_not_found' /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_14 vertex_color_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): first defined here /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_13 edge_weight_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): multiple definition of `_s_prop_not_found' /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_14 vertex_color_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): first defined here /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_14 buffer_param_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): multiple definition of `_s_prop_not_found' /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_14 vertex_color_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): first defined here /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_18 distance_compare_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): multiple definition of `_s_prop_not_found' /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_14 vertex_color_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): first defined here /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_18 distance_combine_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): multiple definition of `_s_prop_not_found' /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_14 vertex_color_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): first defined here /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_14 distance_inf_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): multiple definition of `_s_prop_not_found' /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_14 vertex_color_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): first defined here /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_15 distance_zero_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): multiple definition of `_s_prop_not_found' /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_14 vertex_color_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): first defined here /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_15 graph_visitor_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): multiple definition of `_s_prop_not_found' /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_14 vertex_color_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): first defined here The code compiles fine under Linux with g++ though. I use both the BGL and Dijkstra algorithm. The adjacency lists are defined this way: typedef boost::adjacency_list<boost::listS, boost::vecS, boost::directedS > tGraphReachable; typedef boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, tLinkWeight> > tGraphShortestpath; typedef tGraphReachable::vertex_descriptor tReachableVertex; typedef tGraphShortestpath::vertex_descriptor tDijkstraVertex; typedef std::vector<tDijkstraVertex> tPredecessorMap; typedef std::vector<tLinkWeight> tDistanceMap; Call to BFS is done this way: tGraphReachable graph(m_nodeList.size()); // Graph construction this->PrepareDataForComputeReachableNodes(graph); std::vector<tReachableVertex> reachableNodes; reachableNodes.reserve(m_nodeList.size()); tReachableVertex sourceVertex(boost::vertex(m_localNodeId, graph)); boost::breadth_first_search(graph, sourceVertex, boost::visitor( boost::make_bfs_visitor( boost::write_property( boost::identity_property_map(), std::back_inserter(reachableNodes), boost::on_discover_vertex())))); Call to Dijsktra: tGraphShortestpath graph; for (tLinkList::const_iterator itLink(links.begin()); links.end() != itLink; ++itLink) { boost::add_edge((*itLink)->m_sourceId, (*itLink)->m_destinationId, (*itLink)->m_weight, graph); } tDijkstraVertex sourceVertex(boost::vertex(sourceNode, graph)); tPredecessorMap predecessors(boost::num_vertices(graph)); tDistanceMap distances(boost::num_vertices(graph)); boost::dijkstra_shortest_paths(graph, sourceVertex, boost::predecessor_map(&predecessors[0]) .distance_map(&distances[0])); What did I do wrong? Thanks very much for your help. -- Florian PONROY Thales Land & Joint France Tel. : +33(0)1 41 304 363 Fax : +33(0)1 41 303 560 Email : florian.ponroy(a)fr.thalesgroup.com

1 0

[Q] string alg to remove spaces
by V S P 27 Mar '09

27 Mar '09

Looking at string algorithms and cannot figure what combination of them I need to remove all, but one spaces between words in a string so that "1 2 3" becomes "1 2 3" if there is a 'collection' of snippets for string alg, please let me know (I actually like that PHP has zillion of functions on strings, instead of having users to figure out the clever uses of 2 or 3 function for everything like in PERL) thanks in advance, Vlad -- V S P toreason(a)fastmail.fm -- http://www.fastmail.fm - IMAP accessible web-mail

2 1

Re: [Boost-users] How do i only get Regex??
by Ovanes Markarian 27 Mar '09

27 Mar '09

On Thu, Mar 26, 2009 at 7:55 PM, Green, Jason M NSWCDL, W33 < jason.m.green3(a)navy.mil> wrote: > I’m using VC++ 8 and I am trying to use the boost regex in order to use > regular expressions. I can get it to work, but it requires 60mb of files! > What is the simplest, smallest subset of files that I need to get this to > work. If there is a way to only have to import a dll or lib, that would be > ideal. I would like it to be separate and standalone from the massive file > collection that comes with boost as a whole. > > > > Please help! > > > > Thanks, Jason > Did you try analysing with Depends (tool which comes with MSVC) which DLLs your app references? I don't think RegEx adds 60mb to your app. Regards, Ovanes

1 0

[Graph] Adjacency list scalability with a Dijkstra algorithm
by Florian.PONROY＠fr.thalesgroup.com 27 Mar '09

27 Mar '09

Hi, Assuming that I want a graph made of 6 nodes, numbered 1, 2, 3, 4, 5 and 4242. I build the graph this way: typedef boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, int> > tGraphShortestpath; tGraphShortestpath graph; boost::add_edge(1, 2, 1234); // 1234 is the weight boost::add_edge(1, 3, 412); ... boost::add_edge(5, 2, 29); boost::add_edge(5, 4242, 84); boost::add_edge(4242, 2, 456); boost::add_edge(4242, 5, 680); Now, I want to apply the Dijkstra algorithm on this graph. I create a distance and a predecessor vector, as I have seen on the documentation online : typedef tGraphShortestpath::vertex_descriptor tVertex; std::vector<tVertex> predecessors(boost::num_vertices(graph)); std::vector<int> distances(boost::num_vertices(graph)); Here is the problem: I would have imagined that, in my case, boost::num_vertices(graph) would have returned 6, but it actually returns the higher vertex number + 1, that is... 4243 ! So each of my vector has a size of 4243 * sizeof(tVertex) bytes... Is there a way to handle that? I probably misuse the API, but it would be better if the container would be dimensioned to the actual number of vertices, since I am in a CPU and memory constraint environment... Thank you very much for your help! -- Florian PONROY Thales Land & Joint France Tel. : +33(0)1 41 304 363 Fax : +33(0)1 41 303 560 Email : florian.ponroy(a)fr.thalesgroup.com

4 5

dijkstra and associative property map
by Sandeep Gupta 26 Mar '09

26 Mar '09

Hi, Attached below is the code to call Dijkstra over property_map data structures. The current definition of associative property map is incompatible for dijkstra. Somehow there is mismatch with respect to operator[]. Attach below is the code and the error. std::map<vertex_t, vertex_t> pred; boost::associative_property_map< std::map<vertex_t, vertex_t> > preds(pred); std::map<vertex_t, double> dist; boost::associative_property_map< std::map<vertex_t, double> > dists(dist); std::map<vertex_t, double> weight; boost::associative_property_map< std::map<vertex_t, double> > weights(weight); vertex_t v; //vertex_t v1 = preds[v]; dijkstra_shortest_paths(tg, v, predecessor_map(preds). weight_map(weights). distance_map(dists) ); Error: /home/sandeep/Computing/boost_1_38_0/boost/property_map.hpp:314: error: no match for ‘operator[]’ in ‘(const boost::associative_property_map<std::map<unsigned int, double, std::less<unsigned int>, std::allocator<std::pair<const unsigned int, double> > > >&)((const boost::associative_property_map<std::map<unsigned int, double, std::less<unsigned int>, std::allocator<std::pair<const unsigned int, double> > > >*)(& pa))[k]’ /home/sandeep/Computing/boost_1_38_0/boost/property_map.hpp:458: note: candidates are: typename UniquePairAssociativeContainer::value_type::second_type& boost::associative_property_map<UniquePairAssociativeContainer>::operator[](const typename UniquePairAssociativeContainer::key_type&) const [with UniquePairAssociativeContainer = std::map<unsigned int, double, std::less<unsigned int>, std::allocator<std::pair<const unsigned int, double> > >] Thanks sandeep

1 1

How do i only get Regex??
by Green, Jason M NSWCDL, W33 26 Mar '09

26 Mar '09

I'm using VC++ 8 and I am trying to use the boost regex in order to use regular expressions. I can get it to work, but it requires 60mb of files! What is the simplest, smallest subset of files that I need to get this to work. If there is a way to only have to import a dll or lib, that would be ideal. I would like it to be separate and standalone from the massive file collection that comes with boost as a whole. Please help! Thanks, Jason

1 0

[Date_Time] compile errors with gcc 4.3
by Pearl Rothman 26 Mar '09

26 Mar '09

I am using Fedora 9, gcc 4.3.0, and boost 1.38.0. When I include <boost/date_time/posix_time/posix_time_types.hpp> I get the following errors /usr/lib/gcc/x86_64-redhat-linux/4.3.0/../../../../include/c++/4.3.0/ctime:67: error: ‘::clock_t’ has not been declared /usr/lib/gcc/x86_64-redhat-linux/4.3.0/../../../../include/c++/4.3.0/ctime:68: error: ‘::time_t’ has not been declared /usr/lib/gcc/x86_64-redhat-linux/4.3.0/../../../../include/c++/4.3.0/ctime:71: error: ‘::clock’ has not been declared /usr/lib/gcc/x86_64-redhat-linux/4.3.0/../../../../include/c++/4.3.0/ctime:72: error: ‘::difftime’ has not been declared /usr/lib/gcc/x86_64-redhat-linux/4.3.0/../../../../include/c++/4.3.0/ctime:73: error: ‘::mktime’ has not been declared /usr/lib/gcc/x86_64-redhat-linux/4.3.0/../../../../include/c++/4.3.0/ctime:74: error: ‘::time’ has not been declared /usr/lib/gcc/x86_64-redhat-linux/4.3.0/../../../../include/c++/4.3.0/ctime:75: error: ‘::asctime’ has not been declared /usr/lib/gcc/x86_64-redhat-linux/4.3.0/../../../../include/c++/4.3.0/ctime:76: error: ‘::ctime’ has not been declared /usr/lib/gcc/x86_64-redhat-linux/4.3.0/../../../../include/c++/4.3.0/ctime:77: error: ‘::gmtime’ has not been declared /usr/lib/gcc/x86_64-redhat-linux/4.3.0/../../../../include/c++/4.3.0/ctime:78: error: ‘::localtime’ has not been declared /usr/lib/gcc/x86_64-redhat-linux/4.3.0/../../../../include/c++/4.3.0/ctime:79: error: ‘::strftime’ has not been declared How can I resolve them? Thanks

2 1

boost::asio memory buffers and persistent connections.
by Alejandro Martinez 26 Mar '09

26 Mar '09

I have a server running with asio. At any time i have 5000+ persistent connections from clients, but not all of them are sending/receiving data at all times. In fact, they only do requests once in a while. The problem is (with my current approach) that i need to have 5000+ memory buffers ready to receive that requests of very varying length. How could i make it so i can set the buffer to use at the exact moment in which data for a new request in an already open connection begins to arrive? And maybe have those buffers in some memory pool. I've been studying http://www.boost.org/doc/libs/1_38_0/doc/html/boost_asio/example/allocation… without understanding it completely, but it doesn't look like what im looking for. Any ideas? Thanks a lot in advance. Alejandro

4 7

multithreaded timer?
by Francisco Ares 26 Mar '09

26 Mar '09

Hi I'm implementing an application, serial RS232 communications centered, using boost in Windows. Many of the user actions are translated to ASCII commands to be sent to some serial devices connected to the serial ports, but as they are quite slow, I had to implement a command queue, so that as soon as a command gets its answer, it is cleared and the next one is sent, up to the end of the queue (of course). Using boost serial communication features, I realized that I needed an extra time-out, because the devices are real slow. So that this low speed doesn't lock up anything, the command queue runs in a separate thread and I would like another thread to run a timer, that could be activated when the command is send by the queue thread, and deactivated by the same thread if it detects an answer coming from the device in response to its command. If the timer is due, it should send a signal or call a callback function in the queue thread so it knows that the last command timed-out and it should re-send it again. All the queue things are OK (so it seems for now), I just need the timer. The ASIO timer is quite strange to me, I didn't manage to make it work. I have already seen the "timers" tutorials at boost web pages, and none have worked for me as expected. Any ideas / suggestions / snippets? Thanks a lot Francisco -- "If you have an apple and I have an apple and we exchange apples then you and I will still each have one apple. But if you have an idea and I have one idea and we exchange these ideas, then each of us will have two ideas." - George Bernard Shaw

4 4

[MPL] MPL use cases overview
by Olivier Tournaire 26 Mar '09

26 Mar '09

Hi all, I am currently reading "C++ template metaprogramming" and I am very interested in the MPL provided by boost. However, I am curious on how users integrate this library in their developments. Please feel free to post not only code snippets, but also description of your usages of the MPL ! Thanks, Olivier

4 4

[gil] Unexplainable compiler error
by Robert Dailey 26 Mar '09

26 Mar '09

Below is the compiler error that I'm getting in Visual Studio 2008: C:\IT\work\redsword\third_party\boost\1_38_0\boost/gil/image.hpp(119) : error C2039: '_view' : is not a member of 'boost::gil::image_view<Loc>' with [ Loc=boost::gil::rgba8c_loc_t ] ..\..\..\..\components\libs\renderer\source\Image.cpp(44) : see reference to function template instantiation 'boost::gil::image<Pixel,IsPlanar,Alloc> &boost::gil::image<Pixel,IsPlanar,Alloc>::operator =<boost::gil::image_view<Loc>>(const Img &)' being compiled with [ Pixel=boost::gil::rgba8_pixel_t, IsPlanar=false, Alloc=std::allocator<unsigned char>, Loc=boost::gil::rgba8c_loc_t, Img=boost::gil::image_view<boost::gil::rgba8c_loc_t> ] And the code that it is compiling: #include <boost/gil/image_view.hpp> #include <boost/gil/image.hpp> #include <boost/gil/typedefs.hpp> Image::Image( unsigned char const* buffer, unsigned int width, unsigned int height, unsigned int bitsPerPixel, int pitch ) { // Provide a pitch the exact width of the image if no // explicit pitch was provided. if( !pitch ) { pitch = width * bitsPerPixel; } using namespace boost::gil; m_imageData = interleaved_view( width, height, reinterpret_cast<rgba8_pixel_t const*>( buffer ), pitch ); } I'm still new to boost::gil and it's very hard to learn. Can anyone guide me in the right direction as to how to resolve this compiler error?

2 1

Re: [Boost-users] boost::array and lower_bound
by Hicham Mouline 26 Mar '09

26 Mar '09

I just didn't the see the std::lower_bound version with the comparator. That does what I want, Regards. > -----Original Message----- > From: Hicham Mouline [mailto:hicham@mouline.org] > Sent: 26 March 2009 9:30 > To: 'boost-users(a)lists.boost.org' > Subject: boost::array and lower_bound > > Hello, > I maintain a boost::array< pair< time, value > > B, > sorted by time, where I defined operator< for pair<time, value> > > I wish to get a given entry from the array for a given time y. > > If y matches any entry, value is returned, if y is between 2 entries, an > interpolated value is returned. > > std::lower_bound( &B[0], &B[supSize], ... ) //this doesn't work > > I suppose for this I need to define some other related iterator to pass to > lower_bound, > not boost::array< pair< time, value > >::const_iterator. > > I suppose this is what "Iterator adaptors" are about ? > I have seen the term "views" as well, is this related? > > Regards,

1 0

boost::array and lower_bound
by Hicham Mouline 26 Mar '09

26 Mar '09

Hello, I maintain a boost::array< pair< time, value > > B, sorted by time, where I defined operator< for pair<time, value> I wish to get a given entry from the array for a given time y. If y matches any entry, value is returned, if y is between 2 entries, an interpolated value is returned. std::lower_bound( &B[0], &B[supSize], ... ) //this doesn't work I suppose for this I need to define some other related iterator to pass to lower_bound, not boost::array< pair< time, value > >::const_iterator. I suppose this is what "Iterator adaptors" are about ? I have seen the term "views" as well, is this related? Regards,

1 0

Re: [Boost-users] [Graph] Adjacency list scalability with a Dijks tra algorithm
by Florian.PONROY＠fr.thalesgroup.com 26 Mar '09

26 Mar '09

Hi Juan, Thanks for your answer. I definitly agree with the map overhead, I will try to better understand how the property map works in order to implement your solution. Florian -----Message d'origine----- De : boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org]De la part de Juan Antonio Farré Basurte Envoyé : mercredi 25 mars 2009 19:27 À : boost-users(a)lists.boost.org Objet : Re: [Boost-users] [Graph] Adjacency list scalability with a Dijks tra algorithm Hi, It's as easy as instantiating the adjacency_list template with mapS for the vertex list selector. This is the second template argument. For example, typedef boost::adjacency_list<boost::vecS,boost::mapS> myGraph; Anyway, remember that a map is more expensive than a vector in terms of both space and time (access time to an element is logarithmic). Another option is that you stay with the default vector for the vertex list, and you use a property to store the vertex id. This way, your vertex 4242 would have descriptor 6 and you'd store 4242 as its id-property value. Cheers, Juan > Hi Andrew, > > Would you please tell me which part of the documentation I should rely on to use a std::map as you'd suggested? I should actually admit I'm not yet > familiar with the BGL :-) > > > -----Message d'origine----- > De : boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org]De la part de Andrew Sutton > Envoyé : mercredi 25 mars 2009 17:25 > À : boost-users(a)lists.boost.org > Objet : Re: [Boost-users] [Graph] Adjacency list scalability with a Dijkstra algorithm > > > > > Here is the problem: I would have imagined that, in my case, > boost::num_vertices(graph) would have returned 6, but it actually returns > the higher vertex number + 1, that is... 4243 ! So each of my vector has a > size of 4243 * sizeof(tVertex) bytes... Is there a way to handle that? I > probably misuse the API, but it would be better if the container would be > dimensioned to the actual number of vertices, since I am in a CPU and memory > constraint environment... > > > > You're confusing the notions of "index" and "descriptor". With the vertex set using vecS, the descriptor of a vertex is the same as its index -- > hence the confusion. Therefore, when you call add_edge(4242, 1, ...), the graph thinks you mean the vertex whose descriptor is 4242 and resizes > itself accordingly. > > You have to remember - whatever the examples may indicate - that you should never actually use a literal value and descriptors interchangeably. This > isn't documented very well, either. > > You could use a std::map to associate your own identifiers with vertex descriptors. > > > Andrew Sutton > andrew.n.sutton(a)gmail.com <mailto:andrew.n.sutton@gmail.com> > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

unicode, C++0x, UTF-16
by Brent Arias 26 Mar '09

26 Mar '09

I see that wstring_convert and codecvt_utf8_utf16 are in the current C++0x spec. Are there plans to backfill boost with implementations for these? I'm also curious why the critique of wstring_convert (http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1750.html) was not incorporated for C++0x. Thoughts? I've also spotted a comment in boost codecvt_utf8_facet saying: // note the following code will generate on some platforms where // wchar_t is defined as UCS2. The warnings are superfluous as // the specialization is never instantitiated with such compilers. Does that mean that boost.codecvt_utf8_facet is capable of acting as a UTF-8 / UCS2 converter on a Windows box, where wchar_t is 2 bytes in size? Brent Arias Software Architect Lumension Security(tm) Tel ~ (602) 692-8088 Fax ~ (480) 970-6323 brent.arias(a)lumension.com<mailto:brent.arias@lumension.com>

2 1

[fusion] complexity of filter_view
by er 26 Mar '09

26 Mar '09

Hi All, If say vector_type has N elements and predicate is true only for one of them. O(N)? typedef filter_view<vector_type const, predicate > view_t O(1)? view_t view(v);

2 1

Steven Watanabe template profiler
by Joel Falcou 26 Mar '09

26 Mar '09

A while back, I claimed having problems using Steven template profiler. I'm ashamed to say that the problem was that gcc is actually localized. So the warning I got in the filtered output was : "./test.hpp:17: attention : ‘int template_profiler::f(int)’ is deprecated (declared at ./template_profiler.hpp:50) " So I guess I have to edit the regex in postprocess ? I am not a regex guru so If Steven walk by, could you give me some directions to fix this on my end. -- ___________________________________________ Joel Falcou - Assistant Professor PARALL Team - LRI - Universite Paris Sud XI Tel : (+33)1 69 15 66 35

2 1

compile-time check that a member function exists
by John Pretz 25 Mar '09

25 Mar '09

Hi, I'm pretty new to boost. I want to write some code with a compile-time check whether a member function exists or not. The code below shows kinda what I need except I'd obviously like to avoid a specialized template for each class that I use. Can anybody point me in the right direction? Thanks, John **************************************** #include <iostream> using namespace std; struct WithMemberGo { void Go() const {cout<<__PRETTY_FUNCTION__<<" going...."<<endl;} }; struct WithoutGo { }; template <class T> void CallGoIfItExists(const T& t){ t.Go(); } // I want to avoid having to specialize this function for every class without the // right member function. template <> void CallGoIfItExists<WithoutGo>(const WithoutGo&){ cout<<"not going anywhere...."<<endl; } int main(){ WithMemberGo with; CallGoIfItExists(with); WithoutGo without; CallGoIfItExists(without); } -- John Pretz -- P-23, MS H803 Los Alamos National Lab Los Alamos, NM 87545 Phone: (505)665-5847 Fax: (505)665-4121

5 10

Re: [Boost-users] [Graph] Adjacency list scalability with a Dijks tra algorithm
by Florian.PONROY＠fr.thalesgroup.com 25 Mar '09

25 Mar '09

Hi Andrew, Would you please tell me which part of the documentation I should rely on to use a std::map as you'd suggested? I should actually admit I'm not yet familiar with the BGL :-) -----Message d'origine----- De : boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org]De la part de Andrew Sutton Envoyé : mercredi 25 mars 2009 17:25 À : boost-users(a)lists.boost.org Objet : Re: [Boost-users] [Graph] Adjacency list scalability with a Dijkstra algorithm Here is the problem: I would have imagined that, in my case, boost::num_vertices(graph) would have returned 6, but it actually returns the higher vertex number + 1, that is... 4243 ! So each of my vector has a size of 4243 * sizeof(tVertex) bytes... Is there a way to handle that? I probably misuse the API, but it would be better if the container would be dimensioned to the actual number of vertices, since I am in a CPU and memory constraint environment... You're confusing the notions of "index" and "descriptor". With the vertex set using vecS, the descriptor of a vertex is the same as its index -- hence the confusion. Therefore, when you call add_edge(4242, 1, ...), the graph thinks you mean the vertex whose descriptor is 4242 and resizes itself accordingly. You have to remember - whatever the examples may indicate - that you should never actually use a literal value and descriptors interchangeably. This isn't documented very well, either. You could use a std::map to associate your own identifiers with vertex descriptors. Andrew Sutton andrew.n.sutton(a)gmail.com <mailto:andrew.n.sutton@gmail.com>

2 1

Statechart problem
by Iwan Sanders 25 Mar '09

25 Mar '09

LS, I've implemented a state machine (synchronous) with a couple of states and their events. Its purpose is to implement an USDT CAN stack. Because the lower level driver (made that too) passes the incoming CAN messages through a callback function I needed to derive one state in the state machine from: a) the expected boost state base b) my own interface which handles the callback for new messages (observer) The state machine is performing well with one exception, hence this email. The callback function is a member of a struct which is derived from a & b and it is called by the CAN driver. But then when I want to notify the state that the machine is currently in with a post_event this event seems to be discarded even though it should react on it (the machine state has transitions defined for this event and the current state is that state). I also tried using the transit call but that doesn't do anything either. It is just this one member-function that is the problem and before rewriting the state-machine to an asynchronous state machine I wanted to consult some other users. Regards, Iwan Sanders

3 7

Re: [Boost-users] [asio] Disable nagle algorithm on Windows XP
by 张亚霏 25 Mar '09

25 Mar '09

try native WSA API "setsockopt" with the TCP_NODELAY option. if it still does not work, there may be something wrong with your windows xp. or debug the asio ------------------ best wishes to you 张亚霏 ------------------ Original ------------------ From: "Tobias J?hnel"<tjaehnel(a)gmail.com>; Date: Wed, Mar 25, 2009 10:58 PM To: "boost-users"<boost-users(a)lists.boost.org>; Subject: Re: [Boost-users] [asio] Disable nagle algorithm on Windows XP Hi Igor, thanks for your reply. I guess you mean setting non_blocking_io to false. Tried to enter those lines, but still have no change: boost::asio::socket_base::non_blocking_io command(false); socket.io_control(command); Tobias On Wed, Mar 25, 2009 at 3:07 PM, Igor R <boost.lists(a)gmail.com> wrote: >> I'm already using blocking sockets as suggest in above document. > > According to that document, you should not enocounter this problem > when using blocking sockets. Probably your socket is not blocking? > To make a socket blocking you should write something like this: > boost::asio::socket_base::non_blocking_io command(true); > socket.io_control(command); > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users > _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

Re: [Boost-users] [asio] ip::tcp::socket - differences between send &write_some
by 张亚霏 25 Mar '09

25 Mar '09

after referring the source code, i hardly found difference between ip::tcp::socket::send & ip::tcp::socket::write_some, but about some arguments. "socket_ops::send" directly invokes system call:"sendmsg" to send message. ------------------ best wishes to you 张亚霏 ------------------ Original ------------------ From: "Lennyk"<lennyk430(a)gmail.com>; Date: Wed, Mar 25, 2009 04:59 PM To: "boost-users"<boost-users(a)lists.boost.org>; Subject: [Boost-users] [asio] ip::tcp::socket - differences between send &write_some Hi, What is the difference in implementation between the ip::tcp::socket::send & ip::tcp::socket::write_some on Linux sys sockets? What kind of system calls are used in both calls? Thanks! _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

[asio] Disable nagle algorithm on Windows XP
by Tobias Jähnel 25 Mar '09

25 Mar '09

Hi, I'm developing a TCP-Client using boost::asio and discovered that ACKs to responses from the server are sent with some delay (~200ms) and I get the data not before this ACK has been sent. When I disable nagle in registry as described by Microsoft it works fine. (See: http://support.microsoft.com/kb/823764) To avoid those registry hacks I want to find another way to get rid of this latency. I'm already using blocking sockets as suggest in above document. I also tried to set the no_delay option but this has no effect at all. boost::asio::ip::tcp::no_delay option(true); socket.set_option(option); == Code Snippets == I use the boost asio library as follows: // open connection (from synchronous TCP daytime client example) boost::asio::io_service io_service; tcp::resolver resolver(io_service); tcp::resolver::query query(ipaddress, port); tcp::resolver::iterator endpoint_iterator = resolver.resolve(query); tcp::resolver::iterator end; boost::system::error_code error = boost::asio::error::host_not_found; while (error && endpoint_iterator != end) { socket.close(); socket.connect(*endpoint_iterator++, error); } // send some data boost::asio::write(socket, boost::asio::buffer(package, size)); // reception is done inside a thread while(true) { // receive data size_t length = socket.read_some(boost::asio::buffer(resp), error); if (error == boost::asio::error::eof) { // Connection closed cleanly by peer. // ... do sth. } else if (error) { // Some error has happened // ... do sth. } // ... process received data and notify main thread to send the next piece of data } ======= Thank you for all suggestions. Tobias

2 2

Re: [Boost-users] [corrected]How to delay the initialisation of a member in a C++ base class until the ctor of derived class is executed?
by Zhi Tan 25 Mar '09

25 Mar '09

> Date: Wed, 25 Mar 2009 20:13:02 +1100 > From: Alex MDC <alex.mdc(a)gmail.com> > > Since you're passing the size into the derived constructor, why don't you > just pass it through to the base constructor? > > class base > { > public: > base(size_t array_size):size(array_size) > { > p_array.reset(new unsigned char[size]); > } > private: > size_t size; > boost::shared_array<unsigned char> p_array; > }; > > class derived > { > public: > derived(size_t array_size):base(array_size) > { > } > }; > > > Will that work for you? Exactly. Thank you.

1 0

Re: [Boost-users] Boost-users Digest, Vol 1945, Issue 2
by tom tan 25 Mar '09

25 Mar '09

From: Matthieu Brucher <matthieu.brucher(a)gmail.com> >Perhaps simply: > >class base >{ >public: > base(size_t size):size(size), p_array(new unsigned char[size]){} >private: > size_t size; > boost::shared_array<unsigned char> p_array; >}; > >And then: > >class derived:public base >{ >public: > derived(size_t array_size):base(array_size) > { > } >}; > >Do not declare size and p_array again, they will be different than the >ones in the base class... but in this case array_size is re-assigned after p_array was allocated, thus not reflecting the size of the allocated buffer; What I wished to achieve is: 1) the buffer is allocated inside the base class while 2) the size is designated inside the derived class. >From: Christopher Currie <christopher(a)currie.com> >Also, shared_ptr won't work for arrays, you'll want to used >"shared_array" instead. That's right, I was thinking of shared_array while I was typing, but ... >You might also think twice about this, and decide if having a shared >copy of the buffer is really what you want, or if you're just using >the smart pointer for memory management. If so, consider using >"scoped_array" and defining a copy constructor with the appropriate >semantics. >If you go this route, you may just as well stick with 'vector'. It's >less work, and probably far less overhead than you think. I need some dynamically allocated space that can later be casted to C pointers, so that it can be passed to a Win32 API function that accepts C pointers only. vectors are dynamic, but they don't cast to C arrays naturally. In fact, I am wrapping that API in C++. is there a better way?

3 2

How to convert graphtraits<Graph>::in_edge to graphtraits<Graph>::edge
by Phani Deepak 25 Mar '09

25 Mar '09

hi, i have stored some bundled properties for an edge. * class EdgeProperties { public: int targetI;// Terminal No. interms of target node int sourceI;// Terminal No. interms of source node EdgeProperties(int s,int t):sourceI(s-1),targetI(t-1) { } };* my Graph is : *typedef boost::adjacency_list<boost::listS,boost::listS,boost::bidirectionalS, EdgeProperties *> Graph; Graph g; * Now iam iterating through in_edges of some vertex v; *graphtraits<Graph>::in_edge_iterator iedge_s,iedge_end; for(boost::tie(iedge_s,iedge_end) = boost::in_edges(v,g); iedge_s!=iedge_end; ++iedge_s){ EdgeProperties *ep = g[*iedge_s]; // <==== **Line 10** cout << ep->sourceI << endl; // <==== **This is giving segmentation fault;** } * I checked the *ep* pointer. it is coming out as null in line 10; is there any problem while using *in_edge_descriptor* as *edge_descriptor**( for g[edge_descriptor]* ) in *Line 10* ?? * *please help. - Phani. * *

2 5

[corrected]How to delay the initialisation of a member in a C++ base class until the ctor of derived class is executed?
by tom tan 25 Mar '09

25 Mar '09

Here's the scenario: I want define a base class that allocate some buffer once for all derived classes, while the size of the buffer varies among different derived classes. I could achieve it in this way: class base { public: base():size(), p_array(0){} private: size_t size; boost::shared_array<unsigned char> p_array; }; in the derived class: class derived { public: derived(size_t array_size):size(array_size) { p_array.reset(new unsigned char[size]); } }; However, in order to simplify the design of the derived class, I really want to put this line: p_array.reset(new unsigned char[size]); to somewhere in the base class, thus writing it only once. In other words,I wished to achieve this: 1) the buffer is allocated inside the base class while 2) the size is designated inside the derived class. Is there any C++ design pattern could achieve it? Thanks

4 3

Re: [Boost-users] [asio] ip::tcp::socket - differences between send &write_some
by 张亚霏 25 Mar '09

25 Mar '09

concerning ... ------------------ best wishes to you 张亚霏 ------------------ Original ------------------ From: "Lennyk"<lennyk430(a)gmail.com>; Date: Wed, Mar 25, 2009 04:59 PM To: "boost-users"<boost-users(a)lists.boost.org>; Subject: [Boost-users] [asio] ip::tcp::socket - differences between send &write_some Hi, What is the difference in implementation between the ip::tcp::socket::send & ip::tcp::socket::write_some on Linux sys sockets? What kind of system calls are used in both calls? Thanks! _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

[asio] ip::tcp::socket - differences between send & write_some
by Lennyk 25 Mar '09

25 Mar '09

Hi, What is the difference in implementation between the ip::tcp::socket::send & ip::tcp::socket::write_some on Linux sys sockets? What kind of system calls are used in both calls? Thanks!

1 0

Is there a way to delay the initialisation of a member in a C++ base class until the ctor of the derived class is executed?
by tom tan 25 Mar '09

25 Mar '09

Here's the scenario: I want define a base class that allocate some buffer once for all derived classes, while the size of the buffer varies among different derived classes. I could achieve it in this way: class base { public: base():size(), p_array(0){} private: size_t size; boost::shared_ptr<unsigned char> p_array; }; in the derived class: class derived { public: derived(size_t array_size):size(array_size) { p_array.reset(new unsigned char[size]); } private: size_t size; boost::shared_ptr<unsigned char> p_array; }; However, in order to simplify the design of the derived class, I really want to put this line: p_array.reset(new unsigned char[size]); to somewhere in the base class, thus writing it only once. Is there any C++ design pattern could achieve it? Thanks

3 2

linking agaisnt boost
by arun ramakrishnan 25 Mar '09

25 Mar '09

A nube question . I have been trying to understand the whole link process in VC++ . I use visual studio 8. I was trying to install the prebuild boost libs from boostpro and I tried to build my source against 1) , 2) and 3) . The three are. 1)Multithread, static runtime libboost_thread-vc80-mt-s-1_38.lib 2)Multithread libboost_thread-vc80-mt-1_38.lib 3)Multithread , DLL boost_thread-vc80-mt-1_38.dll boost_thread-vc80-mt-1_38.lib I expected there to be Multithreaded static lib and then a multithreaded dynamic shared dll . Just 2 of them , not 3 . Could someone explain the need for 3 and not just 2. OR point me to a article or something please . I have vaguely figured that 1) static boost and static CRT . 2) static boost and dynamic CRT. 3) dynamic boost and dynamic CRT. am i right ? I believe boost automatically picks up the right libs based on your project . So , when i tried to build a simple project using these libs . while using the /MT option for code generation , 1) was used as I expected it to. while using the /MD option for code generation , it linked to 2) . I am not able to build using 3) , in spite of a lot of probing into the VC8 configuration options . Also , what configuration would be needed to make my project use the boost dll i.e 3). thanks in advance .

2 1

Re: [Boost-users] BoostCon 2009 Schedule Now Live
by Paul 25 Mar '09

25 Mar '09

I beg you to recorded the conference on video/audio for those who aren't able to make the trip ... 2009/3/25 David Abrahams <dave(a)boostpro.com> > The official schedule is now live at http://www.boostcon.com/program! A > few highlights of the "mouth-watering content" (in the words of one > enrollee) are: > > * A keynote address from Andrei Alexandrescu called "Iterators Must Go." > It's sure to be provocative! > > * Troy Straszheim's presentations on how high-energy physicists are > using Boost to process massive datasets as they go "Icefishing for > Neutrinos" and on Kamasu, his library for offloading computation to > your machine's GPU. > > * Two hands-on sessions where we'll start recoding parts of Boost for > C++0x, applying rvalue references, variadic templates, decltype, and > advanced SFINAE capabilities using the latest GCC. > > * "Practical C++ Test-Driven Development with Boost.Test and Bmock," by > Asher Sterkin > > * A session on compiler construction using Boost.Spirit v2, from Hartmut > Kaiser and Joel de Guzman > > The complete list of sessions covers a wide range of other Boost and > C++-related topics. It is available at > http://www.boostcon.com/program/sessions. Please have a look, and > please, sign up for the conference! Remember, registration for the > whole week is just $599 before April 1st. > > -- > Dave Abrahams > BoostPro Computing > http://www.boostpro.com > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users >

2 1

Looking for guidance on how best to use Boost ASIO in this scenario
by console shark 24 Mar '09

24 Mar '09

I have the following scenario: Up to 1000 client users. 1 Server (or multiple instances of a server). The server(s) read a set of 5-15 incoming data feeds that update as often as 10 to 50 times per second. Each feed is updating at a different interval, as information comes in (essentially random). The server processes the data as it arrives from these feeds and when it finds a useful piece of information, it sends a message to some subset of the 1000 clients. The clients are not all interested in the same thing. It could be that each client has a different interest, and it could be that many times per second each client will need to be notified of that interest. That should be the worst case scenario, as meaningful changes in information probably won't require updates to the client that often, even though the 5-15 feeds are constantly updating. So what is the best way to structure this design using ASIO? Should the 1000 clients actually be set up as servers, and the server really just contact them by connecting each time there is an update that interest them? Or should the 1000 clients all connect with a permanent connection, polling for updates? Thanks for any advice.

2 3

[boost-users][exception] BOOST_THROW_EXCEPTION returns
by Igor R 24 Mar '09

24 Mar '09

Hello all, A function throws boost::exception as follows: //.... typedef boost::error_info<struct tag_action, std::string> action_name; BOOST_THROW_EXCEPTION(error() << action_name(name)); return 0; Both BOOST_NO_EXCEPTIONS and BOOST_EXCEPTION_DISABLE are *not* defined. The excpetion is not catched anywhere. However, the thread continues running! If I put breakpoint at "return 0;" it's hit, and I can continue stepping the code. I run the program under MSVC 9.0, in debug mode, and I see "First-chance exception" and "Unhandled exception" notifications issued by the debugger. Isn't it wrong behavior, or I miss something? Thanks, Igor'.

2 3

BoostCon 2009 Schedule Now Live
by David Abrahams 24 Mar '09

24 Mar '09

The official schedule is now live at http://www.boostcon.com/program! A few highlights of the "mouth-watering content" (in the words of one enrollee) are: * A keynote address from Andrei Alexandrescu called "Iterators Must Go." It's sure to be provocative! * Troy Straszheim's presentations on how high-energy physicists are using Boost to process massive datasets as they go "Icefishing for Neutrinos" and on Kamasu, his library for offloading computation to your machine's GPU. * Two hands-on sessions where we'll start recoding parts of Boost for C++0x, applying rvalue references, variadic templates, decltype, and advanced SFINAE capabilities using the latest GCC. * "Practical C++ Test-Driven Development with Boost.Test and Bmock," by Asher Sterkin * A session on compiler construction using Boost.Spirit v2, from Hartmut Kaiser and Joel de Guzman The complete list of sessions covers a wide range of other Boost and C++-related topics. It is available at http://www.boostcon.com/program/sessions. Please have a look, and please, sign up for the conference! Remember, registration for the whole week is just $599 before April 1st. -- Dave Abrahams BoostPro Computing http://www.boostpro.com

1 0

Find last modified date of file
by Thor Andreas Tangen 24 Mar '09

24 Mar '09

Hi Is it possible by using boost to find the last modified date of a file? I looked in filesystem, but could not find it there. Thanks Thor Andreas

3 2

[boost-users][exception] BOOST_THROW_EXCEPTION returns
by Igor R 24 Mar '09

24 Mar '09

Hello all, A function throws boost::exception as follows: //.... typedef boost::error_info<struct tag_action, std::string> action_name; BOOST_THROW_EXCEPTION(error() << action_name(name)); return 0; Both BOOST_NO_EXCEPTIONS and BOOST_EXCEPTION_DISABLE are *not* defined. The excpetion is not catched anywhere. However, the thread continues running! If I put breakpoint at "return 0;" it's hit, and I can continue stepping the code. I run the program under MSVC 9.0, in debug mode, and I see "First-chance exception" and "Unhandled exception" notifications issued by the debugger. Isn't it wrong behavior, or I miss something? Thanks, Igor'.

2 3

Integrating boost into project version control
by Kenneth Porter 24 Mar '09

24 Mar '09

I have an existing C++ project that uses a few 3rd party libraries. It's maintained in a Subversion repository and the libraries are imported into the repository using the Subversion "vendor branch" paradigm together with Subversion "externals". I want to add Boost to the project, and am looking for guidance from others who have a project in Subversion: Should I import Boost sources into my repo, rebuilding on each developer's system as part of the normal whole-project build, or should I install a binary distro of Boost on each developer's system? The former guarantees that the repo always contains the source used to build our binaries, but at the cost of longer build times to build Boost each time the project is built. I'm currently building with Visual Studio 2005 and 2008, and will eventually be cross-compiling for an embedded Linux system.

4 4

[lambda] extending lambda functions
by alfC 24 Mar '09

24 Mar '09

For some application I need to sum the complex modulus of a collection of elements. In short, I want to be able to replace the lambda expression _1 + bind(&std::norm<double>, _2) by something more natural like _1 + llnorm(_2) For that I use std::accumulate and the lambda library, like in the next working example; #include<boost/lambda/lambda.hpp> #include<boost/lambda/bind.hpp> using namespace boost::lambda; int main(){ using boost::lambda::_1; using boost::lambda::_2; std::vector<std::complex<double> > v(3); v[0]=1.; v[1]=2.; v[2]=3.; double result=std::accumulate(v.begin(), v.end(), double(0.), _1 + bind(&std::norm<double>, _2)); std::cout<<result<<std::endl; return 0; } the question is what do I have to do to be able to use the following syntax instead _1 + llnorm(_2) where llnorm is something I have to define (globally) somewhere else. The question is, how do I have to define llnorm to have the desired effect? The ideal syntax for me would be to be able to say std::norm(_2) or std::norm<double>(_2), but that may not be possible due to name conflict, is it? I am clueless because I don't even know even what is the (C++) type of the argument that would be taken by llnorm. Thanks, Alfredo

3 7

selecting a type (tag) based on a runtime enum value
by Hicham Mouline 24 Mar '09

24 Mar '09

Hello, I have a templated function Engine, that takes 3 template arguments, these are tags T1, T2, T3, T4. I have an typedef enum { e1, e2, e3, e4 } E to element ei corresponds the type Ti ... const E e // switch (e) { case e1: Engine< Metafct1<T1>::type, Metafct2<T1>::type, Metafct3<T1>::type >::Process( .... ); break; case e2: Engine< Metafct1<T2>::type, Metafct2<T2>::type, Metafct3<T2>::type >::Process( .... ); break; ... } Is there a shorter way of writing this... For now I only have 4 in the enum, but I may have more later? regards,

4 3

Seg fault while adding 2nd edge to the graph
by Phani Deepak 24 Mar '09

24 Mar '09

hi, i started using BGL for my project. strangely all the examples i tried to learn BGL worked fine. But when i write the actual code for my project, it started giving me this error. Problem: While adding second edge to the boost graph using boost::add_edge(u,v,g) it is giving out a seg fault. Please help with this prob. Iam also attaching the code that's giving the error /*********Code that's giving this error****************/ #include<iostream> #include<vector> #include<string> #include<queue> #include<stdlib.h> #include<string> #include<sstream> #include<boost/graph/graph_traits.hpp> #include<boost/graph/adjacency_list.hpp> class Node{ public: std::string id; double Energy; Node() {} }; class EdgeProperties { public: int targetI; int sourceI; EdgeProperties(int s,int t):sourceI(s),targetI(t) { } }; typedef boost::adjacency_list<boost::listS,boost::listS,boost::bidirectionalS, Node *,EdgeProperties *> Graph; typedef boost::graph_traits<Graph> GraphTraits; typedef GraphTraits::vertex_descriptor Vertex; typedef GraphTraits::edge_descriptor Edge; namespace boost { Vertex getVertexbyId(std::string id,Graph g){ std::cout << "getVID called for " << id << std::endl; fflush(stdout); GraphTraits::vertex_iterator vstart,vend; for(boost::tie(vstart,vend) = boost::vertices(g); vstart!=vend; vstart++) { if(g[*vstart]->id == (id)) return *vstart; } std::cout << "Critical Error: |" << id << "| referencing node not present in graph " << std::endl; return NULL; } } int main(){ Graph g; // populate Graph with all the vertices and edges. std::cout << "* Populating graph with Vertices and Edges " << std::endl; fflush(stdout); Vertex v = boost::add_vertex(g); g[v] = new Node(); g[v]->id = "xor_1"; g[v]->Energy = 2.3; std::cout << "Inserted xor_1" << std::endl; fflush(stdout); v = boost::add_vertex(g); g[v] = (new Node()); g[v]->id = "and_1"; g[v]->Energy = 1.9; std::cout << "Inserted and_1" << std::endl; fflush(stdout); v = boost::add_vertex(g); g[v] = (new Node()); g[v]->id = "i_1"; std::cout << "Inserted i_1" << std::endl; fflush(stdout); // add Edges std::pair<Edge,bool> e; EdgeProperties *ep = new EdgeProperties(1,1); e = boost::add_edge(boost::getVertexbyId("i_1",g),boost::getVertexbyId("and_1",g),ep,g); std::cout << "Inserted Edge 1" << std::endl; fflush(stdout); ep = new EdgeProperties(1,2); e = boost::add_edge(boost::getVertexbyId("i_1",g),boost::getVertexbyId("xor_1",g),ep,g); std::cout << "Inserted Edge 2" << std::endl; fflush(stdout); } /*******************************************************/ - Phani.

2 2

[Q] better 'typedef'
by V S P 24 Mar '09

24 Mar '09

I have read somewhere that boost provides a better typedef. Something that allows to use the 'underlying class' but it is not a macro for example I want to define typedef std::wstring cvarchar_t to use for ODBC/Unicode db access (on win32) and then specialize some templates for this type that would behave differently then wstring I cannot remember what that mechanism was called. Also, sorry, for mixing this question in: is UTF-8 a more 'standard' encoding if I want to interface from my C++/boost programs to ODBC and to Boost.Python on Windows and FreeBSD (I have problems figuring out how to support the difference between UTF-16 on windows/wstring and Unix UTF-32 wstring ... while the unicode ODBC drivers are all 2-byte strings) thanks in advance -- V S P toreason(a)fastmail.fm -- http://www.fastmail.fm - Same, same, but different...

1 0

proper erasing from ptr_vector
by Archie14 23 Mar '09

23 Mar '09

I have ptr_vector<A> lst; When I need to erase element from this container - should I just do A* el; iterator it = std::find (lst.begin(), lst.end(), el); lst.erase(it); or A* el; iterator it = std::find (lst.begin(), lst.end(), el); delete lst.erase(el);

6 8

[iterator] unrelated type problem with iterator_facade arrow operator
by Michael Fawcett 23 Mar '09

23 Mar '09

Can someone confirm if the attached code doesn't compile intentionally or if this is a bug? I'm sorry for not posting a minimal example but I couldn't figure out how to reduce the problem. It requires Windows (uses ATL::CAdapt and ATL::CComBSTR) and I've tested using VS 2005 and VS2008. This bug manifests when the Reference type has overloaded the address-of operator to return a type not implicitly convertible to Value * (I believe). Changing lines 324-326 in iterator_facade.hpp from: static type make(Reference x) { return implicit_cast<type>(&x); } to: static type make(Reference x) { return implicit_cast<type>(boost::addressof(x)); } and adding the appropriate include makes the attached code compile. Full error log below: 1>c:\dev\vendor\boost\1.37.0\boost\iterator\iterator_facade.hpp(326) : error C2664: 'boost::implicit_cast' : cannot convert parameter 1 from 'BSTR *' to 'ATL::CComBSTR *' 1> Types pointed to are unrelated; conversion requires reinterpret_cast, C-style cast or function-style cast 1> c:\dev\vendor\boost\1.37.0\boost\iterator\iterator_facade.hpp(325) : while compiling class template member function 'ATL::CComBSTR *boost::detail::operator_arrow_result<ValueType,Reference,Pointer>::make(Reference)' 1> with 1> [ 1> ValueType=ATL::CComBSTR, 1> Reference=ATL::CComBSTR &, 1> Pointer=ATL::CComBSTR * 1> ] 1> c:\dev\vendor\boost\1.37.0\boost\iterator\iterator_facade.hpp(641) : see reference to class template instantiation 'boost::detail::operator_arrow_result<ValueType,Reference,Pointer>' being compiled 1> with 1> [ 1> ValueType=ATL::CComBSTR, 1> Reference=ATL::CComBSTR &, 1> Pointer=ATL::CComBSTR * 1> ] 1> c:\dev\vendor\boost\1.37.0\boost\iterator\iterator_adaptor.hpp(271) : see reference to class template instantiation 'boost::iterator_facade<Derived,Value,CategoryOrTraversal,Reference,Difference>' being compiled 1> with 1> [ 1> Derived=test::atl::CAdapt_iterator<std::_Vector_iterator<ATL::CAdapt<ATL::CComBSTR>,std::allocator<ATL::CAdapt<ATL::CComBSTR>>>>, 1> Value=ATL::CComBSTR, 1> CategoryOrTraversal=std::random_access_iterator_tag, 1> Reference=ATL::CComBSTR &, 1> Difference=__w64 int 1> ] 1> c:\dev\personal\boost\iterator_adaptor_bug\main.cpp(65) : see reference to class template instantiation 'boost::iterator_adaptor<Derived,Base,Value,Traversal,Reference>' being compiled 1> with 1> [ 1> Derived=test::atl::CAdapt_iterator<std::_Vector_iterator<ATL::CAdapt<ATL::CComBSTR>,std::allocator<ATL::CAdapt<ATL::CComBSTR>>>>, 1> Base=std::_Vector_iterator<ATL::CAdapt<ATL::CComBSTR>,std::allocator<ATL::CAdapt<ATL::CComBSTR>>>, 1> Value=ATL::CComBSTR, 1> Traversal=std::random_access_iterator_tag, 1> Reference=ATL::CComBSTR & 1> ] 1> c:\dev\personal\boost\iterator_adaptor_bug\main.cpp(103) : see reference to class template instantiation 'test::atl::CAdapt_iterator<Iterator>' being compiled 1> with 1> [ 1> Iterator=std::_Vector_iterator<ATL::CAdapt<ATL::CComBSTR>,std::allocator<ATL::CAdapt<ATL::CComBSTR>>> 1> ] Thanks for any insight, --Michael Fawcett

1 1

Re: [Boost-users] Dijkstra shortest path
by Florian.PONROY＠fr.thalesgroup.com 23 Mar '09

23 Mar '09

Hi, The following algorithm should do the trick: // predecessors is the predecessor map // destinationNode is the node you want to reach // sourceNode is the source of the graph int currentNode = destinationNode; int predecessorNode = 0; std::cerr << boost::format("--- PATH: %d <- ") % destinationNode; do { predecessorNode = predecessors[currentNode]; if (predecessorNode == currentNode) { // Unreachable nextHop = 0; std::cerr << "XXX" << std::endl; break; } else if (predecessorNode == sourceNode) { // Next hop found nextHop = currentNode; std::cerr << sourceNode << std::endl; break; } else { // One hop on the path currentNode = predecessorNode; std::cerr << boost::format("%d <- ") % currentNode; } } while (true); Hope it helps, Florian -----Message d'origine----- De : boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org]De la part de dwaem Envoyé : lundi 23 mars 2009 16:23 À : boost-users(a)lists.boost.org Objet : Re: [Boost-users] Dijkstra shortest path Steven Watanabe-4 wrote: > > AMDG > > dwaem wrote: >> int weight[] = {1, 1, 2, 2, 3, 4, 3, 4, 5, 6, 7}; >> >> <snip> >> >> it shows >> distances and parents: >> distance(A) = 0, parent(A) = C >> distance(B) = 0, parent(B) = A >> distance(C) = 0, parent(C) = C >> distance(D) = 0, parent(D) = C >> distance(E) = 0, parent(E) = C >> >> >> which makes no sense. >> > > You're not using the weight array anywhere, > so you get the default weight of 0 for every edge. > > In Christ, > Steven Watanabe > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users > > Yes this is my obviouse oversight. But now when I have founded shortest path from node A to node B. How to display full path from A to B, not only parent of the last node. -- View this message in context: http://www.nabble.com/Dijkstra-shortest-path-tp22626827p22662345.html Sent from the Boost - Users mailing list archive at Nabble.com. _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

Dijkstra shortest path
by dwaem 23 Mar '09

23 Mar '09

Hi I made a little change to example from manual which search shortest path http://www.boost.org/doc/libs/1_37_0/libs/graph/example/dijkstra-example.cpp http://www.boost.org/doc/libs/1_37_0/libs/graph/example/dijkstra-example.cpp by adding add_edge function but is seams to give incorect results #include <boost/config.hpp> #include <algorithm> #include <vector> #include <utility> #include <iostream> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/reverse_graph.hpp> #include <boost/graph/graph_utility.hpp> #include <boost/graph/dijkstra_shortest_paths.hpp> #include <boost/graph/graph_traits.hpp> #include <boost/graph/adjacency_list.hpp> using namespace boost; int main() { typedef adjacency_list < vecS, vecS, bidirectionalS, no_property, property < edge_weight_t, int > > graph; typedef graph_traits < graph >::vertex_descriptor vertex_descriptor; typedef graph_traits < graph >::edge_descriptor edge_descriptor; graph G(5); enum nodes { A, B, C, D, E }; add_edge(A, E, G); add_edge(B, E, G); add_edge(C, E, G); add_edge(A, B, G); add_edge(B, D, G); add_edge(B, A, G); add_edge(B, C, G); add_edge(C, A, G); add_edge(C, D, G); add_edge(D, A, G); add_edge(D, B, G); int weight[] = {1, 1, 2, 2, 3, 4, 3, 4, 5, 6, 7}; char name[] = "ABCDE"; std::cout << "\n"; vertex_descriptor s = vertex(C, G); property_map<graph, edge_weight_t>::type weightmap = get(edge_weight, G); std::vector<vertex_descriptor> p(num_vertices(G)); std::vector<int> d(num_vertices(G)); dijkstra_shortest_paths(G, s, predecessor_map(&p[0]).distance_map(&d[0])); std::cout << "distances and parents:" << std::endl; graph_traits < graph >::vertex_iterator vi, vend; for (tie(vi, vend) = vertices(G); vi != vend; ++vi){ std::cout << "distance(" << name[*vi] << ") = " << d[*vi] << ", "; std::cout << "parent(" << name[*vi] << ") = " << name[p[*vi]] << std::endl; } std::cout << std::endl; } it shows distances and parents: distance(A) = 0, parent(A) = C distance(B) = 0, parent(B) = A distance(C) = 0, parent(C) = C distance(D) = 0, parent(D) = C distance(E) = 0, parent(E) = C which makes no sense. Marcin Matuszak -- View this message in context: http://www.nabble.com/Dijkstra-shortest-path-tp22626827p22626827.html Sent from the Boost - Users mailing list archive at Nabble.com.

2 2

[lambda]How can I call function of objects in std::list while using std::for_each?
by 钱晓明 23 Mar '09

23 Mar '09

Please help me! I want to call a virtual function of objects in std::list while using std::for_each: struct DiscardableItem { void Discard() { std::cout<<"Discard item!"<<std::endl; } }; std::list<DiscardableItem*> items; items.push_back(new DiscardableItem); items.push_back(new DiscardableItem); std::for_each( items.rbegin(), items.rend(), _1->*&DiscardableItem::Discard ); But DiscardableItem::Discard does not be called. How can I make it work? thanks! I think lambda can solve this problem easily.

4 5

[utility] addressof issue with classes having templated conversion operators
by Gevorg Voskanyan 23 Mar '09

23 Mar '09

Hi folks, I've came across a problem with addressof() when the argument is of a class type with a template conversion operator. A minimal test case reproducing the issue is attached. Using boost 1.38, the example fails to compile under gcc 4.2.2, with the following error: ../../../../vendor/boost/boost_1_38_0/boost/utility/addressof.hpp: In function 'T* boost::addressof(T&) [with T = convertible]': addressof_conversion.cpp:17: instantiated from here boost/boost_1_38_0/boost/utility/addressof.hpp:42: error: ISO C++ says that these are ambiguous, even though the worst conversion for the first is better than the worst conversion for the second: ../../../../vendor/boost/boost_1_38_0/boost/utility/addressof.hpp:26: note: candidate 1: static T* boost::detail::addressof_impl<T>::f(T&, long int) [with T = convertible] ../../../../vendor/boost/boost_1_38_0/boost/utility/addressof.hpp:32: note: candidate 2: static T* boost::detail::addressof_impl<T>::f(T*, int) [with T = convertible] AFAICT gcc is right complaining here, according to 13.3.3 The same example compiles OK with boost 1.33.1, and the changeset that causes the difference seems to be this one: https://svn.boost.org/trac/boost/changeset/44705 Can this be considered a regression? How should this issue be addressed? Thanks, Gevorg

2 4

Suggestion about using Signals2
by Daniele Barzotti 23 Mar '09

23 Mar '09

Hi, I need some help on using signals2 in my app, I hope to explain my problem well. I have a thread that reads from the RS232: void SerialPort::reading() { ... read... if (data_available) signal_OnData; } the signal_OnData is: typedef boost::signals2::signal<void ()> _signal_void; _signal_void signal_OnData; And I connect it to a method MyUserClass::OnDataReceived() Into this method (MyUserClass::OnDataReceived) I need to re-send some data to RS232, but the SerialPort::reading thread is locked because it's waiting the OnDataReceived ends.. In fact, when the methods OnDataReceived ends, I receive data again. How can I solve this problem? Thanks in advance! Daniele.

2 11

Re: [Boost-users] [Graph] Computing reachable vertices on a graph
by Florian.PONROY＠fr.thalesgroup.com 23 Mar '09

23 Mar '09

Hi Andrew, Thank you very much for your reply. I eventually implemented Steven Watanabe's solution, which seems easier to me. Since I only need to know which nodes are actually reachable, I may get rid of distances for now. Thanks again, Florian -----Message d'origine----- De : boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org]De la part de Andrew Sutton Envoyé : vendredi 20 mars 2009 18:35 À : boost-users(a)lists.boost.org Objet : Re: [Boost-users] [Graph] Computing reachable vertices on a graph However, I encounter the following issue : in this example, vertices are numbered from 0 to 5. However, in my project, this is not the case, vertices could be numbered 5, 38, 42, 384... Using a vector in that case might not work as expected, a map<vertex, distance> would probably be better. I'm not quite familiar with BGL so far, maybe should I deal with a specific property map? Or using a visitor to record a vertex distance upon graph discovery? I'm a little bit lost, any help will be greatly appreciated! You probably shouldn't rely on vertex indices as the canonical id of the vertex. The method of identifying vertices (and edges) in an adjacency list varies with the vertex set and edge set type selectors (indices or identifeirs for vecS aren't the same as listS). There are a couple of different approaches. The easiest would be to simply maintain a mapping of id to vertex descriptor. For example: map<int, graph_traits<Graph>::vertex_descriptor> verts; verts[5] = add_vertex(g); verts[58] = add_vertex(g); // and so on. You can couple that bundled vertex properties to get a kind of bimap. struct vertex_props { int id; } typedef adj_list<vecS, vecS, directedS, vertex_props> Graph; template <typename Graph, typename Map> void add_vertex(Graph& g, Map& verts, int id) { vertex_descriptor v = add_vertex(g); verts[id] = v; g[v].id = id; } add_vertex(g, verts, 5); add_vertex(g, verts, 58); ... cout << g[*vertices(g).begin]->id << "\n"; Hope that helps, Andrew Sutton andrew.n.sutton(a)gmail.com <mailto:andrew.n.sutton@gmail.com>

1 0

Re: [Boost-users] [Graph] Computing reachable vertices on a graph
by Florian.PONROY＠fr.thalesgroup.com 23 Mar '09

23 Mar '09

Hi Steven, I just tried your solution, which works perfectly well. The vector is actually sized to the number of reachable nodes. I just added a reachable.reserve(max_number_of_nodes) to avoid multiple reallocations. Thank you very much for your help, Florian -----Message d'origine----- De : boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org]De la part de Steven Watanabe Envoyé : vendredi 20 mars 2009 18:36 À : boost-users(a)lists.boost.org Objet : Re: [Boost-users] [Graph] Computing reachable vertices on a graph AMDG Florian.PONROY(a)fr.thalesgroup.com wrote: > I need to get the list of all reachable vertices from a given vertex in a graph. I'm currently using the BFS algorithm to achieve that, which seems to fit well to my need. > How does this work: #include <boost/graph/adjacency_list.hpp> #include <boost/graph/breadth_first_search.hpp> #include <boost/graph/visitors.hpp> #include <vector> #include <iterator> typedef boost::adjacency_list< boost::vecS, boost::vecS, boost::directedS > Graph; int main() { Graph G(1); boost::add_edge(0, 1, G); boost::add_edge(1, 2, G); boost::add_edge(2, 5, G); boost::add_edge(3, 2, G); boost::add_edge(4, 3, G); boost::add_edge(5, 3, G); typedef Graph::vertex_descriptor Vertex; std::vector<Vertex> reachable; // The source vertex Vertex s = *(boost::vertices(G).first); boost::breadth_first_search(G, s, boost::visitor( boost::make_bfs_visitor( boost::write_property( boost::identity_property_map(), std::back_inserter(reachable), boost::on_discover_vertex())))); } In Christ, Steven Watanabe _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

trouble with correct type definition of multi_index::nth_index
by Sandeep Gupta 23 Mar '09

23 Mar '09

Hi, In the following code I am trying to get an handle to the index of a multi_index container. The compiler says "invalid initialization of reference of type ‘boost::multi_index::detail:..". Not sure why this is so. Since I wasn't sure about the source of error I have pasted the full code ( sans declarations) is give below. Thanks sandeep ///-------------------------Full code --------------------- template<typename Col1_t, typename Col2_t, typename Col3_t, typename Col4_t> class TupleStore { typedef tuple<Col1_t, Col2_t, Col3_t, Col4_t> tuple_t; typedef multi_index_container < tuple_t, indexed_by < ordered_unique<tuple_member_extractor<tuple_t,0> > > > tuplestore_t; tuplestore_t m_tuplestore; public: template<int n> void lookup_key(Col1_t key) const { typedef typename tuplestore_t:: template nth_index<n>::type tuplestore_index_t; ///compiler error here tuplestore_index_t& indexx = m_tuplestore.get<n>(); } }; int main() { TupleStore<int,int,int,int> tstr; tstr.lookup_key<0>(5); }

2 1

phoenix for_each and std::cout
by Sandeep Gupta 23 Mar '09

23 Mar '09

Hi, I am trying to use phoenix::for_each to print each element of iterator range. Would appreciate if any clarification as to why statements 1 and 2 are giving compile errors. Thanks sandeep //-------------code snippet int x; counting_iterator<int> first(0), last(10); iterator_range<counting_iterator<int> > ir(first, last); phoenix::for_each(ir, std::cout<<x<<' ')(); //stmt 1 ; compile error phoenix::for_each(ir, std::cout<<arg1<<' ')(); //stmt 2; compile error

2 1

Struggling to compile encfs, linking with boost library
by Jean Jordaan 22 Mar '09

22 Mar '09

Hi there I want to use encfs on a box with a Debian distro that doesn't have recent encfs and boost packages available, so I'm compiling them from source. I installed boost like this:: $ ./configure --prefix=/home/zope/local It seems to complete fine. This incantation finds the libraries, but dies shortly thereafter:: zope@iwlearn:/home/zope/src/encfs-1.5$ CPPFLAGS=-I/home/zope/local/include/boost-1_38 ./configure --with-boost-libdir=/home/zope/local/lib --prefix=/home/zope/local [...] checking for boostlib >= 1.34... yes checking whether the Boost::System library is available... yes checking for exit in -lboost_system-gcc41-mt-1_38... yes configure: WARNING: BOOST_CPPFLAGS -I/usr/include checking whether the Boost::Serialization library is available... yes checking for exit in -lboost_serialization-gcc41-mt-1_38... yes checking whether the Boost::Filesystem library is available... yes checking for exit in -lboost_filesystem-gcc41-mt-1_38... no checking for exit in -lboost_filesystem-gcc41-mt-1_38... (cached) no checking for exit in -lboost_filesystem-gcc41-mt-1_38... (cached) no checking for exit in -lboost_filesystem-gcc41-mt... no checking for exit in -lboost_filesystem-gcc41-mt... (cached) no configure: error: Could not link against boost_filesystem-gcc41-mt ! I wonder why "checking for exit" works in -lboost_serialization-gcc41-mt-1_38 and not in -lboost_filesystem-gcc41-mt-1_38 .. What does that mean, "checking for exit"? (Googling ..) -- jean . .. .... //\\\oo///\\

2 4

Boost and C++ "physical design"
by Yang Zhang 22 Mar '09

22 Mar '09

I have a couple questions about Boost and its implications for the "physical design" of C++ projects. I'm guessing there probably aren't that many non-member, non-template functions in the Boost library, but of the ones that exist, are these usually labeled `static`, since boost is mostly a header library? Is there any advice on taming (1) the generated code size and/or (2) the build times* which result from using a header-mostly library like Boost? A large C++ project consists of many translation units (.o files) which are generated from source files that include many of the same Boost headers over and over again. (2) can be ameliorated with a distributed build process, but the more general issue here is that of consumption of compute resources, be it time or machines. -- Yang Zhang http://www.mit.edu/~y_z/

7 7

[numeric::converter] finding the smallest c such that (a/c) + (b/c) < inf
by er 22 Mar '09

22 Mar '09

Hi All, template<typename T> struct promote{}; template<> struct promote<float> : mpl::identity<double>{}; template<> struct promote<double> : mpl::identity<long double>{}; template<typename T> //T: float, double struct fit_a_plus_b_to_range{ static T divider(T a, T b){ static const T mx = math::tools::max_value<T>(); static const T mi = math::tools::min_value<T>(); if(a > (mx - b)){ typedef typename promote<T>::type prom_t; typedef numeric::converter<T,prom_t> up_t; typedef numeric::converter<prom_t,T> down_t; prom_t au = up_t::convert(a); prom_t bu = up_t::convert(b); prom_t mu = up_t::convert(mx); prom_t cu = ((au/mu)+(bu/mu)); T delta = ...; T c = down_t::convert(cu) + delta; BOOST_ASSERT(!math::isinf((a/c)+(b/c))); return c; }else{ return (T)(1); } } }; With delta = 0.0 the assertion fails, with delta = 1.0 it works (for a few examples). What's the smallest delta value? Is there a better way to do this overall? If this is off topic, let me know...

2 3

Serialization of a std::vector< boost::shared_ptr< A > > throws unregistered_class exception
by Benoit Gagnon 21 Mar '09

21 Mar '09

Given the following classes: class Building { ... }; class House : public Building { ... }; class Hospital : public Building { ... }; With appropriate serialization method templates such as: class House: public Building { friend class boost::serialization::access; template<class Archive> void serialize(Archive& ar, const unsigned int version ) { ar & BOOST_SERIALIZATION_BASE_OBJECT_NVP( Building ); ar & BOOST_SERIALIZATION_NVP( mNumBedrooms ); ar & BOOST_SERIALIZATION_NVP( mNumBathrooms ); } ... I have the following registrations in main.cpp where the archiving/ restoring is performed: BOOST_SERIALIZATION_SHARED_PTR( Building ) BOOST_SERIALIZATION_SHARED_PTR( House ) BOOST_SERIALIZATION_SHARED_PTR( Hospital ) In main.ccp, I would like to serialize a std::vector< boost::shared_ptr< Building > > object. Like this: std::vector< boost::shared_ptr< Building > > buildings; ... std::ofstream ofs( "archive.txt" ); boost::archive::text_oarchive oa( ofs ); oa & BOOST_SERIALIZATION_NVP( buildings ); This compiles correctly but fails at runtime with a "unregistered_class" exception. The individual classes (Building, House, Hospital) can be serialized and restored fine individually. That is true for objects, pointers and shared_ptr. A vector of plain pointers to any of those types also works fine. But a vector of shared_ptr to any of those types fails at runtime.. What kind of registration must be done to achieve this?

3 7