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

locate vertex
by Giulio Veronesi 19 Sep '05

19 Sep '05

Hi, I would like to locate an edge of a graph starting from the source and target vertex. For instance vertex(n, g) return the nth vertex of graph g. I would access the edge from vertex x to vertex y... something like this edge(x, y, g) Is there a fast way to do this? Thanks, Giulio

2 1

[RMI-like-lib] is there any interest in such?
by Slawomir Lisznianski 19 Sep '05

19 Sep '05

I've been thinking of a library that would bring RMI-like capabilities to C++ (RMI stands for Remote Method Invocation). Primary goal, and differentiating feature, of this library is not to rely on IDL-like compiler, hence no cross-language support either -- if you need that, check out CORBA (www.omg.org) or ICE (http://www.zeroc.com) As an example, I'm going to "implement" client and server sides of a trivial calculator using proposed library. Step 1. Define calculator interface ----------------------------------- // // Operations: add, subtract, multiply and divide // struct add { typedef function2<double, double, double> function_type; }; struct subtract { typedef function2<double, double, double> function_type; }; struct multiply { typedef function2<double, double, double> function_type; }; struct divide { typedef function2<double, double, double> function_type; }; // Calculator interface // typedef interface< operation<sum>, operation<subtract>, operation<multiply>, operation<divide> > calculator_i; Step 2. Client invocation ------------------------- // Construct a proxy to the remote calculator // instance. Arguments to the constructor // describe remote object's location (not shown). // proxy<calculator_i> calculator(...); // Call `subtract' on remote object (call // doesn't block). Returned object implements // Asynchronous Completion Token (or Future) // concept. // act<double> res = call<subtract>(calculator, 12, 43); // Retrieve actual result, or get an exception... // double result = res(); Step 3. Server implementation ----------------------------- // Implement actual calculator. // struct calculator_servant { double sum(double a, double b) { return a + b; } ... // other operations here }; // Instantiate calculator servant // calculator_servant servant; // Create a TCP listener. // tcp_listener listener(...) // Create a stub object that acts as an // adapter between transport and a servant. // stub<calculator_i> calculator(listener); // Install operation handlers. // calculator.register_function<add>(bind(&calculator_servant::sum, ref(servant), _1, _2)); ... // register remaining handlers // Start accepting calls. // calculator.activate(); // Block until exiting. // calculator.wait_for_shutdown(); ... -- end of example] I'm fairly satisfied with the client side, but I'm not so enthusiastic about the server side though. For one, it feels less safe. For example, what if a user forgets to register a "handler" for a particular operation? Any way to enforce this at compile time? Typically, say with CORBA, IDL compiler generates operations as pure virtual functions, so at compile time, the user knows what's left out in her servant. On the other side, it's quite powerful too (being able to "bind" functors to operations, that is). Would that be a problem for you or you'd see it as a good feature? Let me know what you think. Cheers, Slawomir Lisznianski

3 3

Re: [Boost-users] [Graph] Help on custom VertexList
by Nicola Vitacolonna 19 Sep '05

19 Sep '05

>> Why isn't there any "dequeS" tag in BGL? > > Historical accident. If you'd like we could add your implementation > for deque. Below you find my implementation for deque. Regards Nicola PS: sorry for forgetting the subject in my previous post, causing a mess with message threading... #include <boost/graph/graph_traits.hpp> #include <boost/graph/adjacency_list.hpp> #include <deque> namespace boost { namespace graph_detail { struct deque_tag : virtual public random_access_container_tag, virtual public back_insertion_sequence_tag { }; // No front_insertion_sequence_tag? template <class T, class Alloc> deque_tag container_category(const std::deque<T, Alloc>&){ return deque_tag(); } template <class T, class Alloc> unstable_tag iterator_stability(const std::deque<T, Alloc>&) { return unstable_tag(); } #if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION template <class T, class Alloc> struct container_traits< std::deque<T, Alloc> > { typedef deque_tag category; typedef unstable_tag iterator_stability; }; #endif } // namespace graph_detail struct dequeS { }; template <typename ValueType> struct container_gen<dequeS, ValueType> { typedef typename std::deque<ValueType> type; }; } // namespace boost // Test int main(int, char*[]) { typedef boost::adjacency_list<boost::vecS, boost::dequeS, boost::bidirectionalS> Graph; Graph g; Graph::vertex_descriptor v1, v2; v1 = boost::add_vertex(g); v2 = boost::add_vertex(g); boost::add_edge(v1, v2, g); }

1 0

Re: [Boost-users] [boost] Beyond the C++ Standard Library: An Introduction to B oost
by Bjorn.Karlsson＠readsoft.com 19 Sep '05

19 Sep '05

Hello Beman, > From: Beman Dawes [mailto:bdawes@acm.org] > > What kind of animal is that on the cover? Some kind of Lemur? Yes, they are lemurs. In case some of you are wondering what lemurs and Boost have in common, I must confess that I have absolutely no idea. My editor, Peter Gordon, came up with the unbelievably far-fetched connection that "Boost is giving a lift to the C++ Standard Library". I think that he, just as you and I did, simply thought that they were just about the cutest things you ever saw. (When deciding which cover picture to go with, I also consulted my six-year-old son, who made it quite clear that the other options were, ahem, less perfect than the one with the lemurs.) > It is about the cutest thing I've seen in a long time. (Don't > tell my office cat I said that.) My lips are sealed. Björn

1 0

[bind] Pointer to functions as template parameters
by Bruno Martínez 19 Sep '05

19 Sep '05

Hi. When using pointers to functions with bind, the particular function doesn't play a part in the return value's type of bind. That is void func1(); void func2(); typeid(boost::bind(&func1)) == typeid(boost::bind(&func1)) // this is true I need the types to be different to store bind objects with the serialization library. The C++ Templates book proposes an adaptor that takes the pointer to function as a template parameter. However, this adaptor is particular to a given signature, and I don't know how to rewrite it more generally. Is this possible? Can I more easily make boost::bind do what I want? Bruno

4 7

Parsing RFC 822 date/time
by Tobias Grimm 19 Sep '05

19 Sep '05

Hi! I'm trying to parse a rfc822 date as used in RSS feeds. It looks like this: Sat, 07 Sep 2002 00:00:01 GMT Is this possible with time_facet somehow? I think at least the time zone can't be parsed, because the corresponding format specifiers are for output only. Any idea how this kind of date format should be parsed? bye, Tobias

2 3

(no subject)
by Nicola Vitacolonna 18 Sep '05

18 Sep '05

Thank you! Actually, boost::array is an unfortunate choice, as it does not model a Sequence. But I have successfully built a vertex list out of std::deque. Which has suggested me a couple of more questions: 1) I should also overload iterator_stability() for my container, shouldn't I? 2) I did a quick test: adding vertices to a graph (adjacency_list) whose vertex list is implemented as a deque turns out to be faster than adding vertices to a vector-based (or even a list-based) graph. Why isn't there any "dequeS" tag in BGL? Regards Nicola > > Hi everybody, > > I want to use my custom container as a vertex list in a graph. I > have > > followed the documentation, but I don't know exactly how I should > > overload the push() and erase() functions. > > Sorry, looks like the documentation is incomplete in that regard. > I'll fix that. > > You can find examples of push() and erase() in: > > boost/pending/container_traits.hpp > > > The following example code, using boost::array, gives an error: "no > > matching function for call to 'container_category > (boost::array<void*, > > 10ul>&)". Can someone help me? > > You'll need to define a container_category function for boost::array. > There are examples of this also in container_traits.hpp. > > Cheers, > Jeremy

2 1

Question about network flow examples
by Sumanth J.V 18 Sep '05

18 Sep '05

Greetings, On the edmunds-karp-eg.cpp and the push-relabel-eg.cpp, the output is is as shown below. But I dont understand how in the first flow describing line "f 0 6 3" is listed since there is not vertex with id 0. The vertices are labeled from 1 to N as I understand. Even the input file max_flow.dat in the examples folder labels the vertices from 1..N. thanx // Sample output: // c The total flow: // s 13 // // c flow values: // f 0 6 3 // f 0 1 0 // f 0 2 10 // f 1 5 1 // f 1 0 0 // f 1 3 0 // f 2 4 4 // f 2 3 6 // f 2 0 0 // f 3 7 5 // f 3 2 0 // f 3 1 1 // f 4 5 4 // f 4 6 0 // f 5 4 0 // f 5 7 5 // f 6 7 3 // f 6 4 0 // f 7 6 0 // f 7 5 0

1 0

multi-index container: a more general basic usage example 1
by Alexander Schuh 18 Sep '05

18 Sep '05

Hi, in Example 1 there is a structure: struct employee { int id; std::string name; int age; … }; Is it possible to create automatically A) container with id as an index B) a view with name as index C) a view with age as index ? For this example it is easy to create the containers and views by hand but I plan to use at least 10 structures with many dimensions. For some containers I also need hash_indices - so there is really a lot of similar code, which I don’t want to have. Also I want to provide iterators or one general (template) iterator for all dimensions. How would you write such a general iterator? There should be a function that takes for example “employee_name” or “employee_id” as a parameter to query the employee container. It would also be interesting to have a function that creates an iterator based only on the Information, for example, multi_index::container(1)_index(2). Is there a function that calculates the max. index number of a certain container? Thank you very much, Alex Schuh -- No virus found in this outgoing message. Checked by AVG Anti-Virus. Version: 7.0.344 / Virus Database: 267.11.1/104 - Release Date: 16.09.2005

2 1

[Graph] Help on custom VertexList
by Nicola Vitacolonna 18 Sep '05

18 Sep '05

Hi everybody, I want to use my custom container as a vertex list in a graph. I have followed the documentation, but I don't know exactly how I should overload the push() and erase() functions. The following example code, using boost::array, gives an error: "no matching function for call to 'container_category(boost::array<void*, 10ul>&)". Can someone help me? One more question: is it possible to get a reference to the vertex container, given an adjacency_list<...> object? Nicola #include <boost/graph/adjacency_list.hpp> #include <boost/array.hpp> struct arrayS { }; namespace boost { template <class ValueType> struct container_gen<arrayS, ValueType> { typedef array<ValueType, 10> type; }; } int main(int,char*[]) { typedef boost::adjacency_list<boost::vecS, arrayS, boost::bidirectionalS> Graph; Graph g(10); boost::add_vertex(g); boost::add_vertex(g); boost::add_edge(vertex(0, g), vertex(1, g), g); return 0; }

2 1

[MPL] vector_c which contains string literals
by Hossein Haeri 18 Sep '05

18 Sep '05

Dear MPL maniacs, AFAIK, there is no mpl::vetor_c which can hold string literals. Or is it? If not, isn't there any way to implement one? Any voluteers please? Thanks in Advance, --Hossein ___________________________________________________________ Yahoo! Messenger - NEW crystal clear PC to PC calling worldwide with voicemail http://uk.messenger.yahoo.com

2 2

Question about proper container/algorithm to use for fast dictionary lookup
by Elisha Berns 18 Sep '05

18 Sep '05

Hi, This question is whether Boost already has, or perhaps needs to have a container type that is specifically designed for fast word lookup in a UNICODE dictionary. It has occurred to me that an associative container that is specifically designed for word lookup may be much faster than the standard containers such as map, hash_map, associative_vector as they are general purpose containers. So the more detailed questions are: 1) What type of algorithm/container should be used here? 2) Would its performance be much better than a general purpose associative container? Thanks, Elisha Berns e.berns(a)computer.org tel. (310) 556 - 8332 fax (310) 556 - 2839

3 3

BGL - randomize_property & bundled properties
by Giulio Veronesi 17 Sep '05

17 Sep '05

Hi all, Is it possible to use the randomize_property routines with boundled properties? If so, could you please explain me how? For istance let us consider the following example: struct MyVertexAttr { int attr; }; typedef adjacency_list<vecS, vecS, bidirectionalS, MyvertexAttr, MyEdgeAttr> MyGraph; MyGraph g(...); Now I would like to randomly assign a number in [1,10] to the 'attr' property of each vertex. randomize_property<????????>(g, MyRandGenerator); What is the correct invocation of the randomize_property function? Thanks in advance, Giulio

1 0

regex and ICU
by louis 17 Sep '05

17 Sep '05

Hi, I am trying to build the regex library with ICU (MSVC 6.0). I get the following error: Z:\dev\3rd\boost_1_33_0\boost/regex/icu.hpp(42) : error C2039: 'Locale' : is not a member of '`global namespace'' Any help would be greatly appreciated. Thanks Louis

3 3

[Pre-processing] String Litereal Comparison for Equality
by Hossein Haeri 17 Sep '05

17 Sep '05

Dear all, Is there anyway (say using a utility in BOOST_PP) at pre-processing phase to compare string literals for equality? TIA, --Hossein ___________________________________________________________ Yahoo! Messenger - NEW crystal clear PC to PC calling worldwide with voicemail http://uk.messenger.yahoo.com

2 2

Build errors and crash with 1.33.0 under Mac OS X CodeWarrior
by Allen Cronce 17 Sep '05

17 Sep '05

Hi all, I just updated from boost 1.32.0 to 1.33.0 for a CodeWarrior MSL/carbon project under Mac OS X. There were several build errors stemming from the fact that "check" is already defined in /usr/include/AssertMacros.h. For now I dealt with this my modifying my copy of the boost libraries to substitute _check for check. This is of course an ugly solution, but I wanted to move forward. Unfortunately now I'm seeing crashes with code that worked fine with 1.32.0. Here's some test code that demonstrates the crash: _tprintf(_T("\nTest a vector of boost shared_ptr's:\n")); typedef boost::shared_ptr<std::string> SharedPtrString; typedef vector<SharedPtrString> StringContainer; typedef vector<SharedPtrString>::iterator StringContainerIterator; { SharedPtrString sharedPtrString1(new std::string("Hi there!")); SharedPtrString sharedPtrString2(new std::string("Hi there!")); _tprintf( _T(" sharedPtrString1->c_str() = \"%s\"\n"), sharedPtrString1->c_str() ); _tprintf( _T(" sharedPtrString2->c_str() = \"%s\"\n"), sharedPtrString2->c_str() ); } // We never get here because of an access error Basically when the SharedPtrString goes out of scope, I get an access error deep in the allocation code. Does anyone have suggestions for resolving these issues? Note that I could go back to 1.32.0, but I want to use the new Pointer Container Library. Best regards, -- Allen Cronce

3 6

[iostream]: Simple sinks result in runtime error
by Marius Renn 17 Sep '05

17 Sep '05

Hi all, This is my first post, so please let me know if I am doing anything wrong. I am having trouble using the new iostream headers in Boost 3.3. I cannot get simple Sinks to function correctly. Take the following code for example: namespace bio = boost::iostreams; int main() { typedef bio::stream<bio::null_sink> nullsink; nullsink out; out << "Ignore me"; } This code always results in a runtime assertion failure: /usr/local/include/boost/iostreams/detail/optional.hpp:54: failed assertion `initialized_' What am I doing wrong? Any help would be greatly appreciated. Cheers, Marius

2 1

compiling boost.signals without exception
by Martin Sarrazac 17 Sep '05

17 Sep '05

Hi, compiler: mingw gcc 3.4.4 I would like to compile boost.signals without exception handling, I read somewhere about the <exception-handling> feature so I tried: bjam --builddir=c:\temp -sTOOLS=mingw "-sBUILD=debug <exception-handling>off <runtime-link>dynamic <threading>single" --libdir=C:\boost\lib\noe --with-signals -d2 install without success, it compiles fine but not without exception handling. specifically the -fno-exception command line option should be passed to gcc and it's not. I had a look at tools/build/v1/gcc-tools.jam and I found this line for rtti support for instance: flags gcc C++FLAGS <rtti>off : -fno-rtti ; However there is nothing equivalent for exceptions... On a side note I don't know how to give a new tag to the 'no exception' version of the library, so I compiled it in an other directory (--libdir=C:\boost\lib\noe). However I would much prefer to give it a specific name. Is there somewhere information about all the -sBUILD flags can be found? Can't seem to locate it. Thanks for your help

2 1

Problems going from Serialization 1.32 to 1.33
by Stefan Arentz 17 Sep '05

17 Sep '05

Hello fellow Boost users, Consider the following program: #include <sstream> #include <string> #include <vector> #include <boost/archive/text_oarchive.hpp> #include <boost/serialization/base_object.hpp> #include <boost/serialization/string.hpp> #include <boost/serialization/vector.hpp> template <typename T> std::string archive(T thing) { std::ostringstream oss; boost::archive::text_oarchive oa(oss); oa << thing; return oss.str(); } typedef std::vector< std::string > parameters_t; int main() { parameters_t parameters; parameters.push_back("a"); parameters.push_back("b"); std::string s = archive<parameters_t>(parameters); return 0; } When I compile this with Boost 1.32 it compiles and works fine. However, with Boost.1.33 it fails with: /usr/local/include/boost/archive/detail/oserializer.hpp: In function `void boost::archive::save(Archive&, T&) [with Archive = boost::archive::text_oarchive, T = std::vector<std::string, std::allocator<std::string> >]': /usr/local/include/boost/archive/basic_text_oarchive.hpp:78: instantiated from `void boost::archive::basic_text_oarchive<Archive>::save_override(T&, int) [with T = std::vector<std::string, std::allocator<std::string> >, Archive = boost::archive::text_oarchive]' /usr/local/include/boost/archive/detail/interface_oarchive.hpp:85: instantiated from `Archive& boost::archive::detail::interface_oarchive<Archive>::operator<<(T&) [with T = parameters_t, Archive = boost::archive::text_oarchive]' test.cpp:16: instantiated from `std::string archive(T) [with T = parameters_t]' test.cpp:28: instantiated from here /usr/local/include/boost/archive/detail/oserializer.hpp:566: error: incomplete type `boost::STATIC_ASSERTION_FAILURE<false>' does not have member `value' I'm not sure what to change. Is this correct behaviour? S.

2 1

Re: [Boost-users] Help on Boost.MultiArray
by Adewole, Mike 16 Sep '05

16 Sep '05

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Sohail Somani > Sent: Friday, September 16, 2005 2:44 PM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Help on Boost.MultiArray > > > > -----Original Message----- > > From: boost-users-bounces(a)lists.boost.org > > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > > Adewole, Mike > > Sent: Friday, September 16, 2005 10:46 AM > > To: boost-users(a)lists.boost.org > > Subject: [Boost-users] Help on Boost.MultiArray > > > > > > Hi all, > > > > Does anyone know how to insert and delete a range of rows > > and/or columns in the multiarray class documented at > > http://www.boost.org/libs/multi_array/doc/ ? What > > performance guarantees can I expect for these operations ? > > > > I'm a little pressed for time and haven't been able to figure > > out how to do this on my own. The statement that "The number > > of elements will remain fixed for the duration of a > > multi_array's lifetime" on the documentation page suggests > > that these operations may not even be supported, but I'm not > > sure if I'm misunderstanding the statement or not. > > I don't think you can insert/delete stuff like in a vector. > Seemed to me too that the library doesn't support insertions/deletions but I had to be sure before doing this thing the hard way. Thanks a million. Mike

1 0

[filesystem] function to determine available space
by Beman Dawes 16 Sep '05

16 Sep '05

I'm planning to add a filesystem function to determine available disk space. Perhaps something like: struct space_status { boost::uintmax_t available; // free space available to user boost::uintmax_t total; // total space on volume }; space_status filesystem_space( const path & p ); Comments? Better suggestions for the names? --Beman

6 11

Re: [Boost-users] Help on Boost.MultiArray
by Sohail Somani 16 Sep '05

16 Sep '05

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Adewole, Mike > Sent: Friday, September 16, 2005 10:46 AM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] Help on Boost.MultiArray > > > Hi all, > > Does anyone know how to insert and delete a range of rows > and/or columns in the multiarray class documented at > http://www.boost.org/libs/multi_array/doc/ ? What > performance guarantees can I expect for these operations ? > > I'm a little pressed for time and haven't been able to figure > out how to do this on my own. The statement that "The number > of elements will remain fixed for the duration of a > multi_array's lifetime" on the documentation page suggests > that these operations may not even be supported, but I'm not > sure if I'm misunderstanding the statement or not. I don't think you can insert/delete stuff like in a vector.

1 0

Help on Boost.MultiArray
by Adewole, Mike 16 Sep '05

16 Sep '05

Hi all, Does anyone know how to insert and delete a range of rows and/or columns in the multiarray class documented at http://www.boost.org/libs/multi_array/doc/ ? What performance guarantees can I expect for these operations ? I'm a little pressed for time and haven't been able to figure out how to do this on my own. The statement that "The number of elements will remain fixed for the duration of a multi_array's lifetime" on the documentation page suggests that these operations may not even be supported, but I'm not sure if I'm misunderstanding the statement or not. Thanks a lot. -------------------------------------------------------- Mike Adewole ACNielsen, Global Decision Support Services ph: 905-475-3344x2411 fx: 905-475-8357 mike.adewole(a)acnielsen.ca --------------------------------------------------------

1 0

Could the BGL graph algorithms be improved to automatically work with VertexList = listS graphs?
by Tony Cook 16 Sep '05

16 Sep '05

Hi, If I define a BGL graph of the type typedef boost::adjacency_list <boost::vecS, boost::listS, boost::undirectedS, boost::no_property, boost::no_property, boost::no_property> BadGraphType ; Then many of the standard BGL graph algorithms such as boost::graph_copy will not compile (e.g you get "binary '+' : no operator found which takes a left-hand operand of type <type>" with VC7.1 - this did not help me understand what the problem really was - i.e. a missing vertex_index property!) This "no-compiler" problem is only fixed if either a vertex_index property map is made explicitly present on this graph type via VertexProperties template argument (See #5 on the BGL FAQ page (http://www.boost.org/libs/graphd/oc/faq.html .)) OR the particular graph algorithm is passed an external (or internal - if not of the vertex_index_t type) property map as a named parameter as in: boost::graph_copy (graph_in, graph_out, boost::vertex_index_map (i_map)) ; In either case prior to copying (or whatever) you need to ensure this property map is numbered contiguously from 0 to n - 1, where n is the number of graph vertices. My graph does not support an implicit vertex_index property, nor do I *want* to add an explicit vertex_index compatible property *just* to make these algorithms work. Especially as my graphs are dynamic and I would have to remember to renumber the property values to eliminate gaps after vertices are deleted. The BGL algorithms in this situation are particularly weak as first the "no-compile" messages are remote from the real problem, and when you have solved that then you have to prepare the graph properly prior using the algorithm! (if not you get memory scribbles if the indices are not contiguous and confined to 0 to n-1) These lead me to wonder if this problem can be eliminated and be automated as part of the algorithm itself, i.e. if no vertex_index property was supplied by any means, then the algorithm creates a temporary vertex index map, loads it with vertices mapped to indices 0 to n-1 and runs the algoritm out-of-the-box. It should be possible for the compiler to detect that the internal property map is missing AND the named parameter alternative is missing (in fact the implementations of these BGL algorithms *do* set out to discover that this is the case, but unfortunately a final vertex "descriptor-is-the-index" map (which is only true when VertexList=vecS) is assumed and hence the compilation failure and a lot grief and a steep learning curve is experienced :( ) Now to the point I wanted to make :). There IS a solution that can do this. However I'm not expert enough to merge this into the heart of each BGL graph algorithm algorithm that requires a vertex_index property. I have however developed crude wrappers that do this. Here is an example solution for boost::copy_graph that handles any graph type out of the box /** copy_graph_ex. A wrapper for boost::copy_graph that sets up the required vertex to 0 -> n - 1 index translation map @param g_in the graph to copy @param g_out the graph copy */ template <class G1, class G2> void copy_graph_ex (const G1& g_in, G2& g_out) { // Create a temporary external property map that maps vertex // descriptors to indices that will run 0 to n-1 typedef std::map<typename G1::vertex_descriptor, typename G1::vertices_size_type> i_type ; typedef boost::associative_property_map<i_type> i_map_type ; i_type i ; i_map_type i_map (i) ; // Load the external property map with values 0 to n-1 G1::vertices_size_type n = 0 ; G1::vertex_iterator vi ; G1::vertex_iterator vi_end ; for (boost::tie (vi, vi_end) = boost::vertices (g_in) ; vi != vi_end ; ++vi) { boost::put (i_map, *vi, n++) ; } // Get the BGL graph algorithm to use the constructed index map boost::copy_graph (g_in, g_out, boost::vertex_index_map (i_map)) ; } It would be much nicer if this external setup code was made part of the default handling of BGL graph algorithms that require it. What do to BGL experts/implementers say? Would it not be **saner** to get these algorithms to work automatically no matter what graph type was chosen? TIA Tony Cook (who went insane with this problem for two days)

7 14

[Graph] how to obtain the complement of a graph?
by Tzu-Chien Chiu 16 Sep '05

16 Sep '05

Given a graph G=(V,E) and its complete graph G'=(V,E'), what is the shortest code lines to obtain the complement of G_c=(V,E'-E) ?

2 1

[signal/bind/mem_fn] std::vector< boost::signal<> >
by kartoffelsack 16 Sep '05

16 Sep '05

Hi! I'd like to save any kind of functions/functors with void as parameter and as return-value in a container. I thought to use boost::bind: Let me show you some code: void bar( ) { } struct Foo { void operator(); }foo; typedef boost::signal<void ()> voidFunctionSig; std::vector< voidFunctionSig> voidFunctions; voidFunctionSig signal1; voidFunctionSig signal2; signal1.connect( &bar); signal2.connect( &foo); voidFunctions.push_back( signal1); //error voidFunctions.push_back( signal2); //same error I'm getting a Compiler-errors in the push_back-Lines: 'boost::signal<Signature>::__ctor': no nonexplicit constructor for implicit conversion: with [ Signature=void (void) ] and [ Signature=void (void) ] well, i'm not shure if boost::bind is the right choice at all, because I do not need multiple slots. Perhaps boost::bind/boost::mem_fn was enough but i cannot think how to use it. Can anybody help me to save my void (*)(void)-functions/functors and in a container? I could do it writing a superclass and a virtual op() but I would prefer to use ready-to-use boost-classes for this task. PS: using VC 7.1

2 2

Exception occurred in "boost::thread" cannot be caught by vs.net.
by 蹬三轮的 16 Sep '05

16 Sep '05

When an "access violation" exception occurred and didn't be caught by the program, it would be caught by debugger such like vs.net. 1: int main() 2: { 3: int *i = 0; 4: *i = 1; 5: } If I debug this program in vs.net, program will be broken at line 4 and an exception dialog box will be displayed. So I can know the origin of the exception. The problem is when the exception occurred in the thread started by boost::thread, program cannot be broken at the line from which exception been thrown. 01: void func() 02: { 03: int *i = NULL; 04: *i = 1; 05: } 06: int _tmain(int argc, _TCHAR* argv[]) 07: { 08: thread *t = new thread(func); 10: t->join(); 11: delete t; 12: return 0; 13: } The program should be broken at line 4, but it didn't. This makes the debugging boost::thread more difficult. How can I resolve the problem? thanks.

4 4

[Boost.Python] Infinite recursion attempting to_python conversion
by Nat Goodspeed 16 Sep '05

16 Sep '05

For some purposes we have a special string class derived from std::wstring. Simplified declaration: class cbstring: public std::wstring { public: cbstring(const wchar_t* that): std::wstring(that) {} cbstring(const std::wstring& that): std::wstring(that) {} ... }; I want to return such objects from C++ as Python Unicode strings, e.g.: cbstring produceWString() { return L"This is a test Unicode string"; } If produceWString() returns std::wstring, the conversion happens by magic. But with the cbstring return type, I get: TypeError: No to_python (by-value) converter found for C++ type: class cbstring The corresponding conversion problem (passing u"Foo" from Python to a function accepting const cbstring&) can be handled with the following call in the extension module: implicitly_convertible<std::wstring, cbstring>(); However, implicitly_convertible<cbstring, std::wstring>(); does NOT allow the produceWString() function to succeed: I still get the aforementioned TypeError. So I declared a type converter: struct cbstring_to_python { static PyObject* convert(const cbstring& cbs) { return PyUnicode_FromUnicode(cbs.c_str(), cbs.length()); } }; and registered it with: to_python_converter<cbstring, cbstring_to_python>(); The result is a stack overflow. I'm not clear on exactly why it happens, but something inside the cbstring_to_python converter is apparently recursively invoking cbstring_to_python::convert(). How *should* I go about returning our specialized string type as a Python Unicode string? OS: Microsoft Windows XP Pro, SP1 Compiler: Microsoft VC++ 7.1 with STLport 4.6 Boost version: 1.31

2 1

Re: [Boost-users] [serialization, 1_33_0] Correct usage and implementation for serializable objects without default constructors
by Martin Proulx 16 Sep '05

16 Sep '05

> In this example, we have a class A that doesn't have a default > constructor. > An int is needed by the constructor, which is stored in the i member > variable. load/save_construct_data are used to un/serialize the i member, > while the serialize member is used for all other members. > > Looking at this test, I see a couple of behaviors that puzzle me. > > -) Saving the 'a' instance in the save() function doesn't end up calling > save_construct_data. This leaves a serialized version of A which lacks > the > 'i' member. This makes it impossible to fully restore the 'a' > instance. It > seems problematic to me that save_construct_data isn't called in this > case. > >> I just re-ran test_non_default_ctor. I ran under the VC 7.1 debugger and >> inserted traps inside both save_construct_data and >> load_construct_data. II >> verified that save_construct_data and load_construct_data are being >> invoked >> exactly as they are intended. I see no problem here. > > > In my planned usage, I'd like to fully serialize all members, > regardless if > the objects are serialized directly or through pointers. I cannot see how > to do this without serializing the members needed to reconstruct the > object > in both serialize and save_construct_data, even if some members will > end up > serialized twice when an object is stored through a pointer. > >> If the members are not pointers, the constructor is never called. so the >> parameters set by the constructor are not needed. >> save_load_contruct_data >> is only called when its necessary to create a new object. > > > What's the proper way to serialize all members of a class without a > default > constructor so that it gets fully serialized regardless how the > objects are > managed? > >> Exactly as described in the manual and illustrated by the example >> test_non_default_ctor. > > > -) When restoring the 'a' instance within load(), in order to restore > it, we > first create another 'a' instance (with a different constructor > argument), > then restore the other members within, leaving untouched the 'i' member. > Assuming I'd like to be able to serialize and unserialize completely > objects > that do not have a default constructor, I'm wondering how I can fully > restore an object that doesn't have a default constructor. > >> All you have to do is define save_construct_data and >> load_construct_data for >> all types which don't have a default constructor. The library takes >> care of >> everything else. > > > I've looked for some other mechanism relying on a copy constructor and > something along the lines of load_construct_data, but I haven't found > any. > >> Somehow I'm thinking you're looking for the wrong thing. I wonder if >> you're >> not underestimating what the library does for you. As I said, you, only >> need to define save/load_construct_data for those types which don't >> have a >> default constructor - there is nothing else required to do. >> >> Robert Ramey > > Hello, As this discussion is going, it seems clear that either I'm missing something somewhere or that I'm not being clear enough in exposing my problems... I'll directly include a sample of something similar to what I'd like to achieve that doesn't work. Please take a look at the example, and let me know how you would modify this to make both assert succeed. If you notice that I've missed some concept in the way the library should be used, please enlighten me! Thanks, Martin ------------------------------------------------------------------------ #include <cstdlib> #include <cassert> #include <sstream> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/serialization/string.hpp> using namespace std; class Person { public: Person(const string& name) : _name(name), _favoriteFood("none") {} const string& getName() const {return _name;} const string& getFavoriteFood() const {return _favoriteFood;} void setFavoriteFood(const string& favoriteFood) {_favoriteFood = favoriteFood;} private: const string _name; string _favoriteFood; friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int /* file_version */){ ar & _favoriteFood; } }; namespace boost { namespace serialization { template<class Archive> inline void save_construct_data(Archive & ar, const Person * person, const unsigned int /* file_version */) { ar << person->getName(); } template<class Archive> inline void load_construct_data(Archive & ar, Person * person, const unsigned int /* file_version */) { string name; ar >> name; ::new(person)Person(name); } } // serialization } // namespace boost template<class Archive> void serializePerson(Archive& oa, const Person& someone) { // save_construct_data isn't called when serializing a Person in this fashion. // The person's name will not appear in the archive. oa << someone; } template<class Archive> Person UnserializePerson(Archive& ia) { // I'm constructing a temporary person, with a bogus name, as it's the only workaround I've come up with. // There is no way that unserializing returns an actual object, like I'm needing here. Person someone("bogus name"); // When unserializing in this fashion, load_construct_data isn't called either. ia >> someone; // The initial person's name is then lost. return someone; } void main(void) { Person *const Joe = new Person("Joe"); Person John("John"); stringstream stringStream; boost::archive::text_oarchive oa(stringStream); oa << Joe; serializePerson(oa, John); boost::archive::text_iarchive ia(stringStream); Person* restoredPersonPointer; ia >> restoredPersonPointer; Person restoredPerson(UnserializePerson(ia)); assert(restoredPersonPointer->getName() == Joe->getName()); // works fine. assert(restoredPerson.getName() == John.getName()); // fails. } -- Tel: (450) 681-1681, #271 ------------------------------------------------------------------------ OKIOK Enterprise and e-business security solutions Solutions de sécurité d'entreprise et d'affaires électronique Tel. : (450) 681.1681 http://www.okiok.com This e-mail message (including attachments, if any) is intended for the use of the individual or entity to which it is addressed and may contain information that is privileged, proprietary, confidential and exempt from disclosure. If you are not the intended recipient, you are notified that any dissemination, distribution or copying of this communication is strictly prohibited. If you have received this communication in error, please notify the sender and erase this e-mail message immediately. Le présent message électronique (y compris les pièces qui y sont annexées, le cas échéant) s'adresse au destinataire indiqué et peut contenir des renseignements de caractère privé ou confidentiel. Si vous n'êtes pas le destinataire de ce document, nous vous signalons qu'il est strictement interdit de le diffuser, de le distribuer ou de le reproduire. Si ce message vous a été transmis par erreur, veuillez en informer l'expéditeur et le supprimer immédiatement.

4 10

Re: [Boost-users] Could the BGL graph algorithms be improvedto automatically work with VertexList = listS graphs?
by Tony Cook 16 Sep '05

16 Sep '05

I retracted this in a subsequent post - it was my problem with a custom vertex property (blush) >From: Daryle Walker <darylew(a)hotmail.com> >Reply-To: boost-users(a)lists.boost.org >To: Boost Users mailing list <boost-users(a)lists.boost.org> >Subject: Re: [Boost-users] Could the BGL graph algorithms be >improvedto automatically work with VertexList = listS graphs? >Date: Thu, 15 Sep 2005 18:05:46 -0400 > >On 9/15/05 7:05 AM, "Tony Cook" <tony__cook(a)hotmail.com> wrote: > > > Can I add that misuse of graph assignment and a graph copy constructor >is > > possible - corruptible shallow copies are the result. These methods >should > > be given private scope to prevent (mis)use or be correctly implemented > > > > G2 = G1 ; // Compiles but NO you must use boost::graph_copy (G1, G2) >instead > >If this is accurate, then it should be fixed. Types with abnormal copying >semantics can't be used in STL containers or similar contexts. > >-- >Daryle Walker >Mac, Internet, and Video Game Junkie >darylew AT hotmail DOT com > >_______________________________________________ >Boost-users mailing list >Boost-users(a)lists.boost.org >http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

How can I find all the shortest path in a graph?
by Giulio Veronesi 16 Sep '05

16 Sep '05

Hi all, Please excuse me if I post my question again, but I've spent all the night and the day before looking for a solution of the following problem: How to find *all* the possible shortest paths from a source vertex to a target vertex in a directed graph? I tried using depth_first_search and acting on visitors without any success. Please, could you help me? Thanks a lot in advance, Giulio

1 0

How to extending algorithms with visitors
by Giulio Veronesi 15 Sep '05

15 Sep '05

Hi all, I'm enjoying learning the boost graph library. I'm trying to use the Dijkstra algorithm and try to store the shortest path as explained in the subsection "Extending Algorithms with Visitors" of the section "Quick Tour" of the BGL user guide. When I try to compile my code, I get the following error message: mesh.cpp:38: error: expected constructor, destructor, or type conversion before '<' token mesh.cpp:38: error: expected `;' before '<' token where line 38 is highlighted in the following portion of code. Could you help me to resolve this problem? Thanks in advance, Giulio template <class PredecessorMap> class record_predecessors : public dijkstra_visitor<> { public: record_predecessors(PredecessorMap p) : m_predecessor(p) { } template <class Edge, class Graph> void edge_relaxed(Edge e, Graph& g) { // set the parent of the target(e) to source(e) put(m_predecessor, target(e, g), source(e, g)); } protected: PredecessorMap m_predecessor; }; template <class PredecessorMap> line 38: record_predecessors<PredecessorMap> make_predecessor_recorder(PredecessorMap p) { return record_predecessors<PredecessorMap>(p); } ___________________________________ Yahoo! Mail: gratis 1GB per i messaggi e allegati da 10MB http://mail.yahoo.it

3 4

Matrix of submatricies...
by Edward Grace 15 Sep '05

15 Sep '05

Dear all, [you may need a fixed with font] Consider the following 4x4 matrix which is a 2x2 matrix of submatricies. A B | 0 0 C D | 0 0 ----+---- 0 0 | a b 0 0 | c d Clearly matrix operations such as products do not need to involve the off diagonal (zero) sub matricies. Is there a matrix type that "knows" about this type of matrix so that when prod() is carried out it does not do unnecessary operations with the zero elements? -ed

2 1

[Regex] Empty regular expression
by Marco Craveiro 15 Sep '05

15 Sep '05

Hello boosters, First, apologies if this has been discussed before - I did some googling and could not find it. I've bumped into an interesting issue while using Boost.Regex. The documentation states: http://www.boost.org/libs/regex/doc/basic_regex.html Effects: Constructs an object of class basic_regex. The postconditions of this function are indicated in the table: Element Value empty() true size() 0 str() basic_string<charT>() Using 1.33, I get empty() set to false with the default constructor. In addition, if you attempt to search using an empty regex, the program segfaults. The following example demonstrates the problem: code: ------ #include <iostream> #include <string> #include <boost/regex.hpp> int main() { std::string line("this is an example line"); boost::smatch what; boost::regex re; std::cout << "re.empty(): " << re.empty() << std::endl; bool result = boost::regex_search(line, what, re); } output: ------ re.empty(): 0 Segmentation fault This does not happen if I initialize the regex using an empty string (it throws empty expression). Which leads to the main question (and the reason why I discovered all of this): is it possible to make a regular expression that matches anything? For instance, when using AWK, if you define a rule without a pattern, i.e.: { print $0; } I thought an empty regex would do the trick. Regards, Marco -- in software development, the design document is a source code listing. -- jack reeves

2 1

Error compiling boost/tuple/tuple.hpp with boost 1.33 on VC 7.1
by Rob Caldecott 15 Sep '05

15 Sep '05

I have just upgraded to boost 1.33 from 1.32 and boost/tuple/tuple.hpp no longer compiles. I am using MS Visual Studio 2003 (7.1). Errors include: "boost-1_33\boost\tuple\detail\tuple_basic.hpp(66) : error C2332: 'class' : missing tag name" when compiling: template <class HT, class TT> struct cons; As I am new to boost, I have no idea how to continue. I am not even using tuple directly - it is included by iterator/indirect_iterator.hpp. Anyone else come across this? Looks like I'll have to switch back to 1.32. Thanks in advance.

2 2

boost libraries under VxWorks
by swoh 15 Sep '05

15 Sep '05

Hello all. I am failing to compile the serialization library (from version 1.0.32) for use with VxWorks 5.4.2 (Tornado 2.2.1). I am restricted to their version of the g++2.96 compiler and matching libraries. I will probably be interested in using other boost libraries in the future (shared pointer at the least). The errors I am getting all have to do with default template parameters, although there may be other problems lurking ahead. Has anyone succeeded in using boost with this combination? Any tips? Thank you ori

3 2

Boost.Iostreams + error handling
by Martin Slater 14 Sep '05

14 Sep '05

Hi there, Are exceptions the only way to propogate an error out of and IOStreams.Device policy? We have a lot of code using this style std::istream is(file); if(is) { .... } and would like not to have to change it all over to use ios exceptions but I can't see a way to avoid it. Is it possible? thanks Martin

2 4

Re: [Boost-users] [filesystem] function to determine available space
by Sohail Somani 14 Sep '05

14 Sep '05

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Delfin Rojas > Sent: Wednesday, September 14, 2005 11:55 AM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] [filesystem] function to determine > available space > > > > > I think the word "status" in space_status is misleading since > > > available/total space is not really a status. > > > > What makes you say that? > > > > Ben. > > > > It is just my interpretation of the word "status": the status > of a patient (stable, critical, etc.), the status of an > electronic device (powered, running, connected, disconnected, etc.). > > If I see a function or structure that is called > filesystem_status I would think it represents one or more > states in which the files system can be, like empty/full or > online/offline. I guess each possible total_size / used_size > combination is a possible filesystem status but still it > doesn't sound good to me. > > At the end of the day it is up to whoever implements the > function to decide, I was just giving my suggestion because I > think it is important programming constructs have a name from > which their usage/meaning can be easily guessed or deduced. Design by committee rocks.

1 0

Re: [Boost-users] [statechart] Can events carry data?
by BRIDGES Dick 14 Sep '05

14 Sep '05

Sorry about the delay - got sidetracked by work. ;) Your clarifications were a great help. Many thanks for the library *AND* the help! Regards, Dick > -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Andreas Huber > Sent: Wednesday, August 31, 2005 2:57 PM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] [statechart] Can events carry data? > > > BRIDGES Dick wrote: > > I'm still not clear on the requirements surrounding such an > > instance. For example, the reference requires that > > <code>new E(*pCE)</code> be well-formed and make "a copy of > > pE". > > Maybe I should have described that differently. That row in the table > translates as follows: > 1. event<> subtypes must have a publicly accessible copy constructor > (compiler-generated or not) > 2. If overloaded, operator new must be publicly accessible > > Since the library only requires the quoted expressions be > well-formed, > it is up to you to define the semantics of the copying. What the > copy-ctor actually does is of no concern to the library. > > > Does the current implementation work ok with > > boost::shared_ptr? > > I assume you mean shared_ptr<> instances as members of > events? I don't > see any problems here. > > > How about auto_ptr? > > That should work if you define a copy-ctor that transfers > ownership to > the copy. > > > If a data member > > would normally require a deep copy, would I be better off > > managing it external to the event object > > I'm not sure I understand the question. I don't see how you > would manage > that data-member externally; you don't mean a global > variable, do you? > Also, are we talking about a single-threaded or an MT system? > > > - or avoiding that > > type of data altogether? How many copies are we talking > > about here? > > Events that the user allocates with new are never copied. > Stack-allocated events are copied exactly once only if they are > deferred. See Step 8 here: > > http://boost-sandbox.sourceforge.net/libs/statechart/doc/refer ence.html#process_event > Any cautions and/or advise regarding the use of data members > in events would be appreciated. The library does not introduce problems that wouldn't exist otherwise. In an ST system everything should "just work" without you spending any thought on copying, other than that a reaction might be working with the original *or* the copy of the event. In an MT system the usual precautions against race-conditions, deadlocks, etc. apply. If it is too costly to deep-copy everything in the event, you must ensure that multiple threads accessing the shared part are appropriately locking mutexes, etc. HTH, -- Andreas Huber When replying by private email, please remove the words spam and trap from the address shown in the header. _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

Re: [Boost-users] Scons users?
by Thore Karlsen 14 Sep '05

14 Sep '05

On Tue, 13 Sep 2005 18:46:08 +0500, Alex Besogonov <cyberax(a)elewise.com> wrote: > >> On the Boost.Build list we were just discussing the fact that some > >> people otherwise inclined towards Boost have chosen Scons over > >> Boost.Build. It would be useful for us to understand some of the > >> reasons why, if some of you wouldn't mind letting us know. No flames, > >> please! >Well, SCons supports distributed building and binary repositories - >that's a MAJOR selling point. And Python is much nicer than jamfiles. > >PS: there's also mxx_ru (http://eao197.narod.ru/mxx_ru/) it's a build >system based on Ruby - it has some interesting features worth attention. >Unfortunately, its documentation is only in Russian, but this should not >be a problem for Vladimir Prus :) Another Python-based build system I like a lot is A-A-P (http://www.a-a-p.org) I haven't played much with SCons, but judging from the SCons documentation, A-A-P is a lot more powerful. I've found A-A-P to be indispensable for my builds, as well as other things like web page publishing. -- Be seeing you.

5 5

locate a vertex by the index
by Giulio Veronesi 14 Sep '05

14 Sep '05

Hi, Excuse me for the very trivial question, but I'm new with boost and I'm looking for help. How I can locate a vertex of a graph by the index of the vertex? Thanks a lot in advance, Giulio

2 1

boost libs dlls
by ned stoyanov 14 Sep '05

14 Sep '05

I am trying to introduce boost to my current company. I was wandering whether using boost requires linking against any libraries or is it all used like the STL simply by including header files. I've used some parts of boost before, which didn't require to link against anything but I want to make sure so I can package it up properly for other ppl to use. Cheers, Ned

2 1

Re: [Boost-users] Scons users?
by Merrill Cornish 14 Sep '05

14 Sep '05

Parveen, Thank you. That's an excellent factual reference. Merrill

1 0

Beyond the C++ Standard Library: An Introduction to Boost
by Bjorn.Karlsson＠readsoft.com 14 Sep '05

14 Sep '05

Dear All, A long time ago, I came here--to the Boost developers and Boost users mailing lists--asking for help with reviewing a book about the Boost libraries. Your response was fantastic. Back then, I concluded my email with saying thanks to all Boosters; for the libraries, the ideas, the research, the discussions, and the enthusiasm. Today, when the book is finally shipping, I'd like to extend that thank you to the Boosters who helped make "Beyond the C++ Standard Library" reality. Beman Dawes, Rob Stewart, David Abrahams, Aleksey Gurtovoy, David Brownell, Douglas Gregor, Duane Murphy, Eric Friedman, Eric Niebler, Fernando Cacciola, Frank Griswold, Jaakko Järvi, James Curran, Jeremy Siek, John Maddock, Kevlin Henney, Michiel Salters, Paul Grenyer, Peter Dimov, Phil Boyd, Ronald Garcia, Thorsten Ottosen, Tommy Svensson, and Vladimir Prus; thank you all so much! I sincerely hope that I am giving something back to the amazing Boost community through this book. Best regards, Björn Karlsson

1 0

Re: [Boost-users] Scons users?
by Sohail Somani 13 Sep '05

13 Sep '05

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Foster Gareth > Sent: Tuesday, September 13, 2005 10:47 AM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Scons users? > > > I suppose in terms of scons and boost, then next question is > how easy is it > to build rpm/deb packages etc when using these build systems? > Its very easy > with autotooled projects. I think this is an area where scons is lacking. Its great in building, but not so good at deployment.

1 0

Putting together boost::any, mpl::vector, iterator::filter_iterator
by Stephen Gross 13 Sep '05

13 Sep '05

I've put together a class called 'AnyVector' for doing type-based iteration on a vector. The basic idea is that AnyVector wraps a std::vector<boost::any>. The AnyVector lets you iterate across a subset of the underlying vector by using filter_iterators. The filter iterators, in turn, dereference to the requested type for ease of use. For instance, you can do the following: === CODE === AnyVector<> a; a.push_back(1); a.push_back(std::string("hello")); a.push_back(2); a.push_back(std::string("goodbye")); for(AnyVector<>::Iterator<int> i = a.begin<int>(); i != a.end<int>(); ++i) std::cout << (*i + 5); for(AnyVector<>::Iterator<std::string> i = a.begin<std::string>(); i != a.end<std::string>(); ++i) std::cout << i->length(); ============ Furthermore, you can restrict (at compile-time) which objects are allowed to be inserted into the AnyVector. This is done by listing those types when you create your AnyVector: === CODE ==== AnyVector<int, std::string> a; // Only allows int's and string's a.push_back(3.5); // Fails at compile time - double's not allowed! ============= Would this be a useful addition to boost, or does it already exist somewhere in boost and I just missed it? --Steve Stephen Gross Case Western School of Medicine Cleveland, OH "By Grabthar's hammer, by the sons of Worvan, you shall be avenged." - Dr. Lazarus

1 0

Filter_iterator and boost::any follow-up
by Stephen Gross 13 Sep '05

13 Sep '05

>I think you'll need to use something like: >for(filter_itr f(i.begin(), i.end()); f != filter_itr(i.end()); ++f) Ok, cool, I've got it working on a vector of ints. My next question is this: I've got a vector of boost::any's, and I want to iterate across only the boost::any's representing int's. For example: === CODE === template<typename T> struct isT { bool operator() (const boost::any & a) const { return a.type() == typeid(T); } }; int main() { std::vector<boost::any> av; av.push_back(1); av.push_back(std::string("hello")); av.push_back(2); typedef boost::filter_iterator<isT<int>, std::vector<boost::any>::iterator > int_itr; for(int_itr itr(av.begin()); itr != int_itr(av.end()); ++itr) ; } ========= Unfortunately, the above code seg faults when executed. I imagine I've probably constructed my filter_iterator incorrectly somehow. Any ideas? Thanks, --Steve Stephen Gross Case Western School of Medicine Cleveland, OH "By Grabthar's hammer, by the sons of Worvan, you shall be avenged." - Dr. Lazarus

2 1

Newbie question on filter_iterators
by Stephen Gross 13 Sep '05

13 Sep '05

Ok, I'm trying to learn the basics of filter_iterators. I've got a vector of ints. I want to iterate across the vector and print out every positive value in the vector. Currently, my code doesn't work because g++ doesn't like me assigning a vector::iterator to a filtered_iterator. Obviously, I've missed some crucial point on how the filtered_iterator is supposed to work. The example code in the boost library doesn't really address this specific use. Can someone show me how to make the code below work as intended? Thanks in advance, --Steve ==== CODE FOLLOWS ==== struct is_positive { bool operator() (int i) { return i >= 0; } }; int main() { std::vector<int> i; i.push_back(-5); i.push_back( 5); i.push_back(-4); i.push_back( 4); i.push_back(-3); i.push_back( 3); i.push_back(-2); i.push_back( 1); typedef boost::filter_iterator<is_positive, std::vector<int>::iterator> filter_itr; for(filter_itr f = i.begin(); f != i.end(); ++f) { std::cout << *f << std::endl; } return 0; }

4 3

Re: [Boost-users] Scons users?
by Foster Gareth 13 Sep '05

13 Sep '05

I suppose in terms of scons and boost, then next question is how easy is it to build rpm/deb packages etc when using these build systems? Its very easy with autotooled projects. Don't get me wrong, I hate autotools, hence my interest in alternatives. Hopefully these comments aren't dragging us off topic here - these could be reasons to use Scons over Boost Build I suppose - depends on the answers really. Cheers, Gaz > -----Original Message----- > From: Sohail Somani [mailto:s.somani@fincad.com] > Sent: 13 September 2005 18:19 > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Scons users? > > > -----Original Message----- > > From: boost-users-bounces(a)lists.boost.org > > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > > Foster Gareth > > Sent: Tuesday, September 13, 2005 9:37 AM > > To: boost-users(a)lists.boost.org > > Subject: Re: [Boost-users] Scons users? > > > > > > How does scons fair in terms of pulling in other libraries? I > > have used Autotools and using anything from there that > > doesn't have pkg-config support (like boost, opengl etc) is a > > nightmare. > > I believe scons can parse pkg-config output out of the box and set up > your CFLAGs etc appropriately but my mileage with this has varied > immensly. Anyway, its very simple to do it yourself as you have a real > programming language available. > > I think scons could learn a bit from autotools though I guess > autotools > is only useful because its popular. > > Sohail > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users >

1 0

Re: [Boost-users] Scons users?
by Sohail Somani 13 Sep '05

13 Sep '05

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Foster Gareth > Sent: Tuesday, September 13, 2005 9:37 AM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Scons users? > > > How does scons fair in terms of pulling in other libraries? I > have used Autotools and using anything from there that > doesn't have pkg-config support (like boost, opengl etc) is a > nightmare. I believe scons can parse pkg-config output out of the box and set up your CFLAGs etc appropriately but my mileage with this has varied immensly. Anyway, its very simple to do it yourself as you have a real programming language available. I think scons could learn a bit from autotools though I guess autotools is only useful because its popular. Sohail

1 0

Re: [Boost-users] [BULK] Re: [BULK] [filesystem] function todetermineavailable space
by Sohail Somani 13 Sep '05

13 Sep '05

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of me22 > Sent: Monday, September 12, 2005 4:36 PM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] [BULK] Re: [BULK] [filesystem] > function todetermineavailable space > > > On 12/09/05, Sohail Somani <s.somani(a)fincad.com> wrote: > > What about using a type that guarantees a certain amount instead of > > just "max" (which may vary)? Or equivalently, are we > guaranteed that > > uintmax_t can hold, say one TB, on any platform that boost supports? > > > > Even 1 TB isn't really safe. I know a number of people with > more total storage than that. > > How about a double? The imprecision shouldn't be a worry -- > if you're beyond the range of a double's precision for free > space then being off by even a few MB it doesn't matter and > doubles are perfectly precise for small integral numbers. ( > on x86 linux it seems my 64-bit doubles have 53 bits of > mantissa meaning they're perfectly precise for anything less > than 8192 TeraBytes. I don't know what the standard specifes > though, and my 32-bit floats are only perfectly precise for > under 16 MB. That being said, even the 32-bit float has a > max of over 3e26 TB, so just saying the precision of the > number returned is dependant on the precision of your > platform's double would get around that, assuming of course > we can assure that any rounding is done on the safe side. ) > > Also, the implementation could work internally in whatever it > wants to keep perfect precision and just feed out a double at the end. Great idea. I'm ok with this. What about platforms like linux or windows? What types do they use to report these stats?

3 2

Re: [Boost-users] Scons users?
by Foster Gareth 13 Sep '05

13 Sep '05

How does scons fair in terms of pulling in other libraries? I have used Autotools and using anything from there that doesn't have pkg-config support (like boost, opengl etc) is a nightmare. > -----Original Message----- > From: Jon Stewart [mailto:stew1@ellipsis.cx] > Sent: 13 September 2005 17:30 > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Scons users? > > > On the Boost.Build list we were just discussing the fact that some > > people otherwise inclined towards Boost have chosen Scons over > > Boost.Build. It would be useful for us to understand some of the > > reasons why, if some of you wouldn't mind letting us know. > No flames, > > please! > > > I have been using Scons more for tiny projects* than for > large ones, and I > am still somewhat ignorant about Boost.Build, so I can't give a fair > comparison. But people aren't fair, so I think the data > points are still > valid: > > 1. Scons is a nice framework embedded in a general purpose > programming language. So, you get the benefit of a DSL that > does 80% of > the job very nicely, but you've got all that is Python for > the 20% that > doesn't fit -- and the two parts integrate naturally. I moved > from Ant to > Scons and liked that Scons provided lots of high-level > functionality but > didn't straightjacket me into abstractions that didn't fit my > situation. > > 2. My standard SConstruct file is 4 lines (2 imports, 2 > statements). I get > a full dependency analysis, can make full use of ccache and > distcc, and > run my unit tests after the build. I can't imagine life being > better. :-) > > 3. Boost.Build started out life as a fork (right?), and I > haven't noticed > many other projects outside of Boost using it. Scons seems to > have more > "momentum". > > 4. Boost.Build docs don't/didn't offer the trivial example of how > to get "Hello, World" to build. Compare: > > http://www.boost.org/tools/build/v1/build_system.htm#getting_started > > with: > > http://www.scons.org/doc/HTML/scons-user.html#AEN239 > > 5. A fair amount of traffic on this list seems to be from > people who have > trouble with Boost.Build. Of course, I'm not subscribed to > the scons users > list so this isn't fair, but my perception was that > Boost.Build would have > a steeper learning curve. > > I'm sure Boost.Build is a powerful system and can do the > job... it just > seemed to require more thought to get running the first time, > and I wanted > to devote my thought to writing code. > > Hope this helps, > > > Jon > > * The majority of my tiny projects are stub programs to play > around with > all the other Boost libraries! :-) > -- > Jon Stewart > stew1(a)ellipsis.cx > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users >

1 0

[Boost.Program_options] some trouble w/ multitoken()?
by Marc VIALA 13 Sep '05

13 Sep '05

I'm just trying to use Boost.Program_options in an application and during my implementation, it appears a couple of questions: - Is it possible to introduce more than one "multitoken" options in command line? I didn't see any limitation in the documentation but my sample hereafter seems to prove that yes. - If the answer to the first question is yes, then how I can handle this feature? I seemed that with the older version, 1.32, this feature was supported? Thanks in advance. Best regards, Marc VIALA -------------------------------------------------------------- Test Configuration: -------------------------------------------------------------- PC / WinXP SP2 Visual C++ 7.1 Boost 1.33 -------------------------------------------------------------- Code Example: -------------------------------------------------------------- // How to use multitoken options in command line? #include <vector> #include <iostream> #include <iterator> #include <boost/program_options.hpp> #include <boost/lambda/lambda.hpp> using namespace boost ; using namespace boost::lambda ; namespace po = boost::program_options ; using namespace std ; int main(int argc, char* argv[] ) { string rootDir ; vector<string> inputList, outputList ; // Options declaration po::options_description generic("Generic options") ; generic.add_options() ("help" , "produce a help message" ) ("version" , "output the version number") ; po::options_description mandatory("Mandatory options"); mandatory.add_options() ("root,r" , po::value<string>(&rootDir) , "set project root catalog" ) ("acq,a" , po::value<vector<string> >(&inputList)->multitoken() , "set list of acquisition catalog#") ("measure,m", po::value<vector<string> >(&outputList)->multitoken() , "set list of measurement catalog#") ; // Group mandatory & generic options po::options_description cmdLineOpt("Allowed options") ; cmdLineOpt.add(generic).add(mandatory) ; // Simulate command line sample vector<string> args = po::split_winmain("-r Test --acq 11 tt 13 --measure 20 21 23"); // Parse command line po::variables_map vm ; po::store(po::command_line_parser(args).options(cmdLineOpt).run(), vm); po::notify(vm) ; // Display options & args in command lines cout << "root args : \n" ; if( vm.count("root") ) cout << '\t' << vm["root"].as<string>() << '\n' ; cout << "acq args : \n" ; if( vm.count("acq") ) { const vector<string>& vs = vm["acq"].as<vector<string> >() ; for_each(vs.begin(), vs.end(), cout << constant('\t') << _1 << constant('\n')) ; } cout << "measure args: \n" ; if( vm.count("measure") ) { const vector<string>& vs = vm["measure"].as<vector<string> >() ; for_each(vs.begin(), vs.end(), cout << constant('\t') << _1 << constant('\n')) ; } return 0 ; } -------------------------------------------------------------- -------------------------------------------------------------- Output results: -------------------------------------------------------------- root args : Test acq args : 11 tt 13 --measure (it seems to insert also option item w/ its args?) 20 21 23 measure args:

1 0

random numbers
by Anakreon 13 Sep '05

13 Sep '05

I am considering to use boost.random library but have a problem with efficiency. I have a class which provides two public methods: double exponential(double mean) and double getUniform(double min, double max) The implementation I have using boost.random is inefficient and I need some advice in order to improve it. In both the above methods I create a variate_generator object with a mersenne_twister generator and the appropriate distribution. The problem is that the methods are called often which leads to creation and destruction of the variate_generator and the distribution object. I can not store those objects as member variables because the parameters mean in exponential and (min, max) in getUniform varies Thanks in advanced Anakreon

1 0

Re: [Boost-users] [BULK] Re: [BULK] [filesystem] function to determineavailable space
by Sohail Somani 12 Sep '05

12 Sep '05

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Beman Dawes > Sent: Monday, September 12, 2005 2:20 PM > To: boost-users(a)lists.boost.org > Subject: [BULK] Re: [Boost-users] [BULK] [filesystem] > function to determineavailable space > Importance: Low > > "Sohail Somani" <s.somani(a)fincad.com> wrote in message > news:1C1EBEF8DBACDC439D038EA051674EC709C5D4@xbox.financialcad.com... > >> -----Original Message----- > >> From: boost-users-bounces(a)lists.boost.org > >> [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Beman Dawes > >> Sent: Monday, September 12, 2005 10:23 AM > >> To: boost-users(a)lists.boost.org > >> Subject: [BULK] [Boost-users] [filesystem] function to determine > >> available space > >> Importance: Low > >> > >> > >> I'm planning to add a filesystem function to determine > available disk > >> space. Perhaps something like: > >> > >> struct space_status > >> { > >> boost::uintmax_t available; // free space available to user > >> boost::uintmax_t total; // total space on volume > >> }; > >> > >> space_status filesystem_space( const path & p ); > >> > >> Comments? > > > > Standard unit of measure? Bytes? Megabytes? Gigabytes? > > Bytes. Individual bytes still matter in some applications. What about using a type that guarantees a certain amount instead of just "max" (which may vary)? Or equivalently, are we guaranteed that uintmax_t can hold, say one TB, on any platform that boost supports?

2 1

Re: [Boost-users] [BULK] [filesystem] function to determine available space
by Sohail Somani 12 Sep '05

12 Sep '05

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Beman Dawes > Sent: Monday, September 12, 2005 10:23 AM > To: boost-users(a)lists.boost.org > Subject: [BULK] [Boost-users] [filesystem] function to > determine available space > Importance: Low > > > I'm planning to add a filesystem function to determine > available disk space. > Perhaps something like: > > struct space_status > { > boost::uintmax_t available; // free space available to user > boost::uintmax_t total; // total space on volume > }; > > space_status filesystem_space( const path & p ); > > Comments? Standard unit of measure? Bytes? Megabytes? Gigabytes?

2 1

[wave] Some bugs (posted here, 'coz SF bug-tracking is currently down)
by Mihalicza, Jozsef 12 Sep '05

12 Sep '05

Hello, I've built a spirit grammer to process the token sequence of wave. 1. Scope missing in macros. The first problem arose when I tried to write the wave token equivalent of chlit: struct token_lit : public boost::spirit::char_parser<token_lit> { token_lit(boost::wave::token_id id_) : id(id_) {} template <typename T> bool test(T id_) const { return BASE_TOKEN(id_) == BASE_TOKEN(id); } boost::wave::token_id id; }; The code above doesn't compile, because BASE_TOKEN uses constants from boost::wave without explicit scope. Lines to fix: token_ids.hpp(37-40,305,309). 2. Newline token reports bad position. For debug purposes I reported the match positions in the grammer actions using the file_position interface of the wave token type. The results were quite strange, sometimes pointing into the middle of a keyword, so I decided to take a smaller step and modified the wave example (the one in the documentation) just to see what happens, as follows: while (first != last) { std::cout << "value: \"" << (*first).get_value() << "\" pos: " << (*first).get_position ().get_file () << "(" << (*first).get_position ().get_line () << ") @" << (*first).get_position ().get_column () << std::endl; ++first; } Attached you can find some very small inputs and their corresponding outputs. 2.1. A file containing only whites and comments produced no tokens at all 2.2. Position of the enter token reports the new line number but the old column 2.3. The #line directive affects the position in a very strange way Please clarify if some of these are not errors. Oops, I almost forgot, I am using a fresh verison from the CVS repository already containing the fix for the SF bug #1274584. Best regards, József Mihalicza

2 2

Re: [Boost-users] Some thoughts on Unary / BinaryFunctionConcept limitations
by Stephen Gross 12 Sep '05

12 Sep '05

> (1) The implementation of Unary and Binary (FunctionConcepts) > assume that > the return type is assignable ("r = f(arg)" tries to assign a value > to r). > But what if the return type is a reference? Won't the function > concept fail > to compile? Is this a bug? >That looks like a bug. >Here's a challenge for you: how would you fix this bug? In my own functor concept implementation, I used the function-pointer trick to make it work: ==== CODE ==== template<typename Func, typename Ret, typename Arg> struct special_UnaryFunctionConcept { void constraints() { Ret (Func::*x) (Arg) = Func::operator(); } }; ============== > (2) I'm implementing an NaryFunctionConcept for functors taking > more than 2 > arguments. The BOOST_CLASS_REQUIREx macro, however, appears to be > limited to > 4 types. This limits the NaryFunctionConcept to functors with up to > two > arguments. Is there a way to expand the BOOST_CLASS_REQUIREx macro > to handle > more than 4 types? >I'm sure there is a way. Can you think of a way to do it? Perhaps the >boost preprocessor library would help. Well, I was thinking that it BOOST_CLASS_REQUIREx for x > 4 could be added to the concept_check library in the same way that it is for x <= 4. Is this possible? > (3) I ran into a compiler problem when using BOOST_CLASS_REQUIREx; > when any > of the type macros have spaces or non-alphanumeric characters in > them, the > compiler reports an error. In the following example, I try to use > the macro > to require a UnaryFunctor taking a const std::string & and > returning an int. >Yes, you need to create a typedef for such types. This restriction >should be documented. I've checked in a fix to the docs. Ok, gotcha. Interesting... Thanks, --Steve

1 0

Some thoughts on Unary / BinaryFunctionConcept limitations
by Stephen Gross 12 Sep '05

12 Sep '05

I'm just now learning about the concept_check library and how Unary and BinaryFunctionConcepts work in it. I have a few questions: (1) The implementation of Unary and Binary (FunctionConcepts) assume that the return type is assignable ("r = f(arg)" tries to assign a value to r). But what if the return type is a reference? Won't the function concept fail to compile? Is this a bug? (2) I'm implementing an NaryFunctionConcept for functors taking more than 2 arguments. The BOOST_CLASS_REQUIREx macro, however, appears to be limited to 4 types. This limits the NaryFunctionConcept to functors with up to two arguments. Is there a way to expand the BOOST_CLASS_REQUIREx macro to handle more than 4 types? (3) I ran into a compiler problem when using BOOST_CLASS_REQUIREx; when any of the type macros have spaces or non-alphanumeric characters in them, the compiler reports an error. In the following example, I try to use the macro to require a UnaryFunctor taking a const std::string & and returning an int. The code, however, fails to compile. Here's the code and error log: === CODE === template<typename T> class foo { BOOST_CLASS_REQUIRE3(T, int, const std::string &, boost, UnaryFunctionConcept); }; ============ Produces the following error (from g++): ==== ERROR LOG ==== test.cpp:42: error: parse error before `::' token test.cpp:42:80: pasting "&" and "UnaryFunctionConcept" does not give a valid preprocessing token test.cpp:42: error: parse error before `std' test.cpp:42:80: pasting "&" and "UnaryFunctionConcept" does not give a valid preprocessing token test.cpp:42:80: pasting "&" and "UnaryFunctionConcept" does not give a valid preprocessing token test.cpp:42: error: missing ';' before right brace test.cpp:42: confused by earlier errors, bailing out =================== Is this a bug? Thanks in advance for your thoughts, --Steve Stephen Gross Case Western School of Medicine Cleveland, OH "By Grabthar's hammer, by the sons of Worvan, you shall be avenged." - Dr. Lazarus

2 1

Looking for example of BOOST_CLASS_REQUIREx
by Stephen Gross 12 Sep '05

12 Sep '05

I'm trying to find an example of how to invoke the BOOST_CLASS_REQUIREx macro (from the concept_check library). Can anyone point me in the right direction? Thanks, --Steve Stephen Gross Case Western School of Medicine Cleveland, OH "By Grabthar's hammer, by the sons of Worvan, you shall be avenged." - Dr. Lazarus

2 1

Inheriting matrix_array
by Edward Grace 12 Sep '05

12 Sep '05

Dear all, I am evaluating aspects of the boost library. I wish to generate a simple implementation of ray transfer (ABCD) matricies, http://en.wikipedia.org/wiki/ABCD_matrix Since these matricies are 2x2 and will need multiplication, trace and other similar matrix like operations it makes sense to use: matrix_array<double,2> or boost::numeric::ublas::matrix_scalar<double> I wish to generate a ray transfer matrix class by overloading (say) matrix_array<double,2> and adding member functions such as: class rtm : boost::multi_array<double,2> { public: void setA(double val) { boost::multi_array<double,2>::operator()(0,0) = val; } }; Now, this is wrong... Essentially I just want to know something very simple.... When I inherit multi_array or any other class that I want to use the [] or (x,x) notation to access elements (subscript operators) how on earth do I do it? Your help will be greatly appreciated, this is driving me crazy! -ed

1 0

scalar_matrix or containers and different contained types...
by Edward Grace 12 Sep '05

12 Sep '05

Dear All, Is there specifically a way I can do the following? boost::numeric::ublas::scalar_matrix<double> mD(3,3); boost::numeric::ublas::scalar_matrix<complex<double> > mC(3,3); mC = mD; Since I can do, complex<double> a; double b; a = b; without any problem why can the same thing be done with the container? Perhaps this is a more general point with C++ containers. If I can carry out a type conversion on the contained object (e.g. double -> complex<double> assuming the double is real) is there a way I can make sure the same carries through for casting of the contained objects? -ed -- Dr. Edward Grace Photonics Group, Physics Department Blackett Laboratory Imperial College SW7 2BW t: 020 759 47719 e: ej.grace(a)imperial.ac.uk w: http://ptweb.op.ph.ic.ac.uk/~graceej

1 0

Serialization of template classes via base
by Bruno Martínez 12 Sep '05

12 Sep '05

Hi. This has been asked before here http://lists.boost.org/boost-users/2005/05/11706.php but I didn't understand the workaround. What I want is to serialize class B where class A { ... }; template<...> class B : public A { ... }; when I have an A*. The workarounds proposed were using RTTI non portably, or registering the classes each time. How would such solution look like? Regards, Bruno

3 8

Boost post on codetools
by gast128 11 Sep '05

11 Sep '05

I have posted two articles ('File rename using boost regex and boost file system' and 'Building boost libraries for Visual Studio')on www.codetools.com on Boost issues. In this way I hope to promote Boost use in a community which is more geared towards MFC use. Wkr, me

1 0

boost-1.33, [date_time]: missing std::localtime_r/gmtime_r
by Michael Haubenwallner 11 Sep '05

11 Sep '05

Hi, There's a problem on HP-UX (especially hppa2.0w-hp-hpux11.11) with gcc-3.3.6, where localtime_r and gmtime_r are not in namespace std. boost-1.33 itself is built with "<cxxflags>-pthread/<linkflags>-pthread" $ cat xx.cc #include <boost/date_time/posix_time/posix_time_system.hpp> $ g++ -pthread xx.cc In file included from /tools/snapshot/toolsbox-3.5.0.16rc.20050904/HP-UX/boost/include/boost/date_time/date_clock_device.hpp:12, from /tools/snapshot/toolsbox-3.5.0.16rc.20050904/HP-UX/boost/include/boost/date_time/gregorian/gregorian_types.hpp:26, from /tools/snapshot/toolsbox-3.5.0.16rc.20050904/HP-UX/boost/include/boost/date_time/posix_time/posix_time_config.hpp:14, from /tools/snapshot/toolsbox-3.5.0.16rc.20050904/HP-UX/boost/include/boost/date_time/posix_time/posix_time_system.hpp:13, from xx.cc:1: /tools/snapshot/toolsbox-3.5.0.16rc.20050904/HP-UX/boost/include/boost/date_time/c_time.hpp: In static member function `static tm* boost::date_time::c_time::localtime(const time_t*, tm*)': /tools/snapshot/toolsbox-3.5.0.16rc.20050904/HP-UX/boost/include/boost/date_time/c_time.hpp:56: error: ` localtime_r' undeclared in namespace `std' /tools/snapshot/toolsbox-3.5.0.16rc.20050904/HP-UX/boost/include/boost/date_time/c_time.hpp: In static member function `static tm* boost::date_time::c_time::gmtime(const time_t*, tm*)': /tools/snapshot/toolsbox-3.5.0.16rc.20050904/HP-UX/boost/include/boost/date_time/c_time.hpp:64: error: ` gmtime_r' undeclared in namespace `std' $ $ gcc -v Reading specs from /mnt/toolsjunk/snapshot/toolsbox-3.5.0.16rc.20050904/HP-UX/lib/gcc-lib/hppa2.0w-hp-hpux11.11/3.3.6/specs Configured with: /mnt/toolsjunk/snapshot/src/sasrvb/toolsbox-3.5.0.16rc.20050904/buildroot/gcc/gcc-3.3.6/configure --with-gnu-as --with-as=/tools/snapshot/toolsbox-3.5.0.16rc.20050904/HP-UX/hppa2.0w-hp-hpux11.11/bin/as --without-gnu-ld --with-ld=/usr/ccs/bin/ld --enable-threads=posix --with-local-prefix=/tools/snapshot/toolsbox-3.5.0.16rc.20050904/HP-UX --disable-nls --prefix=/tools/snapshot/toolsbox-3.5.0.16rc.20050904/HP-UX Thread model: posix gcc version 3.3.6 Two maybe interesting notes: 1) /usr/include/time.h only declares localtime_r/gmtime_r if '-pthread' compiler-flag is used (and therefore _REENTRANT is defined). 2) gcc-shipped <ctime> does not pull localtime_r/gmtime_r into namespace std Thanks! ~haubi -- Michael Haubenwallner SALOMON Automation GmbH Forschung & Entwicklung A-8114 Friesach bei Graz mailto:michael.haubenwallner@salomon.at http://www.salomon.at No HTML/MIME please, see http://expita.com/nomime.html

3 3

Re: [Boost-users] [preprocessor] break "names"
by Mihalicza, Jozsef 10 Sep '05

10 Sep '05

Hi, Not a naive question, check this: http://lists.boost.org/Archives/boost/2005/03/83253.php Regards, József Mihalicza ________________________________ Feladó: boost-users-bounces(a)lists.boost.org meghatalmazó: Felipe Magno de Almeida Hi, Maybe it is a naive question, but I've been researching a little and couldnt find an answer to this(not an affirmative and nor negative): Is it possible to have such usages: SOME_MACRO(hello world) or SOME_MACRO("hello world") (or something that doesnt have much "characters overhead", like using space for every character) and have the expansion result in this: h e l l o w o r l d or even better: 'h','e','l','l','o', ' ', 'w', 'o', 'r', 'l', 'd' Well, what I'm trying to find is if it is possible to give something to a macro and the macro create an vector_c with all the characters inside it. Like: SOME_MACRO(Hello World) and expand to: boost::mpl::vector<char, 'H','e','l','l','o',' ','W','o','r','l','d'> Thanks in advance, -- Felipe Magno de Almeida Developer from synergy and Computer Science student from State University of Campinas(UNICAMP). Unicamp: http://www.ic.unicamp.br Synergy: http://www.synergy.com.br "There is no dark side of the moon really. Matter of fact it's all dark." _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

3 2

Serialization segfaulting
by Dmitriy Morozov 10 Sep '05

10 Sep '05

Hi, I'm having problems with boost serialization library. There are two cases in which it is segfaulting on me. One is during a register_type() call, but we can discuss that one later. Another one which I am trying to debug right now is when I am trying to serialize a large binary tree (lots of pointers all over the place, sometimes pointing at themselves, sometimes at 0, sometimes jumping all over the tree). I am not quite sure how to approach the debugging of this issue since for some reason I am not able to step into the boost serialization routines themselves (but I'm not so good with the debugger). The actual segfault as given by DDD is: Program received signal SIGSEGV, Segmentation fault. 0x40075b75 in std::_Rb_tree<boost::archive::detail::basic_oarchive_impl::cobject_type, boost::archive::detail::basic_oarchive_impl::cobject_type, std::_Identity<boost::archive::detail::basic_oarchive_impl::cobject_type>, std::less<boost::archive::detail::basic_oarchive_impl::cobject_type>, std::allocator<boost::archive::detail::basic_oarchive_impl::cobject_type> >::insert_unique(boost::archive::detail::basic_oarchive_impl::cobject_type const&) () from /usr/lib/libboost_serialization.so.1.33.0 Any advice is appreciated. Best, Dmitriy P.S. On a completely unrelated note, when the abstract base class is a template, the BOOST_IS_ABSTRACT macro is not applicable. It would be helpful if the documentation listed the chunk of code that needs to be added in that case. It's pretty easy to find it in the header files (is_abstract.hpp), but it may be helpful to just list it.

2 3

[preprocessor] break "names"
by Felipe Magno de Almeida 10 Sep '05

10 Sep '05

Hi, Maybe it is a naive question, but I've been researching a little and couldnt find an answer to this(not an affirmative and nor negative): Is it possible to have such usages: SOME_MACRO(hello world) or SOME_MACRO("hello world") (or something that doesnt have much "characters overhead", like using space for every character) and have the expansion result in this: h e l l o w o r l d or even better: 'h','e','l','l','o', ' ', 'w', 'o', 'r', 'l', 'd' Well, what I'm trying to find is if it is possible to give something to a macro and the macro create an vector_c with all the characters inside it. Like: SOME_MACRO(Hello World) and expand to: boost::mpl::vector<char, 'H','e','l','l','o',' ','W','o','r','l','d'> Thanks in advance, -- Felipe Magno de Almeida Developer from synergy and Computer Science student from State University of Campinas(UNICAMP). Unicamp: http://www.ic.unicamp.br Synergy: http://www.synergy.com.br "There is no dark side of the moon really. Matter of fact it's all dark."

1 0

boost-1.33 [date_time] simple_format template: missing default for <charT>
by Michael Haubenwallner 10 Sep '05

10 Sep '05

Hi, is there any reason besides being a bug why the formatters found in boost/date_time/date_formatting.hpp have a default value 'char' for template argument 'charT', but boost::date_time::simple_format does not ? Thanks, haubi -- Michael Haubenwallner SALOMON Automation GmbH Forschung & Entwicklung A-8114 Friesach bei Graz mailto:michael.haubenwallner@salomon.at http://www.salomon.at No HTML/MIME please, see http://expita.com/nomime.html

1 0

Re: [Boost-users] Thread events
by Christopher Hunt 10 Sep '05

10 Sep '05

On 10/09/2005, at 2:12 AM, boost-users-request(a)lists.boost.org wrote: >> Thanks for your replies. >> >> To me boost::condition looks very much like the old event >> variable, except >> that it works together with a mutex. I am now wondering why you >> should >> lock >> a mutex before waiting for the condition? Is there a rationale >> about this? > Also note that the wait() on the condition unlocks the mutex until you > return from the wait call. That's not always obvious from the > examples. Someone else mentioned the Butenhof book so I won't go down that path; suffice to state that anyone that wants to do any thread programming absolutely must read that book. In fact, the book really is more about thread paradigms than pthreads. IMHO pthreads are more of a case study in the book. A quick example to fill in the time between you ordering the book and receiving it might help. Suppose you have a mutex for the purpose of protecting a variable. Suppose you must also wait on a condition because that variable isn't in a state that you need to progress. If you keep the mutex locked while waiting on a condition then no other thread will get the opportunity to modify the variable's value. To solve this many programmers will just unlock the mutex prior to waiting on the condition. However, the problem with this approach is that in the time between the mutex being unlocked, and the condition is waited on, another thread can come along, lock the mutex and change the variable. Thus you might be waiting on a condition that never occurs. Remember that conditions are generally signaled only to threads currently waiting on them or to the 1st thread that comes along and waits on a condition. Thus, if you're not waiting on a condition, you may never receive its signal. You may think that the chances of another thread coming along and upsetting your world are slim, but one day, it will happen and you'll be wanting to ignore that bug in your app 'cause it'll be hard to reproduce. pthread conditions are associated with mutexes so that they guarantee to unlock a mutex and wait on a condition without the chance of another thread coming along and doing what is described above. From an implementation perspective, I imagine pthread conditions enter into a critical section while they unlock a mutex and move to a wait state. As stated before, when you return from the condition, the mutex will be locked again, and you should re-test for your condition. Something like the following logic may help: ***** lock mutex while var not in state you need to proceed { wait on condition associated with mutex } unlock mutex do your stuff. ***** Note that it is also healthy to unlock your mutexes asap so as to reduce contention. 'hope that this helps. Cheers, -C

1 0

Problem with BGL copy_graph algorithm - HELP
by Tony Cook 09 Sep '05

09 Sep '05

Hello, Can anyone tell me if I've exposed a bug in the Boost Graph Library or if the following behaviour is expected and I need to code the solution in a different way, and if so HOW? In summary the boost::copy_graph algorithm fails to compile when defining the graph using std::vector for the edge container and std::list for the vertex container (Visual Studio 7.1, Boost 1.32.0). Other graph type definitions work. (NB I can't use the "working" graph types in my main application as VC 7.1 bombs with an Internal Compiler Error. I'm forced to use a vecS,lists graph just to work round the ICE problem!!). I've distilled the problem down to the minimum code possible. ------------------------------------------------- // A vecS, vecS based graph works typedef boost::adjacency_list <boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::no_property, boost::no_property> GoodGraphType ; GoodGraphType good_graph_1 ; GoodGraphType good_graph_2 ; boost::copy_graph (good_graph_1, good_graph_2) ; // Compiles OK ------------------------------------------------- // A listS, vecS based graph also works typedef boost::adjacency_list <boost::listS, boost::vecS, boost::undirectedS, boost::no_property, boost::no_property, boost::no_property> AnotherGoodGraphType ; AnotherGoodGraphType another_good_graph_1 ; AnotherGoodGraphType another_good_graph_2 ; boost::copy_graph (another_good_graph_1, another_good_graph_2) ; // Compiles OK ------------------------------------------------- // A vecS, lists based graph fails to compile - BGL error or expected?? typedef boost::adjacency_list <boost::vecS, boost::listS, // root cause of compilation failure boost::undirectedS, boost::no_property, boost::no_property, boost::no_property> BadGraphType ; BadGraphType bad_graph_1 ; BadGraphType bad_graph_2 ; boost::copy_graph (bad_graph_1, bad_graph_2) ; // ***** Does not compile ****** ------------------------------------------------------- Here is the exact wording of the VC7.1 compiler output. ------------------------------------------------------- ..\boost_1_32_0\boost\property_map.hpp(349) : error C2678: binary '+' : no operator found which takes a left-hand operand of type 'const std::vector<_Ty>::iterator' (or there is no acceptable conversion) with [ _Ty=boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS,boost::vec S,boost::undirectedS,boost::no_property,boost::no_property,boost::no_propert y>,boost::vecS,boost::vecS,boost::undirectedS,boost::detail::retag_property_ list<boost::vertex_bundle_t,boost::no_property>::type,boost::detail::retag_p roperty_list<boost::edge_bundle_t,boost::no_property>::type,boost::no_proper ty,boost::listS>::config::vertex_ptr ] ...\boost_1_32_0\boost\property_map.hpp(349) : while compiling class-template member function 'void boost::iterator_property_map<RandomAccessIterator,IndexMap,T,R>::operator [](boost::iterator_property_map<RandomAccessIterator,IndexMap,T,R>::key_type ) const' with [ RandomAccessIterator=std::vector<boost::detail::adj_list_gen<boost::adjacenc y_list<boost::vecS,boost::vecS,boost::undirectedS,boost::no_property,boost:: no_property,boost::no_property>,boost::vecS,boost::vecS,boost::undirectedS,b oost::detail::retag_property_list<boost::vertex_bundle_t,boost::no_property> ::type,boost::detail::retag_property_list<boost::edge_bundle_t,boost::no_pro perty>::type,boost::no_property,boost::listS>::config::vertex_ptr >::iterator, IndexMap=boost::property_map<boost::adjacency_list<boost::vecS,boost::listS, boost::undirectedS,boost::no_property,boost::no_property,boost::no_property> ,boost::vertex_index_t>::const_type, T=std::allocator<boost::detail::adj_list_gen<boost::adjacency_list<boost::ve cS,boost::vecS,boost::undirectedS,boost::no_property,boost::no_property,boos t::no_property>,boost::vecS,boost::vecS,boost::undirectedS,boost::detail::re tag_property_list<boost::vertex_bundle_t,boost::no_property>::type,boost::de tail::retag_property_list<boost::edge_bundle_t,boost::no_property>::type,boo st::no_property,boost::listS>::config::vertex_ptr >::value_type, R=std::allocator<boost::detail::adj_list_gen<boost::adjacency_list<boost::ve cS,boost::vecS,boost::undirectedS,boost::no_property,boost::no_property,boos t::no_property>,boost::vecS,boost::vecS,boost::undirectedS,boost::detail::re tag_property_list<boost::vertex_bundle_t,boost::no_property>::type,boost::de tail::retag_property_list<boost::edge_bundle_t,boost::no_property>::type,boo st::no_property,boost::listS>::config::vertex_ptr >::value_type & ] ...\boost_1_32_0\boost\graph\copy.hpp(323) : see reference to class template instantiation 'boost::iterator_property_map<RandomAccessIterator,IndexMap,T,R>' being compiled with [ RandomAccessIterator=std::vector<boost::detail::adj_list_gen<boost::adjacenc y_list<boost::vecS,boost::vecS,boost::undirectedS,boost::no_property,boost:: no_property,boost::no_property>,boost::vecS,boost::vecS,boost::undirectedS,b oost::detail::retag_property_list<boost::vertex_bundle_t,boost::no_property> ::type,boost::detail::retag_property_list<boost::edge_bundle_t,boost::no_pro perty>::type,boost::no_property,boost::listS>::config::vertex_ptr >::iterator, IndexMap=boost::property_map<boost::adjacency_list<boost::vecS,boost::listS, boost::undirectedS,boost::no_property,boost::no_property,boost::no_property> ,boost::vertex_index_t>::const_type, T=std::allocator<boost::detail::adj_list_gen<boost::adjacency_list<boost::ve cS,boost::vecS,boost::undirectedS,boost::no_property,boost::no_property,boos t::no_property>,boost::vecS,boost::vecS,boost::undirectedS,boost::detail::re tag_property_list<boost::vertex_bundle_t,boost::no_property>::type,boost::de tail::retag_property_list<boost::edge_bundle_t,boost::no_property>::type,boo st::no_property,boost::listS>::config::vertex_ptr >::value_type, R=std::allocator<boost::detail::adj_list_gen<boost::adjacency_list<boost::ve cS,boost::vecS,boost::undirectedS,boost::no_property,boost::no_property,boos t::no_property>,boost::vecS,boost::vecS,boost::undirectedS,boost::detail::re tag_property_list<boost::vertex_bundle_t,boost::no_property>::type,boost::de tail::retag_property_list<boost::edge_bundle_t,boost::no_property>::type,boo st::no_property,boost::listS>::config::vertex_ptr >::value_type & ] ...\CopyGraphTest.cpp(50) : see reference to function template instantiation 'void boost::copy_graph<BadGraphType,BadGraphType>(const VertexListGraph &,MutableGraph &)' being compiled with [ VertexListGraph=BadGraphType, MutableGraph=BadGraphType ] ------------------------------------------------------- Here is the code from property_map.hpp the generates the error - error line marked with //<----- HERE //========================================================================= // Adapter to turn a RandomAccessIterator into a property map template <class RandomAccessIterator, class IndexMap #ifdef BOOST_NO_STD_ITERATOR_TRAITS , class T, class R #else , class T = typename std::iterator_traits<RandomAccessIterator>::value_type , class R = typename std::iterator_traits<RandomAccessIterator>::reference #endif > class iterator_property_map : public boost::put_get_helper< R, iterator_property_map<RandomAccessIterator, IndexMap, T, R> > { public: typedef typename property_traits<IndexMap>::key_type key_type; typedef T value_type; typedef R reference; typedef boost::lvalue_property_map_tag category; inline iterator_property_map( RandomAccessIterator cc = RandomAccessIterator(), const IndexMap& _id = IndexMap() ) : iter(cc), index(_id) { } inline R operator[](key_type v) const { return *(iter + get(index, v)) ; } //<----- HERE protected: RandomAccessIterator iter; IndexMap index; }; -------------------------------------------------------- TIA for any help in this matter Tony Cook

2 1

[BGL] Help with Brandes' Betweenness
by Rui Carvalho 09 Sep '05

09 Sep '05

Hi, I'm trying to write code to compute Brandes' Betweenness Centrality for a very simple graph: a star. I'm doing this, as I haven't been able to find simple examples in the documentation [hint :)] for vecS,vecS graphs and still haven't grasped how edge property maps work. I've got it running if all I want is to compute vertex BC (see below, also attached), but can't get it to compute both vertex and edge BC. I'd appreciate any suggestions -perhaps my example (or something similar) could be corrected and included in the BGL? Thanks, Rui #include <iostream> // for std::dataout #include <utility> // for std::pair #include <boost/utility.hpp> // for boost::tie #include <boost/graph/graph_traits.hpp> // for boost::graph_traits #include <boost/graph/graph_utility.hpp> #include <boost/graph/betweenness_centrality.hpp>//for boost::brandes_betweenness_centrality #include <boost/graph/adjacency_list.hpp> using namespace boost; using namespace std; typedef adjacency_list < vecS, //Store out-edges vecS, //Store vertex set undirectedS, //the graph is undirected property<edge_index_t, int> > Graph; typedef graph_traits<Graph>::vertex_descriptor Vertex; typedef graph_traits<Graph>::vertex_iterator Vertex_Iter; typedef graph_traits<Graph>::edge_descriptor Edge; typedef graph_traits<Graph>::edge_iterator Edge_Iter; typedef property_map<Graph, vertex_name_t>::type Name_Map_t; typedef property_map<Graph, edge_index_t>::type Edge_Map_t; int main(int,char*[]) { int n_vrtx = 5; //Builds graph with vertices, but no edges Graph g_star(n_vrtx); //Add edges. Graph g_star is a star add_edge(vertex(0, g_star), vertex(4, g_star), g_star); add_edge(vertex(1, g_star), vertex(4, g_star), g_star); add_edge(vertex(2, g_star), vertex(4, g_star), g_star); add_edge(vertex(3, g_star), vertex(4, g_star), g_star); Vertex_Iter vertex_iterator_begin, vertex_iterator_end; std::vector<double> centrality(n_vrtx); brandes_betweenness_centrality(g_star, centrality_map(make_iterator_property_map(centrality.begin(), get(vertex_index, g_star),double())).vertex_index_map(get(vertex_index, g_star))); for ( tie(vertex_iterator_begin, vertex_iterator_end) = vertices(g_star); vertex_iterator_begin != vertex_iterator_end; ++vertex_iterator_begin) { cout << "Vertex: " << *vertex_iterator_begin <<"\tBC: "<< centrality[*vertex_iterator_begin] << endl; } }

2 2

[Logging] Issues with dlls
by Paolo Coletta 09 Sep '05

09 Sep '05

Hi, I'm using Torjo's logging library in both an exe and a dll loaded from that exe (OS: Windows Xp, Compiler VC71 - /MD compile flag - multithreaded dll). I need the exe and the dll to have independent logs, as the dll are plugins implemented by third parties which may or not use boost log. The approach I was trying to follow was: - The exe declares/defines the log it needs. In its main function it initializes the logging system (appenders/modifiers/flush_log_cache). - Some of the dlls (at least the ones developed by me), declare/defines their own logs. In the DllMain they initialize theri logging system (appenders/modifiers/flush_log_cache). Is this expected to work? I made some tests and I got an access violation when exiting the main app, in the destructor of default_log_manager_impl(). (I can send a simple test case if needed). I also tried to compile the exe with BOOST_LOG_DYN_LINK but I always get the access violation (don't know if this could help - I remember to have seen this suggested in a similar case). What am i doing wrong? Paolo Coletta

3 3

Thread events
by Johan 't Hart 09 Sep '05

09 Sep '05

(I'm not that familiair with news servers, so this post might appear for the second time. I hope to get an answer though) Hello, I'm quite a newbie in the boost world, and I read the documentation about boost::threads. Inthere I read that events were not included in boost because they were too error-phrone. That made me wonder how to do multithreading without events, for example, how do you make a thread wait for something to do without events? I don't know how to implement that with just mutexes. Can someone help me? Thanks in advance. Johan 't Hart -- -- Mijn Postvak In wordt beschermd door SPAMfighter 11622 spam-mails zijn er tot op heden geblokkeerd. Download de gratis www.SPAMfighter.com vandaag nog!

8 8

bbv2 filesystem link issue?
by Daniel Schlyder 09 Sep '05

09 Sep '05

Hi, I'm in the process of upgrading to Boost.Build v2 and have run into a problem with Boost.Filesystem (or my use of it). Executables using this library crash when built with my BBv2 files, but work fine with my old BBv1 files. I'm using Boost CVS HEAD, MinGW GCC 3.4.4 and Boost.Jam 03.01.11. The crash is a SIGSEGV in std::string::find_first_of() when called from boost::filesystem::windows_name(). It doesn't matter whether I use a shared or static variant of the library. Moving the definition of windows_invalid_chars into windows_name() fixes it as long as I use a static variant. I guess this should give some clue as to what is going wrong, but I don't get it. I tried comparing the build commands of BB v1 and v2 but if there is anything wrong I don't have the knowledge to see it. I tried duplicating the crash using a simple BBv2 Jamroot and a "hello world"-ish Boost.Filesystem program, but that works fine. I'm completely stuck here and any help would be much appreciated. Thanks, -- Daniel Schlyder http://bitblaze.com/

1 0

Re: [Boost-users] Thread events
by Gottlob Frege 09 Sep '05

09 Sep '05

> > Date: Thu, 8 Sep 2005 21:06:12 +0200 > From: "Johan 't Hart" <jopie64(a)hotmail.com> > Subject: Re: [Boost-users] Thread events > To: <boost-users(a)lists.boost.org> > Message-ID: <BAY109-DAV27468EBFC3012D63D9A99B4990(a)phx.gbl> > Content-Type: text/plain; format=flowed; charset="iso-8859-1"; > reply-type=original > > Thanks for your replies. > > To me boost::condition looks very much like the old event variable, except > that it works together with a mutex. I am now wondering why you should > lock > a mutex before waiting for the condition? Is there a rationale about this? > > Johan Also note that the wait() on the condition unlocks the mutex until you return from the wait call. That's not always obvious from the examples.

1 0

request: make atomic operations (boost/detail/atomic_count*) available for library users
by Paul Pogonyshev 08 Sep '05

08 Sep '05

Hi, Is it possible that atomic operations in Boost are made available for library users? `shared_ptr' is good, but sometimes one might need the low-level operations too. Paul

2 2

Boost licensing applied
by Ted Carter 08 Sep '05

08 Sep '05

I'm considering using Boost in a commercial product, but after reading the licensing statement I'm not clear what is required. The candidate project ships to end-users in binary, and sometimes to oems as sources. Does the license statement need to be included with all sources, dependent files, or just in the Boost library sources? Legalese isn't my strong point. Regards, Ted.

3 2

[BGL] what is the "Power-Law Out Degree" algorithm?
by Rui Carvalho 08 Sep '05

08 Sep '05

Hi, What is the PLOD algorithm http://www.boost.org/libs/graph/doc/plod_generator.html My understanding is that this is NOT the Barabasi-Albert model. Could someone post a reference (paper/book) to the algorithm, please. Thanks, Rui

3 5

[graph] king ordering: get rid of "comparison between signed and unsigned" warning
by Marco Morandini 08 Sep '05

08 Sep '05

This patch allows to get rid of the "comparison between signed and unsigned" warning, issued by gcc 3.4.4 at -Wall. I'm not sure of the correctness of the (int)Qptr->size() cast. Regards, Marco Morandini --- /home/marco/Programmi/boost_1_33_0/boost/graph/king_ordering.hpp 2005-09-06 19:20:56.000000000 +0200 +++ king_ordering.hpp 2005-09-08 13:55:10.000000000 +0200 @@ -63,7 +63,7 @@ //heap the vertices already there std::make_heap(rbegin, rend, boost::bind<bool>(comp, _2, _1)); - int i = 0; + typename Buffer::size_type i = 0; for(i = index_begin; i != Qptr->size(); ++i){ colors[get(vertex_map, (*Qptr)[i])] = 1; @@ -168,7 +168,7 @@ int parent_location = Qptr->size() - heap_parent_location; bool valid = (heap_parent_location != 0 && child_location > index_begin + offset && - parent_location < Qptr->size()); + parent_location < (int)Qptr->size()); while(valid && comp((*Qptr)[child_location], (*Qptr)[parent_location])){

1 0

boost v1.33 on VS2005
by Oleg Smolsky 08 Sep '05

08 Sep '05

Hi all, just reporting that entire boost compiled on August CTP of VS2005 aka VC8. Best regards, Oleg.

1 0

boost threads: threads priority
by Amit Itzkovich 07 Sep '05

07 Sep '05

Hi, I was looking into using boost threads. However, it seems there isn't anyway to change thread priorities. I need to use a high priority thread in order to perform time-critical midi processing under Windows XP and MacOSX. Did I miss something? Thanks, Amit

2 1

compile-time mapping: a[1] --> a1 ?
by Steven Allmaras 07 Sep '05

07 Sep '05

I would like to do a compile-time mapping of an array accessor to a list of scalars as in the following class: class MyArray1 { public: double& operator[](int n) { ??? } private: double a0, a1, a2, a3 ; } ; int main() { MyArray1 x ; x[1] = 2. ; } I've left off all the extraneous stuff like constructors. I don't know how to write the MyArray1::operator[] so that it will evaluate to one of the data members at compile time; an if-test would correctly evaluate but might not be optimized away and run slowly. Is there some way to do the compile-time evaluation using the MPL? I looked thru the tutorial but did not find anything that looked like it would work. One possibility that I considered was the C preprocessor concatenation operator ##, #define PICKMEMBER(n) a##n double& operator[](int n) { PICKMEMBER(n) ; } Unfortunately, this will not work for expressions like x[i+1]. It probably has additional problems other than being quite distasteful. Obviously, this would all be easy if I just implemented the member data with an array, class MyArray2 { public: double& operator[](int n) { return data[n] ; } private: double data[4] ; } ; In fact, I did do so and everything works fine. The reason that I am trying to implement the list of scalars method is to see if there are any CPU timing differences for my application, which amounts to matrix-vector operations for small, dense vectors whose sizes are known at compile time. I have tried uBlas but was disappointed with the timing results (and yes, I did compile with -DNDEBUG). I've also looked at other packages such as tvmet (it did worse). I finally tried rolling my own vector and matrix classes with lazy evaluation of binary operators via Eckel's "Thinking in C++, Vol 2"; I also studied source for uBlas and tvmet. So far, I am able to beat uBlas on my choice of compilers/platforms, but I'm still not getting the consistent performance that I was hoping for. Why am I so interested in performance? Two reasons. First, if I can get consistently good performance (i.e. performance that is close to raw C or Fortran) for fairly straightforward operations, then I can be more confident that as I increase abstraction, performance will not deteriorate substantially. Second, I am evaluating C++ for applications that have been traditionally written in Fortran -- in my case, CFD codes for airflow simulation. Issues of modularity, extensibility, maintenance, and the fact that very few students are learning Fortran anymore may not be enough to convince my peers. I think I will also need to show that we will not experience a substantial performance hit with C++. Thanks in advance for any help. Steven Allmaras Boeing Commercial Airplanes

3 2

Re: [Boost-users] boost\serialization expects 2 arguments - 3 provided with VC71 /MDd
by Guoxing Yang 07 Sep '05

07 Sep '05

Robert, I really like the boost serialization library. However, I am having a similar compiler error with VC71. I am trying to use the following code for all STL collections. template void LoadFromXml(const std::string &sXmlText, TValue &oValue) { std::istringstream oInStream(sXmlText); assert(oInStream.good()); boost::archive::xml_iarchive oIn(oInStream); oIn >> BOOST_SERIALIZATION_NVP(oValue); // restore from XML archive. } When the VC71 uses Multi-threaded Debug DLL (/MDd) setting, it generates the following compiler error: C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7 \include\boost\serialization\split_free.hpp(55) : error C2780: 'void boost::archive::load(Archive &,T &)' : expects 2 arguments - 3 provided C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7 \include\boost\archive\detail\iserializer.hpp(514) : see declaration of 'boost::archive::load' C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7 \include\boost\serialization\split_free.hpp(54) : while compiling class- template member function 'void boost::serialization::free_loader::invoke(Archive &,T &,const unsigned int)' with [ Archive=boost::archive::xml_iarchive, T=std::vector ] C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7 \include\boost\serialization\split_free.hpp(70) : see reference to class template instantiation 'boost::serialization::free_loader' being compiled with [ Archive=boost::archive::xml_iarchive, T=std::vector ] C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7 \include\boost\serialization\vector.hpp(79) : see reference to function template instantiation 'void boost::serialization::split_free>(Archive &,T &,const unsigned int)' being compiled with [ Archive=boost::archive::xml_iarchive, _Ty=int, T=std::vector ] Changing the setting to Multi-threaded Debug (/MTd), everything works well. I could not figure out why. Could you please help me? Thanks Yang

2 1

Re: [Boost-users] compile-time mapping: a[1] --> a1 ?
by boost＠dalvander.com 07 Sep '05

07 Sep '05

>I would like to do a compile-time mapping of an array accessor to a list of > scalars as in the following class: Hi Steven, This is something I found floating on the net some time ago, perhaps it will give you some ideas: template <typename T> class Vector4 { typedef T Vector4<T>::* const vec[4]; static const vec v; public: T x, y, z, w; Vector4() : x(0), y(0), z(0), w(0) { } Vector4(T _x, T _y, T _z, T _w) : x(_x), y(_y), z(_z), w(_w) { } const T& operator[](size_t i) const { return this->*v[i]; } T& operator[](size_t i) { return this->*v[i]; } }; template <typename T> const typename Vector4<T>::vec Vector4<T>::v = { &Vector4<T>::x, &Vector4<T>::y, &Vector4<T>::z, &Vector4<T>::w }; template <typename T> class Matrix4 { typedef Vector4<T> Matrix4::* const mat[4]; static const mat a; public: Vector4<T> i, j, k, l; Matrix4() : i(), j(), k(), l() { } Matrix4(const Vector4<T>& _i, const Vector4<T>& _j, const Vector4<T>& _k, const Vector4<T>& _l) : i(_i), j(_j), k(_k), l(_l) { } const Vector4<T>& operator[](size_t i) const { return this->*a[i]; } Vector4<T>& operator[](size_t i) { return this->*a[i]; } }; template <typename T> const typename Matrix4<T>::mat Matrix4<T>::a = { &Matrix4<T>::i, &Matrix4<T>::j, &Matrix4<T>::k, &Matrix4<T>::l }; Cheers, Anders Dalvander

1 0

Thread events
by Johan 't Hart 07 Sep '05

07 Sep '05

Hello, I'm quite a newbie in the boost world, and I read the documentation about boost::threads. Inthere I read that events were not included in boost because they were too error-phrone. That made me wonder how to do multithreading without events, for example, how do you make a thread wait for something to do without events? I don't know how to implement that with just mutexes. Can someone help me? Thanks in advance. Johan 't Hart -- -- Mijn Postvak In wordt beschermd door SPAMfighter 11616 spam-mails zijn er tot op heden geblokkeerd. Download de gratis www.SPAMfighter.com vandaag nog!

1 0

Re: [Boost-users] [serialization, 1_33_0] Correct usage and implementation for serializable objects without default constructors
by Martin Proulx 07 Sep '05

07 Sep '05

> Hello, > > While using the latest release of boost, I've encountered a few > questions concerning the usage of the serialization library with > objects without default constructors. > > Here they are: > > 1-) How can we construct an instance of a serialized object that > doesn't have a default constructor? > > The only option I've figured out is to normally construct an object > with bogus values, then unserialize the real values while reading from > the archive. Example: > > X(0) val; // 0 being some bogus value. > inputStream >> val; // Overwrites all values within val; > > Is this the correct way to do things? > >> No.. But I think what you want can be found in the manual in >> section: If you specialize save/load construct data you will get what >> you want. Use construct in place inside of load construct data. >> Reference/Serializable/Concept/Pointers/Non-Default Constructors. > > 2-) How should we split the serialization between the class' > serialize member versus load/save_construct_data? > > My observations show that when un/serializing objects directly like > shown above, load/save_construct_data aren't needed, so the serialize > member has to handle everything. When serializing a vector<X>, > load/save_construct_data does get called, so we have to un/serialize > some members in those functions as well. At first glance, it seems > some members will have to be un/serialized for the second time within > load/save_construct_data. > > Is that correct? For a class to be correctly un/serializable for all > cases, load/save_construct_data must un/serialize members that are > already taken care of in the serialize member? > >> Nope. >> >> If his isn't simple, then there is something wrong. Check the code >> in test_non_default_ctor . If it still doesn't give you what you >> need, ask again. >> >> RObert Ramey > Hello, Let me rediscuss everything with the example of test_non_default_ctor.cpp at hand. In this example, we have a class A that doesn't have a default constructor. An int is needed by the constructor, which is stored in the i member variable. load/save_construct_data are used to un/serialize the i member, while the serialize member is used for all other members. Looking at this test, I see a couple of behaviors that puzzle me. -) Saving the 'a' instance in the save() function doesn't end up calling save_construct_data. This leaves a serialized version of A which lacks the 'i' member. This makes it impossible to fully restore the 'a' instance. It seems problematic to me that save_construct_data isn't called in this case. In my planned usage, I'd like to fully serialize all members, regardless if the objects are serialized directly or through pointers. I cannot see how to do this without serializing the members needed to reconstruct the object in both serialize and save_construct_data, even if some members will end up serialized twice when an object is stored through a pointer. What's the proper way to serialize all members of a class without a default constructor so that it gets fully serialized regardless how the objects are managed? -) When restoring the 'a' instance within load(), in order to restore it, we first create another 'a' instance (with a different constructor argument), then restore the other members within, leaving untouched the 'i' member. Assuming I'd like to be able to serialize and unserialize completely objects that do not have a default constructor, I'm wondering how I can fully restore an object that doesn't have a default constructor. I currently can only see a single way, and it is the way it's done in load() for the 'a' instance; that is to construct an object with possibly irrelevant constructor arguments, and then unserialize the object from the archive. This has the downside of fully constructing an object with temporary values that will get replaced when we unserialize the real values. I've looked for some other mechanism relying on a copy constructor and something along the lines of load_construct_data, but I haven't found any. Here again, what is the syntax of choice to fully restore an object that doesn't have a default constructor? Thanks! Martin -- Tel: (450) 681-1681, #271 ------------------------------------------------------------------------ OKIOK Enterprise and e-business security solutions Solutions de sécurité d'entreprise et d'affaires électronique Tel. : (450) 681.1681 http://www.okiok.com This e-mail message (including attachments, if any) is intended for the use of the individual or entity to which it is addressed and may contain information that is privileged, proprietary, confidential and exempt from disclosure. If you are not the intended recipient, you are notified that any dissemination, distribution or copying of this communication is strictly prohibited. If you have received this communication in error, please notify the sender and erase this e-mail message immediately. Le présent message électronique (y compris les pièces qui y sont annexées, le cas échéant) s'adresse au destinataire indiqué et peut contenir des renseignements de caractère privé ou confidentiel. Si vous n'êtes pas le destinataire de ce document, nous vous signalons qu'il est strictement interdit de le diffuser, de le distribuer ou de le reproduire. Si ce message vous a été transmis par erreur, veuillez en informer l'expéditeur et le supprimer immédiatement.

2 1

[BGL] filtered_graph and null_vertex()
by Tiago de Paula Peixoto 06 Sep '05

06 Sep '05

Hello. Is the function graph_traits<G>::null_vertex() defined for G = filtered_graph? When I try to compile the following simple program: -------------------------------------------------------------- #include <boost/graph/adjacency_list.hpp> #include <boost/graph/filtered_graph.hpp> using namespace boost; int main() { typedef adjacency_list<vecS> graph_t; typedef filtered_graph<graph_t,keep_all> f_graph_t; graph_traits<f_graph_t>::vertex_descriptor v = graph_traits<f_graph_t>::null_vertex(); return 0; } -------------------------------------------------------------- I get the following error with GCC 4.0.1 and boost 1.33.0: /usr/include/boost/graph/graph_traits.hpp: In static member function ‘static typename boost::graph_traits<G>::vertex_descriptor boost::graph_traits<G>::null_vertex() [with G = main()::f_graph_t]’: filtered_test.cc:10: instantiated from here /usr/include/boost/graph/graph_traits.hpp:49: error: ‘null_vertex’ is not a member of ‘main()::f_graph_t’ Shouldn't null_vertex() just be defined to return the null_vertex() for the underlying graph, since the vertex descriptors are the same? Do I miss something? -- Tiago de Paula Peixoto <tiago(a)forked.de>

3 3

Multipartite or layered graph
by Nicola Vitacolonna 06 Sep '05

06 Sep '05

Hi, I need to implement a graph whose set of vertices is partitioned into a certain number of ordered subsets (called layers). Edges join vertices from a layer to the next one(s). A critical operation is the iteration over the nodes of a given layer. I think this can be implemented by adding a vertex property to each vertex, that specifies the layer each vertex belongs to. But this does not seem to me the most (time and space) efficient solution: in particular, how can I iterate over the nodes of a given layer without checking every node? I was wondering whether there is a better way to do the job: maybe, using a custom VertexList implemented using a vector for each layer (in this case, should I write my own functions to add/remove vertices? And should I write my own iterators?). Any other idea, or pointer to existing code (I am new to Boost)? Best regards Nicola Vitacolonna

2 1

[serialization, 1_33_0] Correct usage and implementation for serializable objects without default constructors.
by Martin Proulx 06 Sep '05

06 Sep '05

Hello, While using the latest release of boost, I've encountered a few questions concerning the usage of the serialization library with objects without default constructors. Here they are: 1-) How can we construct an instance of a serialized object that doesn't have a default constructor? The only option I've figured out is to normally construct an object with bogus values, then unserialize the real values while reading from the archive. Example: X(0) val; // 0 being some bogus value. inputStream >> val; // Overwrites all values within val; Is this the correct way to do things? 2-) How should we split the serialization between the class' serialize member versus load/save_construct_data? My observations show that when un/serializing objects directly like shown above, load/save_construct_data aren't needed, so the serialize member has to handle everything. When serializing a vector<X>, load/save_construct_data does get called, so we have to un/serialize some members in those functions as well. At first glance, it seems some members will have to be un/serialized for the second time within load/save_construct_data. Is that correct? For a class to be correctly un/serializable for all cases, load/save_construct_data must un/serialize members that are already taken care of in the serialize member? Thanks! Martin -- Tel: (450) 681-1681, #271 ------------------------------------------------------------------------ OKIOK Enterprise and e-business security solutions Solutions de sécurité d'entreprise et d'affaires électronique Tel. : (450) 681.1681 http://www.okiok.com This e-mail message (including attachments, if any) is intended for the use of the individual or entity to which it is addressed and may contain information that is privileged, proprietary, confidential and exempt from disclosure. If you are not the intended recipient, you are notified that any dissemination, distribution or copying of this communication is strictly prohibited. If you have received this communication in error, please notify the sender and erase this e-mail message immediately. Le présent message électronique (y compris les pièces qui y sont annexées, le cas échéant) s'adresse au destinataire indiqué et peut contenir des renseignements de caractère privé ou confidentiel. Si vous n'êtes pas le destinataire de ce document, nous vous signalons qu'il est strictement interdit de le diffuser, de le distribuer ou de le reproduire. Si ce message vous a été transmis par erreur, veuillez en informer l'expéditeur et le supprimer immédiatement.

2 1

[BGL] using biconnected_components with an exterior property map
by Greg Landrum 06 Sep '05

06 Sep '05

Hi, I'm trying to use the biconnected_components algorithm from v1.33 of the BGL in some code and I've encountered a problem that I just can't seem to get past. The algorithm requires a property map argument that's used to output which component each edge maps to; this is the argument that's giving me fits. I started with a simple-ish case derived from an example in the BGL docs: //------------------------------------------------------------------ namespace boost { struct edge_component_t { enum { num = 555 }; typedef edge_property_tag kind; } edge_component; typedef property< edge_component_t, std::size_t > edge_prop_t; } int main() { using namespace boost; typedef adjacency_list < vecS, vecS, undirectedS, no_property, edge_prop_t >graph_t; typedef graph_traits < graph_t >::vertex_descriptor vertex_t; graph_t g(5); add_edge(0, 1, edge_prop_t(3), g); add_edge(1, 2, edge_prop_t(3), g); add_edge(0, 2, edge_prop_t(3), g); add_edge(2, 3, edge_prop_t(1), g); add_edge(3, 5, edge_prop_t(1), g); typedef property_map < graph_t, edge_component_t >::type edge_map_t; edge_map_t edge_map = get(edge_component, g); graph_traits<graph_t>::edge_iterator edge,endEdges; for(tie(edge,endEdges)=boost::edges(g); edge!=endEdges;++edge){ std::cout << " >Edge1: " << source(*edge,g) << "-" << target(*edge,g) << " <- " << edge_map[*edge] << std::endl; } edge_map_t components = get(edge_component, g); std::size_t num_comps = biconnected_components(g, components); for(tie(edge,endEdges)=boost::edges(g); edge!=endEdges;++edge){ std::cout << " >Edge2: " << source(*edge,g) << "-" << target(*edge,g) << " <- " << edge_map[*edge] << std::endl; } return 0; } //------------------------------------------------------------------ When I run this, I get reasonable results for the connected components, but here's what prints: >Edge1: 0-1 <- 3 >Edge1: 1-2 <- 3 >Edge1: 0-2 <- 3 >Edge1: 2-3 <- 1 >Edge1: 3-5 <- 1 >Edge2: 0-1 <- 2 >Edge2: 1-2 <- 2 >Edge2: 0-2 <- 2 >Edge2: 2-3 <- 1 >Edge2: 3-5 <- 0 Note that the graph's property map values for the edges have changed (Edge2 values vs Edge1 values). So calling biconnected_components() has modified the graph, even though the graph argument is const. This made me sad, but I figured that I should be able to work around it using an exterior property map. According to the docs: "The ComponentMap type must be a model of Writable Property Map. The value type shouch be an integer type, preferably the same as the edges_size_type of the graph. The key type must be the graph's edge descriptor type." So as my next experiment, I decided to attempt to use an associative property map matching these requirements. I tried to define components like this: //------------ typedef std::map< graph_traits<graph_t>::edge_descriptor, int > map_t; map_t base_map; associative_property_map< map_t > components(base_map); //------------ That doesn't compile, the definition of base_map generates an error whose explanation begins with: //---------------- C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\include\functional(139) : error C2784: 'bool std::operator <(const std::stack<_Ty,_Container> &,const std::stack<_Ty,_Container> &)' : could not deduce template argument for 'const std::stack<_Ty,_Container> &' from 'const boost::graph_traits<G>::edge_descriptor' with [ G=graph_t ] //---------------- My apologies for the horrible interaction between this message and gmail's line wrapping. If it's useful, I can send the entire error message as an attachment. I next tried to create some other kind of exterior property map, but the documentation for how to do this seems to be out of date. There's an explanation of this in the boost wiki at URL: http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl?Documentatio… search for "random_access_iterator_property_map" So my question is: how can I make a call to biconnected_components in a manner that doesn't modify my graph (or any of its associated property maps)? In the event that it matters, I'm building these tests under win2k using visual c++ 7.1 and boost v1.33. -greg

4 7

[graph] cuthill-mckee ordering broken?
by Marco Morandini 06 Sep '05

06 Sep '05

After building the example file cuthill_mckee_ordering.cpp I get ------------------------------ 8 3 0 9 2 5 1 4 7 6 bandwidth: 4 Reverse Cuthill-McKee ordering starting at: 0 9 1 4 6 7 2 8 5 3 0 bandwidth: 4 Reverse Cuthill-McKee ordering: 9 1 4 6 7 2 8 5 3 0 bandwidth: 4 ------------------------------- instead of the expected ------------------------------- Reverse Cuthill-McKee ordering starting at: 6 8 3 0 9 2 5 1 4 7 6 bandwidth: 4 Reverse Cuthill-McKee ordering starting at: 0 9 1 4 6 7 2 8 5 3 0 bandwidth: 4 Reverse Cuthill-McKee ordering: 0 8 5 7 3 6 4 2 1 9 bandwidth: 4 ------------------------------- (the last ordering is different. Even worst, if I comment out the first two code blocks that wraps the call to cuthill_mckee_ordering, and leave only the third, I get ------------------------------- Reverse Cuthill-McKee ordering: 0 0 0 0 0 0 0 0 0 0 bandwidth: 9 Is this correct? Thanks in advance, Marco Morandini boost version: 1.33.0 compiler: marco@mbdyn-mm:~> gcc -v Reading specs from /home/marco/local/gcc-3.4.4/lib/gcc/i686-pc-linux-gnu/3.4.4/specs Configured with: ../configure --enable-languages=c,c++,f77 --prefix=/home/marco/local/gcc-3.4.4 --enable-__cxa_atexit --enable-threads=posix Thread model: posix gcc version 3.4.4 Operating system: Linux, SuSE 9.3

2 1

A error when using long option description, program_options library
by 沈慧峰 06 Sep '05

06 Sep '05

This runtime error only occurs when debug version, the release version has no such problem. The long option description can not be printed. My platform is vc7.1+stlport 4.62+boost 1.33, I also define the macro _STLP_DEBUG and BOOST_LIB_DIAGNOSTIC. Some extraction of my code: operatoins.add_options() ("difference,d", "Get all the word of mine, origin file, my file, output file") ("replace,r", "Replace the wrong pinyin with the right(delete maybe wrong chongma)" ", right file, origin file, new file") ("remove", po::value<string>(), "delete the word specified by regex expression") ("merge,m", "merge the files specified") ("regex", "match regex") ("files,f", po::value< vector<string> >(), "input file"); when print "Get all the word of mine, origin file, my file, output ", a runtime error occurs, the program terminates. Although I can give the debug version a short description and the release version a long description, it is boring. The error occur in the code call format_one()/format_description/format_paragraph The error code is line 361, options_description.cpp: if (line_begin + (line_length - indent) > par_end) { line_end = par_end; } else { line_end = line_begin + (line_length - indent); }

3 2

Re: [Boost-users] bgl - add_vertex during breadth first
by Abebaw Wubshet 06 Sep '05

06 Sep '05

Hi Jeremy, Many thanks for the response. I was hoping I could add vertices inside the algorithm visitor based on some conditions and these same conditions will be applied when the newly added vertices are visited by calling the algorithm only once (a kind of recursive effect). Now it seems that I have to call the algorithm many times and introduce some sort of my own implementation of colour or add a property to each vertex which flags whether it is already expanded or not. Is there any better idea? Cheers, Abebaw > Message: 5 > Date: Mon, 5 Sep 2005 17:19:21 -0500 > From: Jeremy Siek <jeremy.siek(a)gmail.com> > Subject: Re: [Boost-users] bgl - add_vertex during breadth first > search > To: boost-users(a)lists.boost.org > Message-ID: <BE018FBF-735B-4948-8B2A-66793695F214(a)gmail.com> > Content-Type: text/plain; charset=US-ASCII; delsp=yes; format=flowed > > Hi Abebaw, > > Adding vertices and edges is a dangerous thing to do inside an > algorithm visitor. This is because doing that invalidates > iterators that the algorithm is using. Also, the algorithm > creates a mapping from vertices to colors (to mark > which vertices have been processed), and adding vertices > will mess up that mapping. Can you just record that > you want to add vertices and do it after the BFS? > > Cheers, > Jeremy > > On Sep 4, 2005, at 7:43 AM, Abebaw Wubshet wrote: > > Hi all, > > > > I have started using the boost graph library recently. I want to > > add vertices > > and edges to a graph through an algorithm visitor. I chose the > > 'discover_vertex' > > event and added some code to add a vertex/edge. But the compiler > > could not > > determine the apporpriate the matching add_vertex/add_edge > > function. I tried > > fully specifiying the template arguments with no success. (I am > > using gcc 3.3.1 > > on SuSE Linux.) > > > > I tried another alternative which does not work either. I created a > > pointer to a > > graph object which points to my graph insided the > > 'discover_vertex'. But then I > > ended up having a run time error after the vertex is added. > > > > Many thanks, > > Abebaw Wubshet > > > > > > Here is a sample code > > / > > ********************************************************************** > > **/ > > #include <boost/config.hpp> > > #include <iostream> > > #include <boost/graph/adjacency_list.hpp> > > #include <boost/graph/breadth_first_search.hpp> > > #include <boost/shared_ptr.hpp> > > > > using namespace boost; > > > > class VertexProperties > > { > > public: > > std::string _name; > > VertexProperties () {} > > VertexProperties (std::string name) : _name(name) {} > > }; > > > > //OPTION ONE > > class bfs_extend_graph1 : public default_bfs_visitor > > { > > public: > > template<typename Vertex, typename Graph> > > void discover_vertex (Vertex v, Graph& g) > > { > > std::cout<<"\ndiscover"; > > Vertex v_new; > > //the compile gets confused here !!!!! > > v_new = add_vertex(VertexProperties("C"),g); > > add_edge(v,v_new,g); > > } > > }; > > > > //OPTION TWO > > class bfs_extend_graph2 : public default_bfs_visitor > > { > > public: > > template<typename Vertex, typename Graph> > > void discover_vertex (Vertex v, Graph& g) > > { > > std::cout<<"\ndiscover"; > > Vertex v_new; > > typedef adjacency_list< vecS, vecS, directedS, > > VertexProperties> > > graph_t; > > //a pointer to > > shared_ptr<graph_t> ptr_g; > > *ptr_g = g; //reference to the actual graph > > v_new = add_vertex(VertexProperties("C"),*ptr_g); > > add_edge(v,v_new,*ptr_g); > > } > > }; > > > > > > int main() > > { > > typedef adjacency_list< vecS, vecS, directedS, > > VertexProperties> graph_t; > > typedef graph_traits<graph_t>::vertex_descriptor Vertex; > > typedef graph_traits<graph_t>::vertex_iterator vertex_iterator; > > typedef property_map<graph_t,std::string > > VertexProperties::*>::type VP_map_t; > > > > graph_t g; > > Vertex v1,v2; > > > > v1 = add_vertex(VertexProperties("A"),g); > > v2 = add_vertex(VertexProperties("B"),g); > > add_edge(v1,v2,g); > > > > //get the VP map > > VP_map_t VP_map = get(&VertexProperties::_name,g); > > > > bfs_extend_graph1 bfs_e1; > > breadth_first_search(g,v1,visitor(bfs_e1)); > > > > bfs_extend_graph2 bfs_e2; > > breadth_first_search(g,v1,visitor(bfs_e2)); > > > > //check if everything is okay > > std::pair<vertex_iterator, vertex_iterator> vp; > > std::cout<<std::endl<<"vertices : "; > > for ( vp = vertices(g); vp.first != vp.second; ++vp.first) > > { > > VertexProperties vp1 = get(VP_map,*vp.first); > > std::cout<<"\t"<<vp1._name; > > } > > > > return 0; > > } > > > > / > > ********************************************************************** > > **/

1 0

[program_options] VC6 compile error 'illegal pure syntax, must be "=0"'
by Gottenbos, Hennie 06 Sep '05

06 Sep '05

Hi All, I am having problems using the [program_options] library from Boost 1.33. Using this simple program: #include <boost/program_options.hpp> int main(int argc, char* argv[]) { return 0; } I get compile errors like: options_description.hpp(156) : error C2258: illegal pure syntax, must be '= 0' options_description.hpp(156) : error C2252: 'm_default_line_length' : pure specifier can only be specified for functions options_description.hpp(159) : error C2065: 'm_default_line_length' : undeclared identifier This is the first time I'm using Boost. I have successfully developed a program that uses boost::filesystem but I have funny feeling this is a compiler limitation which means I can not use [program_options] on VC6. Can anyone confirm this so I can forget about program_options? Thanks! Hennie.

3 2

Passing template class name without type arguments
by Ovanes Markarian 06 Sep '05

06 Sep '05

Hello, I have a problem. I would like to use standart C++ <functional> function wrappers, but have a problem. At least in MS VC 7.0 a binary_function derivate (like plus) is defined: template<class Type> struct plus : public binary_function <Type, Type, Type> { Type operator()( const Type& _Left, const Type& _Right ) const; }; So if I am goint to add int and double value I will get int back. How can find a work around? First I was thinking about smth like: template<class _Arg1, class _Arg2> struct _ResultType { //some general implementation like typedef typename _Arg1 result_type; }; //specializations like: template<> struct _ResultType<long, double> { typedef double result_type; }; template<class _BinaryFct, class _ResultType> struct Expression { typedef typename _ResultType::result_type result_t; typedef typename _BinaryFct<result_t> binary_fct; //other definitions etc... }; somewhere in the code: #include <functional> Expression<std::plus, _ResultType<long, double> > myExpr; A C++ compiler awaits a real type which causes an error. How else can I change the type of plus<long> to plus<double>. Probably I could write smth like this: typedef std::plus<_ResultType<long, double> > myBinaryFunction; Expression<myBinaryFunction> myExpr; But somehow I don't like it, since the _ResultType class will contain more information as simple result_type. And I will need to pass it twice like: typedef std::plus<_ResultType<long, double> > myBinaryFunction; Expression<myBinaryFunction, _ResultType<long, double> > myExpr; This make the code not very readable... Is there any way using boost to overcome this? With Kind Regards, Ovanes Markarian

1 0

Cannot find a symbol in boost_thread-mt.dll
by Anatoli Sakhnik 06 Sep '05

06 Sep '05

Hi, boost users! I've just tried to execute the simplest boost::thread program, compiled by vc7_1 under multi threaded dll environment. It failed to resolve a symbol in the boost_thead-mt.dll (see the attach). Why? Is it possible to use linked dynamically boost::thread library now? Info: boost version is latest CVS, compiled with --layout=system. No error occurs after gcc-3.4. The program's source: #define BOOST_ALL_NO_LIB #include <boost/thread.hpp> void f() {} int main(int argc, char* argv[]) { boost::thread(f).join(); return 0; } -- Anatoli Sakhnik

2 2

problem with serialization (got my example)
by Benjamin Lau 06 Sep '05

06 Sep '05

Here is my short [kind of?] example. If it is too long, sorry, but I felt that I had to populate my vector with somewhat substantial vector. Also, in my previous post, I said that the other types that class Builder serialized only serialized std::string and booleans, but they also serialize std::vector<std::string>. I don't think it would make any difference since they are all either primitive types or types defined by the standard, but just to clarify. boost_serialization_test.hpp: #ifndef DATA_CLASSES_H #define DATA_CLASSES_H #include <fstream> #include <string> #include <vector> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/shared_ptr.hpp> class Program { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & sources; ar & target; ar & indent; ar & buildVars; ar & buildVarsValues; } public: Program() : className("Program") { } std::string sources; std::string target; bool indent; std::vector<std::string> buildVars; std::vector<std::string> buildVarsValues; std::string className; }; class Object { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & sources; ar & target; ar & indent; ar & buildVars; ar & buildVarsValues; } public: Object() : className("Object") { } std::string className; std::string sources; std::string target; bool indent; std::vector<std::string> buildVars; std::vector<std::string> buildVarsValues; }; class Java { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & srcDir; ar & classDir; ar & indent; } public: Java() : className("Java") { } std::string className; std::string srcDir; std::string classDir; bool indent; }; class Comment { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & content; } public: std::string content; }; class Print { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & content; ar & indent; } public: Print() : className("Print") { } std::string className; std::string content; bool indent; }; class Variable { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & name; ar & content; ar & indent; } public: Variable() : className("Variable") { } std::string className; std::string name; std::string content; bool indent; }; class Library { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & sources; ar & target; ar & indent; ar & buildVars; ar & buildVarsValues; } public: Library() : className("Library") { } std::string className; std::string sources; std::string target; bool indent; std::vector<std::string> buildVars; std::vector<std::string> buildVarsValues; }; class SharedLibrary { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & sources; ar & target; ar & indent; ar & buildVars; ar & buildVarsValues; } public: SharedLibrary() : className("SharedLibrary") { } std::string className; std::string sources; std::string target; bool indent; std::vector<std::string> buildVars; std::vector<std::string> buildVarsValues; }; class Node { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & nodes; ar & file; ar & dir; ar & content; ar & indent; ar & name; } public: Node() : className("Node") { } std::string className; std::string nodes; std::string file; std::string dir; std::string content; bool indent; std::string name; }; class Import { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & import; } public: Import() : className("Import") { } std::string className; std::string import; }; class Code { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & code; ar & indent; } public: Code() : className("Code") { } std::string className; std::string code; bool indent; }; class SourceSignatures { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & indent; ar & type; } public: SourceSignatures() : className("SourceSignatures") { } std::string className; bool indent; std::string type; }; class TargetSignatures { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & indent; ar & type; } public: TargetSignatures() : className("TargetSignatures") { } std::string className; bool indent; std::string type; }; class SetOption { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & indent; ar & option; ar & value; } public: SetOption() : className("SetOption") { } std::string className; bool indent; std::string option; std::string value; }; class Ignore { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & indent; ar & target; ar & file; } public: Ignore() : className("Ignore") { } std::string className; bool indent; std::string target; std::string file; }; class Depend { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & indent; ar & target; ar & file; } public: Depend() : className("Depend") { } std::string className; bool indent; std::string target; std::string file; }; class EnvironmentVariable { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & indent; ar & name; ar & buildVars; ar & buildVarsValues; } public: EnvironmentVariable() : className("EnvironmentVariable") { } std::string className; bool indent; std::string name; std::vector<std::string> buildVars; std::vector<std::string> buildVarsValues; }; class Builder { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & type; switch(type) { case 0: ar & program; break; case 1: ar & object; break; case 2: ar & java; break; case 3: ar & comment; break; case 4: ar & print; break; case 5: ar & variable; break; case 6: ar & library; break; case 7: ar & sharedLibrary; break; case 8: ar & node; break; case 9: ar & import; break; case 10: ar & code; break; case 11: ar & sourceSignatures; break; case 12: ar & targetSignatures; break; case 13: ar & setOption; break; case 14: ar & ignore; break; case 15: ar & depend; break; case 16: ar & environmentVariable; break; } } public: boost::shared_ptr<Program> program; boost::shared_ptr<Object> object; boost::shared_ptr<Java> java; boost::shared_ptr<Comment> comment; boost::shared_ptr<Print> print; boost::shared_ptr<Variable> variable; boost::shared_ptr<Library> library; boost::shared_ptr<SharedLibrary> sharedLibrary; boost::shared_ptr<Node> node; boost::shared_ptr<Import> import; boost::shared_ptr<Code> code; boost::shared_ptr<SourceSignatures> sourceSignatures; boost::shared_ptr<TargetSignatures> targetSignatures; boost::shared_ptr<SetOption> setOption; boost::shared_ptr<Ignore> ignore; boost::shared_ptr<Depend> depend; boost::shared_ptr<EnvironmentVariable> environmentVariable; int type; }; /* BOOST_CLASS_TRACKING(Program, boost::serialization::track_never) BOOST_CLASS_TRACKING(Object, boost::serialization::track_never) BOOST_CLASS_TRACKING(Java, boost::serialization::track_never) BOOST_CLASS_TRACKING(Comment, boost::serialization::track_never) BOOST_CLASS_TRACKING(Print, boost::serialization::track_never) BOOST_CLASS_TRACKING(Variable, boost::serialization::track_never) BOOST_CLASS_TRACKING(Library, boost::serialization::track_never) BOOST_CLASS_TRACKING(SharedLibrary, boost::serialization::track_never) BOOST_CLASS_TRACKING(Node, boost::serialization::track_never) BOOST_CLASS_TRACKING(Import, boost::serialization::track_never) BOOST_CLASS_TRACKING(Code, boost::serialization::track_never) BOOST_CLASS_TRACKING(SourceSignatures, boost::serialization::track_never) BOOST_CLASS_TRACKING(TargetSignatures, boost::serialization::track_never) BOOST_CLASS_TRACKING(SetOption, boost::serialization::track_never) BOOST_CLASS_TRACKING(Ignore, boost::serialization::track_never) BOOST_CLASS_TRACKING(Depend, boost::serialization::track_never) BOOST_CLASS_TRACKING(EnvironmentVariable, boost::serialization::track_never) BOOST_CLASS_TRACKING(Builder, boost::serialization::track_never)*/ #endif boost_serialization_test.cpp: #include "boost_serialization_test.hpp" int main() { std::ofstream fout("file"); boost::archive::text_oarchive fout_ar(fout); std::vector<Builder> data; Builder *builder = new Builder[10]; for(int i = 0; i < 10; i++) { builder[i].type = i; switch(i) { case 0: builder[i].program->sources = "bshfdvhjvcds"; break; case 1: builder[i].object->sources = "bshfdvhjvcds"; break; case 2: builder[i].java->srcDir = "bshfdvhjvcds"; break; case 3: builder[i].comment->content = "bshfdvhjvcds"; break; case 4: builder[i].print->content = "bshfdvhjvcds"; break; case 5: builder[i].variable->content = "bshfdvhjvcds"; break; case 6: builder[i].library->sources = "bshfdvhjvcds"; break; case 7: builder[i].sharedLibrary->sources = "bshfdvhjvcds"; break; case 8: builder[i].node->content = "bshfdvhjvcds"; break; case 9: builder[i].import->import = "bshfdvhjvcds"; break; case 10: builder[i].code->code = "bshfdvhjvcds"; break; case 11: builder[i].sourceSignatures->type = "jsdbifbviugvdbuyvf"; break; case 12: builder[i].targetSignatures->type = "jsdbifbviugvdbuyvf"; break; case 13: builder[i].setOption->option = "jsdbifbviugvdbuyvf"; break; case 14: builder[i].ignore->target = "jsdbifbviugvdbuyvf"; break; case 15: builder[i].depend->target = "jsdbifbviugvdbuyvf"; break; case 16: builder[i].environmentVariable->name = "vhdbfubvugvsdfuvy"; break; } } for(int i = 0; i < 10; i++) { data.push_back(builder[i]); } fout_ar << data; } Thanks a lot. Benjamin Lau P/s By the way, the /**/ around the BOOST_CLASS_TRACKING were from an earlier attempt to correct the problem, but with or without the macros, the same error messages appear.

2 1

bgl - add_vertex during breadth first search
by Abebaw Wubshet 05 Sep '05

05 Sep '05

Hi all, I have started using the boost graph library recently. I want to add vertices and edges to a graph through an algorithm visitor. I chose the 'discover_vertex' event and added some code to add a vertex/edge. But the compiler could not determine the apporpriate the matching add_vertex/add_edge function. I tried fully specifiying the template arguments with no success. (I am using gcc 3.3.1 on SuSE Linux.) I tried another alternative which does not work either. I created a pointer to a graph object which points to my graph insided the 'discover_vertex'. But then I ended up having a run time error after the vertex is added. Many thanks, Abebaw Wubshet Here is a sample code /************************************************************************/ #include <boost/config.hpp> #include <iostream> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/breadth_first_search.hpp> #include <boost/shared_ptr.hpp> using namespace boost; class VertexProperties { public: std::string _name; VertexProperties () {} VertexProperties (std::string name) : _name(name) {} }; //OPTION ONE class bfs_extend_graph1 : public default_bfs_visitor { public: template<typename Vertex, typename Graph> void discover_vertex (Vertex v, Graph& g) { std::cout<<"\ndiscover"; Vertex v_new; //the compile gets confused here !!!!! v_new = add_vertex(VertexProperties("C"),g); add_edge(v,v_new,g); } }; //OPTION TWO class bfs_extend_graph2 : public default_bfs_visitor { public: template<typename Vertex, typename Graph> void discover_vertex (Vertex v, Graph& g) { std::cout<<"\ndiscover"; Vertex v_new; typedef adjacency_list< vecS, vecS, directedS, VertexProperties> graph_t; //a pointer to shared_ptr<graph_t> ptr_g; *ptr_g = g; //reference to the actual graph v_new = add_vertex(VertexProperties("C"),*ptr_g); add_edge(v,v_new,*ptr_g); } }; int main() { typedef adjacency_list< vecS, vecS, directedS, VertexProperties> graph_t; typedef graph_traits<graph_t>::vertex_descriptor Vertex; typedef graph_traits<graph_t>::vertex_iterator vertex_iterator; typedef property_map<graph_t,std::string VertexProperties::*>::type VP_map_t; graph_t g; Vertex v1,v2; v1 = add_vertex(VertexProperties("A"),g); v2 = add_vertex(VertexProperties("B"),g); add_edge(v1,v2,g); //get the VP map VP_map_t VP_map = get(&VertexProperties::_name,g); bfs_extend_graph1 bfs_e1; breadth_first_search(g,v1,visitor(bfs_e1)); bfs_extend_graph2 bfs_e2; breadth_first_search(g,v1,visitor(bfs_e2)); //check if everything is okay std::pair<vertex_iterator, vertex_iterator> vp; std::cout<<std::endl<<"vertices : "; for ( vp = vertices(g); vp.first != vp.second; ++vp.first) { VertexProperties vp1 = get(VP_map,*vp.first); std::cout<<"\t"<<vp1._name; } return 0; } /************************************************************************/

2 1

date_time io bug in 1.33?
by Serge Skorokhodov 05 Sep '05

05 Sep '05

Hi, The following code looks pretty suspicious to me: extern const wchar_t* pts; // pts = L"2004071" std::wistringstream wiss(pts); wtime_input_facet* wtif = new wtime_input_facet; wtif->set_iso_format(); wiss.imbue(std::locale(std::locale::classic(), wtif)); ptime pt; wiss >> pt; std::string dbgs = to_iso_string(pt); // dbgs == "20040711T000000" Seems to be a bug? TIA -- Serge

3 3