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

Re: [Boost-users] [interprocess]files locations for mutex and named shm
by Mike Spertus 07 Aug '09

07 Aug '09

I'm being bitten by the surprise discovery that different Windows users can't(?) communicate via named shared memory using Boost Interprocess as in the post below from 2008-09-18 (Changing all processes to use the same TMP directory is not an option for us due to interoperability requirements). Is there a workaround? Was anything ever done about the proposed solution below? Another alternative would be to make it possible to specify the "Boost Interprocess temp directory". Mike Eugen Stoianovici wrote: > > Ion Gaztañaga wrote: > > Eugen Stoianovici wrote: > >> Ion Gaztañaga wrote: > >>> You can't, unless you modify the code in: > >>> > >>> boost/interprocess/detail/temp_dir_helper.hpp > >>> > >>> Why do you want to change the location of those files? > >>> > >>> Ion > >> This is only a problem if you run processes with different users. Ex: > >> if you're using shared memory between an user app and a service, the > >> service will look for the segment in C:\Windows\Temp\ and the user > >> app will look for it in C:\Documents and settings\user\local > >> settings\etc. > >> My changes should go in the temp_dir_helpers.hpp file, right? > > > > Good point. I'll try to see if I can unify this when I have a bit of > > time. Maybe we can find a common directory for all processes. Any hint > > or suggestion? > > > On XP C:\Windows\Temp would be a good idea but i don't know if it is > writable by all users. I'm going to look into it when i get the chance, > but for now, changing the "TMP" env to something else is enough for me. > > Thanks again, > Eugen Stoianovici

2 1

[mpi] irecv / send problem
by Nick Collier 06 Aug '09

06 Aug '09

I running into an issue where an irecv followed by a send results in deadlock. A simple test case, class Item { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive& ar, const unsigned int version) { ar & val; } public: int val; Item() : val(1) { } }; struct Receipt { boost::mpi::request request; std::vector<Item> items; }; int main(int argc, char **argv) { mpi::environment env(argc, argv); mpi::communicator world; Receipt receipt; vector<Item> msg(100000); int other = world.rank() == 0 ? 1 : 0; cout << world.rank() << " irecv from " << other << endl; receipt.request = world.irecv(other, 0, receipt.items); cout << world.rank() << " sending to " << other << endl; world.send(other, 0, msg); receipt.request.wait(); cout << "Done" << endl; } Run with mpirun -np 2, this never completes. It does complete with vector<Item> msg(10) however. Nick

5 7

Re: [Boost-users] boost 1.40 beta
by Guiliani, Florent 03 Aug '09

03 Aug '09

boost-users-request(a)lists.boost.org wrote: > Date: Wed, 29 Jul 2009 14:27:39 +0100 > From: Avi Bahra <avibahra(a)googlemail.com> > Subject: [Boost-users] boost 1.40 beta > To: boost-users(a)lists.boost.org > > Does any know the schedule for release of boost 1.40 beta ? > > Best regards, > Ta, > Avi > According to: http://www.boost.org/development/ it will be the first of August. -- Florent,

3 2

[Serialization: Newbie] Compilation Problem Text Archive
by Soumen 03 Aug '09

03 Aug '09

Hi, I'm facing some compilation problem when I use text archive. But the same code works fine when I use binary archive. And it does write something on disk with specified file name (I'm yet to finish the restore part. Otherwise, I could've said it works). Do I need to do something differently? The error I get is something like following: ------------------------------------------------------------------------------------------ /boost/1_35_0/include/boost/archive/detail/oserializer.hpp: In function ‘void boost::archive::save(Archive&, T&) [with Archive = boost::archive::text_oarchive, T = TableMgr*]’: /boost/1_35_0/include/boost/archive/detail/common_oarchive.hpp:64: instantiated from ‘void boost::archive::detail::common_oarchive<Archive>::save_override(T&, int) [with T = TableMgr*, Archive = boost::archive::text_oarchive]’ /boost/1_35_0/include/boost/archive/basic_text_oarchive.hpp:75: instantiated from ‘void boost::archive::basic_text_oarchive<Archive>::save_override(T&, int) [with T = TableMgr*, Archive = boost::archive::text_oarchive]’ /boost/1_35_0/include/boost/archive/detail/interface_oarchive.hpp:64: instantiated from ‘Archive& boost::archive::detail::interface_oarchive<Archive>::operator<<(T&) [with T = TableMgr*, Archive = boost::archive::text_oarchive]’ /remote/gsoumen/hiers/trunk/code/cmds/Cmds.cpp:1518: instantiated from here /boost/1_35_0/include/boost/archive/detail/oserializer.hpp:564: error: invalid application of ‘sizeof’ to incomplete type ‘boost::STATIC_ASSERTION_FAILURE<false>’ cc1plus: warnings being treated as errors ------------------------------------------------------------------------------------------ My code is something like following: #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> //I use binary archive hpp when I use binary archive mode #include <boost/serialization/serialization.hpp> #include <boost/serialization/utility.hpp> std::ofstream ofs(fileName.c_str(), ios_base::out); // with bin archive I also use ios_base::binary boost::archive::text_oarchive oarchive(ofs); //for bin archive, oarchive is of binary_oarchive type TableMgr *tblMgr = TableMgr::instance(); if (tblMgr) { oarchive << tblMgr; } //I've TableMgr::serialize() defined ... Regards, ~ Soumen -- View this message in context: http://www.nabble.com/-Serialization%3A-Newbie--Compilation-Problem-Text-Ar… Sent from the Boost - Users mailing list archive at Nabble.com.

2 6

[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

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

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