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

Boost-users] [asio]about reactor_op_queue dead loop
by victor 13 Jan '10

13 Jan '10

I call boost::asio::async_write, finally it call "bool enqueue_operation(Descriptor descriptor, Operation operation)" In this function , there is code as flow: while (current_op->next_) current_op = current_op->next_; My process execute it for ever. Using gdb to attach the prcocess, I find : 68 while (current_op->next_) (gdb) p current_op $8 = (class boost::asio::detail::reactor_op_queue<int>::op_base *) 0x93381c8 (gdb) p current_op->next_ $9 = (class boost::asio::detail::reactor_op_queue<int>::op_base *) 0x93381c8 current_op and current_op->next_ is the same address. how did it come true? I have no any clue. Anyone can offer some suggestion?

1 1

Newbie question: Serialization of an Array2D --> Cell** m_cells
by Simon Ruffieux 13 Jan '10

13 Jan '10

Hello ! I am trying to serialize a a complex structure. One of the "variable" is a 2D Array (Cell** m_cells ) declared with pointers. I need to keep this data structure as it is. I have read some stuff about multi array with boost but found nothing to serialize my Cell** m_cells. Maybe one of you has the solution .... Note1: using boost 1.41.0, g++ and ubuntu 9.04 .... Note2: As you may understand while reading the code, I have in fact an Array2D of PointAccumulator .... (Cell = PointAccumulator) The part of code that is not correct ..... * template <class Archive> void serialize(Archive& ar, const unsigned int version){ *ar & m_xsize & m_ysize &* m_cells; }* And raising this error: wheelchair@wheelchair-laptop:~/playerstage/boostTest$ g++ -I/usr/local/include/ -L/usr/local/lib/ simple2.cpp -o simple -lboost_serialization /usr/local/include/boost/serialization/access.hpp: In static member function ‘static void boost::serialization::access::serialize(Archive&, T&, unsigned int) [with Archive = boost::archive::text_iarchive, T = PointAccumulator*]’: /usr/local/include/boost/serialization/serialization.hpp:74: instantiated from ‘void boost::serialization::serialize(Archive&, T&, unsigned int) [with Archive = boost::archive::text_iarchive, T = PointAccumulator*]’ /usr/local/include/boost/serialization/serialization.hpp:133: instantiated from ‘void boost::serialization::serialize_adl(Archive&, T&, unsigned int) [with Archive = boost::archive::text_iarchive, T = PointAccumulator*]’ /usr/local/include/boost/archive/detail/iserializer.hpp:173: instantiated from ‘void boost::archive::detail::iserializer<Archive, T>::load_object_data(boost::archive::detail::basic_iarchive&, void*, unsigned int) const [with Archive = boost::archive::text_iarchive, T = PointAccumulator*]’ simple2.cpp:186: instantiated from here /usr/local/include/boost/serialization/access.hpp:109: error: request for member ‘serialize’ in ‘t’, which is of non-class type ‘PointAccumulator*’ /usr/local/include/boost/serialization/access.hpp: In static member function ‘static void boost::serialization::access::serialize(Archive&, T&, unsigned int) [with Archive = boost::archive::text_oarchive, T = PointAccumulator*]’: /usr/local/include/boost/serialization/serialization.hpp:74: instantiated from ‘void boost::serialization::serialize(Archive&, T&, unsigned int) [with Archive = boost::archive::text_oarchive, T = PointAccumulator*]’ /usr/local/include/boost/serialization/serialization.hpp:133: instantiated from ‘void boost::serialization::serialize_adl(Archive&, T&, unsigned int) [with Archive = boost::archive::text_oarchive, T = PointAccumulator*]’ /usr/local/include/boost/archive/detail/oserializer.hpp:139: instantiated from ‘void boost::archive::detail::oserializer<Archive, T>::save_object_data(boost::archive::detail::basic_oarchive&, const void*) const [with Archive = boost::archive::text_oarchive, T = PointAccumulator*]’ simple2.cpp:186: instantiated from here /usr/local/include/boost/serialization/access.hpp:109: error: request for member ‘serialize’ in ‘t’, which is of non-class type ‘PointAccumulator*’ Here is the code I use for my tests: #include <iostream> #include <iterator> #include <algorithm> #include <sstream> #include <fstream> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> using namespace std; using namespace boost::archive; using namespace boost::serialization; /* * point * */ template <class T> struct point{ inline point():x(0),y(0) {} inline point(T _x, T _y):x(_x),y(_y){} T x, y; friend class boost::serialization::access; template <class Archive> void serialize(Archive& ar, const unsigned int version){ ar & x & y; } }; /* * PointAccumulator * */ struct PointAccumulator{ typedef point<float> FloatPoint; PointAccumulator(): acc(0,0), n(0), visits(0){} PointAccumulator(int i): acc(0,0), n(0), visits(0){assert(i==-1);} static PointAccumulator* unknown_ptr; FloatPoint acc; int n, visits; friend class boost::serialization::access; template <class Archive> void serialize(Archive& ar, const unsigned int version){ ar & n & visits & acc; } }; /* * Array2D * */ template<class Cell, const bool debug=false> class Array2D{ public: Array2D(int xsize=0, int ysize=0); Array2D& operator=(const Array2D &); Array2D(const Array2D<Cell,debug> &); //~Array2D(); inline Cell& cell(int x, int y); inline void print(){ cout << "Displaying array2D (x,y) --> (" << m_xsize << "," << m_ysize << ")" << endl; for(int i=0;i<m_xsize;i++){ for(int j=0;j<m_ysize;j++){ cout << cell(i,j).acc.x << " "; } cout<<endl; } } Cell ** m_cells; protected: int m_xsize, m_ysize; friend class boost::serialization::access; * template <class Archive> void serialize(Archive& ar, const unsigned int version){ ar & m_xsize & m_ysize & m_cells; }* }; template <class Cell, const bool debug> Array2D<Cell,debug> & Array2D<Cell,debug>::operator=(const Array2D<Cell,debug> & g){ if (debug || m_xsize!=g.m_xsize || m_ysize!=g.m_ysize){ for (int i=0; i<m_xsize; i++) delete [] m_cells[i]; delete [] m_cells; m_xsize=g.m_xsize; m_ysize=g.m_ysize; m_cells=new Cell*[m_xsize]; for (int i=0; i<m_xsize; i++) m_cells[i]=new Cell[m_ysize]; } for (int x=0; x<m_xsize; x++) for (int y=0; y<m_ysize; y++) m_cells[x][y]=g.m_cells[x][y]; if (debug){ std::cerr << __PRETTY_FUNCTION__ << std::endl; std::cerr << "m_xsize= " << m_xsize<< std::endl; std::cerr << "m_ysize= " << m_ysize<< std::endl; } return *this; } template <class Cell, const bool debug> Array2D<Cell,debug>::Array2D(int xsize, int ysize){ // assert(xsize>0); // assert(ysize>0); m_xsize=xsize; m_ysize=ysize; if (m_xsize>0 && m_ysize>0){ m_cells=new Cell*[m_xsize]; for (int i=0; i<m_xsize; i++) m_cells[i]=new Cell[m_ysize]; } else{ m_xsize=m_ysize=0; m_cells=0; } if (debug){ std::cerr << __PRETTY_FUNCTION__ << std::endl; std::cerr << "m_xsize= " << m_xsize<< std::endl; std::cerr << "m_ysize= " << m_ysize<< std::endl; } } template <class Cell, const bool debug> inline Cell& Array2D<Cell,debug>::cell(int x, int y){ return m_cells[x][y]; } template <class Cell, const bool debug> Array2D<Cell,debug>::Array2D(const Array2D<Cell,debug> & g){ m_xsize=g.m_xsize; m_ysize=g.m_ysize; m_cells=new Cell*[m_xsize]; for (int x=0; x<m_xsize; x++){ m_cells[x]=new Cell[m_ysize]; for (int y=0; y<m_ysize; y++) m_cells[x][y]=g.m_cells[x][y]; } if (debug){ std::cerr << __PRETTY_FUNCTION__ << std::endl; std::cerr << "m_xsize= " << m_xsize<< std::endl; std::cerr << "m_ysize= " << m_ysize<< std::endl; } } /* * SaveToFile and LoadFromFile * */ template <class A> void saveIntoFile(Array2D<PointAccumulator,false>& array, const char* file){ ofstream ofile(file); A ar(ofile); ar << array; ofile.close(); } template <class A> Array2D<PointAccumulator,false> loadFromFile(const char* file){ ifstream ifile(file); A ar(ifile); Array2D<PointAccumulator,false> array; ar >> array; ifile.close(); return array; } /* * MAIN * */ int main(){ Array2D<PointAccumulator,false> myArr = Array2D<PointAccumulator,false>(2,2); myArr.cell(0,0).acc.x = 1; myArr.cell(1,0).acc.x = 2; myArr.cell(0,1).acc.x = 1.1; myArr.cell(1,1).acc.x = 2.2; myArr.print(); saveIntoFile<text_oarchive>(myArr,"out.txt"); Array2D<PointAccumulator,false> myArr2 = loadFromFile<text_iarchive>("out.txt"); myArr2.print(); } Thanks for the help !

2 2

newbie question --> invalid application of ?sizeof? to incomplete type ?boost::STATIC_ASSERTION_FAILURE<false>?
by Simon Ruffieux 13 Jan '10

13 Jan '10

Hello ! I am a newbie to Boost ... and trying to use it in order to serialize a complex data structure for one of my project. (the struct particle) You can see the nested data structure at the end of this file. I have started from the 'leafs' and yet trying to serialize a point which is a variable of a PointAccumulator. You can see the point.h file below. Here is the test code I am using to try to serialize it. Note that I read a few succinct tutorials and already succesfully compiled some simple examples. ... GMapping::point<int>p = GMapping::point<int>(); //saveIntoFile<text_oarchive>(particlesSaved[1].map.cell(1,1).acc, "outTest.txt"); saveIntoFile<text_oarchive>(p, "outTest.txt"); ... template <class T> void RobotController::saveIntoFile(GMapping::point<int>& p, const char* file){ std::ofstream ofile(file); T ar(ofile); ar << p; ofile.close(); } However when compiling; it raises the following error: ... /usr/include/boost/archive/detail/oserializer.hpp: In function ‘void boost::archive::save(Archive&, T&) [with Archive = boost::archive::text_oarchive, T = GMapping::point<int>]’: /usr/include/boost/archive/detail/common_oarchive.hpp:64: instantiated from ‘void boost::archive::detail::common_oarchive<Archive>::save_override(T&, int) [with T = GMapping::point<int>, Archive = boost::archive::text_oarchive]’ /usr/include/boost/archive/basic_text_oarchive.hpp:75: instantiated from ‘void boost::archive::basic_text_oarchive<Archive>::save_override(T&, int) [with T = GMapping::point<int>, Archive = boost::archive::text_oarchive]’ /usr/include/boost/archive/detail/interface_oarchive.hpp:64: instantiated from ‘Archive& boost::archive::detail::interface_oarchive<Archive>::operator<<(T&) [with T = GMapping::point<int>, Archive = boost::archive::text_oarchive]’ RobotController.cpp:186: instantiated from ‘void RobotController::saveIntoFile(GMapping::point<int>, const char*) [with T = boost::archive::text_oarchive]’ RobotController.cpp:223: instantiated from here /usr/include/boost/archive/detail/oserializer.hpp:564: error: invalid application of ‘sizeof’ to incomplete type ‘boost::STATIC_ASSERTION_FAILURE<false>’ /usr/include/boost/archive/detail/common_oarchive.hpp:64: instantiated from ‘void boost::archive::detail::common_oarchive<Archive>::save_override(T&, int) [with T = GMapping::point<int>, Archive = boost::archive::text_oarchive]’ /usr/include/boost/archive/basic_text_oarchive.hpp:75: instantiated from ‘void boost::archive::basic_text_oarchive<Archive>::save_override(T&, int) [with T = GMapping::point<int>, Archive = boost::archive::text_oarchive]’ /usr/include/boost/archive/detail/interface_oarchive.hpp:64: instantiated from ‘Archive& boost::archive::detail::interface_oarchive<Archive>::operator<<(T&) [with T = GMapping::point<int>, Archive = boost::archive::text_oarchive]’ RobotController.cpp:186: instantiated from ‘void RobotController::saveIntoFile(GMapping::point<int>, const char*) [with T = boost::archive::text_oarchive]’ RobotController.cpp:223: instantiated from here /usr/include/boost/archive/detail/oserializer.hpp:564: error: invalid application of ‘sizeof’ to incomplete type ‘boost::STATIC_ASSERTION_FAILURE<false>’ make: *** [RobotController.o] Error 1 Anyone understands what is the error ? I read I had to give a constant reference to the object while calling the operator << ... but I don't really understand it. I am using Ubuntu 9.04 / g++ compiler / boost v 1.35 Thanks in advance ! Second quick question I have doubts about: Do you think it is possible to serialize my *Particle* structure ? With all the pointers it contains and the nested structures and the trees (TNode) it points to ... ------------------------------ ----------------------------------------------------------- Data structures *Point.h* #ifndef _POINT_H_ #define _POINT_H_ #include <assert.h> #include <math.h> #include <iostream> #include <sstream> #include <fstream> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #define DEBUG_STREAM cerr << __PRETTY_FUNCTION__ << ":" //FIXME using namespace boost::archive; namespace GMapping { template <class T> struct point{ inline point():x(0),y(0) {} inline point(T _x, T _y):x(_x),y(_y){} T x, y; friend class boost::serialization::access; template <class Archive> void serialize(Archive& ar, const unsigned int version){ ar & x & y; } }; ... Structure to serialize (originally, I want to serialize a Particle ...) Struct Particle{ ScanMatcherMap map; OrientedPoint pose; double weight; double weightSum; double gweight; int previousIndex; TNode* node; }; typedef Map<PointAccumulator, HierarchicalArray2D<PointAccumulator>> ScanMatcherMap; template <class Cell, class Storage, const bool isClass=true> class Map{ Point m_center; double m_worldSizeX, m_worldSizeY, m_delta; Storage m_storage; int m_mapSizeX, m_mapSizeY; int m_sizeX2, m_sizeY2; static const Cell m_unknown; }; struct PointAccumulator{ typedef point<float> FloatPoint; PointAccumulator(): acc(0,0), n(0), visits(0){} PointAccumulator(int i): acc(0,0), n(0), visits(0){assert(i==-1);} static PointAccumulator* unknown_ptr; FloatPoint acc; int n, visits; }; template <class Cell> class HierarchicalArray2D: public Array2D<autoptr< Array2D<Cell> > >{ typedef std::set< point<int>, pointcomparator<int> > PointSet; HierarchicalArray2D(int xsize, int ysize, int patchMagnitude=5); PointSet m_activeArea; int m_patchMagnitude; int m_patchSize; }; template<class Cell, const bool debug=false> class Array2D{ Cell ** m_cells; int m_xsize, m_ysize; }; template <class X> class autoptr{ struct reference{ X* data; unsigned int shares; }; reference * m_reference; }; struct TNode{ /**Constructs a node of the trajectory tree. @param pose: the pose of the robot in the trajectory @param weight: the weight of the particle at that point in the trajectory @param accWeight: the cumulative weight of the particle @param parent: the parent node in the tree @param childs: the number of childs */ TNode(const OrientedPoint& pose, double weight, TNode* parent=0, unsigned int childs=0); OrientedPoint pose; double weight; double accWeight; double gweight; TNode* parent; const RangeReading* reading; unsigned int childs; mutable unsigned int visitCounter; mutable bool flag; }; class RangeReading: public SensorReading, public std::vector<double>{ std::vector<Point> cartesianForm(double maxRange=1e6) const; unsigned int activeBeams(double density=0.) const; OrientedPoint m_pose; };

1 1

variadic template function using fusion vector
by noman javed 13 Jan '10

13 Jan '10

Hi I want to write a function like that template<class A, class T0, class T1, ..., class Tn> execute(const A& a, T0& arg0, T1& arg&, .. , Tn& argn) { boost::fusion::vector<T0,...,Tn> vec(arg0, arg1, .., argn); /* rest of the code */ } Can anybody guide me how can I write this function without overloading it with different number of args? Thanks in anticipation Noman Javed

2 1

c++: boost::multi_array - in a class
by Hannan Sadar 13 Jan '10

13 Jan '10

Hi to all, i wrote a class (Influx), where i try to define there a boost::multi_arry occ_sign_change. Once i tried in Influx::Influx to write: occ_sign_change = vec::uint32_1d_t ( boost::extents[ num_elements ] ); i was able to compile, but at run time i got the following error: randum.rc3_64: /usr/include/boost/multi_array/multi_array_ref.hpp:487: boost::multi_array_ref<T, NumDims>& boost::multi_array_ref<T, NumDims>::operator=(const ConstMultiArray&) [with ConstMultiArray = boost::multi_array<unsigned int, 1ul, std::allocator<unsigned int> >, T = unsigned int, long unsigned int NumDims = 1ul]: Assertion `std::equal(other.shape(),other.shape()+this->num_dimensions(), this->shape())' failed. that is why i rewrote the above line as following: vec::uint32_1d_t occ_sign_change ( boost::extents[ num_elements ] ); but now, when i call for the size of occ_sign_change in Influx::Clean, i get that the size is zero. how could i solve this problem? regards #include <boost/random/uniform_01.hpp> #include <boost/random.hpp> #include "randum.rc3.hpp" namespace vec { typedef boost::multi_array< uint32_t , 1> uint32_1d_t; typedef boost::multi_array< uint32_t , 2> uint32_2d_t; typedef boost::multi_array< uint32_t , 3> uint32_3d_t; typedef boost::multi_array< uint32_t , 1> uint32_1d_t; typedef boost::multi_array< uint32_t , 2> uint32_2d_t; typedef boost::multi_array< double , 1> double_1d_t; typedef boost::multi_array< double , 2> double_2d_t; typedef uint32_1d_t::index index_t; } class Influx { public: Influx ( uint32_t num_elements , double p_, double kappa_ , vec::uint32_2d_t *Pointer_ , threshold_t threshold_ , uint32_t num_bits , uint16_t max_runs_ ); void Update (); void Validity ( const uint32_t i ); void Clean( uint32_t run ); boost::dynamic_bitset<> occupied; vec::uint32_1d_t occupied_counter; vec::uint32_1d_t num_neighbours; vec::uint32_1d_t occ_sign_change; private: std::vector< uint32_t > remove_node_v; vec::uint32_2d_t *Pointer; std::vector< uint32_t > num_neighbours_epoch; double p; double kappa; threshold_t threshold; uint16_t max_runs; uint32_t bits_mask; uint32_t complement_num; }; Influx::Influx ( uint32_t num_elements , double p_, double kappa_ , vec::uint32_2d_t *Pointer_ , threshold_t threshold_ , uint32_t num_bits , uint16_t max_runs_ ) { bits_mask = ( 1 << num_bits ) - 1; Pointer = Pointer_; p = p_; kappa = kappa_; threshold = threshold_; max_runs = max_runs_; complement_num = 0; num_neighbours_epoch = std::vector< uint32_t > ( num_elements , 0); occupied = boost::dynamic_bitset<> ( num_elements , 0 ); // all 0's by default vec::uint32_1d_t occupied_counter ( boost::extents[ num_elements ] ); vec::uint32_1d_t occ_sign_change ( boost::extents[ num_elements ] ); vec::uint32_1d_t num_neighbours ( boost::extents[ num_elements ] ); remove_node_v.reserve( num_elements ); std::fill_n( occupied_counter.begin() , occupied_counter.num_elements() , 0 ); std::fill_n( occ_sign_change.begin() , occ_sign_change.num_elements() , 0 ); std::fill_n( num_neighbours.origin() , num_neighbours.num_elements() , 0 ); } void Influx::Clean ( uint32_t run ) { for ( vec::uint32_1d_t::size_type i = 0 ; i < remove_node_v.size() ; i++ ) { occupied[ remove_node_v[i] ] = 0; if ( run >= max_runs ) { std::cout << "size occ_sign_change: " << occ_sign_change.size() << std::endl; occ_sign_change[ remove_node_v[i] ]++; } } remove_node_v.clear(); }

2 1

[iterators][range][rangeex] range concatenation
by Dmitry Vinogradov 12 Jan '10

12 Jan '10

Is it possible with Boost (or RangeEx) to concatenate ranges? Sample usage: template <class Range> void process_range(Range const &); std::vector<foo> v = ...; std::list<foo> l = ...; process_range(concat(v, l));

5 18

[asio] Why are the strands in the "HTTP Server 3" example necessary?
by Tacheon 12 Jan '10

12 Jan '10

In the HTTP Server 3 (http://tinyurl.com/yh95d2b) example of the asio documentation strands are used to synchronize the invocation of completion handlers? But why are they necessary here? As far as I get it, the handlers are invoked in strict sequential order for each distinct connection (http://tinyurl.com/ybohynd) Each connection has its own set of resources so synchronization shouldn't be necessary, should it? Thanks in advance, Boris

5 6

gil and OpenGL
by mailinglist＠squarepx.com 12 Jan '10

12 Jan '10

This is my first post in any mailinglist ever so i hope i am doing this right. I successfully integrated the boost::gil module into my code to load some images and process their content so that I can display it as a texture in OpenGL. My problem right now is the massive performance issue in retrieving the color information from the loaded image. I am looping through every row and column and retrieve the red, green, blue and alpha color with the get_color method and push those values to a char array. So I was wondering what the best approach would be to get the color information from the gil image into OpenGL or at least a char array. Thanks in advance.

5 8

[program_options] linking error with example
by katharina 12 Jan '10

12 Jan '10

Hi, I have problems starting out with the program_options library. Looking at the tutorial, I wanted to try out the first example metioned, first.cpp (which is located in boost_1_41_0/libs/program_options/example). But there seems to be some linking error. I try to compile it by g++ -I ~boost_1_41_0 first.cpp -o first ~/boost_1_41_0/stage/lib/libboost_program_options.a But then I get a strange error: /tmp/ccDB6KSC.o: In function `boost::program_options::basic_command_line_parser<char>::extra_parser(boost::function1<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::allocator<boost::function_base> >)': first.cpp:(.text._ZN5boost15program_options25basic_command_line_parserIcE12extra_parserENS_9function1ISt4pairISsSsERKSsSaINS_13function_baseEEEE[boost::program_options::basic_command_line_parser<char>::extra_parser(boost::function1<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::allocator<boost::function_base> >)]+0x27): undefined reference to `boost::program_options::detail::cmdline::set_additional_parser(boost::function1<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::allocator<boost::function_base> >)' collect2: ld returned 1 exit status What am I doing wrong? Thanks, Katharina

1 0

[Bjam] Ignore specific library
by Simon Pickles 12 Jan '10

12 Jan '10

Hi, Using Visual Studio, it is possible to 'Ignore Specific Library' (Project Properties>Configuration Properties>Linker>Input>Ignore Specific Library). We have found this a useful feature in a project. Now we want to build the project using bjam, but we need to reproduce that linker behaviour. Is there any ignore <library> feature? Many thanks Simon

3 4

how to make Pool allocate one chunk buffer one time?
by zhangxiaowei 12 Jan '10

12 Jan '10

Hi, all I am doing one video processing software, which uses Boost::pool as the buffer manager. but every time pool allocates buffers, it malloc all needed memory at one time. for example, I create one pool object for 1024 B for one chunk, and 16 chunks at first. Pool malloc all the 1024 * 16 (16KB) at one time. this leads to memory allocation error for my application, because I need 8294400B (1920 * 1080 * 4, for one video frame) * 32, that is more than 256 MB. I use default new/delete, so new returns NULL for the third time in my case. but from memory monitor, there are still enough memory free. after tracing into new, I found this is from the Microsoft memory management design and memory fragments. is there any way to set Pool to allocate one chunk by another? for example, when I want one chunk, it allocates 8294400B. and for another time, it does another. so this should solve my issues for the memory usage. after checking the code of Pool, it is all based on contiguous memory. if pool cannot meet my requirement, is there any other option in BOOST? BTW, I am working on Windows 32 bits with MS Visual Studio 2005. Thank you for any comment. Xiaowei _________________________________________________________________ 上Windows Live 中国首页，下载Messenger2009安全版！ http://www.windowslive.cn

3 2

Re: [Boost-users] Boost release 1.41.0 available
by Tom Kent 11 Jan '10

11 Jan '10

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I've built windows libraries (vc7.1, vc8, vc9) for this version, if you want them, you can get them from my website: http://boost.teeks99.com Usually I'm quicker about this, but I didn't notice that the last release happened until I saw that the next one was coming up :-) Tom > From: Beman Dawes <bdawes <at> acm.org> > Subject: Boost release 1.40.0 is available > Newsgroups: gmane.comp.lib.boost.user > Date: 2009-11-18 13:25:48 > Boost release 1.41.0 is now available. > > This release contains one new library and numerous bug fixes for > existing > libraries. For details, including download links, see > http://www.boost.org/users/news/version_1_41_0 > > The release can also be downloaded directly from SourceForge. See > http://sourceforge.net/projects/boost/files/ > > To install this release on your system, see > http://www.boost.org/doc/libs/1_41_0/more/getting_started/index.html > > Thanks, > > --The Boost release team -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.10 (MingW32) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/ iEYEARECAAYFAktLi4wACgkQccZrtZUgfJClsgCeJAfaSk5gVsxi4w9L/cc/EYb5 FqwAn1YA74pBMFUmkhvsHlb8gpMlaP0G =0T+M -----END PGP SIGNATURE-----

1 0

utf8_codecvt_facet
by Patrick Horgan 11 Jan '10

11 Jan '10

utf8_codecvt is in libserialization and in libprogram_options--I thought it was moving to utility? Is there one supported spot? Is there any documentation that talks about what to include and link? The .hpp file is still in boost/detail, boost/archive/detail, boost/program_options,boost_filesystem/src, and libs/iostreams/test/detail. Guess it's not cleaned up yet? Or maybe people didn't want cross dependencies? Anyway I need to either use it or write one;) I'm not doing serialization or program_options (yet, who knows, just starting the project). I also need to be able to be able to deal with UTF-16, I don't suppose there's a codecvt facet for that, huh? Patrick

3 2

Spirit parser includes
by Eloi Du Bois 11 Jan '10

11 Jan '10

Hi, I would like to know which include do I need to use grammar. When using include "boost/spirit.hpp", it says me that it is deprecated... d:\travail\tuttleofx\plugins\lut\src\lutengine\lut_reader.h(37) : error C2039: 'grammar' : n'est pas membre de 'boost::spirit' d:\travail\tuttleofx\plugins\lut\src\lutengine\lut_reader.h(37) : error C2504: 'grammar' : classe de base non définie d:\travail\tuttleofx\plugins\lut\src\lutengine\lut_reader.h(37) : error C2143: erreur de syntaxe : absence de ',' avant '<' d:\travail\tuttleofx\plugins\lut\src\lutengine\lut_reader.h(55) : error C2143: erreur de syntaxe : absence de ';' avant '<'

2 2

Using 'address-model-32_64' on Mac OS 10.6
by Dane Springmeyer 11 Jan '10

11 Jan '10

I've recently upgraded to a Mac with 64bit firmware and Snow Leopard. I've noticed all applications compiled with g++ now default to 64 bit libs (x86_64), including boost. Thanks by the way for the fixes to boost 1.41 that allow successful 3- way arch compilation on osx again! Now I'm trying to just build two- way arches. I'm now trying to compile boost (I happen to be using trunk), and am noticing that passing 'address-model-32_64' does not seem to have the effect I'd expect. If the flag is passed the only affect I notice is that the build directories include it 'address-model-32_64' in the path, but notably the '-arch -i386 -arch x86_64' flags are not properly added to the CXXFLAGS and LINKFLAGS. Therefore the compiled dynamic libraries are still single architecture, x86_64. Passing 'architecture=combined' does prompt these flags, but includes the 'arch ppc' flag as well which I don't want. So, is it a bug that using address-model alone does not work or am I am misunderstanding something? Thanks for any clarification. Cheers, Dane

2 2

Problem iterating over vertices (Property Map!?)
by Pedram Pedarsani 11 Jan '10

11 Jan '10

I am kind of new to C++ and also BGL, so it'll be great if you can help me with this problem! I'm iterating over all the vertices of my graph, and each time I iterate, I want to *mark* a vertex (which has some specific degree for example, or some other property that I can calculate), so as not to iterate over it the next time. I'll do this process until all vertices are marked, so no more iteration. For now, what I'm doing is putting the marked vertices in a separate list, and each time I iterate over all vertices again and I check whether each vertex is in the marked list (which is very inefficient). Could you please help me with an efficient way of doing this? I was thinking to use Property Map but I have no idea how! Any small piece of code will be appreciated. Thanks a lot!

1 0

BGL: shared_ptr as bundled properties > how to generate properties maps ???
by Damien Maupu 11 Jan '10

11 Jan '10

Dear all, I am using bundled properties when I define my graph. The bundled properties are smart pointers to my own class Edge and Vertex. I write something like: typedef boost::shared_ptr<Vertex> VertexPtr; typedef boost::shared_ptr<Edge> EdgePtr; typedef adjacency_list<vecS, vecS, directedS, VertexPtr, EdgePtr> Graph; Vertex and Edge being my own classes to store information on the vertices and the edges. For what I read in the doc, this is the correct, more modern way to do it. My problem is the following. I am trying to use the BGL algorithms and some of them require vertex/edge info to be provide as properties maps. From http://www.boost.org/doc/libs/1_41_0/libs/graph/doc/bundles.html I know it is possible to generate those maps from bundled properties. It works well if I don't use shared_ptr but cannot compile otherwise. When using shared_ptr, similarly to the doc, I wrote: typedef property_map<SearchGraph, float EdgePtr::*>::type WeightMap; WeightMap weightMap = get(&EdgePtr::m_cost, *_graph); m_cost being a public float member of my own class Edge. I have the following compilation error: 'm_cost' : is not a member of 'boost::shared_ptr<T>' Indeed it is not. My question is, I can let the shared_ptr access the member? In other world how to deal with bundled properties / properties maps and shared_ptr. Extra question, could 'm_cost' be a private member of my own class Edge? Thank you very much Sincerely, Damien

3 4

can serialize multi-class into a single Archive?
by pengdw 11 Jan '10

11 Jan '10

I want to serialize multiple class into a single file. that's: class object {}; ofstream ofs; ofs.open("data.txt"); boost::archive::text_oarchive oa(ofs); while (get_next_object(object_t obj)) { oa << obj; } It is ok when I use text_iarchive to read back these objects. Now I want to append some objects to a Archive, I need to reopen the data file "data.txt" with (ios_base::app | ios_base::out), and serialize some object to the new-opend Archive. then when I use text_iarchive to load, I got error messages. I checked some manuals, and use boost::archive::no_header to skip the archive headers like "22 serialization::archive" when appending objects. but still I got error messages when loading. can anyone tell me how to store and append objects to a single Archive, and load correctly. tks.

1 0

[Accumulators] Errors compiling the "Hello, World!" example
by Marco Guazzone 11 Jan '10

11 Jan '10

Hello! I'm new to Accumulators. I've tried to compile the "Hello, World!" example (found in the User Guide) but it fails: --- [error] --- $ g++ -ansi -Wall -o accumulators_test1 accumulators_test1.cpp /usr/include//boost/accumulators/statistics_fwd.hpp: In function ‘int main()’: /usr/include//boost/accumulators/statistics_fwd.hpp:87: error: ‘template<int N> struct boost::accumulators::tag::moment’ is not a function, /usr/include//boost/accumulators/statistics/moment.hpp:104: error: conflict with ‘template<int T2, class Arg1, class A0, class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8, class A9, class A10, class A11, class A12, class A13, class A14> typename boost::accumulators::detail::extractor_result<Arg1, boost::accumulators::tag::moment<T2> >::type boost::accumulators::extract::moment(const Arg1&, const A0&, const A1&, const A2&, const A3&, const A4&, const A5&, const A6&, const A7&, const A8&, const A9&, const A10&, const A11&, const A12&, const A13&, const A14&)’ accumulators_test1.cpp:22: error: in call to ‘moment’ --- [/error] --- My system is: Fedora 12 x86_64 -- GCC 4.4.2 20091222 (Red Hat 4.4.2-20) -- Boost 1.39 (also tried with the latest Boost trunk) Just for the sake of completeness, here below is the code stored in the "accumulators_test1.cpp" file --- [code] --- #include <iostream> #include <boost/accumulators/accumulators.hpp> #include <boost/accumulators/statistics/stats.hpp> #include <boost/accumulators/statistics/mean.hpp> #include <boost/accumulators/statistics/moment.hpp> using namespace boost::accumulators; int main() { // Define an accumulator set for calculating the mean and the // 2nd moment ... accumulator_set<double, stats<tag::mean, tag::moment<2> > > acc; // push in some data ... acc(1.2); acc(2.3); acc(3.4); acc(4.5); // Display the results ... std::cout << "Mean: " << mean(acc) << std::endl; std::cout << "Moment: " << moment<2>(acc) << std::endl; return 0; } --- [/code] --- Where I am wrong? Thank you very much for any help!! Best, -- Marco

2 3

[repost][serialization] version handling in {save|load}_construct_data
by JOAQUIN M. LOPEZ MUÑOZ 11 Jan '10

11 Jan '10

Hello, allow me to repost this message from a couple of weeks ago: I've taken a look at how the version number is dealt with in Boost.Serialization collection serialization code: * The relevant code at saving time is: if(3 < ar.get_library_version()){ const unsigned int item_version = version< BOOST_DEDUCED_TYPENAME Container::value_type >::value; ar << BOOST_SERIALIZATION_NVP(item_version); } * At loading time, the equivalent code is: unsigned int item_version; ar >> BOOST_SERIALIZATION_NVP(count); if(3 < ar.get_library_version()) ar >> BOOST_SERIALIZATION_NVP(item_version); else item_version = 0; Can someone (aka Robert :-) ) shed some light on this bit? Why the version number has to be given such manual processing when this is not needed if, for instance, serializating values via the simple ar&value? I'm trying to do the equivalent thing in Boost.MultiIndex. Thank you, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

4 3

Re: [Boost-users] boost.m4 checks correct header but detects wrong header version
by Peter Schueller 11 Jan '10

11 Jan '10

Hi Tsuna, On Mon, Jan 11, 2010 at 08:30, tsuna <tsunanet(a)gmail.com> wrote: > On Mon, Aug 24, 2009 at 1:57 AM, Peter Schueller <ps(a)kr.tuwien.ac.at> wrote: >> (posting to the boost-users list and to the boost.m4 maintainer) > > Hi Peter, > sorry for the belated reply. No problem at all. >> I have several boost installations, among others a 1.34.1 in >> /usr/include and several in my homedir in >> /home/staff/ps/include/boost-1_36/ >> /home/staff/ps/include/boost-1_37/ >> /home/staff/ps/include/boost-1_39/ >> >> Calling configure with --with-boost=/home/staff/ps/include/boost-1_37/ >> I get the following information: >> >> checking for Boost headers version >= 103300... >> /home/staff/ps/include/boost-1_37/include >> checking for Boost's header version... 1_34_1 >> >> The first check finds the correct headers, the second one uses the wrong ones. > > I believe this issue has been fixed by > http://github.com/tsuna/boost.m4/commit/93faeb67fbbc5d68a397c64ebc2dddf23a9… > > Can you retry with the latest version and let me know if it still > doesn't work for you? Thank you very much, this indeed resolves the issue! > Happy new year! Happy new year to you as well! Best Regards, Peter -- Peter Schüller Vienna University of Technology, Institute of Information Systems Favoritenstrasse 9-11/1843, 1040 Wien, Austria T: +43 1 58801 18470 E: ps(a)kr.tuwien.ac.at DVR: 0005886 http://www.kr.tuwien.ac.at/staff/ps

1 0

Re: [Boost-users] [repost][serialization] version handling in{save|load}_construct_data
by JOAQUIN M. LOPEZ MUÑOZ 10 Jan '10

10 Jan '10

________________________________________ De: boost-users-bounces(a)lists.boost.org [boost-users-bounces(a)lists.boost.org] En nombre de Robert Ramey [ramey(a)rrsd.com] Enviado el: domingo, 10 de enero de 2010 20:22 Para: boost-users(a)lists.boost.org Asunto: Re: [Boost-users] [repost][serialization] version handling in{save|load}_construct_data > > I investigated a little bit more. Seems that save/load_construct data needs > the version # and there is no place else to get it. Why can't you directly use serialization::version<T>::value? This is for instance what you're doing at lines 51 and following of boost/serialization/hash_collections_save_imp.hpp. Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

Re: [Boost-users] [repost][serialization] version handling in{save|load}_construct_data
by JOAQUIN M. LOPEZ MUÑOZ 10 Jan '10

10 Jan '10

________________________________________ De: boost-users-bounces(a)lists.boost.org [boost-users-bounces(a)lists.boost.org] En nombre de Robert Ramey [ramey(a)rrsd.com] Enviado el: sábado, 09 de enero de 2010 21:40 Para: boost-users(a)lists.boost.org Asunto: Re: [Boost-users] [repost][serialization] version handling in{save|load}_construct_data > I believe that this came about when error to the serialization of > collections was discovered. Previous library versions didn't > properly save the version of the collection item. When this > was corrected, this code was needed to permit the the loading > of archives created previously. > > If the type isn't versioned (e.g. some primitive type), then the > default version # would be zero. I suppose this could be > made more elaborate so that the version # wouldn't even > be in the archive in these cases - but that's not way we did it. > > I don't know if that answers your question, but that's what > I remember about it. I'm afraid that does not entirely answer my question. I understand what the "if(3 < ar.get_library_version()){" guard is for. What puzzles is me is why you need to explicitly save the type serialization version number when this info is seemingly recovered in other contexts without any explicit user operation. Let me put it another way: consider a user defined type my_type with associated serialization code: template<class Archive> void serialize(Archive& ar,my_type & m,const unsigned int version) { ... } When serialize() is called internally by Boost.Serialization, version is correctly passed without the user explicitly saving this info as it happens in the code for collection serialization. Why this difference? Am i making myself clear as to what the root of my puzzlement is? Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 2

BOOST_FUSION_ADAPT_STRUCT
by Hicham Mouline 09 Jan '10

09 Jan '10

Hello, Can I use this macro with specialized templates as well? template <typename T> struct range { T min ; T max ; } ; BOOST_FUSION_ADAPT_STRUCT( range<double>, (double, min) (double, max) } Rds,

2 2

[BGL] dijkstra_shortest_paths with listS
by gast128 09 Jan '10

09 Jan '10

Hello all, BGL supports a lot of graph algorithms, and lots of stuff get default filled in when using vecS as container type of vertices. However things become pretty ugly when not using this container. Below I used a listS for both edges and vertices. Maybe it can help other people (and maybe somebody can cross check me). Note that some constructs could be bundled, but for clearity I explicitly wrote all things out. I use the graph from the BGL book as example (figure 13.3). void TestgraphDijkstra() { typedef boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::string> Graph; typedef boost::graph_traits<Graph>::vertex_descriptor VertexDescriptor; typedef boost::graph_traits<Graph>::edge_descriptor EdgeDescriptor; typedef int Weight; typedef std::map<EdgeDescriptor, Weight> WeightMap; typedef std::map<VertexDescriptor, size_t> VertexIndexMap; typedef std::map<VertexDescriptor, Weight> DistanceMap; typedef std::map<VertexDescriptor, VertexDescriptor> PredecessorMap; Graph graph; WeightMap mapWeigth; VertexIndexMap mapVertexIndex; DistanceMap mapDistance; PredecessorMap mapPredecessor; boost::associative_property_map<WeightMap> pmWeigth(mapWeigth); boost::associative_property_map<VertexIndexMap> pmVertexIndex (mapVertexIndex); boost::associative_property_map<DistanceMap> pmDistance(mapDistance); boost::associative_property_map<PredecessorMap> pmPredecessor (mapPredecessor); //build a graph according to figure 13.3 //add vertices const VertexDescriptor vA = boost::add_vertex(graph); const VertexDescriptor vB = boost::add_vertex(graph); const VertexDescriptor vC = boost::add_vertex(graph); const VertexDescriptor vD = boost::add_vertex(graph); const VertexDescriptor vE = boost::add_vertex(graph); //set vertex names graph[vA] = "A"; graph[vB] = "B"; graph[vC] = "C"; graph[vD] = "D"; graph[vE] = "E"; //add edges const EdgeDescriptor eAC = boost::add_edge(vA, vC, graph).first; const EdgeDescriptor eBB = boost::add_edge(vB, vB, graph).first; const EdgeDescriptor eBD = boost::add_edge(vB, vD, graph).first; const EdgeDescriptor eBE = boost::add_edge(vB, vE, graph).first; const EdgeDescriptor eCB = boost::add_edge(vC, vB, graph).first; const EdgeDescriptor eCD = boost::add_edge(vC, vD, graph).first; const EdgeDescriptor eDE = boost::add_edge(vD, vE, graph).first; const EdgeDescriptor eEB = boost::add_edge(vE, vB, graph).first; const EdgeDescriptor eEA = boost::add_edge(vE, vA, graph).first; //set edge weights boost::put(pmWeigth, eAC, 1); boost::put(pmWeigth, eBB, 2); boost::put(pmWeigth, eBD, 1); boost::put(pmWeigth, eBE, 2); boost::put(pmWeigth, eCB, 7); boost::put(pmWeigth, eCD, 3); boost::put(pmWeigth, eDE, 1); boost::put(pmWeigth, eEB, 1); boost::put(pmWeigth, eEA, 1); //build index map boost::put(pmVertexIndex, vA, 0); boost::put(pmVertexIndex, vB, 1); boost::put(pmVertexIndex, vC, 2); boost::put(pmVertexIndex, vD, 3); boost::put(pmVertexIndex, vE, 4); //note: color map not needed, because of index map? boost::dijkstra_shortest_paths(graph, vA, boost::weight_map (pmWeigth).vertex_index_map(pmVertexIndex).distance_map (pmDistance).predecessor_map(pmPredecessor)); for (DistanceMap::const_iterator itDist = mapDistance.begin(); itDist != mapDistance.end(); ++itDist) { //dump const VertexDescriptor v = itDist->first; const VertexDescriptor vPrev = mapPredecessor[v]; std::cout << "Distance(" << graph[v] << ") = " << itDist->second << ", " << "Parent(" << graph[v] << ") = " << graph[vPrev] << std::endl; } }

2 6