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

boost::shared_ptr and stl algorithms
by Bill Eidson 15 Apr '05

15 Apr '05

std::vector< boost::shared_ptr<T> > TVec; I want to write a function object to run std::for_each. to do somework against members of T and accumulate results in functor. My attempts have failed in VC7 with memory errors in my operator() method. struct fo { bool operator()( boost::shared_ptr<T>& t ) { return true; } }; Thanks in advance bille

5 9

Will libraries built on WinNT run on Win98? (MinGW)
by Reed Hedges 31 Mar '05

31 Mar '05

I know that Win98 is not really supported, but is there any chance that libraries (specifically thread and regex) that were build on WinNT using MinGW work on Win98 (in MinGW)? My guess is no, but has anyone tried it? thanks reed

2 1

RE: [Boost-users] Re: about license
by Darryl Green 04 Apr '04

04 Apr '04

> -----Original Message----- > From: David Abrahams [mailto:dave@boost-consulting.com] > Sent: Tuesday, 2 March 2004 12:43 AM > > "Darryl Green" <Darryl.Green(a)unitab.com.au> writes: > > > I'm happy to provide a patch once I'm reasonably sure I > understand the > > license. I'm assuming an email discussion will be more > productive than > > patches in the meantime. I have one more question that I > have a proposed > > FAQ answer for, but my "answer" is based purely on what I think it > > should be, not an understanding of the law. I've been trying to educate myself about the law in this area, with some help from Alexander Terekhov. I'm not at all convinced now that there is any derivative work produced by the compilation step, however this seems to make no difference to the result. It seems the compiled code is a translation of both works, agregated (a compilation) in some way then. I think whoever produces the compilation can license it however they like, subject to permission being granted by the authors of the original works to include their work in the compilation. I don't know if this is sufficiently clearly allowed by the wording of the boost license, though I think "use" must surely allow this for software source libs as there is no other way to "use" them. So the final answer is the same - but some of the questions and answers in between may be wrong. Have you received any feedback from lawyers about this? Regards Darryl Green. ########################################################################## This e-mail is for the use of the intended recipient(s) only. If you have received this e-mail in error, please notify the sender immediately and then delete it. If you are not the intended recipient, you must not use, disclose or distribute this e-mail without the author's prior permission. We have taken precautions to minimise the risk of transmitting software viruses, but we advise you to carry out your own virus checks on any attachment to this message. We cannot accept liability for any loss or damage caused by software viruses. ##########################################################################

2 1

Re: [boost] [BGL] forced client complexity
by Jeremy Siek 02 Apr '04

02 Apr '04

Hi, I too am dissatisfied with the complexity of many parts of the BGL... On Mar 31, 2004, at 4:48 AM, Provisional Dissonance wrote: > Is there any particular reason that a > simplified interface is not made available? Just a lack of time. The priority was placed on providing flexibility and efficiency so that the BGL components could handle any situation... that flexibility came at the price of complexity. I think a good next step would be to provide more special purpose components that are easier to use. > Perhaps a > container adapter could be packaged with the library > allowing a compromise of functionality and flexibility > for simplicity? Could you explain this "container adaptor" idea more. > #include <less_than_10_graph_headers> > ... > digraph<some_node_type,some_edge_context_type> g; > g << "vertex" << make_pair("vertex", > "implicit_vertex"); > g.add_edge("brother", "sister", "sibling"); > if(g.find(make_pair("brother", "sister"))) > related = true; Perhaps this is a good place to start. Could you explain each of the above lines of code. Then we can compare to an implementation in the current BGL and pinpoint problem areas. Cheers, Jeremy _______________________________________________ Jeremy Siek <jsiek(a)osl.iu.edu> http://www.osl.iu.edu/~jsiek Ph.D. Student, Indiana University Bloomington Graduating in August 2004 and looking for work C++ Booster (http://www.boost.org) _______________________________________________

3 6

linker error creating simple unit_test (boost 1.31.0 + win32 + vc 71)
by Langston, Matthew David 02 Apr '04

02 Apr '04

I'm trying to create a simple unit test (using the Unit Test Framework) using boost 1.31.0 + win32 + vc71, but I get the following linker error due to the undefined symbol __imp___CrtSetReportHook: tests error LNK2019: unresolved external symbol __imp___CrtSetReportHook referenced in function "public: int __thiscall boost::execution_monitor::execute(bool,int)" (?execute@execution_monitor@boost@@QAEH_NH@Z) There was mention of this undefined symbol (__imp___CrtSetReportHook) in this thread: http://lists.boost.org/MailArchives/boost/msg43787.php. However, that post was concerning the Metrowerks compiler, but I am using Microsoft's vc71 compiler. Can someone help me resolve this undefined symbol (__imp___CrtSetReportHook) problem? Here is my simple "unit test suite" that I am trying to build: #include <boost/test/unit_test.hpp> #include <boost/test/included/unit_test_framework.hpp> using boost::unit_test_framework::test_suite; void test_GleamData() { BOOST_CHECK(2 == 1); // non-critical test => continue after failure } test_suite* init_unit_test_suite( int, char* [] ) { test_suite* test = BOOST_TEST_SUITE( "GleamAnalysis Test Suite" ); test -> add( BOOST_TEST_CASE( &test_GleamData ), 1 /* expected one error */ ); return test; } Warmest regards, Matt

2 1

about license
by Marleny Rafferty 01 Apr '04

01 Apr '04

Hi- I am considering using boost in my applications, but I have a question about the boost license at http://www.boost.org/LICENSE_1_0.txt . It says (edited) "Permission is hereby granted, free of charge, to ... use [and] reproduce ... the Software". It also says that any derivative works must also have the same license grant. If my application uses boost libraries unchanged, is it considered a derivative work? If so, does that mean that if I distribute my compiled software, I must allow free of charge use and distribution? Thanks. -- Marleny

6 10

removing parallel edges in the Boost Graph Library?
by Nicholas Burlett 01 Apr '04

01 Apr '04

I am trying to use BGL to model a directed multigraph, but every time I try to remove just one of the edges (u,v), it removes all of the edges from u to v. My graph definition is: typedef adjacency_list<listS, listS, bidirectionalS, VertexProperty, EdgeProperty> graphdata; where VertexProperty and EdgeProperty are properties I've defined. Everything else seems to work: I have can add parallel edges, find the edge I want to remove based on the EdgeProperty, filter the graph for topological sorting, check for existing edges, etc. In the following, e is of type graph_traits<graphdata>::edge_descriptor, and g is the graph of type graphdata (defined above): std::cout << "about to remove edge\n"; DumpInfo(); remove_edge(e, g); std::cout << "removed edge\n"; DumpInfo(); Here is some sample output: about to remove edge vertex: 0 out-edges: in-edges: (1,0) (1,0) adjacent vertices: vertex: 1 out-edges: (1,0) (1,0) in-edges: adjacent vertices: 0 0 removed edge vertex: 0 out-edges: in-edges: adjacent vertices: vertex: 1 out-edges: in-edges: adjacent vertices: Note that there were two edges present before the call to remove_edge, but only one after. What am I doing wrong? I'm using version 1.31, if that helps. Thanks, Nicholas Burlett nrb23(a)cornell.edu

2 5

Re: [boost] [BGL] forced client complexity
by Cromwell Enage 31 Mar '04

31 Mar '04

prs, On reflection, I've decided to cross-list my reply. > If one accepts the axiom that "a picture is worth a > thousand words," then it naturally follows that > discussion of graphs is always overly prolix. I recently had a chat with a fellow programmer and attempted to summarize, in semi-layman terms, how the core algorithms of my multi-state-mazes library work. They're pretty simple, but I couldn't do it without paper and pencil. > Sadly, the same reasoning is also applicable to > the code of graph libraries. If a "code-visualizing compiler IDE" existed that would give us "code pictures" (plus conform to the new C++ standard, not ICE, and so on), I'm pretty sure more of us would be using it for all programming projects, not just graph applications. :) But seriously, with graph theory containing several different problem domains (search, network, AI, etc.), a graph library attempting to be generic enough for use in all of them is necessarily complex. > Boost.Graph seems to expose and require an > unnecessarily large amount of complexity, > though. If by "exposure" you mean lots of source code, I'll take that complexity any day of the week and twice on Sundays. :) The library does have a rather steep learning curve, especially if you're somewhat unfamiliar with graph theory and/or template programming. > Whereas libraries like Spirit go to great lengths > to make hard things easy, BGL seems to try only to > make hard things possible. I haven't looked at the Spirit library yet, so I can't tell you how easy it may be to use it. Perhaps getting your hands on a copy of the Boost Graph Library book will help (I don't have one, so I'm not certain). > The amount of scaffolding required > to use BGL for even the simplest of projects > often dwarfs the code size of a naive, > yet functional, special-purpose implementation. Special-purpose implementation of a graph library? Or the project? BGL aims to be as generic as the STL, but whereas each STL container deals with essentially one type of element, a graph needs to contain two types: a vertex type and an edge type. Furthermore, while most STL algorithms confine themselves to handling just those STL container elements, most graph algorithms also need the properties of vertices and/or edges as input. BGL delegates some of the responsibility of property storage to the Boost Property Map Library. I'm just glad the developers kept the complexity down to its current level. > While I understand that the BGL is deeply entrenched > in boost culture, certain academic circles, and even > publications, I nonetheless suggest that BGL lacks > the ease of use necessary for widespread adoption. Having dwelt in the academic circle known as the University of Central Florida, and thus familiar with the theoretical uses of a graph library (plus I've studied some game development apps on the side), I'd like to learn more about how the Real World would want to use BGL. > Even knowing that ease-of-use is not a criterion > for acceptance into boost, looking at what is > required of the client to use the BGL always leaves > me feeling perplexed. Is there any particular reason > that a simplified interface is not made available? Again, I don't know a simple graph problem that requires a simplified graph interface. > Perhaps a container adapter could be packaged with > the library allowing a compromise of functionality > and flexibility for simplicity? I thought the boost::vector_as_graph class template served that purpose. Wrap it around a std::vector<EdgeList>, with EdgeList = std::list<unsigned int> (or an edge list container of your choice, so long as the value type is usable as an index in the vector), and you should be good to go. > If a graphing problem is trivial, shouldn't BGL > provide a trivial solution? Why are the simplest > useful examples several hundred lines of code? The examples don't seem that big and hard to understand. Of course, quite a few of them have #ifdefs that I could do without since I don't use the compilers in question, but I can live with them. > I apologize for all of my vague criticisms - my > intention is not to flame but rather to test the > waters. Your criticisms seem healthy, and I hope my responses are helpful. > It is difficult for me to assess whether the > simplicity I yearn for isn't present for stylistic > reasons or whether it would rather necessitate a > sacrifice of flexibility, functionality or > implementation clarity. Nor is it clear to me to > what extent these criteria can be compromised to > promote clarity of client code. For what it is > worth, the kind of ease-of-use I'm imagining might > look like: #include <less_than_10_graph_headers> ... digraph<some_node_type,some_edge_context_type> g; g << "vertex" << make_pair("vertex", "implicit_vertex"); g.add_edge("brother", "sister", "sibling"); if(g.find(make_pair("brother", "sister"))) related = true; > Could someone please elucidate on why it is > impossible/impractical/unnecessary/whatever for a > graph library to have such an interface? I believe the potential for ambiguity would hinder this syntax the most. In this case, you'd have to overload operator<< to input both edges and vertices, and what if some_node_type turned out to be std::pair? You couldn't pass in make_pair(vertex,vertex) as an edge then. The same goes for g.find(); is it supposed to find a vertex, an edge, or both? Also, it seems you want to be able to use non-built-in or custom types as vertex IDs. You'll have to build your own custom-type-to-vertex map and bind it to the graph; BGL won't do it for you, to retain its genericity. Incidentally, BGL favors free functions over member functions. The rationale for that can be found in the FAQ <http://www.boost.org/libs/graph/doc/faq.html>. > Should I accept that the BGL is not the magic bullet > graph library and move on, or can this kind of > simplicity be somehow found within? Yeah, no magic bullets here. It depends on the problem you are trying to solve. Cromwell Enage __________________________________ Do you Yahoo!? Yahoo! Finance Tax Center - File online. File on time. http://taxes.yahoo.com/filing.html

1 0

Re: [BGL] forced client complexity
by Christopher D. Russell 31 Mar '04

31 Mar '04

A well written critique. I had to go look up the word "prolix" (i.e. verbose). In defense of BGL: I am no BGL expert despite having read the book several times and writing a complex client application that uses dozens of different graph types. I admit, it was some hard work getting going with BGL. However, this is because I didn't know C++ templates nearly as well as I thought I did. Certainly there's nothing in the library that would preclude anyone from writing simpler BGL-derived classes that offer solutions that are packaged to solve specific problems. Post specific problems and people will help. > It is difficult for me to assess whether the > simplicity I yearn for isn't present for stylistic > reasons or whether it would rather necessitate a > sacrifice of flexibility, functionality or > implementation clarity. Having become baseline proficient with BGL, I would disagree that it's overly complex. To me BGL is an elegant solution to a class of very complex problems that strikes a reasonable balance between complexity and flexibility. In my opinion, if you frequently use graphs BGL is well worth the investment required to learn how to use it. - Chris "Provisional Dissonance" <prosonance(a)yahoo.com> wrote in message news:20040331094800.93338.qmail@web60105.mail.yahoo.com... > If one accepts the axiom that "a picture is worth a > thousand words," then it naturally follows that > discussion of graphs is always overly prolix. Sadly, > the same reasoning is also applicable to the code of > graph libraries. Boost.Graph seems to expose and > require an unnecessarily large amount of complexity, > though. Whereas libraries like Spirit go to great > lengths to make hard things easy, BGL seems to try > only to make hard things possible. The amount of > scaffolding required to use BGL for even the simplest > of projects often dwarfs the code size of a naive, yet > functional, special-purpose implementation. > > While I understand that the BGL is deeply entrenched > in boost culture, certain academic circles, and even > publications, I nonetheless suggest that BGL lacks the > ease of use necessary for widespread adoption. Even > knowing that ease-of-use is not a criterion for > acceptance into boost, looking at what is required of > the client to use the BGL always leaves me feeling > perplexed. Is there any particular reason that a > simplified interface is not made available? Perhaps a > container adapter could be packaged with the library > allowing a compromise of functionality and flexibility > for simplicity? If a graphing problem is trivial, > shouldn't BGL provide a trivial solution? Why are the > simplest useful examples several hundred lines of > code? > > I apologize for all of my vague criticisms - my > intention is not to flame but rather to test the > waters. It is difficult for me to assess whether the > simplicity I yearn for isn't present for stylistic > reasons or whether it would rather necessitate a > sacrifice of flexibility, functionality or > implementation clarity. Nor is it clear to me to what > extent these criteria can be compromised to promote > clarity of client code. For what it is worth, the > kind of ease-of-use I'm imagining might look like: > > #include <less_than_10_graph_headers> > ... > digraph<some_node_type,some_edge_context_type> g; > g << "vertex" << make_pair("vertex", > "implicit_vertex"); > g.add_edge("brother", "sister", "sibling"); > if(g.find(make_pair("brother", "sister"))) > related = true; > > Could someone please elucidate on why it is > impossible/impractical/unnecessary/whatever for a > graph library to have such an interface? Should I > accept that the BGL is not the magic bullet graph > library and move on, or can this kind of simplicity be > somehow found within? > > Thanks in advance, > prs > > > __________________________________ > Do you Yahoo!? > Yahoo! Finance Tax Center - File online. File on time. > http://taxes.yahoo.com/filing.html > _______________________________________________ > Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost >

1 0

Re: boost::variant's and > 10 supported types
by Aleksey Gurtovoy 31 Mar '04

31 Mar '04

Eric Friedman writes: > Preston A. Elder wrote: > > How do I support > 10 types in a variant without having support for > > make_variant_over (since I wish to still support Borland and MSVC 6/.NET > > (aka. 7, not 7.1), as well as gcc). > > To solve your problem under the current implementation, you need a > greater value for BOOST_MPL_LIMIT_LIST_SIZE. I'm unfortunately not > attuned enough to the MPL implementation to know what is involved in > attaining this; I've CCed this to Aleksey Gurtovoy (the MPL maintainer), > who may be able to help you. Just #define-ing BOOST_MPL_LIMIT_LIST_SIZE to something that is a multiple of 10 (e.g. 20) before including Boost headers should work. -- Aleksey Gurtovoy MetaCommunications Engineering

1 0

Lambda question
by Anders Sundman 31 Mar '04

31 Mar '04

Hi all! I'm using the lambda library to compute the sum of squared differences, but I have encountered a puzzling problem. I would really appreciate if someone could explain it to me. This doesn't compile: std::inner_product(i1, i1+x, i2, 0.0, (_1 + _2), (_1*_1)(_1 - _2)); however, this does: std::inner_product(i1, i1+x, i2, 0.0, std::plus<double>(), (_1*_1)(_1 - _2)); The compiler message is very voluminous and hard to read. But I think this part might be of importance, the (double&, double) looks strange: /usr/include/c++/3.3/bits/stl_numeric.h:119: error: no match for call to `( boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambd a::arithmetic_action<boost::lambda::plus_action>, boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::placeholder <1> >, boost::lambda::lambda_functor<boost::lambda::placeholder<2> >, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type> > >) (double&, double)' /usr/include/boost/lambda/detail/lambda_functors.hpp:142: error: candidates are: typename T::sig<boost::tuples::null_type>::type boost::lambda::lambda_functor<Base>::operator()() const [with T = boost::lambda::lambda_functor_base<boost::lambda::arithmetic_action<boost::la mbda::plus_action>, Many thanks in advance Anders Sundman

2 3

Error building Boost_1_30_0
by Albert Gome 31 Mar '04

31 Mar '04

Hi, I am build Boost_1_30_0 on HPUX11.11 using gcc 3.3.3. I m getting these errors. skipping Boost.Python library build due to missing or incorrect configuration couldn't find Python.h in "/usr/local/include/python2.2" . . . . . ...patience... ...found 2254 targets... ...updating 295 targets... gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/c_regex_traits.o libs/regex/src/c_regex_traits.cpp: In static member function `static void boost::c_regex_traits<char>::update()': libs/regex/src/c_regex_traits.cpp:655: call of overloaded `getlocale(int)' is ambiguous /usr/include/locale.h:114: candidates are: locale_data* getlocale(int) libs/regex/src/c_regex_traits.cpp:62: const char* <unnamed>::getlocale(int) libs/regex/src/c_regex_traits.cpp:658: call of overloaded `getlocale(int)' is ambiguous /usr/include/locale.h:114: candidates are: locale_data* getlocale(int) libs/regex/src/c_regex_traits.cpp:62: const char* <unnamed>::getlocale(int) libs/regex/src/c_regex_traits.cpp:660: call of overloaded `getlocale(int)' is ambiguous /usr/include/locale.h:114: candidates are: locale_data* getlocale(int) libs/regex/src/c_regex_traits.cpp:62: const char* <unnamed>::getlocale(int) libs/regex/src/c_regex_traits.cpp:663: call of overloaded `getlocale(int)' is ambiguous /usr/include/locale.h:114: candidates are: locale_data* getlocale(int) libs/regex/src/c_regex_traits.cpp:62: const char* <unnamed>::getlocale(int) g++ -c -Wall -ftemplate-depth-100 -DBOOST_REGEX_NO_LIB=1 -DBOOST_REGEX_STATIC_LINK=1 -g -O0 -fno-inline -I"libs/regex/build" -I "/mnt/r7/apal3/lib/boost_1_30_0" -o "libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/c_regex_traits.o" "libs/regex/build/../src/c_regex_traits.cpp" ...failed gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/c_regex_traits.o... gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/c_regex_traits_common.o gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/cpp_regex_traits.o gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/cregex.o gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/fileiter.o gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/posix_api.o gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/regex.o gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/regex_debug.o gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/regex_synch.o gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/w32_regex_traits.o . . . . . ...skipped <libs!regex!build/libboost_regex.a/gcc/debug/runtime-link-dynamic>libboost_regex_debug.a for lack of <libs!regex!build/libboost_regex.a/gcc/debug/runtime-link-dynamic>libboost_regex_debug.a(c_regex_traits.o)... ...skipped <!libs!regex!build!bin-stage>libboost_regex_debug.a for lack of <libs!regex!build/libboost_regex.a/gcc/debug/runtime-link-dynamic>libboost_regex_debug.a... gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/release/runtime-link-dynamic/c_regex_traits.o libs/regex/src/c_regex_traits.cpp: In static member function `static void boost::c_regex_traits<char>::update()': libs/regex/src/c_regex_traits.cpp:655: call of overloaded `getlocale(int)' is ambiguous /usr/include/locale.h:114: candidates are: locale_data* getlocale(int) libs/regex/src/c_regex_traits.cpp:62: const char* <unnamed>::getlocale(int) libs/regex/src/c_regex_traits.cpp:658: call of overloaded `getlocale(int)' is ambiguous /usr/include/locale.h:114: candidates are: locale_data* getlocale(int) libs/regex/src/c_regex_traits.cpp:62: const char* <unnamed>::getlocale(int) libs/regex/src/c_regex_traits.cpp:660: call of overloaded `getlocale(int)' is ambiguous /usr/include/locale.h:114: candidates are: locale_data* getlocale(int) libs/regex/src/c_regex_traits.cpp:62: const char* <unnamed>::getlocale(int) libs/regex/src/c_regex_traits.cpp:663: call of overloaded `getlocale(int)' is ambiguous /usr/include/locale.h:114: candidates are: locale_data* getlocale(int) libs/regex/src/c_regex_traits.cpp:62: const char* <unnamed>::getlocale(int) g++ -c -Wall -ftemplate-depth-100 -DNDEBUG -DBOOST_REGEX_NO_LIB=1 -DBOOST_REGEX_STATIC_LINK=1 -O3 -finline-functions -Wno-inline -I"libs/regex/build" -I "/mnt/r7/apal3/lib/boost_1_30_0" -o "libs/regex/build/bin/libboost_regex.a/gcc/release/runtime-link-dynamic/c_regex_traits.o" "libs/regex/build/../src/c_regex_traits.cpp" ...failed gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/release/runtime-link-dynamic/c_regex_traits.o... Does anybody know how to reolve this? Thnks Albert --------------------------------- Do you Yahoo!? Yahoo! Finance Tax Center - File online. File on time.

2 1

boost::variant's and > 10 supported types
by Preston A. Elder 31 Mar '04

31 Mar '04

Hi, How do I support > 10 types in a variant without having support for make_variant_over (since I wish to still support Borland and MSVC 6/.NET (aka. 7, not 7.1), as well as gcc). To be precise, I need 18 types to be supported. -- PreZ Founder The Neuromancy Society http://www.neuromancy.net

5 4

boost::filesystem::exists() & GetfileAttributesA
by Sebastian Orfino 31 Mar '04

31 Mar '04

Hi, I am experiencig a problem with exists() and its Windows implementation with GetFileAttributes API. I am using exists() prior to the scan of a directory to see if it exists; the fact is that on W2K (just tested it on that OS) after a day or two GetFileAttributesA() returns INVALID_FILE_ATTRIBUTES but the path does exists (it is a UNC-style path). After a restart of the app, all works fine. So, should I use exists() this way ? I don't know why not. Or just use directory_iterator and scan the hot-folder right away catching any exceptions ?. I don't want to iterate over a direcotry that doesn't exists if I could knew that in advance; besides, I don't know if that will work anyway. Does anyone know somthing about this GetFileAttributesA/boost::exists() behavior ? Thanks in advance, Sebastian.

4 6

vc7.1-stlport
by GoochRules! 31 Mar '04

31 Mar '04

Greetings, I am attempting to build boost using "-sTools=vc7.1-stlport". I have copied the STLport libaries to C:\src\lib. The STLport headers are in c:\src\include\stlport. I extracted the STLport archive to c:\src\STLport-4.6.1. I have tried STLPORT_PATH=c:\src, c:\src\lib, c:\src\include, and c:\src\include\stlport with STLPORT_VERSION unset, and set to 4.6.1, as well as both unset. Boost succeeds in building, yet does not link against the STLport libraries (as reported by depends.exe), but rather to MSVCP71.DLL and MSVCP71.DLL (the C++ and C runtime libraries provided by vc7.1 I presume). I have ensured that c:\src\lib is first in %LIB% and c:\src\include\stlport;c:\src\include; is first in %INCLUDE% Any suggestions for what my STLport setup should look like are appreciated, as well as pointers on getting boost to link against the STLport libraries. --Matthew Peltzer

3 3

Boost Python on Mac OS X
by James Mastro 31 Mar '04

31 Mar '04

Hello all, I'm trying to use Boost Python on Mac OS X 10.3. I'm following along with what is at http://www.boost.org/libs/python/doc/tutorial/doc/ building_hello_world.html. After using bjam like this: bjam -sTOOLS=darwin the following are built: libboost_python.dylib hello.so This seems to be correct. I'm not totally sure where they are supposed to go, so I put them in next to Python in the Python framework so Python could find them to import. It found them, but an "import hello" in Python resulted in: ImportError: Failure linking new module: ../../../../bin/boost/libs/python/build/libboost_python.dylib/darwin/ debug/shared-linkable-true/libboost_python.dylib: dyld: /Applications/MacPython-2.3/PythonIDE.app/Contents/MacOS/PythonIDE can't open library: ../../../../bin/boost/libs/python/build/libboost_python.dylib/darwin/ debug/shared-linkable-true/libboost_python.dylib (No such file or directory, errno = 2) Before putting the 2 libs in, "import hello" found nothing. So I assume Python is finding the hello module now, but not liking it. Can anyone show me where I've gone wrong? Many thanks. -jim

2 1

Installing pyste
by Yannick Patois 31 Mar '04

31 Mar '04

Hi, When running "bjam install" from top-level directory, even with PYTHON_ROOT set correctly, it only creates shared libs but doesnt build and install pyste. What should be done to install it properly ? I finally went to libs/python/pyste/install and executed: python setup.py install I would expect this to be wrapped in some top-level command. Did I miss something in the doc ? Thanks, Yannick

2 1

Compilation problems on Linux
by mayankg＠iiitb.ac.in 31 Mar '04

31 Mar '04

Hi, We are trying to use the libboost_python.so library in Linux with our project. When we try to compile the C++ file of our project having all the boost interfaces, we get the following compilation error only on Linux. Although on Windows it works fine. We are using the Python 2.2.3 and Boost 1.30.2 versions. /usr/include/boost/python/converter/as_to_python_function.hpp:28: sorry, unimplemented: ` method_call_expr' not supported by dump_expr /usr/include/boost/python/converter/as_to_python_function.hpp:28: sorry, unimplemented: ` method_call_expr' not supported by dump_expr /usr/include/boost/python/converter/as_to_python_function.hpp:28: sorry, unimplemented: ` method_call_expr' not supported by dump_expr /usr/include/boost/python/converter/as_to_python_function.hpp:28: sorry, unimplemented: ` method_call_expr' not supported by dump_expr Please help, Regards, Mayank

2 1

Location and namespace of a boost library (say, iterators)
by Deane Yang 31 Mar '04

31 Mar '04

I'm sorry if I'm being dumb about this, but I've run into the following difficulty a couple of times with boost libraries. I've decided to try using the new boost iterator library. Based on the documentation, I think I want to use iterator_adaptor. But scanning through the documentation, I don't immediately see - what namespace iterator_adaptor lives in. I assume it's just boost, but it probably doesn't hurt to mention this explicitly, since some boost libraries use sub-namespaces. - what header file to include. I couldn't find this in the documentation. I can figure all of this out, but it is helpful to have it specified in the documentation.

2 1

Installing Boost 1_30_0 on HPUX
by Albert Gome 31 Mar '04

31 Mar '04

Hi, I am new to BOOST and i like to install that on HPUX11.11. I have downloaded BOOST_1_30_0 and have gcc installed on HPUX. What is the efficient way of installing it. ie the parameters with the bjam. Thanks Albert __________________________________ Do you Yahoo!? Yahoo! Finance Tax Center - File online. File on time. http://taxes.yahoo.com/filing.html

2 1

[BGL] Finding out what properties exist in a graph?
by Steve Juranich 30 Mar '04

30 Mar '04

Is there an easy way to find out all of, for instance, the vertex properties associated with a graph? What I'm looking for is something like the following: <pseduocode> vector<properties> my_vertex_properties; property_iterator pi, last; for(tie(pi, last) = vertex_property_list(Graph); pi != last; ++pi) my_vertex_properties.push_back(*pi); </pseudocode> How about it? Does anything like this exist or am I just daydreaming again? Thanks. -- Stephen W. Juranich Science Applications Intl. Corp. (SAIC) (520) 570-7706

2 2

Serialization library
by Steve Folly 30 Mar '04

30 Mar '04

Hi, I'm looking using the Robert Ramey's serialization library for our own projects and would like to know it's current status. Obviously, it's not in 1.31.0, so what are the plans for it's future inclusion? Thanks. Steve.

2 1

graph, dfs search
by Peter Aronsson 30 Mar '04

30 Mar '04

Hi. I am having a problem with depth_first_search. The thing I do different is that I do not put any info in a property map and I do not want to bother myself with colormaps etc. The application code does: Graph g; pass2_visitor vis; depth_first_search(g,boost::visitor(vis)); But I get a compilation error, saying that it can not find a suitable operator+ in the property_map... See attached files for complete example. Grateful for all help! (I am running from HEAD on sourceforge cvs ) Regards Peter Aronsson -- _________________________________________________________________ / Peter Aronsson, Phd Student at PELAB (Programming Environments \ | Laboratory ) Department for Computer & Information Science | | Linköping University, Sweden | |=================================================================| | petar(a)ida.liu.se , phone +46 (0)13-28 1737 Room 3B:490 | \_________________________________________________________________/ #include "tg.hpp" int main() { TaskGraph g; pass2_visitor vis; depth_first_search(g,boost::visitor(vis)); } #ifndef _TASKGRAPH_H #define _TASKGRAPH_H #include <boost/config.hpp> #include <iostream> // for std::cout #include <utility> // for std::pair #include <algorithm> // for std::for_each #include <boost/utility.hpp> // for boost::tie #include <boost/graph/graph_traits.hpp> // for boost::graph_traits #include <boost/graph/adjacency_list.hpp> #include <boost/graph/adjacency_iterator.hpp> #include <boost/graph/graphviz.hpp> #include <boost/graph/depth_first_search.hpp> //Task graph types using namespace std; using boost::tie; struct vertex_execcost_t { typedef boost::vertex_property_tag kind; }; struct vertex_unique_id_t { typedef boost::vertex_property_tag kind; }; struct edge_result_set_t { typedef boost::edge_property_tag kind; }; typedef boost::property<boost::vertex_name_t,string, boost::property<vertex_execcost_t,float, boost::property<vertex_unique_id_t, int > > > VertexProperty; typedef boost::property<boost::edge_weight_t, int > EdgeProperty; typedef boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, VertexProperty, EdgeProperty> TaskGraph; typedef boost::graph_traits<TaskGraph>::vertex_descriptor VertexID; class pass2_visitor : public boost::default_dfs_visitor { public: pass2_visitor(/* initialize containers to store stuff in*/) { }; template <typename Vertex, typename Graph> void discover_vertex(Vertex u, const Graph & g) const { // Do some stuff }; }; #endif

2 4

CVS import gotcha - beware!
by Steve Folly 29 Mar '04

29 Mar '04

Hi, Most of you are probably aware of this, but I just thought I'd share my experience with trying to import the new version of boost into our CVS repository using 'cvs import': It wasn't recognising new folders - e.g. boost/spirit/core and all it's contents. I was puzzling it for a while until I realised the import output was showing 'I' next to boost/spirit/core. Aha - it's ignored. DOH! Well, core files are ignored, aren't they! To all those who have been long suffering with this : don't forget to include '-I !' in the command to include all files!! I'll be happy if it helps at least one person! :) -- Regards, Steve.

1 0

RE: [Boost-users] Defining less on member variables/functions
by Chris Jurney 29 Mar '04

29 Mar '04

In this case, I could have used pair's operator<, but if I have a class by value as the second item of the pair that doesn't have a meaningful operator<, I want to ignore it in the sort. Thanks for all the help, guys. Chris -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Victor A. Wagner Jr. Sent: Friday, March 26, 2004 8:40 AM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] Defining less on member variables/functions why do you want to sort ONLY on the 1st element of the pair? At Thursday 2004-03-25 11:34, you wrote: >content-class: urn:content-classes:message >Content-Type: multipart/alternative; > boundary="----_=_NextPart_001_01C41297.D800D40A" > >I've had this same pattern come up 4 or 5 times now, and each time I've >been unable to find a stl + boost solution that allowed me to do what I >want without writing my own less function. Basically, I want something >that will let me do a sort, or define a map on structs or pairs without >writing a less that compares the member variable or ..first. My last attempt: > >vector<pair<float, float>> myVector >std::sort(myVector.begin(), myVector.end(), _1.first < _2.first); > >No such luck. It looks like I can do operator * and & on lambda objects, >but not access members through them. Is there anything in boost, stl, or >elsewhere that lets me not write this: > >class myLess >{ > bool operator() (pair<float, float> a, pair<float, float>b) > {return a.first < b.first;} >} > >Thanks for any help, >Chris > > >_______________________________________________ >Boost-users mailing list >Boost-users(a)lists.boost.org >http://lists.boost.org/mailman/listinfo.cgi/boost-users Victor A. Wagner Jr. http://rudbek.com The five most dangerous words in the English language: "There oughta be a law" _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0