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

Regex Problems
by Pietje Leugenaar 21 Jul '04

21 Jul '04

Hi, compiling "a{7}" or any repeat with curly brackets gives me an "invalid regex synyax"! Any clues or workarounds? Then boost::regex expression("GO:(\d+)",regex::bk_refs); string str=boost::regex_replace("GO:000015|GO:00016",expression,"$1") str equals "00001500015|00016" instead of the expected "000015|00016"!? I constructed a workaround for the latter problem with an explicit loop over regex_iterator and such but this not really handy... Thanx for any feedback!! Kenny _________________________________________________________________ Plannen om een nieuwe computer te kopen? Kijk eens hier.. http://www.msn.be/shopping/dell_bis/

2 1

database lib
by Chris 21 Jul '04

21 Jul '04

Hi all, I am wondering if there are any plans to include a database library, for example for ODBC in the boost library. Please bear in mind that I am new to the boost libraries and find them really cool. But like the socket library I found it because of an old post, so that is why I am asking about the database library. Also I found this library really interesting and am using it in a couple of small spike solutions: http://dtemplatelib.sourceforge.net/index.htm (Any comments on the library are welcome) Thanks, Chris

3 2

View the shortest paths
by Daniele Carlucci 20 Jul '04

20 Jul '04

Hi, Which is the command to visualize a path in a graph? For ie I want to visualize all the shortest path inside a graph, or all the path from a source to a dest. Thanks Daniele

5 10

Info about a graph with structure instead node
by Daniele Carlucci 20 Jul '04

20 Jul '04

Hi all, I'm a newby in this library. I'm interested to make a graph of network. It's possible or is very hard to make? I want to have inside every node a struct. Thanks Daniele

2 5

Problems with building filesystem under win32 using vc6 and stlport
by huangliang 20 Jul '04

20 Jul '04

Recently I begin to use stlport in my programs, and I build boost filesystem under win32 using bjam, vc6 and stlport 5.0. But when I linke to the libfilesystem.lib, the error said that that the libsystem.lib doesn't consist of interfaces that have parameters of _STL::string type. I guess I must have not correctly configure the bjam to build filesystem. But how can I make it to recognize _STL namespace?

2 1

using DFS visitors
by Gustavo Sÿffffe1nchez 20 Jul '04

20 Jul '04

hello all, we are trying to use a DFS visitor in a similar way as the BFS visitor which is used in the example "bfs.cpp" (boost 1.31.0), that is the code, but it complains about a lot of errors in the internal boost library files... #include <boost/config.hpp> #include <assert.h> #include <vector> #include <algorithm> #include <utility> #include <iostream> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/depth_first_search.hpp> #include <boost/graph/visitors.hpp> #include <boost/property_map.hpp> #include <boost/graph/graph_utility.hpp> using namespace boost; using namespace std; // visitor que muestra el orden en que se encuentran los arcos template <class NewGraph, class Tag> struct muestra_orden : public boost::base_visitor<muestra_orden<NewGraph, Tag> > { typedef Tag event_filter; muestra_orden(NewGraph& graph) : new_g(graph) { } template <class Edge, class Graph> void operator()(Edge e, Graph& g) { cout << "arco: " << e << endl; } private: NewGraph& new_g; }; template <class NewGraph, class Tag> inline muestra_orden<NewGraph, Tag> MuestraOrden(NewGraph& g, Tag) { return muestra_orden<NewGraph, Tag>(g); } //**************************************************************************+ template <class NewGraph, class Tag> struct muestra_ordenV : public boost::base_visitor<muestra_ordenV<NewGraph, Tag> > { typedef Tag event_filter; muestra_ordenV(NewGraph& graph) : new_g(graph) { } template <class Vertex, class Graph> void operator()(Vertex v, Graph& g) { cout << "ARCO: " << v << endl; } private: NewGraph& new_g; }; template <class NewGraph, class Tag> inline muestra_ordenV<NewGraph, Tag> MuestraOrdenV(NewGraph& g, Tag) { return muestra_ordenV<NewGraph, Tag>(g); } /********************************************************/ int main(int , char* []) { using namespace boost; typedef boost::adjacency_list< boost::mapS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_in_degree_t, int, boost::property<boost::vertex_out_degree_t, int> > > > > Graph; Graph G(11); boost::add_edge(5, 6, G); boost::add_edge(0, 1, G); // 0 es el + boost::add_edge(1, 2, G); boost::add_edge(1, 3, G); boost::add_edge(2, 4, G); boost::add_edge(3, 5, G); boost::add_edge(4, 6, G); boost::add_edge(5, 7, G); // 7 es el - boost::add_edge(5, 10, G); boost::add_edge(10, 11, G); boost::add_edge(11, 12, G); typedef graph_traits<Graph>::vertex_descriptor Vertex; typedef graph_traits<Graph>::vertices_size_type size_type; Graph G_copy(11); size_type d[11]; std::vector<Vertex> p(num_vertices(G)); std::fill_n(d,11,0); Vertex s=7; p[s]=s; boost::depth_first_search (G, visitor(boost::make_dfs_visitor( std::make_pair(boost::record_predecessors(&p[0],boost::on_tree_edge()), std::make_pair(MuestraOrdenV(G_copy,boost::on_finish_vertex()), MuestraOrden(G_copy, boost::on_tree_edge())))) ), s); // we can compile the visitor(...) clause alone, but not inside depth_first_search (...) clause. return 0; } thanks a lot Gus --------------------------------- [input] [input] [input]

1 0

Dependency of Boost library on STD namespace
by anas munir 19 Jul '04

19 Jul '04

Dear users, I am trying to port Boost Library with Microtec Toolkit. Is it possible to build Boost Library without Standard C++ RTL placed in std namespace ? If yes, then please guide me to the mechanism to do so. Like in STLport, this thing is configurable. Regards, Anas

2 1

Re: [Boost-users] serialization of a complex object
by Bo Peng 19 Jul '04

19 Jul '04

On Mon, Jul 19, 2004 at 05:08:02AM -0700, Jeff Garland wrote: > There are still some open issues with getting all the serialization tests > working. Thanks. I should have checked this before I used the library.... this cost me several hours of painful debugging. :-( Bo

1 0

serialization of a complex object
by Bo Peng 19 Jul '04

19 Jul '04

Dear list, I have tried many ways but could not figure out how to boost::serialize the following object: Basically, to maintain a big chunk of small objects, I use a memory pool to allocate a big trunk of memory and return the pointers to small objects. struct small { int size; int * ptr; init(int s, int* p){ size = s; ptr = p; } } struct All { vector<int> data; vector<small> objs; All(int num_obj, int size_obj) { data.resize( num_obj * size_obj); for(int i=0; i<num_obj; i++) objs[i].init( size_obj, &data[i* size_obj]); } } It is easy to serialize All::data but how to deal with small::ptr is beyond me. I tried the following ways: 1. in small ar & size & ptr. --- template expansion error. 2. in small ar & size & reinterpret_cast<unsigned int>ptr --- core dump. What I am trying to do in 2 is that in load(....), I want to ar & objs; /// get the number of old pointer back. find the smallest number of objs[i].ptr relocate objs[i].ptr to &data[0] + objs[i].ptr - smallest point. However, I can not do this in the load(...) function. The template expansion does not allow changes to objs (this does not make sense to me though). 3. ignore ptr --- can compile, core dump. Can someone give me a bit of insights how I can make things work? Thanks.

2 3

RE: [Boost-users] Re: shared_ptr: LWM versus atomic_count?
by Ben Hutchings 19 Jul '04

19 Jul '04

Russell Hind <rhind(a)mac.com> wrote: > Ben Hutchings wrote: > > > > It isn't fundamentally necessary to have two counters, though; see > > <http://groups.google.com/groups?threadm=slrnbhbnpc.154.do-not-spam > > -benh%40tin.bwsint.com>. > > I'd seen this (I think you posted the same link recently). I don't > know if anything has been done to change the implementation of > shared_ptr to use this method, though (nothing to do with me). The difficulty is that it depends on a couple of unportable atomic functions that can't be implemented using the existing contents of Boost.Threads or pthreads (though they do translate neatly into Win32 functions). > If the speed increases mentioned are correct, then it certinaly > seems a good proposal. Well maybe I'll have a go at implementing it properly and then trying to get it into Boost. I suppose it can be selectively enabled for those platforms that support it.

1 0