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

boost filesystem path question
by Surya Kiran Gullapalli 05 Dec '04

05 Dec '04

Hi, I've this code, which is supposed to work on both windows and linux OS. I'll get a particular directory/file path from a fileselection dialog, where by i process this path. The question for me, is I'm using the boost::filesystem::path constructor like this. boost::filesystem::path p (path_from_fs_dialog, boost::filesystem::native) ; Its working fine on linux (as the string path_from_fs_dialog contains "/" as directory separator). when comes to windows path_from_fs_dialog contains "\" as the directory separator, and the path constructor is throwing exception. What could have been the reason? I've to change the namecheck function from "native" to "no_check" Any ideas what might have gone wrong? Thanks in advance, Surya

2 1

Pool allocating
by Jean-Eric Cuendet 05 Dec '04

05 Dec '04

Hi, I need the following for our Linux C++ soft: - Create a HeapSpace of FixedSize (say 1Mb) - Allocate FixedSize piece of memory (always alloc 16 bytes from this heap for ex.) - Return NULL if no more space in the HeapSpace - Delete them. - Release the memory when all pieces are deleted Is there a way to do exactly that with Boost? Thanks. -jec

2 1

Re: Newbie using regex libraries (John Maddock)
by Mark Helzer 05 Dec '04

05 Dec '04

----------------------------- Message: 3 Date: Fri, 3 Dec 2004 10:57:05 -0000 From: "John Maddock" <john(a)johnmaddock.co.uk> Subject: Re: [Boost-users] Newbie using regex libraries To: <boost-users(a)lists.boost.org> Message-ID: <01c301c4d927$1a2b6520$03800252@fuji> Content-Type: text/plain; format=flowed; charset="iso-8859-1"; reply-type=original > In developing a very simple test, I ran into an issue with the library. > I linked with libboost_regex-gcc.so and ran into a relocation run time > error -- undefined symbol: __dso_handle. > > I found the symbol in libboost_regex-gcc-mt-d-1_31.so.1.31.0. I linked > with that and my test works. > > So, it seems odd that I would not use one of the more generic library > names (ending in .so). Is this perhaps a configuration issue on my > part? Those two libs should be the same thing, in fact I think one should be a link to the other shouldn't it? No, they are not. Although that is what I would have expected... -rwxr-xr-x 1 eoapi clients 4976367 Apr 22 2004 libboost_regex-gcc-mt-d-1_31.so.1.31.0 -rwxr-xr-x 1 root root 629005 Jun 29 06:16 libboost_regex-gcc.so I shall clean it up and try rebuilding John.

2 1

Problems serializing via pointers
by Jeffrey Holle 04 Dec '04

04 Dec '04

At this point, the last compilation problem in applying the boost.serialization library to my application has to do with pointers. Specifically, its pointers to std::string and char member attributes. I have other pointer member attributes that compile successfully, but this point to objects that have serialize methods. I have attempted use of register_type and am including "serialization/string.hpp" in the modules that have pointer to string attributes. These actions were not affective. As an example of the type of compilation error, when I uncomment the following attribute's archive attempt: char *m_pByPointerPrefix; I get: /home/jholle/boost_1_32_0/boost/serialization/access.hpp: In static member function `static void boost::serialization::access::serialize(Archive&, T&, unsigned int) [with Archive = boost::archive::binary_iarchive, T = char]': /home/jholle/boost_1_32_0/boost/serialization/serialization.hpp:78: instantiated from `void boost::serialization::serialize(Archive&, T&, unsigned int) [with Archive = boost::archive::binary_iarchive, T = char]' /home/jholle/boost_1_32_0/boost/serialization/serialization.hpp:121: instantiated from `void boost::serialization::serialize_adl(Archive&, T&, unsigned int) [with Archive = boost::archive::binary_iarchive, T = char]' /home/jholle/boost_1_32_0/boost/archive/detail/iserializer.hpp:155: instantiated from `void boost::archive::detail::iserializer<Archive, T>::load_object_data(boost::archive::detail::basic_iarchive&, void*, unsigned int) const [with Archive = boost::archive::binary_iarchive, T = char]' VariableName.cpp:102: instantiated from here /home/jholle/boost_1_32_0/boost/serialization/access.hpp:106: error: request for member `serialize' in `t', which is of non-class type `char' What is the solution to this?

3 8

Pool allocating
by jec＠rptec.ch 04 Dec '04

04 Dec '04

Hi, I need the following for our Linux C++ soft: - Create a HeapSpace of FixedSize (say 1Mb) - Allocate FixedSize piece of memory (always alloc 16 bytes from this heap for ex.) - Return NULL if no more space in the HeapSpace - Delete them. - Release the memory when all pieces are deleted Is there a way to do exactly that with Boost? Thanks. -jec

1 0

Boost replace - a trailing 0
by Leon Mergen 03 Dec '04

03 Dec '04

Hello, I'm trying to use boost regex'es replace and add a trailing 0 after the \1 part. However, it seems to want to replace this with \10, which is not what I want. Anyone has any idea how to do this in a proper way ? Thanks in advance! Regards, Leon Mergen

2 2

Newbie using regex libraries
by Mark Helzer 03 Dec '04

03 Dec '04

Hi, In developing a very simple test, I ran into an issue with the library. I linked with libboost_regex-gcc.so and ran into a relocation run time error -- undefined symbol: __dso_handle. I found the symbol in libboost_regex-gcc-mt-d-1_31.so.1.31.0. I linked with that and my test works. So, it seems odd that I would not use one of the more generic library names (ending in .so). Is this perhaps a configuration issue on my part? Mark Helzer ADP Dealer Services 2525 S.W 1st Portland, OR. (503) 402-3481

2 1

iterator_adaptor: disguise iterator as const_iterator?
by Martin Wartens 03 Dec '04

03 Dec '04

Hi all, I am trying to disguise a std container non-const iterator as a const_iterator. My guess is that iterator_adaptor could be useful for this, but I can't figure it out myself. I am trying to solve an old problem with the standard library, which is that you can't convert a const_iterator into an iterator. [There are two "solutions" to that problem, one uses distance and is expensive, the other one does a brutal conversion on bitlevel which breaks for several std implementations.] My use case: I have written a wrapper class mymap for std::map. I only want to give map::const_iterators to the users of this class. If the user wants to erase an element from the map, he must pass a const_iterator back to the wrapper class and call "mymap::erase(const_iterator)". The problem is that mymap has no way to convert the const_iterator into an iterator to call "map::erase(iterator)" in turn [there is no "map::erase(const_iterator)"]. So my idea was to write a iterator_adaptor for iterator that lets it behave like a const_iterator. Unfortunately I didn't get very far. I have to say that the documentation was not of much help to me. There are lots of complicated implementation details but only small examples. So any help is appreciated. How can I solve my problem? Side note: In the following code sample, iterator_adaptor accidentally turns a const_iterator into a non-const iterator. (Seemingly, some bit-level casting is done somewhere). Is this a bug? #include <boost/iterator/iterator_adaptor.hpp> #include <map> template <class Value> class node_iter :public boost::iterator_adaptor<node_iter<Value>, Value> { public: node_iter() : node_iter::iterator_adaptor_(0) {} node_iter(Value p) : node_iter::iterator_adaptor_(p) {} }; int main() { typedef std::map<int, int> mymap_type; mymap_type testmap; node_iter<mymap_type::const_iterator> ni(testmap.begin()); ni->second = 42; //this works, not a const_iterator anymore } ___________________________________________________________________________ Die einen haben es, die anderen werden es! http://my-mail.ch/?redirect=9905 So macht schenken richtig Freude! Schenken und Helfen mit World Vision! http://www.my-mail.ch/?redirect=1958

5 13

Re: newbie boost sample compile program
by Brian Gaber 02 Dec '04

02 Dec '04

Martin Lemieux <lemieux<at>cae.com> writes: 1) You describe to much path information in the #include directive in simple_ls.cpp . Like the Boost's .hpp, just start with "boost/(...).hpp". I fixed the path information in the #include directive to be "boost/filesystem/... 2) Then make sure your compiler command line at least mention "-I /user/local/include" or "-I $(INC)" where INC ~includes~ "/user/local/include". I get further, here is the new AIX compiler error: xlc++ -o simple_ls simple_ls.cpp -I /usr/local/include ld: 0711-317 ERROR: Undefined symbol: .boost::filesystem::initial_path() ld: 0711-317 ERROR: Undefined symbol: boost::filesystem::native(const std::basic_string<char,std::char_traits<char>,std::allocator<char> >&) ld: 0711-317 ERROR: Undefined symbol: .boost::filesystem::path::path(const char*,bool(*)(const std::basic_string<char,std::char_traits<char>,std::allocator<char> >&)) ld: 0711-317 ERROR: Undefined symbol: .boost::filesystem::system_complete(const boost::filesystem::path&) ld: 0711-317 ERROR: Undefined symbol: .boost::filesystem::exists(const boost::filesystem::path&) ld: 0711-317 ERROR: Undefined symbol: .boost::filesystem::path::native_file_string() const ld: 0711-317 ERROR: Undefined symbol: .boost::filesystem::is_directory(const boost::filesystem::path&) ld: 0711-317 ERROR: Undefined symbol: .boost::filesystem::path::native_directory_string() const ld: 0711-317 ERROR: Undefined symbol: .boost::filesystem::path::leaf() const ld: 0711-317 ERROR: Undefined symbol: .boost::filesystem::detail::dir_itr_init(boost::shared_ptr<boost::filesystem::detail::dir_itr_imp>&,const boost::filesystem::path&) ld: 0711-317 ERROR: Undefined symbol: .boost::filesystem::detail::dir_itr_dereference(const boost::shared_ptr<boost::filesystem::detail::dir_itr_imp>&) ld: 0711-317 ERROR: Undefined symbol: .boost::filesystem::detail::dir_itr_increment(boost::shared_ptr<boost::filesystem::detail::dir_itr_imp>&) ld: 0711-345 Use the -bloadmap or -bnoquiet option to obtain more information. 2a) On AIX, look inside your makefile. What am I looking for? > [...] MS Visual C++ 6 > generates the following similar error when attempting to compile > simple_ls.cpp > > c:\boost\include\boost-1_32\boost\filesystem\operations.hpp(18) : fatal > error C1083: Cannot open include file: 'boost/filesystem/path.hpp': No such file or directory 2b) On MSDEV6, add "c:\boost\include\boost-1_32" in your project settings. More specifically in the "C++" tab, under "Preprocessor" category (drop-down list), and at "Additional include directories:". I did this and I can now build, but I get a linker error: LINK : fatal error LNK1104: cannot open file "libboost_filesystem-vc6-sgd-1_32.lib" Thanks.

2 1

Q: W4003 with vc7 boost=1.32 in date_time lib
by Dan Dimerman 02 Dec '04

02 Dec '04

Hello, I just wanted to see if there are others getting this warning in VC7 with Boost 1.32, or it's just me doing something wrong with the #include order or forgetting a #define. The warning reads: C:\Boost\include\boost-1_32\boost\date_time\gregorian\greg_facet.hpp(293) : warning C4003: not enough actual parameters for macro 'max' thanks for any help... Dan --- Outgoing mail is certified Virus Free. Checked by AVG anti-virus system (http://www.grisoft.com) Version: 6.0.802 / Virus Database: 545 - Release Date: 26-Nov-04

7 14

GCC and precompiling headers containing anonymous namspaces (i.e. bind/placeholders.hpp)
by Matthew Gruenke 02 Dec '04

02 Dec '04

Like a number of other compilers, GCC (version 3.4.3) appears to have problems related to precompiled headers that contain anonymous namespaces - such as the one in bind/placeholders.hpp. There appears to be some consensus that GCC currently does have issues in this area (see http://gcc.gnu.org/bugzilla/show_bug.cgi?id=10591) I noticed the workarounds in bind/placeholders.hpp (Boost version 1.32.0) for other compilers, and tried them with the above version of GCC. I discovered that only the work-around using static inline wrapper functions (i.e. the one for Borland compilers) seems to work. Can anyone confirm this? Should I file a bug to have that workaround apply for GCC, as well? Are anonymous/unnamed namespaces used in any other BOOST headers (which should presumably also have the workaround)? Matt Gruenke Software Engineer IntelliVid Corporation

1 0

boost::lambda without 'use namespace'
by Agoston Bejo 01 Dec '04

01 Dec '04

Hi all, is there a way to use the boost::lambda library without having to use boost::lambda; ? I would like to use lambda expressions in a header file, therefore without 'use'-ing the namespace. Thx, Agoston

2 1

newbie boost sample compile program
by Brian Gaber 01 Dec '04

01 Dec '04

I have installed boost on both Windows and AIX and get the same problem when I try to compile the simple_ls.cpp program that boost provides. In AIX the boost hpp files get installed in /usr/local/include/boost-1_32/boost/... I created /usr/local/include/boost/... with this command: ln -s /usr/local/include/boost-1_32/boost /usr/local/include/boost In Windows the boost hpp files get installed C:\boost-1_32\boost\... In AIX when I try to compile simple_ls.cpp I get the following: "/usr/local/include/boost/filesystem/operations.hpp", line 18.10: 1540-0836 (S) The #include file <boost/filesystem/path.hpp> is not found. "/usr/local/include/boost/filesystem/operations.hpp", line 19.10: 1540-0836 (S) The #include file <boost/shared_ptr.hpp> is not found. "/usr/local/include/boost/filesystem/operations.hpp", line 21.10: 1540-0836 (S) The #include file <boost/iterator.hpp> is not found. "/usr/local/include/boost/filesystem/operations.hpp", line 22.10: 1540-0836 (S) The #include file <boost/cstdint.hpp> is not found. "/usr/local/include/boost/filesystem/operations.hpp", line 27.10: 1540-0836 (S) The #include file <boost/config/abi_prefix.hpp> is not found. "/usr/local/include/boost/filesystem/operations.hpp", line 149.10: 1540-0836 (S) The #include file <boost/config/abi_suffix.hpp> is not found. my simple_ls.cpp currently has the following include statements: #include "/usr/local/include/boost/filesystem/operations.hpp" #include "/usr/local/include/boost/filesystem/path.hpp" #include <iostream> simple_ls.cpp came with the following include statements which generate similar errors to those above: #include "boost/filesystem/operations.hpp" #include "boost/filesystem/path.hpp" #include <iostream> MS Visual C++ 6 generates the following similar error when attempting to compile simple_ls.cpp c:\boost\include\boost-1_32\boost\filesystem\operations.hpp(18) : fatal error C1083: Cannot open include file: 'boost/filesystem/path.hpp': No such file or directory Thanks for any tips.

2 1

FStream compile problem in VC6
by Adam 01 Dec '04

01 Dec '04

Hi, I'm trying to compile the following in Visual C++6.0 #include "boost/config.hpp" #include "boost/filesystem/operations.hpp" // includes boost/filesystem/path.hpp #include "boost/filesystem/fstream.hpp" // ditto #include <iostream> // for std::cout using namespace boost::filesystem; int main(int argc, char* argv[]) { remove_all( "foobar" ); create_directory( "foobar" ); boost::filesystem::ofstream file( "foobar/cheeze" ); file << "tastes good!\n"; file.close(); if ( !exists( "foobar/cheeze" ) ) std::cout << "Something is rotten in foobar\n"; return 0; } and I keep getting an error saying that c:\program files\microsoft visual studio\vc98\include\boost\filesystem\fstream.hpp(95) : error C2504: 'basic_ofstream<char,struct std::char_traits<char> >' : base class undefined C:\Program Files\Microsoft Visual Studio\MyProjects\boost_filesystem\boost_filesystem.cpp(17) : see reference to class template instantiation 'boost::filesystem::basic_ofstream<char,struct std::char_traits<char> >' being compiled which I think means that it can't find the implementation for std::basic_ofstream<charT,traits> . I'm not sure how to get around this because I can define a std::basic_ofstream, without problem. Thanks for help, Adam

1 0

Format Library - Asterisk Support
by Barak Simon 01 Dec '04

01 Dec '04

Hi, I have noticed that the format library does not support at present the printf asterisk for providing dynamic width as an extra parameter. Unfortunately my users need to use this widely and I would really hate to revert back to a non-typesafe solution. a. Are there any plans to support it in near future? b. If not, is there an easy way to add that to parsing.hpp, parse_printf_directive method, parse_width & parse_precision sections? currently the asterisk is ignored, and the library throws an exception thinking it has an extra parameter. c. Is there any workaround I miss which may give me the same expected result of providing say "%*s, width, charPtr" ? (I have 'width' and a non-null-terminated char pointer and need to construct the correct string from them without doing unnecessary copying...) Many thanks, Barak ________________________ Barak Simon GED IT Core Platform Deutsche Bank 190 George St. Sydney, 2000 Phone +61 2 925 85070 Fax +61 2 925 95050 -- 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.

4 5

Q: VC7 boost1.32 date_time\time_system_counted.hpp(57) : warning C4244: 'initializing'
by Dan Dimerman 01 Dec '04

01 Dec '04

Hello, >From the department of unexplained warnings... I found this one which I hope someone out there could help me kill. The warning reads: C:\Boost\include\boost-1_32\boost\date_time\time_system_counted.hpp(57) : warning C4244: 'initializing' : conversion from 'boost::date_time::counted_time_rep<config>::int_type' to 'boost::date_time::gregorian_calendar_base<ymd_type_,date_int_type_>::date_int_type', possible loss of data What can I do to get rid of this one? many thanks Dan --- Outgoing mail is certified Virus Free. Checked by AVG anti-virus system (http://www.grisoft.com) Version: 6.0.803 / Virus Database: 546 - Release Date: 30-Nov-04

2 1

abort when constructing filesystem::path object
by Richard Wolf 01 Dec '04

01 Dec '04

Hi I'm trying to use the filesystem library, and I get an abort when trying to initialise a path object with a string containing a space. #include <boost/filesystem/path.hpp> #include <iostream> int main() { boost::filesystem::path p1("hello"); std::cout << p1.string(); boost::filesystem::path p2("hello world"); std::cout << p2.string(); } when run, this prints: helloAborted I couldn't find anything saying that the string path constructor can't contain a space. Am I doing something wrong, or is this a bug? Using gcc 3.3.4 on Debian. thanks, Richard

2 2

[Q] Which compiler tool for MSVC 2005 (Beta)
by Michael Peterson 01 Dec '04

01 Dec '04

I have MSVC 2005 (Beta) installed and was wondering with what compiler toolset, if any, should I use to build boost 1_32_0? Also, any advice as to whether I should use Microsoft's stl or the open source version (I have 4.6.2)? Thanks, Michael

4 3

Help: Building Boost with Different Compiler Options
by Paul Dubuc 30 Nov '04

30 Nov '04

I'm trying to build Boost 1.32 on Solaris 8 (SPARC) with GCC 3.3.4. I want to build a 64-bit version of the libraries and this requires pasing the -m64 option to the compiler. How do I tell bjam to do this? I've tried: export TOOLSET_OPT="-sGCC_ROOT_DIRECTORY=${GCCDIR} -exec-prefix=${PWD}/${GCCVERSION}/64 \"\"-sGXX=g++ -m64\"\" \"\"-sGCC=gcc -m64\"\"" ... bjam ${TOOLSET_OPT} \ -sTOOLS=${TOOLSET} \ --prefix=${PWD}/.. \ --with-python-root=/projects/gnu/sparc-sun-solaris8 \ install It dosn't seem to work. I still get 32-bit libraries. Help would be appreciated, Thanks. -- Paul M. Dubuc

4 6

Re: [Boost-users] Errors when playing with lambda (1.32.0, VC7.1)
by John.Wismar＠autozone.com 30 Nov '04

30 Nov '04

"Peter Dimov" <pdimov(a)mmltd.net> wrote: > You are trying to invoke the non-const member > function Foo::print on a const Foo. and > You didn't call the function: (&_1->*&Foo::print)(). Thanks for the reply! Both seem obvious once the errors have been pointed out, but I was not making any headway by reading the error messages (in the first case) or stepping through the code execution (in the second).... I'll keep working with it. Thanks again!! -------------------------------- John Wismar john.wismar(a)autozone.com

1 0

Errors when playing with lambda (1.32.0, VC7.1)
by John.Wismar＠autozone.com 30 Nov '04

30 Nov '04

I'm taking a look at the Lambda library, and writing some toy programs, and I keep coming up with errors, and I can't figure out what the problems are.... Example 1: This works as expected: using namespace boost::lambda; class Foo { public: void print() { std::cout << "Foo::print()\n"; } }; template <class Container, class Function> Function for_all(Container cont, Function f) { return std::for_each(cont.begin(), cont.end(), f); } int main(int argc, char* argv[]) { std::vector<Foo> vec; //Fill vec for_all(vec, (bind(&Foo::print, _1))); return 0; } If I change the declaration of for_all to take the container by const reference, I get errors [See Error 1 pasted in below]: using namespace boost::lambda; class Foo { public: void print() { std::cout << "Foo::print()\n"; } }; template <class Container, class Function> Function for_all(Container const &cont, Function f) { return std::for_each(cont.begin(), cont.end(), f); } int main(int argc, char* argv[]) { std::vector<Foo> vec; //Fill vec for_all(vec, (bind(&Foo::print, _1))); return 0; } Example 2: It looks from the docs like I should be able to rewrite the bind expression above using operator ->*, like so: for_all(vec, (&_1 ->* &Foo::print)); And, in fact this compiles cleanly (regardless of whether the container is passed by value or by const reference). Foo::print() never gets called, though. What am I doing wrong or not understanding here? Thanks in advance!!! -------------------------------- John Wismar john.wismar(a)autozone.com ------------------------------------------------------------------------------------------------------------- [Error 1] c:\dev\alldata\Dev\3rd Party\boost\boost\lambda\detail\actions.hpp(87) : error C2665: 'boost::lambda::function_adaptor<Func>::apply' : none of the 2 overloads can convert parameter 2 from type 'const std::allocator<_Ty>::value_type' with [ Func=boost::lambda::return_type_N<boost::lambda::function_action<2>,boost::lambda::lambda_functor_base<boost::lambda::action<2,boost::lambda::function_action<2>>,boost::tuples::tuple<const boost::lambda::detail::bind_traits<void (__thiscall Foo::* const )(void)>::type,const boost::lambda::detail::bind_traits<const boost::lambda::placeholder1_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type>>::sig<boost::tuples::tuple<const std::allocator<Foo>::value_type &,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>::rets_t>::plain_Func ] and [ _Ty=Foo ] c:\dev\alldata\Dev\3rd Party\boost\boost\lambda\detail\function_adaptors.hpp(193): could be 'Result boost::lambda::function_adaptor<Func>::apply<RET>(Result (__thiscall Foo::* )(void),Object *)' with [ Result=void, Func=boost::lambda::return_type_N<boost::lambda::function_action<2>,boost::lambda::lambda_functor_base<boost::lambda::action<2,boost::lambda::function_action<2>>,boost::tuples::tuple<const boost::lambda::detail::bind_traits<void (__thiscall Foo::* const )(void)>::type,const boost::lambda::detail::bind_traits<const boost::lambda::placeholder1_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type>>::sig<boost::tuples::tuple<const std::allocator<Foo>::value_type &,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>::rets_t>::plain_Func , RET=boost::lambda::lambda_functor_base<boost::lambda::action<2,boost::lambda::function_action<2>>,boost::tuples::tuple<const boost::lambda::detail::bind_traits<void (__thiscall Foo::* const )(void)>::type,const boost::lambda::detail::bind_traits<const boost::lambda::placeholder1_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boo st::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type>>::sig<boost::tuples::tuple<const std::allocator<Foo>::value_type &,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>::type, Object=Foo ] c:\dev\alldata\Dev\3rd Party\boost\boost\lambda\detail\function_adaptors.hpp(197): or 'Result boost::lambda::function_adaptor<Func>::apply<RET>(Result (__thiscall Foo::* )(void),Object &)' with [ Result=void, Func=boost::lambda::return_type_N<boost::lambda::function_action<2>,boost::lambda::lambda_functor_base<boost::lambda::action<2,boost::lambda::function_action<2>>,boost::tuples::tuple<const boost::lambda::detail::bind_traits<void (__thiscall Foo::* const )(void)>::type,const boost::lambda::detail::bind_traits<const boost::lambda::placeholder1_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type>>::sig<boost::tuples::tuple<const std::allocator<Foo>::value_type &,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>::rets_t>::plain_Func , RET=boost::lambda::lambda_functor_base<boost::lambda::action<2,boost::lambda::function_action<2>>,boost::tuples::tuple<const boost::lambda::detail::bind_traits<void (__thiscall Foo::* const )(void)>::type,const boost::lambda::detail::bind_traits<const boost::lambda::placeholder1_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boo st::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type>>::sig<boost::tuples::tuple<const std::allocator<Foo>::value_type &,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>::type, Object=Foo ] while trying to match the argument list '(const rt0 , const std::allocator<_Ty>::value_type)' with [ _Ty=Foo ] c:\dev\alldata\Dev\3rd Party\boost\boost\lambda\detail\lambda_functor_base.hpp(408) : see reference to function template instantiation 'RET boost::lambda::function_action<I>::apply<RET,U,const Foo>(A1 & ,A2 &)' being compiled with [ RET=boost::lambda::lambda_functor_base<boost::lambda::action<2,boost::lambda::function_action<2>>,boost::tuples::tuple<const boost::lambda::detail::bind_traits<void (__thiscall Foo::* const )(void)>::type,const boost::lambda::detail::bind_traits<const boost::lambda::placeholder1_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type>>::sig<boost::tuples::tuple<const std::allocator<Foo>::value_type &,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>::type, I=2, U=const rt0, A1=const rt0, A2=const std::allocator<Foo>::value_type ] c:\dev\alldata\Dev\3rd Party\boost\boost\lambda\detail\lambda_functors.hpp(148) : see reference to function template instantiation 'RET boost::lambda::lambda_functor_base<Act,Args>::call<boost::lambda::lambda_functor_base<Act,Args>::sig<SigArgs>::type,A,const boost::tuples::null_type,const boost::tuples::null_type,const boost::tuples::null_type>(A &,B &,C &,Env &) const' being compiled with [ RET=boost::lambda::lambda_functor_base<boost::lambda::action<2,boost::lambda::function_action<2>>,boost::tuples::tuple<const boost::lambda::detail::bind_traits<void (__thiscall Foo::* const )(void)>::type,const boost::lambda::detail::bind_traits<const boost::lambda::placeholder1_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type>>::sig<boost::tuples::tuple<const std::allocator<Foo>::value_type &,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>::type, Act=boost::lambda::action<2,boost::lambda::function_action<2>>, Args=boost::tuples::tuple<const boost::lambda::detail::bind_traits<void (__thiscall Foo::* const )(void)>::type,const boost::lambda::detail::bind_traits<const boost::lambda::placeholder1_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::typ e,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type>, SigArgs=boost::tuples::tuple<const std::allocator<Foo>::value_type &,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>, A=const std::allocator<Foo>::value_type, B=const boost::tuples::null_type, C=const boost::tuples::null_type, Env=const boost::tuples::null_type ] c:\DevTools\VS.NET2003\Vc7\include\algorithm(21) : see reference to function template instantiation 'boost::lambda::lambda_functor_base<Act,Args>::sig<SigArgs>::type boost::lambda::lambda_functor<T>::operator ()<const std::allocator<_Ty>::value_type>(A &) const' being compiled with [ Act=boost::lambda::action<2,boost::lambda::function_action<2>>, Args=boost::tuples::tuple<const boost::lambda::detail::bind_traits<void (__thiscall Foo::* const )(void)>::type,const boost::lambda::detail::bind_traits<const boost::lambda::placeholder1_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type>, SigArgs=boost::tuples::tuple<const std::allocator<Foo>::value_type &,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>, T=boost::lambda::lambda_functor_base<boost::lambda::action<2,boost::lambda::function_action<2>>,boost::tuples::tuple<const boost::lambda::detail::bind_traits<void (__thiscall Foo::* const )(void)>::type,const boost::lambda::detail::bind_traits<const boost::lambda::placeholder1_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<b oost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type>>, _Ty=Foo, A=const std::allocator<Foo>::value_type ] c:\Temp\LambdaTest\LambdaTest.cpp(29) : see reference to function template instantiation '_Fn1 std::for_each<std::vector<_Ty>::const_iterator,Function>(_InIt,_InIt,_Fn1)' being compiled with [ _Fn1=boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::action<2,boost::lambda::function_action<2>>,boost::tuples::tuple<const boost::lambda::detail::bind_traits<void (__thiscall Foo::* const )(void)>::type,const boost::lambda::detail::bind_traits<const boost::lambda::placeholder1_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type>>>, _Ty=Foo, Function=boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::action<2,boost::lambda::function_action<2>>,boost::tuples::tuple<const boost::lambda::detail::bind_traits<void (__thiscall Foo::* const )(void)>::type,const boost::lambda::detail::bind_traits<const boost::lambda::placeholder1_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type>>>, _InIt=std::vector<Foo>::const_iterator ] c:\Temp\LambdaTest\LambdaTest.cpp(35) : see reference to function template instantiation 'Function for_all<std::vector<_Ty>,boost::lambda::lambda_functor<T>>(const Container &,Function)' being compiled with [ Function=boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::action<2,boost::lambda::function_action<2>>,boost::tuples::tuple<const boost::lambda::detail::bind_traits<void (__thiscall Foo::* const )(void)>::type,const boost::lambda::detail::bind_traits<const boost::lambda::placeholder1_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type>>>, _Ty=Foo, T=boost::lambda::lambda_functor_base<boost::lambda::action<2,boost::lambda::function_action<2>>,boost::tuples::tuple<const boost::lambda::detail::bind_traits<void (__thiscall Foo::* const )(void)>::type,const boost::lambda::detail::bind_traits<const boost::lambda::placeholder1_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type,boost::lambda::detail::bind_traits<boost::tuples::null_type>::type>>, Container=std::vector<Foo> ]

3 2

Help with serializating an abstract object
by Jeffrey Holle 30 Nov '04

30 Nov '04

I'm running into trouble handling an abstract object in my attempt to apply boost.serialization to my application. Since it doesn't have state, initially I didn't add serialize methods to this class, and got compilization errors for want of these methods. Next, I added noop methods, and got errors because the serialization package attempted to construct an abstract class. I see there is an is_abstract template, but don't know how to employ it. Can somebody give me some pointers? Note that I've choosen to implement non-templated serialize methods, using a forwared reference of the desired archive classes. Should this template be in the definition file, or implementation file (inside or outside the serialize method(s))?

2 1

Problem with including boost/serialization/shared_ptr.hpp
by Jeffrey Holle 29 Nov '04

29 Nov '04

I'm attempting to apply the boost::serialization library to my application. Because it is fairly large, I've choosing to implement the serialize methods as non-templates. Such a tactic is used in some of the examples, for instance demo_polymorphic_A.hpp. This means that I don't include any boost.serialization or boost.archive headers in my definition files. A forward reference to the specific archive object is made instead. I've run into trouble with an object wrapped in a shared_pointer. To solve this, I've attempted to defined the BOOST_SHARED_POINTER_EXPORT() macro in this object's definition file. This necessitates including boost/serialization/shared_ptr.hpp. The problem is no matter what position I place this include file in this *.h file, I get the following error. boost/serialization/shared_ptr.hpp:26:2: #error "include <boost/serialization/shared_ptr> first This is a self reference, what is it trying to say? In other words, what do I have to include before boost/serialization/shared_ptr.hpp to make it happy?

4 3

howto store vertex-iterators as internal graph property?
by Sebastian Weber 29 Nov '04

29 Nov '04

Hi folks! I got a cyclic type-dependency problem. I am trying to let every vertex store a iterator to a list which stores vertex-iterators. This sounds weired, but I need to keep track of very few vertices within my graph which have a particle located at it. Thus I created a list of vertex-iterators who carry my particle positions in the graph. In order to be able to tell quickly if a vertice is taken by a particle I want each vertice to include a pointer to a null element representing the absence of a particle or a pointer into that list. My non-working code looks like: Definition of my graph: struct Spot { // acutally I need the vertex_iterator to be defined already // in order to define particle, but this is not yet defined // so I am using the knowledge that it is going to be represented // by a vector<std::size_t>::iterator (at least I hope so) // this assumption is WRONG!! typedef std::list< std::vector<std::size_t>::iterator >::iterator \\ particle_t; particle_t particle; }; typedef boost::adjacency_list<boost::vecS, boost::vecS, \\ boost::undirectedS, Spot > graph_t; Here I initialise my particles to be distributed in the graph object bg. m_posA is of type: std::list<RandomGraph::gtraits::vertex_iterator> // first initialise every position to the null-flag for(; vi != vend; ++vi) bg[*vi].particle = Spot::particle_t(); // now place particles at random positions boost::tie(vi, vend) = boost::vertices(bg); for(std::size_t i = 0; i < initialA; i++) { std::size_t pos; //aList_t::iterator iter; // find a random empty vertice do { pos = rand_gen(); } while(bg[pos].particle != m_posA_end); // place particle A there RandomGraph::gtraits::vertex_iterator vref = vi + pos; // put returns an iterator to the list-element where // vref has been stored bg[pos].particle = m_posA.put(vref); } Any help would be great. Thanks in adavance. Greetings, Sebastian Weber

6 6

[OSX] Multiply defined symbols between Function and Signals libs ?
by Alo Sarv 29 Nov '04

29 Nov '04

Hi I'v been compiling boost libraries objects straight into my application binaries on linux and OSX platforms (e.g. not using bjam/stat/dynlibs), and thus far it has worked. However, recently I started getting multiply defined symbols on OSX, namely _1, _2, _3 etc. Most likely they come between Boost.Function and Boost.Signals libraries (latter of which I started using recently). My question is is it inherently bad idea to compile boost objects like this straight into application binary (e.g. should I always use bjam?), or there any other workarounds to avoid those multiple symbols on OSX ? Alo Sarv.

2 2

Re: Re: Graph library - bundled properties for edge
by TC MA 29 Nov '04

29 Nov '04

Thank you for your answer. I don't know '*first' will give an edge_description already. > TC MA wrote: > > > G[source(*first, G)].y << " joins " << > > G[target(*first, G)].x << "," << G[target(*first, > > G)].y << " weight " << G[edge(*first)].weight << endl; > > ++first; > > What's the 'edge' function and why do you call it? What about just '*first', > which gives you an edge_description already? > > - Volodya ===== TingChong Ma ______________________________________________________________________ Post your free ad now! http://personals.yahoo.ca

1 0

Re: Re: Re: Leak when using boost threads under VC .NET using usi ng statically linked CRT
by alansa＠ati-uk.com 29 Nov '04

29 Nov '04

-----Original Message----- From: Alan Saunders Sent: 22 November 2004 17:24 To: 'boost-users(a)lists.boost.org' Subject: >> Hmmm no linker errors or warnings. I've set my main exe to statically >> link. if i use the version of threads that statically links to >> msvcrt71 or dynamically to msvcrt71.dll it doesn't seem to make any >> difference. Our boost libraries where compiled here for msvcrt71 and i >> can confirm this. >> >> As i say if my main exe uses msvcrt71.dll then theres no leak. >Are you using tls code? >TLS currently (as to my knowledge) contains a "intentional" leak which >however is harmless. >Could you post the messages? >Did you track down the leak? Hi Roland In order to clear random influences from other areas of the software i'm working on, I have created a simple program with the code that i listed before. nothing else, no tls code. The intentinal leak would be harmless if it did not keep increasing. If I let the program run for long enough i will run out of memory. Sorry which messages would you like me to post? Haven't tracked down the leak yet. My problem is solved for the time being by using msvcrt71.dll as i said before. However it would be nice to be able to using the static lib. I replace the code in the loop which constantly starts and stop threads with my own code that did the same thing. This code was pretty much the same as the code for boost::thread using the windows api functions. This did not leak. However the big difference between my code and boost::thread is that my code didn't use boost::function. Therefore I suspect the leak could be in there! Looking at function it certainly isn't as trivial as thread. One thing i have noticed is that there is an option to get function to use "new" instead of std::allocator with the macro BOOST_NO_STD_ALLOCATOR. (function_template.hpp). I haven't got round to trying this yet though. Alan

4 4

accessing internal graph properties via vertex-iterators directly?
by Sebastian Weber 29 Nov '04

29 Nov '04

Hello there! First of all thanks a lot for the rapid response of my last question. I got another question concerning the access of internal graph properties: To access a bundeled vertice internal properties of a graph one has to use the following syntax: struct VertStruct { int stuff; }; typedef adjacency_list<vecS, vecS, undirectedS, VertStruct> graph_t; graph_t bg; ... setup graph ... graph_traits<graph_t>::vertex_iterator vi, vend; tie(vi, vend) = vertices(bg); bg[*vi].stuff = 4; This makes it clear, that even though we already have an iterator (vi) pointing to our vertice of interest, the BGL has to spend again some time locating the data ascociated with it. A far more direct and much clearer notion would be: (*vi).stuff = 4; With this, one would save a lookup in the data-structures and the vertice-iterator concept would be far more logic to me, concernig internal property handling. I don't know the BGL internals and how this behaviour is optimally programmed with the BGL. I thought of providing a custom container for the vertex-container which is composed of a vector of a customary struct, which glues vertice properties together with every element of the vertice list and makes the property really internal, allowing a (*vi).myrealinternalstuff = 4 expression. I hope my point is clear. Thanks a lot for any help. Greetings, Sebastian Weber

2 2

Graph library - bundled properties for edge
by TC MA 29 Nov '04

29 Nov '04

I try to add Vertex and Edge data with bundled properties. I am modifying the sample program interior_property_map.cpp to learn how to access the bundled properties, but I don't know how to fix my compile error. What is the right way to access the bundled properties for edge? Source code is: #include <boost/config.hpp> #include <iostream> #include <algorithm> #include <boost/graph/adjacency_list.hpp> #include <boost/property_map.hpp> using namespace std; using namespace boost; struct VertexData { int x; int y; }; struct EdgeData { int weight; }; template <class EdgeIter, class Graph> void who_owes_who(EdgeIter first, EdgeIter last, const Graph& G) { // Access the propety acessor type for this graph while (first != last) { // fail to compile here!!! cout << G[source(*first, G)].x << "," << G[source(*first, G)].y << " joins " << G[target(*first, G)].x << "," << G[target(*first, G)].y << " weight " << G[edge(*first)].weight << endl; ++first; } } int main() { // Create the graph, and specify that we will use store the data. typedef adjacency_list<vecS, vecS, directedS, VertexData, EdgeData> MyGraphType; typedef pair<int, int> Pair; // from <utility> Pair edge_array[11] = { Pair(0,1), Pair(0,2), Pair(0,3), Pair(0,4), Pair(2,0), Pair(3,0), Pair(2,4), Pair(3,1), Pair(3,4), Pair(4,0), Pair(4,1) }; MyGraphType G(5); for (int i=0; i<11; ++i) add_edge(edge_array[i].first, edge_array[i].second, G); G[0].x = 0; G[0].y = 0; G[1].x = 1; G[1].y = 1; G[2].x = 2; G[2].y = 2; G[3].x = 3; G[3].y = 3; G[4].x = 4; G[4].y = 4; // store weights in edges graph_traits <MyGraphType>::edge_iterator ei, eend; int i = 0; for (tie(ei, eend) = edges(G); ei != eend; ++ei) { G[*ei].weight = i++; cout << "G[e] weight " << G[*ei].weight << endl; } who_owes_who(edges(G).first, edges(G).second, G); cout << endl; return 0; } Compile error is: gcc-C++-action /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.test/gcc/debug/inlining-on/interior_property_map.o /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp: In function `void who_owes_who(EdgeIter, EdgeIter, const Graph&) [with EdgeIter = boost::detail::adj_list_edge_iterator<boost::counting_iterator<size_t, boost::use_default, boost::use_default>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::sep_<size_t, boost::property<boost::edge_bundle_t, EdgeData, boost::no_property> >*, std::vector<boost::detail::sep_<size_t, boost::property<boost::edge_bundle_t, EdgeData, boost::no_property> >, std::allocator<boost::detail::sep_<size_t, boost::property<boost::edge_bundle_t, EdgeData, boost::no_property> > > > >, size_t, boost::detail::edge_desc_impl<boost::directed_tag, size_t>, ptrdiff_t>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, VertexData, EdgeData, boost::no_property, boost::listS> >, Graph = main()::MyGraphType]': /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:113: instantiated from here /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:64: error: no matching function for call to `edge(boost::detail::edge_desc_impl<boost::directed_tag, size_t>)' set -e "g++" -c -Wall -ftemplate-depth-255 -g -O0 -Wno-inline -I"../../../bin/boost/libs/graph/example" -I "/home/tcma/cpp/boost_1_32_0" -o "/home/tcma/cpp/boosttcma/libs/graph/interior_property_map.test/gcc/debug/inlining-on/interior_property_map.o" "/home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp" "/usr/bin/objcopy" --set-section-flags .debug_str=contents,debug "/home/tcma/cpp/boosttcma/libs/graph/interior_property_map.test/gcc/debug/inlining-on/interior_property_map.o" ... ===== TingChong Ma ______________________________________________________________________ Post your free ad now! http://personals.yahoo.ca

2 1

RE: Problem with graph:johnson_all_pairs_shortest_paths
by keith.briggs＠bt.com 29 Nov '04

29 Nov '04

>So, you get a code like: const int V = n; int D[V][V]; In this case, 'V' is not a compile time constant and the second line >is not valid -- array bounds must be compile time constant. I have no idea why you get the error you get, instead of >error right at the point where array is declared. Most likely, this is diagnostic problem in the rather ancient (;-)) version of >gcc that you're using. Ok, so what's the right say to do this kind of dynamically-sized problem? Keith

2 1

Problem with graph:johnson_all_pairs_shortest_paths
by keith.briggs＠bt.com 29 Nov '04

29 Nov '04

I am using g++ 3.2 on a redhat linux system. I took the johnson_all_pairs_shortest_paths example, (http://www.boost.org/libs/graph/example/johnson-eg.cpp) which works fine, but then changed const int V = 5; to const int V = n; where n has been computed at runtime. This should not change the type of V or D, but I now get the error below. Can anyone explain how to fix this? Thanks, Keith > /usr/bin/g++ -I ~/boost_1_32_0/ graph_stats.cc graph_stats.cc: In function `int main()': graph_stats.cc:46: no matching function for call to ` johnson_all_pairs_shortest_paths(main()::Graph&, int[V][V], boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property> )'

2 1

Serialization and source code organization
by Malte Clasen 28 Nov '04

28 Nov '04

Hi, I'm currently trying to use the new Boost 1.32 serialization library to save the state of a medium complex program (about 10.000 lines of code). The problem is that the serialization lib seems to require very close source code coupling: The translation unit that contains the load/save functions for the application has to see all serialize() method definitions (as they are templates). That means that I cannot rely on forward declarations, so I always have to include the respective header file. This slows down the compilation noticably and results in errors such as "C1204: compiler limit : internal structure overflow" and "C1055: compiler limit : out of keys" (VC++ 7.1), as more or less all significant headers are included in this translation unit. The documentation is aware of this kind of problem and recommends manual instantiations of the serialize() methods (in the PIMPL section). Do I get something wrong or is this the only solution? I don't really like manual template instantiations, but in this case I can't imagine another way to deal with it, except waiting for the next VC++ release and hoping for the best. Malte

4 8

help needed on random libary
by Deng Kun 28 Nov '04

28 Nov '04

can someone tell me how to seed the random library? I am having some problem with the following code the seed method won't compile on solaris but works fine on windows especially in the "else" part die->engine().seed((unsigned int)(s)); gives me some error. #ifndef RANDOMBITSET_H #define RANDOMBITSET_H #include <stdlib.h> #include <boost/random.hpp> #include <boost/dynamic_bitset.hpp> class RandomBitset { public: typedef boost::mt19937 EngineType; typedef boost::bernoulli_distribution<> DistType; typedef boost::variate_generator<EngineType, DistType> DieType; EngineType rng; DistType dist; DieType *die; RandomBitset(double p=0.5): rng(), dist(p){ die= new DieType(rng, dist); } RandomBitset(const RandomBitset & r){ rng=r.rng; dist=r.dist; if (die!=NULL) { delete die; } die= new DieType(rng,dist); } virtual ~RandomBitset(){ delete die; } //force reseed //input s<0 will use system time to reseed //otherwise use s as seed void seed(int s=-1){ if (s<0) { long rs=time(NULL); srand(rs); die->engine().seed((unsigned int) rand()); }else { die->engine().seed((unsigned int)(s)); } } void randomBitset(boost::dynamic_bitset<> & bs); }; #endif //RANDOMBITSET_H

1 0

boost and g++-4.0
by Marc Cromme 28 Nov '04

28 Nov '04

I was wondering if Boost does work with g++ 4.0 (on Linux/Unix systems). I have seen that the config files boost/config/compiler/gcc.hpp check up to version 3.4. (boost version 1.31.0-9 on a debian testing system) Does anybody have experiences with g++ 4.0 ?? Is there a gcc.hpp including tests for g++ 4.0 ?? Something else I should know and do not ?? Marc Cromme -- Marc Cromme, cand. polyt, Ph.D Senior Developer, Project Manager Index Data Aps Købmagergade 43, 2 1150 Copenhagen K. Denmark tel: +45 3341 1000 fax: +45 3341 0101 http://www.indexdata.com INDEX DATA Means Business for Open Source and Open Standards

1 0

Can't compile very simple snippet that uses boost::tuple
by Frank Astier 28 Nov '04

28 Nov '04

I am pretty sure it's because of my lack of skills with templates... Still, I don't understand why I can stream a vector if it's on its own, but not if it's stored in a boost::tuple. And it works with a std::pair! Any hint? #include <boost/tuple/tuple.hpp> #include <boost/tuple/tuple_io.hpp> #include <iostream> #include <vector> #include <algorithm> using namespace std; using namespace boost; template <typename T> ostream& operator<<(ostream& out, const vector<T>& v) { copy(v.begin(), v.end(), ostream_iterator<T>(out, " ")); return out; } template <typename T, typename U> ostream& operator<<(ostream& out, const pair<T, U>& p) { return out << p.first << " " << p.second; } int main(int, char**) { vector<float> v; cout << v; // Works fine pair<vector<float>, pair<int, int> > p; cout << p; // Works fine tuple<vector<float> > t; cout << t; // <== WON'T COMPILE } Thanks, Frank

2 1

Another use for apply.
by Paul Elliott 28 Nov '04

28 Nov '04

The bind documentation mentions the apply object as a way to get around the fact that bind does not evaluate its first arguement. There is another use. You can reverse the roles of function and parameters. You can use apply and bind to turn a parameter into a functor, and call it using a function as a parameter! Example. #include <boost/bind.hpp> #include <boost/function.hpp> #include <boost/bind/apply.hpp> #include <fstream> #include <iostream> #include <iomanip> // some sample test functions. (data) int g(int x) {return x+1;}; int h(int x) {return x*x; }; int main(int argc, char * argv) { // want to work with functions of the form int f(int); typedef int P(int); // bind the integer 5 to apply turning // apply into the number 5 into a function! call it five boost::function<int (P)> five = boost::bind(boost::apply<int>(),_1,5); //int y = five(g); // Now call 5 with the "data" g and h. std::cout << "+1=" << five(g) << std::endl << "square = " << five(h) << std::endl; return 0; }; Results: +1=6 square = 25 -- 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

1 0

[Q] Unresolved references when linking against the test libs
by Michael Peterson 27 Nov '04

27 Nov '04

I apologize in advance if this turns out to be a linker problem not related to boost. So here goes: For compatibility/legacy reasons, we can not use the Boost.Build jamfiles to build our application. Accordingly, I've written a set of traditional makefiles to build the project's executables and have run into difficulties. Specifically, when I try to link my test program against the boost test libraries, I get an error message (reformatted for easy reading) saying that the reference to test_main can not be resolved. Here's the spew (formatted to make it easier to read): g++ -g3 -L../long/debug -L/usr/lib -L/usr/local/lib -L/usr/local/lib/stlport -L/usr/local/lib/boost -o "debug/unit_test" debug/longtest.o -lLong -lboost_unit_test_framework-gcc-mt-p -lboost_test_exec_monitor-gcc-mt-p -lpthread -lc /usr/local/lib/boost/libboost_test_exec_monitor-gcc-mt-p.so: undefined reference to `test_main(int, char**)' collect2: ld returned 1 exit status make: *** [debug/unit_test] Error 1 According to nm, the undefined reference, test_main, is defined in the exec_monitor library. I've tried reordering the libraries but no joy. Any advice and/or hints would be very much appreciated. I am using STLPort-4.6.2 and boost_1_32_0 and Linux (I386) Cheers, Michael

3 4

[Q] BBV2 -- How to control naming of libraries...
by Michael Peterson 27 Nov '04

27 Nov '04

This is another getting started question: I noticed that when I staged the build of the boost libraries, unlike BBV1, the lib names were of the form boost_xxx.so. I would like to be able to control the naming (and staging) such that ib names are prefixed with 'lib' and have a version number for a suffix. For example, instead of boost_xxx.so I would like the libs to be named libboost_xxx.so-1.32.0 Must I modify the <lib> target in each Jamfile.v2 to accomplish these ends? Thanks, again Michael P.S. Still haven't solved the unresolved reference to test_main. I now suspect that the libraries did not get built correctly (I used bbv1) because I can take source code directly from the examples and it fails with the same error. Hence, I'm trying to build using BBV2.

1 0

Thread Join/StackTrace
by Fallon, David 26 Nov '04

26 Nov '04

I am having problems debugging an application under Linux using gdb and the boost threads library. The problem I am basically having is the stack trace is only going back to the join statement rather than to point in the program that caused the crash. My application is reasonable complicated so to reproduce it I have created a buggy version of the helloword4 tutorial. The slightly modified the helloworld4 tutorial program to loop 7 times and then crash. The stack trace given in gdb points back to the join statement rather than the source code line that generated the error. Has anyone else come across this problem? // Copyright (C) 2001-2003 // William E. Kempf // // Permission to use, copy, modify, distribute and sell this software // and its documentation for any purpose is hereby granted without fee, // provided that the above copyright notice appear in all copies and // that both that copyright notice and this permission notice appear // in supporting documentation. William E. Kempf makes no representations // about the suitability of this software for any purpose. // It is provided "as is" without express or implied warranty. #include <boost/thread/thread.hpp> #include <boost/bind.hpp> #include <iostream> #include <string.h> void helloworld(const char* who) { for(int i = 0 ; i < 10; i++ ) { std::cout << who << "says, \"Hello World.\" " << i << std::endl; sleep(2); if(i > 7 ) { std::cout << " will crash " << std::endl; char * p = NULL; strcpy(p,"abcde "); // CAUSES Segmentation FAULT here but gdb } } } int main() { boost::thread thrd(boost::bind(&helloworld, "Bob")); thrd.join(); // Stack trace STOPS HERE }

2 1

Boost Thread - Read Write Mutex Problem
by David Brownell 26 Nov '04

26 Nov '04

When running the simple program listed below, the scoped_read_lock appears to never acquire a read lock on the mutex and, as a result, the program never finishes. In looking through the documentation, I don't think there is anything additional I need to do and was a bit surprised that this didn't work. Here is the code: boost::read_write_mutex m(static_cast<boost::read_write_scheduling_policy::read_write_scheduling_pol icy_enum>(alternating_many_reads)); std::cout << "Before\n"; { boost::read_write_mutex::scoped_write_lock l(m); } std::cout << "Middle\n"; { boost::read_write_mutex::scoped_read_lock l(m); } std::cout << "After\n"; And some more details: - test_read_write_mutex.cpp completed without problems - writer_priority and reader_priority completed without problems. Only alternating_many_reads and alternating_single_read seem to have problems. - Windows XP SP2 - Microsoft Visual Studio 2003 - I am compiling with the Multithreaded DLL version of the CRT, so boost_thread-vc71-mt-gd-1_32.lib is being used Thanks for your help! David Brownell

1 0

Serialization: shared_ptr documentation
by Malte Clasen 26 Nov '04

26 Nov '04

Hi, the serialization docs about shared_ptr state that you have to call void_cast_register to use shared_ptr: ---------- This indicates that we're not quite done. [...] In this case we need only the latter function so we can replace the base object serialization with: // register the relationship between each derived class // its polymorphic base void_cast_register< boost::detail::sp_counted_base, boost::detail::sp_counted_base_impl<P, D> >(); ---------- (http://boost.org/libs/serialization/doc/shared_ptr.html) There are two issues with this: a) The actual void_cast_register declaration has its parameters in the reverse order: ---------- template<class Derived, class Base> inline BOOST_DLLEXPORT const void * void_cast_register( const Derived * /* dnull = NULL */, const Base * /* bnull = NULL */ ) BOOST_USED; ---------- (void_cast.hpp) b) It doesn't seem to work either way, although there are different exceptions in both cases. The demo_shared_ptr.cpp doesn't even call it, instead the following is used: ---------- oa.register_type( static_cast< boost::detail::sp_counted_base_impl< B *, boost::checked_deleter<B> > * >(NULL) ---------- (demo_shared_ptr.cpp) This one actually works, the use counter is properly updated. So I guess the documentation is outdated, isn't it? Malte

2 1

cannot compile serialization library
by "Kay Erik Münch" 25 Nov '04

25 Nov '04

Hi, I'm using the borland 5.6.4 compiler on a Win2k platform. For compiling the serialization lib i followed the hint given in the "Release Notes" to use spirit 1.6x I chdir-ed into the serialization\build directory and called: bjam -sTOOLS=borland -sBCCROOT=C:\Programme\Borland\CBuilder6 -sSPIRIT_ROOT=K:\spirit161 bcc32 tells me (rougly translated): borland-C++-action ..\..\..\bin\boost\libs\serialization\build\ libboost_serialization.lib\borland\debug\xml_grammar.obj K:\boost_1_32_0\libs\serialization\build\../src/xml_grammar.cpp: Error E2209 K:\spirit161\boost/spirit/core/basics.hpp 19: \ include-File 'boost/mpl/apply_if.hpp' could not be opened *** 1 Error ... *** "C:\Programme\Borland\CBuilder6\bin\bcc32" -j5 -g255 -q -c -P -w -Ve -Vx -a8 -b- -DBOOST_TEST_NO_AUTO_LINK=1 -v -Od -vi- -tWC -tWR -tWC -WM- -w-8080 -w-8071 -w-8057 -w-8001 -I"..\..\..\bin\boost\libs\serialization\build" -I"K:\spirit161" -I"C:\Programme\Borland\CBuilder6\include" -I"K:\boost_1_32_0" -o"..\..\..\bin\boost\libs\serialization\build\libboost_serialization.lib\ borland\debug\xml_grammar.obj" "K:\boost_1_32_0\libs\serialization\build\../src/xml_grammar.cpp" He's right, there is no apply_if.hpp in the mpl library any more. How can i get the library compiled ? -- Thanks for boost ! Kay ________________________________________________________________ Verschicken Sie romantische, coole und witzige Bilder per SMS! Jetzt neu bei WEB.DE FreeMail: http://freemail.web.de/?mc=021193

3 3

Re: Memory leak reported using threads library
by alansa＠ati-uk.com 25 Nov '04

25 Nov '04

I don't mind any one off small leaks. They may not be nice but no one is going to notice them. What bothers me is when memory keeps leaking for each iteration of the loop. I don't bother with the microsoft crt leak stuff. It's rarely that much use in complex projects and even if it does detect a leak it rarely can tell you where it is. As it turns out the crt leak detect stuff doesn't seem to show any leak (at least on my system), but lets say I put in my own my own leak of say new char[10] or something then the leak messages pour out. Use windows performance counters however and it's a different story, watch the working set rocket up. And it seems to increase at different rates depending on what the thread is doing. Eventually you will run out of memory entirely. Use the crt dll in your main program however and the working set is dead flat. >What I don't understand is your mentioning of the boost::function lib. >Where do you think it is getting used in >your example? boost::function is being used in the constructor of thread i believe. Has anyone been able to confirm this leak or is it just me? Naturally boost::threads is a dll only (at least v 1.30 which i'm currently using) and it itself can either link dynamically or statically to the crt. It doesn't make any difference which though. I have to link dynamically to crt in my program to avoid the leak. Why should this make a difference? I don't particular want to upgrade to 1.32 for my project as it's rather late in the day. I don't want any other issues creeping in and I've resolved the issue by using the dll. However I thought I should report my findings and see if anyone knows anything about it. Do we know if there is no leak in 1.32 or is it still there? Thanks. Alan

8 11

Re: [Boost-users] Regex linking woes.
by Jean Francois Poirier 25 Nov '04

25 Nov '04

> The version in the lib has it's std lib in namespace "std" rather than > "_STL", I'm guessing that STLPORT_PATH was setup incorrectly and so the lib > build didn't include the STLPort headers. Either that or else __STL_DEBUG > was set inconsistently between the two builds (bjam turns it on for debug > builds). > John. Touché. Hadn't looked at resulting VC command-line and indeed, STLPort was not included properly. Only now, after much hair-pulling, inclusion of STLPort headers with <stlport-iostream>off leads me to another perplexing point: C:\boost_1_32_0\boost/shared_ptr.hpp(431) : error C2039: 'basic_ostream' : is not a member of '_STL' followed by a bunch of errors stemming from the absence of basic_ostream. I looked through shared_ptr.hpp's inclusion path for missing references to ostream or somesuch but could find none. (building with <stlport-iostream>on works, but does not achieve what I want) Could it be that my path settings are leading to ostream never being included? Many thanks, jeff poirier Software Designer / Servers Group, VertigoXmedia

2 1

boost 1.32 breaks my code
by gast 128 25 Nov '04

25 Nov '04

Dear boost developpers, I just downloaded the new version, but some changes break my code. First I get not BOOST_MPL_ASSERT compilable on VC 7.1. From the documentation I could read that it could replace BOOST_MPL_ASSERT_IS_SAME, but I removed it completely, and switched back to BOOST_STATIC_ASSERT. Second I think the boost::bind has changed. This leads to compile errors in a double bind construction. The last time I tracked a problem with boost::bind it took me three days tofollow the source code. I don't know if I spent so much time again, I can replace the code, by not using boost::bind and write it explicitly. Last I get warning C4913 constantly. It's reported in 'is_incrementable.hpp' (line 56). Wkr, me _________________________________________________________________ Talk with your online friends with MSN Messenger http://messenger.msn.nl/

5 8

Problem with incremental components
by Gildardo Sanchez 25 Nov '04

25 Nov '04

Hi. I recently updated my computer from FC2 to FC3. Then, recompiled Boost, and when I tried to recompile my code, i get the following messages: /usr/include/boost/graph/incremental_components.hpp: In function `void boost::compress_components(ParentIterator, ParentIterator)': /usr/include/boost/graph/incremental_components.hpp:82: error: `find_representative_with_full_compression' is not a member of `boost::detail' /usr/include/boost/graph/incremental_components.hpp: In function `void boost::normalize_components(ParentIterator, ParentIterator)': /usr/include/boost/graph/incremental_components.hpp:102: error: `normalize_node' is not a member of `boost::detail' If I try to compile the example that comes in the book for incremental components (examples/incremental_components.cpp <http://www.boost.org/libs/graph/example/incremental_components.cpp>), I get the following error: incrementalComponents.cpp:99: error: `print_graph' undeclared (first use this function) Any idea on why could this be happening? I haven't touched anything in my own code. Thanks Gildardo

2 3

Boost Graph Library: parallel edge removal problem
by Tiago de Paula Peixoto 25 Nov '04

25 Nov '04

Hello. I believe I found a bug in the remove_edge function, when the graph is directed and allows parallel edges. Sometimes an edge simply isn't removed. I think the problem is that remove_edge uses edge_range internally, but this function needs an ordered EdgeList (such as multisetS), and doesn't work properly when it's something like listS. The attached file shows the problem. It builds a simple graph with a loop, adds a parallel edge, and tries to remove it. The output of the program is: number of edges before removal: 5 number of edges after removal: 5 When EdgeList is changed from listS to multisetS, it works as it should: number of edges before removal: 5 number of edges after removal: 4 I'm using Boost 1.32.0, with GCC 3.4.3 on GNU/Linux. Thanks. -- Tiago de Paula Peixoto <tiago(a)forked.de>

2 1

address of member operator() function defined with member templates!
by Paul Elliott 25 Nov '04

25 Nov '04

This may be an general C++ question but: I want to take the address of a member function that happens to be an operator() operator, which is defined with member templates in apply.hpp: --------------quote---- namespace boost { template<class R> struct apply { typedef R result_type; template<class F> result_type operator()(F & f) const { return f(); } template<class F, class A1> result_type operator()(F & f, A1 & a1) const { return f(a1); } -------end quote. I want to take the address of operator() for <int,int> which is defined by the member template above. ----Quote--- // want to work with functions of the form int f(int); typedef int P(int); boost::function<int (P)> f = // boost::bind(boost::apply<int>(),_1,5); // above works but instead try below! boost::bind(&boost::apply<int>::operator()<int,int>,5); // above line produces error. ----end quote I get error message: exabind.cpp:23: error: no matching function for call to `bind(<unknown type>, boost::apply<int>, int)' How do I specify a pointer to the member operator() method defined with member template parameters <int,int> ? I must be doing something wrong. My brain hurts. -- 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

1 0

Re: [Boost-users] newbie: Graph library - bundled properties revisited
by TC MA 24 Nov '04

24 Nov '04

Thanks for your help. Now I try to add Vertex and Edge data with bundled properties. Source code is: #include <boost/config.hpp> #include <iostream> #include <algorithm> #include <boost/graph/adjacency_list.hpp> #include <boost/property_map.hpp> using namespace std; using namespace boost; struct VertexData { int x; int y; }; struct EdgeData { int weight; }; template <class EdgeIter, class Graph> void who_owes_who(EdgeIter first, EdgeIter last, const Graph& G) { // Access the propety acessor type for this graph while (first != last) { // fail to compile here!!! cout << G[source(*first, G)].x << "," << G[source(*first, G)].y << " joins " << G[target(*first, G)].x << "," << G[target(*first, G)].y << " weight " << G[edge(*first)].weight << endl; ++first; } } int main() { // Create the graph, and specify that we will use store the data. typedef adjacency_list<vecS, vecS, directedS, VertexData, EdgeData> MyGraphType; typedef pair<int, int> Pair; // from <utility> Pair edge_array[11] = { Pair(0,1), Pair(0,2), Pair(0,3), Pair(0,4), Pair(2,0), Pair(3,0), Pair(2,4), Pair(3,1), Pair(3,4), Pair(4,0), Pair(4,1) }; MyGraphType G(5); for (int i=0; i<11; ++i) add_edge(edge_array[i].first, edge_array[i].second, G); G[0].x = 0; G[0].y = 0; G[1].x = 1; G[1].y = 1; G[2].x = 2; G[2].y = 2; G[3].x = 3; G[3].y = 3; G[4].x = 4; G[4].y = 4; // store weights in edges graph_traits <MyGraphType>::edge_iterator ei, eend; int i = 0; for (tie(ei, eend) = edges(G); ei != eend; ++ei) { G[*ei].weight = i++; cout << "G[e] weight " << G[*ei].weight << endl; } who_owes_who(edges(G).first, edges(G).second, G); cout << endl; return 0; } Compile error is: gcc-C++-action /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.test/gcc/debug/inlining-on/interior_property_map.o /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp: In function `void who_owes_who(EdgeIter, EdgeIter, const Graph&) [with EdgeIter = boost::detail::adj_list_edge_iterator<boost::counting_iterator<size_t, boost::use_default, boost::use_default>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::sep_<size_t, boost::property<boost::edge_bundle_t, EdgeData, boost::no_property> >*, std::vector<boost::detail::sep_<size_t, boost::property<boost::edge_bundle_t, EdgeData, boost::no_property> >, std::allocator<boost::detail::sep_<size_t, boost::property<boost::edge_bundle_t, EdgeData, boost::no_property> > > > >, size_t, boost::detail::edge_desc_impl<boost::directed_tag, size_t>, ptrdiff_t>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, VertexData, EdgeData, boost::no_property, boost::listS> >, Graph = main()::MyGraphType]': /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:113: instantiated from here /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:64: error: no matching function for call to `edge(boost::detail::edge_desc_impl<boost::directed_tag, size_t>)' set -e "g++" -c -Wall -ftemplate-depth-255 -g -O0 -Wno-inline -I"../../../bin/boost/libs/graph/example" -I "/home/tcma/cpp/boost_1_32_0" -o "/home/tcma/cpp/boosttcma/libs/graph/interior_property_map.test/gcc/debug/inlining-on/interior_property_map.o" "/home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp" "/usr/bin/objcopy" --set-section-flags .debug_str=contents,debug "/home/tcma/cpp/boosttcma/libs/graph/interior_property_map.test/gcc/debug/inlining-on/interior_property_map.o" ... > On Nov 24, 2004, at 11:21 AM, TC MA wrote: > > Still has a compile problem. > interior_property_map.cpp is now: > > struct vertexStruct { > string name; > }; > > template <class EdgeIter, class Graph> > void who_owes_who(EdgeIter first, EdgeIter last, const > Graph& G) > { > // Access the propety acessor type for this graph > typedef typename property_map<Graph, > &vertexStruct::name>::const_type NamePA; > > My mistake, this would have needed to be: > typedef typename property_map<Graph, string (vertexStruct::*)>::const_type NamePA; > > But, this shows us just how different bundled properties are from the prior types of properties. The property_map class becomes harder to use, but in many cases is not necessary. At the end is my rewrite of the example, which illustrates how much less baggage we need to worry about when we go all-out with bundled parameters. > > Doug > > template <class EdgeIter, class Graph> > void who_owes_who(EdgeIter first, EdgeIter last, const Graph& G) > { > while (first != last) { > cout << G[source(*first, G)].first_name << " owes " > << G[target(*first, G)].first_name << " some money" << endl; > ++first; > } > } > > struct VertexData > { > string first_name; > }; > > int > main() > { > { > // Create the graph, and specify that we will use std::string to > // store the first name's. > typedef adjacency_list<vecS, vecS, directedS, VertexData> MyGraphType; > > typedef pair<int,int> Pair; > Pair edge_array[11] = { Pair(0,1), Pair(0,2), Pair(0,3), Pair(0,4), > Pair(2,0), Pair(3,0), Pair(2,4), Pair(3,1), > Pair(3,4), Pair(4,0), Pair(4,1) }; > > MyGraphType G(5); > for (int i=0; i<11; ++i) > add_edge(edge_array[i].first, edge_array[i].second, G); > > G[0].first_name = "Jeremy"; > G[1].first_name = "Rich"; > G[2].first_name = "Andrew"; > G[3].first_name = "Jeff"; > G[4].first_name = "Doug"; > > who_owes_who(edges(G).first, edges(G).second, G); > } > > cout << endl; > > return 0; > } ===== TingChong Ma ______________________________________________________________________ Post your free ad now! http://personals.yahoo.ca

1 0

Graphviz vs boost.Graph: which is recommended?
by Dan Dimerman 24 Nov '04

24 Nov '04

Hello, I am about to start a subproject that takes a graph, computes a layout and draws it on screen (Windows XP). I thought about using AT&T's well known graphviz library until I saw that on boost 1.32 there's a new algorithm: "boost::kamada_kawai_spring_layout". Although I am tempted to use boost's lib, tradition dictates that a longer/better tested and implemented library is the way to go. Do you happen to have any experience in this kind of problem (drawing graphs)? Any suggestions/ caveats ? Thanks... --- Outgoing mail is certified Virus Free. Checked by AVG anti-virus system (http://www.grisoft.com) Version: 6.0.799 / Virus Database: 543 - Release Date: 19-Nov-04

4 6

Re: Re: [Boost-users] newbie: Graph library - bundled properties revisited
by TC MA 24 Nov '04

24 Nov '04

Still has a compile problem. interior_property_map.cpp is now: struct vertexStruct { string name; }; template <class EdgeIter, class Graph> void who_owes_who(EdgeIter first, EdgeIter last, const Graph& G) { // Access the propety acessor type for this graph typedef typename property_map<Graph, &vertexStruct::name>::const_type NamePA; // typedef typename property_map<Graph, vertexStruct::name>::const_type NamePA; NamePA name = get(&vertexStruct, G); typedef typename boost::property_traits<NamePA>::value_type NameType; NameType src_name, targ_name; while (first != last) { src_name = G[source(*first, G)].name; targ_name = G[target(*first, G)].name; cout << src_name << " owes " << targ_name << " some money" << endl; ++first; } } int main() { { // Create the graph, and specify that we will use std::string to // store the first name's. typedef adjacency_list<vecS, vecS, directedS, vertexStruct> MyGraphType; typedef pair<int,int> Pair; Pair edge_array[11] = { Pair(0,1), Pair(0,2), Pair(0,3), Pair(0,4), Pair(2,0), Pair(3,0), Pair(2,4), Pair(3,1), Pair(3,4), Pair(4,0), Pair(4,1) }; MyGraphType G(5); for (int i=0; i<11; ++i) add_edge(edge_array[i].first, edge_array[i].second, G); MyGraphType::vertex_descriptor v = *vertices(G).first; G[v].name = "TingChong"; ++v; G[v].name = "Carmen"; who_owes_who(edges(G).first, edges(G).second, G); } cout << endl; return 0; } Compiler output is: gcc-C++-action /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.test/gcc/debug/inlining-on/interior_property_map.o /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp: In function `void who_owes_who(EdgeIter, EdgeIter, const Graph&)': /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:59: error: type/value mismatch at argument 2 in template parameter list for `template<class Graph, class Property> struct boost::property_map' /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:59: error: expected a type, got `& vertexStruct::name' /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:59: error: `const_type' does not name a type /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:64: error: `NamePA' undeclared (first use this function) /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:64: error: (Each undeclared identifier is reported only once for each function it appears in.) /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:64: error: expected `;' before "name" /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:66: error: template argument 1 is invalid /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:66: error: `value_type' does not name a type /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:68: error: `NameType' undeclared (first use this function) /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:68: error: expected `;' before "src_name" /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:71: error: `src_name' undeclared (first use this function) /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:72: error: `targ_name' undeclared (first use this function) set -e "g++" -c -Wall -ftemplate-depth-255 -g -O0 -Wno-inline -I"../../../bin/boost/libs/graph/example" -I "/home/tcma/cpp/boost_1_32_0" -o "/home/tcma/cpp/boosttcma/libs/graph/interior_property_map.test/gcc/debug/inlining-on/interior_property_map.o" "/home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp" "/usr/bin/objcopy" --set-section-flags .debug_str=contents,debug "/home/tcma/cpp/boosttcma/libs/graph/interior_property_map.test/gcc/debug/inlining-on/interior_property_map.o" ...failed gcc-C++-action /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.test/gcc/debug/inlining-on/interior_property_map.o... ...skipped </home/tcma/cpp/boosttcma/libs/graph/interior_property_map.test/gcc/debug/inlining-on>/home/tcma/cpp/boosttcma/libs/graph/interior_property_map for lack of </home/tcma/cpp/boosttcma/libs/graph/interior_property_map.test/gcc/debug/inlining-on>interior_property_map.o... ...skipped </home/tcma/cpp/boosttcma/libs/graph/interior_property_map.test/gcc/debug/inlining-on>/home/tcma/cpp/boosttcma/libs/graph/interior_property_map.run for lack of </home/tcma/cpp/boosttcma/libs/graph/interior_property_map.test/gcc/debug/inlining-on>/home/tcma/cpp/boosttcma/libs/graph/interior_property_map... ...failed updating 1 target... ...skipped 3 targets... > Date: Wed, 24 Nov 2004 00:07:08 -0500 > From: Doug Gregor <dgregor(a)cs.indiana.edu> > Subject: Re: [Boost-users] newbie: Graph library - bundled properties > revisited > To: boost-users(a)lists.boost.org > Message-ID: <B11939FE-3DD6-11D9-9E73-000D932B7224(a)cs.indiana.edu> > Content-Type: text/plain; charset=US-ASCII; format=flowed > > On Nov 23, 2004, at 10:56 PM, TC MA wrote: > > // create a tag for our new property > > > > enum vertex_first_name_t { vertex_first_name }; > > namespace boost { > > BOOST_INSTALL_PROPERTY(vertex, first_name); > > } > > You won't actually need the part above this any more. > > > struct vertexStruct { > > string name; > > }; > > > > template <class EdgeIter, class Graph> > > void who_owes_who(EdgeIter first, EdgeIter last, const > > Graph& G) > > { > > // Access the propety acessor type for this graph > > typedef typename property_map<Graph, > > vertexStruct::name>::const_type NamePA; > > The compiler is actually giving a somewhat useful message here: add an > '&' before the vertexStruct::name to form a pointer-to-member. > > > NamePA name = get(vertex_first_name, G); > > Here again, you'll want to use a pointer-to-member, like this: > > NamePA name = get(&vertexStruct, G); > > > typedef typename > > boost::property_traits<NamePA>::value_type NameType; > > > > NameType src_name, targ_name; > > > > while (first != last) { > > src_name = boost::get(name, source(*first,G)); > > targ_name = boost::get(name, target(*first,G)); > > Now you can use the simpler: > > src_name = G[source(*first, G)].name; > targ_name = G[target(*first, G)].name; > > Once you've replaced the original get calls with these lines, you can > remove the definition of the "name" variable as well. > > Doug ===== TingChong Ma ______________________________________________________________________ Post your free ad now! http://personals.yahoo.ca

2 1

compiling 1_32 in release mode brings the computer to its knees (Modified by Yarden Livnat)
by Mail Delivery Subsystem 24 Nov '04

24 Nov '04

Hi, I'm trying to compile 1_32 on OSX with the latest gcc (GCC) 3.3 20030304 (Apple Computer, Inc. build 1666) however, while the debug version compile in just a few minutes, the 'release' start trashing on : libs/serialization/src/xml_grammar.cpp libs/serialization/src/xml_wgrammar.cpp in effect the compilation takes all the memory and then pages endlessly for hours, bringing the machine down to its knees. my compile command is: sudo bjam -sTOOLS=darwin "-sBUILD=release <threading>multi <define>BOOST_SIGNALS_NAMESPACE=Signals " install where the <define> is for Qt, Anybody has a clue why this is happaning and how to get the compilation to complete (other then copy the two .o from the debug tree into the release tree ? thanks Yarden

6 7

Re: Memory leak reported using threads library
by alansa＠ati-uk.com 24 Nov '04

24 Nov '04

Wkr wrote: >>I am working now on a project, which solution consists of 73 vc-projects (more >>than 2500 files) and it does not leak memory in its main loop, thanks to the >>debug crt of m$. We have overwritten the new and delete operator like m$ in >>MFC does so we get accurate memory leak reporting. If you take this business >>serious one can not allow any memory leak reported by the debug crt. Of course, malloc and new are not the only ways to consume memory. Virtual Memory, Memory Mapped files, COM memory allocation functions etc etc. And the leak can be in library code over which we have much less control (other than to not use it) and therefore weaker support for leak finding and detection. It turns out we don't have a leak anywhere in our code. If we don't use boost::thread then no leak, if we use boost::thread and use CRT dynamically rather then statically then no leak. Ben wrote: >>Multithreaded configurations of MSVCRT allocates some per-thread memory >>as needed, e.g. for the object that localtime returns a pointer to. To >>ensure that this memory is freed at thread exit, you must either use a >>DLL configuration of the CRT or ensure that all threads that call into >>it are started using the _beginthread or _beginthreadex function. The >>Boost.Thread DLL is not (and cannot be) linked to the same CRT that is >>statically linked into your executable, so neither of these conditions >>is satisfied. >>If I remember correctly, any memory allocated in your executable cannot >>be deallocated in the Boost.Thread DLL, or vice versa, since they have >>separate heaps. I would expect an attempt to do so to result in a >>crash, but it might in some cases be silently ignored, resulting in a leak. I have considered this and it still may be the answer or lead to an answer. Yes indeed they have separate heaps It may explain why the leak is steeper depending on what the function does. However I do remember had one experiment where i filled up a vector with a load of stuff and hey presto, no leak. if I have a function that allocates and deallocates memory on the heap and I use it as a thread using boost::thread, then when memory deallocations are performed by that thread is it the boost dll that is doing the deallocation or is it my exe? One would assume it was my exe since the deallocation code is in my exe. Surely there is no code in the threads dll to deallocate my memory. And I never ever get a crash, just a leak.

2 1

transform_iterator and lambda functors
by Rodrigo de Salvo Braz 24 Nov '04

24 Nov '04

Hello, I am trying to use transform_iterator with a lambda functor, but the compiler complains that the lambda functor does not contain a type called 'result_type', which the transform_iterator requires. I would have expected lambda functors to have this type. Any ideas on why it doesn't? Here is the code line causing the problem: return make_transform_iterator(attributes.begin(), bind(&pair<const AttributeType, string>::second, _1)); where attributes is of type map<AttributeType, string>. Here is the error message: /usr/local/include/boost-1_32/boost/iterator/transform_iterator.hpp:43: no type named `result_type' in `class boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::action<2, boost::lambda::function_action<2, boost::lambda::detail::unspecified> >, boost::tuples::tuple<std::string std::pair<const AttributeType, std::string>::*, const boost::lambda::lambda_functor<boost::lambda::placeholder<1> >, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type> > >' Thanks, Rodrigo

3 5

Regex linking woes.
by Jean Francois Poirier 24 Nov '04

24 Nov '04

Hello everyone; I have been wrestling with linking to boost::regex lib for some time now, and have looked everywhere to try and avoid posting a dumb question, but I still am getting no further. I am using MSVC 6 SP5, built boost with jam, with the following parameters: "-sTOOLS=msvc-stlport" "-sBUILD=debug <stlport-iostream>off <stlport-version>4.5.3 <runtime-link>dynamic" "-sSTLPORT_PATH={path}" Upon linking with the auto-link lib file, I MSVC complains as follows: PSRecord.obj : error LNK2001: unresolved external symbol "void __cdecl boost::re_detail::raise_regex_exception(class _STL::basic_string<char,struct std::char_traits<char>,class _STL::allocator<char> > const &)" (?raise_regex_exception@re_detail@boost@@YAXABV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@_STL@@@_STL@@@Z) [ other unresolved external messages snipped ] dumping libboost_regex-vc6-mt-gdpn-1_32.lib generated by jam, I find this: ?raise_regex_exception@re_detail@boost@@YAXABV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@@Z which is the closest to what VC wants (I am attempting to link to an application using the Multithreaded Debug DLL runtime). any ideas what I am missing? cheers, jeff poirier Software Designer / Servers Group, VertigoXMedia

2 1

newbie: Graph library - bundled properties revisited
by TC MA 24 Nov '04

24 Nov '04

I am trying to use the Boost Graph library bundled properties which is introduced in 1.32.0. I modify the sample program libs/graph/example/interior_property_map.cpp which then fail to compile. using namespace std; using namespace boost; using std::string; // create a tag for our new property enum vertex_first_name_t { vertex_first_name }; namespace boost { BOOST_INSTALL_PROPERTY(vertex, first_name); } struct vertexStruct { string name; }; template <class EdgeIter, class Graph> void who_owes_who(EdgeIter first, EdgeIter last, const Graph& G) { // Access the propety acessor type for this graph typedef typename property_map<Graph, vertexStruct::name>::const_type NamePA; NamePA name = get(vertex_first_name, G); typedef typename boost::property_traits<NamePA>::value_type NameType; NameType src_name, targ_name; while (first != last) { src_name = boost::get(name, source(*first,G)); targ_name = boost::get(name, target(*first,G)); cout << src_name << " owes " << targ_name << " some money" << endl; ++first; } } int main() { { // Create the graph, and specify that we will use std::string to // store the first name's. typedef adjacency_list<vecS, vecS, directedS, vertexStruct > MyGraphType; typedef pair<int,int> Pair; Pair edge_array[11] = { Pair(0,1), Pair(0,2), Pair(0,3), Pair(0,4), Pair(2,0), Pair(3,0), Pair(2,4), Pair(3,1), Pair(3,4), Pair(4,0), Pair(4,1) }; MyGraphType G(5); for (int i=0; i<11; ++i) add_edge(edge_array[i].first, edge_array[i].second, G); MyGraphType::vertex_descriptor v = *vertices(G).first; G[v].name = "TingChong"; ++v; G[v].name = "Carmen"; who_owes_who(edges(G).first, edges(G).second, G); } cout << endl; return 0; } // compile output is: $ bjam ...found 372 targets... ...updating 4 targets... gcc-C++-action /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.test/gcc/debug/inlining-on/interior_property_map.o /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp: In function `void who_owes_who(EdgeIter, EdgeIter, const Graph&)': /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:73: error: invalid use of non-static data member `vertexStruct::name' /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:80: error: from this location /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:80: error: `vertexStruct::name' cannot appear in a constant-expression /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:80: error: template argument 2 is invalid /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:80: error: `const_type' does not name a type /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:82: error: `NamePA' undeclared (first use this function) /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:82: error: (Each undeclared identifier is reported only once for each function it appears in.) /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:82: error: expected `;' before "name" /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:84: error: template argument 1 is invalid /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:84: error: `value_type' does not name a type /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:86: error: `NameType' undeclared (first use this function) /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:86: error: expected `;' before "src_name" /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:89: error: `src_name' undeclared (first use this function) /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:89: error: `name' undeclared (first use this function) /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp:90: error: `targ_name' undeclared (first use this function) set -e "g++" -c -Wall -ftemplate-depth-255 -g -O0 -Wno-inline -I"../../../bin/boost/libs/graph/example" -I "/home/tcma/cpp/boost_1_32_0" -o "/home/tcma/cpp/boosttcma/libs/graph/interior_property_map.test/gcc/debug/inlining-on/interior_property_map.o" "/home/tcma/cpp/boosttcma/libs/graph/interior_property_map.cpp" "/usr/bin/objcopy" --set-section-flags .debug_str=contents,debug "/home/tcma/cpp/boosttcma/libs/graph/interior_property_map.test/gcc/debug/inlining-on/interior_property_map.o" ...failed gcc-C++-action /home/tcma/cpp/boosttcma/libs/graph/interior_property_map.test/gcc/debug/inlining-on/interior_property_map.o... ...skipped </home/tcma/cpp/boosttcma/libs/graph/interior_property_map.test/gcc/debug/inlining-on>/home/tcma/cpp/boosttcma/libs/graph/interior_property_map for lack of </home/tcma/cpp/boosttcma/libs/graph/interior_property_map.test/gcc/debug/inlining-on>interior_property_map.o... ...skipped </home/tcma/cpp/boosttcma/libs/graph/interior_property_map.test/gcc/debug/inlining-on>/home/tcma/cpp/boosttcma/libs/graph/interior_property_map.run for lack of </home/tcma/cpp/boosttcma/libs/graph/interior_property_map.test/gcc/debug/inlining-on>/home/tcma/cpp/boosttcma/libs/graph/interior_property_map... ...failed updating 1 target... ...skipped 3 targets... ===== TingChong Ma ______________________________________________________________________ Post your free ad now! http://personals.yahoo.ca

2 1

Re: newbie: Graph library - bundled properties
by TC MA 24 Nov '04

24 Nov '04

After modifying it, still had some compile problems. using std::string; struct edgeStruct { int weight; }; struct graphStruct { string name; }; int main() { using namespace boost; typedef adjacency_list<vecS, vecS, directedS,no_property, edgeStruct, graphStruct> graph_t; graph_t g; graph_t::vertex_descriptor v = *vertices(g).first; graph_t::edge_descriptor e = *out_edges(v, g).first; g[e].weight = 1; g[e].name = "graphname"; std::cout << "name: " << g[e].name << std::endl; typedef subgraph<graph_t> subgraph_t; subgraph_t sg; get_property(sg, graph_name) = "subgraph"; std::cout << "name: " << get_property(sg, graph_name) << std::endl; return exit_success; } # compile output is: gcc-C++-action /home/tcma/cpp/boosttcma/libs/graph/graph_property.test/gcc/debug/inlining-on/graph_property.o /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp: In function `int main()': /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:32: error: 'struct edgeStruct' has no member named 'name' /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:34: error: 'struct edgeStruct' has no member named 'name' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp: At global scope: /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp: In instantiation of `boost::subgraph<main()::graph_t>': /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:39: instantiated from here /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:249: error: incomplete type `boost::STATIC_ASSERTION_FAILURE<0u>' used in nested name specifier /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:249: error: size of array has non-integral type `<type error>' /home/tcma/cpp/boost_1_32_0/boost/pending/detail/property.hpp: In instantiation of `boost::detail::build_property_tag_value_alist<graphStruct>': /home/tcma/cpp/boost_1_32_0/boost/pending/property.hpp:63: instantiated from `boost::property_value<graphStruct, boost::graph_name_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp:235: instantiated from `boost::graph_property<main()::graph_t, boost::graph_name_t>' /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:40: instantiated from here /home/tcma/cpp/boost_1_32_0/boost/pending/detail/property.hpp:94: error: no type named `next_type' in `struct graphStruct' /home/tcma/cpp/boost_1_32_0/boost/pending/detail/property.hpp:95: error: no type named `value_type' in `struct graphStruct' /home/tcma/cpp/boost_1_32_0/boost/pending/detail/property.hpp:96: error: no type named `tag_type' in `struct graphStruct' /home/tcma/cpp/boost_1_32_0/boost/pending/detail/property.hpp:97: error: no type named `next_type' in `struct graphStruct' /home/tcma/cpp/boost_1_32_0/boost/pending/detail/property.hpp:98: error: no type named `tag_type' in `struct graphStruct' /home/tcma/cpp/boost_1_32_0/boost/pending/property.hpp: In instantiation of `boost::property_value<graphStruct, boost::graph_name_t>': /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp:235: instantiated from `boost::graph_property<main()::graph_t, boost::graph_name_t>' /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:40: instantiated from here /home/tcma/cpp/boost_1_32_0/boost/pending/property.hpp:63: error: no type named `type' in `struct boost::detail::build_property_tag_value_alist<graphStruct>' /home/tcma/cpp/boost_1_32_0/boost/pending/property.hpp:64: error: no type named `type' in `struct boost::detail::build_property_tag_value_alist<graphStruct>' /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp: In instantiation of `boost::graph_property<main()::graph_t, boost::graph_name_t>': /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:40: instantiated from here /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp:235: error: no type named `type' in `struct boost::property_value<graphStruct, boost::graph_name_t>' /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp: In function `int main()': /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:40: error: no matching function for call to `get_property(main()::subgraph_t&, boost::graph_name_t)' /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:42: error: no matching function for call to `get_property(main()::subgraph_t&, boost::graph_name_t)' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp: In constructor `boost::subgraph<Graph>::subgraph() [with Graph = main()::graph_t]': /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:39: instantiated from here /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:106: error: no matching function for call to `boost::detail::error_property_not_found::error_property_not_found(int)' /home/tcma/cpp/boost_1_32_0/boost/pending/detail/property.hpp:21: note: candidates are: boost::detail::error_property_not_found::error_property_not_found() /home/tcma/cpp/boost_1_32_0/boost/pending/detail/property.hpp:21: note: boost::detail::error_property_not_found::error_property_not_found(const boost::detail::error_property_not_found&) set -e "g++" -c -Wall -ftemplate-depth-255 -g -O0 -Wno-inline -I"../../../bin/boost/libs/graph/example" -I "/home/tcma/cpp/boost_1_32_0" -o "/home/tcma/cpp/boosttcma/libs/graph/graph_property.test/gcc/debug/inlining-on/graph_property.o" "/home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp" "/usr/bin/objcopy" --set-section-flags .debug_str=contents,debug "/home/tcma/cpp/boosttcma/libs/graph/graph_property.test/gcc/debug/inlining-on/graph_property.o" ...failed gcc-C++-action /home/tcma/cpp/boosttcma/libs/graph/graph_property.test/gcc/debug/inlining-on/graph_property.o... ...skipped </home/tcma/cpp/boosttcma/libs/graph/graph_property.test/gcc/debug/inlining-on>/home/tcma/cpp/boosttcma/libs/graph/graph_property for lack of </home/tcma/cpp/boosttcma/libs/graph/graph_property.test/gcc/debug/inlining-on>graph_property.o... ...skipped </home/tcma/cpp/boosttcma/libs/graph/graph_property.test/gcc/debug/inlining-on>/home/tcma/cpp/boosttcma/libs/graph/graph_property.run for lack of </home/tcma/cpp/boosttcma/libs/graph/graph_property.test/gcc/debug/inlining-on>/home/tcma/cpp/boosttcma/libs/graph/graph_property... ...failed updating 1 target... ...skipped 3 targets... > Date: Mon, 22 Nov 2004 20:36:07 -0500 > From: Doug Gregor <dgregor(a)cs.indiana.edu> > Subject: Re: [Boost-users] newbie: Graph library - bundled properties > To: boost-users(a)lists.boost.org > Message-ID: <0BEF9B5F-3CF0-11D9-84DF-000D932B7224(a)cs.indiana.edu> > Content-Type: text/plain; charset=US-ASCII; format=flowed > > > On Nov 22, 2004, at 8:25 PM, TC MA wrote: > > int > > main() > > { > > using namespace boost; > > using std::string; > > Move this struct... > > > struct edgeStruct { > > int weight; > > }; > > outside of main, because of this error message: > > > /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:21: > > error: `main()::edgeStruct' uses local type > > `main()::edgeStruct' > > Doug ______________________________________________________________________ Post your free ad now! http://personals.yahoo.ca

3 7

Re: [Boost-users] Re: newbie: Graph library - bundled properties
by TC MA 24 Nov '04

24 Nov '04

Fixed compile error, but has run time error. Modified graph_property.cpp: int main() { using namespace boost; using std::string; typedef adjacency_list<vecS, vecS, directedS,no_property, property<edge_index_t, int>, property<graph_name_t, string> > graph_t; graph_t g; get_property(g, graph_name) = "graph"; std::cout << "name: " << get_property(g, graph_name) << std::endl; typedef subgraph<graph_t> subgraph_t; subgraph_t sg; get_property(sg, graph_name) = "subgraph"; std::cout << "name: " << get_property(sg, graph_name) << std::endl; return exit_success; } Output: $ bjam ...found 409 targets... ...updating 4 targets... gcc-C++-action /home/tcma/cpp/boosttcma/libs/graph/graph_property.test/gcc/debug/inlining-on/graph_property.o gcc-Link-action /home/tcma/cpp/boosttcma/libs/graph/graph_property Chmod1 /home/tcma/cpp/boosttcma/libs/graph/graph_property execute-test /home/tcma/cpp/boosttcma/libs/graph/graph_property.run ====== BEGIN OUTPUT ====== EXIT STATUS: 139 ====== END OUTPUT ====== /home/tcma/cpp/boosttcma/libs/graph/graph_property > /home/tcma/cpp/boosttcma/libs/graph/graph_property.output 2>&1 status=$? echo >> /home/tcma/cpp/boosttcma/libs/graph/graph_property.output echo EXIT STATUS: $status >> /home/tcma/cpp/boosttcma/libs/graph/graph_property.output if test $status -eq 0 ; then cp -f /home/tcma/cpp/boosttcma/libs/graph/graph_property.output /home/tcma/cpp/boosttcma/libs/graph/graph_property.run fi verbose=1 if test $status -ne 0 ; then verbose=0 fi if test $verbose -eq 0 ; then echo ====== BEGIN OUTPUT ====== cat /home/tcma/cpp/boosttcma/libs/graph/graph_property.output echo ====== END OUTPUT ====== fi exit $status ...failed execute-test /home/tcma/cpp/boosttcma/libs/graph/graph_property.run... ...removing /home/tcma/cpp/boosttcma/libs/graph/graph_property.run ...failed updating 1 target... ...skipped 1 target... ...updated 2 targets... $ cat graph_property.output EXIT STATUS: 139 The expected output should be: $ cat graph_property.output name: graph name: subgraph EXIT STATUS: 0 > On Nov 23, 2004, at 11:23 AM, TC MA wrote: > > struct graphStruct { > string name; > }; > > Unfortunately, bundled graph properties aren't supported (yet). You can, however, add a graph name property using property<graph_name_t, string> (see below). > > typedef adjacency_list<vecS, vecS, > directedS,no_property, edgeStruct, graphStruct> > graph_t; > > Change this to: > > typedef adjacency_list<vecS, vecS, directedS, no_property, edgeStruct, > property<graph_name_t, string> > graph_t; > > g[e].name = "graphname"; > > std::cout << "name: " << g[e].name << std::endl; > > These two won't compile because we can't get at the graph properties that way. "e" is an edge descriptor, so "g[e]" is going to give you an edgeStruct& back (that's how we were able to set the edge weight ). To get to the graph_name property we just added above, use: > > get_property(g, graph_name); > > If we can come up with a better syntax for the future, we'll definitely do it. For now, we're stuck with that mess. > > typedef subgraph<graph_t> subgraph_t; > > You're actually going to run into a minor problem here, because the subgraph adaptor requires an edge_index property that we haven't provided. The easiest way to introduce such a property is to actually mix bundled and non-bundled parameters, like so: > > typedef adjacency_list<vecS, vecS, directedS, no_property, property<edge_index_t, int, edgeStruct>, > property<graph_name_t, string> > graph_t; > > Notice how we put in the edge_index_t property, but ended with an "edgeStruct"? That allows, e.g., g[e].weight to still work, but the subgraph can use the edge index property map directly. > > subgraph_t sg; > get_property(sg, graph_name) = "subgraph"; > > std::cout << "name: " << get_property(sg, > graph_name) << std::endl; > > return exit_success; > } > > All of this is fine; it's actually what we changed the above code to. > > As you can probably tell, we're still working out some of the kinks in the bundled properties setup. It's better than what we had before, but we still have a bit of work to do to make it really slick. > > Doug ===== TingChong Ma ______________________________________________________________________ Post your free ad now! http://personals.yahoo.ca

1 0

tuple manipulators?
by Paul Elliott 24 Nov '04

24 Nov '04

Would it be possible to have certain obvious tuple manipulators? For example if A and B are 2 tuples have an easy way to form the cross product of the 2 tuples? That is if A is of length L, and B is of length M, to form the tuple C of length L+M, containing copies of the elements from both? Also if D is a tuple of length N, and f is a functor taking N arguments (of the right types) find some way to take f(D) == f(D.get(1),D.get(2),...,D.get(N) ) Of course the ... is pseudo code. Fill in the appropriate list. Of course I realize that limitations in the C++ language may prevent doing this for arbitrarily large L, M, or N. But it could be done for L, M, N, large enough so that it is not a practical limitation? -- 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

2 1

Re: Boost-users Digest, Vol 378, Issue 4
by Yarden Livnat 23 Nov '04

23 Nov '04

no, the problem persist in build 1671... :-( compiling with --without-serialization temporarily solve the problem though (if you can call it 'solving' :-) Yarden On Nov 23, 2004, at 2:02 PM, boost-users-request(a)lists.boost.org wrote: > > Message: 4 > Date: Tue, 23 Nov 2004 11:07:31 -0800 > From: Thomas Costa <oohrah(a)mac.com> > Subject: Re: [Boost-users] compiling 1_32 in release mode brings the > computer to its knees (Modified by Yarden Livnat) > To: boost-users(a)lists.boost.org > Message-ID: <ECC0A694-3D82-11D9-84B9-00039303FB26(a)mac.com> > Content-Type: text/plain; charset=US-ASCII; format=flowed > > Are these problems maybe fixed with Apple's updated gcc 3.3 build 1671 > that got posted to the Apple developer site recently? > > On Nov 23, 2004, at 10:19 AM, Chris Little wrote: > >> on 11/23/04 9:32 AM, Glen Simmons at gsimmons(a)macdev.itg.ti.com wrote: >> >>> On 23 Nov, 2004, at 12:17 AM, Mail Delivery Subsystem wrote: >>> >>>> >>>> Hi, >>>> >>>> I'm trying to compile 1_32 on OSX with the latest gcc (GCC) 3.3 >>>> 20030304 (Apple Computer, Inc. build 1666) >>>> however, while the debug version compile in just a few minutes, the >>>> 'release' start trashing on : >>>> libs/serialization/src/xml_grammar.cpp >>>> libs/serialization/src/xml_wgrammar.cpp >>>> >>>> in effect the compilation takes all the memory and then pages >>>> endlessly for hours, bringing the machine down to its knees. >>>> >>>> my compile command is: >>>> >>>> sudo bjam -sTOOLS=darwin "-sBUILD=release <threading>multi >>>> <define>BOOST_SIGNALS_NAMESPACE=Signals " install >>>> >>>> where the <define> is for Qt, >>>> >>>> >>>> Anybody has a clue why this is happaning and how to get the >>>> compilation to complete (other then copy the two .o from the debug >>>> tree into the release tree ? >>> >>> The same thing happened to me. Since I'm not using the serialization >>> library, I used the --without-serialization option. Not an ideal >>> solution, especially if you need the serialization lib, but a >>> workaround if you don't. >>> >>> HTH, >>> Glen Simmons >> >> On the main list Troy Straszheim post about this problem also. Troy >> found >> that it is a compiler bug. If you remove the -O flag from the build >> options >> then everything is fine. Troy filed a bug with Apple. >> >> Chris >> >> _______________________________________________ >> Boost-users mailing list >> Boost-users(a)lists.boost.org >> http://lists.boost.org/mailman/listinfo.cgi/boost-users > > >

1 0

Re: [Boost-users] IMPORTANT: yahoogroups admin rights problem
by Daniel L Elliott 23 Nov '04

23 Nov '04

Hello all, Where can I find the uBLAS license? What does rewrite uBLAS mean? Toon: Thank you for working on these issues! Thank you, dan elliott ------------------------------ Message: 6 Date: Tue, 23 Nov 2004 12:42:02 +0100 From: Toon Knapen <toon.knapen(a)fft.be> Subject: [Boost-users] IMPORTANT: yahoogroups admin rights problem To: ublas <ublas-dev(a)yahoogroups.com>, Michael Stevens <Michael.Stevens(a)epost.de>, boost-users(a)lists.boost.org, boost <boost(a)lists.boost.org> Message-ID: <41A3220A.7060104(a)fft.be> Content-Type: text/plain; charset=ISO-8859-1; format=flowed Hello ALL, As many of you might know, currently we are unable to add new members to the ublas-ml. The problem is that only Joerg has the rights to add members to the list but Joerg does not respond anymore. Could some of you try to contact Joerg or give me his telephone number that I talk to him about this. If we do not have a solution by end of November I will create a new project on yahoogroups (and we all have to switch). Additionally we need to contact Joerg and Mathias (again!) about applying the Boost Software License. I currently have the impression that they are not willing to change ublas to the BSL. In that case IMO, we will have to rewrite uBLAS to not get thrown out of boost. Again his phone-number would be handy if you have it available. Please contact the ml or me asap about the above issues or we will need to take drastic actions. toon ------------------------------

2 1

Re: [Boost-users] Gregorian 1.32 still has VC71 warnings like 1.31
by jkharris7＠comcast.net 23 Nov '04

23 Nov '04

> most of the warnings have been L4, but unless I'm mis-reading you are set to > L3? Also, are you sure all of these were in 1.31 -- there were changes in Yes, it's set to Level 3, and no--you're right to point it out--I'm not sure whether the warnings are exactly the same as in 1.29. They were the same code (4244), because I ended up using the same suppression pragma. Everything is a plain vanilla VC71 setup, generated from the wizard, except with "Detect 64-bit Portability Issues" set to FALSE, and I tested using no other headers, just to be sure. jh

1 0

Using program_options with other options methods
by Allen Bierbaum 23 Nov '04

23 Nov '04

I have recently started using the program_options library, and I find it very useful. Unfortunately I can't seem to figure out how to allow it to work with other option parsers/handlers at the same time. For example, right now I am writing an application that uses a library that has its own set of common options that are process internally. So I end up needing to write code similar to the following: po::options_description desc("Allowed options"); desc.add_options() ("help", "produce help message") ("my_opt", po::value<int>(), "set my option") ; po::variables_map vm; po::store(po::parse_command_line(ac, av, desc), vm); po::notify(vm); custom_lib::options opts; opts.process(ac, av); Then when I run this application: ./app --my_opt=10 --liboption=custom The problem is that I get an exception from program_options: error: unknown option --liboption Is there any way to tell the program options parser to ignore options that it does not recognize? If there is no option like this, how can program_options be used with other option parsers? -Allen

1 0

Gregorian 1.32 still has VC71 warnings like 1.31
by jkharris7＠comcast.net 23 Nov '04

23 Nov '04

Do I have some incorrect options here? I would've thought these would go away, but they were the same in 1.31. I can't find others reporting the same warnings. With this at the beginning of my source: #include <boost/date_time/gregorian/gregorian.hpp> #include <boost/date_time/posix_time/posix_time.hpp> #include <boost/date_time/date_generators.hpp> ...on VC71, boost 1.32 with all defaults during build of boost, with these compiler options: /Od /I "..\..\..\Vendor\Boost\1_32_0\include\boost-1_32" /I "..\..\..\Vendor\ace\5_4\dev" /I "..\..\..\Vendor\Apache\Xerces_C\2_6_0\dev" /I "..\\" /D "WIN32" /D "_DEBUG" /D "_LIB" /D "_MBCS" /Gm /EHsc /RTC1 /MDd /GS /Fo"Debug/" /Fd"c:\my_lib\/lib/my_libD.pdb" /W3 /c /Zi /TP .\MyFile.cpp ...and getting these warnings: ..\..\..\vendor\boost\1_32_0\include\boost-1_32\boost\date_time\time_system_coun ted.hpp(57) : warning C4244: 'initializing' : conversion from 'boost::date_time::counted_time_rep<config>::int_type' to 'boost::date_time::gregorian_calendar_base<ymd_type_,date_int_type_>::date_int_t ype', possible loss of data with [ config=boost::posix_time::millisec_posix_time_system_config ] and [ ymd_type_=boost::gregorian::greg_year_month_day, date_int_type_=boost::date_time::int_adapter<unsigned long>::int_type ] ..\..\..\vendor\boost\1_32_0\include\boost-1_32\boost\date_time\time_system_coun ted.hpp( 52) : while compiling class-template member function 'boost::date_time::counted_time_rep<config>::date_type boost::date_time::counted_time_rep<config>::date(void) const' with [ config=boost::posix_time::millisec_posix_time_system_config ] ..\..\..\vendor\boost\1_32_0\include\boost-1_32\boost\date_time\time_system_coun ted.hpp( 111) : see reference to class template instantiation 'boost::date_time::counted_time_rep<config>' being compiled with [ config=boost::posix_time::millisec_posix_time_system_config ] ..\..\..\vendor\boost\1_32_0\include\boost-1_32\boost\date_time\time.hpp(52) : see reference to class template instantiation 'boost::date_time::counted_time_system<time_rep>' being compiled with [ time_rep=boost::posix_time::int64_time_rep ] ..\..\..\vendor\boost\1_32_0\include\boost-1_32\boost\date_time\posix_time\ptime .hpp(32) : see reference to class template instantiation 'boost::date_time::base_time<T,time_system>' being compiled with [ T=boost::posix_time::ptime, time_system=boost::posix_time::posix_time_system ] ..\..\..\vendor\boost\1_32_0\include\boost-1_32\boost\date_time\date_parsing.hpp (211) : warning C4244: 'argument' : conversion from 'std::allocator<_Ty>::value_type' to 'char', possible loss of data with [ _Ty=wchar_t ] ..\..\..\vendor\boost\1_32_0\include\boost-1_32\boost\date_time\date_parsing.hpp (253) : see reference to function template instantiation 'date_type boost::date_time::from_stream_type<date_type,std::basic_string<_Elem,_Traits,_Ax >::iterator>( iterator_type &,iterator_type &,wchar_t)' being compiled with [ date_type=boost::gregorian::date, _Elem=wchar_t, _Traits=std::char_traits<wchar_t>, _Ax=std::allocator<wchar_t>, iterator_type=std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator < wchar_t>>::iterator ] ..\..\..\vendor\boost\1_32_0\include\boost-1_32\boost\date_time\gregorian\parser s.hpp(78) : see reference to function template instantiation 'boost::date_time::period<point_rep,duration_rep> boost::date_time::from_simple_string_type<boost::gregorian::date,wchar_t>(const std::basic_string<_Elem,_Traits,_Ax> &)' being compiled with [ point_rep=boost::gregorian::date, duration_rep=boost::gregorian::date_duration, _Elem=wchar_t, _Traits=std::char_traits<wchar_t>, _Ax=std::allocator<wchar_t> ]

2 1

IMPORTANT: yahoogroups admin rights problem
by Toon Knapen 23 Nov '04

23 Nov '04

Hello ALL, As many of you might know, currently we are unable to add new members to the ublas-ml. The problem is that only Joerg has the rights to add members to the list but Joerg does not respond anymore. Could some of you try to contact Joerg or give me his telephone number that I talk to him about this. If we do not have a solution by end of November I will create a new project on yahoogroups (and we all have to switch). Additionally we need to contact Joerg and Mathias (again!) about applying the Boost Software License. I currently have the impression that they are not willing to change ublas to the BSL. In that case IMO, we will have to rewrite uBLAS to not get thrown out of boost. Again his phone-number would be handy if you have it available. Please contact the ml or me asap about the above issues or we will need to take drastic actions. toon

1 0

Memory leak reported using threads library
by gast128 23 Nov '04

23 Nov '04

Dear all, Downloading and using the 1.32 version was probably not such a good idea... Now I get a mem-leak reported by the debug crt of VC 7.1. The report is located in 'init_threadmon_mutex' where a global object is allocated but never deleted. Before we start a discussion of what is a memory leak or not, in our production code we do not accept any leak reported by VC. The past has learned us that if you accept one leak, programmers/colleaques start to ignore them and in the end you have 200 leaks, instead of this one. I guess it wouldn't be difficult to resolve this one, on process exit it can be deallocated. And yes I am aware of the (phoenix) singleton discussions in Alexandrescu/Meyers, but really this kind of reinit of singletons after atexit calls won't happen too much. Wkr, me

3 4

boost 1.32 - uBlas - bug in symmetric_matrix::resize()
by Thomas Lemaire 23 Nov '04

23 Nov '04

When resizing a symmetric matrix with the preserve tag to "true", I got: before P: [6,6]((0,0,0,0,0,0),(0,0,0,0,0,0),(0,0,0,0,0,0),(0,0,0,0,0,0),(0,0,0,0,0,0),(0,0,0,0,0,0)) after P: [9,9]((5.54836e-321,-NaN,7.57149e-96,7.57149e-96,7.57149e-96,0,3.06321e-322,0,0),(-NaN,5.75348e+140,4.10451e-115,7.56598e-96,4.10451e-115,0,1.92686e-322,0,0),(7.57149e-96,4.10451e-115,7.57149e-96,7.57149e-96,7.57149e-96,3.31031e-311,6.57819e-313,0,0),(7.57149e-96,7.56598e-96,7.57149e-96,2.34163e-110,0,1.10492e-317,0,3.07265e-311,0),(7.57149e-96,4.10451e-115,7.57149e-96,0,0,5.00601e-308,0,1.10498e-317,0),(0,0,3.31031e-311,1.10492e-317,5.00601e-308,4.99745e-308,0,5.00601e-308,0),(3.06321e-322,1.92686e-322,6.57819e-313,0,0,0,0,4.99745e-308,0),(0,0,0,3.07265e-311,1.10498e-317,5.00601e-308,4.99745e-308,3.06321e-322,0),(0,0,0,0,0,0,0,0,0)) Notice the NaN and others strange things... I am using solaris 9 with gcc 3.3.3 -- thomas

1 0

difference between .output and .run files
by TC MA 23 Nov '04

23 Nov '04

After bjam is executed, both .output and .run files are executed. However, they are the same in content. Why not just use one file, why need both .output and .run files? ______________________________________________________________________ Post your free ad now! http://personals.yahoo.ca

2 1

dijkstra_shortest_paths performance problem
by Gustavo Sÿffffe1nchez 23 Nov '04

23 Nov '04

Hello, all We are doing a algorithm based on the graph boost library. Actually, it will be a Dinamic Link Library(dll). Our problem is when we execute it in console mode, it costs 12 seconds to finish, while it costs 120 seconds more or less when we are calling it as a DLL from Visual Basic. We have traced into the source code and found that is the dijkstra_shortest_paths function from the boost library which costs us 10 times more in the dll than the console mode. We call the dijkstra_shortest_paths like this: dijkstra_shortest_paths(g,s,predecessor_map(&p[0]).distance_map(&d[0]). visitor(make_dijkstra_visitor(_buscaVia(g,on_finish_vertex(),vinfo,edge_comp,via,p) ))); ///////below is the codes for visitor template <class Graph, class Tag> struct buscaVia : public boost::base_visitor<buscaVia<Graph, Tag> > { typedef Tag event_filter; buscaVia(typename property_map<Graph, vertex_info_t>::type & vinfo_, property_map<UGraph, edge_component_t>::type & ecomp,Vertex & _via,vector<Vertex> &p) :vinfo(vinfo_),encontrada(false),_ecomp(ecomp),via(_via),_p(p){} template <class Vertex, class Graph> void operator() (Vertex v, Graph& g){ bool hay_comp=false; Vertex a=v; if( vinfo[v].is_via && ! encontrada ){ while(_p[a]!=a){// mientras no hayamos llegado al origen if( _ecomp[edge(a,_p[a],g).first]->isComponentCaerTension() ){hay_comp=true; break;} else a=_p[a]; //pasamos al anterior } if(hay_comp==false){ // encontramos la via de la bobina DEBUG_CODE(cout << " via encontrada: " << vinfo[v].vertex_name << endl;) via = v; encontrada=true; } } DEBUG_CODE(else cout << "pasamos por vertice: " << vinfo[v].vertex_name << endl;) } private: typename property_map<Graph, vertex_info_t>::type & vinfo; property_map<UGraph, edge_component_t>::type & _ecomp; bool encontrada; Vertex & via; vector<Vertex> &_p; }; template<class Graph, class Tag> inline buscaVia<Graph,Tag> _buscaVia(Graph &g, Tag,typename property_map<Graph, vertex_info_t>::type & vinfo, property_map<UGraph, edge_component_t>::type & ecomp, Vertex & _via, vector<Vertex> &p){ return buscaVia<Graph,Tag>(vinfo,ecomp,_via,p); } ///////end of codes for visitor We appreciate your kind help! Yang ---------------------------------

2 1

Boost Documentation build
by Robert Ramey 23 Nov '04

23 Nov '04

I've updated my local boost directory from cvs. The links to library documentation generated by boost book documentaition don't work. I would to download the latest (missing) pages on to my local directory. How do I do this - where do I find the missing pages. Robert Ramey

1 0

newbie: Graph library - bundled properties
by TC MA 23 Nov '04

23 Nov '04

I try to use the Boost Graph library bundled properties which is introduced in 1.32.0. I modify the sample program libs/graph/example/graph_property.cpp which then fail to compile, I don't know enough about bundled properties to fix it. Please help. Thanks. I use gcc version 3.4.2 (Gentoo Linux 3.4.2-r2, ssp-3.4.1-1, pie-8.7.6.5). graph_property.cpp source code is: int main() { using namespace boost; using std::string; struct edgeStruct { int weight; }; typedef adjacency_list<vecS, vecS, directedS,no_property, edgeStruct, property<graph_name_t, string> > graph_t; graph_t g; get_property(g, graph_name) = "graph"; graph_t::vertex_descriptor v = *vertices(graph_t).first; graph_t::edge_descriptor e = *out_edges(v, graph_t).first; g[e].weight = 1; std::cout << "name: " << get_property(g, graph_name) << std::endl; typedef subgraph<graph_t> subgraph_t; subgraph_t sg; get_property(sg, graph_name) = "subgraph"; std::cout << "name: " << get_property(sg, graph_name) << std::endl; return exit_success; } //compile output is: gcc-C++-action /home/tcma/cpp/boosttcma/libs/graph/graph_property.test/gcc/debug/inlining-on/graph_property.o /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp: In function `int main()': /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:21: error: `main()::edgeStruct' uses local type `main()::edgeStruct' /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:21: error: trying to instantiate `template<class OutEdgeListS, class VertexListS, class DirectedS, class VertexProperty, class EdgeProperty, class GraphProperty, class EdgeListS> class boost::adjacency_list' /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:21: error: ISO C++ forbids declaration of `graph_t' with no type /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:24: error: no matching function for call to `get_property(main::graph_t&, boost::graph_name_t)' /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:25: error: `graph_t' is not a class or namespace /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:25: error: `vertex_descriptor' undeclared (first use this function) /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:25: error: (Each undeclared identifier is reported only once for each function it appears in.) /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:25: error: expected `;' before "v" /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:26: error: `graph_t' is not a class or namespace /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:26: error: `edge_descriptor' undeclared (first use this function) /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:26: error: expected `;' before "e" /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:27: error: `e' undeclared (first use this function) /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:29: error: no matching function for call to `get_property(main::graph_t&, boost::graph_name_t)' /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp: At global scope: /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp: In instantiation of `boost::graph_traits<main::graph_t>': /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:66: instantiated from `boost::subgraph<main::graph_t>' /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:33: instantiated from here /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp:41: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp:42: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp:43: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp:44: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp:45: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp:46: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp:47: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp:49: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp:50: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp:51: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp:53: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp:54: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp:55: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/graph_traits.hpp:63: error: no type named `vertex_descriptor' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp: In instantiation of `boost::subgraph<main::graph_t>': /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:33: instantiated from here /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:66: error: no type named `vertex_descriptor' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:67: error: no type named `edge_descriptor' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:68: error: no type named `directed_category' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:69: error: no type named `edge_parallel_category' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:70: error: no type named `traversal_category' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:73: error: no type named `vertex_descriptor' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:79: error: no type named `out_edge_iterator' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:80: error: no type named `degree_size_type' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:83: error: no type named `adjacency_iterator' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:86: error: no type named `vertex_iterator' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:87: error: no type named `vertices_size_type' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:90: error: no type named `edge_iterator' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:91: error: no type named `edges_size_type' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:93: error: no type named `in_edge_iterator' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:95: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:96: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:99: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:108: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:112: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:162: error: no type named `vertex_descriptor' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:166: error: no type named `vertex_descriptor' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:173: error: no type named `edge_descriptor' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:177: error: no type named `edge_descriptor' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:186: error: no type named `vertex_descriptor' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp: In instantiation of `boost::detail::edge_property_map<main::graph_t, boost::edge_index_t>': /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp:219: instantiated from `boost::property_map<main::graph_t, boost::edge_index_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:247: instantiated from `boost::subgraph<main::graph_t>' /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:33: instantiated from here /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp:160: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp:161: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp:162: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp:164: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp:164: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp:165: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp:165: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp:166: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp:166: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp: In instantiation of `boost::property_map<main::graph_t, boost::edge_index_t>': /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:247: instantiated from `boost::subgraph<main::graph_t>' /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:33: instantiated from here /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp:219: error: no type named `type' in `struct boost::detail::edge_property_map<main::graph_t, boost::edge_index_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp:220: error: no type named `const_type' in `struct boost::detail::edge_property_map<main::graph_t, boost::edge_index_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp: In instantiation of `boost::subgraph<main::graph_t>': /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:33: instantiated from here /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:247: error: no type named `type' in `struct boost::property_map<main::graph_t, boost::edge_index_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:248: error: no type named `type' in `struct boost::property_map<main::graph_t, boost::edge_index_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:249: error: no type named `type' in `struct boost::property_map<main::graph_t, boost::edge_index_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:249: error: `value' is not a member of `<declaration error>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:249: error: `value' is not a member of `<declaration error>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:249: error: size of array has non-integral type `<type error>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:254: error: no type named `type' in `struct boost::property_map<main::graph_t, boost::edge_index_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:256: error: no type named `vertex_descriptor' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:257: error: no type named `vertex_descriptor' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:258: error: no type named `edge_descriptor' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:259: error: no type named `type' in `struct boost::property_map<main::graph_t, boost::edge_index_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:264: error: no type named `edge_descriptor' in `struct boost::graph_traits<main::graph_t>' /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp: In instantiation of `boost::graph_property<main::graph_t, boost::graph_name_t>': /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:34: instantiated from here /home/tcma/cpp/boost_1_32_0/boost/graph/properties.hpp:235: error: `main::graph_t' is not a class, struct, or union type /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp: In function `int main()': /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:34: error: no matching function for call to `get_property(main()::subgraph_t&, boost::graph_name_t)' /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:36: error: no matching function for call to `get_property(main()::subgraph_t&, boost::graph_name_t)' /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp: In constructor `boost::subgraph<Graph>::subgraph() [with Graph = main::graph_t]': /home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp:33: instantiated from here /home/tcma/cpp/boost_1_32_0/boost/graph/subgraph.hpp:106: error: unnamed initializer for `boost::subgraph<main::graph_t>', which has no base classes set -e "g++" -c -Wall -ftemplate-depth-255 -g -O0 -Wno-inline -I"../../../bin/boost/libs/graph/example" -I "/home/tcma/cpp/boost_1_32_0" -o "/home/tcma/cpp/boosttcma/libs/graph/graph_property.test/gcc/debug/inlining-on/graph_property.o" "/home/tcma/cpp/boosttcma/libs/graph/graph_property.cpp" "/usr/bin/objcopy" --set-section-flags .debug_str=contents,debug "/home/tcma/cpp/boosttcma/libs/graph/graph_property.test/gcc/debug/inlining-on/graph_property.o" ...failed gcc-C++-action /home/tcma/cpp/boosttcma/libs/graph/graph_property.test/gcc/debug/inlining-on/graph_property.o... ...skipped </home/tcma/cpp/boosttcma/libs/graph/graph_property.test/gcc/debug/inlining-on>/home/tcma/cpp/boosttcma/libs/graph/graph_property for lack of </home/tcma/cpp/boosttcma/libs/graph/graph_property.test/gcc/debug/inlining-on>graph_property.o... ...skipped </home/tcma/cpp/boosttcma/libs/graph/graph_property.test/gcc/debug/inlining-on>/home/tcma/cpp/boosttcma/libs/graph/graph_property.run for lack of </home/tcma/cpp/boosttcma/libs/graph/graph_property.test/gcc/debug/inlining-on>/home/tcma/cpp/boosttcma/libs/graph/graph_property... ...failed updating 1 target... ...skipped 3 targets... ______________________________________________________________________ Post your free ad now! http://personals.yahoo.ca

2 1

Re: [sigc] Re: [Boost-users] Signals & Slots
by Edward Diener 22 Nov '04

22 Nov '04

Carl Nygard wrote: > On Thu, 2004-11-18 at 14:09, Doug Gregor wrote: >> On Nov 18, 2004, at 1:10 PM, Murray Cumming wrote: > >> I'm not in a position to do this at the moment, although possibly in >> the future. It would be *wonderful* if someone went off and studied >> both libraries in-depth to make this comparison, especially if that >> person was not intimately familiar with either library beforehand. >> > > Available: http://www.3sinc.com/opensource/boost.bind-vs-sigc2.html > > Updates for code samples from Chris Vine and Jonathan Brandmeyer will > be forthcoming. > > I could use some suggestions on how to incorporate common code into > the code comparison tables. > > And of course, any other comments, flames, etc. will be welcome. I'm > only doing this as a service for keeping track of comments. I'd like > to see some of this stuff make it into the C++ standard library. As of the upcoming release, the Boost signals library does make a guarantee of the order of signals within a particular group. The order within a particular group is FIFO.

4 4

(no subject)
by alansa＠ati-uk.com 22 Nov '04

22 Nov '04

>> Hmmm no linker errors or warnings. I've set my main exe to statically >> link. if i use the version of threads that statically links to >> msvcrt71 or dynamically to msvcrt71.dll it doesn't seem to make any >> difference. Our boost libraries where compiled here for msvcrt71 and i >> can confirm this. >> >> As i say if my main exe uses msvcrt71.dll then theres no leak. >Are you using tls code? >TLS currently (as to my knowledge) contains a "intentional" leak which >however is harmless. >Could you post the messages? >Did you track down the leak? Hi Roland In order to clear random influences from other areas of the software i'm working on, I have created a simple program with the code that i listed before. nothing else, no tls code. The intentinal leak would be harmless if it did not keep increasing. If I let the program run for long enough i will run out of memory. Sorry which messages would you like me to post? Haven't tracked down the leak yet. My problem is solved for the time being by using msvcrt71.dll as i said before. However it would be nice to be able to using the static lib. I replace the code in the loop which constantly starts and stop threads with my own code that did the same thing. This code was pretty much the same as the code for boost::thread using the windows api functions. This did not leak. However the big difference between my code and boost::thread is that my code didn't use boost::function. Therefore I suspect the leak could be in there! Looking at function it certainly isn't as trivial as thread. One thing i have noticed is that there is an option to get function to use "new" instead of std::allocator with the macro BOOST_NO_STD_ALLOCATOR. (function_template.hpp). I haven't got round to trying this yet though. Alan

1 0

Re: Re: FW: Leak when using boost threads under VC .NET using usi ng statically linked CRT
by alansa＠ati-uk.com 22 Nov '04

22 Nov '04

>> The interesting part is that it doesn't leak if use the version of threads >> built using the CRT as a .dll rather than static link. I also believe that >> the actual culprit is somewhere in boost.function since the code for >> boost.thread is so straight forward. >This sounds more like a mismatch between the runtime libraries that >Boost was compiled for (MSVCRT.DLL I'm pretty sure) and the one you're >linking with. Do you get a linker error indicating that there are >conflicting libraries? Hmmm no linker errors or warnings. I've set my main exe to statically link. if i use the version of threads that statically links to msvcrt71 or dynamically to msvcrt71.dll it doesn't seem to make any difference. Our boost libraries where compiled here for msvcrt71 and i can confirm this. As i say if my main exe uses msvcrt71.dll then theres no leak.

2 1

boost 1.32 breaks my code 2
by gast 128 22 Nov '04

22 Nov '04

Ok I have an example, int f(int, int); struct X { int m_i; }; X x; int i = boost::bind(&f, 1, _1)(boost::bind(&KTstbX::m_i, _1)(x)); UNREF(i); I guess the new boost does not return ref for members (in react on a previous email). Be aware however that functions them selves can still return references. Wkr, me _________________________________________________________________ Talk with your online friends with MSN Messenger http://messenger.msn.nl/

3 2

hello world with codewarrior
by jwjang 22 Nov '04

22 Nov '04

Hi all, I've just installed the boost library on my windows machine. I was using bjam with codewarrior compiler (mwcc) to build those libraries. After installation of libraries, I tried to run a "hello world" program with the same IDE (metrowerks codewarrior) but I couldn't make that work. The example I used is C:\boost_1_31_0\libs\graph\example\adjacency_list.cpp and I got a lot of error messages like below ... Error : undefined identifier 'std::size_t' (included from: cwchar:8 localeimp:18 istream:147 niostream:17 iostream:33 hello.cpp:12) wchar.h line 25 using std::size_t; I actually have no idea what this means. Please help me if anyone know anything about this. Thank you so much. jay

4 4

[Review] Named Parameters library (ongoing)
by Doug Gregor 22 Nov '04

22 Nov '04

Today is the last day of the review of the Named Parameters library by David Abrahams and Daniel Wallin. Let's hear some more comments! The original announcement follows: The Named Parameters library provides a framework for writing functions that can accept arguments by name or by position. The use of named parameters can improve the readability of calls to these functions, especially when the functions have many parameters with default values. The Named Parameters library allows one to write a new_window function that allows a call such as: window* w = new_window("alert2", movable = true); The library is available in the Boost sandbox here: boost/named_params.hpp libs/utility And in the files area (login required): http://groups.yahoo.com/group/boost/files/named_params.zip Reviewers may wish to compare this solution to the named parameters already used by the Boost Graph Library, documented here: http://www.boost.org/libs/graph/doc/bgl_named_params.html Please send your reviews either to the Boost list or to me personally. The former is preferred, because it allows the community to consider your review as well. When writing your review, you may wish to consider the following questions (from http://www.boost.org/more/formal_review_process.htm#Comments) - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? As always, please remember to clearly state whether you believe the library should be accepted into Boost. Thank you Doug Gregor Review Manager, Named Parameters library

1 0

Re: [sigc] Re: [Boost-users] Signals & Slots
by Peter Dimov 22 Nov '04

22 Nov '04

Carl Nygard wrote: > On Thu, 2004-11-18 at 14:09, Doug Gregor wrote: > >> I'm not in a position to do this at the moment, although possibly in >> the future. It would be *wonderful* if someone went off and studied >> both libraries in-depth to make this comparison, especially if that >> person was not intimately familiar with either library beforehand. >> > > Available: http://www.3sinc.com/opensource/boost.bind-vs-sigc2.html > > Updates for code samples from Chris Vine and Jonathan Brandmeyer will > be forthcoming. > > I could use some suggestions on how to incorporate common code into > the code comparison tables. > > And of course, any other comments, flames, etc. will be welcome. I'm > only doing this as a service for keeping track of comments. I'd like > to see some of this stuff make it into the C++ standard library. About: [-ed I'd love this, as long as I didn't have to use all of Boost to get it]. in reference to Boost.Bind. You don't need all of Boost. boost::bind is reasonably self-contained. I see that a dependency on mpl::bool_ has crept up in boost/ref.hpp, but Bind does not need it, so it's excisable without much effort. "Soon" (in a few years, once TR1 is implemented across the board) we'll hopefully be able to get 'bind' and 'function' by just including <functional>. This will also help Boost.Signals a bit since I suspect that nowadays most of the preprocessed code comes from boost::function.

2 3

Re: [sigc] Re: [Boost-users] Signals & Slots
by Doug Gregor 22 Nov '04

22 Nov '04

On Nov 21, 2004, at 8:09 PM, Carl Nygard wrote: > On Sun, 2004-11-21 at 14:26, Murray Cumming wrote: >> On Sat, 2004-11-20 at 15:58 -0500, Carl Nygard wrote: >>>> 2. libsigc++2 uses sigc::signal<>, not sigc::signal[1/2/3/4/5]<>. >>> >>> Yup, and Boost.Signal has signal<void (float, string)> notation as >>> well. I was trying to keep the examples as identical as possible to >>> show commonalities, but I'll make a note. >> >> The API here seems to be different, so it would be useful to show >> that. >> >> I don't think anybody is interested in using some secondary API >> (probably semi-internal API) just because that API is similar in both >> libsigc++ and Boost.Signal. > > Sorry, I thought the reason for the comparisons was as a first step for > C++ standard library, so I figured the analysis should concentrate on > underlying implementation instead of syntactic conveniences... although > those conveniences go a long way toward making the library usable. > I'll > update the docs... > > Regards, > Carl We should compare the "best" interfaces of both libraries, because we want to have the best interface to present to the C++ committee. For Boost.Signals, that's the "boost::signal<void(float x, string s)>" interface. As for the interface vs. implementation question... the C++ committee is interested in interfaces and their semantic descriptions, only. Having an implementation is important to validate the interface (having two implementations is, of course, much better!), but implementation details need not be discussed. They do come into play when we talk about the best semantics we can get... for instance, whether disconnecting a slot is O(1) or O(lg n), etc. Doug

1 0

boost mutex locking order
by amiel montecillo 22 Nov '04

22 Nov '04

Hi all, i was supposed to use boost::mutex in my multithreaded app, and came across a problem with its scheduling policy. if more than one thread is going to use the mutex object, how can we implement the FIFO scheduling policy? i need it so that other threads waiting for the mutex to be unlocked can acquire it in order in which they waited on the mutex that is accessed through boost::mutex::scoped_lock.

1 0

boost::variant output a vector?
by Bo Peng 21 Nov '04

21 Nov '04

Dear list, In the manual of boost::variant: OutputStreamable: For any object t of type T, std::cout << t must be a valid expression. However, I can not output a variant vector work by defining ostream& operator<< vector<double> . Attached is a test case. Note that variant int, string can be outputed, but not the vector. Yet, cout << vector<double> is working. I am using gcc 3.2.2 on linux redhat 9. Many thanks in advance. Bo #include "boost/variant.hpp" using namespace std; #include <string> #include <vector> typedef boost::variant<int, double, string, vector<double> > Variable; #include <iostream> ostream& operator<< (ostream& out, const vector<double> & vec) { out<< "["; if( ! vec.empty() ) { vector<double>::const_iterator it = vec.begin(); out << *it; for( ++it; it!= vec.end(); ++it) out << ", " << *it ; } out << "]"; return out; } int main() { Variable a(2); Variable b("asd"); vector<double> vec(0); vec.push_back(3.0); Variable c(vec); cout << vec << endl; // OK cout << a << b << endl; // OK cout << c << endl; // compiling errors. return 0; }

2 1

serialization example linker errors.
by Jeffrey Holle 21 Nov '04

21 Nov '04

My boost libaries come from CVS on Sun Nov 14 18:35:14 EST 2004 I'm building with gcc v3.4.2 on a linux system. I've run into a problem in attempting to build the serialization examples. All failed in link phase with: /usr/bin/ld: cannot find -lm

1 1

Luabind and Boost 1.32.0
by Jeremy Swigart 21 Nov '04

21 Nov '04

Just grabbed the latest version and attempted to compile a previously working setup of Luabind and I get the following error. \luabind\class.hpp(105) : fatal error C1083: Cannot open include file: 'boost/mpl/apply_if.hpp': No such file or directory Apparently this file was removed in boost 1.32 Anyone know how to get luabind back to a working state? Thanks. Jeremy

2 1

Re: [sigc] Re: [Boost-users] Signals & Slots
by Edward Diener 20 Nov '04

20 Nov '04

Carl Nygard wrote: > On Thu, 2004-11-18 at 14:09, Doug Gregor wrote: >> On Nov 18, 2004, at 1:10 PM, Murray Cumming wrote: > >> I'm not in a position to do this at the moment, although possibly in >> the future. It would be *wonderful* if someone went off and studied >> both libraries in-depth to make this comparison, especially if that >> person was not intimately familiar with either library beforehand. >> > > Available: http://www.3sinc.com/opensource/boost.bind-vs-sigc2.html > > Updates for code samples from Chris Vine and Jonathan Brandmeyer will > be forthcoming. > > I could use some suggestions on how to incorporate common code into > the code comparison tables. > > And of course, any other comments, flames, etc. will be welcome. I'm > only doing this as a service for keeping track of comments. I'd like > to see some of this stuff make it into the C++ standard library. In the just-released Boost 1.32, the Boost signals library does make a guarantee of the order of signals within a particular group. The order within a particular group is FIFO.

1 0

Re: [sigc] Re: [Boost-users] Signals & Slots
by David Abrahams 20 Nov '04

20 Nov '04

Carl Nygard <cjnygard(a)fast.net> writes: > On Thu, 2004-11-18 at 14:09, Doug Gregor wrote: >> On Nov 18, 2004, at 1:10 PM, Murray Cumming wrote: > >> I'm not in a position to do this at the moment, although possibly in >> the future. It would be *wonderful* if someone went off and studied >> both libraries in-depth to make this comparison, especially if that >> person was not intimately familiar with either library beforehand. >> > > Available: http://www.3sinc.com/opensource/boost.bind-vs-sigc2.html > > Updates for code samples from Chris Vine and Jonathan Brandmeyer will be > forthcoming. > > I could use some suggestions on how to incorporate common code into the > code comparison tables. > > And of course, any other comments, flames, etc. will be welcome. I'm > only doing this as a service for keeping track of comments. The syntax you're using for boost::function is a bit passe. // Signal with two args and int return value boost::signal2<int, float, string> sig; Should be // Signal with two args and int return value boost::signal<int (float, string)> sig; I think your analysis underestimates or ignores the importance of syntax, most importantly the syntax for invoking a signal. The fact that the Boost signal is an ordinary function object that can be called directly has important implications for interoperability (you don't need binders). NOTE: Boost.Signals documentation states that there are exceptions to using boost::signals::trackable, specifically the trackable base class is unable to manage connections created using Boost.Function or Boost.Lambda. This problem is stated to be resolved in future versions. Trackable Boost.Signals is at a bit of a disadvantage because the trackable class doesn't work with Boost.Lambda and Boost.Function. In this bsense, SigC library's implementation seems superior, if only because you don't have to think about limitations. Does libSigC++ not suffer from an analogous limitation, or did its documentation simply fail to mention it, or is just requiring you to do more work manually? The equivalency table for slot binders is misleading, I think. Boost.Signals has no direct coupling to Boost.Bind, and the fact that Boost.Bind doesn't provide certain binders doesn't mean you can't get them another way. For example, I think you can use Boost.Lambda or Phoenix to create them. As for the retype ... stuff, I don't know what libSigC++ does there. However, no explicit retyping is needed with Boost where the types concerned are implicitly convertible to the expected types. Hope this helps. -- Dave Abrahams Boost Consulting http://www.boost-consulting.com

1 0

POSIX regex library conflicts
by Andrew Dennison 20 Nov '04

20 Nov '04

My project hit an interesting snag yesterday. It turns out that in different areas of the project, one developer had been using the boost regex library, while the other was using the POSIX library. Since the boost regex library provides POSIX compatibility with boost/regex.h i suspect you may already be aware of this, but i'll mention it anyway, as i believe more could be done about this problem. regex.h uses #defines for certain numerical constants which are also declared in boost regex. This is a problem if both posix and boost are defined in the same project at the same time as the preprocessor will replace the boost definitions with the macro definition in regex.h (ie REG_EXTENDED = 1, among others). I appreciate that this case is somewhat handled by the compatibility header, but this isn't always an available solution. We were able to change headers, so this problem was solved, but this may not always be possible (ie third party software). Perhaps the developers could include some protection against this kind of error by checking to see if the offending constants are defined before the boost declarations are made and #undef-ing them as needed. This kind of error can be difficult to track down in mid-large projects. Regards, Andrew.

2 1

Boost 1.32.0 released
by Aleksey Gurtovoy 20 Nov '04

20 Nov '04

++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ + NOTE: This is a stripped-down copy of the Boost 1.32.0 release + + notes. See http://www.boost.org for the full version. + ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Important - New Toolset Names ----------------------------- The names of some the Boost.Build toolsets have been changed to remove the "." (dot) character and to fix some other naming inconsistencies. For example, vc7.1 toolset was renamed to become vc-7_1. Please refer to the Supported Toolsets section of the installation guide for the complete list of the current toolset names. This change was made as a part of the effort to make the Boost distribution compatible with ISO 9660 level 2 requirements. New Libraries ------------- * Assignment Library: Filling containers with constant or generated data has never been easier, from Thorsten Ottosen. * Minmax Library: Standard library extensions for simultaneous min/max and min/max element computations, from Herv Brnnimann. * Multi-index Containers Library: Containers with multiple STL-compatible access interfaces, from Joaqun M Lpez Muoz. * Numeric Conversion Library: Optimized policy-based numeric conversions, from Fernando Cacciola. * Program Options Library: Access to configuration data given on command line, in config files and other sources, from Vladimir Prus. * Range Library: A new infrastructure for generic algorithms that builds on top of the new iterator concepts, from Thorsten Ottosen. * Serialization Library: Serialization/de-serialization of arbitrary C++ data structures to various formats including text, binary, and xml, from Robert Ramey. * String Algorithms Library: Collection of string related algorithms for case conversion, trimming, find/replace operations and more, from Pavol Droba. * Tribool: 3-state boolean type library, from Doug Gregor. Updated Libraries ----------------- * Compose: This deprecated library has been removed. * Graph: - Added bundled properties to the adjacency_list and adjacency_matrix class templates, greatly simplifying the introduction of internal vertex and edge properties. - The LEDA graph adaptors have been ported to LEDA 4.5. - Added algorithms for betweenness centrality and betweenness centrality clustering. - Added circle layout and undirected spring layout algorithms. * MPL Library: - Updated to use the Boost Software License. - New documentation, including a complete reference manual. - Major interface changes and improvements, many of which are not backward compatible. Please refer to the 1.32 changelog for the detailed information about upgrading to the new version. * Python Library: - Updated to use the Boost Software License. - A new, better method of wrapping classes with virtual functions has been implemented. - Support for the new Python Bool type, thanks to Daniel Holth. - Support for upcoming GCC symbol export control features have been folded in, thanks to Niall Douglas. - Improved support for std::auto_ptr-like types. - Components used by other libraries have been moved out of python/detail and into boost/detail to improve dependency relationships. - Miscellaneous bug fixes and compiler workarounds. * Signals Library: Introduced deterministic slot ordering, permitting slots to be connected at the beginning or end of slot groups or the slot list itself. Combiners may safely have state and are accessible from the signal. * Utility: class template result_of added. * Test Library: - namespace names gets shorten; old one still supported till next release. - added proper encoding of XML PCDATA. - support for wide string comparison implemented. For complete list of changes see Test Library release notes. Regression tests ----------------- This release has been extensively tested on a variety of different compilers and platforms. It is known to contain no regressions against the previous reference release on the compilers and configurations tested. Please refer to the corresponding regression reports at http://www.meta-comm.com/engineering/boost-regression/1_32_0 to see how well your compiler performs on the new Boost codebase. Acknowledgements ---------------- This release wouldn't have been possible without the dedicated effort of many, many members of the Boost community who generously contributed their outstanding expertise, time and energy to making it happen. For patches, bug fixes, troubleshooting, expert advice, and prompt responses to the release manager's requests we thank: David Abrahams, Misha Bergal, Jonathan Brandmeyer, Fernando Cacciola, Marshall Clow, Christopher Currie, Pavol Droba, Caleb Epstein, Eric Friedman, Jeff Garland, Michael Glassford, Doug Gregor, Joel de Guzman, Hubert Holin, Jaakko Jrvi, Hartmut Kaiser, Bronek Kozicki, Tarjei Knapstad, Toon Knapen, Aaron W. LaFramboise, Joaqun M Lpez Muoz, Christoph Ludwig, John Maddock, Paul Mensonides, Guillaume Melquiond, Thorsten Ottosen, Vladimir Prus, Robert Ramey, Rene Rivera, Gennadiy Rozental, Stefan Slapeta, Jonathan Turkanis, Pavel Vozenilek, Jonathan Wakely, Daryle Walker, Victor A. Wagner Jr. and Martin Wille. Also, our special thanks go to: John Maddock for the managing the effort of converting the majority of the Boost libraries to the Boost Software License, Eric Niebler and Joel de Guzman for taking on the important job of improving the Boost documentation's look and feel, and last, but not least, to our regression test runners, without whom we simply would never have released: Toon Knapen, Bronek Kozicki, Rene Rivera, Markus Schpflin, Stefan Slapeta, Victor A. Wagner Jr. and Martin Wille. Thank you everybody! -- Aleksey Gurtovoy MetaCommunications Engineering

1 0

Iterator nesting
by Rodrigo de Salvo Braz 20 Nov '04

20 Nov '04

Hello, Suppose I have a container of containers and would like an iterator that goes through all of their elements as if they are coming from a single container. I thought I would see some Boost class helping me to do that but I couldn't find anything like that. Can someone please tell me if that is true, and if not, which class can I use to that effect? (In fact this concept is more general and interesting. The objects in the first-level containers may not be containers but have members which are containers and whose elements I want to iterate through. Or they could be iterators. The general case should allow a parameterizable way of obtaining an iterator to the elements inside the second-level objects. This could again be a nesting iterator, allowing for arbitraty nesting. Since this is a fairly common need in programming, I was expecting something that did that in Boost.) Thanks, Rodrigo

2 1

Another weird boost::variant problem.
by Bo Peng 19 Nov '04

19 Nov '04

Dear list, I have a problem with apply_visitor of boost::variant. It seems to me that it can not accept a temporary variant variable that is returned from a function. Is this a bug? Here is a simple example: =================================== #include "boost/variant.hpp" using namespace std; #include <string> typedef boost::variant<double, string > Variable; #include <iostream> // a simple visitor that returns a variant. class variantPlusOne : public boost::static_visitor<Variable> { public: Variable operator()( double i) const { return Variable( i + 1 ); } Variable operator()( string str) const { return Variable( 0); } }; // apply_visitor in function form Variable func(Variable a) { return boost::apply_visitor( variantPlusOne(), a); } // a silly function. Variable me(Variable a) { return a; } int main() { Variable b("5"); cout << func(b) << endl; // OK cout << func(me(b)) << endl; // OK cout << boost::apply_visitor(variantPlusOne(), b ) << endl; // OK // cout << boost::apply_visitor(variantPlusOne(), me(b) ) << endl; // NO return 0; } ///////////////////////////// The error messages are: test.cpp:44: no matching function for call to `apply_visitor(variantPlusOne, Variable)' boost_1_31_0/boost/variant/detail/apply_visitor_unary.hpp:59: candidates are: Visitor::result_type boost::apply_visitor(Visitor&, Visitable&) [with Visitor = variantPlusOne, Visitable = Variable] boost_1_31_0/boost/variant/detail/apply_visitor_unary.hpp:75: Visitor::result_type boost::apply_visitor(const Visitor&, Visitable&) [with Visitor = variantPlusOne, Visitable = Variable] /////////////////////////////// Note that I can understand this behavior if the visitor takes reference arguments (and therefore expects a persistent variable) but my visitor pass argument by values. Thanks. Bo

1 0

boost::filesystem::path - where are the attributes?
by Pete 19 Nov '04

19 Nov '04

I'm not sure if I'm missing something or not, but I couldn't find anything in the filesystem documentation that allows one to retrieve file/directory attributes such as: Date created/last accessed/last modified Hidden System Read Only Link Etc. I'm particularly interested in portable file date accessors (hoping to find methods in the path class returning boost::posix_time::ptime). Are there any known workarounds?

2 2

function_traits of bind - functors possible?
by Roland Schwarz 19 Nov '04

19 Nov '04

Is it possible to use function_traits for functors that have been created with bind? I.e.: template<Function> foo (Function f) { typedef typename boost::function_traits<Function>::type fn_t; boost::signal<fn_t> sig; } .... foo(boost::bind(fobar, this, _1)); Apparently the above does not work, but I cannot figure out what I am missing. Roland

1 0

FW: Leak when using boost threads under VC .NET using statically linked CRT
by alansa＠ati-uk.com 19 Nov '04

19 Nov '04

The following code leaks memory for each iteration of the loop for (;;) { boost::thread t(func); t.join(); } void func() { cout << "------" << endl; } If I replace func with func2 void func2() { try { throw 1; } catch {} } then it still leaks. But if I say fill up a vector with stuff or just return there is no leek. The interesting part is that it doesn't leak if use the version of threads built using the CRT as a .dll rather than static link. I also believe that the actual culprit is somewhere in boost.function since the code for boost.thread is so straight forward. I'm currently using boost 1.30 so it might have already been addressed in newer versions. Can anyone help?

2 1

Signals & Slots
by Foster, Gareth 19 Nov '04

19 Nov '04

I think if you just follow through the different typical tasks you might undertake with the two libraries as Murray wrote: " 1. Create a signal 2. Connect a slot (callback function) to a signal. 2.2 For a member method. 2.3 For a non-member or static function. 3. Disconnect a slot. 4. Bind an extra parameter, so that e.g. a slot with 4 parameters can be used with a signal with 3 parameters. I don't personally find the more complex adaptors interesting. " Then write up a document where, in each case, the code needed for both libraries is given, and then I small discusion about any differences or similarities. Perhaps in each case, giving some approximate figure to indicate the similarity would be useful. Presumably, this could then end up in the appendix of, or being referenced by, a proposal for a standard signals/slots interface. I don't know what is involved to be honest. I suppose, it needn't be just the one person doing the comparison, there are four tasks in the list (and maybe a few more besides), so four people could spread the work load, and maybe a 5th could add final conclusions and draw together the others notes. Cheers all, Gaz -----Original Message----- From: libsigc-list-bounces(a)gnome.org [mailto:libsigc-list-bounces@gnome.org] On Behalf Of Carl Nygard Sent: 18 November 2004 19:20 To: Doug Gregor Cc: libsigc-list(a)gnome.org; boost-users(a)lists.boost.org; gtkmm-list(a)gnome.org Subject: Re: [sigc] Re: [Boost-users] Signals & Slots On Thu, 2004-11-18 at 14:09, Doug Gregor wrote: > On Nov 18, 2004, at 1:10 PM, Murray Cumming wrote: > I'm not in a position to do this at the moment, although possibly in > the future. It would be *wonderful* if someone went off and studied > both libraries in-depth to make this comparison, especially if that > person was not intimately familiar with either library beforehand. I'm in a reasonably sane position to do this, although only time will tell if what comes out is useful to anyone or not. Regards, Carl _______________________________________________ libsigc-list mailing list libsigc-list(a)gnome.org http://mail.gnome.org/mailman/listinfo/libsigc-list

1 0

SV: [Boost-users] Manual in pdf?
by Daniel Lidström 19 Nov '04

19 Nov '04

) ) Daniel Lidström writes: ) > Hi, ) > ) > is the manual available in pdf or postscript? Or is there a way ) > to print it? The online manual is not very printer-friendly. ) ) Daniel, ) ) I assume you are talking about Boost-wide PDF (some of the Boost ) libraries/tools provide a standalone one on their own). In that case, ) it's not available for 1.31; we are working on making it available in ) the upcoming 1.32.0, which is due in a couple of days. ) How about the Spirit manual? Will it be available in printable format with 1.32.0? Thanks! -- Daniel

2 1

Spirit help (again)
by Cory Nelson 19 Nov '04

19 Nov '04

Okay, I'm trying to learn Spirit and I've got the grammar down. I've tried looking at the documentation but still can not find out how to make a custom parser (that will let me use the [action] operator). Could someone give an example of a pascal string parser (one byte for length, string follows) to get me started? -- Cory Nelson http://www.int64.org

4 5

MPL Library
by Edward Diener 18 Nov '04

18 Nov '04

I have bit the bullet and am attempting to get my head around the MPL library. I realize there is a book out by Messieurs Abrahams and Gurtovoy, I believe, but I thought I would tackle the boost documentation first. A few questions: 1) Is the documentation up to date ? 2) There are three separate documents to study, it seems, all giving information about the MPL library, a white paper circa 2002, a reference, and a mini-tutorial. Is the information in these in sync with each other ? The reason I ask is that the white paper/mini-tutorial mentions if_<> and apply_if<> but the reference does not mention them at all.Are they just understood intrinsic metafunctions that need no reference, or what ? If the former, are there more of these intrinsic metafunctions and, if co, what are they and what do they do ? 3) A number of the topics in the reference documentation mentioned in generalized overviews of the various sections have no specific links. Does this mean that they were never implemented ? Seems dubious in a number of cases. I would seriously like to figure out how MPL works and play around with it, but I feel stymied with what is in the boost docs.

3 6

Key iterators
by Chris Goller 18 Nov '04

18 Nov '04

I'm just getting into boost and I really like it. I would like to iterate over keys of a multimap. so it would look like this: std::multimap<type, type>::key_iterator i = map.beginkey(); i != map.endkey(); i++ at each i++ it would move to the next key. -or- for_each(map.beginkey(), map.endkey(), whatever); Is this possible with the boost iterators? Thanks, Chris

5 5

Re: [sigc] Re: [Boost-users] Signals & Slots
by Doug Gregor 18 Nov '04

18 Nov '04

On Nov 18, 2004, at 1:10 PM, Murray Cumming wrote: >> Very simple explanation here: my comments were about libsigc++ 1.2. > > It would be best for us to ignore them then. The differences are quite > large. Yes, please ignore them. >> I've glanced briefly at libstdc++ 2 > > For the record, Doug almost certainly means "libsigc++" instead of > "libstdc++". Correct. >> and was pleasantly surprised. I'd >> like to look into it further, but do not have the time now. I've been >> saying for a while that the Signals interface is not ready for >> standardization because we only had the one implementation (in Boost) >> and that it was not solid enough for standardization. However, with >> libstdc++ 2 adopting a similar interface, we might be able to converge >> on a single, solid interface for Signals & Slots within the C++ >> Standard Library. Library Technical Report 2 is open for submissions, >> and signals & slots have been on the wish list since the beginning... >> >> In any case, a thread titled "Boost Signals & Slots vs. libsigc++" is >> treading on dangerous territory :) > > I doubt that Boost Signals and libsigc++ 2 are significantly different. My cursory review of the libSIGc++ 2 reference documentation seems to indicate that the interfaces are similar. > A comparison should probably start by looking at the application code > needed to > 1. Create a signal > 2. Connect a slot (callback function) to a signal. > 2.2 For a member method. > 2.3 For a non-member or static function. > 3. Disconnect a slot. > 4. Bind an extra parameter, so that e.g. a slot with 4 parameters can > be > used with a signal with 3 parameters. I don't personally find the more > complex adaptors interesting. I'm not in a position to do this at the moment, although possibly in the future. It would be *wonderful* if someone went off and studied both libraries in-depth to make this comparison, especially if that person was not intimately familiar with either library beforehand. > Please do try to warn us if Boost Signals seems near to being > approved. We > would like to try porting gtkmm to it then. There is no current effort to write a proposal to bring the Boost.Signals interface to the C++ committee (that I know of). If this does happen, it will be _after_ we have a detailed comparison of both libraries and, of course, I will announce it on both the libSIGc++ and Boost mailing lists. Doug

1 0

Re: [Boost-users] Signals & Slots
by Foster, Gareth 18 Nov '04

18 Nov '04

Doug, This is what murray had to say on the GTKmm list (future correspondance, if any, to be on the libsigc++ list), it's a very pleasing response I'm sure you will agree. Perhaps you could qualify you last statement though, that one seems to have murray a little stumped. Cheers! Gaz -----Original Message----- From: Murray Cumming [mailto:murrayc@murrayc.com] Sent: 18 November 2004 09:50 To: Foster, Gareth Cc: 'gtkmm-list(a)gnome.org'; libsigc-list(a)gnome.org Subject: Re: [Boost Signals & Slots] Vs [libsigc++] Questions comparing boost::signal to libsigc++ belong on the libsigc++ mailing list. I'm CCing it. boost::signal was developer in cooperation with Karl Nelson, the main original libsigc++ developer. Also, the libsigc++ 2 API was redesigned to be as much like boost::signal as possible, so that gtkmm can easily switch to boost::signal if it becomes an API-stable dependency or it is added to the C++ Standard Library. gtkmm has a long-standing policy of not reimplementing things when we can just reuse them. This part makes no sense to me. It would have to be explained properly before we could comment: " Basically, libsigc++ is a monolithic entity covering single and multiple-target callbacks, slots, and slot binding, Signals tackles only the multiple-target callbacks, relying on other Boost libraries (especially Function and Signals) to do most of the work, so it integrates cleanly with the rest of Boost. " Murray > Hello all, > > As you will see in the forward email below, I was chatting to a bloke who > works on boost::signal, I wondered how this stacked up against libsigc++, > and whether there was any chance it could be used in GTKmm and suchlike. A > GTKmm developer did pop up on the boost list and make the valid point that > API stability would be a major issue, nevertheless, I thought I'd send > this > out, and see what people here had to say. As I said on the boost list, I > am > thinking more ... > >> "hey, what do you think to this lads" than an outright "you should be > using Boost heathens!" > > I hope such discussion isn't offtopic. > > Thanks all! > > Gaz > > > -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Doug Gregor > Sent: 17 November 2004 15:49 > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Signals & Slots > > > On Nov 17, 2004, at 9:20 AM, Foster, Gareth wrote: >> I was just reading some mention of bugs in boost::signal, > > They weren't actually bugs :) > >> is this >> implementation in competition with libsigc++? i.e. does it aim to do >> the >> same job, but under a different license, or is there perhaps some >> fundamental design difference between the two? > > The Signals library aims to be much more flexible than libsigc++ and to > have an interface that is more comfortable for Boost. For instance, > slots are just function objects with similar signatures (like > Boost.Function, because Function is used in Signals), one can combine > the results of calling multiple slots into a single return value via an > arbitrary function object, and the lifetime of signals & slots is > automatically tied to "trackable" objects used in bind expressions to > build slots. > > Basically, libsigc++ is a monolithic entity covering single and > multiple-target callbacks, slots, and slot binding, Signals tackles > only the multiple-target callbacks, relying on other Boost libraries > (especially Function and Signals) to do most of the work, so it > integrates cleanly with the rest of Boost. > > Doug > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users > _______________________________________________ > gtkmm-list mailing list > gtkmm-list(a)gnome.org > http://mail.gnome.org/mailman/listinfo/gtkmm-list > Murray Cumming murrayc(a)murrayc.com www.murrayc.com www.openismus.com

4 4

Win32: Overloaded std::min and std::max
by boost＠dalvander.com 18 Nov '04

18 Nov '04

Hi all, A day ago I stumbled upon a problem using std::min and std::max when having included any boost header file on Win32 machine. The following code should not compile, according to the C++ standard: float f = 47.9999f; long l = 47L; std::max(f, l); // This should fail as the arguments aren't of the same type. But using boost (and Microsoft Visual C++ .NET 2003), it magically did. I tracked down the problem and found a 'fix' in <boost_1_31_0/boost/config/platform/win32.hpp> that looks like this: -----8<----------8<----------8<----------8<----------8<----- #ifdef BOOST_MSVC #include <algorithm> // for existing std::min and std::max namespace std{ // Apparently, something in the Microsoft libraries requires the "long" // overload, because it calls the min/max functions with arguments of // slightly different type. (If this proves to be incorrect, this // whole "BOOST_MSVC" section can be removed.) inline long min(long __a, long __b) { return __b < __a ? __b : __a; } inline long max(long __a, long __b) { return __a < __b ? __b : __a; } // The "long double" overload is required, otherwise user code calling // min/max for floating-point numbers will use the "long" overload. // (SourceForge bug #495495) inline long double min(long double __a, long double __b) { return __b < __a ? __b : __a; } inline long double max(long double __a, long double __b) { return __a < __b ? __b : __a; } } using std::min; using std::max; # endif -----8<----------8<----------8<----------8<----------8<----- I think that that block of code should be removed as it is illegal to overload any function in the standard library, according to the C++ standard, and that it also makes illegal code to compile. Cheers, Dalle

2 1