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

bootstrap.sh questions (compiling v1.39)
by Raymond Wan 22 May '09

22 May '09

Hi all, I'm hadn't been following the development of Boost's installation process and just went from 1.38 to 1.39 and realized the steps that I had written down no longer work. :-) I'm glad that the process was being looked into, but could someone help me with a couple of things? First, I use mpi and use to edit $BOOST/user-config.jam and put "using mpi ;" at the end to get it to compile. I didn't do this and I got a similar warning as before even though I ran: ./bootstrap.sh --with-libraries=graph,mpi,program_options,serialization Does "mpi" in it have no effect? After it finished, it seems the other 3 were made, but not mpi. Should I add "using mpi ;" still? [In $BOOST, I now notice there is no user-config.jam but a project-config.jam.] And the other thing I use to do was to edit the Makefile by adding "--layout=system" so that the generated libraries do not indicate the compiler version. (I did read the discussion earlier this month and I'm now wondering if it's bad practice to do this? I would like libboost_program_options-mt.so instead of libboost_program_options-gcc43-mt.so .) How do I do this with bootstrap.sh/bjam? Thank you! Ray

2 4

scoped_lock
by Space Ship Traveller 22 May '09

22 May '09

I think this is my own fault. I'm debugging some issues with multi-threading and using boost scoped_lock. My code looks like this: { // Enqueue the notification to be processed scoped_lock(m_notifications.lock); m_notifications.sources->push(note); } Am I correct in assuming this is not going to work as expected? The compiler might not even instantiate the lock given this code? I need to write it like this? { // Enqueue the notification to be processed scoped_lock locked(m_notifications.lock); m_notifications.sources->push(note); } Kind regards, Samuel

2 1

Re: [Boost-users] Error (runtime) assigning multi_array to multi_array with smaller dimensions
by Oei, YC 22 May '09

22 May '09

> //at class constructor > boost::multi_array<char, 2> array2d = new boost::multi_array<char, > 2>(boost::extents[x][y]); > //at class method > boost::multi_array<char, 1> array1d = array2d[0]; I tried out those two lines (minus the "new") here (see below), and they compile without complaints in g++ 4.1.2. Yung-Chin -- contents of test file -- #include <iostream> #include <boost/multi_array.hpp> int main() { size_t x = 5; size_t y = 7; boost::multi_array<char, 2> array2d = boost::multi_array<char, 2>(boost::extents[x][y]); std::cout << array2d.num_dimensions() << std::endl; std::cout << array2d[0].num_dimensions() << std::endl; boost::multi_array<char, 1> array1d = array2d[0]; std::cout << array1d.num_dimensions() << std::endl; return 0; } //main

2 3

Example of using posix_time with timezone
by Archie14 21 May '09

21 May '09

This post is related to my discovery of differences in behavior between posix_time::from_ftime and C# DateTime.FromFileTime methods (earlier post) Now I am trying to learn the proper usage of posix_time and time_zones. After reading the documentation I am still confused regarding usage of the timezone together with usage of classes/functions in posix_time namespace Is it possible to do smth.like this: First declare the time zone, like EST, CT ets and then all subsequent calls to posix_time namespace functions or classes will take this timezone as a base? I will really appreciate a simple example of specifying EST timezone for posix_time.

1 0

[multi_array] Looking for elegant way to convert between array and extent_gen objects
by Oei, YC 21 May '09

21 May '09

Dear list members, I've been working with multi_array lately, and am trying to exclusively use boost::arrays as the indexing object when accessing multi_arrays, in order to keep my code dimension-independent. There is a little issue however, in that not all multi_array methods take arrays as parameters; e.g. multi_array::resize() only takes an extent_gen parameter. I've come up with a workaround, which converts an array to the corresponding extent_gen object, and this works.... but it is an ugly amount of code for such a little task. I was hoping I might ask if you have better suggestions? Is there a way to make extents-notation dimension-independent? The content of the header file with my current solution is pasted below to illustrate what I'm trying to achieve - a (somewhat overly trivial) use case is as follows: #include "ArrayToExtentGen.h" [...] boost::multi_array<SomeValueType, SomeNumberOfDimensions> array; [...] boost::array<boost::multi_array_types::index, SomeNumberOfDimensions> position = {{0, 0, 0, 0, 0, 0, 0, 0}}; array.resize(ArrayToExtentGen(position)); [...] Thanks for your thoughts! Yung-Chin -- ArrayToExtentGen.h -- #ifndef GUARD_ArrayToExtentGen_h #define GUARD_ArrayToExtentGen_h #include <boost/array.hpp> #include <boost/multi_array.hpp> namespace YungChin { //! Helper class for ArrayToExtentGen() to recurse through dimensions template < size_t NumDimsIn, size_t NumDimsOut> class ArrayToExtentGenRecurse; //! Convert boost::array (used for addressing on multi_array) into extent_gen template<size_t NumDims> boost::detail::multi_array::extent_gen<NumDims> ArrayToExtentGen( const boost::array<boost::multi_array_types::index, NumDims>& array) { return ArrayToExtentGenRecurse<NumDims, NumDims>::Apply(array); } //ArrayToExtentGen template < size_t NumDimsIn, size_t NumDimsOut> class ArrayToExtentGenRecurse { public: static boost::detail::multi_array::extent_gen<NumDimsOut> Apply( const boost::array<boost::multi_array_types::index, NumDimsIn>& array) { return ArrayToExtentGenRecurse<NumDimsIn, NumDimsOut-1> ::Apply(array)[array[NumDimsOut-1]]; } //Apply }; //ArrayToExtentGen //! Partial specialisation of the above, to stop recursing at 0 dimensions template <size_t NumDimsIn> class ArrayToExtentGenRecurse<NumDimsIn, 0> { public: static boost::detail::multi_array::extent_gen<0> Apply( const boost::array<boost::multi_array_types::index, NumDimsIn>& array) { return boost::detail::multi_array::extent_gen<0>(); } //Apply }; //ArrayToExtentGen } //namespace YungChin #endif

1 0

posix_time::from_ftime versus DateTime.FromFileTime
by Archie14 21 May '09

21 May '09

I will appreciate any help in sorting out following issue: There is a value dt of type long. Calling boost::posix::time::from_ftime in c++ and DateTime.FromFileTime with that value produce "slightly" different results: dt = 128822886020000000 c++: "2009-Mar-23 13:30:02" c#: {3/23/2009 9:30:02 AM} What I am doing wrong? c++ code: typedef signed __int64 int64; int64 dt = 128822886020000000; datetime = boost::posix_time::from_ftime<boost::posix_time::ptime>(dt); std::string testdt = boost::posix_time::to_simple_string(datetime); C# code: Int64 dt = 128822886020000000; startdate = DateTime.FromFileTime(dt);

2 1

Re: [Boost-users] Boost.Unordered throws 64-bit portability warnings
by JOAQUIN M. LOPEZ MUÑOZ 21 May '09

21 May '09

________________________________________ De: boost-users-bounces(a)lists.boost.org [boost-users-bounces(a)lists.boost.org] En nombre de Daniel James [daniel_james(a)fmail.co.uk] Enviado el: jueves, 21 de mayo de 2009 21:36 Para: boost-users(a)lists.boost.org Asunto: Re: [Boost-users] Boost.Unordered throws 64-bit portability warnings 2009/5/21 Dominique Devienne <ddevienne(a)gmail.com>: > > > > FWIW, I'm getting these as well when using > > boost::hash_combine(hash_value(this->member_)); to implement hashes > > for my classes. We also use VS2005 with the compiler switch that > > raises these warnings. My work around below is not pretty... --DD > > > > #if ACME_SIZEOF_SIZE_T == 4 > > // Avoid warning C4267: 'argument' : > > // conversion from 'size_t' to 'unsigned int', possible loss of data > > boost::hash_combine( > > seed, static_cast<unsigned int>(hash_value(member_)) > > ); > > #else > > boost::hash_combine(seed, hash_value(member_)); > > #endif > > Doesn't 'boost::hash_combine(seed, member_)' work? > > I'll have a look at the warning when I get the chance, but AFAICT > they're wrong since when compiling for 64-bit a different overload or > template resolution would be chosen. Is this maybe related to http://lists.boost.org/boost-users/2007/03/26388.php ? Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

iterators must go
by Neal Becker 21 May '09

21 May '09

Interesting presentation: http://www.boostcon.com/site- media/var/sphene/sphwiki/attachment/2009/05/08/iterators-must-go.pdf

8 13

Persisting __int64 (or long long) with boost::serialization?
by Sandy Walsh 21 May '09

21 May '09

Hi, Sorry for the n00b question, but I'm trying to serialize some unsigned __int64 member variables using boost::serialization. I added the following to my header: namespace boost { namespace serialization { template<class Archive> void load(Archive & ar, unsigned __int64& big, const unsigned int version) { size_t size = sizeof(big); ar.load_binary(&big, size); } template<class Archive> void save(Archive & ar, unsigned __int64 big, const unsigned int version) { ar & sizeof(big); ar.save_binary(&big, sizeof(big)); } } }; But the compiler still complains that it doesn't know how to handle that right-hand operand. Is there something obvious here I'm missing? Thanks -S

4 6

Declare statistical distribution array: boost/math/distributions
by Alex Tsoi 21 May '09

21 May '09

Hi all, I am trying to write a MCMC algorithm by using boost's math distribution library, what I want to do is to first declare an array of length 10 of gamma distribution, and then run a for loop to declare each gamma distribution's parameters. However, boost does not allow me to declare the gamma distribution array without having defining the parameter in advance: gamma_distribution<double> mydist10[10]; error: no appropriate default constructor available. because the library requires to know the parameter of the gamma distribution in advance. Do you guys have any idea to overcome this ? Thanks a lot for any comment or suggestion. Alex- -- Lam C. Tsoi (Alex) Medical University of South Carolina

3 3

Boost'Con aftermath
by Joel Falcou 21 May '09

21 May '09

I wanted to know what will the paper submitted to boost'con become ? Is there any publication planned or not ? Just asking to know if I can quote the thing I did for Boost'Con 09 in other papers ;) Regards -- ___________________________________________ Joel Falcou - Assistant Professor PARALL Team - LRI - Universite Paris Sud XI Tel : (+33)1 69 15 66 35

2 2

boost::iostreams filter question
by plarroy 21 May '09

21 May '09

Hello, I have implemented a test SymmetricFilter and works ok. Although to my suprise I had to declare two different methods of filter differing only in the signature by the const char*& src_end. If I supress either of those i get a compile time error. Perhaps it is because it's being used as a bidirectional filter? as the two signatures might be the ones in boost/iostreams/filter/symmetric.hpp read and write? Pedro. Regards. My code: class smashing_filter_impl { public: typedef char char_type; smashing_filter_impl() { } bool filter(const char*& src_begin, char*& src_end, char*& dst_begin, char*& dst_end, bool flush) { bool eof = false; ptrdiff_t src_sz = src_end - src_begin; if( src_sz <= 0 ) return false; while(src_begin < src_end && dst_begin < dst_end) *dst_begin++ = tolower(*src_begin++); return true; } bool filter(const char*& src_begin, const char*& src_end, char*& dst_begin, char*& dst_end, bool flush) { bool eof = false; ptrdiff_t src_sz = src_end - src_begin; if( src_sz <= 0 ) return false; while(src_begin < src_end && dst_begin < dst_end) *dst_begin++ = tolower(*src_begin++); return true; } void close() {} private: }; struct smashing_filter : symmetric_filter<smashing_filter_impl> { public: typedef symmetric_filter<smashing_filter_impl> base_type; smashing_filter() : base_type(default_device_buffer_size) { } };

1 0

Boost Library on ThreadX RTOS
by Suraj Gupta, Gurgaon 21 May '09

21 May '09

Hi All, I want to use BOOST library (Test) on ThreadX Real Time Operating System. Can it be used on ThreadX? If possible, are there any guidelines those needs to be followed? Thanks, Suraj DISCLAIMER: ----------------------------------------------------------------------------------------------------------------------- The contents of this e-mail and any attachment(s) are confidential and intended for the named recipient(s) only. It shall not attach any liability on the originator or HCL or its affiliates. Any views or opinions presented in this email are solely those of the author and may not necessarily reflect the opinions of HCL or its affiliates. Any form of reproduction, dissemination, copying, disclosure, modification, distribution and / or publication of this message without the prior written consent of the author of this e-mail is strictly prohibited. If you have received this email in error please delete it and notify the sender immediately. Before opening any mail and attachments please check them for viruses and defect. -----------------------------------------------------------------------------------------------------------------------

1 0

[variant] apply templated visitor
by Dmitry Vinogradov 20 May '09

20 May '09

Imagine the following: struct foo { bar& operator[](int); bar& operator[](std::string); } Foo; boost::variant<int, std::string> Idx; Is some simple way exist to apply foo::operator[](T) for Foo and Idx? Something like boost::apply_visitor(boost::bind(&foo::operator[], boost::ref(Foo), _1), Idx); // does not compile

2 1

find the largest/most precise of two types
by Alex Flint 20 May '09

20 May '09

Hi there, I have a bunch of functions that accept two numeric arguments. In the case that the types of these arguments are different I want to figure out what the return type should be. The rule I would like to use is that the largest of the two types should be used for internal computations and the return type. f(someFloat, someDouble) -> double f(someFloat, someFloat) -> float f(someInt, someFloat) -> float Is there a way I can do this, perhaps with boost's type_traits? Cheers, Alex

5 4

Error (runtime) assigning multi_array to multi_array with smaller dimensions
by Matheus Araújo Aguiar 20 May '09

20 May '09

Hello everyone, I'm getting an error when trying to get one sub array from a multi_array with 2 dimensions. This is the code: //at class constructor boost::multi_array<char, 2> array2d = new boost::multi_array<char, 2>(boost::extents[x][y]); ... //at class method boost::multi_array<char, 1> array1d = array2d[0]; And the error i got: Reference boost::detail::multi_array::value_accessor_n<T, NumDims>::access(boost::type<Reference>, boost::multi_array_types::index, TPtr, const boost::multi_array_types::size_type*, const boost::multi_array_types::index*, const boost::multi_array_types::index*) const [with Reference = boost::detail::multi_array::sub_array<char, 1u>, TPtr = char*, T = char, unsigned int NumDims = 2u]: Assertion `size_type(idx - index_bases[0]) < extents[0]' failed. Could anyone help, please? Thanx, -- Matheus Araújo Aguiar Computer Scientist matheus.pit(a)gmail.com

2 2

To find adjacent vertices using Boost Graph....
by Amanullah Yasin 20 May '09

20 May '09

Hi, Dear All, In the graph of nodes (e.g. 1 , 2, 3, 4, 5, 6 , 7........). I want to iterate to the adjacent nodes of node x. For this i am using adjacent_vertices(v, g), which returns std::pair<adjacency_iterator, adjacency_iterator> for (i = 1; i <= n; i++){ tie(eo, eo_end) = adjacent_vertices( vertex( i-1, graph), graph); } Please guide me how i can use the adjacency_iterator to access the neighbourhood of node x ? e.g. graph is a 1 ---- 2 3 4 5 2 ---- 4 5 6 3 ---- 5 6 7 so, neighbourhood of 1 are 2 3 4 5 2 are 4 5 6 3 are 5 6 7 I will be thankful to you. Regards Amanullah YASIN Master2 (ECD) Ecole Polytechnique Université de Nantes, France. Mob# 06 47 62 89 96 Fix # 02 72 00 26 45 amanyasin(a)gmail.com

1 0

[interprocess] Mutex Query
by Rick Way 20 May '09

20 May '09

I want to make sure that when my program exits ungracefully (CTRL-C, seg fault, etc) it releases a Boost.Interprocess named_upgradable_mutex, if it's holding it. I've created a signal handler to catch these ungraceful exits. Is there any way to tell if my process currently holds an exclusive or sharable lock on the mutex? I've tried blindly calling mutex.unlock() and mutex.unlock_sharable() but that seems to permanently lock the mutex when the shareable lock is set. RickW

2 1

[test] Ignoring SIGCHLD for signal codes other than CLD_EXITED
by Gevorg Voskanyan 20 May '09

20 May '09

I could not find a response to the following message: http://lists.boost.org/boost-users/2008/09/40618.php , which proposes to modify ignore_sigchild() implementation to account for a proposed BOOST_TEST_IGNORE_SIGCHLD preprocessor switch. I am seconding this request. Has it ever been considered? Or was it the message simply went unnoticed? Thanks, Gevorg

3 10

failure of VertexListGraphConcept check
by Christian Bähnisch 20 May '09

20 May '09

Hello, Trying to write an BGL adaption of a BGL foreign graph-class I followed the conversion guide: "http://www.boost.org/doc/libs/1_39_0/libs/graph/doc//leda_conversion.html" Using "boost::function_requires<boost::VertexListGraphConcept<MyGraph> >();" in order to check my implemetation gcc complains about: "boost/graph/graph_concepts.hpp:199: error: no matching function for call to 'vertices(const MyGraph&)'" I further noticed that the test-case "stanford_graph_cc.cpp" found in "BOOST/libs/graph/test" also fails with this error. Any help would be much appreciated! greetings, Chris

1 0

Re: [Boost-users] [Regex] Source-only link error in MSVC
by dtexg＠hush.com 20 May '09

20 May '09

On Tue, 19 May 2009 03:42:57 -0500 John Maddock <john(a)johnmaddock.co.uk> wrote: >> [...] >> error LNK2019: unresolved external symbol >> [...] >> (?do_assign@?$basic_regex@DU?$regex_traits@DV?$ >> w32_regex_traits@D@boost@@@boost@@@boost@@ >> AAEAAV12@PBD0I@Z) referenced >> [...] >> (?assign@?$basic_regex@DU?$regex_traits@DV?$ >> w32_regex_traits@D@boost@@@boost@@@boost@@ >> QAEAAV12@PBD0I@Z) >> [...] >> I wrote the following code: >> >> #define BOOST_REGEX_SOURCE >> #include <boost/regex.hpp> >> >> int main() >> { >> boost::regex r("a"); >> return 0; >> } >> >> Everything compiles, but linking fails with the above error. >> [...] >> >> In a post from 2006, John wrote, "if you are doing something, >> umm, strange, and you can't track down the cause of the error, >> you can always just add the regex source directly to your >> application," but I've not seen this successfully demonstrated >> in Visual C++. I'm just looking for an absolutely parsimonious >> way to add Boost Regex to a VC++ project. > >Well, you need to do what I said, not what you did ;-) > >Take all the .cpp files in libs/regex/src and add them to your >console project's source, build and voila, it should all work. > >BTW use BOOST_REGEX_NO_LIB not BOOST_REGEX_SOURCE in your source >files, as the latter is for private regex use only and most >certainly does not do what you think it does. > >In point of fact I do this all the time, so it definitely does >work. > >HTH, John. My embarrassment is outstripped only by my gratitude. That did help completely, so I just want to confirm it for indexing and posterity: I changed the #define BOOST_REGEX_SOURCE to BOOST_REGEX_NO_LIB (or BOOST_ALL_NO_LIB) instead, then right- clicked on Source Files, chose Add -> Existing Item, and added all the .cpp files in libs/regex/source. When I built, it compiled all those .cpp files (where obviously it wasn't before), then linked successfully and everything just worked and everyone lived happily ever after. Sadly, I never would have figured that out. Thank you very much! /Eric -- Wanna lose weight? Weight Loss Programs that work. Click here. http://tagline.hushmail.com/fc/BLSrjkqbR3flkqN6HzqHIZfbT5vIrA1g60gAsnOhshGi…

2 1

[zip_iterator] Which header files?
by Robert Jones 20 May '09

20 May '09

The iterators documentation seems a bit thin! Does it say anywhere which header files are required to use zip_itrerators? Also, is the use of zip_itertor and others still very much current practise, or are there other techniques which tend to be used instead? Thanks, Rob.

1 0

[boost 1.39][Serialization] BOOST_CLASS_EXPORT_GUID macro failed to compile with C2888 error under MSVS.
by Vitaly Dolya 20 May '09

20 May '09

Hi, All! Since I had no answer on my previous post, I'll try to clarify the problem here. So, I use a macro BOOST_CLASS_EXPORT_GUID from Boost.Serialization library. And everything was just fine until boost 1.39 came up to stage recently. Now the same very of my code, I've been using for so long (starting with boost 1.35 I guess), failed to compile under MS Visual Studio 2008 SP1. Compiler gives me an error error C2888: 'boost::archive::detail::`anonymous-namespace'::init_guid<CSomeClass>' : symbol cannot be defined within namespace 'anonymous-namespace'. The error occurs when export.hpp file (contains BOOST_CLASS_EXPORT_GUID) is included to stdafx.h (to precompiled headers) and the macro is used in any other cpp-file. I guess the problem is that 'init_guid' structure declaration (declared inside anonymous namespace) and definition appear in different translation units. So, it looks like there is a bug in boost 1.39 to me. Am I right? And what should I do? Should I file a bug? Thanks in advance.

2 6

using bind with operator new
by Archie14 19 May '09

19 May '09

I am trying to use bind to generate ptr_vector list of objects from another vector #include <boost/shared_ptr.hpp> #include <boost/bind.hpp> class a { }; class b { public: b(a* val) : _val(val) { } private: boost::shared_ptr<a> _val; }; void test() { boost::ptr_vector<a> lsta; boost::ptr_vector<b> lstb; typedef boost::ptr_vector<b> listofb; // create lstb by applying new to each element of lsta and pushing it to lstb. Fails. I will appreciate any help with this. std::for_each (lsta.begin(), lsta.end, boost::bind((&listofb::push_back), lstb, boost::bind((&operator new), b, _1) ); }

2 1

boost::interprocess::managed_shared_memory uses C: - Need to change this
by Moorthi 19 May '09

19 May '09

I am using boost::interprocess::managed_shared_memory to share the data between processes. But the shared memory internally creates memory mapped file in C: dirve. if anyone knows how to change the configuration to use some other drive instead of C: as my production environment doesnt have much space in C: drive. -- View this message in context: http://www.nabble.com/boost%3A%3Ainterprocess%3A%3Amanaged_shared_memory-us… Sent from the Boost - Users mailing list archive at Nabble.com.

2 2

directory_iterator ++operator never return
by gtsml owevwr 19 May '09

19 May '09

Hi, I'm getting a list of the file in a directory like that: fs::directory_iterator end ; for( fs::directory_iterator iter(myfilepath) ; iter != end ; ++iter ) {...} And at some point in this for loop, the ++operator never return, see callstack (single-thread build). I found a related thread here: http://marc.info/?l=boost-users&m=118835374908173&w=2 I compiled boost in threaded and non-threaded mode and still have the same pb in both mode... This bug reproduce with iphone os21 and os3.0, boost 1.38.0 (multi/single thread). Anybody? Thanks, Frank #0 0x31d41270 in swtch_pri #1 0x31dd19cc in sched_yield #2 0x000ac1d4 in boost::detail::yield at yield_k.hpp:110 #3 0x000adb54 in scoped_lock [inlined] at detail:45 #4 0x000adb54 in boost::detail::spinlock::lock at detail:32 #5 0x000adb54 in atomic_exchange_and_add [inlined] at detail:61 #6 0x000adb54 in boost::detail::sp_counted_base::release at detail:100 #7 0x000adb54 in boost::shared_ptr<boost::filesystem::detail::dir_itr_imp<boost::filesystem::basic_path<std::string, boost::filesystem::path_traits> > >::reset at detail:216 #8 0x000adb54 in boost::filesystem::basic_directory_iterator<boost::filesystem::basic_path<std::string, boost::filesystem::path_traits> >::increment #9 0x0009cc44 in boost::iterator_core_access::increment<boost::filesystem::basic_directory_iterator<boost::filesystem::basic_path<std::string, boost::filesystem::path_traits> > > at iterator_facade.hpp:522 #10 0x0009cc64 in boost::iterator_facade<boost::filesystem::basic_directory_iterator<boost::filesystem::basic_path<std::string, boost::filesystem::path_traits> >, boost::filesystem::basic_directory_entry<boost::filesystem::basic_path<std::string, boost::filesystem::path_traits> >, boost::single_pass_traversal_tag, boost::filesystem::basic_directory_entry<boost::filesystem::basic_path<std::string, boost::filesystem::path_traits> >&, int>::operator++ at iterator_facade.hpp:664

2 7

building boost 1.39 on iphone os3.0
by gtsml owevwr 19 May '09

19 May '09

Hi, I understand a lot of effort is being spent on making boost easy to compile and so on but as far as my experience goes, that's always a bit painful... So here's what I'm going to do as a background task: I'm going to play it dumb (eg. not spend 30 minutes on the web everytime I hit something) and tell you all about it :-) My goal here is to compile boost 1.39 on the iphone os3.0. Note that I already compiled 1.38 on os21 and os30 so I have gathered some experience already, but as I said, I'm playing it dumb. So: - getting boost from the web, uncompress and so on - boostrap, so far so good - add my user-config with: ################################################################# # Compiler configuration using darwin : 4.0.1~iphone : /Developer/Platforms/iPhoneOS.platform/Developer/usr/bin/gcc-4.2 -arch arm : <striper> : <architecture>arm <target-os>iphone <macosx-version>iphone-3.0 ; using darwin : 4.0.1~iphonesim : /Developer/Platforms/iPhoneSimulator.platform/Developer/usr/bin/gcc-4.2 -arch i386 : <striper> : <architecture>x86 <target-os>iphone <macosx-version>iphonesim-3.0 ; ################################################################# - and type ./bjam BUT, here we go, first problem, my user-config.jam seems to be ignored. the compiler used is "g++": "/Developer/Platforms/iPhoneOS.platform/Developer/usr/bin/gcc-4.2" still the doc says: On startup, Boost.Build searches and reads two configuration files: site-config.jam and user-config.jam. On top of that, the project-config.jam file says: # Compiler configuration. This definition will be used unless # you already have defined some toolsets in your user-config.jam # file. if ! darwin in [ feature.values <toolset> ] { using darwin ; } Anybody get any idea? Frank

2 4

[BGL] Trying to use subgraph
by Lindley M French 19 May '09

19 May '09

I've been trying to work out how to use the subgraph adapter. I've come to realize that in order to use it, my primary graph must *itself* be an object of the subgraph type (unintuitive). However, I'm getting a static assertion error that edge_index is an unknown property. I had *thought* that an adjacency_list<vecS,vecS> would not have that issue, but apparently I was wrong. The page here: http://www.boost.org/doc/libs/1_39_0/libs/graph/doc/subgraph.html says "we add an edge index property to the adjacency list", but the code which follows demonstrates no such thing. The distinction between bundled properties and internal properties is still a bit mysterious to me. Can anyone shed some light on this?

2 1

Serialization Archive Incompatibility between Boost Versions
by David Graf 19 May '09

19 May '09

Hello How is it possible to load serialized objects with a newer boost version than they have been saved with. I have installed boost version 1.36 and I cannot read archives that have been save with boost 1.35. This is not possible because boost 1.35 puts 'serialization::archive 4' into the files but boost 1.36 needs the archive version 5. I found some information in the documentation that is must be possible to read old archives. But I am not able to do it. I always get exceptions. Thank you in advance for help! David

2 8

Boost up for SourceForge Community Choice Award
by David Abrahams 19 May '09

19 May '09

Cast your vote here: http://tinyurl.com/boost-cca09 Cheers, -- Dave Abrahams BoostPro Computing http://www.boostpro.com

2 1

[signals2] connection blocking
by Bryan Green 19 May '09

19 May '09

Hi, I've starting porting some code from signals to signals2, and I've run into a problem because of the removal of the 'block' and 'unblock' methods from a connection object. I understand the rational for using the 'shared_connection_block' object, but it doesn't really apply in my case. I have a GUI widget which receives events via a signal, unless it is in an "inactive" state, during which time events are blocked: class widget { private: boost::signals::connection conn; ... public: void toggle_active_state() { ... if (inactive) conn.block(); else conn.unblock(); } }; It is obviously awkward to be forced to convert this code to use an RAII object, and I'd rather not do a full connect/disconnect for this state change. What do you think? Should I be thinking about this differently? Or can a good case be made for bringing back the block()/unblock() methods? Thanks, -bryan

4 7

[Regex] Source-only link error in MSVC
by dtexg＠hush.com 19 May '09

19 May '09

Hi, I'm trying to include the Boost Regex source in a Visual C++ project, but I get the following linker error: (indented for legibility) error LNK2019: unresolved external symbol "private: class boost::basic_regex< char, struct boost::regex_traits< char, class boost::w32_regex_traits<char> > > & __thiscall boost::basic_regex< char, struct boost::regex_traits< char, class boost::w32_regex_traits<char> > >:: do_assign( char const *, char const *, unsigned int)" (?do_assign@?$basic_regex@DU?$regex_traits@DV?$w32_regex_traits@D@bo ost@@@boost@@@boost@@AAEAAV12@PBD0I@Z) referenced in function "public: class boost::basic_regex< char, struct boost::regex_traits< char, class boost::w32_regex_traits<char> > > & __thiscall boost::basic_regex< char, struct boost::regex_traits< char, class boost::w32_regex_traits<char> > >:: assign( char const *, char const *, unsigned int)" (?assign@?$basic_regex@DU?$regex_traits@DV?$w32_regex_traits@D@boost @@@boost@@@boost@@QAEAAV12@PBD0I@Z) Here are the steps I'm taking: I downloaded the latest Boost (boost_1_39_0.zip), and extracted it all into its own directory; I've tried extracting with both the built-in Windows Zip Folder support and the latest WinRAR. I did not do any making (nmake) or building on the Boost source -- after extracting, I don't touch this directory directly at all. In both Visual Studio 2005 and Visual C++ 2008 Express Edition (http://www.microsoft.com/express/vc/) I created a new empty console project, and I added a new .cpp file to the project. I went to Project -> Properties, Configuration Properties -> C/C++ - > General: Additional Include Directories, and (for the "Active(Debug)" configuration) added the full path of the directory containing the source, so that "boost" is a subdirectory in the selected directory. I wrote the following code: #define BOOST_REGEX_SOURCE #include <boost/regex.hpp> int main() { boost::regex r("a"); return 0; } Everything compiles, but linking fails with the above error. The same error results if I try this: boost::regex * p = new boost::regex("a"); Or if I use boost::wregex, or boost::basic_regex<char,boost::regex_traits<char,boost::w32_regex_tr aits<char>>>, etc. Also, the outcome is the same whether I #define BOOST_REGEX_SOURCE, BOOST_REGEX_NO_LIB, or BOOST_ALL_NO_LIB, and whether I define them in the .cpp or in Project -> Properties, Configuration Properties -> C/C++ -> Preprocessor: Preprocessor Definitions, and whether I #include <boost/regex.hpp> or <boost/regex/v4/regex.hpp>, and whether I use Debug or Release configuration. If I put a #error by the do_assign implementation in boost/regex/v4/basic_regex.hpp, it gets hit, so the implementation isn't being #if'ed away somehow. It will build successfully if, in the .cpp file in which main() resides, I write an implementation and replace all the template arguments, but besides being vulgar, this kludge also fails (with compiler errors) if I try to copy-and-paste the full implementation from basic_regex.hpp, so it's untenable as a workaround. In a post from 2006, John wrote, "if you are doing something, umm, strange, and you can't track down the cause of the error, you can always just add the regex source directly to your application," but I've not seen this successfully demonstrated in Visual C++. I'm just looking for an absolutely parsimonious way to add Boost Regex to a VC++ project. /Eric -- Free information on Digital Photography. Click Now! http://tagline.hushmail.com/fc/BLSrjkqZZHWE3MuglDmDyK5F8gPPnxz3V9yL7kN5dsQj…

2 1

PropertyTree's XML parsers survey
by Tan, Tom (Shanghai) 19 May '09

19 May '09

>From: Nat Goodspeed <nat(a)lindenlab.com> >> - I often embed some comment nodes inside the xml to facilitate the >> manual edit. E.g, enumeration of accepted value some fields. I wish >> boost.serialize ignores them when parsing, > >That seems plausible to me... > >> and embed them when saving (is this possible). >This request feels more difficult. Boost.Serialize is designed to read >from a file into /your/ data structures, and/or write those data >structures to a file. XML is only one of several possible archive >formats for such a file. > >Where in your own data structures would you recommend the Serialize >library store any XML comments it may encounter? > >Supposing there were an appropriate place to collect such comments, how >would you write them again in something like their original file location? Just for the fun of discussion, how about allowing only one comment node only and fixing the position to be the end of the file, like this: First, add an optional parameter to signature. template<class Archive> void serialize(Archive & ar, const unsigned int version, basic_string<Ch> comment = basic_string<Ch>()) Then, toward the end of the file, append this node <!== {comment string here} ==> This does not break the compatibility of the existing version, and that the xml archive version already includes more info(i.e. names in additional to values) than other variants(e.g. bins), it does not actually violate the current philosophy much. >>Instead of incrementally enhancing a minimal XML parser, wouldn't it >>make more sense to jump right to an existing full-blown parser >>implementation? Ah, while this is too limited, a full-blown is too heavy.

1 0

[iostreams][zip]
by Andy Schweitzer 18 May '09

18 May '09

Can someone provide a command line that builds iostreams with zlib and bz2 support? I tried the following but my program still fails to link to libboost_zlib. I did find a boost_zlib-vc90-mt-1_38.dll and a boost_zlib-vc90-mt-1_38.lib, but no libboost_zlib-vc90-mt-gd-1_38.lib bjam toolset=msvc-9.0 -sHAS_ZLIB=1 -sHAS_BZIP2=1 -sNO_COMPRESSION=0 -sNO_BZIP2=0 -s -sNO_ZLIB=0 -sZLIB_INCLUDE=C:/nan/compression/zlib/zlib123-dll/include -sZLIB_LIBPATH=C:/nan/compression/zlib/zlib123-dll/lib -sZLIB_SOURCE=C:/nan/compression/zlib/zlib-1.2.3 -sBZIP2_INCLUDE=C:/nan/compression/bz2/bzip2-1.0.5 -sBZIP2_LIBPATH=C:/nan/compression/bz2/bzip2-1.0.5 -sBZIP2_SOURCE=C:/nan/compression/bz2/bzip2-1.0.5 Thanks Andy

3 7

extending Jam
by gtsml owevwr 18 May '09

18 May '09

Hi, I'm trying to build boost on the iphone OS 3.0 and Jam is telling me: error: "iphone-3.0" is not a known value of feature <macosx-version> error: legal values: "10.6" "10.5" "10.4" "10.3" "10.2" "10.1" "iphone-2.3" "iphonesim-2.3" "iphone-2.2" "iphonesim-2.2" "iphone-2.1" "iphonesim-2.1" "iphone-2.0" "iphonesim-2.0" "iphone-1.x" I'd like to add this OS to Jam, is there a tutorial (or anything helpful) to accomplish such task? Thanks, Frank

2 5

Boost on Eclipse Ganymede 3.4.2
by Matheus Araújo Aguiar 18 May '09

18 May '09

Hello everyone, I'm trying to use boost lib asio in a project on eclipse (running on ubuntu 8.10). So far i'm getting this errors when trying to build the project. '/home/matheus/boost_1_39_0' is where i've unpacked boost lib downloaded from sourceforge.net . I've also set this directory to the include path in eclipse. So, any help? Description Resource Path Location Type /home/matheus/boost_1_39_0/boost/asio/detail/posix_signal_blocker.hpp undefined reference to `pthread_sigmask' Proxy_Server line 48 C/C++ Problem /home/matheus/boost_1_39_0/boost/asio/detail/posix_signal_blocker.hpp undefined reference to `pthread_sigmask' Proxy_Server line 55 C/C++ Problem /home/matheus/boost_1_39_0/boost/asio/detail/posix_thread.hpp undefined reference to `pthread_detach' Proxy_Server line 69 C/C++ Problem /home/matheus/boost_1_39_0/boost/asio/detail/posix_thread.hpp undefined reference to `pthread_join' Proxy_Server line 77 C/C++ Problem /home/matheus/boost_1_39_0/boost/asio/detail/posix_tss_ptr.hpp undefined reference to `pthread_getspecific' Proxy_Server line 67 C/C++ Problem /home/matheus/boost_1_39_0/boost/asio/detail/posix_tss_ptr.hpp undefined reference to `pthread_key_create' Proxy_Server line 47 C/C++ Problem /home/matheus/boost_1_39_0/boost/asio/detail/posix_tss_ptr.hpp undefined reference to `pthread_key_delete' Proxy_Server line 61 C/C++ Problem /home/matheus/boost_1_39_0/boost/asio/detail/posix_tss_ptr.hpp undefined reference to `pthread_setspecific' Proxy_Server line 73 C/C++ Problem /home/matheus/boost_1_39_0/boost/asio/error.hpp undefined reference to `boost::system::get_system_category()' Proxy_Server line 218 C/C++ Problem /home/matheus/boost_1_39_0/boost/system/error_code.hpp undefined reference to `boost::system::get_generic_category()' Proxy_Server line 206 C/C++ Problem /home/matheus/boost_1_39_0/boost/system/error_code.hpp undefined reference to `boost::system::get_generic_category()' Proxy_Server line 211 C/C++ Problem /home/matheus/boost_1_39_0/boost/system/error_code.hpp undefined reference to `boost::system::get_generic_category()' Proxy_Server line 212 C/C++ Problem /home/matheus/boost_1_39_0/boost/system/error_code.hpp undefined reference to `boost::system::get_system_category()' Proxy_Server line 205 C/C++ Problem /home/matheus/boost_1_39_0/boost/system/error_code.hpp undefined reference to `boost::system::get_system_category()' Proxy_Server line 213 C/C++ Problem /home/matheus/boost_1_39_0/boost/system/error_code.hpp undefined reference to `boost::system::get_system_category()' Proxy_Server line 312 C/C++ Problem Thanx and best regards, -- Matheus Araújo Aguiar Computer Scientist matheus.pit(a)gmail.com

3 4

*ignore* [interprocess] managed_mapped_file under cygwin
by Bob Walters 18 May '09

18 May '09

Please disregard that request for help, I had forgotten about a 'experimental' version of boost/interprocess/detail/os_file_functions.hpp (with support for offsets in the file locks) from the 1_38 version, which was being inadvertently included by the new 1_39 code, which I naturally upgraded to at the same time I did the OS change. - Bob Walters

1 0

[interprocess] managed_mapped_file under cygwin
by Bob Walters 18 May '09

18 May '09

>From what I've read, cygwin supports mmap, and so I figured there was a chance that boost::interprocess::managed_mapped_file was valid on windows when compiling with cygwin. I've built the boost libraries using cygwin with boost_1_39_0, using a user-config.bjam with: using gcc : cygwin_4.3.2 : /usr/bin/g++-4 : <compileflags>-DBOOST_POSIX_API <compileflags>-DBOOST_POSIX_PATH ; Under cygwin, I have g++ 3.4.4 g++-4 4.3.2 I think you can reproduce this with a source file that just includes <boost/interprocess/managed_mapped_file.hpp> I'm getting the following compile error: g++-4 -DHAS_STDINT_H -I/cygdrive/c/workspaces/cdds_head/stldb_lib -I/cygdrive/c/c++/boost_1_39_0 -O0 -g3 -Wall -c -fmessage-length=0 -MMD -MP -MF"database.d" -MT"database.d" -o"database.o" "../database.cpp" (I also get this with g++) In file included from C:\C++\boost_1_39_0/boost/interprocess/detail/managed_open_or_create_impl.hpp:17, from C:\C++\boost_1_39_0/boost/interprocess/managed_mapped_file.hpp:20, from C:\workspaces\cdds_head\stldb_lib/stldb/containers/trans_map.h:23, from ../trans_map.h:18, from ../database.h:13, from ../database.cpp:8: C:\C++\boost_1_39_0/boost/interprocess/mapped_region.hpp: In constructor 'boost::interprocess::mapped_region::mapped_region(const MemoryMappable&, boost::interprocess::mode_t, boost::interprocess::offset_t, size_t, const void*)': C:\C++\boost_1_39_0/boost/interprocess/mapped_region.hpp:403: error: request for member 'is_xsi' in 'map_hnd', which is of non-class type 'boost::interprocess::mapping_handle_t' C:\C++\boost_1_39_0/boost/interprocess/mapped_region.hpp:406: error: request for member 'handle' in 'map_hnd', which is of non-class type 'boost::interprocess::mapping_handle_t' The above suggests that in detail/os_file_functions.hpp, mapping_handle_t is being given the windows definition rather than the posix definition, somehow. However, I've also noticed that if I #include <boost/interprocess/windows_shared_memory.hpp>, I do trip the #error caused by !defined(BOOST_INTERPROCESS_WINDOWS), so that proves that it isn't, in which case I don't quite understand where this error is coming from. Any help is appreciated. Thanks, - Bob Walters

1 0

Buffer overrun when building read_graphviz using VC7.1
by Paul De La Musica 18 May '09

18 May '09

Hi, I got two buffer overrun errors building Boost 1.38.0 on MSVC 7.1.3088. One of them occurred while building the library to be used with read_graphviz. Is there a place to download a pre-built libbgl-viz.lib? Paul

2 3

PropertyTree's XML parsers survey
by Tan, Tom (Shanghai) 18 May '09

18 May '09

>From: "Robert Ramey" <ramey(a)rrsd.com> >Subject: Re: [Boost-users] PropertyTree's XML parsers survey >The serialization library has been using the spirit library >for parsing XML for years. This is for both utf-8 and wide characters > >Robert Ramey I just played with the examples demo_xml_load along with boost 1.39. As I mainly use xml as configuration files. I found some features I really like are missing: - often I need to edit the xml file manually with 3rd tools(gedit, kate notepad++ etc) other than the app itself. When saving back with those editors, they may add some BOM bytes(0xFFFE for UTF16LE, 0xFEFF for UTF16BE, 0xefbbbf for utf8) and replace the line-breakers(0x0a, 0x0a0d) with another fashion(e.g 0x0d0a -> 0x0a) the system default. In such cases, I wish boost.serialize would detect and ignore them as the real data the xml carries do NOT change. - I often embed some comment nodes inside the xml to facilitate the manual edit. E.g, enumeration of accepted value some fields. I wish boost.serialize ignores them when parsing, and embbded them when saving(is this possible). - I wish only the hierarchy not the order or nodes matters. Ex. <a> <first = "1st"> <second = "2nd"> </a> Would be equivalent to <a> <second = "2nd"> <first = "1st"> </a> It seems not to be support yet. On the whole, my impression is boost.serialize imposes some restrictions (orders for instance) that make sense to plain text files, but limits the buil-in flexibility that coming with xml.

3 3

Re: [Boost-users] [serialization] xml tag names and exceptions
by Ashley Smith 18 May '09

18 May '09

> AMDG > > Ashley Smith wrote: > >> Hi, I've been using boost for a while now and it's brilliant! :D >> >> Anyway, I'm using serialization in my code and was wondering why I was >> catching an exception where the what() reported "uninitialized >> exception". Eventually I worked it out (After much debugging) that I was >> catching the exception like this: >> >> } catch( std::exception & e ) { >> std::cout << e.what() << std::endl; >> >> I found out that my xml tags could not have namespace qualifiers in them >> (I.e. "blah::abc" would not work) and that it would throw a >> boost::archive::xml_archive_exception. This obviously didn't work with >> an std::exception and defaulted to an uninitialised exception. So my >> question is: am I catching the exceptions in the wrong way? Whats the >> right way? Should I use a more specific boost exception class? >> >> > > Can you catch xml_archive_exception instead of std::exception? > It almost sounds like the exception has been sliced. > > In Christ, > Steven Watanabe > Thanks for replying. Thats strange, it catches the boost::archive::xml_archive_exception, but it is still set as an uninitialized exception. I'm sure this is what is being thrown though. I think the source of the exception is in boost/archive/impl/basic_xml_oarchive.ipp Thanks

1 0

MPL if_ not following true branch
by Cory Nelson 18 May '09

18 May '09

This code doesn't seem to ever follow the true branch of the if_... it's like the eval_if is clobbering it. Can someone tell me what I'm doing wrong (other than not using a map.. this is a reduction of some other code that can't use a map)? #include <iostream> #include <typeinfo> #include <boost/mpl/if.hpp> #include <boost/mpl/eval_if.hpp> #include <boost/mpl/identity.hpp> #include <boost/type_traits/is_same.hpp> #include <boost/static_assert.hpp> template<typename T> struct choose_type { struct int_tag {}; struct float_tag {}; template<typename InvalidT> struct invalid_type_specified { BOOST_STATIC_ASSERT(sizeof(InvalidT) == 0); }; typedef typename boost::mpl::if_< boost::is_same<T, int>, int_tag, typename boost::mpl::eval_if< boost::is_same<T, float>, boost::mpl::identity<float_tag>, invalid_type_specified<T> >::type >::type type; }; int main() { std::cout << typeid(choose_type<int>::type).name() << std::endl; return 0; } -- Cory Nelson

2 1

boost compression
by einav_i2 18 May '09

18 May '09

Hi! Can anyone send an exmaple of a string to string compression (not file) using boost iostreams and gzip? Thanks, Einav -- View this message in context: http://www.nabble.com/boost-compression-tp23482602p23482602.html Sent from the Boost - Users mailing list archive at Nabble.com.

3 2

Re: [Boost-users] PropertyTree's XML parsers survey
by Tan, Tom (Shanghai) 18 May '09

18 May '09

>The serialization library has been using the spirit library >for parsing XML for years. This is for both utf-8 and wide characters >Robert Ramey Thanks for this info, I'll dig into that. Some quick questions though. There are two things that I prefer XML configurations to other formats: - I can manually edit the config file with other editors(notpad++, kate, gedit etc). However, different text editors may add additional BOM bytes(0xFFFE for UTF16LE, 0xFEFF for UTF16BE, 0xefbbbf for utf8) when saving back, does the serialization library detects them and ignore them when it sees them? - unlike JSON, I can embed comment nodes inside the XML to make it more readable, ex. , it this possible with boost.serialization?

1 0

[Boost] [Test] [1.38] "can't use testing tools before framework is initialized"
by Greg Christopher 18 May '09

18 May '09

Hi, I am trying to integrate boost.test into an existing test program with its own framework. Therefore I'd like to use that program's main. I am currently running into this runtime error when calling BOOST_WARN_MESSAGE(1, "string"). I have tried three different things to avoid this condition: 1) I declared a TEST_SUITE using the BOOST_AUTO_TEST_SUITE() and END() macros. Probably not what I want because I want my own main to keep control, but figured it would generate a main that would allow the initialization to happen. 2) I called init_unit_test_suite( argc, argv ). Even though it was called, I am still getting this. 3) I defined a cpp_main(). This never got called. I was hoping that the existence of this symbol would cause initialization to happen elsewhere. My desired control flow is to have this test program in control and to use the BOOST logging tools. I am trying to slip in boost.test with a minimum of changes to this program. I have hooked its logging function to call boost logging facilities instead; just can't get past this problem. Thanks for any help! Greg

1 0

[boost.filesystem] remove issue
by Sean Farrow 17 May '09

17 May '09

Hi: I am using the following code with boost.filesystem: size_t origsize = strlen(argv[0]) + 1; size_t convertedChars = 0; wchar_t wcstring[1024]; mbstowcs_s(&convertedChars, wcstring, origsize, argv[0], strlen(argv[0])); boost::filesystem::wpath path(wcstring); path.filename() =L"compilation date.txt"; if (boost::filesystem::exists(path)) // boost::filesystem::remove(path); I have defined: #define BOOST_FILESYSTEM_NO_DEPRECATED The line that causes probles is: // boost::filesystem::remove(path); Anyone got any ideas why this line causes a window error report to be generated. For reference I'm including: #include <stdlib.h> #include <fstream> #include <boost/date_time/gregorian/gregorian.hpp> #include <boost/filesystem/path.hpp> #include <boost/filesystem/operations.hpp> #include <string> Cheers Sean. __________ Information from ESET NOD32 Antivirus, version of virus signature database 4081 (20090517) __________ The message was checked by ESET NOD32 Antivirus. http://www.eset.com

2 3

[serialization] xml tag names and exceptions
by Ashley Smith 17 May '09

17 May '09

Hi, I've been using boost for a while now and it's brilliant! :D Anyway, I'm using serialization in my code and was wondering why I was catching an exception where the what() reported "uninitialized exception". Eventually I worked it out (After much debugging) that I was catching the exception like this: } catch( std::exception & e ) { std::cout << e.what() << std::endl; I found out that my xml tags could not have namespace qualifiers in them (I.e. "blah::abc" would not work) and that it would throw a boost::archive::xml_archive_exception. This obviously didn't work with an std::exception and defaulted to an uninitialised exception. So my question is: am I catching the exceptions in the wrong way? Whats the right way? Should I use a more specific boost exception class? Thank-you! - Ash

2 1

[statechart] Several questions
by Michael Crawford 17 May '09

17 May '09

I'm evaluating Boost.Statechart for possible use in a turn-based strategy type game. It's very promising so far, I just would just like a little clarification on a few things. 1. Is there a clean way to seperate the definition of a state from the definition of its initial inner state? Say we have // StatePlayGame.h #include "MyStateMachine.h" class StateGameStartup; class StatePlayGame : public boost::statechart::state<StatePlayGame, MyStateMachine, StateGameStartup> { //... }; // StateGameStartup.h #include "StatePlayGame.h" class StateGameStartup : public boost::statechart::state<StateGameStartup, StatePlayGame> { //... }; It appears that any translation unit that includes StatePlayGame.h also requires StateGameStartup.h in order to compile - obviously a less than ideal situation. 2. Is it possible to pass parameters to a state's constructor? Going with the little example above let's say that StateGameStartup asks the player how many enemies he wants to fight, and then transitions to StateGameRunning, which needs that number. Can it be passed by StateGameRunning's ctor or is it just required that states can only share information via their context? Cheers, MC

2 3

I can't build boost!
by Robert Dailey 17 May '09

17 May '09

What's going on? For some reason I can no longer build boost. I'm trying to build version 1.39 using bjam. The same command worked just fine on 1.38: D:\IT\personal\asl_editor\temp\boost_1_39_0>bjam --toolset=msvc --layout=system link=static threading=multi debug release stage

5 21

Trouble reinstalling boost
by Simon Pickles 17 May '09

17 May '09

Hi, I had a nice build system set up on my VM ubuntu 8.10 server until I broke the VM. :) After rebuild the VM I am obviously reinstalling all the packages. Boost Python is causing me trouble. I built it from svn using bjam, boost 1_40_0. I can compile my python extension without error but when I run it the python code that uses it, I get: ImportError: libboost_python-gcc43-d-1_40.so.1.40.0: cannot open shared object file: No such file or directory I have this file on my system, and have copied it to /usr/local/lib simon@fenixurth:~/WorkingCopies/server/extended$ locate libboost_python-gcc43-d-1_40.so.1.40.0 /home/simon/source/boost/bin.v2/libs/python/build/gcc-4.3.2/debug/libboost_python-gcc43-d-1_40.so.1.40.0 /home/simon/source/boost/stage/lib/libboost_python-gcc43-d-1_40.so.1.40.0 /home/simon/WorkingCopies/server/extended/libboost_python-gcc43-d-1_40.so.1.40.0 /usr/local/lib/libboost_python-gcc43-d-1_40.so.1.40.0 Why is this not found? Thanks Simon

3 2

[boost-users] istream_iterator question
by Max 17 May '09

17 May '09

Hello, I don't know why the following code does not work as expected. I hope the guru's here could lend me a hand. For a test data file: 3 1 2 3 4 5 6 2 1.2 4.3 234.2 3.5656 67.88 345.3 <eof> and 2 simple test helper class: struct a { int i, j; }; std::istream& operator>>(std::istream& in, a & p) { in >> p.i >> p.j; return in; } std::ostream& operator<<(std::ostream& out, const a & p) { out << p.i << " " << p.j; return out; } struct b { float i, j, k; }; std::istream& operator>>(std::istream& in, b & p) { in >> p.i >> p.j >> p.k; return in; } std::ostream& operator<<(std::ostream& out, const b & p) { out << p.i << " " << p.j << " " << p.k; return out; } Here is version 1, quite trivial and works just ok. std::ifstream is("./test.txt") int n; is >> n; std::cout << "n=" << n << "\n"; for(int i=0; i<n; i++) { a tmp; is >> tmp; va.push_back(tmp); } std::copy(va.begin(), va.end(), std::ostream_iterator<a>(std::cout, "\n")); is >> n; std::cout << "n=" << n << "\n"; for(int i=0; i<n; i++) { b tmp; is >> tmp; vb.push_back(tmp); } std::copy(vb.begin(), vb.end(), std::ostream_iterator<b>(std::cout, "\n")); The output is: n=3 1 2 3 4 5 6 n=2 1.2 4.3 234.2 3.5656 67.88 345.3 With version 2 using istream_iterator, the behavior is strange: is >> n; std::cout << "n=" << n << "\n"; std::copy_n(std::istream_iterator<a>(is), std::istream_iterator<a>(), n, std::back_inserter(va)); std::copy(va.begin(), va.end(), std::ostream_iterator<a>(std::cout, "\n")); is >> n; std::cout << "n=" << n << "\n"; std::copy_n(std::istream_iterator<b>(is), std::istream_iterator<b>(), n, std::back_inserter(vb)); std::copy(vb.begin(), vb.end(), std::ostream_iterator<b>(std::cout, "\n")); copy_n is defined as: template <class InputIterator, class Size, class OutputIterator> OutputIterator copy_n( InputIterator first, InputIterator last, Size n, OutputIterator result) { // copies the first `n' items from `first' to `result'. Returns // the value of `result' after inserting the `n' items. // it ends before n iterations, if the last iterator is reached while( n-- && first != last) { *result = *first; ++first; ++result; } return result; } The output is now: n=3 1 2 3 4 5 6 n=3 I've checked the code for several times and just not found the answer. I'm using VS2008SP1 on WinXP/SP1 Thanks for your help. B/Rgds Max

3 6

doc on how to generate pdf doc
by Maurizio Vitale 17 May '09

17 May '09

anybody can point me to documentation on how to generate boost documentation in pdf format for printing and off-line reading? the library I'm interested in (proto) has documentation in quickbook format and I haven't found anywhere documentation on how to generate pdf. Eric has been very nice and provided pdf for many versions in the vault, but I'd like to learn to do it myself. Thanks a lot, Maurizio

2 1

ASIO Tutorial 5 - Synchronising handlers in a multithreaded programs - Doesn't use both threads for processing
by mark 17 May '09

17 May '09

Using the code from http://www.boost.org/doc/libs/1_39_0/doc/html/boost_asio/tutorial/tuttimer5… with a few extra cout's for extra info. If you print out the thread IDs of at the start of print1 and print2 you'll see that both methods are actually using the same thread. ie two threads gets created but only one does any work. I'm printing the thread ID's via std::cout << "print1 " << boost::this_thread::get_id() << std::endl; std::cout << "print2 " << boost::this_thread::get_id() << std::endl; at the top of print 1 and print 2. I first noticed this when I was single line stepping through the code trying to work out how the second thread could possibly be doing anywork since t.join() is called after io.run(). Also if I comment out io.run() the program still works the same as before, except its the second thread doing all the processing. Compiler MSVC 9.0, happens on both debug and release.

2 1

multi-array data ownership
by gtsml owevwr 16 May '09

16 May '09

Hi, I want to use multi-array but the original data is coming from, let say, a std::vector<float>. The data is quite big, do I need to copy it into a multi-array? Or maybe I can use a "view" as a proxy on top of the original data and therefore avoid a costly copy? Thanks, Frank

2 2

[accumulators] density: empty values
by Robert Kubrick 16 May '09

16 May '09

I have the following program: #include <iostream> #include <boost/accumulators/accumulators.hpp> #include <boost/accumulators/statistics/stats.hpp> #include <boost/accumulators/statistics/density.hpp> using namespace boost; using namespace boost::accumulators; int main() { typedef iterator_range<std::vector<std::pair<double, double> >::iterator > histogram_type; accumulator_set<double, features<tag::density> > acc(tag::density::num_bins = 20, tag::density::cache_size = 10); // push in some data ... acc(0.1); acc(1.2); acc(2.3); acc(3.4); acc(4.5); acc(5.4); acc(5.5); acc(5.5); acc(10); // Display the results ... histogram_type hist = density(acc); for( int i = 0; i < hist.size(); i++ ) std::cout << "Bin lower bound: " << hist[i].first << ", Value: " << hist[i].second << std::endl; return 0; } Bin values and indexes don't seem to be initialized: $ acc_dist Bin lower bound: 0, Value: 0 Bin lower bound: 0, Value: 0 Bin lower bound: 0, Value: 0 Bin lower bound: 0, Value: 0 Bin lower bound: 0, Value: 0 Bin lower bound: 0, Value: 0 ...

3 5

Range checked variable or class
by Ryan McConnehey 16 May '09

16 May '09

Is there a boost library or utility that can create a variable with a maximum and minimum acceptable value? Ryan

3 3

intrusive::slist, MPL, Sun CC
by Chris Hite 16 May '09

16 May '09

intrusive::slist work with Sun CC? I notice that it uses some MPL. Does MPL generally not work with Sun CC? CC: Sun C++ 5.9 SunOS_sparc Patch 124863-12 2009/04/21 CC -I/development/tango/current/misc/boost/boost_1_39_0/SunOS/include/boost-1_39 -c test.cxx -o test.o test.cxx: Christopher Hite RTS Realtime Systems Software GmbH, Rembrandtstrasse 13, D-60596 Frankfurt am Main T: +49.69.61009.0 / F: +49.69.61009.181 Sitz: Frankfurt am Main - HRB 84467 Amtsgericht Frankfurt am Main Geschäftsführer: Steffen Gemuenden, Igor Sluga www.rtsgroup.net This email and any attachments are for the exclusive and confidential use of the intended recipient. If you are not the intended recipient, or an employee or agent responsible for delivering this message to the intended recipient, please do not read, distribute or take action in reliance upon this message. If you have received this in error, please notify me immediately by return email and promptly delete this message and its attachments from your computer system. ------------------------------------------------------- #include <boost/intrusive/slist.hpp> using namespace boost::intrusive; struct CalcEntry: public slist_base_hook<none,none,none> {}; void foo(){ typedef slist<CalcEntry,cache_last<true> > CalcList; CalcList _calcList; } ------------------------------------------------------- "/development/tango/current/misc/boost/boost_1_39_0/SunOS/include/boost-1_39/boost/intrusive/slist.hpp", line 121: Error: pointer is not a member of boost::intrusive::detail::generic_hook<boost::intrusive::get_slist_node_algo<void*>, boost::intrusive::default_tag, 1, 2>. "/development/tango/current/misc/boost/boost_1_39_0/SunOS/include/boost-1_39/boost/intrusive/slist.hpp", line 1943: Where: While specializing "boost::intrusive::slist_impl<boost::intrusive::slistopt<boost::intrusive::detail::generic_hook<boost::intrusive::get_slist_node_algo<void*>, boost::intrusive::default_tag, 1, 2>, unsigned, 1, 0, 1>>". "/development/tango/current/misc/boost/boost_1_39_0/SunOS/include/boost-1_39/boost/intrusive/slist.hpp", line 1943: Where: Specialized in boost::intrusive::slist<CalcEntry, boost::intrusive::cache_last<1>, boost::intrusive::none, boost::intrusive::none, boost::intrusive::none, boost::intrusive::none>. "test.cxx", line 9: Where: Specialized in non-template code. "/development/tango/current/misc/boost/boost_1_39_0/SunOS/include/boost-1_39/boost/intrusive/slist.hpp", line 122: Error: const_pointer is not a member of boost::intrusive::detail::generic_hook<boost::intrusive::get_slist_node_algo<void*>, boost::intrusive::default_tag, 1, 2>. "/development/tango/current/misc/boost/boost_1_39_0/SunOS/include/boost-1_39/boost/intrusive/slist.hpp", line 1943: Where: While specializing "boost::intrusive::slist_impl<boost::intrusive::slistopt<boost::intrusive::detail::generic_hook<boost::intrusive::get_slist_node_algo<void*>, boost::intrusive::default_tag, 1, 2>, unsigned, 1, 0, 1>>". "/development/tango/current/misc/boost/boost_1_39_0/SunOS/include/boost-1_39/boost/intrusive/slist.hpp", line 1943: Where: Specialized in boost::intrusive::slist<CalcEntry, boost::intrusive::cache_last<1>, boost::intrusive::none, boost::intrusive::none, boost::intrusive::none, boost::intrusive::none>. "test.cxx", line 9: Where: Specialized in non-template code. "/development/tango/current/misc/boost/boost_1_39_0/SunOS/include/boost-1_39/boost/intrusive/slist.hpp", line 123: Error: iterator_traits is not a member of std. "/development/tango/current/misc/boost/boost_1_39_0/SunOS/include/boost-1_39/boost/intrusive/slist.hpp", line 1943: Where: While specializing "boost::intrusive::slist_impl<boost::intrusive::slistopt<boost::intrusive::detail::generic_hook<boost::intrusive::get_slist_node_algo<void*>, boost::intrusive::default_tag, 1, 2>, unsigned, 1, 0, 1>>". "/development/tango/current/misc/boost/boost_1_39_0/SunOS/include/boost-1_39/boost/intrusive/slist.hpp", line 1943: Where: Specialized in boost::intrusive::slist<CalcEntry, boost::intrusive::cache_last<1>, boost::intrusive::none, boost::intrusive::none, boost::intrusive::none, boost::intrusive::none>. "test.cxx", line 9: Where: Specialized in non-template code. "/development/tango/current/misc/boost/boost_1_39_0/SunOS/include/boost-1_39/boost/intrusive/slist.hpp", line 123: Error: A declaration does not specify a tag or an identifier. ......

3 2

Compile problems with instrusive::slist::push_back
by Johannes Gajdosik 16 May '09

16 May '09

From this piece of code ---------------------------------------- #include <boost/intrusive/slist.hpp> class Node : public boost::intrusive::slist_base_hook<> { public: Node(int x) : x(x) {} int x; }; typedef boost::intrusive::slist<Node> List; int main(int argc,char *argv[]) { List list; Node n1(1234); Node n2(5678); list.push_front(n1); list.push_back(n2); return 0; } ------------------------------------------ I get the following error: johannes@pc1:~/Progs/Components/Boost> g++ IntrusiveTest1.C -Iboost_1_39_0 boost_1_39_0/boost/intrusive/slist.hpp: In member function 'void boost::intrusive::slist_impl<Config>::push_back(typename std::iterator_traits<typename boost::intrusive::detail::eval_if_c<boost::intrusive::slist_impl<Config>::external_value_traits, boost::intrusive::detail::eval_value_traits<typename Config::value_traits>, boost::intrusive::detail::identity<typename Config::value_traits> >::type::pointer>::reference) [with Config = boost::intrusive::slistopt<boost::intrusive::detail::base_hook_traits<Node, boost::intrusive::slist_node_traits<void*>, safe_link, boost::intrusive::default_tag, 2>, long unsigned int, true, false, false>]': IntrusiveTest1.C:16: instantiated from here false>boost_1_39_0/boost/intrusive/slist.hpp:382: error: invalid false>application of 'sizeof' to incomplete type false>'boost::STATIC_ASSERTION_FAILURE<false>' IntrusiveTest1.C:16: false>instantiated from here false>boost_1_39_0/boost/intrusive/slist.hpp:382: error: invalid false>application of 'sizeof' to incomplete type false>'boost::STATIC_ASSERTION_FAILURE<false>' This is boost_1_39_0. I use operating system johannes@pc1:~/Progs/Components/Boost> uname -a Linux pc1 2.6.22.19 #1 PREEMPT Fri Apr 10 00:41:29 CEST 2009 x86_64 AMD Athlon(tm) 64 Processor 3000+ AuthenticAMD GNU/Linux and compiler gcc version 4.3.2 (Gentoo 4.3.2-r3 p1.6, pie-10.1.5) I cannot understand, why list.push_front(n1) compiles, while list.push_back(n2) fails to compile. Thanks in advance for your help. Yours, Johannes Gajdosik

3 2

Re: [Boost-users] iterators must go
by John Dlugosz 15 May '09

15 May '09

> Date: Wed, 13 May 2009 02:18:07 -0400 > From: Scott McMurray <me22.ca+boost(a)gmail.com> > Subject: Re: [Boost-users] iterators must go > To: boost-users(a)lists.boost.org > Message-ID: > <fa28b9250905122318s3460e1dam5d624160d95ced5(a)mail.gmail.com> > Content-Type: text/plain; charset=UTF-8 > > On Sun, May 10, 2009 at 09:24, Neal Becker <ndbecker2(a)gmail.com> wrote: > > Interesting presentation: > > > > http://www.boostcon.com/site- > > media/var/sphene/sphwiki/attachment/2009/05/08/iterators-must-go.pdf > > > > Very persuasive, but it's careful to touch only the examples that look > nice. Note, for example, that every range was a whole container. > > The three-iterators part was somewhat handwaved-over as well. Take > this bit of current code, for example: > > auto i = find(c.begin(), c.end(), some_pred()); > rotate(c.begin(), i, c.end()); > > How do you do that nicely with ranges, when he has find returning a > range? (Since right now, it implicitly actually returns 2 ranges.) > > And how does insertion work? Do we still need to keep the iterators > around for insertion position? > > I'd love to see the finicky bits worked out, though, since I do like > the idea. > > ~ Scott Any place you really want a single iterator, a range of one value would work. For appending or streaming out, you really want the concept of an open-ended range. --John TradeStation Group, Inc. is a publicly-traded holding company (NASDAQ GS: TRAD) of three operating subsidiaries, TradeStation Securities, Inc. (Member NYSE, FINRA, SIPC and NFA), TradeStation Technologies, Inc., a trading software and subscription company, and TradeStation Europe Limited, a United Kingdom, FSA-authorized introducing brokerage firm. None of these companies provides trading or investment advice, recommendations or endorsements of any kind. The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon, this information by persons or entities other than the intended recipient is prohibited. If you received this in error, please contact the sender and delete the material from any computer.

4 3

Re: [Boost-users] iterators must go
by John Dlugosz 15 May '09

15 May '09

> I think a ranges can be used as insertion positions. The element could > be inserted just before or after the start of the range. The details > have to be worked out, like if it's before or after, and if it's > before, > if the range grows to include the element. I thought that Boost has ranges for some time, and the upcoming C++ standard incorporates them. So, haven't the details *been* worked out? --John TradeStation Group, Inc. is a publicly-traded holding company (NASDAQ GS: TRAD) of three operating subsidiaries, TradeStation Securities, Inc. (Member NYSE, FINRA, SIPC and NFA), TradeStation Technologies, Inc., a trading software and subscription company, and TradeStation Europe Limited, a United Kingdom, FSA-authorized introducing brokerage firm. None of these companies provides trading or investment advice, recommendations or endorsements of any kind. The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon, this information by persons or entities other than the intended recipient is prohibited. If you received this in error, please contact the sender and delete the material from any computer.

2 1

Boost.Regex 1.39.0: Crash in boost::sub_match::str()
by Peter Klotz 15 May '09

15 May '09

The program below crashes when compiled and executed in Windows using MSVC8. The crash happens in boost::sub_match::str(). It seems that the internal structure m_subs gets somehow corrupted. The crash disappears when passing the const reference fileName instead of it->path().filename(). I have no idea why this should make any difference. The program expects a directory on the command line. Just put an empty file called "AAA-0.txt" in this directory. Any help is appreciated. Regards, Peter. #include <iostream> #include <boost/filesystem/path.hpp> #include <boost/filesystem/convenience.hpp> #include <boost/regex.hpp> int main(int argc, char** argv) { try { if (argc==2) { const boost::filesystem::path p(argv[1]); const boost::regex regEx("^([A-Za-z0-9_]+)-(.*)\\.txt$"); boost::smatch match; for (boost::filesystem::directory_iterator it(p);it!=boost::filesystem::directory_iterator();++it) { const std::string& fileName=it->path().filename(); if (boost::regex_match(it->path().filename(),match,regEx)) // <- using fileName makes the crash disappear { const std::string projectName=match.str(1); // <- here it crashes } } // for return 0; } } catch (const std::exception& e) { std::cout << e.what() << std::endl; } return 1; }

3 2

Re: [Boost-users] How to print from C++ to the same stream as Python's 'print' does?
by John Dlugosz 15 May '09

15 May '09

> Date: Wed, 13 May 2009 06:19:20 -0500 > From: Early Ehlinger <earlye(a)gmail.com> > Subject: Re: [Boost-users] (Boost.Python) How to print from C++ to the > same stream as Python's 'print' does? > To: boost-users(a)lists.boost.org > Message-ID: > <5922b0d30905130419x3d030f24s948b15cfd42d91f(a)mail.gmail.com> > Content-Type: text/plain; charset="iso-8859-1" > Can you ask Python to give you the underlying OS or C standard library handle? Then you can create a C++ ofstream around that. --John TradeStation Group, Inc. is a publicly-traded holding company (NASDAQ GS: TRAD) of three operating subsidiaries, TradeStation Securities, Inc. (Member NYSE, FINRA, SIPC and NFA), TradeStation Technologies, Inc., a trading software and subscription company, and TradeStation Europe Limited, a United Kingdom, FSA-authorized introducing brokerage firm. None of these companies provides trading or investment advice, recommendations or endorsements of any kind. The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon, this information by persons or entities other than the intended recipient is prohibited. If you received this in error, please contact the sender and delete the material from any computer.

1 0

Re: [Boost-users] thread-safe ref-counted objects
by John Dlugosz 15 May '09

15 May '09

> Date: Tue, 12 May 2009 19:17:47 +0300 > From: Igor R <boost.lists(a)gmail.com> > Subject: [Boost-users] [boost-users][signals2] thread-safe > disconnection for intrusively ref-counted objects > To: boost-users(a)lists.boost.org > Message-ID: > <cfe0a3cf0905120917u55751463i566d0e96b420c011(a)mail.gmail.com> > Content-Type: text/plain; charset=UTF-8 > > Is there any trick or customization that would allow the subj? > I mean the following situation: > I have a set of reference-counting pointer classes that are designed specifically for cross-thread use. It *expects* to be incremented and decremented on different threads at the same time. <http://github.com/jdlugosz/repertoire> <http://www.dlugosz.com/Repertoire/refman/Classics/Smart%20Pointers%20Ov erview.html#toptop> probably doesn't tell you anything you don't already know, since it was just assumed that everything would be thread-safe and doesn't consider that an "issue". <http://www.dlugosz.com/Repertoire/refman/Classics/handle_guide.html#thr eads> goes over the thread features. Feel free to abscond with or borrow any of the code or ideas therein, if it helps you. --John (sorry about the footer; not my choice) TradeStation Group, Inc. is a publicly-traded holding company (NASDAQ GS: TRAD) of three operating subsidiaries, TradeStation Securities, Inc. (Member NYSE, FINRA, SIPC and NFA), TradeStation Technologies, Inc., a trading software and subscription company, and TradeStation Europe Limited, a United Kingdom, FSA-authorized introducing brokerage firm. None of these companies provides trading or investment advice, recommendations or endorsements of any kind. The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon, this information by persons or entities other than the intended recipient is prohibited. If you received this in error, please contact the sender and delete the material from any computer.

1 0

Nominate Boost for SourceForge Community Choice Awards 2009
by joaquin＠tid.es 15 May '09

15 May '09

Hello, SourceForge Community Choice Awards 2009 is open for nominations: http://sourceforge.net/community/cca09/ You can nominate Boost by following this link http://tinyurl.com/ogao6x Personally, I nominated for categories "Best Project" and "Best Tool or Utility for Developers". Please spread the word! Best regards, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

PropertyTree's XML parsers survey
by Tan, Tom (Shanghai) 15 May '09

15 May '09

>From: Sebastian Redl <sebastian.redl(a)getdesigned.at> > >Hi, > >PropertyTree currently has 5 (five!) different xml readers using 4 >different parsers. I don't want to maintain them all. Looking at the >open tickets for PT shows that most bugs occur in the various xml >readers, and there's no point in having more than one. > >I just wonder which one to keep. To those who use PropertyTree's XML >format, which parser do you use? Do you have any experience with the >pros and cons of the various parsers? > >All feedback is highly appreciated. I had some experience with RapidXml managing the settings of my not a long time ago. Pro: - the API interfaces are STL-like, easy to use - header only Con: - ANSI only in practice - buggy in supporting wstring, and UNICODE. I ended up implementing my own version supporting UTF-16LE for Windows only based on RapidXml V1.11. The most wanted XML parser/writer feature for me is the support of wide-char(UTF16) version of UNICODE, rather than UTF8. It seems no light-weight XML library does it well.

2 1

[PATCH] Shadow Variables and Unused Globals Cause Warnings/Errors When Headers Are Not in System Path
by Grant Erickson 15 May '09

15 May '09

I've recently added Boost to an Xcode 3.1.2 project with the following warnings enabled in GCC/G++ 4.0.1: -Werror -Wreturn-type -Wunused-function -Wunused-label -Wunused-variable -Wshadow Unfortunately, when boost is not installed in a "system" path as is the case here. Unused and shadow variable warnings cause the build to fail when warnings are treated as errors. This issue last come up for me about a year ago in 1_35_0 with filesystem.hpp: http://article.gmane.org/gmane.comp.lib.boost.user/38297/match=shadow+variab les+cause The included headers this time are: boost/accumulators/accumulators.hpp boost/accumulators/statistics/stats.hpp boost/accumulators/statistics/rolling_mean.hpp To test and fix, I isolated with: printf "#include <${BoostHeader}>\nint main(void) { return 0; }" | /Developer/usr/bin/gcc-4.0 -x c++ -Wall -Wshadow -Werror -o test -I${BoostRoot}/boost/include - The patch to address this is as follows and impacts the headers below: boost/accumulators/framework/accumulator_set.hpp boost/accumulators/framework/accumulators/droppable_accumulator.hpp boost/accumulators/statistics/rolling_mean.hpp boost/accumulators/statistics/rolling_window.hpp boost/accumulators/statistics_fwd.hpp boost/circular_buffer/base.hpp boost/circular_buffer/details.hpp boost/circular_buffer/space_optimized.hpp boost/fusion/container/list/cons.hpp boost/fusion/container/list/cons_iterator.hpp boost/fusion/container/vector/vector_iterator.hpp boost/fusion/view/filter_view/filter_view.hpp boost/fusion/view/filter_view/filter_view_iterator.hpp boost/fusion/view/iterator_range/iterator_range.hpp boost/fusion/view/joint_view/joint_view.hpp boost/fusion/view/joint_view/joint_view_iterator.hpp boost/fusion/view/single_view/single_view.hpp boost/parameter/aux_/arg_list.hpp boost/parameter/aux_/maybe.hpp Because this problem seems to come up frequently, perhaps there is a way -Wshadow and -Wall can be forced for all unit tests? Signed-off-by: Grant Erickson <gerickson(a)nuovations.com> --- --- a/boost/accumulators/framework/accumulator_set.hpp 2008-06-20 09:01:50.000000000 -0700 +++ b/boost/accumulators/framework/accumulator_set.hpp 2009-05-14 13:27:51.000000000 -0700 @@ -42,8 +42,8 @@ template<typename Args> struct accumulator_visitor { - explicit accumulator_visitor(Args const &args) - : args(args) + explicit accumulator_visitor(Args const &in_args) + : args(in_args) { } --- a/boost/accumulators/framework/accumulators/droppable_accumulator.hpp 2008-06-19 20:47:42.000000000 -0700 +++ b/boost/accumulators/framework/accumulators/droppable_accumulator.hpp 2009-05-14 13:23:19.000000000 -0700 @@ -218,9 +218,9 @@ private: with_cached_result &operator =(with_cached_result const &); - void set(result_type const &result) + void set(result_type const &in_result) { - ::new(this->cache.address()) result_type(result); + ::new(this->cache.address()) result_type(in_result); } result_type const &get() const --- a/boost/accumulators/statistics/rolling_mean.hpp 2008-12-30 11:30:45.000000000 -0800 +++ b/boost/accumulators/statistics/rolling_mean.hpp 2009-05-14 13:33:12.000000000 -0700 @@ -69,7 +69,7 @@ // namespace extract { - extractor<tag::rolling_mean> const rolling_mean = {}; + extern extractor<tag::rolling_mean> const rolling_mean = {}; } using extract::rolling_mean; --- a/boost/accumulators/statistics/rolling_window.hpp 2008-12-30 11:30:45.000000000 -0800 +++ b/boost/accumulators/statistics/rolling_window.hpp 2009-05-14 13:32:57.000000000 -0700 @@ -153,8 +153,8 @@ // namespace extract { - extractor<tag::rolling_window_plus1> const rolling_window_plus1 = {}; - extractor<tag::rolling_window> const rolling_window = {}; + extern extractor<tag::rolling_window_plus1> const rolling_window_plus1 = {}; + extern extractor<tag::rolling_window> const rolling_window = {}; } using extract::rolling_window_plus1; --- a/boost/accumulators/statistics_fwd.hpp 2008-12-30 11:30:45.000000000 -0800 +++ b/boost/accumulators/statistics_fwd.hpp 2009-05-14 13:31:22.000000000 -0700 @@ -30,7 +30,7 @@ } namespace extract { - extractor<tag::quantile> const quantile = {}; + extern extractor<tag::quantile> const quantile = {}; } using extract::quantile; @@ -46,7 +46,7 @@ } namespace extract { - extractor<tag::tail_mean> const tail_mean = {}; + extern extractor<tag::tail_mean> const tail_mean = {}; } using extract::tail_mean; --- a/boost/circular_buffer/base.hpp 2008-08-18 01:54:04.000000000 -0700 +++ b/boost/circular_buffer/base.hpp 2009-05-14 13:38:46.000000000 -0700 @@ -1006,9 +1006,9 @@ \par Complexity Constant. */ - explicit circular_buffer(capacity_type capacity, const allocator_type& alloc = allocator_type()) + explicit circular_buffer(capacity_type in_capacity, const allocator_type& alloc = allocator_type()) : m_size(0), m_alloc(alloc) { - initialize_buffer(capacity); + initialize_buffer(in_capacity); m_first = m_last = m_buff; } @@ -1046,13 +1046,13 @@ \par Complexity Linear (in the <code>n</code>). */ - circular_buffer(capacity_type capacity, size_type n, param_value_type item, + circular_buffer(capacity_type in_capacity, size_type n, param_value_type item, const allocator_type& alloc = allocator_type()) : m_size(n), m_alloc(alloc) { - BOOST_CB_ASSERT(capacity >= size()); // check for capacity lower than size - initialize_buffer(capacity, item); + BOOST_CB_ASSERT(in_capacity >= size()); // check for capacity lower than size + initialize_buffer(in_capacity, item); m_first = m_buff; - m_last = capacity == n ? m_buff : m_buff + n; + m_last = in_capacity == n ? m_buff : m_buff + n; } //! The copy constructor. @@ -1145,10 +1145,10 @@ <a href="http://www.sgi.com/tech/stl/RandomAccessIterator.html">RandomAccessIte rator</a>). */ template <class InputIterator> - circular_buffer(capacity_type capacity, InputIterator first, InputIterator last, + circular_buffer(capacity_type in_capacity, InputIterator first, InputIterator last, const allocator_type& alloc = allocator_type()) : m_alloc(alloc) { - initialize(capacity, first, last, is_integral<InputIterator>()); + initialize(in_capacity, first, last, is_integral<InputIterator>()); } #endif // #if BOOST_WORKAROUND(BOOST_MSVC, < 1300) @@ -1260,9 +1260,9 @@ assign(size_type, const_reference)\endlink</code>, <code>assign(InputIterator, InputIterator)</code>, <code>assign(capacity_type, InputIterator, InputIterator)</code> */ - void assign(capacity_type capacity, size_type n, param_value_type item) { - BOOST_CB_ASSERT(capacity >= n); // check for new capacity lower than n - assign_n(capacity, n, cb_details::assign_n<param_value_type, allocator_type>(n, item, m_alloc)); + void assign(capacity_type in_capacity, size_type n, param_value_type item) { + BOOST_CB_ASSERT(in_capacity >= n); // check for new capacity lower than n + assign_n(in_capacity, n, cb_details::assign_n<param_value_type, allocator_type>(n, item, m_alloc)); } //! Assign a copy of the range into the <code>circular_buffer</code>. @@ -1333,8 +1333,8 @@ <code>assign(InputIterator, InputIterator)</code> */ template <class InputIterator> - void assign(capacity_type capacity, InputIterator first, InputIterator last) { - assign(capacity, first, last, is_integral<InputIterator>()); + void assign(capacity_type in_capacity, InputIterator first, InputIterator last) { + assign(in_capacity, first, last, is_integral<InputIterator>()); } //! Swap the contents of two <code>circular_buffer</code>s. @@ -2079,14 +2079,14 @@ } //! Initialize the internal buffer. - void initialize_buffer(capacity_type capacity) { - m_buff = allocate(capacity); - m_end = m_buff + capacity; + void initialize_buffer(capacity_type in_capacity) { + m_buff = allocate(in_capacity); + m_end = m_buff + in_capacity; } //! Initialize the internal buffer. - void initialize_buffer(capacity_type capacity, param_value_type item) { - initialize_buffer(capacity); + void initialize_buffer(capacity_type in_capacity, param_value_type item) { + initialize_buffer(in_capacity); BOOST_TRY { cb_details::uninitialized_fill_n_with_alloc(m_buff, size(), item, m_alloc); } BOOST_CATCH(...) { @@ -2135,35 +2135,35 @@ //! Specialized initialize method. template <class IntegralType> - void initialize(capacity_type capacity, IntegralType n, IntegralType item, const true_type&) { - BOOST_CB_ASSERT(capacity >= static_cast<size_type>(n)); // check for capacity lower than n + void initialize(capacity_type in_capacity, IntegralType n, IntegralType item, const true_type&) { + BOOST_CB_ASSERT(in_capacity >= static_cast<size_type>(n)); // check for capacity lower than n m_size = static_cast<size_type>(n); - initialize_buffer(capacity, item); + initialize_buffer(in_capacity, item); m_first = m_buff; - m_last = capacity == size() ? m_buff : m_buff + size(); + m_last = in_capacity == size() ? m_buff : m_buff + size(); } //! Specialized initialize method. template <class Iterator> - void initialize(capacity_type capacity, Iterator first, Iterator last, const false_type&) { + void initialize(capacity_type in_capacity, Iterator first, Iterator last, const false_type&) { BOOST_CB_IS_CONVERTIBLE(Iterator, value_type); // check for invalid iterator type #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x581)) - initialize(capacity, first, last, BOOST_ITERATOR_CATEGORY<Iterator>::type()); + initialize(in_capacity, first, last, BOOST_ITERATOR_CATEGORY<Iterator>::type()); #else - initialize(capacity, first, last, BOOST_DEDUCED_TYPENAME BOOST_ITERATOR_CATEGORY<Iterator>::type()); + initialize(in_capacity, first, last, BOOST_DEDUCED_TYPENAME BOOST_ITERATOR_CATEGORY<Iterator>::type()); #endif } //! Specialized initialize method. template <class InputIterator> - void initialize(capacity_type capacity, + void initialize(capacity_type in_capacity, InputIterator first, InputIterator last, const std::input_iterator_tag&) { - initialize_buffer(capacity); + initialize_buffer(in_capacity); m_first = m_last = m_buff; m_size = 0; - if (capacity == 0) + if (in_capacity == 0) return; while (first != last && !full()) { m_alloc.construct(m_last, *first++); @@ -2179,32 +2179,32 @@ //! Specialized initialize method. template <class ForwardIterator> - void initialize(capacity_type capacity, + void initialize(capacity_type in_capacity, ForwardIterator first, ForwardIterator last, const std::forward_iterator_tag&) { BOOST_CB_ASSERT(std::distance(first, last) >= 0); // check for wrong range - initialize(capacity, first, last, std::distance(first, last)); + initialize(in_capacity, first, last, std::distance(first, last)); } //! Initialize the circular buffer. template <class ForwardIterator> - void initialize(capacity_type capacity, + void initialize(capacity_type in_capacity, ForwardIterator first, ForwardIterator last, size_type distance) { - initialize_buffer(capacity); + initialize_buffer(in_capacity); m_first = m_buff; - if (distance > capacity) { - std::advance(first, distance - capacity); - m_size = capacity; + if (distance > in_capacity) { + std::advance(first, distance - in_capacity); + m_size = in_capacity; } else { m_size = distance; } BOOST_TRY { m_last = cb_details::uninitialized_copy_with_alloc(first, last, m_buff, m_alloc); } BOOST_CATCH(...) { - deallocate(m_buff, capacity); + deallocate(m_buff, in_capacity); BOOST_RETHROW } BOOST_CATCH_END --- a/boost/circular_buffer/details.hpp 2008-08-20 09:13:07.000000000 -0700 +++ b/boost/circular_buffer/details.hpp 2009-05-14 13:39:23.000000000 -0700 @@ -146,9 +146,9 @@ public: //! Constructor. - capacity_control(Size capacity, Size min_capacity = 0) - : m_capacity(capacity), m_min_capacity(min_capacity) { - BOOST_CB_ASSERT(capacity >= min_capacity); // check for capacity lower than min_capacity + capacity_control(Size in_capacity, Size in_min_capacity = 0) + : m_capacity(in_capacity), m_min_capacity(in_min_capacity) { + BOOST_CB_ASSERT(in_capacity >= in_min_capacity); // check for capacity lower than min_capacity } // Default copy constructor. --- a/boost/circular_buffer/space_optimized.hpp 2008-08-18 01:54:04.000000000 -0700 +++ b/boost/circular_buffer/space_optimized.hpp 2009-05-14 13:33:40.000000000 -0700 @@ -1229,8 +1229,8 @@ } //! Ensure the reserve for possible growth up. - size_type ensure_reserve(size_type new_capacity, size_type size) const { - if (size + new_capacity / 5 >= new_capacity) + size_type ensure_reserve(size_type new_capacity, size_type in_size) const { + if (in_size + new_capacity / 5 >= new_capacity) new_capacity *= 2; // ensure at least 20% reserve if (new_capacity > m_capacity_ctrl) return m_capacity_ctrl; --- a/boost/fusion/container/list/cons.hpp 2007-11-25 10:07:19.000000000 -0800 +++ b/boost/fusion/container/list/cons.hpp 2009-05-14 13:22:20.000000000 -0700 @@ -69,13 +69,13 @@ cons() : car(), cdr() {} - explicit cons(typename detail::call_param<Car>::type car) - : car(car), cdr() {} + explicit cons(typename detail::call_param<Car>::type in_car) + : car(in_car), cdr() {} cons( - typename detail::call_param<Car>::type car - , typename detail::call_param<Cdr>::type cdr) - : car(car), cdr(cdr) {} + typename detail::call_param<Car>::type in_car + , typename detail::call_param<Cdr>::type in_cdr) + : car(in_car), cdr(in_cdr) {} template <typename Car2, typename Cdr2> cons(cons<Car2, Cdr2> const& rhs) --- a/boost/fusion/container/list/cons_iterator.hpp 2007-11-25 10:07:19.000000000 -0800 +++ b/boost/fusion/container/list/cons_iterator.hpp 2009-05-14 13:21:41.000000000 -0700 @@ -35,8 +35,8 @@ typename add_const<Cons>::type> identity; - explicit cons_iterator(cons_type& cons) - : cons(cons) {} + explicit cons_iterator(cons_type& in_cons) + : cons(in_cons) {} cons_type& cons; }; --- a/boost/fusion/container/vector/vector_iterator.hpp 2007-11-25 10:07:19.000000000 -0800 +++ b/boost/fusion/container/vector/vector_iterator.hpp 2009-05-14 13:17:57.000000000 -0700 @@ -36,8 +36,8 @@ typedef vector_iterator_identity< typename add_const<Vector>::type, N> identity; - vector_iterator(Vector& vec) - : vec(vec) {} + vector_iterator(Vector& in_vec) + : vec(in_vec) {} Vector& vec; }; }} --- a/boost/fusion/view/filter_view/filter_view.hpp 2007-11-25 10:07:19.000000000 -0800 +++ b/boost/fusion/view/filter_view/filter_view.hpp 2009-05-14 13:27:21.000000000 -0700 @@ -36,8 +36,8 @@ typedef typename result_of::end<Sequence>::type last_type; typedef Pred pred_type; - filter_view(Sequence& seq) - : seq(seq) + filter_view(Sequence& in_seq) + : seq(in_seq) {} first_type first() const { return fusion::begin(seq); } --- a/boost/fusion/view/filter_view/filter_view_iterator.hpp 2007-11-25 10:07:19.000000000 -0800 +++ b/boost/fusion/view/filter_view/filter_view_iterator.hpp 2009-05-14 13:27:03.000000000 -0700 @@ -36,8 +36,8 @@ typedef last_iter last_type; typedef Pred pred_type; - filter_iterator(First const& first) - : first(filter::call(first_converter::call(first))) {} + filter_iterator(First const& in_first) + : first(filter::call(first_converter::call(in_first))) {} first_type first; }; --- a/boost/fusion/view/iterator_range/iterator_range.hpp 2007-11-25 10:07:19.000000000 -0800 +++ b/boost/fusion/view/iterator_range/iterator_range.hpp 2009-05-14 13:20:41.000000000 -0700 @@ -36,9 +36,9 @@ typedef typename traits::category_of<begin_type>::type category; - iterator_range(First const& first, Last const& last) - : first(convert_iterator<First>::call(first)) - , last(convert_iterator<Last>::call(last)) {} + iterator_range(First const& in_first, Last const& in_last) + : first(convert_iterator<First>::call(in_first)) + , last(convert_iterator<Last>::call(in_last)) {} begin_type first; end_type last; --- a/boost/fusion/view/joint_view/joint_view.hpp 2007-11-25 10:07:19.000000000 -0800 +++ b/boost/fusion/view/joint_view/joint_view.hpp 2009-05-14 13:19:35.000000000 -0700 @@ -40,9 +40,9 @@ typedef typename result_of::end<Sequence2>::type concat_last_type; typedef typename mpl::plus<result_of::size<Sequence1>, result_of::size<Sequence2> >::type size; - joint_view(Sequence1& seq1, Sequence2& seq2) - : seq1(seq1) - , seq2(seq2) + joint_view(Sequence1& in_seq1, Sequence2& in_seq2) + : seq1(in_seq1) + , seq2(in_seq2) {} first_type first() const { return fusion::begin(seq1); } --- a/boost/fusion/view/joint_view/joint_view_iterator.hpp 2007-11-25 10:07:19.000000000 -0800 +++ b/boost/fusion/view/joint_view/joint_view_iterator.hpp 2009-05-14 13:18:46.000000000 -0700 @@ -37,9 +37,9 @@ typedef forward_traversal_tag category; BOOST_STATIC_ASSERT((!result_of::equal_to<first_type, last_type>::value)); - joint_view_iterator(First const& first, Concat const& concat) - : first(first_converter::call(first)) - , concat(concat_converter::call(concat)) + joint_view_iterator(First const& in_first, Concat const& in_concat) + : first(first_converter::call(in_first)) + , concat(concat_converter::call(in_concat)) {} first_type first; --- a/boost/fusion/view/single_view/single_view.hpp 2007-11-25 10:07:19.000000000 -0800 +++ b/boost/fusion/view/single_view/single_view.hpp 2009-05-14 13:21:08.000000000 -0700 @@ -35,8 +35,8 @@ single_view() : val() {} - explicit single_view(typename detail::call_param<T>::type val) - : val(val) {} + explicit single_view(typename detail::call_param<T>::type in_val) + : val(in_val) {} value_type val; }; --- a/boost/parameter/aux_/arg_list.hpp 2008-03-22 14:45:55.000000000 -0700 +++ b/boost/parameter/aux_/arg_list.hpp 2009-05-14 13:16:48.000000000 -0700 @@ -211,9 +211,9 @@ // Create a new list by prepending arg to a copy of tail. Used // when incrementally building this structure with the comma // operator. - arg_list(TaggedArg arg, Next const& tail) + arg_list(TaggedArg in_arg, Next const& tail) : Next(tail) - , arg(arg) + , arg(in_arg) {} // A metafunction class that, given a keyword and a default --- a/boost/parameter/aux_/maybe.hpp 2008-03-22 14:45:55.000000000 -0700 +++ b/boost/parameter/aux_/maybe.hpp 2009-05-14 13:16:03.000000000 -0700 @@ -33,8 +33,8 @@ BOOST_DEDUCED_TYPENAME remove_reference<reference>::type >::type non_cv_value; - explicit maybe(T value) - : value(value) + explicit maybe(T in_value) + : value(in_value) , constructed(false) {} @@ -48,23 +48,23 @@ this->destroy(); } - reference construct(reference value) const + reference construct(reference in_value) const { - return value; + return in_value; } template <class U> - reference construct2(U const& value) const + reference construct2(U const& in_value) const { - new (m_storage.bytes) non_cv_value(value); + new (m_storage.bytes) non_cv_value(in_value); constructed = true; return *(non_cv_value*)m_storage.bytes; } template <class U> - reference construct(U const& value) const + reference construct(U const& in_value) const { - return this->construct2(value); + return this->construct2(in_value); } void destroy() ---

2 3

Serialization / "Pointer conflict"
by Dan Eaton 15 May '09

15 May '09

Hi all, Sorry for my last question; it was posted hastily -- I subsequently found the Reference->Special Considerations->Optimizations section. Anyway, I have a new problem/question: It's somewhat similar to the "pointer_conflict" example: template<class T> void save(T t) { // create stream & output archive "oar" ar << t; // send with mpi/asio } template<class T> T load() { // retrieve string with mpi/asio T tmp; // create stream & input archive "iar" iar >> tmp; return tmp; } My problem (a few hours of debugging) was that on one end, I was passing in a pointer to an object: FooClass *foo; save(foo) and on the deserialization end, I was requesting an object: FooClass foo = load<FooClass>(); My mistake only showed up through the "array_size_too_short", since as part of the deserialization of FooClass, a fixed-length array was being deserialized, and I guess wonky parsing resulted in "count" being larger than "current_count" in iserializer.hpp. Is what I was doing dangerous, or should/can the boost::serialization library somehow catch that mistake (i.e. in the serialized string, cant it not detect that the object is a pointer to an object, even if it's unregistered)? My fix is to disallow the serialization of pointers on the forward side: if( boost::is_pointer<T> ) throw exception Thanks in advance for any thoughts you might share on the matter, Danny

2 1

Boost and Mac OS X SDK 'nil' Conflicts
by Grant Erickson 14 May '09

14 May '09

There doesn't appear to be an issue for this in Trac or any semblance of a discussion thread; however, the Mac OS SDK definition of 'nil' seems to cause Boost 1_39_0 (perhaps other versions) to emit a copious number of warning and error messages when included AFTER any OS X SDK header such as: #include <CoreFoundation/CoreFoundation.h> #include <IOKit/IOKitLib.h> #include <boost/accumulators/accumulators.hpp> #include <boost/accumulators/statistics/stats.hpp> #include <boost/accumulators/statistics/rolling_mean.hpp> using namespace boost; using namespace accumulators; As near as I can tell CoreServices/MacTypes.h is the source of the definition: #define nil NULL Fortunately, this can be resolved by reordering the include directives to include OS X headers AFTER Boost; however, it seems like these headers should play nicely together. Has Boost reserved 'nil' for some time or might something like 'nil_t' be used alternatively? Regards, Grant

2 1

PropertyTree's XML parsers survey
by Sebastian Redl 14 May '09

14 May '09

Hi, PropertyTree currently has 5 (five!) different xml readers using 4 different parsers. I don't want to maintain them all. Looking at the open tickets for PT shows that most bugs occur in the various xml readers, and there's no point in having more than one. I just wonder which one to keep. To those who use PropertyTree's XML format, which parser do you use? Do you have any experience with the pros and cons of the various parsers? All feedback is highly appreciated. Sebastian

1 0

Performance issues with bellman_ford_shortest_paths
by Paul De La Musica 14 May '09

14 May '09

Hi, I just did a timing experiment on bellman_ford_shortese_paths. It appears to be 200 times slower than LEDA. I am using BGL 1.33.1. Has anyone experienced this? Thanks, Paul

3 4

Build boost on msvc7.1 without native wchar_t
by matthias_0 14 May '09

14 May '09

Hi! I try to compile boost using bjam and toolset=msvc-7.1. To comply with the rest of our libraries I need boost to build without the native wchar_t type. So far none of the solutions I have found seem to work ("snative-wchar_t=off", "-sBUILD=<native-wchar_t>off") In boost\tools\v2\tools\msvc.jam I found a line that adds /Zc:wchar_t to the CFLAGS. Removing that entry didn't help either. Does anyone know a solution to this problem? Thanks, Matthias -- View this message in context: http://www.nabble.com/Build-boost-on-msvc7.1-without-native-wchar_t-tp23539… Sent from the Boost - Users mailing list archive at Nabble.com.

2 3

New version of C++ Middleware Writer now on line
by Brian Wood 14 May '09

14 May '09

Shalom Version 1.9 of the C++ Middleware Writer is now available. This version adds support for Boost Array and it also has a command line interface that allows users to bypass the web interface. In other words, it makes it easy to integrate the C++ Middleware Writer into your build process. http://webEbenezer.net/build_integration.html<http://webebenezer.net/build_integration.html> -- Brian Wood Ebenezer Enterprises http://www.webEbenezer.net <http://www.webebenezer.net/>

1 0

[signals] References rather than copies of functors in slots
by James C. Sutherland 14 May '09

14 May '09

It appears that when a slot is attached to a signal it is copied in. However, if the slot contains a functor, and I want to modify the contents of the functor object, then those changes are not made in the slot since it is a copy of the original object. This is probably a really simple question, but how do tell a signal to hold references/pointers to slot objects rather than copies? Is there a trick with boost::shared_ptr or something? Thanks for any tips. James

2 1

Conditionally show_progress ?
by David Doria 14 May '09

14 May '09

I would like to do something like this void Conditional(const bool show) { unsigned int NumIters = 1e9; boost::progress_display show_progress; if(show) show_progress = boost::progress_display(NumIters); double temp; for(unsigned int i = 0; i < NumIters; i++) { temp = sin(i) / i; if(show) ++show_progress; } } It doesn't seem like I can instantiate a progress_display like this. Is there a way to conditionally have a progress display? Thanks, Dave

3 2

[BGL] A bug in graphviz parser ?
by Dmitry Bufistov 14 May '09

14 May '09

Hi, read_graphviz() parser considers names "b" and b as two different names while the native parser from AT&T does not. Regards, Dmitry

2 2

[boost] [Test] [1.35] How would one access a global fixture's member?
by Stephen Watjen 14 May '09

14 May '09

I came across an example of a global fixture macro in the docs, 'BOOST_GLOBAL_FIXTURE( fixture )' The example that is provided with Boost demonstrates setup and teardown utilizing the constructor and destructor of the fixture passed through the macro. It does not show members in this global fixture. I added a member to the fixture and tried to access it within a test case and I received a compiler error stating that the variable had not been declared in this scope. Is it possible to access a global fixture member? If yes, then how? struct Fixture { const char* str; } BOOST_GLOBAL_FIXTURE( Fixture ) BOOST_TEST_CASE( testGlobalFixture ) { BOOST_CHECK( str != 0 ); } // The above code fails to compile stating: 'str' undeclared (first use this function) Steve Watjen

2 1

Boost::asio // Barrier synchronization
by Dan Eaton 14 May '09

14 May '09

Hello, I'll soon be implementing barrier synchronization over TCP/boost::asio (much like MPI_Barrier) -- has anyone else implemented something similar? Is there any guidance you can offer? Many thanks :) Danny Dan Eaton Software Developer Acceleware Corp. (TSX-V:AXE) www.acceleware.com<http://www.acceleware.com/> Phone: +1.403.249.9099 Ext.295 Fax: +1.403.249.9881 Email: daniel.eaton(a)acceleware.com<mailto:daniel.eaton@acceleware.com> Get superpowered! Acceleware gets your products to market faster, better and stronger! This e-mail may contain information that is privileged and confidential and subject to legal restrictions and penalties regarding its unauthorized disclosure or use. You are prohibited from copying, distributing or otherwise using this information if you are not the intended recipient. If you have received this e-mail in error, please notify us immediately by return e-mail and delete this e-mail and its attachments from your system. Thank you. (c) 2008 Acceleware, Inc. All Rights Reserved

1 0

[Accumulators] Are all statistics lazily evaluated by default?
by pete＠pcbartlett.com 14 May '09

14 May '09

Hi all, I really like the range of statistical properties that the accumulators library supports but am a little unclear about the laziness properties of the library. Suppose I wish to offer a interface that lets the user send a bunch of data and request the k-th moments where k is specified by the user at runtime. Will the accumulator_set accumulator_set< value_type , ba::tag::moments > acc; where k_max >= k (but the inequality may be strict) be efficient. I.e. I only do the calculations necessary to get the k-th moment not the k-max-th? The reason I ask is the documentation makes a distinction between variance and lazy_variance, but this distinction does not seem to be made for other statistics. Thanks in advance for any assistance, Pete

3 3

(Boost.Python) How to print from C++ to the same stream as Python's 'print' does?
by Dietrich Bollmann 14 May '09

14 May '09

Hi, I would like to print from C++ to the same stream as Python's 'print' command does. I am using an embedded Python shell and when using std::cout nothing is printed at all... Currently I am using the following code: std::ostringstream oss; oss << "test\n"; std::string cs = oss.str(); PySys_WriteStdout(cs.c_str()); I wonder if there is an easier way to get the same result? Thanks, Dietrich

3 4

Re: [Boost-users] Tips on implementing a function queue with unique queue items (compare function problem)
by Peter Åberg 14 May '09

14 May '09

Excellent, spot on, thanks gurus :-) /Peter Åberg Steven Watanabe wrote: > If the caller of push knows the type of the function object, > then you can template the push function. > > template<class F> > void push(const F& f) { > if(std::find_if(queue.begin(), queue.end(), f == _1) != queue.end()) { > queue.push_back(item); > } > } > > This is going to be pretty inefficient because of the linear search, > but the same idea applies if you want to store the function objects > in a data structure that supports faster lookup. > > In Christ, > Steven Watanabe > > Nat Goodspeed Wrote: > You're right that we can't compare two boost::function objects, but it > *is* permitted to compare a boost::function with an rvalue that could > initialize it. If you make your push() method a template accepting an > argument of arbitrary type, presumably you could compare each existing > item with that new value before storing it into the deque. > >

1 0

[test] boost::test equivalent of CppUnit's "protectors" ?
by Tim Day 14 May '09

14 May '09

I've used both CppUnit and boost::test for C++ unittesting. Generally I prefer boost::test, mainly because the auto-test macros minimise the effort to setup tests. But there's one thing I really miss from CppUnit: the ability to register your own custom "protectors", instances of which automatically wrap all the run tests. (Technically, you install a test "listener", and that can wrap each test run in a protector scope. Multiple listeners and nested protectors are possible). I've found these invaluable in the past for monitoring unittests for unexpected side effects (e.g checking code hasn't changed the floating-point unit state flags, or messed with other global state). I can't see any equivalent in the boost::test documentation, although BOOST_FIXTURE_TEST_CASE maybe comes closest. (However, whereas a CppUnit protector can return a bool to indicate pass/fail, it's less clear to me how a fixture destructor should indicate failure). Any suggestions for how to best achieve the same thing as CppUnit's protectors in boost::test (and without updating the body of each test) ? Thanks for any advice Tim

2 6

date_time\gregorian\conversion.hpp : fatal error C1001 MSVC 7.1
by Wilkinson, John (Software) 14 May '09

14 May '09

I get the following error with boost 1.39 and MSVC 7.1 SP1 when including <boost/thread/thread.hpp>. c:\boost_libs\V1_39_0\boost\date_time\gregorian\conversion.hpp(43) : fatal error C1001: INTERNAL COMPILER ERROR (compiler file 'msc1.cpp', line 2708) Please choose the Technical Support command on the Visual C++ Help menu, or open the Technical Support help file for more information This problem was in 1.38 as reported here http://archive.netbsd.se/?ml=boost-users&a=2009-02&t=9851835. I was wondering should I raise a bug? I have searched the bugs database but cannot find it already there. Also can anyone suggest a work-around? Turning the browse facility off is not an option; it is a feature I often use. Thanks John <DIV><FONT size="1"> E-mail confidentiality. -------------------------------- This e-mail contains confidential and / or privileged information belonging to Spirent Communications plc, its affiliates and / or subsidiaries. If you are not the intended recipient, you are hereby notified that any disclosure, copying, distribution and / or the taking of any action based upon reliance on the contents of this transmission is strictly forbidden. If you have received this message in error please notify the sender by return e-mail and delete it from your system. If you require assistance, please contact our IT department at helpdesk(a)spirent.com. Spirent Communications plc Northwood Park, Gatwick Road, Crawley, West Sussex, RH10 9XN, United Kingdom. Tel No. +44 (0) 1293 767676 Fax No. +44 (0) 1293 767677 Registered in England Number 470893 Registered at Northwood Park, Gatwick Road, Crawley, West Sussex, RH10 9XN, United Kingdom. Or if within the US, Spirent Communications, 26750 Agoura Road, Calabasas, CA, 91302, USA. Tel No. 1-818-676- 2300 </FONT></DIV>

1 0

Boost gzip_decompressor - compilation errors
by einav_i2 14 May '09

14 May '09

Hi! I'm trying to compile the following function on Boost 1.34.1 (Ubuntu 8.04): void decompress(string &gzipString, string & target) { boost::iostreams::filtering_ostream decompressingStream; boost::iostreams::gzip_decompressor gzdc; decompressingStream.push(gzdc); decompressingStream.push(boost::iostreams::back_inserter(target)); decompressingStream << gzipString; boost::iostreams::flush(decompressingStream); } And I'm getting the following (quite long) error: /usr/include/boost/iostreams/chain.hpp: In member function ‘void boost::iostreams::detail::chain_base<Self, Ch, Tr, Alloc, Mode>::push_impl(const T&, int, int) [with T = boost::iostreams::basic_gzip_decompressor<std::allocator<char> >, Self = boost::iostreams::chain<boost::iostreams::output, char, std::char_traits<char>, std::allocator<char> >, Ch = char, Tr = std::char_traits<char>, Alloc = std::allocator<char>, Mode = boost::iostreams::output]’: /usr/include/boost/iostreams/chain.hpp:207: instantiated from ‘void boost::iostreams::detail::chain_base<Self, Ch, Tr, Alloc, Mode>::push(const T&, int, int, typename boost::disable_if<boost::iostreams::is_std_io<T>, void>::type*) [with T = boost::iostreams::basic_gzip_decompressor<std::allocator<char> >, Self = boost::iostreams::chain<boost::iostreams::output, char, std::char_traits<char>, std::allocator<char> >, Ch = char, Tr = std::char_traits<char>, Alloc = std::allocator<char>, Mode = boost::iostreams::output]’ /usr/include/boost/iostreams/chain.hpp:465: instantiated from ‘void boost::iostreams::detail::chain_client<Chain>::push_impl(const T&, int, int) [with T = boost::iostreams::basic_gzip_decompressor<std::allocator<char> >, Chain = boost::iostreams::chain<boost::iostreams::output, char, std::char_traits<char>, std::allocator<char> >]’ /usr/include/boost/iostreams/chain.hpp:453: instantiated from ‘void boost::iostreams::detail::chain_client<Chain>::push(const T&, int, int, typename boost::disable_if<boost::iostreams::is_std_io<T>, void>::type*) [with T = boost::iostreams::gzip_decompressor, Chain = boost::iostreams::chain<boost::iostreams::output, char, std::char_traits<char>, std::allocator<char> >]’ main.cpp:93: instantiated from here /usr/include/boost/iostreams/chain.hpp:233: error: invalid application of ‘sizeof’ to incomplete type ‘boost::STATIC_ASSERTION_FAILURE<false>’ /usr/include/boost/iostreams/stream_buffer.hpp: At global scope: /usr/include/boost/iostreams/stream_buffer.hpp: In instantiation of ‘boost::iostreams::stream_buffer<boost::iostreams::basic_gzip_decompressor<std::allocator<char> >, std::char_traits<char>, std::allocator<char>, boost::iostreams::output>’: /usr/include/boost/iostreams/chain.hpp:246: instantiated from ‘void boost::iostreams::detail::chain_base<Self, Ch, Tr, Alloc, Mode>::push_impl(const T&, int, int) [with T = boost::iostreams::basic_gzip_decompressor<std::allocator<char> >, Self = boost::iostreams::chain<boost::iostreams::output, char, std::char_traits<char>, std::allocator<char> >, Ch = char, Tr = std::char_traits<char>, Alloc = std::allocator<char>, Mode = boost::iostreams::output]’ /usr/include/boost/iostreams/chain.hpp:207: instantiated from ‘void boost::iostreams::detail::chain_base<Self, Ch, Tr, Alloc, Mode>::push(const T&, int, int, typename boost::disable_if<boost::iostreams::is_std_io<T>, void>::type*) [with T = boost::iostreams::basic_gzip_decompressor<std::allocator<char> >, Self = boost::iostreams::chain<boost::iostreams::output, char, std::char_traits<char>, std::allocator<char> >, Ch = char, Tr = std::char_traits<char>, Alloc = std::allocator<char>, Mode = boost::iostreams::output]’ /usr/include/boost/iostreams/chain.hpp:465: instantiated from ‘void boost::iostreams::detail::chain_client<Chain>::push_impl(const T&, int, int) [with T = boost::iostreams::basic_gzip_decompressor<std::allocator<char> >, Chain = boost::iostreams::chain<boost::iostreams::output, char, std::char_traits<char>, std::allocator<char> >]’ /usr/include/boost/iostreams/chain.hpp:453: instantiated from ‘void boost::iostreams::detail::chain_client<Chain>::push(const T&, int, int, typename boost::disable_if<boost::iostreams::is_std_io<T>, void>::type*) [with T = boost::iostreams::gzip_decompressor, Chain = boost::iostreams::chain<boost::iostreams::output, char, std::char_traits<char>, std::allocator<char> >]’ main.cpp:93: instantiated from here /usr/include/boost/iostreams/stream_buffer.hpp:66: error: invalid application of ‘sizeof’ to incomplete type ‘boost::STATIC_ASSERTION_FAILURE<false>’ A similar "compress" function seem to compile without any problems. Any ideas what can cause this error? Thanks, Einav -- View this message in context: http://www.nabble.com/Boost-gzip_decompressor---compilation-errors-tp235353… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

Serialization / Fast [non-portable] serialization for binary data
by Dan Eaton 14 May '09

14 May '09

Hi, One more question for the list: I have my own 1, 2 and 3 dimensional array classes, and would like to serialize large such objects quickly. In other words, for( unsigned i=0; i<some_large_dynamic_number; i++ ) ar & ptr[i]; is not desirable (or perhaps modern compilers actually do a sufficiently good job at optimizing this case? opinions?) Is this a case where I'd be better to specialize my "serialize" method for both text_?archive (portable) and binary_?archive (fast), and then further split the binary case into save/load, which would in turn invoke save_binary and load_binary (as appropriate)? In this case (assuming the above is right, and out of curiosity) why is there no "serialize_binary" method instead of separate save/load_binary methods? I'm thinking that with this method, there would be no need to split "serialize" into "save"/"load" for this case... Thank you, Danny

2 1

multi-index-container with nested templates => problem getting iterator on 2nd index.
by JohnQ 14 May '09

14 May '09

Hi, I'm really stuck on this one, so I'm hoping someone can lend me a hand. Basically, I'm defining a templated multi-index-container to hold one piece of data along with two indexes to that data. Next, I'm wrapping that in another templated class that will handle concurrent access to that structure. My problem is that I'm having trouble figuring out how to define a type that will give me an interator on the 2nd index of the multi-index-container ("bimimapIterator2" below). I'm basing this on the Boost multi-index-container example here: http://www.boost.org/doc/libs/1_39_0/libs/multi_index/example/bimap.cpp Here's what I have... //******************************************************************** // multi-index-container //******************************************************************** struct index1{}; struct index2{}; template<typename Key1,typename Key2, typename Data> struct bimultimap { typedef boost::tuple<Key1,Key2,Data> value_type; typedef boost::multi_index_container< value_type, indexed_by< ordered_non_unique< tag<index1>,member<value_type,Key1,&value_type::first> >, ordered_non_unique< tag<index2>,member<value_type,Key2,&value_type::second> > > > bimimap; }; //******************************************************************** // concurrent access class. //******************************************************************** template<typename Key1, typename Key2, typename Data> class concurrent_bimultimap { private: typename bimultimap<Key1, Key2, Data>::bimimap the_bimultimap; mutable boost::mutex the_mutex; boost::condition_variable the_condition_variable; public: typedef typename bimultimap<Key1,Key2,Data>::bimimap bimimapType; typedef typename bimultimap<Key1,Key2,Data>::bimimap::iterator bimimapIterator; typedef typename bimultimap<Key1,Key2,Data>::bimimap::index<index2>::type::iterator bimimapIterator2; void insert(Key1 const& key1, Key2 const& key2, Data const& data) { boost::mutex::scoped_lock lock(the_mutex); the_bimultimap.insert( bimultimap<Key1,Key2,Data>::bimimap::value_type(key1,key2,data) ); lock.unlock(); // Note: because we unlock above and notify below, we can starve the "pop" thread for short durations in burst situations. That's ok so far. the_condition_variable.notify_one(); } bool findKey1(Key1& key1, Data& data) { boost::mutex::scoped_lock lock(the_mutex); bimimapIterator itFindIt = the_bimultimap.find(key1); if (itFindIt != the_bimultimap.end()) { data = itFindIt->third; return true; } else return false; } bool findKey2(Key2& key2, Data& data) { boost::mutex::scoped_lock lock(the_mutex); bimimapIterator2 itFindIt = the_bimultimap.get<index2>().find(key2); if (itFindIt != the_bimultimap.get<index2>().end()) { data = itFindIt->third; return true; } else return false; } ..... there's more but this gives the essence of the problem .... };

3 3

Bidirectional Graph and undirected graphs
by Daniel Russel 14 May '09

14 May '09

I'm trying to add the needed functions to make one of our graphs work as a boost graph and ran into a contradiction in the docs: The introduction to bidirectional graph says "For undirected graphs this [need for extra information] is not an issue, since the in_edges() and out_edges() functions are the same, they both return the edges incident to the vertex." however the function docs for in_edges say: "For both directed and undirected graphs, the target of an out-edge is required to be vertex v and the source is required to be a vertex that is adjacent to v." The latter implies that undirected graphs have to have two copies of each edge, one pointed each direction. Which is correct? The former, I hope :-) Thanks.

3 5

boost:statechart: How can I access the state machine from within a custom error handler?
by Jale Gulea 13 May '09

13 May '09

Hello, I have replaced the null_exception_translator (http://www.boost.org/doc/libs/1_34_1/libs/statechart/doc/reference.html#nul…) with one of my own brew and I cannot figure a way to get the state machine in the context of which the the handler gets called. The 'machine_' member is private in both the 'Action' and the 'ExceptionEventHandler'. The 'translator_' is also private - thus inaccessible in my derived state machine. Any ideas are appreciated. Kind regards /JG

3 2

[operators] equality_comparable
by Robert Jones 13 May '09

13 May '09

Given a template class like template < typename T > struct A { template < typename U > friend bool operator == ( const A &, const U & ); template < typename U > friend bool operator == ( const U &, const A & ); template < typename U > friend bool operator != ( const A &, const U & ); template < typename U > friend bool operator != ( const U &, const A & ); // ...other stuff... }; can I express it using equality_comparable? Thanks, Rob.

2 1

[thread] mixing boost::mutex from different boost versions
by klaus triendl 13 May '09

13 May '09

Hi, are boost::mutexes from different boost versions ABI compatible, provided that the modules (boost thread library, my own) are compiled with the same compiler? My question arises because I'm creating a windows DLL with class methods taking a boost::mutex& from let's say boost 1.38, but an application (the EXE) might use e.g. boost 1.39. Klaus Triendl

2 3

[asio] using ASIO with pcap_get_selectable_fd?
by Dustin Spicuzza 13 May '09

13 May '09

Hey, We're wanting to use Boost ASIO for doing socket operations and other asynchronous operations, but we also are using libpcap on multiple links. Currently, we're just getting fd's from pcap_get_selectable_fd() and using a select() loop to dispatch the loops when it's ready. Ideally, we want to use ASIO to do the select() part now instead of what we have, so theres less code to maintain. It seems like that if you add a descriptor to an io_service, you *have* to read or write some bytes to/from it, as opposed to just waiting for it to be ready (as libpcap wants). Is there a way to add an fd to an ASIO io_service and *not* read from it, but only call a routine when its ready to read? Thanks! Dustin -- Innovation is just a problem away

2 1

[fusion][concept] sequence_base
by Pieter Op de Beeck 13 May '09

13 May '09

Hi all. I'm having difficulty understanding why the code listed below is not compiling (at least not on my box, gcc-4.3.2 / boost 1.38). (the code has been stripped and simplified for demonstration). Context: I have an interface and a model providing an implementation of this interface. I use a concept to make sure that the model provides a member function "foo" of a specific signature (whether doind it this way is useful or not, is not the point). In the example below, the member function "foo" should accept one parameter. This parameter should be of type "boost::fusion::sequence_base<SequenceT> const&". Except, when compiling the compiler informs me: invalid use of incomplete type ‘struct boost::fusion::extension::begin_impl<boost::fusion::non_fusion_tag>::apply<const boost::fusion::sequence_base<boost::fusion::list<int, int, int, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_> > >’ Without the concept check in the interface class this compiles fine. Appreciating all your comments on this. Regards, Pieter. ======================main.cpp================================= #include <boost/concept/usage.hpp> #include <boost/concept/requires.hpp> #include <boost/fusion/support/sequence_base.hpp> #include <boost/fusion/container/generation.hpp> // simplified concept that requires from the model a member function 'foo' taking in a fusion:sequence_base template<class Model, typename SequenceT> struct concept { template <void (Model::*) (boost::fusion::sequence_base<SequenceT> const&) const> void model_requires_foo(); BOOST_CONCEPT_USAGE(concept) { model_requires_foo<&Model::foo>(); } }; // an interface which gives 'foo' taking in sequences template<class Model> class interface { public: template<typename SequenceT> BOOST_CONCEPT_REQUIRES( ((concept<Model, SequenceT>)), (void)) foo(SequenceT const& c) const { model_.foo(c); } private: Model model_; }; // a model that can handle fusion::sequence_base class model { public: template<typename SequenceT> void foo(boost::fusion::sequence_base<SequenceT> const& b) const { SequenceT const& sequence = b.derived(); } }; int main() { interface<model> bar; bar.foo(boost::fusion::make_list(1,2,3)); }; ==================end main.cpp==============================

2 1

Boost Unit Tests on iPhone
by Manfred Schwind 13 May '09

13 May '09

Hi, I successfully built the boost libraries for the iPhone and for the iPhone Simulator. Now I have done some work on cross plattform C++ code and I am testing this code with Boost Unit Tests. It's running fine on Mac and Windows. It's also running fine on the iPhone Simulator. But unfortunately it's not working on the iPhone Device. It's not even getting into my test code, it just "hangs" somewhere before when collecting the test cases, if I can see this right in the debugger. I experienced that if I just have one BOOST_AUTO_TEST_CASE it also works fine on the iPhone Device. The test case executes, it succeeds and the app quits. But as soon as I have two or more BOOST_AUTO_TEST_CASEs, none of these test cases gets executed and the iPhone just hangs forever and loops around in some boost unit test initialization code using "spinlocks" and "yields" ... Is this a known issue? Anyone successfully using Boost Unit Tests on iPhone? Any ideas what I could try? Thanks, Mani -- http://mani.de - friendly software iVolume - listen to music freehand LittleSecrets - the encrypted notepad Sahara - sand in your pocket Watchdog - baffle the curious

3 5

[fusion] mutable transform
by David Sankel 13 May '09

13 May '09

Hello, I'm using boost fusion to do some interesting robotics work. This has come up on the list before, but I'd like to point out my scenario where a mutable transform function would be useful. I'm writing a generic interface generator for various datatypes. For a given instance of the type, the interface generator return a widget that can modify the instance. I'd like my implementation for map types to look like this: //... for_each( transform( mapInstance , toWidget() ) , bind( Layout::addWidget, layout, _1 ) ); //... It has a very nice separation of concerns: 1) the "transform toWidget" function, and 2) the "for_each addWidget" which acts much like a fold. However, my toWidget function requires a non-const reference so this doesn't work without a hacky cast to remove the const. Hackery aside, the only way I know how do to this is using a for_each who's function argument explicity does both the conversion to a widget (with toWidget()) and the folding to the layout. Those two concepts seem separate to me. Maybe there's a better way or maybe I'm not understanding the drawbacks of exposing a mutable transpose function. Thanks, David -- David Sankel Sankel Software www.sankelsoftware.com

1 1

PB with Regex Syntax in boost::regex 1.38 cause crash with memory exhausted .
by coord.admin 13 May '09

13 May '09

Hi , i'm using boost::regex 1.38 and C++ to code a textfile parsor . My code work correctly with most regular expression but i've got one problem with this expression: ^([^\s]+)\s+\d+\s+(\d{1,3}\.\d{1,3}\.\d{1,3}\.\d{1,3})\s+\w+\/(\d+)\s+\d+\s+(\w+)\s+(\w+)\:\/\/?([^\:\/\?\s]+):?(\d*)(\S*).+Referer:(.+)\\r.*$ and a file with these lines : 1237084031.249 985 10.0.0.1 TCP_MISS/200 37567 GET http://monsite.information.com/index.mas?epl=00960031UlsNZ0sAVVETVRBeHgsJRz… - ROUNDROBIN_PARENT/10.10.10.10 text/html [Connection: Close\r\nCache-Control: no-cache,no-store\r\nPragma: No-Cache\r\nAccept: */*\r\nHost: monsite.information.com\r\nUser-Agent: XXXX/X.X (Update: XXXX X.X; UNIX)\r\nProxy-Connection: Keep-Alive\r\n] [HTTP/1.1 200 OK\r\nDate: Sun, 15 Mar 2009 02:27:10 GMT\r\nServer: Oversee Webserver v1.3.18\r\nSet-Cookie: ident=click:0%257csearch:0%257cexitpop:0%257ctoken:vqzyyyprxutxyvqs%257clload:0%257clvisit:1237084030; path=/; expires=Mon, 16-Mar-2009 02:27:10 GMT\r\nSet-Cookie: monsite.com=click:0%257csearch:0%257cexitpop:0%257clload:0%257clvisit:1237084030; path=/; expires=Mon, 16-Mar-2009 02:27:10 GMT\r\nSet-Cookie: Spusr=ac15000c6b3f49bc677e9c0b; path=/; expires=Tue, 15-Mar-11 02:27:10 GMT\r\nCache-control: private, no-cache, must-revalidate\r\nExpires: Mon, 26 Jul 1997 05:00:00 GMT\r\nPragma: no-cache\r\nP3P: policyref="http://monsite.information.com/w3c/p3p.xml", CP="NOI DSP COR ADMa OUR NOR STA"\r\nConnection: close\r\nContent-Type: text/html\r\n\r] I've got this error message : terminate called after throwing an instance of 'boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<std::runtime_error> >' what(): Memory exhausted Abandon The problem is probably here : (\d*)(\S*).+Referer:(.+) because when i delete this part it work correctly. I try this expression and this file with a perl script and it work correctly , but with boost not . Can you help me ?

2 1

[conversion] lexical_cast<> compilation with --pedantic-errors
by Evgeny Tarasov 13 May '09

13 May '09

If to compile program with the key --pedantic-errors there exist some error messages. Otherwise everything is ok. #include <boost/lexical_cast.hpp> //line 38 In file included from /usr/local/include/boost-1_39/boost/detail/lcast_precision.hpp:16, from /usr/local/include/boost-1_39/boost/lexical_cast.hpp:31, from accepterimpl.cpp:38: /usr/local/include/boost-1_39/boost/integer_traits.hpp:164:66: use of C99 long long integer constant /usr/local/include/boost-1_39/boost/integer_traits.hpp:164:77: use of C99 long long integer constant /usr/local/include/boost-1_39/boost/integer_traits.hpp:170:70: use of C99 long long integer constant /usr/local/include/boost-1_39/boost/integer_traits.hpp:170:70: use of C99 long long integer constant make[2]: *** [accepterimpl.o] Error 1 make[1]: *** [all-recursive] Error 1 make: *** [all] Error 2 Are there any means to overcome it ?

1 0

[BGL]Why the output of algorithms are vertex sequence(PredecessorMap)? How about parallel edges??
by Li Ning 13 May '09

13 May '09

For example, a graph has 2 nodes: A & B. There are 2 edges form A to B which are edge1 & edge2. edge1 has weight 1, edge2 has weight 2. Then the shortest path form A to B is: vertex A---edge1---vertex B. But the default output of all algorithm is vertex sequence. Why? How to get the edge sequence?? I have noticed vistor.hpp has a class edge_predecessor_recorder, but I don't know how to use it. Anybody give me a hint? -- View this message in context: http://www.nabble.com/-BGL-Why-the-output-of-algorithms-are-vertex-sequence… Sent from the Boost - Users mailing list archive at Nabble.com.

4 12

[Asio] Cancel an async timer from another timer's handler
by Laurent Fert 13 May '09

13 May '09

Hi, I faced some strange behavior while using timers (boost_1_38_0/boost_1_39_0). Here is an easy way to reproduce such behavior (note: I use async timeouts and a single thread): =experiment 1= Timer1 expires after 2 seconds and reschedules itself to fire again 2 seconds later. Timer2 expires after 2 seconds and cancels Timer1. Result: Timer2's handler gets called but the cancel call on Timer1 returns 0. Timer1's handler gets called (although it should have been cancelled) and therefore, Timer1 repeats itself indefinitely. =experiment 2= Timer1 expires after 1995 milliseconds and primes itself to fire again 1995 milliseconds later. Timer2 expires after 2 seconds and cancels Timer1. Result: Timer1's handler gets called and reschedules itself. Timer2's handler gets called and Timer1 gets canceled properly. =experiment 3= Timer1 expires after 2005 milliseconds and primes itself to fire again 2005 milliseconds later. Timer2 expires after 2 seconds and cancels Timer1. Result: Timer2's handler gets called and Timer1 gets canceled properly. =experiment 4= Repeat experiment 1 but change the expiration time of Timer1 instead of canceling it from Timer2's handler. Result: Timer2's handler gets called and Timer1 gets rescheduled properly. Note that Timer1's handler doesn't get called at all before the new expiry time although it should be called with an operation_aborted error code. =summary= When Timer1 and Timer2 expire at a very close time, Timer2 cannot cancel Timer1 although it can reschedule it. Is it an expected behavior? Is it due to the design of Asio? Regards, Laurent

1 0

[boost-users][signals2] thread-safe disconnection for intrusively ref-counted objects
by Igor R 13 May '09

13 May '09

Hello, Is there any trick or customization that would allow the subj? I mean the following situation: // pseudo-code! class intrusively_refcounted : //... { private: void listenToAsyncSubsystem() { // signals will come from another thread asyncSubsystem_.someEvent.connect(slot_type(&intrusively_refcounted::handler, this).track(???)); // can't use here shared_ptr/weak_ptr for tracking } }; I could store a connection object, so that it would be destroyed/disconnected in ~intrusively_refcounted(), but I guess it's not thread-safe, just like the approach with "trackable". So what would be the correct approach? Thanks!

2 2

How to reduce the size of a output DLL file?
by ipangth 13 May '09

13 May '09

I used to build a DLL file with VS2005 & boost-1_33, the project used boost::thread, asio, serialization, filesystem, datetime,system, link static, /MT, and the output DLL file size is about 1.7M. Now I port the project to VS2008 SP1 with boost-1_36, but the output file size increase to 2.9M! The VS2008 DLL project just default setting. I do not know whether this problem is boost-1_36 OR vs2008. Can some one give me some tips for how to reduce the DLL out put file size? -- Best regards, aster

2 1

[Boost.Test]
by Ruediger Berlich 13 May '09

13 May '09

Hi there, I am using Boost.Test to run Unit tests for my code (Boost 1.39). For each class, I have a number of tests (implemented through BOOST_AUTO_TEST_CASE or BOOST_AUTO_TEST_CASE_TEMPLATE, respectively), organized in test suites (arranged in BOOST_AUTO_TEST_SUITE blocks). Each BOOST_AUTO_TEST_SUITE with the associated AUTO_TESTs is a separate compilation unit, thus localted in its own file. I would now like to make sure that tests are run in a specific order. After all these are unit tests, and I want the most basic components to be tested first. Is there a way to do this with the AUTO-environment, or do I have to resort to manual registration of test suites and/or test cases ? I have tried changing the linking order, but to no avail. As always thanks for a great library collection and any help provided! Best Regards, Ruediger

4 6