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

RE: [Boost-users] tcp/ip software
by Brian Braatz 29 Oct '04

29 Oct '04

You can also look at ACE http://www.cs.wustl.edu/~schmidt/ACE.html It is very powerful, and quite stable, but it does not use modern C++ techniques. > -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] On Behalf Of Aaron W. LaFramboise > Sent: Monday, October 25, 2004 7:30 PM > To: boost-users(a)lists.boost.org > Cc: 0(a)main.gmane.org > Subject: Re: [Boost-users] tcp/ip software > > Greg Silverman wrote: > > Since Boost does not have a library for TCP/IP, I was wondering what OO > > interface to sockets is most popular with Boost users? > > Giallo <http://giallo.sourceforge.net> is a work-in-progress candidate > for a future Boost sockets library. > > Aaron W. LaFramboise > _______________________________________________

1 0

RE: [Boost-users] uBLAS past, present, and future.
by Foster, Gareth 29 Oct '04

29 Oct '04

Doesn't freshmeat/sourceforge give you that automatically somehow? I remember seeing some sort of league table of the most 'active' projects on one of the two sites, taking that figure is something that could be automated, and so wouldn't go out of date, it might be a good start? If the code isn't on freshmeat/sourceforge maybe the same thing could be setup on the server where boost source is stored? Thinking about it, you could probably list the number of hackers on each project too, that would be a useful statistic. And what about bugs? Maybe the number of bugs in the bugzilla database (if there is one) could be shown too, that would go some way to indicating stability. And if there is an issuezilla (like openoffice.org has) then that might say something about completeness? The severity rating of each bug would be useful too ... Using all this stuff in a clever way, you could really come up with a groovy stats page for each project perhaps. Hope these ideas are helpful! Gaz -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Aaron W. LaFramboise Sent: 28 October 2004 20:25 To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] uBLAS past, present, and future. Daniel L Elliott wrote: > I am trying to better understand the current status of the uBLAS library. > Below I have listed a few questions. Of course, any responses are > completely off the record. We just need to get a better idea of the > current state of uBLAS. Thank you, in advance, for any information you > provide. I don't have the answers to these questions, but to be honest, I wish that every library in Boost had answers to all of these questions up in front on the main page of their documentation. These are very important peices of information, and misunderstandings with regards to these issues in general has created a lot of problems in the past. Sometimes, it would just be nice to have an honest indication of project vitality. Aaron W. LaFramboise _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

Can't compile regex algorithm examples with MSVC++ 6 SP5
by Arno Schäfer 28 Oct '04

28 Oct '04

Hi all, try to compile and run all the regex algoritm examples lead by all examples to the same error (s. below). Has somebody an idea, what kind of define is missing or wrong? I try it with MSVC++ 6 SP5 on Windows 2000. thanks for any help, regards Arno switch on BOOST_REGEX_DIAG Compiling... Microsoft (R) 32-bit C/C++ Optimizing Compiler Version 12.00.8804 for 80x86 Copyright (C) Microsoft Corp 1984-1998. All rights reserved. cl /MDd /W3 /Gm /GR /GX /ZI /Od /I "..\Basics" /I "..\Basics\boost\include\boost - 1_31" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /Fo"Debug/" /Fd"Debug/" /F D /GZ /c LibraryTest.cpp LibraryTest.cpp Linking to lib file: libboost_regex-vc6-mt-gd-1_31.lib ..\basics\boost\include\boost-1_31\boost\regex\config.hpp(596) : warning C4003: not enough actual parameters for macro 'BOOST_DO_STRINGIZE' BOOST_REGEX_DECL set as: BOOST_REGEX_CALL set as: __cdecl BOOST_REGEX_CCALL set as: __cdecl Using Win32 locale in regex traits class Using Version 4 regex code ..\boost\include\boost-1_31\boost\regex\v4\regex_traits.hpp(955) : error C2039: 'mbstate_t' : is not a member of 'std' ..\basics\boost\include\boost-1_31\boost\regex\v4\char_regex_traits.hpp(34) : error C2504: 'regex_traits' : base class undefined ..\basics\boost\include\boost-1_31\boost\regex\v4\char_regex_traits.hpp (34) : see reference to class template instantiation 'deprecated::char_regex_traits_i<charT>' being compiled ..\basics\boost\include\boost-1_31\boost\regex\v4\char_regex_traits.hpp(34) : error C2143: syntax error : missing ',' before '<' ..\basics\boost\include\boost-1_31\boost\regex\v4\char_regex_traits.hpp (34) : see reference to class template instantiation 'deprecated::char_regex_traits_i<charT>' being compiled ..\basics\boost\include\boost-1_31\boost\regex\v4\char_regex_traits.hpp(34) : error C2059: syntax error : '<' ..\basics\boost\include\boost-1_31\boost\regex\v4\char_regex_traits.hpp (34) : see reference to class template instantiation 'deprecated::char_regex_traits_i<charT>' being compiled ..\basics\boost\include\boost-1_31\boost\regex\v4\char_regex_traits.hpp(75) : fatal error C1506: unrecoverable block scoping error Error executing cl.exe. LibraryTest.obj - 5 error(s), 1 warning(s)

2 3

RE: [Boost-users] Re: tcp/ip software
by Foster, Gareth 28 Oct '04

28 Oct '04

Sorry, I noticed after trawling further through my mail backlog that this had already been answered. -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Foster, Gareth Sent: 28 October 2004 09:41 To: 'boost-users(a)lists.boost.org' Subject: RE: [Boost-users] Re: tcp/ip software Is there a plan to get something like this into boost (just out of interest). -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Jeffrey Holle Sent: 25 October 2004 22:01 To: boost-users(a)lists.boost.org Subject: [Boost-users] Re: tcp/ip software I've used Rogue Wave's SourcePro Net product and found it clean and useful. In implementing a useful server, I also had to use their Threads product. Whatever you do, pay attention to boost.threads in implementing a TCP/IP using library! Greg Silverman wrote: > Since Boost does not have a library for TCP/IP, I was wondering what OO > interface to sockets is most popular with Boost users? > > Greg Silverman > Northrop Grumman > Sunnyvale, CA _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

RE: [Boost-users] Re: tcp/ip software
by Foster, Gareth 28 Oct '04

28 Oct '04

Is there a plan to get something like this into boost (just out of interest). -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Jeffrey Holle Sent: 25 October 2004 22:01 To: boost-users(a)lists.boost.org Subject: [Boost-users] Re: tcp/ip software I've used Rogue Wave's SourcePro Net product and found it clean and useful. In implementing a useful server, I also had to use their Threads product. Whatever you do, pay attention to boost.threads in implementing a TCP/IP using library! Greg Silverman wrote: > Since Boost does not have a library for TCP/IP, I was wondering what OO > interface to sockets is most popular with Boost users? > > Greg Silverman > Northrop Grumman > Sunnyvale, CA _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

Boost work-in-progress list?
by Eric Ocean 27 Oct '04

27 Oct '04

Is there a comprehensive list available on up-and-coming-but-not-yet-a-part-of-Boost libraries? The ones I'm currently aware of are very interesting, and I'd like to evaluate any others. Regards, Eric Ocean

2 1

About property maps and the Boost Graph module
by Ken Yasumoto-Nicolson 26 Oct '04

26 Oct '04

Hi folks, I've searched the archives and boost.org trying to find some help, but I still can't get my head around how the property maps are supposed to work. I'm pretty new to Boost, so I'm maybe not too familiar with the underlying concepts, etc, so forgive me if my question seems a little too basic! My problem is this: Given a directed graph with a single start and end point, I want for each node (vertex) to build a list of all the other nodes that can be reached from the current node. The algorithm is simple, I think: do a depth_first_search() and implement my code on dfs_visitor::finish_vector(). This skeleton I have done. However, the bit I can't get my head around is how to use property maps to collect the info. The key parts of my best effort so far are: struct statement_list_t { typedef boost::vertex_property_tag kind; }; typedef boost::property< statement_list_t, std::set<size_t> > StatementListProperty; typedef boost::adjacency_list< boost::vecS, boost::vecS, boost::bidirectionalS, StatementListProperty, boost::no_property > ADJ_GRAPH; struct connection_detector : public boost::dfs_visitor<> { public: connection_detector() {} template <class Vertex, class Graph> void finish_vertex(Vertex u, const Graph& g) { /* for each child in out_edges( u, g ) current node set = union_of( current, child ) */ } } However, my questions are: 1. std::set<size_t> - is the size_t the best type to store a reference to a vector in? 2. In finish_vertex<> (or other places) how do I address the StatementListProperty value for a given vertex? 3. How would I use an Exterior Property Map instead? Thanks for any advice! Ken

4 3

shared_ptr and shared_from_this
by Timothy Ritchey 26 Oct '04

26 Oct '04

I have an interpreter that uses a visitor pattern while performing a reduction of the program tree. As part of the visitor pattern, each class that can be a node in the tree must respond to: virtual void accept(Visitor& v); where each node then implements by calling visitor with itself using the proper type. The function calls in visitor are like: void visit(shared_ptr<Node> node); void visit(shared_ptr<Type> node); etc. (where Type is a descendant of node BTW). Normally with the visitor pattern (GOF style in this case), the implementation of accept is simply: void Node::accept(Visitor &v) { v.visit(this); } I've tried adding enable_shared_from_this<...> as a superclass of my nodes, and returning shared_from_this(), which works in some cases, but in others just seems to hang. These occur in classes that are a little more complex. For example, I have a TypeTemplate<T> class that wraps to underlying types TypeTemplate<int>, TypeTemplate<float>, TypeTemplate<etc>. I've tried adding enable_shared_from_this<TypeTemplate<T> >, and then having an implmentation void TypeTemplate<T>::accept(Visitor &v) { v.visit(enable_shared_from_this<TypeTemplate<T> >::shared_from_this()); } but it just hangs on both vc7.1 on windows and Xcode on OS X. (I had to add the extra scoping because I got complaints that "shared_from_this() was ambiguous in multiple inheritance.") I read in some past postings that the shared_from_this template doesn't work so well for complex class hierarchies, and I am wondering if I am running into that. I was thinking of putting my own internal_weak_ptr into the classes, but was confused by some of the examples I have seen. Most of them seem to reference a static function create() which instantiates the weak_ptr, and returns a shared_ptr<X>. When I consider my situation: shared_ptr<Node> aNode(new Node(...)); Visitor v; aNode->accept(v); How does the accept implementation return a shared_ptr that is linked with aNode? I've looked through the enable_shared_from_this implementation, and can't figure out how it is supposed to work. even if I return shared_from_this(), I'm not sure now that is linked to aNode. Does everything have to go through a factory like create()? Sorry for the long rambling e-mail. I hope it makes sense what I am trying to do. Cheers, tim

2 2

"nested" spirit grammars and semantic actions
by Tim Robertson 26 Oct '04

26 Oct '04

Hi, I'm looking for advice on ways to "nest" spirit grammars that use semantic actions. In the past, I have written a spirit grammar that parses 2-dimensional array data from a file, and puts the data into an array object of my choosing. To do this, the grammar defines a new functor (array_insert) and calls the functor whenever a new array element is parsed. The functor puts the element into a reference to the destination object, held within the grammar: struct array_grammar { array_grammar(MyMatrix & m) : _inserter(m) {} struct array_inserter { array_inserter(MyMatrix & m) : _m(m) {} // operator() defined here... MyMatrix & _m; } // ...the usual grammar components... array_inserter _inserter; }; This works, as expected. However, I now have to write a parser for a file containing a collection of 2D arrays, where each array is delimited by tags (say, "BEGIN" and "END"). I would like to push each array into a std::vector of MyMatrix objects. Thus, it would be nice if I could re-use the array_grammar, and write a grammar which uses it to parse each array in the larger file: struct multi_array_grammar { multi_array_grammar(std::vector<MyMatrix> & v) : _inserter(v) {} struct array_inserter { array_inserter(std::vector<MyMatrix> & v) : _v(v) {} // ... operator(), etc. std::vector<MyMatrix> & _v; }; template <typename ScannerT> struct definition { definition(multi_array_grammar const & self) { array_begin = str_p("BEGIN"); array_end = str_p("END"); // Problem: how to create array_grammar with correct reference? array_grammar array(???); r = array_begin >> +array >> array_end; } }; array_inserter _inserter; }; The problem is that I can't figure out how to instantiate an array_grammar (which requires a reference to the current MyMatrix object) in order to parse the individual arrays. I have solved this problem by creating a functor in multi_array_grammar which calls the parse function for array_grammar directly, but this seems ugly to me. Do any of you have a better way? -Tim

2 1

[FSM] Saving/Restoring the state_machine
by spooky＠go.ro 25 Oct '04

25 Oct '04

Is it possible to save the current state of the state machine to a stream or by means of boost::serialize? Details: I am building a state machine using boost::fsm that is trying to follow the activity of items in a processing pipeline. I am trying to implement a procedure that allows the software to be turned off and on again without loosing the information about the current state. Naturally, I want to have a timer and, at some interval I checkpoint the state machine and save the binary representation to a file. The contents of the file are used during application startup to restore the state machine. Can I achieve this functionality with boost::fsm? Best regards, Emil Mieilica

2 1