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

regex feature request:)
by Serge Skorokhodov 19 May '05

19 May '05

Hi, boost::regex documentation runs "... embarrassments / limitations will be removed in due course, mainly dependent upon user demand ...". I just wote for zero-length lookbehind "(?<=pattern)" implementation. TIA -- Serge

2 1

pimpl and Qt
by Filipe Sousa 19 May '05

19 May '05

Hi! I'm having trouble implementing Pimpl idiom with Qt. Look at the following code: class IndispFilterWidget : public QHBox { Q_OBJECT public: IndispFilterWidget(QWidget* parent = 0); private: struct Private; boost::scoped_ptr<Private> d; }; struct IndispFilterWidget::Private { QIntDict<BrushButton> buttons; }; IndispFilterWidget::IndispFilterWidget(QWidget* parent) : QHBox(parent) , d(new Private) { } and see the error: /usr/include/boost/… [View More]

3 5

RE: [Boost-users] Using Boost with Tandem
by Kick Damien-DKICK1 19 May '05

19 May '05

John Maddock [john(a)johnmaddock.co.uk] wrote: > Damien Kick wrote: > > I was able to find one e-mail in the archives asking about using > > Boost on Tandem but I was unable to find a reply. Not a good sign > > <smile>. I currently find myself using the Tandem Development > > Suite cross compiler for Windows version G06.15 with Cygwin and I > > hoping I can use Boost, too. Any help? > What's the compiler? All I could find on the web was a … [View More]

2 1

Re: pimpl and Qt
by gruenedd＠idmt.fraunhofer.de 19 May '05

19 May '05

> private: > struct Private; > boost::scoped_ptr<Private> d; > }; When working with Qt, i suggest to write the Pimpl idiom like this, since the generated code from moc needs access to your FooPrivate, in cases. struct FooPrivate; class Foo { private: FooPrivate* pimpl_; }; --David

2 1

boost.graph determining if one graph is a subgraph of another
by Alex Helder 19 May '05

19 May '05

Hello: If I have two graphs, G = ( E, V) G' = ( E', V' ) what would be the most efficient way, using BGL, to determine whether G' is a subgraph of G?. I'm not interested in 'isomorphic' subgraphs. Of course, if G' is a subset of G, then E' is a subset of E and V' is a subset of V. I guess I could iterate over all the edge and vertex descriptors for both graphs ... but I was wondering if there was another way. I'm not experienced with graph theory (if that isn't obvious by now!) Thanks -Alex

2 1

[BGL] Segmentation fault in add_vertex
by Martin Magnusson 19 May '05

19 May '05

I am sometimes getting segmentation faults (using gcc 3.3.4 under Cygwin) in calls to add_vertex( g ), where g is of the following type: boost::adjacency_list < boost::setS, boost::vecS, boost::undirectedS, Vertex_Properties, Edge_Length > This happens when I try to merge two graphs with repeated calls to add_vertex (not updating edges or anything, just adding new vertices), and usually when the returned index from add_vertex is around 40000-50000, … [View More]

2 1

How to get BGL compiled with VC2005?
by sr kumar 19 May '05

19 May '05

Hi, I am attempting to compile Boost with VC2005. All goes well, with the exception of the Boost Graph library. The compiler errors at the bottom of the email. flex and bison from http://gnuwin32.sourceforge.net/ The problems seem to be the unistd.h which is missing on Win32. I played around with setting YY_NO_UNISTD_H in the Jamfile and the header files themselves. However, I'm not an expert (and have obviously been unsuccessful!). Would appreciate any help in figuring how to work … [View More]around the problem. thanks, -sr _______________________________________ bison.bison ..\..\..\bin.v2\libs\graph\build\msvc-8.0\debug\graphviz_graph_parser.cpp ..\..\..\bin.v 2\libs\graph\build\msvc-8.0\debug\graphviz_graph_parser.hpp ..\..\..\libs\graph\src\graphviz_parser.yy: conflicts: 1 shift/reduce bison.bison ..\..\..\bin.v2\libs\graph\build\msvc-8.0\debug\graphviz_digraph_parser.cpp ..\..\..\bin .v2\libs\graph\build\msvc-8.0\debug\graphviz_digraph_parser.hpp ..\..\..\libs\graph\src\graphviz_parser.yy: conflicts: 1 shift/reduce msvc.compile.c++ ..\..\..\bin.v2\libs\graph\build\msvc-8.0\debug\graphviz_graph_lex.obj graphviz_graph_lex.cpp ..\..\..\bin.v2\libs\graph\build\msvc-8.0\debug\graphviz_graph_lex.cpp(43) : fatal error C1083: Cann ot open include file: 'unistd.h': No such file or directory call "C:\Program Files\Microsoft\Visual Studio 8\VC\bin\vcvars32.bat" > nul cl /Zm800 -nologo -TP -DBOOST_ALL_NO_LIB=1 -DGRAPHVIZ_DIRECTED=0 -DYY_NO_UNISTD_H /Z7 /Od /Ob0 /E Hsc /GR /MDd -I"..\..\..\libs\graph\src" -I"C:\bugsnoop\trunk\src\checkmate\boost" -I"..\..\..\bin .v2\libs\graph\build\msvc-8.0\debug" -c -Fo"..\..\..\bin.v2\libs\graph\build\msvc-8.0\debug\graphvi z_graph_lex.obj" "..\..\..\bin.v2\libs\graph\build\msvc-8.0\debug\graphviz_graph_lex.cpp" ...failed msvc.compile.c++ ..\..\..\bin.v2\libs\graph\build\msvc-8.0\debug\graphviz_graph_lex.obj... lex.lex ..\..\..\bin.v2\libs\graph\build\msvc-8.0\debug\graphviz_digraph_lex.cpp msvc.compile.c++ ..\..\..\bin.v2\libs\graph\build\msvc-8.0\debug\graphviz_digraph_lex.obj graphviz_digraph_lex.cpp ..\..\..\bin.v2\libs\graph\build\msvc-8.0\debug\graphviz_digraph_lex.cpp(43) : fatal error C1083: Ca nnot open include file: 'unistd.h': No such file or directory call "C:\Program Files\Microsoft\Visual Studio 8\VC\bin\vcvars32.bat" > nul cl /Zm800 -nologo -TP -DBOOST_ALL_NO_LIB=1 -DGRAPHVIZ_DIRECTED=1 -DYY_NO_UNISTD_H /Z7 /Od /Ob0 /E Hsc /GR /MDd -I"..\..\..\libs\graph\src" -I"C:\bugsnoop\trunk\src\checkmate\boost" -I"..\..\..\bin .v2\libs\graph\build\msvc-8.0\debug" -c -Fo"..\..\..\bin.v2\libs\graph\build\msvc-8.0\debug\graphvi z_digraph_lex.obj" "..\..\..\bin.v2\libs\graph\build\msvc-8.0\debug\graphviz_digraph_lex.cpp" ...failed msvc.compile.c++ ..\..\..\bin.v2\libs\graph\build\msvc-8.0\debug\graphviz_digraph_lex.obj. ___________________________ [View Less]

2 1

BGL question: edge order
by Andreas Fabri 19 May '05

19 May '05

Hello, in order to store planar graphs, I am wondering if the graph classes of the BGL allow to enforce an order of the edges which are adjacent to a vertex. Also is it possible to add an edge between two edges. andreas

2 1

BGL: copy graph & edge predicate question
by Sebastian Weber 19 May '05

19 May '05

Hello Everybody! I am trying to extract a part of a graph. Speaking in terms of the BGL, I do a copy from a filtered graph object into a new graph. To do so, I defined a VerticePredicate for the filtered graph. As a result not all vertices in the graph are present in the filtered version. This implies that some edges do disappear in the filtered version fo the graph. In order to copy from this filtered graph into a new, fresh graph via copy, do I have to use the following EdgePredicate? // … [View More]

2 1

Question about template optimization
by Elisha Berns 19 May '05

19 May '05

I need help with this one, even though it's a pure C++ question, it's about template optimization: If a template class has methods that DO NOT depend on or use the type parameter(s) of the template will the code for the methods nevertheless get instantiated separately for each unique instance of the template class? For example, if there are 20 unique types used to declare 20 instances of template class X, do those methods get implemented 20 different times, needlessly, and cause a big code … [View More]

1 0