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 … [View More]

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 … [View More]

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 … [View More]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> [View Less]

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 … [View More]

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 … [View More]

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 … [View More]

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 … [View More]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 [View Less]

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 … [View More]

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... > … [View More]

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,… [View More]

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, … [View More]

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)); </… [View More]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… [View Less]

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.… [View More]

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) … [View More]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. -------------------------------------------------------- [View Less]

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 … [View More]

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::… [View More]

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/… [View More]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 [View Less]

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::… [View More]

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 … [View More]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 [View Less]

3 7