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

[operators] loss of performance
by Brian Budge 09 May '06

09 May '06

Hi all - I just tried out the operators library for the first time today. I was quite happy with how easily it helped me implement my test class. Unfortunately, I'm running into some performance issues, in particular with operator +. The interesting thing is that the new operator += is actually faster than my old += by about a factor of 2, but my operator + is slower than my old + by a factor of nearly 10! I'm new here, and not really sure how much code is appropriate to post to the list, so here's a minimal rundown: -------------------------------------------------------------------------- Old code: template<typename real> Vector3<real> operator + (const Vector3<real> &a, const Vector3<real> &b); template<typename real> class Vector3 { protected: real m_v[3]; . . friend Vector3 operator +<> (const Vector3 &a, const Vector3 &b); }; template<typename real> inline Vector3<real> operator + (const Vector3<real> &a, const Vector3<real> &b){ Vector3<real> t; t[0] = a[0] + b[0]; t[1] = a[1] + b[1]; t[2] = a[2] + b[2]; return t; } ------------------------------------------------------------------------------------------------- New code (note that the new code is templatized on size, and that my instantiations were of size 3 to match the above code): template<typename T, unsigned int S> class vec : boost::additive< vec<T, S> , boost::multiplicative< vec<T, S>, T > > { private: typedef unsigned int uint; typedef const T &const_reference; typedef T &reference; private: boost::array<T,S> m_v; template<typename U> vec &operator += (const vec<U,S> &t){ for(uint i = 0; i < S; ++i){ m_v[i] += t.m_v[i]; } return *this; } }; Any ideas how to increase the performance of the new code here? A factor of 10 makes it seem like I am just missing something important. Thanks, Brian

5 6

[boost][test] - BOOST_FIXTURE_TEST_SUITE, BOOST_FIXTURE_TEST_CASE clarification
by Ed Johnson 09 May '06

09 May '06

In 1.33.1 release, is the following true? BOOST_FIXTURE_TEST_SUITE( suite_name, F ); //not supported BOOST_FIXTURE_TEST_CASE( test_name, F ); //not supported Thanks, Ed

2 6

Building boost on Mac OS 10.4
by Zokirov, Umed 08 May '06

08 May '06

Hi there, Has anyone successfully built Boot 1.33.1 on Moac OS X 10.4? In my case it fails to build test - related libs. I fugured out the issue with two-level namespacing, however waas not successful with specific linker settings to solve them Perhaps, boost-build mailing list is better to ask, nevertheless, I would suppose some of the users actually built boost. Umed

2 1

Inconsistency between boost::bind and boost::lambda::bind
by Gerardo Lamastra 08 May '06

08 May '06

Hello everybody, I've started to use the functional programming facilities offered by boost, and they're really impressive. To begin with, I've started using both; I've seen however, that when I #include both <boost/bind.hpp> and <boost/lambda/bind.hpp> I must use full namespace names to address lambda placeholders. In other words, instead of writing for_each(container.begin(), container.end(), cout << _1 << constant('\n')); I've to write for_each(container.begin(), container.end(), cout << boost::lambda::_1 << boost::lambda::constant('\n')); also if I've written a using boost::lambda declaration; I know, I can simplify this using a namespace alias, but I was trying to keep the code less clobber as I can, because it has to be used for teaching/example purposes. So, my first question would be: where could I find an exhaustive comparison between these two facilities? And, is there any indication on what to prefer, also related to future development and/or inclusion in C++ standards (If I remember well, boost::lambda has been proposed in tr1?) The second question points at a small inconsistency that I believe I've found while doing some experiments: boost::bind and boost::lambda::bind offer similar construct, but the former works while the latter fails in the example included below. I'm using boost_1_33_1, with g++ -v (provided below) Target: i586-mandriva-linux-gnu Configured with: ../configure --prefix=/usr --libexecdir=/usr/lib --with-slibdir=/lib --mandir=/usr/share/man --infodir=/usr/share/info --enable-shared --enable-threads=posix --disable-checking --enable-languages=c,c++,ada,f95,objc,java --host=i586-mandriva-linux-gnu --with-system-zlib --enable-long-long --enable-__cxa_atexit --enable-clocale=gnu --disable-libunwind-exceptions --enable-java-awt=gtk --with-java-home=/usr/lib/jvm/java-1.4.2-gcj-1.4.2.0/jre --enable-gtk-cairo --disable-libjava-multilib Thread model: posix gcc version 4.0.1 (4.0.1-5mdk for Mandriva Linux release 2006.0) The situation is the following: if I try to create a nullary lamnda function with boost::lambda::bind() like this: generate_n(inserter(v, v.begin()), 10, boost::lambda::bind<Slave*>( boost::lambda::new_ptr<Slave>(),*this) ); the compiler fails to compile: it tries to pass the this pointer as a const reference somehow, and then it fails claiming that a Slave(const Master& m) cannot be found; If I try to add one, it fails with a similar error. If I substitute the boost::lambda::bind() with a boost::bind(), it compiles & works perfectly. Thanks for the attention, -Gerardo Lamastra ------------------------------------------------------------------------- #include <set> #include <algorithm> #include <iterator> #include <iostream> #include <boost/lambda/lambda.hpp> #include <boost/lambda/construct.hpp> #include <boost/lambda/bind.hpp> #include <boost/bind.hpp> using namespace std; using namespace boost::lambda; class Master; struct Slave { static int globalId; Master& master; int id; Slave(Master& m) : master(m), id(++globalId) {}; }; int Slave::globalId = 0; class Master { struct Builder { typedef Slave* result_type; Slave* operator()(Master& master) { return new Slave(master); }; }; static Slave* build(Master& master) { return new Slave(master); } public: void print(set<Slave*> s) { for_each(s.begin(), s.end(), (cout << constant("S: ") << (boost::lambda::_1) ->* &Slave::id) << '\n' ); } void f1() { /* This is the most trivial thing I've tried, but I need to write builder explicitely; */ set<Slave*> v; generate_n(inserter(v, v.begin()), 10, boost::bind(Builder(),*this) ); print(v); } void f2() { /* A more compact, but substantially identical form */ set<Slave*> v; generate_n(inserter(v, v.begin()), 10, boost::bind(&Master::build,*this) ); print(v); } void f3() { /* Does not work; it seems that the object passed to the compiler is a const Master& instead of just a Master&, it is like that the boost::lambda::bind() adds a const where that is not required... I tried to substitute the Master& in the Slave() constructor with a const Master& but it does not work either */ /* set<Slave*> v; generate_n(inserter(v, v.begin()), 10, boost::lambda::bind(&Master::build,*this) ); print(v); */ } void f4() { /* The same issue applies here... * This has been my original experiment, which * motivated all this trouble... */ /* set<Slave*> v; generate_n(inserter(v, v.begin()), 10, boost::lambda::bind<Slave*>( boost::lambda::new_ptr<Slave>(),*this) ); print(v); */ } void f5() { /* A work-around that I come up with, * mixing boost::bind && boost::lambda::new_ptr */ set <Slave*> v; generate_n(inserter(v, v.begin()), 10, boost::bind<Slave*>(boost::lambda::new_ptr<Slave>(),*this) ); print(v); } }; int main() { Master m; cout << "F1: " << endl; m.f1(); cout << "F2: " << endl; m.f2(); cout << "F5: " << endl; m.f5(); } -------------------------------------------------------------------- CONFIDENTIALITY NOTICE This message and its attachments are addressed solely to the persons above and may contain confidential information. If you have received the message in error, be informed that any use of the content hereof is prohibited. Please return it immediately to the sender and delete the message. Should you have any questions, please contact us by replying to webmaster(a)telecomitalia.it. Thank you www.telecomitalia.it --------------------------------------------------------------------

3 2

[date_time] What's the proper way to convert local to UTC?
by Scott 08 May '06

08 May '06

Note: Reposting in hopes of getting an answer. c_local_adjustor has the static method "utc_to_local" to easily convert to local time based on the machine TZ setting. So I figured it had a utc_from_local or local_to_utc method as well. Neither compiled, so I looked at the header file c_local_time_adjustor.hpp: //! Adjust to / from utc using the C API Yet there is only that one method in the class. Is the missing ability to convert from local to UTC an oversight or is it implemented somewhere else? What's the correct way to do it? Thanks, Scott

1 0

Re: [Boost-users] [shmem] New bugfix version in Boost Vault and sandbox cvs
by bwood 08 May '06

08 May '06

Ion Gaztañaga wrote: >Jan Stetka(e)k dio: >> Yes I understand that I can't use shmem::map and std::map if they are >> both on the global namespace. I've looked at the implementation of the >> std::map header from the STL implementation that is included in vc++ 7.2 >> and that doesn't forward declare std::list in <map>. This is a design >> issue rather than a bug. Why forward declare shmem::list by including it >> in map.hpp when it isn't used? > > >All classes in Shmem include shmem_fwd.hpp or container_fwd.hpp where >Shmem defines default arguments (for example default Less, or Allocator >template parameter). That's why you get the predeclaration of list >including map. Another alternative would be to declare a *_fwd.hpp for >each class defined in Shmem, but you would get a lot of extra headers, >and I would have a lot of work to maintain. > > >Even if I don't include list predeclaration with map, I'm free to use >any Shmem container in any Shmem class (for example, I can implement a >pooled allocator using a list container), so it's likely that a Shmem >class include will include more Shmem classes (predeclarations, or full >declarations). I don't consider it a design error, but a design choice. >What I see dangerous is pushing two namespaces, std, and shmem to the >same context because they have similar classes. An alternative would be >to rename shmem classes like "vector" to "shmem_vector", .... But >weren't namespaces born to allow that? I think this is their intended purpose, but I don't like using them that way. It gets confusing and brevity isn't attained as you have to qualify things. Namespaces support a "let's just agree to disagree" approach that isn't a resolution, but is the best that can be done at times. Do you think this shmem functionality should be integrated with the std containers? In the meantime, I think shmem_vector is better. Does shmem support multi_index_containers? Or, depending on how shmem fits into the picture, should B.MI take the lead in supporting shmem functionality internally? Y'all have more flexibility in the B.MI case as it isn't part of the standard. Brian www.webEbenezer.net

4 4

Re: [Boost-users] Thread-safe smart pointers, hashtables without locking
by Ray Whitmer 08 May '06

08 May '06

> I'd also say the idea of moving a pointer out of the way, and then > using the > flip-gate-count-thing to wait for any 'potentially-using' readers > to finish, > definitely has 'potential'. You would need to show detailed code to > really > be sure. And not to us - to the guys on comp.programming.threads. Thanks. I will plan on pursuing it, then. > Anyhow, if you haven't already, take a look at memory barriers, > and, as a > canonical example, the broken 'double checked locking pattern'. You > can't > do lock free without understanding this stuff. I was somewhat aware of memory ordering and especially compiler reordering, but I need to take another look at it and find the proper set of macros for use in non-kernel code since volatile does not (yet) guarantee hardware behavior between processors. > And you are correct, you can't make { reading the > location of a shared_ptr + incrementing its ref-count } atomic, it > least not > on most processors. Actually, I was not concerned with incrementing the ref count. The flip-gate-count-thing solves, I believe, the problem of reference counts not being up to date all the time. I realize that I still have to prove this, but I do not think it is hard. What worries me more is whether the smart pointer has one or two fields in it, because this affects whether readers find an incomplete/ broken smart pointer as they whiz by. With a single pointer field in it, the load and store are atomic. > I don't think the boost implementation of intrusive_ptr's operator= > () is > atomic, but it could be made to be. shared_ptr has two pointers in it, (one to the shared count, one for the pointer) whereas intrusive_ptr has a single pointer in it (since the count is internal to the referenced class). This means that the shallow bits of shared_ptr are not atomically initialized, whereas those of intrusive_ptr are. An obvious way to solve this would be to make shared_ptr contain a single pointer to a wrapper class that contains both the shared count and a shared pointer, but this adds an unacceptable level of indirection to basic pointer operations. > Your wording of 'much less likely' is scary, and I think similar > wording > made James apprehensive as well. There is no grey - it is black or > white, > thread safe or not. I will have to adjust my language. I tend to use uncertain language both because I consider my knowledge incomplete and because of the lack of a generic standard that guarantees behavior, i.e. the fact that different Linux kernel architectures need different memory barriers, etc. is demonstration of the uncertainty of a general C solution. If I can rely on something like what the Linux kernel relies on, it should not be scary. Behavior needs to be guaranteed on supported platforms, and other platforms need to be detected and fail to compile lock-free or revert to a locking fallback implementation, etc. Ray Whitmer

2 1

Re: [Boost-users] [operators] loss of performance
by Victor A. Wagner Jr. 08 May '06

08 May '06

At 23:05 2006-05-07, you wrote: >Hi all - > >I just tried out the operators library for the first time today. I >was quite happy with how easily it helped me implement my test class. >Unfortunately, I'm running into some performance issues, in particular >with operator +. > >The interesting thing is that the new operator += is actually faster >than my old += by about a factor of 2, but my operator + is slower >than my old + by a factor of nearly 10! > >I'm new here, and not really sure how much code is appropriate to post >to the list, so here's a minimal rundown: > >-------------------------------------------------------------------------- >Old code: > >template<typename real> >Vector3<real> operator + (const Vector3<real> &a, const Vector3<real> &b); > >template<typename real> >class Vector3 { >protected: > real m_v[3]; >.. >.. > friend Vector3 operator +<> (const Vector3 &a, const Vector3 &b); >}; > >template<typename real> >inline Vector3<real> operator + (const Vector3<real> &a, const >Vector3<real> &b){ > Vector3<real> t; > t[0] = a[0] + b[0]; > t[1] = a[1] + b[1]; > t[2] = a[2] + b[2]; > return t; >} > >------------------------------------------------------------------------------------------------- >New code (note that the new code is templatized on size, and that my >instantiations >were of size 3 to match the above code): > >template<typename T, unsigned int S> >class vec > : boost::additive< vec<T, S> > , boost::multiplicative< vec<T, S>, T > > > >{ >private: > typedef unsigned int uint; > typedef const T &const_reference; > typedef T &reference; > >private: > boost::array<T,S> m_v; > > template<typename U> > vec &operator += (const vec<U,S> &t){ > for(uint i = 0; i < S; ++i){ > m_v[i] += t.m_v[i]; > } > return *this; > } >}; > >Any ideas how to increase the performance of the new code here? A >factor of 10 makes it seem like I am just missing something important. you showed us the code that you claim is faster, what do you want us to do? >Thanks, > Brian >_______________________________________________ >Boost-users mailing list >Boost-users(a)lists.boost.org >http://lists.boost.org/mailman/listinfo.cgi/boost-users Victor A. Wagner Jr. http://rudbek.com The five most dangerous words in the English language: "There oughta be a law"

2 1

[date_time] strange warning
by george 08 May '06

08 May '06

hello! try { boost::gregorian::date date_start(boost::gregorian::from_string(start)); boost::gregorian::date date_end(boost::gregorian::from_string(end)); boost::gregorian::date today(boost::gregorian::day_clock::local_day()); if(date_start > date_end || date_start < today || date_end.year() > today.year()) return false; period_=new boost::gregorian::date_period(date_start,date_end); return true; } catch(...) { return false; } .../boost/date_time/constrained_value.hpp: In member function ‘virtual bool Reservation::validation(std::string&)’: .../boost/date_time/constrained_value.hpp:64: warning: ‘year$D34041$value_’ is used uninitialized in this function .../date_time/constrained_value.hpp:64: warning: ‘year$D34041$value_’ is used uninitialized in this function why I get this warning? any idea? thanks

2 2

Re: [Boost-users] [multi_index] const mem_fun serialization bug.
by JOAQUIN LOPEZ MU?Z 08 May '06

08 May '06

----- Mensaje original ----- De: Julien Pervillé <julien.perville(a)free.fr> Fecha: Sábado, Mayo 6, 2006 9:15 pm Asunto: [Boost-users] [multi_index] const mem_fun serialization bug. > Hello boost-users. > > I am writing to report an annoying serialization bug encountered > while developing a project with Boost.multi_index, which is a > wonderfully useful data structure. Thank you Joaquín! > > First a fast overview of my project: [...] > After hunting through the headers, I located the triggered > exception to line 1080 of boost/multi_index/ordered_index.hpp > (line number from boost 1.33) > > Here is the context from the "rearranger" method where the > exception is thrown: > > > 1080 if(position!=x){ In Boost 1.33, tis is actually line 1088. Maybe a typo in your post? Anyway, I don't think this is important. [...] > I am looking forward to test patches and offer my help testing, > so that this little quirk gets solved. Hello Julien, thank you very much for using Boost.MultiIndex and for providing such a detailed bug report, with reproducible test case and all --actually, having the test case has made it easy to spot the problem. This is a bug in B.MI, but it has nothing to do with const_mem_fun. Rather it lies in the serialization loading algorithm. I'd like you to make the following changes in your local copy of B.MI (I'm assuming you've got 1.33 as per what you say in the post): 1. Replace line 80 in boost/multi_index/detail/duplicates_iterator.hpp: if(pred(begin_chunk->value,node->value))advance(); with the following: if(node!=end&&pred(begin_chunk->value,node->value))advance(); This bug was previously spotted by Toby Smith, and it's currently fixed in the CVS version of B.MI, soon to be shipped with Boost 1.34. More details at: http://lists.boost.org/boost-users/2006/01/16710.php 2. Replace the beginning of rearranger() at line 1076 of boost/multi_index/ordered_index.hpp: void rearranger(node_type* position,node_type *x) { node_type* before; if(!position){ ... with the following: void rearranger(node_type* position,node_type *x) { node_type* before; if(!position||comp(key(position->value),key(x->value))){ ... 3. Undo your previous hack which bypassed the archive_exception throw. That's it. I can confirm this makes seri-bug.cpp work OK. Could you please verify whether it also solves the problems in your real project? I'll devote some days to carefully study the issue and, if nothing weird shows, will commit the fix in the CVS HEAD and 1_33_4 branches next week. Please comment your results back. Thanks for reporting, best regards, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

3 2

a problem on boost::asio
by 李慧霸 08 May '06

08 May '06

I'm trying asio on WindowsXPSP2 + VS2003, and I found that there are always some connections established from 127.0.0.1:xxxx to 127.0.0.1:yyyy, is it a bug?

1 0

How to test whether a vertex or edge exists?
by sean yang 08 May '06

08 May '06

I want to add a vertex, which a string as its ID to a graph if a vertex representing such a string does not exist in the graph. Is there a function call to test if a vertex exists in a graph? ----------------------------------------------------------------------- //Here is the simpilfied situation that I want to handle, "IF THERE IS NOT a vertex representing the //string of the current line" is the predicate I want to know typedef adjacency_list<vecS, vecS, directedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, int> > Graph; Graph g(); ifstream infile; infile.open(argv[1]); string line; while( getline(infile, line) ){ if(line.find("Node")!= npos && /*IF THERE IS NOT a vertex representing the string of the current line*/) add_vertex( line, g); } -------------------------------------------------------------------- A related question I want to ask is whether there exist a function call that test whether an edge representing [vertext string("Node1") --> vertext string("Node2") ] exists in a graph. Thanks a lot, Sean _________________________________________________________________ Express yourself instantly with MSN Messenger! Download today - it's FREE! http://messenger.msn.click-url.com/go/onm00200471ave/direct/01/

2 3

A Problem with boost::bind
by Hossein Haeri 07 May '06

07 May '06

Dear all, A fragment of code of mine is like this: template <class Container, size_t i> struct print { ostream& operator () (const Container& c, ostream& out) const { if(out) { typedef typename Container::value_type value_type; typedef print<value_type, i - 1> NewPrint; NewPrint newPrint; for(typename Container::const_iterator j = c.begin(); j != c.end(); ++j) newPrint(*j, out); /*for_each(c.begin(), c.end(), bind(newPrint, _2, out)); //Error!*/ } return out; } }; AFAICS, there should be no harm in replacing that for with the for_each in the comments -- the one is marked with "//Error" I mean, except that "out" which is of type ostream& is not Copy-Constructible, and therefore _2 cannot be used against it. Anybody having a workarounds for that? Doesn't Boost have anything analog to boost::ref which can give me a Copy-Constructible beast? For your reference, you can find the whole program and the compiler error message in the P.S. TIA, --Hossein P.S. #include <iostream> #include <algorithm> #include <iterator> #include <vector> #include <boost/bind.hpp> #include <boost/mem_fn.hpp> using std::ostream; using std::cin; using std::cout; using std::copy; using std::for_each; using std::ostream_iterator; using std::vector; using boost::bind; using boost::mem_fn; template <class Container, size_t i> struct print { ostream& operator () (const Container& c, ostream& out) const { if(out) { typedef typename Container::value_type value_type; typedef print<value_type, i - 1> NewPrint; NewPrint newPrint; /* for(typename Container::const_iterator j = c.begin(); j != c.end(); ++j) newPrint(*j, out); */ for_each(c.begin(), c.end(), bind(newPrint, _2, out)); //Error! } return out; } }; template <class Container> struct print<Container, 1> { ostream& operator () (const Container& c, ostream& out) const { if(out) copy(c.begin(), c.end(), ostream_iterator<typename Container::value_type>(out, " ")); return out; } ostream& DoIt (const Container& c, ostream& out) const { if(out) copy(c.begin(), c.end(), ostream_iterator<typename Container::value_type>(out, " ")); return out; } }; int main() { int a1[] = {1, 2, 3, 4}; const size_t n(sizeof(a1)/sizeof(*a1)); vector<int> v(a1, a1 + n); print<vector<int>, 1> () (v, cout); int a2[n] = {5, 6, 7, 8}; vector<vector<int> > m; m.push_back(v); m.push_back(vector<int>(a2, a2 + n)); print<vector<vector<int> >, 2> () (m, cout); cin.get(); return 0; } Compiler: Default compiler Executing g++.exe... g++.exe "E:\Print.cpp" -o "E:\Print.exe" -I"C:\Dev-Cpp\include\c++" -I"C:\Dev-Cpp\include\c++\mingw32" -I"C:\Dev-Cpp\include\c++\backward" -I"C:\Dev-Cpp\include" -L"C:\Dev-Cpp\lib" C:/Dev-Cpp/include/c++/3.3.1/bits/ios_base.h: In copy constructor ` std::basic_ios<char, std::char_traits<char> >::basic_ios(const std::basic_ios<char, std::char_traits<char> >&)': E:/Print.cpp:33: instantiated from `std::ostream& print<Container, i>::operator()(const Container&, std::ostream&) const [with Container = std::vector<std::vector<int, std::allocator<int> >, std::allocator<std::vector<int, std::allocator<int> > > >, unsigned int i = 2]' E:/Print.cpp:72: instantiated from here C:/Dev-Cpp/include/c++/3.3.1/bits/ios_base.h:668: error: ` std::ios_base::ios_base(const std::ios_base&)' is private E:/Print.cpp:33: error: within this context E:/Print.cpp: In member function `std::ostream& print<Container, i>::operator()(const Container&, std::ostream&) const [with Container = std::vector<std::vector<int, std::allocator<int> >, std::allocator<std::vector<int, std::allocator<int> > > >, unsigned int i = 2]': E:/Print.cpp:72: instantiated from here E:/Print.cpp:33: error: initializing argument 3 of ` boost::_bi::bind_t<boost::_bi::unspecified, F, typename boost::_bi::list_av_2<A1, A2>::type> boost::bind(F, A1, A2) [with F = print<std::vector<int, std::allocator<int> >, 1>, A1 = boost::arg<2>, A2 = std::basic_ostream<char, std::char_traits<char> >]' C:/Dev-Cpp/include/boost/bind.hpp: At global scope: C:/Dev-Cpp/include/boost/bind.hpp: In instantiation of `boost::_bi::result_traits<boost::_bi::unspecified, print<std::vector<int, std::allocator<int> >, 1> >': C:/Dev-Cpp/include/boost/bind/bind_template.hpp:16: instantiated from `boost::_bi::bind_t<boost::_bi::unspecified, print<std::vector<int, std::allocator<int> >, 1>, boost::_bi::list2<boost::arg<2>, boost::_bi::value<std::basic_ostream<char, std::char_traits<char> > > > >' E:/Print.cpp:33: instantiated from `std::ostream& print<Container, i>::operator()(const Container&, std::ostream&) const [with Container = std::vector<std::vector<int, std::allocator<int> >, std::allocator<std::vector<int, std::allocator<int> > > >, unsigned int i = 2]' E:/Print.cpp:72: instantiated from here C:/Dev-Cpp/include/boost/bind.hpp:62: error: no type named `result_type' in ` struct print<std::vector<int, std::allocator<int> >, 1>' C:/Dev-Cpp/include/boost/bind/bind_template.hpp: In instantiation of `boost::_bi::bind_t<boost::_bi::unspecified, print<std::vector<int, std::allocator<int> >, 1>, boost::_bi::list2<boost::arg<2>, boost::_bi::value<std::basic_ostream<char, std::char_traits<char> > > > >': E:/Print.cpp:33: instantiated from `std::ostream& print<Container, i>::operator()(const Container&, std::ostream&) const [with Container = std::vector<std::vector<int, std::allocator<int> >, std::allocator<std::vector<int, std::allocator<int> > > >, unsigned int i = 2]' E:/Print.cpp:72: instantiated from here C:/Dev-Cpp/include/boost/bind/bind_template.hpp:16: error: no type named `type' in `struct boost::_bi::result_traits<boost::_bi::unspecified, print<std::vector<int, std::allocator<int> >, 1> >' C:/Dev-Cpp/include/boost/bind/bind_template.hpp:19: error: no type named `type' in `struct boost::_bi::result_traits<boost::_bi::unspecified, print<std::vector<int, std::allocator<int> >, 1> >' C:/Dev-Cpp/include/boost/bind/bind_template.hpp:25: error: no type named `type' in `struct boost::_bi::result_traits<boost::_bi::unspecified, print<std::vector<int, std::allocator<int> >, 1> >' C:/Dev-Cpp/include/boost/bind/bind_template.hpp:31: error: no type named `type' in `struct boost::_bi::result_traits<boost::_bi::unspecified, print<std::vector<int, std::allocator<int> >, 1> >' C:/Dev-Cpp/include/boost/bind/bind_template.hpp:31: confused by earlier errors, bailing out Execution terminated ___________________________________________________________ Switch an email account to Yahoo! Mail, you could win FIFA World Cup tickets. http://uk.mail.yahoo.com

4 10

Re: [Boost-users] [MULTI_INDEX] intersection algorithm?
by JOAQUIN LOPEZ MU?Z 07 May '06

07 May '06

Guillaume Lazzara ha escrito: > Hello, > > I am currently using multi_index as "set" container > and I wanted to know how to use intersection algorithm. > I tried with the STL interction algorithm but it > crashed. How can I do? Hello Guillaume. In principle, there's nothing preventing multi_index_container's from working with set_intersection. Could you provide a case where the referred to crash shows? Failing that, a little more detailed explanation or some code? Thank you, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

[SOC] Applicants -- Please Monitor Google for Comments
by Jeff Garland 07 May '06

07 May '06

Hi All - First let me say that we've had a tremendous response thus far to SOC. Some really excellent applications and ideas. I have high hopes that some very exciting Boost projects will come out of SOC. The reason I'm sending this is that I'm trying to reach out to applicants that may not be aware that proposal feedback is being provided on the SOC website. Please check your proposal for comments. Many of the proposals need additional details. There is no automated email when we add comments to a proposal, so you won't be notified. Goggle is looking into adding this, but it isn't there now. There are enough comments and proposals that it would be impractical for us to ensure that everyone got notified when a comment is added. Thanks, Jeff

1 0

Re: [Boost-users] [shmem] New bugfix version in Boost Vault andsandbox cvs
by JOAQUIN LOPEZ MU?Z 06 May '06

06 May '06

----- Mensaje original ----- De: Ion Gaztañaga <igaztanaga(a)gmail.com> Fecha: Sábado, Mayo 6, 2006 9:51 pm Asunto: Re: [Boost-users] [shmem] New bugfix version in Boost Vault andsandbox cvs > > Or, depending on > > how shmem fits into the picture, should B.MI take the lead in > > supporting shmem functionality internally? Y'all have more > > flexibility in the B.MI case as it isn't part of the standard. > > To be able to support Multi-index in shared memory we would need > to > rewrite it to replace all raw pointers with allocator::pointer > typedefs. > I haven't looked through multiindex code but this can be a big > task. > There is nothing that shmem can do to support multiindex if it > uses raw > pointers. But I think that multiindex and shmem can be a good base > for > in-memory data-bases. > I wholeheartedly agree with you shmem and multi_index should be able to interoperate nicely. My other activities in B.MI, and my rather shallow knowleddge of shmem, prevent me from attacking this task right away, but I'd be happy if some bold Booster could do some analysis/prototype of the changes involved in B.MI for it to work with shmem, so that eventually I can integrate those changes. If someone is up to the task, do count on my support/assitance for matters concerning the inner structure of B.MI. Best regards, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

[serialization] problems with using wide-char archives
by Hilal Shaath 06 May '06

06 May '06

Hello All: The serialization library is one of the best libraries I have used. I used to to serialize a number of files with various sizes, and it works like a charm. However, when I am using the wide-char archives, I get a linking error. Here are the problem specifications: When including : #include "boost/archive/binary_woarchive.hpp" #include "boost/archive/binary_wiarchive.hpp" Or #include "boost/archive/text_woarchive.hpp" #include "boost/archive/text_wiarchive.hpp" And attempt to use them (i.e.) std::map<wstring,size_t> htable; wstring root = L"c:"; findDFF(&htable,&root); std::wofstream ofs("someFile",std::wios::binary); boost::archive::binary_woarchive o(ofs); I get the following linking errors: [ DB3 error LNK2019: unresolved external symbol "public: __thiscall boost::archive::basic_binary_oprimitive<class boost::archive::binary_woarchive,class std::basic_ostream<unsigned short,struct std::char_traits<unsigned short> > >::~basic_binary_oprimitive<class boost::archive::binary_woarchive,class std::basic_ostream<unsigned short,struct std::char_traits<unsigned short> > >(void)" (??1?$basic_binary_oprimitive@Vbinary_woarchive@archive@boost@@V?$basic_ostream@GU?$char_traits@G@std@@@std@@@archive@boost@@QAE@XZ) referenced in function "public: __thiscall boost::archive::binary_woarchive_impl<class boost::archive::binary_woarchive>::~binary_woarchive_impl<class boost::archive::binary_woarchive>(void)" (??1?$ ] If I use the regular archives (binary_oarchive) I don't get any errors, and it runs as a charm! The compiler I am using is VC++ version 7.1/ I would be grateful if some could point me to the reason for this error. Thanks for your help Hilal

1 0

[multi_index] const mem_fun serialization bug.
by Julien Pervillé 06 May '06

06 May '06

Hello boost-users. I am writing to report an annoying serialization bug encountered while developing a project with Boost.multi_index, which is a wonderfully useful data structure. Thank you Joaquín! First a fast overview of my project: I am developing a virtual file system for my internship. In this file system, I have to store user paths which I call "entries". "entries" are associated with another "internal entry" which is the path to the physical target inside the file system. "entries" are also contained in a concept of "directory". To ease up things I store entries in a boost::multi_index with at least 3 indexes: - an unique index to look up user entries. - a non-unique index to do reverse look up (by internal targets). - a non-unique index to do directory listings. The latter is the one that interests us. The "entry" class splits the entry into the "dirname" and "file" parts. A getter function returns a const-reference to "dirname", let's call it "entry::dirname()". To do directory listings efficiently, I define an ordered-non-unique index pointinh to the const-reference returned by the entry.dirname() thanks to a wrapper "mem_fun" named getdirname(). Now comes the bug. To test my file system, I import some existing directories into my file system. When I unload it, I expect that the internal boost::multi_index is serialized and restored properly when I reload the file system program. When working on huge batches of small files, like untaring a linux kernel or copying the thousands of files from /usr/share/doc, I noticed that the import works but reloading the serialized mappings fails with a (for now unexplained but reproducable) boost::serialization::other_exception. After hunting through the headers, I located the triggered exception to line 1080 of boost/multi_index/ordered_index.hpp (line number from boost 1.33) Here is the context from the "rearranger" method where the exception is thrown: > 1080 if(position!=x){ > 1081 /* check the rearrangement is consistent */ > 1082 if(!in_place(x->value,position,Category())){ > 1083 throw_exception( > 1084 archive::archive_exception( > 1085 archive::archive_exception::other_exception)); > 1086 } Since my multi_index works perfectly until I save, I checked that my data is properly serialized. Since I saw no obvious errors, I modified the header to swallow the exception and see what happens. > 1080 if(position!=x){ > 1081 /* check the rearrangement is consistent */ > 1082 if(!in_place(x->value,position,Category())){ > 1083 return; throw_exception( > 1084 archive::archive_exception( > 1085 archive::archive_exception::other_exception)); > 1086 } After this small hack, everything "seems" to work fine but if I do a "find" on my file system some entries appear "missing". They are actually not missing but they were attributed to the wrong directory! And in the wrong parent directory, a lookup says "file not found" when find tries to access it. However, I can still access the entries by naming them explicitely (using the main index, not the dirname one). I investigated and found out that the "dirname" ordered_index (const mem_fun) is not restored properly, even through it is saved correctly. The "entry" and the "target" ordered indexes (member) are restored as intended. However look what happens to the mem_fun "dirname" index: its values are restored in positions that are not a valid binary tree. Actually it is "almost" a binary tree, just some values are wrongly restored. Like a dozen out of 1000 entries, but always the same ones. As a consequence even if my entry::operator<() predicate is proved correct, lookups through the "dirname" index give byzantine results. I tracked down the problem and found a small set of "entries" that are not restored properly and wrote a small example file. Please have a look at the attached source "seri-bug.cpp". The example dumps the contents of a 5 entries multi_index, first by entry and then by "dirname". The displaying is done before serializing to disk and after reloading the mappings. The corruption can then be see by checking the different position inside the dirname index for the "/doc/binutils-doc" entry before and after. Sample run: Original structure dump by dirname, pre serialization. > entry `/' with dirname `'. > entry `/doc' with dirname `'. > entry `/doc/binutils-doc' with dirname `/doc'. > entry `/doc/binutils-doc/ld' with dirname `/doc/binutils-doc'. > entry `/doc/binutils-doc/gas' with dirname `/doc/binutils-doc'. Post serialized loading dump. Notice that the "/doc/binutils-doc" entry was not restored at the correct position. Since the dirnames are not properly sorted in memory, doing a find() by dirname obtains byzantine results (doing a find of "/doc" dirname returns the `/doc/binutils-doc/ld' result instead of the expected `/doc/binutils-doc' entry). > entry `/' with dirname `'. > entry `/doc' with dirname `'. > entry `/doc/binutils-doc/ld' with dirname `/doc/binutils-doc'. > entry `/doc/binutils-doc' with dirname `/doc'. > entry `/doc/binutils-doc/gas' with dirname `/doc/binutils-doc'. Even if this sample triggers the restore anomaly, to see a boost::archive::other_exception one needs more data inside the multi_index, like a few thousand entries. I would really love to see a this bug fixed since it stalls my projects. My c++ template metaprogramming skills aren't very sharp but I think that this bug is a good opportunity to learn some about this subject. I am looking forward to test patches and offer my help testing, so that this little quirk gets solved. Sincerely, Julien Perville Intern, Global Core, Amadeus IT Group.

1 0

adjacency_list and UndirectedGraph in BGL
by sean yang 06 May '06

06 May '06

I am a newbie using BGL and only read a couple of example source code. I have a question about class representing a graph. It seems adjacency_list represent a graph, but it seems there is a class hierarchy (as shown in (2) ) to represent a graph. What is their relationship? (1) adjacency_list can represent a graph, e.g., typedef adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_weight_t, float> > Graph; (2) And the online manual give a list of Graph representation. I guess it's a hierarchical class representation. i.e., Graph <--Incidence Graph <--Bidirectional Graph. Am I right? But if so, I did not find the constructor of these classes. Furthermore, this class hierarchy has give a full classification of graph, why is there a adjacency_list representation? Chapter 11. The Boost Graph Interface 1. Graph 2. Incidence Graph 3. Bidirectional Graph 4. Adjacency Graph 5. Vertex List Graph 6. Edge List Graph 7. Vertex and Edge List Graph 8. Mutable Graph 9. Property Graph 10. Mutable Property Graph (3) There is an exmple of UndirectedGraph in the book of "User guide and reference manual" { ... V=3; UndirectedGraph undigraph(V); add_edge(0, undigraph); ..... } is there a way not specifying vertice number when defining an object and dynamically adding vertex when according to user input? i.e, something like UndirectedGraph undigraph( ); while (getline(in, line)){ add_edge(line, undigraph); } _________________________________________________________________ Express yourself instantly with MSN Messenger! Download today - it's FREE! http://messenger.msn.click-url.com/go/onm00200471ave/direct/01/

1 0

[MULTI_INDEX] intersection algorithm?
by Guillaume Lazzara 06 May '06

06 May '06

Hello, I am currently using multi_index as "set" container and I wanted to know how to use intersection algorithm. I tried with the STL interction algorithm but it crashed. How can I do? Thanks in advance, -- Guillaume Lazzara Epita Promo 2008 http://guillaume.lazzara.fr

1 0

Re: [Boost-users] boost::multi_index_container different search key type
by JOAQUIN LOPEZ MU?Z 06 May '06

06 May '06

----- Mensaje original ----- De: bert hubert <bert.hubert(a)netherlabs.nl> Fecha: Miércoles, Mayo 3, 2006 8:15 pm Asunto: [Boost-users] boost::multi_index_container different search key type > Joaquin, list, > > In one of the last issues of the C/C++ User's Journal, Andrei > Alexandrescu described the need for something better than std::map > when using expensive > keys: > [...] > > More on http://www.ddj.com/dept/cpp/184402065 - might this be > something boost::multi_index_container could be made to do? > Hello Bert, I'm glad you asked, because multi_index_container already provides this, and I would dare say in a more powerful fashion. Ordered and hashed indices lookup member functions (find, equal_range, etc.) are overloaded to accept *compatible keys*, which can be used to pass alternate representations of keys in exactly the same manner as described in Andrei's article. Compatible keys are introduced at http://tinyurl.com/rouet and formally described at http://tinyurl.com/hp9j4 (ordered indices) http://tinyurl.com/ze5od (hashed indices) But there is more: in the case of ordered indices, compatible keys need not be in a 1-to-1 relation with the original keys, but can be "coarser", in a sense. An example can help clarify this: Suppose we've got an index ordered by a date, with millisecond precision, then the index is certainly ordered by year; compatible key support can be thus used to perform lookup by year if only we provide the appropriate comparison semantics between full dates and years, so that "year" is a compatible key of "date". Although it might not be apparent, composite keys take full advantage of all of this: * When you pass a tuple to lookup on some composite_key- enabled index, the tuple is *not* the index key_type, but merely a more convenient representation. * Compatible key support (in the "coarser key" sense) is used when you do "partial searches" in which only the first tuple values are specified: see http://tinyurl.com/hdf3q. When Andrei's article first came out, I contacted him to discuss these concepts and the similarities between his ÜberContainers and compatible key support as provided by B.MI: IMHO it is not unusual that these sort of ideas come up recurrently. Thanks for your active interest in Boost.MultiIndex! Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

Re: [Boost-users] Thread-safe smart pointers, hashtables
by Gottlob Frege 06 May '06

06 May '06

> Date: Fri, 5 May 2006 14:09:33 -0600 > From: Ray Whitmer <ray(a)personallegal.net> > Subject: Re: [Boost-users] Thread-safe smart pointers, hashtables > without locking > To: boost-users(a)lists.boost.org > Message-ID: <0D5E3BD4-9A5D-4CE2-9040-35500773C190(a)personallegal.net> > Content-Type: text/plain; charset=US-ASCII; delsp=yes; format=flowed > > > The algorithm makes sense, and if all these claims hold then it > > should work, I think. I'm still concerned about step (2), however, > > if only because of the assumption that what you write as a load/ > > store in C++ maps to a load/store in ML. Will it? Always? I ask as > > a non-rhetorical question: does the C++ standard *guarantee* it? > > Because if it doesn't then it seems like a potential problem, but > > maybe I'm being too careful. I'd also say the idea of moving a pointer out of the way, and then using the flip-gate-count-thing to wait for any 'potentially-using' readers to finish, definitely has 'potential'. You would need to show detailed code to really be sure. And not to us - to the guys on comp.programming.threads. If I could answer in the affirmative, I could prove it works and not > have to talk to anyone. I can make a bunch of lesser claims, that of > course fail to add up to the strong claim but make me feel better: > > 3. I have looked at the output of many C compilers and have never > seen a pointer assignment take multiple instructions. The exception > might be if someone used a poorly-written memcpy-like operations to > transfer the contents of a structure byte by byte. A well-written > one takes the respective alignments into account and transfers > aligned 32-bit quantities one-by-one. We are talking about code in a > controlled Hashtable class, it would have to be the "C" compiler > choosing to transfer a class consisting of a single address field > using something other than a single instruction. It doesn't sound > logical to me, but it wouldn't surprise me completely to see it > happen, but I would report it as a compiler bug and expect it to be > addressed even though it is not in the standard. As long as the address of the pointer is properly aligned, it will be atomic. The language doesn't guarantee that (the language doesn't talk about atomic or threads at all - at least not yet), but the processors + compilers tend to guarantee it. HOWEVER! *even if it is atomic*, on a multi-cpu machine each cpu might see memory differently - you need memory barriers to ensure the other cpus see your new pointer value correctly. Think of cpus and memory like harddrive controllers that reorder reads and writes to lessen seeks - the cpu does the same sort of thing with memory - and in doing so, it may reorder the write of your pointer to 'happen' before you expected (because it was near other memory it was writing) and/or read the pointer later than expected (because it optimized other reads into a 'bundle' before the read of your pointer). Anyhow, if you haven't already, take a look at memory barriers, and, as a canonical example, the broken 'double checked locking pattern'. You can't do lock free without understanding this stuff. 4. These issues have to be addressed with the multi-processor cores > becoming more prevalent because they are basic to lock-free > processing, or can C++ accept significant inferiority to Java with > respect to lock-free multiprocessing? see above. Much of it doesn't come for free. For what it is worth, if anyone else thinks the solution is worth a > generic contribution, or is of the opposite opinion that it would not > be generic enough, I would be interested in hearing. I suppose this > sort of question should go to the developers list. I think it would > be much more difficult to implement a table of shared_ptr than it is > for intrusive_ptr, because assigning a shared_ptr is much less likely > to be uninterrupted, leaving other threads with a broken visible > state. There is clearly more detail to discuss as well. > Ray Whitmer Your wording of 'much less likely' is scary, and I think similar wording made James apprehensive as well. There is no grey - it is black or white, thread safe or not. And you are correct, you can't make { reading the location of a shared_ptr + incrementing its ref-count } atomic, it least not on most processors. I'm not sure of the exact implementation of intrusive_ptr, but assuming it is like most, you can make ip1 = ip2; atomic IF ip2 is 'stable', ie guaranteed to not be changing during the assignment. ie ip1 can be read and/or written by other threads "while" the assignment is happening, and you will either get the before state of ip1, or the after state. I don't think the boost implementation of intrusive_ptr's operator=() is atomic, but it could be made to be. Tony

1 0

[BGL] adjacency_list property map selection
by Daniel Mitchell 06 May '06

06 May '06

Are there any plans to replace the property map selection code with a mechanism based on partial specialization? I'm implementing interior property maps for my own graph classes and must decide which approach to use. Partial specialization is elegant, but there's also value in consistency with BGL. D.

1 0

Re: [Boost-users] [multi-array] [C++ ] multi array dimensions
by Sohail Somani 05 May '06

05 May '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Bruno Martínez > Sent: Friday, May 05, 2006 4:52 PM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] [multi-array] [C++ ] multi array dimensions > > On Tue, 02 May 2006 16:04:04 -0300, Karim Bakir > <rimbak(a)yahoo.fr> wrote: > > > Ok so , And is it possible to retrieve the size of the dimension? > > Yes. That's the shape() member function. I've been thinking, it would be nice if shape() returned a const boost::array & whose indexing has nice asserts at debug time :) Anyone else feels the same?

1 0

[multi-array] [C++ ] multi array dimensions
by Karim Bakir 05 May '06

05 May '06

Hi , I want to known if exists method which give us the dimension of a multi array ...I see the documentation and i 'will say no , if no, does it exist a method to determine the dimension of a multi array ? Thanks.

2 5

Possible bug in program_options when disabling _SECURE_SCL on VS8
by Roger Dahl 05 May '06

05 May '06

I think I've found a bug in program_options. #define _SECURE_SCL 0 on Visual Studio 2005 causes program_options to crash in store(). I used boost from CVS. Below is an example. Thanks for an awesome library! Roger -- #define _SECURE_SCL 0 #include <boost/program_options.hpp> namespace po = boost::program_options; int main(int argc, char* argv[]) { po::options_description desc("Allowed Options"); desc.add_options() ("help", "produce help message") ; po::variables_map vm; po::store(po::parse_command_line(argc, argv, desc), vm); po::notify(vm); return 0; }

1 0

Re: [Boost-users] Thread-safe smart pointers, hashtables without locking
by Ray Whitmer 05 May '06

05 May '06

> The algorithm makes sense, and if all these claims hold then it > should work, I think. I'm still concerned about step (2), however, > if only because of the assumption that what you write as a load/ > store in C++ maps to a load/store in ML. Will it? Always? I ask as > a non-rhetorical question: does the C++ standard *guarantee* it? > Because if it doesn't then it seems like a potential problem, but > maybe I'm being too careful. If I could answer in the affirmative, I could prove it works and not have to talk to anyone. I can make a bunch of lesser claims, that of course fail to add up to the strong claim but make me feel better: 1. For years, people have written and relied on C/C++ characteristics that apparently were not in the standard until later if at all. If the popular platforms support it, it takes a strong reason to justify a violation of it. 2. Java, on any platform, would seem to strongly depend upon a reference assignment being accomplished all-or-nothing as a machine assignment. The alternative would be threads that see partial references being assigned in different threads and all the safety of references is out the window. This is such a common operation, it would be difficult to believe that there is thread synchronization going on around every pointer/reference assignment. 3. I have looked at the output of many C compilers and have never seen a pointer assignment take multiple instructions. The exception might be if someone used a poorly-written memcpy-like operations to transfer the contents of a structure byte by byte. A well-written one takes the respective alignments into account and transfers aligned 32-bit quantities one-by-one. We are talking about code in a controlled Hashtable class, it would have to be the "C" compiler choosing to transfer a class consisting of a single address field using something other than a single instruction. It doesn't sound logical to me, but it wouldn't surprise me completely to see it happen, but I would report it as a compiler bug and expect it to be addressed even though it is not in the standard. 4. These issues have to be addressed with the multi-processor cores becoming more prevalent because they are basic to lock-free processing, or can C++ accept significant inferiority to Java with respect to lock-free multiprocessing? Sorry that my arguments in this case frequently refer to Java. > > Have you read any of the literature on lock-free data structures, > btw? There was articles in the October and December '04 C/C++ User > Journal about them. I have read a number of articles on the subject, several specifically on the topic of lock-free hashtables, several with implementations they claim to be proven to be correct. My own first attempt is far from a proven-correct implementation. Many seem to arrive at similar conclusions, although each has its own slightly-different take on the subject and quite different mechanisms. They are also very often theoretical and build their proofs of completeness on features not apparently explicitly present in "C" standards. I certainly have yet to find an implementation I can just plug in and use. They often resort to garbage collection to solve the hard problems (even if they are working in C) or if they solve the deallocation problem, they only do so for the main array, not for the entries in the hashtable itself. > I realize that I haven't answered your original question about > atomic_count, btw, and I'm sorry: the reason is simply that I don't > know! Thanks for the comments anyway, which were thought-provoking. For what it is worth, if anyone else thinks the solution is worth a generic contribution, or is of the opposite opinion that it would not be generic enough, I would be interested in hearing. I suppose this sort of question should go to the developers list. I think it would be much more difficult to implement a table of shared_ptr than it is for intrusive_ptr, because assigning a shared_ptr is much less likely to be uninterrupted, leaving other threads with a broken visible state. There is clearly more detail to discuss as well. Ray Whitmer

1 0

Re: [Boost-users] Thread-safe smart pointers, hashtables without locking
by james.jones＠firstinvestors.com 05 May '06

05 May '06

From: Ray Whitmer <ray(a)personallegal.net> >> This would be truly thread-safe but might perform better if you >> have lots of simultaneous readers/writers. I haven't tested this, >> but if you do, I'd be interested to hear the results. > > I don't think it even begins to be thread-safe, because it doesn't > begin to deal with reallocation of the array itself... That's certainly true. I guess I was thinking of a hashtable whose interface is that it is allocated with a fixed size and not reallocated (although it might be copy-constructed to a hashtable of a different size). If modern hashtables reallocate their storage, that would certainly have to be done in a thread-safe manner. > Here is my first stab at a solution: > > 2. Perform changes to the hashtable in a manner that, given atomic > loads or stores of aligned pointers, never leaving the table in a > state that simultaneous readers cannot use it. This is very easy > compared to the allocation issues, and I have been doing this in Java > for years. I would be happy to expand on this. This write operation > may include releasing objects with ref-count 1, if this is supposed > to be a weak hashtable that does not keep unused objects in the index. [rest snipped] The algorithm makes sense, and if all these claims hold then it should work, I think. I'm still concerned about step (2), however, if only because of the assumption that what you write as a load/store in C++ maps to a load/store in ML. Will it? Always? I ask as a non-rhetorical question: does the C++ standard *guarantee* it? Because if it doesn't then it seems like a potential problem, but maybe I'm being too careful. Have you read any of the literature on lock-free data structures, btw? There was articles in the October and December '04 C/C++ User Journal about them. I realize that I haven't answered your original question about atomic_count, btw, and I'm sorry: the reason is simply that I don't know! - James Jones Administrative Data Mgmt. (v)732-510-1806 375 Raritan Center Pkwy, Suite A (f)732-510-1855 Edison, NJ 08837 Visit us on the web at http://www.firstinvestors.com/

1 0

[tribool]compile error
by Thomas Matelich 05 May '06

05 May '06

This is only happening when I'm instrumenting code with Insure++ from Parasoft. They use an EDG based parser (not sure of the version, but I know they have it set to be very strict) and it is failing like so: /usr/local/eddynet/debug_eddynet/opt/include/boost/logic/tribool.hpp: In function `boost::logic::tribool boost::logic::operator&&(boost::logic::tribool, boost::logic::tribool)': /usr/local/eddynet/debug_eddynet/opt/include/boost/logic/tribool.hpp:78: ` struct boost::logic::tribool::dummy' is private /usr/local/eddynet/debug_eddynet/opt/include/boost/logic/tribool.hpp:203: within this context /usr/local/eddynet/debug_eddynet/opt/include/boost/logic/tribool.hpp:78: ` struct boost::logic::tribool::dummy' is private /usr/local/eddynet/debug_eddynet/opt/include/boost/logic/tribool.hpp:203: within this context /usr/local/eddynet/debug_eddynet/opt/include/boost/logic/tribool.hpp:78: ` struct boost::logic::tribool::dummy' is private /usr/local/eddynet/debug_eddynet/opt/include/boost/logic/tribool.hpp:205: within this context /usr/local/eddynet/debug_eddynet/opt/include/boost/logic/tribool.hpp:78: ` struct boost::logic::tribool::dummy' is private /usr/local/eddynet/debug_eddynet/opt/include/boost/logic/tribool.hpp:205: within this context /usr/local/eddynet/debug_eddynet/opt/include/boost/logic/tribool.hpp: In function `boost::logic::tribool boost::logic::operator||(boost::logic::tribool, boost::logic::tribool)': /usr/local/eddynet/debug_eddynet/opt/include/boost/logic/tribool.hpp:78: ` struct boost::logic::tribool::dummy' is private /usr/local/eddynet/debug_eddynet/opt/include/boost/logic/tribool.hpp:270: within this context /usr/local/eddynet/debug_eddynet/opt/include/boost/logic/tribool.hpp:78: ` struct boost::logic::tribool::dummy' is private /usr/local/eddynet/debug_eddynet/opt/include/boost/logic/tribool.hpp:270: within this context /usr/local/eddynet/debug_eddynet/opt/include/boost/logic/tribool.hpp:78: ` struct boost::logic::tribool::dummy' is private /usr/local/eddynet/debug_eddynet/opt/include/boost/logic/tribool.hpp:272: within this context /usr/local/eddynet/debug_eddynet/opt/include/boost/logic/tribool.hpp:78: ` struct boost::logic::tribool::dummy' is private /usr/local/eddynet/debug_eddynet/opt/include/boost/logic/tribool.hpp:272: within this context Locally I've worked around this with changing the first part of the tribool class from: class tribool { private: to class tribool { #ifdef __INSURE__ //Symbol defined by parser when used in this context public: #endif (no #else since private is implied) Anyway, I don't mind maintaining my own mods, just thought I'd report this. If you don't mind enlightening me, I am a little curious why using safe_bool works if its private on any compiler. Seems like private typedefs usually are private. Thanks, Tom

1 0

Re: [Boost-users] [Unit-Test] How to test private functions
by james.jones＠firstinvestors.com 05 May '06

05 May '06

From: Carlo Wood <carlo(a)alinoe.com> >Also, the above is slightly dangerous, as the 'public' would >'leak' beyond the #ifdef when TESTING is defined. You'd have to make >sure that the test block at the end of the class. This is a very good point. A method defined as public in test might fail to compile as private in production. >Personally, I like the #define private public best, because it doesn't >polute the real code. But this contradicts your prior good point. This is even more dangerous than the conditional public: which you objected to, because now *every* method is public! At least with the other method, you can do it safely if you're careful. - James Jones Administrative Data Mgmt. (v)732-510-1806 375 Raritan Center Pkwy, Suite A (f)732-510-1855 Edison, NJ 08837 Visit us on the web at http://www.firstinvestors.com/

2 1

Re: [Boost-users] Thread-safe smart pointers, hashtables without locking
by Ray Whitmer 05 May '06

05 May '06

> Personally, I read this and said, "eeek!" (Well, not literally. My > office mates would wonder what was up.) I think any design like > this is going to be (at best) very non-portable, and (more likely) > subject to breaking at the worst possible moment (i.e. when > demonstrating to a customer). Is "relatively" thread-safe really > good enough here? Let me make it clear. I do not want relatively thread-safe. I want completely thread safe. It seems to me that boost already relies on an atomic counter for shared_ptr. I do not think the solution would be less portable than this. I certainly want it to run on Windows and Mac, 32 and 64 bit as well as major Unix and Linux including certain 32-bit-or-more embedded situations. There may be hopefully-rare C++ threading situations that may be difficult to recover from, and I will simply have to gather more information on these and see if they can be dealt with. > As a constructive suggestion, if you want to reduce lock conflicts > in hash tables, have you considered some form of finer-grained > locking? You could, for example, have one lock per "slot" in your > hash table. Computing the hash and finding the slot is thread-safe > (since it doesn't depend on the state of the hash table), so you > could then lock only the slot itself while performing list > maintenance or whatever you need to do to read/write the data. For the more-common reader of the hash table, it is not my intent to reduce lock conflicts, but, rather, to generally eliminate them, and replace them with something lighter-weight, such as the atomic counter used by shared_ptr, that in best cases may only take a few instructions to execute. I may have thousands of threads reading info from the hashtable at once and there may never be a natural time when there are no readers so I can update the table. The purpose of the threads is many operations that rely heavily on the hashtables -- every other instruction they are looking up something. For what it is worth, finding the slot is not thread-safe, because the table size and pointer can change. List maintenance involves multiple slots and I do not think it is worthwhile doing finer- grained locks because of the complexity, deadlock potential, and likely worse performance it would introduce. > This would be truly thread-safe but might perform better if you > have lots of simultaneous readers/writers. I haven't tested this, > but if you do, I'd be interested to hear the results. I don't think it even begins to be thread-safe, because it doesn't begin to deal with reallocation of the array itself, and if it did, your fine-grained locks appear to become worthless because you need a high-level lock protecting that allocation assuming you are going to use locks for readers, which seems like a bad idea from the start for me. There is a reason shared_ptr does not use locks (at least on the best-supported platforms), but uses an atomic count. > PS - I'd be even more worried in Java, btw, since Java opcodes > should map to CPU operations less well than a compiled binary. Not > to mention that in Java, the portability assumption becomes really > critical. Java classes are *supposed* to be portable. I do not want to get into Java wars here, but Java has to solve the deallocation problem in a thread-safe manner. When the garbage collector actually reclaims an allocation, the possibility cannot exist that someone else still happens to be using it or the language is badly broken. This is the hard thing to be solved in C++ to make a thread-safe hashtable that you do not have to deal with in Java. The deallocation problem is, from everything I have analyzed, the big problem in C++. When you attempt to deallocate something, for all you know there could be another thread that just barely loaded its pointer into shared memory and as soon as it unstalls will want to increment its reference count, but it has not yet been incremented, so even a smart pointer using an atomic reference count fails because the object is sharable in a multithreaded environment, but not the reference itself. Here is my first stab at a solution: Extra data (for each Hashtable): 1. Array of two atomic counts, one active and one inactive. 2. Index that flops between 0 and 1, so there is an active and inactive count. 3. A mutex that can be used for exclusive writers Each reader behaves as follows: 1. Fetch index. 2. Increment corresponding atomic count. 3. If fetched index is not current index, decrement atomic count and loop to step 1. This is rare and safely eliminates rare bad cases 4. Now the reader has free access to the entire hashtable structure, and is guaranteed by cooperation of the writer that the pointers it sees are not stale. It must only guarantee that any pointer referenced in step 4 is either destroyed or it's ref count is incremented before step 5 -- this includes the pointer to the allocated resizable array itself. 5. Decrement the same atomic count (of fetched index) incremented in step 3. Note that in Java, none of this is necessary for readers because the language safety assumes any reference is not deallocated. Each writer behaves as follows: 1. Obtain an exclusive lock on the hashtable. This lock only excludes other writers, not other readers. 2. Perform changes to the hashtable in a manner that, given atomic loads or stores of aligned pointers, never leaving the table in a state that simultaneous readers cannot use it. This is very easy compared to the allocation issues, and I have been doing this in Java for years. I would be happy to expand on this. This write operation may include releasing objects with ref-count 1, if this is supposed to be a weak hashtable that does not keep unused objects in the index. 3. This is really part of 2: any step in (2) which destroys a reference a reference keeps a private local copy to make sure it is not deallocated before all reading threads are finished with it. If the references are ref-counted, a ref-counted private reference is kept. 4. If there are no private local pointers/references being kept, go to step 9 5. Wait for inactive (1-index) atomic count to go to 0. This is rare and safely eliminates rare bad cases. 6. Change index (index = 1 - index). 7. Wait for inactive (1-index) atomic count to go to 0. This means that all readers who might have a copy of a stale pointer are finished. 8. Release all private local references with a reference count of 1. Non-ref-counted references always get released, due to single owner. If this is a weak hashtable, reinsert any references that have a reference count greater than one since these were found and incremented while we were waiting for readers to exit. 9. Release lock. Done. More notes: Although we don't want to go out of our way to make the writer inefficient, there is a single writer at any one time with an exclusive lock. But we do not have to wait for all readers to exit to perform the update, we only need to wait for current readers to exit, during which time new readers may enter, which we do not care about because we have already removed the candidates from public places in the list. This includes the pointer to the array itself, which is generally treated like any other allocated pointer, but does not require a reference count. There are many details I left out that did not directly pertain to the allocation problem, but only with atomically updating the rest of the table so that the reader view is always consistent. Ray Whitmer

1 0

pool_allocator<void> not supported?
by Strelnikov Michael 05 May '06

05 May '06

Dear all, It seem std::allocator specialized for void, but pool_allocator don't. Why? Thanks.

1 0

Re: [Boost-users] [serialization] I can't figure out what I'm doing wrong with xml_oarchive - please help
by Manos Tsagarakis 05 May '06

05 May '06

Hello Robert, I'm posting this message again (3rd time actually) as I did not see the previous two ... Thank you for the quick response. I'm glad you liked the title ... A) I did replace all BOOST_CLASS_EXPORT with BOOST_CLASS_EXPORT_GUID, but the problem with xml persists. It is really difficult for me to figure out what is wrong with xml, as both txt and bin versions are ok. Actually what worries me, is the possibility that the problem with xml somehow will show up in other formats too ... B) I don't use the version numbers at the moment but I added it just for future use. I actually have a couple of questions here. 1) BOOST_CLASS_VERSION has to be in the header file? Can I place it in the cpp file? 2) Please correct me If I'm wrong: I don't use BOOST_CLASS_VERSION so that all classes have version number assignment set to 0. I also don't use BOOST_SERIALIZATION_SPLIT_MEMBER for now. Later on, I add some members, so that the class version must change. I simply add BOOST_CLASS_VERSION(..., 1) and split serialize to save/load at that time. Previously saved data files are not affected as long as version info is handled correctly by my code. Is that correct? C) I avoid using templated code in CTCDataBase for as long as the core data that must be serialized evolve, in order to avoid frequently modification of the most included header file TC_database.h. That meens almost recompile all, and that takes time. Thank you for the suggestion any way. I'll keep it in mind. To be honest, I did try to use export feature of templates bug no luck ... D) I re-attach a couple of header files to this post and I kindly ask you to take a look at the implementation and tracking level for template class fem::CPropRepository implementation_level< fem::CPropRepository<T, SZ> > and tracking_level< fem::CPropRepository<T, SZ> >, and one utilization of it at the other header. Should it be so? Do I need it? And also is it possible that using this CPropRepository stuff (especially with MFC CString) breaks the xml code? E) After adding all headers of the serialize library compilation takes a lot more time. Are there any guidelines by you on that? I hope I'm not encroaching your time... Thank you again, Emmanuil Tsagarakis >> -----Original Message----- >> From: boost-users-bounces(a)lists.boost.org >> [mailto:boost-users-bounces@lists.boost.org] On Behalf Of >> Robert Ramey >> Sent: Friday, May 05, 2006 8:36 AM >> To: boost-users(a)lists.boost.org >> Subject: Re: [Boost-users] [boost-users] [serialization] >> I can't figure outwhatI'm doing wrong with xml_oarchive - >> please help >> >> LOL - I liked the title. >> >> I've taken a very quick look at your code and files. >> >> a) I'm a little suspicious of including a ":" character >> as the GUID for a class. I think that might be an issue. >> Try replacing >> >> BOOST_CLASS_EXPORT(fem::CTCSoil); >> >> with >> >> BOOST_CLASS_EXPORT_GUID(fem::CTCSoil, "fem_CTCSoil"); >> >> You'll have to double check the exact syntax. >> >> b) You've set version numbers to 1 but I don't see the >> version numbers used in the deserializations. Version >> number assignment is only necessary if you're going to >> use the version numbers and they are not equal to 0. >> >> c) A minor suggestion - not important here but interesting anyway. >> In fem_boost_serialize.cpp Use templates to shorten the code. >> >> template<class Archive> >> void CTCDataBase::boost_serialize_open(const char* filename) { >> try { >> std::ifstream ifs(filename); >> assert(ifs.good()); >> Archive ia(ifs); >> >> ia >> BOOST_SERIALIZATION_NVP(m_lstSoils); >> ia >> BOOST_SERIALIZATION_NVP(m_lstBrickWalls); >> ia >> BOOST_SERIALIZATION_NVP(CTCFooting::s_bspSoil); >> ia >> BOOST_SERIALIZATION_NVP(CTCFrame::s_bspBrickWall); >> } >> catch (const boost::archive::archive_exception& e) { >> e; >> } >> } >> >> and >> template<class Archive> >> void CTCDataBase::boost_serialize_saveconst char* filename) { >> try { >> std::ofstream ofs(filename); >> assert(ofs.good()); >> Archive oa(ofs); >> >> oa << BOOST_SERIALIZATION_NVP(m_lstSoils); >> oa << BOOST_SERIALIZATION_NVP(m_lstBrickWalls); >> oa << BOOST_SERIALIZATION_NVP(CTCFooting::s_bspSoil); >> oa << BOOST_SERIALIZATION_NVP(CTCFrame::s_bspBrickWall); >> } >> catch (const boost::archive::archive_exception& e) { >> e; >> } >> } >> >> void main() >> { >> fill_with_build_in(); >> boost_serialize_save<boost::archive::text_oarchive>("boost >> _serialize.txt"); >> boost_serialize_save<boost::archive::binary_oarchive>("boo >> st_serialize.bin"); >> boost_serialize_save<boost::archive::xml_oarchive>("boost_ >> serialize.xml"); >> >> // some time later ... >> boost_serialize_open<boost::archive::text_oarchive>("boost >> _serialize.txt"); >> boost_serialize_open<boost::archive::binary_oarchive>("boo >> st_serialize.bin"); >> boost_serialize_open<boost::archive::xml_oarchive>("boost_ >> serialize.xml"); >> } >> >> Robert Ramey >> >> TOL mtsagara wrote: >> >> Hi to all, >> >> >> >> This is my very first post to boost-users! I've been >> using a couple >> >> of boost libraries for a while (shared_ptr & bind >> mostly). Write now >> >> we are in the process of transforming a project based on MFC >> >> collections, (with objects derived from CObject), to >> STL, and doing >> >> some search for a library that will allow object >> persistence the way >> >> MFC does, the obvious solution was boost::serialize. >> As I'm a newbie >> >> in mpl style code the first impression was terrifying! >> But after >> >> reading the documentation and experimenting a lot, I >> did manage to >> >> start using boost::serialize. In fact there is no need >> to be familiar >> >> with mpl. The library is excellent - an exemplary >> work, thank you >> >> Robert Ramey! >> >> >> >> Now my problem is with xml files. I can write a couple >> of classes >> >> both in txt and binary files. But I can't write the >> very same data in >> >> xml format. I believe I followed all guidelines but I >> had no luck ... >> >> :( >> >> >> >> The scenario in pseudo code is this: >> >> >> >> >> >> >> ////////////////////////////////////////////////////////// >> /////////// >> >> / >> >> // file fem.h >> >> #include <boost/archive/...> >> >> #include <boost/serialize/...> >> >> >> >> namespace fem { >> >> >> >> class CTCBase >> >> { >> >> ... >> >> }; >> >> typedef boost::shared_ptr<CTCBase> CBSPBase typedef >> >> std::list<CBSPBase> CBSPBaseList >> >> >> >> >> >> >> >> class CTCSoil >> >> { >> >> ... >> >> }; >> >> typedef boost::shared_ptr<CTCSoil> CBSPSoil typedef >> >> std::list<CBSPSoil> CBSPSoilList >> >> >> >> >> >> >> >> class CTCBrickWall >> >> { >> >> ... >> >> }; >> >> typedef boost::shared_ptr<CTCBrickWall> CBSPBrickWall typedef >> >> std::list<CBSPBrickWall> CBSPBrickWallList >> >> >> >> >> >> >> >> // list of soils >> >> CBSPSoilList s_lstSoils; >> >> // list of Brick Walls >> >> CBSPBrickWallList s_lstBrickWalls; >> >> // initial soil for each new foundation beam (also >> contained in above >> >> list) CBSPSoil s_bspSoil; // initial brick wall on >> each beam (also >> >> contained in above list) CBSPBrickWall s_bspBrick; } >> >> >> >> BOOST_CLASS_VERSION(fem::CTCBase, 1); >> >> BOOST_CLASS_VERSION(fem::CTCSoil, 1); >> >> BOOST_CLASS_VERSION(fem::CTCBrickWall, 1); >> >> >> >> >> >> >> >> >> >> >> >> >> >> >> ////////////////////////////////////////////////////////// >> /////////// >> >> / >> >> // file fem.cpp >> >> >> >> #include "fem.h" >> >> #include <boost/serialization/export.hpp> >> >> >> >> >> >> BOOST_IS_ABSTRACT(fem::CTCBaseObj); >> >> BOOST_CLASS_EXPORT(fem::CTCSoil); >> >> BOOST_CLASS_EXPORT(fem::CTCBrickWall); >> >> >> >> void fill_with_build_in() >> >> { >> >> ... >> >> } >> >> >> >> >> >> void main() >> >> { >> >> fill_with_build_in(); >> >> boost_serialize_save_txt("boost_serialize.txt"); >> >> boost_serialize_save_bin("boost_serialize.bin"); >> >> boost_serialize_save_xml("boost_serialize.xml"); >> >> >> >> >> >> // some time later ... >> >> boost_serialize_open_txt("boost_serialize.txt"); >> >> boost_serialize_open_bin("boost_serialize.bin"); >> >> boost_serialize_open_xml("boost_serialize.xml"); >> >> } >> >> >> >> >> >> >> >> The xml save & open functions are in file >> fem_boost_serialize.cpp >> >> >> >> I attached the 3 files produced this way. I can also >> read back txt & >> >> binary versions. I'm wondering if somebody - hopefully >> Robert Ramey! >> >> - can tell me just by examining the output files, >> where should I look >> >> for the problem. Or do I have to debug the code line >> by line and see >> >> what wend wrong? It seems something is wrong with the >> very first >> >> shared_ptr serialization . >> >> >> >> I include some - not stand alone I'm afraid - source >> code files with >> >> this message just in case someone might take a look at >> them. I can >> >> tell that during the transition period from MFC to STL >> (possibly >> >> after that too), our objects derive from MFC CObject. >> Also at the >> >> moment, we still use MFC CString and not std::string. >> I had to copy >> >> CString to std::string for the serialization to work >> properly. Could >> >> there be a conflict somewhere there? Could it be the >> order in hpp >> >> files are included? >> >> >> >> >> >> Finally I use MS Visual C++ .net 2003 and boost v1.33.1. >> >> >> >> >> >> Thank you in advanced, >> >> >> >> >> >> >> >> Emmanuil Tsagarakis >> >> >> >> >> > >> > >> > >> >> _______________________________________________ >> >> Boost-users mailing list >> >> Boost-users(a)lists.boost.org >> >> http://lists.boost.org/mailman/listinfo.cgi/boost-users >> >> >> >> _______________________________________________ >> Boost-users mailing list >> Boost-users(a)lists.boost.org >> http://lists.boost.org/mailman/listinfo.cgi/boost-users >> >>

1 0

Re: [Boost-users] Boost python std::set
by Nat Goodspeed 05 May '06

05 May '06

From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Craig Glasgow Sent: Friday, May 05, 2006 3:55 AM To: Boost-users(a)lists.boost.org Subject: [Boost-users] Boost python std::set Does anyone know how to write the python conversions to go between the C++ STL class std::set and Python sets? I've written simialar conversions between lists/tuples and std::vector and between dict and std::map by modifying the code in: scitbx/include/scitbx/boost_python/container_conversions.h mentioned in the FAQ. Boost python, however, while supporting dict, list, tuple does not appear to support set. Any ideas? [Nat] <grin> Your timing is excellent. Check the C++-sig mailing list from two days ago: http://article.gmane.org/gmane.comp.python.c%2B%2B/9682 In general, check the C++-sig mailing list for Boost.Python questions.

1 0

Boost python std::set
by Craig Glasgow 05 May '06

05 May '06

Hi Does anyone know how to write the python conversions to go between the C++ STL class std::set and Python sets? I've written simialar conversions between lists/tuples and std::vector and between dict and std::map by modifying the code in: scitbx/include/scitbx/boost_python/container_conversions.h mentioned in the FAQ. Boost python, however, while supporting dict, list, tuple does not appear to support set. Any ideas? Regards Craig

1 0

[boost-users] [serialization] I can't figure out what I'm doing wrong with xml_oarchive - please help
by TOL mtsagara 05 May '06

05 May '06

Hi to all, This is my very first post to boost-users! I've been using a couple of boost libraries for a while (shared_ptr & bind mostly). Write now we are in the process of transforming a project based on MFC collections, (with objects derived from CObject), to STL, and doing some search for a library that will allow object persistence the way MFC does, the obvious solution was boost::serialize. As I'm a newbie in mpl style code the first impression was terrifying! But after reading the documentation and experimenting a lot, I did manage to start using boost::serialize. In fact there is no need to be familiar with mpl. The library is excellent - an exemplary work, thank you Robert Ramey! Now my problem is with xml files. I can write a couple of classes both in txt and binary files. But I can't write the very same data in xml format. I believe I followed all guidelines but I had no luck ... :( The scenario in pseudo code is this: ////////////////////////////////////////////////////////////////////// // file fem.h #include <boost/archive/...> #include <boost/serialize/...> namespace fem { class CTCBase { ... }; typedef boost::shared_ptr<CTCBase> CBSPBase typedef std::list<CBSPBase> CBSPBaseList class CTCSoil { ... }; typedef boost::shared_ptr<CTCSoil> CBSPSoil typedef std::list<CBSPSoil> CBSPSoilList class CTCBrickWall { ... }; typedef boost::shared_ptr<CTCBrickWall> CBSPBrickWall typedef std::list<CBSPBrickWall> CBSPBrickWallList // list of soils CBSPSoilList s_lstSoils; // list of Brick Walls CBSPBrickWallList s_lstBrickWalls; // initial soil for each new foundation beam (also contained in above list) CBSPSoil s_bspSoil; // initial brick wall on each beam (also contained in above list) CBSPBrickWall s_bspBrick; } BOOST_CLASS_VERSION(fem::CTCBase, 1); BOOST_CLASS_VERSION(fem::CTCSoil, 1); BOOST_CLASS_VERSION(fem::CTCBrickWall, 1); ////////////////////////////////////////////////////////////////////// // file fem.cpp #include "fem.h" #include <boost/serialization/export.hpp> BOOST_IS_ABSTRACT(fem::CTCBaseObj); BOOST_CLASS_EXPORT(fem::CTCSoil); BOOST_CLASS_EXPORT(fem::CTCBrickWall); void fill_with_build_in() { ... } void main() { fill_with_build_in(); boost_serialize_save_txt("boost_serialize.txt"); boost_serialize_save_bin("boost_serialize.bin"); boost_serialize_save_xml("boost_serialize.xml"); // some time later ... boost_serialize_open_txt("boost_serialize.txt"); boost_serialize_open_bin("boost_serialize.bin"); boost_serialize_open_xml("boost_serialize.xml"); } The xml save & open functions are in file fem_boost_serialize.cpp I attached the 3 files produced this way. I can also read back txt & binary versions. I'm wondering if somebody - hopefully Robert Ramey! - can tell me just by examining the output files, where should I look for the problem. Or do I have to debug the code line by line and see what wend wrong? It seems something is wrong with the very first shared_ptr serialization . I include some - not stand alone I'm afraid - source code files with this message just in case someone might take a look at them. I can tell that during the transition period from MFC to STL (possibly after that too), our objects derive from MFC CObject. Also at the moment, we still use MFC CString and not std::string. I had to copy CString to std::string for the serialization to work properly. Could there be a conflict somewhere there? Could it be the order in hpp files are included? Finally I use MS Visual C++ .net 2003 and boost v1.33.1. Thank you in advanced, Emmanuil Tsagarakis

2 1

[Unit-Test] How to test private functions
by Leif Gruenwoldt 05 May '06

05 May '06

Is there a way to test the private functions of a class without moving them into public scope during test? What are some strategies for this? I was hoping to add "friend class boost::unit_test::test_suite;" to my class but that didn't work. -- Leif Gruenwoldt

8 11

[shmem] New bugfix version in Boost Vault and sandbox cvs
by Ion Gaztañaga 04 May '06

04 May '06

Hi to all, I've just uploaded to Boost Vault a new version of Shmem (0.92). You can download it here: http://boost-consulting.com/vault/index.php?direction=&order=&directory=Mem… Online documentation here: http://ice.prohosting.com/newfunk/boost/libs/shmem/ Changes in 0.92: ----------------- * Solved bugs in flat_xxx insert functions. * Solved ambiguous windows native function calls with some header orderings. * Changed named_mutex to support scoped_lock. * Added missing <exceptions.hpp> include in named_mutex. * Added get_instance_type, get_instance_length and get_instance_name functions to front-ends. Warning: -------- Peter Johson has detected a problems with Vc8 and global optimization (/Og). Some tests have shown a possible compiler bug. vc7.1 has no problems with /Og. I'm investigating this but meanwhile I recommend disabling /Og (which is deprecated in vc8) when using Shmem. Special thanks to Peter Johnson, Harold Pirtle and Jan Stetka for their help on this version. Regards, Ion

2 10

[date_time] What's the proper way to convert local to UTC?
by Scott 04 May '06

04 May '06

c_local_adjustor has the static method "utc_to_local" to easily convert to local time based on the machine TZ setting. So I figured it had a utc_from_local or local_to_utc method as well. Neither compiled, so I looked at the header file c_local_time_adjustor.hpp: //! Adjust to / from utc using the C API Yet there is only that one method in the class. Is the missing ability to convert from local to UTC an oversight or is it implemented somewhere else? What's the correct way to do it? Thanks, Scott

1 0

[serialization] Bug in text_oarchive but not in xml_oarchive?
by Bill Lear 04 May '06

04 May '06

I would assume that simply changing the following from xml_oarchive: ofstream ofs(filename.c_str(), ios::binary); boost::archive::xml_oarchive oa(ofs); oa << BOOST_SERIALIZATION_NVP(my_object); to text_oarchive (with, of course, appropriate changes to include the appropriate headers): ofstream ofs(filename.c_str(), ios::binary); boost::archive::text_oarchive oa(ofs); oa << BOOST_SERIALIZATION_NVP(my_object); should, a priori, not result in a core dump in the text_oarchive version? I am running under gcc 3.4.3, and and the Intel C++ compiler version 9.0, boost version 1.33.1. The text_oarchive fails with a segmentation violation on both compilers, and the xml_oarchive works with both. Cursory inspection of the xml output shows the xml to be well-formed, etc. Before I try to narrow this down further and provide a clear test that shows this error (which, given the complexity of the code and the size of the datasets, will be a considerable effort), I would like to know if my above assumption is correct, or if it is possible I have made a mistake somehow in writing my serialization methods. BTW, I am the same guy who has posted several (confirmed) bugs to this list: I am not a beginner, I have been using boost serialization for the better part of a year or so, so in general, I know what I'm doing. I say this simply because I don't want to waste a ton of time with this if I need not --- in short, to my mind, this looks like a clear example of a bug in the boost text_oarchive, but I perhaps may be wrong. Thank you. Bill

2 9

Re: [Boost-users] Thread-safe smart pointers, hashtables without locking
by james.jones＠firstinvestors.com 04 May '06

04 May '06

From: Ray Whitmer <ray(a)personallegal.net> >which I then increment and decrement using the defined thread-safe >operators from the add_ref and release methods, which should give me >a relatively-thread-safe smart pointer with an internal count without >having to do any actual locking. [snip] >I am just posting here to see if anyone knows of a missed trick or >bad assumption I have made here using these or other boost mechaniisms. Personally, I read this and said, "eeek!" (Well, not literally. My office mates would wonder what was up.) I think any design like this is going to be (at best) very non-portable, and (more likely) subject to breaking at the worst possible moment (i.e. when demonstrating to a customer). Is "relatively" thread-safe really good enough here? As a constructive suggestion, if you want to reduce lock conflicts in hash tables, have you considered some form of finer-grained locking? You could, for example, have one lock per "slot" in your hash table. Computing the hash and finding the slot is thread-safe (since it doesn't depend on the state of the hash table), so you could then lock only the slot itself while performing list maintenance or whatever you need to do to read/write the data. This would be truly thread-safe but might perform better if you have lots of simultaneous readers/writers. I haven't tested this, but if you do, I'd be interested to hear the results. Regards, - James PS - I'd be even more worried in Java, btw, since Java opcodes should map to CPU operations less well than a compiled binary. Not to mention that in Java, the portability assumption becomes really critical. Java classes are *supposed* to be portable.

1 0

Need help with integration of shared memory library (boost::shmem)
by Sascha Lumma 04 May '06

04 May '06

Shmem passed the review few month ago. Now I'd like to use it. But I found nothing about the integration into an existing boost distribution tree or to build the library stand alone. Firstly I tried to ununcompress the shmem*.zip (from Boost Sandbox Vault - Memory) into the boost distribution tree to build it all together. But there is no Jamfile in the shmem directories (only in the subdirectory 'test' and 'examples', but this is not the library). Which way I can take to get a working shmem library? many thanks, Sascha Lumma

2 1

Re: [Boost-users] [date_time] So how come there isn't a to_time_t helper func?
by Scott 04 May '06

04 May '06

> I suspect that it's a plot by the date_time author to keep > people from using time_t ;-) > > Seriously though, while your function will work for some > times, there are issues: > > 1) ptime can represent dates prior to 1970-1-1 and after 2038 > (or wherever the upper bound of time_t is). Probably need an > exception for these cases on the conversion. > 2) ptime can represent times with less than 1 second > resolution. Maybe the function should round instead of > truncating in case the time is > 2006-May-04 00:00:00.999999? > > So if you're sure your application doesn't care about any of > these issues than the function above should be fine. > > Jeff Thanks for the super quick reply. That's the fastest response I've gotten from this list! :) My application is dealing with retrieving TCP/IP packets stored on disk, which are in time_t. But I use boost to convert a user readable date into packet time. In this particular case, the truncating is okay. I removed the date vetting code for clarity. Thanks, Scott

2 1

[date_time] So how come there isn't a to_time_t helper func?
by Scott 04 May '06

04 May '06

I noticed there's a from_time_t() helper function, but I need to convert from a ptime to a time_t. Is this the proper way to do it? inline std::time_t to_time_t(ptime t) { ptime start(gregorian::date(1970,1,1)); time_duration dur = t - start; return dur.seconds(); } I'm also curious why such functionality isn't already available? Scott

2 1

[boost][test] Location of up to date documentation?
by Ed Johnson 04 May '06

04 May '06

In a previous post, someone mentioned the BOOST_GLOBAL_FIXTURE to me. I used google desktop to search all the 1.33.1 doc's and release notes, but could not find any mention of it. I did a web search and found it on: http://lists.boost.org/Archives/boost/2005/12/98092.php [boost] [test] self-registration facilities Date: 2005-12-14 What is this newsgroup? It doesn't appear to be available for news readers on news.gmane.org. I don't see it mentioned or linked off of the main boost site either: http://www.boost.org/ Can someone guide me on the best way to find all the boost documentation for the latest releases? Many thanks, Ed

2 2

boost.test - Can you determine order that Auto Test and Auto Suites will run among several test files?
by Ed Johnson 04 May '06

04 May '06

When using BOOST_AUTO_TEST_SUITE or BOOST_AUTO_TEST_CASE across multiple files, is there a way to guarantee which Test Case or Suite will execute last? In particular, I want the following test to always be executed last. BOOST_AUTO_TEST_CASE(waitForUserToPressEnter) { std::cout << "Press <ENTER> to continue..." << std::endl; std::cin.get(); } I like the post-build event trick to keeping output inside Visual Studio 7, but there will be times that I don't want the tests to all run each time I compile. Thanks, Ed

3 3

Boost lambda: iter_swap and treating lambda as iterator.
by chun ping wang 04 May '06

04 May '06

K the question is simple. How do i do iterator swap with lambda. lets say i have vector of U. vector<U> vecU; typedef vector<U>::iterator iter; iter beg(vecU.begin()); for_each(vec.begin(), vec.end(), ( if_(_1 == *beg) [ // swap the iterator between the current one and begin. ] ) );

1 1

[boost] [test] Need help with BOOST_GLOBAL_FIXTURE usage
by Ed Johnson 04 May '06

04 May '06

Hi, I tried to use the BOOST_GLOBAL_FIXTURE macro using 1.33.1, but I can't seem to get it to run. The breakpoints do not stop on it, and there is no output from the constructor or destructor. http://lists.boost.org/Archives/boost/2005/12/98092.php ------ #define BOOST_AUTO_TEST_MAIN #include <iostream> struct MyConfig { MyConfig() { std::cout << "global setup\n"; } ~MyConfig() { std::cout << "global teardown\n"; } }; BOOST_GLOBAL_FIXTURE( MyConfig ) ; BOOST_GLOBAL_FIXTURE( MyConfig m ) { m; } Any ideas? Thanks, Ed

2 1

Fusion 2. Vector Example
by John Christopher 03 May '06

03 May '06

Hello, At the bottom of the page http://spirit.sourceforge.net/dl_more/fusion_v2/libs/fusion/doc/html/fusion… there is the following example: vector<int, float> v(12, 5.5f); std::cout << at<0>(v) << std::endl; std::cout << at<1>(v) << std::endl; The example as such does not compile, Shouldn't it be:std::cout << at_c<0>(v) << std::endl;orstd::cout << at<boost::mpl::int_<0> >(v) << std::endl;

2 3

Thread-safe smart pointers, hashtables without locking
by Ray Whitmer 03 May '06

03 May '06

I found the boost libraries and templates as I was looking for thread- safe smart pointers. I was unable to use shared_ptr because I needed to be able to reconstitute a smart pointer from a raw pointer at any time without losing the count, so the count needs to be internal to the object, not external, so I am using intrusive_ptr. Since I need my intrusive_ptr to be thread-safe, I included: #include "boost/detail/atomic_count.hpp" and then I declared my internal count to be of type: boost::detail::atomic_count which I then increment and decrement using the defined thread-safe operators from the add_ref and release methods, which should give me a relatively-thread-safe smart pointer with an internal count without having to do any actual locking. This already seems like I may be going beyond the official interface by explicitly relying on something in the boost detail directory. Is it wrong to rely on this? But what I need now goes a bit further. I need a hashtable for which lookups are thread-safe without doing any locking. I only want to lock for adding or removing to/from the table. I already have the hashtable implementation that does this that I have used in Java for quite a while. In Java, I assumed the writing of a 32-bit reference into the hashtable array (or a null) was fairly atomic (which seemed reasonable on a 32-bit machine with normal alignment, etc). I made sure in the implementation that a writer who locks and changes the hashtable never temporarily places the hashtable into a state where it cannot be correctly read by any non- locking reader. I am hoping this will continue to work in C++ with the intrusive_ptr array of a hashtable. intrusive_ptr seems to contain a single 32-bit value which is likely to be atomic, at least as long as I avoid 16- bit architectures. Is there any better way to guarantee this? With the exception of the reference count, the objects being kept by the hashtable are read-only, so this should allow me any number of threads simultaneously operating on the same massive shared data hashtables (which can get cleaned up when no longer in use, by looking at ref counts). I am just posting here to see if anyone knows of a missed trick or bad assumption I have made here using these or other boost mechaniisms. Is the thread-safe hashtable that does not require locking for reading something that many others would benefit from? It is quite a simple implementation. Thanks, Ray Whitmer

1 0

[filesystem] boost::filesystem::filesystem_error thrown from boost::filesystem::is_directory is not caught by application
by Tim MacKinnon 03 May '06

03 May '06

OS - Solaris8 Compiler - gcc 3.4.0 boost version - 1_32 I have an application that is using the boost filesystem library. Here is a snippit of the code : void DirectoryInterface::listSubDirectories(String dirPath, FileList & dirList) { pthread_rwlock_rdlock(&DirectoryInterface::fsRwMutex); try { boost::filesystem::path filePath(dirPath, boost::filesystem::native); boost::filesystem::directory_iterator iter(filePath), iterEnd; if(boost::filesystem::exists(filePath)) { for (; iter != iterEnd; ++iter) { if(boost::filesystem::is_directory(*iter)) { .. do something } } } } catch (boost::filesystem::filesystem_error& ex) { .. do something } catch (std::exception& ex) { .. do something } catch (...) { .. do something } pthread_rwlock_unlock(&DirectoryInterface::fsRwMutex); } An exception is thrown by the call to boost::filesystem::is_directory() but is not caught by any of the catch blocks shown here. The application simply terminates with the following message : terminate called after throwing an instance of 'boost::filesystem::filesystem_error' what(): boost::filesystem::is_directory: "/opt/users/tmackinn/neDatabases/20060429050000.auto/10.1.26.25": No such file or directory Abort - core dumped Any ideas what I could be doing wrong? Thanks in advance, Tim

1 0

[variant] determine if the type is a variant type
by Chris Weed 03 May '06

03 May '06

Hi, Is there a way to do something like is_variant<T>::value to determine if my type T is a variant type? Chris

1 0

boost::multi_index_container different search key type
by bert hubert 03 May '06

03 May '06

Joaquin, list, In one of the last issues of the C/C++ User's Journal, Andrei Alexandrescu described the need for something better than std::map when using expensive keys: Let's start with two examples. The simplest one would involve the often-used map<string, something>: user names and user IDs, stock tickers and stock prices, class names and pointers to functions, words in Proust's opera and their counts...You can easily access the "something" if you have a key in the desired format. The problem is, you might have the key in a different format that forces a conversion. What if, for example, in your high-speed, high-availability, power-hungry, bonus-bringing stock market program, you have securities data come down the wire in raw char* format, but you need to look it up in a map<string, double>? More on http://www.ddj.com/dept/cpp/184402065 - might this be something boost::multi_index_container could be made to do? Not that boost::multi_index_container isn't wonderful enough already! Thanks. -- http://www.PowerDNS.com Open source, database driven DNS Software http://netherlabs.nl Open and Closed source services

1 0

Is this possible with boost::multi_index?
by Jason House 03 May '06

03 May '06

Below is a small piece of code that I can't get to compile. gcc says: error: forward declaration of 'class search_node' Is there a way to get around this, or can I not embed a multi_index_container like that? I'm using boost 1_32_0 and gcc version 4.0.1 The code below is for a node within a search tree. Each node stores a > class search_node{ > int objective_value; // Objective function > position my_position; // Move location for this step in the search > std::list<position> positions_to_visit; // Future moves to consider in search > boost::multi_index_container < > search_node, > indexed_by< > ordered_unique <search_node, position, &search_node::my_position>, > ordered_non_unique<search_node, int, &search_node::objective_value> > > > search_results; > }; ... or am I just going down a wrong path? I'm trying to build a search tree. I know boost::graph exists, but don't know if it'd be more appropriate.

2 1

Boost 1.33.1 build failure
by Paul Melis 03 May '06

03 May '06

I'm trying to build 1.33.1 on an AMD64 system, using bjam 3.1.12 and build command bjam "-sTOOLS=gcc" stage I get a horrible amount of error output which roughly reads Building Boost.Regex with the optional Unicode/ICU support disabled. Please refer to the Boost.Regex documentation for more information (and if you don't know what ICU is then you probably don't need it). Jamfile:278: in load-jamfiles *** argument error * rule stage ( name : sources + : requirements * : local-build * ) * called with: ( : /home1/rugrchpc/melis/boost_1_33_1/boost/compatibility/cpp_c_headers/cwchar /home1/rugrchpc/melis/boost_1_33_1/boost/compatibility/cpp_c_h eaders/csignal /home1/rugrchpc/melis/boost_1 [...] 1/rugrchpc/melis/boost_1_33_1/boost/pending/detail/int_iterator.hpp /home1/rugrchpc/melis/boost_1_33_1/boost/pending/detail/property.hpp /home1/rugrchpc/melis /boost_1_33_1/boost/pending/detail/disjoint_sets.hpp : <locate>stage <tree-subdirs>/home1/rugrchpc/melis/boost_1_33_1 <target>all : <suppress>true ) * missing argument name /home1/rugrchpc/melis/boost_1_33_1/tools/build/v1/boost-base.jam:2330:see definition of rule 'stage' being called /home1/rugrchpc/melis/boost_1_33_1/tools/build/v1/bootstrap.jam:21: in boost-build /home1/rugrchpc/melis/boost_1_33_1/boost-build.jam:16: in module scope I've tried looking at the Jamfile and line number mentioned, but I can't figure this stuff out. Any clue what is going on? Paul -- Paul Melis VR Specialist, Center for High-Performance Computing & Visualization, University of Groningen, The Netherlands T: +31 50 363 9298 E: p.e.c.melis(a)rug.nl W: http://www.rug.nl/rc/hpcv/index

1 0

Re: [Boost-users] WG: defining a function<>-object with a returnvalue of the same type (recursive declaration)
by Oliver.Kowalke＠qimonda.com 03 May '06

03 May '06

Hmm - I would use boost::function instead of declaring a function-pointer object by myself. Regards, Oliver >On 5/2/06, Oliver.Kowalke(a)qimonda.com <Oliver.Kowalke(a)qimonda.com> wrote: >> how can I define a function<> object which returns a value of >> the same type: > >This was taken from GotW article 57: >http://www.gotw.ca/gotw//057.htm > > struct FuncPtr_; > typedef FuncPtr_ (*FuncPtr)(); > > struct FuncPtr_ > { > FuncPtr_( FuncPtr pp ) : p( pp ) { } > operator FuncPtr() { return p; } > FuncPtr p; > }; > >Now we can declare, define, and use f() naturally: > > FuncPtr_ f() { return f; } // natural return syntax > > int main() > { > FuncPtr p = f(); // natural usage syntax > p(); > } > >HTH, > >Michael Fawcett >_______________________________________________ >Boost-users mailing list >Boost-users(a)lists.boost.org >http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

[BGL] Maxflow alg. - Flow lower bounds and bidirected edges
by Leandro Melo 03 May '06

03 May '06

Hi. Due to the special requirements of boost maxflow algorithms (edmonds-karp and preflow-push), I don't know how the procedure would be for computing maxflow in graph with biderected edges. In other words, graphs that already have edges (u, v) and (v, u) for a few given vertices u and v. In such graphs, it would not be possible for example to set the capacity of reverse edge to 0 (zero). Would the implementation work anyway? Also, is there a way to set lower bounds for the flow of some given edges? Thanks. -- Leandro Terra C. Melo

1 0

recommended way to implement 'getline()'?
by bert hubert 03 May '06

03 May '06

Chris, boost-users, I'm currently considering asio for a project but I have to do a lot of typing to asynchronously read a simple line of text, when I do it like the http server request_parser::consume (via connection::handle_read). Has anybody already written a primitive, 'read_up_to(char delimiter)' or something? If so, I'd love to hear. Thanks! -- http://www.PowerDNS.com Open source, database driven DNS Software http://netherlabs.nl Open and Closed source services

1 0

Vector of Polymorphic Pointers
by Juan Quiroz 03 May '06

03 May '06

I am trying to serialize a vector of polymorphic pointers. My code looks as follows: class ASTNode{ ... protected: vector <ASTNode*> children; string name; string type; private: // Code for serialization friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, unsigned int version) { ar & name; ar & type; ar & children; } } class ASTNode2: public ASTNode{ ... private: // Code for serialization friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, unsigned int version) { // serialize base class information ar & boost::serialization::base_object<ASTNode>(*this); } // End code for serialization } I use the vector "children" to hold pointers to both base and derived objects. I have tried registering the derived classes at the top of the serialize function call, with the use of ar.register(static_cast<ASTNode*>(NULL)). I have also tried using the BOOST_CLASS_EXPORT_GUID macro to register the classes in main. Yet, I still get a unregistered class exception. Any guidance would be greatly appreciated.

4 11

boost.test - post build event in Visual Studio 7.1 is not redirecting output?
by Ed Johnson 03 May '06

03 May '06

Hi, I am a newbie at this, and I've been wrestling with boost auto test for a while now in Visual Studio 2003. Using boost_1_33_1. I am using the auto_unit_test_test_mult1.cpp, auto_unit_test_test_mult2.cpp for testing. They compile fine. I put in the post build event into my project: "$(TargetDir)\$(TargetName).exe" --result_code=no --report_level=no However, when I click 'Debug', VS still pops the output into a cmd window, and that disappears at the end of execution. The output window inside VS reads: Debug 'testhivm.exe': Loaded 'C:\workspace\hivm\trunk\src\test\Debug\testhivm.exe', Symbols loaded. 'testhivm.exe': Loaded 'C:\WINDOWS\system32\ntdll.dll', No symbols loaded. 'testhivm.exe': Loaded 'C:\WINDOWS\system32\kernel32.dll', No symbols loaded. The program '[5848] testhivm.exe: Native' has exited with code 0 (0x0). I've attached my BuildLog below. Thanks in advance for any help, Ed Build Log ------- Build started: Project: testhivm, Configuration: Debug|Win32 ------- Environment Space ALLUSERSPROFILE=C:\Documents and Settings\All Users ANT_HOME=C:\ant APPDATA=C:\Documents and Settings\Administrator\Application Data ArmServerInfo=00010556 CLASSPATH=C:\workspace\EclipseVscb\VCB\libraries\jars\core\vscb-framework.jar;C:\Program Files\Java\jre1.5.0_06\lib\ext\QTJava.zip CommonProgramFiles=C:\Program Files\Common Files COMPUTERNAME=SFJK39 ComSpec=C:\WINDOWS\system32\cmd.exe FP_NO_HOST_CHECK=NO HOMEDRIVE=C: HOMEPATH=\Documents and Settings\Administrator INCLUDE=C:\cppunit-1.11.4\include;C:\Boost\include\boost-1_33_1;C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\include;C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\atlmfc\include;C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\PlatformSDK\include\prerelease;C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\PlatformSDK\include;C:\Program Files\Microsoft Visual Studio .NET 2003\SDK\v1.1\include JAVA_HOME=C:\Sun\AppServer\jdk LIB=C:\Boost\lib;C:\cppunit-1.11.4\lib;C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\lib;C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\atlmfc\lib;C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\PlatformSDK\lib\prerelease;C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\PlatformSDK\lib;C:\Program Files\Microsoft Visual Studio .NET 2003\SDK\v1.1\lib LIBPATH=C:\WINDOWS\Microsoft.NET\Framework\v1.1.4322 LOGONSERVER=\\SFJK39 NB_HOME=C:\Documents and Settings\Administrator\.netbeans NUMBER_OF_PROCESSORS=1 OS=Windows_NT Path=C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\bin;C:\Program Files\Microsoft Visual Studio .NET 2003\Common7\Tools\bin\prerelease;C:\Program Files\Microsoft Visual Studio .NET 2003\Common7\Tools\bin;C:\Program Files\Microsoft Visual Studio .NET 2003\Common7\tools;C:\Program Files\Microsoft Visual Studio .NET 2003\Common7\ide;C:\Program Files\HTML Help Workshop\;C:\Program Files\Microsoft Visual Studio .NET 2003\SDK\v1.1\bin;C:\WINDOWS\Microsoft.NET\Framework\v1.1.4322;C:\Perl\bin\;C:\WINDOWS\system32;C:\WINDOWS;C:\WINDOWS\System32\Wbem;C:\PROGRA~1\ULTRAE~1;C:\Sun\AppServer\jdk\bin;C:\cygwin\bin;C:\mico\idl;C:\mico\libs;C:\Program Files\Common Files\GTK\2.0\bin PATHEXT=.COM;.EXE;.BAT;.CMD;.VBS;.VBE;.JS;.JSE;.WSF;.WSH;.PL;.pyo;.pyc;.pyw;.py PROCESSOR_ARCHITECTURE=x86 PROCESSOR_IDENTIFIER=x86 Family 6 Model 9 Stepping 5, GenuineIntel PROCESSOR_LEVEL=6 PROCESSOR_REVISION=0905 ProgramFiles=C:\Program Files QTJAVA=C:\Program Files\Java\jre1.5.0_06\lib\ext\QTJava.zip SESSIONNAME=Console SystemDrive=C: SystemRoot=C:\WINDOWS TEMP=C:\DOCUME~1\ADMINI~1\LOCALS~1\Temp TMP=C:\DOCUME~1\ADMINI~1\LOCALS~1\Temp USERDOMAIN=SFJK39 USERNAME=Administrator USERPROFILE=C:\Documents and Settings\Administrator VS71COMNTOOLS=C:\Program Files\Microsoft Visual Studio .NET 2003\Common7\Tools\ windir=C:\WINDOWS _ACP_ATLPROV=C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\bin\ATLPROV.DLL _ACP_INCLUDE=C:\Boost\include\boost-1_33_1;C:\cppunit-1.11.4\include;C:\Boost\include\boost-1_33_1;C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\include;C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\atlmfc\include;C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\PlatformSDK\include\prerelease;C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\PlatformSDK\include;C:\Program Files\Microsoft Visual Studio .NET 2003\SDK\v1.1\include _ACP_LIB=C:\Boost\lib;C:\cppunit-1.11.4\lib;C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\lib;C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\atlmfc\lib;C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\PlatformSDK\lib\prerelease;C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\PlatformSDK\lib;C:\Program Files\Microsoft Visual Studio .NET 2003\SDK\v1.1\lib;C:\Boost\include\boost-1_33_1;C:\cppunit-1.11.4\include;C:\Boost\include\boost-1_33_1;C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\include;C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\atlmfc\include;C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\PlatformSDK\include\prerelease;C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\PlatformSDK\include;C:\Program Files\Microsoft Visual Studio .NET 2003\SDK\v1.1\include _ACP_PATH=C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\bin;C:\Program Files\Microsoft Visual Studio .NET 2003\Common7\Tools\bin\prerelease;C:\Program Files\Microsoft Visual Studio .NET 2003\Common7\Tools\bin;C:\Program Files\Microsoft Visual Studio .NET 2003\Common7\tools;C:\Program Files\Microsoft Visual Studio .NET 2003\Common7\ide;C:\Program Files\HTML Help Workshop\;C:\Program Files\Microsoft Visual Studio .NET 2003\SDK\v1.1\bin;C:\WINDOWS\Microsoft.NET\Framework\v1.1.4322;C:\Perl\bin\;C:\WINDOWS\system32;C:\WINDOWS;C:\WINDOWS\System32\Wbem;C:\PROGRA~1\ULTRAE~1;C:\Sun\AppServer\jdk\bin;C:\cygwin\bin;C:\mico\idl;C:\mico\libs;C:\Program Files\Common Files\GTK\2.0\bin Command Lines Creating temporary file "c:\workspace\hivm\trunk\src\test\Debug\RSP0002A8.rsp" with contents [ /Od /I "C:\Boost\include\boost-1_33_1" /D "TESTING" /D "_MBCS" /Gm /EHsc /RTC1 /MTd /GR /Fo"Debug/" /Fd"Debug/vc70.pdb" /W3 /c /Wp64 /ZI /Gd .\auto_unit_test_test_mult1.cpp .\auto_unit_test_test_mult2.cpp ] Creating command line "cl.exe @c:\workspace\hivm\trunk\src\test\Debug\RSP0002A8.rsp /nologo" Creating temporary file "c:\workspace\hivm\trunk\src\test\Debug\RSP0002A9.rsp" with contents [ /OUT:"Debug/testhivm.exe" /INCREMENTAL /NOLOGO /LIBPATH:"C:\Boost\lib" /TLBID:1 /DEBUG /PDB:"Debug/testhivm.pdb" /SUBSYSTEM:CONSOLE /MACHINE:X86 libboost_unit_test_framework-vc71-mt-sgd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib "\Boost\lib\libboost_unit_test_framework-vc71-mt-sgd.lib" .\Debug\auto_unit_test_test_mult2.obj .\Debug\auto_unit_test_test_mult1.obj ] Creating command line "link.exe @c:\workspace\hivm\trunk\src\test\Debug\RSP0002A9.rsp" Creating temporary file "c:\workspace\hivm\trunk\src\test\Debug\BAT0002AA.bat" with contents [ @echo off "c:\workspace\hivm\trunk\src\test\Debug\\testhivm.exe" --result_code=no --report_level=no if errorlevel 1 goto VCReportError goto VCEnd :VCReportError echo Project : error PRJ0019: A tool returned an error code from "Auto Run Test" exit 1 :VCEnd ] Creating command line "c:\workspace\hivm\trunk\src\test\Debug\BAT0002AA.bat" Output Window Compiling... auto_unit_test_test_mult1.cpp auto_unit_test_test_mult2.cpp Generating Code... Linking... Auto Run Test Running 2 test cases... Results Build log was saved at "file://c:\workspace\hivm\trunk\src\test\Debug\BuildLog.htm" testhivm - 0 error(s), 0 warning(s)

1 1

Viewing datatypes in the watch window
by John Krajewski 02 May '06

02 May '06

Anyone know any good tricks to display Boost types in the watch window in a readable form? VC8 does a good job with the STL containers, but it chokes a bit on Boost containers (especially the BGL) -John

2 1

passing variable into template parameters.
by chun ping wang 02 May '06

02 May '06

Its more of a c++ question but i wonder how would I pass constant variables into template parameters such as nth_index_iterator. Example: void func(const int& var) { nth_index_iterator<var>::type; } Is this possible whats the work around this limitation?

4 4

Re: [Boost-users] [smart_ptr] Resetting an intrusive_ptr
by Nat Goodspeed 02 May '06

02 May '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] On Behalf Of Scott Meyers > Sent: Tuesday, May 02, 2006 1:00 PM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] [smart_ptr] Resetting an intrusive_ptr > > Peter Dimov wrote: > > The reason for p = 0 working in intrusive_ptr's case is that > intrusive_ptr > > has an assignment operator taking a raw pointer. The other smart pointer > > types do not. > > I understand that, my question was more about why this operation is > supported only for intrusive_ptr. [Nat] The library discourages casual conversion from Foo* to shared_ptr<Foo> because it is a Bad Thing when you instantiate a second shared_ptr<Foo> for the same Foo* value. Now you have two different reference counts floating around on the heap. When either goes to zero, every shared_ptr<Foo> value based on the other reference count becomes a land mine. On the other hand, intrusive_ptr is designed to be able to cope with casual conversion of exactly that type. That's why, unlike shared_ptr, the intrusive_ptr constructor that accepts a dumb pointer is not marked 'explicit'. Simple dumb-pointer assignment works for the same reason. Concerning the missing reset() method, I can only surmise that the author considered it unnecessary, given assignment support. I for one wouldn't object to it being added.

1 0

[smart_ptr] Resetting an intrusive_ptr
by Scott Meyers 02 May '06

02 May '06

Suppose I have an auto_ptr, shared_ptr, or scoped_ptr. If I want to set it to null, I do this (assuming the pointer is named p): p.reset(); // okay If I try this, p = 0; // error I get an error during compilation. In other words, reset works, but assignment of the null pointer does not. But suppose p is an intrusive_ptr. Now p.reset(); // error fails, and p = 0; // okay succeeds. In other words, assignment works, but reset does not. I find this, er, unintuitive. Does anybody know why intrusive_ptr marches to its own nullifying drummer? Thanks, Scott

2 2

WG: defining a function<>-object with a return value of the same type (recursive declaration)
by Oliver.Kowalke＠qimonda.com 02 May '06

02 May '06

Hello, how can I define a function<> object which returns a value of the same type: // doesn't work with gcc-4.1 class X; typedef function< X() > X; X x1 = bind(...); X x2 = x1(); Regards, Oliver

2 1

Re: [Boost-users] passing variable into template parameters.
by Nat Goodspeed 02 May '06

02 May '06

From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of chun ping wang Sent: Tuesday, May 02, 2006 12:54 AM To: boost-users(a)lists.boost.org Subject: [Boost-users] passing variable into template parameters. Its more of a c++ question but i wonder how would I pass constant variables into template parameters such as nth_index_iterator. Example: void func(const int& var) { nth_index_iterator<var>::type; } Is this possible whats the work around this limitation? [Nat] Could you just make func() a template function, and have 'var' be a template parameter rather than a runtime function parameter?

1 0

incremental_components, component_index for listS, listS adjacency_list
by Sean Kelly 02 May '06

02 May '06

Hi All, I couldn't figure out how to use the component_index facility of the incremental components algorithm when operating on an listS, listS adjecency_list so I rolled my own as per below. Any suggestion on how to use the provided interface are appreciated. thanks Sean using namespace boost; typedef graph_traits<BlockDependencyGraph>::vertices_size_type size_type; typedef BlockDependencyGraph::vertex_descriptor vertex_descriptor; typedef BlockDependencyGraph::vertex_iterator vertex_iterator; BlockDependencyGraph& graph = _blk_dep_view->get_graph(); // Disjoint sets requires Rank to map vertex_descriptors onto integers typedef std::map<vertex_descriptor, int> rank_storage_t; rank_storage_t rank_map; typedef associative_property_map<rank_storage_t> rank_t; // Disjoint sets requires Parent to map vertex_descriptors onto vertex_descriptors typedef std::map<vertex_descriptor, vertex_descriptor> parent_storage_t; parent_storage_t parent_map; typedef associative_property_map<parent_storage_t> parent_t; disjoint_sets<rank_t, parent_t> component_set(make_assoc_property_map(rank_map), make_assoc_property_map(parent_map)); initialize_incremental_components(graph, component_set); incremental_components(graph, component_set); // Not at all clear how to extract components using component_index interface // when graph is listS, listS adjacency_list... so we roll our own. // // Index vertices by representative component in a multimap typedef std::map<vertex_descriptor, std::vector<vertex_descriptor> > components_t; components_t components; vertex_iterator curr(0), end(0); for(tie(curr, end) = vertices(graph); curr != end; ++curr) { components[component_set.find_set(*curr)].push_back(*curr); } // Print all components size_t n_c(0); for(components_t::const_iterator c = components.begin(); c != components.end(); ++c, ++n_c) { std::cout << "component " << n_c << std::endl; for(std::vector<vertex_descriptor>::const_iterator element = c->second.begin(); element != c->second.end(); ++element) { std::cout << graph[*element]->get_name() << std::endl; } }

2 1

Fusion. transform_view example
by John Christopher 02 May '06

02 May '06

Hello, The example at the bottom of: http://spirit.sourceforge.net/dl_more/fusion_v2/libs/fusion/doc/html/fusion… does not compile; I am using MinGw 3.4.2. #include <iostream> #include <boost/fusion/sequence.hpp> #include <boost/fusion/algorithm.hpp> using namespace boost::fusion; struct square { template <typename T> struct result { typedef int type; }; template <typename T> int operator()(T x) const { return x * x; } }; typedef vector<int, short, double> vector_type; int main (int argc, char ** argv) { vector_type vec(2, 5, 3.3); transform_view<vector_type, square> transform(vec, square()); std::cout << transform << std::endl; // return 0; } More specifically it is the line std::cout << transform << std::endl; that seems to create the problem. I was also wondering why operator() of square return int and not T. Thanks

2 3

Re: [Boost-users] Timer
by Andy Little 02 May '06

02 May '06

"Vivek Bhat" <bhat.vivek(a)gmail.com> wrote > Hello, I'm a Mechanical Engineer (see: programming-knowledge defficient) and > I need some code to output an elapsed time, accurate to within at least > hundredths of a second. Hi Vivek. Actually I think you are on the wrong boost list. The one you want for this sort of query is the boost user list gmane.comp.lib.boost.user. I have cross posted this item there and you should send any followups there only too. > It appears to me as though the 'timer' > library<http://www.boost.org/libs/timer/timer.htm>is ideal for this > application, but when I try to run the simple code given > in the documentation, I get errors regarding missing .hpp files. I'm > assuming that I have made errors in downloading and installing the boost > libraries. I tried to read the 'getting started' section, but I'm having > difficulty understanding. Are there any more simple 'getting started' > instructions available for programming dunces running Windows? As far as I know Boost.Timer is just a wrapper for the C standard timer functions in <ctime>. Anyway it would be helpful to provide more details of the compiler you are using and the actual error messages you are getting too. Hope this helps regards Andy Little

1 0

[program_options] Abort trap by store
by Pascal Vizeli 02 May '06

02 May '06

Hi, I habe a problem with store(parse_config_file(...), ...); I don't know why... That isn't my first program with program_options but it is my first program with parse_command_line and parse_config_file in one. Here is my code. First I parse the command line, second I parse the config file. Is it a very simple script. With my debuger (gdb and ddd) I can see, that the problem is here: bpo::store(bpo::parse_config_file(conf_file, desc_file), vm); (at the "end" from script). vm is global definiert. The Namspace bpo ist boost::program_options I use the gcc 3.3.5 and I compile static with: /usr/local/lib/libboost_program_options-gcc-1_33_1.a My OS is OpenBSD What I make false? My script is at the end. Sorry for my bad english. I thanks for Help, Dear, Pascal Vizeli [cpp] bpo::variables_map vm_cmd; bpo::options_description desc_file("config file"), desc_cmd("command line"); // Make options descriptions desc_cmd.add_options() ("config,c", bpo::value<std::string>(), "The Config file") ("help,h", "produce help message") ; desc_file.add_options() ("port", bpo::value<int>()->default_value(6667), "IRC Server Port") ("server", bpo::value<char *>(), "IRC Server IP") ("nick", bpo::value<std::string>(), "Bot Nick") ("user", bpo::value<std::string>(), "username hostname servername :realname") ("nickserv", bpo::value<std::string>(), "Nickserv Identify string") ("oper-pw", bpo::value<std::string>(), "Oper Password") ("mode", bpo::value<std::string>(), "Mode for Bot") ("logchan", bpo::value<std::string>(), "A #Chan for logs") ("logchan_status", bpo::value<int>(), "Logchan On or Off") ("invite-chan", bpo::value<int>(), "Invite for logchan?") ("invite-command", bpo::value<std::string>(), "Invite Command") ("re-chan", bpo::value<int>(), "Refresh Channellist until SEC") ("logfile", bpo::value<std::string>(), "File for logs") ("chroot", bpo::value<char *>(), "Set the chroot dir (path)") ; // Parse CMD bpo::store(bpo::parse_command_line(argc, argv, desc_cmd), vm_cmd); bpo::notify(vm_cmd); if(vm_cmd.count("help")){ std::cout << desc_cmd << std::endl; std::cout << desc_file << std::endl; exit(0); } if(!vm_cmd.count("config")){ printo_err("Config file not found! Use --help for Infos"); exit(0); } // Open Config file std::ifstream conf_file(vm_cmd["config"].as<std::string>().c_str()); if(conf_file.is_open()){ // Parse Config file bpo::store(bpo::parse_config_file(conf_file, desc_file), vm); // Here is the false say my debuger bpo::notify(vm); }else{ printo_err("can't open the conf file!"); exit(0); } [/cpp]

2 1

[BGL] parallel edges
by John Krajewski 02 May '06

02 May '06

How do I make a graph that will just ignore when I attempt to add a parallel edge? Is there a way to set this on the graph, or is it only determined by the type of storage structures I'm using with the graph? I want to use a vecS to store the edges, but I dont want to allow parallel edges. -John

2 1

Re: [Boost-users] adjacency_list directed to undirected conversion
by Sean Kelly 01 May '06

01 May '06

Doug, thanks -- that worked nicely. cheers Sean -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Douglas Gregor Sent: Wednesday, April 26, 2006 6:43 AM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] adjacency_list directed to undirected conversion On Apr 25, 2006, at 12:16 PM, Sean Kelly wrote: > I have a directed adjacency_list graph for which I would like to > identify connected components (ignoring the directed-ness). After > poking around the BGL docs it seems that my best option is to role my > own algo To do this, you could use the incremental connected components algorithms in the BGL. Those work equally well on directed and undirected graphs. Doug _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

[BGL] Inverting the map from strong_connected
by John Krajewski 01 May '06

01 May '06

Hi all, The function "strong_components" produces a mapping from vertex to component - but what I need is a mapping the other way, from component to vertex! Now of course I could go through the property_map, query each vertex, and create the new map myself, but theres got to be a better way. The map is just a writable_property_map concept, so theoretically I should be able to create my own somehow that will swap the key and value, but I'm not sure how I would do that. Any suggestions? I also want to create a graph of the strongly connected components, but I suppose theres no tricky way to do this - just go through each vertex in the returned map and add its connections to the strong component's connections (though there's probably something tricky I could do with iterators to make this automatic) Thanks for any help, my mind is still adjusting to being warped by this generic programming stuff :)

1 0

[serialization] My archive class + BOOST_CLASS_EXPORT
by Denis Kuznetsov 01 May '06

01 May '06

I have my own archive class (derived from binary_oarchive_impl). And I have a base abstract class and derived classes(non-abstract). I use BOOST_CLASS_EXPORT macro to register my derived classes. But it seems the macro works only for Boost archives, not for user defined archives. Is there any way to register derived classes to get the same functionality that BOOST_CLASS_EXPORT provides?

3 3

filesystem/signals/serialization dlls not linking
by Dave Compton 30 Apr '06

30 Apr '06

When I try to build boost 1_33_1 with mingw ( gcc 3.4.2 ) some libraries don't link properly. At the end of the build process, the following files are missing : boost_filesystem-mgw-1_33_1.dll boost_filesystem-mgw-1_33_1.lib boost_filesystem-mgw-d-1_33_1.dll boost_filesystem-mgw-d-1_33_1.lib boost_filesystem-mgw-d.lib boost_filesystem-mgw-mt-1_33_1.dll boost_filesystem-mgw-mt-1_33_1.lib boost_filesystem-mgw-mt-d-1_33_1.dll boost_filesystem-mgw-mt-d-1_33_1.lib boost_filesystem-mgw-mt-d.lib boost_filesystem-mgw-mt.lib boost_filesystem-mgw.lib boost_serialization-mgw-1_33_1.dll boost_serialization-mgw-1_33_1.lib boost_serialization-mgw-d-1_33_1.dll boost_serialization-mgw-d-1_33_1.lib boost_serialization-mgw-d.lib boost_serialization-mgw-mt-1_33_1.dll boost_serialization-mgw-mt-1_33_1.lib boost_serialization-mgw-mt-d-1_33_1.dll boost_serialization-mgw-mt-d-1_33_1.lib boost_serialization-mgw-mt-d.lib boost_serialization-mgw-mt.lib boost_serialization-mgw.lib boost_signals-mgw-1_33_1.dll boost_signals-mgw-1_33_1.lib boost_signals-mgw-d-1_33_1.dll boost_signals-mgw-d-1_33_1.lib boost_signals-mgw-d.lib boost_signals-mgw-mt-1_33_1.dll boost_signals-mgw-mt-1_33_1.lib boost_signals-mgw-mt-d-1_33_1.dll boost_signals-mgw-mt-d-1_33_1.lib boost_signals-mgw-mt-d.lib boost_signals-mgw-mt.lib boost_signals-mgw.lib I believe that all the other libraries are building successfully. Here are the first few errors that appear in my build log: gcc-Link-action bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\debug\boost_filesystem-mgw-d-1_33_1.dll bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\debug\boost_filesystem-mgw-d-1_33_1.lib Creating library file: bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\debug\boost_filesystem-mgw-d-1_33_1.lib bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\debug\operations_posix_windows.obj(.text+0x7ac): In function `ZN5boost10filesystem6detail12dir_itr_initERNS_10shared_ptrINS1_11dir_itr_impEEERKNS0_4pathE': c:/cygwin_home/dave/devl/thirdParty/Cygwin/boost/boost_1_33_1x/src/boost_1_33_1/libs/filesystem/build/../src/operations_posix_windows.cpp:308: undefined reference to `boost::filesystem::detail::system_error_code()' bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\debug\operations_posix_windows.obj(.text+0x81d):c:/cygwin_home/dave/devl/thirdParty/Cygwin/boost/boost_1_33_1x/src/boost_1_33_1/libs/filesystem/build/../src/operations_posix_windows.cpp:308: undefined reference to `boost::filesystem::filesystem_error::filesystem_error(std::string const&, boost::filesystem::path const&, int)' bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\debug\operations_posix_windows.obj(.text+0x8d7):c:/cygwin_home/dave/devl/thirdParty/Cygwin/boost/boost_1_33_1x/src/boost_1_33_1/libs/filesystem/build/../src/operations_posix_windows.cpp:308: undefined reference to `boost::filesystem::filesystem_error::~filesystem_error()' bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\debug\operations_posix_windows.obj(.text+0x8f3):c:/cygwin_home/dave/devl/thirdParty/Cygwin/boost/boost_1_33_1x/src/boost_1_33_1/libs/filesystem/build/../src/operations_posix_windows.cpp:308: undefined reference to `boost::filesystem::filesystem_error::~filesystem_error()' So far my work around has been to use 1_33_0 which builds 100% cleanly. Does anyone have any idea either what I might be doing wrong or what is going wrong otherwise. Thanks. - Dave

1 2

[Serialization] Difficulties with export
by Joseph Hosteny 30 Apr '06

30 Apr '06

Thanks for the response. I'd have continued the thread, but I didn't get the original emails from the list to reply to. I tried an explicit registration, with the same results. Also, I did step into the code where the EXPORT macros were being called, and I verified that the pertinent classes were registered in the boost::serialization::detail::ktmap, at least (not sure about the tkmap). It seems like it just doesn't find the class in the oserialization file where the exception is thrown. The serialization is invoked in a const public class method, via "oa << this;" Is there anything tricky you might be aware of that could cause the type comparisons to fail? Could I potentially be missing something in my class? Unfortunately, the project is quite large and it'd fairly difficult to strip out everything and add it back in incrementally.

2 4

[shared_ptr] Problem refeering back to a parent class.
by Eoin 30 Apr '06

30 Apr '06

Hello, I've a question, I don't know if I'm doing something technically wrong or if my whole approach is totally wrong. To explain I have a class (foo) managed by a shared_ptr and it contains a member class (bar) with needs to access some members of foo. So I figure I need some sort of pointer in the bar class back to the foo class. I thought using a weak_ptr was the obvious choice, here is what I came up with it; using namespace boost; class foo; class bar { public: bar(weak_ptr<foo> f) : foo_(f) {} private: weak_ptr<foo> foo_; }; class foo : public boost::enable_shared_from_this<foo> { public: foo() : bar_(shared_from_this()) {} private: bar bar_; }; But I get a boost::bad_weak_ptr error. Now if I use regular pointers instead of weak_ptr's I can get stuff working except that when I use "bar_(this)" in the initialization list for foo MSVC 7.1 gives me a warning, which I don't like. Is there a more appropriate method I should be using to accomplish this. Kind Regards, Eoin.

3 2

String Algorithm: const_cast warning in 1.33.1
by Roman Neuhauser 30 Apr '06

30 Apr '06

The attached patch silences the warnings below in <boost/algorithm/string/split.hpp> (c++ (GCC) 3.4.4 [FreeBSD] 20050518). roman@dagan ~/codex/argv0 1016:0 > cat test.c++ #include <boost/algorithm/string/split.hpp> int main() { return 0; } roman@dagan ~/codex/argv0 1017:0 > c++ -pedantic -Wall -Wextra -Wcast-qual -Wwrite-strings -Wctor-dtor-privacy -Wfloat-equal -Winline -Woverloaded-virtual -Wredundant-decls -Wsign-compare -I/usr/local/include test.c++ /usr/local/include/boost/range/detail/implementation_help.hpp: In function `Char* boost::range_detail::str_end(Char*) [with Char = char]': /usr/local/include/boost/range/end.hpp:98: instantiated from here /usr/local/include/boost/range/detail/implementation_help.hpp:58: warning: cast from `const char*' to `char*' discards qualifiers from pointer target type /usr/local/include/boost/range/detail/implementation_help.hpp: In function `Char* boost::range_detail::str_end(Char*) [with Char = wchar_t]': /usr/local/include/boost/range/end.hpp:103: instantiated from here /usr/local/include/boost/range/detail/implementation_help.hpp:58: warning: cast from `const wchar_t*' to `wchar_t*' discards qualifiers from pointer target type -- How many Vietnam vets does it take to screw in a light bulb? You don't know, man. You don't KNOW. Cause you weren't THERE. http://bash.org/?255991

2 1

Google Summer of Code -- Call for Participation / Schedule
by Jeff Garland 29 Apr '06

29 Apr '06

All - (cross-posted to the user list so the larger Boost community sees this) Readers of the developer list may have seen that Boost has been accepted as a participating organization. See http://code.google.com/soc/boost/about.html for the initial Boost Summer of Code page. Now for the hard part. We have a fairly tight schedule to get organized on project proposals and student applications: May 1, 2006: - Application period opens for student proposals May 8, 2006: -Student proposals due by 17:00 Pacific Daylight Time If you are interested in mentoring or doing a project please let us know as soon as possible. If you have project ideas, please update: http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl?Google_Summe… If you want to mentor or are planning a student application please either post to the list or to the moderators list (see http://www.boost.org/more/moderators.html for details). Thx! Jeff

2 1

I/O bug in date_time
by Thomas Lemaire 29 Apr '06

29 Apr '06

** sorry if double posting, but I have not received my first mail, and also no answers... ** Dear list, I encounter a bug while reading a time_duration object, here is a short test case, the results are obtained with boost 1.33.1, gcc4.0.3 using namespace boost::posix_time; time_duration td1(0,0,0); std::stringstream ss1("14:23:11.345678"); ss1 >> td1; std::cout << td1 << std::endl; // 14:23:11.345678 time_duration td2(0,0,0); std::stringstream ss2("18353:23:11.345678"); ss2 >> td2; std::cout << td2 << std::endl; // 18:53:23 time_duration td3(0,0,0); std::stringstream ss3("318353:23:11.345678"); ss3 >> td3; std::cout << td3 << std::endl; // 00:00:00 If I compile with the flag CPPFLAGS += -DUSE_DATE_TIME_PRE_1_33_FACET_IO this works well. I hope this will help to fix it... -- thomas http://www.laas.fr/~tlemaire

2 1

[BGL] Complexity time of algorithms
by Leandro Melo 29 Apr '06

29 Apr '06

Hi. According to the site, most boost graph algorithms guarantee complexity bounds. For instance, DFS and BFS have complexity time O(V + E), Bellman-Ford has complexity O(VE), etc... As fair as I'm concerned (and from the knowledge I have) the complexity time bounds exposed on the graph web pages (like the ones I described above) are usually the 'best' theoretical values for them that can be found in the literature. However, something is still 'dark' for me. Most of this algorithms achieve this time bounds when implemented in a very specialized manner. Boost graph library is NOT like this, since we know it's a very nice generic library. Boost uses Property Maps for a lot of algorithms. My question is whether or not this property maps affect the complexity bounds. For example: In the original implementation of Bellman-Ford (which achieves O(VE)) weights are attached to edges. In boost's implementation, they're in the form of property maps. Right there, there's a change from a constant time operation (edge->get_weight, for example) to a logarithmic time operation (weight_map[edge], for example). I must say that I didn't take carefull look at the algorithms implementations, but it just seems weird to me that the same complexity bounds can still be achieved with those property maps. Can anyone help understand that? Thanks. -- Leandro Terra C. Melo

2 1

regarding "boost::bad_expression"
by yogendra karki 29 Apr '06

29 Apr '06

hi all i am using boost regex to check the systax of my URLs. if i am giving a long URL then it is giving the following error:- terminate called after throwing an instance of 'boost::bad_expression' what(): Memory exhausted Aborted and the program is aboted. My code is this:- #include<iostream> #include <boost/regex/v4/regex.hpp> bool EvaluateRegex(const std::string regularexp,std::string url){ boost::smatch what; boost::regex exp(regularexp,boost::regex::extended); boost::regex_search(url,what,exp); std::string search=(std::string)what[0]; if(search.length() == url.length()) return true; else return false; } int main() { std::string url; const std::string URLSYNTAXREGEX = "((https?|ftp)://)?(((([a-zA-Z0-9]+-?)?[a-zA-Z0-9]+)+[.]{1}[a-zA-Z0-9]+)+([:]{1}((0[0-7]+)|(0[xX][0-9a-fA-F]+)|([0-9]+))){0,1})([?/][-a-zA-Z0-9+&@#/%?=~_|!:,.; ]*)?"; std::cout<<"enter the URL"<<std::endl; std::cin>>url; if(!EvaluateRegex(URLSYNTAXREGEX,url)) std::cout<<"Malformed URL"<<std::endl; else std::cout<<"Well formed URL"<<std::endl; return 0; } --------------------------------- Love cheap thrills? Enjoy PC-to-Phone calls to 30+ countries for just 2¢/min with Yahoo! Messenger with Voice.

2 1

[program_options] Abort trap by store
by Pascal Vizeli 29 Apr '06

29 Apr '06

Hi, I habe a problem with store(parse_config_file(...), ...); I don't know why... That isn't my first program with program_options but it is my first program with parse_command_line and parse_config_file in one. Here is my code. First I parse the command line, second I parse the config file. Is it a very simple script. With my debuger (gdb and ddd) I can see, that the problem is here: bpo::store(bpo::parse_config_file(conf_file, desc_file), vm); (at the "end" from script). vm is global definiert. The Namspace bpo ist boost::program_options I use the gcc 3.3.5 and I compile static with: /usr/local/lib/libboost_program_options-gcc-1_33_1.a My OS is OpenBSD What I make false? My script is at the end. Sorry for my bad english. I thanks for Help, Dear, Pascal Vizeli [cpp] bpo::variables_map vm_cmd; bpo::options_description desc_file("config file"), desc_cmd("command line"); // Make options descriptions desc_cmd.add_options() ("config,c", bpo::value<std::string>(), "The Config file") ("help,h", "produce help message") ; desc_file.add_options() ("port", bpo::value<int>()->default_value(6667), "IRC Server Port") ("server", bpo::value<char *>(), "IRC Server IP") ("nick", bpo::value<std::string>(), "Bot Nick") ("user", bpo::value<std::string>(), "username hostname servername :realname") ("nickserv", bpo::value<std::string>(), "Nickserv Identify string") ("oper-pw", bpo::value<std::string>(), "Oper Password") ("mode", bpo::value<std::string>(), "Mode for Bot") ("logchan", bpo::value<std::string>(), "A #Chan for logs") ("logchan_status", bpo::value<int>(), "Logchan On or Off") ("invite-chan", bpo::value<int>(), "Invite for logchan?") ("invite-command", bpo::value<std::string>(), "Invite Command") ("re-chan", bpo::value<int>(), "Refresh Channellist until SEC") ("logfile", bpo::value<std::string>(), "File for logs") ("chroot", bpo::value<char *>(), "Set the chroot dir (path)") ; // Parse CMD bpo::store(bpo::parse_command_line(argc, argv, desc_cmd), vm_cmd); bpo::notify(vm_cmd); if(vm_cmd.count("help")){ std::cout << desc_cmd << std::endl; std::cout << desc_file << std::endl; exit(0); } if(!vm_cmd.count("config")){ printo_err("Config file not found! Use --help for Infos"); exit(0); } // Open Config file std::ifstream conf_file(vm_cmd["config"].as<std::string>().c_str()); if(conf_file.is_open()){ // Parse Config file bpo::store(bpo::parse_config_file(conf_file, desc_file), vm); // Here is the false say my debuger bpo::notify(vm); }else{ printo_err("can't open the conf file!"); exit(0); } [/cpp]

1 0

Serialization of adjacency_list
by Anatoli Sakhnik 29 Apr '06

29 Apr '06

Hello! I slightely modified kevin-bacon2.cpp from examples of the BGL. Having tried to serialize the graph g back to the text and print it to stdout, I got a static assertion failure. Is serialization of the adjacency_list fully implemented indeed? Or is it a trouble with boost::serialization? -- Anatoli Sakhnik P.S.: diff kevin-bacon2.old.cpp kevin-bacon2.cpp 18a19 > #include <boost/archive/text_oarchive.hpp> 88a90,91 > archive::text_oarchive oa(std::cout); > oa << g;

3 4

Serialization difficulties
by Joseph Hosteny 29 Apr '06

29 Apr '06

Hi all, I'm a relative newbie at using the serialization libraries, so please go easy on me, but I'm having some troubles which I can't seem to work out. I have a class hierarchy that looks something like this: A -> B -> C -> D There is a corresponding header, and at least one source file, for each of the four classes. The base class, A, contains only methods, but is not a pure virtual class. Class B contains the first set of data members in the chain that must be serialized. Classes C and D contain some more methods and data. All stores/loads will be handled via pointers to instances of class D. Now, the header file for class B contains the following: #include <boost/archive/text_iarchive.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/serialization/access.hpp> #include <boost/serialization/base_object.hpp> Classes B, C and D define the following as public: friend class boost::serialization::access; template<class Archive> void serialize(Archive &ar, const unsigned int version); The serialize methods for classes C and D call the base class implementations of these methods via: ar & boost::serialization::base_object<base_class>(*this); Finally, the source files for classes B, C and D contain: #include <boost/serialization/export.hpp> BOOST_CLASS_EXPORT(class_name); It's not clear to me, though, that I should need the EXPORT macro since all loads/stores are done with the most derived class' pointers. However, when I run this code, I get an exception at oserialization.hpp line 394, which is of type archive_exception::unregistered type. I've looked through a lot of the documentation, but can't seem to find out what I'm doing wrong. I've also tried explicit calls to boost::serialization::void_cast_register<base_class, derived_class> (), but that didn't seem to work either. Since this is being retrofitted to a large design, I tried to distill what I was trying to do into a sample project with just empty classes with the same hierarchy and boot methods/macros. When I do this, everything seems to work fine. Does anyone have any suggestions on what I should look for that may be screwing things up for me? I can send the sample files I used, but since these work, I'm not sure if they will be of much help. Any pointers will be greatly appreciated! Thanks, Joe

2 1

[serialization] Empty save_override for tracking_type, object_id_type etc
by Denis Kuznetsov 29 Apr '06

29 Apr '06

Hi, I want to write my own archive class for reading/writing to some defined binary protocol. I'm deriving my archive class from the binary_oarchive_impl template and overriding save_override functions. As protocol is defined, I don't need any additional info(bytes). So I do smth like this: class fast_binary_oarchive : // don't derive from binary_oarchive !!! public binary_oarchive_impl<fast_binary_oarchive> { typedef fast_binary_oarchive derived_t; #ifndef BOOST_NO_MEMBER_TEMPLATE_FRIENDS public: #else friend class boost::archive::detail::interface_oarchive<derived_t>; friend class basic_binary_oarchive<derived_t>; friend class basic_binary_oprimitive<derived_t, std::ostream>; friend class boost::archive::save_access; #endif // add base class to the places considered when matching // save function to a specific set of arguments. Note, this didn't // work on my MSVC 7.0 system // using binary_oarchive_impl<derived_t>::load_override; // so we use the sure-fire method below. This failed to work as well template<class T> void save_override(T & t, BOOST_PFTO int){ binary_oarchive_impl<fast_binary_oarchive>::save_override(t, 0); // verify that this program is in fact working by making sure // that arrays are getting passed here BOOST_STATIC_ASSERT(! (boost::is_array<T>::value) ); } // all the functions have emtpy body void save_override(const class_id_optional_type &, int) {} void save_override(const version_type&, int) {} void save_override(const class_id_type&, int) {} void save_override(const class_id_reference_type&, int) {} void save_override(const object_id_type&, int) {} void save_override(const object_reference_type&, int) {} void save_override(const tracking_type&, int) {} void save_override(const class_name_type&, int) {} public: fast_binary_oarchive(std::ostream & os, unsigned flags = no_header | no_codecvt | no_xml_tag_checking | no_tracking) : binary_oarchive_impl<derived_t>(os, flags) {} }; Is this correct? What features of the serialization library will not I be able to use?

2 1

Re: [Boost-users] [WAVE] bug: generic lexing error
by Hartmut Kaiser 28 Apr '06

28 Apr '06

> Andreas Sæbjørnsen wrote: > > > I still experience the same problems as before with regards to this > > memory bug. I am not able to test this with the wave driver > though as > > it compiles with a lot of errors in a lot of header files with gcc > > 3.4.3 on linux, but it shows up in the lexed_tokens example. > > That's puzzling me. Why the Wave driver doesn't compile for you? > > Are you sure to really have the corrected version (I've > replaced all memcpy's in cpp_re.cpp with memmove's, which > should avoid the problem reported by valgrind)? Seems that the public CVS currently is a bit out of sync if compared to the 'real' CVS database. At least ViewCVS shows a state which is 5 weeks old. This would explain your compilation problems. And I don't know where you may get a current CVS version, sorry. Regards Hartmut > > Am I correct to believe that HEAD is the default CVS version for > > boost-cvs? I tested this on a default checkout from the boost-cvs. > > HEAD should be the default. > > Regards Hartmut >

2 3

Multi_array: A "proper" iterator over a N>1 Multi_array?
by Greg Link 28 Apr '06

28 Apr '06

I'm using multi_array types as containers for some things I'm working on, and the number of dimensions can get quite large - often over 7, sometimes as high as 11. I'd like to do things such as initialize these multi_arrays, access all elements within them, and other such 'reasonable' operations. Thing is, the only iterator interface to multi_array returns a reference to the nested containers. Thus, to iterate over all sub- elements, I'm forced to have 7-11 nested for-loops to iterate over the entire thing. Is there an existent means of simply iterating over the entire set of data in the multi_array? Has anyone implemented such a thing, or is such a thing something to be desired within boost::multi_array? It seems like such a iterator would be especially useful if also implemented/supported within subgroups, allowing the user to define sub-ranges of the multi_array, then iterate over each element therein, without having to worry about dimensionality, et cetera. Any thoughts, ideas, or pointers to how to easily (without tons of code) iterate over an 11-dimensioned object is appreciated. In conclusion then, I've got two problems. One is "How can I simplify my each-element access to a high-dimensional multi_array", and the second is "Should there be a direct-to-element iterator in multi_array, and does the documentation adequately address the issue of whether or not an iterator points to elements directly or to a sub- graph?" Thanks for your time and troubles, - Greg Link

3 5

[serialization] std::list compiler error
by Stephan Nies 28 Apr '06

28 Apr '06

Hello, I want to use boost/serialization combined with the MPI (Message Passing Interface) to add parallel computation to a traffic simulation i am working on. I want to serialize a STL container filled with custom Objects to send it to another process. If I don't set "boost::serialization::track_never" for every class i get a compiler error. The Example Code (without any MPI) below creates this error when compiled: g++ test3.cpp -I/usr/include -L/usr/lib -lboost_serialization -o test3 /usr/include/boost/archive/detail/oserializer.hpp: In function void boost::archive::save(Archive&, T&) [with Archive = boost::archive::text_oarchive, T = gps_packet]: /usr/include/boost/archive/basic_text_oarchive.hpp:78: instantiated from void boost::archive::basic_text_oarchive<Archive>::save_override(T&, int) [with T = gps_packet, Archive = boost::archive::text_oarchive] /usr/include/boost/archive/detail/interface_oarchive.hpp:78: instantiated from Archive& boost::archive::detail::interface_oarchive<Archive>::operator<<(T&) [with T = gps_packet, Archive = boost::archive::text_oarchive] test3.cpp:76: instantiated from here /usr/include/boost/archive/detail/oserializer.hpp:567: error: invalid application of sizeof to incomplete type boost::STATIC_ASSERTION_FAILURE<false> make: *** [test3] Error 1 Here is a short example that creates the above error based upon the example in the documentation: ---code start-------- #include <iostream> #include <sstream> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/serialization/list.hpp> #include <list> class gps_position { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & degrees; ar & minutes; ar & seconds; } int degrees; int minutes; float seconds; public: gps_position(){}; gps_position(int d, int m, float s) : degrees(d), minutes(m), seconds(s) {} void pretty_print() { std::cout << "deg:" << degrees ; std::cout << " min:" << minutes ; std::cout << " sec:" << seconds << std::endl; } }; typedef std::list<gps_position> list_gps_position; class gps_packet { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & gps_list; } public: gps_packet(){} list_gps_position gps_list; }; // only when I uncomment the following // boost::serialization::track_never // statements programm will compile //BOOST_CLASS_IMPLEMENTATION(gps_position,boost::serialization::object_serializable); //BOOST_CLASS_TRACKING(gps_position, boost::serialization::track_never); //BOOST_CLASS_IMPLEMENTATION(gps_packet,boost::serialization::object_serializable); //BOOST_CLASS_TRACKING(gps_packet, boost::serialization::track_never); int main() { // create come pseudo data gps_position g0(1, 2, 3.3); gps_position g1(11, 22, 33.33); gps_packet packet; packet.gps_list.push_back(g0); packet.gps_list.push_back(g1); // print before transfer std::cout << "Before:" << std::endl; packet.gps_list.front().pretty_print(); packet.gps_list.back().pretty_print(); // serialize to chars in order to use // the MPI::CHAR elementary datatype std::ostringstream ost; boost::archive::text_oarchive oa(ost); oa << packet; const char* chars = ost.str().data(); // assume some message passing // through MPI::CHAR to happen here std::cout << "Transfering:" << std::endl; std::cout << chars << std::endl; // reconstruction from chars for further // computation std::istringstream ist(chars); boost::archive::text_iarchive ia(ist); gps_packet packet_new; ia >> packet_new; // print transfer result std::cout << "After:" << std::endl; packet_new.gps_list.front().pretty_print(); packet_new.gps_list.back().pretty_print(); return 0; } ---code end-------- when i uncomment BOOST_CLASS_TRACKING(gps_position, boost::serialization::track_never); BOOST_CLASS_TRACKING(gps_packet, boost::serialization::track_never); i can compile and execute with this output: Before: deg:1 min:2 sec:3.3 deg:11 min:22 sec:33.33 Transfering: 22 serialization::archive 3 0 0 0 0 2 0 0 1 2 3.3 11 22 33.330002 After: deg:1 min:2 sec:3.3 deg:11 min:22 sec:33.33 Further Questions: 1. I would also like to use just list<gps_position> or the typedef, instead of the wrapper class gps_packet which i need to pass something to BOOST_CLASS_TRACKING(gps_packet, boost::serialization::track_never); 2. Is it a good Idea to use something like: BOOST_CLASS_IMPLEMENTATION(gps_position,boost::serialization::object_serializable); BOOST_CLASS_TRACKING(gps_position,boost::serialization::track_never); since I don't want to store but just pass the Information or are there any pitfalls? Thanks, Stephan Nies -- When you see this text i am using the webinterface of my mail provider and i apologize for any commercials they may attach below. Echte DSL-Flatrate dauerhaft für 0,- Euro*! "Feel free" mit GMX DSL! http://www.gmx.net/de/go/dsl

1 0

Visual C++ 8 - Example Crashes with Access Violation
by Brown Gabe 28 Apr '06

28 Apr '06

Hi Everyone, Hopefully this isn't some noob question, but here goes... I'm trying to run boost 1.3.1 in Visual C++ 8 VC8 and I keep getting an access violation at the termination of my thread. I've tried looking to see what the problem is but I can't seem to determine the problem. I'm using the plain example thread.cpp ====================[ EXAMPLE CODE ]======================= #include <boost/thread/thread.hpp> #include <boost/thread/xtime.hpp> #include <iostream> struct thread_alarm { thread_alarm(int secs) : m_secs(secs) { } void operator()() { boost::xtime xt; boost::xtime_get(&xt, boost::TIME_UTC); xt.sec += m_secs; boost::thread::sleep(xt); std::cout << "alarm sounded..." << std::endl; } int m_secs; }; int main(int argc, char* argv[]) { int secs = 5; std::cout << "setting alarm for 5 seconds..." << std::endl; thread_alarm alarm(secs); boost::thread thrd(alarm); thrd.join(); } ====================[ EXAMPLE CODE ]======================= I get the expected out from the application. Upon tracing my code, the exception only occurs when the worker thread exits. Exception occured in threadex.c on line 348. Unhandled exception at 0x7c9012b4 in test.exe: 0xC0000005: Access violation reading location 0xcccccccc. " __try { _endthreadex ( ( (unsigned (__CLR_OR_STD_CALL *)(void *))(((_ptiddata)ptd)->_initaddr) ) ( ((_ptiddata)ptd)->_initarg ) ) ;" Any thoughts on what might cause an error like this??? -- -Gabe

4 7

[boost::any] Newbie Question About Compiler Warning on HPUX with boost::any
by Richard Ward 28 Apr '06

28 Apr '06

Hello, I'm a new user to boost and have a question about a compiler warning I'm seeing. I'm currently using just the boost::any type and on HPUX v11.00 PA with aCC: HP ANSI C++ B3910B A.03.56 I'm seeing the following warning: Warning (anachronism) 823: "/Components/dev/Boost/v1.33.1/boost/type_traits/is_reference.hpp", line 38 # Redundant preprocessing concatenation operation results in two valid preprocessing tokens. Depending on this implementation defined behavior will result in non-portable code. BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_reference,T,false) ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Here's the compile line that generated the warning: aCC -AA -DACE_HAS_STANDARD_CPP_LIBRARY=1 -D_RWSTD_MULTI_THREAD -D_REENTRANT -U_INCLUDE__STDC_A1_SOURCE -DACE_HAS_THREADS -D_POSIX_C_SOURCE=199506L -DHPUX_VERS=1100 -DACE_LACKS_PRAGMA_ONCE +W302 +W930 +W849 -mt +DAportable +Z -D_LARGEFILE64_SOURCE=1 +O3 +Osize -DACE_NDEBUG -DACE_USE_RCSID=0 -DACE_HAS_EXCEPTIONS -D__ACE_INLINE__ -D__UNIX -c -o .objects/HP-UX.B.11.00_RISC_aCC.A.03.37/release//LicAgentSvc.o LicAgentSvc.cpp Because the boost::any header is included in one of my headers, I see this warning hundreds of times. While I could just suppress it I prefer to first try to figure out what the issue is. I dislike suppressing warnings I don't understand. Does anyone know what this warning means and/or have any suggestions for what to do about it? Thanks, Richard J. Ward Symantec Corp.

1 0

bjam, 64-bit builds, VC8
by Jarl Lindrud 28 Apr '06

28 Apr '06

Hi! I need to build the boost libraries, and eventually my own application, in 64 bi t mode on Windows, but unfortunately I haven't been able to find any information on how to do so. Does anyone here have any tips? Typically, for a 32 build of boost.thread, for instance, I would type "bjam --with-thread -sTOOLS=vc-8_0 stage", but I don't know what the invocation should be for a 64 bit build. I'm using Visual C++ 2005 (the full version, not "express"). Thanks! Jarl.

1 0

multi_index, best way to do insert_or_replace
by bert hubert 28 Apr '06

28 Apr '06

Hi, I misread (or didn't read) the boost::multi_index_container documentation and assumed 'insert' on a unique index would do 'replace', but of course it doesn't and shouldn't. So, I've made this change: - s_negcache.insert(ne); + + pair<negcache_t::iterator, bool> res=s_negcache.insert(ne); + if(!res.second) { + s_negcache.erase(res.first); + s_negcache.insert(ne); + } But I can't help feeling there is probably a better and prettier way. Do people have any suggestions? In this case, ne is a NegCacheEntry, defined as: struct NegCacheEntry { string d_name; QType d_qtype; string d_qname; uint32_t d_ttd; }; And the index: typedef multi_index_container < NegCacheEntry, indexed_by < ordered_unique< composite_key< NegCacheEntry, member<NegCacheEntry, string, &NegCacheEntry::d_name>, member<NegCacheEntry, QType, &NegCacheEntry::d_qtype> >, composite_key_compare<CIStringCompare, std::less<QType> > >, ordered_non_unique< member<NegCacheEntry, uint32_t, &NegCacheEntry::d_ttd> > > >negcache_t; Thanks! -- http://www.PowerDNS.com Open source, database driven DNS Software http://netherlabs.nl Open and Closed source services

2 2

problem with 1.33.1 dll's
by george 28 Apr '06

28 Apr '06

hello! today I switch to 1.33.1 an I get some problems with dynamic libs: until 1.33 I just link with the name of the library -lboost_date_time -l boost_thread now with 1.33.1 I cant, I get: /usr/lib/gcc/i586-suse-linux/4.0.2/../../../../i586-suse-linux/bin/ld: cannot find -lboost_date_time and etc.... autolinking doesn't work so I link with the whole name -lboost_date_time-gcc-mt-1_33_1 -lboost_date_time-gcc-1_33_1 and it get compiled but when I try to run it, it can't find the libs(.so) ./server: error while loading shared libraries: libboost_thread-gcc-mt-1_33_1.so.1.33.1: cannot open shared object file: No such file or directory ./client: error while loading shared libraries: libboost_date_time-gcc-1_33_1.so.1.33.1: cannot open shared object file: No such file or directory but there are those files in the folder..... should I run any utility to fix this? P.S. I build 1.33.1 with: ./configure --prefix=/usr/local make make install thansks for any help.

2 2

[multi_array] How to use non-default constructor?
by Seweryn Habdank-Wojewódzki 28 Apr '06

28 Apr '06

Hi! I would like to know if in multi_array there is a possibility to initialize multi_array using non-default constructor? When I am using std::vector there is a possibility to do it like that: std::vector<MyObject> my_object_vec ( 2, MyObject( parameters ) ); This vector constructor uses non-default constructor of MyObject. In C++ arrays constructon like that should be done in two steps first is to initialize array (uses default constructor) and then we could assign values to the array using copy constructor, but this is not nice, and in my cases not good solution. Important is that in MyObject class there shouldn't be default constructor, and better not to use copy constructor. Of course there exists non-default constructor like MyObject ( const Parameters & parameters ). Regards. -- |\/\/| Seweryn Habdank-Wojewódzki `\/\/

2 4

[MPL] Loooong vectors
by Jaakko Järvi 28 Apr '06

28 Apr '06

Howdy, Are type containers with hundreds of types (maybe even more) at all realistic regarding compilation resources? Is there a container type for such very large type containers already? Access to elements should be at least logarithmic. Vectors of vectors, or a tree structure built out of vectors, would probably do unless there is something better out there already. Best, Jaakko Järvi

1 0

Re: [Boost-users] [WAVE] bug: generic lexing error
by Hartmut Kaiser 28 Apr '06

28 Apr '06

Andreas Sæbjørnsen wrote: > I do not know why you were not able to reproduce the error as > I reproduced it on two different machines using two different > boost installations. Using the attached source-file you > should be able to reproduce the error. Both icc and g++ > compiles this file without error. > > If the behaviour in section 2.2.2 of the standard lead to > Wave being unable to preprocess some C++ source-files that > cpp and the EDG preprocessor will accept, what do you think > about creating a feature for optionally turning this behaviour off? I've induced a null byte into your sample and gcc complains about it as well. So my guess is, that something else goes wrong. But since I still have no luck in reproducing your original problem here on my Windows machine I'll have to try it on a linux box, but will have the possibility for that next week only. Regards Hartmut > > Regards > Andreas > > > > > On 4/21/06, Hartmut Kaiser < hartmut.kaiser(a)gmail.com > <mailto:hartmut.kaiser@gmail.com> > wrote: > > > Andreas Sæbjørnsen wrote: > > > Using the wave driver reference implementation on the > code found at: > > http://folk.uio.no/andsebjo/bugInducingCode.C > <http://folk.uio.no/andsebjo/bugInducingCode.C> > > I get the following error: > > bugInducingCode.C(10157): error: generic lexing error: > > '\000' in input stream This code compiles with g++ and if any > > line is cut within the file it does not fail with Wave. > > The code contains only C++ syntax so it is basically a test > > of the cpplexer. > > Is this a know problem? > > > > This problem occurs in both my two months old CVS version of > > boost and the 1.3.1 build. > > Hmmm. Sorry I'm not able to reproduce this problem > here. But the error you > get says your input stream contains a binary 0 (zero) > byte. And yes it's a > lexer diagnostic. > > The standard says ( 2.2.2 [lex.charset]): > > <quote> > If the hexadecimal value for a universal character name > is less than 0x20 or > in the range 0x7F0x9F (inclusive), or if the universal > character name > designates a character in the basic source character > set, then the program > is illformed. > </quote> > > So I'm pretty sure Wave is right to diagnose this. > > Could you send me the file as an attachment, please, > just to make sure I > really get it as you have it on your disk. > > Regards Hartmut > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > <mailto:Boost-users@lists.boost.org> > http://lists.boost.org/mailman/listinfo.cgi/boost-users > <http://lists.boost.org/mailman/listinfo.cgi/boost-users> > > > >

2 5

boost and python
by Jeff Mearing 27 Apr '06

27 Apr '06

Hi, I am currently running Linux (Fedora), with python2.4 . I am keen to use boost to enable me to use python and C++ code together. I have built the Boost package using Bjam. All seemed to go good there following the build instruction for the hello world example. I then built the hello world example fine using the : bjam -sTOOLS=gcc HelloTest now if i run up python on the command line, and type: >> import hello into the python shell it fails to find the hello module, i then tried moving the hello.so file into : /usr/lib/python2.4/lib-dynload the hello module is now found, however the 'libboost_python.so' cant be found, i guess because hello depends on this and it cannot be found. Which environment variable do i have to set to fix this link problem? Current environment variable settings: PYTHON_PATH=usr/lib PYTHON_ROOT=usr/lib PYTHON_VERSION=2.4 cheers Dave i hope you can help! jeff

4 3

auto_ptr, string serialization
by Olivier Destrebecq 27 Apr '06

27 Apr '06

I have a class that inherit from another, both implement serialization the derived class has this code: #ifndef _GENREMETADATA_H_ #define _GENREMETADATA_H_ #include "fetchableMetadataObject.h" #include <boost/serialization/split_member.hpp> #include <boost/serialization/string.hpp> class GenreMetadata : public FetchableMetadataObject { public: ..... private: std::string m_abbreviation; std::string m_displayName; std::string m_name; std::auto_ptr<std::vector<GenreMetadata> > m_childGenresMetadata; std::auto_ptr<std::vector<GenreMetadata> > m_parentGenresMetadata; std::auto_ptr<std::string> m_description; std::auto_ptr<GenreMetadata> m_primaryParentGenreMetadata; template<class Archive> void serialize(Archive & inArchive, const unsigned int version) { //serialize the base class // inArchive & BOOST_SERIALIZATION_BASE_OBJECT_NVP (FetchableMetadataObject); //then our own properties // inArchive & BOOST_SERIALIZATION_NVP(m_abbreviation); inArchive & BOOST_SERIALIZATION_NVP(m_displayName); inArchive & BOOST_SERIALIZATION_NVP(m_name); inArchive & BOOST_SERIALIZATION_NVP(m_childGenresMetadata); inArchive & BOOST_SERIALIZATION_NVP(m_parentGenresMetadata); inArchive & BOOST_SERIALIZATION_NVP(m_description); inArchive & BOOST_SERIALIZATION_NVP (m_primaryParentGenreMetadata); } }; #endif //_GENREMETADATA_H_ i included a version of auto_ptr serialization: #include <list> #include <memory> #include <fstream> #include <boost/config.hpp> // std::autoptr inteface wrong in dinkumware #include <boost/detail/workaround.hpp> #include <boost/archive/xml_iarchive.hpp> #include <boost/archive/xml_oarchive.hpp> #include <boost/detail/workaround.hpp> #include <boost/serialization/split_free.hpp> namespace boost { namespace serialization { ///////////////////////////////////////////////////////////// // implement serialization for auto_ptr<T> // note: this must be added to the boost namespace in order to // be called by the library template<class Archive, class T> inline void save( Archive & ar, const std::auto_ptr<T> &t, const unsigned int file_version ){ // only the raw pointer has to be saved // the ref count is rebuilt automatically on load T *objectPtr = t.get(); ar << BOOST_SERIALIZATION_NVP(objectPtr); } template<class Archive, class T> inline void load( Archive & ar, std::auto_ptr<T> &t, const unsigned int file_version ){ T *objectPtr; ar >> BOOST_SERIALIZATION_NVP(objectPtr); // note that the reset automagically maintains the reference count #if BOOST_WORKAROUND(BOOST_DINKUMWARE_STDLIB, == 1) t.release(); t = std::auto_ptr<T>(objectPtr); #else t.reset(objectPtr); #endif } // split non-intrusive serialization function member into separate // non intrusive save/load member functions template<class Archive, class T> inline void serialize( Archive & ar, std::auto_ptr<T> &t, const unsigned int file_version ){ split_free(ar, t, file_version); } } // namespace serialization } // namespace boost When i compile this code i get the following error: ../../common_rn/import/boost/debug/include/boost-1_33_1/boost/ serialization/access.hpp:109: error: 'struct std::basic_string<char, std::char_traits<char>, std::allocator<char> >' has no member named 'serialize' I looked at the serialization code for string and it treats it as a primitive type. Could my problem come from there. Notice how it complains about the string contained in the auto_ptr, but not the other strings. Also it does not complain about the array contain in the auto_ptr. Also if i split the serialization of my object an manually try to archive the string object, it complain about the serialization if i pass in a pointer to the string, but not if i pass the object itself any help appreciated Best, Olivier Destrebecq olivierd(a)real.com

1 0

Repost: [Serialization] Build Fails for --layout=System, 1.33.1, vc-8_0 toolset, Win XP
by Rush Manbert 27 Apr '06

27 Apr '06

Hi, This is a repost and is directed to Robert Ramey, since the serialization library is his baby and I assume he wrote the build configuration code for it. I got no reply the first time, and I really need to be able to build this way. I am having problems building Boost 1.33.1 under Windows XP for the vc-8_0 toolset. My problems seem to come from a bug in the build of the serialization library. The attached zip file contains information from 2 builds. One of them succeeds and the other fails. The difference between them is that the failed build includes "--layout=system" on the bjam command line, while the successful build does not. In both cases, the build is run by a script that makes sure the build location and the installation location are cleaned up before the build starts. In the zip file are the following files: * failedBoostBuild.log contains all of the output generated by bjam for the failed build. * failedConsoleTranscript.txt is the console output from the build script. It shows the bjam command line for the failed build. * failedInstalledLibList.txt is a "dir" listing of the library installation directory, after the failed build completed. * goodBoostBuild.log, goodConsoleTranscript.txt, and goodInstalledLibList.txt are the equivalents to the above for the successful build. I believe that there is an error shown in failedBoostBuild.log at line 3000. The line says: "LINK : fatal error LNK1104: cannot open file 'boost_serialization-vc80-mt-gd-1_33_1.lib'" and I believe that the error is that the library file name includes the toolset name and the Boost version number. Since I specified --layout=system, neither of these are included in the generated library names. There is a similar error at line 3058. If you compare the failedInstalledLibList.txt and goodInstalledLibList.txt, you can see that none of the boost_wserialization libraries are present in the failed case. I am guessing that they represent the four failed targets reported by bjam at the end of the build. I want to use the --layout=system naming conventions and do internal releases of the Boost libraries to our development environment. I have already done this successfully under Mac OSX, and I expected it to work the same way under Windows. If my conclusion that there is a build bug is correct, is there some workaround possible to make the build succeed? (I looked at the serialization jamfile and came away unenlightened. :-) Is there some other explanation? Thanks, Rush

2 2