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

[Test] strange test behavior
by Emre Guney 02 Aug '09

02 Aug '09

Greetings, I have the following class to test a class named Scoring (implements a graph using Boost Graph Library). If the line marked with //!!! below is uncommented the scores yielded by _s.getNetwork().getVertexScore(*it) are garbage values (like 2.57117366e+29 ). If it is commented test fails but the values are initial (sensible) values. When I run the same function apart from the tests, the function behaves correctly and gives correct calculated scores. There should be a context problem but I could not figure it out. I would be grateful for any suggestions and ideas. class TestScoring { Scoring _s; public: TestScoring() { _s = Scoring("test_vertices_small.txt", "test_edges_small.txt"); } ~TestScoring() { } void test_calculatedScores() { float vertex_scores[] = { 0.75, 4.0/3, 1.5, 1.0/3, 0.005 }; std::size_t n_vertex = sizeof(vertex_scores)/sizeof(float); //!!! this call changes the behavior of the test //!!! _s.run(1,2); VertexIterator it, itEnd; for(boost::tie(it, itEnd) = _s.getNetwork().getVertexIterator(); it != itEnd; it++) { BOOST_CHECK_CLOSE(_s.getNetwork().getVertexScore(*it), vertex_scores[_s.getNetwork().getVertexIndex(*it)], 0.00001f); } } }; // TestScoring is called from the following suite class TestSuiteScoring: public test_suite { public: TestSuiteScoring(): test_suite("test_suite_scoring") { shared_ptr<TestScoring> instance(new TestScoring()); test_case *calculatedScores = BOOST_CLASS_TEST_CASE( &TestScoring::test_calculatedScores, instance); add(calculatedScores); } ~TestScoring() { //instance.release(); } }; Emre

2 1

Remove elements from accumulator
by Archie14 02 Aug '09

02 Aug '09

I am trying to use accumulator to calculate statistics in "rolling window", traversing the data. I searched accumulators library for a method to remove first N elements from the accumulator and did not find one. Question: is is possible to remove first N values from the accumulator?

2 1

non-POD C++ objects and Boost.Interprocess
by Selçuk Cevher 02 Aug '09

02 Aug '09

Hi, Is it possible to pass user-defined "non-POD" C++ class objects to message queues and retrieve them back on the receiver side using Boost.Interprocess ? Thanks.

2 1

Valgrind's DRD tool produces false positives when used with Boost.Thread?
by Seth Fowler 01 Aug '09

01 Aug '09

Hi all, I've been trying to debug some data races in an application that uses Boost.Thread. I tried running valgrind's DRD tool against my binary to see if it could locate the source of the problem. It produced more errors than I expected, so I progressively removed portions of my application unless I was left with almost nothing. I found that even with the most minimal program I could produce, the DRD tool still reported errors - in fact, it even reported errors with the examples included with the Boost distribution! I was able to reproduce this behavior on Mac OS X 10.5.7 with Boost 1.39, and on Ubuntu 9.04 with Boost 1.37. Here are steps to reproduce the problem: 1. Build the sample program thread.cpp included in the Boost distribution in libs/thread/example. For Boost 1.39, I used the following command: g++ -L<Boost lib directory> -lboost_thread-xgcc40-mt-1_39 thread.cpp - o thread 2. Run it using valgrind's DRD tool: valgrind --tool=drd --var-info=yes ./thread On Mac OS X 10.5.7, I get the following output: ==20729== drd, a thread error detector. ==20729== Copyright (C) 2006-2009, and GNU GPL'd, by Bart Van Assche. ==20729== Using Valgrind-3.5.0.SVN and LibVEX; rerun with -h for copyright info ==20729== Command: ./thread ==20729== --20729-- ./thread: --20729-- dSYM directory is missing; consider using --auto-run- dsymutil=yes setting alarm for 5 seconds... ==20729== Conflicting load by thread 1 at 0x00012018 size 4 ==20729== at 0x58B1: void boost::call_once<void (*) ()>(boost::once_flag&, void (*)()) (in ./thread) ==20729== by 0x390C: boost::thread::join() (in ./thread) ==20729== by 0x9A13: main (in ./thread) ==20729== Allocation context: Data section of ./thread ==20729== Other segment start (thread 2) ==20729== at 0x396B3: pthread_mutex_lock (drd_pthread_intercepts.c: 580) ==20729== by 0x5993: void boost::call_once<void (*) ()>(boost::once_flag&, void (*)()) (in ./thread) ==20729== by 0x30CC: thread_proxy (in ./thread) ==20729== by 0x3707B: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==20729== by 0x228154: _pthread_start (in /usr/lib/libSystem.B.dylib) ==20729== by 0x228011: thread_start (in /usr/lib/libSystem.B.dylib) ==20729== Other segment end (thread 2) ==20729== at 0x39BC2: pthread_mutex_unlock (drd_pthread_intercepts.c:633) ==20729== by 0x30CC: thread_proxy (in ./thread) ==20729== by 0x3707B: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==20729== by 0x228154: _pthread_start (in /usr/lib/libSystem.B.dylib) ==20729== by 0x228011: thread_start (in /usr/lib/libSystem.B.dylib) ==20729== Other segment start (thread 2) ==20729== at 0x396B3: pthread_mutex_lock (drd_pthread_intercepts.c: 580) ==20729== by 0x58D2: void boost::call_once<void (*) ()>(boost::once_flag&, void (*)()) (in ./thread) ==20729== by 0x30CC: thread_proxy (in ./thread) ==20729== by 0x3707B: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==20729== by 0x228154: _pthread_start (in /usr/lib/libSystem.B.dylib) ==20729== by 0x228011: thread_start (in /usr/lib/libSystem.B.dylib) ==20729== Other segment end (thread 2) ==20729== at 0x39BC2: pthread_mutex_unlock (drd_pthread_intercepts.c:633) ==20729== by 0x5988: void boost::call_once<void (*) ()>(boost::once_flag&, void (*)()) (in ./thread) ==20729== by 0x30CC: thread_proxy (in ./thread) ==20729== by 0x3707B: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==20729== by 0x228154: _pthread_start (in /usr/lib/libSystem.B.dylib) ==20729== by 0x228011: thread_start (in /usr/lib/libSystem.B.dylib) ==20729== ==20729== Conflicting load by thread 1 at 0x00012014 size 4 ==20729== at 0x58B4: void boost::call_once<void (*) ()>(boost::once_flag&, void (*)()) (in ./thread) ==20729== by 0x390C: boost::thread::join() (in ./thread) ==20729== by 0x9A13: main (in ./thread) ==20729== Allocation context: Data section of ./thread ==20729== Other segment start (thread 2) ==20729== at 0x396B3: pthread_mutex_lock (drd_pthread_intercepts.c: 580) ==20729== by 0x5993: void boost::call_once<void (*) ()>(boost::once_flag&, void (*)()) (in ./thread) ==20729== by 0x30CC: thread_proxy (in ./thread) ==20729== by 0x3707B: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==20729== by 0x228154: _pthread_start (in /usr/lib/libSystem.B.dylib) ==20729== by 0x228011: thread_start (in /usr/lib/libSystem.B.dylib) ==20729== Other segment end (thread 2) ==20729== at 0x39BC2: pthread_mutex_unlock (drd_pthread_intercepts.c:633) ==20729== by 0x30CC: thread_proxy (in ./thread) ==20729== by 0x3707B: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==20729== by 0x228154: _pthread_start (in /usr/lib/libSystem.B.dylib) ==20729== by 0x228011: thread_start (in /usr/lib/libSystem.B.dylib) ==20729== Other segment start (thread 2) ==20729== at 0x396B3: pthread_mutex_lock (drd_pthread_intercepts.c: 580) ==20729== by 0x58D2: void boost::call_once<void (*) ()>(boost::once_flag&, void (*)()) (in ./thread) ==20729== by 0x30CC: thread_proxy (in ./thread) ==20729== by 0x3707B: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==20729== by 0x228154: _pthread_start (in /usr/lib/libSystem.B.dylib) ==20729== by 0x228011: thread_start (in /usr/lib/libSystem.B.dylib) ==20729== Other segment end (thread 2) ==20729== at 0x39BC2: pthread_mutex_unlock (drd_pthread_intercepts.c:633) ==20729== by 0x5988: void boost::call_once<void (*) ()>(boost::once_flag&, void (*)()) (in ./thread) ==20729== by 0x30CC: thread_proxy (in ./thread) ==20729== by 0x3707B: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==20729== by 0x228154: _pthread_start (in /usr/lib/libSystem.B.dylib) ==20729== by 0x228011: thread_start (in /usr/lib/libSystem.B.dylib) ==20729== ==20729== Conflicting load by thread 1 at 0x00013b5c size 4 ==20729== at 0x993A: boost::detail::get_once_per_thread_epoch() (in ./thread) ==20729== by 0x58BA: void boost::call_once<void (*) ()>(boost::once_flag&, void (*)()) (in ./thread) ==20729== by 0x390C: boost::thread::join() (in ./thread) ==20729== by 0x9A13: main (in ./thread) ==20729== Allocation context: Data section of ./thread ==20729== Other segment start (thread 2) ==20729== at 0x227FF0: thread_start (in /usr/lib/libSystem.B.dylib) ==20729== Other segment end (thread 2) ==20729== at 0x396B3: pthread_mutex_lock (drd_pthread_intercepts.c: 580) ==20729== by 0x58D2: void boost::call_once<void (*) ()>(boost::once_flag&, void (*)()) (in ./thread) ==20729== by 0x30CC: thread_proxy (in ./thread) ==20729== by 0x3707B: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==20729== by 0x228154: _pthread_start (in /usr/lib/libSystem.B.dylib) ==20729== by 0x228011: thread_start (in /usr/lib/libSystem.B.dylib) ==20729== ==20729== Conflicting load by thread 1 at 0x00013b5c size 4 ==20729== at 0x9972: boost::detail::get_once_per_thread_epoch() (in ./thread) ==20729== by 0x58BA: void boost::call_once<void (*) ()>(boost::once_flag&, void (*)()) (in ./thread) ==20729== by 0x390C: boost::thread::join() (in ./thread) ==20729== by 0x9A13: main (in ./thread) ==20729== Allocation context: Data section of ./thread ==20729== Other segment start (thread 2) ==20729== at 0x227FF0: thread_start (in /usr/lib/libSystem.B.dylib) ==20729== Other segment end (thread 2) ==20729== at 0x396B3: pthread_mutex_lock (drd_pthread_intercepts.c: 580) ==20729== by 0x58D2: void boost::call_once<void (*) ()>(boost::once_flag&, void (*)()) (in ./thread) ==20729== by 0x30CC: thread_proxy (in ./thread) ==20729== by 0x3707B: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==20729== by 0x228154: _pthread_start (in /usr/lib/libSystem.B.dylib) ==20729== by 0x228011: thread_start (in /usr/lib/libSystem.B.dylib) ==20729== ==20729== Conflicting load by thread 1 at 0x00397680 size 4 ==20729== at 0x20038D: pthread_setspecific (in /usr/lib/ libSystem.B.dylib) ==20729== by 0x997F: boost::detail::get_once_per_thread_epoch() (in ./thread) ==20729== by 0x58BA: void boost::call_once<void (*) ()>(boost::once_flag&, void (*)()) (in ./thread) ==20729== by 0x390C: boost::thread::join() (in ./thread) ==20729== by 0x9A13: main (in ./thread) ==20729== Allocation context: Data section of /usr/lib/libSystem.B.dylib ==20729== Other segment start (thread 2) ==20729== at 0x227FF0: thread_start (in /usr/lib/libSystem.B.dylib) ==20729== Other segment end (thread 2) ==20729== at 0x396B3: pthread_mutex_lock (drd_pthread_intercepts.c: 580) ==20729== by 0x58D2: void boost::call_once<void (*) ()>(boost::once_flag&, void (*)()) (in ./thread) ==20729== by 0x30CC: thread_proxy (in ./thread) ==20729== by 0x3707B: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==20729== by 0x228154: _pthread_start (in /usr/lib/libSystem.B.dylib) ==20729== by 0x228011: thread_start (in /usr/lib/libSystem.B.dylib) alarm sounded... ==20729== ==20729== ERROR SUMMARY: 5 errors from 5 contexts (suppressed: 725 from 8) The output on linux is similar. Does this indicate a problem with valgrind's DRD tool, Boost.Thread, or both? Does any workaround exist? Thanks in advance, - Seth Fowler

1 0

Boost.test applicability
by Joel Falcou 01 Aug '09

01 Aug '09

I have a alrge number of numeric functions (~300) overloaded on various types. What I want to do is having some automated test that check if those functions returns proper values and behave correctly in term of precision. I get a look at Boost.Test but i can't really see if it's applicable to my need and, if it is, how exactly am I supposed to generate that much test and cover all cases (random value testing, singular value test, nan/inf handling etc...). My first idea was to use Boost.preprcoessor file iteration to quickly generate BOOST_TEST_CASE functions but I'm not sure this is a scalable practice. Other point, I saw that there is check in Boost.test which check for an arbitrary precision result. However it uses raw value (like 0.001) where having a check based on ULP or RMS maybe better. Is there anyway to integrate those test using existing test framework ? Thanks in advance

3 4

copy_graph - accessing property maps
by Caligula 01 Aug '09

01 Aug '09

If you use copy_graph(g, g2) how can you access the corresponding property maps in g2? Thanks -Caligula

1 0

boost::lambda::bind temporary function objects.. and raw C
by Tomasz Mloduchowski 31 Jul '09

31 Jul '09

Hello everyone! I have a rather challenging question, that perhaps can be resolved without too much dark magic. A little background: I'm patching an executable (x86 platform, but could be easily extended to other architectures). players: void TargetFunc(some parameters); void Hook(some parameters); method: Grab first 5 bytes of TargetFunc. Back them up. Replace them with a jmp Hook. Make Hook finish as follows: Restore the backup of 5 bytes. Call TargetFunc again, this time the real one, not the jmp. Replace the 5 bytes with jmp Hook, getting ready for the next invocation. In a nutshell - typical trampoline. Now, I want to write a framework for this. I would prefer to be able to have some code reuse. Can either mem_fn or bind be helpful here? I'm trying to understand how they work. I feel like they are creating extra 'functions' with some game about parameters. Ideas? cheers, Tomasz

3 2

Multi Index Insertion with hashed index - non-primitive key
by Jason Leger 31 Jul '09

31 Jul '09

Hey Everyone, I am basically trying to create a sorted hash map using boost multiindex. I am following the examples but I am unable to insert my object into the container when I use a non-primitive key. Is it possible to use a non-primitive key? Any help or pointers would be appreciated. Thanks J.O. #include <inttypes.h> #include <boost/multi_index_container.hpp> #include <boost/multi_index/hashed_index.hpp> #include <boost/multi_index/ordered_index.hpp> #include <boost/multi_index/identity.hpp> #include <boost/multi_index/member.hpp> using namespace ::boost; using namespace ::boost::multi_index; #include <iostream> struct Key { uint32_t k1; uint32_t k2; Key(uint32_t k1, uint32_t k2) : k1(k1), k2(k2) {} bool operator==(const Key &key) const { if (k1 != key.k1) return false; if (k2 != key.k2) return false; return true; } }; struct KeyEqual { bool operator()(const Key &key1, Key &key2) const { return key1 == key2; } }; struct KeyHash { std::size_t operator()(const Key& key)const { return boost::hash<uint32_t>()(key.k1) + boost::hash<uint32_t>()(key.k2); } }; struct Data { Key key; int value; Data(const Key& key, int value): key(key), value(value) {} bool operator<(const Data& data)const { return (value < data.value); } }; typedef multi_index_container< Data, indexed_by< // sort by Data::operator< ordered_unique<identity<Data> >, // hashed on key hashed_unique<member<Data,Key,&Data::key> > > > DataSet; typedef DataSet::nth_index<1>::type HashIndex; int main() { DataSet dataSet; HashIndex &hashIndex = dataSet.get<1>(); Key newKey(1,2); Data newData(newKey,3); dataSet.insert(newData); // *** Error - See below *** // find an Data by key Data data=*(hashIndex.find(newKey,KeyHash(),KeyEqual())); }; This is the error I get: g++ -I../include -rdynamic -DCOREDUMP -DLINUX -pthread -pipe -Wall -W -g -DDEBUG -c mIndex.cc -o mIndex.o mIndex.cc: In member function ‘size_t boost::hash<T>::operator()(const T&) const [with T = Key]’: /usr/include/boost/multi_index/hashed_index.hpp:957: instantiated from ‘void boost::multi_index::detail::hashed_index<KeyFromValue, Hash, Pred, SuperMeta, TagList, Category>::unchecked_rehash(size_t) [with KeyFromValue = boost::multi_index::member<Data, Key, &Data::key>, Hash = boost::hash<Key>, Pred = std::equal_to<Key>, SuperMeta = boost::multi_index::detail::nth_layer<2, Data, boost::multi_index::indexed_by<boost::multi_index::ordered_unique<boost::multi_index::identity<Data>, mpl_::na, mpl_::na>, boost::multi_index::hashed_unique<boost::multi_index::member<Data, Key, &Data::key>, mpl_::na, mpl_::na, mpl_::na>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, std::allocator<Data> >, TagList = boost::mpl::vector0<mpl_::na>, Category = boost::multi_index::detail::hashed_unique_tag]’ /usr/include/boost/multi_index/hashed_index.hpp:942: instantiated from ‘void boost::multi_index::detail::hashed_index<KeyFromValue, Hash, Pred, SuperMeta, TagList, Category>::reserve(size_t) [with KeyFromValue = boost::multi_index::member<Data, Key, &Data::key>, Hash = boost::hash<Key>, Pred = std::equal_to<Key>, SuperMeta = boost::multi_index::detail::nth_layer<2, Data, boost::multi_index::indexed_by<boost::multi_index::ordered_unique<boost::multi_index::identity<Data>, mpl_::na, mpl_::na>, boost::multi_index::hashed_unique<boost::multi_index::member<Data, Key, &Data::key>, mpl_::na, mpl_::na, mpl_::na>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, std::allocator<Data> >, TagList = boost::mpl::vector0<mpl_::na>, Category = boost::multi_index::detail::hashed_unique_tag]’ /usr/include/boost/multi_index/hashed_index.hpp:629: instantiated from ‘boost::multi_index::detail::hashed_index_node<typename SuperMeta::type::node_type>* boost::multi_index::detail::hashed_index<KeyFromValue, Hash, Pred, SuperMeta, TagList, Category>::insert_(typename boost::call_traits<typename boost::multi_index::detail::hashed_index_node<typename SuperMeta::type::node_type>::value_type>::param_type, boost::multi_index::detail::hashed_index_node<typename SuperMeta::type::node_type>*) [with KeyFromValue = boost::multi_index::member<Data, Key, &Data::key>, Hash = boost::hash<Key>, Pred = std::equal_to<Key>, SuperMeta = boost::multi_index::detail::nth_layer<2, Data, boost::multi_index::indexed_by<boost::multi_index::ordered_unique<boost::multi_index::identity<Data>, mpl_::na, mpl_::na>, boost::multi_index::hashed_unique<boost::multi_index::member<Data, Key, &Data::key>, mpl_::na, mpl_::na, mpl_::na>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, std::allocator<Data> >, TagList = boost::mpl::vector0<mpl_::na>, Category = boost::multi_index::detail::hashed_unique_tag]’ /usr/include/boost/multi_index/ordered_index.hpp:556: instantiated from ‘boost::multi_index::detail::ordered_index_node<typename SuperMeta::type::node_type>* boost::multi_index::detail::ordered_index<KeyFromValue, Compare, SuperMeta, TagList, Category>::insert_(typename boost::call_traits<typename boost::multi_index::detail::ordered_index_node<typename SuperMeta::type::node_type>::value_type>::param_type, boost::multi_index::detail::ordered_index_node<typename SuperMeta::type::node_type>*) [with KeyFromValue = boost::multi_index::identity<Data>, Compare = std::less<Data>, SuperMeta = boost::multi_index::detail::nth_layer<1, Data, boost::multi_index::indexed_by<boost::multi_index::ordered_unique<boost::multi_index::identity<Data>, mpl_::na, mpl_::na>, boost::multi_index::hashed_unique<boost::multi_index::member<Data, Key, &Data::key>, mpl_::na, mpl_::na, mpl_::na>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, std::allocator<Data> >, TagList = boost::mpl::vector0<mpl_::na>, Category = boost::multi_index::detail::ordered_unique_tag]’ /usr/include/boost/multi_index_container.hpp:465: instantiated from ‘std::pair<typename boost::multi_index::detail::multi_index_base_type<Value, IndexSpecifierList, Allocator>::type::node_type*, bool> boost::multi_index::multi_index_container<Value, IndexSpecifierList, Allocator>::insert_(const Value&) [with Value = Data, IndexSpecifierList = boost::multi_index::indexed_by<boost::multi_index::ordered_unique<boost::multi_index::identity<Data>, mpl_::na, mpl_::na>, boost::multi_index::hashed_unique<boost::multi_index::member<Data, Key, &Data::key>, mpl_::na, mpl_::na, mpl_::na>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, Allocator = std::allocator<Data>]’ /usr/include/boost/multi_index/detail/index_base.hpp:148: instantiated from ‘std::pair<typename boost::multi_index::detail::multi_index_node_type<Value, IndexSpecifierList, Allocator>::type*, bool> boost::multi_index::detail::index_base<Value, IndexSpecifierList, Allocator>::final_insert_(typename boost::call_traits<Value>::param_type) [with Value = Data, IndexSpecifierList = boost::multi_index::indexed_by<boost::multi_index::ordered_unique<boost::multi_index::identity<Data>, mpl_::na, mpl_::na>, boost::multi_index::hashed_unique<boost::multi_index::member<Data, Key, &Data::key>, mpl_::na, mpl_::na, mpl_::na>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, Allocator = std::allocator<Data>]’ /usr/include/boost/multi_index/ordered_index.hpp:252: instantiated from ‘std::pair<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::ordered_index_node<typename SuperMeta::type::node_type>, mpl_::na>, bool> boost::multi_index::detail::ordered_index<KeyFromValue, Compare, SuperMeta, TagList, Category>::insert(typename boost::call_traits<typename boost::multi_index::detail::ordered_index_node<typename SuperMeta::type::node_type>::value_type>::param_type) [with KeyFromValue = boost::multi_index::identity<Data>, Compare = std::less<Data>, SuperMeta = boost::multi_index::detail::nth_layer<1, Data, boost::multi_index::indexed_by<boost::multi_index::ordered_unique<boost::multi_index::identity<Data>, mpl_::na, mpl_::na>, boost::multi_index::hashed_unique<boost::multi_index::member<Data, Key, &Data::key>, mpl_::na, mpl_::na, mpl_::na>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, std::allocator<Data> >, TagList = boost::mpl::vector0<mpl_::na>, Category = boost::multi_index::detail::ordered_unique_tag]’ mIndex.cc:94: instantiated from here mIndex.cc:79: error: ‘struct hash_value’ is not a function, /usr/include/boost/functional/hash/hash.hpp:290: error: conflict with ‘template<class K, class T, class C, class A> size_t boost::hash_value(const std::multimap<K, T, C, A>&)’ /usr/include/boost/functional/hash/hash.hpp:487: error: in call to ‘hash_value’ /usr/include/boost/functional/hash/hash.hpp:487: error: no matching function for call to ‘hash_value(const Key&)’ /usr/include/boost/functional/hash/hash.hpp:105: note: candidates are: size_t boost::hash_value(int) /usr/include/boost/functional/hash/hash.hpp:110: note: size_t boost::hash_value(unsigned int) /usr/include/boost/functional/hash/hash.hpp:115: note: size_t boost::hash_value(long int) /usr/include/boost/functional/hash/hash.hpp:120: note: size_t boost::hash_value(long unsigned int) /usr/include/boost/functional/hash/hash.hpp:229: note: size_t boost::hash_value(float) /usr/include/boost/functional/hash/hash.hpp:234: note: size_t boost::hash_value(double) /usr/include/boost/functional/hash/hash.hpp:239: note: size_t boost::hash_value(long double) make: *** [mIndex.o] Error 1

2 1

Re: [Boost-users] Boost.Date_time and leap seconds
by Steve Allen 31 Jul '09

31 Jul '09

On Jul 30, 8:04 am, Andrzej Krzemienski <akrze...(a)gmail.com> wrote: > - The rationale at the end says that leap seconds would be difficult > to implement. > - My experiments with simple ptime subtraction suggest no leap second support. > > I am really confused. The confusion cannot go away for retrospective calculations with UTC. See the javascript program and text on this web page http://www.ucolick.org/~sla/leapsecs/epochtime.html The scenario in that example helps to explain why it is that the international committees have been unable to produce a consensus on changes to UTC. The delegates are constrained by the legal history of the nations they represent. -- Steve Allen <sla(a)ucolick.org> WGS-84 (GPS) UCO/Lick Observatory Natural Sciences II, Room 165 Lat +36.99855 University of California Voice: +1 831 459 3046 Lng -122.06015 Santa Cruz, CA 95064 http://www.ucolick.org/~sla/ Hgt +250 m

1 0

[Graph] Problem with the add_edge() function
by Willard Mapurisa 31 Jul '09

31 Jul '09

Hi All I am having problem with the add_edge function. I have a graph that has more than 3 million edges from a triangulation. When I try to fill the graph with these edges the program terminates. I have filled the graph with approximately 1 500 000 successfully but it will not take in more. Sample code is below //Code typedef adjacency_list < listS, vecS, undirectedS, VertexProperty, EdgeProperty > sGraph m_graph; m_graph = sGraph(m_scan.size()); // scan size is 2 500 000 pair<graph_traits<sGraph>::edge_descriptor, bool> e; typedef graph_traits < sGraph >::vertex_descriptor Vertex u, v; //Filling the graph FORALLfacets { if(!facet->upperdelaunay) { qh_makeridges(facet); FOREACHridge_(facet->ridges) { if(!ridge->seen) { int i = 0; v_id.clear(); FOREACHvertex_(ridge->vertices) { v_id.push_back(qh_pointid (vertex->point)); i++; } //add edges to the graph u = v_id[0]; v = v_id[1]; e = add_edge(u, v , m_graph);//terminates after filling the graph with approximately 2 000 000 edges ridge->seen = 1; float d = m_scan[u].distance3D(m_scan[v]); //put(edge_length_t(), m_graph, e.first, d); } } } } I have recently started using Boost Graph Libraries and would like yo know if I am doing something wrong. Thanks WTM -- -------------------------------------------- Willard Mapurisa, ComputaMaps Private Bag X20, Constantia 7848, South Africa tel: +27.21.700 8140, fax: +27.21.701 9520, cell: +27.79.8045714 e-mail: wmapurisa(a)computamaps.com Manufacturers of digital maps and imagery http://www.computamaps.com --------------------------------------------

2 1

Serialization with pointer to const object
by Soumen 31 Jul '09

31 Jul '09

Hi, I'm using gcc 4.2.2 and boost 1.35. If I try to serialize pointer to some const objects, I'm getting compilation problem. Is there any limitation? Or I need to do certain things differently? I couldn't figured any solution over net. If there already exist any topic which points to solution, please point me to that. Otherwise, guide me to resolve the problem at hand. I'm new to boost. Say, my data member in the class myClass is const myType *ptr; In the serialize() routine, I'm doing it in following way: template< class Archive > void myClass::serialize(Archive &ar, const unsigned int version) { ar & ptr; // I've tried "ar & const_cast< myType* >(ptr)" and // "ar & (myType *) ptr" as well - it didn't work /* serialize other members */ } Regards, - Soumen -- View this message in context: http://www.nabble.com/Serialization-with-pointer-to-const-object-tp24639258… Sent from the Boost - Users mailing list archive at Nabble.com.

4 13

Boost Serialization: undefined reference to `__assert'
by Kesseli Pascal 31 Jul '09

31 Jul '09

Hello everyone Today, I just happened to download the latest version of cygwin, including gcc 3.4.4. While a simple hello world works perfectly fine, trying to compile this code using a statically linked libserialization.a results in dozens of linker errors, all stating "undefined reference to `__assert'". #include <boost/assign/list_of.hpp> #include <boost/archive/xml_iarchive.hpp> #include <boost/archive/xml_oarchive.hpp> #include <boost/lambda/lambda.hpp> #include <boost/serialization/vector.hpp> #include <iostream> #include <fstream> using namespace boost::lambda; using namespace boost::assign; using namespace boost::archive; using namespace boost::serialization; using namespace std; int main() { { vector<string> v = list_of("123")("Boost")("Serialization"); ofstream ofs("test.xml"); xml_oarchive oxml(ofs); oxml << make_nvp("VectorTest", v); } { vector<string> v; ifstream ifs("test.xml"); xml_iarchive ixml(ifs); ixml >> make_nvp("VectorTest", v); for_each(v.begin(), v.end(), cout << _1 << "\n"); } return 0; } Is this a problem or known issue when using cygwin? I'm using eclipse in addition, by the way. The code works perfectly fine on other platforms, so I imagine it must be a problem when using the serialization library with cygwin. Thanks in advance for any help you can offer me here and best regards Pascal Kesseli

4 3

BGL and threaded graph modification
by Sebastian Weber 31 Jul '09

31 Jul '09

Hi! I am wondering if it is possible to modify a single graph object by multiple threads which attach edges into seperated regions of the graph? To be exact: I have a set of vertices in my graph with index 0-maxIndex which I want to copy a couple of times into that same graph structure one after another. Of course, I assure that there are no resize events during copying and no overlapping. This should be possible, I think, at least in theory, but I found no word about that in the docs of the BGL. So, should it work or not? Thanks, Sebastian

2 4

left shift count >= width of type
by Maróy Ákos 31 Jul '09

31 Jul '09

Hi, In boost-1_39/boost/date_time/filetime_functions.hpp at line 101 I always get the following warning when using gcc 3 with mingw: boost-1_39/boost/date_time/filetime_functions.hpp:101: warning: left shift count >= width of type can this be averted somehow? interestingly, if I add the above code in a simple function, no warning occurs. but, if I add the above code into a function template (as it is in the boost include file), I do get the warning. so something like: template< typename T > void foo() { /* shift is difference between 1970-Jan-01 & 1601-Jan-01 * in 100-nanosecond intervals */ const uint64_t c1 = 27111902UL; const uint64_t c2 = 3577643008UL; // issues warning without 'UL' const uint64_t shift = (c1 << 32) + c2; } will result in a warning, without the template, it does not. Akos

1 0

[Date_Time] representing simulation time
by Pedro Martinez 31 Jul '09

31 Jul '09

I am working on a project where we are considering the use of Boost.Date_Time. We are already using other Boost libraries --so many thanks for Boost.Spirit! One of our requirements is to be able to run simulations, and so we need a clock that can be stopped/started/accelerated. Is there a mechanism for this in Boost.Date_Time? >From the documentation, I can't find one. >From the source code, it seems we could use boost::date_time::*_clock classes to derive our own classes that could provide simulation time. Is this the way the library is meant to be used? thank you for your time, Pedro unclassified ------------------------------------------------------------------------------------------------------------ Disclaimer: If you are not the intended recipient of this email, please notify the sender and delete it. Any unauthorized copying, disclosure or distribution of this email or its attachment(s) is forbidden. Thales Nederland BV will not accept liability for any damage caused by this email or its attachment(s). Thales Nederland BV is seated in Hengelo and is registered at the Chamber of Commerce under number 06061578. ------------------------------------------------------------------------------------------------------------

2 1

zerobugs
by Caligula 31 Jul '09

31 Jul '09

Hi, In the zerobugs debugger, how Can I set a home directory so that I don't have to go through a long path every time I load a program? Setting the "HOME" variable does not seem to work. Also How can I run a program in zerobugs that I normally run on command line as: $ abc < in.xml > out.xml ? Thanks Caligula

3 2

[python] ImportError undefined symbol
by Brian Budge 30 Jul '09

30 Jul '09

Hi all - I'm not much of a python guru, in fact our resident guru is out on maternity :) I'm hoping someone might tell me what is going on and how to get around it. We're using boost python, and have created a plugin = libMyPlugin. libMyPlugin links to libuuid and to libOtherLib. Our python test script is pretty simple and looks like this: import libMyPlugin from libMyPlugin import DoStuff but I get an error like this: ImportError: libOtherLib.so: undefined symbol: uuid_generate libOtherLib uses the symbol uuid_generate, but ldd reveals that it does NOT link against libuuid. ldd shows that libMyPlugin links against libuuid and libOtherLib. Can anyone explain (a) why this is happening and (b) how to fix it? Thanks, Brian

3 3

Junctions on NTFS
by Thomas Voigt 30 Jul '09

30 Jul '09

Hi, we started using junctions to some degree, and it is rather unfortunate that boost doesn't support junctions (boost::filesystem_is_symlink will always return false on NTFS filesystems). We are using 1.38. https://svn.boost.org/trac/boost/ticket/1681 has a patch, is there a specific reason why this patch didn't make it to stable version? tv

2 1

Boost.Date_time and leap seconds
by Andrzej Krzemienski 30 Jul '09

30 Jul '09

Hi, Does Boost.Date_Time support leap seconds? The documentation does not say it clearly enough, and it implies both answers: + The Motivation section says that we should prefer Boost.DateTime to other time libraries, because other libraries don't support leap seconds. + The documentation and function names often mention "UTC" or "universal", which by definition supports leap seconds. - The name "Posix Time" implies no support for leap seconds. At least this is what Wikipaedia says. - The rationale at the end says that leap seconds would be difficult to implement. - My experiments with simple ptime subtraction suggest no leap second support. I am really confused. Regards, &rzej

1 0

Error compiling adjacency_matrix.
by Gerard Guerrero 30 Jul '09

30 Jul '09

Hello everyone, I'm learning how to use adjacency_matrix to create dense graphs for my image processing PFC, and I've spent a couple of days stuck with the following compilation error. **** Build of configuration Debug for project BGL_proves **** make all Building file: ../src/BGL_proves.cpp Invoking: GCC C++ Compiler g++ -O0 -g3 -Wall -c -fmessage-length=0 -MMD -MP -MF"src/BGL_proves.d" -MT"src/BGL_proves.d" -o"src/BGL_proves.o" "../src/BGL_proves.cpp" In file included from /usr/include/c++/4.3/ext/hash_set:64, from /usr/local/include/boost/graph/adjacency_list.hpp:22, from ../src/BGL_proves.cpp:12: /usr/include/c++/4.3/backward/backward_warning.h:33:2: warning: #warning This file includes at least one deprecated or antiquated header which may be removed without further notice at a future date. Please use a non-deprecated interface with equivalent functionality instead. For a listing of replacement headers and interfaces, consult the file backward_warning.h. To disable this warning use -Wno-deprecated. ../src/BGL_proves.cpp: In function ‘int main()’: ../src/BGL_proves.cpp:54: error: no matching function for call to ‘boost::adjacency_matrix<boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, float, boost::no_property>, boost::no_property, std::allocator<bool> >::adjacency_matrix(main()::Edge [21], main()::Edge*, int&, double [21])’ /usr/local/include/boost/graph/adjacency_matrix.hpp:599: note: candidates are: boost::adjacency_matrix<Directed, VertexProperty, EdgeProperty, GraphProperty, Allocator>::adjacency_matrix(typename std::vector<typename boost::mpl::if_<typename boost::has_property<typename boost::detail::retag_property_list<boost::edge_bundle_t, EdgeProperty>::type>::type, std::pair<bool, typename boost::detail::retag_property_list<boost::edge_bundle_t, EdgeProperty>::type>, char>::type, typename Allocator::rebind<typename boost::mpl::if_<typename boost::has_property<typename boost::detail::retag_property_list<boost::edge_bundle_t, EdgeProperty>::type>::type, std::pair<bool, typename boost::detail::retag_property_list<boost::edge_bundle_t, EdgeProperty>::type>, char>::type>::other>::size_type) [with Directed = boost::undirectedS, VertexProperty = boost::no_property, EdgeProperty = boost::property<boost::edge_weight_t, float, boost::no_property>, GraphProperty = boost::no_property, Allocator = std::allocator<bool>] /usr/local/include/boost/graph/adjacency_matrix.hpp:472: note: boost::adjacency_matrix<boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, float, boost::no_property>, boost::no_property, std::allocator<bool> >::adjacency_matrix(const boost::adjacency_matrix<boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, float, boost::no_property>, boost::no_property, std::allocator<bool> >&) ../src/BGL_proves.cpp:23: warning: unused variable ‘noms’ make: *** [src/BGL_proves.o] Error 1 The code that leaves this error is the following: #include <iostream> #include <boost/config.hpp> #include <boost/graph/adjacency_matrix.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/graph_utility.hpp> #include <boost/graph/graph_traits.hpp> using namespace std; using namespace boost; int main() { //Crear vertexs i enllaços amb estructures fàcils d'utilitzar. enum imatges_e {A,B,C,D,E,F,G,N}; const char* noms = "ABCDEFG"; typedef std::pair<int, int> Edge; //Entrem enllaços. Edge edge_array[] = { Edge(A,B), Edge(A,C), Edge(A,D), Edge(A,E), Edge(A,F), Edge(A,G), Edge(B,C), Edge(B,D), Edge(B,E), Edge(B,F), Edge(B,G), Edge(C,D), Edge(C,E), Edge(C,F), Edge(C,G), Edge(D,E), Edge(D,F), Edge(D,G), Edge(E,F), Edge(E,G), Edge(F,G) }; //Entrem pesos dels enllaços. double weights[] = { 3.87317, 16.6444, 16.6504, 16.5974, 16.556, 16.542, 16.5325, 16.5393, 16.4867, 16.4469, 16.4323, 2.44883, 3.34502, 3.82632, 4.12945, 2.73509, 3.46093, 3.75471, 2.65915, 2.99527, 2.31493 }; int num_edges = sizeof(edge_array) / sizeof(Edge); typedef adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, float> > ALUGraph; ALUGraph ug (edge_array, edge_array+num_edges, weights, num_edges); typedef adjacency_matrix< undirectedS, no_property, property<edge_weight_t, float> > AMUGraph; AMUGraph ug2 (edge_array, edge_array + num_edges, num_edges, weights); Here I'm trying to create two versions of the graph. If I comment the construction of ug2 everything works fine, but if I leave it uncommented, the former error is generated. I've been googling for help but I've found nothing that could help me. Any help will be welcome!! Thanks in advance.

1 0

mpl eval_if and has_member_data use
by Hicham Mouline 30 Jul '09

30 Jul '09

Hello, I have BOOST_HAS_STATIC_MEMBER_DATA(size_t, maxsize) // from introspection in sandbox template <typename T> class C { static const size_t s = boost::mpl::eval_if< boost::introspection::has_static_member_data_maxsize<T>, boost::mpl::size_t<T::maxsize>, boost::mpl::size_t<0> >::value; }; if T has maxsize size_t member, then s should get maxsize and if it doesn't, s should be 0. I get a compile error for cases where T doesn't have maxsize, because I still refer to it. e.g. of T struct Texample { ... static const size_t maxsize = 5; }; Regards,

2 1

[Interprocess] Mapped file destructor
by Thomas d'Erceville 30 Jul '09

30 Jul '09

Hello, In my code I open a mapped file (previously created) and I construct an object inside, this object is valid and I can use it. But after the mapped_file has been destroyed my object is not valid anymore. It happens just after the call to the destructor of the mapped file. How can I tell to the Mapped File to do not flush its content when it is destructed? Best regards. Thomas

2 2

boost::interprocess:basic_string : Capacity no more than 10
by samuel.gallard 30 Jul '09

30 Jul '09

Hello, I first present to you my code and I will explain my problem with the code . ShmString.h : namespace ip=boost::interprocess; typedef ip::allocator<char, ip::managed_shared_memory::segment_manager> CharAllocator; class ShmString : public ip::basic_string<char, std::char_traits<char>, CharAllocator > { public: ShmString (); virtual ~ShmString (); /** * The segment to build the string */ static ip::managed_shared_memory* st_segment; } This class served to have some string in memory. The following Element.h used it : class Element { public: Element (const std::string dir, const std::string type, ip::managed_shared_memory * segment); private: ShmString dir; ShmString file; ShmString type; ip::managed_shared_memory * segment; }; I have four attributes that declare it. When I tried to define all the attributes in the constructor like this in Element.cpp : Element::Element (const string dir, const string file, const string type, ip::managed_shared_memory *segment){ try{ this->dir.assign(dir.c_str()); this->file.assign(file.c_str()); } catch(ip::interprocess_exception &e){ ostringstream oss; const std::string what(e.what()); oss << "Class Element in constructor 1 -> "; oss << what; throw EventException(oss.str().c_str(), __LINE__ ); } } If for example "const string dir " has the size more than 10 (the capacity by default for a ShmString object), I obtained an error like this : x0807436f in boost::interprocess::basic_string<char, std::char_traits<char>, boost::interprocess::allocator<char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0u>, boost::interprocess::iset_index> > >::assign (this=0xb7428274, s=0xb9adf154 <Address 0xb9adf154 out of bounds>) I tried to used the other constructors by default for basic_string but it remains the same. This code only works when in the constructors the string size are below 10. Could you someone explain me why I obtain this? Do I have some faulty code? Could you provide some examples on how store string with interprocess::basic_string in shared memory for a size for more than 10 characters? I will be very grateful because I am lost... Thanks you in advance Regards Samuel -- View this message in context: http://www.nabble.com/boost%3A%3Ainterprocess%3Abasic_string-%3A-Capacity-n… Sent from the Boost - Users mailing list archive at Nabble.com.

2 2

[format] Alternative syntax
by Emre Turkay 30 Jul '09

30 Jul '09

Hi folks, Any interest in the alternative syntax for boost::format? format2 f("Hello %s, %s"); std::cout << f("Joe", "Jane") << std::endl << f("Jose", "Mary") << std::endl; Which creates the output; Hello Joe, Jane Hello Jose, Mary Code is available at http://bit.ly/2J60Re for any suggessions. Take care, emre

3 4

Fwd: Boost 1.38.0 Interprocess - Question on remove
by Federico Golfrè Andreasi 30 Jul '09

30 Jul '09

Hi! I'm using the Boost 1.38.0 Interprocess Library and shared memory object. My code eliminates with a remove a shared memory object associated with a label, the returned value is true so the operation is done correctly; just after that I create a shared memory with the same label and the program throws an error saying "File exists", just as I didn't remove it with the previous instruction. I've seen that the made a bug fix in boost 1.39.0 Interprocess Library on the remove; that fixing reagard this problem or is something different? Do you have an idea of what can be the problem? Thank you, Federico

2 4