- Boost-users - lists.boost.org

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