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

[serializtion] Problem with multiple archives and Intel compiler
by Bill Lear 27 Jun '06

27 Jun '06

I am having great difficulty in architecting my boost serialization solution with the Intel compiler. The problem is this: I need to support text, xml, and binary archive formats. I allow the user to select which format to save in, by default using the portable text format. If the user wants greater speed, they can choose binary, or if they want to visually inspect the data, they can choose xml. On load, I dynamically detect which archive is used and call the appropriate load routine (text, xml, binary). However, if I include all three archives in the same compilation unit, the default (text) serialization is slowed down dramatically, with the runtimes increasing approximately 50% (from 200 to 300 seconds, and this on a fast 64-bit Opteron box). I tried breaking things apart, putting my archive includes and BOOST_CLASS_EXPORT calls into separate compilation units. I have the following code structure: class AbstractBase { virtual void method() = 0; }; BOOST_IS_ABSTRACT(AbstractBase) class Derived: public AbstractBase { virtual void method() {} }; class A { Def* def; template <class Archvie> void serialize(Archive& ar, const unsigned int version) { ar & def; } }; I break my serialization code into three different files, one for each type of archive, each of which includes a common file that has a templated method for loading a serialized file, along with BOOST_CLASS_EXPORT for the derived class. Here is the text version: #include <boost/archive/text_oarchive.hpp> #include "Serialization.hh" A* BoostTextLoader::load() { return Serialization<text_iarchive>::load(fileName); } #include <boost/serialization/export.hpp> BOOST_CLASS_EXPORT(Derived) Here is the binary: #include <boost/archive/binary_oarchive.hpp> #include "Serialization.hh" A* BoostTextLoader::load() { return Serialization<binary_iarchive>::load(fileName); } #include <boost/serialization/export.hpp> BOOST_CLASS_EXPORT(Derived) and a similar one for XML. The Serialization.hh is roughly this: template<typename Archive> struct FanSerialization { static A* load(const std::string& filename) { A* a = 0; stream<mapped_file_source> ifs(filename); Archive ia(ifs); ia >> BOOST_SERIALIZATION_NVP(a); return a; } } When I compile and try to link a test program, I get errors saying "multiple definition of `boost::archive::detail::guid_initializer<Derived>::instance'" and so on. So, I try removing the BOOST_CLASS export from the binary and XML code modules, leaving it in the text version. Compile and link are now good. The text archive performance is back down to 200 seconds. When I try to serialize binary (or xml) archives, I get. /boost-1_33_1/boost/archive/detail/oserializer.hpp:418: static void boost::archive::detail::save_pointer_type<Archive, TPtr>::polymorphic<T>::save(Archive &, const T &, const boost::archive::detail::basic_pointer_oserializer *) [with T = AbstractBase, Archive = boost::archive::xml_oarchive, TPtr = AbstractBase*]: Assertion `0L != bpos_ptr' failed. The code that is failing is from the assert below (oserializer.hpp): // sice true_type is valid, and this only gets made if the // pointer oserializer object has been created, this should never // fail bpos_ptr = archive_pointer_oserializer<Archive>::find(* true_type); assert(NULL != bpos_ptr); if(NULL == bpos_ptr) boost::throw_exception( archive_exception(archive_exception::unregistered_class) ); ar.save_pointer(vp, bpos_ptr); So, needless to say, I'm a bit confused by what is going on. Is there any way at all to fix this? I have run a profiler on the Intel code and it simply seems to be "doing more" than the non-Intel version (more comparison operators, chiefly). Could there be any way to manually instantiate things, or substitute the containers boost uses for look-ups at run-time with different, separate ones? Thanks. Bill

2 3

[BGL][compressed_sparse_row_graph] add_vertices
by Johan Oudinet 27 Jun '06

27 Jun '06

Hi, I try using the compressed_sparse row_graph graph type, and I want add lots vertices. When I read the documentation (http://www.boost-consulting.com/boost/libs/graph/doc/compressed_sparse_row.…) I saw the appropriate add_vertices function described as bellow: vertex_descriptor add_vertices(vertices_size_type count, compressed_sparse_row_graph& g) But, in compressed_sparse_row_graph.hpp:346: <--8----------------------------------------------------- template<BOOST_CSR_GRAPH_TEMPLATE_PARMS> inline Vertex add_vertices(Vertex count, BOOST_CSR_GRAPH_TYPE& g) { Vertex old_num_verts_plus_one = g.m_rowstart.size(); g.m_rowstart.resize(old_num_verts_plus_one + count, EdgeIndex(0)); return old_num_verts_plus_one - 1; } <--8----------------------------------------------------- I don't understand why `count' is a `Vertex' type! Why not `vertices_size_type' type ? Regards, -- Johan

2 1

[BGL] Betweenness Centrality Clustering
by Rui Carvalho 27 Jun '06

27 Jun '06

Hi, Is the BGL betweenness centrality clustering algorithm an implementation of: Community structure in social and biological networks M. Girvan and M. E. J. Newman Proc. Natl. Acad. Sci. USA 99, 7821-7826 (2002). http://aps.arxiv.org/PS_cache/cond-mat/pdf/0112/0112110.pdf thanks, Rui

2 1

1.33.0 documentation
by Joe McCay 27 Jun '06

27 Jun '06

I do I generate readable documentation for 1.33.0 out of a docbook file or a .fo file? jmccay

2 1

progress display for parallel environment
by Levent Yilmaz 27 Jun '06

27 Jun '06

Hi All, This little utility (progress_display in progress.hpp) is so useful that I couldn't help but send out a feature request (hoping that this list is the right place to do that). For programs using multiple threads or multiple distributed processes (as in MPI) it is useful to output progress indication only from some root node. However, these programs are usually SPMD (single program multiple data) and it is not convenient/possible to simply not create a progress_display object. One solution would be: // create a progress_display that does nothing for non root nodes int total_run = 100; boost::progress_display pg( i_am_root ? total_run : pg::DUMMY_DISPLAY ); // Then operator++() will output only from some root process. for (int i=0; i!=total_run; pg++); So my feature request is, can we have some facilities for creating trivial and does-nothing-useful type of progress_displays? best regards, - Levent.

2 1

Time-dependent graphs
by Thomas Hanne 27 Jun '06

27 Jun '06

Hi, I am currently using an adjacency_list for calculating shortest paths using BGL. Now I would like to make the edge weights time-dependent by calling some own function during the algorithm. Unfortunately, I did not really get things working as described in the book "The Boost Graph Library" with respect to self-defined property maps. (Or should I use a visitor for that purpose?) Maybe you could helb me with some code example on using own code for the edge weights to be used during the Dijkstra algorithm? Many thanks and best regards, Thomas Hanne My current code for calculating shortst paths is like ... typedef adjacency_list<listS, vecS, directedS, no_property, property<edge_weight_t, double> > tGraph; ... int anzKnoten = num_vertices(m_Wegezeiten); vector<vertex_descriptor> vorg(anzKnoten); vector<double> wege(anzKnoten); property_map<tGraph, edge_weight_t>::type gewichte = newget(edge_weight, m_Wegezeiten); property_map<tGraph, vertex_index_t>::type indizes = get(vertex_index, m_Wegezeiten); vertex_descriptor start = vertex(nrVon, m_Wegezeiten); dijkstra_shortest_paths(m_Wegezeiten, start, &vorg.at(0), &wege.at(0), gewichte, indizes, less<double>(), closed_plus<double>(), numeric_limits<int>::max(), 0, default_dijkstra_visitor() );

2 1

[BGL] Automatic cleanning in the graph.
by Seweryn Habdank-Wojewódzki 27 Jun '06

27 Jun '06

Hi everyone Is there a possibility to build a graph which nodes are automatically deleted when in the users code there is no reference to them? Maybe something that combines smart pointers and a graphs? Regards. -- |\/\/| Seweryn Habdank-Wojewódzki `\/\/

2 1

[PATCH] [Parameter] typo in index.rst
by Roman Neuhauser 27 Jun '06

27 Jun '06

Index: libs/parameter/doc/index.rst =================================================================== RCS file: /cvsroot/boost/boost/libs/parameter/doc/index.rst,v retrieving revision 1.30 diff -u -r1.30 index.rst --- libs/parameter/doc/index.rst 10 Apr 2006 20:41:06 -0000 1.30 +++ libs/parameter/doc/index.rst 27 Jun 2006 09:29:46 -0000 @@ -273,7 +273,7 @@ We're going to define our interface in namespace ``graphs``. Since users need access to the keyword objects, but not the tag types, we'll define the keyword objects so they're acceessible through -``graphs``, and we'll hide the tag types away in a tested +``graphs``, and we'll hide the tag types away in a nested namespace, ``graphs::tag``. The library provides a convenient macro for that purpose (MSVC6.x users see this note__):: -- 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

1 0

Re: [Boost-users] Boost Variant OutputStreamable
by Ovanes Markarian 27 Jun '06

27 Jun '06

The operator << must be defined in the boost namespace. See the error message of VC:see reference to function template instantiation 'std::basic_ostream<_Elem,_Traits> &boost::operator <<<char,std::char_traits<char>,std::vector<_Ty>,int,std::string,boost::detail::variant::void_,boost::detail::variant::void_,boost::detail::variant::void_,boost::detail::variant::void_,boost::detail::variant::void_,boost::detail::variant::void_,boost::detail::variant::void_,boost::detail::variant::void_,boost::detail::variant::void_,boost::detail::variant::void_,boost::detail::variant::void_,boost::detail::variant::void_,boost::detail::variant::void_,boost::detail::variant::void_,boost::detail::variant::void_,boost::detail::variant::void_,boost::detail::variant::void_>(std::basic_ostream<_Elem,_Traits> &,const boost::variant<T0_,T1,T2> &)' being compiled VC looks for boost::operator<< function and not ::operator<< function. But this should be documented in OutputStreamable. This would compile: #include<iostream> #include<vector> #include<string> #include<boost/variant.hpp> namespace boost { template <typename T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) { for(typename std::vector<T>::size_type i = 0; i < v.size(); ++i) os << v[i] << std::endl; return os; } } struct TpTemplateVariant { typedef boost::variant<std::vector<unsigned long>,int, std::string> BoostVariant; }; typedef TpTemplateVariant::BoostVariant Tpvariant; int main () { Tpvariant p(5); std::cout << p; return 0; } Good Luck, Ovanes Markarian On Mon, June 26, 2006 12:45, CLAIRE, Narinder, Group Risk Mgmt wrote: > I apologise for emailing you directly .. but i canno access the mailing list > from work.. > However in response to your response. > > > The following doesn't compile either .. I get the error > > error C2679: binary '<<' : no operator found which takes a right-hand > operand of type 'const T0' (or there is no acceptable conversion) > > On VC8 > > #include<iostream> > #include<vector> > #include<string> > > #include<boost/variant.hpp> > > > > std::basic_ostream<char> &operator<<(std::basic_ostream<char> > &theostream,const std::vector<unsigned long> &theVector) { > for(unsigned long i(0);i<theVector.size();i++) > theostream << theVector[i] << "\n" ; > return theostream; > } > > > struct TpTemplateVariant { > typedef boost::variant< std::vector<unsigned > long>, > > int, > > std::string > >> BoostVariant; > }; > > typedef TpTemplateVariant::BoostVariant Tpvariant; > > int main () { > > Tpvariant p(5); > std::cout << p; > > return 0; > > > > > *********************************************************************************** > The Royal Bank of Scotland plc. Registered in Scotland No 90312. Registered Office: 36 St Andrew > Square, Edinburgh EH2 2YB. > Authorized and regulated by the Financial Services Authority > > This e-mail message is confidential and for use by the > addressee only. If the message is received by anyone other > than the addressee, please return the message to the sender > by replying to it and then delete the message from your > computer. Internet e-mails are not necessarily secure. The > Royal Bank of Scotland plc does not accept responsibility for > changes made to this message after it was sent. > > Whilst all reasonable care has been taken to avoid the > transmission of viruses, it is the responsibility of the recipient to > ensure that the onward transmission, opening or use of this > message and any attachments will not adversely affect its > systems or data. No responsibility is accepted by The Royal > Bank of Scotland plc in this regard and the recipient should carry > out such virus and other checks as it considers appropriate. > Visit our websites at: > http://www.rbos.com > http://www.rbsmarkets.com > *********************************************************************************** > Download this as a file

2 4

[signals] unresolved overloaded function type with gcc 4.1
by Lars Monecke 26 Jun '06

26 Jun '06

Hi, i'm stucked and google does not lead me to the right pages :-( The follwing code example does not compile on gcc 4.1.1 an boost 1.33.1 . It works on msvc.net 7.1. ---code starts here #include <boost/bind.hpp> #include <boost/signal.hpp> #include <iostream> struct Printer { void operator()(int iValue) { std::cout << iValue << "\n"; } }; int main(int /* argc */, char* /* argv[] */) { typedef boost::signal<void (int)> tSignal; tSignal stSignal; Printer stPrinter; stSignal.connect(stPrinter); typedef std::vector<int> tConInts; tConInts cInts; cInts.push_back(1); cInts.push_back(2); cInts.push_back(3); for_each(cInts.begin(), cInts.end(), boost::bind(&tSignal::operator(), boost::ref(stSignal), _1)); return 0; } ---code ends here ---gcc output starts here main.cpp: In function 'int main(int, char*)': main.cpp:37: error: call of overloaded 'bind(<unresolved overloaded function type>, const boost::reference_wrapper<boost::signal<void ()(int), boost::last_value<void>, int, std::less<int>, boost::function<void ()(int), std::allocator<void> > > >, boost::arg<1>&)' is ambiguous /usr/local/gcc-4.1.1/boost-1.33.1/boost/bind/bind_mf_cc.hpp:43: note: candidates are: boost::_bi::bind_t<R, boost::_mfi::mf1<R, T, A1>, typename boost::_bi::list_av_2<A1, A2>::type> boost::bind(R (T::*)(B1), A1, A2) [with R = boost::last_value<void>::unusable, T = boost::signal1<void, int, boost::last_value<void>, int, std::less<int>, boost::function<void ()(int), std::allocator<void> > >, B1 = int, A1 = boost::reference_wrapper<boost::signal<void ()(int), boost::last_value<void>, int, std::less<int>, boost::function<void ()(int), std::allocator<void> > > >, A2 = boost::arg<1>] /usr/local/gcc-4.1.1/boost-1.33.1/boost/bind/bind_mf_cc.hpp:54: note: boost::_bi::bind_t<R, boost::_mfi::cmf1<R, T, A1>, typename boost::_bi::list_av_2<A1, A2>::type> boost::bind(R (T::*)(B1)const, A1, A2) [with R = boost::last_value<void>::unusable, T = boost::signal1<void, int, boost::last_value<void>, int, std::less<int>, boost::function<void ()(int), std::allocator<void> > >, B1 = int, A1 = boost::reference_wrapper<boost::signal<void ()(int), boost::last_value<void>, int, std::less<int>, boost::function<void ()(int), std::allocator<void> > > >, A2 = boost::arg<1>] make: *** [main.o] Error 1 ---gcc output ends here I think something with static_cast is the solultion, but i don't know how? Any hints? Thanks in advance, Lars

3 4