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

error setting up boost on visual c++ 6.0
by pedro chaparro 20 Oct '09

20 Oct '09

hi, i wanna use boost libraries over visual c++, i have followed all steps in the getting start guide for windows, but even so i get error, what could be the cause? thanks Compiling... example.cpp c:\documents and settings\juan antonio\escritorio\boost_1_40_0\boost_1_40_0\boost\aligned_storage.hpp(65) : error C2989: 'aligned_storage_imp<0,alignment_>' : template class has already been defined as a non-template class c:\documents and settings\juan antonio\escritorio\boost_1_40_0\boost_1_40_0\boost\aligned_storage.hpp(65) : error C2988: unrecognizable template declaration/definition c:\documents and settings\juan antonio\escritorio\boost_1_40_0\boost_1_40_0\boost\type_traits\floating_point_promotion.hpp(78) : fatal error C1506: unrecoverable block scoping error Error executing cl.exe. example.obj - 3 error(s), 0 warning(s) -- Ing Pedro Alonso Chaparro Valero Ciudad Politecnica de la Innovación iTEAM - Mobile Communications Group Polytechnic University of Valencia C\ Camino de Vera S/N, Edificio 8G 46022 Valencia, Spain

4 3

[pool] Singleton implementation
by Paul Byrne 20 Oct '09

20 Oct '09

Hi all, I am interested to find a sound C++ implementation of a Singleton, and have attempted to find one within the Boost libraries. It seems that "pool/detail/singleton.hpp" would fit the bill for me, but (as I understand it) this class/header is not intended for direct use by library users. Have I overlooked a good alternative within the Boost suite? Thanks, Paul

6 7

building boost with python script
by Michał Nowotka 20 Oct '09

20 Oct '09

Hello I want to build boost library with python scrpt(s) (maybe SCons shuld be used). Or maybe someone has already done so - I don't want to reinvent the wheel. -- Regards Michał Nowotka

1 0

[Boost.Python] Using Inheritance *and* Virtual Functions in a Python Binding
by Dan Bailey 20 Oct '09

20 Oct '09

Hi, I can't seem to get inheritance and virtual functions to work together in a simple python binding: #include <boost/python.hpp> using namespace boost::python; struct Base { virtual ~Base() { } void nonVirtualFunc() { } virtual void virtualFunc() { } }; struct Derived : public Base { ~Derived() { } void virtualFunc() { } }; struct BaseWrap: public Base, public wrapper<Base> { void virtualFunc() { if (override virtualFunc = this->get_override("virtualFunc")) virtualFunc(); else Base::virtualFunc(); } void default_virtualFunc() { this->Base::virtualFunc(); } }; BOOST_PYTHON_MODULE(test) { class_<Base, boost::noncopyable>("__Base") .def("nonVirtualFunc", &Base::nonVirtualFunc) ; class_<BaseWrap, boost::noncopyable>("Base") .def("virtualFunc", &Base::virtualFunc, &BaseWrap::default_virtualFunc) ; class_<Derived, bases<Base> >("Derived") .def("virtualFunc", &Derived::virtualFunc) ; } Now in my python interpreter: >>> import test >>> dir(test.__Base) [<built-ins>, 'nonVirtualFunc'] >>> dir(test.Base) [<built-ins>, 'virtualFunc'] >>> dir(test.Derived) [<built-ins>, 'virtualFunc'] Without using BaseWrap to do the virtual functions: >>> dir(test.Derived) [<built-ins>, 'nonVirtualFunc', 'virtualFunc'] It seems that by using the boost python wrapper, I now lose any inherited functions, and the nonVirtualFunc does not get defined in the subclasses. I may be going about this in the wrong way, but is there a way of using inheritance and virtual functions together? Thanks, Dan

1 0

poor boost::mpi performance
by Jonas Juselius 20 Oct '09

20 Oct '09

Hi! I'm using the boost::mpi library for a HPC project. I really like the interface, but I'm currently getting very poor performance from the library. I started out by serializing my objects (which are full of pointers and allocated memory, and what not), but that didn't perform at all, so I went for a more brute force approach instead. No luck there either. Essentially what I want to do in a typical case, is to send a set of indexes (4 integers) followed by an array of doubles. The arrays sizes are fixed at startup, and have a size between 10-60 kB each. There are usually many of these arrays, and the total amount of data to be communicated at the end of a calculation is of the order of 1GB. Here is my current implementation: 1) Pack the indexes into an array of 4 integers and send (or broadcast) to the receiver(s). The receiver figures out where to store the next packet based on the indexes (this takes next to no time). 2) Send the array to the receivers using: double *data = coefs->data(); world.send(who, tag, data, nCoefs); where coefs is a pointer to an Eigen2 vector, and data is a pointer to a contiguous array of doubles. I'm running the code on a big HPC cluster with individual nodes with 8 cores and 16 GB memory, all connected with Infiniband. Using this setup I achieve a maximum transfer rate of 66 MB/s doing all to one communication, which is approx. 10 times less than what I'm supposed to get. I will not even mention how long a broadcast takes, but suffice to say that it takes 20-25 times longer than doing the calculation. I get the same poor performance regardless of whether I'm communicating only over 127.0.0.1 or over the net. Since out environment is homogeneous, I have compiled the both the mpi library and my program defining the BOOST_MPI_HOMOGENEOUS macro. I will try to batch more packages into larger units, but earlier experiences (with basic MPI) has shown that with 65 kB arrays, transfer rates of 1 GB/s are possible over our Infiniband switch. Asynchronous transfer is an option, but that complicates the load balancing algorithms to a point where I really don't want to go unless under gun point. Any suggestions? Best regards, -jonas- -- ________________________________________________________________________ Dr. Jonas Jusélius Centre for Theoretical and E-mail : jonas.juselius(a)uit.no Computational Chemistry Telephone : +47 77644079 Department of Chemistry Fax : +47 77644765 University of Tromsø Mobile ph.: +47 47419869 N-9037 Tromsø, NORWAY http://jonas.iki.fi _______________________________________________________________________ [ PGP key : keyserver or http://jonas.iki.fi/pubkey.asc ] [ Fingerprint: 2516 A57A 3012 7962 287D B66E C1A9 157F 0A59 7A66 ]

2 2

invalid argument?
by pedro chaparro 20 Oct '09

20 Oct '09

hi, i working on the creation of a co-simulation framework , for that i'm using asio libraries and serialization to send exchange information between simulators, i'm getting a error that say me " invalid argument" but just that, i dont know about what argument is refered =(. some know which could be the cause(s)?thanks -- Ing Pedro Alonso Chaparro Valero Ciudad Politecnica de la Innovación iTEAM - Mobile Communications Group Polytechnic University of Valencia C\ Camino de Vera S/N, Edificio 8G 46022 Valencia, Spain

3 6

[Boost.Python] Binding overloaded static functions
by Dan Bailey 20 Oct '09

20 Oct '09

Hi, I'm sure this is really trivial, but I'm not sure how to handle overloaded static functions with Boost.Python, and I can't figure it out by going through the documentation. Here's the simple example I'm trying to compile: #include <boost/python.hpp> using namespace boost::python; class Test { public: Test() { } ~Test() { } static bool func(); static bool func(int a); }; BOOST_PYTHON_MODULE(test) { bool (Test::*func1)() = &Test::func); class_<Test>("Test") //.def("func", func1) ; } Error: src/main.cpp: In function 'void init_module_test()': src/main.cpp:18: error: no matches converting function 'func' to type 'bool (class Test::*)()' src/main.cpp:12: error: candidates are: static bool Test::func() src/main.cpp:13: error: static bool Test::func(int) How do I do this? Thanks, Dan

2 1

[Spirit] How to use the scanner against UTF-8 characters
by HT4N - 20 Oct '09

20 Oct '09

Is it possible to customize the scanner in Spirit to parse UTF-8 characters? I can't seem to find any notes in the documentation specific to handling UTF-8 encoding. Thanks HT _________________________________________________________________ Hotmail: Powerful Free email with security by Microsoft. http://clk.atdmt.com/GBL/go/171222986/direct/01/

2 1

random
by Robert Ramey 19 Oct '09

19 Oct '09

I'm interested in using the functionaliy from the random library. I arm wrestled with the documentation and couldn't get my ap to compile. of the first page of the documentation. I checked the test matrix and the library is showing no errors. So I just tried to compile random_demo.cpp mentioned in the forth line. I got a bunch of cryptic (to me) warnings. I don't think this should happen. They are just warnings so I suppose they are irrelevant to my own problems but still it's annoying. Robert Ramey Compiling... generate_test_data.c c:\BoostRelease\boost\random\detail\pass_through_engine.hpp(49) : warning C4512: 'boost::random::detail::pass_through_engine<UniformRandomNumberGenerator>' : assignment operator could not be generated with [ UniformRandomNumberGenerator=boost::random::linear_congruential<boost::int32_t,48271,0,2147483647,399268537> ] c:\BoostRelease\boost\random\variate_generator.hpp(92) : see reference to class template instantiation 'boost::random::detail::pass_through_engine<UniformRandomNumberGenerator>' being compiled with [ UniformRandomNumberGenerator=boost::random::linear_congruential<boost::int32_t,48271,0,2147483647,399268537> ] c:\Projects\vario\test_windspeed\generate_test_data.c(32) : see reference to class template instantiation 'boost::variate_generator<Engine,Distribution>' being compiled with [ Engine=base_generator_type &, Distribution=distribution_type ]

2 2

[bitfield] Pre-review request
by vicente.botet 19 Oct '09

19 Oct '09

Hi all, I have adapted the Boost.Bitfield library from Emile Cormier with its permision and I have requested the Review Wizards to include Boost.Bitfield on the review schedule. The library is now quite stable. Even if there were not too much interest in the Boost ML, only 140 dowloads from the Boost Vault, the version on which it is based had more that 1500 downloads, so I suppose that the subject interest a lot of people. I really think Boost.Bitfield is the complement the Boost.Endian library to manage with all the endian issue, allowing to mange not only endian interger issues, but also endian bitfield issues. I hope that including it on the review schedule will generate more interest and help me to improve the library. I would appreciate it if people could participate to this Pre-review, reading the documentation, testing on their compiler, .... Every comment is wellcome. BTW, I'm looking for a review manager. Thanks for all, Vicente Boost.Bitfield Author(s): Vicente J. Botet Escribá, Emile Cormier Download: `Boost Vault: <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=bitfie…> Boost Sandbox: https://svn.boost.org/svn/boost/sandbox/bitfield Documentation: https://svn.boost.org/svn/boost/sandbox/bitfield/libs/bitfield/doc/index.ht… Html doc also included the Vault package Categories: Portability, Integer Description: Portable bitfields traits. Boost.Bitfield consists of: * a generic bitfield traits class providing generic getter and setter methods. * a BOOST_BITFIELD_DCL macro making easier the definition of the bitfield traits and the bitfield getter and setter functions. Example declaration: struct Rgb565 { uint16_t storage; BOOST_BITFIELD_DCL(uint16_t, storage, unsigned char, red, 0, 4); BOOST_BITFIELD_DCL(uint16_t, storage, unsigned char, green, 5, 10); BOOST_BITFIELD_DCL(uint16_t, storage, unsigned char, blue, 11,15); }; Example usage: Rgb565 r; r.storage= 0xffff; // Write to a bitfield. Note that parenthesis are needed around the bitfield r.red() = 23; // Read from a bitfield unsigned char b = r.blue(); In a near future the library could add the following if the users consider it useful. * Add bitfields group * Used to easily manipulate groups of bitfields the same way as does C bitfields, but in a portable manner. Example declaration: struct Rgb565 { struct red {}; struct green {}; struct blue {}; typedef bitfields<mpl::vector< member<unsigned char, red, 5>, member<unsigned char, green, 6>, member<unsigned char, blue, 5> > > type; }; Example usage: Rgb565::type r = make_bitfields<Rgb565::type, 1,2,3>; // Write to a bitfield. r.get<Rgb565::red>() = 23; //or r.set<Rgb565::red>(23); // Read from a bitfield Rgb565::at<Rgb565::blue>::value_type b = r.get<Rgb565::blue>(); * Add pointer_plus_bits * Based on a.. The article of Joaquin Optimizing red-black tree color bits, b.. the implementation of Ion pointer_plus_bits from Boost.Intrusive , and c.. Clang's QualType smart pointer This class will allows to use the unsused bits of a pointer to reduce the size of the nodes containing pointers and bits and sometimes improving also the performances. I have not reached yet the interface I would like to have. For the moment we can do typedef pointer_plus_bits<int*,1,bool>::type pint_and_bool; int i=0; pint_and_bool v1; ASSERT_EQUALS(v1.pointer(),0); ASSERT_EQUALS(v1.small_int(),false); pint_and_bool v2(&i, true); ASSERT_EQUALS(v2.pointer(),&i); ASSERT_EQUALS(v2.small_int(),true); v1.pointer()=v2.pointer(); v1.small_int()=true; ASSERT_EQUALS(v1.pointer(),&i); ASSERT_EQUALS(v1.small_int(),true); typedef pointer_plus_bits< pointer_plus_bits<int*,1,bool>::type ,1, bool>::type pint_and_bool_bool pint_and_bool_bool v1; ASSERT_EQUALS(v1.small_int(),false); ASSERT_EQUALS(v1.pointer().get_pointer(),0); ASSERT_EQUALS(v1.get_pointer().get_pointer(),0); ASSERT_EQUALS(v1.get_pointer().small_int(),false);

1 0

[interthreads] Pre-review request
by vicente.botet 19 Oct '09

19 Oct '09

Hi, I have requested the Review Wizards to include Boost.Interthreads library on the review schedule. Even if there were not too much interest for this library on this ML, there were more than 1000 dowloads from the Boost Vault. I'm open to reduce the scope of the library, if there are some parts that are not enough generic. I would appreciate it if people could participate to this Pre-review, reading the documentation, testing on their compiler, .... Every comment will help me a lot to improve the library. BTW, I'm looking for a review manager. Thanks in advance, Vicente InterThreads __________ :Author: Vicente J. Botet Escribá :Review Manager: ??? :Download: `Boost Vault: <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=intert…> Boost Sandbox: https://svn.boost.org/svn/boost/sandbox/interthreads Documentation: https://svn.boost.org/svn/boost/sandbox/interthreads/libs/interthreads/doc/… Html doc also included the Vault package :Description: Boost.InterThreads extends Boost.Threads adding thread setup/cleanup decorator, thread specific shared pointer, thread keep alive mechanism and thread tuples. * thread decorator: thread_decorator allows to define setup/cleanup functions which will be called only once by thread: setup before the thread function and cleanup at thread exit. * thread specific shared pointer: this is an extension of the thread_specific_ptr providing access to this thread specific context from other threads. As it is shared the stored pointer is a shared_ptr instead of a raw one. * thread keep alive mechanism: this mechanism allows to detect threads that do not prove that they are alive by calling to the keep_alive_point regularly. When a thread is declared dead a user provided function is called, which by default will abort the program. * thread tuple: defines a thread groupe where the number of threads is know statically and the threads are created at construction time. * set_once: a synchonizer that allows to set a variable only once, notifying to the variable value to whatever is waiting for that. * thread_tuple_once: an extension of the boost::thread_tuple which allows to join the thread finishing the first, using for that the set_once synchronizer. * thread_group_once: an extension of the boost::thread_group which allows to join the thread finishing the first, using for that the set_once synchronizer. (thread_decorator and thread_specific_shared_ptr) are based on the original implementation of threadalert written by Roland Schwarz.

1 0

Re: [Boost-users] asio stability and scalability
by Marat Abrarov 19 Oct '09

19 Oct '09

At least at Windows asio is the best - better then ACE proactor because of strands and custom memory allocation support for them. You may look at http://sourceforge.net/projects/asio-samples/ for more complex echo server than the asio examples have. Stack corruption may be because of wrong lifetime of used objects... and it may be not seen and debug because of different time scale. Regards, Marat.

1 0

Iterators and subclasses
by Swerts, Benjamin 19 Oct '09

19 Oct '09

Hello all, I'm trying to create a base class that provides 2 iterators (begin/end). These will be used to iterate over data structures that will be provided by subclasses. These data structures are completely unrelated. Normally this can be solved using virtual functions but the problem is that iterators are normally returned by value so I cannot go that route. My concrete problem: struct Point { int x, y; }; class PointIterator : public boost::iterator_facade<PointIterator, const Point, boost::random_access_traversal_tag, Point>; class PointCollection { public: typedef PointIterator const_iterator; const_iterator begin(); const_iterator end(); }; >From the PointCollection base class I want to derive concrete implementations: class Collection1 : public PointCollection { public: Collection1(char* data, size_t size) : data_(data), size_(size) {}; private: char* data_; size_t size_; }; Collection1 would return a Point with x = data_[index] and y = index * 1000, for example. Other subclasses might contain 2 vectors or just generated values. In my first attempt I tried to subclass the iterator too and make it return the correct Point when the iterator is dereferenced. As the iterators are returned by value, however, the subclass was sliced right off. An iterator-less solution is easy: class PointCollection { public: virtual Point getPoint(size_t index) const = 0; virtual size_t size() const = 0; }; Easily subclassed but no iterator support. How would I solve this problem with iterators? Should I implement another iterator over them that doesn't know about the actual types of the iterators? Can indirect_iterator help me in any way? Thanks a lot in advance! Greets, Ben

4 4

Boost 1.40.0: How to get 'libboost_regex-vc90-mt-sgd-1_40.lib' for VC++ 2008?
by Thomas Schuster 19 Oct '09

19 Oct '09

Hello, just installed Boost 1.40.0 and created all libs unsing booststtrap and .\bjam Compiling an example which uses boost regex all works fine, lib 'libboost_regex-vc90-mt-gd-1_40.lib' was linked to. Im using Visual C++ 2008 Express Edition with SP1 But I would like to create a stand allone exe.file, so I changed the MS Visual C++ 2008 configuration to Multithread (/MT) Obviously this will cause the linker to search for the lib 'libboost_regex-vc90-mt-sgd-1_40.lib' which ist not available within the Boost sub-folder 'stage'. May I ask how I can create the 'libboost_regex-vc90-mt-sgd-1_40.lib' ? Or ist there a website avaliable where I can download it for Boost 1.40.0 and Visual C++ 2008 ? Many thanks for any hint. Regards Sergeant 666

5 4

[BGL] Knight's Tour Example
by Brian Troutwine 19 Oct '09

19 Oct '09

The Knight's Tour Example given in Siek, Lee and Lumsdaine's book on the BGL will not compile due to a cyclical dependency between knight_adjacency_iterator and knights_tour_graph. Would someone help me to resolve this? This is the only implicit graph example given in the text and I would very much like to learn from it. The text does not give a complete program, only a subset. I was unable to find a complete listing anywhere and have attached a version typed by myself to this email. Thank you, Brian Troutwine ps. I would appreciate pointers to further (ideally functioning) examples of implicit graphs in the BGL. The A-Star search documentation notes its usefulness for them but fails to provide any functional example of running the algorithm over such a graph.

2 2

boost_python-vc90-mt-gd-1.39.dll not found?
by Tanja Zarić 19 Oct '09

19 Oct '09

Hello, I am new to Boost. Python. I am trying to integrate Python with C++ by using Boost Python library. I have used Boost 1.39.0, Boost Jam 3.1.17 and Python 2.5.4. I have problem running example so I would be grateful if someone helps me to solve it. I have built Boost Build with Bjam, using msvc ang gcc tool sets, according to this link: http://www.boost.org/doc/libs/1_40_0/libs/python/doc/building.html with C:\boost_1_39_0\…\quickstart> bjam toolset=msvc --verbose-test test and similar later C:\boost_1_34_0\…\quickstart> bjam toolset=gcc --verbose-test test It have passed the test. I have navigated to C:\boost\boost_1_39_0\libs\python\example\quickstart\bin\msvc-9.0\debug\threading-multi or similar C:\boost\boost_1_39_0\libs\python\example\quickstart\bin\gcc-mingw-3.4.5\debug, started python and tried to import extending module, but I got following error: " This application has failde to start because boost_python-vc90-mt-gd-1.39.dll was not found. Re-installing the application may fix the problem." or similar error message for gcc... I tried to solve by solution : http://selcuk-ozturk.com/post/2009/09/15/C2b2b-and-Python-with-BoostPython-… Still there is same error message. Anyone have idea? -- Tanja Zaric

2 1

[interprocess] Is there a bug in spinlock atomic implementations 1.39 and 1.40?
by Sakharuk, Vladimir 19 Oct '09

19 Oct '09

Hi all > In both: > > boost/detail/spinlock_sync.hpp > boost/detail/smart_ptr/spinlock_sync.hpp > > > Spinlock does not has constructor, so it is possible to have > spinlock::v_ uninitialized and not to equal zero. > That means it may be locked by default and call below will always > return false... > bool try_lock() > { > int r = __sync_lock_test_and_set( &v_, 1 ); > return r == 0; > } > Am I missing something? > > Adding > Spinlock(): v_(0) {} > Looks like solves my issue. > g++ 4.1.2 on suse 2.6.16.46 > > Regards Vlad. > =============================================================================== Please access the attached hyperlink for an important electronic communications disclaimer: http://www.credit-suisse.com/legal/en/disclaimer_email_ib.html ===============================================================================

3 3

DAG Graph Search
by Dan Bailey 19 Oct '09

19 Oct '09

Hi, I'm looking to do a downstream search over a DAG graph where I never advance past a node until all of the nodes linking to it have been seen. Clearly a breadth first search won't work, but using a topological sort, I can get a list of all the nodes in the correct order. However I only wish to search over the nodes downstream from any particular node (until I reach the leaf nodes), which doesn't work as this is the entire network even if it contains various sub-graphs. Is there a better algorithm or approach I can use to do this? Here's a simple example: a -> b b -> c c -> d a -> c I wouldn't ever want to look at c before b, but if I started at b for example, I would only want to see downstream of this. Any help would be appreciated, Cheers, Dan

2 4

multi_index_comtainer questions
by Vladimir Voronkov 19 Oct '09

19 Oct '09

Hi, All, I just have started using boost and have some questions, answers on that i couldn’t find in the documentation. My interest is in using multi_index_container as combination of advantages of standard bidirectional list as well as fast lookup (insertion) of standard associative container (particularly set). Let’s say we have the following definitions: typedef boost::multi_index_container< UserInfo, boost::multi_index::indexed_by< boost::multi_index::sequenced<>, boost::multi_index::ordered_unique< boost::multi_index::identity<UserInfo>, UserInfoLess> > > UsersContainer; typedef UsersContainer::nth_index<0>::type UsersList; typedef UsersContainer::nth_index<1>::type UsersSet; Now we want to insert some value into this container the following way: UsersSet& setIndex = m_Users.get<1>(); std::pair<UsersSet::iterator, bool> insRet = setIndex.insert(someVal); The question is how can i acquire iterator of m_Users having the iterator UsersSet::iterator ? Do iterators keep the property of set’s iterators that they remain valid after insertion of an element? Thanks for the answers, Vladimir Voronkov.

4 7

[boost::tokenizer] scope error usage of object run under win32 CL, ICL but fails under linux32 gcc
by Patryk Bukowinski 19 Oct '09

19 Oct '09

Hi all, I've some weird problem, its probably simple thing, but I'm probably to tired to find it out. g++ throws me following error : *getFunc.h: In static member function ‘static void Logic::setFunctionNameFromStringMsg(const char*, char*, unsigned int, unsigned int)’:* *getFunc.h:86: error: ‘tok’ was not declared in this scope * Code looks like this: *static void setFunctionNameFromStringMsg(const char *fTab, char *dst, unsigned int msg_size, unsigned int buf_size)** ** {** ** std::string msg_copy(fTab,msg_size);** **boost::char_separator<char> sep("[]@\n\r\t "); ** ** boost::tokenizer<boost::char_separator<char>> tok(msg_copy, sep);** ** std::string resFunc;** ** ....* * ....* *//line 86** ** if(tok.begin() != tok.end()) // check is there any function** ** {** ** resFunc=*(tok.begin());** **......* Funny thing is that there are no problems during CL and intel compilers win32 processing. Thanks for any advice. * * * *

2 2

[iostreams] Can you flush yourself from within a stream?
by Adam Nielsen 19 Oct '09

19 Oct '09

Hi all, I have a class used as a Boost iostream: boost::iostreams::stream<my_stream> ms; The my_stream class implements a couple of extra methods (one example being to insert a block of data in the middle of the stream) however the stream does not get flushed before the call to these extra functions, which results in corrupted data: ms.write("1234", 4); ms.seekp(-2, std::ios::cur); ms->insert(2); // my_stream method This should result in "12__34", but unfortunately because of buffering, the insert() ends up happening before the write(), leaving you with just "1234". The problem is solved by flushing the cache all over the place: ms.write("1234", 4); ms.flush(); ms.seekp(-2, std::ios::cur); ms->insert(2); ms.flush(); However this isn't really ideal. I would rather the insert() function was able to flush itself before manipulating the underlying stream. Is this possible? Or am I going about this in entirely the wrong way?? ;-) Many thanks, Adam. -- class my_stream { public: typedef char char_type; typedef io::seekable_device_tag category; ...

1 0

[graph][test][assign] warning in boost graph
by Andrey Torba 19 Oct '09

19 Oct '09

Hello All! In my unit tests i use Graph, Test and Assign libraries (boost 1.39, MSVC 2005). This is an example to reproduce warning: #include <boost/graph/topological_sort.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/assign.hpp> #include <vector> //#include <boost/test/unit_test.hpp> int main() { typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS> G; typedef boost::graph_traits<G>::vertex_descriptor V; typedef std::map<V, boost::default_color_type> Map; G g; std::vector<V> sorted; Map m; boost::add_vertex(g); boost::topological_sort(g, std::back_inserter(sorted), color_map(boost::make_assoc_property_map(m))); //boost::assign::list_of<V>(0); return 0; } I noticed that when i uncomment both `#include <boost/test/unit_test.hpp>` and `boost::assign::list_of<V>(0);` the warning occur: boost\graph\depth_first_search.hpp(200) : warning C4267: 'argument' : conversion from 'size_t' to 'unsigned int', possible loss of data if one of the string is absent there is no warning. Any thoughts? -- Regards, Andrey

1 0

Problem with binary serialization using std::wstring
by Macumber, Daniel 19 Oct '09

19 Oct '09

My project is using std::wstring extensively and I have been able to get both the text and xml serialization archives to work with it. However, I am getting a stream_error when trying to deserialize objects written to a binary archive. I think the serialization may be missing some objects. I have tracked the problem down to serializing a std::map<std::wstring, shared_ptr<IddKey>, iStringCompare> where IddKey is a class that supports serialization and iStringCompare is: struct iStringCompare{ bool operator()(const std::wstring& x, const std::wstring& y) const{ return boost::lexicographical_compare(x, y, boost::is_iless()); }; }; I have tried to replicate this problem in a simple test case to submit but have not been able to reproduce it outside of my real code. Here is the code that serializes to a binary archive: boost::filesystem::wpath path = iddPath; path.replace_extension(L"idd.bin"); { boost::filesystem::ofstream ofs(path); boost::archive::binary_oarchive out(ofs); out << iddFilePtr; } IddFilePtr newIddFilePtr; { boost::filesystem::ifstream ifs(path); boost::archive::binary_iarchive in(ifs); in >> newIddFilePtr; } I am not using binary_woarchive or binary_wiarchive because they don't compile with shared_ptr serialization and I have seen that you are not really supposed to use them. I am using the wstring versions of the text and xml archives that are working. Does anyone have any suggestions on how to track down my problem? Dan

2 1

Problem with binary serialization using std::wstring
by Macumber, Daniel 19 Oct '09

19 Oct '09

Just as the docs said, using ios::binary when opening the file worked. Thanks, Dan

1 0

[BGL] Using custom planar embedding
by Vicente Helano 18 Oct '09

18 Oct '09

Dears, I would like to use a custom embedding for a planar graph in order to pass it to the planar_face_traversal algorithm, but I couldn't get my code compiled yet (see the attachments). Could someone help me, please? Best regards, Vicente.

2 4

How to run boost library's test cases
by Christian Henning 18 Oct '09

18 Oct '09

Hi there, I have been skimming google and the boost website for a while now but I cannot figure out how to execute the test cases for a specific library? Is that done using bjam? If someone can help me out here it would be very helpful. BTW, I tried to run the regression test but the run.py script doesn't like the proxy I'm sitting behind. Thanks, Christian

2 1

Signal handler for Unix platforms
by Boris Schaeling 18 Oct '09

18 Oct '09

Here's another Boost.Asio extension: http://www.highscore.de/boost/signal_handler.zip It provides a new I/O object to handle Unix signals. It supports blocking and asynchronous I/O operations. Again this I/O object can be used like any other I/O object from Boost.Asio. The ZIP file also contains test cases (which can be used as a documentation). There are altogether only four methods though (add_signal, remove_signal, wait and async_wait). There was another signal handler proposed before (see https://svn.boost.org/trac/boost/ticket/2879) I've uploaded my signal handler to the Boost Trac, too. The main difference is that this new signal handler is based on the Boost.Asio design guidelines (separation of I/O object, service and implementation). As far as I see the signal handler proposed before doesn't support blocking operations either. Boris

1 0

[boost::spirit] Help! Unexpected Leading spaces got injected into a parse tree node
by HT4N - 18 Oct '09

18 Oct '09

I have a question regarding unexpected leading spaces got injected into a parse tree node. Here is my grammar: Text = leaf_node_d[+digit_p] >> root_node_d[ch_p('=')] >> leaf_node_d[+digit_p]; If I parse "5=5", as expected no extra leading spaces added to the resulting tree nodes. If I parse "5= 5" (read:5 followed by = followed by 4 spaces and followed by 5), given my grammar definition of leaf_node_d[+digit_p], I am expecting the parse tree node value should not contain any leading spaces. Yet, I see that the extra 4 spaces is stored in the corresponding parse tree node as shown below. <?xml version="1.0" encoding="ISO-8859-1"?> <!DOCTYPE parsetree SYSTEM "parsetree.dtd">  <parsetree version="1.0"> <parsenode> <parsenode> <value>5</value> </parsenode> <parsenode> <value is_root="1">=</value> </parsenode> <parsenode> ==> <value> 5</value> </parsenode> </parsenode> </parsetree> I am wondering if this is a by design or unexpected behavior. If it is a by design behavior, is there a way to trim leading/trailing spaces. Thanks! Your E-mail and More On-the-Go. Get Windows Live Hotmail Free. Sign up now. _________________________________________________________________ Hotmail: Powerful Free email with security by Microsoft. http://clk.atdmt.com/GBL/go/171222986/direct/01/

3 3

[BGL] error defining subgraph
by Luqman Hodgkinson 18 Oct '09

18 Oct '09

typedef subgraph< adjacency_list<vecS, vecS, undirectedS, Protein, PPI > > PPIGraph; PPIGraph flyGraph; gives error invalid application of 'sizeof' to incomplete type 'boost::STATIC_ASSERTION_FAILURE<false>' Does anyone know what the problem is? Best wishes, Luqman

2 2

BGL and property maps
by Luqman Hodgkinson 18 Oct '09

18 Oct '09

Hello. In the Boost Graph Library, I need to map between two separate graphs where the IDs for the nodes are identical. I am unsure how to do this. It seems the property maps only allow mapping from vertex and edge descriptors to properties. How do we invert this? That is, how can we map from properties to vertex descriptors? If I have a vertex descriptor in one graph, I can map it to the vertex name-property, but then I want to map the vertex-name property to a vertex descriptor for the other graph. Please help. Best wishes, Luqman

2 1

Linker errors with stlportstld.5.2.lib
by Mangal 18 Oct '09

18 Oct '09

Hi I have a simple test program which compiles in Release mode. I understand in debug mode I have to define __STL_DEBUG as boost libs are built with that symbol in debug mode. Defining that symbol forces me to link against stlportstld.5.2.lib version of stlport. On doing that I get several linker errors: 1>StlPort_Test.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: __thiscall stlpdmtx_std::priv::__owned_list::~__owned_list(void)" (__imp_??1__owned_list@priv@stlpdmtx_std@@QAE@XZ) referenced in function "public: __thiscall stlpdmtx_std::vector<int,class stlpdmtx_std::allocator<int> >::~vector<int,class stlpdmtx_std::allocator<int> >(void)" (??1?$vector@HV?$allocator@H@stlpdmtx_std@@@stlpdmtx_std@@QAE@XZ) 1>StlPort_Test.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: __thiscall stlpdmtx_std::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >::~basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >(void)" (__imp_??1?$basic_string@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@stlpdmtx_std@@QAE@XZ) referenced in function __unwindfunclet$??0?$basic_path@V?$basic_string@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@stlpdmtx_std@@Upath_traits@filesystem@boost@@@filesystem@boost@@QAE@PBD@Z$0 1>libboost_system-vc90-mt-gdp-1_40.lib(error_code.obj) : error LNK2001: unresolved external symbol "__declspec(dllimport) public: __thiscall stlpdmtx_std::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >::~basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >(void)" (__imp_??1?$basic_string@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@stlpdmtx_std@@QAE@XZ) 1>StlPort_Test.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: __thiscall stlpdmtx_std::allocator<char>::~allocator<char>(void)" (__imp_??1?$allocator@D@stlpdmtx_std@@QAE@XZ) referenced in function "public: __thiscall boost::filesystem::basic_path<class stlpdmtx_std::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >,struct boost::filesystem::path_traits>::basic_path<class stlpdmtx_std::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >,struct boost::filesystem::path_traits>(char const *)" (??0?$basic_path@V?$basic_string@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@stlpdmtx_std@@Upath_traits@filesystem@boost@@@filesystem@boost@@QAE@PBD@Z) 1>libboost_system-vc90-mt-gdp-1_40.lib(error_code.obj) : error LNK2001: unresolved external symbol "__declspec(dllimport) public: __thiscall stlpdmtx_std::allocator<char>::~allocator<char>(void)" (__imp_??1?$allocator@D@stlpdmtx_std@@QAE@XZ) 1>StlPort_Test.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: __thiscall stlpdmtx_std::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >(class stlpdmtx_std::allocator<char> const &)" (__imp_??0?$basic_string@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@stlpdmtx_std@@QAE@ABV?$allocator@D@1@@Z) referenced in function "public: __thiscall boost::filesystem::basic_path<class stlpdmtx_std::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >,struct boost::filesystem::path_traits>::basic_path<class stlpdmtx_std::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >,struct boost::filesystem::path_traits>(char const *)" (??0?$basic_path@V?$basic_string@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@stlpdmtx_std@@Upath_traits@filesystem@boost@@@filesystem@boost@@QAE@PBD@Z) 1>StlPort_Test.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: __thiscall stlpdmtx_std::allocator<char>::allocator<char>(void)" (__imp_??0?$allocator@D@stlpdmtx_std@@QAE@XZ) referenced in function "public: __thiscall boost::filesystem::basic_path<class stlpdmtx_std::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >,struct boost::filesystem::path_traits>::basic_path<class stlpdmtx_std::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >,struct boost::filesystem::path_traits>(char const *)" (??0?$basic_path@V?$basic_string@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@stlpdmtx_std@@Upath_traits@filesystem@boost@@@filesystem@boost@@QAE@PBD@Z) 1>libboost_system-vc90-mt-gdp-1_40.lib(error_code.obj) : error LNK2001: unresolved external symbol "__declspec(dllimport) public: __thiscall stlpdmtx_std::allocator<char>::allocator<char>(void)" (__imp_??0?$allocator@D@stlpdmtx_std@@QAE@XZ) 1>StlPort_Test.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: static void __cdecl stlpdmtx_std::priv::__stl_debug_engine<bool>::_VerboseAssert(char const *,int,char const *,int)" (__imp_?_VerboseAssert@?$__stl_debug_engine@_N@priv@stlpdmtx_std@@SAXPBDH0H@Z) referenced in function "public: int & __thiscall stlpdmtx_std::vector<int,class stlpdmtx_std::allocator<int> >::operator[](unsigned int)" (??A?$vector@HV?$allocator@H@stlpdmtx_std@@@stlpdmtx_std@@QAEAAHI@Z) 1>StlPort_Test.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: __thiscall stlpdmtx_std::priv::__owned_list::__owned_list(void *)" (__imp_??0__owned_list@priv@stlpdmtx_std@@QAE@PAX@Z) referenced in function "public: __thiscall stlpdmtx_std::vector<int,class stlpdmtx_std::allocator<int> >::vector<int,class stlpdmtx_std::allocator<int> >(class stlpdmtx_std::allocator<int> const &)" (??0?$vector@HV?$allocator@H@stlpdmtx_std@@@stlpdmtx_std@@QAE@ABV?$allocator@H@1@@Z) 1>StlPort_Test.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: static void __cdecl stlpdmtx_std::__node_alloc::deallocate(void *,unsigned int)" (__imp_?deallocate@__node_alloc@stlpdmtx_std@@SAXPAXI@Z) referenced in function "public: void __thiscall stlpdmtx_std::allocator<int>::deallocate(int *,unsigned int)" (?deallocate@?$allocator@H@stlpdmtx_std@@QAEXPAHI@Z) 1>StlPort_Test.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: static void __cdecl stlpdmtx_std::priv::__stl_debug_engine<bool>::_Assert(char const *,char const *,int)" (__imp_?_Assert@?$__stl_debug_engine@_N@priv@stlpdmtx_std@@SAXPBD0H@Z) referenced in function "public: void __thiscall stlpdmtx_std::allocator<int>::deallocate(int *,unsigned int)" (?deallocate@?$allocator@H@stlpdmtx_std@@QAEXPAHI@Z) 1>StlPort_Test.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: bool __thiscall stlpdmtx_std::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >::empty(void)const " (__imp_?empty@?$basic_string@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@stlpdmtx_std@@QBE_NXZ) referenced in function "public: bool __thiscall boost::filesystem::basic_path<class stlpdmtx_std::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >,struct boost::filesystem::path_traits>::empty(void)const " (?empty@?$basic_path@V?$basic_string@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@stlpdmtx_std@@Upath_traits@filesystem@boost@@@filesystem@boost@@QBE_NXZ) 1>StlPort_Test.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: class stlpdmtx_std::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> > & __thiscall stlpdmtx_std::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >::operator+=(char)" (__imp_??Y?$basic_string@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@stlpdmtx_std@@QAEAAV01@D@Z) referenced in function "private: void __thiscall boost::filesystem::basic_path<class stlpdmtx_std::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >,struct boost::filesystem::path_traits>::m_append_separator_if_needed(void)" (?m_append_separator_if_needed@?$basic_path@V?$basic_string@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@stlpdmtx_std@@Upath_traits@filesystem@boost@@@filesystem@boost@@AAEXXZ) 1>StlPort_Test.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: struct stlpdmtx_std::priv::_DBG_iter<class stlpdmtx_std::priv::_NonDbg_str<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >,struct stlpdmtx_std::priv::_DbgTraits<struct stlpdmtx_std::_Nonconst_traits<char> > > __thiscall stlpdmtx_std::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >::end(void)" (__imp_?end@?$basic_string@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@stlpdmtx_std@@QAE?AU?$_DBG_iter@V?$_NonDbg_str@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@priv@stlpdmtx_std@@U?$_DbgTraits@U?$_Nonconst_traits@D@stlpdmtx_std@@@23@@priv@2@XZ) referenced in function "private: void __thiscall boost::filesystem::basic_path<class stlpdmtx_std::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >,struct boost::filesystem::path_traits>::m_append_separator_if_needed(void)" (?m_append_separator_if_needed@?$basic_path@V?$basic_string@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@stlpdmtx_std@@Upath_traits@filesystem@boost@@@filesystem@boost@@AAEXXZ) 1>StlPort_Test.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: __thiscall stlpdmtx_std::priv::__owned_link::~__owned_link(void)" (__imp_??1__owned_link@priv@stlpdmtx_std@@QAE@XZ) referenced in function "public: __thiscall stlpdmtx_std::priv::_DBG_iter_base<class stlpdmtx_std::priv::_NonDbg_str<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> > >::~_DBG_iter_base<class stlpdmtx_std::priv::_NonDbg_str<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> > >(void)" (??1?$_DBG_iter_base@V?$_NonDbg_str@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@priv@stlpdmtx_std@@@priv@stlpdmtx_std@@QAE@XZ) 1>StlPort_Test.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: void __thiscall stlpdmtx_std::priv::__owned_list::_Invalidate_all(void)" (__imp_?_Invalidate_all@__owned_list@priv@stlpdmtx_std@@QAEXXZ) referenced in function "private: void __thiscall stlpdmtx_std::vector<int,class stlpdmtx_std::allocator<int> >::_Invalidate_all(void)" (?_Invalidate_all@?$vector@HV?$allocator@H@stlpdmtx_std@@@stlpdmtx_std@@AAEXXZ) 1>StlPort_Test.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: __thiscall stlpdmtx_std::priv::__owned_link::__owned_link(class stlpdmtx_std::priv::__owned_link const &)" (__imp_??0__owned_link@priv@stlpdmtx_std@@QAE@ABV012@@Z) referenced in function "public: __thiscall stlpdmtx_std::priv::_DBG_iter_base<class stlpdmtx_std::priv::_NonDbg_str<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> > >::_DBG_iter_base<class stlpdmtx_std::priv::_NonDbg_str<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> > >(struct stlpdmtx_std::priv::_DBG_iter_base<class stlpdmtx_std::priv::_NonDbg_str<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> > > const &)" (??0?$_DBG_iter_base@V?$_NonDbg_str@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@priv@stlpdmtx_std@@@priv@stlpdmtx_std@@QAE@ABU012@@Z) 1>StlPort_Test.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: static void * __cdecl stlpdmtx_std::__node_alloc::allocate(unsigned int &)" (__imp_?allocate@__node_alloc@stlpdmtx_std@@SAPAXAAI@Z) referenced in function "public: int * __thiscall stlpdmtx_std::allocator<int>::_M_allocate(unsigned int,unsigned int &)" (?_M_allocate@?$allocator@H@stlpdmtx_std@@QAEPAHIAAI@Z) 1>StlPort_Test.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: char * __thiscall stlpdmtx_std::priv::_NonDbg_str<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >::end(void)" (__imp_?end@?$_NonDbg_str@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@priv@stlpdmtx_std@@QAEPADXZ) referenced in function "bool __cdecl stlpdmtx_std::priv::_Dereferenceable<struct stlpdmtx_std::priv::_DBG_iter<class stlpdmtx_std::priv::_NonDbg_str<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >,struct stlpdmtx_std::priv::_DbgTraits<struct stlpdmtx_std::_Nonconst_traits<char> > > >(struct stlpdmtx_std::priv::_DBG_iter<class stlpdmtx_std::priv::_NonDbg_str<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >,struct stlpdmtx_std::priv::_DbgTraits<struct stlpdmtx_std::_Nonconst_traits<char> > > const &)" (??$_Dereferenceable@U?$_DBG_iter@V?$_NonDbg_str@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@priv@stlpdmtx_std@@U?$_DbgTraits@U?$_Nonconst_traits@D@stlpdmtx_std@@@23@@priv@stlpdmtx_std@@@priv@stlpdmtx_std@@YA_NABU?$_DBG_iter@V?$_NonDbg_str@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@priv@stlpdmtx_std@@U?$_DbgTraits@U?$_Nonconst_traits@D@stlpdmtx_std@@@23@@01@@Z) 1>StlPort_Test.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: unsigned int __thiscall stlpdmtx_std::priv::_NonDbg_str<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >::size(void)const " (__imp_?size@?$_NonDbg_str@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@priv@stlpdmtx_std@@QBEIXZ) referenced in function "bool __cdecl stlpdmtx_std::priv::_Incrementable<struct stlpdmtx_std::priv::_DBG_iter_base<class stlpdmtx_std::priv::_NonDbg_str<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> > > >(struct stlpdmtx_std::priv::_DBG_iter_base<class stlpdmtx_std::priv::_NonDbg_str<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> > > const &,int,struct stlpdmtx_std::random_access_iterator_tag const &)" (??$_Incrementable@U?$_DBG_iter_base@V?$_NonDbg_str@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@priv@stlpdmtx_std@@@priv@stlpdmtx_std@@@priv@stlpdmtx_std@@YA_NABU?$_DBG_iter_base@V?$_NonDbg_str@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@priv@stlpdmtx_std@@@01@HABUrandom_access_iterator_tag@1@@Z) 1>StlPort_Test.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: char * __thiscall stlpdmtx_std::priv::_NonDbg_str<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >::begin(void)" (__imp_?begin@?$_NonDbg_str@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@priv@stlpdmtx_std@@QAEPADXZ) referenced in function "bool __cdecl stlpdmtx_std::priv::_Incrementable<struct stlpdmtx_std::priv::_DBG_iter_base<class stlpdmtx_std::priv::_NonDbg_str<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> > > >(struct stlpdmtx_std::priv::_DBG_iter_base<class stlpdmtx_std::priv::_NonDbg_str<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> > > const &,int,struct stlpdmtx_std::random_access_iterator_tag const &)" (??$_Incrementable@U?$_DBG_iter_base@V?$_NonDbg_str@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@priv@stlpdmtx_std@@@priv@stlpdmtx_std@@@priv@stlpdmtx_std@@YA_NABU?$_DBG_iter_base@V?$_NonDbg_str@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@priv@stlpdmtx_std@@@01@HABUrandom_access_iterator_tag@1@@Z) 1>StlPort_Test.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) void __cdecl stlpdmtx_std::__stl_throw_length_error(char const *)" (__imp_?__stl_throw_length_error@stlpdmtx_std@@YAXPBD@Z) referenced in function "protected: void __thiscall stlpdmtx_std::priv::_Vector_base<int,class stlpdmtx_std::allocator<int> >::_M_throw_length_error(void)const " (?_M_throw_length_error@?$_Vector_base@HV?$allocator@H@stlpdmtx_std@@@priv@stlpdmtx_std@@IBEXXZ) 1>StlPort_Test.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: static void * __cdecl stlpdmtx_std::priv::__stl_debug_engine<bool>::_Get_container_ptr(class stlpdmtx_std::priv::__owned_link const *)" (__imp_?_Get_container_ptr@?$__stl_debug_engine@_N@priv@stlpdmtx_std@@SAPAXPBV__owned_link@23@@Z) referenced in function "public: class stlpdmtx_std::priv::_NonDbg_str<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> > * __thiscall stlpdmtx_std::priv::_DBG_iter_base<class stlpdmtx_std::priv::_NonDbg_str<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> > >::_Get_container_ptr(void)const " (?_Get_container_ptr@?$_DBG_iter_base@V?$_NonDbg_str@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@priv@stlpdmtx_std@@@priv@stlpdmtx_std@@QBEPAV?$_NonDbg_str@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@23@XZ) 1>libboost_system-vc90-mt-gdp-1_40.lib(error_code.obj) : error LNK2019: unresolved external symbol "__declspec(dllimport) public: __thiscall stlpdmtx_std::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >(class stlpdmtx_std::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> > const &)" (__imp_??0?$basic_string@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@stlpdmtx_std@@QAE@ABV01@@Z) referenced in function "public: virtual class stlpdmtx_std::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> > __thiscall `anonymous namespace'::generic_error_category::message(int)const " (?message@generic_error_category@?A0x2869e426@@UBE?AV?$basic_string@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@stlpdmtx_std@@H@Z) 1>libboost_system-vc90-mt-gdp-1_40.lib(error_code.obj) : error LNK2019: unresolved external symbol "__declspec(dllimport) public: __thiscall stlpdmtx_std::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >(char const *,class stlpdmtx_std::allocator<char> const &)" (__imp_??0?$basic_string@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@stlpdmtx_std@@QAE@PBDABV?$allocator@D@1@@Z) referenced in function "public: virtual class stlpdmtx_std::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> > __thiscall `anonymous namespace'::generic_error_category::message(int)const " (?message@generic_error_category@?A0x2869e426@@UBE?AV?$basic_string@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@stlpdmtx_std@@H@Z) 1>libboost_system-vc90-mt-gdp-1_40.lib(error_code.obj) : error LNK2019: unresolved external symbol "__declspec(dllimport) public: class stlpdmtx_std::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> > & __thiscall stlpdmtx_std::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >::erase(unsigned int,unsigned int)" (__imp_?erase@?$basic_string@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@stlpdmtx_std@@QAEAAV12@II@Z) referenced in function "public: virtual class stlpdmtx_std::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> > __thiscall `anonymous namespace'::system_error_category::message(int)const " (?message@system_error_category@?A0x2869e426@@UBE?AV?$basic_string@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@stlpdmtx_std@@H@Z) 1>libboost_system-vc90-mt-gdp-1_40.lib(error_code.obj) : error LNK2019: unresolved external symbol "__declspec(dllimport) public: char & __thiscall stlpdmtx_std::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >::operator[](unsigned int)" (__imp_??A?$basic_string@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@stlpdmtx_std@@QAEAADI@Z) referenced in function "public: virtual class stlpdmtx_std::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> > __thiscall `anonymous namespace'::system_error_category::message(int)const " (?message@system_error_category@?A0x2869e426@@UBE?AV?$basic_string@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@stlpdmtx_std@@H@Z) 1>libboost_system-vc90-mt-gdp-1_40.lib(error_code.obj) : error LNK2019: unresolved external symbol "__declspec(dllimport) public: unsigned int __thiscall stlpdmtx_std::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> >::size(void)const " (__imp_?size@?$basic_string@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@stlpdmtx_std@@QBEIXZ) referenced in function "public: virtual class stlpdmtx_std::basic_string<char,class stlpdmtx_std::char_traits<char>,class stlpdmtx_std::allocator<char> > __thiscall `anonymous namespace'::system_error_category::message(int)const " (?message@system_error_category@?A0x2869e426@@UBE?AV?$basic_string@DV?$char_traits@D@stlpdmtx_std@@V?$allocator@D@2@@stlpdmtx_std@@H@Z) 1>C:\Users\MANMA\Desktop\StlPort_Test\Debug\StlPort_Test.exe : fatal error LNK1120: 26 unresolved externals #include "stdafx.h" #include <boost/assign/std/vector.hpp> // for 'operator+=()' #include <boost/assert.hpp> using namespace std; using namespace boost::assign; // bring 'operator+=()' into scope #include "boost/filesystem.hpp" // includes all needed Boost.Filesystem declarations #include <iostream> // for std::cout int _tmain(int argc, _TCHAR* argv[]) { vector<int> values; values += 1,2,3,4,5,6,7,8,9; // insert values at the end of the container BOOST_ASSERT( values.size() == 9 ); BOOST_ASSERT( values[0] == 1 ); BOOST_ASSERT( values[8] == 9 ); boost::filesystem::path my_path( "some_dir/file.txt" ); return 0; } any help is appreciated -- View this message in context: http://www.nabble.com/Linker-errors-with-stlportstld.5.2.lib-tp25944396p259… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

Linker warning LNK4217: locally defined symbol _ imported in function _
by Yang Zhang 18 Oct '09

18 Oct '09

I'm building the below tiny boost app with the WDK (note that I'm *not* building a driver or anything kernel-mode, just a regular userland C++ app), but I'm getting the following errors when linking with the boost libraries that I built earlier using bootstrap and .\bjam (from the same terminal window). Anyone know what the problem is, and how I might fix or work around it? C:\exp>more exp.cpp #pragma warning(disable: 4512) #include <boost/program_options.hpp> int __cdecl main() { boost::program_options::options_description desc("Allowed options"); return 0; } C:\exp>more sources TARGETNAME=exp TARGETTYPE=PROGRAM USE_MSVCRT=1 USE_STL=1 USE_NATIVE_EH=1 MSC_WARNING_LEVEL=/W4 /WX _NT_TARGET_VERSION= $(_NT_TARGET_VERSION_WINXP) INCLUDES=..\boost_1_40_0 SOURCES=exp.cpp UMTYPE=console UMBASE=0x400000 TARGETLIBS = $(SDK_LIB_PATH)\ws2_32.lib ..\boost_1_40_0\stage\lib\libboost_progr am_options-vc100-mt.lib C:\exp>build BUILD: Compile and Link for x86 BUILD: Loading c:\winddk\7600.16385.0\build.dat... BUILD: Computing Include file dependencies: BUILD: Start time: Wed Oct 14 17:34:23 2009 BUILD: Examining c:\exp directory for files to compile. c:\exp Invalidating OACR warning log for 'root:x86chk' BUILD: Saving c:\winddk\7600.16385.0\build.dat... BUILD: Compiling and Linking c:\exp directory Configuring OACR for 'root:x86chk' - <OACR on> _NT_TARGET_VERSION SET TO WINXP Linking Executable - objchk_win7_x86\i386\exp.exe 1>errors in directory c:\exp 1>link : error LNK1218: warning treated as error; no output file generated BUILD: Finish time: Wed Oct 14 17:34:44 2009 BUILD: Done 1 executable built - 1 Warning - 1 Error C:\exp>more *wrn 1>warnings in directory c:\exp 1>c:\exp\libboost_program_options-vc100-mt.lib(options_description.obj) : warning LNK4217: locally defined symbol ??1?$basic_streambuf@DU?$char_traits@D@std@@@std@@UAE@XZ (public: virtual __thiscall std::basic_streambuf<char,struct std::char_traits<char> >::~basic_streambuf<char,struct std::char_traits<char> >(void)) imported in function "public: virtual __thiscall std::basic_stringbuf<char,struct std::char_traits<char>,class std::allocator<char> >::~basic_stringbuf<char,struct std::char_traits<char>,class std::allocator<char> >(void)" (??1?$basic_stringbuf@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@UAE@XZ) -- Yang Zhang http://www.mit.edu/~y_z/

3 4

tuple memory alignment
by Sebastian Hegler 17 Oct '09

17 Oct '09

Hi! I'm currently playing around with boost::tuple and std::vector. I noticed that having a std::vector containing boost::tuple elements has "dense" memory layout. My question: is this intended behavior, or will it go away in the future? (The current state is much to my advantage: instead of allocating memory C style and copying lots of data in order to feed some C API, I can reinterpret_cast a pointer, and everything is fine.) Thanks Sebastian

2 1

[BGL] removing vertex from subgraph
by Luqman Hodgkinson 17 Oct '09

17 Oct '09

Is there a way to remove a vertex from a subgraph without removing it from its parent? In the subgraph specification, I see no such member. Best wishes, Luqman

1 0

Problem with binary serialization using std::wstring
by Macumber, Daniel 17 Oct '09

17 Oct '09

I forgot to mention I am using boost 1.39

1 0

subgraphs in BGL
by Luqman Hodgkinson 17 Oct '09

17 Oct '09

In the Boost Graph Library, I run connected components. I would like to create a new graph for each connected component where each vertex in the new graphs maintains all properties from the original graph. How do I do this? Best wishes, Luqman

1 0

[filesystem] how to set a file size?
by Eric Niebler 17 Oct '09

17 Oct '09

Forgive me for the n00b-ish (and slightly offtopic) question, but is there any way in standard C++ or in Boost.Filesystem to truncate a file to a particular size? With std::ofstream, I can either truncate a file on open to 0 size, or else open it in overwrite mode and scribble over it, but when I'm done, I don't seem to have a way of saying, "The end of the file is now *here*." Is that right? And if so, does Boost.Filesystem have an API for this? Thanks, -- Eric Niebler BoostPro Computing http://www.boostpro.com

6 9

[SOAP / WSDL Support] Web Portal Design
by Boost lzw 17 Oct '09

17 Oct '09

Hi there, I came across this C++ web services client library: http://wsdlpull.sourceforge.net/#overview Does Boost C++ support SOAP / WSDL for designing dynamic web portals ? As I know, Boost.Asio does support HTTP server development with example codes (very good ones). However, is there a way that we can extend Boost.Asio towards using SOAP / WSDL with Apache servers or ASP.NET technologies ? A big picture view of it, even non-Boost solutions, can be very helpful for me. thanks a lot in advance, Robert

2 1

[Serialization] Changes for implementing archives between 1.39 and 1.40
by Ioannis Papadopoulos 17 Oct '09

17 Oct '09

Hi, I'm implementing my own archive (let's say my_archive) for use in Boost.Serialization. I'm following http://www.boost.org/doc/libs/1_40_0/libs/serialization/example/demo_fast_a… My archive is implemented in a header file. However, I get undefined symbols unless I add the following to my source template class boost::archive::detail::archive_serializer_map<my_archive>; Am I missing something? Is this the correct way of doing it? I didn't have to add this prior to Boost 1.40 Thanks

2 1

[Boost.Test] [1.38] Automated test suie registration with muti-file-test-modules
by Greg Christopher 17 Oct '09

17 Oct '09

Hi, We are starting to expand the number of test modules and are having some growing pains. Originally we were using the "single header" variant included/unit_test.hpp file. Now we have switched to linking to the dynamic version of the boost test library and are including auto_unit_test.hpp. We have been counting on the Test Tools to automatically register suites and test cases. This still worked when we just included unit_test.hpp (instead of included/unit_test.hpp). However with multiple test modules, init_unit_test_suite is being defined in each module. I am looking for clear documentation on what to do. This seems like the closest thing: http://www.boost.org/doc/libs/1_31_0/libs/test/doc/components/unit_test_fra… However following those directions exactly when trying to use multiple test modules (in a single executable) and only one BOOST_AUTO_TEST_MAIN still results in init_unit_test_suite being multiply defined. I would like multiple test suites, although the documentation for this declares that there is a single global test suite. I apologize if this is well documented somewhere, but after an hour of googling I have to ask. Greg

4 15

[mpl] Where is at with default
by Agustín K-ballo Bergé 16 Oct '09

16 Oct '09

I can't seem to find the `at` metafunction with a default value for associative sequences. What should I include to use such metafunction with a mpl::map ? Including <boost/mpl/at.hpp> is not enough, I get a 'too many templates arguments' when trying to do: typename boost::mpl::at< State, R, L >::type which I ended up doing like this: typename boost::mpl::eval_if< typename boost::mpl::has_key< State, R >::type , boost::mpl::at< State, R > , boost::mpl::identity< L > >::type Thank you.- Agustín K-ballo Bergé.-

3 2

[preprocessor] different macro expansion depending on whether its argument is defined or not?
by Ingolf Steinbach 16 Oct '09

16 Oct '09

Hi, is it possible to write a preprocessor macro which takes one argument and which expands differently depending on whether the argument is defined or not? Boost solution preferred. Example: #define FOO #undef BAR MY_MACRO(FOO) expands to 1 MY_MACRO(BAR) expands to 0 Kind regards Ingolf

2 1

[type_traits] Obtain type of pointer to member.
by Germán Diago 16 Oct '09

16 Oct '09

Hello. I would like to know if it's possible to obtain the base type from this expression: struct MyStruct { string field1; }; decltype(&MyStruct::field1) is a pointer to member. I would like to obtain type string instead, removing the pointer to member. Is it possible? Thanks.

2 1

Re: [Boost-users] AVL tree insert_equal generating assertion `node_algorithms::unique(to_insert)'
by bsing 16 Oct '09

16 Oct '09

My previous mail got truncated, the completed listing is below: Hi, I have the following piece of code that is generating the above assertion. Could someone tell me what is going wrong: template <typename T> struct my_node_t : public avl_set_base_hook<> { my_node_t(T data): m_data(data) {} template <typename U> friend bool operator< (const my_node_t& lhs, const my_node_t& rhs) { return lhs.m_data < rhs.m_data; }; T m_data; }; typedef my_node_t<int> avlnode_t; typedef avltree<avlnode_t> avltree_t; struct args_t { unsigned int seed[MAX_THREADS]; vector<avlnode_t>* items; avltree_t* tree_ptr; thread_args_t(size_t num_threads, avltree_t* map, vector<avlnode_t>* init_vec, size_t num_entries, unsigned int s) { num_items = num_entries; tree_ptr = map; initial_items = init_vec; for (size_t i = 0; i < num_threads; ++i) { seed[i] = i + s; } for (int i = 0; i < 10; ++i) { initial_items->push_back(i * 100); } for (vector<avlnode_t>::iterator it = initial_items->begin(); it != initial_items->end(); ++it) { tree_ptr->insert_equal(*it); } } ~thread_args_t() { tree_ptr->clear(); delete tree_ptr; delete initial_items; } }; void worker(void* args_ptr) { args_t* args = static_cast<args_t*>(args_ptr); avltree_t* tree = args->tree_ptr; vector<avlnode_t>* values = args->initial_items; int index = 5; //generate_random<int>(my_seed, 0, num_items + 1))) avlnode_t& find_element = *(values->begin() + index); tree->insert_equal(find_element); ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ <-raises exception } int main() { int num_threads = 1, num_entries = 10; vector<avlnode_t>* init_vec = new vector<avlnode_t>; avltree_t* tree = new avltree_t; args_t* args = new args_t(num_threads, tree, init_vec, num_entries); worker(args); delete args; }

2 4

AVL tree insert_equal generating assertion `node_algorithms::unique(to_insert)'
by bsing 16 Oct '09

16 Oct '09

Hi, I have the following piece of code that is generating the above assertion. Could someone tell me what is going wrong: template <typename T> struct my_node_t : public avl_set_base_hook<> { my_node_t(T data): m_data(data) {} template <typename U> friend bool operator< (const my_node_t& lhs, const my_node_t& rhs) { return lhs.m_data < rhs.m_data; }; T m_data; }; typedef my_node_t<int> avlnode_t; typedef avltree<avlnode_t> avltree_t; struct args_t { unsigned int seed[MAX_THREADS]; vector<avlnode_t>* items; avltree_t* tree_ptr; thread_args_t(size_t num_threads, avltree_t* map, vector<avlnode_t>* init_vec, size_t num_entries, unsigned int s) { num_items = num_entries; tree_ptr = map; initial_items = init_vec; for (size_t i = 0; i < num_threads; ++i) { seed[i] = i + s; } for (int i = 0; i < 10; ++i) { initial_items->push_back(i * 100); } for (vector<avlnode_t>::iterator it = initial_items->begin(); it != initial_items->end(); ++it) { tree_ptr->insert_equal(*it); } } ~thread_args_t() { tree_ptr->clear(); delete tree_ptr; delete initial_items; } }; void worker(void* args_ptr) { args_t* args = static_cast<args_t*>(args_ptr); avltree_t* tree = args->tree_ptr; vector<avlnode_t>* values = args->initial_items; int index = 5; //generate_random<int>(my_seed, 0, num_items + 1))) avlnode_t& find_element = *(values->begin() + index); tree->insert_equal(find_element); ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ <-raises exception } int main() { int num_threads = 1, num_entries = 10; vector<avlnode_t>* init_vec = new vector<avlnode_t>; avltree_t* tree = new avltree_t; args_t* args = new args_t(num_threads, tree, init_vec, num_entries);

1 0

Anyone see anything like this??
by Noah Roberts 15 Oct '09

15 Oct '09

In mem_fn.hpp (not sure what is doing this but my bet is bind or function) there is a function dm<R,T>::call that looks like so: template<class U> R const & call(U & u, void const *) const { return (get_pointer(u)->*f_); } The stupid compiler (MSVC++ 8.0) complained that u is an unreferenced formal parameter and then crashed. So I told it to stop giving me that warning in the file that is causing the issue and the problem went away...until I set about trying use the function that I just wrote that caused it. Now I get this: 1>d:\boostvs39\include\boost\bind\mem_fn.hpp(334) : error C4716: 'boost::_mfi::dm<void __thiscall(unsigned int),esi::units::unit_settings>::call<esi::pipeflo::document::unit_pool * const>' : must return a value I can't recreate this in a simple program. Here's the code of the function that I just wrote when this BS started happening: void on_change(wxGridEvent & event) { using namespace esi::units::systems::SI; using namespace esi::pipeflo::document; if (event.GetCol() == 0) return; std::pair< boost::function< std::vector< std::string >() > , boost::function< void(size_t) > > functions[] = { std::make_pair( boost::bind(&unit_settings::get_labels<pressure>, &units) , boost::bind(&unit_settings::set_selection <pressure>, &units) ) , std::make_pair( boost::bind(&unit_settings::get_labels<length>, &units) , boost::bind(&unit_settings::set_selection<length>, &units) ) , std::make_pair( boost::bind(&unit_settings::get_labels<mass_flow>, &units) , boost::bind(&unit_settings::set_selection <mass_flow>, &units) ) , std::make_pair( boost::bind(&unit_settings::get_labels <dynamic_viscosity>, &units) , boost::bind(&unit_settings::set_selection <dynamic_viscosity>, &units) ) , std::make_pair( boost::bind(&unit_settings::get_labels <mass_density>, &units) , boost::bind(&unit_settings::set_selection <mass_density>, &units) ) }; std::vector< std::string > labels = functions[event.GetRow()].first (); std::vector< std::string >::iterator fit = std::find(labels.begin(), labels.end(), grid->GetCellValue(event.GetRow(), event.GetCol())); assert(fit != labels.end() && "Somehow the user selected a unit that doesn't exist."); if (fit != labels.end()) { functions[event.GetRow()].second(std::distance(labels.begin(), fit)); } } The namespace esi::units::systems::SI has a "using boost::units::si" in it. I am not really expecting anyone can help me but I thought I'd try anyway. Surely other people have been stabbed in the face by this terribly buggy compiler.

3 3

Boost::Asio -- Is this safe?
by Dan Eaton 15 Oct '09

15 Oct '09

I have a situation where I have two (or more) nodes that need to periodically exchange data in a symmetric fashion - i.e. one needs to send the other a buffer, and vice versa. Currently I implement this as two async operations: for(neighboring nodes) { async_write(...) async_read(...) } m_ioService.run() There exists a tcp socket connection between each of the neighbors. The handlers associated with both read and write merely do error checking. Is this okay, or is there a issue with this approach? In general, it seems to be working fine, but someone brought a bug to my attention whereby they were getting "Transport endpoint not connected." errors happening (under a heavily loaded network, if that makes any difference, but I'm not using any timeouts). Thanks! Dan Eaton

2 1

Re: [Boost-users] Boost::Asio -- Is this safe?
by Dan Eaton 15 Oct '09

15 Oct '09

PS. I should have mentioned that each worker maintains a socket *to* and *from* its partner. I have a situation where I have two (or more) nodes that need to periodically exchange data in a symmetric fashion - i.e. one needs to send the other a buffer, and vice versa. Currently I implement this as two async operations: for(neighboring nodes) { async_write(...) async_read(...) } m_ioService.run() There exists a tcp socket connection between each of the neighbors. The handlers associated with both read and write merely do error checking. Is this okay, or is there a issue with this approach? In general, it seems to be working fine, but someone brought a bug to my attention whereby they were getting "Transport endpoint not connected." errors happening (under a heavily loaded network, if that makes any difference, but I'm not using any timeouts). Thanks! Dan Eaton _______________________________________________ Boost-users mailing list Boost-us...<http://groups.google.com/groups/unlock?_done=/group/boost-list/browse_threa…>@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

Directory monitor for Windows and Linux
by Boris Schaeling 15 Oct '09

15 Oct '09

I've updated the directory monitor which I had developed about a year ago: http://www.highscore.de/boost/dir_monitor.zip It now supports Windows and Linux. The Linux version is based on inotify (available since kernel version 2.6.13). The directory monitor supports blocking and asynchronous I/O operations. You use it like any other Boost.Asio I/O object. There are two test cases to verify that the directory monitor works and to provide a minimum documentation. As there are only four methods provided (add_directory, remove_directory, monitor and async_monitor) it should be pretty easy to use this Boost.Asio extension. If anyone wants to add support for more platforms (like Solaris) just drop me a line! Boris

1 0

Re: [Boost-users] Boost::ASIO, Signal handlers
by Dan Eaton 15 Oct '09

15 Oct '09

Nothing, other than to log that the signal was received! There appears to be an intermittent bug in my application, where I get the error " Transport endpoint not connected." which hints at sockets closing unexpectedly (I'm definitely not closing them accidentally!) On Thu, Oct 15, 2009 at 11:43 AM, Dan Eaton <daniel.ea...<http://groups.google.com/groups/unlock?_done=/group/boost-list/browse_threa…>@acceleware.com> wrote: > I was thinking to simply call std::signal() on my own, after the > construction of io_service. Will that work, and is there a better way? I'm assuming that you're going to implement a handler for SIGPIPE, and out of curiosity, what will your handler will do? Jon _______________________________________________ Boost-users mailing list Boost-us...<http://groups.google.com/groups/unlock?_done=/group/boost-list/browse_threa…>@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

Boost::ASIO, Signal handlers
by Dan Eaton 15 Oct '09

15 Oct '09

I'm using the ASIO component of boost 1.39.0, and noticed that it uses std::signal() to ignore SIGPIPE by default. Can you confirm that this is indeed the case? How do I prevent this behavior? (and therefore allow for my own signal handler) I was thinking to simply call std::signal() on my own, after the construction of io_service. Will that work, and is there a better way? Thank you, Dan Eaton

2 1

Boost.Asio -- combining sync read with async read
by Sameer Parekh 15 Oct '09

15 Oct '09

Thanks Igor and Jon, everything seems to be working now! yours, -sameer

1 0

Question on intrusive hooks
by bsing 15 Oct '09

15 Oct '09

I'm trying to come to grips with using the boost intrusive containers, but I don't think I understand how the lifetime of hooks need to be managed. This piece of code fails the !hook.is_linked() assertion: Any pointers? Also, is there is a non-intrusive AVL tree container as part of boost? struct my_node_t { int i_; my_node_t(int i): i_(i) {} friend bool operator<(const my_node_t& lhs, const my_node_t& rhs) { return lhs.i_ < rhs.i_; } friend ostream& operator<< (ostream& os, const my_node_t& n) { return os << n.i_; } }; int main() { avltree<my_node_t> tree; vector<my_node_t> vec; for (int i = 0; i < 10; ++i) vec.push_back(my_node_t(i)); for (int i = 0; i < 10; ++i) tree.insert_unique(vec[i])); copy(tree.begin(), tree.end(), ostream_operator<my_node_t>(cout, " "); }

2 1

1.40.0 - 32_64 broken on OS X 10.6 Snow Leopard
by JungleCat 15 Oct '09

15 Oct '09

Hi, 32_64 fat compilation is broken out of the box in 1.40.0 on OS X 10.6. Others reported this here: http://groups.google.com/group/boost-list/browse_thread/thread/06c7e1f93221… J

7 19

Question on intrusive hooks [addendum]
by Arun Raghavan 15 Oct '09

15 Oct '09

Sorry I mistyped by previous email slightly - my_node_t derives from avl_set_base_hook<> as below: I'm trying to come to grips with using the boost intrusive containers, but I don't think I understand how the lifetime of hooks need to be managed. This piece of code fails the !hook.is_linked() assertion: Any pointers? Also, is there is a non-intrusive AVL tree container as part of boost? struct my_node_t : public avl_set_base_hook<> { int i_; my_node_t(int i): i_(i) {} friend bool operator<(const my_node_t& lhs, const my_node_t& rhs) { return lhs.i_ < rhs.i_; } friend ostream& operator<< (ostream& os, const my_node_t& n) { return os << n.i_; } }; int main() { avltree<my_node_t> tree; vector<my_node_t> vec; for (int i = 0; i < 10; ++i) vec.push_back(my_node_t(i)); for (int i = 0; i < 10; ++i) tree.insert_unique(vec[i])); copy(tree.begin(), tree.end(), ostream_operator<my_node_t>(cout, " "); } ________________________________ text

1 0

Re: [Boost-users] Boost.Asio -- combining sync read with async read
by Sameer Parekh 15 Oct '09

15 Oct '09

Igor-- So I'm not sure what you mean exactly by "the server might send a few lines in a bunch." The server will only send one line at a time, in that it will call write_async for every line that it sends-- it will never call write_async on more than one line. However, the client might be doing some processing so the server might send a few lines before the client "comes up for air" next. If that's the case then all three lines will end up in the same buffer when the read_async handler is called? I would imagine so but it would be nice if I could not worry about this, so I am looking for any excuse. =) I also realized upon looking at the chat example in more detail that I missed the whole queue thing that it does. I will aim to replicate that in my app now. In reading through, it occurs to me that I might be making the same mistake with write_async -- i.e. if I call write_async twice in quick succession, that could cause a problem unless I wait for the first write_async to complete before I call write_async a second time? Best, -Sameer On Oct 14, 2009, at 6:21 PM, boost-users-request(a)lists.boost.org wrote: > If this is the case in your application (i.e. the server might send > few > lines in a bunch), then I think yes, you have to inspect the sterambuf > manually. > Actually, this is the reason I never used read_until - in most cases > it > doesn't make your code simpler. The one case where it does is when > your > protocol has a text header and a body (like in HTTP).

3 2

Question on unordered_map
by Arun Raghavan 15 Oct '09

15 Oct '09

Hi, Do the underlying hashtable implementations of unordered_map/multimap store a size field (i.e. do they support a constant-time size function)? Same query about the load factor and bucket sizes. thanks. -b

2 1

[units][ublas] how would i use typedef in units?
by David Carricajo 15 Oct '09

15 Oct '09

Hi, Using units and ublas for new code is great, but how about using both in legacy code? I’ve got some legacy numerical code using primitive types, i plan to use units for some reasons, i.e. to check performance using both primitive types and boost::units types, and to check my code at compile time which is its whole purpose after all. I spent a day and my code it’s already broken, specially because of the initializations and ublas, some self-explanatory code follows: ----- calculations.hpp ----------- //typedefs to get library-free code #include <complex> #include <iostream> #if USING_BOOST_UNITS #include <boost/typeof/std/complex.hpp> #include <boost/units/systems/si/power.hpp> //... using namespace boost::units; using namespace boost::units::si; using namespace std; typedef std::complex<double> complex_type; typedef quantity<electric_potential,complex_type> tPotencial; typedef quantity<current,complex_type> tIntensidad; typedef quantity<resistance,complex_type> tResistancia; //... #elif typedef double tPotencial; typedef double tIntensidad; typedef double tResistancia; //... #endif ------------------------------------------ ----- some_legacy_calculations.cpp ------ #define USING_BOOST_UNITS tPotencial tension = complex_type(12.5,0.0)*volts; //ok tPotencial tension2 = complex_type(12.5,0.0); //auch! some_file << tesion + tension2 << std::endl; some_file.close(); //get Real part from 'tension' and pretend it's a current quantity<current, double> phony_tension = tension.value().real * amperes;//compiler doesn't complain, but how do I prevent this to compile? #undef USING_BOOST_UNITS tPotencial tension = complex_type(12.5,0.0)*volts; //auch! tPotencial tension2 = complex_type(12.5,0.0); //ok some_file.open("/*some_file*/"); some_file >> tesion + tension2 >> std::endl; //auch! #define USING_BOOST_UNITS //use ublas ublas::matrix<tAdmitancia, ublas::column_major> admi(2, 2); ublas::matrix<tPotencia, ublas::column_major> ind(2, 1); ind(0, 0) = complex_type (1, 0)*volts; ind(1, 0) = complex_type (-1, 0)*volts; admi(0, 0) = complex_type (0, -2)*siemens; admi(0, 1) = complex_type (0, 2)*siemens; admi(1, 0) = complex_type (0, 2)*siemens; admi(1, 1) = complex_type (0, -2)*siemens; int er = lapack::gesv(admi, ind);//auch! ------------------------------------------ For each of those problems i found some workaround but I'd like to discuss whether it's ok or not. Thanks for your time.

4 4

[serialization] Short form of empty tags in XML archive
by Sergey Filippov 15 Oct '09

15 Oct '09

Hi, I'm evaluating possibility of using the serialization library (1.40.0) to save/load an application settings to/from XML that must be a part of another XML. I faced with some minor issues that were successfully solved but then arisen the major one: the serialization library does not support <tag/> syntax. Why I need this? After the whole XML is generated it is transformed by some XML processor to internal data structures and back to text. During the transformation empty tags <str></str> (for example, produced when serializing an empty std::string object) are replaced with the short form: <str/>. From the XML perspective, these forms are equivalent so XML processors allowed to do so. Since I cannot change the XML processor, I started investigating the serialization library. Specifically, how XML is processed. I found out that parsing XML is responsibility of xml_grammar class. It does not recognize <tag/> as a start tag so an exception is generated. It is easy to write a new class with needed functionality but xml_grammar is not designed to be used polymorphically... So, after all, I did not find an easy way to write my own archive. After that, I tried to modify the library. It was straightforward, and it works for me. Attached are original (*.bak) files and modified. Can anyone suggest a way to achieve such a functionality without modifying the library? Don't you think, this functionality is quite general to be included in the library? Sergey

1 0

Already successfully running Boost on Linux, looking for advice from Windows Boost adopters
by Ramon F Herrera 15 Oct '09

15 Oct '09

Some weeks ago, Boost caught my attention, and I am now a more than satisfied user. The assistance received in this forum is one of the factors in my "two thumbs up" evaluation of Boost. Give yourselves a round of applause. :^) Since I can't help but getting into progressively harder stuff (i.e., getting into trouble), I am considering using Boost on the Windows side. My background is Unix development but I have been teaching myself Visual C++ lately. I mostly build and integrate stuff written by other programmers. I am trying to decide whether I should delve deeper into Boost on the Linux side (which is quickly becoming a walk in the park), or take the plunge into Windows. Are there gotchas or caveats? Can I just download Boost and select "Build solution"? My current platform is Visual Studio, Version 8 (2005). I don't intend to upgrade it until I have no choice. I have found that to be a safe policy -better safe than sorry-, specially when the software comes from Redmond. -Ramon

7 12

Boost.Serialization not building
by OvermindDL1 15 Oct '09

15 Oct '09

I attempted the build Boost.Serialization from trunk and got some errors: binary_iarchive.cpp .\boost/serialization/void_cast.hpp(255) : error C2572: 'boost::serialization::void_cast_register' : redefinition of default parameter : parameter 2 .\boost/serialization/void_cast_fwd.hpp(30) : see declaration of 'boost::serialization::void_cast_register' .\boost/serialization/void_cast.hpp(255) : error C2572: 'boost::serialization::void_cast_register' : redefinition of default parameter : parameter 1 .\boost/serialization/void_cast_fwd.hpp(30) : see declaration of 'boost::serialization::void_cast_register'

2 7

Anyone having Intellisense weirdness with 1.39 and VS 2008?
by Eric J. Holtman 14 Oct '09

14 Oct '09

First off, as a newbie to the list, is there a searchable archive anywhere? I found the archives, but other than scanning the thread by subject, I couldn't see a way to find out if this question had been answered.... so, here goes... I was using 1.35. I decided to upgrade to 1.39, since I was having one of those days where I started upgrading other stuff, and figured, "what the hell....." With 1.39, certain classes in certain projects seem to show up in Intellisense (that is, the Class Viewer) as if they were best 7 or 8 levels deep in a boost namespace. That is, under my project, there will be a boost {} entry. I expand that, there's another boost {} entry. I keep doing that for a while, and finally, my class shows up. That class isn't really in the boost namespace. And it's only the MSFT browser that is confused, everything compiles and runs normally. If I back out to 1.35, this goes away. Any clues?

4 6

Template class and any_image_view
by tatta 14 Oct '09

14 Oct '09

Hello, I'm in trouble using dynamic images into a template class. I have an abstract class Filter of this form: template <typename TView1, typename TView2> class Filter { public: virtual ~Filter(); virtual void setParameter(uint8 id, float16 value); virtual void apply(const any_image_view<TView1>& source, const any_image_view<TView2>& destination) = 0; protected: Filter(); }; which is subclassed by other concrete classes like this one: template <typename TView1, typename TView2> class BlurGaussSelective : public Filter<TView1,TView2> { public: BlurGaussSelective(); virtual ~BlurGaussSelective(); void setParameter(uint8 id, float16 value); void apply(const any_image_view<TView1>& source, const any_image_view<TView2>& destination); }; As you can see I need to use a template class because the "apply" method (where concrete filters implements own logic) is virtual. But when I instantiate a BlurGaussSelective object I don't know which template types pass to it. I tried this: typedef vector<rgb8_image_t,gray8_image_t> ImageType; typedef vector<rgb8_view_t,gray8_view_t> ViewType; any_image<ImageType> source; any_image<ImageType> dest; jpeg_read_image("input.jpg", source); jpeg_read_image("input.jpg", dest); BlurGaussSelective<ViewType,ViewType> filter; filter.apply(const_view(source),const_view(dest)); But the compiler gives me this error: ../src/RotoscoperApplication.cpp: In member function ‘void Rotoscoper::Application::rotoscope()’: ../src/RotoscoperApplication.cpp:73: error: no matching function for call to ‘Rotoscoper::BlurGaussSelective<boost::mpl::vector<boost::gil::image_view<boost::gil::memory_based_2d_locator<boost::gil::memory_based_step_iterator<boost::gil::rgb8_pixel_t*> > >, boost::gil::image_view<boost::gil::memory_based_2d_locator<boost::gil::memory_based_step_iterator<boost::gil::gray8_pixel_t*> > >, 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>, boost::mpl::vector<boost::gil::image_view<boost::gil::memory_based_2d_locator<boost::gil::memory_based_step_iterator<boost::gil::rgb8_pixel_t*> > >, boost::gil::image_view<boost::gil::memory_based_2d_locator<boost::gil::memory_based_step_iterator<boost::gil::gray8_pixel_t*> > >, 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> >::apply(boost::gil::any_image_view<boost::mpl::v_item<boost::gil::image_view<boost::gil::memory_based_2d_locator<boost::gil::memory_based_step_iterator<const boost::gil::gray8c_pixel_t*> > >, boost::mpl::v_item<boost::gil::image_view<boost::gil::memory_based_2d_locator<boost::gil::memory_based_step_iterator<const boost::gil::rgb8c_pixel_t*> > >, boost::mpl::vector0<mpl_::na>, 0>, 0> >, boost::gil::any_image_view<boost::mpl::v_item<boost::gil::image_view<boost::gil::memory_based_2d_locator<boost::gil::memory_based_step_iterator<const boost::gil::gray8c_pixel_t*> > >, boost::mpl::v_item<boost::gil::image_view<boost::gil::memory_based_2d_locator<boost::gil::memory_based_step_iterator<const boost::gil::rgb8c_pixel_t*> > >, boost::mpl::vector0<mpl_::na>, 0>, 0> >)’ ../src/RotoscoperBlurGaussSelective.hpp:119: note: candidates are: void Rotoscoper::BlurGaussSelective<TImage1, TImage2>::apply(const boost::gil::any_image_view<IVTypes>&, const boost::gil::any_image_view<Types2>&) [with TImage1 = boost::mpl::vector<boost::gil::image_view<boost::gil::memory_based_2d_locator<boost::gil::memory_based_step_iterator<boost::gil::rgb8_pixel_t*> > >, boost::gil::image_view<boost::gil::memory_based_2d_locator<boost::gil::memory_based_step_iterator<boost::gil::gray8_pixel_t*> > >, 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>, TImage2 = boost::mpl::vector<boost::gil::image_view<boost::gil::memory_based_2d_locator<boost::gil::memory_based_step_iterator<boost::gil::rgb8_pixel_t*> > >, boost::gil::image_view<boost::gil::memory_based_2d_locator<boost::gil::memory_based_step_iterator<boost::gil::gray8_pixel_t*> > >, 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>] make: *** [src/RotoscoperApplication.o] Error 1 Which template type I should use when I instantiate the BlurGaussSelectiveClass? Thanks in advance. Greetings, Raffaele -- View this message in context: http://www.nabble.com/Template-class-and-any_image_view-tp25891719p25891719… Sent from the Boost - Users mailing list archive at Nabble.com.

2 2

Re: [Boost-users] Boost.Asio -- combining sync read with async read
by Sameer Parekh 14 Oct '09

14 Oct '09

> Right. The most simple way to accomplish this is to use > asio::streambuf as a > buffer. When you process the input data, you call consume() function > only > for the amout you've really processed, and the rest of the data > remains > unused in the streambuf - until the next time you get something from > the > server (look at the asio examples with streambuf). Yes, I'm using the streambuf, and then constructing an istream from the streambuf, and then calling getline on the istream. (The chat client/server was the primary example that I used to build my app.) If I have 2.5 lines in the buffer then the first two calls to getline will give me the first two lines, but won't the third call to getline get me the half line, and consume that half line from the streambuf? Do I need to process the streambuf in a more manual fashion rather than calling getline on the istream? Also to make sure I understand it how it works with the streambuf, that I am understanding you correctly: if I was just processing one line in the async_handler, and the first time the server sends me 3 lines, then the handler is called and will process the first line sent. Then the server sends another 3 lines, the async handler is called and the client will process the 2nd line that it received, not the 4th line, right? Thanks for your help, -Sameer

2 1

[lambda] Initializing a std::list of unsigned short points
by Ryan McConnehey 14 Oct '09

14 Oct '09

In my project I'm trying to initialize a std::list of unsigned short pointers. I've created a couple of simple hand written loops but would like to convert them to use std::for_each. I've been unsuccessful in the past getting boost::lambda to work with std container of pointers. In the lambda documentation I know that new_ptr and delete_ptr are need in creating and destroying pointers in lambda functions. I've provided the hand written loop that does work and the "attempted" conversion to std::for_each. Any help on the correct implementation for the lambda values would be appreciated. Ryan typedef std::list<unsigned short *> ml; for (ml::iterator itor = m_list.begin(); itor != m_list.end(); ++itor, startValue++) { *itor = new unsigned short(startValue); } for (ml::iterator itor = m_list.begin(); itor != m_list.end(); ++itor) { delete *itor; } std::for_each(m_list.begin(), m_list.end(), *(bl::_1) = bl::new_ptr<unsigned short>()(bl::var(startValue)++) ); std::for_each(m_list.begin(), m_list.end(), boost::lambda::delete_ptr(*(boost::lambda::_1)));

3 3

Re: [Boost-users] Boost.Asio -- combining sync read with async read
by Sameer Parekh 14 Oct '09

14 Oct '09

> > No, it will read anything available in the socket and put it in the > buffer. > It can be 1 line, 2 lines or 3.25 lines. What I mean is that you > have to be > aware of the fact that the buffer might contain more data than you > "requested" from read_until. Aha, thanks Igor. So my handler needs to be able to deal with a buffer that contains more than one line. That's not so bad, I can just run the processing code for each line until the buffer is empty, that should be fine. However, what concerns me is if the handler receives a buffer that has just 2.5 lines in it. All the messages from the server are going to be one line long. So if the server sends three messages in succession but say there is some network hiccup partway through the 3rd line, then my client will only receive 2.5 lines, and the handler will get called with the partial line? Then the handler has to cache the partial line so that when the rest of the line comes through it can paste them together again? That seems hard... thanks, -s

2 1

[asio] deadline_timer callback is not called
by Daniele Barzotti 14 Oct '09

14 Oct '09

Hi, I've yet posted a question about this topic but I not solve, so I try to ask again. PS: I used the same solution (in conjunction with asio::serial_port) in another project and, there, it works! I'm working on a library and I have only one static io_service and io_service::work like in the following code: ---------------------- START CODE ------------------------ typedef boost::shared_ptr<boost::asio::io_service::work> io_work_ptr; // Main io_service static boost::asio::io_service io_service; static boost::scoped_ptr<boost::thread> io_service_thread; static io_work_ptr p_work; static bool thread_started; void io_worker_thread(void) { #if(WIN32 && _WIN32_DCOM) struct com_init { com_init() { CoInitializeEx(NULL, COINIT_APARTMENTTHREADED); } ~com_init() { CoUninitialize(); } } initializer_object; #endif io_service.run(); }; bool CreateMainThread() { if (!thread_started) { try { // create the work object on the heap: // [Reference counting] // This object is a simple pointer because // it is assigned to each created objects // These objects store it in a shared_ptr so, // when the last object is destroyed // The io_service::work is destroyed as well p_work.reset( new boost::asio::io_service::work(io_service) ); // Instead of start the worker thread directly by // passing the io_service object, // I call the io_worker_thread function where // I can do some initialization tasks like // calling CoInitializeEx for COM io_service_thread.reset(new boost::thread(io_worker_thread)); thread_started = !thread_started; return true; } catch (boost::thread_resource_error e) { // Failed to create the new thread return false; } } else return true; } /*! * \brief Factory function for AudioPlayer objects creation */ EXTERN_C EUROAUDIOLIB_API AudioPlayerHndl CALL CreateAudioPlayer() { if (!CreateMainThread()) return NULL; // create the new object AudioPlayer* pAudioPlayer = new AudioPlayer; pAudioPlayer->io_worker_ptr = p_work; return pAudioPlayer; }; ---------------------- END CODE ------------------------ In the above code pAudioPlayer->io_worker_ptr is declared as: io_work_ptr p_work; In a class I have to use the timer, so I initialize it with the global io_service object: ---------------------- START CODE ------------------------ boost::asio::deadline_timer rx_timer_; WaveStream::WaveStream() : rx_timer_(io_service) { }; void WaveStream::ProcessRTPPacket() { // RTP Packet received ...... //Start a new timer or renew it rx_timer_.expires_from_now( boost::posix_time::milliseconds( 1000 ) ); io_service.reset(); // We managed to cancel the timer. Start new asynchronous wait. rx_timer_.async_wait( boost::bind(&WaveStream::handle_timeout, this, _1) ); .... } void WaveStream::handle_timeout(const boost::system::error_code& error) { std::cout << "BOOST TIMER RAISED!!" << endl; // A Timeout is raised: a stream is end if (!error) {...} }; ---------------------- END CODE ------------------------ But the callbak is never called!! Since ProcessRTPPacket is called frequently, I try also to move the timer on another point just for test with the same effect! Where could be the mistake? Thanks in advance! Daniele.

2 11

Re: [Boost-users] Boost.Asio -- combining sync read with async read (Igor R)
by Sameer Parekh 14 Oct '09

14 Oct '09

> > It's ok to use both sync. and async. calls, but you should not call > boost::asio::async_read_until() and/or boost::asio::async_read() until > previous read is complete (for the same socket/buffer). Besides, pay > attention that reading "until" might read more data than you expect. Thanks Igor, I'm a bit confused here though.. how do I know if the previous read is complete? I figured when async_read_until() calls the handler, the read was complete and everything read was sitting in the buffer? Do you mean to say that if the client receives two lines, then async_read_until() will read both lines but then put only the first line in the buffer? Then I can't call async_read_until() again because there is still another pending call to the handler that will process the second line? So how do I know at the end of the handler whether or not to call async_read_until() ? thanks! -Sameer

2 1

[fusion] probably a bug in result_of::join
by jl 14 Oct '09

14 Oct '09

This is nearly a copy-paste from the doc (and agrees with intuition): #include <boost/fusion/algorithm/transformation/join.hpp> #include <boost/fusion/include/vector.hpp> #include <boost/fusion/include/join.hpp> void foo() { using namespace boost::fusion; vector<> v1, v2; result_of::join< vector<>, vector<> >::type j = join(v1, v2); } ...but it doesn't compile (msvc9, boost 1.40): c:\UserTemp\x54209\BoostTests\Any\main.cpp(20) : error C2440: 'initializing' : cannot convert from 'boost::fusion::result_of::join<LhSequence,RhSequence>::type' to 'boost::fusion::joint_view<Sequence1,Sequence2>' with [ LhSequence=const boost::fusion::vector<>, RhSequence=const boost::fusion::vector<> ] and [ Sequence1=boost::fusion::vector<>, Sequence2=boost::fusion::vector<> ] No constructor could take the source type, or constructor overload resolution was ambiguous J-L

2 3

[Variant] Sorting data out of a vector of variant
by Oliver Rudolph 14 Oct '09

14 Oct '09

Hi all! I have some class with a member which is a vector of boost.variant, i.e. class Example { public: std::vector<variant<typeA, typeB, typeC> > content; } I want to add three members to my class that are vectors of pointers to the specific content items class Example { public: std::vector<variant<typeA, typeB, typeC> > content; std::vector<typeA> *contentA; std::vector<typeB> *contentB; std::vector<typeC> *contentC; } Now the question: how can I iterate through the vector content whilst adding its items to the other 3 vectors depending on their type? I know there has to be some way using the apply_visitor functor, but I just don't see how exactly... Thanks for your help! Best regards, Oli

2 1

Re: [Boost-users] Boost.Serialization not building
by OvermindDL1 14 Oct '09

14 Oct '09

On Wed, Oct 21, 2009 at 8:53 AM, Stefan Strasser <strasser(a)uni-bremen.de> wrote: > >> >> So what do I need to do to the xml archive to get it to work like the >> others? _______________________________________________ > > use NVPs I guess > not sure if that's the cause of THIS error though I tried looking at that, but have no clue what that is (other then some lines of code referencing it I found), or how I could apply it to this situation. Should it not work the same for the xml archive as it does text and binary, which both work fine.

2 1

Boost.Asio -- combining sync read with async read
by Sameer Parekh 14 Oct '09

14 Oct '09

Hello everyone! I am writing a client for a protocol which goes something like this: The client connects to the server, and it submits "orders" -- every time it gets an order it gets back an "ack". However, the server might asynchronously send a "fill" at any time. So I want to be listening for a fill even while the client might be doing other things (listening to another server for one-way data stream. The client then chooses to submit an order or not based on the information it gets in the datastream, or it might choose to submit an order if it receives a fill.) I thought the way to do it would be to do async_read_until() and have it call my fill handler when it receives something. Then the function that submits orders would call write() and then block waiting for the ack message using read_until() However, when I implement that, the client never seems to notice that a fill message is sent. It receives the acks just fine, and it successfully reads the datafeed coming in from the other tcp connection. I thought maybe the read_until() would cancel the async_read_until() so after I received the ack message I called async_read_until() again, but that didn't work either... (The server works as it should, I tested it with telnet.) Is it possible to mix sync/async reads in this way? Can anyone tell if I am doing something wrong? Do I need to do something else to make this work? Thanks, I appreciate your help! Here is the code in question: (as an aside, is it bad form to call connect() in the constructor? Should I call connect() and setup the async_read_until() in a separate start() method?) MarketConnectionTCP::MarketConnectionTCP(boost::asio::io_service &io_service_, std::string ip_, unsigned short agentPort_, unsigned short feedPort_) : _io_service(io_service_), _agentSocket(_io_service), _feedSocket(_io_service), _timer(_io_service, boost::posix_time::seconds(1)) { boost::asio::ip::address ipAddress(boost::asio::ip::address::from_string( ip_)); tcp::endpoint agentEndpoint(ipAddress, agentPort_); Logger::stream() << "Trying to connect to agent:" << agentEndpoint << std::endl; _agentSocket.connect(agentEndpoint); Logger::stream() << "Agent connected:" << _agentSocket.remote_endpoint() << std::endl; boost::asio::ip::tcp::endpoint feedEndpoint(ipAddress, feedPort_); Logger::stream() << "Trying to connect to feed:" << feedEndpoint << std::endl; _feedSocket.connect(feedEndpoint); Logger::stream() << "Feed connected:" << _feedSocket.remote_endpoint() << std::endl; boost::asio::async_read_until(_agentSocket, _fillBuf, "\r\n", boost::bind( &MarketConnectionTCP::handleReadFill, this, boost::asio::placeholders::error)); Logger::stream() << "Listening on agent connection:" << _agentSocket.remote_endpoint() << std::endl; boost::asio::async_read_until(_feedSocket, _feedBuf, "\r\n", boost::bind( &MarketConnectionTCP::handleReadFeed, this, boost::asio::placeholders::error)); Logger::stream() << "Listening on feed connection:" << _feedSocket.remote_endpoint() << std::endl; _timer.async_wait(boost::bind(&MarketConnectionTCP::handleTimer, this, boost::asio::placeholders::error)); Logger::stream() << "Timer is waiting" << std::endl; } OrderID MarketConnectionTCP::sendOrder(const Order &order) { boost::asio::streambuf orderBuf; std::ostream orderStream(&orderBuf); orderStream << order << "\r\n"; // This blocks until we get an ack with the order id Logger::stream() << "Sending order to:" << _agentSocket.remote_endpoint() << ":" << order << std::endl; boost::asio::write(_agentSocket, orderBuf); Logger::stream() << "Waiting for ack from:" << _agentSocket.remote_endpoint() << std::endl; boost::asio::streambuf ackBuf; std::istream ackStream(&ackBuf); boost::asio::read_until(_agentSocket, ackBuf, "\r\n"); OrderID id; ackStream >> id; Logger::stream() << "Received ack from:" << _agentSocket.remote_endpoint() << ":" << id << std::endl; // listen again boost::asio::async_read_until(_agentSocket, _fillBuf, "\r\n", boost::bind(&MarketConnectionTCP::handleReadFill, this, boost::asio::placeholders::error)); Logger::stream() << "Listening on agent connection:" << _agentSocket.remote_endpoint() << std::endl; return id; } void MarketConnectionTCP::handleReadFill(const boost::system::error_code& err) { if (!err) { std::istream fillStream(&_fillBuf); Fill newFill; fillStream >> newFill; if (newFill.isValid()) { Logger::stream() << "Fill received on:" << _agentSocket.remote_endpoint() << ":" << newFill << std::endl; receiveFill(newFill); } else { Logger::stream() << "Invalid fill received on:" << _agentSocket.remote_endpoint() << std::endl; } // listen again boost::asio::async_read_until(_agentSocket, _fillBuf, "\r\n", boost::bind(&MarketConnectionTCP::handleReadFill, this, boost::asio::placeholders::error)); Logger::stream() << "Listening on agent connection:" << _agentSocket.remote_endpoint() << std::endl; } else { delete this; } }

2 1

Boost compatibility with Old Compilers
by chin 14 Oct '09

14 Oct '09

HI, We are planning to use Boost version 1.39 on Windows. In docs i found the following: ---------------------------------------------------------------------------------------------------- Compilers Tested Boost's primary test compilers are: o Linux: o GCC 4.3.3 on Ubuntu Linux. o Windows: o Visual C++ 7.1 SP1, 8.0 SP1 and 9.0 SP1 on Windows XP. Boost's additional test compilers include: o Linux: o Intel 9.0 on Red Hat Enterprise Linux. o Intel 10.0 on Red Hat Enterprise Linux. o Intel 10.1 on 64-bit Linux Redhat 5.1 Server. o Intel 10.1 on Suse Linux on 64 bit Itanium. o Intel 11.0 on Red Hat Enterprise Linux. o Intel 11.1 on Red Hat Enterprise Linux. o GCC 3.4.3, GCC 4.0.1, GCC 4.2.4, GCC 4.3.3 and GCC 4.4.0 on Red Hat Enterprise Linux. o GCC 4.3.3 and GCC 4.4.0 with C++0x extensions on Red Hat Enterprise Linux. o GCC 4.1.1, 4.2.1 on 64-bit Red Hat Enterprise Linux. o GCC 4.1.2 on Suse Linux on 64 bit Itanium. o GCC 4.1.2 on 64-bit Redhat Server 5.1. o GCC Open64 4.2.2 on Red Hat Enterprise Linux. o GCC 4.3.4 on Debian unstable. o QLogic PathScale(TM) Compiler Suite: Version 3.1 on Red Hat Enterprise Linux. o GCC version 4.2.0 (PathScale 3.2 driver) on 64-bit Red Hat Enterprise Linux. o Sun 5.9 on Red Hat Enterprise Linux. o Windows: o Visual C++ 7.1 on XP. o Visual C++ 9.0 on XP. o Visual C++ 9.0 on Vista. o Visual C++ 9.0 on Vista 64-bit. o Visual C++ 9.0, using STLport 5.2, on XP and Windows Mobile 5.0. o Visual C++ 10.0 beta. o Borland 5.9.3, 6.1.0, 6.1.3. o Borland C++ Builder 2007 and 2009. o Intel C++ 11.1, with a Visual C++ 9.0 backend, on Vista 32-bit. o Intel C++ 11.1, with a Visual C++ 9.0 backend, on Vista 64-bit. o GCC 4.3.3 and 4.4.0, on Mingw with C++0x features. o Solaris: o Sun C++ 5.7, 5.8, 5.9 on Solaris 5.10. o GCC 3.4.6 on Solaris 5.10. ---------------------------------------------------------------------------------------------------- My concern is: We are supposed to use Boost both for Linux and Solaris, but the compilers being used are slightly old. On Debian Linux we have GCC 3.3 and on Solaris we have Sun WorkShop 6 update 2 C++ 5.3. Is Boost compatible with these versions? Does this list mean that Boost is not compatible with older versions of Compiler? -- View this message in context: http://www.nabble.com/Boost-compatibility-with-Old-Compilers-tp25885255p258… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

TCP boost server, but non-boost client
by G, Benjamin (NSN - IN/Bangalore) 14 Oct '09

14 Oct '09

Hi, I have a server which provides configuration to different clients. This server uses boost's serialization to serialize the C++ configuration objects. Some of my clients don't want to use boost for the (de-)serialization work. Will this cause any issues? Can any client deserialize the data serialized by a boost-using entity? What are the things that I need to take care of? I did read somewhere that boost serialization should be portable (I wonder if it means the same). All help appreciated. Regards, - Ben

2 1

[asio] How to know if the io_service is runing
by Daniele Barzotti 14 Oct '09

14 Oct '09

In my library I have this code (yet used in another project) where pwork is assigned to a shared_ptr: -------------------------------------------------------------- typedef boost::shared_ptr<boost::asio::io_service::work> io_work_ptr; // Main io_service static boost::asio::io_service io_service; static boost::scoped_ptr<boost::thread> io_service_thread; static boost::asio::io_service::work* p_work; static bool thread_started; bool CreateMainThread() { if (!thread_started) { try { // create the work object on the heap p_work = new boost::asio::io_service::work(io_service); // run the IO service as a separate thread: io_service_thread.reset ( new boost::thread ( boost::bind ( &boost::asio::io_service::run, &io_service ) ) ); thread_started = !thread_started; return true; } catch (boost::thread_resource_error e) { // Failed to create the new thread return false; } } } -------------------------------------------------------------- WaveStream::WaveStream() : rx_timer_(io_service) { }; WaveStream::Test() { //Start a new timer or renew it rx_timer_.expires_from_now( boost::posix_time::milliseconds(500) ); // We managed to cancel the timer. Start new asynchronous wait. rx_timer_.async_wait( boost::bind(&WaveStream::handle_timeout, this, _1) ); } void WaveStream::handle_timeout(const boost::system::error_code& error) { .... } -------------------------------------------------------------- The timer callback is never called. Is there a way to know if the io_service is runing? Daniele.

2 2

[statechart] forward_event()
by Commander Pirx 14 Oct '09

14 Oct '09

Hi, I have a state [A] with three orthogonal substates [X,Y,Z]. The states [A] and [X] provide custom reactions for an event [E]. If processing event [E] the state machine calls first the custom reaction in [A]. This method returns with forward_event() ; After this the custom reaction in [A] is called again. And then custom reaction in [X] is called. This is a little cumbersome. Why is the custom reaction in [A] called twice? And why is the outermost state called first? It would be something easier to work vice versa. First the more "specialized" inner states could do there work and then the "generalized" outer states can do the everything else. Pirx!

3 14

problem with enable_if_c and gcc4
by Lewis Hyatt 14 Oct '09

14 Oct '09

Hello Everyone- The following code compiles fine with g++ 4.1.2 but does not compile with 4.4.1, I get an error message saying the prototype does not match any declared in the class. This happens both with Boost 1.40.0 and 1.33.1, on Debian (x86 64-bit). Does anyone know what's up with this, is there some workaround? Thanks very much. #include <boost/utility/enable_if.hpp> #include <boost/type_traits/is_base_of.hpp> #include <boost/type_traits/is_same.hpp> template<typename T> struct A { struct B {}; template<typename U> typename boost::enable_if_c< boost::is_base_of<B, U>::value && !boost::is_same<B,U>::value> ::type f(U&); }; template<typename T> template<typename U> typename boost::enable_if_c< boost::is_base_of<typename A<T>::B, U>::value && !boost::is_same<typename A<T>::B, U>::value> ::type A<T>::f(U&) {} int main() { } t.cpp:20: error: prototype for 'typename boost::enable_if_c<(boost::is_base_of::value && (! boost::is_same::value)), void>::type A<T>::f(U&)' does not match any in class 'A<T>' t.cpp:12: error: candidate is: template<class T> template<class U> typename boost::enable_if_c<(boost::is_base_of::value && (! boost::is_same::value)), void>::type A::f(U&) -Lewis

1 1

[boost][filesystem] re-assign a recursive_directory_iterator
by Sascha Ochsenknecht 14 Oct '09

14 Oct '09

Hi, should it be possible to re-assign a filesystem::recursive_directory_iterator? I tried something like the following (could strip out my code and build a small test case if needed but this would take some time): fs::path aPath = ...; // assign to some valid path const fs::recursive_directory_iterator initial(path); const fs::recursive_directory_iterator end(); fs::recursive_directory_iterator current(path); // now increment current and do something with it (traverse directories etc). // ... // Later I want to go back to initial position with: current = initial; // but this causes a crash later when traversing again, seems that the (current == end) check gives wrong results and I dereference invalid current // I tried also the following: current = fs::recursive_directory_iterator(path); // this doesn't crash but (current == end) seems to give also wrong results I don't want to create 'current' as a temporary, so constructing a new 'current' when needed. In my case it is a class member. Anyhow, I can implement a workaround for me. Is it a bug or is it not wanted to re-assign the iterator? If it is not wanted to re-assign, maybe the assignment operator should be disabled? Thanks in advance, Sascha

2 1

[log] Status & getting started?
by Allen Cronce 13 Oct '09

13 Oct '09

Hi all, Currently we're using the John Torjo boost log implementation. Nothing seems to be happening with that library, so I'm exploring moving to a different logging solution. The Andrey Semashev log candidate seems to have some steam behind it. It got reviewed in February, an "RC3" version was deposited in the vault in August, and it looks like there's recent activity in its svn repository. But it's hard to get a clear picture as to its status. Can someone (Andrey?) give me some idea as to where this library is in the acceptance process? Assuming that this library is moving forward, what's the best way to get started with it? One advantage of the Torjo library was that it was header only. Looks like the Semashev version requires building. I have some reluctant experience with building boost as a whole (because I seem to end up doing it once a year or so). But I have no experience with building individual pieces like this. We're still using boost 1.36. I can see a post from Boris Schaeling indicating that the log library from February seems to work with this version. That's good news. But we're moving to 1.40 shortly. Does it make sense to take the 1.40 sources, graft in the log candidate sources in the expected places, then turn a build of the whole shebang? If not, can someone provide pointers regarding building individual libraries? Thanks in advance for information regarding the logging library's status, and any suggestions getting started with it. Best, -- Allen Cronce

1 0

New library for RPC-calls using only boost and C++0x
by Siegfried Kettlitz 13 Oct '09

13 Oct '09

Hello boost users and developers, i'm currently writing a library for making remote procedure calls to C++ objects. The library is based on the variadic templates extension coming with C++0x (already present in GCC 4.3) in conjunction with the boost library (threads, serialization, asio). The aim is to have a library, that is easy to integrate and doesn't require additional tools. Writing it, so far, has thaught me a lot about C++, templates, variadic templates, threading, networking etc.. I post this message, because i think that this library is quite handy in situations, where a developer already uses boost libraries and wants to add some networking functionality to his/her project and the usage of variadic templates instead of additional tools is quite new. One example would be remote monitoring an application by adding a "std::string get_status()"-function to some object. Implemented as example is a chat-system with a server and clients interacting by remote calls. This example is tested with a x64-linux and win32 using the portable boost-text-serialization. Multiple clients can connect to the server via the TCP/IP-acceptor (and disconnect without crashing the system). Implemented is a console-client for text input and display and a morse client, that interacts via a digital output device (relais card), which is connected via a serial port. The serial port and the digital output driver are both also connected via the rpc-system and can be physically located on separate computers. At this point, i have the basic bits together and a working rpc-library, that needs to be cleaned, refined and extended to match the practical needs. This means, that some programs and libraries have to be written, which use the rpc-library and show its bugs and limitations. The downside of it is, that the interface of the rpc-library may change one more time until it can be considered stable. Therefore it would not be good to test it widely in libraries posing similar requirements, but to test it with a variety of possible applications and provide the implementations as examples and (regression-/unit-)tests. - One library for Measurement/Automation is already in development. - The chat-server/client exists. - A transaction based game server is under consideration. - Some distributed parallel computing application with dynamic joining/leaving of clients. Can you give me some more ideas of different applications, which are easy to implement but yet useful? What would you like to have implemented and accessible by an rpc-library? One speed measurement using local (shared memory) channels resulted in 20000 calls/s and 60000 messages/s on a 1.8GHz Opteron. Do you know how this compares to other implementations on similar hardware? The TCP/IP-channel implementation using ASIO resulted in only about 100 synchronous calls/second regardless of the payload and almost no CPU load, which suggests that ASIO somewhere "sleeps" on linux systems for a few milliseconds. This would be fixed in some future implementation. Using asynchronous calls (1000 open calls) again leads to about 10000 calls/s. I'll have a closer look on what can be merged with "channels" from the boost vault[1], but from the first look it seems that "channels" targets a much more general approach. After the first tries, i realized, that my implemention has to be very specific (e.g. templates only where necessary). So, the design approaches might be too different. After the refinement, cleanup, some testing and documenting, i'd like to publish the rpc-library (and libraries based on it) under GPL- or boost-license. Then you'll hear from me again. In future i'll probably work 2-8 hours per week on the library and use it in some projects, but there's plenty of work left to do in various regions. This will leave space for other developers who might want to use and modify it to fit their needs. Some of the harder parts that would need implementation are redundant parallel connections and advanced routing, authentication of nodes, signing of messages, encryption of payload, access restriction to objects. Please let me know if * you are interested in this library in some way * have comments * know very similar libraries or * are interested in serialization using variadic function templates. Regards, Siegfried Kettlitz --- A short introduction on the library: * "nodes" are the central parts. They contain a factory for objects, store objects and forward "messages" to objects or other nodes in the network and contain a "scheduler" for executing function calls. The nodes are connected by "channels", which forward messages between the two connected nodes. Currently there is a TCP/IPv4 implementation using ASIO and direct forwarding. * Nodes connected by channels form a network, create and monitor virtual connections between each other. The network map is used to route messages between connected nodes. * An object has to supply a template for a class name (only if it can be constructed by the factory) and a template for registering the callable functions (also for abstract base classes which can't be constructed). * A function call is executed asynchronously (wrapper for synchronous call exists). The call to node.call(...) returns a "link_caller"-object. The function to be executed itself can optionally have "link_callee" as the first argument (which is invisible for the caller). The "link_caller"/"link_callee" is used for synchronization (wait for call to begin/finish execution), message forwarding (push/pop strings at caller/callee) and transfer/extraction of the return value. * Objects of class hierarchies with abstract base classes are possible and handled transparently. * Objects can be constructed by the factory of a node or an existing (externally constructed) object can be registered by the node. * Objects don't necessarily need to know (be modified, inherit something etc.) that they are part of the RPC-system and some of their functions are called remotely. * Objects can be aware that they are constructed by the factory and can, on construction be informed about their identity and get a reference to the node to make remote calls themselves. * An object is identified by a "reference" consisting of the "node_id" and the "object_id". * Parameters are passed (serialized, deserialized) by value. All function parameters must have the possibility to be serialized. Modifying referenced parameters won't affect the parameter at the caller. Pointers obviously won't work between nodes not sharing the same memory-address-space. * Called functions can use "link_callee" to make remote calls themselves, regardless of the object. * Priorities are assigned to calls and affect message forwarding and scheduling. * Calls to objects can be transformed into a boost::function using node.bind(...). * If a called function throws, the exception is forwarded as rpc::exception or a more specialized exception class. The exception is thrown at the caller, when waiting for interaction with the callee (e.g. wait for return value). * Template functions as targets are possible when specifying the template parameters of the function pointer when registering the function. * There is no need to use macros at all, although macros could be used to simplify some things. ---------- // Example for creating and calling an object. // Create a service. boost::asio::io_service node_io_service; // Create a node. rpc::node node_s(node_io_service, config); // Register the builder in order to build the server object later. node_s.register_builder<devicelib::chat_server_impl>(); // Register the interface of the client to be able to make calls to it. node_s.register_interface<devicelib::chat_client>(); // Create the server object. rpc::reference cs( node_s.get_id(), node_s.allocate_object_template<devicelib::chat_server_impl>() ); // Store the server in name server. // rpc::reference( node_s.get_id(), rpc::oid_simple_object_name_server ) -> A reference to the object_name_server. // rpc::sched_default() -> Default scheduling parameters. // &rpc::simple_object_name_server::store, cs -> function to call. // cs, "chat_server_object" -> function parameters. node_s.wrap_call( rpc::reference( node_s.get_id(), rpc::oid_simple_object_name_server ), rpc::sched_default(), &rpc::simple_object_name_server::store, cs, "chat_server_object" ); ---------- // Example for abstract base class. namespace devicelib { class chat_server : public chat_types { public: virtual void receive( std::string xml_message ) = 0; virtual user_id_t connect_user( rpc::reference a_client, std::string xml_user_info ) = 0; virtual std::string query_user( user_id_t id ) = 0; virtual void disconnect_user( user_id_t user ) = 0; virtual void join_room( user_id_t user, room_id_t room ) = 0; virtual std::list<user_id_t> list_users( ) = 0; virtual std::list<room_id_t> list_rooms( ) = 0; }; } --------------- // Example for registering the interface of the server object. // The template is declared in namespace rpc, therefore we need to define it there. namespace rpc { // For the base object. template<> void register_proxy_functions<devicelib::chat_server>( function_call_proxy<devicelib::chat_server>& ar_proxy ) { // Register the functions of the abstract base object using unique strings. ar_proxy.register_interface( &devicelib::chat_server::connect_user, "&chat_server::connect_user" ); ar_proxy.register_interface( &devicelib::chat_server::query_user, "&chat_server::query_user" ); ar_proxy.register_interface( &devicelib::chat_server::disconnect_user, "&chat_server::disconnect_user" ); ar_proxy.register_interface( &devicelib::chat_server::join_room, "&chat_server::join_room" ); ar_proxy.register_interface( &devicelib::chat_server::list_users, "&chat_server::list_users" ); ar_proxy.register_interface( &devicelib::chat_server::list_rooms, "&chat_server::list_rooms" ); } // For each implementation. template<> void register_proxy_functions<devicelib::chat_server_impl>( function_call_proxy<devicelib::chat_server_impl>& ar_proxy ) { // Register the functions of the base object. register_proxy_functions<devicelib::chat_server>( (function_call_proxy<devicelib::chat_server>&) ar_proxy ); // Make the functions of this object available. ar_proxy.register_interface( &devicelib::chat_server_impl::connect_user, &devicelib::chat_server::connect_user ); ar_proxy.register_interface( &devicelib::chat_server_impl::disconnect_user, &devicelib::chat_server::disconnect_user ); ar_proxy.register_interface( &devicelib::chat_server_impl::join_room, &devicelib::chat_server::join_room ); ar_proxy.register_interface( &devicelib::chat_server_impl::list_users, &devicelib::chat_server::list_users ); ar_proxy.register_interface( &devicelib::chat_server_impl::list_rooms, &devicelib::chat_server::list_rooms ); } // The implementation can be built, the base object not. template<> std::string class_builder_name<devicelib::chat_server_impl>() { // Give it an unique name here. return "chat_server_impl"; } } ----------------- 1: http://www.boostpro.com/vault/index.php?&direction=0&order=&directory=Distr…

8 12

[iterators] advance and distance with custom random-access iterators
by Sebastian Weber 13 Oct '09

13 Oct '09

Hi! Is there any progress in the bug #2539 ?? It seems that the patch published there which is against a rather antiquated boost version is the only solution to the problem of iterator_adaptor/facade constructs which are random_access-tagged in order to make use of true random access operations in distance/advance operations. This is critical in performance relevant code... So is there any progress in incorporating some fixes in the public trunk? I understand that the problem is a misconception of the stl there, but an official solution would be great here... Sebastian

1 0

[BGL] saving all-pair shortest paths
by Shyamendra Solanki 13 Oct '09

13 Oct '09

Hi, I understand that both the floyd-warshall and johnson algorithms populate the DistanceMatrix for shortest distances between any pair of vertices. Could you give some hint how to get the actual shortest paths? Thanks, Shyam

2 5

Multi Index with BOOST_AUTO question.
by Surya Kiran Gullapalli 13 Oct '09

13 Oct '09

Hello all,I'm a newbie to multi-index. I ran into a strange problem with VS2008. When using BOOST_AUTO with multi-index I'm getting compilation errors (C2248) . Please see the following code. *<snip>* * * #include <iostream> #include <string> using namespace std ; #include <boost/multi_index_container.hpp> #include <boost/multi_index/mem_fun.hpp> #include <boost/multi_index/ordered_index.hpp> #include <boost/multi_index/identity.hpp> #include <boost/multi_index/member.hpp> #include <boost/foreach.hpp> #include <boost/typeof/typeof.hpp> using namespace boost ; using namespace boost::multi_index ; class Test { friend bool operator< (const Test& p_lhs, const Test& p_rhs) { return p_lhs._i < p_rhs._i ; } friend ostream& operator << (ostream& os, const Test& p_test) { os << "Integer: " << p_test._i << "\tString: " << p_test._s ; return os ; } private: int _i ; string _s ; public: Test (int i, string s): _i(i), _s(s) { } string getString (void) const { return _s ; } } ; struct byNumber { } ; struct byString { } ; int main (void) { typedef multi_index_container <Test, indexed_by < ordered_unique<tag<byNumber>, identity <Test> > , ordered_non_unique < tag<byString>, BOOST_MULTI_INDEX_CONST_MEM_FUN(Test, string, getString) > > > Container ; typedef Container::index<byNumber>::type TestByNumber ; typedef Container::index<byString>::type TestByString ; Container c ; c.insert (Test(5, "Surya")) ; c.insert (Test(15, "Kiran")) ; //TestByNumber& tests = c.get<byNumber>() ; BOOST_AUTO(tests, c.get<byNumber>()) ; BOOST_FOREACH (Test t, tests) cout << t << endl ; return 0 ; } *</snip>* * * Compilation for this case fails with C2248. If I replace the BOOST_AUTO with the previous line's statement, compilation goes well. This happens with VS2008 only. with VS2005, there's no issue with BOOST_AUTO. Am I missing something here? Thanks, Surya

2 6

C# LINQ is cool. What about boost.qlang?
by Germán Diago 13 Oct '09

13 Oct '09

Hello. I've been reading a bit about C#'s linq and it's very cool in my opinion. I would like to see something similar in c++, and boost is the ideal place I think. As I would like to see something similar, I started a prototype adapted to c++. For now I've been playing with the basics: -from, where and select operators. -it just can be used (for now) with from, where and select, all in a row, but this will change. -it should work with any range: containers, boost.range, etc. -it's just a c++0x version. It works great with lambdas (gcc svn has lambdas). -Can use any boost.fusion sequence as the object type to query. (Although the plan is to be able to give data providers to use to query any type of source. The prototype works in the following way. For example (C++0x) : vector<int> numbers = {1, 2, 3, 4, 8, 5, 9 , 24, 19, 15, 12 } auto query = from(numbers).where([](int i) { return i < 15 && i > 10}). select(fields::full_object); This will construct an object with the query (without evaluating it). The original Range CANNOT be modified. If you want to modify , copy the result to a new container (in the future call query.to_vector(), query.to_list() to return a list or vector of objects. This will evaluate everything: for (auto it = query.begin(); it != query.end(); ++it) cout << *it << endl; You can traverse the range as many times as you like, and If you have, for example: struct Doctor { string name_; string surname_; string specializedin_; }; BOOST_FUSION_ADAPT_STRUCT(Doctor...) you can do, for example: vector<Doctor> doctors = {....}; auto query = from(doctors).where([](const Doctor & d) { return d.surname_ == "Smith"; }). select(fields::_1); The plan to improve readability is to use fusion associative sequence to do: auto query = from(doctors).where([](const Doctor & d) { return d.surname_ == "Smith"; }). select(Doctorfields::name, Doctorfields::specializedin); The query will return a tuple<string, string> in this case (the one before this would return tuple<string>. Queries with multiple fields don't work for now. A first implementation with the ability to select the full object or a field number (not several, but planned) is attached. Test it if you want and tell me what you think. The plan would be the same as the .NET platform: to be able to query XML, text files, objects, databases... giving extension points to add data providers. Another thing that doesn't work right now is to nest a query inside another query, but I'll work on it. Feedback is welcome.

2 2

Re: [Boost-users] 1.40 and pch - gcc problems?
by Vial, Florent 13 Oct '09

13 Oct '09

Hi everyone, I downloaded and built bjam-3.17 under linux x86_64 (RHEL 4.6). I then built boost 1.40.0 using following command line: ../boost-jam-3.1.17/bin.linuxx86_64/bjam --build-dir=/tmp/build-boost-1_40_0 stage --build-type=complete --layout=tagged My user-config.jam has just been modified so that the toolset used is gcc4.2.3. I got following warnings in the math library: gcc.compile.c++ /tmp/build-boost-1_40_0/boost/bin.v2/libs/math/build/gcc-4.2.3/release/l ink-static/assoc_laguerrel.o libs/math/build/../src/tr1/assoc_laguerrel.cpp:6:21: warning: /tmp/build-boost-1_40_0/boost/bin.v2/libs/math/build/gcc-4.2.3/release/l ink-static/../src/tr1/pch.hpp.gch: created and used with different settings of -fpic gcc.compile.c++ /tmp/build-boost-1_40_0/boost/bin.v2/libs/math/build/gcc-4.2.3/release/l ink-static/assoc_legendrel.o libs/math/build/../src/tr1/assoc_legendrel.cpp:6:21: warning: /tmp/build-boost-1_40_0/boost/bin.v2/libs/math/build/gcc-4.2.3/release/l ink-static/../src/tr1/pch.hpp.gch: created and used with different settings of -fpic gcc.compile.c++ /tmp/build-boost-1_40_0/boost/bin.v2/libs/math/build/gcc-4.2.3/release/l ink-static/betal.o [snip lots of them] Then the serialization library reports following warnings: gcc.compile.c++ /tmp/build-boost-1_40_0/boost/bin.v2/libs/serialization/build/gcc-4.2.3/ release/link-static/xml_grammar.o In file included from ./boost/archive/impl/basic_xml_grammar.hpp:59, from libs/serialization/src/xml_grammar.cpp:16: ./boost/spirit/core/non_terminal/rule.hpp:18:4: warning: #warning "This header is deprecated. Please use: boost/spirit/include/classic_rule.hpp" In file included from libs/serialization/src/basic_xml_grammar.ipp:20, from libs/serialization/src/xml_grammar.cpp:63: ./boost/spirit/core/composite/operators.hpp:18:4: warning: #warning "This header is deprecated. Please use: boost/spirit/include/classic_operators.hpp" In file included from libs/serialization/src/basic_xml_grammar.ipp:21, from libs/serialization/src/xml_grammar.cpp:63: ./boost/spirit/core/composite/actions.hpp:18:4: warning: #warning "This header is deprecated. Please use: boost/spirit/include/classic_actions.hpp" In file included from libs/serialization/src/basic_xml_grammar.ipp:22, from libs/serialization/src/xml_grammar.cpp:63: ./boost/spirit/core/primitives/numerics.hpp:18:4: warning: #warning "This header is deprecated. Please use: boost/spirit/include/classic_numerics.hpp" gcc.compile.c++ /tmp/build-boost-1_40_0/boost/bin.v2/libs/serialization/build/gcc-4.2.3/ release/link-static/xml_iarchive.o In file included from ./boost/archive/impl/basic_xml_grammar.hpp:59, from ./boost/archive/impl/xml_iarchive_impl.ipp:41, from libs/serialization/src/xml_iarchive.cpp:32: ./boost/spirit/core/non_terminal/rule.hpp:18:4: warning: #warning "This header is deprecated. Please use: boost/spirit/include/classic_rule.hpp" However, the build seems to go through. Then i do following: ../boost-jam-3.1.17/bin.linuxx86_64/bjam --build-dir=/tmp/build-boost-1_40_0 --build-type=complete --layout=tagged stage I then get following messages for the math library: gcc.compile.c++ /tmp/build-boost-1_40_0/boost/bin.v2/libs/math/build/gcc-4.2.3/debug/lin k-static/runtime-link-static/assoc_laguerre.o libs/math/build/../src/tr1/assoc_laguerre.cpp:6:21: warning: /tmp/build-boost-1_40_0/boost/bin.v2/libs/math/build/gcc-4.2.3/debug/lin k-static/runtime-link-static/../src/tr1/pch.hpp.gch: not used because `_REENTRANT' not defined gcc.compile.c++ /tmp/build-boost-1_40_0/boost/bin.v2/libs/math/build/gcc-4.2.3/debug/lin k-static/runtime-link-static/assoc_legendre.o libs/math/build/../src/tr1/assoc_legendre.cpp:6:21: warning: /tmp/build-boost-1_40_0/boost/bin.v2/libs/math/build/gcc-4.2.3/debug/lin k-static/runtime-link-static/../src/tr1/pch.hpp.gch: not used because `_REENTRANT' not defined gcc.compile.c++ /tmp/build-boost-1_40_0/boost/bin.v2/libs/math/build/gcc-4.2.3/debug/lin k-static/runtime-link-static/beta.o libs/math/build/../src/tr1/beta.cpp:6:21: warning: /tmp/build-boost-1_40_0/boost/bin.v2/libs/math/build/gcc-4.2.3/debug/lin k-static/runtime-link-static/../src/tr1/pch.hpp.gch: not used because `_REENTRANT' not defined [snip lots of them] I then type as root: ../boost-jam-3.1.17/bin.linuxx86_64/bjam install --prefix=/usr/local/boost1400-gcc423 And get following installation: [snip] common.copy /usr/local/boost1400-gcc423/lib/libboost_iostreams.a common.copy /usr/local/boost1400-gcc423/lib/libboost_math_tr1.a common.copy /usr/local/boost1400-gcc423/lib/libboost_math_tr1f.a common.copy /usr/local/boost1400-gcc423/lib/libboost_math_tr1l.a ...on 7500th target... common.copy /usr/local/boost1400-gcc423/lib/libboost_math_c99.a common.copy /usr/local/boost1400-gcc423/lib/libboost_math_c99f.a common.copy /usr/local/boost1400-gcc423/lib/libboost_math_c99l.a common.copy /usr/local/boost1400-gcc423/lib/libboost_program_options.a common.copy /usr/local/boost1400-gcc423/lib/libboost_python.a common.copy /usr/local/boost1400-gcc423/lib/libboost_serialization.a common.copy /usr/local/boost1400-gcc423/lib/libboost_wserialization.a common.copy /usr/local/boost1400-gcc423/lib/libboost_signals.a common.copy /usr/local/boost1400-gcc423/lib/libboost_prg_exec_monitor.a common.copy /usr/local/boost1400-gcc423/lib/libboost_unit_test_framework.a common.copy /usr/local/boost1400-gcc423/lib/libboost_thread.a common.copy /usr/local/boost1400-gcc423/lib/libboost_wave.a ...updated 7511 targets... However, for each library, i only have 2 files installed + 1 symbolic link: -rw-r--r-- 1 root root 148826 Oct 13 17:22 libboost_date_time.a lrwxrwxrwx 1 root root 28 Oct 13 17:22 libboost_date_time.so -> libboost_date_time.so.1.40.0 -rwxr-xr-x 1 root root 74552 Oct 13 17:22 libboost_date_time.so.1.40.0 Any idea what i might have done wrong ? (compiling under Win32/MSVC90 was no problem at all surprisingly) Thanks in advance, Florent ---------- Forwarded message ---------- From: "John Maddock" <j...(a)johnmaddock.co.uk> Date: 4 sep, 10:25 Subject: 1.40 and pch - gcc problems? To: BOOST Archives >I just got1.40and tried building. I kept having some pieces fail > with a complete build, sometimes I had gcc that ran until resources > exausted, sometimes the compiler would segfault. Eventaully I tracked > it down to the math library. After noticing the many errors from the > gch (things like : error _REENTERANT not defined or used diffrent > -fpic). I disabledpchfor the math library (actually the boost > project and the libs/math/test) and I did not have any more issues. Can you be more specific about the error messages? A: bjam --with-math will build just the math lib, if you could post the complete output that would be most helpful. There's something strange going on here though as it builds just fine locally here (ubuntu Linux), and on our regression test machines (various Linux flavours). Thanks, John. JOIN US FOR THE JOURNEY. View Our New Digital Cameras: www.arridigital.com Arnold & Richter Cine Technik GmbH & Co. Betriebs KG Sitz: Munchen - Registergericht: Amtsgericht Munchen - Handelsregisternummer: HRA 57918 Personlich haftender Gesellschafter: Arnold & Richter Cine Technik GmbH Sitz: Munchen - Registergericht: Amtsgericht Munchen - Handelsregisternummer: HRB 54477 Geschaftsfuhrer: Franz Kraus; Dr. Martin Prillmann

1 0

[Property map] 1.40.0 breaks boost.graph python bindings
by John Reid 13 Oct '09

13 Oct '09

I'm using gcc 4.2.4 on Ubuntu. The boost.graph python bindings (http://www.osl.iu.edu/~dgregor/bgl-python/) work fine with boost 1.39. When I try with boost 1.40 I get many errors such as the following: ./boost/graph/python/resizable_property_map.hpp:101: error: ‘class boost::vector_property_map< boost::default_color_type, boost::graph::python::basic_index_map< boost::graph::python::basic_descriptor<boost::detail::edge_desc_impl<boost::bidirectional_tag, void *>, boost::bidirectionalS>, boost::adj_list_edge_property_map< boost::bidirectional_tag, long unsigned int, const long unsigned int &, void *, const boost::property<boost::edge_index_t, long unsigned int, boost::no_property>, boost ::edge_index_t>>>’ has no member named ‘get_store’ Does anyone know what changed between 1.39 and 1.40 to break this? The Readme.txt that comes with boost 1.40 suggests that nothing was updated in the property map library. BTW it doesn't compile with gcc 4.3 either but then neither does it compile with boost 1.39 (albeit for different reasons). I can provide all of the error messages if needed. John.

2 11

Re: [Boost-users] [Boost.MPL]is it possible to generate types
by Tan, Tom (Shanghai) 13 Oct '09

13 Oct '09

Thanks, it works like a charm. Tan, Tom (Shanghai) wrote: > I have a templated class > > template<class U, class V, class W> > class S > { > //... implementations > }; > > and some stock type implementations for type U, V and W: > > typedef boost::mpl::vector<U0, U1> u_types; > typedef boost::mpl::vector<V0, V1, V2, V3, V4> u_types; > typedef boost::mpl::vector<W0, W1, W2, W3, W4> w_types; > > I want to test class S with all possible combinations of the template > arguments, > > typedef boost::mpl::vector< > S<U0,V0,W0>, > S<U0,V0,W1>, > // ... > S<U1,V4,W4>, > > s_types; > > like this: > boost::mpl::for_each<s_types>(test_func). > > The only problem is there are 2*5*5 = 50 combinations that I do not > wish to type in one by one. > > Is there a way to generate all the combinations with boost::mpl or > Boost.Preprocessor? >> Look at BOOST_PP_SEQ_FOR_EACH_PRODUCT In Christ, Steven Watanabe ***************************************

1 0

Re: [Boost-users] Boost-users Digest, Vol 2134, Issue 4
by Tan, Tom (Shanghai) 13 Oct '09

13 Oct '09

Thanks, it works like a charm. Tan, Tom (Shanghai) wrote: > I have a templated class > > template<class U, class V, class W> > class S > { > //... implementations > }; > > and some stock type implementations for type U, V and W: > > typedef boost::mpl::vector<U0, U1> u_types; > typedef boost::mpl::vector<V0, V1, V2, V3, V4> u_types; > typedef boost::mpl::vector<W0, W1, W2, W3, W4> w_types; > > I want to test class S with all possible combinations of the template > arguments, > > typedef boost::mpl::vector< > S<U0,V0,W0>, > S<U0,V0,W1>, > // ... > S<U1,V4,W4>, > > s_types; > > like this: > boost::mpl::for_each<s_types>(test_func). > > The only problem is there are 2*5*5 = 50 combinations that I do not > wish to type in one by one. > > Is there a way to generate all the combinations with boost::mpl or > Boost.Preprocessor? >> Look at BOOST_PP_SEQ_FOR_EACH_PRODUCT In Christ, Steven Watanabe ***************************************

1 0

[boost C++] algorithm for shortest path
by Boost lzw 13 Oct '09

13 Oct '09

Hi there, For the following unidirectional (one-direct only) pairs: A-B; G-H; B-D; D-G; H-K; K-D; The shortest path between A and D is: A-B-D, but none between A and H. Which Boost library should I use to develop such an algorithm or any hint on design it ? Thanks in advance. Robert

2 1

Formal Review of Boost.Polygon extended one more week: until September 9, 2009
by Fernando Cacciola 13 Oct '09

13 Oct '09

Dear boost users, The review of Boost.Polygon was initially scheduled to end today. However, the discussions are in their best moment only now so the review period was extended by one week, until September 9, 2009 (that is next Wednesday). Best Fernando Cacciola Review Manager

9 12

[python] Alternative to explicitly defining function pointers?
by Boris Schaeling 13 Oct '09

13 Oct '09

Is it possible to simplify this code without defining a function pointer? ----- struct X { void y(std::string) { } std::string y() { return ""; } }; std::string (X::*get_y)() = &X::y; class_<X>("X").add_property("y", get_y); ----- I tried to set the signature but if the documentation is right signatures only make sense for function objects - so this code doesn't work: class_<X>("X").add_property("y", make_function(&X::y, default_call_policies(), mpl::vector<std::string>())); Anything else Boost.Python offers to make adding properties even easier? If there is nothing I know at least that I didn't miss a shortcut and have to define function pointers myself. Boris

2 1

[PREPROCESSOR] Working around the 256 element limit for sequences
by Rush Manbert 13 Oct '09

13 Oct '09

We define exception error codes and other useful information like this: #define EXCEPTION_TABLE \ ( (enumName0, "description string", "another sting", "yet another string") ) \ ( (enumName1, "description string", "another sting", "yet another string") ) \ . . . // End EXCEPTION_TABLE def Then we write a macro that creates an enum like this: #define ENUM_ERROR_CODES(EXCEPTION_TABLE_MACRO_NAME, firstErrorCodeValue)\ public: typedef enum \ { \ \ BOOST_PP_SEQ_FOR_EACH_I(MAKE_EXCEPTION_CODE_ENUM, ~, EXCEPTION_TABLE_MACRO_NAME) \ } ErrorCodesT; \ // End macro definition and we invoke ENUM_ERROR_CODES as: ENUM_EROR_CODEAS(EXCEPTION_TABLE, 1) This has worked just beautifully until recently. Now we're trying to use this code to define an enum (and other things) based on an EXCEPTION_TABLE that carries error code for a hardware device. There are about 500 of them. I ran into the 256 element limitation for sequences. I have tried rewriting the enum macro like this: #define ENUM_ERROR_CODES(EXCEPTION_TABLE_MACRO_NAME, firstErrorCodeValue)\ public: typedef enum \ { \ \ BOOST_PP_SEQ_FOR_EACH_I(MAKE_EXCEPTION_CODE_ENUM, ~, BOOST_PP_SEQ_SUBSEQ(EXCEPTION_TABLE_MACRO_NAME, 0, 250))\ BOOST_PP_SEQ_FOR_EACH_I(MAKE_EXCEPTION_CODE_ENUM, ~, BOOST_PP_SEQ_SUBSEQ(EXCEPTION_TABLE_MACRO_NAME, 250, 250))\ BOOST_PP_SEQ_FOR_EACH_I(MAKE_EXCEPTION_CODE_ENUM, ~, BOOST_PP_SEQ_SUBSEQ(EXCEPTION_TABLE_MACRO_NAME, 500, 250))\ BOOST_PP_SEQ_FOR_EACH_I(MAKE_EXCEPTION_CODE_ENUM, ~, BOOST_PP_SEQ_SUBSEQ(EXCEPTION_TABLE_MACRO_NAME, 750, 250))\ } ErrorCodesT; \ // End macro definition thinking that I could just peel off groups of 250, but that doesn't work. I can peel off the first N, where N is <= the size of the sequence, but I certainly can't do what I wrote. Each of our exception classes is defined this way, and the number of elements in each EXCEPTION_TABLE is different for each. Is there some standard method for working around this problem? Thanks, Rush

1 0

exception error_info list?
by denis 12 Oct '09

12 Oct '09

Hi, what do you think about exposing the error_info-map of boost::exception? I would like to get all attached error infos from one exception. Then, everyone could implement his own version of diagnostic_information() without relying on boost internals. Beside that, I had another idea: When translating an exception it would be possible to copy all error_infos from the originating exception to the new one. How do you handle this loss of information at the time? thanks.

3 6

Numpy ndarray as argument or return value using boost python
by Pim Schellart 12 Oct '09

12 Oct '09

Hi Everyone, I tried to find a good example for this but after spending two days on google and one day getting pyublas to compile I decided to call for help. I want to give a numpy ndarray as an argument to a c++ method, calculate something and return the output as an ndarray to Python. I would prefer not to use another library (such as PyUblas) for this so I do not have to add another dependency to my program. Since the latest information on boost python is quite outdated (uses numeric) I would like to know the following. 1. Is boost python still maintained or should I switch to another tool. 2. Is numpy supported, and if so, 3. can someone give me a basic example of how to use it. Kind regards, Pim Schellart

2 1

[BGL] read_graphviz and Bundle Properties
by Giuseppe Di Guglielmo 12 Oct '09

12 Oct '09

Dear all, here http://www.boost.org/doc/libs/1_40_0/libs/graph/doc/read_graphviz.html is reported how to use the read_graphviz function with old style "property list". How can I use the read_graphviz() function with bundle properties? This is my graph-type definition --- struct VertexId_t { std::size_t id; }; struct EdgeId_t { std::size_t id; }; typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, VertexId_t, EdgeId_t> Graph_t; --- And this is the DOT file: --- G { 0 [id="v0"]; 1 [id="v1"]; 0->0 [id="e0"]; 0->0 [id="e1"]; 0->1 [id="e2"]; } --- Cheers, G.

1 0

[Proto] proto::function and constness
by Kim Kuen Tang 12 Oct '09

12 Oct '09

Hi all, let _o_ be any proto terminal and v a vector. I would like to extract the vector v from the expression _o_(v) to do some modification on this vector. For this purpose i defined a grammar Rhs to extract the most right hand side of the tree. But unfortunately the compiler is asking me for constness for this code: boost::result_of<Rhs(Expr)>::type & result = Rhs()(expr); Whereas the expression _o_ + v compiles fine without asking me for constness. Am I missing something? Best regards, Kim Here is the code to demonstrate the problem. # include <vector> # include <iostream> # include <algorithm> # include <boost/proto/proto.hpp> namespace proto = boost::proto; namespace mpl = boost::mpl; using proto::_; template<typename Expr> struct MixedExpr; struct MixedDomain : proto::domain<proto::generator<MixedExpr> > {}; template<typename Expr> struct MixedExpr : proto::extends<Expr, MixedExpr<Expr>, MixedDomain> { explicit MixedExpr(Expr const &expr) : proto::extends<Expr, MixedExpr<Expr>, MixedDomain>(expr) {} }; struct oo { friend std::ostream &operator<<(std::ostream &s, oo const&) { return s << "oo"; } }; proto::terminal<oo>::type const _o_ = {{}}; template<typename T> struct IsMixed : mpl::false_ {}; template<typename T, typename A> struct IsMixed<std::vector<T, A> > : mpl::true_ {}; namespace MixedOps { BOOST_PROTO_DEFINE_OPERATORS(IsMixed,MixedDomain) }; namespace boost { namespace proto { template<typename T, typename A> std::ostream &operator<<(std::ostream &s, std::vector<T, A> const& ) { return s << "std::vector"; } }} struct Rhs : proto::or_< proto::when<proto::terminal<_>, proto::_value > ,proto::when<_, Rhs(proto::_child1)> > {}; template<typename Expr> void o_o(Expr& expr) { proto::display_expr(expr); boost::result_of<Rhs(Expr)>::type & result = Rhs()(expr); std::fill(result.begin(), result.end(),2); }; int main() { using namespace MixedOps; std::vector<int> u(10),v(10); //o_o( _o_(v) ); //uncomment this won't compile o_o( u+v ); std::copy(v.begin(),v.end(),std::ostream_iterator<int>(std::cout,",") ); std::cout<<std::endl; return 1; }

2 2

graphlib changes in 1.40
by Ralph Gauges 12 Oct '09

12 Oct '09

Hi, I use the graph library in some of my programs and I recently moved to boost 1.40 because older version did not work on snow leopard. I noticed that although the changelog does not mention any changes in the graph library, some of the layout algorithms have changes (e.g. random layout and fruchterman reingold) in the way they are called. They seem to use some new topology concept, unfortunately the documentation for those algorithms have not been updated. I was wondering if there is any updated documentation especially on the fruchterman reingold algorithm. I tried to guess what the new parameters mean, but so far I have not been able to get the same results as with the graph library from 1.39. No matter how I set the values so far, all my nodes end up essentially in the same place, although they are all disconnected and I would expect them to be spread out. Thanks a lot Ralph

2 6

boost-users@lists.boost.org
by hamidouche 12 Oct '09

12 Oct '09

hello I wanna build boost1_40 on a linux 64 machine (this is the my machine configuration) 2.6.28-11-generic #42-Ubuntu SMP Fri Apr 17 01:58:03 UTC 2009 x86_64 GNU/Linux compiler Intel 11.0 when I run ./bjam --toolset=intel I have this error message "icpc" -c -xc++ -O3 -w1 -inline-level=2 -pthread -fPIC -DBOOST_ALL_NO_LIB=1 -DBOOST_SERIALIZATION_DYN_LINK=1 -DNDEBUG -I"." -c -o "bin.v2/libs/serialization/build/intel-linux/release/threading-multi/basic_text_iprimitive.o" "libs/serialization/src/basic_text_iprimitive.cpp" ...failed intel-linux.compile.c++ bin.v2/libs/serialization/build/intel-linux/release/threading-multi/basic_text_iprimitive.o... intel-linux.compile.c++ bin.v2/libs/serialization/build/intel-linux/release/threading-multi/basic_text_oprimitive.o (0): internal error: backend signals compilation aborted for libs/serialization/src/basic_text_oprimitive.cpp (code 4) "icpc" -c -xc++ -O3 -w1 -inline-level=2 -pthread -fPIC -DBOOST_ALL_NO_LIB=1 -DBOOST_SERIALIZATION_DYN_LINK=1 -DNDEBUG -I"." -c -o "bin.v2/libs/serialization/build/intel-linux/release/threading-multi/basic_text_oprimitive.o" "libs/serialization/src/basic_text_oprimitive.cpp" ...failed intel-linux.compile.c++ bin.v2/libs/serialization/build/intel-linux/release/threading-multi/basic_text_oprimitive.o... intel-linux.compile.c++ bin.v2/libs/serialization/build/intel-linux/release/threading-multi/binary_iarchive.o (0): internal error: backend signals Please what wrong with this installing ? what should I change ?? Thanks

4 4

Using fftw_complex with Boost.MultiArray?
by Rhys Ulerich 12 Oct '09

12 Oct '09

Has anyone successfully used FFTW's fftw_complex typedef[1] with Boost.MultiArray? Under the covers it is an array of length two, which seems to interact poorly with MultiArray's type assumptions. The attached test.cc fails to compile on g++ 4.3 and icpc 10.1. - Rhys [1] http://www.fftw.org/doc/Complex-numbers.html

1 0

[xpressive] Shouldn't external placeholder variables allow consts?
by Ami Ganguli 12 Oct '09

12 Oct '09

I came across an interesting problem: what.let(_placeholder = this); fails to compile, because 'this' is a const pointer. A simple workaround: MyClass *_this = this; what.let(_placeholder = _this); But surely this shouldn't be necessary? Couldn't the right hand side of the let be declared const? Regards, Ami.

2 2