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

[asio] resolver::cancel() problem
by Matthew Edwards 14 Mar '14

14 Mar '14

In my application (and a separate test program) it seems as though the cancel() function on the resolver does not work as intended. For async resolves, the cancel functionality should abort them immediately and pass an 'operation aborted' error code to the callback handler. In my tests, I will resolve an invalid domain (this causes the resolve to take a few seconds, to demonstrate the problem), sleep for 100ms, then call cancel on the resolver object. No cancelling actually occurs, and the callback is simply triggered after a few seconds with a "No host found" error code, not the expected operation aborted. Has anyone experienced this before, or know how I might be using the resolver incorrectly?

3 2

[multi_array] operator= requires resize - why?
by Markus Werle 04 Jun '12

04 Jun '12

Hi! IMHO the behaviour of operator= for multi_array is a little bit broken. A lot of preconditions required: template <typename ConstMultiArray> multi_array_ref& operator=(const ConstMultiArray& other) { [...] // make sure the dimensions agree assert(other.num_dimensions() == this->num_dimensions()); assert(std::equal(other.shape(),other.shape()+this->num_dimensions(), this->shape())); Besides the fact that I get mad about asserts instead of exceptions (please change this to a way users may choose) why do we have such an odd behaviour here? >From page 1, line 3 of the docs I cite: "The interface design is in line with the precedent set by the C++ Standard Library containers" - this is not true for operator=, since std::<container>::operator= works fine for me all the time _without_ any resize. Could we please change the behaviour of multi_array::operator= to take care of resize where in need to? IMHO operator= should result in a true copy ignoring previous state. Markus

6 18

Design for boost::serialization of STL iterators.
by Carlo Wood 23 May '09

23 May '09

On Sat, Mar 11, 2006 at 11:45:36PM +0200, Peter Dimov wrote: > Carlo Wood wrote: > > > 1) WHY does boost::serialization not support serialization > > of iterators? > > It's very hard, if not impossible, in general. It is either impossible or possible. When it is possible, it can't be hard :p I think that at the moment of serialization, the actual container needs to be known. So, only concentrating on the syntax of the code that serializes an iterator, the following cannot work: ar & iter; However, the container will be known at that point (or at least, we might as well assume that). Therefore, I could imagine a syntax like: ar & foobar(container, iter); where 'foobar' is some template function (that will be part of boost::serialization in the future). Lets start with the last one (have to start somewhere). In order to deserialize the iterator (and taken into account that we already have the container) -- which makes me think that it might be better to pass a functor to operator& above. In other words, (at least for writing), use: template<class Container> struct Foobar { Foobar(Container const&, typename Container::const_iterator& iter) : M_container(container), M_iter(iter); private: Container const& M_container; Container::const_iterator& M_iter; }; and then assign to M_iter, whatever we find in M_container. > If you have access to the container to which the iterator i refers: > > a) if the container is a map, you can serialize i->first, then on > deserialization look up the key in the map using .find(); > > b) if the container is a sequence, and it has the same contents on > deserialization as it does on serialization, you can serialize the index of > the element - distance( c.begin(), i ). I don't think that it is a requirement that the whole container has to be read: either it's a map or set, in which case later insertions will not invalidate the container, or it is a vector, in which case we use an index, from which we can construct the end iterators before the whole container is reconstructed. Therefore, the following syntax can work imho: ar & FooBar(container, iter); Would you agree? There are a zillion questions and implementation details open - but I'd like to get anyones feedback about this type of interface for iterators before continuing. Current questions: What is a good name for Foobar? Am I right when I think that Foobar needs to be declared in boost::serialization? Now the hard part (for me) is that part that involves the internals of the boost library. At the moment one tries to serialize an iterator, it is possible (though not necessarily) that the object that the iterator points to is already serialized. In the case that we are dealing with an associative container (map or set etc), we don't want to store the contents of the object (or key part, in the case of a map) again: I'd like to just store that once, and store a reference in the archive at the other place. How can I make the library store an object only the first time and the store a reference the second time? This would be for an object of arbitrary type thus. I think that it is only feasible to do this when it's actually the same object (same memory address), which is the case; but while storing the object element of the container, the address of it isn't stored as well, is it? Is there a way to make: std::set<SomeData> s; [...] ar << s; Store the address of s (&s) along with the contents of s? And would that then automatically cause the library to not store that same object again when I do: std::set<SomeData>::iterator iter = s.find(...); [...] ar << *iter; Because then, &*iter would again be the same memory address as what was stored before. -- Carlo Wood <carlo(a)alinoe.com>

3 2

[BGL] citing the Boost Graph Library
by Alejandro Marcos Aragón 06 May '09

06 May '09

Can anyone point me how to cite the Boost Graph Library in a paper? Is there any information in the boost website? Thank you all, Alejandro Aragón

4 3

Boost Graph Library and Boehm Garbage Collector
by FBSL 08 Sep '08

08 Sep '08

Hello I am having trouble to garbage-collect adjacency_list<>. I have instanciated it with correctly garbage-collected vectors and lists (I have copied vecS and listS definitions, and added Boehm GC's default allocator so that they are garbage-collected). In my application I need to dynamically allocate many graphs, but it does not work, there is a (big) memory leak. Unfortunately, there is no template argument in adjacency_list<> to specify Boehm GC's allocator. Does anyone have a hint ? Snippet code "main.cpp" follows, compiled with Boost Graph Library 1.32, Boehm GC 6.4 and G++ 3.3.5, with command line : $ g++ -o main main.cpp -lgc -lgccpp -- #include <boost/graph/adjacency_list.hpp> #include <gc/gc_allocator.h> #include <gc/gc_cpp.h> #include <iostream> #include <vector> #include <list> using namespace std; using namespace boost; namespace boost { struct collected_vecS {}; struct collected_listS {}; template <class ValueType> struct container_gen<collected_vecS, ValueType> { typedef vector<ValueType,gc_allocator<ValueType> > type; }; template <class ValueType> struct container_gen<collected_listS, ValueType> { typedef list<ValueType,gc_allocator<ValueType> > type; }; template <> struct parallel_edge_traits<collected_vecS> { typedef allow_parallel_edge_tag type; }; template <> struct parallel_edge_traits<collected_listS> { typedef allow_parallel_edge_tag type; }; namespace detail { template <> struct is_random_access<collected_vecS> { enum { value = true }; typedef true_type type; }; } } typedef adjacency_list<collected_vecS, collected_vecS, directedS, no_property, no_property, no_property, collected_listS> graph; int main() { // leaks... while(true){ graph * g=new (UseGC) graph; for(unsigned int i=0; i<100; ++i){ add_vertex(*g); } for(unsigned int i=0; i<100; ++i){ for(unsigned int j=0; j<100; ++j){ add_edge(i,j,*g); } } } }

3 4

[statechart] history transitions make state-local-storage "un-cool"
by Mick Hollins 26 Jun '08

26 Jun '08

Apologies if this has been discussed before, but I couldn't find any mention of it: I am currently using the history facility of boost::fsm. I've discovered that when I re-enter a state, X, via a history transition I don't actually re-enter the same instance of X that I was in before, but instead enter a newly constructed instance of X. I just checked the UML spec regarding history transitions and it says that "Any necessary entry actions are performed", so given that boost::fsm uses constructors to represent entry actions I guess a new instance of X has to be constructed to ensure UML compliance. My actual concern is the effect this has on the "coolness" of state-local-storage (see http://boost-sandbox.sourceforge.net/libs/statechart/doc/faq.html#Whats_so_…) It seems to me that state-local-storage, which I agree is generally cool, is particularly un-cool (and bug-inducing) in the presence of history transitions. I'm not sure what a good alternative is, but just thought I'd raise the discussion. cheers, mick PS: does the history facility display the same semantics in boost::statechart? I plan to move to statechart real soon now ...

4 19

[foreach][range] How would BOOST_REVERSE_FOREACH be implemented?
by Pete Bartlett 05 Mar '08

05 Mar '08

Boost.Foreach is such a great piece of kit that once you start using it you just can't stop. Indeed I like working directly with values rather than iterators so much that is feels normal for me to write something like BOOST_FOREACH( value_type x , make_iterator_range( rbegin( seq ) , rend( seq ) ) whenever I wish to reverse iterate over a sequence. My co-workers are not big fans of typing though, so they want a REVERSE_FOREACH. At first naïve glance it looks easy to implement in terms of the original FOREACH: template<typename C> inline iterator_range</* something */> make_reverse_iterator_range(C& c) { return make_iterator_range( rbegin(c) , rend(c) ); } #define REVERSE_FOREACH( x , container ) BOOST_FOREACH( x , make_reverse_iterator_range( container ) ) This works fine when container is an lvalue. But then co-workers, used to the wonders of the original FOREACH, inevitably start to use the new macro with rvalues and get a crash due to dangling references (- the iterator_range's members point to departed quantities.....) and if you could somehow work around that, there is the issue hidden inside the "/* something */" that you have to cope with fact that MSVC has no proper const rvalue detection. Finally the #define MACRO(x,y) ANOTHER_MACRO( f(x) , g(y) ) style is not recommended because they are brittle in the face of x and/or y themselves being macros. ... but all these issues are exactly the ones that BOOST_FOREACH itself solves! Thus surely it is technically possible to write a REVERSE_FOREACH that works with rvalues as well as lvalues, e.g. by essentially copying and pasting the FOREACH implementation and replacing "begin" and "end" by "rbegin" and "rend" in the vital places. However one feels there may be a better way... has anyone had a go at creating a "fully-functional" REVERSE_FOREACH and could offer me any advice? If indeed the task is fairly intricate and requires re-use of foreach internals, would the library author consider including something in the library itself? Many thanks for reading, Pete Bartlett

4 6

[serialization, ASIO] Assertion when serializing recursive boost::variant type
by Falco Hirschenberger 05 Sep '07

05 Sep '07

Hi, I have defined a recursive variant type like this: --- typedef boost::make_recursive_variant<bool, int, double, std::string, std::vector< boost::recursive_variant_ >, std::map<std::string, boost::recursive_variant_>, TGrey8Image, TRgbImage, TRgbaImage>::type TVType; --- and two containers which can store this type: --- typedef std::vector<TVType> TVector; typedef std::map<std::string, TVType> TMap; --- I wrote a set of unit-tests testing all types of plain and recursive containers and they work as expected. I also tested (de-)serialization to a binary archive and there's also no problem. Then I implemented a Message class which contains such a TVType + some other stuff. Serializing and deserializing also works in the tests. Finally I implemented a client and server with ASIO like the ASIO "serialization" example. First sending the size of the archive and then the data itself. The sending works but when I want to deserialize my message I get the following assertion: --- testSerialization: /usr/include/boost/variant/detail/visitation_impl.hpp:203: typename Visitor::result_type boost::detail::variant::visitation_impl(int, int, Visitor&, VPCV, mpl_::true_, NBF, W*, S*) [with W = mpl_::int_<20>, S = boost::detail::variant::visitation_impl_step<boost::mpl::l_iter<boost::mpl::l_end>, boost::mpl::l_iter<boost::mpl::l_end> >, Visitor = boost::detail::variant::invoke_visitor<boost::detail::variant::direct_assigner<const int> >, VPCV = void*, NBF = boost::variant<boost::detail::variant::recursive_flag<bool>, int, double, std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::vector<boost::recursive_variant_, std::allocator<boost::recursive_variant_> >, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::recursive_variant_, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::recursive_variant_> > >, CIS::Image2d<unsigned char>, CIS::Image2d<CIS::RGB>, CIS::Image2d<CIS::RGBA>, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_, boost::detail::variant::void_>::has_fallback_type_]: Assertion `false' failed. --- I absolutely don't know what't wrong here the backtrace iss huge but the point in my code where it happens is the line when deserializing the message. When I comment out the TVType payload of the message, it works. I would really appreciate any clue. Greetings, Falco

2 1

[Boost.Test] User Exception handling
by Ewgenij Sokolovski 28 Aug '07

28 Aug '07

Hello. On the webpage I read: In case if your test cases may throw custom exceptions (see here for list of exceptions translated by default), you could register translator specific for that exception. http://www.boost.org/libs/test/doc/components/utf/index.html So, if I understand it right, if I throw some custom exception in my test program and do not catch it, then it is catched by the boost test framework and reported in the proper way - if the exception can be translated by default. Now I look at the exceptions, which can be translated by default and see: In majority of the cases the monitored function doesn't need to throw the boost::execution_exception to report an error in the Execution Monitor. If you want a custom error message to be included into the execution_exception's error message, use one of the following C++ types as an exception: * C string. * std:string. * any exception class in std::exception hierarchy. http://www.boost.org/libs/test/doc/components/execution_monitor/index.html#… So, I can use a C string for my exception. I have written a small example test case and included throwing of an uncaught exception in it: try{ throw "blub"; } catch(char* ex){ throw; } As I started the testing process I didn't get a "blub"-Exception message, but Boost.Test internal framework error: unknown reason So, what's wrong? Why is "blub" not reported as "blub"? Can anybody explain that? Regards Ewgenij

6 8

Re: [Boost-users] cross compiling boost for ARM
by Hughes, James 12 Aug '07

12 Aug '07

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of remi > Sent: 05 January 2007 14:44 > To: boost-users(a)lists.boost.org > Subject: [Boost-users] cross compiling boost for ARM > > > hi! > > I want to cross compile boost for an ARM processor. > For a pxa 270. but when i try to cross compile boost with > arm-linux-g++ , it dosen't work ... a proble with jam... > > everyone can help me? > > Thank you > > BEST REGARDS > > Rémi bjam "-sGCC_ROOT_DIRECTORY=/opt/montavista/mobilinux/devkit/arm/iwmmxt_le" "-sGCC=iwmmxt_le-gcc" "-sGXX=iwmmxt_le-g++" <location for libs> Obviously you would need to change the location namd names of the compile tools to whatever you are using. James This message (including any attachments) contains confidential and/or proprietary information intended only for the addressee. Any unauthorized disclosure, copying, distribution or reliance on the contents of this information is strictly prohibited and may constitute a violation of law. If you are not the intended recipient, please notify the sender immediately by responding to this e-mail, and delete the message from your system. If you have any questions about this e-mail please notify the sender immediately.

3 3

[Serialization] Problem serialization of derived classes
by Andreas Willich 09 Aug '07

09 Aug '07

Hi there! I have a problem with the code in the attachment. I followed the documentation and the examples, but I did not get the code to work. Gcc produces a lot of failures that something is already instantiated in header files of the serialization library. Has someone a idea what I am doing wrong? My gcc version is 4.1.1-r3 and I am working on a gentoo x86 box. Andreas Willich

4 5

[lambda][1.33.1] Lambda warnings after installing VS2005 SP1
by john.wismar＠autozone.com 01 Aug '07

01 Aug '07

I have just installed Service Pack 1 for VS2005, and am now getting a warning in some code using lambda::bind. There wasn't a warning previously, but I don't know if the issue is due to an update to the C++ standard library, a legitimate warning that they weren't flagging before, or a spurious warning. It looks like the issue is that I'm passing a function pointer, to bind. Is this a warning I should just ignore, or is this a legitimate issue? Thanks for your help! Here's a sample app, followed by the warnings I'm seeing. #include <boost/lambda/bind.hpp> using boost::lambda::bind; using boost::lambda::_1; #include <vector> #include <map> #include <algorithm> int main() { enum choice { select, reject }; std::vector<long> questions; std::map<long, choice> answers; std::transform(questions.begin(), questions.end(), std::inserter(answers, answers.begin()), bind(std::make_pair<long, choice>, _1, select)); return 0; } c:\boost\boost\lambda\detail\lambda_traits.hpp(389) : warning C4180: qualifier applied to function type has no meaning; ignored c:\boost\boost\lambda\detail\lambda_traits.hpp(458) : see reference to class template instantiation 'boost::lambda::detail::bind_traits<T>' being compiled with [ T=std::pair<long,main::choice> (long,main::choice) ] c:\temp\lambda_warning_test\lambda_warning_test.cpp(20) : see reference to class template instantiation 'boost::lambda::detail::bind_tuple_mapper<T0,T1,T2,T3,T4,T5,T6,T7,T8,T9>' being compiled with [ T0=std::pair<long,main::choice> (long,main::choice), T1=boost::lambda::placeholder1_type, T2=const main::choice, T3=boost::tuples::null_type, T4=boost::tuples::null_type, T5=boost::tuples::null_type, T6=boost::tuples::null_type, T7=boost::tuples::null_type, T8=boost::tuples::null_type, T9=boost::tuples::null_type ] -------------------------------- John Wismar john.wismar(a)autozone.com

2 1

astar using namespace
by bringiton bringiton 26 Jul '07

26 Jul '07

I've removed the using namespace boost from the astar graph cities example. (I prefer to define namespaces explicitly). //using namespace boost; I've added boost:: to all the type names and it all compiles fine. However, some functions compile without the namespace. ie the following line: WeightMap weightmap = get(boost::edge_weight, g); Can someone please explain why I dont need a boost:: infront of the get?

4 3

[serialisation]Portable Binary Archives
by Hughes, James 25 Jul '07

25 Jul '07

Hello all, Probably answered before, but I wondered whether there is a standard implementation for portable binary archives available. I have found a reference here (http://programmicon.com/2007/03/07/the-un-fun-stuff/) I noticed some recent posts on the subject, but haven't found out much info googling. Cheers James This message (including any attachments) contains confidential and/or proprietary information intended only for the addressee. Any unauthorized disclosure, copying, distribution or reliance on the contents of this information is strictly prohibited and may constitute a violation of law. If you are not the intended recipient, please notify the sender immediately by responding to this e-mail, and delete the message from your system. If you have any questions about this e-mail please notify the sender immediately.

7 21

[Serialization] is_serializable trait?
by Sohail Somani 20 Jul '07

20 Jul '07

Hi, I know there is the tracking level trait. Is that sufficient to be able to say that T is serializable? struct T { T(some_stuff); private: some_non_default_constructing_members; }; In this case, I think tracking level will be set to track selectively but its not serializable as is. Thanks, Sohail

3 2

[mpl]problems with mpl::set
by Brian Simpson 19 Jul '07

19 Jul '07

I'm having problems compiling non-explicitly-declared mpl::set types. Here's an example: <block1> typedef set<char> set1_t; BOOST_MPL_ASSERT_RELATION(size<set1_t>::value, ==, 1); //test iterating through the mpl.set: typedef begin<set1_t>::type set1_itr0_t; BOOST_MPL_ASSERT((is_same<deref<set1_itr0_t>::type, char>::type)); typedef next<set1_itr0_t>::type set1_itr1_t; BOOST_MPL_ASSERT((is_same<set1_itr1_t, end<set1_t>::type>::type)); </block1> In block1, I declare a set with one type, char, and then iterate over it. This code compiles, as expected. <block2> typedef set<> empty_set; BOOST_MPL_ASSERT_RELATION(size<empty_set>::value, ==, 0); typedef insert<empty_set, char>::type set2_t; BOOST_MPL_ASSERT_RELATION(size<set2_t>::value, ==, 1); //test iterating through the mpl.set: typedef begin<set2_t>::type set2_itr0_t; BOOST_MPL_ASSERT((is_same<deref<set2_itr0_t>::type, char>::type)); typedef next<set2_itr0_t>::type set2_itr1_t;//compile error at this line BOOST_MPL_ASSERT((is_same<set2_itr1_t, end<set2_t>::type>::type)); </block2> In block2, I declare a set with no types, then insert a char type, then iterate over the resulting sequence. At the line where I get the second iterator, I get a compile error: <error_text> boost\mpl\set\aux_\iterator.hpp(52) : error C3083: 'next_': the symbol to the left of a '::' must be a type boost\mpl\eval_if.hpp(41) : see reference to class template instantiation 'boost::mpl::next<T>' being compiled with [ T=boost::mpl::s_iter<set2_t,boost::mpl::set<boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na>> ] boost\mpl\set\aux_\iterator.hpp(56) : see reference to class template instantiation 'boost::mpl::eval_if<C,F1,F2>' being compiled with [ C=boost::mpl::has_key<set2_t,boost::mpl::set<boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na>::type>, F1=boost::mpl::identity<boost::mpl::s_iter<set2_t,boost::mpl::set<boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na>>>, F2=boost::mpl::next<boost::mpl::s_iter<set2_t,boost::mpl::set<boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na>>> ] source.cpp(120) : see reference to class template instantiation 'boost::mpl::next<T>' being compiled with [ T=set2_itr0_t ] </error_text> MSVS 8.0 is the compiler(_MSC_VER == 1400). Am I missing an obvious error in my code? Thanks! _________________________________________________________________ Need a break? Find your escape route with Live Search Maps. http://maps.live.com/default.aspx?ss=Restaurants~Hotels~Amusement%20Park&cp…

2 4

[program_options] add_options method hangs on Linux
by Farberov, Inga 19 Jul '07

19 Jul '07

Hi, I have a piece of code that runs both on Windows and Linux. I am using program_options library to read a settings file. This seems to work fine on windows, but on Linux the same code hangs when I call add_options method. I am using Boost 1.34 on both machines. Any suggestions on what may be causing this problem are greatly appreciated. Inga

2 5

problem porting code using spirit parser to v1.34.0
by Pearson, Andrew 18 Jul '07

18 Jul '07

Hi, I'm having trouble porting some code to use v1.34.0 of boost. We are using the spirit parser and have found that strings containing trailing white space are not parsed as before. The following code is a simple example of the problem. This code works with boost 1.33.1 but not 1.34.0. Can anyone help explain why the code no longer works and what we should do to fix the problem? Regards, Andy #include <string> #include <iostream> #include <boost/spirit/core.hpp> using namespace std; using namespace boost::spirit; bool parseStr(const string& str) { return parse(str.c_str(), real_p >> *(',' >> real_p), space_p).full; } int main(int argc, _TCHAR* argv[]) { string s1 = "1,2,3,4,5"; string s2 = "1,2,3,4,5 "; cout << "parsing: '" << s1 << "' : " << (parseStr(s1) ? "OK" : "ERROR") << endl; cout << "parsing: '" << s2 << "' : " << (parseStr(s2) ? "OK" : "ERROR") << endl; return 0; }

2 1

Problem with unit test BOOST_AUTO_TEST_MAIN
by Sakharuk, Vlad (GMI Development) 05 Jul '07

05 Jul '07

Hi all, here is my code: #define BOOST_AUTO_TEST_MAIN #include <boost/test/auto_unit_test.hpp> BOOST_AUTO_TEST_CASE( test1 ) { BOOST_CHECK(true); } I link it dynamically with boost ver 1.3.3.1 with gcc-3.4.4 on Linux 2.6. (Note I did not compile this library myself.) However there is a lot of other libraries linked to the module but never used. Bellow is output I am getting. I suspect that other libraries have embedded boost tests. BUT 1) There is no test1 in my output. 2) How I can remove all unnecessary test and stick only to those in my files only? Here is command I have used test1 --output_format=XML --log_level=success Thanks Vlad. ** Demo doc read from disk: ** ** Printing via doc.Print ** <?xml version="1.0" standalone="no" ?>  <ToDo>  <Item priority="1" distance="close">Go to the <bold>Toy store!</bold> </Item> <Item priority="2" distance="none">Do bills</Item> <Item priority="2" distance="far & back">Look for Evil Dinosaurs!</Item> </ToDo> ** Printing via TiXmlPrinter ** <?xml version="1.0" standalone="no" ?>  <ToDo>  <Item priority="1" distance="close"> Go to the <bold>Toy store!</bold> </Item> <Item priority="2" distance="none">Do bills</Item> <Item priority="2" distance="far & back">Look for Evil Dinosaurs!</Item> </ToDo> ** Printing via operator<< ** <?xml version="1.0" standalone="no" ?><ToDo><Item priority="1" distance="close">Go to the<bold>Toy store!</bold></Item><Item priority="2" distance="none">Do bills</Item><Item priority="2" distance="far & back">Look for Evil Dinosaurs!</Item></ToDo> ** Demo doc processed: ** <?xml version="1.0" standalone="no" ?>  <ToDo>  <Item priority="2" distance="close">Go to the <bold>Toy store!</bold> </Item> <Item priority="1" distance="far">Talk to: <Meeting where="School"> <Attendee name="Marple" position="teacher" /> <Attendee name="Voel" position="counselor" /> </Meeting> <Meeting where="Lunch" /> </Item> <Item priority="2" distance="here">Do bills</Item> </ToDo> ** Demo doc processed to stream: ** <?xml version="1.0" standalone="no" ?><ToDo><Item priority="2" distance="close">Go to the<bold>Toy store!</bold></Item><Item priority="1" distance="far">Talk to:<Meeting where="School"><Attendee name="Marple" position="teacher" /><Attendee name="Voel" position="counselor" /></Meeting><Meeting where="Lunch" /></Item><Item priority="2" distance="here">Do bills</Item></ToDo> ** Basic structure. ** [pass] Output stream correct. [pass] Root element exists. [1][1] [pass] Root element value is 'ToDo'. [ToDo][ToDo] [pass] First child exists & is a comment. [1][1] [pass] Sibling element exists & is an element. [1][1] [pass] Value is 'Item'. [Item][Item] [pass] First child exists. [1][1] [pass] Value is 'Go to the'. [Go to the][Go to the] ** Iterators. ** [pass] Top level nodes, using First / Next. [3][3] [pass] Top level nodes, using Last / Previous. [3][3] [pass] Top level nodes, using IterateChildren. [3][3] [pass] Children of the 'ToDo' element, using First / Next. [3][3] [pass] 'Item' children of the 'ToDo' element, using First/Next. [3][3] [pass] 'Item' children of the 'ToDo' element, using Last/Previous. [3][3] ** Parsing. ** [pass] Element parsed, value is 'Element0'. [Element0][Element0] [pass] Reads attribute 'attribute0="foo0"'. [foo0][foo0] [pass] Reads incorrectly formatted 'attribute1=noquotes'. [noquotes][noquotes] [pass] Read attribute with entity value '>'. [>][>] [pass] Error row [3][3] [pass] Error column [17][17] ** Streaming. ** [pass] Stream round trip correct. [pass] String printing correct. [pass] Query attribute: int as double [0][0] [pass] Query attribute: int as double [1][1] [pass] Query attribute: double as double [2][2] [pass] Query attribute: double as int [0][0] [pass] Query attribute: double as int [2][2] [pass] Query attribute: not a number [2][2] [pass] Query attribute: does not exist [1][1] [pass] Location tracking: Tab 8: room row [1][1] [pass] Location tracking: Tab 8: room col [49][49] [pass] Location tracking: Tab 8: doors row [1][1] [pass] Location tracking: Tab 8: doors col [55][55] [pass] Location tracking: Declaration row [1][1] [pass] Location tracking: Declaration col [5][5] [pass] Location tracking: room row [1][1] [pass] Location tracking: room col [45][45] [pass] Location t etc ... -------------------------------------------------------- This message w/attachments (message) may be privileged, confidential or proprietary, and if you are not an intended recipient, please notify the sender, do not use or share it and delete it. Unless specifically indicated, this message is not an offer to sell or a solicitation of any investment products or other financial product or service, an official confirmation of any transaction, or an official statement of Merrill Lynch. Subject to applicable law, Merrill Lynch may monitor, review and retain e-communications (EC) traveling through its networks/systems. The laws of the country of each sender/recipient may impact the handling of EC, and EC may be archived, supervised and produced in countries other than the country in which you are located. This message cannot be guaranteed to be secure or error-free. This message is subject to terms available at the following link: http://www.ml.com/e-communications_terms/. By messaging with Merrill Lynch you consent to the foregoing. --------------------------------------------------------

2 1

get all the elements with a certain value with multi_index
by boost＠larroy.com 04 Jul '07

04 Jul '07

Hello I'm trying to use multi_index with an ordered_non_unique index. My question is how can I perform a search like with "find(key)" and get all the elements that match that key. Since find only returns one element that match, and there can be several in the container. I've tried to iterate "count(key)" times with the iterator returned by find but doesn't seem to work. Is there a way to do this? Regards -- Pedro Larroy Tovar, pedro at larroy dot com | http://pedro.larroy.com/ * Las patentes de programación son nocivas para la innovación * http://proinnova.hispalinux.es/

4 5

Iteratiing on regex results with pointer-to-member-function
by Alain Leblanc 04 Jul '07

04 Jul '07

Hi, I wrote some code where I want to iterate on the result of a regex matching and call a member function for each match. It goes roughly like this: ====================================================================== class XX { typedef bool (XX::*FuncPtr)(const boost::match_results<std::string::const_iterator>& what); FuncPtr funcPtr; }; bool XX::regex_callback(const boost::match_results<std::string::const_iterator>& what) { return true; } void XX::addDelayedVariables(string expr) { funcPtr = &XX::regex_callback; regex re("([[:alpha::]][[:alnum]]+)(\[[^\\]]+])"); sregex_iterator m1(expr.begin(), expr.end(), re); sregex_iterator m2; match_results<string::const_iterator> results; (*) bool a = (this->*funcPtr)(results); (*) for_each(m1, m2, (this->*funcPtr)); (#) } =========================================================================== When compiling (gcc 4.1 on FC 6) I get an error message at (#) that says: invalid use of non-static member function I added the two lines with a (*) as a sanity check to see that I declared the pointer-to-member-function correctly, and I have no problem compiling those. So my question is: is this a problem with me not understanding how to handle pointer-to-member-functions in C++, or is there something with the boost libraries that I'm missing or is preventing me from performing this operation? I would appreciate any help or opinion. thanks, Alain

2 2

[signal] How to disconnect?
by Boris 04 Jul '07

04 Jul '07

void Hello() { } boost::signal<void ()> sig; sig.connect(&Hello); // OK sig.disconnect(&Hello); // Error Can anyone tell me how I disconnect the callback function Hello? I can see in the documentation that I can call disconnect with a group_type and with a slot_type but not with a slot_function_type. I'm surprised to run into such a problem as from the point of view of a library user it can't get much easier than that? Boris PS: This is with Boost 1.33.1.

4 13

problems building Boost.Python with cygwin
by Knox, Matt 02 Jul '07

02 Jul '07

Hello all, I am trying to install the Boost.Python library (and then compile C++ python extensions after that) using cygwin and am not having much luck. I know I have the main part of boost working because I was able to compile and run the basic example for testing the boost configuration. Then to install Boost.Python I did the following: $ ./configure -with-libraries=python This generates the following output: Building Boost.Jam with toolset gcc... tools/jam/src/bin.cygwinx86/bjam Detecting Python version... 2.5 Detecting Python root... c:\Python25 Unicode/ICU support for Boost.Regex?... not found. Backing up existing Boost.Build configuration in user-config.jam.2 Generating Boost.Build configuration in user-config.jam... Generating Makefile... I then type "make install", which generates the following output: ./tools/jam/src/bin.cygwinx86/bjam --user-config=user-config.jam --prefix=/usr/local --exec-prefix= /usr/local --libdir=/usr/local/lib --includedir=/usr/local/include --with-python install WARNING: No python installation configured and autoconfiguration failed. See http://www.boost.org/libs/python/doc/building.html for configuration instructions or pass --without-python to suppress this message and silently skip all Boost.Python targets warning: Python location is not configured warning: the Boost.Python library won't be built warning: Unable to construct ./install-unversioned warning: Unable to construct ./install-unversioned warning: Unable to construct ./install-unversioned warning: Unable to construct ./install-unversioned warning: Unable to construct ./install-unversioned warning: Unable to construct ./install-unversioned warning: Unable to construct ./install-unversioned warning: Unable to construct ./install-unversioned ...found 7812 targets... Those warnings look rather problematic. And indeed, when I try to compile the basic example (/boost_1_34_0/libs/python/example/tutorial) by typing "bjam target-os=cygwin toolset=gcc", I get the following errors: Jamroot:17: in modules.load rule python-extension unknown in module Jamfile</cygdrive/p/c_libs/boost_1_34_0/libs/python/example/ tutorial>. /cygdrive/p/c_libs/boost_1_34_0/tools/build/v2/build/project.jam:312: in load-jamfile /cygdrive/p/c_libs/boost_1_34_0/tools/build/v2/build/project.jam:68: in load /cygdrive/p/c_libs/boost_1_34_0/tools/build/v2/build/project.jam:170: in project.find /cygdrive/p/c_libs/boost_1_34_0/tools/build/v2/build-system.jam:237: in load /cygdrive/p/c_libs/boost_1_34_0/libs/python/example/../../../tools/build /v2/kernel/modules.jam:261: in import /cygdrive/p/c_libs/boost_1_34_0/libs/python/example/../../../tools/build /v2/kernel/bootstrap.jam:132 : in boost-build /cygdrive/p/c_libs/boost_1_34_0/libs/python/example/boost-build.jam:7: in module scope Any ideas? Am I missing something obvious? Any help would be greatly appreciated. Thanks, - Matt ******************** NOTICE OF CONFIDENTIALITY This communication including any information transmitted with it is intended only for the use of the addressees and is confidential. If you are not an intended recipient or responsible for delivering the message to an intended recipient, any review, disclosure, conversion to hard copy, dissemination, reproduction or other use of any part of this communication is strictly prohibited, as is the taking or omitting of any action in reliance upon this communication. If you receive this communication in error or without authorization please notify us immediately by return e-mail or otherwise and permanently delete the entire communication from any computer, disk drive, or other storage medium. If the above disclaimer is not properly readable, it can be found at www.td.com/legal AVERTISSEMENT DE CONFIDENTIALITE Ce courriel, ainsi que tout renseignement ci-inclus, destiné uniquement aux destinataires susmentionnés, est confidentiel. Si vous nêtes pas le destinataire prévu ou un agent responsable de la livraison de ce courriel, tout examen, divulgation, copie, impression, reproduction, distribution, ou autre utilisation dune partie de ce courriel est strictement interdit de même que toute intervention ou abstraction à cet égard. Si vous avez reçu ce message par erreur ou sans autorisation, veuillez en aviser immédiatement lexpéditeur par retour de courriel ou par un autre moyen et supprimer immédiatement cette communication entière de tout système électronique. Si l'avis de non-responsabilité ci-dessus n'est pas lisible, vous pouvez le consulter à www.td.com/francais/legale

3 2

[iterator_adaptor] typedef problem
by Mark Ruzon 01 Jul '07

01 Jul '07

In the private part of my own iterator adaptor called skip_iterator, I would like to write the following: private: typedef typename skip_iterator::iterator_adaptor_::difference_type difference_type; void advance(difference_type n); difference_type distance_to(const skip_iterator& x) const; because it looks nice. What I get from gcc 3.4.6 is strange: skip_iterator.hpp:22: error: `typedef ptrdiff_t skip_iterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >::difference_type' is private /usr/include/c++/boost_1_33_1/boost/iterator/iterator_facade.hpp:868: error: within this context However, if I forgo the typedef and write uglier code: private: void advance(typename skip_iterator::iterator_adaptor_::difference_type n); typename skip_iterator::iterator_adaptor_::difference_type distance_to(const skip_iterator& x) const; then it compiles and works fine. What is the issue with my typedef? Thanks, Mark

2 1

[Boost.Graph] Profiling using the graph library
by Ewgenij Sokolovski 30 Jun '07

30 Jun '07

Hello, I use the boost graph library (Version 1.33.1 of Boost) for my programming task. I wanted to profile my program with gprof. I compilated the source code with the -pg option and linked it also with that option. Now I'm examining the output file of gprof. Some functions of boost graph library are not explicitly listed there althogh I use them. These functions are: vertices() add_edge() What I see instead are some complicated functions. I have copied them here from my gprof-Output. But where are vertices() and add_edge()? Or are they meant by these complicated functions. Best regards Ewgenij Sokolovski 1) std::pair<std::vector<boost::detail::sei_<unsigned long, std::_List_iterator<boost::list_edge<unsigned long, boost::property<boost::edge_bundle_t, float, boost::no_property> > >, boost::property<boost::edge_bundle_t, float, boost::no_property> >, std::allocator<boost::detail::sei_<unsigned long, std::_List_iterator<boost::list_edge<unsigned long, boost::property<boost::edge_bundle_t, float, boost::no_property> > >, boost::property<boost::edge_bundle_t, float, boost::no_property> > > >::iterator, bool> boost::graph_detail::push<std::vector<boost::detail::sei_<unsigned long, std::_List_iterator<boost::list_edge<unsigned long, boost::property<boost::edge_bundle_t, float, boost::no_property> > >, boost::property<boost::edge_bundle_t, float, boost::no_property> >, std::allocator<boost::detail::sei_<unsigned long, std::_List_iterator<boost::list_edge<unsigned long, boost::property<boost::edge_bundle_t, float, boost::no_property> > >, boost::property<boost::edge_bundle_t, float, boost::no_property> > > >, boost::detail::sei_<unsigned long, std::_List_iterator<boost::list_edge<unsigned long, boost::property<boost::edge_bundle_t, float, boost::no_property> > >, boost::property<boost::edge_bundle_t, float, boost::no_property> > >(std::vector<boost::detail::sei_<unsigned long, std::_List_iterator<boost::list_edge<unsigned long, boost::property<boost::edge_bundle_t, float, boost::no_property> > >, boost::property<boost::edge_bundle_t, float, boost::no_property> >, std::allocator<boost::detail::sei_<unsigned long, std::_List_iterator<boost::list_edge<unsigned long, boost::property<boost::edge_bundle_t, float, boost::no_property> > >, boost::property<boost::edge_bundle_t, float, boost::no_property> > > >&, boost::detail::sei_<unsigned long, std::_List_iterator<boost::list_edge<unsigned long, boost::property<boost::edge_bundle_t, float, boost::no_property> > >, boost::property<boost::edge_bundle_t, float, boost::no_property> > const&) 2) boost::detail::postfix_increment_result<boost::counting_iterator<unsigned long, boost::use_default, boost::use_default>, unsigned long, unsigned long const&, boost::random_access_traversal_tag>::type boost::operator++<boost::counting_iterator<unsigned long, boost::use_default, boost::use_default>, unsigned long, boost::random_access_traversal_tag, unsigned long const&, long>(boost::iterator_facade<boost::counting_iterator<unsigned long, boost::use_default, boost::use_default>, unsigned long, boost::random_access_traversal_tag, unsigned long const&, long>&, int) -- Der GMX SmartSurfer hilft bis zu 70% Ihrer Onlinekosten zu sparen! Ideal für Modem und ISDN: http://www.gmx.net/de/go/smartsurfer

3 7

Re: [Boost-users] [Boost.MathToolKit] Compilation problem w/ VC++7.1
by Marc Viala 30 Jun '07

30 Jun '07

Hello John, Yes, I've tried to compile w/ the right header version of math-toolkit. Just to be sure and to confirm the problem: Right now I'm using Boost 1.33.1. Do you confirm that math-toolkit can operate only w/ Boost 1.34? If yes, sorry for the noise. By the way, do you plan to adapt your headers for Boost 1.33.1? Marc Viala > -----Message d'origine----- > De : boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] De la part de John Maddock > Envoyé : samedi 30 juin 2007 10:34 > À : boost-users(a)lists.boost.org > Objet : Re: [Boost-users] [Boost.MathToolKit] Compilation problem w/ VC++7.1 > > Marc Viala wrote: > > Done but I've got the same compilation errors. > > Hmmm, works for me. BTW you will need Boost-1.34 to compile any of the > math-toolkit code. Other than that, are you sure you updated your #include > path to point to the sandbox version? Just double checking the obvious ;-) > > John. > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

[Boost.Graph] Visitors - dummy functions
by Ewgenij Sokolovski 30 Jun '07

30 Jun '07

Hello! I want to implement a visitor for the dijkstra_shortest_paths (...) algorithm. The visitor interface requires several methods which should be provided in each visitor object. But I need only one of these functions. So I considered to implement the others as empty functions like: void function(...) { } The problem now is, that as I apparently don't use the parameters, given to the function, inside of its body, the compiler prints out warnings about unused parameters. Is there a possibility to avoid this annoying thing? Except of disabling the warnings of the compiler in general. Regards Ewgenij -- Psssst! Schon vom neuen GMX MultiMessenger gehört? Der kanns mit allen: http://www.gmx.net/de/go/multimessenger

2 1

Re: [Boost-users] [Boost.MathToolKit] Compilation problem w/ VC++7.1
by Marc Viala 30 Jun '07

30 Jun '07

Done but I've got the same compilation errors. Sorry... Marc Viala > -----Message d'origine----- > De : boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] De la part de John Maddock > Envoyé : vendredi 29 juin 2007 20:13 > À : boost-users(a)lists.boost.org > Objet : Re: [Boost-users] [Boost.MathToolKit] Compilation problem w/ VC++7.1 > > Marc Viala wrote: > > Hello, > > > > I've just tried to compile the following small code snippet: > > > > #include <boost/math/distributions/gamma.hpp> > > void main() { } > > > Does anyone know how to manage Math.ToolKit headers file w/ Boost > > 1.33.1 and VC++ 7.1.6030 > > I think that's one I fixed recently: can you try the current sandbox source? > > Regards, John. > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

boost_regex with/without BOOST_REGEX_MATCH_EXTRA on same machine?
by Markus Grabner 30 Jun '07

30 Jun '07

Hi! For an application I'm writing, I need the match_results::captures feature, which requires to recompile boost with BOOST_REGEX_MATCH_EXTRA. I did so and globally installed the modified boost-1.33.1 on my machine. However, several utilities installed on my machine that came with my Linux distribution (openSUSE-10.2) don't work with the modified library (including the yast2 package manager, which made it somewhat challenging to re-install the original version). So I have two questions: *) What is the recommended installation if applications requiring BOOST_REGEX_MATCH_EXTRA must be installed on the same machine together with applications that don't require this extension? *) Are there any chances that future versions of the boost_regex library will remove this compile-time distinction? Are the few extra bytes for the (unused) m_captures member in sub_match really such a big problem? Thanks & kind regards, Markus -- Markus Grabner - Computer Graphics and Vision Graz University of Technology, Inffeldgasse 16a/II, 8010 Graz, Austria Phone: +43/316/873-5041, Fax: +43/316/873-5050 WWW: http://www.icg.tugraz.at/Members/grabner

2 1

[Test] Testing generated code.
by Michael Marcin 30 Jun '07

30 Jun '07

I have written type safe wrappers around some math operations that I need to use everywhere and I expect and rely on them being equivalent to the handcoded or macro based approach for performance reasons. I tend to check the resulting assembly by hand every so often and it surprises me from time to time to see that inefficiencies have crept in. If I write a routine in C and a routine using the type safe wrappers that I expect to have equivalent generated assembly is there a way to test that this is indeed the case? Can anyone else think of a better way to make sure that register usage is optimal, proper inlining is occurring, etc? Thanks, Michael Marcin

4 6

multiple definition error when linking with filesystem
by frederic.bron＠alcan.com 30 Jun '07

30 Jun '07

I have 2 .cpp files which both includes : #include <boost/filesystem.hpp> #include <boost/regex.hpp> When I link the 2 .o with -lboost_filesystem -lboost_regex, I get the following error message: obj_o/BBron/TraceFileExtraction.o:TraceFileExtraction.cc:(.text+0x3d0): d'efinitions multiples de << boost::filesystem::basename(boost::filesystem::basic_path<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::filesystem::path_traits> const&)>> obj_o/BBron/AverageEvenCurve.o:AverageEvenCurve.cc:(.text+0x0): d'efini pour la premi`ere fois ici obj_o/BBron/TraceFileExtraction.o:TraceFileExtraction.cc:(.text+0x4d0): d'efinitions multiples de << boost::filesystem::extension(boost::filesystem::basic_path<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::filesystem::path_traits> const&)>> obj_o/BBron/AverageEvenCurve.o:AverageEvenCurve.cc:(.text+0x170): d'efini pour la premi`ere fois ici collect2: ld a retourn'e 1 code d''etat d'ex'ecution What's the problem? F. Bron ___________________________________ Frédéric Bron (frederic.bron(a)alcan.com) Unité ALT, Alcan CRV, BP 27, 38341 Voreppe téléphone : +33 4 76 57 81 72 télécopie : +33 4 76 57 80 99 Avis : Ce message et toute pièce jointe sont la propriété d'Alcan et sont destinés seulement aux personnes ou à l'entité à qui le message est adressé. Si vous avez reçu ce message par erreur, veuillez le détruire et en aviser l'expéditeur par courriel. Si vous n'êtes pas le destinataire du message, vous n'êtes pas autorisé à utiliser, à copier ou à divulguer le contenu du message ou ses pièces jointes en tout ou en partie. Notice: This message and any attachments are the property of Alcan and are intended solely for the named recipients or entity to whom this message is addressed. If you have received this message in error please inform the sender via e-mail and destroy the message. If you are not the intended recipient you are not allowed to use, copy or disclose the contents or attachments in whole or in part.

1 2

2 x Boost.Log
by Andrej van der Zee 30 Jun '07

30 Jun '07

Hi, I am looking for a Logging library in C++ and found two Boost libraries: * one by Andrey Semashev (with an empty sourceforge project created recently). * one by John Torjo (outdated downloadable from his website). Is any of those two already reviewed/accepted by Boost? Thanks, Andrej ___________________________________________________________ Yahoo! Answers - Got a question? Someone out there knows the answer. Try it now. http://uk.answers.yahoo.com/

1 0

troubles linking with boost_regex
by frederic.bron＠alcan.com 29 Jun '07

29 Jun '07

I am using boost 1.34.0 I have built the boost libraries from cygwin but for no-cygwin environment (pure win32, independant from cygwin): - I have built bjam with: ./build.bat gcc-nocygwin - I have used bjam like this: path/to/bjam link=static threading=single runtime-link=shared --toolset=gcc-nocygwin --prefix="D:\Softs\boost_msw" --layout=system release install - I then use g++ with -mno-cygwin flag to compile and link Here is the trouble I get when I link a program that uses regex with the regex library: /cygdrive/d/Softs/boost_msw/lib/libboost_regex.a(static_mutex.o):static_mutex.cpp:(.text+0x1a): r'ef'erence ind'efinie vers << _pthread_mutex_lock >> /cygdrive/d/Softs/boost_msw/lib/libboost_regex.a(static_mutex.o):static_mutex.cpp:(.text+0x54): r'ef'erence ind'efinie vers << _pthread_mutex_lock >> /cygdrive/d/Softs/boost_msw/lib/libboost_regex.a(static_mutex.o):static_mutex.cpp:(.text+0x84): r'ef'erence ind'efinie vers << _pthread_mutex_lock >> /cygdrive/d/Softs/boost_msw/lib/libboost_regex.a(static_mutex.o):static_mutex.cpp:(.text+0xaa): r'ef'erence ind'efinie vers << _pthread_mutex_unlock >> /cygdrive/d/Softs/boost_msw/lib/libboost_regex.a(static_mutex.o):static_mutex.cpp:(.text+0xda): r'ef'erence ind'efinie vers << _pthread_mutex_unlock >> /cygdrive/d/Softs/boost_msw/lib/libboost_regex.a(static_mutex.o):static_mutex.cpp:(.text+0x10a): r'ef'erence ind'efinie vers << _pthread_mutex_unlock >> This does not happen when I link a program that uses only filesystem with the filesystem library. Also when I use boost libraries built for cygwin environnement (configure;make install), I have no problem linking with regex. I have tried with threading=multi but obtained the same results. Maybe I should build the no-cygwin libraries totally outside cygwin, i.e. with a standalone compiler? Any tricks? Regards F. Bron Avis : Ce message et toute pièce jointe sont la propriété d'Alcan et sont destinés seulement aux personnes ou à l'entité à qui le message est adressé. Si vous avez reçu ce message par erreur, veuillez le détruire et en aviser l'expéditeur par courriel. Si vous n'êtes pas le destinataire du message, vous n'êtes pas autorisé à utiliser, à copier ou à divulguer le contenu du message ou ses pièces jointes en tout ou en partie. Notice: This message and any attachments are the property of Alcan and are intended solely for the named recipients or entity to whom this message is addressed. If you have received this message in error please inform the sender via e-mail and destroy the message. If you are not the intended recipient you are not allowed to use, copy or disclose the contents or attachments in whole or in part.

2 2

[Boost.MathToolKit] Compilation problem w/ VC++7.1
by Marc Viala 29 Jun '07

29 Jun '07

Hello, I've just tried to compile the following small code snippet: #include <boost/math/distributions/gamma.hpp> void main() { } But the compilation failed w/ the following errors: :\boost\math\special_functions\log1p.hpp(195) : error C2785: 'tools::promote_args<T>::type boost::math::log1p(T)' et 'double boost::math::log1p(double)' ont des types de retour différents \boost\math\special_functions\math_fwd.hpp(246) : voir la déclaration de 'boost::math::log1p' \boost\math\special_functions\log1p.hpp(182) : voir la déclaration de 'boost::math::log1p' \boost\math\special_functions\log1p.hpp(195) : error C2912: spécialisation explicite ; 'double boost::math::log1p<double>(double)' n'est pas une spécialisation d'un modèle de fonction C:\Dev\MViala\ADV\Library\boost-1_33_1\boost\math\special_functions\log1p.hpp(183) : fatal error C1903: impossible de récupérer à partir des erreurs précédentes ; arrêt de la compilation Compilation Conditions: - Windows XP Pro - Boost 1.33.1 w/ Math. Toolkit Headers files (extracted from Vault Directory) - Visual C++ 7.1 SP1 : Version 7.1.6030 Does anyone know how to manage Math.ToolKit headers file w/ Boost 1.33.1 and VC++ 7.1.6030 Best regards, Marc Viala

2 1

Re: [Boost-users] praise for multi_index
by "JOAQUIN LOPEZ MU?Z" 29 Jun '07

29 Jun '07

Hello Pedro, <boost <at> larroy.com> writes: > > Hi > > I just wanted to praise boost::multi_index I think it's a great > container. I'm starting to wonder now how I lived without it > previously (with many individual maps and much complexity I guess) :) Thank you very much for your compliments! They're so rewarding, especially after a nightmarish work day :) Do not hesitate to contribute your proposals for improvement of the library. Best, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

[Test] Random seed
by Sohail Somani 29 Jun '07

29 Jun '07

Is there a way to get Boost.Test to spit out the seed it uses for randomizing the test case order? log_level=test_suite is too noisy. I basically want seed + normal output. Thanks, Sohail

2 2

[serialization] extended_type_info.cpp: assert(lookup(eti) == m_self->m_map.end());
by Markus Bernhardt 29 Jun '07

29 Jun '07

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi everyone, I'm using serialization for quite a while now. Everything worked for me. Now I added some classes to serialization and one off my classes causes an assertion. This happens with 1.32.0 and 1.34.0. I'm quite sure my code is broken, but I can't find it. Therefore I was debugging and it looks weird. 1. OS: Solaris 10 CC: Sun C++ 5.8 Patch 121018-10 2007/02/21 (latest patch level) Reproducable under Sparc and x86 2. The programm crashes on startup: (dbx) where current thread: t@1 [1] __lwp_kill(0x1, 0x6, 0xfffffe8200db3500, 0x3, 0xfffffd7fffdff2a0, 0xfffffd7fff3c73a0), at 0xfffffd7ffd7fe81a [2] _thr_kill(0x0, 0x0, 0x0, 0x0, 0x0, 0x0), at 0xfffffd7ffd7f9803 [3] raise(0x0, 0x0, 0x0, 0x0, 0x0, 0x0), at 0xfffffd7ffd7a7849 [4] abort(0x0, 0x0, 0x0, 0x0, 0x0, 0x0), at 0xfffffd7ffd78a7e0 [5] __assert(0x0, 0x0, 0x0, 0x0, 0x0, 0x0), at 0xfffffd7ffd78aa6e =>[6] boost::serialization::detail::tkmap::insert(eti = 0xfffffd7fff357540), line 78 in "extended_type_info.cpp" [7] boost::serialization::extended_type_info::self_register(this = 0xfffffd7fff357540), line 231 in "extended_type_info.cpp" [8] boost::serialization::detail::extended_type_info_typeid_1<const de::scmb::bm::core::SyncedRedoableWriteCommand<de::scmb::bm::core::Instance> >::extended_type_info_typeid_1(this = 0xfffffd7fff357540), line 77 in "extended_type_info_typeid.hpp" [9] boost::serialization::detail::extended_type_info_typeid_1<const de::scmb::bm::core::SyncedRedoableWriteCommand<de::scmb::bm::core::Instance> >::get_instance(), line 96 in "extended_type_info_typeid.hpp" [10] boost::archive::detail::pointer_oserializer<de::scmb::bm::core::SyncedRedoableWriteCommand<de::scmb::bm::core::Instance>,boost::archive::binary_oarchive>::pointer_oserializer(this = 0xfffffd7fff3576b8), line 234 in "oserializer.hpp" [11] __SLIP.INIT_E(0x0, 0x0, 0x0, 0x0, 0x0, 0x0), at 0xfffffd7fff2db3bf [12] __STATIC_CONSTRUCTOR(), line 197 in "oserializer.hpp" [13] __cplus_fini_at_exit(0x0, 0x0, 0x0, 0x0, 0x0, 0x0), at 0xfffffd7fff320fd2 [14] call_init(0x0, 0x0, 0x0, 0x0, 0x0, 0x0), at 0xfffffd7fff3d278a [15] setup(0x0, 0x0, 0x0, 0x0, 0x0, 0x0), at 0xfffffd7fff3d1491 [16] _setup(0x0, 0x0, 0x0, 0x0, 0x0, 0x0), at 0xfffffd7fff3ded6f [17] _rt_boot(0x0, 0x0, 0x0, 0x0, 0x0, 0x0), at 0xfffffd7fff3c717f 3. The assertion is: assert(lookup(eti) == m_self->m_map.end()); (dbx) print -r lookup(eti) lookup(eti) = { _Rb_tree_iterator<const boost::serialization::extended_type_info*,std::_Const_traits<const boost::serialization::extended_type_info*> >::_Rb_tree_base_iterator::_M_node = (nil) } (dbx) print -r m_self->m_map.end() m_self->m_map.end() = { _Rb_tree_iterator<const boost::serialization::extended_type_info*,std::_Const_traits<const boost::serialization::extended_type_info*> >::_Rb_tree_base_iterator::_M_node = (nil) } Why the assertion is triggered ??? Both sides are "(nil)". 4. To get a better understanding I added a trace to extended_type_info.cpp: insert(const extended_type_info * eti){ if(NULL == m_self){ static tkmap instance; m_self = & instance; } // markus std::cout << eti->m_type_info_key << ": " << &(eti->m_type_info_key) << std::endl; // make sure that attempt at registration is done only once assert(lookup(eti) == m_self->m_map.end()); m_self->m_map.insert(eti); } The result confuses me even more: (dbx) run Running: bm_instd (process id 22999) extended_type_info_typeid: 0xfffffd7ffe5467b8 extended_type_info_typeid: 0xfffffd7ffe546808 extended_type_info_typeid: 0xfffffd7ffe546858 extended_type_info_typeid: 0xfffffd7ffe5468a8 extended_type_info_typeid: 0xfffffd7ffe5468f8 extended_type_info_typeid: 0xfffffd7ffe546948 extended_type_info_typeid: 0xfffffd7ffe546998 extended_type_info_typeid: 0xfffffd7ffe5469e8 extended_type_info_typeid: 0xfffffd7ffe546a38 extended_type_info_typeid: 0xfffffd7ffe546a88 extended_type_info_typeid: 0xfffffd7ffe546ad8 extended_type_info_typeid: 0xfffffd7ffe546b28 extended_type_info_typeid: 0xfffffd7ffe546b78 extended_type_info_typeid: 0xfffffd7ffe546bc8 extended_type_info_typeid: 0xfffffd7ffe546c18 extended_type_info_typeid: 0xfffffd7ffe546c68 extended_type_info_typeid: 0xfffffd7ffe546cb8 extended_type_info_typeid: 0xfffffd7ffe54b2d8 extended_type_info_typeid: 0xfffffd7ffe54b750 extended_type_info_typeid: 0xfffffd7ffe54bc58 extended_type_info_typeid: 0xfffffd7ffe54b700 extended_type_info_typeid: 0xfffffd7ffe54b970 extended_type_info_typeid: 0xfffffd7ffe54bac0 extended_type_info_typeid: 0xfffffd7ffe54c270 extended_type_info_typeid: 0xfffffd7ffe54bba8 extended_type_info_typeid: 0xfffffd7ffe54d4e8 extended_type_info_typeid: 0xfffffd7ffe54d180 extended_type_info_typeid: 0xfffffd7ffe54e5a8 extended_type_info_typeid: 0xfffffd7ffe54e5f8 extended_type_info_typeid: 0xfffffd7ffe54e648 extended_type_info_typeid: 0xfffffd7ffe550778 extended_type_info_typeid: 0xfffffd7ffe551870 extended_type_info_typeid: 0xfffffd7ffe5521d0 extended_type_info_typeid: 0xfffffd7ffe5529a8 extended_type_info_typeid: 0xfffffd7ffe553180 extended_type_info_typeid: 0xfffffd7ffe553958 extended_type_info_typeid: 0xfffffd7ffe554130 extended_type_info_typeid: 0xfffffd7ffe554908 extended_type_info_typeid: 0xfffffd7ffe5550e0 extended_type_info_typeid: 0xfffffd7ffe5558b8 extended_type_info_typeid: 0xfffffd7ffe556090 extended_type_info_typeid: 0xfffffd7ffe556868 extended_type_info_typeid: 0xfffffd7ffe5581f0 extended_type_info_typeid: 0xfffffd7ffe558670 extended_type_info_typeid: 0xfffffd7ffe558238 extended_type_info_typeid: 0xfffffd7ffe558a48 extended_type_info_typeid: 0xfffffd7ffe558ac0 extended_type_info_typeid: 0xfffffd7ffe559108 extended_type_info_typeid: 0xfffffd7fff357598 extended_type_info_typeid: 0xfffffd7fff357548 Assertion failed: lookup(eti) == m_self->m_map.end(), file libs/serialization/src/extended_type_info.cpp, line 78 t@1 (l@1) signal ABRT (Abbrechen) in __lwp_kill at 0xfffffd7ffd7fe81a 0xfffffd7ffd7fe81a: __lwp_kill+0x000a: jae __lwp_kill+0x18 [ 0xfffffd7ffd7fe828, .+0xe ] Current function is boost::serialization::detail::tkmap::insert 78 assert(lookup(eti) == m_self->m_map.end()); If I understand that right, it looks like extended_type_info_typeid: 0xfffffd7fff357548 is already in the map. How can that be? I think I'm completely missing the point at the moment. Can anyone suggest me where to look for the problem? Any comments are greatly appreciated. - markus - -- Software Consulting Markus Bernhardt GmbH Spieljochstr. 34 81825 München Fon: +49-89-420903-14 Fax: +49-89-420903-20 www: http://www.scmb.de Geschäftsführung Markus Bernhardt Handelsregister AG München HRB 125966 USt-Id DE201885231 -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.2.2 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org iD8DBQFGhOtUdnooMonJSYkRAnhWAJ0cQPXyO7IZ2g6X5HNG55CzqFppBACfZDU6 3XpX5bmP0yqrFTrAyntWBIs= =0SAJ -----END PGP SIGNATURE-----

1 1

ASIO: Detecting broken connections
by Andrej van der Zee 29 Jun '07

29 Jun '07

Hi, I was wondering how I can find out with ASIO whether a connection is broken. I have a client connected to the server that continuously streams data. I have to know at the client-side when the server has hung up. I tried to use an async_write and after 5 erroneous tries the running thread for the connection is terminated. Like this: void connection::run_thread() { while (!stopped()) { event_ptr e = fetch_event(); if (!stopped()) { int write_tries = 0; boost::asio::async_write(_socket, boost::asio::buffer(*e, e->length()), boost::bind(&connection::handle_write, this, boost::asio::placeholders::error, e, write_tries)); } } } void connection::handle_write(const boost::system::error_code &err, const event_ptr event, int write_tries) { if (write_tries == max_write_tries) stopped(true); // thread will break out of its main-loop after being notified if (stopped()) return; // no meaning to continue if (err) { // incremenent write_tries and retry async_write boost::asio::async_write(_socket, boost::asio::buffer(*event, event->length()), boost::bind(&connection::handle_write, this, boost::asio::placeholders::error, event, ++write_tries)); } } I think I am misunderstanding something. I thought that after a async_write the registered handler will be invoked. But the handler is NEVER invoked somehow, although data is send from the client to the server. I have the following questions: - Why is the handler never invoked? When is it supposed to be invoked? - What is the best way to find out a connection has been reset by the server? And client? Thanks alot, Andrej ___________________________________________________________ Yahoo! Mail is the world's favourite email. Don't settle for less, sign up for your free account today http://uk.rd.yahoo.com/evt=44106/*http://uk.docs.yahoo.com/mail/winter07.ht…

3 5

Boost.Serialization compile errors using the XLC compiler.
by Joe 29 Jun '07

29 Jun '07

I am using XLC under Linux/PPC with boost 1.33.1 compiled with XLC 8.0. I get the following errors when I attempt to compile the demo_xml.cpp example to compile. xlc++ -o demo_xml-xlc demo_xml.cpp -qstaticlink -I/home/jdavidso/boost/boost_xlc/include/boost-1_33_1 -L/home/jdavidso/boost/boost_xlc/lib -lboost_serialization-xlc-mt -lpthread "/home/jdavidso/boost/boost_xlc/include/boost-1_33_1/boost/archive/detail/oserializer.hpp", line 333.13: 1540-1109 (S) The use of undefined class "boost::STATIC_ASSERTION_FAILURE<0>" is not valid. "/home/jdavidso/boost/boost_xlc/include/boost-1_33_1/boost/archive/detail/oserializer.hpp", line 331.50: 1540-0700 (I) The previous message was produced while processing "boost::archive::detail::save_pointer_type<boost::archive::xml_oarchive,bus_stop *>::abstract<bus_stop>::register_type(boost::archive::xml_oarchive &)". "/home/jdavidso/boost/boost_xlc/include/boost-1_33_1/boost/archive/detail/oserializer.hpp", line 360.16: 1540-0700 (I) The previous message was produced while processing "boost::archive::detail::save_pointer_type<boost::archive::xml_oarchive,bus_stop *>::register_type<bus_stop>(boost::archive::xml_oarchive &, bus_stop &)". "/home/jdavidso/boost/boost_xlc/include/boost-1_33_1/boost/archive/detail/oserializer.hpp", line 460.55: 1540-0700 (I) The previous message was produced while processing "boost::archive::detail::save_pointer_type<boost::archive::xml_oarchive,bus_stop *>::invoke(boost::archive::xml_oarchive &, bus_stop * const)". "/home/jdavidso/boost/boost_xlc/include/boost-1_33_1/boost/archive/detail/oserializer.hpp", line 536.5: 1540-0700 (I) The previous message was produced while processing "boost::archive::save<boost::archive::xml_oarchive,bus_stop *>(xml_oarchive &, bus_stop * const &)". "/home/jdavidso/boost/boost_xlc/include/boost-1_33_1/boost/archive/basic_xml_oarchive.hpp", line 91.10: 1540-0700 (I) The previous message was produced while processing "boost::archive::basic_xml_oarchive<boost::archive::xml_oarchive>::save_override<bus_stop * const>(const nvp<bus_stop * const> &, int)". "/home/jdavidso/boost/boost_xlc/include/boost-1_33_1/boost/archive/detail/interface_oarchive.hpp", line 77.15: 1540-0700 (I) The previous message was produced while processing "boost::archive::detail::interface_oarchive<boost::archive::xml_oarchive>::operator<< <const boost::serialization::nvp<bus_stop * const> >(const nvp<bus_stop * const> &)". "/home/jdavidso/boost/boost_xlc/include/boost-1_33_1/boost/serialization/collections_save_imp.hpp", line 43.12: 1540-0700 (I) The previous message was produced while processing "boost::serialization::stl::save_collection<boost::archive::xml_oarchive,std::list<bus_stop *,std::allocator<bus_stop *> > >(xml_oarchive &, const list<bus_stop *,std::allocator<bus_stop *> > &)". "/home/jdavidso/boost/boost_xlc/include/boost-1_33_1/boost/serialization/list.hpp", line 44.5: 1540-0700 (I) The previous message was produced while processing "boost::serialization::save<boost::archive::xml_oarchive,bus_stop *,std::allocator<bus_stop *> >(xml_oarchive &, const list<bus_stop *,std::allocator<bus_stop *> > &, const unsigned int)". "/home/jdavidso/boost/boost_xlc/include/boost-1_33_1/boost/serialization/split_free.hpp", line 37.17: 1540-0700 (I) The previous message was produced while processing "boost::serialization::free_saver<boost::archive::xml_oarchive,std::list<bus_stop *,std::allocator<bus_stop *> > >::invoke(boost::archive::xml_oarchive &, const std::list<bus_stop *,std::allocator<bus_stop *> > &, const unsigned int)". "/home/jdavidso/boost/boost_xlc/include/boost-1_33_1/boost/serialization/split_free.hpp", line 74.5: 1540-0700 (I) The previous message was produced while processing "boost::serialization::split_free<boost::archive::xml_oarchive,std::list<bus_stop *,std::allocator<bus_stop *> > >(xml_oarchive &, list<bus_stop *,std::allocator<bus_stop *> > &, const unsigned int)". "/home/jdavidso/boost/boost_xlc/include/boost-1_33_1/boost/serialization/list.hpp", line 75.5: 1540-0700 (I) The previous message was produced while processing "boost::serialization::serialize<boost::archive::xml_oarchive,bus_stop *,std::allocator<bus_stop *> >(xml_oarchive &, list<bus_stop *,std::allocator<bus_stop *> > &, const unsigned int)". "/home/jdavidso/boost/boost_xlc/include/boost-1_33_1/boost/serialization/serialization.hpp", line 125.13: 1540-0700 (I) The previous message was produced while processing "boost::serialization::serialize_adl<boost::archive::xml_oarchive,std::list<bus_stop *,std::allocator<bus_stop *> > >(xml_oarchive &, list<bus_stop *,std::allocator<bus_stop *> > &, const unsigned int)". "/home/jdavidso/boost/boost_xlc/include/boost-1_33_1/boost/archive/detail/oserializer.hpp", line 148.5: 1540-0700 (I) The previous message was produced while processing "boost::archive::detail::oserializer<boost::archive::xml_oarchive,std::list<bus_stop *,std::allocator<bus_stop *> > >::save_object_data(basic_oarchive &, const void *) const". "/home/jdavidso/boost/boost_xlc/include/boost-1_33_1/boost/archive/detail/oserializer.hpp", line 99.7: 1540-0700 (I) The previous message was produced while processing "class boost::archive::detail::oserializer<boost::archive::xml_oarchive,std::list<bus_stop *,std::allocator<bus_stop *> > >". "/home/jdavidso/boost/boost_xlc/include/boost-1_33_1/boost/serialization/access.hpp", line 109.10: 1540-0217 (S) "serialize" is not a member of "class list<bus_stop *,std::allocator<bus_stop *> >". "/home/jdavidso/boost/boost_xlc/include/boost-1_33_1/boost/serialization/access.hpp", line 104.17: 1540-0700 (I) The previous message was produced while processing "boost::serialization::access::serialize<boost::archive::xml_oarchive,std::list<bus_stop *,std::allocator<bus_stop *> > >(xml_oarchive &, list<bus_stop *,std::allocator<bus_stop *> > &, const unsigned int)". "/home/jdavidso/boost/boost_xlc/include/boost-1_33_1/boost/serialization/serialization.hpp", line 81.5: 1540-0700 (I) The previous message was produced while processing "boost::serialization::serialize<boost::archive::xml_oarchive,std::list<bus_stop *,std::allocator<bus_stop *> > >(xml_oarchive &, list<bus_stop *,std::allocator<bus_stop *> > &, const unsigned int)". Thanks. -- Joe

1 0

praise for multi_index
by boost＠larroy.com 29 Jun '07

29 Jun '07

Hi I just wanted to praise boost::multi_index I think it's a great container. I'm starting to wonder now how I lived without it previously (with many individual maps and much complexity I guess) :) Regards. -- Pedro Larroy Tovar, pedro at larroy dot com | http://pedro.larroy.com/ * Las patentes de programación son nocivas para la innovación * http://proinnova.hispalinux.es/

1 0

[bind] using bind for << to ostream
by Mojmir Svoboda 29 Jun '07

29 Jun '07

Hello, i want to use bind to create a pair and forward it to an std::ostream, i.e. like: std::for_each(vec.begin(), vec.end(), bind(&write, std::cout, bind(constructor<std::pair<value_t, value_t> >(), _1, _1))); but the compiler says: ios_base.h:781: error: 'ios_base(const ios_base &)' is private boost/boost/lambda/detail/bind_functions.hpp:472: error: within this context boost/boost/lambda/detail/function_adaptors.hpp: In static member function `static void boost::lambda::function_adaptor< void (*)(ostream &, const pair<value_t, value_t> &) >::apply( void (*)(ostream &, const pair<value_t, value_t> &), const ostream &, const pair<value_t, value_t> &)' ... it seem that temporary is created? why? how to avoid it? i've tried the obvious way (at least for me): std::for_each(vec.begin(), vec.end(), (std::cout << bind(constructor<std::pair<value_t, value_t> >(), _1, _1))); but now the output from compiler is kind of 'heavy stuff' and i'm having difficulties to figure out what am i doing wrong. can you help me, please? many thanks for your attention, Mojmir --------8<---- complete source ------ #include <boost/lambda/bind.hpp> #include <boost/lambda/construct.hpp> #include <memory> #include <vector> #include <iostream> using namespace boost::lambda; typedef int value_t; typedef std::vector<value_t> vect_t; typedef std::vector<std::pair<value_t, value_t> > vect2_t; std::ostream & operator<< (std::ostream & os, std::pair<value_t, value_t> const & p) { return os; } void write (std::ostream & os, std::pair<value_t, value_t> const & p) { } int main () { vect_t vec; vect2_t vec2; vec.push_back(1); std::transform(vec.begin(), vec.end(), std::back_inserter(vec2), bind(constructor<std::pair<value_t, value_t> >(), _1, _1)); // ok /* std::for_each(vec.begin(), vec.end(), bind(&write, std::cout, bind(constructor<std::pair<value_t, value_t> >(), _1, _1)) ); std::for_each(vec.begin(), vec.end(), (std::cout << bind(constructor<std::pair<value_t, value_t> >(), _1, _1))); */ } This e-mail and any attachment is for authorised use by the intended recipient(s) only. It may contain proprietary material, confidential information and/or be subject to legal privilege. It should not be copied, disclosed to, retained or used by, any other party. If you are not an intended recipient then please promptly delete this e-mail and any attachment and all copies and inform the sender. Thank you.

3 4

[multi-index] how to use in herit member as index
by hongleij＠126.com 29 Jun '07

29 Jun '07

//boost #include <boost/multi_index_container.hpp> #include <boost/multi_index/hashed_index.hpp> #include <boost/multi_index/member.hpp> using namespace ::boost; using namespace ::boost::multi_index; #include <string> struct Peer { std::string userid; }; struct CPeer:public Peer { int index; }; struct userid{}; typedef multi_index_container< CPeer, indexed_by< hashed_unique<tag<userid>,member<CPeer,std::string,&CPeer::userid> > > > CPeersType; //how could i use userid as an index in CPeer ,not in Peer, 一起来，150 万人同时在玩的梦幻西游

4 8

Re: [Boost-users] [multi-index] member ar guments [Was: how to use inheritmember as index]
by hongleij＠126.com 29 Jun '07

29 Jun '07

it my implemention, i use BOOST_TYPEOF instead of typeof(). it seems work well for gcc and vc7.1 , #include <boost/multi_index/member.hpp> //for member #include <boost/multi_index/mem_fun.hpp> //for const_mem_fun using boost::multi_index::member; using boost::multi_index::const_mem_fun; #include <boost/typeof/typeof.hpp> /* MEMBER */ template<typename T> struct get_details; template<typename Class, typename Member> struct get_details<Member Class::*> { typedef Class class_type; typedef Member member_type; }; #define MEMBER(MemPtr) \ member< \ get_details<BOOST_TYPEOF(MemPtr)>::class_type, \ get_details<BOOST_TYPEOF(MemPtr)>::member_type, \ MemPtr> /* CONST_MEM_FUN */ template<typename T> struct get_fun_details; template<typename Class, typename Type> struct get_fun_details<Type (Class::*)()const> { typedef Class class_type; typedef Type member_type; }; #define CONST_MEM_FUN(MemFunPtr) \ const_mem_fun< \ get_fun_details<BOOST_TYPEOF(MemFunPtr)>::class_type, \ get_fun_details<BOOST_TYPEOF(MemFunPtr)>::member_type, \ MemFunPtr>

1 0

Cross-compiling boost for win32 on linux
by rodolfo＠rodsoft.org 29 Jun '07

29 Jun '07

Hi, I used to be able to cross-compile boost on linux for win32 with boost.build v1 without problems, but now with v2 I cannot find the mingw toolset. It seems that now we can use gcc toolset but with a mingw flavor. So, where can I set this flavor? Everything I do makes bjam use plain g++ (for building to run on linux), not mingw32-g++ (run on win32). Regards, Rodolfo Lima.

4 8

Why can't I catch this exception in boost::thread?
by af001 29 Jun '07

29 Jun '07

#include <boost/thread/thread.hpp> #include <iostream> #include <exception> void helloworld() { std::cout << "Hello World!" << std::endl; throw(std::string("err")); } int main() { try { boost::thread thrd(&helloworld); thrd.join(); } catch(...) { std::cout<<"err"; } } -- View this message in context: http://www.nabble.com/Why-can%27t-I-catch-this-exception-in-boost%3A%3Athre… Sent from the Boost - Users mailing list archive at Nabble.com.

2 2

about shared_ptr
by Daniel Oberhoff 28 Jun '07

28 Jun '07

Hi all, I am using shared_ptr to ease implementation of a matlab file wrapper. Esepcially the fact that it is in tr1 and thus available on many platforms already pushed that decision. Now I was wondering about one thing: Is there a devent way, using shared_ptr, to hand out multiple references? What I mean is something like this: class Variable { shared_ptr<Variable> ref(); }; The problem with shared_ptr is, that, or so it seems, you can only create one directly from the object like this: shared_ptr<Variable> p(new Variable(...)); and all further references have to be created as copies of this (or copies of copies...). So I have to keep one of those around to make new ones. But I cannot keep one inside the class itself or else it will never be deleted (because it would reference itself). The same goes for weak_ptr, since there must be a live shared_ptr around for the object not to be deleted. The only way I can think of is implementing my own refcount and hooking into my own release method. THe problem with this is that I cannot, acoording to the docs, hook up the retain method, so each shared_ptr "cloud" (i.e. set of shared_ptrs that have been created from a common shared_ptr) is hooked up to one ref_count, so they might invalidate when the object stays alive, making any attached weak_ptrs useless. The other is using intrusive_ptr, but that a) is not in tr1 and b) does not have a weak ptr. I was also wondering why intrusive_ptr is not wrapped inside shared_ptr, i.e. why I cannot hook up both retain (increase refcount) and release into shared_ptr, but I suppose that is for the developers list. One other way I could think of would be that I keep a reference to the global ref_count of all the shared_ptrs, and creating new shared_ptrs on top of that, thus binding all shared_ptrs together, but that part does not seem to be exposed in the api. Any Ideas? Daniel Oberhoff ps: should it be possible to post to this list via gmane? I would like that much better, so this won't clog my inbox. But trying to post I keep getting error 441 in gnus

3 2

Re: [Boost-users] [serialization] problem with derived classes
by Johan Franzén 28 Jun '07

28 Jun '07

> Hello, > > I'm having an issue with serializing derived classes from a base class > pointer. I think I've narrowed it down to the simplest possible code. I > get an "unregistered class" exception at runtime even though I've > registered the derived class with BOOST_CLASS_EXPORT. Here's the code: > [ snip ] > ----------------------------------------------- > > X.hpp: > > #pragma once > > #include <boost/serialization/base_object.hpp> > #include "A.hpp" > > class X : public A > { > friend class boost::serialization::access; > template<class Archive> > void serialize(Archive & ar, const unsigned int) > { > ar & boost::serialization::base_object<A>(*this); > } > }; > > ------------------------------------------------ > > X.cpp: > > #include "X.hpp" > > #include <boost/serialization/export.hpp> > > BOOST_CLASS_EXPORT(X) > > ----------------------------------------------- > > As you can see, I don't have BOOST_CLASS_EXPORT in the X.hpp header. > This is the way I originally had it but then I got multiple definition > link errors when more than one class derived from A. The suggestion in > the serialization docs was to move the macro to a .cpp file. [ snip ] Hello Avery, I suspect You need to BOOST_CLASS_EXPORT(A) as well, since You do try to serialize an A in X's serialize() method. This is was I ended up doing when serializing a hierarchy of derived classes and a base class. I'm not sure how to do that in Your case, since I had all classes and all BOOST_CLASS_EXPORT macros in a single header file. HTH, Johan Franzén

4 4

Re: [Boost-users] [multi-index /mpl] fata l compile error when using a tag in VS7.1 with SP1
by hongleij＠126.com 28 Jun '07

28 Jun '07

when i clean the solution and then rebuild it,it is useless; >* Try disabling the option /Gm (Enable Minimal Rebuild.) Yes,i just turn off it,then the error disappear. ps: its really a painful thing waiting for compiling, it about 10s for that litte file in a pentium 2.8G cpu. 一起来，150 万人同时在玩的梦幻西游

2 1

Creating a property map inside Dijkstra Visitor
by Jonas Gabriel 28 Jun '07

28 Jun '07

Good afternoon, Inside a dijkstra visitor I would like to change the edge weights at some point, so in my visitor I'm trying to make a property map called weight : > template<class DynamicMap> > class gds_visitor : public dijkstra_visitor<> > { > public: > > gds_visitor(DynamicMap input):dynamic(input){} > > .... > > template <class Edge, class Graph> > void examine_edge (Edge e, Graph& g) { > typename property_map<Graph, edge_weight_t>::type weight; > weight=get(edge_weight, g); > > std::cout << "An edge is being examined..." << "\n"; > } > > protected: > DynamicMap dynamic; > }; where Graph: > typedef adjacency_list<listS, vecS, directedS, no_property, property<edge_weight_t, int> > Graph; and Edge: > typedef std::pair<int, int> Edge; But it is not compiling, mentioning a problem with weight 'soperator = . Thank you in advance, Jonas Gabriel

2 1

grapg problem: getting all vertices between source and sink
by gast128 28 Jun '07

28 Jun '07

Dear all, we have a simple problem: we want to know all vertices between a source and sink vertex in adirected graph. So my thoughts were to see if a vertex is reachable from both source and sink (by doing a breadth_first_search on the graph from source and a breadth_first_search from the sink on the reverse graph) and if reachable they lay in between. However this counts too much vertices. Consider graph So -> Si -> C. C is reachable from both So as reachable from Si using in edges. This is not good. The breadth_first_search should not perform an out_edge discover from Si. Do I have to implement my own breadth_first_search_with_stop or are there alternatives? Wkr, me

2 3