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

TTI library updated in the sandbox to version 1.2
by Edward Diener 10 Feb '11

10 Feb '11

I have updated the TTI library in the sandbox 'tti' directory to version 1.2. The TTI library, which is an abbreviation for the 'Type Traits Introspection' library, allows a programmer to introspect at compile time the inner elements of a C++ type. The introspection process depends on specifying the name of the inner element by different macros for different types of elements, and then using a generated metafunction to determine whether that element exists within the enclosing type. The inner elements which can be introspected are type, class template, member data, member function, static member data, and static member function. The main feature of the update is a set of macros generating metafunction classes for passing the metafunctions of the library as metadata. The documentation has also been updated and the code implementation has been made easier to follow. The TTI library is based on the type_traits_ext portion of the Concept Traits Library, with improvements and additions, and also reproduces functionality ( without changing existing code ), for the purposes of completeness, from Boost.MPL regarding introspection of types and templates. The purpose of the library is to provide a consistent set of interfaces for doing compile-time introspection of a type, which other template metaprogrammers can use in their code. If you are at all interested in compile-time introspection of types, please take a look at the functionality of this library. There is a readme.txt in the top-level sandbox tti directory, for anyone browsing the sandbox for interesting libraries, which basically replicates what is written here. There is a build.txt file in the doc subdirectory for building the documentation and running the tests. The documentation is also included as part of the sandbox files for those who can not build the docs. The library has been tested and works with gcc 3.4.2, 3.4.5, 4.3.0, 4.4.0, 4.5.0-1, 4.5.2-1 and VC++ 8.0, 9.0, 10.0. It may also work with other compilers. Questions, comments, suggestions, and bug reports are all welcome.

1 0

[DateTime] convert to timeval
by John Rocha 09 Feb '11

09 Feb '11

Is there a method from the boost date time library to convert a ptime to a timeval? I see a method for converting to a struct tm, but not the other common basic time types. Thanks in advance, -=John

1 0

graph
by Soso F 09 Feb '11

09 Feb '11

Hello, I'm using BGL to build a graph which represents a network. I'm wondering if I can read a file to be the input " vertices , edges and weight" without using graphviz. Thx

3 3

why is make_shared using so much of my stack....?
by Michael Xu 09 Feb '11

09 Feb '11

Hi everyone, I've been investigating our program's memory usage, and one of the spots that I keep seeing the stack hitting its limit is when using boost::make_shared. I've written a simple test program, that completes fine when I use new... but fails with a stack overflow when I use boost::make_shared ======================== #include <iostream> #include <boost/shared_ptr.hpp> #include <boost/make_shared.hpp> using namespace std; struct arr { char arg[1024*1024]; }; struct test { struct arr array[1024]; }; int main() { test * myTest = new test(); //complete! if (!myTest) cout << "new alloc failed"; boost::shared_ptr<test> testPtr = boost::make_shared<test>(); //fails with stack overflow! if (!testPtr) { cout << "alloc failed;"; } } =========================== If you run this with a reasonable thread stack of 8 megabytes, it fails when using boost::make_shared. Here is the stack trace..... #0 boost::shared_ptr<test>::shared_ptr<test, boost::detail::sp_ms_deleter<test> >(test*, boost::detail::sp_ms_deleter<test>) () #1 boost::shared_ptr<test> boost::make_shared<test>() () #2 main () Is there a reason this happens? Thanks michael

5 6

[intrusive] insert_check and insert_commit
by Paul Rose 09 Feb '11

09 Feb '11

Hi, I have a question regarding insert_check and insert_commit on an intrusive set. I know that you must call insert_commit after calling insert_check, with no modifications to the set between the two calls. Is it OK, however, to call insert_check and then never call insert_commit (even though insert_check was successful)? Say I have objects contained in multiple sets (using multiple hooks). I want to insert a new object into each of the sets, but only if I know that the insert will succeed on all of the sets. I call insert_check on each, and if all succeed I call insert_commit on each. If any of the insert_check calls fail, I do none of the insert_commits (even though all but one might have worked) It seems like it should be OK, and the documentation doesn't say that it won't work. I'm only concerned for two related reasons: 1) insert_check is not declared const. Does this mean that the set is already partially modified? 2) insert_commit is documented as constant time. Does this mean that any red-black rebalancing was already done during insert_check? If so, what happens if I never do the insert_commit? Thanks! Paul Rose

3 4

[Function] "constness" lost on Function Signature
by nicolas david 09 Feb '11

09 Feb '11

Hi, I am using boost::function and have some issues on using it with visual studio 2005. If I declare a boost::function with some "const" argument this "constness" seems to be lost on boost function siganture. Then, future assigment to this function whith correct "const" argument lead to wrong matching. See code snipset below. This work fine under gcc 4.4 and visual 2010. ---------------------------------------------------------------------------------- #include <iostream> #include <vector> #include <boost/function.hpp> using namespace std; using namespace boost; class container_test { public: typedef boost::function<bool(const int,float,float)> FunctionType; bool static defaultFunctor(const int, float, float) { return true; } //void apply_functor( const FunctionType IsInside = defaultFunctor){} }; int main() { container_test my_container; container_test::FunctionType my_f; my_f = container_test::defaultFunctor; //my_container.apply_functor(); return 0; } ---------------------------------------------------------------------------------- error send by visual 2005 compiler with "const". If change "const int" to "int" it works. ( sorry for the "french") ---------------------------------------------------------------------------------- >main.cpp 1>..\main.cpp(22) : error C2679: '=' binaire : aucun opérateur trouvé qui accepte un opérande de partie droite de type 'bool (__cdecl *)(const int,float,float)' (ou il n'existe pas de conversion acceptable) 1> C:\Documents and Settings\dfc\Bureau\boost_1_44\boost/function/function_template.hpp(1103): peut être 'boost::function<Signature> &boost::function<Signature>::operator =<bool(__cdecl *)(int,float,float)>(Functor)' 1> with 1> [ 1> Signature=bool (int,float,float), 1> Functor=bool (__cdecl *)(int,float,float) 1> ] 1> C:\Documents and Settings\dfc\Bureau\boost_1_44\boost/function/function_template.hpp(1088): ou 'boost::function<Signature> &boost::function<Signature>::operator =(const boost::function<Signature> &)' 1> with 1> [ 1> Signature=bool (int,float,float) 1> ] 1> C:\Documents and Settings\dfc\Bureau\boost_1_44\boost/function/function_template.hpp(1110): ou 'boost::function<Signature> &boost::function<Signature>::operator =(boost::function<Signature>::clear_type *)' 1> with 1> [ 1> Signature=bool (int,float,float) 1> ] 1> C:\Documents and Settings\dfc\Bureau\boost_1_44\boost/function/function_template.hpp(1117): ou 'boost::function<Signature> &boost::function<Signature>::operator =(const boost::function3<R,T0,T1,T2> &)' 1> with 1> [ 1> Signature=bool (int,float,float), 1> R=bool, 1> T0=int, 1> T1=float, 1> T2=float 1> ] 1> lors de la tentative de mise en correspondance de la liste des arguments '(container_test::FunctionType, bool (__cdecl *)(const int,float,float))' ---------------------------------------------------------------------------------- Nicolas David

2 2

Build bimap with iterators ... + lower_bound(..) ?
by Rytuto 09 Feb '11

09 Feb '11

Hello everyone, I have just started to use boost via boost::bimap. I have a problem when using iterators to build a new bimap. Here is a sample of my code : class MyObject {...Definitions of MyObject...}; struct Position{}; // Wherever you meet Pos, it will mean Position // Define my bimap type : typedef boost::bimap< set_of<tagged<double,Position> >, multiset_of<tagged< MyObject*, MyObject> > // because at one position, I can have many objects .... is that right ? > PosMap; typedef PosMap::value_type MyObjectPos; PosMap posX ; // This posX maps the position of my objects for(MyObject::iterator it = MyObject.begin() ; it!= = MyObject.end() ; it++) { // it is an iterator on MyObjects Vector3D position = it->GetPosition() ; // Fill my map : posX.insert(MyObjectPos(position.x(), (*it))); } // Now I would like just to select a window on my posX bimap: double x = something ; double R = something else ; // PosMap::left_iterator tmp_itLowX = posX.left.lower_bound(x-R); // PosMap::left_iterator tmp_itUpX = posX.left.lower_bound(x+R); // Here is my problem : PosMap m(posX.left.lower_bound(x-R), posX.left.lower_bound(x+R)); What is wrong with this piece of code ... ? //___________________________________________________________ Here is the output from the compiler : ./boost/bimap/container_adaptor/ordered_associative_container_adaptor.hpp: In member function ‘typename boost::bimaps::container_adaptor::ordered_associative_container_adaptor_base<Base, Iterator, ConstIterator, ReverseIterator, ConstReverseIterator, KeyType, IteratorToBaseConverter, IteratorFromBaseConverter, ReverseIteratorFromBaseConverter, ValueToBaseConverter, ValueFromBaseConverter, KeyToBaseConverter, FunctorsFromDerivedClasses>::type::iterator boost::bimaps::container_adaptor::ordered_associative_container_adaptor<Base, Iterator, ConstIterator, ReverseIterator, ConstReverseIterator, KeyType, IteratorToBaseConverter, IteratorFromBaseConverter, ReverseIteratorFromBaseConverter, ValueToBaseConverter, ValueFromBaseConverter, KeyToBaseConverter, FunctorsFromDerivedClasses>::lower_bound(const CompatibleKey&) [with CompatibleKey = double, Base = boost::multi_index::detail::ordered_index<boost::multi_index::member<boost::bimaps::relation::detail::relation_storage<boost::bimaps::tags::tagged<const double, Position>, boost::bimaps::tags::tagged<MyObject* const, MyObject>, true>, double, &boost::bimaps::relation::detail::relation_storage<boost::bimaps::tags::tagged<const double, Position>, boost::bimaps::tags::tagged<MyObject* const, MyObject>, true>::left>, std::less<double>, boost::multi_index::detail::nth_layer<2, boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const double, Position>, boost::bimaps::tags::tagged<MyObject* const, MyObject>, mpl_::na, true>, boost::bimaps::detail::bimap_core<boost::bimaps::set_of<boost::bimaps::tags::tagged<double, Position>, std::less<double> >, boost::bimaps::multiset_of<boost::bimaps::tags::tagged<MyObject*, MyObject>, std::less<MyObject*> >, mpl_::na, mpl_::na, mpl_::na>::core_indices, std::allocator<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const double, Position>, boost::bimaps::tags::tagged<MyObject* const, MyObject>, mpl_::na, true> > >, boost::mpl::v_item<Position, boost::mpl::vector0<mpl_::na>, 0>, boost::multi_index::detail::ordered_unique_tag>, Iterator = boost::bimaps::detail::set_view_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::ordered_index_node<boost::multi_index::detail::index_node_base<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const double, Position>, boost::bimaps::tags::tagged<MyObject* const, MyObject>, mpl_::na, true>, std::allocator<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const double, Position>, boost::bimaps::tags::tagged<MyObject* const, MyObject>, mpl_::na, true> > > > > >, ConstIterator = boost::bimaps::detail::const_set_view_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::ordered_index_node<boost::multi_index::detail::index_node_base<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const double, Position>, boost::bimaps::tags::tagged<MyObject* const, MyObject>, mpl_::na, true>, std::allocator<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const double, Position>, boost::bimaps::tags::tagged<MyObject* const, MyObject>, mpl_::na, true> > > > > >, ReverseIterator = boost::bimaps::detail::set_view_iterator<boost::reverse_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::ordered_index_node<boost::multi_index::detail::index_node_base<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const double, Position>, boost::bimaps::tags::tagged<MyObject* const, MyObject>, mpl_::na, true>, std::allocator<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const double, Position>, boost::bimaps::tags::tagged<MyObject* const, MyObject>, mpl_::na, true> > > > > > >, ConstReverseIterator = boost::bimaps::detail::const_set_view_iterator<boost::reverse_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::ordered_index_node<boost::multi_index::detail::index_node_base<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const double, Position>, boost::bimaps::tags::tagged<MyObject* const, MyObject>, mpl_::na, true>, std::allocator<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const double, Position>, boost::bimaps::tags::tagged<MyObject* const, MyObject>, mpl_::na, true> > > > > > >, KeyType = boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const double, Position>, boost::bimaps::tags::tagged<MyObject* const, MyObject>, mpl_::na, false>, IteratorToBaseConverter = boost::bimaps::container_adaptor::support::iterator_facade_to_base<boost::bimaps::detail::set_view_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::ordered_index_node<boost::multi_index::detail::index_node_base<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const double, Position>, boost::bimaps::tags::tagged<MyObject* const, MyObject>, mpl_::na, true>, std::allocator<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const double, Position>, boost::bimaps::tags::tagged<MyObject* const, MyObject>, mpl_::na, true> > > > > >, boost::bimaps::detail::const_set_view_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::ordered_index_node<boost::multi_index::detail::index_node_base<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const double, Position>, boost::bimaps::tags::tagged<MyObject* const, MyObject>, mpl_::na, true>, std::allocator<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const double, Position>, boost::bimaps::tags::tagged<MyObject* const, MyObject>, mpl_::na, true> > > > > > >, IteratorFromBaseConverter = mpl_::na, ReverseIteratorFromBaseConverter = mpl_::na, ValueToBaseConverter = boost::bimaps::relation::detail::get_mutable_relation_functor<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const double, Position>, boost::bimaps::tags::tagged<MyObject* const, MyObject>, mpl_::na, true> >, ValueFromBaseConverter = boost::bimaps::relation::support::get_above_view_functor<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const double, Position>, boost::bimaps::tags::tagged<MyObject* const, MyObject>, mpl_::na, true> >, KeyToBaseConverter = boost::bimaps::detail::set_view_key_to_base<double, boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const double, Position>, boost::bimaps::tags::tagged<MyObject* const, MyObject>, mpl_::na, true>, boost::multi_index::member<boost::bimaps::relation::detail::relation_storage<boost::bimaps::tags::tagged<const double, Position>, boost::bimaps::tags::tagged<MyObject* const, MyObject>, true>, double, &boost::bimaps::relation::detail::relation_storage<boost::bimaps::tags::tagged<const double, Position>, boost::bimaps::tags::tagged<MyObject* const, MyObject>, true>::left> >, FunctorsFromDerivedClasses = boost::mpl::vector<mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>]’: include/MyObjectManager.icc:184: instantiated from ‘std::vector<MyObject*, std::allocator<MyObject*> > MyObjectManager<T>::FindClosestITsWithinGivenRange(const ThreeVector&, double) [with T = Object]’ kit.cc:240: instantiated from here ./boost/bimap/container_adaptor/ordered_associative_container_adaptor.hpp:257: erreur: no match for call to ‘(boost::bimaps::detail::set_view_key_to_base<double, boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const double, Position>, boost::bimaps::tags::tagged<MyObject* const, MyObject>, mpl_::na, true>, boost::multi_index::member<boost::bimaps::relation::detail::relation_storage<boost::bimaps::tags::tagged<const double, Position>, boost::bimaps::tags::tagged<MyObject* const, MyObject>, true>, double, &boost::bimaps::relation::detail::relation_storage<boost::bimaps::tags::tagged<const double, Position>, boost::bimaps::tags::tagged<MyObject* const, MyObject>, true>::left> >) (const double&)’ ./boost/bimap/detail/set_view_base.hpp:38: note: candidats sont: const Key boost::bimaps::detail::set_view_key_to_base<Key, Value, KeyToBase>::operator()(const Value&) const [with Key = double, Value = boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const double, Position>, boost::bimaps::tags::tagged<MyObject* const, MyObject>, mpl_::na, true>, KeyToBase = boost::multi_index::member<boost::bimaps::relation::detail::relation_storage<boost::bimaps::tags::tagged<const double, Position>, boost::bimaps::tags::tagged<MyObject* const, MyObject>, true>, double, &boost::bimaps::relation::detail::relation_storage<boost::bimaps::tags::tagged<const double, Position>, boost::bimaps::tags::tagged<MyObject* const, MyObject>, true>::left>] //___________________________________________________________ Thank you very much for your help and guidance, Mathieu

2 1

Interested in GSoC 2011
by Chaitali Shah 09 Feb '11

09 Feb '11

Hello members, Myself is Chaitali Shah, undergraduate student of Computer Engineering from Sardar Patel Institute of Technology,Mumbai. I am interested in participating in GSoC 2011 with Boost C++ libraries as mentoring organisation. As a computer engineering student I have good programming skills and am familiar with many new tools and technologies. I am new to the list and to the organization. I went through the projects of last year and found my interest over it. I saw that organization has already started with the preparations of GSoc 2011 [1] and I wish to work with the organization as a developer. I wanted to know if there are some task that i should work on so as to better understand the code base and architecture before the timeline. Thus, it will be helpful for me if you provide me or guide me with some information as pre-requisites. Thanks in advance. [1] http://lists.boost.org/Archives/boost/2010/10/172030.php -- Regards, Chaitali Shah Student at Sardar Patel Institute of Technology,Mumbai Gtalk: chaitalib.shah(a)gmail.com shahchaitali5(a)gmail.com

2 1

boost::python::import causes access violation
by Julian Bailey 08 Feb '11

08 Feb '11

Hi, I am running through the basic examples on the boost website for embedding boost::python. My code currently reads: #include <iostream> #include "./include/Python.h" #include "./boost/python.hpp" using namespace boost::python; int main(void) { Py_Initialize(); object main_module = import("__main__"); object main_namespace = main_module.attr("__dict__"); object ignored = exec("print Hello world",main_namespace); return 0; } The program links successfully and begins running, however an access violation occurs (NULL pointer) at the first line after "py_initialize();" when i call import("__main__"); Visual studio 2010s debugger says the exception occurs at: line 74 in object_attributes.hpp: inline object const_attribute_policies::get(object const& target, char const* key) { return python::getattr(target, key); } Python was built using Visual studio 2010 so i had access to the python debug library. Boost is version 1.45 and was built using : bjam --build-type=complete msvc stage --with-python I am linking against: boost_python-vc100-mt-gd-1_45.lib and boost_python-vc100-mt-gd-1_45.dll I have looked for soutions on the internet and have found nothing right now. Can anyone help me? note: i am building my application in MSVC 2010, this should work though shouldn't it? Dr Julian Bailey Electronic Systems & Devices, School of Electronics and Computer Science, University of Southampton, Southampton, SO17 1BJ, United Kingdom. Tel. +44 (0)2380 593545 email: jab(a)ecs.soton.ac.uk

2 1

SSL crash in boost asio 1.44
by Scott 08 Feb '11

08 Feb '11

I've been getting reports in the field about sporadic SSL crashes in our product (Linux version). After using a stress test for several hours, I got it to crash in asio 1.41. I then tried it in 1.44 and got the same crash on windows. It appears to be crashing in openssl_operator.hpp:158 The session_ object is definitely corrupt: session_ 0x000000022120ac30 {version=-17891602 type=-17891602 method=0xfeeefeeefeeefeee ...} version -17891602 int type -17891602 int + method 0xfeeefeeefeeefeee {version=??? ssl_new=??? + rbio 0xfeeefeeefeeefeee {method=??? callback=??? + wbio 0xfeeefeeefeeefeee {method=??? callback=??? + bbio 0xfeeefeeefeeefeee {method=??? callback=??? The callstack is this: NwConcentrator.exe!boost::asio::ssl::detail::openssl_operation< boost::asio::basic_stream_socket< boost::asio::ip::tcp,boost::asio::stream_socket_service< boost::asio::ip::tcp>> >::start() NwConcentrator.exe!boost::_mfi::mf0<int,boost::asio::ssl::detail:: openssl_operation< boost::asio::basic_stream_socket< boost::asio::ip::tcp,boost::asio::stream_socket_service< boost::asio::ip::tcp> ::operator() (boost::asio::ssl::detail::openssl_operation< boost::asio::basic_stream_socket< boost::asio::ip::tcp,boost::asio::stream_socket_service< boost::asio::ip::tcp>> > * p=0x00000002136cf440) Line 50 C++ Does 1.45 have a fix for this? I looked over the release notes but didn't see anything about SSL fixes. This crash is occurring on both Fedora/CentOS/Windows builds of boost asio 1.41 and 1.44. Thanks, Scott

1 0

Boost::Spirit::Qi parsing into list
by Slide 08 Feb '11

08 Feb '11

I am looking at using Boost::Spirit for parsing a set of hardware register definitions. From the examples I have seen, it looks like one mainly creates a structure and then that is what is returned from the parsing of the input. I was wondering if anyone could point me towards some examples that might parse out a list of items and return them. The end goal is to parse in the register definitions and then generate C/C++ code from those register definitions to define a hardware access layer that can be used by my other libraries on my chip. So, I would parse the register definitions into a vector and then iterate over that vector to generate the necessary code. Thanks for any pointers. slide -- slide-o-blog http://slide-o-blog.blogspot.com/

2 1

Thread changes from Boost 1.38 to 1.45
by Ven Tadipatri 08 Feb '11

08 Feb '11

Hi, We upgraded our project from using Boost 1.38 to Boost 1.45 but now seem to be having some thread issues. The error doesn't happen for every run, but occasionally the wait method in condition_variable_any fails. At other times the program seems to run into an infinite loop, presumably waiting for a lock that's never released. I looked at the changes in http://www.boost.org/doc/libs/1_45_0/doc/html/thread/changes.html but don't see what could be causing the error to occur only after upgrading to Boost 1.45. Has anyone else experienced their code breaking when upgrading to the latest version of Boost? Thanks, Ven

5 10

Boost.MPI --- boost::mpi::group class
by Júlio Hoffimann 07 Feb '11

07 Feb '11

Hi, It's my first time using Boost and is amazing. I'm trying to understand why this simple example bellow don't works as expected: #include <iostream> #include <boost/mpi.hpp> using namespace std; namespace mpi = boost::mpi; int main ( int argc, char *argv[] ) { mpi::environment env( argc, argv ); mpi::communicator world; mpi::group subgroup( MPI_Group( world.group() ), true ); cout << "I'm process " << world.rank() << endl; cout << "But in subgroup i'm process " << subgroup.rank() << endl; cout << "And the subgroup size is... " << subgroup.size() << endl; return 0; } // ---------- end of function main ---------- *1. Why every process has rank 1 in subgroup? I trying to figure out what happens, but without success.* The mpi::boost::group class has no copy constructor explicitly defined. That is true for many other classes in Boost.MPI... *2. It's safe to use the copy constructor generated by the compiler as follows?* * * mpi::group subgroup = world.group().exclude( discardedRanks.begin(), discardedRanks.end() ); Thanks in advance for any help. Regards, Júlio.

1 2

math statistical: Kolmogorov-Smirnov distribution
by Matwey V. Kornilov 07 Feb '11

07 Feb '11

Hi, Isn't there KS-distribution in boost.math? I didn't find this but maybe I missed something. As far as I understand there is no way to perform KS-test using boost.math framework due to absence of needed statistic.

3 4

Re: [Boost-users] [boost] TTI library updated in the sandbox
by Dave Abrahams 07 Feb '11

07 Feb '11

Couple o' things: On Sun, Feb 6, 2011 at 12:39 PM, Edward Diener <eldiener(a)tropicsoft.com> wrote: > Features of the update include support for the older gcc 3.4.2 and 3.4.5, > finer-grained introspection for the basic macro metafunctions, documentation > examples, better and tighter design, and better use of Boost MPL methodology > ( metafunctions are now passed as lambda expressions and metafunction > globbing has been removed from the two metafunctions where it previously > existed ). You can view the changes in the History section of the > documentation. FWIW, passing lambda expressions instead of metafunction classes is a trade-off: it's more expressive, but will lengthen compile times. For the implementation of a boost library, it's probably better to err on the side of speed. > The TTI library is based on the type_traits_ext portion of the Concept > Traits Library, with improvements and additions, and also lifts > functionality, for the purposes of orthogonality, from Boost.MPL regarding > introspection of types and templates. Orthogonality in what sense? Duplicating functionality seems like the opposite of orthogonality. -- Dave Abrahams BoostPro Computing http://www.boostpro.com

3 4

[BOOST::XPRESSIVE] Trouble with functor
by Norbert Hauck 07 Feb '11

07 Feb '11

Hi again, and sorry for the repost - I had a fat finger accident and clicked the send button to early! If I managed to delete the old message prior to posting this one please ignore. To the point: Please find enclosed my code - df1.cpp - as an attachment. I tinkered around with it but since I'm new to the boost libraries as well as a hobby programmer at best I throw in the towel now. Maybe someone more experienced can help me out how to change my code so that it compiles without errors.The error message was: 1>c:\program files\boost\boost_1_45_0\boost\proto\context\default.hpp(441) : error C2664: 'int DateVerify_Impl::operator ()(const std::string &,wchar_t *) const' : cannot convert parameter 2 from 'wchar_t (*__w64 const )[11]' to 'wchar_t *' 1> Types pointed to are unrelated; conversion requires reinterpret_cast, C-style cast or function-style cast Are ALL parameters I pass to the operator() somehow const ? Pfff ..... maybe I should continue after my temperature went down again (flu) - it seems my brains are addled and I cannot figure out anything at the moment. Thanks a lot, Norbert -- NEU: FreePhone - kostenlos mobil telefonieren und surfen! Jetzt informieren: http://www.gmx.net/de/go/freephone

2 2

Re: [Boost-users] multi_array and variants
by Alle Meije Wink 07 Feb '11

07 Feb '11

Dear Kris, thanks for your reply. > > What I now have is a class bisArray: > > ... > > template<typename T> > > class bisArray: public bisObject { > > typedef boost::variant > > < boost::multi_array_ref<T, 1>, > > boost::multi_array_ref<T, 2>, > > boost::multi_array_ref<T, 3>, > > boost::multi_array_ref<T, 4>, > > boost::multi_array_ref<T, 5>, > > boost::multi_array_ref<T, 6>, > > boost::multi_array_ref<T, 7>, > > boost::multi_array_ref<T, 8>, > > boost::multi_array_ref<T, 9> > > > bisArray_t; > > bisArray_t _bisArray; > > ... > > > > and a class bisImage, which has a bisArray as well as a pointer to the > > data as read from file (1-dimensional structure): > > ... > > > > template<typename T> > > > > class bisImage: public bisObject { > > > > public: > > > > /** Constructor using existing array data > > Reformats array as bisImage > > */ > > bisImage ( T* _data, size_t _dimensions, std::vector<size_t> _sizes > > ): > > data(_data), dimensions(_dimensions) { > > > > This code (or You) comes from java or C#, doesn't it? ;-) In C++ it is > supposed to be this->[...] instead of this.[...] No, it's C (which doesn't use any of this -not properly at least). The whole this[...] business was not supposed to be there anyway I realised. The reason that I went to boost:: is that I was hoping to get one class for all data types (using T) and dimensionalities (using multi_array) > Second thing: the member storage is initialized with the default constructor > (which in this case does not exist => error ), and then assigned (below). > > I suggest a change to: > bisImage([...]) : [...], storage( _data, _dimensions, _size ) { [...] > and remove the assignment from the body of the constructor > > Note also: I have read in many places, that you should not use names > beginning with an underscore (_), because they are reserved for > compiler/library implementation. One of those places was Herb Sutter's gotw > series. Ah! The underscore names come from a library that I tried to imitate which has successfully incorporated some aspects of boost(it is called MIMAS). Have not reached the stage of 'nicifying' the code yet... I moved the storage thing to where you suggested (1 line up) and that does get rid of lots of errors. However what I am stuck with seems to be, in essence, still the same thing: >>> /home/amwink/programs/cpp/bis/src/bisniftiimage.cpp||In function ‘void bis::bisReadNifti(std::string)’:| >>> /home/amwink/programs/cpp/bis/src/bisniftiimage.cpp|102|warning: unused variable ‘testimage’| >>> /usr/include/boost/variant/variant.hpp||In constructor ‘boost::variant<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19>::variant() [with T0_ = boost::multi_array_ref<unsigned char, 1ul>, T1 = boost::multi_array_ref<unsigned char, 2ul>, T2 = boost::multi_array_ref<unsigned char, 3ul>, T3 = boost::multi_array_ref<unsigned char, 4ul>, T4 = boost::multi_array_ref<unsigned char, 5ul>, T5 = boost::multi_array_ref<unsigned char, 6ul>, T6 = boost::multi_array_ref<unsigned char, 7ul>, T7 = boost::multi_array_ref<unsigned char, 8ul>, T8 = boost::multi_array_ref<unsigned char, 9ul>, T9 = boost::detail::variant::void_, T10 = boost::detail::variant::void_, T11 = boost::detail::variant::void_, T12 = boost::detail::variant::void_, T13 = boost::detail::variant::void_, T14 = boost::detail::variant::void_, T15 = boost::detail::variant::void_, T16 = boost::detail::variant::void_, T17 = boost::detail::variant::void_, T18 = boost::detail::variant::void_, T19 = boost::detail::variant::void_]’:| >>> /home/amwink/programs/cpp/bis/src/bisarray.hpp|52|instantiated from ‘bis::bisArray<T>::bisArray(T*, size_t, std::vector<long unsigned int, std::allocator<long unsigned int> >) [with T = unsigned char]’| >>> /home/amwink/programs/cpp/bis/src/bisimage.hpp|33|instantiated from ‘bis::bisImage<T>::bisImage(T*, size_t, std::vector<long unsigned int, std::allocator<long unsigned int> >) [with T = unsigned char]’| >>> /home/amwink/programs/cpp/bis/src/bisniftiimage.cpp|126|instantiated from here| >>> /usr/include/boost/variant/variant.hpp|1198|error: no matching function for call to ‘boost::multi_array_ref<unsigned char, 1ul>::multi_array_ref()’| >>> /usr/include/boost/multi_array/multi_array_ref.hpp|623|note: candidates are: boost::multi_array_ref<T, NumDims>::multi_array_ref(T*, const typename boost::const_multi_array_ref<T, NumDims, T*>::storage_order_type&, const typename boost::const_multi_array_ref<T, NumDims, T*>::index*, const typename boost::const_multi_array_ref<T, NumDims, T*>::size_type*) [with T = unsigned char, long unsigned int NumDims = 1ul]| >>> /usr/include/boost/multi_array/multi_array_ref.hpp|469|note: boost::multi_array_ref<T, NumDims>::multi_array_ref(T*, const boost::detail::multi_array::extent_gen<NumDims>&, const boost::general_storage_order<NumDims>&) [with T = unsigned char, long unsigned int NumDims = 1ul]| >>> /usr/include/boost/multi_array/multi_array_ref.hpp|463|note: boost::multi_array_ref<T, NumDims>::multi_array_ref(T*, const boost::detail::multi_array::extent_gen<NumDims>&) [with T = unsigned char, long unsigned int NumDims = 1ul]| >>> /usr/include/boost/multi_array/multi_array_ref.hpp|417|note: boost::multi_array_ref<unsigned char, 1ul>::multi_array_ref(const boost::multi_array_ref<unsigned char, 1ul>&)| >>> ||=== Build finished: 1 errors, 1 warnings ===| So boost.variant now sugegsts that multi_array_ref() is called, a constructor with no arguments! I don't use that, and I don't even think it exists (because it produces a multi_array view of an *existing* C-style array! The only way I knew to initialise a bisArray was with using a switch statement -proper C: switch dims{ case 1: _bisarray=multi_array_ref<T,1> (data, sizes); break; case 2: _bisarray=multi_array_ref<T,2> (data, sizes); break; ... } That is the only way multi_array_ref is called! Any idea why a problem with the *default* constructor would turn up? Thanks for your suggestions! My error list already fits on one screen :) Alle Meije

3 3

[type_traits] will the future has_operator_left_shift be able to test if a type is serializable to a stream ?
by Mathieu Champlon 06 Feb '11

06 Feb '11

Hello, I just tried the type_traits extension from the sandbox : http://svn.boost.org/svn/boost/sandbox/type_traits (by the way the source files are indented with tabs) Simply including for instance <boost/type_traits/has_operator_left_shift.hpp> on vc80 and vc100 yields : boost/type_traits/detail/has_binary_operator.hpp(80) : warning C4346: 'boost::is_class<boost::remove_reference<T>::type>::value' : dependent name is not a type prefix with 'typename' to indicate a type boost/type_traits/detail/has_binary_operator.hpp(142) : see reference to class template instantiation 'boost::has_operator_left_shift<LHS,RHS,RET>' being compiled boost/type_traits/detail/has_binary_operator.hpp(80) : error C2146: syntax error : missing ')' before identifier 'or' boost/type_traits/detail/has_binary_operator.hpp(142) : error C2039: 'value' : is not a member of '`global namespace'' boost/type_traits/detail/has_binary_operator.hpp(142) : error C2059: syntax error : ')' boost/type_traits/detail/has_binary_operator.hpp(142) : error C2143: syntax error : missing ';' before '{' boost/type_traits/detail/has_binary_operator.hpp(142) : fatal error C1004: unexpected end-of-file found It compiles fine on cygwin with gcc 3.4.4 though. I spent a few minutes trying to pinpoint the exact location of the error without much success (got lost in the macros). I'm using boost 1.42. Anyway, it seems that nothing in the documentation indicates the new traits are limited to numeric types. Moreover it sort of works for testing if a type is serializable to an std::ostream : BOOST_STATIC_ASSERT(( boost::has_operator_left_shift< std::ostream, int >::value )); And it also works for far more advanced cases (like a type convertible to another type which is serializable, or a class deriving from another class which is serializable, etc..) However it doesn't work with a pointer type, for instance this fails : BOOST_STATIC_ASSERT(( boost::has_operator_left_shift< std::ostream, void* >::value )); Will this use case be supported ? Thanks, MAT.

4 14

MPFR in Boost 1.45.0
by Novak Elliott 05 Feb '11

05 Feb '11

Hi, I searched the boost mailing list archives on MPFR and the last query was in Feb 2010 so I think this may be worth a new thread. I'm interested in using MPFR (C library for multiple-precision floating-point computations with *correct rounding - *http://www.mpfr.org/) with some of the boost math libraries (vectors, matrices). Support is available to do this via the bindings in boost/math/bindings/mpfr.hpp<http://www.boost.org/doc/libs/1_45_0/boost/math/bindings/mpfr.hpp>. As per the documentation ( http://www.boost.org/doc/libs/1_45_0/libs/math/doc/sf_and_dist/html/math_to… ): "In order to use these bindings you will need to have installed MPFR plus it's dependency the GMP library and the C++ wrapper for MPFR known as gmpfrxx (or mpfr_class)." However, when compiling the example listed in the documentation: #include <boost/math/bindings/mpfr.hpp> #include <boost/math/special_functions/gamma.hpp> int main() { mpfr_class::set_dprec(500); // 500 bit precision // // Note that the argument to tgamma is an expression template, // that's just fine here: // mpfr_class v = boost::math::tgamma(sqrt(mpfr_class(2))); std::cout << std::setprecision(50) << v << std::endl; } I get a large number of compile errors (attached). I do have GMP, MPFR and gmpfrxx installed, although to get the gmpfrxx example to work (source: example.cpp) I had to comment out the reference to GMP_RND_MAX as this enumerated type value, present in MPFR version 2.4.2, has been removed from mpfr.h from version 3.0.0. Does anyone have any experience is getting boost 1.45.0 running with MPFR 3.0.0? I'm wondering whether this an MPFR problem, a boost bindings problem, or both. cheers, Novak.

3 5

interprocess_condition::wait(scoped_lock<interprocess_upgradable_lock> &) missing
by John Ky 05 Feb '11

05 Feb '11

Hi boost users, I've discovered that the following doesn't compile. using namespace boost::interprocess; interprocess_upgradable_mutex mutex; interprocess_condition cv; boost::posix_time::ptime deadline; { scoped_lock<interprocess_upgradable_mutex> lock(mutex); sharable_lock<interprocess_upgradable_mutex> lock2(mutex); cv.wait(lock); // doesn't compile cv.timed_wait(lock, deadline); // doesn't compile. } It is failing because boost doesn't define the following methods: void interprocess_condition::do_wait(interprocess_upgradable_mutex &mut); bool interprocess_condition::do_timed_wait(const syssrv_boost::posix_time::ptime &abs_time, interprocess_upgradable_mutex &mut); I was thinking of making a basic implementation like so: Define a scoped_unlock class, which behaves just like scoped_lock except the constructor unlocks and the destructor locks. Then define the following: inline void interprocess_condition::do_wait(interprocess_upgradable_mutex &mut) { scoped_unlock<interprocess_upgradable_mutex> unlock(mut); interprocess_mutex &internal_mutex = mut.m_mut; scoped_lock<interprocess_mutex> internal_lock(internal_mutex); this->wait(internal_lock); } inline bool interprocess_condition::do_timed_wait (const syssrv_boost::posix_time::ptime &abs_time, interprocess_upgradable_mutex &mut) { scoped_unlock<interprocess_upgradable_mutex> unlock(mut); interprocess_mutex &internal_mutex = mut.m_mut; scoped_lock<interprocess_mutex> internal_lock(internal_mutex); return this->timed_wait(internal_lock, abs_time); } These functions simply do the following: - unlock the exclusive lock on the interprocess_upgradable_mutex (which is emulated with an internal interprocess_mutex) - then lock the internal interprocess_mutex - Call interprocess_condition::wait or interprocess_condition::time_ wait on the implementation lock which does all the work - unlock the internal interprocess_mutex - relock the exclusive lock on the interprocess_upgradable_mutex Intuitively, this should work. Is there anything I missed that would make this an incorrect implementation? Cheers, -John

3 10

Boost asio question
by Claude 04 Feb '11

04 Feb '11

Hi, it is possible obtain a Socket (boost::asio::ip::tcp::socket) from an acceptor object? This is my problem: I use the accept() method of acceptor for wait on a connection. But, in java, the method accept() of ServerSocket class return a socket object and I can pass this reference to a thread that handles it and I can continue to accept() in main program. It is possible obtain this behavior with asio? -- View this message in context: http://boost.2283326.n4.nabble.com/Boost-asio-question-tp3255518p3255518.ht… Sent from the Boost - Users mailing list archive at Nabble.com.

2 3

[BOOST::XPRESSIVE] Trouble with functor in regex
by Norbert Hauck 04 Feb '11

04 Feb '11

Hi, I'm tinkering around with xpressive but have run into a problem. Warning: I'm rather unprofessionnal as a programmer so I might have overlooked something very simple - please bear with me! ------Code-----Code------- #include "stdafx.h" #include <boost/xpressive/xpressive_static.hpp> #include <boost/xpressive/regex_actions.hpp> #include <boost/xpressive/regex_primitives.hpp> #include <string> #include <iostream> using namespace boost::xpressive; class DateVerify_Impl { public: typedef int result_type; int operator()(const std::string& cap,wchar_t* pdate)const //val references currdate { int yy = (cap[0]-'0')*1000 + (cap[1]-'0')*100 + (cap[2]-'0')*10 + (cap[3]-'0'); int mm = (cap[5]-'0')*10 + (cap[6]-'0'); int dd = (cap[8]-'0')*10 + (cap[9]-'0'); if ((yy > 2003 && yy < 2099) && (mm > 0 && mm < 13) && (dd > 0 && dd < 32)) { const int ddinmonth[] = {31,29,31,30,31,30,31,31,30,31,30,31}; if (ddinmonth[(mm-1)] >= dd) { if (!(mm == 2 && dd == 29) || ((yy%400 ? yy%100 ? yy%4 ? false : true : false :true) == 1)) { //stringcopy cap to val size_t convertedChars = 0; mbstowcs_s(&convertedChars,pdate,11,cap.c_str(),_TRUNCATE); return 1; } else return 0; } else return 0; } } }; int _tmain(int argc, _TCHAR* argv[]) { wchar_t currdate[11]; std::string date = "2011/02/02"; function<DateVerify_Impl>::type const dverify = {{}}; mark_tag datetag(1); smatch mtch; sregex tcrgx = bos >> (datetag= (repeat<4>(_d) >> '/' >> repeat<2>(_d) >> '/' >> repeat<2>(_d))) [check(dverify(datetag,&currdate) == 1)] >> eos; if (regex_match(date,mtch,tcrgx)) std::wcout << "YO BABY, YO !" << " ... and the winner is " << currdate << '\n'; return 0; } -- GMX DSL Doppel-Flat ab 19,99 Euro/mtl.! Jetzt mit gratis Handy-Flat! http://portal.gmx.net/de/go/dsl

1 0

[program_options] negative numbers in options value<vector<int> >()->multitoken()
by Andrzej Zielinski 04 Feb '11

04 Feb '11

Hi, I am using boost::program_options and found a problem with passing a series of positive/negative numbers. i.e myProgram.out --system 0 -2 2 -3 Similar problem like in: http://stackoverflow.com/questions/4107087/accepting-negative-doubles-with-… I do not want to disable short options. I want to make quotes working. So when I call myProgram.out --system '0 -2' error: in option 'system': invalid option value myProgram.out --system 0 -2 error: unknown option -2 What quotation do you mean ? I am using bash, on CYGWIN and in linux

1 1

compilation flag effect on boost::condition::timed_wait()
by Vishal Bayskar 04 Feb '11

04 Feb '11

Dear All, I am getting different behaviour of condition::timed_wait() function when I compile my code with NDEBUG flag and without NDEBUG flag. with using NDEBUG flag, timed_wait() wait for condition (mutext) as desired but whey I don't use NDEBUG flag while compiling my code it does wait for condition (mutex) but return at the same time when it is called. In both the cases return value is 1. Please note that it is not a race condition but it is happening every time. Also note that I am using other flags too for compiling my code like -Werror -pthread -fno-strict-aliasing -Wno-unused-variable -Wno-unused-parameter -Wno-unused-function -O3 -ggdb3 -m64 Please let me know what can be possible impact of NDEBUG flag on timed_wait() function. Thanking you Vishal DISCLAIMER: ----------------------------------------------------------------------------------------------------------------------- The contents of this e-mail and any attachment(s) are confidential and intended for the named recipient(s) only. It shall not attach any liability on the originator or NECHCL or its affiliates. Any views or opinions presented in this email are solely those of the author and may not necessarily reflect the opinions of NECHCL or its affiliates. Any form of reproduction, dissemination, copying, disclosure, modification, distribution and / or publication of this message without the prior written consent of the author of this e-mail is strictly prohibited. If you have received this email in error please delete it and notify the sender immediately. . -----------------------------------------------------------------------------------------------------------------------

2 2

[Interprocess] shared_ptr in a non-throwing mode
by Pietro Versari 04 Feb '11

04 Feb '11

Hi Ion (and everyone else), I'm a newbye and I have only one simple (stupid?) question: how can I construct a shared_ptr in a non-throwing mode? This example throw if there is enough space for MyType but isn't enough for my_shared_ptr: typedef managed_shared_ptr<MyType,managed_shared_memory>::type my_shared_ptr; my_shared_ptr sh_ptr = make_managed_shared_ptr( segment.construct<MyType>("object to share", std::nothrow)(), segment); Thanks Pietro Versari

1 0

Re: [Boost-users] Boost-wide concept docs
by Mathias Gaunard 03 Feb '11

03 Feb '11

On 03/02/2011 17:52, Edward Diener wrote: > I have seen concepts mentioned in documentation > for many Boost libraries but I never knew how to document a concept for > what I myself may be working on. Does Boost specify a preferred common > format for documenting a concept anywhere ? Yes, caramel (that's an XML format). It integrates with boostbook and quickbook. See libs/concept_check/doc/reference for examples.

3 2

[statechart]BitMachine with custom reactions. How to?
by vs＠spinke.de 03 Feb '11

03 Feb '11

Hello! I tried to add custom reactions to the statechart library example BitMachine. It shall not only change the state, but also perform some (self-defined) action on the transition. Could somebody tell me, where I have to add / change what in order to achieve the goal? Any hints are welcome. Thanks a lot. Volker

2 1

[Boost Graph Library] larger neighborhood in grid_graph
by Hannes Schulz 03 Feb '11

03 Feb '11

Hi all, i recently discovered grid_graph and found it quite useful so far. However, I would prefer a larger neighborhood in the graph (e.g. 8 instead of 4 for 2D; 26 instead of 6 in 3D). I already started looking into copying and modifying grid_graph.hpp accordingly, but cannot entirely anticipate the complexity of the problem. Therefore I decided to ask here first: - Why did the developers restrict grid_graph to "orthogonal" neighborhoods? - Is a modification of grid_graph worth it, or am I going to throw away everything anyway and should start over anew instead? (without the wrapping overhead, which I do not need) Thank you very much! Hannes

3 2

[Regex] Boost.Regex - can't compile/link...
by Robert Pennington 02 Feb '11

02 Feb '11

Hey there, I am trying to compile a very simple example program that I copied from the boost getting started guide for windows (after successfully running a bjam complete build). BTW: I am using the gcc compiler within the Code::Blocks IDE on Windows XP. Here is the code, just in case: ========================================================== #include <boost/regex.hpp> #include <iostream> #include <string> int main() { std::string line; boost::regex pat( "^Subject: (Re: |Aw: )*(.*)" ); while (std::cin) { std::getline(std::cin, line); boost::smatch matches; if (boost::regex_match(line, matches, pat)) std::cout << matches[2] << std::endl; } } ========================================================== Every time I try to compile this code (by hitting the 'Build and Run' button in Code::Blocks), I get a whole bunch of error messages. The first one I get is: "C:\Program Files\boost\boost_1_45_0\boost\regex\v4\cpp_regex_traits.hpp|366|undefined reference to `boost::re_detail::cpp_regex_traits_char_layer<char>::init()'|". Any ideas? Thanks in advance, Rob Pennington

3 3

Fusion: Structs containing an array
by Gunther Laure 02 Feb '11

02 Feb '11

Hi! I am trying to use boost fusion to build [de]serializer for simple types (int ...) and structs. I had success until I tried structures holding arrays. Example: struct EntryTable { unsigned int count; unsigned int data[4]; }; BOOST_FUSION_ADAPT_STRUCT( EntryTable, (unsigned int, count) (unsigned int, data[4]) ) I would wish to get a fusion::vector<unsigned int, unsigned int[4]>, but the assignment of the struct only compiles if the fusion vector is defined as fusion::vector<unsigned int, unsigned int>. EntryTable t; fusion::vector<unsigned int, unsigned int> f1 = t; // works fusion::vector<unsigned int, unsigned int[4]> f2 = t; // doesnt work (not even compile) What am I doing wrong? Is there a simple way to simple wrap an array using fusion? Bye Gunther using boost 1.42 g++ 4.4.5

2 1

Re: [Boost-users] Compiling Boost (Steven Watanabe, Bhushan Inamdar)
by Bhushan Inamdar 02 Feb '11

02 Feb '11

Hi Steven, Thanks for the prompt reply. My problem is solved. It seems that, every time, I have to go to project properties and in the C++ tab and include the absolute path to the Boost directory. After doing this, the program compiles with out any complaints. So further up, my question is...Is it necessary to do this everytime? Or my Boost installation is missing something? Let me know.... Thanks, Bhushan

5 6

What's happened to Ryppl?
by Robert Jones 02 Feb '11

02 Feb '11

33 109

Need help identifying present and past Boost authors
by John Wiegley 01 Feb '11

01 Feb '11

Hello, I'm working on a repository convertor which must translate SVN author ids to fullname/e-mail pairs. This has already been done to some extent by Brad King, but I've found that several authors remain unidentified. I'm sending this e-mail to ask the Boost community if they could identify any or all of the authors at the following URL whose name is Unknown. Also, if you can provide spelling corrections or more updated e-mail information, please let me know by e-mail. The current authors file is here: https://github.com/jwiegley/subconvert/blob/master/doc/authors.txt I'll update the file as corrections are provided. Thank you, John Wiegley BoostPro Computing http://www.boostpro.com

3 3

[1.46.0 beta 1] [SourceForge] SourceForge mirror sync system broken
by Beman Dawes 01 Feb '11

01 Feb '11

The SourceForge mirror sync system has broken down. Other projects are affected, not just Boost. The files up there are probably good and the download problems should clear once the mirrors are synced again, the S/F folks say. Some projects say their files are back online, but as of a few minutes ago the Boost stuff still seemed broken and/or running so slowly as to be effectively broken. --Beman

3 4

[boost.test] benchmarking support
by Marco Craveiro 01 Feb '11

01 Feb '11

hi boosters, i've been looking for benchmarking support for unit tests, but googling didn't produce any obvious results (and a wealth of spurious matches, so i may have missed something). what i have in mind is something akin to cppbench but for boost.test: http://blog.quibb.org/cppbench/ basically, something that allows repeating each test a number of times, and then time the total execution time per test. is this available? if not, can anyone recall any discussions on the subject? many thanks for your time, marco -- Constraint has encouraged not only economy, but also a certain elegance of design. -- Dennis Ritchie

3 4

[Review][Move] Boost.Move Review Results
by Michael Caisse 01 Feb '11

01 Feb '11

---------------------------- Executive Summary ---------------------------- Ion Gaztañagas' Boost.Move library was reviewed from May 10th, 2010 through May 24th, 2010. The original review manager was OvermindDL1 who later went missing. Eleven individuals joined the discussion with the author. Six reviews were submitted: - 5 reviews ACCEPT - 1 review CONDITIONALLY ACCEPT Ion indicated he would meet the "conditional requirements" which easily satisfies a community vote of: Boost.Move library ACCEPTED ---------------------------- Overview ---------------------------- The Boost.Move library is a highly anticipated addition to the Boost collection. The primary motivation is to introduce usable move functionality in "a portable syntax between C++0x and C++03 compilers"; however, as Vicente Botet articulated, "Most people think that this is an emulation library, but it is more than that as it implements most of the C++0x Move semantics classes and functions." Reviewers' comments: - "This library is long overdue!" [Terry Golubiewski] - "The tutorial is well written." [Vicente Botet] - "Compared to my adobe based move implementation, I think yours is superior." [Daniel James] - "There is a lot of ingenuity in making the move emulation work, and Ion has made it very accessible and managed to make differences between C++03 and C++0x vanish behind macros and free functions." [Jeff Hellrung] An active discussion included: - exposing boost::rv<T> publicly - The merits of fully defining requirements of boost::rv<T>& - Duplicated functionality found in MPL and Type Traits - The necessity for two emulation modes - The merits of macros - Library author usage of Boost.Move - Non-throwing move constructors - Various potentially useful type traits - Other move implementations While it is unfortunate that a timely review result was not published, it did provide an opportunity to discuss some of the concerns raised in the review with actual users of the library. One such concern was the "two emulation modes." At some point in the discussions it became classified as "Safe vs. Fast". When coined with that bias "safe" would be the preference; however, further investigation and inquiries of actual users showed the "fast" version is perfectly acceptable as the default. Additionally, "safe" is a misnomer considering that one mode is not any safer than the other. Each mode has benefits and limitations as enumerated by Ion in the documentation and review responses. The past six months of use would indicate that defaulting to the "fast" version, as preferred by Ion, is in practice a good decision. Thank you Ion for this well thought out and excellent submittal. Thank you reviewers for expending time and energy to further Boost. Without those who are dedicated to review submitted libraries, the entire process and Boost itself falls apart. The community will benefit from the effort each of you put into this library. Best regards - Michael Caisse ---------------------------- Summary of changes ---------------------------- The following changes are planned based on discussions from the review: -- Conditional Acceptance -- 1. "Two Emulation Mode" documentation typos must be resolved. The descriptions, requirements and limitations need to be perfectly clear for the end user. -- Other Issues -- 1. The class rv should be public and documented. 2. is_movable should be renamed and the documentation clarified. It should only be enabled in C++03. A possible alternative name is has_move_emulation_enabled. 3. Nearly all reviewers voiced a preference that the move library should use existing functionality from MPL and TypeTraits libraries. While on one hand this creates a dependency between move and other libraries it results in reuse of accepted and well tested libraries. If a non-coupling option is also provided, it should not be the default. 4. Additional traits discussed. Resolution: add to TypeTraits library as actual use-cases are found. 5. Provide a boost/move.hpp that includes boost/move/move.hpp 6. Document the interaction of the two emulation modes. 7. Include example for making a container "movable". 8. Two emulation modes - Ion was hopeful that reviewers would have a uniform opinion that would result in a single mode. The trade-offs identified by Ion in the documentation were apparent to all reviewers; however, different conclusions were drawn and consensus was not met. The granularity of control was a common issue with nearly all reviewers. Therefore, keep both emulation modes with Optimized as the default and the granularity of control at or more "local level" than the macro provides (class level). 9. emulation_limitations.html: s/overaloading/overloading/ 10. Fully qualify enable_if ( ::boost::emable_if ) 11. Optimized version of forward should use identity so it will not try to deduce T. 12. Make sure required headers are mentioned for tutorials. 13. is_class in is_movable template< class T> struct is_movable : mpl::and_< is_class<T>, mpl::not_< is_rvalue_reference<T> >, is_convertible< T, rv<T>& > > {}; - or - another solution to is_movable problems with references. 14. On throwing move constructors, Ion should follow as close to the standard's behaviour as possible. This can be revisited after the initial release since it is a performance optimization. -- Michael Caisse Object Modeling Designs www.objectmodelingdesigns.com

2 1

win32 api
by Gianni Ambrosio 01 Feb '11

01 Feb '11

Hi All, I'm working on a piece of code that should run on a special real-time kernel that supports only a minimal set of win32 api. I would like to use boost sockets and threads but it seems there are some dependencies on win32 api not supported by that system (i.e. WSARecvFrom, WSASend, WSASocketA, WSAStringToAddressA). Is there a way to build boost libs with some options so that the C socket calls are used instead? I'm asking too much? Regards Gianni

2 4

Planar Embedding of a Graph
by Nitin Gangahar 01 Feb '11

01 Feb '11

Hi all! I am totally new to the Boost Library. I just wanted to know if BGL supports finding if a graph is planar or not and also the planar embedding of a graph. Thanking you, Nitin Gangahar

2 2

Compiling Boost
by Bhushan Inamdar 31 Jan '11

31 Jan '11

Hi all, I have installed Boost 1.44 and I have a program from a tutorial I am trying to compile with out success. The program is as follows: =============================================================================== #include <iostream> #include <vector> #include <algorithm> #include <boost/shared_ptr.hpp> using namespace::std; struct Boost_Example { Boost_Example(int _x) : x (_x) { } ~Boost_Example() { std::cout << "Destroying Boost_Example x = " << x << "\n"; std::cout << endl << endl << " "; system("PAUSE"); cout << endl << endl; } int x; }; typedef boost::shared_ptr<Boost_Example> Boost_ExamplePtr; struct Boost_ExamplePtrOps { bool operator()(const Boost_ExamplePtr &a, const Boost_ExamplePtr &b) { return a->x < b->x; } void operator()(const Boost_ExamplePtr &a) { std::cout << " " << a->x; } }; int main() { std::vector<Boost_ExamplePtr> Boost_Example_Vector; Boost_Example_Vector.push_back(Boost_ExamplePtr(new Boost_Example(3))); Boost_Example_Vector.push_back(Boost_ExamplePtr(new Boost_Example(2))); Boost_Example_Vector.push_back(Boost_ExamplePtr(new Boost_Example(1))); // std::cout << endl << endl; std::cout << " Original Boost_Example_Vector" ; std::for_each(Boost_Example_Vector.begin(), Boost_Example_Vector.end(), Boost_ExamplePtrOps()); std::cout << "\n"; // std::sort(Boost_Example_Vector.begin(), Boost_Example_Vector.end(), Boost_ExamplePtrOps()); std::cout << endl << endl; std::cout << "Sorted Boost_Example_vector: " ; std::for_each(Boost_Example_Vector.begin(), Boost_Example_Vector.end(), Boost_ExamplePtrOps()); std::cout << " \n"; // std::cout << endl << endl << " " ; system("PAUSE"); std::cout << endl << endl; // return 0; } ============================================================================= Just create an empty VC++ project and add a source file to it. Then paste this code in the source file. I believe that, if Boost is correctly installed on one's machine, this should compile correctly. For additional information, I have set up the include and lib directories as under: includes: $(BOOST_ROOT)boost libs $(BOOST_ROOT)stage\lib $(BOOST_ROOT)libs $(BOOST_ROOT)bin.v2 In the above paths, $(BOOST_ROOT) is added to "System Variables" under the "Environment Variables" as C:\Program Files\boost\boost_1_44_0 where it is installed. Shall a "\" be added in the end? Or shall this variable be added to "Path variables" instead of "System variables"? I believe that my environment is rightly setup. But I am still having problems building a simple console application. I am using Visual Studio 2008 on Windows 7. Please let me know, what to do and where to check for the missing block? Thanks and regards, Bhushan

2 1

Problems with testing a putatively successful build using cygwin
by Ted Byers 31 Jan '11

31 Jan '11

I tried the following: ./bootstrap.sh --exec-prefix=/usr/local ./bjam --layout=versioned --build-type=complete cd status ../bjam And I was planning the following if the result of the above was acceptable. ./bjam install However, every time I have tried this, it stops part way through, at the following the last few lines: ../boost/iterator/iterator_facade.hpp:514: warning: type qualifiers ignored on function return type gcc.compile.c++ ../bin.v2/libs/regex/test/regex_regress_threaded.test/gcc-4.3.4/debug/thread ing-multi/regress/test_unicode.o In file included from ../boost/date_time/posix_time/posix_time_system.hpp:14, from ../boost/date_time/posix_time/ptime.hpp:12, from ../boost/date_time/posix_time/posix_time_types.hpp:12, from ../boost/thread/thread_time.hpp:11, from ../boost/thread/locks.hpp:12, from ../boost/thread/pthread/mutex.hpp:12, from ../boost/thread/mutex.hpp:16, from ../boost/thread/pthread/thread_data.hpp:12, from ../boost/thread/thread.hpp:17, from ../boost/thread.hpp:13, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\/info.hpp:27, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\/test_not_regex.hpp: 22, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\/test.hpp:31, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\test_unicode.cpp:21: ../boost/date_time/time_system_split.hpp:41:1: warning: use of C99 long long integer constant gcc.compile.c++ ../bin.v2/libs/regex/test/regex_regress_threaded.test/gcc-4.3.4/debug/thread ing-multi/regress/test_overloads.o In file included from ../boost/date_time/posix_time/posix_time_system.hpp:14, from ../boost/date_time/posix_time/ptime.hpp:12, from ../boost/date_time/posix_time/posix_time_types.hpp:12, from ../boost/thread/thread_time.hpp:11, from ../boost/thread/locks.hpp:12, from ../boost/thread/pthread/mutex.hpp:12, from ../boost/thread/mutex.hpp:16, from ../boost/thread/pthread/thread_data.hpp:12, from ../boost/thread/thread.hpp:17, from ../boost/thread.hpp:13, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\/info.hpp:27, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\/test_not_regex.hpp: 22, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\/test.hpp:31, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\test_overloads.cpp:1 2: ../boost/date_time/time_system_split.hpp:41:1: warning: use of C99 long long integer constant gcc.compile.c++ ../bin.v2/libs/regex/test/regex_regress_threaded.test/gcc-4.3.4/debug/thread ing-multi/regress/test_operators.o In file included from ../boost/date_time/posix_time/posix_time_system.hpp:14, from ../boost/date_time/posix_time/ptime.hpp:12, from ../boost/date_time/posix_time/posix_time_types.hpp:12, from ../boost/thread/thread_time.hpp:11, from ../boost/thread/locks.hpp:12, from ../boost/thread/pthread/mutex.hpp:12, from ../boost/thread/mutex.hpp:16, from ../boost/thread/pthread/thread_data.hpp:12, from ../boost/thread/thread.hpp:17, from ../boost/thread.hpp:13, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\/info.hpp:27, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\/test_not_regex.hpp: 22, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\/test.hpp:31, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\test_operators.cpp:1 2: ../boost/date_time/time_system_split.hpp:41:1: warning: use of C99 long long integer constant gcc.link ../bin.v2/libs/regex/test/regex_regress_threaded.test/gcc-4.3.4/debug/thread ing-multi/regex_regress_threaded.exe The last gcc.link statement above has been the last statement in the cygwin bash console for about 12 hours now. I am rather surprised that either bjam or a test program it is running can stop like that and not have bjam detect it and respond appropriately. Is there a way to prevent this from happening? I know (from having tried it), that I can terminate this and re-execute bjam in status, and that that will finish, but doing that doesn't tell me what fraction of tests succeeded. Rather, it tells me only about those targets that were found, and their result, during the current executin. Obviously, it will ignore all the tests that had been performed previously. I also see a lot of files created in status during the test. Is there a script that will process the contents of status and tell me at least the sort of info provided in the table on " http://www.boost.org/development/tests/trunk/developer/summary.html"? Thanks Ted

1 0

[1.46.0 beta 1] Release 1.46.0 beta 1 available
by Beman Dawes 31 Jan '11

31 Jan '11

Boost release 1.46.0 beta 1 is now available from SourceForge See http://sourceforge.net/projects/boost/files/ This release contains one new library, Interval Containers, and numerous enhancements and bug fixes for existing libraries. For details of what's in the release, see http://beta.boost.org/users/news/version_1_46_0. Note that the links to files on this web page are for the final release - use the SourceForge link above to get the beta files. Please download the beta, give it a try, and report any problems you encounter. Thanks, -- The Boost Release Team Beman Dawes Daniel James Eric Niebler Rene Rivera Vladimir Prus

2 1

getting a return value from a bind?
by pedro chaparro 31 Jan '11

31 Jan '11

hi , i have on my code something like boost::thread thrd(boost::bind(&myioTCPLTE,TCPmsg)) function myioTCPLTE return a string value, bu i dont now how to get it to store in a different variable from the main code!! Could anyone help me? thanks -- Pedro Alonso Chaparro Valero R&D Engineer 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

2 1

Re: [Boost-users] [Asio] Socket Read/Write Thread-Safety (Timothy Liang)
by Marat Abrarov 31 Jan '11

31 Jan '11

> The 'boost::asio::async_read(...)' and 'boost::asio::async_write(...)' > functions might call async_read_some and async_write_some concurrently in > some scenarios, as they do not synchronize accesses to the stream object > that I'm passing to them as a reference. A look in their implementations > confirms this: if the stream's async_read_some or async_write_some didn't > satisfy the completion condition, it tries again, using the same reference > to the stream object. With multiple threads calling > io_service::run_one(), the result can be one thread calling > async_read_some while another is calling async_write_some at the same > time. This seems to prevent me from using async_read and async_write at > all, so I'm wondering if the stream has some undocumented thread-safety > guarantees, or if there's a proper way to achieve the same effect. RTFM. Really, RTFM. Use boost::asio::io_service::strand and don't worry about synchronization. http://www.boost.org/doc/libs/1_45_0/doc/html/boost_asio/overview/core/stran ds.html You can use async_read and async_write simultaneously (but note "Thread Safety" for used asio class) with strands easily. Yes, with multiple threads running boost::asio::io_service::run on the same boost::asio::io_service object. What amazing laziness in reading asio docs :) - all of the latest questions about Boost.Asio have respective answers in documentation. Marat Abrarov.

2 1

[Range] Sliced range adaptor, alternative for non RandomAccessRanges?
by Alastair Rankine 31 Jan '11

31 Jan '11

Hi, Currently it seems that the sliced range adaptor [1] requires a Random Access Range to do its job. Hence it can't be used for other ranges which dont model this concept. I want to use it with a Forward Range, specifically a std::set iterator range. What I want to do is this: std::set<int> input; input += 1,2,3,4,5,6,7,8,9; boost::copy( input | sliced(2, 5), std::ostream_iterator<int>(std::cout, ",")); (as per the sliced example, but with a std::set instead of a std::vector). I don't know much about the internals of the sliced adapter, but could it be changed to work a similar manner to counting_range, in order to locate the relevant slice of the input range? This would allow it to operate efficiently on Forward Ranges. Failing this, is there an efficient alternative to the above example? [1]: http://www.boost.org/doc/libs/1_45_0/libs/range/doc/html/range/reference/ad…)

3 3

graph- single source K shortest path with Boost Library
by Alexandre Lima 31 Jan '11

31 Jan '11

Hi, I would like to know if somebody could help me with Graphs. I need to find the 10th or kth shortest path in a single source problem, weighted >0, in other words, I need to keep the 10th or more first paths of one source to all other vertexes. I had already done that using a K shortest path algorithm (Yen, http://code.google.com/p/k-shortest-paths/ ),which discovery all the paths of a source to a sink, and I had just used a "for" with an objective to try all the sink nodes to solve the problems to all vertexes. It works, but the problem is that I can't use it in a big graph with 500 000 nodes, problems with memory. And now I am trying to use the boost library to compute at least the 10th shortest path to all nodes from a sink, but I don't know how can I keep the other paths. Attached: graph_al.cpp that is the code of boost library to compute a single source shortest path with dijkstra and pseudo_code that I was thinking to use to storage the other paths, but I don't know how to use it in a complex code like dijkstra boost code. If someone could help me ? thank you in advance. Alexandre de Lima

1 0

Re: [Boost-users] What's happened to Ryppl?
by Brian Wood 31 Jan '11

31 Jan '11

Edward Diener: >On 1/30/2011 7:16 PM, Scott McMurray wrote: >> >> >> I agree -- everything different about a DVCS is a consequence of >> allowing local commits. The best way I've seen of phrasing that >> fundamental difference: >> >> "[A DVCS] separates the act of committing new code from the act of >> inflicting it on everybody else." ~<http://hginit.com/00.html> > > But of course when you eventually merge all your local commits which Git > encourages you to keep to yourself until you are good and ready to > combine them with other people's repositories and local commits, I think that's called chewing the cud. I'm not a Git user, but it reminds me of the saying, "Don't call us, we'll call you." I find this thread interesting so thanks to all involved. And thanks for not top-posting. -- Brian Wood Ebenezer Enterprises http://webEbenezer.net (651) 251-9384

1 0

[boost 1.45.0][mingw] Boost build failure
by Pavel Belski 30 Jan '11

30 Jan '11

I'm trying to build some libraries from Boost using bjam, as it is suggested here(http://www.boost.org/doc/libs/1_45_0/doc/html/boost_asio/using.html). Because i have more than one compiler installed, I've changed the command line a bit to chose the toolset(mingw that comes together with Qt SDK) explicitly: D:\boost_1_45_0>bjam toolset=gcc --with-system --with-thread --with-datetime --with-regex --with-serialization stage Immediately i get the error message: mingw.jam: No such file or directory D:/boost_1_45_0/tools/build/v2/build\toolset.jam:38: in toolset.using rule mingw.init unknown in module toolset. D:/boost_1_45_0/tools/build/v2/build\project.jam:881: in using project-config.jam:1: in modules.load D:/boost_1_45_0/tools/build/v2\build-system.jam:257: in load-config D:/boost_1_45_0/tools/build/v2\build-system.jam:423: in load-configuration-files D:/boost_1_45_0/tools/build/v2\build-system.jam:554: in load D:\boost_1_45_0\tools\build\v2/kernel\modules.jam:283: in import D:\boost_1_45_0\tools\build\v2\kernel\bootstrap.jam:142: in boost-build D:\boost_1_45_0\boost-build.jam:17: in module scope what should i do?

2 1

Google summer of Code 2011 - would a collection of checksums, checkdigits be a useful project?
by Paul A. Bristow 30 Jan '11

30 Jan '11

I have posted some tentative ideas for a GSoC project to create a collection of functions to create and validate check digits at https://svn.boost.org/trac/boost/wiki/SoC2011 Previous discussions suggested that many people might find these useful. Some possible existing systems in wide user are : Simple modulo 256 etc check values and digits. http://en.wikipedia.org/wiki/Cyclic_redundancy_check http://www.boost.org/doc/libs/1_45_0/libs/crc/crc.html Boost's Cyclic redundancy checks codes http://www.boost.org/doc/libs/1_45_0/libs/crc/index.html http://www.netrino.com/Embedded-Systems/How-To/CRC-Calculation-C-Code crc_16_type BISYNCH, ARC crc_ccitt_type designated by CCITT (Comité Consultatif International Télégraphique et Téléphonique) crc_xmodem_type XMODEM crc_32_type PKZip, AUTODIN II, Ethernet, FDDI MD5 hash http://www.md5.net/ SHA hashes http://en.wikipedia.org/wiki/SHA-1 ... Luhn algorithm http://en.wikipedia.org/wiki/Luhn_algorithm Verhoeff algorithm http://en.wikipedia.org/wiki/Verhoeff_algorithm (These two are used by many of the others below). European Article numbering EAN Symbol Specification Manual, Universal Product Code, Uniform Code Council, Dayton, Ohio, USA. Version of check used by Mastercard, VISA, and most other credit card companies. http://www.beachnet.com/~hstiles/cardtype.html Generalised to arbitrary radix version allowing any characters (not just digits). Gene Callahan, Dr Dobb's Journal, Dec 1995, 131, 132 & 149. Generating Sequential keys in an Arbitrary Radix. IBAN International Banking format http://en.wikipedia.org/wiki/International_Bank_Account_Number http://en.wikipedia.org/wiki/Machine-readable_passport check digit US driving licence US Social security numbers Canadian Social Insurance Numbers UK National Insurance number ISBN http://en.wikipedia.org/wiki/International_Standard_Book_Number ISSN http://en.wikipedia.org/wiki/International_Standard_Serial_Number POSTNET http://en.wikipedia.org/wiki/POSTNET Bar codes http://www.dlsoft.com/services/CheckCalc/ http://en.wikipedia.org/wiki/Check_digit#Other_examples_of_check_digits Chemical abstracts http://en.wikipedia.org/wiki/CAS_registry_number Vehicle Id Number http://en.wikipedia.org/wiki/Vehicle_identification_number And there are no doubt many, many more. Suggestions? A question that Boost users/ developers/gurus might to comment on is the format these should take. Should it something naïve like bool ISBNcheck(string); // return true if is a full valid ISBN with correct decimal digit or X check digit. char ISBNcompute(string); // return the decimal digit or X check digit of the ISBN number passed. and similarly for the other check systems. or do we need something more complicated? String or Arrays of (unsigned?) bytes or? (Most of these examples *are* short strings). What return type? Efficiency is not like to be an issue for many of these? (Boost.crc handles this in a much more generic and complex package but handles some popular types. Some of its examples could be packaged simply as above.) Views? Paul --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

1 0

[CfP] Reminder: 5th Annual BoostCon, Aspen (CO, USA), May 15-20, 2011
by Hartmut Kaiser 30 Jan '11

30 Jan '11

Please note the extended deadline: February 10th, 2011 ------------------ Please distribute. ------------------ 5TH ANNUAL BOOST CONFERENCE 2011 Aspen CO, USA, May 15 - 20, 2011, www.boostcon.com CALL FOR PARTICIPATION We invite you to submit session proposals to the 5th Annual Boost Conference: BoostCon 2011 (Aspen CO, USA, May 15 - 20, 2011). Traditionally the main face-to-face event for all things Boost (www.boost.org) BoostCon 2011 will present leading speakers from the whole C++ community. From using the Boost libraries to writing and maintaining them, from evangelizing to deploying Boost within your organization, from infrastructure and process to vision and mission, and the new C++ Standard, BoostCon brings together the sessions, the colleagues, and the inspiration to support your work with C++ and Boost in particular for the next year. To reflect the breadth of the Boost community, the conference includes sessions aimed at three constituencies: Boost end-users, hard-core Boost library and tool developers, and academics focusing on research. The program fosters interaction and engagement within and across those groups, with an emphasis on hands-on, participatory sessions. SESSION TOPICS Topics of interest include, but are not restricted to, the following: * General tutorial sessions introducing one or more Boost libraries * In-depth sessions on using specific Boost libraries * Case studies on using Boost * Experts panels * Advanced sessions on implementation techniques used within Boost libraries * C++0x and how it changes life for users and library writers * Development workshops to extend or enhance existing Boost libraries * Workshops on design process * Infrastructure workshops such as Build tools, Website, Testing * Concepts and Generic Programming * Hardware and infrastructure presentations focused on how libraries can make better use of the technology * Software development tools and their application to C++ and or Boost * Other topics likely to be of great interest to Boost users and developers Interactive and collaborative sessions are encouraged, as this is the nature of both the on-line Boost community and the style of learning and participation that has proven most successful at such events. Sessions can be tutorial based, with an emphasis on interaction and participant involvement, or workshop based, whether hands-on programming or paper-based, discussion-driven collaborative work. SESSION FORMATS Presentations ------------- Presentations focus on a practitioner's ideas and experience with anything relevant to Boost and Boost users. Panels ------------- Panels feature three or four people presenting their ideas and experiences relating to Boost's relevant, controversial, emerging, or unresolved issues. Panels may be conducted in several ways, such as comparative, analytic, or historic. Tutorials ------------- Tutorials are sessions at which instructors teach conference participants specific Boost-relevant skills. Workshops ------------- Workshops provide an active arena for advancements in Boost-relevant topics. Workshops provide the opportunity for experienced practitioners to develop new ideas about a topic of common interest and experience. Author's Corner Presentations ------------- These were introduced at BoostCon 2008, and were a great success. They are short (30 minute) sessions, focusing on tips on usage and design. In addition, we're looking to uncover the hidden design gems in Boost libraries. Tool Vendors Presentations ------------- We actively encourage tool vendors and ISP's to submit proposals for a special Tool Vendors Session Track aimed at products related to Boost and C++ (compilers, libraries, tools, etc.). Other formats may also be of interest. Don't hold back a proposal just because it doesn't fit into a pigeonhole. SUBMITTING A PROPOSAL Standard Sessions are 90 minutes. You may submit a proposal for fractions or multiples of 90-minutes. Fractional proposals will be grouped into 90 minute sessions covering related topics. Longer sessions, such as tutorials and classes, will be assigned 90 minute, three hour (i.e. half day), or six hour (i.e. full day) time slots. Please include: * The working title. * Type of session: presentation, panel, tutorial, workshop, authors corner, vendor track, other. * A paragraph or two describing the topic covered, suitable for the conference web site. * Proposed length: 10-20 minute short talks, 45 minutes, 90 minutes, half day, full day. * Alternate lengths, if you are willing to make adjustments: 10-20 minute short-talks, 45 minutes, 90 minutes, half-day, full day. * Audience: users, developers, both. * Level: basic, intermediate, advanced. * A biography, suitable for the conference web site. * Your contact information (will not be made public). SUBMISSION DETAILS All submissions have to be done through the EasyChair conference management system: http://www.easychair.org/conferences/?conf=boostcon2011. If you have not already registered at EasyChair, you will need to do so in order to submit your proposal. All submissions will go through a peer review process. Authors are invited (but are not required) to submit PDF versions of full papers of up to 10 pages in ACM conference proceedings format (see http://www.acm.org/sigs/publications/proceedings-templates) The full papers are not required unless you want them published in the proceedings. All accepted proposals will be made available in the Association for Computing Machinery (ACM) Digital Library (approval pending). Best papers, after further reviews, will be considered to be book chapters or journal articles in a renowned journal. The session materials go on the BoostCon website and will be available to attendees. For general information on the BoostCon 2011 paper submission or the scope of technical papers solicited, please refer to the conference website at www.boostcon.com. For any other questions about the submission process or paper format, please contact the Program Committee at boostcon2011(a)easychair.com. If you have any technical problems with EasyChair, please contact EasyChair for help. Note: Presenters must agree to grant a non-exclusive perpetual license to publish submitted materials, either electronically or in print, in any media related to BoostCon. IMPORTANT DATES New proposal submissions due: January 10th, 2011. Proposals decisions sent (tentative program): February 17th, 2011. Fully scheduled program available: February 25th, 2011. Session materials due: April 15th, 2011. Hartmut Kaiser: hartmut.kaiser(a)gmail.com (Program Committee Chair) David Abrahams: dave(a)boostpro.com (Conference Chair) On behalf of the conference organizers

1 0

Boost regex library problem on Mac
by Michael Muratet 30 Jan '11

30 Jan '11

Greetings I am using some simple boost regex code: const boost::regex eparse("^([[:digit:]]+).*"); (in a header file) boost::cmatch matches; (in a cpp file) from the subroutine if (boost::regex_match(edit.c_str(), matches, eparse)) { // matches[0] contains the original string. matches[n] // contains a sub_match object for each matching // subexpression for (int i = 1; i < matches.size(); i++) { // sub_match::first and sub_match::second are iterators that // refer to the first and one past the last chars of the // matching subexpression std::string match(matches[i].first, matches[i].second); std::cout << "\tmatches[" << i << "] = " << match << std::endl; } } with a makefile: CXXFLAGS = -O2 -g -Wall -fmessage-length=0 -I/usr/local/boost_1_39_0 OBJS = CrossMapper.o CrossMap.o Read.o Target.o LIBS = -L/lib -lboost_regex-xgcc40-mt-1_39 INCLUDE= /usr/local/boost_1_39_0 TARGET = CrossMapper $(TARGET): $(OBJS) $(CXX) -o $(TARGET) $(OBJS) $(LIBS) all: $(TARGET) clean: rm -f $(OBJS) $(TARGET) It links but will not load: Macintosh-8:~/Documents/workspace/CrossMapper mmuratet$ ./CrossMapper dyld: Library not loaded: libboost_regex-xgcc40-mt-1_39.dylib Referenced from: /Users/mmuratet/Documents/workspace/CrossMapper/./ CrossMapper Reason: image not found Trace/BPT trap Macintosh-8:~/Documents/workspace/CrossMapper mmuratet$ I've been chasing this for several hours and can't get anywhere. Can anyone offer any suggestions? Thanks Mike

2 2

Problems compiling those libraries that are not header only on 64 bit Windows 7
by Ted Byers 29 Jan '11

29 Jan '11

I tried asking this yesterday, but received a message saying I had to subscribe to this list first. I don't understand that reply as I had already subscribed half an hour before I asked the question, and I have been receiving email from the list ever since. So, I am going to try again (with the query updated to reflect my latest attempts). ============================================================================ ==================== I am working on Windows 7 Pro, 64 bit. I have two versions of MS VS: MS VS 2005 and MS VS 2010. I guess my first question is, "Will library files produced by MS VS 2005 work with MS VS 2010?" I know that library files compiled by compilers from different sources (gcc vs MSVC) won't work with each other (unless the library was written in C or FORTRAN), but does the same apply to different versions fo the same compiler? I have a long practice of passing my code through different compilers when part of the requirement is to produce portable code, since different compiler producers will have different strengths and weaknesses; different understandings of applicable standards. But a limited budget means I have to coerce them to live on the same hardware. I used a prebuilt distribution of bjam for all my attempts to build the boost libraries using msvc++. I did not compile it myself. I also have Cygwin installed. >From the C:\boost_1_45_0 directory, I tried the following to keep the builds for the two versions separate (planning on changing the library directories based on the build environment), but when both finished, both C:\boost_1_45_0\lib\msvc2010\x64 and bjam --build-dir=C:\boost_1_45_0\lib\msvc2010\x32 were empty and C:\boost_1_45_0\stage\lib had 606 items. bjam --build-dir=C:\boost_1_45_0\lib\msvc2010\x32 --build-type=complete bjam --build-dir=C:\boost_1_45_0\lib\msvc2010\x64 --build-type=complete And if I execute bjam in status, I get a result that says something like 30 out of 30K tests failed. (Is that normal?) So, what do I do when trying to support both MSVC++ 2005 and MSVC++ 2010? Here are the results from my latest attempt using cygwin. $ ../boost-jam-3.1.18/bin.cygwinx86/bjam --layout=versioned --build-type=complete warning: No toolsets are configured. warning: Configuring default toolset "gcc". warning: If the default is wrong, your build may not work correctly. warning: Use the "toolset=xxxxx" option to override our guess. warning: For more configuration options, please consult warning: http://boost.org/boost-build2/doc/html/bbv2/advanced/configuration.html Building the Boost C++ Libraries. /home/Ted/boost_1_45_0/tools/build/v2/build/configure.jam:145: in builds-raw *** argument error * rule UPDATE_NOW ( targets * : log ? : ignore-minus-n ? ) * called with: ( <pbin.v2/libs/regex/build/gcc-4.3.4/debug>has_icu.exe : : ignore-minus-n : ignore-minus-q ) * extra argument ignore-minus-q (builtin):see definition of rule 'UPDATE_NOW' being called /home/Ted/boost_1_45_0/tools/build/v2/build/configure.jam:179: in configure.builds /home/Ted/boost_1_45_0/tools/build/v2/build/configure.jam:216: in object(check-target-builds-worker)(a)394.check /home/Ted/boost_1_45_0/tools/build/v2/kernel/modules.jam:103: in modules.call-in /home/Ted/boost_1_45_0/tools/build/v2/util/indirect.jam:96: in indirect.call /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1012: in targets.evaluate-requirements /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1393: in basic-target.compute-usage-requirements /home/Ted/boost_1_45_0/tools/build/v2/build/alias.jam:47: in compute-usage-requirements /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1319: in object(alias-target-class)(a)398.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:732: in generate-really /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:704: in object(main-target)(a)836.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:848: in targets.generate-from-reference /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1217: in generate-dependencies /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1268: in object(typed-target)(a)401.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:732: in generate-really /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:704: in object(main-target)(a)837.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:848: in targets.generate-from-reference /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1217: in generate-dependencies /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1266: in object(typed-target)(a)147.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:732: in generate-really /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:704: in object(main-target)(a)818.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:258: in object(project-target)(a)129.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:848: in targets.generate-from-reference /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1217: in generate-dependencies /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1268: in object(install-target-class)(a)63.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:732: in generate-really /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:704: in object(main-target)(a)629.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:848: in targets.generate-from-reference /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1217: in generate-dependencies /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1268: in alias-target-class.generate Jamroot:648: in build-multiple Jamroot:634: in object(top-level-target)(a)72.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:732: in generate-really /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:704: in object(main-target)(a)633.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:848: in targets.generate-from-reference /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1217: in generate-dependencies /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1268: in alias-target-class.generate Jamroot:648: in build-multiple Jamroot:634: in object(top-level-target)(a)73.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:732: in generate-really /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:704: in object(main-target)(a)634.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:258: in object(project-target)(a)16.generate /home/Ted/boost_1_45_0/tools/build/v2/build-system.jam:735: in load /home/Ted/boost_1_45_0/tools/build/v2/kernel/modules.jam:283: in import /home/Ted/boost_1_45_0/tools/build/v2/kernel/bootstrap.jam:142: in boost-build /home/Ted/boost_1_45_0/boost-build.jam:17: in module scope And nothing was built. So, what do I have to do to pursuade bjam to produce all of the library files in cygwin? Thanks Ted

5 9

[network] Bagged, Tagged, New Release 0.8.1
by Dean Michael Berris 29 Jan '11

29 Jan '11

Hi Everyone, Just a quick note, there's an update to the 0.8 line which addresses issues that have been identified with the previous 0.8 release. It's recommended that people using the 0.8 release upgrade to 0.8.1. This release is still a header-only release, with some features back-ported from the 0.9-devel branch. You can get the 0.8.1 release at https://github.com/cpp-netlib/cpp-netlib/downloads Have a good day everyone and I hope this helps. PS. The 0.9 release should come out soon, final documentation updates are just getting done; the 0.9 line will be the version that shall be submitted for review, looking for interested review managers at this time. -- Dean Michael Berris about.me/deanberris

1 0

boost recursive_mutex destructor call in child (forked) process
by Prince Singh 29 Jan '11

29 Jan '11

I am facing a problem in using boost::recursive_mutex. Flow of my program is:- 1. Get a boost::recursive_mutex lock 2. Fork the process 3. In parent sleep for few seconds and then unlock boost::recursive_mutex. 4. In child call exit(0) What is happening is that child process is calling the destructor of boost::recursive_mutex and core is dumped. I want that child process should not inherit the boost mutex lock of parent. Please tell me how to do it. Please find attached the core, binary file and the source files. *Stack of core dumped* Thread 1 (Thread 32305): #0 0x0000003bb9c30265 in raise () from /lib64/libc.so.6 #1 0x0000003bb9c31d10 in abort () from /lib64/libc.so.6 #2 0x0000003bb9c296e6 in __assert_fail () from /lib64/libc.so.6 #3 0x0000000000401224 in boost::recursive_mutex::~recursive_mutex(this=0x602c40, __in_chrg=<value optimized out>) at /installs/boost/boost_1_39_0/include/boost-1_39/boost/ thread/pthread/recursive_mutex.hpp:62 #4 0x0000000000400f08 in __tcf_1 () at ../BoostTestClass.cpp:10 #5 0x0000003bb9c333a5 in exit () from /lib64/libc.so.6 #6 0x0000000000400f69 in main () at ../BoostTestClass.cpp:29 -- Thanks and Regards Prashant Gour Software Engineer Drishti-Soft Solutions Pvt. Ltd.

2 1

large variant performance compared (50 elements)
by Paul 29 Jan '11

29 Jan '11

In a project we are using variants holding shared_ptr's. These variants are typically 20 items large but are growing as the project progresses. Now it seems that each time we add elements, we fall into issue's regarding excessive compilation time, huge pdb file or out of heap space errors on the compiler or linker. I took some time to compare various approaches using variants, here are the results: stdafx.h #include <boost/mpl/vector.hpp> #include <boost/mpl/vector/vector100.hpp> #include <boost/variant/variant.hpp> #include <boost/variant/apply_visitor.hpp> #include <boost/variant/static_visitor.hpp> test.h class CTest { public: void foo(const Cs_t& rt); }; type.h class C1 { public: int i; }; class C2 { public: int i; }; class C3 { public: int i; }; ... class C50 { public: int i; }; //v1 typedef boost::variant< boost::shared_ptr<C1>, boost::shared_ptr<C2>, <...> boost::shared_ptr<C49>, boost::shared_ptr<C50> > v_t; //v2 typedef boost::mpl::vector50< boost::shared_ptr<C1>, boost::shared_ptr<C2>, <...> boost::shared_ptr<C49>, boost::shared_ptr<C50> > Mplv_t; typedef boost::make_variant_over<Mplv_t>::type v_t; //v3 typedef boost::variant< C1, C2, <...> C49, C50 > v_t; test.cpp namespace { class CVisit : public boost::static_visitor<> { public: template<typename T> void operator()(const T& rt) const { std::cout << typeid(T).name() << std::endl; } }; } void CTest::foo(const v_t& v) { //A: (invoke visitor directly, no new variant) boost::apply_visitor(CVisit(), v); //B: Copy variant using copy constructor v_t v2(v); <...> //C: Copy variant using assignment operator v_t v2; v2 = v; <...> } main.cpp int main(int argc, char* argv[]) { CTest t; v_t v = boost::shared_ptr<C10>(new C10); t.foo(v); return 0; } Setup: Boost 1.38 Msvc2005, Release target Optimize MaxSpeed (/O2) Debug info enabled (/Zi) Build time = rebuild solution; cl + link Variant type: v1 Foo logic:A Obj size: 2.4MB Exe size: 348KB Pdb size: 9.0MB Build time: 0:49 Peak commit: 500MB Variant type: v2 Foo logic:A Obj size: 1.4MB Exe size: 348KB Pdb size: 11.7MB Build time: 1:02 Peak commit: 600MB Variant type: v3 Foo logic:A Obj size: 1.9MB Exe size: 344KB Pdb size: 3.9MB Build time: 0:25 Peak commit: 300MB Variant type: v1 Foo logic:B (copy variant using copy constructor) Obj size: 3.1MB Exe size: 352KB Pdb size: 9.0MB Build time: 0:50 Peak commit: 500MB Variant type: v2 Foo logic:B Obj size: 2.2MB Exe size: 352KB Pdb size: 11.7MB Build time: 1:03 Peak commit: 600MB Variant type: v3 Foo logic:B Obj size: 2.1MB Exe size: 344KB Pdb size: 3.9MB Build time: 0:26 Peak commit: 300MB Variant type: v1 Foo logic:C (copy variant using assignment operator) Obj size: 71.3MB Exe size: 356KB Pdb size: 10.7MB Build time: 5:18 Peak commit: 1.2GB Variant type: v2 Foo logic:C Obj size: 80.6MB Exe size: 356KB Pdb size: 13.6MB Build time: 8:46 Peak commit: 1.4GB Variant type: v3 Foo logic:C Obj size: 2.4MB Exe size: 344KB Pdb size: 3.9MB Build time: 0:26 Peak commit: 300MB Is there any way to explain these (huge) differences and what is preffered? - Why does the use of assignment operator have such a hugh impact? - Why the difference between using shared_ptr or not? - When to use the numbered variant or boost::variant<...>? Help is greatly appreciated! Paul

9 67

lexical_cast<> in 1.39 does not provide basic_stringstream to operator>>
by Max Motovilov 29 Jan '11

29 Jan '11

Just ran into a regression in old code that last worked [probably] with 1.32 -- I have a number of ADTs which use tellg()/seekg() in their implementations of operator>>. This used to work fine with lexical_cast and now it breaks because the [optimized?] version in 1.39 uses a statically allocated buffer and plain Jane basic_streambuf which does not implement seekpos() and seekoff(). According to http://www.boost.org/doc/libs/1_45_0/libs/conversion/lexical_cast.htm#n1973, operator>> called from a lexical_cast should have at least basic_stringbuf to work with. Now, this project is locked into 1.39 for administrative reasons and I will have to work around the issue anyway. Still, I'm curious whether this is a problem that has been fixed since 1.39, a previously unnoticed bug or a by-design behavior that I am misinterpreting as a violation of spec... Thanks in advance, ...Max...

2 2

[serialization] plugin dll: What project settings are really needed?
by Georg Gast 28 Jan '11

28 Jan '11

Hi! Currently i'm trying to understand serialization via base pointer in a dll. My environment: - Windows XP SP3 - MS Visual Studio 2010 Prof (German) - Boost: 1.45.0 To try that i created 2 projects in one solution: test.exe (like test_dll_plugin) and test_plugin.dll (like dll_polymorphic_derivied2). Copied these files from boost/libs/serialization/(test|examples). Files in test.exe project (console app): - polymorphic_base.hpp - test_tools.hpp - text_archives.hpp Files in test_plugin.dll (standard win32 dll): - polymorphic_base.hpp - test_dll_plugin.cpp - polymorphic_derived2.cpp shared files: - test_decl.hpp - polymorphic_base.hpp Then i tried to copy the project settings to know the exact required settings: test.exe: --------- Preprozessor: WIN32;(_DEBUG|NDEBUG);_CONSOLE;BOOST_LIB_DIAGNOSTIC=1;BOOST_ALL_DYN_LINK=1 C++: Checking of small types: Yes /RTCc Funktionlevel-Linking aktiv: No /Gy- Run time type info: yes / GR systeminternal functions active: yes /Oi Runtime Library: Multithreaded(-Debug)-DLL (/MD|/MDd) test.dll: --------- Preprozessor: WIN32;(_DEBUG|NDEBUG);BOOST_ALL_DYN_LINK=1;BOOST_LIB_DIAGNOSTIC=1;_WINDOWS;_USRDLL;PLUGINDLL_EXPORTS C++: minimal recompilation: No /Gm- complete runtimechecking (Vollständige Laufzeitüberprüfung): Standard Run time type info: yes / GR Runtime Library: Multithreaded(-Debug)-DLL (/MD|/MDd) Now my questions: First Question: Are the above mentioned project settings for the exe and the dll really right and complete? Or is something not needed or missing? Second question: In my real project the dll should be able to provide derivied class dependant MFC Objects (Views/Dialogs) which are then shown in the exe. So: Is that (serialization through basepointer in dll) possible with a MFC extension library or do i need to create a MFC gui dll and a "polymorphic_derived2.dll"? Hope that is understandable ;) Best Regards Georg Gast

3 6

property tree child order
by Gianni Ambrosio 28 Jan '11

28 Jan '11

Hi All, can anybody tell me please if the property tree structure keeps the same child order of the related xml file? Regards Gianni

2 2

[range] Zip range adaptor
by Nathan Crookston 28 Jan '11

28 Jan '11

All, I've been using the boost range library for a few months now, and it's simplified my life considerably. I occasionally want to use something akin to MPL's zip_view and unpack_args with my ranges. For example: <code> const std::vector<int> vec1 = list_of(1)(2)(3)(4)(5)(6); std::vector<int> vec2 = list_of(10)(20)(30)(40)(50)(60); std::vector<int> vec3 = list_of(100)(200)(300)(400)(500)(600); boost::for_each(zip(vec1, vec2, vec3) | strided(2), unpack( std::cout << px::val('(') << arg1 <<", "<< arg2 <<", "<< arg3 << ")\n")); boost::transform(vec1, boost::begin(zip(vec3, vec2)), px::construct<boost::tuple<int,int> >(arg1 + 1, arg1 + 2)); boost::for_each(zip(vec2, vec3), unpack(std::cout << px::val('(') << arg1 << ", " << arg2 << ")\n")); </code> I note that the new algorithms include a two-argument for_each, but it would be nice to have something more extensible. I may have missed it in the documentation or on the list, but I haven't found anything like that. Does anyone know of such an adaptor? Since it's the weekend, I actually implemented code which allows the previous snippet to compile -- if no such adaptor exists I'd be happy to make it available/submit it to boost assuming there's interest. Thanks, Nate

4 7

BGL Properties
by David Doria 27 Jan '11

27 Jan '11

I have two questions: 1) I am trying to iterate through the edges of a graph and output their edge weights. I am confused though. I know how to output the "edges", but they are actually just a (vertex, vertex) pair which defines the edge. So do I index *edgePair.first into the EdgeWeightMap to get the weight of the edge starting from vertex *edgePair.first? Or how else would I get the weight associated with a particular edge? Code snippet: http://stackoverflow.com/questions/4810589/output-bgl-edge-weights 2) I have created a struct, and used it as a template parameter to adjacency_list. However, when I try to add_edge(vertex1, vertex2, property, graph) , the compiler complains "no matching function call". Can anyone see where I've gone wrong? Code snippet: http://stackoverflow.com/questions/4810235/bgl-bundled-properties-add-edge-… Any suggestions on either of these? Thanks, David

3 5

Boost thread: class member problem
by Patricia Hazel Shaw [phs] 27 Jan '11

27 Jan '11

Dear List members, I am trying to make use of threads within a class, but seem to be having problems with the syntax and getting it to compile. The outline of my class related to this thread issue is as follows: class Board{ public: void pressButton(int button); void boxAction(int box); private: boost::thread_group threads; }; void Board::pressButton(int button){ if(button=1){ threads.create_thread(&boxAction,1); } else ... } I have tried various different syntax within the create_thread() but have not been able to figure out from the documentation, or reading through the history of this mailing list, how to correctly do this. Any help you could give me would be greatly appreciated. Patricia Shaw

2 2

[Review][GIL] Boost.GIL IO and Toolbox extensions have been ACCEPTED into Boost
by Mateusz Loskot 27 Jan '11

27 Jan '11

Dear All, The formal review of IO and Toolbox extensions for Boost.GIL [1] ended on December 17th, 2010 [2] The review subject was not a standalone library but a part of whole - an extension to existing Boost.GIL. The review result: ACCEPTED Number of received discussion and feedback posts is ~140. I consider most of them in-topic, significant and also insightful. Reviewers pointed issues already known from previous discussions on the mailing list as well as new topics regarding the design and implementation of the extensions. Also, issues related to the library itself (Boost.GIL) were addressed. Some of them could be considered ideas for future works and improvements. It is remarkable, most (if not all) of the discussions were focused on the IO extension. None of the submitted reviews include comments to the Toolbox extension. Formally, the review concluded with 1 NO and 7 YES votes. Some of the YES votes are considered as conditional and number of changes were requested by the reviewers. The following changes should be addressed before the extensions appear in the Boost mainstream: 1. Documentation is adequate, but requires clean-up and fixing of lots of typos. 2. Additional tests are added to exercise currently untested error cases that result in a longjmp should be added. They should pass on all platforms officially supported by Boost. 3. Make sure the test images are license-free. If the license status is unknown, change them to other license-free images. 4. The requirements for adding new file formats / backends to be made more explicit. This means defining concept for a file format reader/writer, etc. and adding new file formats would constitute providing models for these concepts. 5. Support for reading images whose file format is unknown at compile time. That involves the ability to register file formats / backends, associate them with given extensions and then call the appropriate reader based on the extension of the file name. 6. Support for different backends for the same image formats. It appears that this can be done simply the same way a file format can be extended, i.e. have "png_libpng" and "png_lodepng" tags. 7. Support for efficient reading/writing of parts of images that are too large to fit in memory. There are two ways to proceed: one is to have an input/output iterator that enforces sequential access, and another is to allow for user-driven access at the cost of sometimes severe performance. The reviewers also posted a few suggestions that could improve quality of the two extensions, 1. Name of functions like read_int8, read_int16, read_int32, write_int8 in Device models suggest they return and accept signed integers, but they return and accept unsigned integers. The naming could be improved.. 2. Do some profiling and performance optimization of the most common formats. Add some test cases to measure speed of common scenarios. 3. Make sure the test cases provide complete coverage. For example, set a breakpoint in every method, every switch statement and branch. Run your tests and remove any breakpoints that are encountered. Look at the breakpoints that were not hit and add tests for them. 4. It would be great if Christian and Domagoj could join their efforts to take the best of their libraries (IO extension implementations) to the IO extension included in Boost.GIL and collaborate for the advanced features discussed in reviews. I would like to thank Edd Dawson, Zach Laine, Domagoj Saric, Roland Bock, Lubomir Bourdev, Tom Brinkman, Phil Endecott, Kenny Riddile for reviews and others who participated in discussions. Thanks also go to Christian Henning for great work. I would like conclude recalling short comment Lubomir Bourdev included in his review. In my opinion, it is a good summary of the Boost.GIL IO and Toolbox review and generally all discussions on this subject: *** The problem with I/O is that you can never declare success. All we can hope for is push the boundary as much as we can, and leave the rest for the next update. *** [1] http://lists.boost.org/boost-announce/2010/11/0273.php [2] http://lists.boost.org/boost-announce/2010/12/0279.php Best regards, -- Mateusz Loskot, http://mateusz.loskot.net Charter Member of OSGeo, http://osgeo.org Member of ACCU, http://accu.org

1 0

[unittest] How to only ignore child terminate?
by Firouzeh Jalilian 26 Jan '11

26 Jan '11

I have a code that is run from the tests that I am running which does child.terminate(). That is considered a system error, therefore, I would have to set catch_system_errors="no" in order to ignore it. But the downside is I miss the rest of system errors I might be interested in. How can I only ignore child.terminate() while running unittests? Thanks in advance

3 2

Aggregate a boost::array, initialize with initializer list -- how?
by Dave Steffen 26 Jan '11

26 Jan '11

Hi Folks, I've got a question about supporting brace initialization syntax. double a[] { 1,2,3 }; ok, always has been. boost::array<int, 3> b {{ 1,2,3 }} Needs double braces because there's one member data to be initialized, and we want to initialize that with {1,2,3}. Fine. Some compilers let you drop one set of braces; GCC 4.4 does, but produces a warning. Now, I make a class: template<size_t N> Vector { public: ... boost::array<double, N> data; }; Vector<3> v {{{1,2,3}}} Still OK: again in principle, I need three sets of braces. However, I'd like my Vector::data member to be private, but as soon as I do that, Vector isn't a POD any more, and the brace initialization no longer works. (I'm not sure if this is in line with the standard, or is a GCC 4.4 limitation.) No problem, std::initializer_list to the rescue: template<size_t N> Vector { public: Vector(std::initializer_list<double> i) : data{i} {} ... private: boost::array<double, N> data; }; Alas, boost::array has no constructor that takes an initializer_list: error: no matching function for call to ‘boost::array<double, 3ul>::array(std::initializer_list<double>&)’ note: candidates are: boost::array<double, 3ul>::array(const boost::array<double, 3ul>&) /usr/local/Boost/1.44/boost/array.hpp:57:17: note: boost::array<double, 3ul>::array() scons: *** [fast/Test/testVector.o] Error 1 Having poked through the standard, I can't see any way to convince the compiler to turn an initializer_list back into the semantic equivalent of a brace initializer. Does anyone know how to do this? Does boost::array need a constructor that takes initializer_lists? Thanks! -- Dave Steffen, Ph.D. - Software Engineer Numerica Corporation <http://www.numerica.us> 4850 Hahns Peak Drive, Suite 200 Loveland, Colorado 80538 main (970) 461-2000 x 227 Email: dave.steffen(a)numerica.us fax (970) 461-2004

2 2

Simple serial port demonstration with boost asio asynchronous I/O
by Jeff Gray 26 Jan '11

26 Jan '11

A couple of weeks ago I posted a simple asynchronous demonstration of a telnet client using boost asio TCP network code. I have changed this code to turn it into a simple serial terminal application using the serial port support in the new version of boost asio. It required no changes at all the the read or write code. I just altered the initialization to use a serial port instead of a socket. Note that this is not intended to show how a fully functional application would work. There are plenty of areas that are not handled in this code. But it shows the idea and it's easy to build on this once you've got it working. Hope this helps someone else get started... Jeff

3 2

[intprocess] Incorrect alignment in managed memory named allocations
by Kevin J. Arunski 26 Jan '11

26 Jan '11

It appears that the named allocation functions for the managed memory classes do not place constructed objects at the appropriate alignment for the requested type in all situations. Here is a simple example to illustrate the issue. #include <iostream> #include <boost/interprocess/managed_mapped_file.hpp> // alignment of 16 on i386 and x86_64 struct vector_of_double { long double x; long double y; long double z; }; int main() { namespace bip = boost::interprocess; { std::cout << "Alignment of vector_of_double is " << __alignof__(vector_of_double) << std::endl; bip::managed_mapped_file simple_file_mapping(bip::create_only, "simple_mapping", 65536); vector_of_double * test_vec = simple_file_mapping.construct<vector_of_double>("a named vector allocation")(); std::cout << "Resulting allocation is at address: " << test_vec << std::endl; } bip::remove_file_on_destroy("simple_mapping"); return 0; } On gcc targeting i386, this code prints: Alignment of vector_of_double is 16 Resulting allocation is at address 0x???????c Similar results on x86_64. It appears the resulting address is only aligned on a 4 byte boundary on 32 bit targets and 8 byte on 64 bit targets. Are there workarounds? I have tried explicitly setting the alignment parameter in the mapped region's index parameter to 16, but it did not change the result. I have tested the problem with anonymous allocations, and those do appear to be appropriately aligned. Only named allocations have the issue.

1 0

Merging Boostbook XML Files
by Faruk Kuşcan 25 Jan '11

25 Jan '11

Hello, I'm trying to merge two boostbook xml files into one. http://gcc.gnu.org/ml/libstdc++/2007-11/msg00029.html I had done everything in this link but could not merge boostbook xml files. Isn't there any xslt file called merge or something else which does this. If you know the way, how some boostbook xml files are merged togeter, I'll be very appreciated. Thanks fro your help. Faruk

2 2

template type asserting
by Kraus Philipp 25 Jan '11

25 Jan '11

Hello, I have written a template class and I would like tot "assert the type". My class should only use floating point types like double or float. Can I do this check with BOOST_STATIC_ASSERT or anything else? The class need not to use a "countable type" (math: in N). Thanks Phil

5 5

update on boost logger
by Jeff Graham 25 Jan '11

25 Jan '11

Hello everyone, Where can I find the logger that has been accepted into boost? I think it is here: http://boost-log.sourceforge.net/libs/log/doc/html/index.html ? According to this message it was accepted into boost on March 24, 2010, but subject to some critical fixes: http://lists.boost.org/boost-announce/2010/03/0256.php However, the changelog at the above sourceforge site was last updated in May 2010, and the ToDo/wish list seems lengthy. There seems no easy way to track the progress on the critical fixes, some which are performance related and are of concern to my projects. Any status on the fixes, informal review on the fixes, and if all will be done for 1.46? Thanks

2 2

Re: [Boost-users] [Preprocessor] Relative Addresses in BOOST_PP_FILENAME_1
by Hossein Haeri 25 Jan '11

25 Jan '11

Dear TONGARI, > Just make sure "Lib" is in the include path, then everything works fine > for me. So, here is a very strange observation I got after trying to strictly follow the above recommendation of yours: I added my current working directory to the include path and it worked! I always thought that that is already in ones include path (by default). My compilers have always found such files. It even happens that my other files (in the same directory) used to find Header.hpp even despite that strange error I used to get! :O > It would be fine in the Remarks section to add words like:"quoted > filename may not work with some compilers here, such as gcc..." Agree. Thanks a lot, --Hossein

2 1

Re: [Boost-users] [Preprocessor] Relative Addresses in BOOST_PP_FILENAME_1
by Hossein Haeri 25 Jan '11

25 Jan '11

Dear TONGARI, > Where I said <> I meant <something in compiler's include path>, that > works fine, just as Edward and Steven said. Well, my working directory is already in my compiler's include path. And, inside Header.hpp, the following line #define BOOST_PP_FILENAME1 <Header.hpp> fails to compiler in GCC 4.5.1 because GCC says it can't find Header.hpp. And, I am missing anything here? Maybe it's better that you tell me what you'd be writing instead of the line above if it would have been you... > If this is not a bug with a specific compiler, I hope at least it should > be noted in Boost.PP's doc. It's not. Both quote and angle brackets are mentioned to work in the specs: http://www.boost.org/doc/libs/1_45_0/libs/preprocessor/doc/ref/filename_x.h… TIA, --Hossein

3 3

Re: [Boost-users] Boost-users Digest, Vol 2613, Issue 3
by Loek Cleophas 25 Jan '11

25 Jan '11

On Mon, Jan 24, 2011 at 18:00, <boost-users-request(a)lists.boost.org> wrote: > Date: Mon, 24 Jan 2011 17:48:14 +0200 > From: Igor R <boost.lists(a)gmail.com> > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] [statechart] (custom) state queries for > asynchronous state machine > Message-ID: > <AANLkTim_eYbue02=dOA=0ouAi7wWDTaV9KWW0TXZ+Aum(a)mail.gmail.com<0ouAi7wWDTaV9KWW0TXZ%2BAum(a)mail.gmail.com> > > > Content-Type: text/plain; charset=UTF-8 > > > However, for the asynchronous case, access to the state machine is via a > > scheduler only - and I don't see how to get the information from there > nor > > is there any documentation on that in the tutorial. Any hints on how to > do > > this? > > With async. state machine such a direct access wouldn't be thread > safe. So the only way you can retrieve its state is by means of > events. I.e. you can enqueue an event, which contains some facility > for the response - like a ptr to a message queue or a slot for > boost.signals2 and so on. When processing this event, the machine > performs the query you want and returns you the answer through the > facility you provided. > Hi Igor, of course, that makes sense. I don't know why I didn't think of using a callback - but will try that now. Thanks for your prompt response, it's much appreciated! Loek

1 0

Iostreams code_converter peculiarities
by Eddie Carle 25 Jan '11

25 Jan '11

I've been working on converting a the fastcgi++ library over to using boost::iostreams from std::iostreams and I've noticed some peculiarities that I can't seem to work passed. For one, how do you change the buffer size of the code_converter adaptor? The built in facilities don't seem to actually do anything. I am adding to a filtering_stream and have noticed that for the following statements... stream.push(code_converter<MyDevice>(myDevice), 8192); stream.push(code_converter<MyDevice>(myDevice, 8192)); stream.push(code_converter<MyDevice>(myDevice, 8192), 8192); All result in a buffer of 128 bytes. I can't figure out a way to actually change it. I've been monitoring what is going in the myDevice and it is always 128 byte chunks (or less). If I remove the code_converter from the stream and go directly in myDevice as per stream.push(myDevice, 8192); the buffer is sized as I want it to be and myDevice receives chunks of data maxing at 8192 bytes. Secondly, when using the statement stream.push(code_converter<MyDevice>(myDevice, 8192)); code_converter calls not MyDevice(const MyDevice&) for copying constructing the object but for some reason MyDevice(const MyDevice&, const long int&). What is that? Why is code_converter looking for such a constructor when I specify a buffer size for the code converter? Thirdly, I can not for the life of me make the code converter flush it's data. If I call a stream.strict_sync() should the code_converter not get flushed as well? It doesn't. Everything else in the chain does but the code_converter won't fully flush until destruction. Thanks. -- Eddie Carle

1 0

Re: [Boost-users] reference access with boost::make_transform_iterator
by Patrick Sauer 25 Jan '11

25 Jan '11

Hi, I'm trying to use boost::make_transform_iterator to create an iterator for a custom class whose data is held in a map and where the iterator uses the vector of keys to access the values. In my problem, the values of the map are containers which hold large data. Since I can't afford to copy the data, I would like to access the data by reference via the iterator. However, when doing this, the data is corrupted, as is exemplified by the output of the simple example I have attached. As far as I can tell the problem lies in the use of the from_key functor, which is initialised using a reference to the map and is corrupted when passed through make_transform_iterator. Any ideas how I could do this properly using boost? Thanks, Patrick #include <iostream> #include <string> #include <vector> #include <boost/unordered_map.hpp> #include <boost/iterator/transform_ iterator.hpp> #include <boost/assign.hpp> #include <boost/assign/std/vector.hpp> #include <boost/lambda/lambda.hpp> #include <boost/lambda/bind.hpp> #include <boost/ref.hpp> using namespace boost::assign; namespace bl = boost::lambda; class holder { public: holder() : v() {}; holder( const std::vector<double>& in ) : v(in) {}; std::vector<double>& vector() { return v; }; const std::vector<double>& vector() const { return v; }; private: std::vector<double> v; }; class from_key { public: typedef holder result_type; from_key( const boost::unordered_map<std::string, holder >& m ) : map_(m) {}; const holder& operator() ( const std::string& in ) const { return map_.at(in); }; private: const boost::unordered_map<std::string, holder >& map_; }; typedef boost::transform_iterator<from_key, std::vector<std::string>::iterator > iterator; int main() { std::vector<std::string> keys; keys += "1","2","3"; std::vector<double> vals; vals += 1.0, 2.0, 3.0; holder h(vals); boost::unordered_map<std::string, holder > m; insert( m ) ( "1", h ) ( "2", h ) ( "3", h ); iterator it = boost::make_transform_iterator( keys.begin(), from_key( m ) ); iterator end = boost::make_transform_iterator( keys.begin(), from_key( m ) ); const std::vector<double>& v = it->vector(); std::for_each( vals.begin(), vals.end(), std::cout << bl::_1 << " " ); std::cout << std::endl; std::for_each( v.begin(), v.end(), std::cout << bl::_1 << " " ); std::cout << std::endl; }

2 1

[Interprocess]
by Daniel Neuberger 24 Jan '11

24 Jan '11

Hi Ion (and everyone else), I looked through the recent commits and it looks like support for XSI shared memory has been added (https:// svn.boost.org/trac/boost/changeset/67451) Does this mean XSI is ready to use now? Do you think these changes will make it into the upcoming 1.46 release? Alternatively, do you think applying the above changeset to Boost 1.43 be sufficient to be able to use XSI shared memory? Thanks again, - Daniel P.S. Sorry if anyone got another similar message to this from me; I sent one in response to another message but think the thread was already too old.

2 7

Random: How to get a different seed?
by Zoltán Lengyel 24 Jan '11

24 Jan '11

Hello, I am trying to make a simple program that can generate random integers in range, using boost::uniform_int. http://www.boost.org/doc/libs/1_45_0/doc/html/boost_random/tutorial.html#bo… This tutorial tells: "We use mt19937<http://www.boost.org/doc/libs/1_45_0/doc/html/boost/mt19937.html>with the default seed as a source of randomness. The numbers produced will be the same every time the program is run. One common method to change this is to seed with the current time (std::time(0) defined in ctime)." I have trouble getting this common method compile and work. Here's a tiny program that works, with the same seed at every run (like what the tutorial does), I have commented out my desperate tries to make the seed change. #include "uniform_int.hpp" #include "boost/random/variate_generator.hpp" #include "boost/random/mersenne_twister.hpp" #include <time.h> #include <iostream> using namespace std; using namespace boost; mt19937 gen; // time_t gen = time(0); int roll_die() { uniform_int<> dist(1, 6); variate_generator<mt19937&, uniform_int<> > die(gen, dist); //boost::variate_generator<time_t, boost::uniform_int<> > die(gen, dist); return die(); } int main() { for (int i = 0; i < 5; i++) cout << roll_die() << endl; return 0; } So, I would be glad, if someone could fix this for me, to have a different seed (depending on system time) at each start. Thanks!

5 7

[Preprocessor] Relative Addresses in BOOST_PP_FILENAME_1
by Hossein Haeri 24 Jan '11

24 Jan '11

Dear all, I am trying to use BOOST_PP_FILENAME_1 for a header file in my current directory. Unless I hardcode the full address, GCC 4.5.1 (MinGW32, WinXP, SP3) says it can't find the same file in which I am using BOOST_PP_FILENAME_1! Is there any way I can go for relative file names? I have already checked the following -- neither works for the same reasons: #define BOOST_PP_FILENAME_1 "./Header.hpp" //1 #define BOOST_PP_FILENAME_1 ".\Header.hpp" //2 #define BOOST_PP_FILENAME_1 "Header.hpp" //3 TIA, --Hossein

4 6

[statechart] (custom) state queries for asynchronous state machine
by Loek Cleophas 24 Jan '11

24 Jan '11

Hi, I'm trying to figure out how to perform (custom) state queries on statechart's asynchronous state machines. The tutorial at http://www.boost.org/doc/libs/1_44_0/libs/statechart/doc/tutorial.html#Stat… how to do this for synchronous state machines - using state_iterator and the state machine's state_begin() and state_end() member functions. However, for the asynchronous case, access to the state machine is via a scheduler only - and I don't see how to get the information from there nor is there any documentation on that in the tutorial. Any hints on how to do this? Regards, Loek

2 1

boost::trim throwing std::bad_cast exeption with custom basic_string
by Arash Abghari 24 Jan '11

24 Jan '11

Hi, I have a custom basic_string as follows: typedef basic_string<unsigned int> ustring; so if I pass an instance of ustring to boost:trim it throws an std::bad_cast exception. ustring str; boost::trim(str); The exception comes from here: include/boost/algorithm/string/detail/classification.hpp:45 return std::use_facet< std::ctype<CharT> >(m_Locale).is( m_Type, Ch ); It does not matter what character type I use for basic_string, It throws the exception for anything but char and wchar_t. Document mentions "A string is not restricted to std::basic_string and character does not have to be char or wchar_t, although these are most common candidates", So I assume, It must work with unsigned int or other types. Here is the system spec: boost: 1.40 gcc: 4.3.4 OS: Debian Lenny 64bit Thanks

3 7

Re: [Boost-users] [Fusion] Building parameter list for fusion::invoke
by Vivek 24 Jan '11

24 Jan '11

> > 2011/1/22 Vivek <vivek_at_[hidden]> > Or alternatively, is there a direct way to initialize a fusion vector? IIUC, its ctor just do the job, not? The problem is I don't know the arity or parameter types of the function being called. I just have a source of data (which can be simplified to TYPE data = data_source<TYPE>().pop();) and arbitrary functions being passed in. One alternative is to code-generate template specializations for a bunch of arity and use the constructor like you suggested. But I feel the "arity code generation" thing has been done so many times and so much better in boost that I should be able to use a transform or invoke function to take advantage of that. That's why I started trying to use fusion.

3 5

Re: [Boost-users] [Preprocessor] Relative Addresses in BOOST_PP_FILENAME_1
by Hossein Haeri 24 Jan '11

24 Jan '11

Hi TONGARI, > > #define BOOST_PP_FILENAME_1 "./Header.hpp" //1 > > #define BOOST_PP_FILENAME_1 ".\Header.hpp" //2 > > #define BOOST_PP_FILENAME_1 "Header.hpp" //3 > I have the same problem with you, I also use GCC 4.5.1, while <> works > fine but "" not. Strangely enough, <> doesn't work in my GCC either. (And, I'm not writing a precompiled header anyway.) Are you also using GCC under MinGW32? TIA, --Hossein

2 1

Help me out from boost.log
by Steven Woody 23 Jan '11

23 Jan '11

Hi, I want to use boost.log and I succeeded in building it with bjam with Visual Studio 2005. But I quickly found I cannot use it. Below code are from the tutorial, #include <boost/log/core.hpp> #include <boost/log/trivial.hpp> #include <boost/log/filters.hpp> logging::core::init_log_to_file( keywords::file_name = "dsttest_%N.log", keywords::rotation_size = 10 * 1024 * 1024, keywords::time_based_rotation = sinks::file::rotation_at_time_point(0, 0, 0), keywords::format = "[%TimeStamp%]: %_%" ); logging::core::get()->set_filter( flt::attr<logging::trivial::severity_level>("Severity") >= loggin::trivial::debug ); but the compiler (vc++ 8.0) just complains: error C2653: 'logging' : is not a class or namespace name error C2653: 'keywords' : is not a class or namespace name ... I tried to use boost::log::logging, but it did not help. Then I decided to try the most simple code: BOOST_LOG_TRIVIAL(debug) << "hello boost.log"; it passed the compiler but not the linker: libboost_log-vc80-mt-gd-1_45.lib(trivial.obj) : error LNK2019: unresolved external symbol "class boost::system::error_category const & __cdecl boost::system::generic_category(void)" (?generic_category@system@boost@@YAABVerror_category@12@XZ) referenced in function "void __cdecl boost::system::`dynamic initializer for 'posix_category''(void)" (??__Eposix_category@system@boost@@YAXXZ) .... Please help me! Thanks in advance. -- Life is the only flaw in an otherwise perfect nonexistence -- Schopenhauer narke public key at http://subkeys.pgp.net:11371 (narkewoody(a)gmail.com)

2 2

troubles with boost filtering streams
by Daniel Oberhoff 23 Jan '11

23 Jan '11

Hi, I am working on a matlab file reader/writer. Since matlab uses zip to compress variables I was thinking I could use the boost filtering streams with the zip filter to handle that. The use case is that there are zipped blocks inside the file, i.e. not the whole file is zipped but just parts. I am not sure how to handle that with boost, since I would need to start/stop zipping/unzipping at almost arbitrary points in the file. Also I have trouble working with filtering streams at all. As a baseline test I started substituting the fstream I was reading from with a boost filtering istream onto which I pushed the fstream. Reading works fine for a while and then breaks. What I noted is that the fstream tellg always lags behind the actual number of bytes read. also using the fitlering streams tellg breaks the whole stream. also seeking does not seem to work with the filtering stream. I need to seek quite often. seeking only happens when not unzipping. I tried seeking on the fstream instead. that worked up to some point(as stated above). I fear the seeking on the fstream breaks the filtering stream, but seeking on the filtering stream doesn't work. If anyone has pointers that would be great. Best Daniel

1 0

Random permutations using boost::random_number_generator and std::random_shuffle.
by Matthew Gwynne 23 Jan '11

23 Jan '11

Hi, We need the ability to randomly permute some range, and we already have this functionality available in the computer algebra system Maxima. We use Maxima for numerous things, often implementing basic algorithms in it, then later writing more efficient versions in C++. The problem we have is that we'd like to be able to make sure that any function we write to randomly shuffle a range, matches up with the Maxima "random_permutation" function. We believe it uses the Mersenne twister (boost::mt19937) and Knuth shuffle algorithms, and so we thought to implement these in C++ using boost::uniform_distribution, boost:variate_generator etc. However, we have two questions (open problems): 1) How does boost::variate_generator interact with mt19937, and the distribution? Is this documented somewhere? In the attached code, it seems we can construct boost::uniform_distribution with any maximum value, and still the number generator returns values outside of that range? Is this really right? 2) What algorithm does std::random_shuffle implement? (Not boost related specifically but hopefully someone will know) Is this defined by the C++ standard? It doesn't seem to be the simple Knuth shuffle algorithm (starting from top of range to bottom or vice versa) as we implement in the attached code. If anyone could point me in the right direction, I'd very much appreciate it. Thanks Matthew Gwynne http://cs.swan.ac.uk/~csmg/ Code: #include <vector> #include <iostream> #include <algorithm> #include <iterator> #include <cassert> #include <boost/lexical_cast.hpp> #include <boost/random/mersenne_twister.hpp> #include <boost/random/uniform_int.hpp> #include <boost/random/variate_generator.hpp> #include <boost/random/random_number_generator.hpp> namespace { enum { errcode_parameter = 1 }; const std::string program = "RandomShuffle"; const std::string err = "ERROR[" + program + "]: "; const std::string version = "0.0.3"; const int default_seed = 1; typedef boost::mt19937 base_generator_type; base_generator_type base_rand_gen; inline void set_random(const int seed) { assert(seed >= 1); base_rand_gen.seed(seed); } const unsigned int default_N = 10; typedef std::vector<int> vec_t; inline void initialise(vec_t& a) { for (unsigned int i = 0; i < a.size(); ++i) a[i] = i+1; } inline void output(const vec_t& a) { for (unsigned int i = 0; i < a.size(); ++i) std::cout << a[i] << " "; std::cout << "\n"; } template <class RandomAccessIterator, class RandomNumberGenerator> inline void random_shuffle(const RandomAccessIterator first, const RandomAccessIterator last, RandomNumberGenerator& rand) { typedef typename std::iterator_traits<RandomAccessIterator>::difference_type difference_type; difference_type n = last - first; assert(n >= 0); if (n <= 1) return; for (RandomAccessIterator i = first; i != last-1; ++i,--n) { const difference_type r = rand(n); assert(r >= 0); assert(r < n); std::iter_swap(i, i+r); } assert(n == 1); } } int main(const int argc, const char* const argv[]) { if (argc > 3) { std::cerr << err << "\n At most two arguments are allowed " "(the seed for the random-number generator and the number of elements).\n"; return errcode_parameter; } const int seed = (argc == 1) ? default_seed : boost::lexical_cast<int>(argv[1]); const unsigned int N = (argc < 3) ? default_N : boost::lexical_cast<unsigned int>(argv[2]); vec_t V(N); typedef boost::uniform_int<> uniform_distribution_type; uniform_distribution_type uniform_distribution(0,std::numeric_limits<int>::max()); // is this correct??? typedef boost::variate_generator<base_generator_type&, uniform_distribution_type> generator_type; generator_type rand_gen(base_rand_gen, uniform_distribution); typedef boost::random_number_generator<generator_type> RandomNumberGenerator; RandomNumberGenerator rg(rand_gen); set_random(seed); std::cout << "Underlying random sequence:\n"; for (long n = V.size(); n > 1; --n) std::cout << rg(n) << " "; std::cout << "\n\n"; initialise(V); set_random(seed); std::random_shuffle(V.begin(), V.end(), rg); std::cout << "std::random_shuffle:\n"; output(V); initialise(V); set_random(seed); ::random_shuffle(V.begin(), V.end(), rg); std::cout << "::random_shuffle:\n"; output(V); }

2 4

[Boost 1.34] Unsatisfied symbol "boost::thread::~thread()
by Alexander Vinokur 23 Jan '11

23 Jan '11

Hi, I have the following problem. Boost 1.34 HP-UX B.11.23 U ia64 aCC: HP C/aC++ B3910B A.06.25.01 [May 16 2010] // ------ vvv1.cpp ------ #include <boost/thread.hpp> void tproc() {} int main() { boost::thread t(tproc); t.join(); return 0; } // ----------------------- Compilation-1. > aCC +DD64 -AA -mt -I$BOOST_HOME vvv1.cpp ld: Unsatisfied symbol "boost::thread::~thread()(complete)" in file vvv1.o ld: Unsatisfied symbol "boost::thread::thread(boost::function0<void,std::allocator<boost::function_base> > const&)(complete)" in file vvv1.o ld: Unsatisfied symbol "boost::thread::join()" in file vvv1.o 3 errors. Compilation-2. > aCC +DD64 -AA -mt -lboost_thread-mt -I$BOOST_HOME vvv1.cpp ld: Can't find library for -lboost_thread-mt Fatal error. What is wrong? Thanks Alex Vinokur This message and the information contained herein is proprietary and confidential and subject to the Amdocs policy statement, you may review at http://www.amdocs.com/email_disclaimer.asp

2 1

serialization binary file backwards compatibility issue 1.42 -> 1.45
by Jake Brownson 23 Jan '11

23 Jan '11

I see in the changelog (http://www.boost.org/doc/libs/1_45_0/libs/serialization/doc/release.html) that files serialized with 1.42's binary serialization will have problems opening in 1.45. This is exactly what I'm experiencing. Luckily we have only used 1.42 in our project up to this point when we are testing for a release including boost 1.45, so we know all of our previous files were saved using 1.42. We should be able to automatically apply the fix_six fix when loading old files (I can tell by the filename when it's an old one). However I'm confused because fix_six bumps the version from 6 to 7, but in my copy of boost 1.42 serialization is already saving files w/ a library version of 7. Did 1.42 get patched to fix this issue already, or am I misunderstanding something? I found a recent thread where Robert Ramey asked someone to try trunk. I just did this and without the fix_six fix the files seem to be loading properly. Thanks, Jake

2 2

[Fusion] Building parameter list for fusion::invoke
by Vivek 23 Jan '11

23 Jan '11

I am building a library in which users pass in function pointers of any type. I would like the library to determine the function's signature (using function_types), build a fusion vector for the function's arguments, populate the vector with data from a particular source, and then invoke the function using fusion::invoke. The kicker is that the argument types may not be default constructible. Therefore I need a way of initializing a fusion vector from a source as it is being created. For example, the following won't work namespace ft = ::boost::function_types; namespace bf = ::boost::fusion; struct non_def_type { private: non_def_type(); }; void my_func(non_def_type); template <typename FPTR> void my_invoker(FPTR f) { typedef typename ft::parameter_types<FPTR>::type parameter_types; typedef typename bf::result_of::as_vector<parameter_types>::type parameter_vector; parameter_vector params; // error if FPTR contains a parameter_type that is not default-constructible // // ... do something to populate params from data source // bf::invoke(f, params); } int main() { my_invoker(my_func); } Any idea how I might initialize the fusion vector as it is being created? I feel like there might be a way to transform parameter_types into a version in which each type is wrapped in a default-constructible wrapper, then transform that list into the final boost fusion list while at the same time populating it with data, but I can't seem to get the functors to work. E.g.: template <typename T> struct type_wrapper { type_wrapper() {} }; template <typename T> struct wrap { typedef type_wrapper<T> type; }; // Metafunction to unwrap types, and function to populate data // (data should never need to be default-constructible) struct fill { template <typename SIG> struct result; template <typename T> struct result<fill(const type_wrapper<T>&)> { typedef T type; }; // Reference type needed for bf::transform_view template <typename T> struct result<fill(type_wrapper<T>&)> { typedef T type; }; // Non-reference type needed for bf::vector template <typename T> struct result<fill(type_wrapper<T>)> { typedef T type; }; template <typename T> T operator()(const type_wrapper<T>&) const {return data_source<T>().pop();} }; template <typename FPTR> void my_invoker(FPTR f) { typedef typename ft::parameter_types<FPTR>::type parameter_types; // Conversion 1: create a fusion vector with types wrapped in a // default-constructible wrapper typedef mpl::transform<parameter_types, wrap<mpl::_1>, mpl::back_inserter<mpl::vector<> > >::type wrapped_parameter_types; typedef typename bf::result_of::as_vector<wrapped_parameter_types>::type wrapped_parameter_vector; // Conversion 2: create a fusion vector with the unwrapped types // that is also populated with the data from the data_source // (without having to ever default_construct any of the parameter_types) typedef typename bf::result_of::transform<const wrapped_params, fill>::type params_view; typedef typename bf::result_of::as_vector<const params_view>::type params_t; // Finally: invoke the function with arguments bf::invoke(f, bf::as_vector(bf::transform(params_view(), fill()))); } I can't seem to get the meta-function calls or the 'fill' metafunction itself quite right, instead getting vast reams of compiler complaints. Am I missing something? Or alternatively, is there a direct way to initialize a fusion vector? Many thanks, Vivek

3 2

[boost.thread] function call and functor in thread creation: performance
by Boost lzw 22 Jan '11

22 Jan '11

Hi, everyone, A new thread can be created using boost thread either from a function or a functor as the entry point of the new thread, as: void thread_function(); boost::thread thrd(&function); class functor { public: inline void operator()(); }; functor f; boost::thread thrd(f); Is there a performance difference between these two? In an ordinary C++ program, can I claim that calling f() 1000 times gives better performance than calling thread_function() 1000 times, because the functor is hinted "inline" even the hint is igored by my compiler? Is f() the same as a function call in term of performance? Thanks in advance. Robert

3 3

boost.iterators - iterator_facade issue with aligned types.
by Christoph Heindl 21 Jan '11

21 Jan '11

Hi, It seems to me that boost::iterator_facade cannot cope with aligned types when the 'Reference = use_default' template argument is not a reference, which can happen if transform_iterator is used to return the result of a temporay calculation (by value of course). Inside iterator_facade.hpp struct operator_arrow_result { //... static type make(Reference x) { return implicit_cast<type>(&x); } }; Reference here is passed by value. Since Reference has alignment the compiler reports an error. The issue was resolved once i changed that code to struct operator_arrow_result { //... typedef typename mpl::if_< is_reference<Reference> , Reference , typename add_reference<Reference>::type >::type input_type; static type make(input_type x) { return implicit_cast<type>(&x); } }; I wonder about any side effects this would cause? My lousy research is based boost 1.43. That part of the code seems to be unchanged for the current trunk. Best regards, Christoph

2 4

Re: [Boost-users] Assertion `__null != bpos' failed in /inclu de/boost/archive/detail/oserializer.hpp:436
by ktomaszewski＠zunit.com 21 Jan '11

21 Jan '11

2 1

Re: [Boost-users] Assertion `__null != bpos' failed in /inclu de/boost/archive/detail/oserializer.hpp:436
by ktomaszewski＠zunit.com 21 Jan '11

21 Jan '11

1 0

Re: [Boost-users] Assertion `__null != bpos' failed in /inclu de/boost/archive/detail/oserializer.hpp:436
by ktomaszewski＠zunit.com 21 Jan '11

21 Jan '11

1 0

Assertion `__null != bpos' failed in /inclu de/boost/archive/detail/oserializer.hpp:436
by ktomaszewski＠zunit.com 20 Jan '11

20 Jan '11

2 1

Thread-specific pointers versus MFC (Microsoft)
by Stephen Nuchia 20 Jan '11

20 Jan '11

I see a thread about this issue from 2009, with no resolution. A possible patch was mentioned but there was never a followup. We picked up the thread-specific pointer goodness with 1.35, under Visual Studio 2008. We stayed with that combination ever since, for stability. Now I'm looking at VS2010 and 1.44. To support Microsoft's thread model in DLL (dynamically linked libraries) in 1.35 required the user to intercept library unload events. Shortly after 1.35, the boost thread library was enhanced to take care of this for you. The hook it uses, however, conflicts with the use of that same hook by Microsoft's MFC library, when you are building an "MFC Extension DLL" specifically. We have a bunch of that going on. The conflict ends up being detected at link time, like this: 1>libboost_thread-vc100-mt-gd-1_44.lib(tss_pe.obj) : error LNK2005: _pRawDllMain already defined in Table.obj The archive discussion http://thread.gmane.org/gmane.comp.lib.boost.user/46509/focus=46706 What is the current thinking on this issue? I don't see any #ifdef logic in the boost headers that looks like it might be intended to address this, do I need to hack it myself or is there an established work-around? And don't dog me about MFC. Some of the code I'm dealing with is still in FORTRAN, and some is 25-year-old C. Thanks! -swn

1 0

[BGL] Threshold for betweenness_centrality_clustering()
by Cedric Laczny 20 Jan '11

20 Jan '11

Hi, I would like to use boost::betweenness_centrality_clustering() to search a graph for specific clusters. The documentation talks about a "Done" object, which I assume is a functor, similar to the predicates used in filtered_graph(). So in order to decide whether the algorithm should stop the clustering, it probably needs a threshold to decide if it should further iterate and remove edges to decompose the graph. My questions now are: - Does someone perhaps have an example for the usage of this algorithm? I only found documentation on "betweenness.centrality.clustering {RBGL}" for Gnu R, which doesn't bring me very far. - Is there some sort of rule-of-thumb to start with for finding this termination threshold or if there is some more-or-less methodical way of finding out a reasonable threshold? Best, Cedric

4 4

regex __sync_fetch_and_add_4 issue when compiling to 32 bit Linux
by Ákos Maróy 20 Jan '11

20 Jan '11

Hi, I seem to have a problem when trying to link C++ code that refers to the boost regex library, when this is done so that it is compiled on a 64 bit Linux system, but for a 32 bit target. I get the following error: libboost_regex.so: undefined reference to `__sync_fetch_and_add_4' collect2: ld returned 1 exit status I wonder what needs to be done to fix this. steps to reproduce: - compile boost for 32 bit, by: ./bjam architecture=x86 address-model=32 --prefix=/path/to/boost install - try to compile & link a very simple sample code (see the end of the mail) g++ -m32 -L//path/to/boost/lib -I/path/to/boost/include -lboost_regex -o hello hello.cxx /path/to/boost/lib/libboost_regex.so: undefined reference to `__sync_fetch_and_add_4' collect2: ld returned 1 exit status when compiling the same code for 64 bit, it compiles fine. seeing this thread: http://lists.boost.org/Archives/boost/2008/04/135586.php I also tried the following: g++ -m32 -DBOOST_SP_USE_PTHREADS -L//path/to/boost/lib -I/path/to/boost/include -lboost_regex -o hello hello.cxx g++ -m32 -DBOOST_SP_DISABLE_THREADS -L//path/to/boost/lib -I/path/to/boost/include -lboost_regex -o hello hello.cxx but I got the same results :( any help would be appreciated. Akos details: platfrom: Ubuntu 10.10 64 bit compiler: g++ 4.4.4 boost: 1.45.0 the sample code I used is very minimalistic: #include <boost/regex.hpp> int main(void) { boost::regex LF("\\\\n"), CR("\\\\r"), TAB("\\\\t"); return 0; }

4 8

[polygon] Quadratic performance when handling any angle polygons
by Josh Pieper 19 Jan '11

19 Jan '11

Hello, First: we are using boost 1.45.0 with gcc -O3 on Ubuntu 10.04. (Although similar problems appear with VS2008 on Windows 7). We have been observing performance with boost::polygon that is significantly worse than we were expecting when working with any angle polygons. Namely quadratic instead of the expected O(n log n). While profiling, I noticed that most of the time is spent in the overload of line_intersection::validate_scan at detail/scan_arbitrary.hpp:154 which is commented as: "//quadratic algorithm to do same work as optimal scan for cross checking". I have inlined our test program below, and some performance results measured by instruction count under "valgrind --tool=callgrind". Is this poor performance because our data is degenerate, or because a vestigal quadratic double check is still being applied? Regards, Josh Pieper Performance results for n=10..110 measured in instructions to complete the following test program: 10 2363923 20 4427849 30 8695564 40 15642559 50 25530188 60 39081335 70 57151093 80 79278939 90 107261217 100 140674559 110 164340087 -------------------------- #include <boost/lexical_cast.hpp> #include <boost/type.hpp> #include <boost/polygon/polygon.hpp> #include <boost/polygon/gmp_override.hpp> int main(int argc, char** argv) { typedef boost::polygon::point_data<int32_t> point_type; typedef boost::polygon::polygon_set_data<int32_t> polygon_set; typedef polygon_set::value_type value_type; int32_t sample_data[] = { -15417, -53418, 0, 0, -1, -15417, -53418, 37998, -68834, 1, 37998, -68834, 53415, -15416, 1, 0, 0, 53415, -15416, -1, -20188, -37532, 15869, 4788, -1, -20188, -37532, 22129, -73587, 1, 22129, -73587, 58187, -31268, 1, 15869, 4788, 58187, -31268, -1, -12388, -58060, -4666, -3001, -1, -12388, -58060, 42669, -65781, 1, 42669, -65781, 50390, -10722, 1, -4666, -3001, 50390, -10722, -1, -16452, -51370, 2015, 1078, -1, -16452, -51370, 35988, -69834, 1, 35988, -69834, 54455, -17386, 1, 2015, 1078, 54455, -17386, -1, -9812, -61108, -7737, -5548, -1, -9812, -61108, 45744, -63182, 1, 45744, -63182, 47819, -7623, 1, -7737, -5548, 47819, -7623, -1, -19695, -27418, 25940, 4341, -1, -19695, -27418, 12063, -73050, 1, 12063, -73050, 57697, -41291, 1, 25940, 4341, 57697, -41291, -1, -11871, -58680, -5330, -3460, -1, -11871, -58680, 43338, -65220, 1, 43338, -65220, 49879, -10000, 1, -5330, -3460, 49879, -10000, -1, -12303, -10547, -4768, -65638, 1, -4768, -65638, 50314, -58104, 1, 42779, -3013, 50314, -58104, -1, -12303, -10547, 42779, -3013, -1, -10105, -60739, -7415, -5202, -1, -10105, -60739, 45425, -63428, 1, 45425, -63428, 48115, -7891, 1, -7415, -5202, 48115, -7891, -1, -9937, -60912, -7600, -5360, -1, -9937, -60912, 45609, -63249, 1, 45609, -63249, 47946, -7697, 1, -7600, -5360, 47946, -7697, -1, -20348, -32184, 16794, -73555, 1, 16794, -73555, 58164, -36414, 1, 21022, 4957, 58164, -36414, -1, -20348, -32184, 21022, 4957, -1, -10796, -8606, -6653, -64049, 1, -6653, -64049, 48788, -59906, 1, 44644, -4463, 48788, -59906, -1, -10796, -8606, 44644, -4463, -1, -16263, -16858, 1613, -69511, 1, 1613, -69511, 54257, -51638, 1, 36381, 1014, 54257, -51638, -1, -16263, -16858, 36381, 1014, -1, -20298, -33057, 17817, -73534, 1, 17817, -73534, 58292, -35421, 1, 20177, 5056, 58292, -35421, -1, -20298, -33057, 20177, 5056, -1, -11941, -9961, -5271, -65159, 1, -5271, -65159, 49923, -58490, 1, 43253, -3292, 49923, -58490, -1, -11941, -9961, 43253, -3292, -1, -19046, -44168, 28939, -72250, 1, 28939, -72250, 57020, -24267, 1, 9035, 3815, 57020, -24267, -1, -19046, -44168, 9035, 3815, -1, -10926, -8703, -6528, -64127, 1, -6528, -64127, 48893, -59729, 1, 44495, -4305, 48893, -59729, -1, -10926, -8703, 44495, -4305, -1, -19113, -43924, 28699, -72304, 1, 28699, -72304, 57076, -24496, 1, 9263, 3883, 57076, -24496, -1, -19113, -43924, 9263, 3883, -1, -18256, -21581, 6351, -71437, 1, 6351, -71437, 56204, -46832, 1, 31598, 3024, 56204, -46832, -1, -18256, -21581, 31598, 3024, -1, -20282, -31991, 16756, -73456, 1, 16756, -73456, 58219, -36421, 1, 21181, 5045, 58219, -36421, -1, -20282, -31991, 21181, 5045, -1, -19379, -25528, 10293, -72546, 1, 10293, -72546, 57309, -42875, 1, 27637, 4143, 57309, -42875, -1, -19379, -25528, 27637, 4143, -1, -16209, -16633, 1396, -69371, 1, 1396, -69371, 54130, -51767, 1, 36526, 970, 54130, -51767, -1, -16209, -16633, 36526, 970, -1, -18570, -22483, 7245, -71726, 1, 7245, -71726, 56484, -45912, 1, 30669, 3330, 56484, -45912, -1, -18570, -22483, 30669, 3330, -1, -19900, -40189, 24948, -73049, 1, 24948, -73049, 57806, -28203, 1, 12958, 4657, 57806, -28203, -1, -19900, -40189, 12958, 4657, -1, -20322, -36011, 20774, -73460, 1, 20774, -73460, 58220, -32367, 1, 17124, 5082, 58220, -32367, -1, -20322, -36011, 17124, 5082, -1, -555, -68328, 53079, -53671, 1, 38424, -43, 53079, -53671, -1, -15210, -14699, 38424, -43, -1, -15210, -14699, -555, -68328, 1, 21671, -61840, 21718, -61835, 1, 14689, -61655, 21718, -61835, -1, 14689, -61655, 42185, -65881, 1, 42185, -65881, 50629, -10931, 1, 23134, -6705, 50629, -10931, -1, 16104, -6524, 23134, -6705, -1, 16057, -6529, 16104, -6524, -1, 16057, -6529, 21671, -61840, 1, -7903, -63005, 47680, -60927, 1, 45602, -5370, 47680, -60927, -1, -9981, -7449, 45602, -5370, -1, -9981, -7449, -7903, -63005, 1, }; value_type edge_list; size_t num_elements = sizeof(sample_data) / (sizeof(*sample_data) * 5); if (argc > 1) { num_elements = std::min(num_elements, boost::lexical_cast<size_t>(argv[1])); } for (size_t i = 0; i < num_elements; i++) { value_type::value_type edge_plus; int32_t* record = &sample_data[i * 5]; edge_plus.first.first = point_type(record[0], record[1]); edge_plus.first.second = point_type(record[2], record[3]); edge_plus.second = record[4]; edge_list.push_back(edge_plus); } polygon_set pset; pset.set(edge_list); pset.clean(); }

2 2

Re: [Boost-users] [boost] Distributed Development Process (was Re: Development Practices (Proposal Progress))
by Dean Michael Berris 19 Jan '11

19 Jan '11

Update: There is more information on the Wiki page now, pertaining to a few more definitions and the beginnings of the process discussion. Please see: https://svn.boost.org/trac/boost/wiki/DistributedDevelopmentProcess You may have to refresh the page to get the latest version. Basically, the changes there now include: - Definition for the role of a Review Manager - Definition for the role of a Review Manager Assistant (lifted from Joachim's suggestion) - Definition for the "Boost Community" - The definition of a lower barrier to entry style Acceptance Review process - The hint of a Maintenance Review process Feedback on the contents -- both old and new -- would be most appreciated. Thanks in advance and I hope to hear from the community soon! -- Dean Michael Berris about.me/deanberris

1 0

Boost.Pool - Are you using this library, please can we have your input?
by Paul A. Bristow 19 Jan '11

19 Jan '11

Boost.Pool is the subject of a 'make-over' by Boost.Guild. (This is some of a test-bed for a process of revision of older, perhaps orphaned, libraries using the relative safety of the sandbox). In order to permit any modification, the original (hand-written?) html documentation has been converted to Quickbook (and somewhat revised) at http://svn.boost.org/svn/boost/sandbox/guild/pool/libs/pool/doc/ You can build the html docs using the jamfile.v2 in the normal way, but you will probably find it more convenient to go direct to the pdf version http://svn.boost.org/svn/boost/sandbox/guild/pool/libs/pool/doc/pool.pdf This is fairly fully hyperlinked, and includes a reference section using Doxygen. Doxygen comments have been added to the header files (from the original html docs). (If you are a Doxygen fan, there is also a Doxyfile for generating Doxygen-style docs in the /doc/Doxygen/ folder). We are now considering some better tests, and perhaps some enhancements to the code. We'd like input from users about: 1 Things missing or wrong from the docs. More up to date references? 2 Things missing (or don't work well) from Pool. 3 New things that you would like (this is not a promise!). 4 Examples of your use. Perhaps you built some during your development that could be used? 5 Better tests. Thanks. Paul PS Don't panic - the release version will not be changed without a mini-review. --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

7 8

Time Series lib
by Peter Godino 19 Jan '11

19 Jan '11

I've found there is a boost lib called Time Series. It is not yet in SVN. Is it possible access this library? Thanks, Peter

2 2

Having program_options generate a round-trippable config file?
by Rhys Ulerich 19 Jan '11

19 Jan '11

Hi all, I'm using program_options to combine arguments from the command line, the environment, and one or more input files. As you'd expect, it works very well. However, I have an additional requirement that I'm unsure how to implement cleanly atop the library: Given instances of program_options::options_description and program_options::variables_map, I'd like to save a program_options::parse_config_file-friendly file containing the final values obtained. Such a config file could be given back to the program and would identically reproduce the options used. The need is for some scientific software where I want a precise record of what a user has chosen for reasons of scientific repeatability. I see several ways to go about achieving this need, but all of them are ugly, brittle hacks: 1) Accessing the information directly from variables_map seems difficult due to variables_map's use of type erasure and the fact that it does not save the tokens from which values are derived. 2) Obtaining the tokens from the intermediate program_options::parsed_options instances is a possibility but requires me to effectively reimplement the logic contained within program_options::store. It also fails to account for defaulted values. 3) Looping over each program_options::value_semantic found in the options_description instance and adding a notify() callback again runs into type erasure troubles. 4) Adding a notify() to each option_description at its point of declaration avoids type erasure but makes the code impact O(n) where n is the number of options. Has anyone built such a feature atop program_options? Can anyone lend some wisdom? Thanks, Rhys

2 1