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

[Regex] Case insensitive pb
by f_mayot 07 Nov '02

07 Nov '02

Hi, Maybe a stupid question but I didn't manage to make my regular expression objects case insensitive. What should I do insted of this : boost::regex* pRegExp = new boost::wregex(sRegExp); ? Thanks. Fred

4 3

Can't use adjacency_list AND adjacency_matrix in same program
by loopylozzysdad 06 Nov '02

06 Nov '02

Hi, It seems to me that you can't use adjacency_list AND adjacency_matrix in the same program. When I had both the relevant inludes in the program I got duplicate definition errors from the linker. Is this by design, or a bug? Cheers - Richard Howells (loopylozzydad at yahoo dot com)

3 2

RE: [Boost-Users] shared_ptr capabilities
by Mark Storer 06 Nov '02

06 Nov '02

>I don't believe the above statement will affect me, >but I just want to be sure Correct. A language-level array is not an STL container. There IS a shared_ptr-like template called shared_array that calls "delete []" instead of "delete". Had to look that one up. It doesn't get used much. std::vector is a superior choice (in every situation I can think of). An STL container of shared_ptr's is just fine. Just don't create a circular reference. --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard; -----Original Message----- From: Collin Peters [mailto:yg-boost-users@m.gmane.org] Sent: Wednesday, November 06, 2002 1:04 PM To: boost-users(a)yahoogroups.com Subject: [Boost-Users] shared_ptr capabilities http://www.boost.org/libs/smart_ptr/shared_ptr.htm states that: "Normally, a shared_ptr cannot correctly hold a pointer to a dynamically allocated array. See shared_array for that usage." What I hope to use shared_ptr for, is to store pointers to a class in a vector, and that class will also have a vector that stores pointers via shared_ptr. example: class Foo { int a; } class one { int var1; int var2; std::vector<Foo> foo_vector; } class two { std::vector<one> one_vector; } I don't believe the above statement will affect me, but I just want to be sure Collin Peters Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

shared_ptr capabilities
by Collin Peters 06 Nov '02

06 Nov '02

http://www.boost.org/libs/smart_ptr/shared_ptr.htm states that: "Normally, a shared_ptr cannot correctly hold a pointer to a dynamically allocated array. See shared_array for that usage." What I hope to use shared_ptr for, is to store pointers to a class in a vector, and that class will also have a vector that stores pointers via shared_ptr. example: class Foo { int a; } class one { int var1; int var2; std::vector<Foo> foo_vector; } class two { std::vector<one> one_vector; } I don't believe the above statement will affect me, but I just want to be sure Collin Peters

3 2

Q: Problems building boost.python under cygwin
by "Schnörr, Claudius Dr." 06 Nov '02

06 Nov '02

Hello, I run into problems building boost under cygwin. It seems to be merely a matter of a wrong configuration or wrong scripts. After running 'bjam -sTOOLS=gcc -n > build.com' in boost/libs/python/build in order to get hands on the statements being executed by bjam, there had to be made a lot of textual replacements to get the statements in build.com run: Just to mention some: - replace '-isystem ' by '-I' - remove '-I""' - change shared library-names from *.so to *.dll - insert '-L <path_to_libpython2.2.dll> -lpython2.2' where shared libs are created In boost/libs/python/test, going the same way, there have in addition this changes to be made: - LD_LIBRARY_PATH=... --> PATH=$PATH:..., because cygwin uses PATH to look for .dlls My question: I think there have to be made more configurations than I did to create the boost.python-stuff under cygwin. Where have they to be done, and what? (I already configured environment variables like GCC_ROOT_DIRECTORY, GXX, PYTHON_ROOT, ...etc...) Any suggestions are welcome! Please send a copy of your answer to schnoerr(a)mailzone.com Thank you in advance, Claudius --------------------------------------------------------- This Mail has been checked for Viruses Attention: Encrypted mails can NOT be checked! ** Diese Mail wurde auf Viren geprueft Hinweis: Verschluesselte mails koennen NICHT auf Viren geprueft werden! ---------------------------------------------------------

2 1

RE: [Boost-Users] set thread priority
by Mark Storer 05 Nov '02

05 Nov '02

I'd think you could get away with something like a set range, like 0 to 1000, and then map those values into whatever system is present. You could even use floating point values, 0.0 to 1.0, though people might look at you cross-eyed, at least until they got used to the idea. Then it's just a matter of mapping those ranges to whatever OS settings are present. You just state up front a couple caveats: Given two threads, A (higher priority) and B (lower priority), you only guarentee that A won't be given a lower underlying system priority than B. This would save you quite a bit of grief... particularly when someone wants threads with priority 1.0, 0.99 and 0.98. The thread with 0.98 might not run slower than the one with a 1.0 priority, but it certainly won't be faster. SOUNDS simple enough. At least to someone whose sum total multi-threading experience is a toy java applet and a dozen lines of boost::thread code. ;) --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard;

3 3

set thread priority
by boxerab 05 Nov '02

05 Nov '02

Dear Boost Users, I am considering using the boost thread library; currently I use the Win32 API for threading on Windows. Is it possible to set the thread priority of a boost thread? Thanks! Aaron Boxer boxerab(a)NOSPAMyahoo.com

2 1

can't compile johnson-eg.cpp with VC6
by chul_de_condares 05 Nov '02

05 Nov '02

I get the following errors when trying to compile the example code for johnson_all_pairs_shortest_paths. Has anyone ever seen this before? Thanks in advance. d:\swapps\source\axrt\c\boost\boost_1_29_0 \boost\graph\johnson_all_pairs_shortest.hpp(61) : error C2899: typename cannot be used outside a template declaration d:\swapps\source\axrt\c\boost\boost_1_29_0 \boost\graph\johnson_all_pairs_shortest.hpp(166) : see reference to function template instantiation 'bool __cdecl boost::johnson_all_pairs_shortest_paths(class boost::adjacency_list<struct boost::vec S,struct boost::vecS,struct boost::directedS,struct boost::no_property,struct boost::property<enum boost::edge_weight_t,int,struct boost::property<enum boost::edge_weight2_t,int,struct boost::no_property> >,struct boost::no_property,struct boost::li stS> &,int (&)[5][5],struct boost::vec_adj_list_vertex_id_map<struct boost::no_property,unsigned int>,struct boost::adj_list_edge_property_map<struct boost::directed_tag,int,int const &,unsigned int,struct boost::property<enum boost::edge_weight_t,i nt,struct boost::property<enum boost::edge_weight2_t,int,struct boost::no_property> > const ,enum boost::edge_weight_t>,int)' being compiled d:\swapps\source\axrt\c\boost\boost_1_29_0 \boost\graph\johnson_all_pairs_shortest.hpp(84) : error C2899: typename cannot be used outside a template declaration d:\swapps\source\axrt\c\boost\boost_1_29_0 \boost\graph\johnson_all_pairs_shortest.hpp(166) : see reference to function template instantiation 'bool __cdecl boost::johnson_all_pairs_shortest_paths(class boost::adjacency_list<struct boost::vec S,struct boost::vecS,struct boost::directedS,struct boost::no_property,struct boost::property<enum boost::edge_weight_t,int,struct boost::property<enum boost::edge_weight2_t,int,struct boost::no_property> >,struct boost::no_property,struct boost::li stS> &,int (&)[5][5],struct boost::vec_adj_list_vertex_id_map<struct boost::no_property,unsigned int>,struct boost::adj_list_edge_property_map<struct boost::directed_tag,int,int const &,unsigned int,struct boost::property<enum boost::edge_weight_t,i nt,struct boost::property<enum boost::edge_weight2_t,int,struct boost::no_property> > const ,enum boost::edge_weight_t>,int)' being compiled Error executing cl.exe. test.obj - 2 error(s), 0 warning(s)

1 0

Boost Python v2 - extending and embedding - memory leaks, compiler warnings
by texrmex 04 Nov '02

04 Nov '02

First, I'm excited about the new work that's been done with Boost Python v2. I can't wait to see if it's enough to overcome the pitfalls that prevented me from getting past the evaluation stage with v1. I'm using VC7 IDE to build my project and link to python22.lib and boost_python.lib (built with VC7 command line tools using bjam). I'm attempting to extend and embed in my existing project, so I'm not building a dll, but and exe. First of all, can I do this? When it links it says "Creating library ....lib and object ....exp", and still creates an exe. If I don't include my test module (and thus boost/python.hpp) I don't get this message. I'm assuming that by defining a module, boost defines exports and the linker then creates the lib and exp, since there were exports? Although I've built dlls before, I really don't know the inner workings of the process. The following is a brief example of my module. At the bottom is a simple test function that I'm calling just to test importing of the module. When I call TestModule(), I get 2 memory leaks from the module definition section, one from the class definition, and the other from the method definition. If I remove these, I get no memory leaks, and if I add more classes and methods, I get one 12 byte leak per class and one 12 byte leak per method I add. I do not get a leak from defining the top level function "greet". /////////////////////////////////////////////////// #include <boost\python.hpp> using namespace boost::python; namespace { const char * greet() { return "Hello World"; } class CSimple { public: bool Test() { return true; } }; }; BOOST_PYTHON_MODULE(Test) { def("greet", greet); class_<CSimple>("Simple") .def("Test", &CSimple::Test) ; } void TestModule() { Py_Initialize(); initTest(); Py_Finalize(); } /////////////////////////////////////////////////// In addition to the memory leaks, I get a number of compiler warnings, similar to the following: d:\Boost\boost\python\instance_holder.hpp(18) : warning C4275: non dll-interface class 'boost::noncopyable' used as base for dll- interface struct 'boost::python::instance_holder' d:\Boost\boost\utility.hpp(50) : see declaration of 'boost::noncopyable' d:\Boost\boost\python\instance_holder.hpp(17) : see declaration of 'boost::python::instance_holder' *and* d:\Boost\boost\python\detail\exception_handler.hpp(34) : warning C4251: 'boost::python::detail::exception_handler::m_impl' : class 'boost::function2<R,T0,T1,Policy,Mixin,Allocator>' needs to have dll-interface to be used by clients of struct 'boost::python::detail::exception_handler' with [ R=bool, T0=const boost::python::detail::exception_handler &, T1=const boost::function0<void,boost::empty_function_policy,boost::empty_functi on_mixin,int> &, Policy=boost::empty_function_policy, Mixin=boost::empty_function_mixin, Allocator=int ] I was wondering if my project is not set up properly, and if these warnings might have something to do with the memory leaks. In v1 there was a vc project you could use for building boost python. This works well if you are planning on linking to a vc built project, since you can make sure your settings, paths and libs are consistent between the boost python lib and your project. I currently have 3 different sets of build tools (yes, 3 compilers) on this box, with several different versions of standard and other libraries, so making sure I have control of the paths and settings used is very important. This is one reason I'm weary of the jam environment. It's yet another build environment, one that I'm not familiar with, and one that I'm not going to be using with any other projects except to build boost python. So a question would be: how easy would it be for me to set up a VC project for building boost python? Has this already been done? Or am I barking up the wrong tree? Thanks in advance, -Tex

1 0

RE: [Boost-Users] Iterator Adaptor Question
by Hickman, Greg 04 Nov '02

04 Nov '02

> -----Original Message----- > From: Mark Storer [mailto:mstorer@cardiff.com] > > You wrote up your sample so anyone could easily compile it... Thanks for noticing. :) > On > VC++ v6, I got two compiler errors: > > samplecode.cpp(58) : error C2663: 'reset' : 2 overloads have > no legal conversion for 'this' pointer > samplecode.cpp(59) : error C2678: binary '=' : no operator > defined which takes a left-hand operand of type 'const class > boost::shared_ptr<struct Shape const >' (or there is no > acceptable conversion) > > These errors are on the two lines you want to prevent. > > My first impression of the code was that it was already > illegal to perform those two actions. You shouldn't be able > to call non-const functions through a const_iterator, and > since neither reset() nor operator=() are const, no problem. > Right? I wasn't expecting the first error message, but the > second is in line with my expectations. > > I take it this code compiles for you? What tools/OS/etc are > you using? Unfortunately it does. I'm using Borland C++ Builder 5, for which I believe I have all of the available patches installed. (I'm using the IDE, but my command-line tells me I'm using Borland C++ 5.5.1. Borland gives away a set of free command-line tools that are distinct from the Builder IDE, and it may be that the compiler they give away is now more compliant than the one included in C++ Builder 5. If there is a way to point my IDE at the latest version of the free compiler, I don't know how to do it. I need to get gcc set up on my machine as a sanity check.) My first thought was that iterator_adaptor might be stripping away the const-ness from reference_type<const Const_shape_ptr>, and that the pointer type being generated was somehow pointing to a non-const Const_shape_ptr, thus allowing the indicated lines to compile. However, since you seem to get the desired results, perhaps the problem is with my compiler (or with Boost's support of it). Thanks very much for taking the time to respond. -Greg Hickman

1 0

Property maps
by Edward Diener 04 Nov '02

04 Nov '02

The documentation for boost::property_map is awful, so would someone please explain to me what this implementation does and how it differs from std::map<> and std::multi_map<> ? I know this post sounds irascible and I am not trying to dump on Mr. Siek but really I do not understand what this idea is or why one should use it over and above what already exists in the C++ standard library. I only wish that Boost implementors would stop explaining their ideas through examples and start explaining them in logical ways in which a knowledge of the English language would suffice.

1 0

RE: [Boost-Users] Iterator Adaptor Question
by Mark Storer 04 Nov '02

04 Nov '02

>Specifically, I'd like to prevent clients from writing the two lines >preceeding the return from main below. Can anyone help? Eh? You wrote up your sample so anyone could easily compile it... and I did. On VC++ v6, I got two compiler errors: samplecode.cpp(58) : error C2663: 'reset' : 2 overloads have no legal conversion for 'this' pointer samplecode.cpp(59) : error C2678: binary '=' : no operator defined which takes a left-hand operand of type 'const class boost::shared_ptr<struct Shape const >' (or there is no acceptable conversion) These errors are on the two lines you want to prevent. My first impression of the code was that it was already illegal to perform those two actions. You shouldn't be able to call non-const functions through a const_iterator, and since neither reset() nor operator=() are const, no problem. Right? I wasn't expecting the first error message, but the second is in line with my expectations. I take it this code compiles for you? What tools/OS/etc are you using? --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard; -----Original Message----- From: Hickman, Greg [mailto:greg.hickman@lmco.com] Sent: Friday, November 01, 2002 2:22 PM To: Boost-Users (Boost-Users(a)yahoogroups.com) Subject: [Boost-Users] Iterator Adaptor Question The following code illustrates a problem I'm having trying to use iterator_adaptor. Basically, I have a container of shared pointers to mutable, and I'd like to provide a const_iterator to clients that disallows modification of both the shared pointer as well as the pointee. Specifically, I'd like to prevent clients from writing the two lines preceeding the return from main below. Can anyone help? Thanks, Greg #include <boost/iterator_adaptors.hpp> #include <boost/shared_ptr.hpp> #include <vector> using namespace boost; using namespace std; struct Shape { virtual ~Shape() {} virtual void draw() const = 0; virtual void update() = 0; }; struct Concrete_shape : Shape { void draw() const {} void update() {} }; typedef shared_ptr<Shape> Shape_ptr; typedef shared_ptr<const Shape> Const_shape_ptr; struct Picture { typedef vector<Shape_ptr> Shapes; // Declare a const_iterator that converts // to the underlying Shape_ptr to a // Const_shape_ptr. Since the returned // Const_shape_ptr is a temporary, clients // shouldn't be allowed to modify it. typedef iterator_adaptor< Shapes::const_iterator, default_iterator_policies, value_type_is<Const_shape_ptr>, reference_is<const Const_shape_ptr>, iterator_category_is<input_iterator_tag> > const_iterator; const_iterator begin() const { return const_iterator(shapes_.begin()); } Shapes shapes_; }; int main(int argc, char* argv[]) { Picture pic; const Picture& cpic = pic; pic.shapes_.push_back(Shape_ptr(new Concrete_shape)); Picture::const_iterator i = cpic.begin(); // I'd like to prevent clients from writing... i->reset(new Concrete_shape); *i = Const_shape_ptr(new Concrete_shape); return 0; } Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

Bug fix for format library
by Fred Jackson 04 Nov '02

04 Nov '02

I found a bug in the format library and fixed it. strm << boost::format("%64.64s") % "hello"; gave an access violation. It was caused by passing an argument greater than the string length to std::string::erase. I added a check so as not to try to erase text that is not there. Here is a diff of my small fix. < is feed_args.hpp from the boost_1_29_0 distribution. > is my fixed file. 158c158,162 < if (specs.truncate_ >= 0) --- > // @@@@@ fjackson 20021022 Added test to make sure we don't call > // std::string::erase with an arg greater than the length - this > // caused an access violation, noted on outputting a short string > // with a %64.64 format specifier. > if (specs.truncate_ >= 0 && specs.truncate_ < res.length())

1 0

Wrapping a std::list with boost.python
by jefflholle 03 Nov '02

03 Nov '02

I've just started experimenting with version 2 of boost.python. In iterator.cpp, a std::list is wrapped using following code: typedef std::list<int> list_int; void push_back(list_int& x, int y) { x.push_back(y); } int back(list_int& x) { return x.back(); } . . . class_<list_int>("list_int") .def("push_back", push_back) .def("back", back) .def("__iter__", iterator<list_int>()) ; Is it possible to use the container methods instead of user defined functions? I've tried the code: class_<list_int>("list_int") .def("push_back", &list_int::push_back) .def("back", &list_int::back) .def("__iter__", iterator<list_int>()) ; This doesn't work. Am what I'm tried to do possible? If so, how?

2 1

Re: linker problem with boost::thread
by Eske Christiansen 03 Nov '02

03 Nov '02

sorry, have fixed the problem. the correct way of linking with boost::thread is: g++ foo.cpp -lboost_thread -lpthread yours eske

1 0

Making boost/test pause so the console can be read when running the tester from an IDE.
by Sean Shubin 03 Nov '02

03 Nov '02

My version of C++ builder does not pause to let me see console output. This makes it difficult to use boost/test while I am running the program from the IDE. The solution I found most useful, is to make the last test wait for the user to press enter. If anyone has solved this a different way, I would like to hear about it. #include <boost/test/unit_test.hpp> using boost::unit_test_framework::test_suite; using std::cout; using std::cin; using std::endl; void waitForUserToPressEnter() { cout << "Press <ENTER> to continue..." << endl; cin.get(); } test_suite* init_unit_test_suite(int argc, char* argv[]) { test_suite* test = BOOST_TEST_SUITE("Master test suite"); //add other tests here test->add(BOOST_TEST_CASE(&waitForUserToPressEnter)); return test; }

4 3

linker problem with boost::thread
by Eske Christiansen 02 Nov '02

02 Nov '02

Hi all I'm new to this list and I have a question. I want to use the thread lib in g++ 2.96.110 under redhat 7.3 I have the test e.x. #include <boost/thread/thread.hpp> #include <iostream> void hello() { std::cout << "Hello world, I'm a thread!" << std::endl; } int main(int argc, char* argv[]) { boost::thread thrd(&hello); thrd.join(); return 0; } (from cuj.com) I try to compile with g++ -lboost_thread foo.cpp I get the the error(s): /tmp/ccdoKT37.o: In function `main': /tmp/ccdoKT37.o(.text+0x53): undefined reference to `boost::thread::thread(boost::function0<void, boost::empty_function_policy, boost::empty_function_mixin, allocator<boost::function_base> > const &)' /tmp/ccdoKT37.o(.text+0x75): undefined reference to `boost::thread::join(void)' /tmp/ccdoKT37.o(.text+0x86): undefined reference to `boost::thread::~thread(void)' /tmp/ccdoKT37.o(.text+0xbe): undefined reference to `boost::thread::~thread(void)' collect2: ld returned 1 exit status What do I do wrong. I don't want to use jam og bjam files because all my works i build by using automake. yours eske

1 0

Basic Overviews Needed
by Sam Gentile 02 Nov '02

02 Nov '02

Hi Folks, I am new to Boost. I have looked at the Boost Documentation on the web (http://www.boost.org/libs/libraries.htm) and although it does a very excellent job of listing all the libraries, it doesn't really have any overview documents or tutorials as such. What I would like is some documents that tell me the power of Boost, what its useful for, etc. Any help would be greatly appreciated. Sam Gentile .NET Consultant ManagedCode(a)attbi.com http://www.samgentile.com http://radio.weblogs.com/0105852/ [Non-text portions of this message have been removed]

4 4

compiler warning
by Matthew Galati 01 Nov '02

01 Nov '02

hi, using gcc version 2.96 20000731 (Red Hat Linux 7.3 2.96-110) does anyone know the pragma for turning this compiler warning off? or is this warning telling me something - do i need to configure my compiler differently? /home/mgalati/source/boost_1_29_0/boost/integer_traits.hpp:186: warning: ISO C++ does not support `long long' thanks, matt

2 1

RE: [Boost-Users] Making boost/test pause so the console can be read when running the tester from an IDE.
by Sean Shubin 01 Nov '02

01 Nov '02

Tried it. The "return test" line completes the creation of the tests, but not their execution. When that breakpoint is reached, the tests have not been run, so there is not output. -----Original Message----- From: Jeff Garland [mailto:jeff@crystalclearsoftware.com] Sent: Friday, November 01, 2002 2:37 PM To: Boost-Users(a)yahoogroups.com Subject: RE: [Boost-Users] Making boost/test pause so the console can be read when running the tester from an IDE. > My version of C++ builder does not pause to let me see console output. This makes it > difficult to use boost/test while I am running the program from the IDE. The solution > I found most useful, is to make the last test wait for the user to press enter. If > anyone has solved this a different way, I would like to hear about it. Set a breakpoint on return test... HTH, Jeff

2 1

Iterator Adaptor Question
by Hickman, Greg 01 Nov '02

01 Nov '02

The following code illustrates a problem I'm having trying to use iterator_adaptor. Basically, I have a container of shared pointers to mutable, and I'd like to provide a const_iterator to clients that disallows modification of both the shared pointer as well as the pointee. Specifically, I'd like to prevent clients from writing the two lines preceeding the return from main below. Can anyone help? Thanks, Greg #include <boost/iterator_adaptors.hpp> #include <boost/shared_ptr.hpp> #include <vector> using namespace boost; using namespace std; struct Shape { virtual ~Shape() {} virtual void draw() const = 0; virtual void update() = 0; }; struct Concrete_shape : Shape { void draw() const {} void update() {} }; typedef shared_ptr<Shape> Shape_ptr; typedef shared_ptr<const Shape> Const_shape_ptr; struct Picture { typedef vector<Shape_ptr> Shapes; // Declare a const_iterator that converts // to the underlying Shape_ptr to a // Const_shape_ptr. Since the returned // Const_shape_ptr is a temporary, clients // shouldn't be allowed to modify it. typedef iterator_adaptor< Shapes::const_iterator, default_iterator_policies, value_type_is<Const_shape_ptr>, reference_is<const Const_shape_ptr>, iterator_category_is<input_iterator_tag> > const_iterator; const_iterator begin() const { return const_iterator(shapes_.begin()); } Shapes shapes_; }; int main(int argc, char* argv[]) { Picture pic; const Picture& cpic = pic; pic.shapes_.push_back(Shape_ptr(new Concrete_shape)); Picture::const_iterator i = cpic.begin(); // I'd like to prevent clients from writing... i->reset(new Concrete_shape); *i = Const_shape_ptr(new Concrete_shape); return 0; }

1 0

Property Map deep copy
by Björn Lindberg 01 Nov '02

01 Nov '02

I have an external iterator_property_map to an adjacency_list, using std::vector to store std::string as values. I need to copy this map, but a deep copy so that all the strings are unique to the copy. Is there an easy way to do this? I thought about constructing a new property map from a copy of the underlying vector, but this presents two other questions: (i) will the vertex-to-string mappings of the old map still be valid in the constructed copy? (ii) is there a way to extract the underlying vector from the property map? I couldn't find information on this in the online documentation. Björn

1 0

[BGL] How to prune a BFS or exit a BFS
by kweeheong 01 Nov '02

01 Nov '02

I have a custom BFS visitor used to traverse a graph. Is there a built-in way to - prune off a vertex's descendants from the search - exit a BFS These ( pruning and terminating ) are separate situations. I believe the following will work; however, I do not know how to access the relevant data structures. - To prune off a vertex's descendents from the search In the custom BFS visitor's discover_vertex event, set the color of all its adjacent descendants to "black". - To exit a BFS In the custom BFS visitor's discover_vertex event, once the required vertex is found, empty the queue of vertices. How can I access a vertex's color and a BFS's queue? Or is there a better way?

2 2

How to pass result of boost::bind to arg of template function ?
by hugo duncan 31 Oct '02

31 Oct '02

Hi, I want to pass the result of a boost::bind as an argument of a templated function of a class, and am struggling to find a signature that will let me do this. Is this possible? if so what signature should the function have ? Any help much apreciated Hugo #include "boost/function/function1.hpp" #include "boost/bind.hpp" class another_class {}; class my_class { public: typedef another_class ObjectType; //! this works fine passing a boost::function object template <class ReturnType> void add(const boost::function1<ReturnType,ObjectType>& arg) { boost::function1<ReturnType,ObjectType> fn_obj=arg; } //! this should work when passed the result of a boost::bind template <class ReturnType> void add(?what goes here? & arg) { function1<ReturnType,ObjectType> fn_obj(arg); } }; int fn(another_class,int) { return 1; } int main(int, char**) { my_class c; c.add(boost::bind(&fn,_1,1)); }

2 1

[bgl] breadth_first_search for shortest paths (fwd)
by Joel Young 31 Oct '02

31 Oct '02

Dear Jeremy, et al, I am trying to implement a shortest paths algorithm on a directed graph. As I have unit edge weights, I would rather use breadth_first_search rather than dijkstra. // Is this a good candidate for addition? template <class Map, class Tag> struct vertex_marker : public boost::base_visitor<vertex_marker<Map,Tag> > { typedef Tag event_filter; vertex_marker(Map p_map,int p_val) : m_map(p_map),m_val(p_val) { } template <class Vertex, class Graph> void operator()(Vertex v,const Graph&) { boost::put(m_map,v,m_val); } Map m_map; int m_val; }; template <class Map, class Tag> vertex_marker<Map,Tag> mark_vertices(Map p_map, Tag, int p_v) { return vertex_marker<Map,Tag>(p_map,p_v); } boost::breadth_first_search( mygraph, rootnode, boost::visitor(boost::make_bfs_visitor( std::make_pair( boost::record_distances( boost::get(boost::vertex_distance,mygraph), boost::on_tree_edge()) , std::make_pair( mark_vertices( boost::get(boost::vertex_distance,mygraph), boost::on_initialize_vertex(), std::numeric_limits<int>::max()) , mark_vertices( boost::get(boost::vertex_distance,mygraph), boost::on_start_vertex(), 0) ) ) )) ); The problem is that on_start_vertex does not seem to be implemented for breadth_first_search, but it is for depth_first. For dijkstra, the start node seems to be automaticly zeroed. I guess I could mod Am I missing something really obvious here or is there an inconsistency across the algorithms? Shouldn't on_start_vertex be used for all of the graph algorithms? Also, I can't seem to find documentation on neighbor_bfs.hpp Thanks, Joel

2 1

Debug regex++ in VC6
by r_gharavi 31 Oct '02

31 Oct '02

When I build a stand-alone debug xll with regex++ (static linking), Excel refuses to accept it as an addin. It works fine in release mode. Due to reasons beyond my control :-), I am using VC6 STL. Any pointers would be appreciated. Thanks.

1 0

d_heap bug
by Tsvetomir Valtchev 31 Oct '02

31 Oct '02

[I tried to contact the library's author, dietmar.kuehl@claas- solutions.de, but the message bounced back.] Dear Dietmar, I was looking for a better heap class than the one in STL and I was delighted to come across your d_heap class included in the Boost library. Unfortunately, I had a number of problems with it, and I figured you might be interested in some feedback. First, the class didn't compile with VC.NET (and probably won't with VC 6 either). This might be due to non-conformance on the part of Microsoft's compiler and some known limitations with template support, but for some of the issues I think they were due to the non- conformance of the code itself. Second, to my dismay, the code turned out to be seriously flawed. The following simple fragment, for example, causes a crash: THeap::pointer ptrs[10]; ptrs[0] = heap.push(12); ptrs[1] = heap.push(16); heap.remove(ptrs[0]); heap.remove(ptrs[1]); After some debugging and deciphering of the code, I found that the remove() function didn't handle a special case where the node to be 'sifted up' coincided with the last "hole" left in the tree. I think pop() had a similar problem. (In my fixed version, I have expressed pop() in terms of remove(), which resolves the problem and also avoids some code duplication.) I hope some day you get around to publishing an improved version. Another suggestion I have is some way to make sure that the pointer's passed back by client code are valid. Extensive use of assertions throughout the code might also prevent various programming errors. Regards, // Chango V.

1 0

Regex++ and UTF-8
by Gitit 31 Oct '02

31 Oct '02

Hi, We want to use regex++ (version 3.31) with UTF-8 strings. I tried to match a UTF-8 character of 2 bytes to the regex "." and the match failed. It seems regex++ handles these 2 bytes as two separate characters. 1) Is there a "native" way in the regex++ library for using UTF-8 strings? Can we use UTF-8 strings to compare against a compiled regex (the regex is in ASCII only)? Can the regex itself hold UTF-8 characters? 2) Is converting to wchar_t our only option? As far as I understand, wchar_t does not cover the entire range of characters covered by UTF-8, so it may not be enough. Any other ideas? thanks, Gitit.

1 0

Re: [Boost-Users] Re: regex: flag for "global" search?
by dick.bridges＠tais.com 30 Oct '02

30 Oct '02

The boost::regex_search example bumps the start to march through the sub-expressions and the boost::regex_grep examples demonstrate using the 'callback' for each term. I was kinda hoping the library provided a "convenience version" that would take something like "(\\w+)(?:\\.(\\w+))*" and populate the match_results as if the terms had been expanded <e.g.> "(\\w+)(?:\\.(\\w+))?(?:\\. (\\w+))?(?:\\.(\\w+))?"</e.g.> Perhaps to some arbitrary limit? Oh well, given the riches provided, a little while loop now and then is surely a small price to pay. ;) Thanks for the response. I'm continually amazed at the ethos fostered by Boost group members. "Edward Diener" <eddielee@tropic To: boost-users(a)yahoogroups.com soft.com> cc: Sent by: news Subject: [Boost-Users] Re: regex: flag for "global" search? <news(a)main.gmane .org> 10/29/2002 04:54 PM Please respond to Boost-Users Use boost::regex_grep. The boost::regex_search only finds the first match. <dick.bridges(a)tais.com> wrote in message news:OF6181960C.1A0F5C63-ON88256C61.006996C6@tais.net... > I'm trying to capture the sub-expressions in a fqdn (e.g., > one.two.three.com.) One piece of Perl-speak for the expression is: "/ > (\w+)\./g". I've been using boost_search and trying variations on "(?: > (\\w+)\\.)+" but I can't seem to get all the sub-expressions into the > match_results. > > There's got to be a flag I've been overlooking. Any suggestion will be > appreciated. Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

regex: flag for "global" search?
by dick.bridges＠tais.com 30 Oct '02

30 Oct '02

I'm trying to capture the sub-expressions in a fqdn (e.g., one.two.three.com.) One piece of Perl-speak for the expression is: "/ (\w+)\./g". I've been using boost_search and trying variations on "(?: (\\w+)\\.)+" but I can't seem to get all the sub-expressions into the match_results. There's got to be a flag I've been overlooking. Any suggestion will be appreciated. TIA

3 2

Gcc-3.2, statistic_tests.cpp and <limits>
by pcarlini.rm 29 Oct '02

29 Oct '02

Hi, the PR libstdc++/6718 in the Gcc bug database is about a run time problem with this Boost testcase: paolo:~/Programming/c++/boost_1_29_0/libs/random> a.out Confidence level: 0.99; 1-alpha = 0.01; chi_square(19, 36.191) = 0.99 Running tests on minstd_rand KS: 4750* [0] 9500* [0] equidistribution: a.out: statistic_tests.hpp:571: void generic_counter<RandomA ccessContainer>::operator()(int) [with RandomAccessContainer = std::vector<int, std::allocator<int> >] : Assertion `static_cast<unsigned int>(i) < container.size()' failed. Abort According to Nathan Sidwell and Gaby Dos Reis analysis the problem is due to well known issues with numeric_limits<double>::infinity of 3.2's run time library for which unexpectedly Boost provides no work arounds. On the contrary, 2.95.x worked just fine. Please let me know if you need any additional information, ciao, Paolo.

1 1

AW: [Boost-Users] boost::bind problem
by Jasper, Alexander 29 Oct '02

29 Oct '02

-----Ursprüngliche Nachricht----- Von: Mark Snelling [mailto:mark@bakedbeans.com] Gesendet: Dienstag, 29. Oktober 2002 17:44 An: Boost-Users(a)yahoogroups.com Betreff: [Boost-Users] boost::bind problem [...] typedef priority_queue<shared_ptr<Functor>, vector<shared_ptr<Functor> >, bind(less<int(), bind(&Functor::priority, _1), bind(&Functor::priority, _2))> MyQueue; As far as I know you can't call a function in a typedef. bind(..) is a function call returning a predicate. But does s.o. know how to use bind in this manner. I failed to, since the type of what bind returns is far to complex. And it is required if you want to to use bind in conjunction with maps or the priority_queue's. You have to wrap the call in your own predicate. alex

1 0

boost::bind problem
by Mark Snelling 29 Oct '02

29 Oct '02

Hello, I was wondering if anyone out there in Boost land could give me a hand here? Here's the problem: I have a class A: class A { public: A(int i) : _priority(i) {} int priority() {return _priority;} private: int _priority; }; What I want to do is create a std::priority_queue based on boost::shared_ptr<A> and use boost::bind/compose to create the sorting function required by std::priority_queue. However, when I try and typedef the queue (to save a lot of typing) I get compiler errors on VS.NET. using namespace std; using namespace boost; typedef priority_queue<shared_ptr<Functor>, vector<shared_ptr<Functor> >, bind(less<int(), bind(&Functor::priority, _1), bind(&Functor::priority, _2))> MyQueue; Am I going about this the right way? Any help appreciated. TIA Mark.

1 0

Graph library: parallel edges
by Juerg Tschirren 29 Oct '02

29 Oct '02

With the Boost Graph Library, I try do create an undirected graph that does not allow parallel edges, so far without success. Does anybody have a small example that shows how to do this? Juerg

2 1

Graph library: vertex type
by Juerg Tschirren 29 Oct '02

29 Oct '02

In the Boost Graph Library, is it possible to have a custom-defined type for vertices, e.g., I would like to have boost::graph_traits<Graph>::vertex_descriptor map to std::pair<int,int> Can this be done? If yes, how? Juerg

2 1

Re: [Boost-Users] MSVCNT not used anymore?
by dick.bridges＠tais.com 28 Oct '02

28 Oct '02

Thanks! That worked. The MSVCNT example on http://www.boost.org/tools/build/build_system.htm must be left over from a previous version. Appreciate the quick response. sashan <sashang(a)ihug.co To: Boost-Users(a)yahoogroups.com .nz> cc: Subject: Re: [Boost-Users] MSVCNT not used anymore? 10/29/2002 04:20 AM Please respond to Boost-Users dick.bridges(a)tais.com wrote: >I'm having a senior moment. > >MSVCNT is set to C:\Program Files\Microsoft Visual Studio\VC98 and bjam is >invoked with "-sTOOLS=msvc" but the command line that gets invoked is C: >\Program Files\Microsoft Visual C++\VC98\bin\cl and, of course I get: "The >system cannot find the file specified." > >Where's the instructions for compiling with VC6, SP4? > > This is my command line (saved in a batch file): bjam -sTOOLS=msvc -sBUILD=release -sMSVC_ROOT=D:\msvs\VC98 -sVISUALC=D:\msvs\VC98 I don't think MSVCNT is used see http://www.boost.org/tools/build/msvc-tools.html -- P: Egad! You astound me, Brain! B: That's a simple task, Pinky. Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

MSVCNT not used anymore?
by dick.bridges＠tais.com 28 Oct '02

28 Oct '02

I'm having a senior moment. MSVCNT is set to C:\Program Files\Microsoft Visual Studio\VC98 and bjam is invoked with "-sTOOLS=msvc" but the command line that gets invoked is C: \Program Files\Microsoft Visual C++\VC98\bin\cl and, of course I get: "The system cannot find the file specified." Where's the instructions for compiling with VC6, SP4?

2 1

are examples on maual page ready to run?
by J-S Lin 28 Oct '02

28 Oct '02

The error message is as follows, --------------------------------- g:\C++ notes\test_boost\test_matrix.cpp(14) : error C2679: binary '<<' : no operator found which takes a right-hand operand of type 'boost::numeric::ublas::matrix' (or there is no acceptable conversion) with [ T=double, F=boost::numeric::ublas::row_major, A=boost::numeric::ublas::unbounded_array ] ------------------------------ Much appreciated. J-S Lin

2 2

lexical_cast fails to convert std::string to boost::dynamic_bitset<>
by Klaus Nowikow 28 Oct '02

28 Oct '02

Hi! I am trying to convert a string to a boost::dynamic_bitset using boost::lexical_cast, as in this example: template <class Value> bool GetValue(const std::string& str, Value& val) { try { val = boost::lexical_cast<Value>(str); } catch(boost::bad_lexical_cast&) { return false; } return true; } int main() { std::string str = "01"; boost::dynamic_bitset<> bits; if(!GetValue(str, bits)) { [...] } } The lexical_cast always throws an exception. The problem seems to be in lexical_cast.hpp, where a temporary object is created: Target result; if(!(interpreter << arg) || !(interpreter >> result) || !(interpreter >> std::ws).eof()) throw bad_lexical_cast(); and in dynamic_bitset.hpp, where operator>>(std::basic_istream<CharT, Traits>&, dynamic_bitset<Block, Allocator>&) iterates over the bitset using the size() (which is, of course, 0). I sure could solve my particular problem by providing an explicit template instantiation of the GetValue() function, but I don't want to do this because the code is for a library, and I want to reduce references to other libraries to an absolute minimum. Did I miss something here, or is there a workaround for this problem? Regards, Klaus

1 0

Date_Time undefined reference
by David Clark 27 Oct '02

27 Oct '02

Hi, I am having a problem compiling the following example #include "boost/date_time/gregorian/gregorian.hpp" #include "boost/date_time/date_parsing.hpp" #include <iostream> #include <string> int main() { using namespace boost::gregorian; std::string s("2002-10-15"); date d(from_string(s)); std::cout << to_simple_string(d) << std::endl; return 0; }; The linker is complaining about an undefined reference to boost::gregorian::greg_month::as_short_string() const and boost::gregorian::greg_month::as_long_string() const using g++ 3.0.4 g++ test.cpp -o test -DDATE_TIME_INLINE Seems the problem is in the call to to_simple_string(d) Is there something obvious I'm missing here. Thanks David.

6 9

Unexpected result in parsing a regular expression
by abhinkar 27 Oct '02

27 Oct '02

Hi, I recently downloaded the boost regex library and am trying to use the search and replace (regex_merge) API. But I am not getting the expected result. Here is what I am trying to do. I am trying to replace a single quoted string with something. But, the catch here is that the string in single quotes can have zero or many 2 consecutive single quotes. For example: Input (Ignore the angle brackets>: <foo='string with '' consecutive '' single ''quotes' bar='string with no single quotes'> To be replaced by 'XXX'. So the output that I want: <foo=XXX bar=XXX> Here is the regular expression that I wrote in Perl: /(\'[^']*(\'\')*[^']*\')/ I get the expected result in Perl. So, to test this with regex library I wrote a sample program to use the regex_merge API and try the replace functionality. ---------------------------replace.cc-------------------------------- #include <boost/regex.hpp> #include <string> #include <iostream> #include <sstream> #include <iterator> using namespace std; using namespace boost; const std::string formatstr("XXX"); std::string processexp(string resp) { regex expression("(\'[^']*(\'\')*[^']*\')"); std::string result; std::ostringstream t; std::ostream_iterator<char, char> oi(t); cout << "Response:" << resp << endl; result = boost::regex_merge(resp, expression, formatstr, boost::format_all); return result; } int main(int argc) { std::string res; res = processexp("foo='string with '' consecutive '' single ''quotes' bar='string with no single quotes'"); cout << "results=" << res << endl; return 0; } --------------------------------------------------------------------- The output I get is: foo=REPLACEDREPLACED bar=REPLACED I tried several ways, but couldn't get the regular expression to work to return the expected result. I WOULD really appreciate if someone could help me. Thanks in advance, Sameer

2 1

vecS versus listS
by aaronyinyong 27 Oct '02

27 Oct '02

compare the following codes: 1.First I create Graph using vecS parameter: typedef boost::adjacency_list<vecS,vecS,directedS,VertexProperty,EdgeProperty> Graph; ..... E edge_array[num_edges]={E(0,1),E(0,2),E(0,3),E(2,3)}; boost::add_edge(edge_array[i].first,edge_array[i].second,g); ..... This is OK! 2.Then I changed the parameter "vecS" to "listS". typedef boost::adjacency_list<listS,listS,directedS,VertexProperty,EdgePropert y> Graph; ..... E edge_array[num_edges]={E(0,1),E(0,2),E(0,3),E(2,3)}; boost::add_edge(edge_array[i].first,edge_array[i].second,g); It can't be compiled.The VC7 tells me "int can't be converted to void*". So what's wrong? Is there any difference which could be caused by "vecS" and "listS"?

2 1

[BGL] Making GraphvizDigraph bidirectional
by kweeheong 27 Oct '02

27 Oct '02

Hi, For convenience, I am using Graphviz digraphs, reading them into BGL, running my algorithms and writing them out to view the results (with Graphviz dotty ). My compiling environment is VC6. After some compilation failures, I realized that Graphviz digraphs did not support in_edges and other functionality of the bidirectional graphs. Graphviz digraphs is currently defined in graphviz.hpp as : typedef subgraph<adjacency_list<boost::vecS, boost::vecS, boost::directedS, GraphvizVertexProperty, GraphvizEdgeProperty, GraphvizGraphProperty> > GraphvizDigraph; There are 2 potential solutions I see ( there may be others ): Solution 1 : ------------ - Read in Graphviz digraph and then copy it into a working bidirectional graph to run the algorithms. - Copy back to Graphviz digraph to view the results. Solution 2 : ------------ - Change the definition of GraphvizDigraph to : typedef subgraph<adjacency_list<boost::vecS, boost::vecS, boost::bidirectonalS, GraphvizVertexProperty, GraphvizEdgeProperty, GraphvizGraphProperty> > GraphvizDigraph; - Recompile bglviz.lib - Now GraphvizDigraph is bidirectional I prefer Solution 2 because it leverages the generic way that BGL has been written. I am able to rebuild bglviz.lib and my minimal testing shows the bidrectional GraphvizDigraph seems to work so far. I would like feedback whether there are any gotchas with Solution 2. Thanks,

2 1

RE: [Boost-Users] are examples on maual page ready to run?
by Mark Storer 25 Oct '02

25 Oct '02

Which error? What's the compiler saying? We (okay: I) need more info for a proper diagnosis. --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard;

1 0

are examples on maual page ready to run?
by J-S Lin 25 Oct '02

25 Oct '02

I just download boost and tried to get a hang of it by running examples out of the doc page. But I am not sure if these examples are ready to run or simply like a pseudo-code? A point in the case: This simple matrix example int main () { using namespace boost::numeric::ublas; matrix<double> m (3, 3); for (int i = 0; i < m.size1 (); ++ i) for (int j = 0; j < m.size2 (); ++ j) m (i, j) = 3 * i + j; std::cout << m << std::endl; } I copied it and added the following includes: #include <boost/numeric/ublas/matrix.hpp> #include <iostream> But the compiler (VC7) flag an error on cout. So is this line " std::cout << m << std::endl;" supposed to work, or it is a pseudo-code. Thanks. J-S Lin

1 0

How do I use boost::multi_array with a templated argument?
by Björn Lindberg 25 Oct '02

25 Oct '02

I cannot get the code below to compile with g++-3.2 on GNU/Linux. The error message is: exempel.cpp: In member function `void functor<T>::operator()() [with T = P]': exempel.cpp:26: instantiated from here exempel.cpp:18: `nodetab' has incomplete type exempel.cpp:18: confused by earlier errors, bailing out Since everything is visible at compile time, I can't understand why I'm getting this error message, or what to do about it. ------------- #include <boost/multi_array.hpp> struct P {}; template<typename T> struct functor { typedef boost::multi_array<T, 3> table_t; typedef typename table_t::array_view<2>::type nodetab_t; typedef typename table_t::index_range range; void operator()() { table_t table(boost::extents[5][6][7]); nodetab_t nodetab = table[boost::indices[1][range()][range()]]; } }; int main() { functor<P> vis; vis(); return 0; } ------------- Björn

1 0

Borland 6 Graph example 1
by chongwhite001 25 Oct '02

25 Oct '02

Hi All, I am attempting to run the 1st example (file dependancy) of Boost Graph library with Borland C++Builder 6. It compiles ok but crashes when run in exception.hpp with a call, or rather THROW to negative_edge exception. If anyone can provide any light into this I would be most grateful. (details below) Thanks Christian _________________________________________________________ Fault occurs in: dijkstra_shortest_paths.hpp: void examine_edge(Edge e, Graph& g) { if (m_compare(get(m_weight, e), m_zero)) throw negative_edge(); m_vis.examine_edge(e, g); } The actual fault is in exception.hpp at the point: struct negative_edge : public bad_graph { negative_edge() : bad_graph("The graph may not contain an edge with negative weight."){ } }; The error is: --------------------------- Debugger Exception Notification --------------------------- Project Boost_Ex1_Console.exe raised exception class boost::negative_edge with message 'Exception Object Address: 0x896912'. Process stopped. Use Step or Run to continue. --------------------------- OK Help ---------------------------

2 3

Fwd: uBLAS vs MTL for sparse matrices
by Paul C. Leopardi 25 Oct '02

25 Oct '02

Hi, I posted the following message to boost and have so far had no response. Maybe boost-users is the correct mailing list? Hi, Thanks to Joerg Walter's original conversion of GluCat ( http://glucat.sf.net ) to uBLAS, I have fairly painlessly been able to get GluCat going with the version of uBLAS now promoted to Boost. I'm using sparse matrices: boost::numeric::ublas::sparse_matrix< Scalar_T, boost::numeric::ublas::row_major> and comparing performance to MTL: mtl::matrix< Scalar_T, mtl::rectangle<>, mtl::compressed<>, mtl::row_major >::type The operation I'm performing is quite complicated. Basically, I am generating a large number of sparse matrices, and computing the inner product of a given matrix with each of these matrices in turn. ( If you have a copy of GluCat, see basis_element() in matrix_multi_imp.h ) Because these sparse matrices have only one non-zero per row, operations on an n x n matrix are typically O(n), and seem to be so using MTL: Size vs speed for MTL: Size Time (ms) 32 10 64 20 128 80 256 160 512 700 But with uBLAS, essentially the same operations seem to be O(n^2): Size Time (ms) Slowdown 32 30 3 64 70 3.5 128 830 10.4 256 1940 12.1 512 31770 45.4 o Is there a more appropriate data type in uBLAS? o Do you have any tips on where to tweak uBLAS to get better (ie. O(n) ) performance? o What is BOOST_UBLAS_USE_CANONICAL_ITERATOR and what effect should it have on performance? Thanks

2 1

assign a scalar to boost::numeric::ublas::matrix?
by Michael Na Li 24 Oct '02

24 Oct '02

Hi, having tried various matrix classes, I was excited to see boost finally includes a "standard" matrix class. Thanks for the good work. I have one question, though. How do I initialize a matrix to a scalar value? There is no constructor of the form 'matrix (nr, nc, value)' nor 'matrix::operator=( T value )'. I think both would be nice to have. Michael -- ---------------------------------------------------------------------------- Michael Na Li Email: lina(a)u.washington.edu Department of Biostatistics, Box 357232 University of Washington, Seattle, WA 98195 ---------------------------------------------------------------------------

1 0

[BUG] Macos.hpp configuration woes
by Bobby Thomale 24 Oct '02

24 Oct '02

Yesterday I was trying to help my wife get the Boost libraries to compile in her application. It reminded me of an issue I thought I brought up a while ago (maybe I forgot) that still exists in the boost Macos.hpp config file. In the MacOS.hpp file, it checks to see if you are compiling a Mach-O target. If you are, it reasons, you must be using the Apple BSD headers as well. This logic is even documented in a comment: // If __MACH__, we're using the BSD standard C library, not the MSL: #if __MACH__ The problem with this is that, starting with CW Pro 8, it is actually possible to build a Mach-O target and use the MSL in place of the BSD libraries. Lots of people are apparently doing this, including my wife. (I am still on CFM and have not made the transition to Mach-o yet, but I will eventually and I will potentially be in the same boat. The newer Carbon APIs are Mach-o only so that is where all the carbon programmers will eventually go, and as long as Codewarrior is around, MSL will be there as an option for people.) There are also people who use other STL implementations, such as STLPORT. When it defines all of the stuff it does in there, for the BSD libraries, the mach-o MSL code does not compile. Instead, I get hundreds of compile errors. The only way I could get this to compile for her was to force it to use the TARGET_CARBON stuff at the bottom, after the #else (meaning "not mach-o"), by commenting the __MACH__ stuff out. Obviously, that was a "see if this is really her problem" solution, also to get her up and running, and not a long-term fix. :-) It worked by the way. The config.hpp stuff seperates out your platform settings from your standard library settings. Is there a reason that standard library implementation-specific settings are being set by platform and binary format? If there is magic that needs to happen that is specific to Apple's BSD headers, shouldn't there maybe be a "BSD.hpp" or even "AppleBSD.hpp" for BOOST_STDLIB_CONFIG instead? Or am I missing something? Anyway. That is just a question/suggestion, take it or leave it. It makes sense that the TARGET_CARBON stuff at the bottom is platform specific, but the stuff above it seems like it should go somewhere else. In any case, whether that stuff is moved or not, something needs to change to alleviate the pain for those using Mach-o and MSL together, because right now boost is broken for those users. (Am I reporting this to the right list by the way?) -- Bobby --------------------------------------------------------------------- Bobby Thomale Senior Software Developer Inoveon Corporation http://www.inoveon.com/ ---------------------------------------------------------------------

3 6