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

multi_array View vs. Subarray
by Kevin Bluck 15 Nov '04

15 Nov '04

With regard to boost::multi_array: Please, will somebody explain the difference between a View and a Subarray? I have read both the user and reference documentation, and can't find anything that indicates to me when you would use one over the other. So far as I can tell, they are essentially identical in purpose. Thanks, --- Kevin

2 1

boost bind question, can it create a functor with more arguments than needed
by gast 128 15 Nov '04

15 Nov '04

Dear all, Probably this is something one does not encounter often, but I have here an interface which expects more arguments than needed, e.g.: void SomeInterface(boost::function<void (Arg1, Arg2)> fcCallback) {} now I have another functor like: boost::function<void (Arg1)> fc; I want fc apply to SomeInterface, and it only needs to fill in argument1. So I need something like boost::bind(fc, _1, _2) to get it compilable for SomeInterface, only bind now thinks that fc has a prototype of two arguments. Is there a way to tell bind to ignore argument2 (without explicit write a functor)? wkr, me _________________________________________________________________ MSN Search, for accurate results! http://search.msn.nl

3 2

boost::xtime nsec ?
by Leon Mergen 15 Nov '04

15 Nov '04

Hello, Little quick question, it isn't documented anywhere : The struct boost::xtime has a member called 'nsec' - what amount of time is this ? Thanks in advance! Leon Mergen

3 3

Can you use a template class to store data in a vertex of a boost graph?
by Stephen torri 15 Nov '04

15 Nov '04

Has anyone used a template class to store information in a vertex of a boost graph? I am looking for a way in which to store a variety of data types in a boost graph. So that if a sample class like following: template <typename T> class Data { ... }; It can be used to data such that a Data<int> and a Data<float> can be stored at a vertex in the graph. Is what I desire possible? Stephen

3 6

Re: [Boost-users] Newbie install on Mac: where are graph
by Mike Fuller 14 Nov '04

14 Nov '04

John Maddock wrote: > The Boost Graph library consists of headers only, there are no separate > sources to compile, and hence no libraries to install for it, and Meredith Patterson wrote: > Take a look in /usr/local/include/graph -- you should see a wealth of > header files, comprising the entire BGL. It's like the STL that way. Ahhhh! Thank you very much! Mike > Mike Fuller wrote: >> Is the graph library not installed as part of the standard >> installation? Perhaps the problem is related to boost_python? Or are >> they installed somewhere else? Is there a separate procedure I'm >> missing?

1 0

Newbie install on Mac: where are graph libs?
by Mike Fuller 14 Nov '04

14 Nov '04

I 'm having trouble installing the Boost graph libraries (release: boost_1_31_0) on my Macintosh laptop. I'm running Mac OS 10.3.6 on an iBook G4 (933 MHz), with 640 MB SDRAM and a 60 GB drive. gcc version 3.3 20030304 (Apple Computer, Inc. build 1666). Darwin Kernel Version 7.6.0. I followed the installation instructions provided in the html document: Getting Started (http://www.boost.org/more/getting_started.html) The procedure seemed to work smoothly: * The build script for Boost.Jam properly recognized the "darwin" toolset. * The command: bjam "-sTOOLS=gcc" install properly initiated the install script. * boost_python was not installed, but I didn't see this as a big deal since I don't use Python. However, when the build was complete, I could not locate the Boost graph libraries. I could only find eight types of Boost libraries in /usr/local/lib. (For each type, there are eight associated libraries, as is described in Getting Started.) I do not see the graph libraries. The boost libraries found after the build in /usr/local/lib include static and dynamic forms of: libboost_date_time-1_31 libboost_filesystem-1_31 libboost_prg_exec_monitor-1_31 libboost_regex-1_31 libboost_signals-1_31 libboost_test_exec_monitor-1_31 libboost_thread-1_31 libboost_unit_test_framework-1_31 Is the graph library not installed as part of the standard installation? Perhaps the problem is related to boost_python? Or are they installed somewhere else? Is there a separate procedure I'm missing? Thanks. I am not a UNIX super-user, and I don't have a lot of experience installing libraries. Please reply to mmfuller(a)tiem.utk.edu. Mike Fuller ____________________________________ Department of Ecology & Evolutionary Biology University of Tennessee, Knoxville

5 4

compact matrix/dense vector product
by Daniel L Elliott 13 Nov '04

13 Nov '04

Hello, I am using the CVS Head version of uBLAS from approximately one month ago with gcc. I get a ton of errors when trying to multiply a dense vector by a compact matrix. This is what my code looks like: la::compressed_matrix<int>* permutationMatrix; template<class T> void Permutation::apply(la::vector<T>& dataPoint){ dataPoint = prod(*permutationMatrix,dataPoint); } What, conceptually, am I doing wrong? If asked, I will happily provide more information. For now, I am trying to keep this email to a reasonable size. Thank you, -- dan ************************** Dan Elliott 402-210-6429 (me) or 402-210-6735 (amy) dan_elliott(a)cox.net **************************

1 0

boost::function and equality operators?
by Alo Sarv 12 Nov '04

12 Nov '04

Hi I was just transforming my event engine from another callback functors lib to boost::function, and discovered that boost::function has explicitly forbidden operator== and operator!=. My question is why is this done, and what could be possible workarounds? Thanks in advance, Alo Sarv. Example: #include <boost/function.hpp> #include <cassert> void foo() {} void bar() {} int main() { // won't compile if these are used in the below asserts // boost::function<void()> f(&foo); // boost::function<void()> g(&bar); // boost::function<void()> h(&foo); // works with raw function pointers void (*f)() = &foo; void (*g)() = &bar; void (*h)() = &foo; assert(f == h); assert(f != g); assert(g != h); }

1 0

New trouble compiling with MS VC6 SP5 and MFC/AFX
by Arno Schäfer 12 Nov '04

12 Nov '04

Hi, if I want use the boost libs in an existing MFC/AFX environment I have a lot of compiling problems, what seems to depend on the order of includes. One problem what I see, but I don't understand, is the following compile error: 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 /GR /GX /Zi /Od /I ...bunch of includes... /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /D "_SECDLL" /D "_AFXDLL" /D "_ MBCS" /D "_GXDLL" /D "NOMINMAX" /D "_SECNOMSG" /D "_GXNOMSG" /D "_SFLNOMSG" /Fp" D:\temp\debug\GUIClient/Plato.pch" /YX"stdafx.h" /Fo"D:\temp\debug\GUIClient/" / Fd"D:\temp\debug\GUIClient/" /FD /Zm200 /GZ /c "F:\Gui+Client\src\AboutDlg.cpp" AboutDlg.cpp Note: Using precompiled header Automatically linking with RWUXThemeSD.lib ..\..\PlatoServer\Basics\boost\inc\boost/detail/iterator.hpp(326) : error C2039: 'difference_type' : is not a member of 'Iterator' ..\..\..\libs\stingray\objective_studio\include\foundation\Patterns\Iter ator.h(77) : see declaration of 'Iterator' ..\..\PlatoServer\Basics\boost\inc\boost/detail/iterator.hpp(331) : see reference to class template instantiation 'boost::detail::standard_iterator_traits<Iterator>' being compiled ... So it looks like, that the template parameter "Iterator" in "boost::detail::standard_iterator_traits<Iterator>" conflicts with the template class "stingray::foundation::Iterator" in some header files from the GUI control stuff, what was included before the boost header. How is this possible, what has the template parameter "Iterator" in the namespace "boost::detail" to do with the template class "Iterator" in the namespace "stingray::foundation" has anybody an explaination for this? regards Arno

3 3

[boost][boost-users][random] Open bugs
by Cromwell Enage 12 Nov '04

12 Nov '04

Any chance that any of the following bug reports will be resolved before the release? <http://sourceforge.net/tracker/index.php?func=detail&aid=911758&group_id=75…> <http://sourceforge.net/tracker/index.php?func=detail&aid=715667&group_id=75…> <http://sourceforge.net/tracker/index.php?func=detail&aid=652567&group_id=75…> TIA! Cromwell Enage __________________________________ Do you Yahoo!? Check out the new Yahoo! Front Page. www.yahoo.com

5 6

Some trouble with "regex_replace()"
by Arno Schäfer 12 Nov '04

12 Nov '04

Hi all, Using "regex_replace(string, pattern, replace_string, flags)" I got some unwished results. I can't find out what flag set I have to use, that the replacement string was taken, as it is. I think this short example should make my problem clear: Replace in a string all occurences of PATH through the actual windows directory: "Actual path: 'PATH'" with Path "D:\temp\rest" leads to the string: "Actual Path: 'D: emp est'" This show, that "\t" and "\r" was interpreted. For me that is an unexspected behaviour, because the replacement is just some string, not more. I understand that the pattern will be interpreted and controlled over the flags, but why the replacement string? Can somebody explain that behaviour and show me a way out? regards Arno

3 9

Re: [ANN] Format Lite
by Jonathan D. Turkanis 12 Nov '04

12 Nov '04

"Pavel Vozenilek" <pavel_vozenilek(a)hotmail.com> wrote in message news:cn0l08$cul$1@sea.gmane.org... > > "Jonathan Turkanis" wrote: > > > > // specialization for debug formatting > > > template<> > > > void serialize<formatted_text_oarchive>(....) { > > > > I believe this specialization is illegal. You could write > > > > void serialize(formatted_text_oarchive&ar, const unsigned) > > > > but I can't say whether this will work (I seem to remember Robert saying > > somewhere in the documentation that he was relying on the fact that > > non-templates are better matches than templates.) > > > Yes, this (nontemplated overloaded function) will work. > I just wrote down an idea in haste. > > > > I have two separate ideas for formatting libraries: > > > > - one lightweight, which I posted, for input and output of ranges and > > tuples-like objects > > - one for output only, which allows much more customization; I see this as > > an inverse of Spirit > > > > Your suggestion looks similar to the second (except that you want to > > support input), so let me sketch my idea (which has improved since I > > sketched it here last time), and then ask some questions about yours. > > > Formatted input would be optional (and maybe not practical). > > I do not understand what are avantages of the "lightweight" > approach (except compile time). The aim of Format Lite was to present a facility which would be a candidate for standardization, filling a need that was expressed at the most recent library working group meeting. Towards this end, 1. I tried to keep the implementation as small as possible 2. I introduced just one new function template -- punctuate() -- in the public interface 3. I used the same syntax currently recommended for formatting user-defined types (overloading iostreams operators >> and <<) 4. I introduced no new class templates in the public interface 5. I introduced no new concepts. (Strictly speaking, I use Single Pass Range and Extensible Range, but these could be replaced by the standard library container concepts.) If people like the interface (and so far there's not much evidence), I think Format Lite would stand a reasonable chance of making it into TR2. To get Serialization standardized would require a much bigger push, IMO, although I'd like to see it happen -- perhaps with additional language support. > Is switch between lightweight and heavyweight solution easy? Yes, since formatting with Format Lite would still be the default when a Style provides no specific formatting options for a given range or tuple-like type. In the following vector< string > v = list_of( ... ); ostream out; styled_ostream<cajun_style> cajun_out(out); cajun_out << v; If none of the Styles or Formatters associated with cajun_style knows how to format a vector, cajun_out will delegate formatting to the underlying ostream out, which will use the operator<< from Format Lite. > [snip] > > The advantages of this approach are: > > > > - an arbitrary amount of contextual information, such as indentation > > and numbering, can be stored in the styled_stream and accessed directly > > by formatters > > - arbitrary user-defined types can be formatted non-intrusively > > - flexible formatting is built-in for sequences and tuple-like types (and > > user-defined types can choose to present themselves as sequences or > > tuple-like types to take advantage of this feature.) > > > I feel having formatting descendant of boost::archive stream > could be made with the same features. Good. > > > The advantages I see: > > > - the whole infrastructure of Boost.Serialization is available and > > > ready and it handles all situations like cycles. format_lite could > concentrate on just formatting. > > > > This is a big plus, obviously. (However, I remember Robert saying her > > prefered to keep formatting and serialization separate.) > > > Formatting, as I see it would just use Serialization as > infrastructure. There would be no inpact on Serialization > from Formatting. You mean no changes to the library code -- we would just define additional archive concepts and types? > > > - formatting directives can be "inherited" from > > > "higher level of data" to "lower levels". Newly added data would > > > not need formatting of its own by default. Change on higher level > > > would propagate itself "down". > > > > Can you explain how this works? > > > I mean trick with RAII (its not really Serialization feature): > > void serialize(formatting_archive& ar, const unsigned) > { > // change currently used formatting style > formatting_setter raii(ar, "... formattng directives...") > ar & data; <<== new formatting style will be used > // destructor of raii object will revert formatting back > } I see. I think this is a characteristic of all schemes where stylistic info is stored in the stream or stream-like object. > > > - indentation for pretty printing could be handled (semi)automatically > > > by formatting archive. > > > > Would this involve modifying the archive interface? I'd like a formatter > > for a given type (or an overloaded serialize function) to be able to access > > these properties directly. > > > Yes, formatting archive could have any additional interface. I see. But no changes to existing archive types. > > > - multiple formatting styles could be provided for any class. > > > > It would be one formatting style for each archive type for which serialize > > has been specialized, correct? Would this allow styles for various types to be > > mixed freely? > > > Yes, serialize() function would be specialized. What I meant to ask can be illustrated by an example. Suppose you have two classes, Duck and Goose. Duck and Goose each have two associated formatting styles. The choice of styles should be independent, so we would need four archive types to handle the various combinations. Now my question is: would Duck need four specializations of serialize, or just two? In my system, formatting options for Duck and Goose could be added to a Style independently; I want to know if overloading serialize can handle this. > I see three ways to customize output: > > 1. Formatting archive has its own configuration how > to output data. This keeps overall style coherent > and should be enough for most uses. > > 2. Specialization of serialize() could change > formatting style. This may be used to fine > tune the output here or there. > > 3. Specializations of serialize() may generate > different outputs altogether. > > E.g. if you have archives: > class high_level_formatting_archive {...} > class all_details_formatting_archive { ... } > > you can omit details in > > void serialize(high_level_formatting_archive& ar, const unsigned); > > and use them all in > > void serialize(all_details_formatting_archive& ar, const unsigned); > > I think this (option 3) is not possible now with format_lite. In fact, it only supports 1. That's part of what makes it 'lite'. If a class already provides standard library inserters and extractors (corresponding to 2, above), those provided by Format Lite will not be called. I have a couple of questions: 1. Is your idea flexible enough to allow pairs (a,b) to be formatted with the elements in reverse order? 2. If a type defines a member function serialize, can it be bypassed altogether in favor of an end-user supplied formatting style? > > My inclination is to > > keep formatting separate from serialization, though, because they have different > > aims. If you believe they can be integrated, without making serialization harder > > to learn or sacrifying flexibility of formatting options, it should definitely be > > considered. > I see Serialization as just vehicle, ready and handy and almost > invisible to Formatting users. > Simple data structures are very easy with Serialization and should > be as easy as with format_lite now. > If user tries to format tricky structures (e.g. pImpl) he would need > to dig into Serialization docs but at least there will be chance to > make the whole thing work. The Serialization goes to great lengths > to work under any situation and configuration. This sounds quite reasonable, provided it is sufficiently flexible. I wonder how much of the Serialization infrastructure is really needed, though. Detecting cycles is defintely not something I want to reimplement; OTOH, I'm not sure it's needed for pretty-printing. I haven't looked at the Serialization implementation, but I did read the Java serialization specification several years ago. IIRC, when an object was encountered for the second time, some sort of placeholder would be inserted in the stream referencing the already serialized data. I assume the Serialization library does something like this. Would this really be desirable for human-readable output? Perhaps the formatting library should concern itself only with cycle-free data structures. > /Pavel Jonathan

1 0

Re: Re: boost graph library bugs
by qyang＠cs.ucr.edu 11 Nov '04

11 Nov '04

>> >Below is a list of bugs (at least I think so) in boost graph library: >> > >> >... >> > >> >I found the above problems when I tried to create subgraphs for each >> >component in the graph when the number of components was large. > > > >> It always helps to identify the compiler and it's version number, the >> operating system, and to indicate the version of the Boost code (or CVS, >> if that was the source.) > > > Hi, > > The compiler is: > g++ (GCC) 3.3.3 20040412 (Red Hat Linux 3.3.3-7) > > The OS is: > Linux version 2.6.7-1.494.2.2 > (Fedora Core release 2 (Tettnang)) > > The boost code (I think) is: > boost_1_31_0 > (I will update this one once I have the reply from system administrator) > Hi, The boost code version is: boost-1.31.0-7 boost-devel-1.31.0-7 Qiaofeng

1 0

lambda lib (1.31) and MSDEV 6.0
by Martin Lemieux 11 Nov '04

11 Nov '04

When compiling a sample file, the compiler crashed at line: #include <boost\lambda\lambda.hpp> The message is as follow: test.cpp c:\boost\include\boost-1_31\boost\lambda\detail\lambda_fwd.hpp(31): fatal error C1001: INTERNAL COMPILER ERROR (compiler file 'msc1.cpp', line 1794) Please choose the Technical Support command on the Visual C++ Help menu, or open the Technical Support help file for more information Error executing cl.exe. Although I did build the complete boost library with the same compiler, I was surprised not to be able to use the lambda lib in a simple application. Did this happen to any of you? Did you find any solution or alternative? Thank you.

1 0

[boost-users][BGL] prim_minimum_spanning_tree
by Cromwell Enage 11 Nov '04

11 Nov '04

According to the source, all variants of the function template take in a const reference to Graph, but the docs state that the non-named-parameter variant takes in a regular Graph reference. There is also no mention of the two-parameter variant that takes in only a const Graph& and an output PredecessorMap. Is this a documentation bug? Cromwell Enage __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

newbie: graph library support vertex with x, y coordinates
by TC MA 11 Nov '04

11 Nov '04

This is a newbie question. Do boost graph library support an vertex with x, y coordinates? i.e. typedef std::pair<int, int> Vertex; I modify the dijkstra-example.cpp sample program in the libs/graph/example directory but it fails to compile. // new dijkstra-example.cpp int main(int, char *[]) { typedef adjacency_list < listS, vecS, directedS, no_property, property < edge_weight_t, int > > graph_t; typedef graph_traits < graph_t >::vertex_descriptor vertex_descriptor; typedef graph_traits < graph_t >::edge_descriptor edge_descriptor; typedef std::pair<int, int> Vertex; typedef std::pair<Vertex, Vertex> Edge; const int num_nodes = 5; enum nodes { A, B, C, D, E }; char name[] = "ABCDE"; Vertex a = Vertex(0, 0); Vertex b = Vertex(1, 2); Vertex c = Vertex(2, 2); Edge edge_array[] = { Edge(a, b), Edge(a, c) }; int weights[] = { 1, 200 }; int num_arcs = sizeof(edge_array) / sizeof(Edge); graph_t g(edge_array, edge_array + num_arcs, weights, num_nodes); property_map<graph_t, edge_weight_t>::type weightmap = get(edge_weight, g); std::vector<vertex_descriptor> p(num_vertices(g)); std::vector<int> d(num_vertices(g)); vertex_descriptor s = vertex(A, g); dijkstra_shortest_paths(g, s, predecessor_map(&p[0]).distance_map(&d[0])); std::cout << "distances and parents:" << std::endl; graph_traits < graph_t >::vertex_iterator vi, vend; for (tie(vi, vend) = vertices(g); vi != vend; ++vi) { std::cout << "distance(" << name[*vi] << ") = " << d[*vi] << ", "; std::cout << "parent(" << name[*vi] << ") = " << name[p[*vi]] << std:: endl; } std::cout << std::endl; return EXIT_SUCCESS; } // compile output is: bjam ...found 518 targets... ...updating 4 targets... gcc-C++-action /home/tcma/cpp/boosttcma/libs/graph/dijkstra-example.test/gcc/debug/inlining-on/dijkstra-example.o /home/tcma/cpp/boost_1_31_0/boost/graph/detail/adjacency_list.hpp: In constructor `boost::vec_adj_list_impl<Graph, Config, Base>::vec_adj_list_impl(typename Config::vertices_size_type, EdgeIterator, EdgeIterator, EdgePropertyIterator) [with EdgeIterator = main(int, char**)::Edge*, EdgePropertyIterator = int*, Graph = boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, int, boost::no_property>, boost::no_property, boost::listS>, Config = boost::detail::adj_list_gen<boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, int, boost::no_property>, boost::no_property, boost::listS>, boost::vecS, boost::listS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, int, boost::no_property>, boost::no_property, boost::listS>::config, Base = boost::directed_graph_helper<boost::detail::adj_list_gen<boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, int, boost::no_property>, boost::no_property, boost::listS>, boost::vecS, boost::listS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, int, boost::no_property>, boost::no_property, boost::listS>::config>]': /home/tcma/cpp/boost_1_31_0/boost/graph/adjacency_list.hpp:363: instantiated from `boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::adjacency_list(EdgeIterator, EdgeIterator, EdgePropertyIterator, typename boost::detail::adj_list_gen<boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>, VertexListS, OutEdgeListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::type::vertices_size_type, typename boost::detail::adj_list_gen<boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>, VertexListS, OutEdgeListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::type::edges_size_type, const GraphProperty&) [with EdgeIterator = main(int, char**)::Edge*, EdgePropertyIterator = int*, OutEdgeListS = boost::listS, VertexListS = boost::vecS, DirectedS = boost::directedS, VertexProperty = boost::no_property, EdgeProperty = boost::property<boost::edge_weight_t, int, boost::no_property>, GraphProperty = boost::no_property, EdgeListS = boost::listS]' /home/tcma/cpp/boosttcma/libs/graph/dijkstra-example.cpp:146: instantiated from here /home/tcma/cpp/boost_1_31_0/boost/graph/detail/adjacency_list.hpp:1904: error: no matching function for call to `add_edge(main(int, char**)::Vertex&, main(int, char**)::Vertex&, int&, boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, int, boost::no_property>, boost::no_property, boost::listS>&)' /home/tcma/cpp/boost_1_31_0/boost/graph/detail/adjacency_list.hpp:599: note: candidates are: std::pair<typename boost::directed_graph_helper<Config>::edge_descriptor, bool> boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, const typename Config::edge_property_type&, boost::directed_graph_helper<Config>&) [with Config = boost::detail::adj_list_gen<boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, int, boost::no_property>, boost::no_property, boost::listS>, boost::vecS, boost::listS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, int, boost::no_property>, boost::no_property, boost::listS>::config] /home/tcma/cpp/boost_1_31_0/boost/graph/detail/adjacency_list.hpp:1987: note: std::pair<typename Config::edge_descriptor, bool> boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, const typename Config::edge_property_type&, boost::vec_adj_list_impl<G, C, B>&) [with Graph = boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, int, boost::no_property>, boost::no_property, boost::listS>, Config = boost::detail::adj_list_gen<boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, int, boost::no_property>, boost::no_property, boost::listS>, boost::vecS, boost::listS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, int, boost::no_property>, boost::no_property, boost::listS>::config, Base = boost::directed_graph_helper<boost::detail::adj_list_gen<boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, int, boost::no_property>, boost::no_property, boost::listS>, boost::vecS, boost::listS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, int, boost::no_property>, boost::no_property, boost::listS>::config>] set -e g++ -c -Wall -ftemplate-depth-100 -g -O0 -Wno-inline -I"../../../bin/boost/libs/random/test" -I "/home/tcma/cpp/boost_1_31_0" -o "/home/tcma/cpp/boosttcma/libs/graph/dijkstra-example.test/gcc/debug/inlining-on/dijkstra-example.o" "/home/tcma/cpp/boosttcma/libs/graph/dijkstra-example.cpp" /usr/bin/objcopy --set-section-flags .debug_str=contents,debug "/home/tcma/cpp/boosttcma/libs/graph/dijkstra-example.test/gcc/debug/inlining-on/dijkstra-example.o" ...failed gcc-C++-action /home/tcma/cpp/boosttcma/libs/graph/dijkstra-example.test/gcc/debug/inlining-on/dijkstra-example.o... ...removing /home/tcma/cpp/boosttcma/libs/graph/dijkstra-example.test/gcc/debug/inlining-on/dijkstra-example.o ...skipped </home/tcma/cpp/boosttcma/libs/graph/dijkstra-example.test/gcc/debug/inlining-on>/home/tcma/cpp/boosttcma/libs/graph/dijkstra-example for lack of </home/tcma/cpp/boosttcma/libs/graph/dijkstra-example.test/gcc/debug/inlining-on>dijkstra-example.o... ...skipped </home/tcma/cpp/boosttcma/libs/graph/dijkstra-example.test/gcc/debug/inlining-on>/home/tcma/cpp/boosttcma/libs/graph/dijkstra-example.run for lack of </home/tcma/cpp/boosttcma/libs/graph/dijkstra-example.test/gcc/debug/inlining-on>/home/tcma/cpp/boosttcma/libs/graph/dijkstra-example... ...failed updating 1 target... ...skipped 3 targets... ______________________________________________________________________ Post your free ad now! http://personals.yahoo.ca

2 1

Boost::RegEx Syntax issue?
by Timothy H. Schilbach 11 Nov '04

11 Nov '04

Hi Everyone, I have just started using BOOST in my C++ cosing projects as I am a newbie to C++ but very experienced in many other languages. I Needed to write some DLLs for Windows that would allow me to validate the complexity of porposed passwords. I have gotten a simple application togeather and it works very well at this time. The only issue I have is that it isnt validating a match correctly when I use certain RexEx expressions. For example: This expression: ^([a-zA-Z]+)(\d+)([a-zA-Z]+)$ validates strings that start with a character have a digit and then end with a character. This is great and works very well at this time. Now I go to something a bit more complex. I want to validate a new password a user sets and it has to conform to 2 of the following 4 rules: 1. Have uppercase letter 2. Have lower case letter 3. Have 0-9 4. Have a special character !@#$%^&* This RegExs Expression works very well in my other applications written in C# (DOTNET REGex) and also works very well in PERL applications too: (?=\w*[a-z])(?=\w*[A-Z])|(?=\w*\d)(?=\w*[a-z])|(?=\w*[a-z])(?=\w*\d)|(?=\w*[a-z])(?=.*[@#$%^&])|(?=\w*\d)(?=\w*[A-Z])|(?=\w*[A-Z])(?=.*[@#$%^&])|(?=\w*\d)(?=.*[@#$%^&]) Ok I know its a doosy, but I works great everywhere except the application I am running BOOST with. I keep the expression in a registry key so I can edit easily instead of recompiling the DLL if I want to change the RegEx. Here is the code I am using in my C++ project and its failing to validate passwords that match the policies: // Validate password against regular expression wregex wrePassword(DEFAULT_REGEX); WriteToLog("Going to retrieve RegEx from Registry"); GetPasswordRegExFromRegistry(wrePassword); WriteToLog("Going to run match"); // Prepare iterators wstring::const_iterator start = wstrPassword.begin(); wstring::const_iterator end = wstrPassword.end(); match_results<wstring::const_iterator> what; unsigned int flags = match_default; bMatch = regex_match(start, end, what, wrePassword); If all is working corectly the following passwords should pass the RegEx expression I have posted above (it works fiune in PERL or C#/VB.NET) Password Password1 password1 p@ssword Any of those should work just fine and they dont. Anyone able to hep me with this one? Your help is greatly appreciated. I just cant figgure out why a syntax I use in PERL or C#/VB.NET works great but wont work in BOOST. -Timothy

2 1

RE: [Boost-users] hello world in boost ?
by Foster, Gareth 11 Nov '04

11 Nov '04

I suppose that means that in the redhat/fedora case these things are already in the path or something? Not that it matters really, just odd that I never had that problem :) -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of paul wisehart Sent: 10 November 2004 13:42 To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] hello world in boost ? OK OK I got it finally ! THanks for your help. Now that I'm looking back its sorta obvious, but I guess I didn;t really now that when you use "-l<some-lib>" with g++ (any compiler?) the its just the name of the physical library in "/usr/local/lib" (or wherever) with the "lib" part cut off. So I was able to get a hello_world.cpp to compile by doing: g++ \ -lboost_regex-gcc \ -L/usr/local/lib \ -I/usr/local/include/boost-1_31 \ hello_world.cpp It was the "-lboost_regex-gcc" part that was tripping me up. I wasn't putting the "-gcc" on the end. Thanks again! -- paul \ / wisehart >/ <//////$> |\|\|\ _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

Re: Re: boost graph library bugs
by qyang＠cs.ucr.edu 11 Nov '04

11 Nov '04

> >Below is a list of bugs (at least I think so) in boost graph library: > > > >... > > > >I found the above problems when I tried to create subgraphs for each > >component in the graph when the number of components was large. > It always helps to identify the compiler and it's version number, the > operating system, and to indicate the version of the Boost code (or CVS, > if that was the source.) Hi, The compiler is: g++ (GCC) 3.3.3 20040412 (Red Hat Linux 3.3.3-7) The OS is: Linux version 2.6.7-1.494.2.2 (Fedora Core release 2 (Tettnang)) The boost code (I think) is: boost_1_31_0 (I will update this one once I have the reply from system administrator) Qiaofeng

1 0

install stlport for gcc and vc71
by Sara Collins 10 Nov '04

10 Nov '04

Hi all, I'm trying to install stlport for vc71 and gcc and ran into some problems. 1. VC7.1 bjam -sTOOLS=vc7.1-stlport -sSTLPORT_PATH="C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\include\stlport" install Boost::regex gives me a bunch of unresolved symbols errors: --------------------------------------------------- vc-Link bin\boost\libs\regex\build\boost_regex.dll\vc7.1-stlport\debug\boost_regex-vc71-mt-gdp-1_31. dll bin\boost\libs\regex\build\boost_regex.dll\vc7.1-stlport\debug\boost_regex-vc71-mt-gdp-1_31.lib Creating library bin\boost\libs\regex\build\boost_regex.dll\vc7.1-stlport\debug\boost_regex-vc71-mt-gdp-1_31.lib and object in\boost\libs\regex\build\boost_regex.dll\vc7.1-stlport\debug\boost_regex-vc71-mt-gdp-1_31.exp instances.obj : error LNK2001: unresolved external symbol "private: unsigned int __cdecl boost::cpp_ regex_traits<wchar_t>::do_syntax_type(unsigned int)const " (?do_syntax_type@?$cpp_regex_traits@_W@bo ost@@ABAII@Z) winstances.obj : error LNK2001: unresolved external symbol "private: unsigned int __cdecl boost::cpp _regex_traits<wchar_t>::do_syntax_type(unsigned int)const " (?do_syntax_type@?$cpp_regex_traits@_W@b oost@@ABAII@Z) .... ---------------------------------------------------- Did I forget to do something? 2. GCC (run in cygwin) bjam -sTOOLS=gcc-stlport -sSTLPORT_PATH="/usr/local/include/stlport" install ------------------------------------------------------ gcc-Link-action bin\boost\libs\date_time\build\boost_date_time.dll\gcc-stlport\debug\boost_date_tim -gcc-gdp-1_31.dll bin\boost\libs\date_time\build\boost_date_time.dll\gcc-stlport\debug\boost_date_time-gcc-gdp-1_31.lib /usr/lib/gcc-lib/i686-pc-cygwin/3.3.3/../../../../i686-pc-cygwin/bin/ld: cannot find -lstlport_cygwin_stldebug collect2: ld returned 1 exit status g++ -Wl,--export-all-symbols -Wl,--exclude-symbols,_bss_end__:_bss_start__:_data_end__:_data_ tart__ -Wl,--out-implib,bin\boost\libs\date_time\build\boost_date_time.dll\gcc-stlport\debug\boost_date_time-gcc-gdp-1_31.lib -g -shared -o "bin\boost\libs\date_time\build\boost_date_time.dll\gcc-stlport\debug\boost_date_time-gcc-gdp-1_31.dll" -L"C:/cygwin/usr/local/include/stlport/STLport-4.6/ ib" "bin\boost\libs\date_time\build\boost_date_time.dll\gcc-stlport\debug\greg_month.obj" "bin\boo t\libs\date_time\build\boost_date_time.dll\gcc-stlport\debug\greg_weekday.obj" "bin\boost\libs\date time\build\boost_date_time.dll\gcc-stlport\debug\date_generators.obj" -lstlport_cygwin_stldebug ...failed gcc-Link-action bin\boost\libs\date_time\build\boost_date_time.dll\gcc-stlport\debug\boost_date_time-gcc-gdp-1_31.dll bin\boost\libs\date_time\build\boost_date_time.dll\gcc-stlport\debug\boost_date_time-gcc-gdp-1_31.lib... ...skipped <@boost!lib>boost_date_time-gcc-gdp-1_31.dll for lack of <@boost!libs!date_time!build\bo st_date_time.dll\gcc-stlport\debug>boost_date_time-gcc-gdp-1_31.dll... ...skipped <@boost!lib>boost_date_time-gcc-gdp-1_31.lib for lack of <@boost!libs!date_time!build\bo st_date_time.dll\gcc-stlport\debug>boost_date_time-gcc-gdp-1_31.lib... gcc-Link-action bin\boost\libs\date_time\build\boost_date_time.dll\gcc-stlport\debug\threading-multi\boost_date_time-gcc-mt-gdp-1_31.dll bin\boost\libs\date_time\build\boost_date_time.dll\gcc-stlport\debug\threading-multi\boost_date_time-gcc-mt-gdp-1_31.lib /usr/lib/gcc-lib/i686-pc-cygwin/3.3.3/../../../../i686-pc-cygwin/bin/ld: cannot find -lstlport_cygw n_stldebug collect2: ld returned 1 exit status ..... ------------------------------------------------------ What is this library "-lstlport_cygwin_stldebug"? It complained that it couldn't be found. Where can I find it? 3. Boost build bjam version 1 vs version 2 What should I do to install stlport for bbv2? I could only find stlport.jam under tools/ directory. Or can I use stlport that was built by v1 for v2? I'm using boost1.31.0 and stlport4.6.2. Thanks a lot in advance! __________________________________ Do you Yahoo!? Check out the new Yahoo! Front Page. www.yahoo.com

5 7

Re: Serialization linker error question
by Jonathan D. Turkanis 10 Nov '04

10 Nov '04

"Delfin Rojas" <drojas(a)moodlogic.com> wrote > Yes and yes. I am aware boost::serialization needs to be built. Okay, just checking that the computer was plugged in ;-) > Anyway, I built the serialization static libs (no dll seems to be available > at this time) and I'm linking against it. However I got the linker error I > mentioned before. It seems for some reason I cannot serialize this container > (set of wstrings). I also tried changing it to a list of wstrings and got a > similar unresolved external. If I try to not serialize the container my > program links perfectly. One of our other technicians will have to help you with that. :-) > Sorry my original post was in reply to a completely different one. That was > my lazy way to get the email address in the "to" box. I changed the title > but I forgot to delete the body of the previous email as I always do. It doesn't bother me -- it just makes it less likely that others will see your message, and results in erroneous archiving. > Anyway, any help you guys can give me? I can try to come up with a small > example of my problem if you guys need it. This always helps. > Thanks > > -delfin

1 0

variant.hpp/bind.hpp interaction
by Simmons, Aaron 10 Nov '04

10 Nov '04

I'm using boost 1.31 with vc7.1. I've found a weird compilation interaction between the boost.bind and boost.variant headers. This code will compile fine: #include "boost/variant.hpp" #include "boost/bind.hpp" But this code won't: #include "boost/bind.hpp" #include "boost/variant.hpp" Here are the errors that are reported: c:\Boost\include\boost-1_31\boost\mpl\less.hpp(39) : error C2760: syntax error : expected ',' not ';' c:\Boost\include\boost-1_31\boost\mpl\less.hpp(51) : see reference to class template instantiation 'boost::mpl::less<T1,T2>' being compiled c:\Boost\include\boost-1_31\boost\mpl\less.hpp(39) : error C2144: syntax error : 'const bool' should be preceded by '}' c:\Boost\include\boost-1_31\boost\mpl\less.hpp(39) : error C2062: type 'const bool' unexpected c:\Boost\include\boost-1_31\boost\mpl\less.hpp(39) : error C2238: unexpected token(s) preceding ';' c:\Boost\include\boost-1_31\boost\mpl\less.hpp(42) : error C2065: 'value' : undeclared identifier

1 0

RE: [Boost-users] hello world in boost ?
by Foster, Gareth 10 Nov '04

10 Nov '04

I can tell you that on a fedora/redhat box, you just include the headers and you are away. If you installed the development package group it will be there and you can build c++ programs and use boost out of the box. What distro are you using? Gaz -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Justin Findlay Sent: 10 November 2004 07:58 To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] hello world in boost ? On Wed, Nov 10, 2004 at 01:33:36AM -0500, paul wisehart wrote: > I am able to compile the boost libaray on my linux machines. > I am not able to use it. > > Is there a simple program I can try to compile to make > sure I am doing things correctly. > > I'm sorry. its a shortcoming of mine, but I can't do _anything_ > until I have a working stub. > (or hello_world, or wahtever you want to call it.) > > I just need a simple example of how to compile a boost > prohram from g++ . Which library are you wanting to enhance the efficacy of your hello world program with? Most (all?) the boost libs documentation include usage and simple examples. Justin _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

Re: [Boost-users] hello world in boost ?
by paul wisehart 10 Nov '04

10 Nov '04

On Wed, Nov 10, 2004 at 09:35:08AM +0000, Foster, Gareth wrote: > I can tell you that on a fedora/redhat box, you just include the headers and > you are away. If you installed the development package group it will be > there and you can build c++ programs and use boost out of the box. What > distro are you using? I'm using Slackware. Lemme ask a simpler question: What the "library" name of boost-regex. Meaning when I compile with g++ from command line, what do I put after the "l"? something like: -lboost or -lboost_regex or -llibboost_regex ? -- paul \ / wisehart >/ <//////$> |\|\|\

1 0

ublas compatible solvers (newbie question) (Zrubavel Zodikovich)
by Daniel L Elliott 10 Nov '04

10 Nov '04

------------------------------ Message: 2 Date: Fri, 05 Nov 2004 22:52:14 +0200 From: Zrubavel Zodikovich <g729(a)mail.com> Subject: [Boost-users] ublas compatible solvers (newbie question) To: boost-users(a)lists.boost.org Message-ID: <cmgosk$jst$1(a)sea.gmane.org> Content-Type: text/plain; charset=ISO-8859-1; format=flowed Hi all, I'm looking into using uBLAS for solving some big sparse systems, specifically with conjugate gradient family of solvers. Could anyone point me towards boost-compatible implementation of such solver ? thanks in advance ------------------------------ Hello, I know of no such solvers in or out of uBLAS so I am not of much help. However, you may want to consider interfacing uBLAS with libraries which are not compatable with uBLAS. You will find such interfaces in the BOOST-sandbox CVS. I may be undertaking a similar exercise between uBLAS and some sparse system solvers. Also, there exists documentation for these bindings, but I cannot find the link :( Best of luck, Dan

5 4