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

[Interprocess] Shared memory misplaced
by Alexander Pérez Ruiz 26 May '11

26 May '11

Hi all, I have followed the discussion about the problems with the WMI in https://svn.boost.org/trac/boost/ticket/5392. I patched my release version of boost 1_46_1 with the wmi.patch but I do not achieve it works well. I am using the Interprocess library in order to interchange information between two programs that run in Windows but one of them was compiled in linux with the MinGW cross-compiling-environment on an Ubuntu 10.10 machine that uses this version of boost. I create the shared memory in the program compiled directly on Windows but it is created in the folder named "Select ...". When I start the second program, this program is looking for the shared memory in the folder named "200110523...". How can I found the same behaviour in the two programs in order to use the shared memory segment? Could somebody give me some help? Presently, I work on Windows XP and VS 2008. Thanks in advance. -- Alexander Pérez Ruiz Doctorado en Automatización Avanzada y Robótica Instituto de Organización y Control de Sistemas Industriales (IOC) Universidad Politécnica de Cataluña (UPC) Avenida Diagonal 647, piso 11 08028 Barcelona, España Tel: 934017748

1 0

[ICL] interval_map question
by Antal A. Buss 26 May '11

26 May '11

Hi all, I'm trying to use interval_map to implement some kind of range to value directory, but I have some non expected results. The test code I'm using is: ------------------------ #include <iostream> #include <boost/icl/interval_map.hpp> #include <boost/icl/discrete_interval.hpp> using namespace std; using namespace boost::icl; int main(int argc, char const **argv) { interval_map<size_t, int> imap; typedef discrete_interval<size_t> interval_t; imap += make_pair(construct<interval_t>(0, 7, interval_bounds::closed()),0); cout << "imap: " << imap << endl; imap.set(make_pair(construct<interval_t>(0, 0, interval_bounds::closed()),1)); cout << "imap: " << imap << endl; imap.erase(construct<interval_t>(3, 3, interval_bounds::closed())); cout << "imap: " << imap << endl; } ------------------------ The result I got is: imap: {} imap: {([0,0]->1)} imap: {([0,0]->1)} but the result I was expecting is: imap: {([0,7]->0)} imap: {([0,0]->1)((0,7]->0)} imap: {([0,0]->1)((0,3)->0)((3,7]->0)} Do I missing something? Thanks, Antal

2 2

serialization: BOOST_STATIC_WARNING
by Travis Gockel 25 May '11

25 May '11

I've recently had some trouble with C++'s implicit casting, so I'm looking for a way to warn people if somebody attempts to assign an int32_t to a uint64_t or whatever. BOOST_STATIC_ASSERT would work wonders for this, except that the code base I'm working with is quite large and relies on a lot of implicit casting, so immediately breaking everything with assertions is unrealistic. It looks like BOOST_STATIC_WARNING ( http://www.boost.org/doc/libs/1_46_1/libs/serialization/doc/static_warning.…) would be ideal for me, however, I cannot get it to actually emit a warning. I have attached a quick example of what I am looking for, but it essentially boils down to this not doing anything: typedef boost::is_same<int64_t, int32_t> same_type; BOOST_STATIC_WARNING(same_type::value); My compiler is g++ 4.4.3 with --std=c++0x -Wall -Wextra. Thanks! -- - Travis Gockel

2 2

Re: [Boost-users] [BGL] Subgraphs: Name-to-Index Property Map.
by Cedric Ginestet 25 May '11

25 May '11

> Dear Cedric L., > > Yes, you're right. It is true that the use of the filtered_graph seems > to be very appropriate. However, since I would still need to copy the > new graph, it is not clear whether this would save much computational > time. > > Thank you very much for your suggestion about using vertex_descriptor > instead of int. I already encountered some problems when switching > from vecS to listS, and couldn't understand where the error was > located. I will definitely follow your advice in the future. > > Regarding my use of int in vertex_name_t, instead of std::string. This > was indeed intended. My vertices are labelled with integers. Would you > still recommend that I use std::string to specify the names of these > vertices, even though they are integers? > > Your final suggestion made me realize that I already have the look-up > table that you mentioned. In fact, in my application, the names of the > vertices in the subgraph correspond to the indices of the vertices in > the main graph. It is therefore completely trivial to clear and remove > the vertices in the main graph, by using the names of the ones in the > subgraph! > > Thanks a lot, that was very useful. > Cedric G. > > Dear BGL users, > > > > I am trying to produce a simple routine to extract the subgraph of a > > graph, by using the vertex names of the subgraphs. That is, for two > > graphs G and H, I want to define the following operator: > > G -= H; > > Here, the resulting subgraph of G should have all the vertices that H > > doesn't have. During this process, the incident edges of the removed > > vertices are also removed. I have checked the subgraph class in BGL, but > > this refers to a substantially different concept. I have tried the > > following code, which works, but is extremely slow for the type of > > application that I had in mind: > > > > ////////////////////////////////////////////////// > > class Graph > > { > > public: > > typedef adjacency_list<vecS, vecS, undirectedS, > > property<vertex_name_t,int> > UndirectedGraph; > > Graph(); > > ~Graph(); > > int Nv(); // Return number of vertices > > Rcpp::IntegerVector V(); // Return vector of NAMES of vertices as > > integers. > > Graph& operator-= (Graph& H); > > private: > > UndirectedGraph G; > > }; > > > > ///////////////////////////////////////////////////////////////////////// > > // Overloaded Operators. > > Graph& Graph::operator-= (Graph& H){ > > typedef graph_traits<UndirectedGraph>::vertex_descriptor Vdescriptor; > > typedef property_map<UndirectedGraph,vertex_name_t>::type > > VertexNameMap; typedef iterator_property_map<int*, identity_property_map> > > name_to_vertex_map; > > > > Rcpp::IntegerVector vec = H.V(); > > VertexNameMap NameIndex; > > for(ivIter t=vec.begin(); t!=vec.end(); ++t){ > > > > // Create/Update Iterator map (LValuePropertyMap). > > int x[this->Nv()]; NameIndex = get(vertex_name,G); > > for(int i=0; i< this->Nv(); ++i) x[NameIndex[i]]=i; > > name_to_vertex_map NVmap(x); > > > > // Remove vertex from name of *t in H. > > Vdescriptor u=NVmap[*t]; > > clear_vertex(u,G); remove_vertex(u,G); > > }//t > > return *this; > > }//-> ////////////////////////////////////////////////// > > > > The problem seems to be that I re-create an iterator map (from vertex > > NAMES to vertex INDICES) every time I remove a single vertex. This seems > > counter-efficient. I would need to be able to create a reference to a > > similar map that is automatically updated every time I remove a vertex. > > However, since vertices in BGL are indexed from 0 to Nv-1, I don't see a > > way to produce a LValuePropertyMap from vertex's names to vertex's indices. > > > > Any help/opinion would be greatly appreciated, > > Maybe a soution would be to use filtered_graph and as the predicate the > vertices (or directly names) of H (in the form of a set?!). However, this > would require to copy the filtered_graph again into an adjacency_list, which > might be costly, depending on your situation. > Besides this, I would suggest you to use vertex_descriptor instead of int, as > vertex_descriptor is more general and your code will then most likely also > work if you decide to change vecS into listS (in case this plays a role). > Concerning your code, I am wondering if it is intended that vertex_name_t is > of type int and not std::string? > The more, when you want to compare each vertex from one graph with each vertex > of the other (which you basically have to do for completeness), I would assume > this takes quadratic running time and hence will be fairly costly. Unless you > have maps that allow a faster lookup, but you will then need to create a map > NAMES to INDICES(vertex_descriptor) for one graph and then do something like: > name_to_vertex_map_H[getName(vertex_of_G)] and in case this key exists, you > can remove vertex_of_G from G, as you have found a vertex with an equivalent > name in H. It would then also be nonrelevant if your graph (for simplicity I > take G) would have vertices with the same name, as they would all be "mapped" > by the name_to_vertex_map_H and thus could be adequately handled. I actually > don't see the need to update the map then, because the deleted vertices will > not show up again (your iterator went to the next vertex) and if there are > different nodes with the same name, they will be taken care of. > One thing that comes into my mind when writing you this is that you also > should have a look at iterator-invalidation due to the clear_vertex() and > remove_vertex(). I am right now not sure if this is critical for vecS or not. > > Hope that these thoughts are handy in some way. If not, please let me know. > > Best, > > Cedric > > > -- > Cedric Ginestet, PhD > Centre for Neuroimaging Sciences (L3.04) > NIHR Biomedical Research Centre > Department of Neuroimaging > Institute of Psychiatry, Box P089 > King's College London > De Crespigny Park > London > SE5 8AF > http://arxiv.org/find/q-bio/1/au:+Ginestet_C/0/1/0/all/0/1

1 0

[GIL] bits8* to gray8_ptr_t without reinterpret_cast?
by Tyler Weston 25 May '11

25 May '11

You might have also seen this question on SO: http://stackoverflow.com/questions/6103252/boostgil-bits8-to-gray8-ptr-t-wi… Trying to work by the design guidelines for GIL, I use |bits__| for my channel data types. I often have external data I'm wrapping into GIL image views. However, even using the |bits__| types for data pointers, I have to add in a reinterpret_cast before I can create my image views. Take the following code |int width= 3; int height= 2; boost::gil::bits8 data8[] = {0, 1, 100, 200, 50, 51}; boost::gil::bits8* pBits8= data8; boost::gil::gray8_ptr_t pGray8= pBits8; boost::gil::gray8_view_t v= interleaved_view(width, height, pGray8, width* sizeof(boost::gil::bits8)); | Results in the error on line 6 "error C2440: 'initializing' : cannot convert from 'boost::gil::bits8 *' to 'boost::gil::gray8_ptr_t' 1> Types pointed to are unrelated; conversion requires reinterpret_cast, C-style cast or function-style cast" Delving into the source code as much as I can, it appears these types really are unreleated. bits8 is just |unsigned char|, but |gray8_ptr_t| is a pointer to a |struct pixel<bits8,gray_layout_t>|. The only element of this struct is a single bits8, so a reinterpret_cast looks safe. It also works fine for the tests I've thrown at it. However, I wrap external data into image views quite often, and having a reinterpret_cast in every place feels problematic. Is there a safer way of constructing a pixel pointer for use in GIL? My current workaround is to create a template specialized cast that only compiles for known safe casts. |template<class Dest, class Src> Dest gil_safe_ptr_cast(Src src) { // this cast is unsafe, use reinterpret_cast BOOST_STATIC_ASSERT(false); } template<> boost::gil::gray8_ptr_t gil_safe_ptr_cast(boost::gil::bits8* pBits8) { return reinterpret_cast<boost::gil::gray8_ptr_t>(pBits8); } boost::gil::bits8* pBits8= data8; boost::gil::gray8_ptr_t pGray8= gil_safe_ptr_cast<boost::gil::gray8_ptr_t>(pBits8); // works boost::gil::bits16* pBits16= NULL; boost::gil::gray8_ptr_t pGray82= gil_safe_ptr_cast<boost::gil::gray8_ptr_t>(pBits16); // compile error as expected | If this is the best current solution, I'd be glad to clean it up and pack it into typedefs.hpp for grayscale types. Thoughts?

2 1

[BGL] Subgraphs: Name-to-Index Property Map.
by Cedric Ginestet 25 May '11

25 May '11

Dear BGL users, I am trying to produce a simple routine to extract the subgraph of a graph, by using the vertex names of the subgraphs. That is, for two graphs G and H, I want to define the following operator: G -= H; Here, the resulting subgraph of G should have all the vertices that H doesn't have. During this process, the incident edges of the removed vertices are also removed. I have checked the subgraph class in BGL, but this refers to a substantially different concept. I have tried the following code, which works, but is extremely slow for the type of application that I had in mind: ////////////////////////////////////////////////// class Graph { public: typedef adjacency_list<vecS, vecS, undirectedS, property<vertex_name_t,int> > UndirectedGraph; Graph(); ~Graph(); int Nv(); // Return number of vertices Rcpp::IntegerVector V(); // Return vector of NAMES of vertices as integers. Graph& operator-= (Graph& H); private: UndirectedGraph G; }; ///////////////////////////////////////////////////////////////////////// // Overloaded Operators. Graph& Graph::operator-= (Graph& H){ typedef graph_traits<UndirectedGraph>::vertex_descriptor Vdescriptor; typedef property_map<UndirectedGraph,vertex_name_t>::type VertexNameMap; typedef iterator_property_map <int*, identity_property_map> name_to_vertex_map; Rcpp::IntegerVector vec = H.V(); VertexNameMap NameIndex; for(ivIter t=vec.begin(); t!=vec.end(); ++t){ // Create/Update Iterator map (LValuePropertyMap). int x[this->Nv()]; NameIndex = get(vertex_name,G); for(int i=0; i < this->Nv(); ++i) x[NameIndex[i]]=i; name_to_vertex_map NVmap(x); // Remove vertex from name of *t in H. Vdescriptor u=NVmap[*t]; clear_vertex(u,G); remove_vertex(u,G); }//t return *this; }//-= ////////////////////////////////////////////////// The problem seems to be that I re-create an iterator map (from vertex NAMES to vertex INDICES) every time I remove a single vertex. This seems counter-efficient. I would need to be able to create a reference to a similar map that is automatically updated every time I remove a vertex. However, since vertices in BGL are indexed from 0 to Nv-1, I don't see a way to produce a LValuePropertyMap from vertex's names to vertex's indices. Any help/opinion would be greatly appreciated, -- Cedric Ginestet Centre for Neuroimaging Sciences (L3.04) NIHR Biomedical Research Centre Department of Neuroimaging Institute of Psychiatry, Box P089 King's College London De Crespigny Park London SE5 8AF

2 1

iostreams stream file error
by Kraus Philipp 25 May '11

25 May '11

Hello, I use this code excerpt for copy file content: bio::stream< bio::basic_file_source<char> > l_file(p_str1); if (!l_file.is_open()) throw exception::runtime(_("file can not be opened")); std::copy( std::istream_iterator<char>(l_file), std::istream_iterator<char>(), std::ostreambuf_iterator<char>(&l_deflate) ); (*) l_file.close(); p_str1 is the filename and bio ist shorten for boost::iostreams, l_deflate is a bio::filtering_streambuf< bio::output > with a bzip2 compressor. I can set anything else to p_str1 (some not existing filesnames) and the code runs not into the if construction, the std::copy seems to copy any data, but which if there is no file under the stream !? The l_deflate is define with: bio::counter l_counter; bio::basic_null_sink<char> l_null; bio::filtering_streambuf< bio::output > l_deflate; l_deflate.push( bio::bzip2_compressor( m_bzip2param ) ); break; l_deflate.push( boost::ref(l_counter) ); l_deflate.push( l_null ); I would count the compressed bytes of a file (without writing the file), but I need to copy the filecontent without closing after copying, so I can't use boost::iostream::copy (it closes the streams after copy). On the (*) can be some other std::copy with other files Can anyone help me please to create a correct code ? Thanks a lot Phil

1 0

linking boost libraries to custom c and c++ runtime on windows
by Adrian Gierakowski 25 May '11

25 May '11

Hello, Is it possible to tell bjam (on windows) to compile boost libraries and link them to custom c\c++ runtime libraries instead of the ones provided bt Microsoft? Thanks! -- Adrian Gierakowski

1 0

[Lambda] Handling Bind/Lambda name clashes.
by Robert Jones 25 May '11

25 May '11

Im compiling in an environment which #includes <boost::bind.hpp>, so I can't get away from it! I'd like to use Boost.Lambda sometimes, but run into namespace clashes. This code snippet works... #include <boost/lambda/lambda.hpp> #include <boost/lambda/bind.hpp> #include <boost/range.hpp> #include <vector> #include <numeric> // and also this... #include <boost/bind.hpp> struct X { int f( ) const { return 1; } }; int sum( int a, int b ) { return a + b; } int main( ) { boost::lambda::placeholder1_type x; boost::lambda::placeholder2_type y; std::vector<X> v; std::accumulate( boost::begin( v ), boost::end( v ), 0, bind( sum, x, bind( &X::f, y ) ) ); } but as soon as I extract the innermost bind into a Boost.Function, I seem to need to fully qualify all the binds, ie int main( ) { boost::lambda::placeholder1_type x; boost::lambda::placeholder2_type y; std::vector<X> v; boost::function<int(int, int)> my_sum = bind( sum, x, y ); std::accumulate( boost::begin( v ), boost::end( v ), 0, boost::lambda::bind( my_sum, x, bind( &X::f, y ) ) ); } Is there any easy way around this? It would be nice to able to name my inner binds in a meaningful way, but all the explicit qualification gets a bit cumbersome! Thx - Rob.

7 22

Re: [Boost-users] [boost][msm] std::vector<MyStateMachine> generate stack overflow
by Christophe Henry 25 May '11

25 May '11

>It's not the vector, it's the copy constructor. You can see the same problem with : > > > RealStateMachine sma; > RealStateMachine smb( sma ); > >At the moment I'm not sure exactly what makes it a recursive call. Was the generated state machine not thought to be copied, or did I made a mistake? Yes, a state machine can be copied and no you didn't make any mistake. I think it's a compiler bug because: - it works fine with g++ 4.5 - the debugger doesn't even make it to the copy-constructor. I remember I had in the past problems when inheriting from a state machine with VC. The only solutions I see is to use a typedef instead or using aggregation instead of inheritance. This works: typedef boost::msm::back::state_machine< StateMachine > RealStateMachine; Unfortunately, I cannot help on this. Maybe Stephan is aware of this problem? Christophe

4 6

how are the iterative/looping mechanism implemented in boost preprocessor?
by R A 25 May '11

25 May '11

at first i thought that the boost library came with it's own implementation of a c preprocessor, as i thought that was the only way it could be doing all that iteration (multiple "patterned" declarations, etc, etc) and the c standard hasn't introduced a notion of counters... i've considered concatenation, but that incurs a "final" string to be compared which cannot be generated automatically a priori (correct me if i'm mistaken). but when i looked at boost thoroughly, it seems to be doing everything in standard. so can anybody tell me how that is done? a sort of pseudo-code for doing this will be very helpful: #define MULTIPLE_ENUMS(my_enum, n) /* ^ will declare n enumerations using prefix "my_enum" and having concatenated 0 to n each. optional: having ALL the minimum value of each enum be 0 (easy) and maximum values for each multiplied by a magnitude of 2 starting from an initial value (which then becomes): #define MULTIPLE_ENUMS(my_enum, init, 5) */ i know this may sound trivial and totally beginner-like, but can anyone explain it to me, as i don't have the whole day just trying to decipher everything out.

4 5

Test Reports for older Releases
by spam-receiver＠web.de 24 May '11

24 May '11

Hello! Where can I find the test results for older releases on the Boost homepage? I can only find the results for the current release under: http://www.boost.org/development/tests/release/developer/summary.html Thanks in advance, Thomas

1 0

regular expression too complex
by Kraus Philipp 24 May '11

24 May '11

Hello, I'm generating a complex regular expression for removing word of textes, but now I get this exception: terminate called after throwing an instance of 'boost ::exception_detail ::clone_impl <boost::exception_detail::error_info_injector<std::runtime_error> >' what(): The complexity of matching the regular expression exceeded predefined bounds. Try refactoring the regular expression to make each choice made by the state machine unambiguous. This exception is thrown to prevent "eternal" matches that take an indefinite period time to locate. Is there a solution to create any removing operation? I have got a vector with strings and I must remove each element on the texts, so I create a regular expression with "or" and case-insensitive search ans use regex_replace to remove the words Thanks Phil

4 4

Help needed with Boost header only libraries
by vikash sharma 24 May '11

24 May '11

Hi, Could anyone please help me out. I need boost header only libraries for boost shared pointer and boost foreach. But i am not able to find the header libraries available for download any where on the boost website. I remember seeing the header only libraries some time back. But right now dont see the header only libraries for any of the boost versions released till date. Regards, Vikash

4 7

simple thread program hardtocompile/link with 1.46.1
by Eric Lin 24 May '11

24 May '11

Dear boost program(for c++,(or g++)): after I download 1.46.1 and try to baseon it to compile a simple program from book C++cookbook, at page 447, 12.1 Creating a Thread ---------- // example 12-1. Creating a thread #include <iostream> #include <boost/thread/thread.hpp> #include <boost/thread/xtime.hpp> struct MyThreadFunc { void operator()() { // Do something long-running... } } threadFun; int main() { boost::thread myThread(threadFun); // Create a thread that starts // running threadFun boost::thread::yield(); // give up the main thread's timeslice // so the child thread can get some work // done. // Go do some other work... myThread.join(); // The current (i.e., main) thread will wait // for myThread to finish before it returns } ----------------------------------------------------------- eric@eric-laptop:~/cppcookbook$ ls example12-1.cpp eric@eric-laptop:~/cppcookbook$ g++ -I/home/eric/boost1/boost_1_46_1/ example12-1.cpp -lboost_thread-mt /usr/bin/ld: cannot find -lboost_thread-mt collect2: ld returned 1 exit status eric@eric-laptop:~/cppcookbook$ g++ -I/home/eric/boost1/boost_1_46_1/ example12-1.cpp -lboost /usr/bin/ld: cannot find -lboost collect2: ld returned 1 exit status eric@eric-laptop:~/cppcookbook$ cd ../boost1/boost_1_46_1/ eric@eric-laptop:~/boost1/boost_1_46_1$ -------------------------- I am in Ubuntu linux 10.04, g++ 4.4.3 looking to see any suggestion and thanks a lot in advance, Eric Lin, Us citizen, in Los Angeles I am glad to meet anyone in Los Angeles on computer science meeting

5 9

[Lambda, Function, etc] Is static dangerous?
by Robert Jones 24 May '11

24 May '11

Hi All Is it dangerous to write static Boost.Functions or Boost.Lamda placeholders in a multi-theaded context? I think that might be a really stoopid quesion - I'm just checking! Thx - Rob. eg, #include <boost/function.hpp> #include <boost/lambda/bind.hpp> void f( ) { namespace ll = boost::lambda; using boost::function; typedef std::pair<int, int> int_pair; static ll::placeholder1_type x; static function<int(const int_pair &)> second = ll::bind( & int_pair::second, x ); }

3 2

Error C2039 using portable syntax for MultiIndex with Boost 1.34.1 on VC6
by tangleman＠secules.net 24 May '11

24 May '11

I am trying to use Boost Multi_Index from build 1.34.1 to set up a collection of structs. This Multi Index container will have 2 unique keys (ID and Name), since I have to be able to search it with either key. I made the compiler-specific corrections for VC++ 6.0 SP5: boost::multi_index::multi_index_container member_offset<A,int,offsetof(A,x)> My complete declaration is: struct ID(); struct Name(); typedef boost::multi_index::multi_index_container< PDCUTestMessage, boost::multi_index::ordered_unique< boost::multi_index::tag<ID>, boost::multi_index::member_offset<PDCUTestMessage, char, offsetof(PDCUTestMessage, id)> >, boost::multi_index::ordered_unique< boost::multi_index::tag<Name>, boost::multi_index::member_offset<PDCUTestMessage, string, offsetof(PDCUTestMessage, name)> > > > PDCUMessageList; Later, I attempt to set up indicies for both of these keys, according to VC++ 6.0 compiler-specific syntax to bypass the Get/Tag issue: typedef index<PDCUMessageList, ID>::type IDIndex; typedef index<PDCUMessageList, Name>::type NameIndex; Now the error. using the above code, I get the following error: error C2039: 'type': is not a member of "global namespace" referencing the two typedef lines above. I can't figure out what I am doing wrong? Quick responses are much appreciated! Thanks! Chris

5 6

[Interprocess] Container of containers LRU
by Matthieu Tourne 23 May '11

23 May '11

Hi, I'm looking into implementing an object cache available from multiple processes, I naturally found the boost::interprocess library mostly adapted for this. My problem is how to implement a cache eviction mechanism (LRU or other) when shared memory segment has been filled up. My problem gets worse, when I start using containers of containers, as described here : http://www.boost.org/doc/libs/1_46_1/doc/html/interprocess/allocators_conta… So I have that allocator that I use everywhere, like in the example : typedef managed_shared_memory::segment_manager segment_manager_t; typedef allocator<void, segment_manager_t> void_allocator; I use it to create a boost::interprocess::map of objects, which in turn can contain a boost::interprocess::map of strings in shared memory as well. So to recap, I have an map of Object like an "object store" and each Object can contain a "dictionary" (map of strings) of unknown size, all of those living in a shared memory segment. My problem, is that shared memory segments are of a given size and any of the allocate() operation that the allocator is going to perform (when adding a new Object, or a new element in a dictionary) can throw a boost::interprocess::bad_alloc exception. So I'm wondering if there is a more suited library to do persistent caching of objects between processes, with a way to automatically evicts "old cache" from the memory. Or if there is a way to implement my own allocator that would be more aware of my design, and would deallocate one of the Objects and the associated dictionary if an allocate() were to fail. I've been scratching my head for a little while now, and any suggestions or example of code would be really appreciated! Thank you, Matthieu.

1 0

[Lambda] Getting the bind incantation correct.
by Robert Jones 23 May '11

23 May '11

Hi All I'm trying to use std::vector::push_back() within a Boost.Lambda expression, but am finding it impossible to bind correctly. Can anyone tell me what I'm doing wrong in this code? Thanks in advance, - Rob. #include <vector> #include <boost/function.hpp> #include <boost/lambda/bind.hpp> void f( ) { namespace ll = boost::lambda; using boost::function; typedef unsigned char Id; typedef std::vector<Id> Ids; ll::placeholder1_type x; Ids ids; void ( Ids::* push_back )( const Ids::value_type & ) = & Ids::push_back; function<void(Id)> my_push = ll::bind( push_back, ids, x ); // Line 18 (void)my_push; } > g++ ignore.cpp [...lots of template instantiation errors, then...] ignore.cpp:18: instantiated from here /usr/include/boost/lambda/detail/actions.hpp:96: error: no matching function for call to ‘boost::lambda::function_adaptor<void (std::vector<unsigned char, std::allocator<unsigned char> >::*)(const unsigned char&)>::apply(void (std::vector<unsigned char, std::allocator<unsigned char> >::* const&)(const unsigned char&), const std::vector<unsigned char, std::allocator<unsigned char> >&, unsigned char&)’ /usr/include/boost/lambda/detail/actions.hpp:96: error: return-statement with a value, in function returning 'void'

3 4

Review Wizard Report for May 2011
by Ronald Garcia 23 May '11

23 May '11

============================================== Review Wizard Status Report for May 2011 ============================================== News ==== 1. Process Library Rejected 2. Phoenix Library Accepted 3. XInt Library Rejected 4. Type Traits Extensions Accepted 5. Locale Library Accepted 6. Convert Library Withdrawn 7. Conversion Library Accepted Provisionally 8. Context Library Accepted Provisionally 9. Boost 1.46.1 Released Revised Libraries: Asio, Filesystem, Fusion, Graph, ICL, Math, Polygon, Proto, Property Tree, Signals2, TR1, Unordered Revised Tools: Quickbook Open Issues =========== The following libraries have been reviewed and await reports from their review managers: * AutoIndex(Tool) - reviewed May 2011; review manager: Daniel James. The following libraries have been accepted to Boost, but have not yet been submitted to SVN: * GIL.IO - accepted January 2011; author: Christian Henning. * Type Traits Extensions - accepted March 2011; author: Frederic Bron. The following libraries have been accepted and submitted to SVN, but have not yet appeared in a release: * Phoenix - accepted March 2011; author: Joel de Guzmann. * Move - accepted February 2011; author: Ion Gaztanaga. * Geometry Library - accepted November 2009; author: Barend Gehreis et al. * Ratio - accepted October 2010; author: Vicente Botet. * Chrono - accepted January 2011; author: Vicente Botet. The following libraries have been accepted provisionally to Boost, but have not been submitted for mini-review and full acceptance: * Switch - accepted provisionally January 2008; author: Steven Watanabe. * Log - accepted provisionally March 2010; author: Andrey Semashev. * Context - accepted provisionally May 2011; author: Oliver Kowalke. General Announcements ===================== As always, we need experienced review managers. The review schedule has grown substantially but we have few volunteers, so manage reviews if possible and if not please make sure to watch the review schedule and participate. Please take a look at the list of libraries in need of managers and check out their descriptions. In general review managers are active boost participants, including library contributors, infrastructure contributors, and other mailing list participants with a substantial track record of constructive participation. If you can serve as review manager for any of them, email Ron Garcia or John Phillips, "rxg at cs dot cmu dot edu" and "phillips at pacific dot mps dot ohio-state dot edu" respectively. We are also suffering from a lack of reviewers. While we all understand time pressures and the need to complete paying work, the strength of Boost is based on the detailed and informed reviews submitted by you. If you are interested in reviewing a library but won't have time during the review period, you can always prepare your review ahead of time. No rule says you can only work on a review during the review period. A link to this report will be posted to www.boost.org. If you would like us to make any modifications or additions to this report before we do that, please email Ron or John. The review schedule is an unordered list of the libraries awaiting review. As such, any library on the schedule can be reviewed once the developer is ready, a review manager has been secured, and the manager, developer, and wizards agree on a date to schedule the review. Review Schedule =============== * Join (M) * Pimpl (M) * Endian * Conversion * Sorting (M) * AutoBuffer * Containers * Lockfree * Fiber (M) * Quaternions, Vectors, Matrices (M) * Stopwatches * Variadic Macro Data (M) * Type Traits Introspection * Block Pointer (M) * Heaps * Assign v2 * Network (M) * Algorithm * Local (M) ``(M)`` marks libraries that need review managers. -------------------- Join ---- :Author: Yigong Liu :Review Manager: Needed :Download: http://channel.sourceforge.net/ :Description: Join is an asynchronous, message based C++ concurrency library based on join calculus. It is applicable both to multi-threaded applications and to the orchestration of asynchronous, event-based applications. It follows Comega's design and implementation and builds with Boost facilities. It provides a high level concurrency API with asynchronous methods, synchronous methods, and chords which are "join-patterns" defining the synchronization, asynchrony, and concurrency. Pimpl ----- :Author: Vladimir Batov :Review Manager: Needed :Download: | `Boost Vault <http://www.boost-consulting.com/vault/index.php?action=downloadfile&fil…>`__ | http://www.ddj.com/cpp/205918714 (documentation) :Description: The Pimpl idiom is a simple yet robust technique to minimize coupling via the separation of interface and implementation and then implementation hiding. This library provides a convenient yet flexible and generic deployment technique for the Pimpl idiom. It's seemingly complete and broadly applicable, yet minimal, simple and pleasant to use. Endian ------ :Author: Beman Dawes :Review Manager: Joel Falcou :Download: http://svn.boost.org/svn/boost/sandbox/endian/ :Description: Conversion ---------- :Author: Vicente Botet :Review Manager: Gordon Woodhull :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=co…>`__ :Description: Generic explicit conversion between unrelated types. Boost.Conversion provides: * a generic ``convert_to`` function which can be specialized by the user to make explicit conversion between unrelated types. * a generic ``assign_to`` function which can be specialized by the user to make explicit assignation between unrelated types. * conversion between ``std::complex`` of explicitly convertible types. * conversion between ``std::pair`` of explicitly convertible types. * conversion between ``boost::optional`` of explicitly convertible types. * conversion between ``boost::rational`` of explicitly convertible types. * conversion between ``boost::interval`` of explicitly convertible types. * conversion between ``boost::chrono::time_point`` and ``boost::ptime``. * conversion between ``boost::chrono::duration`` and ``boost::time_duration``. Sorting ------- :Author: Steven Ross :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=al…>`__ :Description: A grouping of 3 templated hybrid radix/comparison-based sorting algorithms that provide superior worst-case and average-case performance to std::sort: integer_sort, which sorts fixed-size data types that support a rightshift (default of >>) and a comparison (default of <) operator. float_sort, which sorts standard floating-point numbers by safely casting them to integers. string_sort, which sorts variable-length data types, and is optimized for 8-bit character strings. All 3 algorithms have O(n(k/s + s)) runtime where k is the number of bits in the data type and s is a constant, and limited memory overhead (in the kB for realistic inputs). In testing, integer_sort varies from 35% faster to 2X as fast as std::sort, depending on processor, compiler optimizations, and data distribution. float_sort is roughly 70% faster than std::sort. string_sort is roughly 2X as fast as std::sort. AutoBuffer ---------- :Author: Thorsten Ottosen :Review Manager: Robert Stewart :Download: http://www.cs.aau.dk/~nesotto/boost/auto_buffer.zip :Description: Boost.AutoBuffer provides a container for efficient dynamic, local buffers. Furthermore, the container may be used as an alternative to std::vector, offering greater flexibility and sometimes better performance. Containers ---------- :Author: Ion Gaztanaga :Review Manager: John Maddock :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=bo…>`__ :Documentation: `Boost Sandbox <http://svn.boost.org/svn/boost/sandbox/move/libs/container/doc/html/index.h…>`__ :Description: Boost.Container library implements several well-known containers, including STL containers. The aim of the library is to offers advanced features not present in standard containers or to offer the latest standard draft features for compilers that comply with C++03. Lockfree ------------------ :Author: Tim Blechmann :Review Manager: Hartmut Kaiser :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=bo…>`__ :Documentation: http://tim.klingt.org/boost_lockfree/ :Description: Lockfree provides implementations of lock-free data structures. Lock-free data structures can be accessed by multiple threads without the necessity of blocking synchronization primitives such as guards. Lock-free data structures can be used in real-time systems, where blocking algorithms may lead to high worst-case execution times, to avoid priority inversion, or to increase the scalability for multi-processor machines. Lockfree provides: * boost::lockfree::fifo, a lock-free fifo queue * boost::lockfree::stack, a lock-free stack Fiber ----- :Author: Oliver Kowalke :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=bo…>`__ :Description: C++ Library for launching fibers (micro-threads) and synchronizing data between the fibers. Quaternions, Vectors, Matrices ------------------------------ :Author: Emil Dotchevski :Review Manager: Needed :Download: http://www.revergestudios.com/boost-qvm/ :Description: QVM defines a set of generic functions and operator overloads for working with quaternions, vectors and matrices of static size. The library also defines vector and matrix data types, however it allows users to introduce their own types by specializing the q_traits, v_traits and m_traits templates. Stopwatches ----------- :Author: Vicente Botet :Review Manager: Anthony Williams :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=st…>`__ :Description: On top of the standard facilities of Boost.Chrono, Stopwatches provides: * Stopwatches: A facility to measure elapsed time with the ability to start, stop, suspend, or resume measurement. * Stopwatch concept * Scoped helper classes allowing to pairwise start/stop operations, suspend/resume and resume/suspend a Stopwatch. * stopwatch, model of Stopwatch capturing elapsed Clock times. * stopwatch_accumulator, model of Stopwatch capturing accumulated elapsed Clock times. * Stopclocks: a complete time reporting package that can be invoked in a single line of code. * stopwatch_reporter, convenient reporting to an output stream (including wide char streams) of the elapsed time of models of Stopwatch results. * stopclock<Clock> shortcut of stopwatch_reporter<stopwatch<Clock>> Variadic Macro Data ------------------- :Author: Edward Diener :Review Manager: Needed :Download: `Boost Sandbox <http://svn.boost.org/svn/boost/sandbox/variadic_macro_data/>`__ :Description: The variadic_macro_data library adds support and functionality for variadic macros to Boost as well as integrating variadic macros with the Boost PP library without changing the latter library in any way. Type Traits Introspection ------------------------- :Author: Edward Diener :Review Manager: Joel Falcou :Download: `Boost Sandbox <http://svn.boost.org/svn/boost/sandbox/tti/>`__ :Description: The TTI library, which is an abbreviation for the 'Type Traits Introspection' library, allows a programmer to introspect at compile time the inner elements of a C++ type. The introspection process depends on specifying the name of the inner element by different macros for different types of elements, and then using a generated metafunction to determine whether that element exists within the enclosing type. The inner elements which can be introspected are type, class template, member data, member function, static member data, and static member function. Block Pointer ------------- :Author: Phil Bouchard :Review Manager: Needed :Download: `Boost Sandbox <https://svn.boost.org/svn/boost/sandbox/block_ptr/>`__ :Description: Deterministic memory manager of constant complexity capable of handling cyclic collections. Heaps ----- :Author: Tim Blechmann :Review Manager: Andrew Sutton :Download: http://tim.klingt.org/git?p=boost_heap.git;a=snapshot;h=HEAD;sf=tgz :Description: The Heap library is an implementation of priority queues, data structures that order their elements priority. They are useful in a number of different applications especially graph search algorithms and queuing systems. Whereas the STL provides a class template std::priority_queue, Boost.Heap implements data structures with different features and performance characteristics. One key feature is the inclusion of "mutable" heaps, which allow the priorities of enqueued objects to modified and their position in the queue updated. The heaps in the library also support merging, stable sorting, and equality and less-than comparison. Assign v2 --------- :Author: Erwann Rogard :Review Manager: John Bytheway :Download: `Boost Sandbox <http://svn.boost.org/svn/boost/sandbox/assign_v2>`__ :Description: This library is an upgrade of Boost.Assign 1.0 that redefines its functionality, with optional C++0x support and new features. It expresses repetitive statements for assigning or inserting elements via a basic grammar. Network ------- :Author: Dean Michael Berris :Review Manager: Needed :Download: http://cplusplus-soup.com/2011/04/18/cpp-netlib-0-9-0-released/ :Description: This is a library that provides application layer protocol support using modern C++ techniques. It is light-weight, fast, cross-platform and is intended to be as easy to configure as possible. Algorithm --------- :Author: Marshall Clow :Review Manager: Dave Abrahams :Download: `Boost Sandbox Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=Boost.…>`__ :Description: Boost.Algorithm is a collection of general purpose algorithms. While Boost contains many libraries of data structures, there is no single library for general purpose algorithms. Even though the algorithms are generally useful, many tend to be thought of as "too small" for Boost. An implementation of Boyer-Moore searching, for example, might take a developer a week or so to implement, including test cases and documentation. However, scheduling a review to include that code into Boost might take several months, and run into resistance because "it is too small". Nevertheless, a library of tested, reviewed, documented algorithms can make the developer's life much easier, and that is the purpose of this library. Local ----- :Author: Lorenzo Caminiti :Review Manager: Needed :Download: `Boost Sandbox <http://svn.boost.org/svn/boost/sandbox/local/>`__ :Description: This library supports local functions, local blocks, and local exits Libraries under development =========================== See http://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction for a current listing of libraries under development.

2 1

Re: [Boost-users] [BGL] Problems with planar_face_traversal
by "Ulrich Küttler" 23 May '11

23 May '11

>On Sun, May 22, 2011 at 2:39 PM, "Ulrich Küttler" ><ulrich.kuettler(a)web.de> wrote: >>> >>>I'd love to help out - can you give a self-contained example that >>>doesn't use read_graphviz and your dot file (e.g., construct the graph >>>in the code)? Or, failing that, maybe just describe what's going wrong >>>and how that differs from what you expect to see? >>> >> >> Hi Aaron, >> >> thanks a lot. Here is a self-contained version of my example. The graph is the same. I used boost 1.46.1 on gcc linux to run it. >> >> The graph contains 22 vertices and is supposed to look like this: >> >> 0--- 4--- 6--- 8---10---12---14---16---18---20--- 1 >> | | | | | | | | | | | >> 2--- 5--- 7--- 9---11---13---15---17---19---21--- 3 >> >> Thus, there are 10 faces with 4 vertices each and one face with 22 vertices. At least that is what I suppose there should be. >> >> However, the face traversal results in the following faces (vertices): >> >> 0 12 17 16 >> 12 0 16 18 19 17 >> 1 13 14 15 >> 13 1 15 14 11 9 8 10 >> 2 3 5 7 6 4 >> 3 2 20 18 16 17 19 21 >> 2 4 5 3 21 20 >> 5 4 6 8 9 7 >> 6 7 9 11 10 8 >> 10 11 14 13 >> 19 18 20 21 >> > >Hi Ulrich, > >The diagram you drew above doesn't match the edges you've created in >test_planar2.cpp (for example, test_planar2.cpp adds the edge (0,12), >but that edge doesn't appear in your diagram.) So I'm working off of >the diagram, not the edges you've added in the file, since it's pretty >clear to me what's going on in your diagram. > >What you're getting back is a valid face traversal, as far as I can >tell - I drew it out based on the output and it looks correct (I >modified test_planar2.cpp to reflect the graph you drew above.) The >problem is in your assertion that there are 10 faces with 4 vertices >each and one face with 22 vertices. > >Recall that a "planar embedding" is any clockwise arrangement of the >adjacent vertices around each vertex in a planar graph. The important >fact to realize is that for any planar graph, there's not necessarily >one unique planar embedding. The set of faces of a planar graph are a >function of the planar embedding, not unique to the graph itself, so >there might also be many correct decompositions of a planar graph into >a set of faces. In your drawing, you've singled out one particular >planar embedding that has 10 faces with 4 vertices each and one face >with 22 vertices, but in your code, you're allowing the BGL to create >a planar embedding for you which is not the same as the planar >embedding you have in mind. If you were to manually create the planar >embedding you have in mind above instead, you'd see the face traversal >output you expect. > Hi Aaron, thank you very much. The diagram is indeed the graph I expected. I did not realize that the planar embedding of the graph is not unique. Now this gives me another problem to solve, since I'm looking for a certain set of faces. My current attempt is to add vertices and edges in order to obtain an unique embedding. However, I'm still working on that. Thanks for your advice. Ulrich ___________________________________________________________ Schon gehört? WEB.DE hat einen genialen Phishing-Filter in die Toolbar eingebaut! http://produkte.web.de/go/toolbar

1 0

BoostCon video mirror
by Jeroen Habraken 23 May '11

23 May '11

Hi, After becoming annoyed with blip.tv I've created a mirror of the BoostCon videos with the help of Nikhef (http://www.nikhef.nl/en/) It can be found at http://wipkip.nikhef.nl/events/BoostCon/2010/ and there's a quick overview over at http://vexocide.org/boostcon.html. If desired we'll gladly host the 2011 videos as well. Regards, Jeroen Habraken

1 0

[Interprocess] error_code_t = 9 (already_exists_error) while opening a fixed_managed_shared_memory
by Gaetan Gaumer 23 May '11

23 May '11

Hello Ion and other Interprocess users, we are currently working with fixed_managed_shared_memory segments and we have a strange behavior while opening existing segments. Sometimes (we did not found the exact scenario yet...), when we try to open a fixed_managed_shared_memory in open_only mode with the code below, we get an interprocess_exception with the an error_code_t = 9 ( already_exists_error ). try{ managedSharedMemorySegment = new fixed_managed_shared_memory(boost::interprocess::open_only, memorySegmentName, memorySegmentMappingAdress); }catch (boost::interprocess::interprocess_exception e){ return e.get_error_code(); } A first sight this error_code seems very strange, because in open_only mode the segment is intended to already exists so that should not be an error. Walking the code I found in the mapped_region constructor the following code which trigger the exception : 522: //Check for fixed mapping error if(address && (old_base != address)){ error_info err = system_error_code(); this->priv_close(); throw interprocess_exception(err); } It seems that the mmap function returns an address different that the given one, which is considered an error. So I have two questions : 1) Do you have an idea why the mmap function maps the segment at a different address from the provided one, knowing that this address is the one returned from code below on another process (so should be valid) ? try{ managedSharedMemorySegment = new fixed_managed_shared_memory(boost::interprocess::create_only, memorySegmentName, memorySegmentSize); memorySegmentMappingAdress = managedSharedMemorySegment->get_address(); }catch (boost::interprocess::interprocess_exception e){ return e.get_error_code(); } 2) In the mapped_region constructor, when a non null address value is given as a parameter, could we use the MAP_FIXED flag to force the mmap function to map the segment at the provided address ? Thank you for reading and for your help. Gaëtan

4 9

Problem with boost 1.36 on RHEL4
by Sunil Thomas 23 May '11

23 May '11

Hi all! I am struggling with some unit tests that fail only on RHEL4 release build. They pass on RHEL4 debug, RHEL5 release/debug, likewise also pass on win32, win64 (using either vc8 or vc9).. I've run the debug RHEL4 mode using valgrind, using a minimal case that reproduces the problem and here's what I see (I used the "full, no-reachable mode" to run valgrind; and I see the same output minus line #s, even running valgrind on RHEL4 release build, since that is the only platform-build combo where the test failure happens): ----------------------------------------------------------------------------------------------------------------------------- ==12285== Memcheck, a memory error detector. ==12285== Copyright (C) 2002-2005, and GNU GPL'd, by Julian Seward et al. ==12285== Using LibVEX rev 1575, a library for dynamic binary translation. ==12285== Copyright (C) 2004-2005, and GNU GPL'd, by OpenWorks LLP. ==12285== Using valgrind-3.1.1, a dynamic binary instrumentation framework. ==12285== Copyright (C) 2000-2005, and GNU GPL'd, by Julian Seward et al. ==12285== For more details, rerun with: -v ==12285== ==12285== My PID = 12285, parent PID = 12284. Prog and args are: ==12285== ./xrestunittest_xconn_rescalerd ==12285== ==12285== Syscall param sigaltstack(ss) points to uninitialised byte(s) ==12285== at 0x3AD682EDA9: sigaltstack (in /lib64/tls/libc-2.3.4.so) ==12285== by 0x6488638: boost::detail::signal_handler::~signal_handler() (in /net/ rpenas1.xcp.chevrontexaco.net/vol/vol2/data/grp2/sypb/devl/xrest/trunk/3rdp… ) ==12285== by 0x648975E: boost::execution_monitor::catch_signals(boost::unit_test::callback0<int> const&) (in /net/ rpenas1.xcp.chevrontexaco.net/vol/vol2/data/grp2/sypb/devl/xrest/trunk/3rdp… ) ==12285== by 0x6489813: boost::execution_monitor::execute(boost::unit_test::callback0<int> const&) (in /net/ rpenas1.xcp.chevrontexaco.net/vol/vol2/data/grp2/sypb/devl/xrest/trunk/3rdp… ) ==12285== by 0x648F2E4: boost::unit_test::framework::run(unsigned long, bool) (in /net/ rpenas1.xcp.chevrontexaco.net/vol/vol2/data/grp2/sypb/devl/xrest/trunk/3rdp… ) ==12285== by 0x649BD02: boost::unit_test::unit_test_main(bool (*)(), int, char**) (in /net/ rpenas1.xcp.chevrontexaco.net/vol/vol2/data/grp2/sypb/devl/xrest/trunk/3rdp… ) ==12285== by 0x4147F0: main (init.cpp:132) ==12285== Address 0x7FEFFF3B0 is on thread 1's stack ==12285== ==12285== ERROR SUMMARY: 6 errors from 1 contexts (suppressed: 4 from 1) ==12285== malloc/free: in use at exit: 190,112 bytes in 1,869 blocks. ==12285== malloc/free: 23,128 allocs, 21,259 frees, 2,520,845 bytes allocated. ==12285== For counts of detected errors, rerun with: -v ==12285== searching for pointers to 1,869 not-freed blocks. ==12285== checked 2,184,272 bytes. ==12285== ==12285== LEAK SUMMARY: ==12285== definitely lost: 0 bytes in 0 blocks. ==12285== possibly lost: 0 bytes in 0 blocks. ==12285== still reachable: 190,112 bytes in 1,869 blocks. ==12285== suppressed: 0 bytes in 0 blocks. ==12285== Reachable blocks (those to which a pointer was found) are not shown. ==12285== To see them, rerun with: --show-reachable=yes --------------------------------------------------------------------------------------------- Any ideas from boost experts here on how to resolve this problem is sincerely appreciated.. Thanks in advance, --Thomas.

1 0

What's the status of log library?
by archie14 22 May '11

22 May '11

When the log library (http://boost-log.sourceforge.net/) will be the part of official boost distribution? If there is no log library currently included in boost then what is the one most in use?

5 5

regex_replace for removing words
by Kraus Philipp 22 May '11

22 May '11

Hello, I have some texts and I would like to remove words. Each word for removing is in a std::vector<std::string> and I use a std::string for separating the words on the text. My first idea is to use the boost:split for splitting words of the text, in the result vector I remove the words, which should be removed, and recreate the text from the vector by concatination the elements. But another idea is to create a regexpr with the removing word and the separators and use regex_replace for removing. Which idea is the better one or is there another way to removing word of a text? Thanks PHil

2 2

Re: [Boost-users] [BGL] Problems with planar_face_traversal
by "Ulrich Küttler" 22 May '11

22 May '11

> >I'd love to help out - can you give a self-contained example that >doesn't use read_graphviz and your dot file (e.g., construct the graph >in the code)? Or, failing that, maybe just describe what's going wrong >and how that differs from what you expect to see? > Hi Aaron, thanks a lot. Here is a self-contained version of my example. The graph is the same. I used boost 1.46.1 on gcc linux to run it. The graph contains 22 vertices and is supposed to look like this: 0--- 4--- 6--- 8---10---12---14---16---18---20--- 1 | | | | | | | | | | | 2--- 5--- 7--- 9---11---13---15---17---19---21--- 3 Thus, there are 10 faces with 4 vertices each and one face with 22 vertices. At least that is what I suppose there should be. However, the face traversal results in the following faces (vertices): 0 12 17 16 12 0 16 18 19 17 1 13 14 15 13 1 15 14 11 9 8 10 2 3 5 7 6 4 3 2 20 18 16 17 19 21 2 4 5 3 21 20 5 4 6 8 9 7 6 7 9 11 10 8 10 11 14 13 19 18 20 21 Maybe it is a misinterpretation on my part, maybe I did make a mistake. I just don't see it. Ulrich PS: My first example lacked the edge index initialization. The above problem, however, occurs with an initialized edge index. ___________________________________________________________ Schon gehört? WEB.DE hat einen genialen Phishing-Filter in die Toolbar eingebaut! http://produkte.web.de/go/toolbar

2 1

[Serialization] serialize from and to an already instantiated object.
by nico 22 May '11

22 May '11

Hello. I use boost.serialization to perform save and load to files. If a class is serializable through the boost mechanism, I'd like to easily add the "savable" feature (through serialization and boost archives). Here how I do, and then I've got 2 questions. I don't post all the #include statements. Let's have a serializable class (I only use text archive for this example) ---------MyClass.h--------- class MyClass { friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version); int data_; public: MyClass(); virtual ~MyClass(); }; BOOST_CLASS_EXPORT_KEY(MyClass) ---------MyClass.cpp--------- MyClass::MyClass() : data_(123) {} MyClass::~MyClass() {} template<class Archive> void MyClass::serialize(Archive & ar, const unsigned int version) { ar & data_; } // instanciate the serialize function for text archives #include "boost/archive/text_iarchive.hpp" #include "boost/archive/text_oarchive.hpp" template void MyClass::serialize(boost::archive::text_iarchive & ar, const unsigned int version); template void MyClass::serialize(boost::archive::text_oarchive & ar, const unsigned int version); BOOST_CLASS_EXPORT_IMPLEMENT(MyClass) --------- Now I define a FileSavable class. Its purpose is to add the "save-to-file" feature to a class that can be serialized in a text archive, making the latter inherting from FileSavable, and adding a line in its serialize function, I write it below). ---------FileSavable.h--------- class FileSavable { friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version); public: virtual ~FileSavable() {} void SaveToFile(std::string path); void LoadFromFile(std::string path); }; BOOST_CLASS_EXPORT_KEY(FileSavable) ---------FileSavable.cpp--------- template<class Archive> void FileSavable::serialize(Archive & ar, const unsigned int version) {} void FileSavable::SaveToFile(std::string path) { std::ofstream ofs(path.c_str()); assert(ofs.good()); boost::archive::text_oarchive oa(ofs); oa & this; } void FileSavable::LoadFromFile(std::string path) { std::ifstream ifs(path.c_str()); assert(ifs.good()); boost::archive::text_iarchive ia(ifs); FileSavable* p; ia & p; *this = *p; delete p; } // instanciate the serialize function for text archives #include "boost/archive/text_iarchive.hpp" #include "boost/archive/text_oarchive.hpp" template void FileSavable::serialize(boost::archive::text_iarchive & ar, const unsigned int version); template void FileSavable::serialize(boost::archive::text_oarchive & ar, const unsigned int version); BOOST_CLASS_EXPORT_IMPLEMENT(FileSavable) ---------Modification to MyClass--------- It now inherit from FileSavable: class MyClass : public FileSavable The serialize function call the base class: template<class Archive> void MyClass::serialize(Archive & ar, const unsigned int version) { ar & boost::serialization::base_object<FileSavable>(*this); ar & data_; } --------- Thanks if you read me until here, now my questions: 1) I don't care the FileSavable part of MyClass being serialized, but if I don't call it with boost::serialization::base_object, I have a runtime error: terminate called after throwing an instance of 'boost::archive::archive_exception' what(): unregistered void cast 7MyClass<-11FileSavable Do you see a way to avoid having to add this line in MyClass? Ideally, just having to inheriting from FileSavable would be great: a simple way to add a feature. 2) As you can see, my LoadFromFile function first creates a new MyClass object in p, by de-serializing an archive, and then copies this newly created object into "*this", and finally deletes the object created by the archive d-eserialization. I didn't find a way to avoid this temporary and de-serialize directly in this. Moreover, my solution is not exception-safe, but I didn't manage to de-serialize in a temporary auto_ptr nor boost::shared_ptr. Thanks in advance for replies. Nicolas.

1 0

[BGL] Problems with planar_face_traversal
by "Ulrich Küttler" 22 May '11

22 May '11

Hi all, I'm new to BGL and I already like it a lot. Right now I'm searching for faces in a planar graph. I use boost::planar_face_traversal, however the results I get are confusing. The example I tested consists of 10 faces of 4 vertices each. See side-graph.dot: dot side-graph.dot -Tps > side-graph.ps My test code reads that file and calls both boyer_myrvold_planarity_test and planar_face_traversal. The graph itself seems to be fine, the face traversal fails. Is there anything I do wrong here? Thanks a lot for your help. Ulrich ___________________________________________________________ Schon gehört? WEB.DE hat einen genialen Phishing-Filter in die Toolbar eingebaut! http://produkte.web.de/go/toolbar

2 1

[icl] interval_map<> and overlapping intervals at boundaries
by sguazt 22 May '11

22 May '11

Hello, I don't understand the behavior of icl::interval_map<,> on the following scenario: 1. Before adding a new segment: {([0.179494,0.679494)->0.333333)([2.51847,3.01847)->0.333333)([3.24221,3.74221)->0.333333)} 2. Add segment: ([3.74221,4.24221)->0.333333) 3. After adding the segment: {([0.179494,0.679494)->0.333333)([2.51847,3.01847)->0.333333)([3.24221,4.24221)->0.333333)} What I would expect at step #3 is: {([0.179494,0.679494)->0.333333)([2.51847,3.01847)->0.333333)([3.24221,4.24221)->0.666667)} For the sake of clarity I provide a sample code below: --- [code] --- #include <boost/icl/interval.hpp> #include <boost/icl/interval_map.hpp> #include <iostream> #include <utility> namespace icl = ::boost::icl; int main() { typedef double time_type; typedef double value_type; typedef icl::interval<time_type> interval_type; icl::interval_map<time_type,value_type> intervals; intervals += ::std::make_pair(interval_type::right_open(0.1794936069088625, 0.6794936069088625), 0.3333333333333333); intervals += ::std::make_pair(interval_type::right_open(2.518467327901063, 3.018467327901063), 0.3333333333333333); intervals += ::std::make_pair(interval_type::right_open(3.242205294874485, 3.742205294874485), 0.3333333333333333); std::cout << "Intervals:\n" << intervals << std::endl; intervals += ::std::make_pair(interval_type::right_open(3.742205294874485, 4.242205294874486), 0.3333333333333333); std::cout << "Updated Intervals:\n" << intervals << std::endl; } --- [/code] --- What kind of interval container should I use in order to obtain the wanted result? I'm using the SVN trunk version of boost with GCC 4.5.1 (linux x86_64) Thank you very much for helping me! Best, -- Marco

1 1

program_options: pointer being freed was not allocated
by Matan Nassau 21 May '11

21 May '11

Hi! When I run the following program, #include <boost/program_options.hpp> int main() { boost::program_options::positional_options_description positional; return 0; } the program aborts with the error sandbox(1791) malloc: *** error for object 0x7fff70506500: pointer being freed was not allocated *** set a breakpoint in malloc_error_break to debug My platform is Mac OS X 10.6.7. I installed Boost 1.46.1 on my own, like so: ./bootstrap --prefix=/usr/local ./bjam memory-model=64 ./bjam install The toolset bjam chose was darwin, which uses gcc-4.0 if I understood the build correctly. I also tried rebuilding boost with ./bjam memory-model=64 toolset=darwin-4.2 but the issue persisted. Any idea what causes this crash? Matan

1 1

Re: [Boost-users] [boost][msm] std::vector<MyStateMachine> generate stack overflow
by Christophe Henry 20 May '11

20 May '11

> [Christophe Henry] >> Maybe Stephan is aware of this problem? > > I haven't heard of this problem before. (Is a templated constructor involved? They can be squirrely.) There are quite a few ones, yes. But I'd suspect a problem with inheriting. I got quite a few problems with getting a wrong type when inheriting from state_machine. Specifically, the compiler saw the derived type (we call it Derived) sometimes as Derived, sometimes as state_machine<Derived...>. Regards, Christophe > Stephan T. Lavavej > Visual C++ Libraries Developer

1 0

[hash] hash returning fixed width integer instead of size_t?
by Frédéric Bron 20 May '11

20 May '11

I would like this code return the same hash on different machines: #include <iostream> #include <boost/functional/hash.hpp> int main() { boost::hash<std::string> hasher; std::cout<<hasher("abcd"); return 0; } But I get 1244709680 when size_t is 32 bits and 706246339511088 when size_t is 64 bits. Is it possible to have hash work with fixed width uint32_t instead of size_t? Frédéric

2 4

[Bind] Binding a sequence of operations.
by Robert Jones 20 May '11

20 May '11

Hi All Is it possible to write this code as a for_each/bind combination? I know I could do this with Boost.Lambda or Boost.Phoenix, which is my solution of last resort, but can it be done with plain Boost.Bind? What I think I'm missing is a bindable sequence operator - is there any such thing? Thanks, Rob #include <vector> #include <boost/bind.hpp> #include <boost/range.hpp> struct X { }; void do_this( const X & ); void do_that( const X & ); typedef std::vector<X> Xs; int main( ) { Xs xs; for( Xs::const_iterator x = boost::begin(xs); x != boost::end(xs); ++x ) { do_this( * x ); do_that( * x ); } }

1 0

Asio unhandled exception
by Łukasz Majewski 20 May '11

20 May '11

Hello, I created a server single thread async (linux) and clinet (win). Every time client is close while server is writing to the socket connected to this client exception appears: terminate called after throwing an instance of 'boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<boost::system::system_error>>' what(): Transport endpoint is not connected Aborted and server is terminated. I dont know why this exception is unhandled. int main( int argc, char** argv ) { try { boost::asio::io_service io_service; quotation_server server( io_service ); while ( true ) { try { io_service.run(); } catch( ... ){} } } catch ( std::exception& e ) { LOG << e.what() << std::endl; } catch( ... ) { LOG << "Unexpected exception" << std::endl; } return 0; }

2 1

Which version can I use for my old compiler?
by spam-receiver＠web.de 20 May '11

20 May '11

I am forced to use the old Sun Workshop 6 toolset in my project. Where do I find a summary of which Boost version to which degree supports this toolset? Thanks in advance, Thomas

1 0

[PropertyTree] Using with std algorithms
by Robert Jones 20 May '11

20 May '11

Hi All Is it possible and practical to use the put and get methods of Boost.PropertyTree with std algorithms? I've written this snippet, which doesn't compile, which I think is because I have not correctly expressed the return type of "put()". Is it possible to do this? Thanks, - Rob. #include <algorithm> #include <vector> #include <boost/range.hpp> #include <boost/bind.hpp> #include <boost/property_tree/ptree.hpp> int main( ) { using boost::property_tree::ptree; std::vector<unsigned> v; ptree tree; for_each( boost::begin( v ), boost::end( v ), bind( static_cast<void (ptree::*)( const std::string &, unsigned )>( & ptree::put ), boost::ref( tree ), "Values.value", _1 ) ); } > g++ ptree.cpp ptree.cpp: In function ‘int main()’: ptree.cpp:15: error: invalid static_cast from type ‘<unresolved overloaded function type>’ to type ‘boost::property_tree::ptree& (boost::property_tree::basic_ptree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > >::*)(const std::string&, unsigned int)’

2 4

[Serialization] assert fail and unregistered class
by Jari 19 May '11

19 May '11

Hi I get assert fail and "unregistered class - derived class not registered or exported" when serializing. I have many classes being saved already in the code but i ran to a problem saving certain std::list with derived classes. (I also have similar classes and list being serialized before) i think its the same issue as in here: http://boost.2283326.n4.nabble.com/serialization-polymorphic-archives-runti… i have boost version 1.46.1 and visual studio express 2010 heres the call stack: msvcr100d.dll!_wassert(const wchar_t * expr, const wchar_t * filename, unsigned int lineno) Line 325 C gamevc10dbg.exe!boost::archive::detail::basic_serializer_map::find(const boost::serialization::extended_type_info & eti) Line 102 + 0x16 bytes C++ gamevc10dbg.exe!boost::archive::detail::archive_serializer_map<boost::archive::binary_oarchive>::find(const boost::serialization::extended_type_info & eti) Line 67 C++ gamevc10dbg.exe!boost::archive::detail::save_pointer_type<boost::archive::binary_oarchive>::polymorphic::save<BasePlayer>(boost::archive::binary_oarchive & ar, BasePlayer & t) Line 435 + 0xe bytes C++ gamevc10dbg.exe!boost::archive::detail::save_pointer_type<boost::archive::binary_oarchive>::save<BasePlayer>(boost::archive::binary_oarchive & ar, const BasePlayer & t) Line 460 + 0xd bytes C++ gamevc10dbg.exe!boost::archive::detail::save_pointer_type<boost::archive::binary_oarchive>::invoke<BasePlayer *>(boost::archive::binary_oarchive & ar, BasePlayer * const t) Line 473 + 0xd bytes C++ gamevc10dbg.exe!boost::archive::save<boost::archive::binary_oarchive,BasePlayer * const>(boost::archive::binary_oarchive & ar, BasePlayer * const & t) Line 525 + 0xf bytes C++ gamevc10dbg.exe!boost::archive::detail::common_oarchive<boost::archive::binary_oarchive>::save_override<BasePlayer * const>(BasePlayer * const & t, int __formal) Line 69 + 0x15 bytes C++ gamevc10dbg.exe!boost::archive::basic_binary_oarchive<boost::archive::binary_oarchive>::save_override<BasePlayer *>(BasePlayer * const & t, int version) Line 76 C++ gamevc10dbg.exe!boost::archive::binary_oarchive_impl<boost::archive::binary_oarchive,char,std::char_traits<char> >::save_override<BasePlayer *>(BasePlayer * & t, int __formal) Line 52 C++ gamevc10dbg.exe!boost::archive::detail::interface_oarchive<boost::archive::binary_oarchive>::operator<<<BasePlayer *>(BasePlayer * & t) Line 64 C++ gamevc10dbg.exe!saveGame() Line 63 + 0x12 bytes C++ gamevc10dbg.exe!SDL_main(int argc, char * * argv) Line 1517 + 0x5 bytes C++ gamevc10dbg.exe!_main() + 0xfd bytes C gamevc10dbg.exe!_WinMain@16() + 0x1cd bytes C gamevc10dbg.exe!__tmainCRTStartup() Line 547 + 0x2c bytes C gamevc10dbg.exe!WinMainCRTStartup() Line 371 C kernel32.dll!75451194() [Frames below may be incorrect and/or missing, no symbols loaded for kernel32.dll] ntdll.dll!76fbb429() ntdll.dll!76fbb3fc() gamevc10dbg.exe!__CT??_R0?AVbad_cast@std@@@8??0bad_cast@std@@QAE@ABV01@@Z12() + 0xd2ce bytes C++ 003426e2() does any one know whats wrong? I have no idea how to solve this, i have tried everything! i should have all BOOST_CLASS_EXPORT_GUID in place. thx

1 0

To find a path between two vertices in a tree.
by Nishchal Devnur 19 May '11

19 May '11

Hi, I am looking for a implementation in boost that is efficient in finding a path between two vertices in a given tree. I am right now using the unidrected adjancency list to store the tree. Given a node u and node v I would like to find the path between these two nodes in the tree. Any suggestions is greatly appreciated ! Thanks, Nishchal Devanur

3 3

[asio] io_service::run() throws "Transport endpoint is not connected" exception.
by Slav 19 May '11

19 May '11

Hello. I use io_service to asynchronously accept incoming TCP connections and then only asynchronously read/write into accepted incoming connections. Each operation is embraced into try/catch. Call to socket::shutdown(), sometimes, just under Linux (not Windows), fails with "Transport endpoint is not connected" error. That's alright - my server keeps working, but, much more rarely (at least 10 times) an exception with the same name is thrown from io_service::run() which makes my server crash. I embraces all operations with asio (io_service::run(), async_accept(), async_read_some() and async_write()) but it didn't helped - I still catch this exception. It does not happen under Windows. Hot to get rid of it? What's the reason of the exception? Thank you.

1 0

Syntax error using signal1 from Boost 1.34.1 on VC6
by tangleman＠secules.net 19 May '11

19 May '11

I am trying to use Boost signals to set up events with VC6. I discovered that build 1.34.1 is the last build to support VC++ 6.0, so that is the version I need to compile with. I noticed from the Signals tutorial on the Boost site that for VC++ 6.0, I have to use the portable syntax. So I declared my signal: #include <boost\signals.hpp> #include <boost\signals\signal1.hpp> #include <vector> typedef boost::signal1<void, std::vector<unsigned char>> signal_t; I am using a vector of unsigned chars as a parameter to the signal handler (event handler), since I am essentially receiving data from an ethernet connection, parsing it, and sending it through the event back to the subscriber. Now the error. using the above code, I get the following error: error C2146: syntax error: missing ',' before identifier 'signal_t' I'm pretty sure I checked and double-checked the syntax several times, comparing it to the example in the signals tutorial. All I can think of is that a vector is not supported as a parameter, yet it was for version 1.46 that I tried earlier. Am I doing anything wrong? Quick responses are much appreciated! Thanks! Chris

4 3

64bit boost compile
by Artem Tsigankov 19 May '11

19 May '11

Hello! I've some problem while comlile boost for 64 bit system. I'd used ./bjam address-model=64 and ./bjam install commands to compile and build boost, but when i configure fusecompress i got the next message: Boost library compiled for 32bit architecture without long file support!What's wrong?

2 1

[asio] iPad: resolver fails on a "fresh" 3G
by 乔志强 19 May '11

19 May '11

Switch "airplane mode" off and on does not establish a "3G connection". You may active a PDP context before call tcp::resolver::query(connect internet).. > Moreover, it seems that if I try the above query several times, it > succeedes after a while. Maybe iOS active a PDP context for you when you first use the TCP protocol, so You will wait and re-try. You can compare the IP of iPad after switch "airplane mode" off and on and after open the browser. > Message: 3 > Date: Wed, 18 May 2011 16:03:41 +0300 > From: Igor R <boost.lists(a)gmail.com> > To: boost-users(a)lists.boost.org > Subject: [Boost-users] [asio] iPad: resolver fails on a "fresh" 3G > connection > Message-ID: <BANLkTimVfGrDNVXME4VbfPqn-zJsOUOXQg(a)mail.gmail.com> > Content-Type: text/plain; charset=UTF-8 > > Hello, > > I admit this is probably not a pure ASIO question, but perhaps someone > already encountered the following issue (boost 1.46, iOS4.3). > > When trying to resolve a host name just after 3G connection is > established (eg., switch "airplane mode" off and on), I get the > following error: "Host not found (authoritative)". > The query looks like this: > tcp::resolver::query query(tcp::v4(), "my.host.com", "9988"); > > On the other hand, if prior to the above query I open the browser or > some other application that connect to the Internet, then the query > works correctly. > Moreover, it seems that if I try the above query several times, it > succeedes after a while. > > Another interesting point: all the above occurs with 3G connection > only, while with WiFi everything works well. > > What's could be the reason of such a weird behavior? > > Thanks. > >

4 6

Re: [Boost-users] bidirectional map
by Uthpal Urubail 19 May '11

19 May '11

I am getting the compiler errors when i use the below The error is ONLY when i instantiate the integrator object: I.e.... index_iterator<Ply_Table,PlyPtr>::type ic00,ic11; Errors: Error 1 error C2027: use of undefined type 'boost::STATIC_ASSERTION_FAILURE<x>' c:\software\hm11_sa101_dev\third_party\boost\boost_1_41_0\boost\multi_in dex_container.hpp 793 Error 2 error C2039: 'iterator' : is not a member of 'boost::mpl::void_' c:\software\hm11_sa101_dev\third_party\boost\boost_1_41_0\boost\multi_in dex_container.hpp 936 Error 3 error C2146: syntax error : missing ';' before identifier 'type' c:\software\hm11_sa101_dev\third_party\boost\boost_1_41_0\boost\multi_in dex_container.hpp 936 Etc.. Source Code: typedef multi_index_container< Ply_Model, indexed_by< ordered_non_unique< tag<ElementPtr>, key_from_key< BOOST_MULTI_INDEX_MEMBER(elementpointer,const size_t,Id), BOOST_MULTI_INDEX_MEMBER(Ply_Model,const elementpointer *,ElementPtr) > >, ordered_non_unique< tag<plypointer>, key_from_key< BOOST_MULTI_INDEX_MEMBER(plypointer,const size_t,Id), BOOST_MULTI_INDEX_MEMBER(Ply_Model,const plypointer *,PlyPtr) > > > > Any help in this regard would be highly appriocated Regards, UJ

1 0

[boost] can't access svn repository
by Tran Quoc Ngan 19 May '11

19 May '11

Hi, I need help how to access the boost source repository, when I access the anonymous repository it required an account for accessing. Please tell me how to acquire an account for the main source repository Any help will be appreciated !

1 0

bidirectional map
by Uthpal Urubail 19 May '11

19 May '11

I am looking for a bidirectional container. Requirement Detail: I need to build a data base where by giving the key i should be getting the list of values. And vice versa [i.e By giving One Value get the list of keys] Eg: For Getting the stacks [SHOULD be in same sequence] Given an element id -11 stacks should be 5, 7 & 4 [Same sequence] For eid id 16 - stacks ids - 5, 2 & 7 And for the other way... Given the stack id 5 eids should be - 11, 16, 7 & 12 [Not necessary to be in same sequence] For stack id 4 - eids- 11 & 12 Please let me know if i could achieve this requirement by using one boost container Any help in this regard would be highly appriocated Regards, UJ

1 0

bidirectional map
by Uthpal Urubail 19 May '11

19 May '11

I am looking for a bidirectional container. Requirement Detail: I need to build a data base where by giving the key i should be getting the list of values. And vice versa [i.e By giving One Value get the list of keys] Eg: Eid Stacks stackid -5 stackid-2 stackid-7 Stacked-4 11 √ √ √ 16 √ √ √ 7 √ √ √ 12 √ √ √ For Getting the stacks [SHOULD be in same sequence] Given an element id -11 stacks should be 5, 7 & 4 [Same sequence] For eid id 16 - stacks ids - 5, 2 & 7 And for the other way... Given the stack id 5 eids should be - 11, 16, 7 & 12 [Not necessary to be in same sequence] For stack id 4 - eids- 11 & 12 Please let me know if i could achieve this requirement by using one boost container Any help in this regard would be highly appriocated Regards, UJ

1 0

Re: [Boost-users] [boost][msm] std::vector<MyStateMachine> generate stack overflow
by Christophe Henry 18 May '11

18 May '11

>Hi, > > >while playing with MSM using VS2010+SP1 in a very simple test project (I'm really just trying to test how to organize states classes in files), I've tried to see if I was able to create as many >state machines as I wanted, so I started to write a simple > > std::vector<MyStateMachine> state_machines(42); > > >Here MyStateMachine is an empty state machine class with default front-end and back-end, with only two empty states. > > >VC10.1 produce a warning on this line saying that there will be a stack overflow because there is a runtime recursion. I checked, it does crash (in debug at least). I'd be quite surprised that it has much to do with the vector. I tried for security on a tutorial and all works ok. I'd more likely suspect an incorrect state machine definition, but without code I cannot help you much. Regards, Christophe

2 2

Boost serialization archive stream error exception
by Marco Piacentini 18 May '11

18 May '11

Hi guys..I've the following problem.. I have a file called A.h and a file B.h. each contains some struct like this: (the structs inside the two classes are different) struct Base { friend class access; template <typename Archive> void serialize(Archive& ar,const unsigned int version) { ar & fieldLength; ar & fieldMD; ar & fieldTime_Stamp; } public: unsigned int fieldLength; unsigned int fieldMD; unsigned int fieldTime_Stamp; virtual void f(){} //to be polymorphic the struct }; struct Derived:public Base { . ... } So i serialize the struct in the classic manner: .... std::ostringstream archive_stream; boost::archive::text_oarchive archive(archive_stream); archive.register_type(static_cast<Derived*>(NULL)) archive <<p; // where p is a pointer to Base NOW THE PROBLEM... on the deserialization side, I follow the same (inverse) procedure...if I deserialize singularly the structs in A.h (without include in the project B.h) and the structs in B.h (without include in the project A.h) all works....but If I include in the project both the classes, the deserialization works for one class, but throws the "Stream error exception" in the instruction " archive >> m;" for the other...it seems a conflict in the registration class or something like this... Any ideas?thanks...

2 1

Link errors building against Boost Python
by Chris Weisiger 18 May '11

18 May '11

I'm trying to build PyFTGL against 64-bit Python2.7. PyFTGL uses Boost, so I have to build Boost as well (the downloadable installers are all 32-bit). I created a user-config.jam in my home directory with this line: using python : 2.7 : C:\\Python27x64\\python.exe ; and then built Boost's Python libraries with > bjam.exe --toolset=msvc-9.0 --address-model=64 --with-python PyFTGL uses Python's distutils to build, which doesn't know how to find libraries whose names start with "lib", so I renamed the .lib files in the stage/lib directory: "libboost_python-vc90-mt-1_46_1.lib" to "boost_python-vc90-mt-1_46_1.lib" and so on. Then I tried to build PyFTGL with this: > C:\Python27x64\python.exe setup.py build I get 41 link errors. Here's the first: ftgl.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) protected: __cdecl boost::python::detail::tuple_base::tuple_base(struct boost::python::detail::new_reference_t *)" (__imp_??0tuple_base@detail @python@boost@@IEAA@PEAUnew_reference_t@123@@Z) referenced in function "public: __cdecl boost::python::tuple::tuple(struct boost::python::detail::new_reference_t *)" (??0tuple@python@boost@ @QEAA@PEAUnew_reference_t@detail@12@@Z) I've put the entire output up on a pastebin here: http://pastebin.com/iuPzKdKs Any ideas what's going wrong here? Thanks for any suggestions! -Chris

3 6

To store Boost graph object in a file
by Amanullah Yasin 18 May '11

18 May '11

Hi, I have to store Boost Graph object in a text file and later read it and compare it with other graph. If any one have an idea or implementation please share it. It will be save my time. Thanks in advance. Best Regards YASIN *Always have your stuff when you need it with @Dropbox. 2GB account is free! http://db.tt/xOEJ2Ag*

3 2

[msm] State machine in vector producing recursive call.
by Klaim - Joël Lamotte 18 May '11

18 May '11

Hi, while playing with MSM using VS2010+SP1 in a very simple test project (I'm really just trying to test how to organize states classes in files), I've tried to see if I was able to create as many state machines as I wanted, so I started to write a simple std::vector<MyStateMachine> state_machines(42); Here MyStateMachine is an empty state machine class with default front-end and back-end, with only two empty states. VC10.1 produce a warning on this line saying that there will be a stack overflow because there is a runtime recursion. I checked, it does crash (in debug at least). Is it a bug? I've not found time yet to follow the code see why that produce a recursion (??!!!), but in doubt I verified simple cases : MyStateMachine state_machine ; // no problem MyStateMachine state_machines[42]; // no problem I'll post the full code here once I get home, can't access my test project at my dayjob. I think it might be a well known problem so I ask here first. Joël Lamotte

1 0

Fwd: [MPL] How can I make this occupy less space on disk?
by Pedro d'Aquino 18 May '11

18 May '11

Hello, I'm using Boost.MPL to obfuscate sensitive strings during compilation. I wrote a class called obf_string which can be used in the following way: obf_string<'my_d','atab','ase_','pass','word'> password; connect_to_db( password.unobfuscate() ); If someone runs strings.exe on this executable, they will not see "my_database_password" listed there, because it has been XORed with a binary mask. This approach has several benefits over e.g. preprocessing all the source files with a tool that encrypts all strings. The most significant is that I can easily see and change the string. The problem is that my implementation of obf_string is occupying too much space on disk. I have devised a test to compare it with a normal std::string. The test files, which are attached (test_stdstring.cpp and test_obfstring.cpp), contain 50 different strings each. In one file they are used to construct std::strings, in the other one they are obfuscated through obf_string. On average, each new std::string added 188 bytes, while each obf_string occupied 690 bytes. Here's a plot that shows the difference: http://img59.imageshack.us/img59/6417/obfstring.png. Everything was compiled on VC++10 with /O1 (minimize size). I'm using Boost 1.46.1. I would like to understand why obf_strings take up so much space, and figure out ways I can minimize this. This is really important to me - our application currently instantiates obf_string over 600 times, so the overhead is starting to add up. Naturally, I have also attached the full source code of obf_string. Any help would be greatly appreciated! Thanks, Pedro d'Aquino

3 4

[asio] iPad: resolver fails on a "fresh" 3G connection
by Igor R 18 May '11

18 May '11

Hello, I admit this is probably not a pure ASIO question, but perhaps someone already encountered the following issue (boost 1.46, iOS4.3). When trying to resolve a host name just after 3G connection is established (eg., switch "airplane mode" off and on), I get the following error: "Host not found (authoritative)". The query looks like this: tcp::resolver::query query(tcp::v4(), "my.host.com", "9988"); On the other hand, if prior to the above query I open the browser or some other application that connect to the Internet, then the query works correctly. Moreover, it seems that if I try the above query several times, it succeedes after a while. Another interesting point: all the above occurs with 3G connection only, while with WiFi everything works well. What's could be the reason of such a weird behavior? Thanks.

1 0

[boost][msm] std::vector<MyStateMachine> generate stack overflow
by Klaim - Joël Lamotte 18 May '11

18 May '11

Hi, while playing with MSM using VS2010+SP1 in a very simple test project (I'm really just trying to test how to organize states classes in files), I've tried to see if I was able to create as many state machines as I wanted, so I started to write a simple std::vector<MyStateMachine> state_machines(42); Here MyStateMachine is an empty state machine class with default front-end and back-end, with only two empty states. VC10.1 produce a warning on this line saying that there will be a stack overflow because there is a runtime recursion. I checked, it does crash (in debug at least). Is it a bug? I've not found time yet to follow the code see why that produce a recursion (??!!!), but in doubt I verified simple cases : MyStateMachine state_machine ; // no problem MyStateMachine state_machines[42]; // no problem I'll post the full code here once I get home, can't access my test project at my dayjob. I think it might be a well known problem so I ask here first. Joël Lamotte

1 0

MPI rank() & size() type
by Kraus Philipp 17 May '11

17 May '11

Hello, I use Boost MPI for some project, but I have a question of the return datatype of the communication rank() and size(). size() returns a unsigned datatype, but rank() a signed, so if I compare rank() with size() I will get a warning. Is there a reason for using different return types? Thanks Phil

1 0

Segmentation fault when throwing exception?
by Germán Diago 17 May '11

17 May '11

Hello, I have some code that throws an exception through BOOST_THROW_EXCEPTION. The class derives from std::runtime_error. The thing is that my program crashes and doesn't catch the exception if I use this macro, but if I use a language throw it behaves correctly. Does anyone have a clue? My code doesn't spawn threads. Thanks in advance.

4 6

BOOST_PP_ENUM_z
by er 17 May '11

17 May '11

Could someone please help clarify the meaning of the _z extension? In what situation should one use BOOST_PP_ENUM_z rather than BOOST_PP_ENUM? Usage BOOST_PP_ENUM_ ## z(count, macro, data) Arguments z The next available BOOST_PP_REPEAT dimension. http://www.boost.org/doc/libs/1_33_1/libs/preprocessor/doc/ref/enum_z.html Examples: #include <boost/preprocessor/arithmetic/inc.hpp> #include <boost/preprocessor/repetition/enum_params.hpp> #include <boost/preprocessor/repetition/repeat.hpp> #define MACRO(z, n, _) \ template< \ BOOST_PP_ENUM_PARAMS_Z(z, BOOST_PP_INC(n), class T) \ > class X ## n { \ /* ... */ \ }; \ /**/ BOOST_PP_REPEAT(2, MACRO, nil) #define MACRO1(z, n, _) \ template< \ BOOST_PP_ENUM_PARAMS(BOOST_PP_INC(n), class T) \ > class Y ## n { \ /* ... */ \ }; \ /**/ BOOST_PP_REPEAT(2, MACRO1, nil) int main (int argc, char * const argv[]) { typedef X0<int> x0; typedef X1<int, int> x1; typedef Y0<int> y0; typedef Y1<int, int> y1; return 0; }

2 1

Re: [Boost-users] [interprocess] Lost communications and mysterious names
by Roger 17 May '11

17 May '11

> From: "Ion Gaztañaga" <igaztanaga(a)gmail.com> > To: Boost User List <boost-users(a)lists.boost.org> > Date: Wed, 11 May 2011 21:20:54 +0200 > Subject: Re: [Boost-users] [interprocess] Lost communications and mysterious names > El 10/05/2011 23:18, Roger escribió: >> >> I'm using boost 1.46 on windows XP and I am having occasional issues >> with interprocess. Sometimes I lose communications between programs. >> I've located the directory where the files that enable the >> interprocess communication are created. Usually the files have the >> name I provide to the managed_shared_memory object in the code. >> However, when the problem occurs a file named something like >> "70C0A8E6490FCC01E55D313B550FCC01" appears. When the programs >> terminate this file disappears, while the normally named files >> persist. > > That name is produced when you unlink the shared memory. Code renames in-use file and marks it as delete-on-close so that it's really erased when any attached program ends. This emulates unix-like unlink behaviour. Are you unlinking the shm while in use? > > best, > > Ion I was using shared_memory_object::remove(name), if that's what you mean by unlinking. Actually I'd already solved my problem before I even asked the question - I just accidentally commented that bit out. What I was doing was periodically reopening the shared memory in processes that were reading only. So if another process removed and recreated it, it would eventually find the new copy. Is this a sensible way to do it? Is there a function to test whether the memory has been removed? The only reason I was recreating the shared memory was to ensure a cleanly initialised empty space. Perhaps I should turf the whole recreating process and go with a clearing process instead. That should be fine once what I'm sharing is fixed. But during development it can change, and I recall the programs crashing if they open an old file and try to read a variable which wasn't there in the old version.

2 1

Compiling Issue
by Manoj Jangid 16 May '11

16 May '11

I am trying to compile a small boost thread sample in Windows 64 bit, its give me an error *LINK : fatal error LNK1104: cannot open file 'libboost_thread-vc100-mt-s-1_46_1.lib' *I have searched all the folder, rebuild boost with bjam but there is no *'libboost_thread-vc100-mt-s-1_46_1.lib' * Here is the output C:\personal\boost>cl /W3 /Zi /EHsc thread.cpp Microsoft (R) C/C++ Optimizing Compiler Version 16.00.40219.01 for x64 Copyright (C) Microsoft Corporation. All rights reserved. thread.cpp Microsoft (R) Incremental Linker Version 10.00.40219.01 Copyright (C) Microsoft Corporation. All rights reserved. /out:thread.exe /debug thread.obj LINK : fatal error LNK1104: cannot open file 'libboost_thread-vc100-mt-s-1_46_1.lib' What I am missing or doing wrong here? Thanks

1 0

xpressive
by Louis Lavery 16 May '11

16 May '11

I'm trying to get started with boost xpressive, but have problems with this simple attempt... #pragma warning(disable:4180) // MSVC: qualifier applied to function type has no meaning; ignored #pragma warning(disable:4224) // MSVC: nonstandard extension used : formal parameter 'value' was previously defined as a type #pragma warning(disable:4996) // MSVC: 'std::transform' was declared deprecated #include <boost/xpressive/xpressive_static.hpp> void f() { using namespace boost::xpressive; sregex rex = as_xpr('k'); } ...which gives these errors... ------ Build started: Project: miscTest, Configuration: Debug Win32 ------ Compiling... main.cpp c:\boost_1_45_0\boost\xpressive\detail\static\transforms\as_matcher.hpp(27) : error C2146: syntax error : missing ';' before identifier 'data_type' c:\boost_1_45_0\boost\xpressive\detail\static\transforms\as_sequence.hpp(31) : see reference to class template instantiation 'boost::xpressive::grammar_detail::as_matcher::impl<Expr,State,Data>' being compiled with [ Expr=const boost::proto::exprns_::expr<boost::proto::tag::terminal,boost::proto::argsns_::term<char>,0> &, State=boost::xpressive::detail::end_xpression, Data=boost::xpressive::detail::xpression_visitor<std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>,boost::mpl::false_,traits_type> ] c:\boost_1_45_0\boost\proto\matches.hpp(828) : see reference to class template instantiation 'boost::xpressive::grammar_detail::in_sequence<Grammar>::impl<Expr,State,Data>' being compiled with [ Grammar=boost::xpressive::grammar_detail::as_matcher, Expr=const boost::proto::exprns_::expr<boost::proto::tag::terminal,boost::proto::argsns_::term<char>,0> &, State=boost::xpressive::detail::end_xpression, Data=boost::xpressive::detail::xpression_visitor<std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>,boost::mpl::false_,traits_type> ] c:\boost_1_45_0\boost\xpressive\detail\static\compile.hpp(45) : see reference to class template instantiation 'boost::proto::switch_<Cases>::impl<Expr,State,Data>' being compiled with [ Cases=boost::xpressive::grammar_detail::Cases<char,boost::xpressive::Grammar<char>>, Expr=const boost::proto::exprns_::expr<boost::proto::tag::terminal,boost::proto::argsns_::term<char>,0> &, State=boost::xpressive::detail::end_xpression, Data=visitor_type & ] c:\boost_1_45_0\boost\xpressive\detail\static\compile.hpp(79) : see reference to function template instantiation 'void boost::xpressive::detail::static_compile_impl2<Xpr,BidiIter,traits_type>(const Xpr &,const boost::shared_ptr<T> &,const Traits &)' being compiled with [ Xpr=boost::proto::exprns_::expr<boost::proto::tag::terminal,boost::proto::argsns_::term<char>,0>, BidiIter=std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>, T=boost::xpressive::detail::regex_impl<std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>>, Traits=traits_type ] c:\boost_1_45_0\boost\xpressive\detail\static\compile.hpp(99) : see reference to function template instantiation 'void boost::xpressive::detail::static_compile_impl1<Xpr,BidiIter>(const Xpr &,const boost::shared_ptr<T> &)' being compiled with [ Xpr=boost::proto::exprns_::expr<boost::proto::tag::terminal,boost::proto::argsns_::term<char>,0>, BidiIter=std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>, T=boost::xpressive::detail::regex_impl<std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>> ] c:\boost_1_45_0\boost\xpressive\basic_regex.hpp(252) : see reference to function template instantiation 'void boost::xpressive::detail::static_compile<Expr,BidiIter>(const Xpr &,const boost::shared_ptr<T> &)' being compiled with [ Expr=boost::proto::exprns_::expr<boost::proto::tag::terminal,boost::proto::argsns_::term<char>,0>, BidiIter=std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>, Xpr=boost::proto::exprns_::expr<boost::proto::tag::terminal,boost::proto::argsns_::term<char>,0>, T=boost::xpressive::detail::regex_impl<std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>> ] c:\boost_1_45_0\boost\xpressive\basic_regex.hpp(118) : see reference to function template instantiation 'void boost::xpressive::basic_regex<BidiIter>::compile_<Expr>(const Expr &,boost::mpl::true_)' being compiled with [ BidiIter=std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>, Expr=boost::proto::exprns_::expr<boost::proto::tag::terminal,boost::proto::argsns_::term<char>,0> ] c:\othertrunk\other\misc\src\main.cpp(12) : see reference to function template instantiation 'boost::xpressive::basic_regex<BidiIter>::basic_regex<boost::proto::exprns_::expr<Tag,Args,Arity>>(const Expr &)' being compiled with [ BidiIter=std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>, Tag=boost::proto::tag::terminal, Args=boost::proto::argsns_::term<char>, Arity=0, Expr=boost::proto::exprns_::expr<boost::proto::tag::terminal,boost::proto::argsns_::term<char>,0> ] c:\boost_1_45_0\boost\xpressive\detail\static\transforms\as_matcher.hpp(27) : error C4430: missing type specifier - int assumed. Note: C++ does not support default-int c:\boost_1_45_0\boost\xpressive\detail\static\transforms\as_matcher.hpp(27) : error C4430: missing type specifier - int assumed. Note: C++ does not support default-int c:\boost_1_45_0\boost\xpressive\detail\static\transforms\as_matcher.hpp(30) : error C2653: 'data_type' : is not a class or namespace name c:\boost_1_45_0\boost\xpressive\detail\static\transforms\as_matcher.hpp(30) : fatal error C1903: unable to recover from previous error(s); stopping compilation Build log was saved at "file://c:\otherTrunk\libs\misc\test\vc\Debug\BuildLog.htm" miscTest - 5 error(s), 0 warning(s) ========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ========== tia, Louis.

5 9

Boost-serialization "unsupported version" exception
by Marco Piacentini 16 May '11

16 May '11

Hi guys...I have this scenario...A client which uses the version 1.46.1 of boost and serializes some structs, and a server which (must)uses the version 1.38 of boost. The problem is that when I try to deserialize the data on the server side, I've got the "unsupported version" exception... Is there any way to serialize with a downgrade version?Other suggestions?Thanks in advance...

1 0

[boost-users][GIL] Colors broken after moving to New IO
by Szymon Gatner 15 May '11

15 May '11

Hi, Since New IO is now accepted to BOOST I could replace old one with new version (review one). Problem is, the moment I replaced header file and png_load_file() to load_image() all images have invalid colors. Am I doing to little by just replacing those 2? Regadrds, Szymon

3 13

Stack over flow error in the Chrobak_Payne_drawing.hpp
by Nishchal Devnur 14 May '11

14 May '11

> Hi All, > > I am trying to use the Chrobak_Payne_straight_line_drawing function to get > a straight line drawing of a biconnected and maximally planar graph. But I > am getting a stackoverflow error in the the Chrobak_Payne_drawing.hpp file. > https://docs.google.com/leaf?id=0B4H5FyR7-PhTYTg1ZmFjNDctNmE1ZC00NzYyLWIwM2… is the link to the screenshot of the stacktrace. The accumulate_offset > in the hpp file is being recursively called and hence the stackoverflow. I > am not sure whats the cause of this error. > > Here is the piece of my code : > > embedding_storage_t embedding_storage2(num_vertices(tempGraph)); > embedding_t embedding2(embedding_storage2.begin(), > get(vertex_index,tempGraph)); > isplanar = boyer_myrvold_planarity_test(boyer_myrvold_params::graph = > tempGraph, > boyer_myrvold_params::embedding = > &embedding2[0] > ); > // Find a canonical ordering > typedef std::vector<graph_traits<Graph>::vertex_descriptor> > ordering_storage_t; > ordering_storage_t ordering; > > planar_canonical_ordering(tempGraph, embedding2, > std::back_inserter(ordering)); > ordering_storage_t::iterator oi; > for ( oi = ordering.begin();oi!=ordering.end();oi++) > cout<<*oi<<endl; > > //Set up a property map to hold the mapping from vertices to coord_t's > typedef std::vector< planar_coord > straight_line_drawing_storage_t; > typedef boost::iterator_property_map > <straight_line_drawing_storage_t::iterator,property_map<Graph, > vertex_index_t>::type> straight_line_drawing_t; > > straight_line_drawing_storage_t > straight_line_drawing_storage(num_vertices(tempGraph)); > straight_line_drawing_t > straight_line_drawing(straight_line_drawing_storage.begin(),get(vertex_index,tempGraph)); > > chrobak_payne_straight_line_drawing(tempGraph, > embedding2, > ordering.begin(), > ordering.end(), > straight_line_drawing > ); > > Also the same code works in some cases when the size of the graphs is > small, but as the size of the graph grows I am getting this stackoverflow > error. Could anyone kindly letme know why this error occurs and if there is > any other extra care I need to take care off ? > > Thanks, > Nishchal. > -- Nishchal Devanur

3 3

Error closing an asio::socket
by Claude 14 May '11

14 May '11

Hello. In a program server in c++ I create an asio::socket and I listen it on a port (myPortNumber). Then I connect to my program using telnet (linux) with: telnet localhost myPortNumber The communication works fine, except that when I close the terminal window, the server closes with an error message: "terminate called without an active exception Aborted Process returned 134 (0x86)" Why? How can I prevent the server program is interrupted? -- View this message in context: http://boost.2283326.n4.nabble.com/Error-closing-an-asio-socket-tp3521153p3… Sent from the Boost - Users mailing list archive at Nabble.com.

2 3

[asio] How socket::shutdown() safe is within multithreaded usage?
by Slav 14 May '11

14 May '11

Hello, my server runs single io_service and asynchronosly accepts incoming connections (creating new sockets for each incoming connection). Usage of connection happens in such ways: - calls to socket::async_write() from multiple threads (embraced to mutex) at any time - handling socket::acync_read() (which runs within io_service' thread as I understand the documentation) - single call to socket::shutdown() at any moment from some other thread Previusly I used multiple of mutexes to cleanly wait for all current asynchronous read/write handlers: write function incremented "writes" variable which then was used on socket shutdown to wait the same amount of write handlers - but deadlock sometimes happend at moment of waiting write handlers. So I referred to socket::shutdown()'s documentation which say "Any asynchronous send, receive or connect operations will be cancelled immediately" - and don't wait any asynchronous operations for now and everything seems to work fine for now (what scares me). Is it safe to do so? How must I safely handle all currenlty running asynchronous read/write handlers? In case of boost.asio waits for all asynchronous operations to stop inside socket::shutdown/close so, then, if to call it within one of such operations - deadlock will (theoretically must) happen - so, socket::close/shutdown isn't safe? Thank you.

1 0

Boost.Context review result
by Vicente BOTET 14 May '11

14 May '11

Hi, this was my first experience as review manager and it has been more difficult than I had expected. Apologies if I forget some important things or I misunderstood others. I hope that the major points have been taken in account. Here it is the result of the Boost.Context review. The library is accepted provisionally and will need to address some mandatory points before a mini review (4/5 days). There were not too much complete reviews (5) but globally all the reviewers voted for acceptation and two subject to some major redesign modifications. I hope I didn't miss somebody. YES Gordon Woodhull YES/Cnd Giovanni Piero Deretta YES Artyom YES Nat Linden YES Phil Endecott YES/Cnd, Jeffrey Lee Hellrung, Jr Thanks to all the review participants Gordon Woodhull, Giovanni Piero Deretta , Artyom, Nat Linden, Holger Grund, Phil Endecott, Jeffrey Lee Hellrung, Jr.. Special thanks to Giovanni Piero Deretta showing some major flaws in the global design and Holger Grund for showing a (possible) major bug on the Windows implementation. I know Oliver that you have already redesigned your library, but if there are points that you have not been addressed yet or have some difficulties addressing them, I will suggest you to work closely with Giovanni, he know well the domain and have a lot of good ideas, and exchange on this ML. You should follow up more closely the discussions during the mini review and even try to get feedback from the ML posting how you see your redesigned library. Point to be addressed before the mini review: Design 1. Separation of the context class in two interface: - A C-like interface that defines a POD struct that is memcpy-able and that can be implemented either using platform libraries, as ucontext, fibers or directly using assembler when a robust implementation is available. The context swap implementation don't need to save the signals as ucontext does. The following is just for illustrations purposes. struct boost_context; typedef void boost_context_fn_t(intptr_t); extern "C" void boost_context_make(boost_context* ctx, boost_context_fn_t * f, intptr_t p, ...); extern "C" void boost_context_swap(boost_context* from, boost_context const* to); extern "C" intptr_t boost_context_destroy( boost_context* fc); boost_context_make is a merge of get_context with make_context + some fields assignations. "A user will have lower expectations from such a low level API and at the same time will give more freedom for other people to implement on top of it higher abstractions as Boost.Corutines, Boost.Fibers ..." - A non-copiable but movable safe context class on top of the low level C-like interface, that will provide modern and efficient C++ interface, that is usable by a user in a safe way. The safe context class would just be one of the client of the C-like interface, other library authors could either use the underlying C-like API directly or the class context depending on wether they need the speed or safety. * The context class will not be templated any more, and the use of type erasure will ensure that. * The constructor will accept any C++ callable, function pointers, functors, ... * At this high level interface, the function provided by the user could throw exceptions, and the library must wrap the user function and needs to store the exception raised and provide an interface to retrieve them. 2. The stack implementation must ensure that the stack is unwound before it is destroyed. A stack should only be safely deallocated if either has been completely unwound or if it doesn't own any resources. A basic stack without protection seems mandatory. For debug purposes it has been required to provide some stack usage functions that allow to know the max size used for example. Implementation 3. The assembler implementation on Windows must be disallowed if the ABI bug reported by Holger is confirmed. As far as Windows provides a fiber implementation that is as efficient as the assembler one, the assembler implementation is not mandatory and the user of the provided Windows fiber is a preferable choice. 4. Most of the 'throw' statements in the context class should actually be asserts. 5. The provided stack should be used to store any context parameters as far as no major impediment is found during the implementation. This will avoid further allocations on the safe context class. Documentation 6. The documentation is very minimalist and should be expanded with a discussion on context switching and use cases. Take care of all the grammar/spelling improvements suggested by the reviewers (It will be great if Jeffrey could review the documentation before the mini-review). Some user land examples should be provided (why not the yield example). 7. The concept of (Movable) Stack must be clearly defined, as it is done in the standard, using expression requirements with semantic constraints. 8. The assembler implementation should be carefully documented, so others could maintain the code and add other implementations if needed. 9. Some performance measure should be added. Providing the number of cycles on each implemented platform would be nice. Build system 10. The default build on a platform must work (It must be ABI compatible with the underlying platform) and take care of the specific features. Of course, the build needs to support cross compiling, so the user should be able to override the default values. Others points that are not required but that can make the library more usable or efficient: 1. The assembler implementations could be simplified if the context itself was represented as a single pointer to the top of the stack. This would save some instructions to move the source address from the stack return address to the context struct and back. 2. Instead of supporting a 'fc_link' a-la ucontext, have the callback function return a new context (it is void now). 'fc_link' is useful only on some limited cases (usually when you have an external scheduler managing your contexts), while the having the callback return the 'next continuation' has more applications (note that fc_link can be implemented easily in term of the continuation returning variant, but the reverse is harder). This will be very useful, for example, to implement some kind of 'exit_to' functionality (unwind the stack and restore another context), a key piece for safe context destruction. 3. Give to boost_context_swap the ability to exchange a parameter with the other context: boost_context_parm_t boost_context_swap( boost_context * ofc, boost_context const* nfc, boost_context_parm_t parm) where boost_context_parm_t is either union boost_context_parm_t { void * ptr; int int_; }; or simply intptr_t; boost_context_swap saves the current context in ocf and restores the context ncf as usual; additionally, if ofc was 'captured' on a call to boost_context_swap, this call will return the value of parm on the original context. This extra parameter is equivalent to the second parameter of longjmp. If ofc was created with boost_context_swap, 'parm' will be an extra parameter to the function. Note that this can be potentially implemented with little or no overhead. 4. Add a variant of boost_context_swap that allows executing a function on the destination context (in this case 'parm' would be passed parameter to this function. This is mostly useful for injecting an exception on the destination context. This can be potentially implemented on top of the existing functionality, but would slow down every context switch; a possible efficient implementation would manipulate the destination stack to add a call to the function on top of it, so that the cost is paid only when required. 5. Add a current context function (thread local). Vicente Review Manager

1 0

Serialization assert fail and unregistered class
by Jari 14 May '11

14 May '11

Hi i get assert fail and "unregistered class - derived class not registered or exported" when serializing. I have many classes being saved already in the code but i ran to a problem saving certain std::list with derived classes. (I also have similar classes and list being serialized before) i think its the same issue as in here: http://boost.2283326.n4.nabble.com/serialization-polymorphic-archives-runti… i have boost version 1.46.1 heres the call stack: > msvcr100d.dll!_wassert(const wchar_t * expr, const wchar_t * filename, unsigned int lineno) Line 325 C gamevc10dbg.exe!boost::archive::detail::basic_serializer_map::find(const boost::serialization::extended_type_info & eti) Line 102 + 0x16 bytes C++ gamevc10dbg.exe!boost::archive::detail::archive_serializer_map<boost::archive::binary_oarchive>::find(const boost::serialization::extended_type_info & eti) Line 67 C++ gamevc10dbg.exe!boost::archive::detail::save_pointer_type<boost::archive::binary_oarchive>::polymorphic::save<BasePlayer>(boost::archive::binary_oarchive & ar, BasePlayer & t) Line 435 + 0xe bytes C++ gamevc10dbg.exe!boost::archive::detail::save_pointer_type<boost::archive::binary_oarchive>::save<BasePlayer>(boost::archive::binary_oarchive & ar, const BasePlayer & t) Line 460 + 0xd bytes C++ gamevc10dbg.exe!boost::archive::detail::save_pointer_type<boost::archive::binary_oarchive>::invoke<BasePlayer *>(boost::archive::binary_oarchive & ar, BasePlayer * const t) Line 473 + 0xd bytes C++ gamevc10dbg.exe!boost::archive::save<boost::archive::binary_oarchive,BasePlayer * const>(boost::archive::binary_oarchive & ar, BasePlayer * const & t) Line 525 + 0xf bytes C++ gamevc10dbg.exe!boost::archive::detail::common_oarchive<boost::archive::binary_oarchive>::save_override<BasePlayer * const>(BasePlayer * const & t, int __formal) Line 69 + 0x15 bytes C++ gamevc10dbg.exe!boost::archive::basic_binary_oarchive<boost::archive::binary_oarchive>::save_override<BasePlayer *>(BasePlayer * const & t, int version) Line 76 C++ gamevc10dbg.exe!boost::archive::binary_oarchive_impl<boost::archive::binary_oarchive,char,std::char_traits<char> >::save_override<BasePlayer *>(BasePlayer * & t, int __formal) Line 52 C++ gamevc10dbg.exe!boost::archive::detail::interface_oarchive<boost::archive::binary_oarchive>::operator<<<BasePlayer *>(BasePlayer * & t) Line 64 C++ gamevc10dbg.exe!saveGame() Line 63 + 0x12 bytes C++ gamevc10dbg.exe!SDL_main(int argc, char * * argv) Line 1517 + 0x5 bytes C++ gamevc10dbg.exe!_main() + 0xfd bytes C gamevc10dbg.exe!_WinMain@16() + 0x1cd bytes C gamevc10dbg.exe!__tmainCRTStartup() Line 547 + 0x2c bytes C gamevc10dbg.exe!WinMainCRTStartup() Line 371 C kernel32.dll!75451194() [Frames below may be incorrect and/or missing, no symbols loaded for kernel32.dll] ntdll.dll!76fbb429() ntdll.dll!76fbb3fc() gamevc10dbg.exe!__CT??_R0?AVbad_cast@std@@@8??0bad_cast@std@@QAE@ABV01@@Z12() + 0xd2ce bytes C++ 003426e2() does any one know whats wrong? i should have all BOOST_CLASS_EXPORT_GUID in place. thx

1 0

[GIL] Supporting filesystem::path
by Szymon Gatner 13 May '11

13 May '11

Hi, small feature request: adding support for filesystem::path class in new GIL.IO in calls like read_image(). P.S. Regarding my earlier request: any plans on adding file path to the exception thrown from read_image()? Cheers, Simon

2 1

building boost in AIX machine
by Manoj Jangid 13 May '11

13 May '11

Is boost library fully compatible with AIX machine? I am trying to build boost in AIX (5.3 and 6) machine and its stuck somewhere -------------------- ....... ....... ::pthread_mutex,32,0> > > &, nil_t, const lex_iterator<boost::wave::cpplexer::le x_token<boost::wave::util::file_position<boost::wave::util::flex_string<char,std ::char_traits<char>,std::allocator<char>,boost::wave::util::CowString<boost::wav e::util::AllocatorStringStorage<char,std::allocator<char> >,char *> > > > > &, c onst lex_iterator<boost::wave::cpplexer::lex_token<boost::wave::util::file_posit ion<boost::wave::util::flex_string<char,std::char_traits<char>,std::allocator<ch ar>,boost::wave::util::CowString<boost::wave::util::AllocatorStringStorage<char, std::allocator<char> >,char *> > > > > &) could not be inlined into boost::spiri t::classic::action_policy::do_action<boost::wave::grammars::impl::store_found_eo ltokens<std::list<boost::wave::cpplexer::lex_token<boost::wave::util::file_posit ion<boost::wave::util::flex_string<char,std::char_traits<char>,std::allocator<ch ar>,boost::wave::util::CowString<boost::wave::util::AllocatorStringStorage<char, std::allocator<char> >,char *> > > >,boost::fast_pool_allocator<boost::wave::cpp lexer::lex_token<boost::wave::util::file_position<boost::wave::util::flex_string <char,std::char_traits<char>,std::allocator<char>,boost::wave::util::CowString<b oost::wave::util::AllocatorStringStorage<char,std::allocator<char> >,char *> > > >,boost::default_user_allocator_new_delete,boost::details::pool::pthread_mutex, 32,0> > >,boost::spirit::classic::nil_t,boost::wave::cpplexer::lex_iterator<boos t::wave::cpplexer::lex_token<boost::wave::util::file_position<boost::wave::util: :flex_string<char,std::char_traits<char>,std::allocator<char>,boost::wave::util: :CowString<boost::wave::util::AllocatorStringStorage<char,std::allocator<char> > ,char *> > > > > >(const store_found_eoltokens<std::list<boost::wave::cpplexer:: lex_token<boost::wave::util::file_position<boost::wave::util::flex_string<char,s td::char_traits<char>,std::allocator<char>,boost::wave::util::CowString<boost::w ave::util::AllocatorStringStorage<char,std::allocator<char> >,char *> > > >,boos t::fast_pool_allocator<boost::wave::cpplexer::lex_token<boost::wave::util::file_ position<boost::wave::util::flex_string<char,std::char_traits<char>,std::allocat or<char>,boost::wave::util::CowString<boost::wave::util::AllocatorStringStorage< char,std::allocator<char> >,char *> > > >,boost::default_user_allocator_new_dele te,boost::details::pool::pthread_mutex,32,0> > > &, nil_t &, const lex_iterator< boost::wave::cpplexer::lex_token<boost::wave::util::file_position<boost::wave::u til::flex_string<char,std::char_traits<char>,std::allocator<char>,boost::wave::u til::CowString<boost::wave::util::AllocatorStringStorage<char,std::allocator<cha r> >,char *> > > > > &, const lex_iterator<boost::wave::cpplexer::lex_token<boos t::wave::util::file_position<boost::wave::util::flex_string<char,std::char_trait s<char>,std::allocator<char>,boost::wave::util::CowString<boost::wave::util::All ocatorStringStorage<char,std::allocator<char> >,char *> > > > > &) const. ----------------------------------------------- can you please tell me is there any other way to build?

1 0

boost::get_error_info not found!?
by Germán Diago 13 May '11

13 May '11

Hello. I have this code and I can't find out why it won't compile. I have looked at it several times and I can't find the reason. My definitions: enum ErrorCode { Success, BadOptions = -1, CannotConnect = -3 }; class ConsoleException : virtual public boost::exception, virtual public std::exception {}; namespace ExceptionTags { struct ErrorCodeTag {}; } My throw: BOOST_THROW_EXCEPTION(CabConsoleException() << ErrorCodeInfo(BadOptions)); And in main: try { CabConsole2 console; console.run(argc, argv); } catch (boost::exception & ce) { return 0; return *(boost::get_error_info<ExceptionTags::ErrorCodeTag>(ce)); } I'm using boost version 1.42. Thanks in advance.

2 3

[Interprocess] updating elements in vector of maps fails in optimized code
by Steven Maenhout 13 May '11

13 May '11

I'm using Boost 1.46 on Linux x86_64 in combination with gcc version 4.5.1. I'm trying to implement a a sparse matrix in a shared memory segment as a vector of maps. When trying to update previously inserted elements of the matrix, at a certain point, the program either crashes or stalls indefinitely. This only occurs if the gcc optimization is set higher than O0. If compiler optimizations are completely turned off (so using the -O0 switch) the program works as expected. Below, I provide some trimmed code that demonstrates the problem. I would be very grateful if somebody could indicate me what's causing this erratic behavior. Steven #include <iostream> #include <stdexcept> #include <boost/interprocess/managed_shared_memory.hpp> #include <boost/interprocess/containers/map.hpp> #include <boost/interprocess/containers/vector.hpp> #include <boost/interprocess/allocators/allocator.hpp> #define MATSIZE 5 typedef boost::interprocess::managed_shared_memory::segment_manager SegmentManager_t; typedef boost::interprocess::allocator<void , SegmentManager_t> VoidAllocator_t; typedef std::pair<int,double> MapValue_t; typedef boost::interprocess::allocator<MapValue_t , SegmentManager_t> MapValueAllocator_t; typedef boost::interprocess::map<int,double,std::less<int>,MapValueAllocator_t> Map_t; typedef boost::interprocess::allocator<Map_t,SegmentManager_t> MapAllocator_t; typedef boost::interprocess::vector<Map_t,MapAllocator_t> VectorofMaps_t; int main(int argc, char **argv) { VectorofMaps_t::size_type i; int j; Map_t::iterator mapiter; try { boost::interprocess::shared_memory_object::remove("MySharedMemory"); boost::interprocess::managed_shared_memory mfile(boost::interprocess::create_only,"MySharedMemory",65536); VoidAllocator_t alloc_inst (mfile.get_segment_manager()); VectorofMaps_t* pS=mfile.construct<VectorofMaps_t>(boost::interprocess::anonymous_instance)(MATSIZE,Map_t(std::less<int>(),alloc_inst),alloc_inst); for(i=0;i<MATSIZE;++i) { for(j=0;j<MATSIZE;++j) (*pS)[i].insert(std::pair<int,double>(j,1.0)); } for(i=0;i<MATSIZE;++i) { for(j=0;j<MATSIZE;++j) { mapiter=(*pS)[i].find(j); if(mapiter!=(*pS)[i].end()) mapiter->second+=1.0; else (*pS)[i].insert(std::pair<int,double>(j,1.0)); } } for(i=0;i<MATSIZE;++i) { for(mapiter=(*pS)[i].begin();mapiter!=(*pS)[i].end();++mapiter) std::cout<<mapiter->second<<" "; std::cout<<std::endl; } boost::interprocess::shared_memory_object::remove("MySharedMemory"); } catch(boost::interprocess::interprocess_exception e) { std::cerr<<"Interprocess error: "<<e.what(); } catch(std::exception e) { std::cerr<<"Standard exception: "<<e.what(); } catch(...) { std::cerr<<"unknown error"; } }

3 7

[BGL] Using copy_graph(g_in, g_out) with filtered_graph (and a special predicate) as input yields an unexpectedly empty graph
by Cedric Laczny 13 May '11

13 May '11

Hi, in order to select a subgraph based on some predicates, I use filtered_graph() with an appropriate predicate. To get the resulting subgraph (strictly speaking it is a new graph), I simply use copy_graph(fg, new_g). In a special situation, this predicate simply filters on the name and type of a vertex (set via vertex_properties). This is working as expected. The more, I am working with multipartite graphs, so there are no edges between 2 vertices of the same type. When I now define a predicate that will only let vertices of one special type to be visible and I use copy_graph() on this filtered_graph, the resulting graph has no edges (which is ok) but it also has no vertices. I would not expect the latter to happen. In turn, when I let another type of vertices to be visible, the resulting graph is again as expected. Is there perhaps some obvious speciality of copy_graph() I am missing? Best, Cedric

2 2

[asio] socket::read_some() splits data into two parts.
by Slav 12 May '11

12 May '11

Hello. I sent 8004 bytes to server through TCP connection and successfully read it like this: int readBytes; const int BUFFER_SIZE = 128; char charBuf[BUFFER_SIZE]; do { readBytes = socket.read_some(boost::asio::buffer(charBuf, BUFFER_SIZE)); } while(readBytes >= BUFFER_SIZE); But sometimes this code reads just 3752 (precisely) bytes and returns. After that it handles another async_read and reads 4525 bytes (which in sum gives 8004 bytes). Do I use "read_some()" function in the right way?

8 22

Re: [Boost-users] [msm] EUML in a header file
by Christophe Henry 12 May '11

12 May '11

> A couple more questions. I think you may be missing some more const specifiers in the trunk code. In common.hpp for instance, I think the following > > #define BOOST_MSM_EUML_EVENT(instance_name) \ > struct instance_name ## _helper : msm::front::euml::euml_event<instance_name ## _helper>{ \ > instance_name ## _helper(){} \ > instance_name ## _helper const& operator()(){return *this;} }; \ > instance_name ## _helper const instance_name = instance_name ## _helper(); > > should be > > #define BOOST_MSM_EUML_EVENT(instance_name) \ > struct instance_name ## _helper : msm::front::euml::euml_event<instance_name ## _helper>{ \ > instance_name ## _helper(){} \ > instance_name ## _helper const& operator()() const {return *this;} }; \ > instance_name ## _helper const instance_name = instance_name ## _helper(); > > If the operator() is not const then it can't be called on the defined instance. I forgot why I need this, to be frank, I need to have a look at it. > Also, the addition of "= instance_name ## _helper();" makes the macros unusable in class definitions since instance_name is not static. Ouch. How could I miss that one? This leaves me with as only choice your first solution with static and extra macros for the name. Thanks, Christophe

1 0

[boost.asio] Is it safe to call write() and async_read at the same time?
by Frank 12 May '11

12 May '11

Is it safe to do the following in boost.asio? If it matters, I am using a serial port at the moment, but the code will be used for sockets as well. If not, what is the proper way to implement this to get full duplex communication? Thread 1: write(conn, buffer1) Thread 2: async_read(conn, buffer2)

3 5

logic operation in boost polygon
by HxH 12 May '11

12 May '11

Help! I wrote this function to load the data point to a boost polygon. typedef vector<polygon_data<int> > LayoutSet; static void addPolygonData(LayoutSet &sets,int* points,int size){ polygon_data<int> poly_data; vector<point_data<int> > poly_points(size); for(int i=0;i<size;i++) { int x=i*2; int y=x+1; poly_points[i]=point_data<int>(points[x],points[y]); } poly_data.set(poly_points.begin(),poly_points.end()); sets.push_back(poly_data); } Then I load two sets of points int p1[8]={1200 2400 1200 3600 4000 3600 4000 2400}; int p2[8]={1800 600 1800 4700 3500 4700 3500 600}; LayoutSet group_2; LayoutSet group_1; addPolygonData(group_1,p1,8); addPolygonData(group_1,p2,8); boost::polygon::assign(group_2,group_1[0] & group_1[1]); // Here I do the logic operation & (AND) vector<point_data<int> > pts; pts.insert(pts.begin(),group_2[0].begin(),group[0].end()); for(size_t i=0;i<group_2[0].size();i++){ cout<<pts[i].x()<<","<<pts[i].y()<<endl; } Here is the result I get: 6484944,0 3500,600 3500,3600 1800,3600 1800,600 3,1 0,0 6484944,0 It doesn't look correct. It gives me a hard time to fix it. Any suggestions are welcome!! Thank you! -- View this message in context: http://boost.2283326.n4.nabble.com/logic-operation-in-boost-polygon-tp35123… Sent from the Boost - Users mailing list archive at Nabble.com.

3 4

Re: [Boost-users] [msm] EUML in a header file
by Nate Knight 12 May '11

12 May '11

Christophe Henry <christophe.j.henry <at> googlemail.com> writes: > > >Christophe Henry <christophe.j.henry <at> googlemail.com> writes: > > > >> You can also provide your own instances inside a front-end definition, > >> thus eliminating the problem completely, as in: > >> > >http://www.boost.org/doc/libs/1_46_0/libs/msm/doc/HTML/examples/SimpleTutor… > >> A couple more questions. I think you may be missing some more const specifiers in the trunk code. In common.hpp for instance, I think the following #define BOOST_MSM_EUML_EVENT(instance_name) \ struct instance_name ## _helper : msm::front::euml::euml_event<instance_name ## _helper>{ \ instance_name ## _helper(){} \ instance_name ## _helper const& operator()(){return *this;} }; \ instance_name ## _helper const instance_name = instance_name ## _helper(); should be #define BOOST_MSM_EUML_EVENT(instance_name) \ struct instance_name ## _helper : msm::front::euml::euml_event<instance_name ## _helper>{ \ instance_name ## _helper(){} \ instance_name ## _helper const& operator()() const {return *this;} }; \ instance_name ## _helper const instance_name = instance_name ## _helper(); If the operator() is not const then it can't be called on the defined instance. Also, the addition of "= instance_name ## _helper();" makes the macros unusable in class definitions since instance_name is not static.

1 0

[signals2] compilation issues with gcc4.4 and -pedantic
by Christophe Bourez 12 May '11

12 May '11

The following code: #include <boost/signals2.hpp> int main(int , char *[]) { return 0; } compiles fine with gcc-4.1 and gcc-4.2 and the -pedantic option, but generates the following errors using gcc-4.4 with the same compiling options: /home/build/repository/boost-1.46.1-2/gcc-4.4/include/boost/signals2/detail/preprocessed_arg_type_template.hpp:21: error: invoking macro BOOST_SIGNALS2_PREFIXED_ARGS_TEMPLATE_DECL argument 2: empty macro arguments are undefined in ISO C90 and ISO C++98 /home/build/repository/boost-1.46.1-2/gcc-4.4/include/boost/signals2/detail/preprocessed_arg_type_template.hpp:21: error: invoking macro BOOST_PP_CAT argument 1: empty macro arguments are undefined in ISO C90 and ISO C++98 /home/build/repository/boost-1.46.1-2/gcc-4.4/include/boost/signals2/detail/preprocessed_arg_type_template.hpp:21: error: invoking macro BOOST_PP_CAT_I argument 1: empty macro arguments are undefined in ISO C90 and ISO C++98 Adding the option -std=c++0x removes these errors, but I am supporting legacy code that does not compile with -std=c++0x Is there any workaround or patch I could apply ? Thank you, Christophe

3 3

Unwanted implicit conversions to bool
by Dominik Steenken 12 May '11

12 May '11

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hello everyone, i am having a bit of a problem using boost/hash in combination with boost/shared_ptr. Essentially, what i want when i hash a shared_ptr object is to hash the object it points to. So i wrote a template function to that effect, i.e. inline std::size_t hash_value(boost::shared_ptr<const IHashable> obj) { return obj->hash_value(); } where IHashable is an interface forcing the existence of the hash_value() function. Now i am getting compiler errors because apparently there is an implicit conversion to bool from boost::shared_ptr<T> and obviously there is a hash function for bool. Thus, something like boost::shared_ptr<IHashable> p(new something()); boost::hasher<something> hasher; std::size_t hash = hasher(p); is now ambiguous. I already found the BOOST_HASH_NO_IMPLICIT_CASTS switch, but it does not seem to change anything. I still get compiler errors like this one: In file included from /usr/include/boost/functional/hash/hash.hpp: 494:0, from /usr/include/boost/functional/hash.hpp:6, from types/../common.h:14, from types/variables.h:11, from types/abstractformula.h:11, from types/unaryoperations.h:11, from types/unaryoperations.cpp:1: types/unaryoperations.cpp:49:37: instantiated from here /usr/include/boost/functional/hash/extensions.hpp:176:34: error: call of overloaded ?hash_value(const boost::shared_ptr<terms::CAbstractFormula>&)? is ambiguous /usr/include/boost/functional/hash/hash.hpp:120:24: note: candidates are: size_t boost::hash_value(bool) types/../common.h:86:24: note: size_t terms::hash_value(boost::shared_ptr<const terms::IHashable>) Any idea on what i could to to prevent this would be greatly appreciated. cheers, Dominik -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.11 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/ iQIcBAEBAgAGBQJNy70+AAoJEPKXvh6MABK35dkQAKRFv48yZ7XyZh/6F+SSh02G IBfSEMi/xMXerLRH+/FV2lB6/gx1tymkYXxF02gopfIlavHHTWPz0vnkqZYFAABq ZzLMpggx4G50KtUGZfeKKfMGdbR5+0AHHT5ZRuL6aTzsvgr6nMYDdxwBKlAPvTJv nDuH8fHaV2QU6tw8OSmqzsdtiKrA4rnSqLPg4T6g/e/EqvH2Pf8GkXowRVK0T9Sq uAPnqcNZcMPuaIbtACC+AzsVA3CBw5fFQktRVbkLUtqDRVr10a9qOxgnDo6b7Duz c/KGNnWH2n1Lnwp9GbrvZoScqwThr9WqBvdcITD3ivgAkWhy5Fy6pnR1leRZhbZ7 +eFv3c1tY7b4yE7I9qCfRwW8LDhnkAJ/nAdcmGhWNX8RRSkETTguoCe9KUPMPoSs MBUEVk8VUNC9J3/JQmxlDhVju4WvJjlAnYrf7zir2XTFQ7v5eP86BeXkYArl+eyg OI2qRVp2ZuhReorwDc09Hef4/NrXPy3Bpq5nEWsref/mBbsyeopH3wqTZBrtruky RtSiJInhm4CETfMVJ8aJh/QO3MzGw2PXRLLCQ/mR2xHRgvEWOH53r84/1s8H3uSA URvXvPLKBuTpog30+GhHgfWOYx1/1Hy3atHbR9XikNW9y6Pv8IxUISA4AaQXNZyn XkjTDMHQ5XAqj/6Etgr7 =ak4K -----END PGP SIGNATURE-----

4 3

[Thread] Assert after reloading multiple times a .so linked with the static build of Boost.Thread
by Sorin Fetche 12 May '11

12 May '11

Hi, The attached test program shows that after a few hundred reloads of a shared library linked with the static build of Boost.Thread, an assert will be raised (gcc 4.4; boost 1.46.1). Does this show a valid bug in a supported usage pattern? ./a.out Call: 0 Call: 100 Call: 200 Call: 300 Call: 400 Call: 500 a.out: /home/sfetche/local/boost/src/boost_1_46_1/boost/thread/pthread/condition_variable_fwd.hpp:46: boost::condition_variable::~condition_variable(): Assertion `!pthread_mutex_destroy(&internal_mutex)' failed. Aborted The test program demonstrates the usage of a shared library that exposes a C interface and is implemented using statically linked Boost libraries. This approach has been taken in order to allow different modules using different versions of Boost to get (re)loaded in the same plugin-based application and has been inspired by this discussion: http://lists.boost.org/Archives/boost/2005/09/94134.php Thank you, Sorin Fetche

1 1

truncate file to n bytes
by Andrej van der Zee 12 May '11

12 May '11

Hi, I was wondering is there is any way to truncate the file-size to n bytes, while deleting from the end of the file? Does boost::filesystem support something like this? Thank you, Andrej

2 1

[boost::property_tree] how to put to paths with '/' slashes?
by Julien Claassen 12 May '11

12 May '11

Hello everyne! I'm just looking at the property_tree and wonder, if I can do something like this: ptree my_tree; my_tree.put('/',"/path/to/my.node","hello world"); The get functions support this syntax, but I didn't see anything corresponding to it with put ? Any ideas, workarounds? Kind regards and thanks Julien -------- Music was my first love and it will be my last (John Miles) ======== FIND MY WEB-PROJECT AT: ======== http://ltsb.sourceforge.net the Linux TextBased Studio guide ======= AND MY PERSONAL PAGES AT: ======= http://www.juliencoder.de

2 2

Re: [Boost-users] [msm] EUML in a header file
by Christophe Henry 12 May '11

12 May '11

>Christophe Henry <christophe.j.henry <at> googlemail.com> writes: > >> You can also provide your own instances inside a front-end definition, >> thus eliminating the problem completely, as in: >> >http://www.boost.org/doc/libs/1_46_0/libs/msm/doc/HTML/examples/SimpleTutor… >> >> Here the states and events could easily be move inside the front-end. >> It's actually my personal preference. >> > >That makes a lot of sense. I think I may prefer this approach as well, but >thanks for looking into the other issue anyway. > >Nate I forgot to add that you can of course mix. I often define my actions or simple events with the macros inside the front-end definition. Christophe

1 0

how to use no_init dijkstra
by Fletcher Foti 12 May '11

12 May '11

I'm really surprised I can't find information on this - I feel like I'm doing something very basic... What I want is all the nodes within a certain distance in the graph. I have a graph of half a million nodes and will only be visiting 20 or so - if you're curious, I have a graph of the street network in the Bay Area and will be looking at only those nodes within walking distance. So I read elsewhere that I need to inherit from default_dijkstra_visitor and throw an exception when I finalize a vertex beyond my search radius. I think I have this working. Now my problem is that I have to do this search many, many times - performance is very important - and I don't want to initialize the values for a half a million nodes when I'm only going to visit 20. I therefore want to use a std::map to store distances, and I want a key missing from that map to indicate an unvisited node, right? I also want to use dijkstra_shortest_path_no_init so as to skip initialization, but it's very hard to find documentation on this. I could post all my code here, but I'm not yet sure if that's the most efficient way to get my question answered. How does the no_init function work? Why doesn't it take a value for infinity? I feel like I need to pass DistanceMap.end() as my value for infinity so that a node not in the distance map looks like an unvisited node. Can anyone explain to me in words what I the no_init function expects me to pass to it? Thanks in advance! Fletcher

3 2

Polygon, accessing Points_Data
by AmandaLind 12 May '11

12 May '11

Greetings, This is my first post here. Please help me as I am stuck on how to access the points defining the new polygon generated with two other polygons and a boolean operation. I am having a hard time with using the iterators properly. The code runs well up to that point. Thanks in advance, ~Amanda namespace gtl = boost::polygon; using namespace boost::polygon::operators; using namespace gtl; //lets construct the two polygons typedef gtl::polygon_data Polygon; typedef gtl::polygon_traits::point_type Point; //Polygon1 Point pts1[numcorners1]; for (int index=0; index<numcorners1; index++) { pts1[index]=gtl::construct<Point>(rotated_corners1[index].x*1000, rotated_corners1[index].y*1000); } Polygon poly1; gtl::set_points(poly1, pts1, pts1+numcorners1); //Polygon 2 Point pts2[numcorners2]; for (int index=0; index<numcorners2; index++) { pts2[index]=gtl::construct<Point>(rotated_corners2[index].x*1000, rotated_corners2[index].y*1000); //mult by 1000 because it rounds to integers. } Polygon poly2; gtl::set_points(poly2, pts2, pts2+numcorners2); using namespace boost::polygon::operators; Polygon poly3; poly3 = poly1 & poly2; Point pts3[poly3.size()]; //how does one use iterators ?! std::vector<point_data<int> >::iterator itr ; itr= poly3.begin(); int index=0 for(itr; itr != ploy3.end(); ++itr) { pts3(index)=*itr; index++; } -- View this message in context: http://boost.2283326.n4.nabble.com/Polygon-accessing-Points-Data-tp3446015p… Sent from the Boost - Users mailing list archive at Nabble.com.

3 10

[MSM] event type change while using a direct entry
by Christophe Henry 11 May '11

11 May '11

> Dear list, > > while writing a state machine, I added an explicit_entry to my machine. My problem now is, if I want to write different function for different event types for the entry action like this: > template < class FSM> > void on_entry(event2 const& ev,FSM&fsm ){ … } > not all events were catched by it. After some compiling and generating an example, I know when the problem occurs. I am not sure if this is a bug or a feature ☺. It's a bug ;-) >The event for the explicit entry is wrapped with a direct_entry_event. If the transition is from outside the statemachine this is quite ok (I got the original event, not the direct_entry_event), but if >transition is inside the machine, the direct_entry_event is not removed and I got this to my on_entry. > > The example and the console output from the listing below show this effect. Is this a compiler problem or a problem/bug/feature coming from the msm? > > I am using a gcc 4.3.4 and boost 1.46.1 (trunk also shows this) > > Kind regards, > Sven Steckmann I fixed this in the trunk (rev. 71879). Please let me know if you have any problem with the fix. Thanks, Christophe

1 0

[interprocess] Lost communications and mysterious names
by Roger 11 May '11

11 May '11

I'm using boost 1.46 on windows XP and I am having occasional issues with interprocess. Sometimes I lose communications between programs. I've located the directory where the files that enable the interprocess communication are created. Usually the files have the name I provide to the managed_shared_memory object in the code. However, when the problem occurs a file named something like "70C0A8E6490FCC01E55D313B550FCC01" appears. When the programs terminate this file disappears, while the normally named files persist. Why and where in the code do these files occur? Any hints as to what is going on?

2 1

[shared_ptr] make_shared causes Access Violation
by Paul Heil 11 May '11

11 May '11

I have a Visual Studio 2008 C++ application for ARMV4I Windows Mobile 6 where I'm using `boost::shared_ptr<>` to manage a fairly large object (4KB). Unfortunately, `boost::make_shared<>` causes an Access Violation exception. I am using Boost 1.45.0 with STLPort 5.2.1. My code: struct Foo { char a[ 4 * 1024 - 1 ]; }; int _tmain( int argc, _TCHAR* argv[] ) { boost::shared_ptr< Foo > f = boost::make_shared< Foo >(); // Access Violation return 0; } The exception callstack: test.exe!boost::detail::sp_ms_deleter<o>::sp_ms_deleter<o>(void) Line: 60, Byte Offsets: 0x18 C++ test.exe!boost::make_shared<o>(void) Line: 106, Byte Offsets: 0x5c C++ test.exe!wmain(int argc = 1, wchar_t** argv = 0x01b40060) Line: 81, Byte Offsets: 0x18 C++ test.exe!mainWCRTStartup(HINSTANCE__* hInstance = 0x00000003, HINSTANCE__* hInstancePrev = 0x00000000, unsigned short* lpszCmdLine = 0x00000003, int nCmdShow = 0) Line: 188, Byte Offsets: 0x94 C++ The location of the exception (boost\smart_ptr\make_shared.hpp): template< class T > class sp_ms_deleter { /* snip! */ public: sp_ms_deleter(): initialized_( false ) { // line: 60 this = NULL } /* snip! */ This issue does not occur when compiling for x86 Windows. This issue also does not occur when using the shared_ptr like this: boost::shared_ptr< Foo > f1 = boost::shared_ptr< Foo >( new Foo ); Can anybody explain what's going on and why this is breaking only on ARMV4I Windows Mobile 6? Thanks, PaulH

3 8

[MSM] event type change while using a direct entry
by Steckmann, Sven 11 May '11

11 May '11

Dear list, while writing a state machine, I added an explicit_entry to my machine. My problem now is, if I want to write different function for different event types for the entry action like this: template < class FSM> void on_entry(event2 const& ev,FSM&fsm ){ … } not all events were catched by it. After some compiling and generating an example, I know when the problem occurs. I am not sure if this is a bug or a feature ☺. The event for the explicit entry is wrapped with a direct_entry_event. If the transition is from outside the statemachine this is quite ok (I got the original event, not the direct_entry_event), but if transition is inside the machine, the direct_entry_event is not removed and I got this to my on_entry. The example and the console output from the listing below show this effect. Is this a compiler problem or a problem/bug/feature coming from the msm? I am using a gcc 4.3.4 and boost 1.46.1 (trunk also shows this) Kind regards, Sven Steckmann // Copyright 2010 Christophe Henry // henry UNDERSCORE christophe AT hotmail DOT com // This is an extended version of the state machine available in the boost::mpl library // Distributed under the same license as the original. // Copyright for the original version: // Copyright 2005 David Abrahams and Aleksey Gurtovoy. Distributed // under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #include <vector> #include <iostream> // back-end #include <boost/msm/back/state_machine.hpp> //front-end #include <boost/msm/front/state_machine_def.hpp> #include <boost/msm/front/functor_row.hpp> namespace msm = boost::msm; namespace mpl = boost::mpl; namespace { // events struct event1 {}; struct event2 {}; struct SubFsm2_ : public msm::front::state_machine_def<SubFsm2_> { template <class Event,class FSM> void on_entry(Event const&,FSM& ) {std::cout << "entering: SubFsm2" << std::endl;} template <class Event,class FSM> void on_exit(Event const&,FSM& ) {std::cout << "leaving: SubFsm2" << std::endl;} struct SubState2 : public msm::front::state<> , public msm::front::explicit_entry<0> { template <class Event,class FSM> void on_entry(Event const&ev,FSM&fsm ) { std::cout << "entering: SubFsm2::SubState2 with event type: " << typeid(Event).name() << std::endl; } template <class Event,class FSM> void on_exit(Event const&,FSM& ) {std::cout << "leaving: SubFsm2::SubState2" << std::endl;} }; // the initial state. Must be defined typedef SubState2 initial_state; // Transition table for SubFsm2 struct transition_table : mpl::vector< // Start Event Next Action Guard // +--------------+-------------+------------+------------------------+----------------------+ _row < SubState2 , event2 , SubState2 > // +--------------+-------------+------------+------------------------+----------------------+ > {}; // Replaces the default no-transition response. template <class FSM,class Event> void no_transition(Event const& e, FSM&,int state) { std::cout << "no transition from state " << state << " on event " << typeid(e).name() << std::endl; } }; typedef msm::back::state_machine<SubFsm2_> SubFsm2; // front-end: define the FSM structure struct Fsm_ : public msm::front::state_machine_def<Fsm_> { // The list of FSM states struct State1 : public msm::front::state<> { // every (optional) entry/exit methods get the event passed. template <class Event,class FSM> void on_entry(Event const&ev,FSM&fsm ) { std::cout << "entering: State1" << std::endl; } template <class Event,class FSM> void on_exit(Event const&,FSM& ) {std::cout << "leaving: State1" << std::endl;} }; struct State2 : public msm::front::state<> { // every (optional) entry/exit methods get the event passed. template <class Event,class FSM> void on_entry(Event const&,FSM& ) {std::cout << "entering: State2" << std::endl;} template <class Event,class FSM> void on_exit(Event const&,FSM& ) {std::cout << "leaving: State2" << std::endl;} }; // the initial state of the player SM. Must be defined typedef SubFsm2 initial_state; // Transition table for Fsm struct transition_table : mpl::vector< // Start Event Next Action Guard // +---------------------+--------+------------------------------------+-------+--------+ _row < State1 , event1 , SubFsm2 >, _row < SubFsm2 , event1 , State1 > // +---------------------+--------+------------------------------------+-------+--------+ > {}; // Replaces the default no-transition response. template <class FSM,class Event> void no_transition(Event const& e, FSM&,int state) { std::cout << "no transition from state " << state << " on event " << typeid(e).name() << std::endl; } }; typedef msm::back::state_machine<Fsm_> Fsm; void test() { Fsm p; p.start(); p.process_event(event2()); p.process_event(event1()); p.process_event(event1()); } } --------------------------------------------- OUTPUT to console ------------------------------------------------------ entering: SubFsm2 entering: SubFsm2::SubState2 with event type: N5boost3msm4back13state_machineIN12_GLOBAL__N_14Fsm_ENS_9parameter5void_ES6_S6_S6_E9InitEventE leaving: SubFsm2::SubState2 ////// Comment: Now the transition is inside the submachine, the direct_entry_event is not removed entering: SubFsm2::SubState2 with event type: N5boost3msm4back18direct_entry_eventIN12_GLOBAL__N_18SubFsm2_9SubState2ENS3_6event2EEE leaving: SubFsm2::SubState2 leaving: SubFsm2 entering: State1 leaving: State1 entering: SubFsm2 ////// Comment: Her the right event will be passed to entering: SubFsm2::SubState2 with event type: N12_GLOBAL__N_16event1E

1 0

Serialized object's constructor calling question
by Jari 11 May '11

11 May '11

Hi, how do you make boost serialization call other constructor of your classes than the default constructor without arguments? Is this possible? The reason i need to do this is because the class being serialized also has reference that needs to be initialized at constructor. thx

2 2

答复: Boost-users Digest, Vol 2718, Issue 3
by 乔志强 11 May '11

11 May '11

typedef boost::shared_ptr<A> APtr; void* callbk1 (void* o) { APtr a = *static_cast<APtr*>(o); // or APtr& a = *static_cast<APtr*>(o) a->hello(); } void* callbk1 (void* o) { A* a = static_cast<A*>(o); a->hello(); } boost::shared_ptr<A> sPtr(rawPtr); if before a->hello(), the *rawPtr is not destroy(sPtr may be out of scope, but at least one boost::shared_ptr<A> holds it). Use: callbk1(&sPtr); or callbk2(sPtr.get()); If sPtr will out of the scope and no other boost::shared_ptr<A> holds *rawPtr, you should new a boost::shared_ptr<A>: boost::shared_ptr<A>*p = new boost::shared_ptr<A> (sPtr); // keep A life. // pass p to callback callbk3(p); // may be invoke in other thread void callbk3(void* o) { // delete the p = new APtr(sPtr) when return if we only call callbk3 once. boost::scoped_ptr<Aptr> pp(static_cast<APtr*>(o)); APtr& a = *pp; // at least we have this one boost::shared_ptr<A> a->hello(); } Best Regards! Qiao Zhi Qiang > > ------------------------------ > > Message: 6 > Date: Tue, 10 May 2011 14:24:26 +0530 (IST) > From: Mupparthy Ravindranath <rv_nath(a)yahoo.com> > To: "boost-users(a)lists.boost.org" <boost-users(a)lists.boost.org> > Subject: Re: [Boost-users] How to cast a boost::shared_ptr to void* > Message-ID: <443447.3562.qm(a)web94809.mail.in2.yahoo.com> > Content-Type: text/plain; charset="iso-8859-1" > > Sorry for the spam.? I got the answer, how to do it. Ignore my previous mail. > > [quote] > #include <boost/shared_ptr.hpp> > #include <iostream> > using namespace std; > > class A { > ??? public: > ??? void hello () { cout << "Hello, friends...!" << endl; } > }; > > typedef boost::shared_ptr<A> APtr; > > void* callbk (void* o) { > ??? APtr a = *static_cast<APtr*>(o); > ??? a->hello(); > } > > int main() { > A* rawPtr = new A; > boost::shared_ptr<A>sPtr(rawPtr); > callbk((void*)&sPtr); > return 0; > } > [/quote] > > > warm regars, > RV > >

1 0

Error: guid_defined is not template BOOST_CLASS_EXPORT_GUID
by Jari 11 May '11

11 May '11

Hi I am using boost serialization and it was working fine (save load works) but then I tried using BOOST_CLASS_EXPORT_GUID and get weird error. The line that gives the error is this: BOOST_CLASS_EXPORT_GUID( Bakery, "Bakery") (I put the code in Cpp to avoid any problems with headers.) And this is the full Visual studio express 2010 error: 2>E:\boost_1_46_1\boost/archive/detail/check.hpp(162): error C2338: typex::value 2> E:\boost_1_46_1\boost/archive/detail/iserializer.hpp(577) : see reference to function template instantiation 'void boost::archive::detail::check_const_loading<T>(void)' being compiled 2> with 2> [ 2> T=const BuildingData 2> ] 2> E:\boost_1_46_1\boost/archive/detail/common_iarchive.hpp(66) : see reference to function template instantiation 'void boost::archive::load<Archive,T>(Archive &,T &)' being compiled 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> T=const BuildingData 2> ] 2> E:\boost_1_46_1\boost/archive/basic_text_iarchive.hpp(65) : see reference to function template instantiation 'void boost::archive::detail::common_iarchive<Archive>::load_override<T>(T &,int)' being compiled 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> T=const BuildingData 2> ] 2> E:\boost_1_46_1\boost/archive/text_iarchive.hpp(82) : see reference to function template instantiation 'void boost::archive::basic_text_iarchive<Archive>::load_override<T>(T &,int)' being compiled 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> T=const BuildingData 2> ] 2> E:\boost_1_46_1\boost/archive/detail/interface_iarchive.hpp(60) : see reference to function template instantiation 'void boost::archive::text_iarchive_impl<Archive>::load_override<T>(T &,int)' being compiled 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> T=const BuildingData 2> ] 2> E:\boost_1_46_1\boost/archive/detail/interface_iarchive.hpp(67) : see reference to function template instantiation 'Archive &boost::archive::detail::interface_iarchive<Archive>::operator >><T>(T &)' being compiled 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> T=const BuildingData 2> ] 2> e:\projects\settlers\trunk\source\ai\../building.h(21) : see reference to function template instantiation 'Archive &boost::archive::detail::interface_iarchive<Archive>::operator &<const BuildingData>(T &)' being compiled 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> T=const BuildingData 2> ] 2> E:\boost_1_46_1\boost/serialization/access.hpp(118) : see reference to function template instantiation 'void Building::serialize<Archive>(Archive &,const unsigned int)' being compiled 2> with 2> [ 2> Archive=boost::archive::text_iarchive 2> ] 2> E:\boost_1_46_1\boost/serialization/serialization.hpp(69) : see reference to function template instantiation 'void boost::serialization::access::serialize<Archive,T>(Archive &,T &,const unsigned int)' being compiled 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> T=Building 2> ] 2> E:\boost_1_46_1\boost/serialization/serialization.hpp(128) : see reference to function template instantiation 'void boost::serialization::serialize<Archive,T>(Archive &,T &,const unsigned int)' being compiled 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> T=Building 2> ] 2> E:\boost_1_46_1\boost/archive/detail/iserializer.hpp(192) : see reference to function template instantiation 'void boost::serialization::serialize_adl<Archive,T>(Archive &,T &,const unsigned int)' being compiled 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> T=Building 2> ] 2> E:\boost_1_46_1\boost/archive/detail/iserializer.hpp(170) : while compiling class template member function 'void boost::archive::detail::iserializer<Archive,T>::load_object_data(boost::archive::detail::basic_iarchive &,void *,const unsigned int) const' 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> T=Building 2> ] 2> E:\boost_1_46_1\boost/archive/detail/iserializer.hpp(392) : see reference to class template instantiation 'boost::archive::detail::iserializer<Archive,T>' being compiled 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> T=Building 2> ] 2> E:\boost_1_46_1\boost/archive/detail/iserializer.hpp(439) : see reference to function template instantiation 'void boost::archive::detail::load_non_pointer_type<Archive>::load_standard::invoke<T>(Archive &,const T &)' being compiled 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> T=Building 2> ] 2> E:\boost_1_46_1\boost/archive/detail/iserializer.hpp(592) : see reference to function template instantiation 'void boost::archive::detail::load_non_pointer_type<Archive>::invoke<T>(Archive &,T &)' being compiled 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> T=Building 2> ] 2> E:\boost_1_46_1\boost/archive/detail/common_iarchive.hpp(66) : see reference to function template instantiation 'void boost::archive::load<Archive,T>(Archive &,T &)' being compiled 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> T=Building 2> ] 2> E:\boost_1_46_1\boost/archive/basic_text_iarchive.hpp(65) : see reference to function template instantiation 'void boost::archive::detail::common_iarchive<Archive>::load_override<T>(T &,int)' being compiled 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> T=Building 2> ] 2> E:\boost_1_46_1\boost/archive/text_iarchive.hpp(82) : see reference to function template instantiation 'void boost::archive::basic_text_iarchive<Archive>::load_override<T>(T &,int)' being compiled 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> T=Building 2> ] 2> E:\boost_1_46_1\boost/archive/detail/interface_iarchive.hpp(60) : see reference to function template instantiation 'void boost::archive::text_iarchive_impl<Archive>::load_override<T>(T &,int)' being compiled 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> T=Building 2> ] 2> E:\boost_1_46_1\boost/archive/detail/interface_iarchive.hpp(67) : see reference to function template instantiation 'Archive &boost::archive::detail::interface_iarchive<Archive>::operator >><T>(T &)' being compiled 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> T=Building 2> ] 2> buildings\bakery.cpp(24) : see reference to function template instantiation 'Archive &boost::archive::detail::interface_iarchive<Archive>::operator &<Building>(T &)' being compiled 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> T=Building 2> ] 2> E:\boost_1_46_1\boost/serialization/access.hpp(118) : see reference to function template instantiation 'void Bakery::serialize<Archive>(Archive &,const unsigned int)' being compiled 2> with 2> [ 2> Archive=boost::archive::text_iarchive 2> ] 2> E:\boost_1_46_1\boost/serialization/serialization.hpp(69) : see reference to function template instantiation 'void boost::serialization::access::serialize<Archive,T>(Archive &,T &,const unsigned int)' being compiled 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> T=Bakery 2> ] 2> E:\boost_1_46_1\boost/serialization/serialization.hpp(128) : see reference to function template instantiation 'void boost::serialization::serialize<Archive,T>(Archive &,T &,const unsigned int)' being compiled 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> T=Bakery 2> ] 2> E:\boost_1_46_1\boost/archive/detail/iserializer.hpp(192) : see reference to function template instantiation 'void boost::serialization::serialize_adl<Archive,T>(Archive &,T &,const unsigned int)' being compiled 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> T=Bakery 2> ] 2> E:\boost_1_46_1\boost/archive/detail/iserializer.hpp(170) : while compiling class template member function 'void boost::archive::detail::iserializer<Archive,T>::load_object_data(boost::archive::detail::basic_iarchive &,void *,const unsigned int) const' 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> T=Bakery 2> ] 2> E:\boost_1_46_1\boost/archive/detail/iserializer.hpp(208) : see reference to class template instantiation 'boost::archive::detail::iserializer<Archive,T>' being compiled 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> T=Bakery 2> ] 2> E:\boost_1_46_1\boost/archive/detail/iserializer.hpp(205) : while compiling class template member function 'const boost::archive::detail::basic_iserializer &boost::archive::detail::pointer_iserializer<Archive,T>::get_basic_serializer(void) const' 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> T=Bakery 2> ] 2> E:\boost_1_46_1\boost/serialization/export.hpp(66) : see reference to class template instantiation 'boost::archive::detail::pointer_iserializer<Archive,T>' being compiled 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> T=Bakery 2> ] 2> E:\boost_1_46_1\boost/serialization/export.hpp(63) : while compiling class template member function 'const boost::archive::detail::basic_pointer_iserializer &boost::archive::detail::export_impl<Archive,Serializable>::enable_load(boost::mpl::true_)' 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> Serializable=Bakery 2> ] 2> E:\boost_1_46_1\boost/serialization/export.hpp(104) : see reference to class template instantiation 'boost::archive::detail::export_impl<Archive,Serializable>' being compiled 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> Serializable=Bakery 2> ] 2> E:\boost_1_46_1\boost/serialization/export.hpp(103) : while compiling class template member function 'void boost::archive::detail::ptr_serialization_support<Archive,Serializable>::instantiate(void)' 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> Serializable=Bakery 2> ] 2> E:\boost_1_46_1\boost/archive/detail/register_archive.hpp(27) : see reference to class template instantiation 'boost::archive::detail::ptr_serialization_support<Archive,Serializable>' being compiled 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> Serializable=Bakery 2> ] 2> E:\boost_1_46_1\boost/serialization/export.hpp(132) : see reference to class template instantiation 'boost::archive::detail::_ptr_serialization_support<Archive,Serializable>' being compiled 2> with 2> [ 2> Archive=boost::archive::text_iarchive, 2> Serializable=Bakery 2> ] 2> E:\boost_1_46_1\boost/serialization/export.hpp(128) : while compiling class template member function 'void boost::archive::detail::extra_detail::guid_initializer<T>::export_guid(boost::mpl::false_) const' 2> with 2> [ 2> T=Bakery 2> ] 2> buildings\bakery.cpp(76) : see reference to class template instantiation 'boost::archive::detail::extra_detail::guid_initializer<T>' being compiled 2> with 2> [ 2> T=Bakery 2> ] What is wrong? thx

2 3

Re: [Boost-users] [msm] EUML in a header file
by Christophe Henry 11 May '11

11 May '11

> Christophe, > > One problem I've run into with the EUML frontend is the the _EVENT, _ACTION and _STATE > macros define non-static instance variables. So, if I define a state machine in a header file which > then gets included in multiple source files (e.g. I have two classes which use the same state machine) > I get linker errors about duplicate instances. For states, I can work around this issue by doing, for example, > > BOOST_MSM_EUML_DECLARE_STATE((),MyStateType) > static MyStateType MyState; > > and then using MyState in the transition table. Events and Actions don't seem to have the corresponding > _DECLARE_ macros, so this workaround isn't really feasible at this point in time. Any thoughts? Hi Nate, The problem is that I'm missing some const. I added the ones I saw, to get you further, but I'll need to have a closer look at all this quite fast. The trunk version should solve the problems you encountered until now. I hope this will buy me the time to check a bit more ;-) BTW, the macros are not an absolute need, they're just here because people complained about the parens in the transition table. You always have the possibility to avoid the macro: struct play : msm::front::euml::euml_event<play> {}; //same for states //transition table state1() + play() == state2() You can also provide your own instances inside a front-end definition, thus eliminating the problem completely, as in: http://www.boost.org/doc/libs/1_46_0/libs/msm/doc/HTML/examples/SimpleTutor… Here the states and events could easily be move inside the front-end. It's actually my personal preference. Thanks, Christophe

2 1

multinomial mixed-effects regression model
by Thomas Mang 10 May '11

10 May '11

Hi, Consider the need for a regression model which can handle an ordered multinomial response variable. There are, for example, proportional odds / cumulative logit models, but actually the regression should include random effects (a mixed model), and I would not be aware of multinomial regression model as part of lme4 (am I wrong here ?). Further, the constraint of proportional odd models that predictors have the same relative impact across all levels does not hold for the study in question. I was wondering if an ordinary binomial mixed model can be turned in an multinomial one through preparing the input data.frame in a different way: Consider three response levels, A, B, C, ordered. I can accurately describe the occurrence of each of these three realizations using one to two Bernoulli random variables: Let P(X == A) = a P(X in {B, C}) = 1 - a P(X == B | X in {B, C}) = (1 - a) * b P(X == C | X in {B, C}) = (1 - a) * (1 - b) so the first comparison checks if A or either of B/C is the case, and the second, conditional on it's either B/C, checks which of these two holds. Sort of traversing sequentially the hierarchy of the ordered levels. In terms of the likelihood of the desired model, the probabilities on the right hand side would be exactly achieved if I use one input row in case the random variable takes on the value A and assign the response variable the value 0, while in the other cases the probabilities are achieved by using two input table rows, with the first one having value 1 for the response variable so the random variate is either B/C) and a second row with response equal to 0 if B is the case, and 1 otherwise, that is C is the case. Certainly, degrees of freedom must be manually adjusted in inferences, as every measured response should provide only a single degree of freedom. Question: Do I overlook here something, or is above outlined way a valid method to yield an ordered multinomial mixed model by tweaking the input table in such manners ? many thanks and best, Thomas

1 1

boost::asio:read and timeout
by Carla Strembicke 10 May '11

10 May '11

Hi, This has probably been asked before. Is there a way to apply a timeout on the synchronous read for a socket in boost. I have no option but to do a synchronous read. If not is there a ticket and when is the release date for this functionality. Thanks CONFIDENTIAL INFORMATION NOTICE: The information contained in this e-mail is privileged, confidential and intended solely for the use of the addressee named above. If the reader of this e-mail is not the intended recipient, you are hereby notified that any dissemination, distribution or copying of this e-mail is strictly prohibited. If you received this in error, please contact the sender and destroy all copies of this e-mail. Thank you.

2 1

[variant] erase a type
by Igor R 10 May '11

10 May '11

Hello, I have to erase a variant element (type). Certainly, I can take its underlying mpl sequence, find<> what I need, erase<> it, and make another variant. I believe all this will be rather heavy in terms of compile-time/resources, so perhaps there's another more short way that I miss? Thanks.

1 0

Re: [Boost-users] Boost-users Digest, Vol 2718, Issue 2
by Mupparthy Ravindranath 10 May '11

10 May '11

Or [as a 2nd thought], should I use it like below: - pass raw object pointer to callback fn. - in the callback ________________________________ From: "boost-users-request(a)lists.boost.org" <boost-users-request(a)lists.boost.org> To: boost-users(a)lists.boost.org Sent: Tuesday, 10 May 2011 4:32 PM Subject: Boost-users Digest, Vol 2718, Issue 2 Send Boost-users mailing list submissions to boost-users(a)lists.boost.org To subscribe or unsubscribe via the World Wide Web, visit http://lists.boost.org/mailman/listinfo.cgi/boost-users or, via email, send a message with subject or body 'help' to boost-users-request(a)lists.boost.org You can reach the person managing the list at boost-users-owner(a)lists.boost.org When replying, please edit your Subject line so it is more specific than "Re: Contents of Boost-users digest..." Today's Topics: 1. Re: Boost-users Digest, Vol 2718, Issue 1 (Mupparthy Ravindranath) ---------------------------------------------------------------------- Message: 1 Date: Tue, 10 May 2011 16:32:28 +0530 (IST) From: Mupparthy Ravindranath <rv_nath(a)yahoo.com> To: "boost-users(a)lists.boost.org" <boost-users(a)lists.boost.org> Subject: Re: [Boost-users] Boost-users Digest, Vol 2718, Issue 1 Message-ID: <64558.18057.qm(a)web94805.mail.in2.yahoo.com> Content-Type: text/plain; charset="iso-8859-1" Actually, My intention is to pass a shared_ptr, as against a raw ptr.? The purpose is that after execting the callback, the shared_ptr can go out of scope, and ensure object deletion on its own, without having to call an explicit delete. So, I really wanted to pass a shared_ptr to the callback fn, as a void*. The reason behind this is... - i have a 3rd party timer engine, which accepts a callback function and callback args. - On timer expiry, it calls my regd callback implmentation, along with the args passed in its start_timer function. - Earlier, I was passing an object* to the callback args of the timer. - If the timer event fires, my callback impl gets called, and I get a chance to do a "delete", which is fine. - In some cases, I have to cancel / stop the timer.? And then since, my callback doesn't fire, I have no way to delete the obj*, and results in a memory leak. So, I wanted to pass a shared_ptr itself as the callback argument for my 3rd party timer. So that, even if timer doesn't fire, my object won't leak. regards, RV ________________________________ From: "boost-users-request(a)lists.boost.org" <boost-users-request(a)lists.boost.org> To: boost-users(a)lists.boost.org Sent: Tuesday, 10 May 2011 4:15 PM Subject: Boost-users Digest, Vol 2718, Issue 1 Send Boost-users mailing list submissions to ??? boost-users(a)lists.boost.org To subscribe or unsubscribe via the World Wide Web, visit ??? http://lists.boost.org/mailman/listinfo.cgi/boost-users or, via email, send a message with subject or body 'help' to ??? boost-users-request(a)lists.boost.org You can reach the person managing the list at ??? boost-users-owner(a)lists.boost.org When replying, please edit your Subject line so it is more specific than "Re: Contents of Boost-users digest..." Today's Topics: ? 1. Re: Error: guid_defined is not ? ? ? templateBOOST_CLASS_EXPORT_GUID (Robert Ramey) ? 2. Re: [Boost][program-options] Original position of an??? argument ? ? ? in command-line. (Vladimir Prus) ? 3. How to cast a boost::shared_ptr to void* (Mupparthy Ravindranath) ? 4. Re: How to cast a boost::shared_ptr to void* (Robert Jones) ? 5. Re: How to cast a boost::shared_ptr to void* (michi7x7) ? 6. Re: How to cast a boost::shared_ptr to void* ? ? ? (Mupparthy Ravindranath) ? 7. Re: How to cast a boost::shared_ptr to void* (Robert Jones) ? 8. Re: [Boost][program-options] Original position of an argument ? ? ? in command-line. (Germ?n Diago) ---------------------------------------------------------------------- Message: 1 Date: Mon, 9 May 2011 21:57:06 -0800 From: "Robert Ramey" <ramey(a)rrsd.com> To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] Error: guid_defined is not ??? templateBOOST_CLASS_EXPORT_GUID Message-ID: <iqagie$sbh$1(a)dough.gmane.org> Jari wrote: > Hi > I am using boost serialization and it was working fine (save load > works) but then I tried using BOOST_CLASS_EXPORT_GUID and get weird > error. > > The line that gives the error is this: > > BOOST_CLASS_EXPORT_GUID( Bakery, "Bakery") > > > (I put the code in Cpp to avoid any problems with headers.) > > > And this is the full Visual studio express 2010 error: > > 2>E:\boost_1_46_1\boost/archive/detail/check.hpp(162): error C2338: > typex::value ... what does the code look like at line 162 of check.hpp ? Robert Ramey ------------------------------ Message: 2 Date: Tue, 10 May 2011 10:45:04 +0400 From: Vladimir Prus <vladimir(a)codesourcery.com> To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] [Boost][program-options] Original position ??? of an??? argument in command-line. Message-ID: <iqamtg$nvf$1(a)dough.gmane.org> Content-Type: text/plain; charset="UTF-8" Germ?n Diago wrote: > Hi all. I have a question regarding boost.program_options. > > I want to parse a command-line but I want to know the order in which > each option appeared in the > command line. Is this possible? Thanks in advance. parse_command_line returns vector< basic_option<charT> >, which are in the order of occurence. This is a point where you can do logic based on the order. variables_map does not store order information. HTH, -- Vladimir Prus Mentor Graphics +7 (812) 677-68-40 ------------------------------ Message: 3 Date: Tue, 10 May 2011 13:26:09 +0530 (IST) From: Mupparthy Ravindranath <rv_nath(a)yahoo.com> To: "boost-users(a)lists.boost.org" <boost-users(a)lists.boost.org> Subject: [Boost-users] How to cast a boost::shared_ptr to void* Message-ID: <257490.53596.qm(a)web94803.mail.in2.yahoo.com> Content-Type: text/plain; charset="iso-8859-1" Hi all, My requirement is to cast an object of type shared_ptr as void*, so that I can send it to a callback function that accepts a void*.? I cannot change callback the function signature because it is part of an existing legacy code. In the existing code, I am sending a raw object pointer (instead of shared_ptr).? Now, if I want to pass a shared_ptr, it won't compile because I cannot cast the shared ptr to void*.? Can anyone suggest some workaround for this.? I tried searching the mailing lists and internet, but not much luck. regards, RV

2 1

Re: [Boost-users] Boost-users Digest, Vol 2718, Issue 1
by Mupparthy Ravindranath 10 May '11

10 May '11

Actually, My intention is to pass a shared_ptr, as against a raw ptr. The purpose is that after execting the callback, the shared_ptr can go out of scope, and ensure object deletion on its own, without having to call an explicit delete. So, I really wanted to pass a shared_ptr to the callback fn, as a void*. The reason behind this is... - i have a 3rd party timer engine, which accepts a callback function and callback args. - On timer expiry, it calls my regd callback implmentation, along with the args passed in its start_timer function. - Earlier, I was passing an object* to the callback args of the timer. - If the timer event fires, my callback impl gets called, and I get a chance to do a "delete", which is fine. - In some cases, I have to cancel / stop the timer. And then since, my callback doesn't fire, I have no way to delete the obj*, and results in a memory leak. So, I wanted to pass a shared_ptr itself as the callback argument for my 3rd party timer. So that, even if timer doesn't fire, my object won't leak. regards, RV ________________________________ From: "boost-users-request(a)lists.boost.org" <boost-users-request(a)lists.boost.org> To: boost-users(a)lists.boost.org Sent: Tuesday, 10 May 2011 4:15 PM Subject: Boost-users Digest, Vol 2718, Issue 1 Send Boost-users mailing list submissions to boost-users(a)lists.boost.org To subscribe or unsubscribe via the World Wide Web, visit http://lists.boost.org/mailman/listinfo.cgi/boost-users or, via email, send a message with subject or body 'help' to boost-users-request(a)lists.boost.org You can reach the person managing the list at boost-users-owner(a)lists.boost.org When replying, please edit your Subject line so it is more specific than "Re: Contents of Boost-users digest..." Today's Topics: 1. Re: Error: guid_defined is not templateBOOST_CLASS_EXPORT_GUID (Robert Ramey) 2. Re: [Boost][program-options] Original position of an argument in command-line. (Vladimir Prus) 3. How to cast a boost::shared_ptr to void* (Mupparthy Ravindranath) 4. Re: How to cast a boost::shared_ptr to void* (Robert Jones) 5. Re: How to cast a boost::shared_ptr to void* (michi7x7) 6. Re: How to cast a boost::shared_ptr to void* (Mupparthy Ravindranath) 7. Re: How to cast a boost::shared_ptr to void* (Robert Jones) 8. Re: [Boost][program-options] Original position of an argument in command-line. (Germ?n Diago) ---------------------------------------------------------------------- Message: 1 Date: Mon, 9 May 2011 21:57:06 -0800 From: "Robert Ramey" <ramey(a)rrsd.com> To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] Error: guid_defined is not templateBOOST_CLASS_EXPORT_GUID Message-ID: <iqagie$sbh$1(a)dough.gmane.org> Jari wrote: > Hi > I am using boost serialization and it was working fine (save load > works) but then I tried using BOOST_CLASS_EXPORT_GUID and get weird > error. > > The line that gives the error is this: > > BOOST_CLASS_EXPORT_GUID( Bakery, "Bakery") > > > (I put the code in Cpp to avoid any problems with headers.) > > > And this is the full Visual studio express 2010 error: > > 2>E:\boost_1_46_1\boost/archive/detail/check.hpp(162): error C2338: > typex::value ... what does the code look like at line 162 of check.hpp ? Robert Ramey ------------------------------ Message: 2 Date: Tue, 10 May 2011 10:45:04 +0400 From: Vladimir Prus <vladimir(a)codesourcery.com> To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] [Boost][program-options] Original position of an argument in command-line. Message-ID: <iqamtg$nvf$1(a)dough.gmane.org> Content-Type: text/plain; charset="UTF-8" Germ?n Diago wrote: > Hi all. I have a question regarding boost.program_options. > > I want to parse a command-line but I want to know the order in which > each option appeared in the > command line. Is this possible? Thanks in advance. parse_command_line returns vector< basic_option<charT> >, which are in the order of occurence. This is a point where you can do logic based on the order. variables_map does not store order information. HTH, -- Vladimir Prus Mentor Graphics +7 (812) 677-68-40 ------------------------------ Message: 3 Date: Tue, 10 May 2011 13:26:09 +0530 (IST) From: Mupparthy Ravindranath <rv_nath(a)yahoo.com> To: "boost-users(a)lists.boost.org" <boost-users(a)lists.boost.org> Subject: [Boost-users] How to cast a boost::shared_ptr to void* Message-ID: <257490.53596.qm(a)web94803.mail.in2.yahoo.com> Content-Type: text/plain; charset="iso-8859-1" Hi all, My requirement is to cast an object of type shared_ptr as void*, so that I can send it to a callback function that accepts a void*.? I cannot change callback the function signature because it is part of an existing legacy code. In the existing code, I am sending a raw object pointer (instead of shared_ptr).? Now, if I want to pass a shared_ptr, it won't compile because I cannot cast the shared ptr to void*.? Can anyone suggest some workaround for this.? I tried searching the mailing lists and internet, but not much luck. regards, RV

1 0

[Boost][program-options] Original position of an argument in command-line.
by Germán Diago 10 May '11

10 May '11

Hi all. I have a question regarding boost.program_options. I want to parse a command-line but I want to know the order in which each option appeared in the command line. Is this possible? Thanks in advance.

3 3