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

How to build the giallo socket library?
by Paul Elliott 20 Mar '05

20 Mar '05

Does anyone know the procedure for building the giallo socket library in the boost sandbox? I was able to checkit out of CVS but I was not able to figure out the build procedure. I asked on the giallo mailing list with no response. Perhaps the project has gone dormant? Is boost fixin to have a socket library in the future? -- Paul Elliott 1(512)837-1096 pelliott(a)io.com PMB 181, 11900 Metric Blvd Suite J http://www.io.com/~pelliott/pme/ Austin TX 78758-3117

3 2

Can't compile basic boost.python program
by Derakon 20 Mar '05

20 Mar '05

I'm following the Boost.python tutorial, and having some problems with compiling, of all things. Here's the file I'm trying to compile: #include <boost-1_32/boost/python.hpp> char const* greet() { return "Hello, world!"; } using namespace boost::python; BOOST_PYTHON_MODULE(hello) { def("greet", greet); } And here's the compilation error: % make g++ -g -Wall -pedantic -I/usr/local/include/boost-1_32 -c -o test.o test.cpp In file included from /usr/local/include/boost-1_32/boost/python/detail/prefix.hpp:13, from /usr/local/include/boost-1_32/boost/python/args.hpp:8, from /usr/local/include/boost-1_32/boost/python.hpp:11, from test.cpp:1: /usr/local/include/boost-1_32/boost/python/detail/wrap_python.hpp:30:23: pyconfig.h: No such file or directory /usr/local/include/boost-1_32/boost/python/detail/wrap_python.hpp:54:24: patchlevel.h: No such file or directory /usr/local/include/boost-1_32/boost/python/detail/wrap_python.hpp:57:2: #error Python 2.2 or higher is required for this version of Boost.Python. /usr/local/include/boost-1_32/boost/python/detail/wrap_python.hpp:121:21: Python.h: No such file or directory In file included from /usr/local/include/boost-1_32/boost/python/cast.hpp:13, from /usr/local/include/boost-1_32/boost/python/handle.hpp:10, from /usr/local/include/boost-1_32/boost/python/args_fwd.hpp:10, from /usr/local/include/boost-1_32/boost/python/args.hpp:10, from /usr/local/include/boost-1_32/boost/python.hpp:11, from test.cpp:1: /usr/local/include/boost-1_32/boost/python/base_type_traits.hpp:24: error: ` PyObject' was not declared in this scope /usr/local/include/boost-1_32/boost/python/base_type_traits.hpp:25: error: template argument 1 is invalid /usr/local/include/boost-1_32/boost/python/base_type_traits.hpp:26: confused by earlier errors, bailing out make: *** [test.o] Error 1 As near as I can figure, my install of Boost got screwed up. Does anyone else have a different interpretation? -Chris Weisiger

2 2

unordered_map/hash_table bug?
by Martin Wartens 20 Mar '05

20 Mar '05

Hi, has anybody tried the implementation of unordered map that can be found at http://groups.yahoo.com/group/boost/files/jtc1-sc22-wg21-2003-n1456.tar.gz ? I believe there is a bug in the rehash function of the underlying hash_table. The new bucket indices are computed using the old number of buckets. That means that the items stored in these buckets cannot be found anymore later. I checked my hash function and it seems to be right. The bug doesn't seem to show if the trivial hash function that comes with this package is used (maps val->val). BTW: what is the reason behind burying potentially useful code in a place where nobody can find it? (I mean the "yahoo groups") Is there still life in the development of this package? Martin ___________________________________________________________________________ Sagen Sie nicht, wir hätten Sie nicht gewarnt! http://my-mail.ch/?redirect=9901 Online-Gewinnspiel mit 1'000 Sofortpreisen im Wert von CHF 40'000! http://my-mail.ch/?redirect=1779

3 6

result_of tutorial
by Ian McCulloch 19 Mar '05

19 Mar '05

I'm sure this has been asked before, but searching the archives I cannot find anything. Is there some tutorial material on result_of anywhere? The boost documentation simply points to n1454, which doesn't contain much in the way of examples, and the TR1 document (n1647) which has no examples at all. Cheers, Ian

6 25

Problem with boost/iterator_facade.hpp on HP-UX
by Thomas Matelich 19 Mar '05

19 Mar '05

Global namespace pollution strikes again. /usr/include/machine/reg.h defines a symbol R1, which messes up boost/iterator_facade.hpp. I'm not sure what the boost policy is on stuff like this, name change or #undef. I went with name change. I just changed all R1's to Ref1's and R2's to Ref2's (for consistency). If you'd like a patch, I can submit one, but its a pretty simple fix. Oh, and I'm using 1.32 Thanks, Tom

2 1

BGL: adjacency list, EdgeList, VertexList
by Sachin Ahuja 18 Mar '05

18 Mar '05

Hi all: Is it possible to access the container type that represents the edge-list of a graph. That is, if a graph type is like so: typedef adjacency_list< vecS, vecS, bidirectionalS > graph_type; then, is it possible to do write something like this: typedef typename graph_type::EdgeListContainer EdgeListC; Ditto for the container type that represents the vertex set of a graph. Thanks very much, S

4 4

listS vecS
by panoply＠att.net 18 Mar '05

18 Mar '05

What is the underlying implementation of listS or vecS? Are they just STL vectors and lists? If the answer is yes, then there is a good deal of comfort I have about what I can or cannot get away with... Is there any other type besides those two allowed, or planned for future versions of BGL? -Brent

2 1

boost variant with exported attribute on VC++ 2003
by gast128 18 Mar '05

18 Mar '05

Dear all, I get a compile error when I want to export a class derived from boost variant, e.g.: struct __declspec(dllexport) BlaVariant : public boost::variant<bool> { BlaVariant() {} }; It gives C2666. What do I wrong... As a workaround I can aggregate it instead of derivation (although I think in my case it was a really an 'ISA' relationship) wkr, me

1 0

Re: [Boost-users] BGL: Early out search
by John Donovan 18 Mar '05

18 Mar '05

> Interesting approach. I have another potential algorithm; see below. Thanks :) As you may be able to tell, I've only been playing with the BGL on and off for a couple of days. > > 3) Can I colour the vertices before the algorithm does, thus fooling it into skipping the vertex's children? > > It's a dirty trick, but you can do that :) All's fair in love and programming ;) > So, the easiest solution is I think to use the filtered_graph<> adaptor Ah ha! I'd completely failed to notice that in the docs! It really does sound just the job. Thanks for pointing that out. -John Donovan - He who really should read the docs more carefully. The content of this message and any attached file are confidential and/or privileged and are for the intended recipient only. If you are not the intended recipient, any unauthorised use, disclosure, copying, distribution or other dissemination is strictly prohibited. If you receive this message in error please notify the sender immediately by email, telephone or fax and then delete this email. Any attachment with this message should be checked for viruses before it is opened. Magenta Software Limited cannot be held responsible for any failure by the recipient to check for viruses before opening any attachment. Copyright in this email and attachments created by us belongs to Magenta Software Limited. Should you communicate with anyone at Magenta Software Limited by email you consent to us monitoring and reading any such correspondence.

1 0

Graph Library Question
by Todd A. Gibson 18 Mar '05

18 Mar '05

Hello, I have a code base which uses adjacency_list as the underlying graph structure. I tried converting from adjacency_list to adjacency_matrix and discovered that adjacency_matrix does not implement the in_edges() non-member function (nor the corresponding iterators). What is the design rationale for including only out_edges() in adjacency_matrix but not in_edges()? Is there a recommended alternative for traversing in_edges for an adjacency_matrix? Thanks, -TAG

2 1