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

Filesystem library questions
by Manish Motwani 26 Feb '07

26 Feb '07

Hi, We're creating a new cross-platform dispersed storage technology. Backing up a file from one platform and restoring to another (or the same) is a requirement. We have found boost to be very useful for threads, date/time, program options, etc. We're also currently using the boost filesystem libarary, but we can't figure out why many of the file-metadata query and modifier functions are missing. Can someone from boost let us know if there's any way of querying complete file-metadata (including read/write/execute permissions on windows and linux, ACLs, creation-time in windows, etc.). I found only the following function in version 1.32 (the one we're using): last_write_time (read and write modification time). symbolic_link_exists (check if a file is a sym link). And these new functions have been added since: create_hard_link create_symlink .. and some functionality to get the type of file is also there in the trunk version. But what about the rest of metadata filesystems (POSIX, NTFS, FAT32, HFS, etc) provide? Is this ever going to be included in the library? Is there a way to access this information any other way? I suspect these questions may have been asked by others, so can someone point me to where I can find code to complement the boost filesystem library to handle file-metadata? Thanks, Manish

1 0

Boost date time and MinGW
by Franck Guillaud 25 Feb '07

25 Feb '07

Hello World, I'm doing some experiments to use boost (1.33.1) under Win XP and with MinGW (5.1.3) environment. Boost was compiled with bjam with no particular options. I'm facing some problems on linking with boost_date_time. Here is the simple test program: #include <iostream> #include <string> #include <boost/date_time/posix_time/posix_time.hpp> using namespace std; using namespace boost::posix_time; int main (int argc, char** argv) { char dummy; ptime d1(min_date_time); ptime d2(max_date_time); cout << "min:" << to_simple_string(d1) << endl; cout << "max:" << to_simple_string(d2) << endl; cin.get(dummy); return 0; } Compiling lines are : g++ -DUSE_DATE_TIME_PRE_1_33_FACET_IO -I"E:\dev\boost_1_33_1" -O0 -g3 -Wall -c -fmessage-length=0 -MMD -MP -MF"main.d" -MT"main.d" -o"main.o" "../main.cpp" g++ -L"E:\dev\boost_1_33_1\stage\lib" -o"TestBOOST.exe" ./main.o -lboost_date_time-mgw-mt-d-1_33_1 I get the error (simplified output) : E:/dev/boost_1_33_1/boost/date_time/gregorian/greg_weekday.hpp: undefined reference to `boost::gregorian::greg_month::as_long_string() const' If I remove the lines with *to_simple_string*, I get no error. From the docs [*] it seems there may be a problem for streams support for some compilers, so I tryed to define USE_DATE_TIME_PRE_1_33_FACET_IO in my project, but with no effect. Does it needs to be done when compiling boost ? Is there any other way to solve my link problem ? (appart not using string output for dates :-) ) Thanks for any help. Franck,e- [*] http://www.boost.org/doc/html/date_time/details.html#date_time.buildinfo

2 2

Any reasons why an exception would not be caught by BOOST_CHECK_THROW?
by Stephen Torri 25 Feb '07

25 Feb '07

I have an exception class that is not getting caught my BOOST_CHECK_THROW. Here is a similar setup to what I have: class Base_Exception : public virtual std::exception { public: virtual ~Base_Exception() throw{} virtual const char* what () const throw() = 0; virtual const char* name () const throw() = 0; boost::uint32_t const& id () const throw(); private: boost::uint32_t id; }; class Child_Exception : public virtual Base_Exception { public: enum ERROR_ID { INVALID_API_INPUT, CANNOT_FIND_TARGET, INTERNAL_LIBRARY_ERROR, }; Child_Exception ( ERROR_ID message_id ); virtual ~Child_Exception () throw () {} virtual const char* what () const throw(); virtual const char* name () const throw(); private: static const char* m_exception_name; static const char* m_messages[]; }; I find that when I use the BOOST_CHECK_THROW ( expression, Child_Exception ) that I still get the test crashing with an uncaught exception. Here is the actual output: terminate called after throwing an instance of 'libreverse::errors::API_Exception' what(): Internal library error has occurred. At this point consider the library unreliable. unknown location(0): fatal error in "test_wrong_sources": signal: SIGABRT (application abort requested) *** errors detected in test suite "Architecture Type Detector suite"; see standard output for details FAIL: test_arch_type_detector I can send the whole test file but I hope this is enough to understand the nature of the problem. Is there a FAQ about BOOST_CHECK_THROW? Stephen

1 0

[graph] birected -> directed adapter?
by Jens Müller 25 Feb '07

25 Feb '07

http://www.boost.org/libs/graph/doc/reverse_graph.html reverses edge directions. Is there an adapter (i.e., has someone written such a thing) that combines in and out edges in a bidirected graph and gives a view as if the graph were undirected? I'd need this for doing BFS independent of edge directions in a bidirected graph.

1 0

Bug in options_description.cpp when offer a long program options to boost::program_options
by Jack Shi 25 Feb '07

25 Feb '07

If you provide a long program options description while using boost, you will encounter such issue, if you using debug version, you will see a debug assertion failed alert, if you using release version, your program will be crashed. following codes can be used to reproduce this issue #include <iostream> #include <boost/program_options.hpp> using namespace std; int main(int argc, char* argv[]) { namespace po = boost::program_options; po::options_description desc("supported options"); desc.add_options() ("help,h", "display this help message,this help will be printed out if you not provide option here!"); std::cout << desc << "\n"; } I have trace this issue, it is located in function format_paragraph in the file options_description.cpp, namespace { void format_paragraph(std::ostream& os, std::string par, unsigned first_column_width, unsigned line_length) { ...... // prevent chopped words // if (lastchar != ' ') && // ((exists(lastchar + 1) && (lastchar + 1 != ' ')) if ((*(line_end - 1) != ' ') && ((line_end < par_end) && (*line_end != ' '))) { // find last ' ' in the second half of the current paragraph line string::const_iterator last_space = find(reverse_iterator<string::const_iterator>(line_end - 1), reverse_iterator<string::const_iterator>(line_begin - 1), ' ') .base(); if (last_space != line_begin - 1) { ...... } if option description is long enough, the find function will be called, and "reverse_iterator<string::const_iterator>(line_begin - 1)" will lead to this issue, may "line_begin - 1" access a invalid space. If there have some guys to confirm it was a bug in boost?

2 1

[conversion] lexical_cast behaviour changed from 1_33_1
by Paul O'Neill 25 Feb '07

25 Feb '07

Compiling the following code on MSVC80, sp1 has different behaviour in the latest CVS head compared to 1_33_1? double dbl(88.8); std::cout << boost::lexical_cast<std::string>(dbl) << std::endl; boost1.33.1 = 88.8 boost::CVS = 88.799999999999997 Any ideas as I prefer the old behaviour? Thanks.

1 0

boost RegEx problem: Invalid content of repeat range
by Michael Radzewitz 25 Feb '07

25 Feb '07

Hello everyone, i have a problem with libboost_regex-gcc-mt-1_33_1.a on a debian Linux and a simple function to test some Names: bool is_valid_name(const char *s) { if(!s) return false; const char* re = "^[a-zA-Z][.*0-9a-zA-Z._-]{4,60}$"; static const boost::regex e(re); return regex_match(s,e); } Everything works well when i put this Funtion in a simple Programm and run it. When I put the same Function in my cgi which is wrapped through fastCgi and handled by an apache webserver i get the following Error message: Invalid content of repeat range so in a simple programm the range check {4,60} in boost regex works but in a more complex program it didd'nt. I have testet the same function on Linux using: libboost_regex-gcc-mt-1_33_1.a and free BSD using: libboost_regex.so.3 and get with both libs the same error message. It would be nice if someone can help me find a solution or tell me what went wrong here. Thanks in advance!

2 1

Boost Preprocessor Question
by Eric Lemings 24 Feb '07

24 Feb '07

Greetings, I was wondering if the following can be done with Boost Preprocessor. Given a list of preprocessor macro names, write a simple program that prints whether each macro is defined and its value if it is defined. In particular, I'd like to know if the following example program could be reduced/simplified with Boost: #include <iostream> using namespace std; #define STRING(x) #x #define STRINGIZE(x) STRING(x) #define IS " is " #define NOT "not " #define DEFINED "defined." #define VALUE " Its value is " extern int main () { #if defined __mips cout << STRING(__mips) IS DEFINED; cout << VALUE STRINGIZE(__mips) << endl; #else cout << STRING(__mips) IS NOT DEFINED << endl; #endif #if defined __unix cout << STRING(__unix) IS DEFINED; cout << VALUE STRINGIZE(__unix) << endl; #else cout << STRING(__unix) IS NOT DEFINED << endl; #endif #if defined __sgi cout << STRING(__sgi) IS DEFINED; cout << VALUE STRINGIZE(__sgi) << endl; #else cout << STRING(__sgi) IS NOT DEFINED << endl; #endif #if defined _COMPILER_VERSION cout << STRING(_COMPILER_VERSION) IS DEFINED; cout << VALUE STRINGIZE(_COMPILER_VERSION) << endl; #else cout << STRING(_COMPILER_VERSION) IS NOT DEFINED << endl; #endif #if defined __GNUC__ cout << STRING(__GNUC__) IS DEFINED; cout << VALUE STRINGIZE(__GNUC__) << endl; #else cout << STRING(__GNUC__) IS NOT DEFINED << endl; #endif return 0; } Thanks, Eric.

2 1

Error in using boost lambda in a template
by Meryl Silverburgh 24 Feb '07

24 Feb '07

Hi, I have code which uses Boost lambda in a template like this: template<class T> bool lessThanXY( T& src, T& dest ) { return (src.getY() < dest.getY()); } template<class T1, class T2> void sortXY(T1& list) { ::sort( list.begin(), list.end(), bind(::lessThanXY<T2>, *(_1), *(_2) ) ); } But when I instantiate the template like this, I get the following compile error: class Rect; typedef list<Rect*> RectList; void sortXYRectList(RectList& rl) { sortXYWithThreshold<RectList, Rect>(rl); } /usr/include/boost/lambda/detail/lambda_traits.hpp:389: error: ignoring 'const' qualifiers added to function type 'bool ()(Rect&, Rect&)const' gmake[5]: *** [RectUtils.o] Error 1 Can you please tell me how to fix my problem ? I did not use 'const' anywhere in my template, why I get this error: error: ignoring 'const' qualifiers added to function type 'bool ()(Rect&, Rect&)const'

1 0

[graph] internal predecessor map
by Jens Müller 24 Feb '07

24 Feb '07

Can I store an edge_descriptor of a predecessor edge as an internal/bundled property? I am currently doing this: struct EdgeProperties; struct VertexProperties { double x; double y; double weight; int dist; boost::graph_traits< boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, VertexProperties, EdgeProperties> >::edge_descriptor pred; int app_height; bool mark; }; struct EdgeProperties { double length; }; int main() { using namespace boost; typedef adjacency_list<vecS, vecS, bidirectionalS, VertexProperties, EdgeProperties> Graph; } This is legal, isn't need? Obviously the definition of EdgeProperties is not needed where it is first used. But is this the proper way to do it, or is there a more elegant way?

1 1

mixing CVS and release
by Torrey Pines 24 Feb '07

24 Feb '07

Hi In general, is it possible to use a CVS version of one Boost component and release versions of everything else (within one program)? If so, is there a description of a procedure for doing that somewhere?

2 1

[program_options] crash in VC++2005
by n.torrey.pines 24 Feb '07

24 Feb '07

In VC++2005 debug mode (Ctrl-F5), this little program aborts: +++++++++++++ begin ++++++++++++++++++++++++ #include <iostream> #include <boost/program_options.hpp> int main(int argc, char * argv[]) { boost::program_options::options_description desc("Allowed options"); desc.add_options() ("some_option", "\ This option description SHOULD be long enough not to fit in one line"); std::cout << desc << '\n'; } ++++++++++++ end +++++++++++++++++++++++++++ The debug assertion failure message is: File: C:\Program Files\Microsoft Visual Studio 8\VC\INCLUDE\xstring Line: 173 Through multiple trials, I found that the error occurs if and only if the option description is long enough not to fit in one line in the window. This is boost-1_33_1 Since I have no prior experience with program_options, perhaps I'm using it incorrectly?

3 3

[serialization] size_t vs unsigned warnings
by n.torrey.pines 23 Feb '07

23 Feb '07

Hi Line 36 in collections_save_imp.hpp says: unsigned int count = s.size(); I'm getting many pages of warnings in VC++2005 stemming from this line. Would it make sense to change that to std::size_t count = s.size() ? If so, should I just edit the line? recompile boost? I'd like to take care of that warning. Thanks

3 3

[Serialization] xml serialization to file and boost::archive::xml_archive_exception (unrecognized XML syntax)
by Andreas Willich 23 Feb '07

23 Feb '07

Hi all I have a annoying problem with xml serialization to a file or std::cout. I want to serialize my own classes to a file via filestream and everytime I get a xml_archive_exception with the error message unrecognized XML syntax. What I want to serialize is a child class from a class hierachy. When I only serialize the part of the mother class (with BOOST_SERIALIZATION_BASE_OBJECT_NVP) it works, but when I also want to save the members of the child classes I get this exception. I have exported every class with BOOST_CLASS_EXPORT and at the base class I have a BOOST_IS_ABSTRACT(baseClass). Gcc brings no warnings or errors and when I use a text archive, all works fine. Has someone an idea what I do wrong or some suggestions? Thanks Andreas Here is my build environment: GCC: Using built-in specs. Target: i686-pc-linux-gnu Configured with: /var/tmp/portage/sys-devel/gcc-4.1.1-r3/work/gcc-4.1.1/configure --prefix=/usr --bindir=/usr/i686-pc-linux-gnu/gcc-bin/4.1.1 --includedir=/usr/lib/gcc/i686-pc-linux-gnu/4.1.1/include --datadir=/usr/share/gcc-data/i686-pc-linux-gnu/4.1.1 --mandir=/usr/share/gcc-data/i686-pc-linux-gnu/4.1.1/man --infodir=/usr/share/gcc-data/i686-pc-linux-gnu/4.1.1/info --with-gxx-include-dir=/usr/lib/gcc/i686-pc-linux-gnu/4.1.1/include/g ++-v4 --host=i686-pc-linux-gnu --build=i686-pc-linux-gnu --disable-altivec --enable-nls --without-included-gettext --with-system-zlib --disable-checking --disable-werror --disable-libunwind-exceptions --disable-multilib --disable-libmudflap --disable-libssp --disable-libgcj --enable-languages=c,c++,fortran --enable-shared --enable-threads=posix --enable-__cxa_atexit --enable-clocale=gnu Thread model: posix gcc version 4.1.1 (Gentoo 4.1.1-r3) Glibc: 2.5 BOOST: CVS Build RC_1_34_0 from 19.02.2007 BJAM: Boost.Jam Version 3.1.13. OS=LINUX. Copyright 1993-2002 Christopher Seiwald and Perforce Software, Inc. Copyright 2001 David Turner. Copyright 2001-2004 David Abrahams. Copyright 2002-2005 Rene Rivera. Copyright 2003-2005 Vladimir Prus.

2 2

VS2005 Toolset for builidng boost targeting x64.
by Michael Doris 23 Feb '07

23 Feb '07

Hi I've had a good search but I can't find out how I might go about building boost targetting x64 using Visual Studio 2005. I've had no problem targetting 32-bit windows. Thanks, Mike Doris

1 0

[multi_index] index based on case-insensitive strings
by Boris 23 Feb '07

23 Feb '07

struct employee { std::string name; }; typedef multi_index_container< employee, indexed_by< hashed_unique<member<employee, std::string, &employee::name> > > > mi; If I want to change the index to make it case-insensitive I have to write my own key extractor, right? Would the following code then be correct (it is based on boost::multi_index::member)? template<class Class, std::string Class::*PtrToMember> struct caseinsensitive_string { typedef std::string result_type; template<typename ChainedPtr> std::string operator()(const ChainedPtr& x) const { return operator()(*x); } std::string operator()(const Class& x) const { return boost::algorithm::to_lower_copy(x.*PtrToMember); } std::string operator()(Class& x) const { return boost::algorithm::to_lower_copy(x.*PtrToMember); } std::string operator()(const boost::reference_wrapper<const Class>& x) const { return operator()(x.get()); } std::string operator()(const boost::reference_wrapper<Class> x) const { return operator()(x.get()); } }; With the following typedef I get a container which does not change the name of an employee (I want to retain the name without making it lower- or uppercase) but refuses items with the same case-insensitive name? typedef multi_index_container< employee, indexed_by< hashed_unique<caseinsensitive_string<employee, &employee::name> > > > mi2; Boris

2 4

[regex] Support for right-to-left parsing?
by Geraint Bundy 23 Feb '07

23 Feb '07

Hello, Does Boost::Regex support "backwards" or right-to-left parsing (like .NET's regex)? If not, then is it possible to emulate this behaviour using normal parsing? Thanks, Geraint

2 1

Linker error when using boost::wregex (MSVC)
by Fernando Cuenca 23 Feb '07

23 Feb '07

Hi, I'm trying to use the regex library (from boost 1.33) with the MSVC.NET 2003 and I'm getting the following linker error when using the wide character version of the classes: libboost_regex-vc71-mt-1_33_1.lib(usinstances.obj) : error LNK2005: "public: static bool __cdecl std::char_traits<unsigned short>::eq(unsigned short const &,unsigned short const &)" (?eq@?$char_traits@G@std@@SA_NABG0@Z) already defined in msvcprt.lib(MSVCP71.dll) libboost_regex-vc71-mt-1_33_1.lib(usinstances.obj) : error LNK2005: "public: static unsigned int __cdecl std::char_traits<unsigned short>::length(unsigned short const *)" (?length@?$char_traits@G@std@@SAIPBG@Z) already defined in msvcprt.lib(MSVCP71.dll) Declaring a single wregex object is enough to get the error. Everything works fine for regular regex objects (using regular std::strings.) Any ideas how to solve this problem? Thanks in advance. Saludos! Fernando. -------------------------------------------------------------------------------------------------------------------- Confidentiality Notice: The information in this email is confidential and may be privileged. It is intended solely for the addressee(s). If the reader of this message is not the intended recipient, any disclosure, copying, distribution, retention or action taken or omitted to be taken in reliance on it is prohibited. If you have received this communication in error, please notify us immediately by replying to the message or by telephoning either 905-624-1260 or 1-888-672-5471 and deleting it and any attachments from your computer system.

2 1

[multi_index] function to force to recreate indexes?
by Boris 23 Feb '07

23 Feb '07

I have two multi_index_containers with smart pointers which refer to the same objects (at least some of the pointers refer to the objects). When I access and modify an object via an index of one of the two multi_index_containers the indexes of that container are recreated as far as I understand. But how do I make the other multi_index_container recreate its indexes? I can't and don't need to modify the object again. Is there anything to force a multi_index_container to recreate its indexes? Boris

3 9

iterator_range error
by abir basak 23 Feb '07

23 Feb '07

I am facing problem related to iterator_range. It's type is not propagating properly, when I return such thing from a function. (compiler VS 7.1 ,Windows ) The code below shows it. This is an extension of a vector, which returns range. typedef std::pair<std::size_t,std::size_t> pair_t; typedef std::vector<std::size_t> index_t; template<typename T> class vector_e : private std::vector<T>{ public: typedef vector_e<T> self_type; typedef typename std::vector<T>::iterator iterator; typedef typename std::vector<T>::const_iterator const_iterator; typedef typename std::vector<T>::pointer pointer; typedef typename std::vector<T>::const_pointer const_pointer; typedef typename std::vector<T>::reference reference; typedef typename std::vector<T>::const_reference const_reference; typedef typename std::vector<T>::difference_type difference_type; typedef typename std::vector<T>::size_type size_type; //typedef sub_range_t<self_type> range; //typedef sub_range_t<const self_type> const_range; typedef typename std::vector<T>::size_type size_type; typedef typename boost::permutation_iterator<typename iterator,typename index_t::const_iterator> index_iterator; typedef typename boost::permutation_iterator<typename const_iterator,typename index_t::const_iterator> const_index_iterator; //typedef sub_range_t<self_type,index_iterator,const_index_iterator> index_range; //typedef sub_range_t<self_type,const_index_iterator,const_index_iterator> const_index_range; typedef boost::iterator_range<index_iterator> index_range; typedef boost::iterator_range<const_index_iterator> const_index_range; typedef boost::sub_range<self_type> range; typedef boost::sub_range<const self_type> const_range; vector_e() : std::vector<T>(){} using std::vector<T>::begin; using std::vector<T>::end; using std::vector<T>::operator []; using std::vector<T>::insert; const_iterator const_begin()const{ return begin(); } const_iterator const_end()const{ return end(); } index_iterator begin_i(const index_t& i){ return boost::make_permutation_iterator(begin(),i.begin()); } const_index_iterator begin_i(const index_t& i)const{ return boost::make_permutation_iterator(begin(),i.begin()); } index_iterator end_i(const index_t& i){ return boost::make_permutation_iterator(begin(),i.end()); } const_index_iterator end_i(const index_t& i)const{ return boost::make_permutation_iterator(begin(),i.end()); } range get_range(const pair_t& r){ return boost::make_iterator_range(begin()+r.first,begin()+r.second); } const_range get_range(const pair_t& r)const{ return boost::make_iterator_range(begin()+r.first,begin()+r.second); } index_range get_range(const index_t& i){ index_iterator b = boost::make_permutation_iterator(begin(),i.begin()); index_iterator e = boost::make_permutation_iterator(begin(),i.end()); return boost::make_iterator_range(b,e); } const_index_range get_range(const index_t& i)const{ const_index_iterator b = boost::make_permutation_iterator(begin(),i.begin()); const_index_iterator e = boost::make_permutation_iterator(begin(),i.end()); return boost::make_iterator_range(b,e); } }; Now, to use it like this, typedef vector_e<trace> trace_buffer; typedef boost::permutation_iterator<trace_buffer::iterator,index_t::iterator> index_iterator; typedef boost::sub_range<trace_buffer> trace_range; typedef boost::iterator_range<index_iterator> trace_index_range; trace_buffer traces; struct character{ index_t index; trace_index_range get_traces(){ index_iterator b = boost::make_permutation_iterator(traces.begin(),index.begin()); index_iterator e = boost::make_permutation_iterator(traces.begin(),index.end()); //return boost::make_iterator_range(b,e); return traces.get_range(index);///This doesn't work, while previous commented line works ! } }; Thus to say, I am unable to forward a call to iterator_range from one function to another preserving the type. (Previously the same problem was there with sub_range with 1.33.1 download. Now that one is solved with a later cvs version ) . Any help is appreciated .... thanks' abir -- Abir Basak, Member IEEE Software Engineer, Read Ink Technologies B. Tech, IIT Kharagpur email: abir(a)abirbasak.com homepage: www.abirbasak.com

2 1

guid
by Christian Henning 23 Feb '07

23 Feb '07

Hi there, I find it a bit weird why the guid needs to be built. I think the designer did it because of the sha1 lib. But how about having guid lib header only when you want everything but the create_v5 part? I think that would make sense. I wouldn't mind reorganizing the code. Christian

3 2

[serialization] conditional serialization of members and base classes
by n.torrey.pines 23 Feb '07

23 Feb '07

Hi The logic I want to implement is: * b contains a * when saving b, save a, followed by other data * when loading b, load a into a temporary, if it matches b.m_a, load other data Would you expect the following code to work? class b { a m_a; // a is serializable vector<int> m_v; // other data template<class Archive> void save(Archive& ar, const unsigned version) const { ar & m_a; ar & m_v; } template<class Archive> void load(Archive& ar, const unsigned version) { a tmp; ar & tmp; if(tmp == m_a) ar & m_v; } // ... }; Now, what if b is derived from a instead of containing it? Would this work? class b : public a { vector<int> m_v; // other data template<class Archive> void save(Archive& ar, const unsigned version) const { ar & boost::serialization::base_object<a>(*this); ar & m_v; } template<class Archive> void load(Archive& ar, const unsigned version) { a tmp; ar & tmp; if(tmp == static_cast< const a& >(*this)) ar & m_v; } // ... }; Thanks!

2 3

[Review][Bimap] Bimap review extended until March 2nd
by Ion Gaztañaga 22 Feb '07

22 Feb '07

Hi to all, Bimap review has been extended until March 2nd. I encourage all boosters to give a try to this great library. The links are: Start reading the documentation here: http://tinyurl.com/y95qng And download the library here: http://boost-consulting.com/vault/index.php?&directory=Containers Regards, Ion

1 0

feature request: documentation on possible linker problems
by Maarten Nieber 22 Feb '07

22 Feb '07

Hi, is it possible to add some documentation about possible linker conflicts when boost is used inside dlls and static libs? At the moment, my colleagues worry about using boost in our dlls or static libs, because when we give our (binary) libraries to a third party, the boost symbols in our libraries might give a conflict with boost symbols in the executable of the third party. I tried to solve this puzzle myself, but could not find a conclusive answer, which leads me to believe that this issue may be relevant for the boost documentation. Notably, I'm interested to know if this problem can occur if we only use boost header files but not binaries. Thanks in advance, Maarten Nieber ____________________________________________________________________________________ No need to miss a message. Get email on-the-go with Yahoo! Mail for Mobile. Get started. http://mobile.yahoo.com/mail

1 0

(no subject)
by Maarten Nieber 22 Feb '07

22 Feb '07

Hi, is it possible to add some documentation about possible linker conflicts when boost is used inside dlls and static libs? At the moment, my colleagues worry about using boost in our dlls or static libs, because when we give our (binary) libraries to a third party, the boost symbols in our libraries might give a conflict with boost symbols in the executable of the third party. I tried to solve this puzzle myself, but could not find a conclusive answer, which leads me to believe that this issue may be relevant for the boost documentation. Notably, I'm interested to know if this problem can occur if we only use boost header files but not binaries. Thanks in advance, Maarten Nieber ____________________________________________________________________________________ Be a PS3 game guru. Get your game face on with the latest PS3 news and previews at Yahoo! Games. http://videogames.yahoo.com/platform?platform=120121

1 0

Re: [Boost-users] How to access bundled properties individually?
by Shufei Fan 22 Feb '07

22 Feb '07

This question is regarding to BGL, I should have included it on the title. Actually, thank goes to Aaron Windsor. From: fansf(a)hotmail.comTo: boost-users(a)lists.boost.orgSubject: How to access bundled properties individually?Date: Thu, 22 Feb 2007 19:39:10 +0000 First, Thank Doug for answering my previous question on parallel edges. Now, my question is:How to access bundled property individually? I defined my graph like this: struct Node{ int label; int mode[3]; //...;};struct Edge{ double nCommBord;}; typedef boost::adjacency_list< boost::setS, boost::vecS, boost::undirectedS, Node, Edge> Graph;but when I want to access property nCommBord of Edge, there seems to be wrong with my property_map type definition. Anyone can point out for me, what is the right version(I cannot seem to find any comment on this kind of usage)? //get edgeWeight propertyproperty_map<Graph, &Edge::nCommBord>::type p_e = get(&Edge::nCommBord, *rowGraph); The error:c:\...\VCProjects\...xxx.cpp(55) : error C2974: 'boost::property_map' : invalid template argument for 'Property', type expected c:\Boost\include\boost-1_33_1\boost\graph\properties.hpp(205) : see declaration of 'boost::property_map'Thanks, Shufei Connect to the next generation of MSN Messenger Get it now! _________________________________________________________________ Explore the seven wonders of the world http://search.msn.com/results.aspx?q=7+wonders+world&mkt=en-US&form=QBRE

1 0

How to access bundled properties individually?
by Shufei Fan 22 Feb '07

22 Feb '07

First, Thank Doug for answering my previous question on parallel edges. Now, my question is: How to access bundled property individually? I defined my graph like this: struct Node{ int label; int mode[3]; //...;};struct Edge{ double nCommBord;}; typedef boost::adjacency_list< boost::setS, boost::vecS, boost::undirectedS, Node, Edge> Graph; but when I want to access property nCommBord of Edge, there seems to be wrong with my property_map type definition. Anyone can point out for me, what is the right version(I cannot seem to find any comment on this kind of usage)? //get edgeWeight propertyproperty_map<Graph, &Edge::nCommBord>::type p_e = get(&Edge::nCommBord, *rowGraph); The error: c:\...\VCProjects\...xxx.cpp(55) : error C2974: 'boost::property_map' : invalid template argument for 'Property', type expected c:\Boost\include\boost-1_33_1\boost\graph\properties.hpp(205) : see declaration of 'boost::property_map' Thanks, Shufei _________________________________________________________________ Connect to the next generation of MSN Messenger http://imagine-msn.com/messenger/launch80/default.aspx?locale=en-us&source=…

1 0

[mpl::math] exponential metafunction for complex types
by Chris Weed 22 Feb '07

22 Feb '07

Hi, I am getting the wrong result for the exponential of complex numbers such as the following: #include <boost/mpl/math/double.hpp> #include <boost/mpl/math/complex_number.hpp> #include <iostream> int main() { typedef boost::mpl::math::string_c_to_double<'-',2,'.',0>::type minus_two; typedef boost::mpl::times<minus_two,boost::mpl::math::pi<boost::mpl::math::double_tag> >::type minus_two_pi; typedef boost::mpl::math::complex_number<double_zero,minus_two_pi> imag_minus_two_pi; std::cout << imag_minus_two_pi() << std::endl; std::cout << boost::mpl::math::exponential<imag_minus_two_pi>::type() << std::endl; return 0; } This prints: 0-6.28319i 1.0329-0.0109834i which should be 0-6.28319i 1.0000-0.00000i Chris

3 6

[multi_index] view with less items than in container possible?
by Boris 22 Feb '07

22 Feb '07

The various indexes of the multi_index_container help to access items in a container differently. Is it also possible to create an index somehow with access to less items in the container? If there is for example a container with employees and I often need to iterate over female employees only is there a way to create an index for this (there could be a bool in the employee class to indicate who is female)? Boris

2 1

boost_1_30_0\boost\crc.hpp(389) : warning C4245: 'initializing' : conversion from 'int' to 'const boost::detail::mask_uint_t<16>::least', signed/unsigned mismatch
by ERIC BERTRAND 22 Feb '07

22 Feb '07

I have this warning on Visual studio 2005. I want to get rid of theses warning. It apperas at line BOOST_STATIC_CONSTANT( least, sig_bits = (~( least(0u) )) ); if I cast (least)(~( least(0u) )) I have not the warning. I want to be sure this is acceptable. Can someone confirm to me? Thanks -- --------------------------------------------------------- erbere erbere(a)gmail.com

2 1

sub_range, assign and permutation_iterator related problem
by abir basak 22 Feb '07

22 Feb '07

Hi, It is an extension to one my previous post, where I needed help while giving access to a sub_range for of an container. In that problem , Mr Thorsten Ottosen, provided answer to all of my queries (Many thanks to him ). This time I am interested to provide indexed access to a vector with a sub_range ,using permutation_iterator. Here some codes are creating problem, while I am using sub_range with permutation iterator. To specify, I am providing a small test code. typedef std::pair<std::size_t,std::size_t> pair_t; template<typename T> class vector_e : private std::vector<T>{ public: typedef vector_e<T> self_type; typedef typename std::vector<T>::iterator iterator; typedef typename std::vector<T>::const_iterator const_iterator; typedef boost::sub_range<self_type> range; typedef boost::sub_range<const self_type> const_range; typedef typename std::vector<T>::size_type size_type; typedef std::vector<int> index_type; typedef typename boost::permutation_iterator<typename iterator,index_type::const_iterator> index_iterator; typedef typename boost::permutation_iterator<typename const_iterator,index_type::const_iterator> const_index_iterator; vector_e() : std::vector<T>(){} using std::vector<T>::begin; using std::vector<T>::end; using std::vector<T>::operator []; using std::vector<T>::insert; index_iterator begin_i(const index_type& i){ return boost::make_permutation_iterator(begin(),i.begin()); } const_index_iterator begin_i(const index_type& i)const{ return boost::make_permutation_iterator(begin(),i.begin()); } index_iterator end_i(const index_type& i){ return boost::make_permutation_iterator(begin(),i.end()); } const_index_iterator end_i(const index_type& i)const{ return boost::make_permutation_iterator(begin(),i.end()); } range get_range(const pair_t& range){ return boost::make_iterator_range(begin()+range.first,begin()+range.second); } const_range get_range(const pair_t& range)const{ return boost::make_iterator_range(begin()+range.first,begin()+range.second); } range get_range(const index_type& i){ return boost::make_iterator_range(boost::make_permutation_iterator(begin(),i.begin()), boost::make_permutation_iterator(begin(),i.end())); } }; int main(int argc,char** argv) { using namespace boost; using namespace boost::assign; using namespace boost::lambda; using boost::lambda::_1; typedef vector_e<int> elem_t; typedef std::vector<int> index_t; elem_t v; int a[] = {00,10,20,30,40,50,60,70,80,90,100}; v.insert(v.end(),a,a+11); const elem_t& cv = const_cast<elem_t&>(v); //v+= 00,10,20,30,40,50,60,70,80,90,100; std::cout<<"original array : "; std::for_each(v.begin(),v.end(),std::cout<<_1<<" "); ///For continuous ranges. elem_t::range r = v.get_range(std::make_pair(1,5)); std::cout<<std::endl<<" range (1,5) : "; ///working fine std::for_each(r.begin(),r.end(),std::cout<<_1<<" "); ///working fine elem_t::const_range cr = v.get_range(std::make_pair(1,5)); std::cout<<std::endl<<" c_range (1,5) : "; std::for_each(cr.begin(),cr.end(),std::cout<<_1<<" "); ///working fine elem_t::const_range cr1 = cv.get_range(std::make_pair(1,5)); std::cout<<std::endl<<" c_range1 (1,5) : "; std::for_each(cr1.begin(),cr1.end(),std::cout<<_1<<" "); index_t i; i+=0,2,6,4,9; std::cout<<std::endl<<" index : "; std::for_each(i.begin(),i.end(),std::cout<<_1<<" "); std::cout<<std::endl<<"index range "; //working fine std::for_each(v.begin_i(i),v.end_i(i),std::cout<<_1 << " "); std::cout<<std::endl<<"c index range "; ///working fine std::for_each(cv.begin_i(i),cv.end_i(i),std::cout<<_1 << " "); ///not working (and its const counter part ) elem_t::range ir = v.get_range(i); } The error it is giving in visual studio 7.1 for sub_range of permutation_iterator is, E:\boost_1_33_1\boost\range\iterator_range.hpp(60): error C2440: 'type cast' : cannot convert from 'boost::range_iterator<C>::type' to 'boost::range_iterator<C>::type' with [ C=const boost::iterator_range<vector_e<int>::index_iterator> ] and [ C=vector_e<int>::self_type ] The questions are 1) Can anyone point out the problem ? (Is sub_range is typed by iterator by any chance, or typed by container only ? ) 2) This is aux question. How to make assign library work for my inherited container (vector_e here ), like the commented line ? any help is appreciated, and thanks to the community . abir -- Abir Basak, Member IEEE Software Engineer, Read Ink Technologies B. Tech, IIT Kharagpur email: abir(a)abirbasak.com homepage: www.abirbasak.com

1 1

[BGL] Dijkstra visitor for examine edge event
by Alejandro Marcos Aragón 22 Feb '07

22 Feb '07

Hi everyone, I posted this message but I haven't received any response so I decided to post it again. I am trying to store all the vertices with their respective distances from a source within the Dijkstra shortest path algorithm. For that I plan to use a std::vector<std::queue > >. I was able to have the visitor working but I don't know how to access to those values that are computed automatically by the algorithm (d_v, d_u, for example). The code I wrote is as follows: template <class Tag> struct vis : public default_dijkstra_visitor { vis() { } template <class Edge, class Graph> void edge_relaxed(Edge e, Graph& g){ cout<<"VISITOR!!!"<<endl; cout<<"Edge -> "<<e<<endl; } private: std::vector<std::queue<Vertex> > storage; }; template <class Tag> vis<Tag> target_visit(Tag) { return vis<Tag>(); } void Dijkstra() { // maps needed by the algorithm IndexMap indexmap = get(vertex_index, *gPtr); WeightMap weightmap = get(edge_weight, *gPtr); // define containers for the predecessor vertices and // for distances std::vector<Vertex> pred(num_vertices(*gPtr)); std::vector<double> dist(num_vertices(*gPtr)); // vertex to compute Dijkstra's algorithm on Vertex source = vertex(get_source(), *gPtr); // Dijkstra's algorithm dijkstra_shortest_paths(*gPtr, source, predecessor_map(&pred[0]).distance_map(&dist[0]).visitor(target_visit(on_examine_edge()))); ... Any help will be appreciated. a^2

2 3

[BGL] merger parallel edges
by Shufei Fan 22 Feb '07

22 Feb '07

Hi, I am new to Boost Graph Library. I have two questions. I defined my graph like this: struct Node{ int label; int mode[3]; //...;}; struct Edge{ double nCommBord;}; typedef boost::adjacency_list< boost::vecS, boost::vecS, boost::undirectedS, Node, Edge> Graph;Somewhere in my program, I construct it using add_edge() method. What I want is, I allow parallel edges, but I all parallel ones being merged(weight summed together). Can I add edges one by one, and use an general method to 'magically' merge them?(is there a function doing merging?) My second question is, where should I find a complete list of usage of all the library methods(say, manual for add_edge) Thanks, Regards, Shufei _________________________________________________________________ Invite your mail contacts to join your friends list with Windows Live Spaces. It's easy! http://spaces.live.com/spacesapi.aspx?wx_action=create&wx_url=/friends.aspx…

2 1

[signals] connection::add_tracked() proposal
by Frank Mori Hess 21 Feb '07

21 Feb '07

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I'd like to propose we add an add_tracked() function to the connection object. This would allow an arbitrary shared_ptr/weak_ptr to be added to the list of objects tracked for the slot. The justification is to allow for situations where an object needed by the slot is not directly owned by a shared_ptr, or doesn't directly correspond to an argument of the bound function. For example, the bound argument might be contained inside another object which is in turn managed by a shared_ptr. We could actually dump boost::track() entirely if we wanted, if we have add_tracked(). - -- Frank -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.1 (GNU/Linux) iD8DBQFF3Gxq5vihyNWuA4URAmS+AJkB3tgE/8p7GlCY+xq+UwfTFjZwigCgoQh0 fgQdVgH73Oh3j1g34HNy+JY= =3UVL -----END PGP SIGNATURE-----

4 9

Serialization newbie question
by Surya Kiran Gullapalli 21 Feb '07

21 Feb '07

Hello all, I'm a newbie to boost serialization and i need some help. I'm using boost serialization, to serialize a class, which contains 3 std::string members. After i serialize i add it to a database. The database I'm using is berkeley-db. The database API needs key/data pair, both in void* type. Now for my problem, the key is std::string, so I'm passing in key as (void *)key.c_str(), I know its crude, but i'm just starting. Now for the data part, I've to serialize the complete class. As, boost::archive::binary_oarchive, takes ostream& as argument for constructor, I've done like this. std::ostringstream os ; boost::archive::binary_oarchive oa (os) ; oa << class_obj ; so the class_obj has been written to os. so i'm sending data to db api as (void *)os.str().c_str(). To retrieve data, I'm using something like this data=db.get_data() ; istringstream is((char *)data) ; boost::archive::binary_iarchive (is) ; The code compiled fine and at run time i'm getting exception basic::string::resize during construction of binary_iarchive. Obviously i was doing wrong. My question is how to serialize data and write it to memory than to a file? and how do i access it again? Thanks in advance, Surya

2 3

Boost Serialization library with Berkeley-DB
by Surya Kiran Gullapalli 21 Feb '07

21 Feb '07

Hello all, Has any body ever used Boost serialization library with Berkeley-DB database to store/retrieve data. I'd like some pointers on how to use it?. Sample code would be most appreciated. Thanks, Surya

1 0

How to build guid lib?
by Christian Henning 21 Feb '07

21 Feb '07

Hi there, it's not as easy as I thought it would be. I copied the guid files in the appropriate folders in my boost/ directory. And then I tried: bjam -sTOOLS=vc-7_1 --with-guid But that doesn't work. So, how do I do that? I really have no clue about bjam, etc. Thanks in advance, Christian

4 10

[graph] Crash in breadth_first_search
by Jens Müller 21 Feb '07

21 Feb '07

Can someone help me with the following program? It crashes with Boost 1.33.1 on gcc34 (GCC) 3.4.3 20050113 (Red Hat 3.4.3-16): $ ./1 make_map_as_colormap entered writing something to MapAsColorMap Speicherzugriffsfehler I have tracked down the crash to this line in <boost/graph/breadth_first_search.hpp>: for (tie(ei, ei_end) = out_edges(u, g); ei != ei_end; ++ei) { But I don't know what happens there ... I'm quite sure the bug is NOT in my color map proxy ... Thanks a lot in advance! Cheers, Jens // //======================================================================= // Copyright 2007 University of Karlsruhe // Author: Jens Mueller // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) //======================================================================= // #ifndef BFS_DISTMAP_8737 #define BFS_DISTMAP_8737 /* Use distance map (or anything else which suits the following requirements) as a color map. Write operations are just ignored. Read operations work as follows: When the value in the underlying map equals a specified value, e.g. -1 in a distance map, or the null pointer in a predecessor map, the 'White' value is returned, otherwise the 'Black' value is returned. Note: This only is usable for application where there is no need to distinguish gray and black non-tree edge targets. Note: Setting the value in the underlying map so that it no longer corresponds to a 'White' value will have to be done by the visitor on the discover_vertex event. */ /* Template parameters: - ColorValue (default value used by helper function: default_color_type) - ReadablePropertyMap (underlying map) */ /* Runtime parameters: - ReadablePropertyMap pm - ReadablePropertyMap::value_type white (must be == comparable) */ #include <boost/property_map.hpp> #include <iostream> template<typename ReadablePropertyMap, typename ColorValue> class MapAsColorMap { private: typename boost::property_traits<ReadablePropertyMap>::value_type white_; const ReadablePropertyMap& pm_; public: typedef typename boost::property_traits<ReadablePropertyMap>::key_type key_type; typedef ColorValue value_type; typedef ColorValue reference; typedef boost::read_write_property_map_tag category; ColorValue get(key_type key); MapAsColorMap(const ReadablePropertyMap& pm, typename boost::property_traits<ReadablePropertyMap>::value_type white): white_(white), pm_(pm) { /* nothing */ }; }; template<typename ReadablePropertyMap> MapAsColorMap<ReadablePropertyMap, boost::default_color_type> make_map_as_colormap(const ReadablePropertyMap& pm, typename boost::property_traits<ReadablePropertyMap>::value_type white) { std::cout << "make_map_as_colormap entered" << std::endl; return MapAsColorMap<ReadablePropertyMap, boost::default_color_type>(pm, white); } template<typename ReadablePropertyMap, typename ColorValue> ColorValue MapAsColorMap<ReadablePropertyMap, ColorValue>::get(key_type key) { std::cout << "get entered" << std::endl; std::cout << key << " " << boost::get(pm_, key) << std::endl; return (boost::get(pm_, key)==white_) ? boost::color_traits<ColorValue>::white() : boost::color_traits<ColorValue>::black(); } template<typename ReadablePropertyMap, typename ColorValue> ColorValue get(MapAsColorMap<ReadablePropertyMap, ColorValue> pmap, typename boost::property_traits<ReadablePropertyMap>::key_type key) { return pmap.get(key); } template<typename ReadablePropertyMap, typename ColorValue> void put(MapAsColorMap<ReadablePropertyMap, ColorValue> pmap, typename boost::property_traits<ReadablePropertyMap>::key_type key, typename boost::property_traits<ReadablePropertyMap>::value_type value) { std::cout << "writing something to MapAsColorMap" << std::endl; /* nothing */ } #endif

3 7

local variable shadow
by Chris Saunders 21 Feb '07

21 Feb '07

I find local variable shadow warnings helpful, but when I include various boost libraries, I have to remove a lot of shadowing within the boost functions themselves. Note that I'm not refering to name conflicts with my own code. How can I submit patches to remove these type of warnings? Thanks, -Chris

3 3

[boost::program_options] got stuck with some options scenario
by Ovanes Markarian 21 Feb '07

21 Feb '07

I have some requirement for input parameters: Some of my input parameters represent a pair of files. Is there any way to parse this kind of a form: -I "file1" "file1_related_file" Trying to use the construct with: po::value< std::pair<std::string,std::string> >() produces a compilation error within a lexical cast, that there is no operator >> defined. I know I could pass smth like: -I "fiel1+related_file", but then I would need to split the string, what I would like to do, since I see this as a task of program_options lib. With Kind Regards, Ovanes Markarian

1 0

question about pool::get_next_size/set_next_size
by Stefan Felkel 21 Feb '07

21 Feb '07

Hi, is there a way to access pool::get_next_size, pool::set_next_size from my own fast_pool_allocator without modifying the boost source (1.33.1). This my_fast_pool_allocator is a copy of fast_pool_allocator that tries to allocate the requested memory with next_size divided by 2 if malloc returns NULL. I added static member functions get_next_size/set_next_size to singleton_pool which works, but is there a way without modifying the boost source. If not, would it make sense to add these two methods in a future boost release. This is the allocate method of my_fast_pool_alloctor: template <typename T, typename UserAllocator, typename Mutex, unsigned NextSize> class my_fast_pool_allocator { ... static pointer allocate(const size_type n) { typedef boost::singleton_pool<boost::fast_pool_allocator_tag, sizeof(T), UserAllocator, Mutex, NextSize> mypool; pointer ret = NULL; for( ; !ret; ) { if (n == 1 ) { ret = static_cast<pointer>( mypool::malloc() ); } else { ret = static_cast<pointer>( mypool::ordered_malloc(n) ); } size_t nsize = mypool::get_next_size(); if( !ret ) // not enough memory available { if( nsize <= n ) // even less than we really need break; nsize >>= 1; // request half the size nsize = std::max( nsize, n ); // at least as much as we really need } mypool::set_next_size(nsize); } if (ret == 0) throw std::bad_alloc(); return ret; } ... }; Regards, Stefan

1 0

question about boost::interval
by Marco Correia 21 Feb '07

21 Feb '07

Hi, I'm a little bit confused about the documentation in http://www.boost.org/libs/numeric/interval/doc/rounding.htm, in the subsection "Transcendental functions". Does the "Please note" paragraph means that the provided classes for transcendal functions (_opp and _std) do not guarantee the inclusion property? From what I understood it says that it depends on the implementation of the std::* math functions, that, in most cases, don't obey current rounding mode. Am I getting this right? In case I am, does anyone knows if I'm safe with gcc std library (perhaps by using the -frounding-math switch)? Thanks! Marco -- Marco Correia <mvc(a)di.fct.unl.pt>

2 2

missing files?
by Jan Van den bosch 21 Feb '07

21 Feb '07

Hi, I'm trying to build the examples of the Channel event framework ( channel.sourceforge.net) Apparently, the Boost archives at sourceforge (.zip, .tar.gz and .tar.bz2 files) are missing several necessary files, like serialization/array.hpp. When I do a CVS checkout of Boost however, those files are included. Are they still part of Boost? Thanks in advance, Jan

1 0

split_iterator<string::iterator> example
by Meryl Silverburgh 21 Feb '07

21 Feb '07

hi, Can someone please tell me where I can find example of split_iterator<string::iterator> If I have 2 split_iterator<string::iterator>s, how can I compare the 2 strings that the split_iterator pointing to? Thank you.

2 13

[Boost][bind] problem using bind with non-copyable class members?
by Darren Garvey 21 Feb '07

21 Feb '07

Hi, I'm trying to use bood::bind and I'm having a problem with compilation when I'm passing an object that holds a std::stringstream. The errors are to do with std::ios_base and std::streambuf's copy constructors being private, but as far as I knew (and understand from the docs), boost::bind passes by reference, so nothing should be copied. I'm sure I'm missing something fundamental here, so any enlightening would be very welcome. My setup is gcc 4.1.2 on Ubuntu 6.10. Here's an example program that fails: #include <sstream> > #include <boost/bind.hpp> > #include <boost/thread.hpp> > > using namespace boost; // sorry > using namespace std; // oops > > > struct holder > { > std::ostringstream oss; > }; > > void sub_main( holder& h ) > { > return; > } > > class event_handler > { > public: > void operator() ( holder& h ) > { > thread t( bind( &sub_main, h ) ); > t.join(); > } > }; > > int main( int, char** ) > { > event_handler e_h; > holder h; > > e_h(h); > > return 0; > } Regards, Darren

2 2

[signals] building sandbox documentation?
by Frank Mori Hess 20 Feb '07

20 Feb '07

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Timmo, Do you know a bjam command to build the signals documentation in boost-sandbox/libs/signals/doc ? I'd like to update them to reflect the changes we've made for thread safety. Do I have to copy the files over to a real boost source tree to get them to build? I am not very familiar with bjam. - -- Frank -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.1 (GNU/Linux) iD8DBQFF2xd85vihyNWuA4URAkBBAJ43BFzalbQSbzMaKNWuaEPR3tEpUQCdE67i 7ozVU/0NcLWKVW8gNv4KR5E= =WB61 -----END PGP SIGNATURE-----

2 2

Re: [Boost-users] Cannot build boost on MSVS8 per instructions
by DAVID CRAVEY 20 Feb '07

20 Feb '07

Hi All, I am having the same errors as in this post: http://lists.boost.org/boost-users/2006/09/22001.php I have tried downloading the boost-jam both binary: boost-jam-3.1.13-1-ntx86.zip (I get the same error as the above post) And from source: boost-jam-3.1.13.zip I get a "Debug Assertion Failed!" error when I run build.bat Program: C:\Boost\boost-jam-3.1.13\bootstrap\jam0.exe File: dtoxtm64.c Line: 67 Expression: ( ( ( long )( yr - 1990) >= BASE_YEAR) && ( ( long )( yr - 1990 ) <= _MAX_YEAR64 ) ) Running the prebuilt bjam.exe file in the Threads build directory (running from Visual Studio 2005 Command Prompt): C:\Boost\boost_1_33_1\libs\thread\build>bjam "-sTOOLS=vc-8_0" Built three library files. So I think the bjam.exe file probably is not corrupt. If I run (from Visual Studio 2005 Command Prompt): C:\Boost\boost_1_33_1>bjam "-sTOOLS=vc-8_0 --with-threads" I get the same 00012f2a error as before. Other Notes: I have Visual C++ 2003 Standard and Visual Studio 2005 Pro Installed. Starting with the appropriate command prompt, I get the same error on both at Offset 0001f2fa. My machine is an Dell Latitude Centrinio Running Windows XP Pro SP2. Any help would be greatly appreciated! Thanks, David Cravey

3 2

Boost serilaization onexit problem
by gast128 20 Feb '07

20 Feb '07

Dear all, We use (too many) singletons in our program and now the program crashes in Boost Serialization because in an onexit function a static member (oserializer::instantiate) of Boost Serialization is already destroyed. Is there a way to force an intialisation of these static members so that they are destroyed after my singleton destroys? The code can be reproduced by the follwing snippet: // #define BOOST_ALL_DYN_LINK #define BOOST_LIB_DIAGNOSTIC #include <fstream> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/xml_oarchive.hpp> #include <boost/serialization/base_object.hpp> #include <boost/serialization/version.hpp> struct Foo { Foo() : m_i(0) {} template <class Archive> void serialize(Archive& ar, const unsigned int /*version*/) { ar & BOOST_SERIALIZATION_NVP(m_i); } int m_i; }; void f (); void test_serialize (); //---------------------------------------------------------------------------- // Function main //---------------------------------------------------------------------------- // Description : main //---------------------------------------------------------------------------- int main() { atexit(&f); test_serialize(); return 0; } void f() { test_serialize(); } void test_serialize() { std::ofstream ofs("test.xml"); boost::archive::xml_oarchive oa(ofs); const Foo foo; oa << BOOST_SERIALIZATION_NVP(foo); } wkr, me

2 2

[Review][Bimap] Reviewers needed for Bimap review
by Ion Gaztañaga 20 Feb '07

20 Feb '07

Hi to all, Bimap review started 5 days ago and we're having some good comments but no thorough reviews. I would like to encourage people to write a Bimap review, because we still have five more days and I would propose extending that if that's necessary. Container and STL experts, we need you! I think that Bimap is a great library and I'm pretty sure you'll be happy to review it once you start reading the docs. Start reading the documentation here: http://tinyurl.com/y95qng And download the library here: http://boost-consulting.com/vault/index.php?&directory=Containers Regards, Ion

1 0

Using Boost string library
by Meryl Silverburgh 20 Feb '07

20 Feb '07

Hi, I need to compare 2 strings in this format (a integer separator by '/': /1/1 /1/1/2 /1/1/3 so "/1/1" is less than "/1/1/2" and "/1/1/2" is less than " "/1/1/3". Is there anything in Boost string library to help me to write such a comparison? Is there a string iterator which literates base on the separator '/'? My idea is to find an iterator to loop thru the string based on separator '/'. Thanks for any idea.

3 14