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

Mailing list archive change and list downtime
by Beman Dawes 30 Mar '05

30 Mar '05

DongInn Kim, Jeff Squyres, and the other sysadmins at Indiana University are planning to switch all the Boost mailing list archives they host from MHonArc to Hypermail. They report "Hypermail seems to be much more stable, faster, and more efficient than MHonArc. We've been quite pleased with it, and have deployed it across most other lists on the listserver already (the boost lists were saved until last)." The old archives will still be available, and DongInn and Jeff have made various plans to minimize disruptions. All the listservers will be down during the transition, which is planned to start at 11 PM Saturday night (Eastern US time). Thanks to all the folks at IU for their help with Boost list hosting, --Beman

1 0

Errors Compiling date_time Serialization Headers w/ Gcc on Linux
by Jalon, Arnon 30 Mar '05

30 Mar '05

Hi, I am new to the list. Appologies in advance if I'm posting something that's been already addressed, but I was unable to find anything related to it while searching the archives. I'm trying to use the date_time serialization headers in my application. I'm actually using the boost headers and libraries that came with the fedora core 3 linux distribution, and compiling with gcc 3.4.2. Including boost/date_time/time_serialize.hpp in my source gives me several compilation errors. I perused the time_serialize.hpp and greg_serialize.hpp headers and found places where the typename keyword was being used in front of class types that were simply qualified by namespace, as well functions where variables were used that weren't declared. I modified the headers to get it to compile, but would like to see if anyone else has been able to work around the problem in a less intrusive way? If need be I can post the patch files I created to a proper place. Below are the errors I was getting: g++ -g -I. -c parseAccessLog.cpp In file included from /usr/include/boost/date_time/posix_time/time_serialize.hpp :13, from logobject.hpp:11, from parseAccessLog.cpp:19: /usr/include/boost/date_time/gregorian/greg_serialize.hpp: In function `void boost::serialization::save(Archive&, const boost::gregorian::date_period&, unsigned int)': /usr/include/boost/date_time/gregorian/greg_serialize.hpp:150: error: no class template named `date' in `boost::gregorian' /usr/include/boost/date_time/gregorian/greg_serialize.hpp:150: error: invalid type in declaration before '=' token . . Repeated several times for similar condition through out greg_serialize.hpp . . /usr/include/boost/date_time/gregorian/greg_serialize.hpp: In function `void boost::serialization::load_construct_data(Archive&, boost::gregorian::nth_kday_of_month*, unsigned int)': /usr/include/boost/date_time/gregorian/greg_serialize.hpp:336: error: `pd' undeclared (first use this function) /usr/include/boost/date_time/gregorian/greg_serialize.hpp:336: error: (Each undeclared identifier is reported only once for each function it appears in.) . . Also repeated several times for similar condition . . In file included from logobject.hpp:11, from parseAccessLog.cpp:19: /usr/include/boost/date_time/posix_time/time_serialize.hpp: In function `void boost::serialization::save(Archive&, const boost::posix_time::time_period&, unsigned int)': /usr/include/boost/date_time/posix_time/time_serialize.hpp:131: error: no class template named `ptime' in `boost::posix_time' /usr/include/boost/date_time/posix_time/time_serialize.hpp:131: error: invalid type in declaration before '(' token . .

3 2

Boost.lambda
by Sean DeNigris 30 Mar '05

30 Mar '05

Can anyone explain why the class member functions need their address taken when used in a boost::lambda::bind inside the class? e.g. vector<int> v; MyClass theClass; for_each(v.begin(), v.end(), bind(MyClass::DoSomething, &theClass, _1)); //The above compiles fine, but. class MyClass { public: void DoSomething(const int& i) { . } void Go() { for_each(myInts.begin(), myInts.end(), /*--------------------->*/ bind(MyClass::DoSomething, this, _1)); } vector<int> myInts; }; The above code does not compile. The marked line needs to be: bind(&MyClass::DoSomething, this, _1)); Why? Thanks. - Sean

2 1

boost::read_write_mutex simple usage question.
by Gordon Smith 30 Mar '05

30 Mar '05

The following code seems to deadlock on the second (read) scoped lock (not what I would expect): boost::read_write_mutex mutex(boost::read_write_scheduling_policy::alternating_single_read); { boost::read_write_mutex::scoped_write_lock writeLock(mutex); } { boost::read_write_mutex::scoped_read_lock readLock(mutex); }

2 4

Re: Loki vs. Boost
by Valery Aronov 29 Mar '05

29 Mar '05

Is there anything new to this old posting's question (2002) which was never answered? Is Loki going to be part of boost one day? Never? To what extent can they co-exist in one project? Thanks, Valery Hamlet wrote: > Hi, > I'm (desperately) looking for a serious comparative review of Loki vs. > Boost libraries. Although the differences are quite clear, > still it would be nice to see a serious comparison, > especially in the features that exists in both places, i.e. smart pointers, > small obj. allocator, type traits and template meta-programming. > Does anybody knows if there exists such a paper somewhere, or alternatively > have his own insights about the libraries? > > Thanks, > > Ariel

2 1

boost::thread::join causes assertion (pthreads)
by Thorsten Froehlich 29 Mar '05

29 Mar '05

Hi, I noticed that when using thread::join and the thread has already completed, at least on Mac OS X using pthreads, pthread_join returns EINVAL, thus triggering the assertion res == 0. Is this intentional or a bug? Thorsten

10 46

lexical_cast and infinity
by Patrick Mézard 29 Mar '05

29 Mar '05

The last line of the following program throws a bad_lexical_cast exception. The code is compiled with VC7.1. //********************************************************** #include <limits> #include <iostream> #include <boost/lexical_cast.hpp> int main(int argc, char* argv[]) { double d = std::numeric_limits<double>::infinity(); std::string s = boost::lexical_cast<std::string>(d); std::cout<<d<<", "<<s<<std::endl; //Throws bad_lexical_cast boost::lexical_cast<double>(s); } //********************************************************** The output is: "1.#INF, 1.#INF" Am I doing something wrong ? Patrick Mézard

2 1

Boost.Jam
by Eyal Inbar 29 Mar '05

29 Mar '05

When I run bjam i get /lib/i686/libc.so.6: version 'GLIBS_2.3' not found (required by bjam) What i need to do? eyal

3 2

RE: [Boost-users] compile error
by Eyal Inbar 29 Mar '05

29 Mar '05

Thank It's in CPPFLAGS. but i found it after i look into the Makefile and try some arguments. Now i found that in /root/.bash_profile i set CXX to be my compiler command export CXX="g++ -ftemplate-depth-31" and it works with all the projects Eyal -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org]On Behalf Of Malte Starostik Sent: Monday, March 28, 2005 4:30 PM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] compile error Eyal Inbar schrieb: [how to add -ftemplate-depth-NN] > Thanks > But how and where can i changed the flag in g++ ? I don't know exactly where it is in KDevelop, but usually in IDEs, somewhere in the project options you can add/change compilation flags. Look around in the options, check the manual. For often used flags there may be predefined options to check, for things like the template depth you probably have to enter -ftemplate-depth-NN where NN is the desired value manually in some "extended options" or similar field. HTH, Malte _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

delete shared_ptr object???
by Dan Bikel 29 Mar '05

29 Mar '05

Rather disturbingly, the following code compiles (at least, with g++-3.3.2): #include "boost/shared_ptr.hpp" using namespace boost; class X {}; int main() { const shared_ptr<X> y; delete y; } Normally, when you compile code with delete applied to a non-pointer type, you get a compile-time error. What's going on here? TIA, Dan.

4 3

regex expressions in boost::regex vs python, how to get the answer from boost
by Alexis H. Rivera-Rios 29 Mar '05

29 Mar '05

Hi, I'm playing around with the boost::regex library and I want to match two tokens from a filename. For example files with the following format: myname_123.dat I want to be able to determine the string and number separated by the underscore. So the result of my match should be "myname", and 123. In python, I can do it like this: import re >>> x = 'myclass_123.dat' >>> result = re.match(r'(\w+)_(\d+)\.dat$', x) >>> result.group(1) 'myclass' >>> result.group(2) '123' I'm having problems getting the same result in C++. This is the sample program: int main(int argc, const char** argv) { boost::regex expression("(\\w+)_(\\d+)\\.dat$"); std::string filename(argv[1]); boost::cmatch what; if(boost::regex_search(filename.c_str(), what, expression)) { for (int i=0;i<what.size();++i) { std::cout << what[i].first << " " << what[i].second << std::endl; } } return 0; } The output of this program is: > openmp3 alexis_1023.dat alexis_1023.dat alexis_1023.dat _1023.dat 1023.dat .dat How do I get my groups "alexis", 123 as in Python? Thanks, Alexis Programming Tutorial: In Python: To do this, do this In Perl: To do this, do this or this or this or this... In C: To do this, do this, but be careful In C++: To do this, do this, but don't do this, be careful of this, watch out for this, and whatever you do, don't do this __________________________________ Do you Yahoo!? Yahoo! Small Business - Try our new resources site! http://smallbusiness.yahoo.com/resources/

2 1

Any interest in postconstruction/predestruction facility?
by Malte Starostik 29 Mar '05

29 Mar '05

Hi, I'm using a wrapper class to automate postconstruction and predestruction. A preliminarily boostified version (added licence header, changed namespace to boost) is available at http://malte.homeip.net/~malte/prepost/ prepost.hpp[.html] contains the library The file example.cpp[.html] shows an example usage: The class thread_base starts a new thread in it's post_construction() member function which runs the virtual run() member function in the new thread. Since run() is to be overridden by a derived class, this cannot be done by the ctor. Similarly, the thread is joined in the pre_destruction() member function, as the dtor would be too late since the derived class's instance must not have been destructed before the thread finished. The basic usage is to derive a class X from post_constructed and/or pre_destructed according to which facilities are needed. Then, instead of instantiating X directly, user code instantiates prepost_wrapper< X >. Direct instantiation of X is prevented by the presence of pure virtuals in the classes post_constructed and pre_destructed. As in most if not all cases, X will be polymorphic anyway, I considered the benefit of prevented circumvention of the mechanism worth the two additional entries in the vtable. Is there any interest in having this facility? BTW, the name prepost_wrapper is definately the result of my lacking imagination. Any suggestions appreciated ;-) Outstanding issues: * maybe prepost_wrapper should prevent being used as an intermediate class * the forwarding ctors of prepost_wrapper are problematic if one or more of the base class's ctors are explicit * the hardcoded maximum number of ctor args should be configurable * anything else I didn't think of? BTW, I tried to have the default ctor generated by the BOOST_PP_REPEAT macro as well, but failed miserably to find a way to omit template<> if n is 0. Some help in this area is appreciated as well. Cheers, Malte

2 2

BGL: subgraph and bundled properties
by Wintermantel, Marc 28 Mar '05

28 Mar '05

Hello, I would like to create a graph-tree structure (subgraph concept) with bundled properties. The creation of the graphs works fine. However the interface for bundled graphs seems not to be implanted in subgraph. Is this right? Is it just forgotten in subgraphs or does the concept of bundled properties and subgraph not work together. Cheers, Marc

2 1

[C++ Template Metaprogramming] Selected Answers Posted
by David Abrahams 28 Mar '05

28 Mar '05

Ariel Badichi has generously established a wiki page containing his answers to many of the exercises in the book "C++ Template Metaprogramming: Concepts, Tools, and Techniques from Boost and Beyond" by me and Aleksey Gurtovoy. Please see the book's home page at http://www.boost-consulting.com/metaprogramming-book.html for details. -- Dave Abrahams Boost Consulting www.boost-consulting.com

2 1

RE: [Boost-users] compile error
by Eyal Inbar 28 Mar '05

28 Mar '05

Thanks But how and where can i changed the flag in g++ ? eyal -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org]On Behalf Of Malte Starostik Sent: Monday, March 28, 2005 5:37 AM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] compile error Eyal Inbar schrieb: > Hello > > I download boost to window2000 OS and run the quick_tour.cpp on VC++ 6 > without trouble. > > But when i run it on linux with KDevelop i get > > /usr/local/include/boost/iterator/iterator_adaptor.hpp:218: template > instantiation exceeds > > maximum of 17 (use -ftemplate-depth-NN to increase the maximum) ^^^^^^^^^^^^^^^^^^^ here... > instantiating 'struct > > boost::mpl::eval_if<boos::is_convertible<random_access_itarator_tag, > > boost::incrementable_traversal_tag>,boost::mpl::identity<random_access_iterator_tag>, > > boost::detail::old_category_to_traversal<random_access_iterator_tag> >' ...it tells you what to do. The C++ standard speficies a limit of 17 for recursively nested template instantiations. To have g++ accept deeper nested templates, add sth. like -ftemplate-depth-20 (or more than 20 as needed) to the compile command (CXXFLAGS). Now I wonder whether "recursively nested" applies only to a< a< a< a< ... > > > > or also to a< b< c< d< ... > > > > and g++ misinterpreted that... HTH, Malte _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

[mpl] instantiating long_<MAX_LONG> generates warning on VC7.1/.NET
by Yariv Tal 28 Mar '05

28 Mar '05

On Visual Studio.NET / VC7.1 the following code: #include <boost/mpl/long.hpp> #include <climits> boost::mpl::long_<LONG_MAX> lll; Gives the following warning: ...\boost_1_32_0\boost\mpl\aux_\integral_wrapper.hpp(72) : warning C4307: '+' : integral constant overflow ...\main.cpp(39) : see reference to class template instantiation 'boost::mpl::long_<N>' being compiled with [ N=2147483647 ] Obviously, the compiler is right about the overflow, and, IMHO, the same holds for using any maximal/minimal value for a specific type. Is this a known issue? Does it cause any actual problems? (in other words: can I ignore the warning? always? sometimes? never?) Thanks, Yariv Tal.

1 0

Boost.program_options config files
by Sean DeNigris 28 Mar '05

28 Mar '05

Is there an easy way to work with Boost.program_options config files? I want to be able to write option values to the file programmatically.

2 1

compile error
by Eyal Inbar 28 Mar '05

28 Mar '05

Hello I download boost to window2000 OS and run the quick_tour.cpp on VC++ 6 without trouble. But when i run it on linux with KDevelop i get /usr/local/include/boost/iterator/iterator_adaptor.hpp:218: template instantiation exceeds maximum of 17 (use -ftemplate-depth-NN to increase the maximum) instantiating 'struct boost::mpl::eval_if<boos::is_convertible<random_access_itarator_tag, boost::incrementable_traversal_tag>,boost::mpl::identity<random_access_iterator_tag>, boost::detail::old_category_to_traversal<random_access_iterator_tag> >' help! eyal

2 1

boost/config.hpp: No such file or directory in 1.32
by Ross Boylan 25 Mar '05

25 Mar '05

With boost 1.32, but not 1.31, I get the following errors g++ -I /home/ross/peter/R/mspath/src -I/usr/lib/R/include -std=c++98 -Wall -I/usr/lib/R/include -MMD -MF /home/ross/peter/R/mspath/src/depends/ConstrainedCoefficients.d -MP -g -O2 -c -o ConstrainedCoefficients.o /home/ross/peter/R/mspath/src/trueSrc/ConstrainedCoefficients.cc In file included from /home/ross/peter/R/mspath/src/boost/smart_container/ptr_map_adapter.hpp:22, from /home/ross/peter/R/mspath/src/boost/smart_container/ptr_map.hpp:23, from /home/ross/peter/R/mspath/src/trueSrc/ScratchPad.h:7, from /home/ross/peter/R/mspath/src/trueSrc/ScratchDataProducer.h:5, from /home/ross/peter/R/mspath/src/trueSrc/ConstrainedCoefficients.h:9, from /home/ross/peter/R/mspath/src/trueSrc/ConstrainedCoefficients.cc:2: /home/ross/peter/R/mspath/src/boost/smart_container/detail/map_iterator.hpp:22:28: warning: boost/config.hpp: No such file or directory /home/ross/peter/R/mspath/src/boost/smart_container/detail/map_iterator.hpp:23:31: warning: boost/operators.hpp: No such file or directory In file included from /home/ross/peter/R/mspath/src/boost/smart_container/ptr_map_adapter.hpp:22, from /home/ross/peter/R/mspath/src/boost/smart_container/ptr_map.hpp:23, from /home/ross/peter/R/mspath/src/trueSrc/ScratchPad.h:7, from /home/ross/peter/R/mspath/src/trueSrc/ScratchDataProducer.h:5, from /home/ross/peter/R/mspath/src/trueSrc/ConstrainedCoefficients.h:9, from /home/ross/peter/R/mspath/src/trueSrc/ConstrainedCoefficients.cc:2: /home/ross/peter/R/mspath/src/boost/smart_container/detail/map_iterator.hpp:34: error: parse error before `<' token /home/ross/peter/R/mspath/src/boost/smart_container/detail/map_iterator.hpp:39: error: syntax error before `;' token etc. This is using a pre-release version of the smart container (now indirect iterator, I think) library. 1.31 was current at the time of the pre-release. I've searched the list other places, but haven't found any clues to what's going on. Does anyone have any ideas? This is on Debian; is it possible these files have been inadvertently deleted? My /usr/include/boost/ directory does not have operators.hpp, though it is in some subdirectories (e.g., lambda/detail/). -- Ross Boylan wk: (415) 502-4031 530 Parnassus Avenue (Library) rm 115-4 ross(a)biostat.ucsf.edu Dept of Epidemiology and Biostatistics fax: (415) 476-9856 University of California, San Francisco San Francisco, CA 94143-0840 hm: (415) 550-1062

4 4

smart_ptr and self-referencing objects?
by edA-qa mort-ora-y 25 Mar '05

25 Mar '05

I am in the process of converting a library of ours (which used a Refcounting mechanism for shared objects) to be buildable on top of the boost smart_ptr library*. What feature I am having the most difficulty with is the ability for an object to refer to itself and be properly shared. That is, by quick example: ///////////////////////////// class A { void Do( B* b ) { b->Add( this ); } //trouble line } class B { vector::shared_ptr<A> items; void Add( A* a ) { items.push_back( a ); } } ... shared_ptr<A> a( new A() ); shared_ptr<B> b( new B() ); a->Do( b ); //hidden problems /////////////////////////////// In the trouble line I am having a problem since I need to refer to this, but it will not be referring to the shared_ptr wrapper on the object. Thus it will end up being delete'd twice. Since I already need to derive from shared_ptr to implement additional features I do have some possible options (such as each object containing a weak reference to itself), but they all have particular drawbacks. Is there a good method for resolving this problem? *I'm doing this since I have no more interest in maintaining the cross-platform aspects of our own library (though it works with PThreads and Win32). And because I don't want to have to instrument my objects with their own ref-counting (one of my solutions to the above however requires this instrumenting nonetheless, but not on all objects). -- edA-qa mort-ora-y Idea Architect http://disemia.com/

4 3

[signals] Compiler warnings with BOOST_ALL_DYN_LINK
by Klaus Nowikow 25 Mar '05

25 Mar '05

Hello, I have a problem using Boost.Signals. With this test program: <code> // See the previous thread regarding // "[regex] Unresolved external symbols under VC7.1 w/ dynamic linking #define BOOST_ALL_DYN_LINK #include <boost/signals.hpp> int main(int argc, char* argv[]) { return 0; } </code> I get some compiler warnings under MSVC 7.1 / Boost 1.32. Is there something I can do about it? Here is the compiler output I get: c:\dev\Libraries\Boost\include\boost-1_32\boost\signals\connection.hpp(111) : warning C4251: 'boost::signals::connection::con' : class 'boost::shared_ptr<T>' needs to have dll-interface to be used by clients of class 'boost::signals::connection' with [ T=boost::signals::detail::basic_connection ] c:\dev\Libraries\Boost\include\boost-1_32\boost\signals\trackable.hpp(55) : warning C4251: 'boost::signals::trackable::connected_signals' : class 'std::list<_Ty>' needs to have dll-interface to be used by clients of class 'boost::signals::trackable' with [ _Ty=boost::signals::connection ] c:\dev\Libraries\Boost\include\boost-1_32\boost\signals\slot.hpp(51) : warning C4251: 'boost::signals::detail::slot_base::data' : class 'boost::shared_ptr<T>' needs to have dll-interface to be used by clients of class 'boost::signals::detail::slot_base' with [ T=boost::signals::detail::slot_base::data_t ] c:\dev\Libraries\Boost\include\boost-1_32\boost\signals\detail\named_slot_map.hpp(100) : warning C4251: 'boost::signals::detail::named_slot_map_iterator::impl_' : class 'boost::scoped_ptr<T>' needs to have dll-interface to be used by clients of class 'boost::signals::detail::named_slot_map_iterator' with [ T=boost::signals::detail::named_slot_map_iterator::impl ] c:\dev\Libraries\Boost\include\boost-1_32\boost\signals\detail\named_slot_map.hpp(129) : warning C4251: 'boost::signals::detail::named_slot_map::impl_' : class 'boost::scoped_ptr<T>' needs to have dll-interface to be used by clients of class 'boost::signals::detail::named_slot_map' with [ T=boost::signals::detail::named_slot_map::impl ] c:\dev\Libraries\Boost\include\boost-1_32\boost\signals\detail\signal_base.hpp(40) : warning C4251: 'boost::signals::detail::call_notification::impl' : class 'boost::shared_ptr<T>' needs to have dll-interface to be used by clients of class 'boost::signals::detail::call_notification' with [ T=boost::signals::detail::signal_base_impl ] c:\dev\Libraries\Boost\include\boost-1_32\boost\signals\detail\signal_base.hpp(114) : warning C4251: 'boost::signals::detail::signal_base_impl::combiner_' : class 'boost::any' needs to have dll-interface to be used by clients of class 'boost::signals::detail::signal_base_impl' c:\dev\Libraries\Boost\include\boost-1_32\boost\any.hpp(22) : see declaration of 'boost::any' c:\dev\Libraries\Boost\include\boost-1_32\boost\signals\detail\signal_base.hpp(120) : warning C4275: non dll-interface class 'boost::noncopyable_::noncopyable' used as base for dll-interface class 'boost::signals::detail::signal_base' c:\dev\Libraries\Boost\include\boost-1_32\boost\noncopyable.hpp(22) : see declaration of 'boost::noncopyable_::noncopyable' c:\dev\Libraries\Boost\include\boost-1_32\boost\signals\detail\signal_base.hpp(120) : see declaration of 'boost::signals::detail::signal_base' c:\dev\Libraries\Boost\include\boost-1_32\boost\signals\detail\signal_base.hpp(150) : warning C4251: 'boost::signals::detail::signal_base::impl' : class 'boost::shared_ptr<T>' needs to have dll-interface to be used by clients of class 'boost::signals::detail::signal_base' with [ T=boost::signals::detail::signal_base_impl ] Best, Klaus -- Klaus Nowikow DECOMSYS - Dependable Computer Systems Development Engineer Stumpergasse 48/14, A-1060 Wien, Austria Phone: +43 1 59983-31 Fax: +43 1 59983-731 http://www.decomsys.com

2 1

Partial template specialization of template functions
by Davi de Castro Reis 24 Mar '05

24 Mar '05

Hi all, I am trying to specialize some (non-trivial) function templates, but I am getting a lot of unexpected compile errors. These are functions with a template parameter that can not be inferred by parameters types and needs to be explicitly set at the function call. Can someone give me some light? Read on for a more in-depth explanation. Below we have a traditional partial specialization. This compiles and works fine. //Generic function template <class T, class U> void f(T a, U b) {} //Partial specialization template <class U> void f(int a, U p) {} int main(int argc, char **argv) { long a, b; int c; f(a, b); //call the generic function f(c, b); //call the partial specialization } So the code above is ok. Now let us create a "template function", one where you can not infer one of the template parameter just by the parameters types: //Generic "template function" template<class X, class T, class U> void f(T a, U b) {} int main(int argc, char **argv) { long a, b; int c; f<long>(a, b); //calls generic "template function" f<long>(a, c); //calls generic "template function" } The code above also works fine. Now I want to mix both things, and this is where the problem arises. See the code: //Generic "template function" template<class X, class T, class U> void f(T a, U b) {} //"template function" partial specialization template<class X, class U> void f(int a, U b) {} int main(int argc, char **argv) { long a, b; int c; f<long>(a, b); //calls generic "template function" f<long>(c, b); //should call "template function" specialization } But the second function call above, surprisingly, does not compile: g++ test2.cc test2.cc: In function `int main(int, char**)': test2.cc:19: error: call of overloaded `f(int&, long int&)' is ambiguous test2.cc:8: error: candidates are: void f(T, U) [with X = long int, T = int, U = long int] test2.cc:12: error: void f(int, U) [with X = long int, U = long int] Same results using intel compiler: davi@supermaquina cxx4ever $ icc -w test2.cc test2.cc(19): error: more than one instance of overloaded function "f" matches the argument list: function template "f<X,T,U>(T, U)" function template "f<X,U>(int, U)" argument types are: (int, long) f<long>(c, b); //should call "template function" partial specialization ^ So, what is happening here? I do agree that this is ambiguous, but the most specific case should be chosen, as it happens with the traditional template specialization (which is also ambiguous until you choose the more specific code). What makes me think that I am missing something is that both compilers says that f() is overloaded. But it should not be. This should be a partial specialization, not an overload. Well, that is it. Some tips? Thanks in advance, Davi de Castro Reis

2 1

[rational] Announcing new maintainer -- call for feature requests
by Jonathan Turkanis 24 Mar '05

24 Mar '05

Dear All, Several months ago I became the official maintainer of Boost.Rational, and am just now getting around to considering proposed modifications to the library. I would like to know: 1. Do people use Boost.Rational, and if so, what is it used for, and with what template parameters? 2. What changes or additions would people like to see? Here are the changes that have been proposed: A. [me and others] Make int_type (and possibly param_type) public. This will be done. B. [Andras Erdei] Make rational more usable with limited precision integral types by providing automatic rounding when the result of a computation can not be represented exactly, or by asserting or throwing an exception in such cases. C. [Andras Erdei] Provide automatic selection of the underlying int_type which would be fastest for representing rational arithmetic with a specified precision. ---- Proposal B Andras's original proposal, if I understood it correctly, was to use a form of rounding which could be computed as the natural side-effect of the existing algorithm to compute a rational arithmetic operation, in the case that the actual result could not be represented exactly using the underlying int_type. At the time, I questioned whether it would be acceptable to change the current behavior of rational, since some current users may be relying on it. This is partly why I am asking question 1) above. A more general solution would be to add an optional template parameter representing a rounding policy, which could - implement no rounding, silently resulting garbage in some cases (this is the current implementation) - implement Andras's rounding method - throw an exception if rounding would be required - assert if rounding would be required, or - (possibly) implement some other rounding algorithm The reason I qualified the last option with "possibly" is that implementing alternate rounding policies may require completely different algorithms for the basic operations, meaning that the implementations of the basic operations would have to be moved into the rounding policy, which I'm reluctant to do. Andras, please let me know if I have misrepresented your ideas. For background, see these threads: http://lists.boost.org/MailArchives/boost/msg76375.php http://lists.boost.org/MailArchives/boost/msg80121.php ---- Jonathan

1 0

Boost.Thread: how to query the state of a thread
by Malte Starostik 24 Mar '05

24 Mar '05

{to moderator: sorry, picked the wrong sender address last time, this one is subscribed} Hi, looking through the docs I can't seem to find a way to query boost::thread whether it's still running or has terminated and if so if it's still joinable. Is that information available somehow or do I need to keep track myself? TIA, Malte

2 1

Finding member offset in compile time
by Davi de Castro Reis 24 Mar '05

24 Mar '05

Hi all, The question I have is not boost specific (maybe not even boost related), so if you think it is not appropriate to ask it here, please, please just tell me. So, here it goes. Is it possible to find the offset of a class member in compile time? In runtime, I can get the offset of member m1 in class A with the code offset = ((A *)0)->m1 But I want this value in compile time to use in some template metaprogramming. Is this possible? Since sizeof() is compile time, I suspect there is a way to do it. This would come very in hand for a metaprogramming based serialization library I am working on. Thanks in advance, Davi de Castro Reis If it is not appropriate to ask such questions here, could someone point me a C++ list where I could ask some advanced questions?

4 5

[typeof] submission updated
by Arkadiy Vertleyb 24 Mar '05

24 Mar '05

Hi all, My mail client seems to fail to CC this here, so I am re-posting: The typeof submission in the Boost sandbox file vault has been updated to include a fix allowing faster compiles with GCC (in emulation mode), as well as a workaround for what seems to be remains of ETI bug in VC71. Please take it at: http://boost-sandbox.sourceforge.net/vault/, typeof.zip. Regards, Arkadiy

1 0

BGL: remove_edge fails under certain circumstances
by Jean Utke 24 Mar '05

24 Mar '05

Hi, I noticed that with boost 1.32 under gcc 3.4.3 there are cases when remove_edge fails to remove the edge in question. I put this with all kinds of details on bugtracker under http://sourceforge.net/tracker/index.php?func=detail&aid=1166401&group_id=7… In short the problem appears to be the use of std::equal_range in the code for remove_edge. With a certain order of the vertex and edge creation it happens that equal_range returns an (end_of_list,end_of_list) pair instead of the range that includes the edge in question. I believe this is due to the list not being ordered according to the same "<" operator that std::equal_range invokes. So equal_ranges logic doesn't find the proper range, and remove_edge simply returns without warning and without removing the edge in question. There is more detail in the bug report mentioned above. I am just wondering about a good workaround. Currently I am considering to replace the equal_range call in my copy of the source but there may be a better way. ? Jean -- Jean Utke Argonne National Lab./MCS utke(a)mcs.anl.gov phone: 630 252 4552 cell: 630 363 5753

2 3

boost::iterator_facade problem with postfix increment proxy
by Jens Theisen 24 Mar '05

24 Mar '05

I want to implement my own iterator as single pass traversal with reference type value& (a genuine reference). My problem is, that the iterator facade concludes from the single pass traversal, that this is an input/output iterator and those are generelly subject to a postfix increment proxy. That is, writing *iter++ = some_value; doesn't really do anything but changing a temporary value in the proxy. In addition to this, iter++ == iter would't find a suited overload, which seems to be a bug. Chancing the traversal tag to forward traversal works correct, but that's not really what I want to do. I want my iterator to be single pass since I don't support the i == j => ++i == ++j requirement. Jens

3 10

[Boost.Test] (Solution) for Visual Studio - Link error, need to be pointed in the right direction
by Peter 24 Mar '05

24 Mar '05

Gennadiy, Once again thanks for the help. Since I could not find anything clear on how to do this myself I thought I would share it with the list and anyone else who does not know how to do this. This process allows me to create a fresh Visual 2005 C++ project and compile the various Boost.Test Unit Testing Framework examples, located under the boost.test documentation branch on the boost website. Assumptions: You have correctly installed and setup Boost (see http://www.boost.org/more/getting_started.html for more information). _Step 1_ File -> New -> Project -> General -> Console (within the wizard choose empty project and console application) _Step 2_ Create a New C++ source code file (*.cpp), add the example code you wish to run _Step 3_ Bring up the properties for the project (Within Solution Explorer right click and select properties on the project) Expand the C/C++ node of the treeview: * Select preprocessor and within the Preprocessor Definitions add the "BOOST_TEST_NO_AUTO_LINK" directive. * Select Code Generation and change the Runtime Library to "Multi-threaded Debug DLL (/MDd)" Expand the Linker node of the treeview: * Select Input and within the Additional Dependencies add "libboost_unit_test_framework-vc80-mt-gd.lib" _Step 4_ Save the project properties. _Step 5_ Compile the code. Notes: 1. The actual Lib file (libboost_unit_test_framework-vc80-mt-gd.lib) may be different for each system? Also I am guessing the Release version to link against will be the lib file without the gd. Also I think the runtime library setting will change to. 2. I have not figured out how to get the output of the tests to appear within the IDE. Currently I do a dodgy and just put a breakpoint within unit_test_main.cpp. Yes I know this is dodgy but I am still learning my way. I hope this helps others interested in using boost and specifically the Unit Test Framework within boost. (I know I would have a week ago :p) Peter.

1 0

regex_search (extended syntax) can search to the end of the iterator
by David McKelvie 23 Mar '05

23 Mar '05

>> It seems that regex_search iterates to the end of the sequence >> using ++iterator rather than stopping once it has found the first match John Maddock replied: >> 1) reproduce the behaviour with 1.32. >> 2) Let me have a reproducible test case. >> 3) Check that it's not a call to std::distance that seeking the iterator to >> the end (it shouldn't be). I have now reproduced the behaviour with Boost 1.32. I include a test case below. It does seem to be a call to std::distance which is seeking the end. The problem arises only if boost::regex::extended is specified at break /usr/local/include/boost-1_32/boost/regex/v4/perl_matcher_common.hpp:418 m_result.maybe_assign(*m_presult) is being called which then calls std::distance which does the seek to the end. The problem is probably in my iterator implementation as this is the first Ive tried to write, But that seems simple enough, so maybe its more general. This is running on Linux Fedora Core 1 Boost 1.32 gcc version 3.3.2 20031022 (Red Hat Linux 3.3.2-1) David

1 0

[BGL] Question about push_relabel_max_flow
by Matthias Linkenheil 23 Mar '05

23 Mar '05

Hello, I used the edmunds_karp_max_flow algorithm in my project and it worked fine. Then I changed it to the push_relabel_max_flow algorithm but it doesn't work. I get an access violation at line 562 in the push_relabel_max_flow.hpp . Have anyone an idea where the problem could be? Line 558 - line 565 of push_relabel_max_flow.hpp : // do the bottom u = bos; ai = out_edges(u, g).first; while (excess_flow[u] > 0) { if (capacity[*ai] == 0 && is_residual_edge(*ai)) push_flow(*ai); ++ai; } Thanks, Matthias

5 9

BGL: a quick question on bundled properties and graph traits
by Elvanör 23 Mar '05

23 Mar '05

Hello, How can I get the type of my vertex properties if I use bundled properties as internal properties? My example is this one: typedef adjacency_list<mapS, vecS, undirectedS, myClass> Graph; // and in one function: template <class graph> void myFunction (Graph & g) { // Here I need to declare an object of type myClass... how can I get this type using graph_traits ?? } Thanks. Again, the documentation on bundled properties really need to be improved, IMHO. All the information I could find was relevant to the old property maps mechanism... Jean-Noël

3 5

copy_file reliable?
by Oliver Kowalke 23 Mar '05

23 Mar '05

Hello, is boost::filesystem::copy_file reliable? If the os indicates some failure during copy of a file (for instance no more space available) the destination file is removed or left in an incomplete state? thx, Oliver -- "Happy ProMail" bis 24. M�rz: http://www.gmx.net/de/go/promail Zum 6. Geburtstag gibt's GMX ProMail jetzt 66 Tage kostenlos!

2 1

Why does regex_search search to the end of the iterator?
by David McKelvie 23 Mar '05

23 Mar '05

Could anyone explain the following behaviour of regex_search (In /usr/include/boost/regex/v3/regex_match.hpp, so Version 3) Using regex_search acting on a pair of iterators, with input "aaa bbb ccc\naaaaaaX" and regexp "(aaa)|(bbb)|(.)|(\n)" and the match_continuous flag set. It seems that regex_search iterates to the end of the sequence using ++iterator rather than stopping once it has found the first match or even the longest match. Why is this? I guess it is an optimisation to speed up subsequent matches. Is there a way of avoiding this? I have an application in mind where maybe I dont have the entire sequence or rather I'd like the match before I have the complete sequence. thanks, David --- details -- Why does regex_search iterate to the end of the sequence in the following situation, with match_continuous set It seems to me that it could stop as soon as it finds 'aaa' and not iterate further. expression.assign("(aaa)|(bbb)|(.)|(\n)"); // Regular expression const char * input = "aaa bbb ccc\naaaaaaX"; // Input string MyCharIter start = my_begin(input), end = my_end(input); boost::match_results<MyCharIter> what; boost::regex::flag_type flags = boost::match_default | boost::match_not_dot_newline | boost::match_continuous ; regex_search(start,end, what, expression, flags); MyCharIter is just a test iterator on the string with MyCharIter& MyCharIter::operator++(){ // prefix ++X printf("NT: ++X called bp=%d c= '%c'\n",bp,s[bp]); ++bp; return *this; } The output is NT: ++X called bp=0 c= 'a' NT: ++X called bp=1 c= 'a' NT: ++X called bp=2 c= 'a' NT: ++X called bp=0 c= 'a' NT: ++X called bp=1 c= 'a' NT: ++X called bp=2 c= 'a' NT: ++X called bp=3 c= ' ' NT: ++X called bp=4 c= 'b' NT: ++X called bp=5 c= 'b' NT: ++X called bp=6 c= 'b' NT: ++X called bp=7 c= ' ' NT: ++X called bp=8 c= 'c' NT: ++X called bp=9 c= 'c' NT: ++X called bp=10 c= 'c' NT: ++X called bp=11 c= ' ' NT: ++X called bp=12 c= 'a' NT: ++X called bp=13 c= 'a' NT: ++X called bp=14 c= 'a' NT: ++X called bp=15 c= 'a' NT: ++X called bp=16 c= 'a' NT: ++X called bp=17 c= 'a' NT: ++X called bp=18 c= 'X' NT: ++X called bp=0 c= 'a' NT: ++X called bp=0 c= 'a' NT: ++X called bp=1 c= 'a' NT: ++X called bp=2 c= 'a' NT: ++X called bp=0 c= 'a' NT: ++X called bp=0 c= 'a' NT: ++X called bp=1 c= 'a' NT: ++X called bp=2 c= 'a' NT: ++X called bp=0 c= 'a' NT: ++X called bp=1 c= 'a' NT: ++X called bp=2 c= 'a' ******** N = 0 Result = aaa

2 3

compiling error using Boost with VC++ 6
by Samvit Prakash 23 Mar '05

23 Mar '05

Hi, First a confession: I am new to VC++ AND to BOOST...I thought the best way to learn both was to dive right in...and now I'm looking for a life-guard! OK, so here's the problem: I have installed the Boost Library in its default location (C:/Boost... ). When I try to compile the code random_demo.cpp (link to the code: http://www.boost.org/libs/random/random_demo.cpp) I get the following error: "fatal error C1083: Cannot open include file: 'boost/random/linear_congruential.hpp': No such file or directory Error executing cl.exe." Clicking on the error leads me to the following source of error in the code: #include <boost/random/linear_congruential.hpp> I have added the root Boost directory to the directory path: (tools>options>directories > I added C:\Boost there for "include files") So I am not sure why the compiler can't locate the file. Any help would be appreciated. Thanks, samvit

3 4

Using Boost after installation
by Ioannis Vranos 23 Mar '05

23 Mar '05

I installed Boost 1.32 to VS 2003 and MINGW 3.4.2 (got 80 failures for the second), and now I am trying to use it with both but the compiler's can't find the boost header files by their own. For example the source code: #include <boost/static_assert.hpp> int main() { int i=1; BOOST_STATIC_ASSERT(i==1); } produces: C:\c>g++ temp.cpp -o temp.exe temp.cpp:1:35: boost/static_assert.hpp: No such file or directory temp.cpp: In function `int main()': temp.cpp:7: error: `BOOST_STATIC_ASSERT' undeclared (first use this function) temp.cpp:7: error: (Each undeclared identifier is reported only once for each fu nction it appears in.) C:\c>cl /EHsc temp.cpp Microsoft (R) 32-bit C/C++ Optimizing Compiler Version 13.10.3077 for 80x86 Copyright (C) Microsoft Corporation 1984-2002. All rights reserved. temp.cpp temp.cpp(1) : fatal error C1083: Cannot open include file: 'boost/static_assert. hpp': No such file or directory C:\c> I tried everything I could think like adding the c:\Boost folder and subfolders in PATH environment variable, or explicitly #include the file with its entire path, with no result. What am I missing here? Thanks in advance.

4 3

Re: [Boost-users] [Boost.Test] Link error, need to be pointed in the right direction
by Peter 23 Mar '05

23 Mar '05

Hi Gennadiy, Thanks for replying. Comments following. > * To: boost-users@xxxxxxxxxxxxxxx <mailto:boost-users@DOMAIN.HIDDEN> > * Subject: [Boost-users] Re: [Boost.Test] Link error,need to be pointed in the right direction > * From: "Gennadiy Rozental" <gennadiy.rozental@xxxxxxxxxxx <mailto:gennadiy.rozental@DOMAIN.HIDDEN> > > * Date: Sun, 20 Mar 2005 23:50:50 -0500 > * Organization: Thomson Financial > * References: <A3FB6A3DCF268B47A774EA32AE996CC338E3(a)quantum.Billswan.local <http://lists.boost.org/MailArchives/boost-users/msg10496.php> > > * Reply-to: boost-users@xxxxxxxxxxxxxxx <mailto:boost-users@DOMAIN.HIDDEN> > * Sender: news <news@xxxxxxxxxxxxx <mailto:news@DOMAIN.HIDDEN> > > > ________________________________ > > You need to link with the Unit Test Framework component of Boost.Test > > Compile it (using bjam or you could use project file supplied with library, > VC 2005 will cmvert it to appropriate format automatically) and add to the > list of libraries to link with. > > HTH, > > Gennadiy I knew I had to link it against the Unit Test Framework libraries I just wasn't sure exactly where to stipulate this. I didn't realise that you had included some VC project files as an initial starting point. Anyway I still need some help, I am almost there now .... I can feel it :p. This is what I have done. I have opened up the Version 7.1 project file(s), taking one at random ..\boost_1_32_0\libs\test\build\msvc71_proj\unit_test_example2.vcproj I converted this file to the new format. Looking through all the project settings I found a number of items that you set (or whoever initially setup the projects). The most interesting (disturbing) appears to be where you specify the lib file dependency which is set to "unit_test_framework.lib", looking through the (bjam) compiled lib directory I cannot find a lib file with that name the closest files I have are: ------------------------ D:\Development\boost\lib\dir *unit_test* Volume in drive D is Applications Volume Serial Number is A8BC-D142 Directory of D:\Development\boost\lib 03/03/2005 09:04 PM 1,385,358 libboost_unit_test_framework-vc80-mt-1_32.lib 03/03/2005 09:04 PM 6,076,308 libboost_unit_test_framework-vc80-mt-gd-1_32.lib 03/03/2005 09:04 PM 6,076,308 libboost_unit_test_framework-vc80-mt-gd.lib 03/03/2005 09:04 PM 1,936,966 libboost_unit_test_framework-vc80-mt-s-1_32.lib 03/03/2005 09:04 PM 1,936,966 libboost_unit_test_framework-vc80-mt-s.lib 03/03/2005 09:04 PM 6,957,836 libboost_unit_test_framework-vc80-mt-sgd-1_32.lib 03/03/2005 09:04 PM 6,957,836 libboost_unit_test_framework-vc80-mt-sgd.lib 03/03/2005 09:04 PM 1,385,358 libboost_unit_test_framework-vc80-mt.lib 03/03/2005 09:04 PM 1,936,678 libboost_unit_test_framework-vc80-s-1_32.lib 03/03/2005 09:04 PM 1,936,678 libboost_unit_test_framework-vc80-s.lib 03/03/2005 09:04 PM 4,495,796 libboost_unit_test_framework-vc80-sgd-1_32.lib 03/03/2005 09:04 PM 4,495,796 libboost_unit_test_framework-vc80-sgd.lib 12 File(s) 45,577,884 bytes 0 Dir(s) 297,679,298,560 bytes free ------------------------ Now I am guess I need to change that lib file to one of these. Going through the project settings I have Multi-Threading on and it is obviously in debug mode. Looking at the bottom of this page: http://www.boost.org/more/getting_started.html it describes what each of the parts of the file name means (so I need mt, g and d). Based on this information I chose: libboost_unit_test_framework-vc80-mt-gd.lib This appears to work. Is this correct? Or have a managed to add 2 + 2 and get 5? As a slight aside the IDE does not display the output of the Unit test. Was it supposed to? I was under the impression that it should have. One minor think that I think I found. Looking within the jamfile ..\boost_1_32_0\libs\test\build\Jamfile. I think that it is saying that it needs a lib file named boost_unit_test_framework. I don't know if this is or isnt the case (I have never used bjam before compiling boost), I just thought I would mention it just in case that it is wrong as well. Enough rambling from me now. Thanks for reading through this and I appreciate any help anyone can provide. Peter.

2 1

Serialization library
by Przemyslaw Sliwa 23 Mar '05

23 Mar '05

I have suggestion for further development of the Serialization library. VC++ does not recognise if the project has the generation of the RTTI enabled or not. It took me 2 hours to figure out where is the problem in my program until I have used the what() member in the std::exception. It could be avoided if a simple macro is added. Additionally I do not know where the exception xml_archive_exception is defined. I have found a documentation on the website of the developer who created the library but I cannot figure out in which header it is defined. Thanks a lot for help, Pshemek -- This e-mail may contain confidential and/or privileged information. If you are not the intended recipient (or have received this e-mail in error) please notify the sender immediately and destroy this e-mail. Any unauthorized copying, disclosure or distribution of the material in this e-mail is strictly forbidden.

1 0

Re: [Boost-users] compiling error using Boost with VC++ 6
by Peter 23 Mar '05

23 Mar '05

Hi, I am not sure if this is of any use to you but you can get the free version of the microsoft compiler and linker of Visual C++ 2003. This is exactly the same as the version shipped with the shrink wrapped product. Check this link out: http://msdn.microsoft.com/visualc/vctoolkit2003/ Note: Read the EULA first I dont know what restrictions they put on the toolkit. Also this does not come with an IDE but there are various free IDE's out there that you could setup to use the Microsoft compiler. Hope this helps. Peter. ---- Samvit Prakash <samvit(a)math.umd.edu> wrote: > > Yes, it's the latest version of boost (1.32). I don't have access to VC7 > as the firm for which I am interning doesn't have that. So I just have to > make do with VC6. > > > At Tuesday 2005-03-22 14:39, you wrote: > >>Hi, > >> > >>First a confession: I am new to VC++ AND to BOOST...I thought the best > >> way > >>to learn both was to dive right in...and now I'm looking for a > >> life-guard! > > > > what version of boost (the latest is 1.32)? > > and get a newer compiler 6 was released before the standard for C++ was > > even approved!!! > > > > > > > >>OK, so here's the problem: I have installed the Boost Library in its > >>default location (C:/Boost... ). > >> > >>When I try to compile the code random_demo.cpp (link to the code: > >>http://www.boost.org/libs/random/random_demo.cpp) I get the following > >>error: > >> > >>"fatal error C1083: Cannot open include file: > >>'boost/random/linear_congruential.hpp': No such file or directory > >>Error executing cl.exe." > >> > >>Clicking on the error leads me to the following source of error in the > >> code: > >>#include <boost/random/linear_congruential.hpp> > >> > >>I have added the root Boost directory to the directory path: > >>(tools>options>directories > I added C:\Boost there for "include files") > >>So I am not sure why the compiler can't locate the file. > >> > >>Any help would be appreciated. > >> > >>Thanks, > >>samvit > >> > >>_______________________________________________ > >>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 > > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users >

1 0

Re: [shared_ptr] get_deleter is for what?
by Mark Holloway 23 Mar '05

23 Mar '05

Peter Dimov Wrote: >This problem should be fixed in the latest CVS version of boost::shared_ptr. >If you can try it and report back, it would be much appreciated. Building with the latest CVS shared_ptr files has resolved the problem. Thanks, Mark

1 0

boost::filesystem - no create_file or create_tmp_file?
by Oliver Kowalke 23 Mar '05

23 Mar '05

Hi, I'm using boost-1.32 and I didn't find a function which creates an empty file or an empty temporary file?! thx, Oliver -- "Happy ProMail" bis 24. M�rz: http://www.gmx.net/de/go/promail Zum 6. Geburtstag gibt's GMX ProMail jetzt 66 Tage kostenlos!

3 6

gcc stlport or libstd++ with boost?
by will＠phototropia.org 23 Mar '05

23 Mar '05

Friends: I am new to boost. I was planning on using stlport for its debugging. However, I now realize that much of the info. I have read on libstd++ is dated. Using gcc 3.3 it seems like boost is better suited to libstd++(based on reading regression tests, and mail threads). Are most who use gcc and a lot of boost using libstd++ over stlport(these days)? thanks, Will

2 1

how to call a function of n scalars from a function of vector pointer
by BoschianPest, Stefano 23 Mar '05

23 Mar '05

Hi everybody. Is there a way to call a function of n arguments of type T as a function of vector<T>? In code: I have defined the function: void my_function(int dummy, T a_1, T a_2, ... T a_n) {...} Now I would like to call the function with a pointer ptr void (*ptr) (int, std::vector<T>) (or with a boost::function ptr). Regards Stefano This e-mail and any files transmitted with it are confidential and are intended solely for the use of the individual or entity to whom they are addressed. This communication represents the originator's personal views and opinions, which do not necessarily reflect those of Banca Caboto s.p.a. London Branch. If you are not the original recipient or the person responsible for delivering the email to the intended recipient, be advised that you have received this email in error, and that any use, dissemination, forwarding, printing, or copying of this email is strictly prohibited. Banca Caboto s.p.a. London Branch is regulated by the Financial Services Authority for the conduct of designated investment business in the UK. If you received this email in error, please immediately notify postmaster(a)cabotouk.com

1 0

boost::bind and member functions
by David Morrison 23 Mar '05

23 Mar '05

Hi, I'm interested in using boost::bind and std::transform to iterate through a container of member functions and initialize another container with the results. I've read through the documentation pretty carefully - in particular this bit from the bind documentation: typedef void (*pf)(int); std::vector<pf> v; std::for_each(v.begin(), v.end(), bind(apply<void>(), _1, 5)); So I've been able to iterator through a set of *non* member functions and intialize another container with the results. When I try the code below, I get the following error message: boost/bind/apply.hpp:39: must use .* or ->* to call pointer-to-member function in `f (...)' I have tried several variations involving mem_fn to try and create the appropriate functors, but so far, no joy. Is there a known solution to accomplish what I want to do? Dave #include <vector> #include <iostream> #include <iterator> #include "boost/bind.hpp" #include "boost/bind/apply.hpp" using namespace std; using namespace boost; struct A { float a(int m, float x) { return m * x;} float b(int m, float x) { return m + x;} float c(int m, float x) { return m - x;} float d(int m, float x) { return m / x;} }; typedef float (A::*pfn)(int, float); int main() { A a; int m = 2; float x = 3.0; vector<pfn> v; vector<float> f; v.push_back(&A::a); v.push_back(&A::b); v.push_back(&A::c); v.push_back(&A::d); transform(v.begin(), v.end(), back_inserter(f), bind(apply<float>(), _1, a, m, x)); copy(f.begin(), f.end(), ostream_iterator<float>(cout, "\n")); }

3 7

filter_iterator question
by steve ahlgren 22 Mar '05

22 Mar '05

Hello all : I have a filter_iterator question. I'm wondering if, conceptualy, I can construct an FI doing something like the following : typedef boost::filter_iterator< boost::bind( boost::mem_fn( &MyObject::HasQuality ), boost::ref( quality ) ), MyIterator > FilteredIterator; Instead of defining an explicit functor like this : struct MyFunctor { bool operator()( const MyObject& obj ) const { etc } }; and the FI like this : typedef boost::filter_iterator< MyFunctor, MyIterator > FilteredIterator; Gosh! Writing functors is flipping waste of time! Has anyone used the former construct instead? Thanks in advance! SGA

2 1

BGL: Undirected graphs and max flow
by Cyrille Damez 22 Mar '05

22 Mar '05

Hi all, I realize this might sound a little dumb, but I can't find in the documentation how to use (if it is possible at all) the push_relabel_max_flow function with undirected graphs. The problem is that push_relabel_max_flow requires an edge property that maps each edge to a reverse edge, which seems redundant when the graph type is undirected. Thanks,

3 2

RE: [Boost-users] Re: map with minimal memory footprint
by Jim.Hyslop 22 Mar '05

22 Mar '05

Gottlob Frege wrote: > I believe you, but can you explain what you mean by "iterator > invalidation properties". I wrote a vector_map once, and it was as > "map-ish" as needed at the time, so I suspect it was just a "useful > associative container", but I'm just curious as to what I was > missing... When you insert or erase elements in a container, The Standard imposes requirements on what happens to iterators and references you have to elements in a container. All map iterators and references must remain valid after inserts. After erasing, only iterators and references to the erased element are allowed to be invalidated. Inserts into vectors (including via 'resize' or 'reserve') can invalidate all references and iterators, if the vector has to reallocate; otherwise, only references and iterators to elements prior to the one being inserted remain valid. Erasing invalidates iterators and references to elements after the one being erased. If you have a copy of the Standard, search for "invalidate" in section 23 for full details. -- Jim Hyslop Senior Software Designer Leitch Technology International Inc. ( http://www.leitch.com ) Columnist, C/C++ Users Journal ( http://www.cuj.com/experts )

1 0

Serialization library
by Przemyslaw Sliwa 22 Mar '05

22 Mar '05

All, I would like to ask you a question if someone of you has ever used the boost serialization library. I managed to compile with VC++ 7.1 the sample code from the example website http://www.boost.org/libs/serialization/example/demo.cpp. It went well, but it is giving some strange run time errors. I managed to compile just in the debug mode and it does not work with the Release one. I am getting some strange link errors. There are several libraries in the serialization module and basically there is nothing about it which one should be used. Can you help me with it? The examples use just the text archive. The serialization module is huge and I know there are several other modes, e.g. XML, etc. The problem is lack of any kind of documentation. Does anyone of you use other archive types than the text ones? Thanks for help in advance -- This e-mail may contain confidential and/or privileged information. If you are not the intended recipient (or have received this e-mail in error) please notify the sender immediately and destroy this e-mail. Any unauthorized copying, disclosure or distribution of the material in this e-mail is strictly forbidden.

2 1

Re: map with minimal memory footprint
by Gottlob Frege 22 Mar '05

22 Mar '05

> 6. Re: map with minimal memory footprint (David Abrahams) > Date: Wed, 16 Mar 2005 09:45:34 -0500 > From: David Abrahams <dave(a)boost-consulting.com> > Subject: [Boost-users] Re: map with minimal memory footprint > To: boost-users(a)lists.boost.org > Message-ID: <uoedjd4z5.fsf(a)boost-consulting.com> > Content-Type: text/plain; charset=us-ascii > > Toon Knapen <toon.knapen(a)fft.be> writes: > > > Hi all, > > > > I'm using a rather big std::map which gives good performance but the > > memory footprint is a bit too big. So I figured to implement an std::map > > as an std::vector<std::pair<T1,T2>> but thus with the interface of an > > std::map on top of it. > > Can't be done. It has the wrong iterator invalidation properties. > You may be able to implement a useful associative container, but it > will never be std::map. > > -- > Dave Abrahams > Boost Consulting > www.boost-consulting.com > I believe you, but can you explain what you mean by "iterator invalidation properties". I wrote a vector_map once, and it was as "map-ish" as needed at the time, so I suspect it was just a "useful associative container", but I'm just curious as to what I was missing...

1 0

Re: [shared_ptr] get_deleter is for what?
by Mark Holloway 22 Mar '05

22 Mar '05

Ben Hutchings Wrote: >> I realise my requirements may be rather specific, but it seems >> shared_ptr has picked up some typeid baggage, which I can't afford. > Whyever not? Sorry - I wasn't playing the image size limitation game - it's just I'd rather class names were not revealed to the average image browser. Peter Dimov Wrote: >This problem should be fixed in the latest CVS version of boost::shared_ptr. >If you can try it and report back, it would be much appreciated. Will do. Thanks for the info Peter. Mark

1 0

[shared_ptr] get_deleter is for what?
by Mark Holloway 22 Mar '05

22 Mar '05

I realise my requirements may be rather specific, but it seems shared_ptr has picked up some typeid baggage, which I can't afford. I'm compiling using MSVC7.1 and for each object for which I use a shared_ptr, I gain an entry in my binary. For example, class Monty generates the following string in my exe: ?AU?$checked_deleter@VMonty@@@boost@@ This seems to be sucked in by this function in class sp_counted_base_impl: virtual void * get_deleter(std::type_info const & ti) { return ti == typeid(D)? &del: 0; } It isn't being used, and I can't actually see anything in boost using this, so maybe the compiler isn't doing a great job at stripping unused stuff? Anyone shed some light on this for me? Thanks Mark

3 2

boost parallel build, will it get better?
by Daniel Goller 22 Mar '05

22 Mar '05

Hi, i was wondering if there is a possibility boost (bjam?) will be supporting parallel builds better in the future, i was testing building with -j5 (-j5 is about the sweet spot at which distcc creates enough load on the helping XP3200 for this mac mini i work on) and boost was no longer able to successfully build, something it did before readding support for the user selected number of jobs. Basically im wondering what to tell users who start to notice we do not support their -jN settings ("bear with us it'll work in future" vs "we do not know if it will ever work") after having received notice that supporting make options might not be taken well by bjam (and being able to confirm this with distcc), while at the same time wishing i could take advantage of distcc myself. Is this something of concern to boost, or will it most likely remain at the state as it is in the 1.32.0 release? Thanks in advance for any information you can provide. Daniel

5 5

runtime polymorphism & passing and returning elements
by Kosta 22 Mar '05

22 Mar '05

The problem is not boost specific, but probably there is a boost specific solution to it... The usual way of passing and returning elements to/from a function/method is to use a templated function/method, e.g.: template< typename ITER_IN, typename ITER_OUT > void doSomething( ITER_IN inBegin, ITER_IN inEnd, ITER_OUT outIter, int param1, int param2, ... ) { while(inBegin != inEnd) { ... *outIter++ = ...; } } But what to do in case of (pure) virtual methods which can't be templated? One (neither pretty nor efficient) solution would be something like this: struct A { template<typename ITER_IN, typename ITER_OUT> void doSomething( ITER_IN inBegin, ITER_IN inEnd, ITER_OUT outIter, int param1, int param2, ... ) { const std::vector<int> out( doSomething_impl( std::vector<int>(inBegin, inEnd), param1, param2 ) ); std::copy(out.begin(), out.end(), outIter); } virtual std::vector<int> doSomething_impl( std::vector<int>& const in, int param1, int param2, ... ) = 0; }; // struct A Is there a better (boost-ish) solution?

1 0

BGL: adding vertex index property to listS listS adjacency list with with bundled attributes
by Sean Kelly 21 Mar '05

21 Mar '05

> Hi All, > > I'm trying to figure out how to add a vertex index property to the > following listS, listS adjacency list so I can use write_graphviz > > typedef boost::adjacency_list<boost::listS, > boost::listS, > boost::bidirectionalS, > > boost::shared_ptr<Sysgen::Visitable> > XTreeGraph; > > thanks for any help. > > - Sean > > Sean Kelly Ph.D, Sr. Software Engineer -- Xilinx Inc.

2 1

trim BUG??
by Groleo Marius 21 Mar '05

21 Mar '05

hello int main(){ string str1="\t \nhello world! "; trim_if(str1, is_any_of("\t") ); // str1 == "hello world!" trim_if(str1, is_any_of("\n") ); // str1 == "hello world!" cout << str1; } I get the following output: #> hello world! #> Isn't it supposed to be: #> hello world! #> ??? -- Regards, Groleo! .''`. # touch universe : :' : # chmod +rwx universe `. `'` # ./universe `- Debian - when you have better things to do than fix a system

2 1

Locking mechanisms other than scoped_lock
by Leon Mergen 21 Mar '05

21 Mar '05

Hello, I'm currently trying to achieve the following: A series of threads handle jobs (threads A). Of each of these jobs, in the end, a statistics object is placed in a container. This container will later be read-from by another thread (thread B), dedicated to continuously reading statistics data from other threads, and parse those statistics. Now, since it is very well possible a thread handles at least 1,000 jobs before statistics data is actually read from, I want it to hold a mutex lock to the data at all time. The class also has an internal volatile boolean, which flags whether another thread (thread B) wants to read from the container. If so, the writing thread (threads A) releases the lock, after which thread B will pick up the lock and write the data and resets the boolean flag. After releasing the lock, threads A will immediately try to re-acquire the lock. However, as far as I can see, for this approach, a scoped_lock will not be the most fantastic solution ? Or am I missing something really crucial about the scoped_lock being able to hold a lock outside a certain scope ? :) Thanks in advance for any suggestions about a locking type... :) Regards, Leon Mergen http://www.solatis.com/

6 7

Errors building CVS root sources with VC8
by Keith MacDonald 21 Mar '05

21 Mar '05

I have just done a checkout boost from cvs.sourceforge.net and tried to build with VC8 (cl version 14.0.40607.16) and Microsoft Platform SDK for Windows XP SP2, using the following commands: tools\build\jam_src\build.bat tools\build\jam_src\bin.ntx86\bjam "-sTOOLS=vc-8_0" This resulted in lots of these warnings: option 'Og' has been deprecated option 'Gs' has been deprecated ignoring unknown option '/MLd' ignoring unknown option '/ML' I read that Jam V2 should fix those, but I cannot see how to build it. More serious was the following compilation error: lexical_cast.hpp(150): error C2679: binary '>>' : no operator found which takes a right-hand operand of type 'std::basic_string<_Elem,_Traits,_Ax>' That file hasn't changed since last September, so am I wasting my time trying to use VC8? Thanks, Keith MacDonald

4 5

[Boost.Test] Link error, need to be pointed in the right direction
by Peter Foley 21 Mar '05

21 Mar '05

Hi, (Apologies if this gets through twice, I think my mail client used the wrong email address the first time) Thanks for taking the time to read through this. First things first: I am using Visual C++ 2005 Express Edition, I have compiled boost version 1.32. I have included the path to the include directory and the lib files directory. Boost is working I have managed to compile and run a number of the other examples (including linking against the libs created during the bjam process (eg boost.threads). The code that has the link error was taken from: http://www.boost.org/libs/test/doc/components/utf/getting_started/index. html --Code-- #include <boost/test/unit_test.hpp> using namespace boost::unit_test; test_suite* init_unit_test_suite( int argc, char* argv[] ) { test_suite* test= BOOST_TEST_SUITE( "const_string test" ); return test; } // EOF --End Code-- The comment at the end of the code suggests that I can compile this code with no errors. Now for the errors: -- Build Log Output -- ------ Build started: Project: Test, Configuration: Debug Win32 ------ Compiling... const_string_test.cpp Linking... const_string_test.obj : error LNK2019: unresolved external symbol "public: __thiscall boost::unit_test::test_suite::test_suite(class boost::unit_test::basic_cstring<char const >)" (??0test_suite@unit_test@boost@@QAE@V?$basic_cstring@$$CBD@12@@Z) referenced in function "class boost::unit_test::test_suite * __cdecl init_unit_test_suite(int,char * * const)" (?init_unit_test_suite@@YAPAVtest_suite@unit_test@boost@@HQAPAD@Z) LIBCMTD.lib(crt0.obj) : error LNK2019: unresolved external symbol _main referenced in function _mainCRTStartup Debug/Test.exe : fatal error LNK1120: 2 unresolved externals Build log was saved at <--SNIPPED LOG PATH--> Test - 3 error(s), 0 warning(s) ========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ========== -- End Build Log Output -- I know it is probably something really simple but for the life of me I am just missing it =/. Let me know if you need any more information. Thanks for any advice you can give. Peter.

2 1

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

20 Mar '05

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

3 2

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

20 Mar '05

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

2 2

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

20 Mar '05

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

3 6

result_of tutorial
by Ian McCulloch 19 Mar '05

19 Mar '05

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

6 25

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

19 Mar '05

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

2 1

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

18 Mar '05

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

4 4

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

18 Mar '05

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

2 1

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

18 Mar '05

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

1 0

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

18 Mar '05

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

1 0

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

18 Mar '05

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

2 1

BGL: Early out search
by John Donovan 18 Mar '05

18 Mar '05

Hi, I'm using the BGL to store a quadtree*. What I want to do is search the tree, testing each vertex against some criteria. If the test fails, then I want to ignore all its children for the duration of the search, because if the parent fails; all its children will fail. If a leaf vertex passes the test, then the search should finish, otherwise continue the search. Eventually there will be a path through the tree of vertices that matched the criteria, and it's this deepest vertex (which isn't necessarily a leaf vertex) that I want. What I'm thinking is writing a custom visitor, and overriding discover_vertex() to do the test. If the test fails, colour the vertex to fool the algorithm into thinking it's searched this vertex's children. If the test succeeds, then I add the vertex to a list. When the search is over, I can play around with the list to my heart's content. 1) Should I use depth_first_visit to handle the early termination? 2) If so, how can I determine if a vertex has children before they're visited? 3) Can I colour the vertices before the algorithm does, thus fooling it into skipping the vertex's children? 4) Which colour should I use? *a quadtree is a way of dividing 2D space. Start with a rectangle, which is represented by the root node. Divide this rectangle into four equal, non-overlapping quadrants, these become the children of the root node. Repeat this process for each child until you start paraphrasing Jonathan Swift. Each node will have either exactly 0 or exactly 4 children. -John Donovan The content of this message and any attached file are confidential and/or privileged and are for the intended recipient only. If you are not the intended recipient, any unauthorised use, disclosure, copying, distribution or other dissemination is strictly prohibited. If you receive this message in error please notify the sender immediately by email, telephone or fax and then delete this email. Any attachment with this message should be checked for viruses before it is opened. Magenta Software Limited cannot be held responsible for any failure by the recipient to check for viruses before opening any attachment. Copyright in this email and attachments created by us belongs to Magenta Software Limited. Should you communicate with anyone at Magenta Software Limited by email you consent to us monitoring and reading any such correspondence.

2 1

BGL - bundled properties
by manitou＠gmx.ch 18 Mar '05

18 Mar '05

Hello, I have encountered some problems with bundled properties in BGL. The following syntax works: property_map<CFD2CSM_graph_t, bool CFD2CSM_vertex_t::*>::type is_CSM_map = get(&CFD2CSM_vertex_t::is_CSM_node, CFD2CSM_graph); However, if I make two statements out of it I get some type-mismatch error property_map<CFD2CSM_graph_t, bool CFD2CSM_vertex_t::*>::type is_CSM_map; is_CSM_map = get(&CFD2CSM_vertex_t::is_CSM_node, CFD2CSM_graph); What is the reason for this behavior? Why is the second statement not ok? Cheers, Marc -- DSL Komplett von GMX +++ Superg�nstig und stressfrei einsteigen! AKTION "Kein Einrichtungspreis" nutzen: http://www.gmx.net/de/go/dsl

2 2

shared_ptr changes
by Peter Dimov 18 Mar '05

18 Mar '05

I've made some pretty extensive changes to the implementation of shared_ptr. It now uses a lock-free algorithm (originally invented by Alexander Terekhov) on Windows, and the old detail/shared_count.hpp has been refactored into a number of smaller headers. A per-count pthread_mutex is still being used on non-Windows platforms, but this is also going to change soon. Now is the time to test the new implementation; please report any errors you encounter. Some of you have posted patches against the old implementation; these will need to be reexamined, too. detail/lightweight_mutex will also change "soon"; it will just map into a CRITICAL_SECTION or a pthread_mutex depending on the platform. The spin locks will disappear. shared_ptr no longer uses lightweight_mutex. If you use some of the undocumented features of shared_ptr - BOOST_SP_USE_STD_ALLOCATOR, BOOST_SP_ENABLE_DEBUG_HOOKS, sp_collector.cpp - please say so. During the refactoring I may drop some of these features in order to simplify and streamline the implementation. Thanks, -- Peter Dimov http://www.pdimov.com

1 0

map with minimal memory footprint
by Toon Knapen 17 Mar '05

17 Mar '05

Hi all, I'm using a rather big std::map which gives good performance but the memory footprint is a bit too big. So I figured to implement an std::map as an std::vector<std::pair<T1,T2>> but thus with the interface of an std::map on top of it. I kind of recall a similar discussion and checked in the boost-sandbox but did not find anything similar. Anybody knows of implementations like these? Thanks, toon

4 3

Re: Re: Re: how to get regex to link in windows?
by Alexis H. Rivera-Rios 17 Mar '05

17 Mar '05

John, Thanks for the info. I found the problem. It was one of the headers of an external C library that I'm including contains defines LONG as a macro function, which conflicted with Windows LONG macro, therefore causing the compiler error. (Gotta love it when the problem turns out to be such a classic error :? ). I'm really sorry I wasted your time on this. I really appreciate your help, without it I wouldn't have been able to track the problem down. Thanks again! Alexis Programming Tutorial: In Python: To do this, do this In Perl: To do this, do this or this or this or this... In C: To do this, do this, but be careful In C++: To do this, do this, but don't do this, be careful of this, watch out for this, and whatever you do, don't do this __________________________________ Do you Yahoo!? Make Yahoo! your home page http://www.yahoo.com/r/hs

1 0

Re: Re: how to get regex to link in windows? (John Maddock)
by Alexis H. Rivera-Rios 17 Mar '05

17 Mar '05

John, I took out the hardcoded library and let the code figure it out by itself. I also removed the BOOST_REGEX_NO_W32 as you suggested but then I get compiler errors in the windows code (This was the reason I put BOOST_REGEX_NO_W32) Here are the errors; Linking to lib file: libboost_filesystem-vc71-mt-gd-1_32.lib Linking to lib file: libboost_regex-vc71-mt-gd-1_32.lib c:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\PlatformSDK\Include\WinNT.h(8390) : error C2143: syntax error : missing ')' before '->' c:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\PlatformSDK\Include\WinNT.h(8390) : error C2143: syntax error : missing ';' before '->' c:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\PlatformSDK\Include\WinNT.h(8390) : error C2165: 'left-side modifier' : cannot modify pointers to data c:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\PlatformSDK\Include\WinNT.h(8390) : error C2059: syntax error : ')' c:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\PlatformSDK\Include\WinBase.h(2382) : error C2143: syntax error : missing ')' before '->' c:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\PlatformSDK\Include\WinBase.h(2382) : error C2143: syntax error : missing ';' before '->' c:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\PlatformSDK\Include\WinBase.h(2382) : error C2165: 'left-side modifier' : cannot modify pointers to data c:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\PlatformSDK\Include\WinBase.h(2382) : error C2059: syntax error : ')' Programming Tutorial: In Python: To do this, do this In Perl: To do this, do this or this or this or this... In C: To do this, do this, but be careful In C++: To do this, do this, but don't do this, be careful of this, watch out for this, and whatever you do, don't do this __________________________________ Do you Yahoo!? Yahoo! Small Business - Try our new resources site! http://smallbusiness.yahoo.com/resources/

2 1

composition and arguement binding: what to use: boost::bind vsboost::mpl vs boost::lambda
by Robert Mathews 17 Mar '05

17 Mar '05

I've become rather confused about the exact relationship between these libraries. In particular, boost::mpl seems to contain placeholders and lambda templates just like boost::bind and boost::lambda. That leds me to wonder if there would be any point to using boost::bind or boost::lambda if you are using boost::mpl? In fact, if boost::mpl is a functional superset of the other two libraries, why not drop those libraries from boost altogether and eliminate the confusion? Rob.

5 6

[regex] Unresolved external symbols under VC7.1 w/ dynamic linking
by Klaus Nowikow 17 Mar '05

17 Mar '05

Hello, when I define the symbol BOOST_DYN_LINK (in my project settings) I get the following linker errors in MSVC 7.1: FilterDlg.obj : error LNK2001: unresolved external symbol "wchar_t * boost::re_detail::wide_lower_case_map" (?wide_lower_case_map@re_detail@boost@@3PA_WA) FilterDlg.obj : error LNK2001: unresolved external symbol "private: static unsigned short * boost::w32_regex_traits<wchar_t>::wide_unicode_classes" (?wide_unicode_classes@?$w32_regex_traits@_W@boost@@0PAGA) When linking Boost.Regex statically, everything is ok. I am using /Zc:wchar_t ("Treat wchar_t as Built-in type") in my project settings. Any ideas what's going wrong? Regards, Klaus

2 4

Boost.Build -- how to get started?
by Arkadiy Vertleyb 17 Mar '05

17 Mar '05

Hi all, I am trying to use Boost.Build to build my own project. However I found out that the documentation, while doing a good job in explaining details, is petty difficult to use if all one wants to know is how to use bjam to build a "Hello world" project in a couple of toolsets. I already downloaded bjam.exe, and I have no problem in creating the jamfile. However, AFAIU, I need more files to be installed, such as jamrools, files that describe toolsets, etc. Can anybody to just list which files are needed, where to get, and where to put them? Or point me to where it's described if I missed something... Unless, of course, this is kind of Illuminati path, and one only deserves to use this tool if able to figure out how? :-) Thanks a lot in advance. Regards, Arkadiy

2 3

what should be used if shared_polymorphic_cast is deprecated?
by Bernard Chen 16 Mar '05

16 Mar '05

Hello, I was looking at the casting functions and the one that had the behavior I wanted most was the shared_polymorphic_cast. I do not want an empty shared_ptr<T> to be created if the cast cannot be performed. I would prefer to have an exception thrown in debug mode and release mode. The problem is that while going through the shared_ptr.hpp, I found a comment on line number 388 just above all the cast conversion functions "// shared_*_cast names are deprecated. Use *_pointer_cast instead." I have not found a *_pointer_cast function that does what I want. The dynamic_pointer_cast does not throw an exception. Is there a good alternative? Should I enforce a standard on my team of using dynamic_pointer_cast along with a run-time check of seeing if an empty shared_ptr<T> was created? Thanks, Bernard

2 1

RE: [Boost-users] Determinism of operator< on shared_ptr
by Renaud Lepere 16 Mar '05

16 Mar '05

> From Peter Dimov > > In other words, in the following code i would like to know > if is_less > > will always have the same value or not ? > > > > shared_ptr<int> p1(new int(0)); > > shared_ptr<int> p2(new int(0)); > > bool is_less(p1 < p2); > > I'm not sure what you are asking. is_less will be either true > or false, and > it will remain the same value if you don't modify p1 or p2. > p2 < p1 will > have the opposite value of p1 < p2. > I was not clear, if we consider the following code bool f() { shared_ptr<int> p1(new int(0)); shared_ptr<int> p2(new int(0)); return (p1 < p2); } int main() { // some function calls bool b1(f()); // some other function calls bool b2(f(()); assert(b1 == b2); return 0; } will the assertion be always true (is f() a deterministic function). Thanks, Renaud

2 1

boost::function, boost::bind question
by Philippe Després 16 Mar '05

16 Mar '05

Hello, I am using Numerical Recipes routines and I am trying to call this function void mrqmin(Vec_I_DP &x, Vec_I_DP &y, Vec_I_DP &sig, Vec_IO_DP &a, Vec_I_BOOL &ia, Mat_O_DP &covar, Mat_O_DP &alpha, DP &chisq, void funcs(const DP, Vec_I_DP &, DP &, Vec_O_DP &), DP &alamda); and I would like to call it with funcs being a member function pointer of one of my class. I can declare the member as static but then I cannot access member variable, which is the goal here. Someone suggested to use boost to solve the problem. His solution is here http://www.numerical-recipes.com/forum/showthread.php?s=&threadid=526 I tried to implement this but the result is this error: cannot convert `boost::function<void ()(double, const Vec_I_DP&, double&, Vec_O_DP&), std::allocator<void> >' to `void (*)(DP, const Vec_I_DP&, DP&, Vec_O_DP&)' for argument `9' to `void NR::mrqmin(const Vec_I_DP&, const Vec_I_DP&, const Vec_I_DP&, Vec_IO_DP&, const Vec_I_BOOL&, Mat_O_DP&, Mat_O_DP&, DP&, void (*)(DP, const Vec_I_DP&, DP&, Vec_O_DP&), DP&)' Any idea how I could do that? Thanks -- Philippe

2 2

Determinism of operator< on shared_ptr
by Renaud Lepere 16 Mar '05

16 Mar '05

I'm building a dynamic library and i'm recording/tracing all the function calls to be able to reproduce bugs. I would like to know if operator< on shared_ptr is determinist or not and if it is possible to have / change the behaviour of shared_ptr for adding it determinism. In other words, in the following code i would like to know if is_less will always have the same value or not ? shared_ptr<int> p1(new int(0)); shared_ptr<int> p2(new int(0)); bool is_less(p1 < p2); Thanks, renaud

2 1

Re: [Boost-users] Boost.Build -- how to get started?
by zhengyi 16 Mar '05

16 Mar '05

Arkadiy Vertleyb, This is a programmer from China. My poor English maybe bore you , but all the steps of building boost is here(as far as I know ). I can answer your problem , because i am a newer also. It took me several days to build the boost. I don't know your boost version and your platform situation. Now let me tell you how I do it: I 'm using boost 1.32.0 and stlport 4.6.2. In msvc71 enviroment. For the compatibility sake , i perfer the jam come with boost package. So the first step is to build the jam(using msvc compiler ). 1) run vcvars32.bat(you can find it in ms visual studio .) to set up the msvc environment variables. 2) goto BOOST_ROOT/tools/build/jam_src dir to run the file build.bat. 3) when compile ok , and you can get the result in BOOST_ROOT\tools\build\jam_src\bin.ntx86 4) please copy the Bjam.exe to the BOOST_ROOT\ dir. OK , the prepare was done! Let go on to build the boost lib. 1) if you close the cmd wnd in the last step , please open it and run vcvars32.bat again. 2) write a bat file and copy it to the BOOST_ROOT\ (the file content is as follow ) some comment may not display correctly because it was writen in Chinese^_^ /**************************************************************************************/ rem install_msvc71stlport.bat SET TargetDir=E:\Program_Files\Develop\Boost\boost_1_32_0 SET Toolset=vc-7_1-stlport SET STLPORTPAHT=E:\Program_Files\Develop\STLport-4.6.2 SET STLPORTVERSION=4.6.2 rem ================================ rem ?????????????? SET OLD_LIB=%LIB% SET LIB=%LIB%;%STLPORTPAHT%\lib rem ================================ Bjam "-sBUILD=debug release <runtime-link>static/dynamic <threading>single/multi <native-wchar_t>on" "-sSTLPORT_%STLPORTVERSION%_PATH=%STLPORTPAHT%" "-sSTLPORT_VERSION=%STLPORTVERSION%" "--prefix=%TargetDir%" "-sTOOLS=%Toolset%" install rem ================================ rem ?????????????? SET LIB=%OLD_LIB% rem ================================ /**************************************************************************************/ 3) run the bat file you've written . 4) waiting for the computer to build the whole lib. It will take a long time( about 20 minutes in my computer) 5) Don't think all was done!! the most difficult step is here: 6) I bet you that there are some error in the building. so try to fix them and goto step 3 until all error was killed. now , I will tell you the errors I meet in the building: 1) date_time will give you some error when using STLport. this is because when you build stlport the /Zc:wchar_t compiler option was not set . So ,set /Zc:wchar_t and rebuild the stlport, and rebuild the data_time lib . the error disappear. if you don't want to rebuild the stlport , add the "-sBUILD=<native-wchar_t>on" in Bjam cmd line. 2) program_options lib, \boost\program_options\detail\utf8_codecvt_facet.hpp line70, replace "using ::codecvt" to "using std::codecvt". I think it is a error of source file. 3) Serialization lib: \boost\archive\impl\xml_woarchive_impl.ipp line47 replace the line with the following typedef iterators::xml_escape<const wchar_t *> xmbtows . This is a problem boring me for a long time . A last , Robert Ramey told me to do that.but is is a temporary solution because this change has not been fully tested on other Platform. Here , it is all I know about how to build boost. I ' a newer to boost and my english is poor , so if you has any question ,please tell me . 　　 ======= 2005-03-16 10:15:00 您在来信中写道：======= >Hi all, > >I am trying to use Boost.Build to build my own project. However I found out >that the documentation, while doing a good job in explaining details, is >petty difficult to use if all one wants to know is how to use bjam to build >a "Hello world" project in a couple of toolsets. > >I already downloaded bjam.exe, and I have no problem in creating the >jamfile. However, AFAIU, I need more files to be installed, such as >jamrools, files that describe toolsets, etc. Can anybody to just list which >files are needed, where to get, and where to put them? Or point me to where >it's described if I missed something... > >Unless, of course, this is kind of Illuminati path, and one only deserves to >use this tool if able to figure out how? :-) > >Thanks a lot in advance. > >Regards, >Arkadiy > > > >_______________________________________________ >Boost-users mailing list >Boost-users(a)lists.boost.org >http://lists.boost.org/mailman/listinfo.cgi/boost-users > >. = = = = = = = = = = = = = = = = = = = = 致礼！ zhengyi goodmen(a)x263.net 2005-03-16

1 0

Re: [FileSystem] Internationalization woes on windows
by Mark Holloway 16 Mar '05

16 Mar '05

> I'd like to run a test here to be sure; could you please supply an example > of <internationalized chars> that is causing the problem? A filename containing a beta character "β" causes GetFileAttributesA to fail to find the file specified on my system. It's possible that if my codepage was different this would not be a problem. > I'm not at all surprised you are having problems; it isn't at all clear to > me that it is possible to do reliable processing on Windows using the A > (narrow) variants if Unicode characters are present. In fact I've discovered after experimentation with the alledged MBCS support on windows that it really is skin deep. I've not been able to get any char* function to take a UTF-8 string! Even those that claim to be affected by the current multi-byte codepage. Anyone who has managed this - please feel free to correct me! I've drilled down into the Rtl routines which seem to deal with multi-byte characters but there just doesn't seem to be away to affect the bits that matter. > I've got the internationalized revision of the Filesystem library running > on Windows; it seems to be handling wide characters with ease. I've done the same thing myself (I guess more or less the same thing). I initially attempted it without changing the API by converting the wide result to UTF-8, mostly to assist in keeping common code base with our other platforms (Mac,Sparc,Linux, etc - some of which are wide-character challenged) before realizing the full extent of the MBCS issues outlined above. After all - if I can't construct a std::fstream with a UTF-8 argument... > One fix for your problem is to switch to the internationalized version and > use wchar_t based paths. That will use the W Windows variants, and will > also work well on POSIX systems with internationalized file or directory > names. I'd be happy to try that version (and swap it for my own) - where can I find it? My own hacked version is switch-able, even for windows so that Win95 is supported without installing the Unicode layer (sigh). > Another possibility is that we can work on the narrow functions to make > them function better in the face of internationalized names. But I'd need a > lot of help on that to develop test cases and strategies to handle them. Without the underlying ANSI API variants not supporting UTF-8, I just can't see how this example could ever be portable in the presence of Unicode without wide chars: std::ofstream file( boost::filesystem::current_path().native_file_string().c_str() ); It will finally call down to the the ANSI function CreateFileA - which just won't be able to deal with it. Then there is the performance penalty of ANSI<->Unicode conversion under Windows NT. Thanks for your time (and your work!) Mark P.S. One other minor suggestion whilst I'm in the filesystem area (and I really don't want to (re)open a can of worms here) is to be able to choose the default path check at compile time.

1 0

boost::program options question. Implicit() doesn't seem to work
by Alexis H. Rivera-Rios 16 Mar '05

16 Mar '05

Hi, I was playing around with the boost::program_options class... According to the documentation the line: desc.add_options() ("debug", po::value<std::string>()->implicit(), "enable debugging" ); enables me to do something like this: myexec --debug However, if I do that I get an assertion error. The code requires a string so this will work: myexec --debug whatever What am I doing wrong? Is it me or is it the library? I'm using Visual C++ 2005 Express Beta, WinXP Pro Service Pack2. Thanks, Alexis Below my test program: namespace po = boost::program_options; int main (int argc, char **argv) { po::options_description desc("Allowed ptions"); desc.add_options() ("help", "produce help message") ("compression", po::value<int>(), "set compression level") ("debug", po::value<std::string>()->implicit() ,"enable debugging" ) ; po::variables_map vm; po::store(po::parse_command_line(argc, argv, desc),vm); po::notify(vm); if (argc==1 || vm.count("help")) { std::cout << desc << "\n"; return 1; } if (vm.count("compression")) std::cout << vm["compression"].as<int>() << std::endl; if (vm.count("debug")) std::cout << vm["debug"].as<std::string>() << std::endl; if (vm.count("log-file")) std::cout << vm["compression"].as<std::string>() << std::endl; } (By the way, the section Syntactic information of the documentation is not accurate when it says I could do this: desc.add_options() ("compression", "compression level",value<string>()) ("verbose", "verbosity level",value<string>()->implicit()) ("email", "email to send to",value<string>()->multitoken()); That doesn't compile. If I put the second string as the last argument it works.) Programming Tutorial: In Python: To do this, do this In Perl: To do this, do this or this or this or this... In C: To do this, do this, but be careful In C++: To do this, do this, but don't do this, be careful of this, watch out for this, and whatever you do, don't do this __________________________________ Celebrate Yahoo!'s 10th Birthday! Yahoo! Netrospective: 100 Moments of the Web http://birthday.yahoo.com/netrospective/

3 3

how to get regex to link in windows?
by Alexis H. Rivera-Rios 16 Mar '05

16 Mar '05

Another frustrating day trying to compile some code... I'm trying use the regex library. My application is compiled using Multi-threaded Debug DLL (/MDd). I specified the following library libboost_regex-vc71-mt.lib and all I get are link errors. My application is a console app so I defined BOOST_REGEX_NO_W32 I've tried setting BOOST_REGEX_DYN_LINK and BOOST_REGEX_NO_LIB but that doesn't cut it. The funny thing is that Im also using the filesystem library, and I link with the same type of library libboost_filesystem-vc71-mt.lib and I don't get any problems with the compiler. I'd appreciate if someone can point out what I'm doing wrong. Thanks, Alexis Try #1: Defining BOOST_REGEX_DYN_LINK BOOST_REGEX_NO_LIB BOOST_LIB_DIAGNOSTIC BOOST_REGEX_NO_W32 Specifying as the link libraries libboost_filesystem-vc71-mt.lib libboost_regex-vc71-mt.lib Linking to lib file: libboost_filesystem-vc71-mt-gd-1_32.lib Linking to lib file: boost_regex-vc71-mt-gd-1_32.lib Linking... test_csfwrapper.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) void * __cdecl boost::re_detail::get_mem_block(void)" (__imp_?get_mem_block@re_detail@boost@@YAPAXXZ) referenced in function "public: __thiscall boost::re_detail::save_state_init::save_state_init(struct boost::re_detail::saved_state * *,struct boost::re_detail::saved_state * *)" (??0save_state_init@re_detail@boost@@QAE@PAPAUsaved_state@12@0@Z) test_csfwrapper.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) void __cdecl boost::re_detail::put_mem_block(void *)" (__imp_?put_mem_block@re_detail@boost@@YAXPAX@Z) referenced in function "public: __thiscall boost::re_detail::save_state_init::~save_state_init(void)" (??1save_state_init@re_detail@boost@@QAE@XZ) Try #2: Defining BOOST_LIB_DIAGNOSTIC BOOST_REGEX_NO_W32 Linking to lib file: libboost_filesystem-vc71-mt-gd-1_32.lib Linking to lib file: libboost_regex-vc71-mt-gd-1_32.lib Linking... libboost_regex-vc71-mt-gd-1_32.lib(regex.obj) : error LNK2005: "public: virtual __thiscall boost::bad_pattern::~bad_pattern(void)" (??1bad_pattern@boost@@UAE@XZ) already defined in libboost_regex-vc71-mt.lib(regex.obj) libboost_regex-vc71-mt-gd-1_32.lib(regex.obj) : error LNK2005: "public: virtual __thiscall boost::bad_expression::~bad_expression(void)" (??1bad_expression@boost@@UAE@XZ) already defined in libboost_regex-vc71-mt.lib(regex.obj) libboost_regex-vc71-mt-gd-1_32.lib(regex.obj) : error LNK2005: "public: __thiscall boost::regbase::regbase(void)" (??0regbase@boost@@QAE@XZ) already defined in libboost_regex-vc71-mt.lib(regex.obj) libboost_regex-vc71-mt-gd-1_32.lib(regex.obj) : error LNK2005: "public: __thiscall boost::regbase::regbase(class boost::regbase const &)" (??0regbase@boost@@QAE@ABV01@@Z) already defined in libboost_regex-vc71-mt.lib(regex.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "protected: static char * boost::re_detail::c_traits_base::regex_message_catalogue" (?regex_message_catalogue@c_traits_base@re_detail@boost@@1PADA) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > * `anonymous namespace'::wlocale_name" (?wlocale_name@?A0xe5354fb3@@3PAV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@A) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "unsigned int `anonymous namespace'::nlsw_count" (?nlsw_count@?A0xe5354fb3@@3IA) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "unsigned int `anonymous namespace'::entry_count" (?entry_count@?A0xe5354fb3@@3IA) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "char * * `anonymous namespace'::re_custom_error_messages" (?re_custom_error_messages@?A0xe5354fb3@@3PAPADA) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "unsigned int `anonymous namespace'::message_count" (?message_count@?A0xe5354fb3@@3IA) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "unsigned int `anonymous namespace'::collate_count" (?collate_count@?A0xe5354fb3@@3IA) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "unsigned int `anonymous namespace'::classes_count" (?classes_count@?A0xe5354fb3@@3IA) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "char const * * `anonymous namespace'::re_char_class_names" (?re_char_class_names@?A0xe5354fb3@@3PAPBDA) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "unsigned long * `anonymous namespace'::re_char_class_id" (?re_char_class_id@?A0xe5354fb3@@3PAKA) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "char `anonymous namespace'::re_ten" (?re_ten@?A0xe5354fb3@@3DA) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > * `anonymous namespace'::re_coll_name" (?re_coll_name@?A0xe5354fb3@@3PAV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@A) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > * `anonymous namespace'::collate_name" (?collate_name@?A0xe5354fb3@@3PAV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@A) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > * `anonymous namespace'::mess_locale" (?mess_locale@?A0xe5354fb3@@3PAV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@A) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "wchar_t `anonymous namespace'::re_ten_w" (?re_ten_w@?A0xe5354fb3@@3_WA) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > * `anonymous namespace'::pclasses" (?pclasses@?A0xe5354fb3@@3PAV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@A) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "char `anonymous namespace'::re_zero" (?re_zero@?A0xe5354fb3@@3DA) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > * `anonymous namespace'::ctype_name" (?ctype_name@?A0xe5354fb3@@3PAV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@A) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > * `anonymous namespace'::re_cls_name" (?re_cls_name@?A0xe5354fb3@@3PAV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@A) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "class std::list<struct `anonymous namespace'::collate_name_t,class std::allocator<struct `anonymous namespace'::collate_name_t> > * `anonymous namespace'::pcoll_names" (?pcoll_names@?A0xe5354fb3@@3PAV?$list@Ucollate_name_t@?A0xe5354fb3@@V?$allocator@Ucollate_name_t@?A0xe5354fb3@@@std@@@std@@A) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "wchar_t `anonymous namespace'::re_zero_w" (?re_zero_w@?A0xe5354fb3@@3_WA) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "class std::list<struct `anonymous namespace'::syntax_map_t,class std::allocator<struct `anonymous namespace'::syntax_map_t> > * `anonymous namespace'::syntax" (?syntax@?A0xe5354fb3@@3PAV?$list@Usyntax_map_t@?A0xe5354fb3@@V?$allocator@Usyntax_map_t@?A0xe5354fb3@@@std@@@std@@A) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "private: static unsigned int boost::c_regex_traits<wchar_t>::sort_type" (?sort_type@?$c_regex_traits@_W@boost@@0IA) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "private: static unsigned int boost::c_regex_traits<char>::sort_type" (?sort_type@?$c_regex_traits@D@boost@@0IA) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "private: static wchar_t boost::c_regex_traits<wchar_t>::sort_delim" (?sort_delim@?$c_regex_traits@_W@boost@@0_WA) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "protected: static unsigned short * boost::re_detail::c_traits_base::class_map" (?class_map@c_traits_base@re_detail@boost@@1PAGA) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "protected: static char * boost::re_detail::c_traits_base::lower_case_map" (?lower_case_map@c_traits_base@re_detail@boost@@1PADA) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "protected: static unsigned char * boost::re_detail::c_traits_base::syntax_map" (?syntax_map@c_traits_base@re_detail@boost@@1PAEA) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "private: static char boost::c_regex_traits<char>::sort_delim" (?sort_delim@?$c_regex_traits@D@boost@@0DA) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "char const * __cdecl `anonymous namespace'::re_get_locale(int)" (?re_get_locale@?A0xe5354fb3@@YAPBDH@Z) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "private: static class boost::c_regex_traits<char> boost::c_regex_traits<char>::i" (?i@?$c_regex_traits@D@boost@@0V12@A) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits.obj) : error LNK2005: "private: static class boost::c_regex_traits<wchar_t> boost::c_regex_traits<wchar_t>::init_" (?init_@?$c_regex_traits@_W@boost@@0V12@A) already defined in libboost_regex-vc71-mt.lib(c_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(w32_regex_traits.obj) : error LNK2005: "private: static unsigned short * boost::w32_regex_traits<wchar_t>::wide_unicode_classes" (?wide_unicode_classes@?$w32_regex_traits@_W@boost@@0PAGA) already defined in libboost_regex-vc71-mt.lib(w32_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(w32_regex_traits.obj) : error LNK2005: "protected: static char * boost::re_detail::w32_traits_base::regex_message_catalogue" (?regex_message_catalogue@w32_traits_base@re_detail@boost@@1PADA) already defined in libboost_regex-vc71-mt.lib(w32_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(w32_regex_traits.obj) : error LNK2005: "bool `anonymous namespace'::isPlatformNT" (?isPlatformNT@?A0x07ed92d4@@3_NA) already defined in libboost_regex-vc71-mt.lib(w32_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(w32_regex_traits.obj) : error LNK2005: "bool `anonymous namespace'::is_init" (?is_init@?A0x07ed92d4@@3_NA) already defined in libboost_regex-vc71-mt.lib(w32_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(w32_regex_traits.obj) : error LNK2005: "unsigned int `anonymous namespace'::entry_count" (?entry_count@?A0x07ed92d4@@3IA) already defined in libboost_regex-vc71-mt.lib(w32_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(w32_regex_traits.obj) : error LNK2005: "char * * `anonymous namespace'::re_custom_error_messages" (?re_custom_error_messages@?A0x07ed92d4@@3PAPADA) already defined in libboost_regex-vc71-mt.lib(w32_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(w32_regex_traits.obj) : error LNK2005: "struct HINSTANCE__ * `anonymous namespace'::hresmod" (?hresmod@?A0x07ed92d4@@3PAUHINSTANCE__@@A) already defined in libboost_regex-vc71-mt.lib(w32_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(w32_regex_traits.obj) : error LNK2005: "class std::list<struct `anonymous namespace'::collate_name_t,class std::allocator<struct `anonymous namespace'::collate_name_t> > * `anonymous namespace'::pcoll_names" (?pcoll_names@?A0x07ed92d4@@3PAV?$list@Ucollate_name_t@?A0x07ed92d4@@V?$allocator@Ucollate_name_t@?A0x07ed92d4@@@std@@@std@@A) already defined in libboost_regex-vc71-mt.lib(w32_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(w32_regex_traits.obj) : error LNK2005: "class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > * `anonymous namespace'::pclasses" (?pclasses@?A0x07ed92d4@@3PAV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@A) already defined in libboost_regex-vc71-mt.lib(w32_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(w32_regex_traits.obj) : error LNK2005: "char const * * `anonymous namespace'::re_char_class_names" (?re_char_class_names@?A0x07ed92d4@@3PAPBDA) already defined in libboost_regex-vc71-mt.lib(w32_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(w32_regex_traits.obj) : error LNK2005: "unsigned long * `anonymous namespace'::re_char_class_id" (?re_char_class_id@?A0x07ed92d4@@3PAKA) already defined in libboost_regex-vc71-mt.lib(w32_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(w32_regex_traits.obj) : error LNK2005: "char `anonymous namespace'::re_ten" (?re_ten@?A0x07ed92d4@@3DA) already defined in libboost_regex-vc71-mt.lib(w32_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(w32_regex_traits.obj) : error LNK2005: "wchar_t `anonymous namespace'::re_ten_w" (?re_ten_w@?A0x07ed92d4@@3_WA) already defined in libboost_regex-vc71-mt.lib(w32_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(w32_regex_traits.obj) : error LNK2005: "char `anonymous namespace'::re_zero" (?re_zero@?A0x07ed92d4@@3DA) already defined in libboost_regex-vc71-mt.lib(w32_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(w32_regex_traits.obj) : error LNK2005: "wchar_t `anonymous namespace'::re_zero_w" (?re_zero_w@?A0x07ed92d4@@3_WA) already defined in libboost_regex-vc71-mt.lib(w32_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(w32_regex_traits.obj) : error LNK2005: "class std::list<struct `anonymous namespace'::syntax_map_t,class std::allocator<struct `anonymous namespace'::syntax_map_t> > * `anonymous namespace'::syntax" (?syntax@?A0x07ed92d4@@3PAV?$list@Usyntax_map_t@?A0x07ed92d4@@V?$allocator@Usyntax_map_t@?A0x07ed92d4@@@std@@@std@@A) already defined in libboost_regex-vc71-mt.lib(w32_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(w32_regex_traits.obj) : error LNK2005: "protected: static unsigned short * boost::re_detail::w32_traits_base::class_map" (?class_map@w32_traits_base@re_detail@boost@@1PAGA) already defined in libboost_regex-vc71-mt.lib(w32_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(w32_regex_traits.obj) : error LNK2005: "protected: static unsigned char * boost::re_detail::w32_traits_base::syntax_map" (?syntax_map@w32_traits_base@re_detail@boost@@1PAEA) already defined in libboost_regex-vc71-mt.lib(w32_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(w32_regex_traits.obj) : error LNK2005: "protected: static char * boost::re_detail::w32_traits_base::lower_case_map" (?lower_case_map@w32_traits_base@re_detail@boost@@1PADA) already defined in libboost_regex-vc71-mt.lib(w32_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(w32_regex_traits.obj) : error LNK2005: "public: __thiscall boost::w32_regex_traits<char>::w32_regex_traits<char>(void)" (??0?$w32_regex_traits@D@boost@@QAE@XZ) already defined in libboost_regex-vc71-mt.lib(w32_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(w32_regex_traits.obj) : error LNK2005: "public: __thiscall boost::w32_regex_traits<char>::~w32_regex_traits<char>(void)" (??1?$w32_regex_traits@D@boost@@QAE@XZ) already defined in libboost_regex-vc71-mt.lib(w32_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(w32_regex_traits.obj) : error LNK2005: "public: __thiscall boost::w32_regex_traits<wchar_t>::w32_regex_traits<wchar_t>(void)" (??0?$w32_regex_traits@_W@boost@@QAE@XZ) already defined in libboost_regex-vc71-mt.lib(w32_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(w32_regex_traits.obj) : error LNK2005: "public: __thiscall boost::w32_regex_traits<wchar_t>::~w32_regex_traits<wchar_t>(void)" (??1?$w32_regex_traits@_W@boost@@QAE@XZ) already defined in libboost_regex-vc71-mt.lib(w32_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(w32_regex_traits.obj) : error LNK2005: "private: static class boost::w32_regex_traits<char> boost::w32_regex_traits<char>::i" (?i@?$w32_regex_traits@D@boost@@0V12@A) already defined in libboost_regex-vc71-mt.lib(w32_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(w32_regex_traits.obj) : error LNK2005: "private: static class boost::w32_regex_traits<wchar_t> boost::w32_regex_traits<wchar_t>::init_" (?init_@?$w32_regex_traits@_W@boost@@0V12@A) already defined in libboost_regex-vc71-mt.lib(w32_regex_traits.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits_common.obj) : error LNK2005: "wchar_t * boost::re_detail::wide_lower_case_map" (?wide_lower_case_map@re_detail@boost@@3PA_WA) already defined in libboost_regex-vc71-mt.lib(c_regex_traits_common.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits_common.obj) : error LNK2005: "unsigned short * boost::re_detail::wide_unicode_classes" (?wide_unicode_classes@re_detail@boost@@3PAGA) already defined in libboost_regex-vc71-mt.lib(c_regex_traits_common.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits_common.obj) : error LNK2005: "char const * * boost::re_detail::re_default_error_messages" (?re_default_error_messages@re_detail@boost@@3PAPBDA) already defined in libboost_regex-vc71-mt.lib(c_regex_traits_common.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits_common.obj) : error LNK2005: "char const * * boost::re_detail::def_multi_coll" (?def_multi_coll@re_detail@boost@@3PAPBDA) already defined in libboost_regex-vc71-mt.lib(c_regex_traits_common.obj) libboost_regex-vc71-mt-gd-1_32.lib(c_regex_traits_common.obj) : error LNK2005: "char const * * boost::re_detail::def_coll_names" (?def_coll_names@re_detail@boost@@3PAPBDA) already defined in libboost_regex-vc71-mt.lib(c_regex_traits_common.obj) libboost_regex-vc71-mt-gd-1_32.lib(regex_synch.obj) : error LNK2005: "unsigned int boost::re_detail::re_lock_count" (?re_lock_count@re_detail@boost@@3IA) already defined in libboost_regex-vc71-mt.lib(regex_synch.obj) libboost_regex-vc71-mt-gd-1_32.lib(regex_synch.obj) : error LNK2005: "class boost::re_detail::critical_section * boost::re_detail::p_re_lock" (?p_re_lock@re_detail@boost@@3PAVcritical_section@12@A) already defined in libboost_regex-vc71-mt.lib(regex_synch.obj) test_csfwrapper.obj : error LNK2019: unresolved external symbol "void * __cdecl boost::re_detail::get_mem_block(void)" (?get_mem_block@re_detail@boost@@YAPAXXZ) referenced in function "public: __thiscall boost::re_detail::save_state_init::save_state_init(struct boost::re_detail::saved_state * *,struct boost::re_detail::saved_state * *)" (??0save_state_init@re_detail@boost@@QAE@PAPAUsaved_state@12@0@Z) test_csfwrapper.obj : error LNK2019: unresolved external symbol "void __cdecl boost::re_detail::put_mem_block(void *)" (?put_mem_block@re_detail@boost@@YAXPAX@Z) referenced in function "public: __thiscall boost::re_detail::save_state_init::~save_state_init(void)" (??1save_state_init@re_detail@boost@@QAE@XZ) Debug/csfwrapper.exe : fatal error LNK1120: 2 unresolved externals Programming Tutorial: In Python: To do this, do this In Perl: To do this, do this or this or this or this... In C: To do this, do this, but be careful In C++: To do this, do this, but don't do this, be careful of this, watch out for this, and whatever you do, don't do this __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

Thread ...memory leaks on windwos msvc71
by zhengyi 16 Mar '05

16 Mar '05

Now,I found some memory leaks of boost::thread library. I trace down the code and find that when thread lib's dll is loading , a mutex was created in the boost_thread-vc71-mt-gdp-1_32.dll::dllmain() function's "case DLL_PROCESS_ATTACH:" branch .In on_process_enter(), I found that boost::mutex* threadmon_mutex was created. When the program is exiting , in "case DLL_PROCESS_DETACH:" branch of Dllmain() , the code does not kill the threadmon_mutex , so , some memory was leaked. In MFC project , the memory leak can be detected by the vs71. but in win32 console project , vs71 does not report the problem ,althrogh the memory leak exits ( at least I think there is memory leak , because i found that the mutex constructor was call one more time than it's destructor). Any one Can tell me the solution? Is it a bug of thread or a bug of my brain or a bug of msvc71 ? 　　　　　　　　　　　　　　gooodmen(a)x263.net 　　　　　　　　　　　　　　　　　2005-03-16

1 0

Re: [Boost-users] [FileSystem] Internationalization woes on windows
by Beman Dawes 16 Mar '05

16 Mar '05

At 04:52 AM 3/14/2005, Mark Holloway wrote: >I know this has been discussed a fair bit but I'd just like to get >confirmation of what I believe to be the case re: boost::filesystem and >internationalization on windows. > >I've been using boost::filesystem::directory_iterator to (amongst other >things) recurse across a directory hierarchy, and on each item asking >boost::filesystem::is_directory. > >When a file or directory is encountered containing characters not >representable using the ANSI char set (alright the MS ANSI charset) an >exception is thrown. For example: > >"boost::filesystem::is_directory: "Scratch561\ABCDE<internationized >chars>MNOP": The filename, directory name, or volume label syntax is >incorrect." > >This is presumably because the windows ANSI API calls are being used >(the <API function>A variants). > >Am I missing something, or is this a pretty severe limitation for >windows? >(I appreciate unix's don't suffer in this based on their api typically >using UTF-8 encoding). > >Thanks in advance for setting me straight/confirming my fears. I'd like to run a test here to be sure; could you please supply an example of <internationalized chars> that is causing the problem? I'm not at all surprised you are having problems; it isn't at all clear to me that it is possible to do reliable processing on Windows using the A (narrow) variants if Unicode characters are present. I've got the internationalized revision of the Filesystem library running on Windows; it seems to be handling wide characters with ease. I'm testing now on POSIX - I couldn't resist the $499 price tag and bought a Mac Mini. Slick. One fix for your problem is to switch to the internationalized version and use wchar_t based paths. That will use the W Windows variants, and will also work well on POSIX systems with internationalized file or directory names. Another possibility is that we can work on the narrow functions to make them function better in the face of internationalized names. But I'd need a lot of help on that to develop test cases and strategies to handle them. Thanks for the report, --Beman

1 0

is_integral_c
by Lemings, Eric B. (Contr) 16 Mar '05

16 Mar '05

MPL currently contains type trait metafunctions for is_sequence and is_placeholder. Shouldn't it also contain is_integral_c for checking integral constant wrappers? Eric.

2 1

Bind regression from 1.30 to 1.32
by Thomas Matelich 15 Mar '05

15 Mar '05

This may be a reasonable regression, but I thought I'd bring it up in case its a regression that should be fixed. My sample code and some error outputs are attached. Oh, and in case you're wondering why I would do this, its basically because I really like the find_if/bind/equal_to thing, and I need the char[64] for easy fwrite/fread'ing. Thanks

2 2

boost regexp
by Groleo Marius 15 Mar '05

15 Mar '05

Hi! I have a question about regexp: How can i write a regex , to match this string: +OK user -- Regards, Groleo! .''`. # touch universe : :' : # chmod +rwx universe `. `'` # ./universe `- Debian - when you have better things to do than fix a system

2 2

wregex undefined workaround
by pps 15 Mar '05

15 Mar '05

Hello, I use freebsd 4.11 & gcc3.3.6 and gcc 3.4.4 with both I don't have std::wstring defined. I only need it fo some internal use. So, I defined: typedef unsigned short uchar16 typedef basic_string<uchar16> string16; and it was enough for me (I don't do iostreams with this string) But, I need regex support for this. As I read in a few mail boost does not create wregex on some platforms with limited support for wchar_t, so I tried to create one the same as I did with string: typedef reg_expression<uchar16, regex_traits<uchar16>, BOOST_DEFAULT_ALLOCATOR(uchar16)> regex16; When I try to use regex16 I get a big load of errors. Did I missed something? Thanks

2 11

Mutex synchronized LockingPtr in Boost?
by Christopher D. Russell 15 Mar '05

15 Mar '05

Is there a class in Boost that implements functionality similar to Andrei Alexandrescu's mutex-synchronized LockingPtr as described in his Feb. 2001 CUJ article http://www.cuj.com/documents/s=7998/cujcexp1902alexandr/? I checkout boost::smart_ptr but don't see that any of these deal with interprocess / interthread synchronization. - Regards Chris -- --- Chris Russell, Encapsule Systems, Inc., Yarmouth, Maine USA 04096 http://encapsule.com // http://hyperworx.org // http://chrisrussell.net cdr(a)encapsule.com // voice (207) 846-7773 // mobile (207) 671-5963 Skype user "encapsule"

1 0

[boost graph] adjusting vertex_descriptors when performing a remove_vertex
by Yariv Tal 15 Mar '05

15 Mar '05

In our project we need the ability to associate an object with a vertex, so naturally I add the object ptr as a vertex property. However, we also need to access the vertex according to the object (for example, for performing a shortest-path algorithm from the vertex representing the specific object). So, I also have a map mapping a vertex_descriptor for each object: typedef std::map<ObjectPtr, GraphTraits::vertex_descriptor> ObjVertexMap; Now, the problem is that when an object/vertex is removed from the graph, depending on the container holding vertices (vecS vs. listS), a renumbering of the vertex_descriptors may occur (or may not...) For example: (The typedefs are pretty large and not neccessarily needed to understand the code - so may want to skip them) // *** TYPEDEFS START HERE typedef std::map<ObjectPtr, GraphTraits::vertex_descriptor> ObjVertexMap; typedef Object * ObjectPtr; // Define new prperty struct vertex_obj_t { typedef boost::vertex_property_tag kind; }; // Define graph type typedef boost::adjacency_list< boost::vecS, boost::vecS, // If this is boost::listS then no renumbering on vertex delete??? boost::directedS, boost::property<vertex_tmfobj_t, ObjectPtr>, > GraphType; // *** TYPEDEFS END HERE class GraphMgr { protected: GraphType m_graph; ObjVertexMap m_objects; public: bool addEntity(ObjectPtr a_obj) { if (m_objects.find(a_obj) != m_objects.end()) { return false; } GraphTraits::vertex_descriptor newVertex = boost::add_vertex(Graph::vertex_property_type(a_obj), m_graph); m_objects.insert(ObjVertexMap::value_type(a_obj, newVertex)); return true; } bool removeEntity(const ObjectPtr a_obj) { ObjVertexMap::iterator itr = m_objects.find(a_obj); if (itr == m_objects.end()) { return false; } boost::clear_vertex((*itr).second, m_graph); boost::remove_vertex((*itr).second, m_graph); // will this do a renumbering of the vertices? m_objects.erase(itr); // !!! If renumbering of the vertices was made I must update the ObjVertexMap! return true; } }; The problem is that if I use one type of container for vertices, the vecS, then renumbering on remove_vertex occurs and I need to update all indices in m_objects - this means I need to KNOW that vertex_descriptor is an index and how remove_vertex is implemented... Even worse: as far as I undertand if I use listS then vertex_desfcriptor is no longer an index an no renumbering occurs in remove_vertex! So, unless I want to commit to using vecS and to a specific implementation I need to somehow KNOW whether or not to perform renumbering. I coulld do this via a traits template with sepcialization for each vertices container type, but it seems to me that the library should have (and probably has) a better way of abstracting this, no? Perhaps the problem is that I'm storing vertex_descriptors in the ObjVertexMap, which may be defined as transient entities that (like iterators after an erase) might be invalidated after a remove_vertex - but then, how can I hold some persistent and efficient identifier into the graph that remains valid after remove_vertex? If anyone has any ideas, plz help. Yariv.

2 3

[program_options] setting defaults
by Liam Routt 15 Mar '05

15 Mar '05

Part one: I spent yesterday trying to use a char * to set the default for a string option: opts.add_option("config", "Set the config file to examine", po::value<string>()->default_value("newconfig")); The result was a segmentation fault or illegal instruction during the destruction of my opts class (a wrapper that has several options_descriptions and a positional_options_description; there are methods like the add_option() above that allow various options to be set, in general they put the value_semantic argument last, but otherwise pass arguments directly through). So today I realized that passing a char * to something expecting a std:string might be asking for trouble. So I tried this: string DefaultConfig("newconfig"); opts.add_option("config", "Set the config file to examine", po::value<string>()->default_value(DefaultConfig)); That didn't work any better. Moving the string to global scope didn't help, nor did making it static. So, how do I set the default for a string option? Part two: I want to set up a boolean option (its existence returns true, and if it is not there it returns false). This is done using bool_switch(), I see. However I end up with a segmentation fault if I use this following line: opts.add_option("bool", "testing boolean", po::bool_switch()); The fault occurs, again, when opts' destructor is running. If I leave out the bool_switch() (ie. don't set a value semantic) I get no such error, although the behaviour is not as I'd like it. So, how do I use bool_switch()? What am I missing here? It is possible I'm having trouble with all occurences of po::value<>, as I haven't used it elsewhere yet (I'm adding stuff gradually)... Take care, Liam -- Liam Routt Ph: (03) 8344-1315 Research Programmer caligari(a)cs.mu.oz.au Computer Science, Melbourne University (or liam(a)routt.net)

2 2

RE: [Boost-users] graph peculiarities
by Arias Brent-P96059 15 Mar '05

15 Mar '05

----------------------- The "install property" approach has some advantages when creating property maps for internal properties. For instance, you can determine if there is an "edge_weight" property and use it, without poking into the user-supplied type for the edges. ------------------------ Ok, I can see that. ---------------------------- I don't know the rationale for the original design, but I will also note that bundled properties don't (and can't) work on Visual C++ 6.0, a compiler that had to be supported when the BGL was released. ---------------------------- Do bundled properties now work with the C++ compiler of Visual Studio.NET (i.e. version 7)? > What were you expecting instead of vertex descriptors? Keep in mind I'm a newbie to the Graph lib, but my answer is that I'd just dispense with the descriptors, and absorb the functionality straight into the iterators. So, for example, a call to source(e, g) ...would have 'e' refer to an edge iterator rather than an edge descripter. I could guess why that approach wasn't taken, but if you happen to know - please do tell. :) ------------------------------- I'm not sure the std::map<string, int> analogy holds up well, because accessing the int for a given string requires logarithmic time, which would not be acceptable for a graph. Using vertex descriptors allows the library to reference vertices without regard to their storage (or storage of their properties). ------------------------------- Ok, my bad analogy aside, isn't it also true that iterators similarly allow reference to vertices / edges without regard to their storage? Keep in mind that, as far as I can tell, you can't retrive a vertex_descripter until you've retrieved a vertex_iterator. So it appears you are dependent on iterators either way. But I suppose I don't fully appreciate the restrictions the designers faced. For example, consider the description of functor "exercise_vertex()" found here: http://boost.org/libs/graph/doc/quick_tour.html ...that makes me wonder if the descripter was simply a syntactic necessity (that an iterator could not fulfill). Thoughts? -Brent

2 1

Using boost in VS .NET 2003
by Gang Wu 15 Mar '05

15 Mar '05

Hi, I am trying to use boost in VS .NET 2003. Could someone give me a simple example showing how to make it compiled. I have run the install: bjam "-sTOOLS=gcc" install I saw it created a folder "c:\boost". But when I , for example, #include <boost/any.hpp> in VC++ .NET project. It always complained that "no such file or directory" no matter how I adjusted include path in settings (Tools->Options->Projects->VC++ Directories). Thank you for any help.

3 3

[FileSystem] Internationalization woes on windows
by Mark Holloway 15 Mar '05

15 Mar '05

I know this has been discussed a fair bit but I'd just like to get confirmation of what I believe to be the case re: boost::filesystem and internationalization on windows. I've been using boost::filesystem::directory_iterator to (amongst other things) recurse across a directory hierarchy, and on each item asking boost::filesystem::is_directory. When a file or directory is encountered containing characters not representable using the ANSI char set (alright the MS ANSI charset) an exception is thrown. For example: "boost::filesystem::is_directory: "Scratch561\ABCDE<internationized chars>MNOP": The filename, directory name, or volume label syntax is incorrect." This is presumably because the windows ANSI API calls are being used (the <API function>A variants). Am I missing something, or is this a pretty severe limitation for windows? (I appreciate unix's don't suffer in this based on their api typically using UTF-8 encoding). Thanks in advance for setting me straight/confirming my fears. Mark

2 1

Creating custom depth first search visitor for Boost graph
by Stephen Torri 15 Mar '05

15 Mar '05

I have a need to have a graph visitor algorithm similar to depth first search. The only difference is that if upon running discover_vertex the intended operation to be done on the vertex is not done I want the graph color value for this position to still be white. The reason is that the graph I am using the depth first search is a directed graph with no loops in it. A vertex might have two or more vertices providing information. If all the information is not there I want the visitor to try again. What do I have to do to gain access to the color map inside the visitor when I am in discover_vertex? Stephen

3 6

graph peculiarities
by Arias Brent-P96059 14 Mar '05

14 Mar '05

I've been looking over the graph library, and have found it curiously designed. I was hoping someone could provide a brief comment on the rationale of the design (something I didn't spot in the documentation). For example, consider the adjacency_list: adjacency_list<OutEdgeList, VertexList, Directed, VertexProperties, EdgeProperties, GraphProperties, EdgeList> I would have thought that the "VertexList" would be templated to permit me to add whatever kind of node I'd like, something like this: adjacency_list<listS, vecS<myType>, bidirectionalS> But instead, there is a rather elaborate process of creating a user defined "property" and installing that property. What was the rationale for that "install property" approach, rather than just a templated parameter approach (as I suggested above)? Even with the improvement with the new "bundled properties" approach of 1.32.0, I find myself still asking the same or similar questions. For example, after an adjacency list is created, why do I need to access the properties of the nodes (bundled or not), with vertex_descriptors? I mean, for example, the "std::map<string, int>" type doesn't require that I make a seperate "vertex_descriptor" or "definition_descriptor" to access an entry in the map. Certainly there was some rationale behind this "vertex descriptor" approach - does anyone know what it was? Thanks, -Brent

2 1

C++ Template Metaprogramming - Exercise 3-6
by Bruno Martínez Aguerre 14 Mar '05

14 Mar '05

Hi, I'm stuck at exercise 3-6 of the book. I have to write twice (see below) as a lambda expression. I don't understand why the same transformation that works for quasi fails for twice. Any help, please? #include <boost/type_traits/add_pointer.hpp> #include <boost/type_traits/is_same.hpp> #include <boost/mpl/assert.hpp> #include <boost/mpl/plus.hpp> #include <boost/mpl/int.hpp> #include <boost/mpl/placeholders.hpp> #include <boost/mpl/apply.hpp> #include <boost/mpl/lambda.hpp> #include <boost/mpl/equal_to.hpp> using namespace boost; using namespace boost::mpl; using namespace boost::mpl::placeholders; template <class F, class A> struct twice : apply<F, typename apply<F, A>::type > {}; BOOST_MPL_ASSERT(( is_same<twice<add_pointer<_1>,int>::type, int**> )); template <class F, class A> struct quasi : plus<F, typename plus<F, A>::type > {}; BOOST_MPL_ASSERT(( equal_to<quasi<int_<2>,int_<3> >, int_<7> > )); template <class F, class A> struct quasi2 : apply<plus<_1, plus<_1,_2> >, F, A >::type {}; BOOST_MPL_ASSERT(( equal_to<quasi2<int_<2>,int_<3> >, int_<7> > )); template <class F, class A> struct twice2 : apply<apply<_1, apply<_1,_2> >, F, A >::type {}; BOOST_MPL_ASSERT(( is_same<twice2<add_pointer<_1>,int>::type, int**> )); - Bruno

7 12