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

[boost.typeof] Using boost::bind with BOOST_AUTO
by Roberto Gim�nez 06 Jun '09

06 Jun '09

I have the following code: #include <boost/typeof/typeof.hpp> #include <boost/bind.hpp> void test() { } int main(int argc, char** argv) { BOOST_AUTO(a, boost::bind(&test)); } But when I try to compile, I get errors: CC -m64 -erroff=wvarhidemem,hidevf,hidevfinvb -errtags=yes -library=stlport4 -mt -c -g -I/home/gimenero/include -o build/Debug/Sun12-Solaris-Sparc/main.o main.cc CC -m64 -erroff=wvarhidemem,hidevf,hidevfinvb -errtags=yes -library=stlport4 -mt -c -g -I/home/gimenero/include -o build/Debug/Sun12-Solaris-Sparc/main.o main.cc "main.cc", line 11: Error, nomatchoverin: Could not find a match for boost::type_of::encode<boost::type_of::V, boost::type_of::T> (boost::_bi::bind_t<void, void(*)(), boost::_bi::list0>) needed in main(int, char**). "main.cc", line 11: Error, nomatchoverin: Could not find a match for boost::type_of::encode<boost::type_of::V, boost::type_of::T> (boost::_bi::bind_t<void, void(*)(), boost::_bi::list0>) needed in main(int, char**). "main.cc", line 11: Error, nomatchoverin: Could not find a match for boost::type_of::encode<boost::type_of::V, boost::type_of::T> (boost::_bi::bind_t<void, void(*)(), boost::_bi::list0>) needed in main(int, char**). ... many times. Does BOOST_AUTO supports boost::bind?

3 7

Does Boost.Test support std::wstring log messages?
by Tan, Tom (Shanghai) 06 Jun '09

06 Jun '09

Is it possible to use Boost.Test macros with std::wstring directly like this: BOOST_TEST_MESSAGE(L"test log"); ? I tried but it does not work. I find that \test\utils\basic_cstring\basic_cstring.hpp has a templated string implementation. It seems to imply that wide char are supported by Boost.Test. Can anyone please let me know how? Thanks. tom

2 1

[Boost] [Test] [1.38] "can't use testing tools before framework is initialized"
by Greg Christopher 06 Jun '09

06 Jun '09

Hi, I am trying to integrate boost.test into an existing test program with its own framework. Therefore I'd like to use that program's main. I am currently running into this runtime error when calling BOOST_WARN_MESSAGE(1, "string"). I have tried three different things to avoid this condition: 1) I declared a TEST_SUITE using the BOOST_AUTO_TEST_SUITE() and END() macros. Probably not what I want because I want my own main to keep control, but figured it would generate a main that would allow the initialization to happen. 2) I called init_unit_test_suite( argc, argv ). Even though it was called, I am still getting this. 3) I defined a cpp_main(). This never got called. I was hoping that the existence of this symbol would cause initialization to happen elsewhere. My desired control flow is to have this test program in control and to use the BOOST logging tools. I am trying to slip in boost.test with a minimum of changes to this program. I have hooked its logging function to call boost logging facilities instead; just can't get past this problem. Thanks for any help! Greg

3 9

[mpi] could all_reduce handle MPI_IN_PLACE ?
by Alain Miniussi 05 Jun '09

05 Jun '09

Hi, There doesn't seems to be an elgant way to do an in place all_reduce on array right now (Although I only stumbled on the issue after I moved to openmpi 1.3.2). That is, if all_reduce_impl is called with (in_values == out_values) MPI is allowed to compain with a MPI_ERR_BUF. Of course, one can call all_reduce with static_cast<T*>(MPI_IN_PLACE) but I do not find that solution very elegant. Would it be a problem to modify all_reduce_impl into: template<typename T, typename Op> void all_reduce_impl(const communicator& comm, const T* in_values, int n, T* out_values, Op /*op*/, mpl::true_ /*is_mpi_op*/, mpl::true_ /*is_mpi_datatype*/) { if (in_values == out_values) { in_values = static_cast<T*>(MPI_IN_PLACE); } BOOST_MPI_CHECK_RESULT(MPI_Allreduce, (const_cast<T*>(in_values), out_values, n, boost::mpi::get_mpi_datatype<T>(*in_values), (is_mpi_op<Op, T>::op()), comm)); } It worked for me, and if there is an agreement I can propose a patch. Regards, -- Alain Miniussi http://www.oca.eu/alainm Equipe CRIMSON https://crimson.oca.eu +33 492 00 30 09

1 0

[proto] declaring result type for callable contexts
by Maurizio Vitale 05 Jun '09

05 Jun '09

Eric, It seems like result types must be defined inside a struct eval, but examples in the documentation show the form commented out below. Is this a recent change? Also, in absence of a result_type declaration inside struct eval {...} the type defaults to int. Would it be possible to make it void or some_ugly_looking_type_that_tell_me_i_is_all_wrong? int might happen to be what the user wants, until he decide to change it and hides the problem. template<typename Expr> struct my_context : proto::callable_context<const my_context<Expr> > { struct eval {typedef double result_type;}; // doesn't work (anymore?) //typedef double result_type; };

3 5

Bug Sprint Report for Thursday, June 4th
by Marshall Clow 05 Jun '09

05 Jun '09

The boost bug sprint started Friday, May 29th, and runs through Sunday June 7th. Thursday was a very good day - let's keep it up! The bug sprint will be over Sunday night. Status <https://svn.boost.org/trac/boost/report/1> 7:00 AM PDT 5/29: 797 open tickets. 7:45 AM PDT 5/30: 772 open tickets. 6:00 AM PDT 5/31: 761 open tickets. 6:00 AM PDT 6/2: 747 open tickets. 6:00 AM PDT 6/3: 748 open tickets. 6:00 AM PDT 6/4: 739 open tickets. 8:00 AM PDT 6/5: 730 open tickets. Activity: 5/29: 6 new tickets, 77 modifications, 25 tickets closed 5/30: 2 new tickets, 42 modifications, 17 tickets closed 5/31: 2 new tickets, 27 modifications, 8 tickets closed 6/1: 2 new tickets, 42 modifications, 17 tickets closed 6/2: 5 new tickets, 18 modifications, 5 tickets closed. 6/3: 4 new tickets, 19 modifications, 2 tickets closed. 6/4: 3 new tickets, 42 modifications, 24 tickets closed. [ Numbers may not add up because I am counting via two different methods, using data that is time-stamped in two different time zones. Also, tickets can be closed and reopened. ] What can you do? See <https://svn.boost.org/trac/boost/wiki/BugSprintJune2009> for details. I've added four new reports to the trac: Open ticket count by owner: <https://svn.boost.org/trac/boost/report/18> Open ticket count by component: <https://svn.boost.org/trac/boost/report/19> Open ticket count by ticket type: <https://svn.boost.org/trac/boost/report/20> Open ticket count by milestone: <https://svn.boost.org/trac/boost/report/21> There's been a lot of discussion on the list about tickets; and there are about a dozen patches that have been tested and are ready to be applied. If you're looking to help, you can look at some of the older bugs, say, the ones for Boost 1.36, and determine if they still apply. If they do, note that in the ticket. There are 35 tickets that are still open that are marked as "to be fixed in Boost 1.36" See <https://svn.boost.org/trac/boost/report/3> for a list of open tickets by milestone. --------- Sign-up sheet -------- The following people have committed to participate in the bug sprint. Please add you name here, along with what you can do. 1) Marshall Clow (coordination, Mac OS X characterization) 2) Beman Dawes (filesystem, system, timer) 3) Doug Gregor (function, graph, logic, mpi, numeric, property_map, signals) 4) "joel falcou" <joel.falcou(a)u-psud.fr> ( linux gcc testing/VC 2008 testing, patching) 5) Michael Caisse <boost(a)objectmodelingdesigns.com> (bug fixing) 6) Jeremiah Willcock <jewillco(a)osl.iu.edu> (will test and commit graph patches) 7) David Abrahams (iterator, python) 8) Sohail Somani (patches for g++ 4.2.4) 9) Steven Watanabe <watanabesj(a)gmail.com> (bug fixes, como) 10) vicente.botet" <vicente.botet(a)wanadoo.fr> 11) Stjepan Rajko <stjepan.rajko(a)gmail.com> (fusion) 12) Daniel Wallin (parameter, ...) -- -- Marshall Marshall Clow Idio Software <mailto:marshall@idio.com> It is by caffeine alone I set my mind in motion. It is by the beans of Java that thoughts acquire speed, the hands acquire shaking, the shaking becomes a warning. It is by caffeine alone I set my mind in motion.

1 0

BGL: how to count and get the connected components in the spanning_tree
by arm2arm 05 Jun '09

05 Jun '09

Hello, I am trying to get connected components in the MST. I have some undirected graph: ----------- BEGIN SNIP ------------------------ typedef adjacency_list < vecS, vecS, undirectedS, no_property, property < edge_weight_t, MyFloat > > Graph; typedef property_map<Graph, edge_weight_t>::type EdgeWeightMap; Graph graphFOF; ... Fill the graph.. //Get the MST property_map < Graph, edge_weight_t >::type weight = get(edge_weight, graphFOF); std::vector < Edge > spanning_tree; std::cout << "Building MST:." ; kruskal_minimum_spanning_tree(graphFOF, std::back_inserter(spanning_tree)); std::cout << " .. done " << std::endl; // // Here is problem: How to use MST edges for filtering the graphFOF?? positive_edge_weight<EdgeWeightMap> filter(meanW, get(edge_weight, graphFOF)); filtered_graph<Graph, positive_edge_weight<EdgeWeightMap> > fg(graphFOF, filter); std::vector<int> component(num_vertices(fg)); int num = connected_components(fg, &component[0]); ------------END SNIP--------------------------- How to count and get the connected components in the spanning_tree? Thank you beforehand. Arman. -- View this message in context: http://www.nabble.com/BGL%3A-how-to-count-and-get-the-connected-components-… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

Re: [Boost-users] About "transitive_closure" method of Boost graph.
by Amanullah Yasin 05 Jun '09

05 Jun '09

sorry for disturbing, i think you mean test example given on http://www.boost.org/doc/libs/1_39_0/libs/graph/example/transitive_closure.… Yes i tried this example but it is not using this method. void transitive_closure(const Graph& g, GraphTC& tc, G_to_TC_VertexMap g_to_tc_map, VertexIndexMap index_map) Thanks again Amanullah YASIN Master2 (ECD) Ecole Polytechnique Université de Nantes, France. Mob# 06 47 62 89 96 Fix # 02 72 00 26 45 amanyasin(a)gmail.com On Fri, Jun 5, 2009 at 10:57 AM, Vladimir Prus <vladimir(a)codesourcery.com>wrote: > On Friday 05 June 2009 12:52:37 you wrote: > > Thanks Vladimir Prus, for your reply. Please guide me how i can use this > > method > > Please reply to the list, not personally. > > > > > > > void transitive_closure(const Graph& g, GraphTC& tc, > > G_to_TC_VertexMap g_to_tc_map, VertexIndexMap > index_map) > > > > > > *specially how i can declare and use * > > > > * "G_to_TC_VertexMap" & "* > > > > *VertexIndexMap"* > > I have suggested you look at the testcase -- did you do that? > > - Volodya >

1 0

[multi-index] Container not safe against reentrant clear() / erase() ?
by Sebastian Theophil 05 Jun '09

05 Jun '09

Hi, I have encounted a scenario that triggers an access violation when removing reference counted objects from a container. Assume I have a (for simplicity's sake, global) multi_index_container g_multiindex containing reference counted objects of type CObject: boost::multi_index_container< ordered_unique< shared_ptr<CObject> > > g_multiindex; In general, an object of type CObject may be destroyed at any time and the destructor makes sure to remove any reference held in g_multiindex: class CObject { ~CObject() { // if object is explicitly destroyed, remove from container g_multiindex.erase( this ); } }; Since ownership of CObject is shared, g_multiindex may hold the last reference to a CObject instance. g_multiindex.clear then calls - delete_all_nodes() - delete_all_nodes(root()) - this->final_delete_node_(static_cast<final_node_type*>(x)); - which first calls the destructor on x (i.e. it calls ~CObject() on the root() node) At this point, the multi_index_container is not in a valid state. The root() node is being deleted but the container still contains the root() node and points to it, empty() would certainly still return false. Calling g_multiindex.erase with a compatible key crashes in my case. In general, it seems to me that it would be safer to implement clear() by doing something like: void clear() { multi_index_container cpy; swap(cpy, *this); cpy.clear(); } This would remove all elements from the container before actually deleting them. I'm unsure though how the same behavior could be achieved when erasing a single element. The C++ standard does not seem to define how clear() and erase() should behave in this regard, but I cannot image that my application scenario is so unusual that this problem has not been solved a million times. So I'm curious if the behavior of multi_index_containers is by design and maybe someone could be so kind to enlighten me why this is so. Is there any better way to achieve what I'm trying to do? Thank you very much, Sebastian -- Sebastian Theophil . stheophil(a)think-cell.com Software Engineer think-cell Software GmbH . Invalidenstr. 34 . 10115 Berlin, Germany http://www.think-cell.com . phone +49-30-666473-10 . toll-free (US) +1-800-891-8091 Directors: Dr. Markus Hannebauer, Dr. Arno Schoedl . Amtsgericht Berlin-Charlottenburg, HRB 85229

4 8

About "transitive_closure" method of Boost graph.
by Amanullah Yasin 05 Jun '09

05 Jun '09

Bonjour Dear I want to check whether there is a directed path between two given nodes (A and C) using Boost graph. I also want to access intermediate edges to examine PDAG properties. I test void transitive_closure(const Graph& g, GraphTC& tc) method. But i want to check between two given nodes. Now i want to ask you - void transitive_closure(const Graph& g, GraphTC& tc, G_to_TC_VertexMap g_to_tc_map, VertexIndexMap index_map) In the above method, how i can declare G_to_TC_VertexMap g_to_tc_map, VertexIndexMap index_map? http://www.boost.org/doc/libs/1_39_0/libs/graph/doc/transitive_closure.html - How i can examine the intermediate edges? or is there any other easy way? I will be thankful to you Best Regards Amanullah YASIN Master2 (ECD) Ecole Polytechnique Université de Nantes, France. Mob# 06 47 62 89 96 Fix # 02 72 00 26 45 amanyasin(a)gmail.com

2 2

Refactoring template functions. Needing help with compile time if statements.
by Ryan McConnehey 05 Jun '09

05 Jun '09

I'm trying to refactor my code to remove some code duplication. Currently I have a template that takes a pointer to store information, a map with the information and a text string. I've specialized the function to account for some fundamental types. As these cases have increased I notice the only difference between the function is how I'm accessing the iterator for the map. template<> void Customize::addVariableType(TiXmlElement *const xml, std::map<string, bool> const& map, string const& mapType) const { std::map<string, bool>::const_iterator itor; for (itor = map.begin(); itor != map.end(); ++itor) { itor->second; } } template<typename T> void Customize::addVariableType(TiXmlElement *const xml, std::map<string, T> const& map, string const& mapType) const { std::map<string, T>::const_iterator itor; for (itor = map.begin(); itor != map.end(); ++itor) { itor->second.base_type_value(); } } I'm using stlSoft's true_typedef for some custom types. STLSOFT_GEN_OPAQUE(fundamental_type); typedef stlsoft::true_typedef<unsigned short, fundamental_type> uint16_type; Most of the maps are comprised of these custom types. That's why the generic template accesses the underlying value of the iterator's second value. Also this accounts for the specialization for fundamental types. Since both the template and the specialization template have the same functionality but access the second map value differently I'm trying to refactor to have another function retrieve iterator value. Below is what I've tried so far. template<> bool accessValue(bool const& value) const { return value; } //V is the underlining type of W. If W was uint16_type then V should be unsigned short. template<typename V, typename W> typename V accessValue(typename W const& value) const { return value.base_type_value(); } I understand that I've moved the difficulty out of addVariableType into accessValue. Unfortunately, accessValue gives an error that typename V cannot be deduced. Also for each fundamental type I have to add an overload to accessValue. This turns into the same problem I'm facing with addVariableType but with less code to copy. Is there a way to have a template function that has an if statement to choice how to access the value? I've tried to use BOOST_TYPEOF_TPL and boost::is_class but was unsuccessful in making it work. Any help would be really helpful. Ryan

1 0

Box-Muller transform Gaussian Random Number Generator
by Enrique Fernández 05 Jun '09

05 Jun '09

Hello, Boost random library implements GRNG (Gaussian Random Number Generator) with Box-Muller transform (code here<http://www.boost.org/doc/libs/1_39_0/boost/random/normal_distribution.hpp>). I want to discuss about this line of code: _cached_rho = sqrt(-result_type(2) * log(result_type(1)-_r2)); I don't know why log is applied to 1-r2, instead of r2 directly, yielding _cached_rho = sqrt(-result_type(2) * log(_r2)); According with [1<http://www.cse.cuhk.edu.hk/%7Ephwl/mt/public/archives/papers/grng_acmcs07.p…>, 2 <http://mathworld.wolfram.com/Box-MullerTransformation.html>, 3<http://en.wikipedia.org/wiki/Box-Muller_transformation>] the uniform random variable r2 is always used directly (never 1-r2). I'd like to know why 1-r2 is used. I've tried to compare with other scientific libraries like GSL<http://www.gnu.org/software/gsl/manual/html_node/The-Gaussian-Distribution.…>, Scythestat <http://scythe.wustl.edu/api/rng_8h-source.html> and LTILib<http://ltilib.sourceforge.net/doc/html/index.shtml>, but they use the Box-Muller polar form (or Marsaglia polar method) or even Ziggurat algorithm, which are supposed to be more efficient. Why isn't polar form implemented? I'd like to know why 1-r2 is used anyway. Regards, Enrique

2 1

What will be in v1.40?
by Robert Dailey 05 Jun '09

05 Jun '09

Is there a document online that covers new features that will be introduced in Boost v1.40? If not, can someone provide a brief overview? Thanks.

2 1

Re: [Boost-users] Boost-users Digest, Vol 2016, Issue 2
by Tron Thomas 04 Jun '09

04 Jun '09

> Date: Thu, 4 Jun 2009 09:44:34 +0100 > From: "John Maddock" <john(a)johnmaddock.co.uk> > Subject: Re: [Boost-users] Compile error using boost's tr1::bind > To: <boost-users(a)lists.boost.org> > Message-ID: <059F08EC9A4049B194EBF6D5CA604C4C@acerlaptop> > Content-Type: text/plain; format=flowed; charset="Windows-1252"; > reply-type=original > > >> What is needed for the code to compile and run properly? >> > > Which Boost version and is Boost installed in /usr/include or somewhere > similar? > > Basically this is a known problem for some Boost versions when Boost is > installed in your *system search path* - the issue is that the Boost headers > are in a location that is searched *after* the libstdc++ headers and that > breaks the header-forwarding mechanism used by Boost.TR1. > > The solution is probably to upgrade to the latest Boost release, or if all > else fails, the SVN Trunk. > > HTH, John. > I'm not sure which version of boost this is. It would be whatever the most current version of boost is for Fedora 10, as I update my system on a regular basis. There is a /usr/include/boost directory on my system. I would assume that is the version of boost being used by the compiler.

2 1

unit tests: auto tests, missing main, redef'ed init_unit_test_suite
by Hicham Mouline 04 Jun '09

04 Jun '09

g++3.4 - boost1.37 Hello, I have n translation units .cpp and m auto test suites spread over the n files. For e.g. file ni.cpp-------------------- #include <boost/test/unit_test.hpp> BOOST_AUTO_TEST_SUITE(suite1) BOOST_AUTO_TEST_CASE(case1) BOOST_AUTO_TEST_SUITE_END() file nj.cpp-------------------- #include <boost/test/unit_test.hpp> BOOST_AUTO_TEST_SUITE(suite1) BOOST_AUTO_TEST_CASE(case2) BOOST_AUTO_TEST_CASE(case3) BOOST_AUTO_TEST_SUITE_END() file nk.cpp-------------------- #include <boost/test/unit_test.hpp> BOOST_AUTO_TEST_SUITE(suite2) BOOST_AUTO_TEST_CASE(case1) BOOST_AUTO_TEST_CASE(case2) BOOST_AUTO_TEST_SUITE_END() The .cpp files are compiled with -DBOOST_TEST_MAIN= AFAIU, I am then not required to provide the "init_unit_test" function nor the "main" function. I then try to link an executable: g++ -m64 -Wall -Wextra -Wsign-compare -Werror -Wno-unused -std=c++98 -pedantic -Wno-long-long -pipe -g -lboost_unit_test_framework-gcc34-mt-d-1_37 -o executable *.o but i get this: nk.o: In function `init_unit_test_suite(int, char**)': ...boost/test/unit_test_suite.hpp:188: multiple definition of `init_unit_test_suite(int, char**)' ni.o: ...boost/test/unit_test_suite.hpp:188: first defined here for each object file and /usr/lib/gcc/x86_64-redhat-linux/3.4.6/../../../../lib64/crt1.o(.text+0x21): In function `_start': : undefined reference to `main' Regards,

3 4

Re: [Boost-users] [string_algo] replace string with tokens
by Michael Schuster 04 Jun '09

04 Jun '09

>> I'm not sure what you mean with 'replace command'. >> boost::algorithm::replace_all() simply replaces a substring with another.If >> you mean boost::algorithm::split() you can pass a predicate as the third >> parameter (boost::algorithm::is_punct() might help). Well I didnot find replace_all in usage of the bib. Now that you tell me, i can find it. But here I see no way to tell replace_all that my strings are not seperated by spaces but +*() etc. a+3*sin(b) So what I had expected is like this: string str="a+3*sin(b)"; replace_all(str,"b", "Beta", "+*()") // now str="a+3*sin(Beta)"; Perhaps a task for tokenizer(?) >For what you are doing, perhaps regex_replace in Boost.Xpressive might >be more useful? I'll have a look Thanks Michael Schuster

1 0

boost::thread - Why does this code not work?
by Henrik Berg 04 Jun '09

04 Jun '09

Hi all, I have some problems with the boost::thread library, I've been staring at this code for a couple of days now but still have no idea what's wrong with it. The code starts a thread, the thread waits at a barrier, and command is transfered between the main thread and the new thread a couple of times (using two successive calls to barrier->wait() for each transition). This works fine most of the times, but sometimes the thread for some reason does not start. And when the main thread then waits at the barrier, the program obiously locks up. Here's the code: #include <iostream> #include <boost/thread.hpp> #include <boost/thread/barrier.hpp> class ThreadObject { public: boost::barrier *barrier; boost::thread *tacticsThread; ThreadObject() { barrier = new boost::barrier(2); std::cerr << "Main thread: Initiating ThreadObject\n"; tacticsThread = new boost::thread(*this); std::cerr << "Main thread: ThreadObject initiated\n"; } void operator()() { std::cerr << "Thread 2: Started\n"; // Waiting for the main thread to release this thread: barrier->wait(); std::cerr << "Thread 2: Processing.\n"; std::cerr << "Thread 2: Waiting for the main thread...\n"; // Release the main thread (which is waiting at the barrier): barrier->wait(); // Wait at the barrier until the main thread releases this thread again: barrier->wait(); std::cerr << "Thread 2: Continues.\n"; std::cerr << "Thread 2: Completed, now releasing the main thread.\n"; // Release the main thread (which is waiting at the barrier): barrier->wait(); } }; int main() { for (int i = 0; i < 100; i++) { std::cerr << std::endl << "Starting new test, i = " << i << std::endl; ThreadObject obj; std::cerr << "Main thread: Transferring command to Thread 2\n"; obj.barrier->wait(); obj.barrier->wait(); std::cerr << "Main thread: Command returned. Transfer command back to Thread 2 once more\n"; obj.barrier->wait(); obj.barrier->wait(); std::cerr << "Main thread: completed, everything ok\n"; } } In main(), a new ThreadObject is created, this will start a new thread. Then command is transfered back and forth a few times (with pairs of barrier->wait())). Since the code usually works fine, I've wrapped it all in a for loop, in order to repeat it multiple times. After a few iterations, the program locks up. The number of successful iterations before this happens varies, here is an example of output from a run which locked after two iterations: Starting new test, i = 0 Main thread: Initiating ThreadObject Main thread: ThreadObject initiated Main thread: Transferring command to Thread 2 Thread 2: Started Thread 2: Processing. Thread 2: Waiting for the main thread... Main thread: Command returned. Transfer command back to Thread 2 once more Thread 2: Continues. Thread 2: Completed, now releasing the main thread. Main thread: completed, everything ok Starting new test, i = 1 Main thread: Initiating ThreadObject Main thread: ThreadObject initiated Thread 2: Started Main thread: Transferring command to Thread 2 Thread 2: Processing. Thread 2: Waiting for the main thread... Main thread: Command returned. Transfer command back to Thread 2 once more Thread 2: Continues. Thread 2: Completed, now releasing the main thread. Main thread: completed, everything ok Starting new test, i = 2 Main thread: Initiating ThreadObject Main thread: ThreadObject initiated Main thread: Transferring command to Thread 2 So, why does not the new thread start up in the last test? Is there some problem with my code, or is there some bug in boost::thread? I'm compiling this using gcc-3.4.4 and boost 1.39.0 under cygwin. Thanks for any help, Henrik

2 1

[Unknown] Pedicate wrappers around std algorithms
by Robert Jones 04 Jun '09

04 Jun '09

Hi All, Does this kind of wrapper exist in Boost anywhere? template < class Iterator, class T > bool exists( Iterator begin, Iterator end, const T & value ) { return find( begin, end, value ) != end; } Thanks, - Rob.

2 1

Why does bind have overhead?
by Joseph Garvin 04 Jun '09

04 Jun '09

I've read that bind can have significant overhead unless your parameters are small (because then it can use the small buffer optimization). But why does it have anymore overhead than copying the parameters and assigning a function pointer? I suspect support for something (maybe member function pointers + multiple inheritance?) is responsible but I'm not sure what. I tried looking through bind.hpp but trying to figure out what it's actually doing amongst all the compiler workarounds and different parameter versions it's difficult to tell what's going on.

2 1

[Function] Potential bug with ref-wrapped function objects?
by Dave Bonora 04 Jun '09

04 Jun '09

Hello group, Boost.Function is exhibiting differing behavior in different boost releases: //-------------------------- struct F { void operator()() { } }; F obj; // assume obj remains in scope for duration of sample boost::function<void()> f1 = boost::ref( obj ); boost::function<void()> f2 = f1; assert( f1 == boost::ref( obj ) ); assert( f2 == boost::ref( obj ) ); // Passes in 1.35.0, Fails in 1.39.0 boost::function<void()> f3 = boost::ref( obj ); boost::function<void()> f4; f3.swap( f4 ); assert( f3 != boost::ref( obj ) ); assert( f4 == boost::ref( obj ) ); // Passes in 1.35.0, Fails in 1.39.0 //--------------------------- I'm assuming 1.35.0 is demonstrating the correct behavior whereas 1.39.0 is exhibiting a bug, but I thought I'd defer to the group before I reported it. Am I correct?

2 1

Compile error using boost's tr1::bind
by Tron Thomas 04 Jun '09

04 Jun '09

This code: #include <iostream> #include <algorithm> #include <boost/tr1/functional.hpp> using std::ostream; class Value { public: Value() : m_amount(0) {} void IncreaseBy(int amount) { m_amount += amount; } void WriteTo(ostream& stream) const { stream << m_amount; } private: int m_amount; }; ostream& operator <<(ostream& stream, const Value& value) { value.WriteTo(stream); return stream; } int main() { Value sum; int values[] = { 1, 2, 3, 4, 5 }; std::for_each(values, values + 5, std::tr1::bind(&Value::IncreaseBy, sum)); std::cout << "The value is " << sum << std::endl; return 0; } Produces compile error output like the following when compiled on Fedora 10 (Intel): In file included from /usr/include/boost/tr1/functional.hpp:8, from ValueSum.cpp:3: /usr/include/boost/tr1/detail/config.hpp:60:26: error: no include path in which to search for utility /usr/include/boost/mem_fn.hpp: In member function ‘R& boost::_mfi::dm<R, T>::operator()(T&) const [with R = void ()(int), T = Value]’: /usr/include/boost/bind.hpp:221: instantiated from ‘R boost::_bi::list1<A1>::operator()(boost::_bi::type<R>, F&, A&, long int) [with R = void (&)(int), F = boost::_mfi::dm<void ()(int), Value>, A = boost::_bi::list1<int&>, A1 = boost::_bi::value<Value>]’ /usr/include/boost/bind/bind_template.hpp:32: instantiated from ‘typename boost::_bi::result_traits<R, F>::type boost::_bi::bind_t<R, F, L>::operator()(A1&) [with A1 = int, R = void (&)(int), F = boost::_mfi::dm<void ()(int), Value>, L = boost::_bi::list1<boost::_bi::value<Value> >]’ /usr/lib/gcc/i386-redhat-linux/4.3.2/../../../../include/c++/4.3.2/bits/stl_algo.h:3791: instantiated from ‘_Funct std::for_each(_IIter, _IIter, _Funct) [with _IIter = int*, _Funct = boost::_bi::bind_t<void (&)(int), boost::_mfi::dm<void ()(int), Value>, boost::_bi::list1<boost::_bi::value<Value> > >]’ ValueSum.cpp:31: instantiated from here /usr/include/boost/mem_fn.hpp:359: error: invalid use of non-static member function What is needed for the code to compile and run properly?

3 2

Re: [Boost-users] unit tests: auto tests, missing main, redef'ed init_unit_test_suite
by Hicham Mouline 04 Jun '09

04 Jun '09

From: Hicham Mouline [mailto:hicham@mouline.org] Sent: 04 June 2009 14:03 To: 'boost-users(a)lists.boost.org' Subject: unit tests: auto tests, missing main, redef'ed init_unit_test_suite g++3.4 - boost1.37 Hello, I have n translation units .cpp and m auto test suites spread over the n files. For e.g. file ni.cpp-------------------- #include <boost/test/unit_test.hpp> BOOST_AUTO_TEST_SUITE(suite1) BOOST_AUTO_TEST_CASE(case1) BOOST_AUTO_TEST_SUITE_END() file nj.cpp-------------------- #include <boost/test/unit_test.hpp> BOOST_AUTO_TEST_SUITE(suite1) BOOST_AUTO_TEST_CASE(case2) BOOST_AUTO_TEST_CASE(case3) BOOST_AUTO_TEST_SUITE_END() file nk.cpp-------------------- #include <boost/test/unit_test.hpp> BOOST_AUTO_TEST_SUITE(suite2) BOOST_AUTO_TEST_CASE(case1) BOOST_AUTO_TEST_CASE(case2) BOOST_AUTO_TEST_SUITE_END() The .cpp files are compiled with -DBOOST_TEST_MAIN= AFAIU, I am then not required to provide the "init_unit_test" function nor the "main" function. I then try to link an executable: g++ -m64 -Wall -Wextra -Wsign-compare -Werror -Wno-unused -std=c++98 -pedantic -Wno-long-long -pipe -g -lboost_unit_test_framework-gcc34-mt-d-1_37 -o executable *.o but i get this: nk.o: In function `init_unit_test_suite(int, char**)': ...boost/test/unit_test_suite.hpp:188: multiple definition of `init_unit_test_suite(int, char**)' ni.o: ...boost/test/unit_test_suite.hpp:188: first defined here for each object file and /usr/lib/gcc/x86_64-redhat-linux/3.4.6/../../../../lib64/crt1.o(.text+0x21): In function `_start': : undefined reference to `main' Regards, ------------------------------------------------------------------------ After rereading, I defined -DBOOST_TEST_MAIN= for only 1 of the source files. The objects compile ok. But linking fails with the same error. Regards,

1 0

[GUID] newbie's question
by bidi_bulle＠yahoo.com 04 Jun '09

04 Jun '09

Hello, I am actively searching for GUID librairy in the version 7. Perhaps I miss completely my search but I can't find it anymore. Can someone help me and provide me a link to this librairy ? Thanks Bob

2 1

Bug Sprint Report for Wednesday, June rd
by Marshall Clow 04 Jun '09

04 Jun '09

The boost bug sprint started Friday, May 29th, and runs through Sunday June 7th. Wednesday was not a good day in terms of bug closing; the good news is that we've already (as of 6 AM) closed more bugs on Thursday than all of Wednesday. Status <https://svn.boost.org/trac/boost/report/1> 7:00 AM PDT 5/29: 797 open tickets. 7:45 AM PDT 5/30: 772 open tickets. 6:00 AM PDT 5/31: 761 open tickets. 6:00 AM PDT 6/2: 747 open tickets. 6:00 AM PDT 6/3: 748 open tickets. 6:00 AM PDT 6/4: 739 open tickets. Activity: 5/29: 6 new tickets, 77 modifications, 25 tickets closed 5/30: 2 new tickets, 42 modifications, 17 tickets closed 5/31: 2 new tickets, 27 modifications, 8 tickets closed 6/1: 2 new tickets, 42 modifications, 17 tickets closed 6/2: 5 new tickets, 18 modifications, 5 tickets closed. 6/3 4 new tickets, 19 modifications, 2 tickets closed. [ Numbers may not add up because I am counting via two different methods, using data that is time-stamped in two different time zones. Also, tickets can be closed and reopened. ] What can you do? See <https://svn.boost.org/trac/boost/wiki/BugSprintJune2009> for details. I've added four new reports to the trac: Open ticket count by owner: <https://svn.boost.org/trac/boost/report/18> Open ticket count by component: <https://svn.boost.org/trac/boost/report/19> Open ticket count by ticket type: <https://svn.boost.org/trac/boost/report/20> Open ticket count by milestone: <https://svn.boost.org/trac/boost/report/21> There's been a lot of discussion on the list about tickets; and there are about a dozen patches that have been tested and are ready to be applied. If you're looking to help, you can look at some of the older bugs, say, the ones for Boost 1.36, and determine if they still apply. If they do, note that in the ticket. There are 35 tickets that are still open that are marked as "to be fixed in Boost 1.36" See <https://svn.boost.org/trac/boost/report/3> for a list of open tickets by milestone. --------- Sign-up sheet -------- The following people have committed to participate in the bug sprint. Please add you name here, along with what you can do. 1) Marshall Clow (coordination, Mac OS X characterization) 2) Beman Dawes (filesystem, system, timer) 3) Doug Gregor (function, graph, logic, mpi, numeric, property_map, signals) 4) "joel falcou" <joel.falcou(a)u-psud.fr> ( linux gcc testing/VC 2008 testing, patching) 5) Michael Caisse <boost(a)objectmodelingdesigns.com> (bug fixing) 6) Jeremiah Willcock <jewillco(a)osl.iu.edu> (will test and commit graph patches) 7) David Abrahams (iterator, python) 8) Sohail Somani (patches for g++ 4.2.4) 9) Steven Watanabe <watanabesj(a)gmail.com> (bug fixes, como) 10) vicente.botet" <vicente.botet(a)wanadoo.fr> 11) Stjepan Rajko <stjepan.rajko(a)gmail.com> (fusion) 12) Daniel Wallin (parameter, ...) -- -- Marshall Marshall Clow Idio Software <mailto:marshall@idio.com> It is by caffeine alone I set my mind in motion. It is by the beans of Java that thoughts acquire speed, the hands acquire shaking, the shaking becomes a warning. It is by caffeine alone I set my mind in motion.

1 0

[bind maybe?] find_if of map mapped_type.
by Robert Jones 04 Jun '09

04 Jun '09

If I'm iterating over a map with, say find_if, and my predicate function accepts the mapped_type of the map, is there a mechanism to pick out the pair.second value inline? class C; map< int, C > m; bool pred( const C & ); // correct version of this intent. find_if( m.begin( ), m.end( ), pred( second ) ); Thanks, - Rob.

2 2

dev_poll_reactor vs. strand and async_write
by Chris Hite 04 Jun '09

04 Jun '09

In a project using asio I noticed performance issues on Sun vs. Linux. It turned out that dev_poll_reactor is doing tones of system calls always pairs of write() and ioctl(). Stranger still is that the calls to write() are for 0 bytes. I was able to avoid the issue by switching from strand to mutex. I think there is some bug or logic error in dev_poll_reactor so I wrote a test program to narrow down when it happens: // Christopher Hite RTS Realtime Systems Software GmbH, Rembrandtstrasse 13, D-60596 Frankfurt am Main T: +49.69.61009.0 / F: +49.69.61009.181 Sitz: Frankfurt am Main - HRB 84467 Amtsgericht Frankfurt am Main Geschäftsführer: Steffen Gemuenden, Igor Sluga www.rtsgroup.net This email and any attachments are for the exclusive and confidential use of the intended recipient. If you are not the intended recipient, or an employee or agent responsible for delivering this message to the intended recipient, please do not read, distribute or take action in reliance upon this message. If you have received this in error, please notify me immediately by return email and promptly delete this message and its attachments from your computer system. ------------------------------------------------------------------------------- #include <boost/asio.hpp> #include <iostream> using namespace boost::asio; io_service service; io_service::strand strand_(service); local::stream_protocol::socket s0(service); local::stream_protocol::socket s1(service); void wh(const boost::system::error_code& ec,const std::size_t){ if(ec) std::cout<<ec; //never happens } void sendAByte(){ static char sendBuf[256]; async_write(s0,buffer(sendBuf,1),wh); } int main(){ local::connect_pair(s0,s1); std::cout<<"dispatching\n"; for(int i=0;i<100000;i++) #if 1 strand_.dispatch(sendAByte); #else sendAByte(); //doesn't cause the sys calls #endif std::cout<<"waiting on run to finish\n"; service.run(); return 0; } //------------------------------------------------------------------------------- Here are some dtraces to help analyze what's going on $XX is the executable. This one shows all the calls to write() with size=0. async_write uses sendmsg() so all these are attributable to dev_poll_reactor. dtrace -n 'syscall::write:entry/pid==$target&&arg2==0/{ ustack(); }' -c $XX 0 5467 write:entry libc.so.1`_write+0x8 strandtest`__1cFboostEasioGdetailQdev_poll_reactor4b_Drun6Mb_v_+0x1b4 strandtest`__1cFboostEasioGdetailPtask_io_service4n0CQdev_poll_reactor4b___Gdo_one6Mrn0CLscoped_lock4n0CLposix_mutex___pn0EQidle_thread_info_rn0AGsystemKerror_code__I_+0x204 strandtest`__1cFboostEasioGdetailPtask_io_service4n0CQdev_poll_reactor4b___Drun6Mrn0AGsystemKerror_code__I_+0xa8 strandtest`main+0xe8 This one counts the system calls. What's very disturbing is that the longer you let it run the more sys calls are made. Why doesn't the system block waiting for the socket to become write-able again (which it won't)? dtrace -n 'syscall:::entry/pid == $target/ { @num[probefunc] = count(); }' -c $XX fcntl 6 brk 2474 sendmsg 21505 ioctl 60194 write 60195 lwp_sigmask 120382 Similar testing on Linux(x86) using strace doesn't show so many system calls (except a few for locking mutexes). Perhaps Christopher Kohlhoff or whoever implemented the thing can take a look. I'm guessing there some event which keeps getting detected but isn't processed. Would someone please take a look or do I need to debug it myself?

1 0

POD 3d vectors
by gtsml owevwr 04 Jun '09

04 Jun '09

Hi, I need fast low dimensional vector (2, 3 and 4 dimension let say). How shall I implement them with boost? Off course ublas is a possibility but I feel it's more designed for higher dimension. Ideally, low dimension vector are better as POD, without any pointer indirection for instance. Maybe there's a way to enforce no indirection with ublas? Off course, boost::array would do the trick but it doesn't have any of the basic arithmetic operators. I could easily add them with the operators library, but maybe there's a better way? And off course, could be great to have POD small matrices as well... I know this request is probably over specialized but maybe I'm missing something already there Thanks, Frank

8 7

[asio] thread-safe async_write with streambuf
by Rutger ter Borg 04 Jun '09

04 Jun '09

Hi all, I'm looking into thread-safe writing of data using Asio, using a streambuf. My current implementation boils down to something like the following. // posting Something from >1 thread(s) void async_send( Something s ) { m_strand.post( async_send_something(s) ); } // Serialized execution // Protects resources socket and streambuf void async_send_something( Something s) { std::ostream os( &m_streambuf ); os << s << std::flush; asio::async_write( m_socket, m_streambuf, transfer_all(), bind( async_complete ) ); } void async_complete( error e ) { } My main confusion is on how to do this with a streambuf. What happens between async_write and the completion handler? It could be that async_send_something is called from one thread before a completion handler of an earlier operation finishes in another thread, and in that case, I'm not sure if it is defined what happens with the streambuf. For the situation sketched above, I couldn't find guarantees around the access pattern of other io_service threads, so my question would be if the implementation above is really thread-safe, and if not, how to best achieve that. Thanks, Kind regards, Rutger

1 0

Using different variables based on template type
by Ryan McConnehey 04 Jun '09

04 Jun '09

I have a couple of functions that provide the same functionality for different types. I'd like to combine them to reduce code duplication. An example of two functions is listed below. std::map<std::string, uint16> m_Uint16; std::map<std::string, uint32> m_Uint32; void putUint16(std::string const& variableName, uint16 const& value) { m_Uint16[variableName] = value; } void putUint32(std::string const& variableName, uint32 const& value) { m_Uint32[variableName] = value; } The functions can't be combined into a template since they are the interface for the programmer. Is there a boost library that would let me call a template or common function that would use a different variable based on the variable type? Ryan

4 13

[string_algo] replace string with tokens
by Michael Schuster 03 Jun '09

03 Jun '09

Hello, I'm new to string_algo and have the following problem: I have string like a+3*sin(b) and want to replace a by a different string e.g. Alpha and b by Beta and sin by cos so that Alpha+3*cos(Beta) is the result. So tokens would be "+*()" The replace command works with spaces, but I think this should be possible with string_algo, too? Thanks for any hint Michael Schuster

3 2

[BGL] A bug in const bundle_property_map or in Readable Property Map Concept ?
by Dmitry Bufistov 03 Jun '09

03 Jun '09

Hi there, The attached test case fails to compile. If it is a bug I would be happy to open a ticket for it! Could somebody please confirm? Thank you, Dmitry

3 5

[exception] What's wrong with boost::get_error_info?
by Markus Schweiß 03 Jun '09

03 Jun '09

Dear boost community, I'm really new to using the boost library. Whatever, the first part I want to use is boost::exception. But already there start my problems: I'm using 'boost::get_error_info<boost::throw_file>( myBoostException )' to retrieve the file name where my exception was thrown. The problem is that the returned 'const char*' pointer contains several wild characters at its end. It seems that the null-termination get lost somehow, somewhere. The same is with 'boost::throw_function' and the string returned by 'boost::diagnostic_information( myBoostException )'! For example, that is what I get from boost::diagnostic_information: ".\myFile.cppÍýýýý««««««««îþ(134): Throw in function MyClass::DoSomething()ÍÍÍÍÍÍ^ñ6 Dynamic exception type: class MyBoostException" That's really strange because the strings are correctly stored to the boost::exception class attributes 'throw_function_' and 'throw_file_'. So what do I wrong??? I would be so thankful when anyone could help me! Following some detailed information: - plattfrom: Windows XP SP3 - compiler: MS VC++ 8 - character set: multi-byte - boost version: Release 1.37.0 code snippet for throwing my exception: throw MyBoostException() << boost::throw_file( __FILE__ ) << boost::throw_line( __LINE__ ) << boost::throw_function( "MyClass::DoSomething()" ); code snippet for catching my exception: catch( MyBoostException& myBoostException ) { std::string info = boost::diagnostic_information( myBoostException ); const char* string = info.c_str(); } My best regards, Markus

2 5

[Program Options]
by Björn Pollex 03 Jun '09

03 Jun '09

Hi everyone ! Is there a simple way to make the command line parser throw an error when an option is not specified ? This way i would not have to check this in my code. My program requires the user to specify an input file, and if he doesn't, an error should be displayed. So, is there any support for mandatory parameters (they wouldn't really be options if they are mandatory) ? wbr Bjoern Pollex

2 1

[ASIO] Where to use CoInitizeEx
by Daniele Barzotti 03 Jun '09

03 Jun '09

Hi, in a library I have a factory function that creates objects: ---- Main Library File ---- // Main io_service static boost::asio::io_service io_service; static boost::scoped_ptr<boost::thread> io_service_thread; static boost::asio::io_service::work* p_work; static BOOL thread_started; EXTERN_C EUROATLIB_API TETRAMotoHndl CALL GetTETRAMotoObj() { if (!thread_started) { try { // create the work object on the heap p_work = new boost::asio::io_service::work(io_service); // run the IO service as a separate thread io_service_thread.reset( new boost::thread( boost::bind(&boost::asio::io_service::run, &io_service) ) ); thread_started = !thread_started; } catch (boost::thread_resource_error e) { // Failed to create the new thread return 0; } } // create the new object TETRAMoto* pTETRAMoto = new TETRAMoto(io_service); // Assign a reference to io_service work object: // This reference is used to counting the objects created. // When the last TETRAMoto object is deleted the main work object // is destroyed and the io_service thread ends. pTETRAMoto->_io_work_ptr.reset(p_work); // return the object return pTETRAMoto; }; --------------------------------- These TETRAMoto objects creates another object, ATDispatcher, that use a SerialPort (which is a wrapper around asio::serial_port) to continuously read and write to RS232. When the SerialPort receive data, pass it to the ATDispatcher that raises a signal to the TETRAMoto object that parses the data and raise the event (always a signal) to the extern: asio::serial_port -> SerialPort -> ATDispatcher -> TetraMoto -|-> EXTERN Now I have to encapsulate this lib into an ActiveX DLL to be used by VB6 and I have to call CoInitizeEx in the thread that "raise" events.. My question is: where I have to call CoInitizeEx? Thanks in advance, Daniele.

5 14

Bug Sprint Report for Tuesday, June 2nd
by Marshall Clow 03 Jun '09

03 Jun '09

The boost bug sprint started Friday, May 29th, and runs through Sunday June 7th. We slowed down a lot on Tuesday - let's pick it up again. Status <https://svn.boost.org/trac/boost/report/1> 7:00 AM PDT 5/29: 797 open tickets. 7:45 AM PDT 5/30: 772 open tickets. 6:00 AM PDT 5/31: 761 open tickets. 6:00 AM PDT 6/2: 747 open tickets. 6:00 AM PDT 6/3: 748 open tickets. Activity: 5/29: 6 new tickets, 77 modifications, 25 tickets closed 5/30: 2 new tickets, 42 modifications, 17 tickets closed 5/31: 2 new tickets, 27 modifications, 8 tickets closed 6/1: 2 new tickets, 42 modifications, 17 tickets closed 6/2: 5 new tickets, 18 modifications, 5 tickets closed. [ Numbers may not add up because I am counting via two different methods, using data that is time-stamped in two different time zones. Also, tickets can be closed and reopened. ] What can you do? See <https://svn.boost.org/trac/boost/wiki/BugSprintJune2009> for details. I've added four new reports to the trac: Open ticket count by owner: <https://svn.boost.org/trac/boost/report/18> Open ticket count by component: <https://svn.boost.org/trac/boost/report/19> Open ticket count by ticket type: <https://svn.boost.org/trac/boost/report/20> Open ticket count by milestone: <https://svn.boost.org/trac/boost/report/21> There's been a lot of discussion on the list about tickets; and there are about a dozen patches that have been tested and are ready to be applied. If you're looking to help, you can look at some of the older bugs, say, the ones for Boost 1.36, and determine if they still apply. If they do, note that in the ticket. There are 35 tickets that are still open that are marked as "to be fixed in Boost 1.36" See <https://svn.boost.org/trac/boost/report/3> for a list of open tickets by milestone. --------- Sign-up sheet -------- The following people have committed to participate in the bug sprint. Please add you name here, along with what you can do. 1) Marshall Clow (coordination, Mac OS X characterization) 2) Beman Dawes (filesystem, system, timer) 3) Doug Gregor (function, graph, logic, mpi, numeric, property_map, signals) 4) "joel falcou" <joel.falcou(a)u-psud.fr> ( linux gcc testing/VC 2008 testing, patching) 5) Michael Caisse <boost(a)objectmodelingdesigns.com> (bug fixing) 6) Jeremiah Willcock <jewillco(a)osl.iu.edu> (will test and commit graph patches) 7) David Abrahams (iterator, python) 8) Sohail Somani (patches for g++ 4.2.4) 9) Steven Watanabe <watanabesj(a)gmail.com> (bug fixes, como) 10) vicente.botet" <vicente.botet(a)wanadoo.fr> 11) Stjepan Rajko <stjepan.rajko(a)gmail.com> (fusion) 12) Daniel Wallin (parameter, ...) -- -- Marshall Marshall Clow Idio Software <mailto:marshall@idio.com> It is by caffeine alone I set my mind in motion. It is by the beans of Java that thoughts acquire speed, the hands acquire shaking, the shaking becomes a warning. It is by caffeine alone I set my mind in motion.

1 0

dynamic_bitset, bitset, etc
by Zachary Turner 02 Jun '09

02 Jun '09

I find that I frequently want a class that provides the capabilities of a boost::dynamic_bitset, but that i want to be able to load the values all at once from a huge block of binary data. The exact use case is that I'm reading block data off of a disk, and in most modern file systems there's a very large chunk of data at the beginning that is just a series of bits that specify whether or not particular blocks are allocated. So I issue an I/O to read a chunk of this bitmap, then I just want to tell the class "do a huge memcpy and use this block of data as your internal buffer". Or better yet, member functions that a) give direct access to the internal buffer and b) tell me how many bytes the internal buffer is, and c) let me resize the internal buffer to hold x bits. There's vector<bool>, std::bitset, boost::dynamic_bitset, and boost::bitset. I understand why vector<bool> can't support this, but is there some fundamental reason why this seemingly simple operation is not supported on any available implementation of a bit set anywhere? Or is it supported and I'm just overlooking the function necessary to do it? I see there's a constructor that takes a BlockIterator, but I want it to ultimately boil down to a memcpy, not a for loop.

1 0

[BGL] read_graphml fails at compilation but MutableGraph concept test succeeds
by Paul Hilbert 02 Jun '09

02 Jun '09

Look at this (shortened) code fragment: namespace boost { ... Node* add_vertex(HalfedgeGraph& g) { Node* n = new Node(); g.AddNode(n); return n; } ... } int main(int argc, char* argv[]) { // #1 boost::function_requires< boost::MutableGraphConcept<HalfedgeGraph> >(); std::ifstream ifile("test_input.xml"); boost::dynamic_properties dp; HalfedgeGraph g; // #2 boost::read_graphml(ifile, g, dp); return 0; } The concept test at #1 (calling Node* add_vertex(HalfedgeGraph&)) succeeds (if I remove or alter the add_vertex function it fails as expected), but the read_graphml function at #2 doesn't compile telling me that add_vertex(HalfedgeGraph&) isn't compiled. How come the partial graph_traits specialization works for the concept-test-class but not for the graphml reader? (The HalfedgeGraph class did prove correct in the past and the graph_traits<HalfedgeGraph>::vertex_descriptor is a typedef for Node*) Greetings, Paul Hilbert

2 1

Bug Sprint Report for Monday, June 1st
by Marshall Clow 02 Jun '09

02 Jun '09

The boost bug sprint started Friday, May 29th, and runs through Sunday June 7th. Monday was a good day - lets keep it up! Status <https://svn.boost.org/trac/boost/report/1> 7:00 AM PDT 5/29: 797 open tickets. 7:45 AM PDT 5/30: 772 open tickets. 6:00 AM PDT 5/31: 761 open tickets. 6:00 AM PDT 6/2: 747 open tickets. Activity: 5/29: 6 new tickets, 77 modifications, 25 tickets closed 5/30: 2 new tickets, 42 modifications, 17 tickets closed 5/31: 2 new tickets, 27 modifications, 8 tickets closed 6/1: 2 new tickets, 42 modifications, 17 tickets closed [ Numbers may not add up because I am counting via two different methods, using data that is time-stamped in two different time zones. Also, tickets can be closed and reopened. ] What can you do? See <https://svn.boost.org/trac/boost/wiki/BugSprintJune2009> for details. I've added four new reports to the trac: Open ticket count by owner: <https://svn.boost.org/trac/boost/report/18> Open ticket count by component: <https://svn.boost.org/trac/boost/report/19> Open ticket count by ticket type: <https://svn.boost.org/trac/boost/report/20> Open ticket count by milestone: <https://svn.boost.org/trac/boost/report/21> There's been a lot of discussion on the list about tickets; and there are about a dozen patches that have been tested and are ready to be applied. If you're looking to help, you can look at some of the older bugs, say, the ones for Boost 1.36, and determine if they still apply. If they do, note that in the ticket. --------- Sign-up sheet -------- The following people have committed to participate in the bug sprint. Please add you name here, along with what you can do. 1) Marshall Clow (coordination, Mac OS X characterization) 2) Beman Dawes (filesystem, system, timer) 3) Doug Gregor (function, graph, logic, mpi, numeric, property_map, signals) 4) "joel falcou" <joel.falcou(a)u-psud.fr> ( linux gcc testing/VC 2008 testing, patching) 5) Michael Caisse <boost(a)objectmodelingdesigns.com> (bug fixing) 6) Jeremiah Willcock <jewillco(a)osl.iu.edu> (will test and commit graph patches) 7) David Abrahams (iterator, python) 8) Sohail Somani (patches for g++ 4.2.4) 9) Steven Watanabe <watanabesj(a)gmail.com> (bug fixes, como) 10) vicente.botet" <vicente.botet(a)wanadoo.fr> 11) Stjepan Rajko <stjepan.rajko(a)gmail.com> (fusion) 12) Daniel Wallin (parameter, ...) -- -- Marshall Marshall Clow Idio Software <mailto:marshall@idio.com> It is by caffeine alone I set my mind in motion. It is by the beans of Java that thoughts acquire speed, the hands acquire shaking, the shaking becomes a warning. It is by caffeine alone I set my mind in motion.

1 0

Review Wizard Status Report for June 2009
by Ronald Garcia 02 Jun '09

02 Jun '09

============================================== Review Wizard Status Report for June 2009 ============================================== News ==== Futures: Williams variant Accepted; Gaskill variant Rejected Boost 1.38 Released New Libraries: Revised Libraries: Boost.Range Extension Accepted Polynomial Library Rejected Boost 1.39 Released Constrained Value Review - Review Result Pending Older Issues ============ The Time Series Library, accepted in August 2007, has not yet been submitted to SVN. Eric Niebler and John Phillips are working on making the changes suggested during the review. The Floating Point Utilities Library, has not yet been submitted to SVN. It is slated to be integrated with the Boost.Math library. The Switch Library, accepted provisionally in January 2008, has not yet been submitted for mini-review and full acceptance. The Phoenix Library, accepted provisionally in September 2008, has not yet been submitted for mini-review and full acceptance. A rewrite of Phoenix, basing it on the Proto metaprogramming library, has just begun. General Announcements ===================== As always, we need experienced review managers. The review queue has been growing substantially but we have had few volunteers, so manage reviews if possible and if not please make sure to watch the review schedule and participate. Please take a look at the list of libraries in need of managers and check out their descriptions. In general review managers are active boost participants or library contributors. If you can serve as review manager for any of them, email Ron Garcia or John Phillips, "garcia at osl dot iu dot edu" and "phillips at mps dot ohio-state dot edu" respectively. We are also suffering from a lack of reviewers. While we all understand time pressures and the need to complete paying work, the strength of Boost is based on the detailed and informed reviews submitted by you. A recent effort is trying to secure at least five people who promise to submit reviews as a precondition to starting the review period. Consider volunteering for this and even taking the time to create the review as early as possible. No rule says you can only work on a review during the review period. A link to this report will be posted to www.boost.org. If you would like us to make any modifications or additions to this report before we do that, please email Ron or John. If you're a library author and plan on submitting a library for review in the next 3-6 months, send Ron or John a short description of your library and we'll add it to the Libraries Under Construction below. We know that there are many libraries that are near completion, but we have hard time keeping track all of them. Please keep us informed about your progress. Review Queue ============ * Lexer * Shifted Pointer * Logging * Log * Join * Pimpl * Thread Pool * Endian * Meta State Machine * Conversion * Sorting * GIL.IO * AutoBuffer * String Convert -------------------- Lexer ----- :Author: Ben Hanson :Review Manager: Eric Neibler :Download: `Boost Vault <http://boost-consulting.com/vault/index.php?action=downloadfile&filename=bo… >`__ :Description: A programmable lexical analyser generator inspired by 'flex'. Like flex, it is programmed by the use of regular expressions and outputs a state machine as a number of DFAs utilising equivalence classes for compression. Shifted Pointer --------------- :Author: Phil Bouchard :Review Manager: Needed :Download: `Boost Vault <http://www.boost-consulting.com/vault/index.php?&direction=0&order=&directo… >`__ :Description: Smart pointers are in general optimized for a specific resource (memory usage, CPU cycles, user friendliness, ...) depending on what the user need to make the most of. The purpose of this smart pointer is mainly to allocate the reference counter (or owner) and the object itself at the same time so that dynamic memory management is simplified thus accelerated and cheaper on the memory map. Logging ------- :Author: John Torjo :Review Manager: Gennadiy Rozental :Download: http://torjo.com/log2/ :Description: Used properly, logging is a very powerful tool. Besides aiding debugging/testing, it can also show you how your application is used. The Boost Logging Library allows just for that, supporting a lot of scenarios, ranging from very simple (dumping all to one destination), to very complex (multiple logs, some enabled/some not, levels, etc). It features a very simple and flexible interface, efficient filtering of messages, thread-safety, formatters and destinations, easy manipulation of logs, finding the best logger/filter classes based on your application's needs, you can define your own macros and much more! Log --- :Author: Andrey Semashev :Review Manager: Needed :Download: `Boost Vault <http://tinyurl.com/cm9lum>`__ :Description: The library is aimed to help adding logging features to applications. It provides out-of-box support for many widely used capabilities, such as formatting and filtering based on attributes, sending logs to a syslog server or to Windows Event Log, or simply storing logs into files. It also provides basic support for the library initialization from a settings file. The library can also be used for a wider range of tasks and implement gathering and processing statistical information or notifying user about application events. Join ---- :Author: Yigong Liu :Review Manager: Needed :Download: http://channel.sourceforge.net/ :Description: Join is an asynchronous, message based C++ concurrency library based on join calculus. It is applicable both to multi-threaded applications and to the orchestration of asynchronous, event-based applications. It follows Comega's design and implementation and builds with Boost facilities. It provides a high level concurrency API with asynchronous methods, synchronous methods, and chords which are "join-patterns" defining the synchronization, asynchrony, and concurrency. Pimpl ----- :Author: Vladimir Batov :Review Manager: Needed :Download: | `Boost Vault <http://www.boost-consulting.com/vault/index.php?action=downloadfile&filenam… >`__ | http://www.ddj.com/cpp/205918714 (documentation) :Description: The Pimpl idiom is a simple yet robust technique to minimize coupling via the separation of interface and implementation and then implementation hiding. This library provides a convenient yet flexible and generic deployment technique for the Pimpl idiom. It's seemingly complete and broadly applicable, yet minimal, simple and pleasant to use. Thread Pool ----------- :Author: Oliver Kowalke :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=bo… >`__ :Description: The library provides: - thread creation policies: determines the management of worker threads: - fixed set of threads in pool - create workerthreads on demand (depending on context) - let worker threads ime out after certain idle time - channel policies: manages access to queued tasks: - bounded channel with high and low watermark for queuing tasks - unbounded channel with unlimited number of queued tasks - rendezvous syncron hand-over between producer and consumer threads - queueing policy: determines how tasks will be removed from channel: - FIFO - LIFO - priority queue (attribute assigned to task) - smart insertions and extractions (for instance remove oldest task with certain attribute by newst one) - tasks can be chained and lazy submit of taks is also supported (thanks to Braddocks future library). - returns a task object from the submit function. The task it self can be interrupted if its is cooperative (means it has some interruption points in its code -> ``this_thread::interruption_point()`` ). Endian ------ :Author: Beman Dawes :Review Manager: Needed :Download: http://mysite.verizon.net/beman/endian-0.10.zip :Description: Header boost/integer/endian.hpp provides integer-like byte-holder binary types with explicit control over byte order, value type, size, and alignment. Typedefs provide easy-to-use names for common configurations. These types provide portable byte-holders for integer data, independent of particular computer architectures. Use cases almost always involve I/O, either via files or network connections. Although data portability is the primary motivation, these integer byte- holders may also be used to reduce memory use, file size, or network activity since they provide binary integer sizes not otherwise available. Meta State Machine ------------------ :Author: Christophe Henry :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?direction=0&order=&director… >`__ :Description: Msm is a framework which enables you to build a Finite State Machine in a straightforward, descriptive and easy-to-use manner . It requires minimal effort to generate a working program from an UML state machine diagram. This work was inspired by the state machine described in the book of David Abrahams and Aleksey Gurtovoy "C++ Template Metaprogramming" and adds most of what UML Designers are expecting from an UML State Machine framework: * Entry and Exit Methods * Guard Conditions * Sub state machines (also called composite states in UML) * History * Terminate Pseudo-State * Deferred Events * Orthogonal zones * Explicit entry into sub state machine states * Fork * Entry / Exit pseudo states * Conflicting transitions Conversion ---------- :Author: Vicente Botet :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=co… >`__ :Description: Generic explicit conversion between unrelated types. Boost.Conversion provides: * a generic ``convert_to`` function which can be specialized by the user to make explicit conversion between unrelated types. * a generic ``assign_to`` function which can be specialized by the user to make explicit assignation between unrelated types. * conversion between ``std::complex`` of explicitly convertible types. * conversion between ``std::pair`` of explicitly convertible types. * conversion between ``boost::optional`` of explicitly convertible types. * conversion between ``boost::rational`` of explicitly convertible types. * conversion between ``boost::interval`` of explicitly convertible types. * conversion between ``boost::chrono::time_point`` and ``boost::ptime``. * conversion between ``boost::chrono::duration`` and ``boost::time_duration``. Sorting ------- :Author: Steven Ross :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=al… >`__ :Description: A grouping of 3 templated hybrid radix/comparison-based sorting algorithms that provide superior worst-case and average-case performance to std::sort: integer_sort, which sorts fixed-size data types that support a rightshift (default of >>) and a comparison (default of <) operator. float_sort, which sorts standard floating-point numbers by safely casting them to integers. string_sort, which sorts variable-length data types, and is optimized for 8-bit character strings. All 3 algorithms have O(n(k/s + s)) runtime where k is the number of bits in the data type and s is a constant, and limited memory overhead (in the kB for realistic inputs). In testing, integer_sort varies from 35% faster to 8X as fast as std::sort, depending on processor, compiler optimizations, and data distribution. float_sort is roughly 7X as fast as std::sort on x86 processors. string_sort is roughly 2X as fast as std::sort. GIL.IO ------ :Author: Christian Henning :Review Manager: Needed :Download: `GIL Google Code Vault <http://gil-contributions.googlecode.com/files/rc2.zip >`__ :Description: I/O extension for ``boost::gil`` which allows reading and writing of/in various image formats ( tiff, jpeg, png, etc ). This review will also include the Toolbox extension which adds some common functionality to gil, such as new color spaces, algorithms, etc. AutoBuffer ---------- :Author: Thorsten Ottosen :Review Manager: Needed :Download: `Here <http://www.cs.aau.dk/~nesotto/boost/ auto_buffer.zip>`__ :Description: Boost.AutoBuffer provides a container for efficient dynamic, local buffers. Furthermore, the container may be used as an alternative to std::vector, offering greater flexibility and sometimes better performance. String Convert -------------- :Author: Vladimir Batov :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=bo… >`__ :Description: The library takes the approach of boost::lexical_cast in the area of string-to-type and type-to-string conversions, builds on the past boost::lexical_cast experience and advances that conversion functionality further to additionally provide: * throwing and non-throwing conversion-failure behavior; * support for the default value to be returned when conversion fails; * two types of the conversion-failure check -- basic and better/safe; * formatting support based on the standard I/O Streams and the standard (or user-defined) I/O Stream-based manipulators (like std::hex, std::scientific, etc.); * locale support; * support for boost::range-compliant char and wchar_t-based string containers; * no DefaultConstructibility requirement for the Target type; * consistent framework to uniformly incorporate any type-to-type conversions. It is an essential tool with applications making extensive use of configuration files or having to process/prepare considerable amounts of data in, say, XML, etc. Libraries under development =========================== Please let us know of any libraries you are currently developing that you intend to submit for review. Mirror ------ :Author: Matus Chochlik :Download: | http://svn.boost.org/svn/boost/sandbox/mirror/doc/index.html | `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=mi… >`__ :Description: The aim of the Mirror library is to provide useful meta-data at both compile-time and run-time about common C++ constructs like namespaces, types, typedef-ined types, classes and their base classes and member attributes, instances, etc. and to provide generic interfaces for their introspection. Mirror is designed with the principle of stratification in mind and tries to be as less intrusive as possible. New or existing classes do not need to be designed to directly support Mirror and no Mirror related code is necessary in the class' definition, as far as some general guidelines are followed Most important features of the Mirror library that are currently implemented include: * Namespace-name inspection. * Inspection of the whole scope in which a namespace is defined * Type-name querying, with the support for typedef-ined typenames and typenames of derived types like pointers, references, cv-qualified types, arrays, functions and template names. Names with or without nested-name-specifiers can be queried. * Inspection of the scope in which a type has been defined * Uniform and generic inspection of class' base classes. One can inspect traits of the base classes for example their types, whether they are inherited virtually or not and the access specifier (private, protected, public). * Uniform and generic inspection of class' member attributes. At compile-time the count of class' attributes and their types, storage class specifiers (static, mutable) and some other traits can be queried. At run-time one can uniformly query the names and/or values (when given an instance of the reflected class) of the member attributes and sequentially execute a custom functor on every attribute of a class. * Traversals of a class' (or generally type's) structure with user defined visitors, which are optionally working on an provided instance of the type or just on it's structure without any run-time data. These visitors are guided by Mirror through the structure of the class and optionally provided with contextual information about the current position in the traversal. I'm hoping to have it review ready in the next few months. Interval Template Library ------------------------- :Author: Joachim Faulhaber :Description: The Interval Template Library (Itl) provides intervals and two kinds of interval containers: Interval_sets and interval_maps. Interval_sets and maps can be used just as sets or maps of elements. Yet they are much more space and time efficient when the elements occur in contiguous chunks: intervals. This is obviously the case in many problem domains, particularly in fields that deal with problems related to date and time. Interval containers allow for intersection with interval_sets to work with segmentation. For instance you might want to intersect an interval container with a grid of months and then iterate over those months. Finally interval_maps provide aggregation on associated values, if added intervals overlap with intervals that are stored in the interval_map. This feature is called aggregate on overlap. It is shown by example: :: typedef set<string> guests; interval_map<time, guests> party; guests mary; mary.insert("Mary"); guests harry; harry.insert("Harry"); party += make_pair(interval<time>::rightopen(20:00, 22:00),mary); party += make_pair(interval<time>::rightopen_(21:00, 23:00),harry); // party now contains [20:00, 21:00)->{"Mary"} [21:00, 22:00)->{"Harry","Mary"} //guest sets aggregated on overlap [22:00, 23:00)->{"Harry"} As can be seen from the example an interval_map has both a decompositional behavior (on the time dimension) as well as a accumulative one (on the associated values). StlConstantTimeSize ------------------- :Author: Vicente J. Botet Escriba :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=consta… >`__ :Description: Boost.StlConstantTimeSize Defines a wrapper to the stl container list giving the user the chioice for the complexity of the size function: linear time, constant time or quasi-constant. In future versions the library could include a similar wrapper to slist. InterThreads ------------------- :Author: Vicente J. Botet Escriba :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=in… >`__ :Description: Boost.InterThreads extends Boost.Threads adding some features: * thread decorator: thread_decorator allows to define setup/cleanup functions which will be called only once by thread: setup before the thread function and cleanup at thread exit. * thread specific shared pointer: this is an extension of the thread_specific_ptr providing access to this thread specific context from other threads. As it is shared the stored pointer is a shared_ptr instead of a raw one. * thread keep alive mechanism: this mechanism allows to detect threads that do not prove that they are alive by calling to the keep_alive_point regularly. When a thread is declared dead a user provided function is called, which by default will abort the program. * thread tuple: defines a thread groupe where the number of threads is know statically and the threads are created at construction time. * set_once: a synchonizer that allows to set a variable only once, notifying to the variable value to whatever is waiting for that. * thread_tuple_once: an extension of the boost::thread_tuple which allows to join the thread finishing the first, using for that the set_once synchronizer. * thread_group_once: an extension of the boost::thread_group which allows to join the thread finishing the first, using for that the set_once synchronizer. (thread_decorator and thread_specific_shared_ptr) are based on the original implementation of threadalert written by Roland Schwarz. Boost.InterThreads extends Boost.Threads adding thread setup/cleanup decorator, thread specific shared pointer, thread keep alive mechanism and thread tuples.

2 1

[BGL]: How to delete whole sub-graph (tree in my case) ?
by Sachin Gaikwad 02 Jun '09

02 Jun '09

Hi all, I have a graph which is a tree actually. I need to delete the whole subtree given a vertex. Is there any interface to delete the whole subtree given the vertex ? or else, I will have to write a routine which does DFS and deletes each vertex/edge. Correct me if I am wrong: If I do clear_vertex(vertex_to_be_deleted, g) remove_vertex(vertex_to_be_deleted, g) I wont achieve what I want and I will get 2 disconnected graphs ? Thanks, Sachin

2 1

Boost.Asio extensible to non network i/o?
by Zachary Turner 01 Jun '09

01 Jun '09

I've been reading over the documentation for Boost.Asio and as far as I can tell the documentation makes no mention whatsoever about using Asio for anything other than sockets programming. Suppose I wanted to implemented a simple file transfer client (I say client because the server will not be in C++) that reads files off of the disk and sends them to the server. I'd like to do it asynchronously. What would be the basic steps needed to do this with Boost.Asio, if it is indeed even possible? I'd specifically like it to use I/O Completion Ports on Windows if possible, and whatever on Linux. I'd like to be able to configure the number of worker threads on the backend, so that for example I can read from N files at once, or from N different locations in the same file. I'd also like to have a single "controller" thread that receives all the events regarding when reads or writes complete, so that I don't have to use any kind of locking to synchronize things. As a final "nice-to-have", I'd like to be able to plug my own types of "actions" into the model, things that aren't really I/O but that I still want to execute asynchronously that would sit in between a completed disk read and the initiation of writing that same data to the socket. Think, for example, of encrypting the file before sending. I don't want to block on the encryption, so it would be nice if I could do that asynchronously and still be notified of its completion through the same interface. I know I can do all this directly in windows (which is the only system api i'm intimately familiar with) via IOCP, so I'm hoping something similar can be achieved with Boost.Asio. Thanks

5 5

Bug Sprint Report for Sunday, May 31st
by Marshall Clow 01 Jun '09

01 Jun '09

The boost bug sprint started Friday, May 29th, and runs through Sunday June 7th. Well, we've slowed down some, but we're still making progress. Status <https://svn.boost.org/trac/boost/report/1> 7:00 AM PDT 5/29: 797 open tickets. 7:45 AM PDT 5/30: 772 open tickets. 6:00 AM PDT 5/31: 761 open tickets. Activity: 5/29: 6 new tickets, 77 modifications, 25 tickets closed 5/30: 2 new tickets, 42 modifications, 17 tickets closed 5/31: 2 new tickets, 27 modifications, 8 tickets closed [ Numbers may not add up because I am counting via two different methods, using data that is time-stamped in two different time zones. Also, tickets can be closed and reopened. ] What can you do? See <https://svn.boost.org/trac/boost/wiki/BugSprintJune2009> for details. I've added four new reports to the trac: Open ticket count by owner: <https://svn.boost.org/trac/boost/report/18> Open ticket count by component: <https://svn.boost.org/trac/boost/report/19> Open ticket count by ticket type: <https://svn.boost.org/trac/boost/report/20> Open ticket count by milestone: <https://svn.boost.org/trac/boost/report/21> There's been a lot of discussion on the list about tickets; and there are about a dozen patches that have been tested and are ready to be applied. If you're looking to help, you can look at some of the older bugs, say, the ones for Boost 1.36, and determine if they still apply. If they do, note that in the ticket. --------- Sign-up sheet -------- The following people have committed to participate in the bug sprint. Please add you name here, along with what you can do. 1) Marshall Clow (coordination, Mac OS X characterization) 2) Beman Dawes (filesystem, system, timer) 3) Doug Gregor (function, graph, logic, mpi, numeric, property_map, signals) 4) "joel falcou" <joel.falcou(a)u-psud.fr> ( linux gcc testing/VC 2008 testing, patching) 5) Michael Caisse <boost(a)objectmodelingdesigns.com> (bug fixing) 6) Jeremiah Willcock <jewillco(a)osl.iu.edu> (will test and commit graph patches) 7) David Abrahams (iterator, python) 8) Sohail Somani (patches for g++ 4.2.4) 9) Steven Watanabe <watanabesj(a)gmail.com> (bug fixes, como) 10) vicente.botet" <vicente.botet(a)wanadoo.fr> 11) Stjepan Rajko <stjepan.rajko(a)gmail.com> (fusion) 12) Daniel Wallin (parameter, ...) -- -- Marshall Marshall Clow Idio Software <mailto:marshall@idio.com> It is by caffeine alone I set my mind in motion. It is by the beans of Java that thoughts acquire speed, the hands acquire shaking, the shaking becomes a warning. It is by caffeine alone I set my mind in motion.

2 2

Can I create Mfc Dialog from boost thread ?
by elizabeta petreska 01 Jun '09

01 Jun '09

Hello all Is it allowed to create mfc dialog or windows api dialog from boost thread, and if not is there a way to do that? Thanks

2 1

Boost.Process article: Tutorial and request for comments
by Boris Schaeling 01 Jun '09

01 Jun '09

I've written an article about Boost.Process: http://www.highscore.de/cpp/process/ I've also fixed a few bugs in Boost.Process (which is now 0.31): http://www.highscore.de/boost/process.zip And the latest source code can also be found in the sandbox: https://svn.boost.org/svn/boost/sandbox/process/ For developers not familar with Boost.Process the article is a tutorial to get more easily started. For developers familiar with Boost.Process it is a request for comments. I've been looking at the big picture finally trying to find out where and how Boost.Process should be changed and in which direction it should move to become a complete library one day. As not everyone will read the entire article here are my thoughts: 1) Boost.Process is based on a few concepts like 'process' and 'context'. While those make sense there are other concepts where I wonder if they should be dropped: * 'executable' is the executable name which in practice must be a std::string. I think the original idea was to support numerous string types. This leads to the question how to support different Unicode encodings which I think is still unanswered in the Boost community. Other libraries, eg. Boost.Interprocess, simply stick to one string type (typically std::string). * 'handle' is the underlying native file handle of a stream (file descriptor on POSIX systems, handle on Windows). The concept is based on a class in the detail namespace of Boost.Process. There is just one class and it's not meant to be used by users of the library either. Thus I'm not sure what's the benefit of having an explicit 'handle' concept at all. 2) Environment variables must be sorted on Windows but not on POSIX systems. On Windows the type environment could be a typedef for std::map and on POSIX systems for std::unordered_map. Currently it's always a typedef for std::map. Is that ok? Should it be changed? Should a macro be provided in case developers want to use different typedefs? 3) Currently Boost.Process is really only useful for creating child processes. It's not possible for example to detect and iterate over other processes on a system. I guess Boost.Process should be enhanced here. Then one day the well-known utility 'ps' on POSIX systems could be implemented in Boost C++. Any comments? 4) When a process is created the standard streams (stdin, stdout and stderr) are closed by default. Is this a good choice? If it isn't what should happen otherwise? Inherting standard streams (which is the default behavior with fork on POSIX systems)? 5) Boost.Process requires to specify an absolute path to an executable which should be started. There is a helper function which returns the absolute path for an executable name (it uses the environment variable PATH). The question is if this should be done automatically if no absolute path is given? 6) When a stream of a child process is captured Boost.Process automatically creates a pipe. As pipes don't support asynchronous operations on Windows a named pipe is required (called FIFO on POSIX systems). Currently a macro must be defined to make Boost.Process use a named pipe on Windows. It might make more sense to enable developers to choose either a pipe or a FIFO explicitly - not only on Windows but on all platforms. Any comments? 7) It's possible to capture and access streams of a child process. Those streams are derived from std::istream and std::ostream and thus only support blocking I/O operations. Currently the underlying handle has to be fetched to initialize a generic I/O object from Boost.Asio to use asynchronous I/O operations. How should the library be changed to make it easier to use asynchronous I/O? 8) There is a method wait() which makes it possible to wait for another process to exit. Currently wait() is provided by the class child though. Shouldn't it really be defined by the class process (so you can wait not only for child processes to exit)? 9) As wait() blocks an asynchronous alternative should be provided. 10) The Windows-specific classes all start with win32_ (eg. win32_child). Wouldn't it make more sense to use windows_ instead (like windows_child) or a windows namespace? First other libraries use windows_ (see Boost.Interprocess). Second there should be no reason why a class like win32_child can't be used on a 64-bit Windows. Boris

4 5

indirect_iterator,symmetric_matrix and ptr_vector
by Archie14 01 Jun '09

01 Jun '09

Following test fails to compile. Errors start with the first call to make_indirect_iterator. On the first glace on the error output it looks that indirect_iterators cannot be used together with ptr_vector and matrix. Is that correct? If I need to calculate the sum of all matrices in a vector - what is the right way to do it? void test() { typedef symmetric_matrix<double, lower> matrixofdoubles; boost::ptr_vector<matrixofdoubles> lst; boost::make_indirect_iterator(lst.begin()); // testing ind.iter. matrixofdoubles totalsum (10); std::accumulate( boost::make_indirect_iterator(lst.begin()), boost::make_indirect_iterator(lst.end()), totalsum, std::plus<matrixofdoubles>()); } Errors are: c:\Libraries\boost\boost_1_39_0\boost/pointee.hpp(30) : error C2039: 'element_type' : is not a member of 'boost::numeric::ublas::symmetric_matrix<T,TRI>' with [ T=double, TRI=boost::numeric::ublas::lower ] c:\Libraries\boost\boost_1_39_0\boost/mpl/eval_if.hpp(41) : see reference to class template instantiation 'boost::detail::smart_ptr_pointee<P>' being compiled with [ P=boost::numeric::ublas::symmetric_matrix<double,boost::numeric::ublas::lower> ] c:\Libraries\boost\boost_1_39_0\boost/pointee.hpp(69) : see reference to class template instantiation 'boost::mpl::eval_if<C,F1,F2>' being compiled with [ C=boost::detail::is_incrementable<boost::numeric::ublas::symmetric_matrix<doubl e,boost::numeric::ublas::lower>>, F1=boost::detail::iterator_pointee<boost::numeric::ublas::symmetric_matrix<doub le,boost::numeric::ublas::lower>>, .. etc.

2 1

google.stringencoders vs (boost.string_algo & boost.lexical_cast)
by Roman Shmelev 01 Jun '09

01 Jun '09

Hi! stringencoders are told to be 2x faster than std approaches. But what about boost? Has somebody tested the performance of both libraries? I mean toLower, toUpper, itoa, dtoa functions. Thank you

4 3

multi_array_ref (lack of) default constructor
by gtsml owevwr 01 Jun '09

01 Jun '09

Hi, Does anybody know why multi_array_ref doesn't have a default constructor? I'm asking because I wanted to make a multi_array of multi_array_ref and that doesn't seem to be possible because multi_array expect the element type to be default constructible. Thanks, Frank

3 6

Re: [Boost-users] boost::serialization and PHP websites
by Brian Wood 01 Jun '09

01 Jun '09

Pascal Kesseli writes: > Currently, I consider the > boost serialization a de-facto standard for C++ serialization issues. In 2007 it wasn't a stretch to say that General Motors was a de facto standard in the automobile industry. Now they want 70 billion from taxpayers. Oh my G-d! -- Brian Wood Ebenezer Enterprises www.webEbenezer.net "Then Samuel took a rock and set it up between Mizpah and Shen. He named it Ebenezer [Rock of Help] and said, 'Until now the L-RD has helped us.'"

5 15

Vector types in dynamic_properties used by write_graphml
by Richard Vock 31 May '09

31 May '09

He Folks, I'm using bundled properties in order to attach multiple attributes to graph nodes. Using only basic data types like integers, strings etc. the following example code works well. However I would like to also use vectors or similar containers (like in the example about bundled properties at http://www.boost.org/doc/libs/1_39_0/libs/graph/doc/bundles.html) However I don't know how to use this field for my dynamic_property map. In the following code the single commented-out line is the point where I most probably didn't understand some kind of vital concept. Maybe you could enlighten me or at least point me in the right direction, thanks in advance Richard Vock --- Here's the example code: #include <iostream> #include <boost/graph/adjacency_list.hpp> #include <boost/dynamic_property_map.hpp> #include <boost/graph/graphml.hpp> struct NodeProperties { int test; std::vector<int> ints; }; int main(int argc, char* argv[]) { typedef std::pair<int,int> Edge; std::vector< Edge > connections; // create simple edge loop for testing purposes for (int i=0; i<10; ++i) connections.push_back( Edge(i,(i+1)%10) ); typedef boost::adjacency_list< boost::vecS, boost::vecS, boost::undirectedS, NodeProperties> Graph; Graph g(connections.begin(), connections.end(), 10); boost::graph_traits<Graph>::vertex_iterator v, v_end; for (tie(v,v_end) = vertices(g); v != v_end; ++v) { Graph::vertex_descriptor desc = *v; g[desc].test = 10; for (int i=0; i<5; ++i) g[desc].ints.push_back(i); } boost::dynamic_properties dp; dp.property("test", get(&NodeProperties::test, g)); //dp.property("testInts", get(&NodeProperties::ints, g)); boost::write_graphml(std::cout, g, dp, true); }

1 0

Re: [Boost-users] Bug Sprint Report for Friday, May 29th
by Daniel James 31 May '09

31 May '09

2009/5/30 Marshall Clow <marshall(a)idio.com>: > The following bugs appear to have been fixed, but the tickets were never > closed. > I would appreciate it if the library maintainers could verify this and close > the tickets. > https://svn.boost.org/trac/boost/ticket/145 Iterator Oh, I just closed this as it's certainly fixed. Then I realised that it might have been mentioned on the list and found this. > The following tickets are feature requests that are unlikely ever to be > implemented. > Should they be closed? > https://svn.boost.org/trac/boost/ticket/558 database This one should definitely be closed as 'wontfix'. It's too open ended. There's a better place for ignoring library requests: https://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction#LibrariesW… > https://svn.boost.org/trac/boost/ticket/100 concept_check > https://svn.boost.org/trac/boost/ticket/182 concept_check I'd close there as well. They're very open ended and nothing to do with concept check. The allocator request could possibly be requested for other libraries. Anyway, they're so old I can't imagine requester has probably given up by now. Daniel

1 0

Boost.Unordered throws 64-bit portability warnings
by Lindley M French 31 May '09

31 May '09

I've noticed on Visual Studio 2005 that I get a slew of warnings from Boost/unordered/detail/hash_table_impl.hpp when I build with "Detect 64-bit portability issues" turned on. In particular at the moment I'm seeing the following warning: boost/unordered/detail/hash_table_impl.hpp(1569) : warning C4267: 'argument' : conversion from 'size_t' to 'unsigned int', possible loss of data And the same on lines 1328, 1569, 1541, 1799, and 1763. I doubt this poses a real problem, but with hash tables you never know. I'd prefer not to see warnings when I build. Can this be fixed, and can regression testing using this build setting be added to the mix in general?

3 5

stlport string vs. std string causing link errors - how to workaround?
by Chris Kruger 31 May '09

31 May '09

Hello everybody, I'm a relatively new user of boost and I have a problem. I believe I know what is causing the problem but I don't yet have a solution and I am looking for suggestions. I'm currently porting a product to Mac OSX. It makes use of both stlport and boost. I have got the software compiling happily enough but I have a couple of link errors that have stumped me for a bit. I believe the link problems are caused by the fact that boost was compiled using the stdlib included with gcc and the code in the product is using stlport. The boost methods causing problems both have stl strings in their arguments. The exact link errors I get is: 1. "boost::filesystem::detail::dir_itr_first(void*&, void*&, stlpmtx_std::basic_string<char, stlpmtx_std::char_traits<char>, stlpmtx_std::allocator<char> > const&, stlpmtx_std::basic_string<char, stlpmtx_std::char_traits<char>, stlpmtx_std::allocator<char> >&, boost::filesystem::file_status&, boost::filesystem::file_status&)" 2. "boost::filesystem::detail::status_api(stlpmtx_std::basic_string<char, stlpmtx_std::char_traits<char>, stlpmtx_std::allocator<char> > const&, boost::system::error_code&)" As you can see the linker is looking for methods that are using stlpmtx_std::basic_string ... i.e. the stlport string The library libboost_filesystem-xgcc40-1_36.dylib as expected contains these basic methods (confirmed by "nm libboost_filesystem-xgcc40-1_36.dylib") but no doubt with std::string I'm using boost 1_36 if that makes any difference and am quite happy to test any assumptions if you don't trust mine. TIA Chris K. http://www.coresoftware.net.au http://www.krugerheavyindustries.com

2 1

Bug Sprint Report for Saturday, May 30th
by Marshall Clow 31 May '09

31 May '09

The boost bug sprint started Friday, May 29th, and runs through Sunday June 7th. We're off to a great start! Status <https://svn.boost.org/trac/boost/report/1> 7:00 AM PDT 5/29: 797 open tickets. 7:45 AM PDT 5/30: 772 open tickets. 7:15 AM PDT 5/31: 763 open tickets. Activity: 5/29: 6 new tickets, 77 modifications, 25 tickets closed 5/30: 2 new tickets, 42 modifications, 17 tickets closed [ Numbers may not add up because I am counting via two different methods, using data that is time-stamped in two different time zones. Also, tickets can be closed and reopened. ] What can you do? See <https://svn.boost.org/trac/boost/wiki/BugSprintJune2009> for details. I've added four new reports to the trac: Open ticket count by owner: <https://svn.boost.org/trac/boost/report/18> Open ticket count by component: <https://svn.boost.org/trac/boost/report/19> Open ticket count by ticket type: <https://svn.boost.org/trac/boost/report/20> Open ticket count by milestone: <https://svn.boost.org/trac/boost/report/21> --------- Sign-up sheet -------- The following people have committed to participate in the bug sprint. Please add you name here, along with what you can do. 1) Marshall Clow (coordination, Mac OS X characterization) 2) Beman Dawes (filesystem, system, timer) 3) Doug Gregor (function, graph, logic, mpi, numeric, property_map, signals) 4) "joel falcou" <joel.falcou(a)u-psud.fr> ( linux gcc testing/VC 2008 testing, patching) 5) Michael Caisse <boost(a)objectmodelingdesigns.com> (bug fixing) 6) Jeremiah Willcock <jewillco(a)osl.iu.edu> (will test and commit graph patches) 7) David Abrahams (iterator, python) 8) Sohail Somani (patches for g++ 4.2.4) 9) Steven Watanabe <watanabesj(a)gmail.com> (bug fixes, como) 10) vicente.botet" <vicente.botet(a)wanadoo.fr> 11) Stjepan Rajko <stjepan.rajko(a)gmail.com> (fusion) 12) Daniel Wallin (parameter, ...) -- -- Marshall Marshall Clow Idio Software <mailto:marshall@idio.com> It is by caffeine alone I set my mind in motion. It is by the beans of Java that thoughts acquire speed, the hands acquire shaking, the shaking becomes a warning. It is by caffeine alone I set my mind in motion.

1 0

Re: [Boost-users] Boost Serialization + Forward compatibility [was Re: boost::serialization and PHP websites]
by Brian Wood 31 May '09

31 May '09

Robert Ramey writes: > Sohail Somani wrote: >> I also notice you have not mentioned anything about the 70 billion >> dollar bailout for the serialization library and spreading the >> wealth. I assume the cheque's in the mail. > I purposely overlooked that comment. It seemed to be an > attempt at some sort of criticism. I was pointing out how quickly things changed in the automobile industry. I don't think anyone would argue that the computer industry is less volatile than the automobile industry. I'm also dismayed by the government's investment of billions of dollars in General Motors. (I'm not sure if the amount is closer to 50 billion or 70 billion.) > It's absolutely amazing to > me how much I've been criticised (many times personally) > for making this library. I'm not sure if you are referring to me there. I have at times pointed out what I consider to be weaknesses of the serialization library. I don't think I've criticised you personally. Regards, Brian Wood Ebenezer Enterprises www.webEbenezer.net

3 2

boost::thread Compile error with Sun Studio 12
by Roman Morokutti 30 May '09

30 May '09

Hi, When I compile the example on the boost::thread documentation (the source is wrapped by a main function): #include <stdlib.h> #include <boost/thread.hpp> /* * */ int main(int argc, char** argv) { boost::system_time const timeout = boost::get_system_time() + boost::posix_time::milliseconds(500); extern bool done; extern boost::mutex m; extern boost::condition_variable cond; boost::unique_lock<boost::mutex> lk(m); while (!done) { if (!cond.timed_wait(lk, timeout)) { throw "timed out"; } } boost:: return (EXIT_SUCCESS); } I get the error CC -library=stlport4 -mt -c -g -I/opt/boost/boost_1_39_0 -o build/Debug/SunStudio-Solaris-x86/thread.o thread.cpp "/opt/boost/boost_1_39_0/boost/thread/detail/thread.hpp", line 344: Error: boost::thread::thread(boost::thread&) is not accessible from boost::move(boost::detail::thread_move_t<boost::thread>). 1 Error(s) detected. So could anyone tell me how to bypass this error, or should the library be updated? -Roman

3 11

[random] Bias in boost::random generators?
by Tiago de Paula Peixoto 30 May '09

30 May '09

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi, I'm experiencing a bug with the boost::random library. Apparently, most generators, together with uniform_int<>, produce heavily biased sequences. I'm sending attached a small test program which generates several random walks on a lattice, starting from the center, and counts how many times a site has been visited. It uses both the boost::random generators, and the tr1::random generators from GCC 4.3, and writes the separate counts in the files "bcount" and "tcount", respectively. A plot of the output with boost::random can be seen here: http://dl.getdropbox.com/u/280654/boost_random.png There is an obvious tendency towards the (0,0) corner of the lattice... With tr1::random, everything looks normal: http://dl.getdropbox.com/u/280654/tr1_random.png Not to mention I used the same generator (mt19937) with the same seed value in both cases, which should have given the exact same sequence! I obtain similar results with other generators, except with minstd_rand, where the sequences from both libraries are the same. This lead me to conclude that the problem is with the generators themselves, not with uniform_int<>. More info on my end: platform: x86_64 intel, GNU/Linux GCC: 4.3.3 Boost: 1.37 Best regards, Tiago -----BEGIN PGP SIGNATURE----- Version: GnuPG v2.0.11 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org iEYEARECAAYFAkoXu/8ACgkQBNxGHvNv411+4QCfSfgo1Mu1lROQhwPnGxtEoq51 C1MAn1GJi0BYVtyExFmfdsxvtpKOM/fk =CsWe -----END PGP SIGNATURE-----

3 6

Bug Sprint Report for Friday, May 29th
by Marshall Clow 30 May '09

30 May '09

The boost bug sprint started Friday, May 29th, and runs through Sunday June 7th. We're off to a great start! Status <https://svn.boost.org/trac/boost/report/1> 7:00 AM PDT 5/29: 797 open tickets. 7:45 AM PDT 5/30: 772 open tickets. Activity: 5/29: 6 new tickets, 77 modifications, 25 tickets closed [ Numbers may not add up because I am counting via two different methods, using data that is time-stamped in two different time zones ] What can you do? See <https://svn.boost.org/trac/boost/wiki/BugSprintJune2009> for details. I've added three new reports to the trac: Open ticket count by owner: <https://svn.boost.org/trac/boost/report/18> Open ticket count by component: <https://svn.boost.org/trac/boost/report/19> Open ticket count by ticket type: <https://svn.boost.org/trac/boost/report/20> Open ticket count by milestone: <https://svn.boost.org/trac/boost/report/21> The following bugs appear to have been fixed, but the tickets were never closed. I would appreciate it if the library maintainers could verify this and close the tickets. https://svn.boost.org/trac/boost/ticket/145 Iterator https://svn.boost.org/trac/boost/ticket/287 date_time The following tickets are feature requests that are unlikely ever to be implemented. Should they be closed? https://svn.boost.org/trac/boost/ticket/558 database https://svn.boost.org/trac/boost/ticket/100 concept_check https://svn.boost.org/trac/boost/ticket/182 concept_check --------- Sign-up sheet -------- The following people have committed to participate in the bug sprint. Please add you name here, along with what you can do. 1) Marshall Clow (coordination, Mac OS X characterization) 2) Beman Dawes (filesystem, system, timer) 3) Doug Gregor (function, graph, logic, mpi, numeric, property_map, signals) 4) "joel falcou" <joel.falcou(a)u-psud.fr> ( linux gcc testing/VC 2008 testing, patching) 5) Michael Caisse <boost(a)objectmodelingdesigns.com> (bug fixing) 6) Jeremiah Willcock <jewillco(a)osl.iu.edu> (will test and commit graph patches) 7) David Abrahams (iterator, python) 8) Sohail Somani (patches for g++ 4.2.4) 9) Steven Watanabe <watanabesj(a)gmail.com> (bug fixes, como) 10) vicente.botet" <vicente.botet(a)wanadoo.fr> 11) Stjepan Rajko <stjepan.rajko(a)gmail.com> (fusion) 12) Daniel Wallin (parameter, ...) -- -- Marshall Marshall Clow Idio Software <mailto:marshall@idio.com> It is by caffeine alone I set my mind in motion. It is by the beans of Java that thoughts acquire speed, the hands acquire shaking, the shaking becomes a warning. It is by caffeine alone I set my mind in motion.

1 0

[MPI / Serialization] unable to register user-defined class for serialization through base class pointer
by Ariel Ouziel 30 May '09

30 May '09

Hello, I've just started to try using Boost.MPI, but I'm facing problems with user-defined class serialization. Maybe I'm just missing something. Basically, I have a pure virtual class "task" with the method execute and I want to send classes that implement this interface through MPI. For this to work, I have to register derived class for serialization. Unfortunately, this causes compilation error under MSVC9.0. Here is my code : #include <iostream> #include <exception> #include <boost/mpi.hpp> #include <boost/serialization/string.hpp> #include <boost/serialization/export.hpp> class task { public: virtual void execute() = 0; }; class dtask : public task { public: dtask() {} dtask(std::string text) : text(text) {} virtual void execute() { std::cout << text << std::endl; } private: std::string text; friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & text; } }; BOOST_CLASS_EXPORT(dtask) int main(int argc, char* argv[]) { boost::mpi::environment env(argc, argv); boost::mpi::communicator world; try { if (world.rank() == 0) { task * t = new dtask("Blah"); world.send(1, 0, t); } else if (world.rank() == 1) { task * t; world.recv(0, 0, t); t->execute(); } } catch (std::exception &e) { std::cout << "Error : " << e.what() << std::endl; } return 0; } And the compilation error : 1>Compiling... 1>data_testbed.cpp 1>d:\grooviz\libs\boost_1_38\boost\mpi\datatype.hpp(184) : error C2664: 'boost::mpl::assertion_failed' : cannot convert parameter 1 from 'boost::mpl::failed ************boost::mpi::is_mpi_datatype<T>::* ***********' to 'boost::mpl::assert<false>::type' 1> with 1> [ 1> T=std::basic_string<char,std::char_traits<char>,std::allocator<char>> 1> ] 1> No constructor could take the source type, or constructor overload resolution was ambiguous 1> d:\grooviz\libs\boost_1_38\boost\mpi\detail\mpi_datatype_primitive.hpp(96) : see reference to function template instantiation 'MPI_Datatype boost::mpi::get_mpi_datatype<T>(const T &)' being compiled 1> with 1> [ 1> T=std::string 1> ] 1> d:\grooviz\libs\boost_1_38\boost\archive\detail\oserializer.hpp(95) : see reference to function template instantiation 'void boost::mpi::detail::mpi_datatype_primitive::save<T>(const T &)' being compiled 1> with 1> [ 1> T=std::string 1> ] 1> d:\grooviz\libs\boost_1_38\boost\archive\detail\oserializer.hpp(212) : see reference to function template instantiation 'void boost::archive::save_access::save_primitive<Archive,T>(Archive &,const T &)' being compiled 1> with 1> [ 1> Archive=boost::mpi::detail::content_oarchive, 1> T=std::string 1> ] 1> d:\grooviz\libs\boost_1_38\boost\archive\detail\oserializer.hpp(211) : while compiling class template member function 'void boost::archive::detail::save_non_pointer_type<Archive,T>::save_primitive::invoke(Archive &,const T &)' 1> with 1> [ 1> Archive=boost::mpi::detail::content_oarchive, 1> T=std::string 1> ] 1> d:\grooviz\libs\boost_1_38\boost\archive\detail\oserializer.hpp(294) : see reference to class template instantiation 'boost::archive::detail::save_non_pointer_type<Archive,T>::save_primitive' being compiled 1> with 1> [ 1> Archive=boost::mpi::detail::content_oarchive, 1> T=std::string 1> ] 1> d:\grooviz\libs\boost_1_38\boost\archive\detail\oserializer.hpp(282) : while compiling class template member function 'void boost::archive::detail::save_non_pointer_type<Archive,T>::invoke(Archive &,const T &)' 1> with 1> [ 1> Archive=boost::mpi::detail::content_oarchive, 1> T=std::string 1> ] 1> d:\grooviz\libs\boost_1_38\boost\archive\detail\oserializer.hpp(506) : see reference to class template instantiation 'boost::archive::detail::save_non_pointer_type<Archive,T>' being compiled 1> with 1> [ 1> Archive=boost::mpi::detail::content_oarchive, 1> T=std::string 1> ] 1> d:\grooviz\libs\boost_1_38\boost\mpi\detail\ignore_skeleton_oarchive.hpp(46) : see reference to function template instantiation 'void boost::archive::save<Archive,T>(Archive &,const T &)' being compiled 1> with 1> [ 1> Archive=boost::mpi::detail::content_oarchive, 1> T=std::string 1> ] 1> d:\grooviz\libs\boost_1_38\boost\archive\detail\interface_oarchive.hpp(64) : see reference to function template instantiation 'void boost::mpi::detail::ignore_skeleton_oarchive<Archive>::save_override<const T>(const T &,int)' being compiled 1> with 1> [ 1> Archive=boost::mpi::detail::content_oarchive, 1> T=std::string 1> ] 1> d:\grooviz\libs\boost_1_38\boost\archive\detail\interface_oarchive.hpp(72) : see reference to function template instantiation 'Archive &boost::archive::detail::interface_oarchive<Archive>::operator <<<const T>(T &)' being compiled 1> with 1> [ 1> Archive=boost::mpi::detail::content_oarchive, 1> T=std::string 1> ] 1> d:\grooviz\sandbox\test\data_testbed\data_testbed.cpp(30) : see reference to function template instantiation 'Archive &boost::archive::detail::interface_oarchive<Archive>::operator &<std::string>(T &)' being compiled 1> with 1> [ 1> Archive=boost::mpi::detail::content_oarchive, 1> T=std::string 1> ] 1> d:\grooviz\libs\boost_1_38\boost\serialization\access.hpp(109) : see reference to function template instantiation 'void dtask::serialize<Archive>(Archive &,const unsigned int)' being compiled 1> with 1> [ 1> Archive=boost::mpi::detail::ignore_skeleton_oarchive<boost::mpi::detail::content_oarchive> 1> ] 1> d:\grooviz\libs\boost_1_38\boost\serialization\serialization.hpp(74) : see reference to function template instantiation 'void boost::serialization::access::serialize<Archive,T>(Archive &,T &,const unsigned int)' being compiled 1> with 1> [ 1> Archive=boost::mpi::detail::ignore_skeleton_oarchive<boost::mpi::detail::content_oarchive>, 1> T=dtask 1> ] 1> d:\grooviz\libs\boost_1_38\boost\serialization\serialization.hpp(133) : see reference to function template instantiation 'void boost::serialization::serialize<Archive,T>(Archive &,T &,const unsigned int)' being compiled 1> with 1> [ 1> Archive=boost::mpi::detail::ignore_skeleton_oarchive<boost::mpi::detail::content_oarchive>, 1> T=dtask 1> ] 1> d:\grooviz\libs\boost_1_38\boost\archive\detail\oserializer.hpp(148) : see reference to function template instantiation 'void boost::serialization::serialize_adl<Archive,T>(Archive &,T &,const unsigned int)' being compiled 1> with 1> [ 1> Archive=boost::mpi::detail::ignore_skeleton_oarchive<boost::mpi::detail::content_oarchive>, 1> T=dtask 1> ] 1> d:\grooviz\libs\boost_1_38\boost\archive\detail\oserializer.hpp(140) : while compiling class template member function 'void boost::archive::detail::oserializer<Archive,T>::save_object_data(boost::archive::detail::basic_oarchive &,const void *) const' 1> with 1> [ 1> Archive=boost::mpi::detail::ignore_skeleton_oarchive<boost::mpi::detail::content_oarchive>, 1> T=dtask 1> ] 1> d:\grooviz\libs\boost_1_38\boost\archive\detail\oserializer.hpp(170) : see reference to class template instantiation 'boost::archive::detail::oserializer<Archive,T>' being compiled 1> with 1> [ 1> Archive=boost::mpi::detail::ignore_skeleton_oarchive<boost::mpi::detail::content_oarchive>, 1> T=dtask 1> ] 1> d:\grooviz\libs\boost_1_38\boost\archive\detail\oserializer.hpp(167) : while compiling class template member function 'const boost::archive::detail::basic_oserializer &boost::archive::detail::pointer_oserializer<Archive,T>::get_basic_serializer(void) const' 1> with 1> [ 1> Archive=boost::mpi::detail::ignore_skeleton_oarchive<boost::mpi::detail::content_oarchive>, 1> T=dtask 1> ] 1> d:\grooviz\libs\boost_1_38\boost\serialization\export.hpp(75) : see reference to class template instantiation 'boost::archive::detail::pointer_oserializer<Archive,T>' being compiled 1> with 1> [ 1> Archive=boost::mpi::detail::ignore_skeleton_oarchive<boost::mpi::detail::content_oarchive>, 1> T=dtask 1> ] 1> d:\grooviz\libs\boost_1_38\boost\serialization\export.hpp(72) : while compiling class template member function 'const boost::archive::detail::basic_pointer_oserializer &boost::archive::detail::export_impl<Archive,Serializable>::enable_save(boost::mpl::true_)' 1> with 1> [ 1> Archive=boost::mpi::detail::ignore_skeleton_oarchive<boost::mpi::detail::content_oarchive>, 1> Serializable=dtask 1> ] 1> d:\grooviz\libs\boost_1_38\boost\serialization\export.hpp(106) : see reference to class template instantiation 'boost::archive::detail::export_impl<Archive,Serializable>' being compiled 1> with 1> [ 1> Archive=boost::mpi::detail::ignore_skeleton_oarchive<boost::mpi::detail::content_oarchive>, 1> Serializable=dtask 1> ] 1> d:\grooviz\libs\boost_1_38\boost\serialization\export.hpp(105) : while compiling class template member function 'void boost::archive::detail::ptr_serialization_support<Archive,Serializable>::instantiate(void)' 1> with 1> [ 1> Archive=boost::mpi::detail::ignore_skeleton_oarchive<boost::mpi::detail::content_oarchive>, 1> Serializable=dtask 1> ] 1> d:\grooviz\libs\boost_1_38\boost\archive\detail\register_archive.hpp(27) : see reference to class template instantiation 'boost::archive::detail::ptr_serialization_support<Archive,Serializable>' being compiled 1> with 1> [ 1> Archive=boost::mpi::detail::ignore_skeleton_oarchive<boost::mpi::detail::content_oarchive>, 1> Serializable=dtask 1> ] 1> d:\grooviz\libs\boost_1_38\boost\serialization\export.hpp(128) : see reference to class template instantiation 'boost::archive::detail::_ptr_serialization_support<Archive,Serializable>' being compiled 1> with 1> [ 1> Archive=boost::mpi::detail::ignore_skeleton_oarchive<boost::mpi::detail::content_oarchive>, 1> Serializable=dtask 1> ] 1> d:\grooviz\libs\boost_1_38\boost\serialization\export.hpp(124) : while compiling class template member function 'const boost::archive::detail::guid_initializer<T> &boost::archive::detail::guid_initializer<T>::export_guid(const char *,boost::mpl::false_)' 1> with 1> [ 1> T=dtask 1> ] 1> d:\grooviz\sandbox\test\data_testbed\data_testbed.cpp(36) : see reference to class template instantiation 'boost::archive::detail::guid_initializer<T>' being compiled 1> with 1> [ 1> T=dtask 1> ] Note that if I remove the BOOST_CLASS_EXPORT(dtask), the program compiles fine but I get "unregistered class" exception at runtime. Note also that if I use dtask pointer instead of task with send and recv, the program runs fine. Additionaly, if I use primitive type like "int" instead of std::string in my derived class, the compilation goes fine with the export statement. It seems to me that at some point the compiler tries to get the MPI datatype of std::string even if it shouldn't since it's not a primitive type. What am I missing here ? Thank you in advance, Ariel Ouziel

2 1

Boost.Thread: static lib vs dll - what's the current recommendation?
by Dave Burnard 29 May '09

29 May '09

In a large project, we're currently building the thread library as a dll. We're bringing in a new subcomponent that is also building the thread library as a dll. Various issues ensue - we need to eliminate one of them. One solution is to have the subcomponent use a static version of the thread library, or we can try to make the two dlls "identical" so we only need one copy. Regarding the static linkage option, I have read in various places that dll linkage was recommended for the thread library because of thread local storage issues. Those emails were a couple of years old so I am wondering if that has been resolved in the mean time. We're currently using v37 if that matters. Dave Burnard please CC me off-list as I am not a regular boost-users reader.

1 0

make_argpack(vec_kwd, make_vector(arg[0], ..., arg[n-1]))
by er 29 May '09

29 May '09

Hi All, Any suggestion for this? typedef typename mpl::transform<range_c<0,n>,meta::kwd >::type vec_kwd_t; arg_list< tagged_argument<tag<0>,A<0> >, ... arg_list< tagged_argument<tag<n-1>,A<n-1> >, empty_arg_list > > make_argpack(vec_kwd,make_vector(arg[0],...,arg[n-1])){ // Step 1: get a vector of tagged_argument vec_tagged_arg_t vec_tagged_arg = fusion::transform( kwds, args, binary_f() ); //OK // Step 2: // recursively construct args_list_t from vec_tagged_arg using // arg_list(TaggedArg arg, Next const& tail) // : Next(tail) // // , arg(arg) // // {} // // A little tedious. Before I go ahead : is this the proper way? // A better solution altogether? } Thanks.

2 4

[Graph] how best to submit patch?
by Tim Keitt 29 May '09

29 May '09

I would like to submit a patch for the Graph library. (This is the iterator splitting issue I raised some time ago.) So what is the procedure? 1) check out source from sourceforge SVN (done) 2) make changes 3) run tests??? (what is the best way to ensure the behavior has not changed?) 4) generate the patch (use svn diff?) 5) submit somewhere I just want to be sure I'm pulling the correct tree and there is some means to run regressions on my changes. Thanks. THK -- Timothy H. Keitt Associate Professor Section of Integrative Biology University of Texas at Austin http://www.keittlab.org/

3 3

Boost.iostreams to stream stderr/stdout from forked shell command?
by Andrej van der Zee 29 May '09

29 May '09

Hi, I was wondering if it is possible with boost iostreams to stream stderr/stdout of a forked shell program to the parent process, and use it as an iostream. I could not find anything like this in the documentation or examples. Does anybody has some working code that does just this? Thank you, Andrej

2 1

The Boost Bug Sprint is here!
by Marshall Clow 29 May '09

29 May '09

The boost bug sprint starts today Friday, May 29th, and runs through Sunday June 7th. Status 5/29: 812 open tickets. The goal is to address a large number of open bugs/patches/feature requests in the Trac system at <http://svn.boost.org/trac/report/1>. There are currently 812 open tickets; we'd like to knock that number down _a lot_. What can you do? 1) You can fix bugs. * If you are a library maintainer, you can commit your fixes. ;-) * If you are not a library maintainer, you can fix a problem on your local machine (and test it!!), and then attach your fix as a patch to the Trac ticket for the library maintainer to commit. If you do this, please provide a test case that exercises the problem; i.e, one that fails w/o your patch, and succeeds afterwards. 2) You can characterize bugs. * You can attempt to replicate the bug on your system(s), and attach information that you discover to the Trac ticket. This will make it easier for other people to solve the problem, even if you cannot. * You can write test cases demonstrating the problem, and attach them to the Trac ticket. * You can determine if the bug still exists; sometimes they get fixed, and the ticket never gets closed. In this case, try to identify a checkin that addresses the bug; it's always suspicious when bugs go away "by accident." 3) You can test patches. * Some of the tickets in the Trac system contain patches - some are quite old. You can install these patches on your system, and determine if they (a) build, and (b) work. If you do this, please provide detail. Don't just say "works for me" - say "I installed this over revision XXX on system YYY with compiler ZZZ. The patch installed and compiled successfully, and passed all the tests." * You can write test cases for the patches, and attach them to the ticket. 4) You can help implement new features. * There are a whole set of "feature requests" in the Trac system. If you have an idea about one of these, you can add comments to the Trac system. You can attempt to implement these new features, and attach the patch to the ticket. (Don't forget the test cases!!). Every day during the bug sprint, I'll post the # of tickets modified/closed/opened on the previous day, as well as the total number of open tickets. If you aren't sure where to start, you can verify existing patches. Here are a list of patches that have been open at least six months. [ Note: The URL for ticket number XXXX is https://svn.boost.org/trac/boost/ticket/XXXX ] Bug # Library Description 2603 smart_ptr patch for owner_before and owner_less support with shared_ptr/weak_ptr 2581 mpi MPI tutorial sample has missing includes 2509 string_algo case conversion (to_upper) fails in Codegear C++Builder 5.9.3 2484 bimap Const-overload needed for bimap associative_container_adaptor::count() 2482 concept_check msvc-9.0 unreferenced formal parameter warning when using boost::breadth_first_visit 2454 fusion Fusion - MSVC level 1 warnings 2452 fusion Fusion vector warning 4512 supression would be nice, 2390 test "[patch] fix gcc-4.3 ""unused"" warning in floating_point_comparison" 2370 lexical_cast [lexical_cast] Patch to reduce warnings for CodeGear (Borland) 2351 spirit Minor BOOST_SPIRIT_RULE fixes (rule_parser.hpp) 2312 smart_ptr intrusive_ptr::operator= should have by-value argument 2304 spirit Patch to fix warnings in spirit 2297 mpl Workaround for GCC bug 2290 serialization Patch for GCC-4.0.1 compatibility (and better compile time). 2271 serialization Cannot load version 1.35.0 xml archives that contain vectors of primitive types 2208 Python Pyste can use ElementTree from Python 2.5 2149 date_time Updated Daylight Savings Time for Australia/Perth 2142 Python Patch for boost.python - return_pointee_value, 2114 none Patch for export symbols from shared library 2064 tokenizer Interval notation is wrong in tokenizer documentation 2053 threads porting boost to avr32 linux platform 1947 iterator traversal access decoupling 1861 date_time time_duration type can not be correctly written or read of the period spans 24 hours of more (vc9 and probably others). 1850 thread request for unlock_guard (and/or unique_unlock) to compliment lock_guard/unique_lock 1811 Building Boost Help packaging by supporting DESTDIR 1791 lexical_cast fix warning on MSVC warning level 4 1702 random serialization for Mersenne twister 1681 filesystem patch for NTFS symbolic links 1541 parameter [parameter] Patch for missing includes 1535 function [result_of] remove unneeded headers 1534 build Add support for winsdk 6.1.6000 to Boost.Build.v2 1533 iterator boost/function.hpp unneeded in transform_iterator.hpp 1529 fusion Missing include statement 1521 bimap Missing #include statements 1519 iterator lvalue-ness resurrection in transform_iterator 1437 random "normal_distribution.hpp, improvements to distribution and possibly speed" 1418 serialization polymorphic archive performance improvement 1377 GIL Add ability to save RGBA image as TIFF with associated-alpha (premultiplied) transparency channel. 1341 asio unused argument and another g++ warning 1338 numeric g++ warnings and incomplete header inclusions 1271 Python unused parameter warning in release build 1116 build disable some warnings in msvc build 1066 Python Patch to make Boost.Python compile on SunCC 1049 mpl Getting mpl/has_xxx.hpp to compile on AIX 1020 iterator Boost.Iterator proposal to add is_constant_iterator 903 Python inconsistent usage of function pointer typedefs 868 thread [thread] thread_specific_ptr::element_type ? 864 lambda [lambda][utility] Make lambda support result<> 863 [parameter] fix operator|| for lazy binding 861 parameter Detect nested template members with has_template_xxx,mpl 857 Python add shared_ptr< const T> support 827 date_time Unused variable in format date parser, 802 thread [thread] MSVS: Allow use of thread headers with /Za 761 mpl [mpl] evc4 port 717 Python Add operator for __repr__ similar to __str__ 637 mpl Adjusts mpl::pair concept to be compatible with STL pairs --------- Sign-up sheet -------- The following people have committed to participate in the bug sprint. Please add you name here, along with what you can do. 1) Marshall Clow (coordination, Mac OS X characterization) 2) Beman Dawes (filesystem, system, timer) 3) Doug Gregor (function, graph, logic, mpi, numeric, property_map, signals) 4) "joel falcou" <joel.falcou(a)u-psud.fr> ( linux gcc testing/VC 2008 testing, patching) 5) Michael Caisse <boost(a)objectmodelingdesigns.com> (bug fixing) 6) Jeremiah Willcock <jewillco(a)osl.iu.edu> (will test and commit graph patches) 7) David Abrahams (iterator, python) 8) Sohail Somani (patches for g++ 4.2.4) 9) Steven Watanabe <watanabesj(a)gmail.com> (bug fixes, como) 10) vicente.botet" <vicente.botet(a)wanadoo.fr> 11) Stjepan Rajko <stjepan.rajko(a)gmail.com> (fusion) 12) Daniel Wallin (parameter, ...) -- -- Marshall Marshall Clow Idio Software <mailto:marshall@idio.com> It is by caffeine alone I set my mind in motion. It is by the beans of Java that thoughts acquire speed, the hands acquire shaking, the shaking becomes a warning. It is by caffeine alone I set my mind in motion.

1 1

[BGL] Dynamic property map containing pointers to custom object
by Leonardo Ciman 29 May '09

29 May '09

Hi, i tried to build a property map using the associative_property_map and putting a poiter to a pure virtual class as value type but i had some error i can't understand. I also tried with a normal class pointer and i had the same problem. /usr/include/boost/dynamic_property_map.hpp:202: error: no match for ‘operator<<’ in' out << boost::get ... I'm new to boost and c++, it's likely that i've done some stupid errors. I hope somebody can help me. That's a test that reproduce the problem: f#include <boost/graph/adjacency_list.hpp> #include <boost/dynamic_property_map.hpp> #include <boost/property_map.hpp> #include <map> #include <iostream> typedef boost::adjacency_list<boost::vecS,boost::vecS,boost::undirectedS>Graph; typedef boost::graph_traits<Graph>::vertex_descriptor vertex_descriptor; class Interface { virtual void test()=0; }; class Implement : Interface { void test(){std::cout << "ok" <<std::endl;} }; int main() { std::map<vertex_descriptor,Interface&>* testmap = new std::map<vertex_descriptor, Interface&>; boost::associative_property_map<std::map<vertex_descriptor,Interface&> > test_map(*testmap); boost::dynamic_properties dp; dp.property("test", test_map); //that's the line that cause the problem Implement i; put("test", dp, 0, i); }

1 0

ublas: tridiagonal with diagonal=upper+lower
by Hicham Mouline 29 May '09

29 May '09

Hello, Is there a special name for tridiagonal matrices that have the property: a(i,i) = a(i, i-1) + a(i, i+1) where the first index is the row, and the 2nd is the column. Do these matrices have special properties? Regards,

1 0

[Date Time] Howto get current time zone
by Bo Karlsson 29 May '09

29 May '09

Hello! Does anyone know how I can get the current time zone (configured in the OS) using the date time library? I need this to convert a UTC time value to the users local time zone. Thanks! /Bo

1 0

make_shared and custom deleter
by Dominique Devienne 28 May '09

28 May '09

I was thinking of using the new make_shared, but I'm already using a custom deleter (shared instances have private destructora and declare the custom deleter as a friend, and new instances are returned wrapped in shared_ptr, thus no explicit new or delete should be possible). Looking at make_shared, I can't see a way to use both at the same time. Am I out of luck? Thanks, --DD

2 2

Re: [Boost-users] Integral type with no upper limit?
by Robert Dailey 28 May '09

28 May '09

On Thu, May 28, 2009 at 7:59 AM, Barend Gehrels <Barend.Gehrels(a)geodan.nl>wrote: > Hi Robert, Francesco, > > I sent (to the other (developers) list) this: If the boost library did decide to implement and add its own limitless integer type, Couldn't this be added to part of the Boost.Math library?

2 1

Re: [Boost-users] Integral type with no upper limit?
by Scott McMurray 28 May '09

28 May '09

2009/5/26 Marshall Clow <marshall(a)idio.com>: > At 1:00 AM +0200 5/27/09, Michiel Helvensteijn wrote: >> >> Perhaps Boost shouldn't reinvent the wheel? There's already an open-source >> arbitrary precision arithmetic library: http://gmplib.org/ > > Which says: > GMP is distributed under the GNU LGPL. This license makes the library > free to use, share, and improve, and allows you to pass on the result. The > license gives freedoms, but also sets firm restrictions on the use with > non-free programs. > > There are people using Boost for both free and non-free programs. > It's my understanding that we (Boost) want to continue to support all of > them. > Personally, I think Boost would be best served providing some sort of expression template wrapper into which different arbitrary-precision numbers could be plugged. That would mean far less work to get something usable, as it could use the GMP implementation initially. Then a BSL version of the implementation could be developed incrementally, while non-floss users could license some implementation to use with the Boost interface.

6 6

[Boost.serialization] unexpected bad_cast exception while deserializing some arbitrary instances (e.g.: ar & data) ...
by Francois Mauger 28 May '09

28 May '09

Hi serializers! Let me present my problem: I have a class, named 'io_factory', that enables to deserialize an arbitrary object from a text (or XML) archive using the following '__load_text' template method: -8<--------------------------------------------------------------------- class io_factory { ... template <typename Data> void __load_text (boost::archive::text_iarchive & ar_, Data & data_) { Data & b = data_; std::cerr << "DEVEL: io_factory::__load_text: archive class name='" << typeid (ar_).name () << "'" << std::endl; std::cerr << "DEVEL: io_factory::__load_text: class name='" << typeid (b).name () << "'" << std::endl; try { /* Here I may experience an unexpected exception * only in very special circumstances: */ ar_ >> b; std::cerr << "DEVEL: io_factory::__load_text: deserialization is ok." << std::endl; } catch (std::exception & x) { std::cerr << "DEVEL: io_factory::__load_text: EXCEPTION=" << x.what () << std::endl; } std::cerr << "DEVEL: io_factory::__load_text: done" << std::endl; } ... }; -8<--------------------------------------------------------------------- I wrote a shared library that makes use of this template code segment. Using a test program, as I try to deserialize an instance of some 'nemo3::ana_event' class from a Boost text archive file, it prints: -8<--------------------------------------------------------------------- DEVEL: io_factory::__load_text: archive class name='N5boost7archive13text_iarchi veE' DEVEL: io_factory::__load_text: class name='N5nemo39ana_eventE' <= ok 'nemo3::ana_event' DEVEL: io_factory::__load_text: deserialization is ok. <==== IT WORKS! DEVEL: io_factory::__load_text: done -8<--------------------------------------------------------------------- This is fine! My object is properly loaded from the file. My test program works as expected. Well, now, I also have a Python module that wraps some C++ code and the 'io_factory' class. I use Boost.Python to do that. When I run my Python program, importing this wrapper module, to deserialize the same Boost text archive file from the python shell; it prints: -8<--------------------------------------------------------------------- ... DEVEL: io_factory::__load_text: archive class name='N5boost7archive13text_iarchiveE' DEVEL: io_factory::__load_text: class name='N5nemo39ana_eventE' DEVEL: io_factory::__load_text: EXCEPTION=std::bad_cast <= OOOOPS! DEVEL: io_factory::__load_text: done ... -8<--------------------------------------------------------------------- As you can see, there is a nasty 'std::bad_cast' thrown exception from the "ar_ >> b;" statement. This code works perfectly in the first case, now something is broken and I cannot figure out what! I am really confused by this issue. I already used exactly the same approach within another library (also based on Boost.serialization and Boost.Python) and I never met any problem. More, I also have a smaller python script that uses the same wrapper module with the same input archive file and it works: I can read all the instances I stored in my archive file! If I use an XML archive, the problem is exactly the same: it works in the first case, not in the last one. I do not understand where this 'bad_cast' exception comes from. For me it as nothing to do with: - the format of the archive (I know the archive file is ok as the test program store/load is properly) - the wrapping within Python (I can make it run ok within a sample python script) I really need a hint that could help me to understand this issue. It seems this problem looks like a side-effect (?) anyway the deep reason is outside of the scope of my code and my knowledge. My config is: * OS: Ubuntu Linux 8.04 * Linux Kernel: $ uname -a Linux mauger-laptop 2.6.24-24-generic #1 SMP Wed Apr 15 15:54:25 UTC 2009 i686 GNU/Linux * Boost: $ boost-config --version 1_38_0 * gcc: $ g++ --version g++ (GCC) 4.2.4 (Ubuntu 4.2.4-1ubuntu3) * Python 2.5 I'd really appreciate your comments. I'm afraid I cannot send a small sample code that could reproduce this 'bug' in a simpler way as it comes only at a quite high level on top of 3 big shared libraries + Boost + Python. My attempt to isolate some critical code to see this side-effect within "Boost.serialization only" or "Boost.Python only" failed. More it confirms that the code works as expected (hum... or seems to work...). Thanks a lot for your help. regards frc -- François Mauger Département de Physique - Université de Caen Basse-Normandie courriel/e-mail: mauger(a)lpccaen.in2p3.fr tél./phone: 02 31 45 25 12 / (+33) 2 31 45 25 12 fax: 02 31 45 25 49 / (+33) 2 31 45 25 49 Adresse/address: Laboratoire de Physique Corpusculaire de Caen (UMR 6534) ENSICAEN 6, Boulevard du Marechal Juin 14050 CAEN Cedex FRANCE

4 5

[boost::serialization] string serialization
by Bob Walters 28 May '09

28 May '09

I've been trying to use boost::serialization to serialize non-standard strings. Specifically, std::basic_string with a non-standard allocator type, and in another case, boost::interprocess::basic_string. Looking at how std::string serialization was enabled in serialization/string.hpp, I thought I would try to broaden that approach by using a specialization of the implementation_level template as follows: namespace boost { namespace serialization { template <typename C, class T, class A> struct implementation_level< std::basic_string<C,T,A> > { typedef mpl::integral_c_tag tag; typedef mpl::int_< boost::serialization::primitive_type > type; BOOST_STATIC_CONSTANT( int, value = implementation_level::type::value ); }; } // namespace } // namespace I've tried also adding wraper traits (also in boost::serialization namespace): template<typename C, class T, class A> struct is_wrapper< std::basic_string<C,T,A> > : mpl::true_ {}; Serialization of these strings is compiling, and running. At first it looked like it worked, but not quite. Specifically: when the string in question is 16 bytes or less in size (including the \0), the string serializes fine. When longer than that, its value appears to be completely truncated. (I'm looking at the dump of a binary_oarchive.) This isn't the case for std::string, but I'm having a problem figuring out why. I realize this is an unconventional scenario, but any assistance on how to make the support for string serialization apply to more than just std::string is appreciated. (Perhaps this should be ticketed as a feature request?)

1 0

[ASIO] Deadlock during static destruction
by Dan Eaton 28 May '09

28 May '09

Hello, I'm using boost::asio on WinXP64, with boost 1.39. My app is deadlocking during destruction of a static object that has an io_service member variable. If I explicitly delete the static object, no deadlock occurs. The static object is actually a shared_pointer, which points to the object I mentioned above. So at exit, assuming I haven't explicitly deleted the object, once the reference count reaches zero, delete is called, and the process deadlocks. The offending piece of code appears to be in win_thread.hpp:143. void join() { ::WaitForSingleObject(exit_event_, INFINITE); ::CloseHandle(exit_event_); if (terminate_threads()) { ::TerminateThread(thread_, 0); } else { ::QueueUserAPC(apc_function, thread_, 0); ::WaitForSingleObject(thread_, INFINITE); } } It is blocked at ::WaitForSingleObject(exit_event_, INFINITE); (This is as a result of the destruction of the io_service member). In case it's significant, the io_service object is used to establish several socket connections (to and from remote hosts), some of which are through socket.connect, and others through socket.connect_async. Thanks! Danny

2 1

[thread] getting thread id number
by Hipatia 27 May '09

27 May '09

Hi! I'm trying to get the id number of a thread just to write it to the standard output. Since I'm not an expert in c++ programming, let me explain what I do (even if it's quite simple): a create an instance as follows, boost::thread::id thread_id= boost::this_thread::get_id(); By debugging my code with Visual Studio, I see that 'thread_id' has an 'unsigned int' object member called 'id', so I would like to display this value. Unfortunately, I cannot find in the boost documentation any function member of boost::thread::id class that returns its value. Thanks, Hipatia. -- View this message in context: http://www.nabble.com/-thread--getting-thread-id-number-tp23222717p23222717… Sent from the Boost - Users mailing list archive at Nabble.com.

5 6

[threads] calling unlock twice
by Ovanes Markarian 27 May '09

27 May '09

Hello *, I wrote a code which used a RAII idiom to lock multiple mutex instances in ctor and unlock them in dtor. This resulted in the class similar to: struct lock_many { lock_many(mutex& m1, mutex& m2, ...) : m1_(m1), ... { boost::lock(*m1_, *m2_, ...); } ~lock_many() { //some asserts here, which ensure that either all mutex pointers are NULL or unequl to each other if(m1_==NULL && m2_==NULL && ...) return; // all are NULL no unlock needed } private: mutex* m1_; mutex* m2_; };

3 3

[asio] socket_types.hpp defines _WIN32_WINNT under Windows Mobile
by Tom Aylesworth 27 May '09

27 May '09

The socket_types.hpp defines _WIN32_WINNT to 0x0501 if neither _WIN32_WINNT nor _WIN32_WINDOWS are defined. However, under Windows Mobile, _WIN32_WINNT should not be defined. It appears this is only being used to determine the value for max_iov_len: # if defined(_WIN32_WINNT) const int max_iov_len = 64; # else const int max_iov_len = 16; # endif So I think that the original test should also test for _WIN32_WCE, so that _WIN32_WINNT is not defined under Windows Mobile: # if !defined(_WIN32_WINNT) && !defined(_WIN32_WINDOWS) && !defined(_WIN32_WCE) Does anyone know what max_iov_len should be set to under Windows Mobile 5, or how I might be able to find out? I assume it's safer to leave it at the lower value (16) for now, but it would be nice to have it set correctly. Thanks, Thomas Aylesworth Senior Software Engineer RealityMobile http://www.realitymobile.com/ 703.636.7202 office 703.209.1081 mobile

1 0

[Boost.MPI] SendingReceiving an array "view"
by Joel Falcou 27 May '09

27 May '09

I have a small class view<T> that containes a T* and a size. When I send/receive view using Boost.MPI, I want transfert the actual n data pointed by the view pointer and send the size. On receiving, i will receive the size, checks if they are compatible and receive the data into the zone pointed by the pointer of the receiving view. Of course, I may do something more complex than send/Receive, like all_2_all etc. So i was thinking to give view<T> a proper serialize function so boost.serialization may kick in. As the behavior of sending and receiving is different, I use the load/save idiom to separate the behavior. The question is then, how to serialize the n elements poitned by a raw pointer to those data in an efficient way ? Regards

4 4

Integral type with no upper limit?
by Robert Dailey 27 May '09

27 May '09

Is there an integral type in Boost that has no upper limit? The only physical limit would be the amount of memory on the system. And of course, the larger the number, the heavier the math is on such an object, because more cycles are required.

4 4

transform_iterator causing strange problems
by Lindley M French 27 May '09

27 May '09

I'm not sure if this is the fault of transform_iterator----I really don't see how it could be----but I'm really confused here. I've got an unordered_map<GroupID, Group> (typedefed to GroupMap) in my class. The specifics of those types don't matter except that GroupID is an integral type, and Group contains a std::vector vec. I'm trying to use a transform_iterator so that my class may be viewed as a group container: typedef boost::transform_iterator<GroupSelector, GroupMap::const_iterator> const_iterator; const_iterator begin() const { return boost::make_transform_iterator(currgroups.begin(),GroupSelector()); } const_iterator end() const { return boost::make_transform_iterator(currgroups.end(),GroupSelector()); } std::pair<const_iterator, const_iterator> groups() const { const Group &grp = *(begin()); return std::make_pair(begin(),end()); } Where my GroupSelector class is defined as struct GroupSelector { typedef const Group& result_type; const Group& operator()(const std::pair<GroupID, Group> &p) const { std::cout << p.second.vec.size() << " " << &p.second << std::endl; return p.second; } }; Note the output statement. Now, the usage in my main function is for (tie(iter,end) = final.groups(); iter != end; ++iter) { const Group& grp = *iter; cerr << &grp << endl; cerr << grp.segs.size() << endl; ... My output is 10 0012F50C 10 0012F65C 0012F65C 1243176 which is strange for two reasons. The first line comes from GroupSelector when I dereference begin() in the groups() function. The second comes from GroupSelector when I dereference iter in main. As these should both correspond to the same iterator, I can't understand why the address of the returned Group reference is different. The 3rd and 4th lines are outputted in main. Here's the second confusion: The address for the Group object is the same as in the most recent GroupSelector output, yet now the size of the vector within the Group comes out wrong. HUH?

5 8

Re: [Boost-users] [BGL] Trying to use subgraph
by Lindley M French 27 May '09

27 May '09

My inbox was full so I had to grab the response off the archive, hence the lack of quote. However, this: typedef boost::property<edge_index_t, size_t, EdgeProperties> EdgePropWithIndex; .... typedef boost::subgraph< boost::adjacency_list< boost::vecS,// Use list for edges boost::vecS,// Use vector for nodes boost::undirectedS,// Undirected graph SegIndex,// Nodes are segments EdgePropWithIndex// Edges have weights > > BoostGraph; still gives me compile errors: error C2065: 'edge_index_t' : undeclared identifier error C3203: 'property' : unspecialized class template can't be used as a template argument for template parameter 'EdgeProperty', expected a real type On a (possibly) related note, I'm trying to use the above subgraph in kruskal_minimum_spanning_tree(), but it's giving me an error about error C2039: 'vertex_bundled' : is not a member of 'boost::subgraph<Graph>' I'm quite sure this error didn't appear before I started trying to use the subgraph adapter.....any idea what's wrong?

2 19

symmetric_matrix operation
by Archie14 26 May '09

26 May '09

I am very new to the whole Ublas library. I have two symmetric matrices and I need to divide each element of the first matrix to the element in the second matrix. I am now doing smth like this: int _matrixsize; symmetric_matrix<double> mfirst(_matrixsize); symmetric_matrix<double> msecond(_matrixsize); symmetric_matrix<double> ratio (_matrixsize); for (int ifirst = 0; ifirst < _matrixsize; ifirst++) for (int isecond = 0; isecond < _matrixsize; isecond++) ratio(ifirst, isecond) = mfirst(ifirst, isecond) / msecond (ifirst, isecond); My questions are: 1. Can I use iterators (begin1, begin2) and if yes, then how? Examples in the doc use above method of iterating through elements, without using iterators. 2. I did not find built-in operators in the symmetric_matrix to do this division, but may be I overlooked smth or did not understand the docs? 3. If matrix "msecond" contains zeros - what is the "boost-way" to deal with this?

2 2

Re: [Boost-users] [Serialization] Guard against attempting to deserialize the wrong type
by Dan Eaton 26 May '09

26 May '09

Robert, Could you please clarify what you mean by that? Do you mean the first and last tags of the archive are checked? I can't reproduce that behaviour either. int foo = 1; unsigned int bar =1; // create stream & output xml archive oarchive << BOOST_SERIALIZATION_NVP(foo); // create input xml archive from stream iarchive >> BOOST_SERIALIZATION_NVP(bar); This deserializes happily. Thanks, Danny From: Dan Eaton Sent: Monday, May 25, 2009 1:30 PM To: 'boost-users(a)lists.boost.org' Subject: [Serialization] Guard against attempting to deserialize the wrong type Hello, I'm just wondering if NVP/XML archives check the name during deserialization? I just had a problem whereby I tried deserializing an object to one type, but the archive actually contained a different (larger ) object type. The first serialized element of the object just so happened to be an unsigned int, and I was trying to deserialize an enum, so the output actually seemed sensible, and didn't cause any problems until I later deserialized the full object from the same archive, which caused a segmentation fault in the boost::serialize source (trying to get ETI from a null pointer). I was using a polymorphic text archive, and as I mentioned above, am wondering if I switched to an XML archive if this sort of user-error would be detected. Thanks, Dan Eaton Software Developer Acceleware Corp. (TSX-V:AXE) www.acceleware.com<http://www.acceleware.com/> Phone: +1.403.249.9099 Ext.295 Fax: +1.403.249.9881 Email: daniel.eaton(a)acceleware.com<mailto:daniel.eaton@acceleware.com> Get superpowered! Acceleware gets your products to market faster, better and stronger! This e-mail may contain information that is privileged and confidential and subject to legal restrictions and penalties regarding its unauthorized disclosure or use. You are prohibited from copying, distributing or otherwise using this information if you are not the intended recipient. If you have received this e-mail in error, please notify us immediately by return e-mail and delete this e-mail and its attachments from your system. Thank you. (c) 2008 Acceleware, Inc. All Rights Reserved

2 1

Question about enable_if / disable_if
by Zachary Turner 26 May '09

26 May '09

Suppose I have a template function template<typename T> void f(const std::string&, T); which I want there to be a couple of different variants of. Version 1 - Enabled if and only if boost::is_same<T, bool> Version 2 - Enabled if and only if boost::is_same<T, foo> (foo is a class) Version 3 - Enabled if and only if boost::is_enum<T> Version 4 - Otherwise Is there an easy way to express this? It seems I run into a bunch of overload ambiguity problems. I'm sure I can get around this by adding to every version the negation of all the other conditions, but this seems unnecessarily complicated.

4 3

Second call: The Boost Bug Sprint is coming!!
by Marshall Clow 26 May '09

26 May '09

The boost bug sprint is coming! It starts _this_ Friday, May 28th, and runs through Sunday June 7th. The goal is to address a large number of open bugs/patches/feature requests in the Trac system at <http://svn.boost.org/trac/report/1>. There are currently 791 open tickets; we'd like to knock that number down _a lot_. What can you do? 1) You can fix bugs. * If you are a library maintainer, you can commit your fixes. ;-) * If you are not a library maintainer, you can fix a problem on your local machine (and test it!!), and then attach your fix as a patch to the Trac ticket for the library maintainer to commit. If you do this, please provide a test case that exercises the problem; i.e, one that fails w/o your patch, and succeeds afterwards. 2) You can characterize bugs. * You can attempt to replicate the bug on your system(s), and attach information that you discover to the Trac ticket. This will make it easier for other people to solve the problem, even if you cannot. * You can write test cases demonstrating the problem, and attach them to the Trac ticket. * You can determine if the bug still exists; sometimes they get fixed, and the ticket never gets closed. In this case, try to identify a checkin that addresses the bug; it's always suspicious when bugs go away "by accident." 3) You can test patches. * Some of the tickets in the Trac system contain patches - some are quite old. You can install these patches on your system, and determine if they (a) build, and (b) work. * You can write test cases for the patches, and attach them to the ticket. 4) You can help implement new features. * There are a whole set of "feature requests" in the Trac system. If you have an idea about one of these, you can add comments to the Trac system. You can attempt to implement these new features, and attach the patch to the ticket. (Don't forget the test cases!!). Every day during the bug sprint, I'll post the # of tickets modified/closed/opened on the previous day, as well as the total number of open tickets. --------- Sign-up sheet -------- The following people have committed to participate in the bug sprint. Please add you name here, along with what you can do. 1) Marshall Clow (coordination, Mac OS X characterization) 2) Beman Dawes (filesystem, system, timer) 3) Doug Gregor (function, graph, logic, mpi, numeric, property_map, signals) 4) "joel falcou" <joel.falcou(a)u-psud.fr> ( linux gcc testing/VC 2008 testing, patching) 5) Michael Caisse <boost(a)objectmodelingdesigns.com> (bug fixing) 6) Jeremiah Willcock <jewillco(a)osl.iu.edu> (will test and commit graph patches) 7) David Abrahams (iterator, python) 8) Sohail Somani (patches for g++ 4.2.4) -- -- Marshall Marshall Clow Idio Software <mailto:marshall@idio.com> It is by caffeine alone I set my mind in motion. It is by the beans of Java that thoughts acquire speed, the hands acquire shaking, the shaking becomes a warning. It is by caffeine alone I set my mind in motion.

1 0

Units library and wstring
by Macumber, Daniel 26 May '09

26 May '09

Hello, my group has been simultaneously incorporating the boost units library into our code as well as converting all internal strings from std::string to std::wstring. I am having difficulty merging the changes, it seems that the boost units library has hard coded std::string as the return type for the methods which print units, powers, etc. Is there an easy way to template use of the units library on wchar_t instead of char? Are there any other suggestions on how to use the units library in a program which uses wstring for everything else? Thanks a lot, Dan

2 1

[BGL] dijkstra_shortest_paths on dynamically growing and shrinking graphs
by Ingo Maindorfer 26 May '09

26 May '09

Hello, consider the follwoing Graph: struct EP { double weight; }; typedef boost::adjacency_list< boost::listS, boost::vecS, boost::directedS, boost::no_property, EP > Graph; The call of dijkstra_shortest_paths is clear to me on that graph: boost::dijkstra_shortest_paths( m_graph, a_start_idx, weight_map( m_weight_map ).distance_map( &distance_vector[0]).predecessor_map( &parent_vector[0] ) ); where parent_vector and distance_vector are plain std::vector of the according size. Over time, I have to remove the "oldest" edges and vertices with lower index via remove_vertex() and remove_edge() from the graph and add some "newer" edges and vertices to the graph. My problem is, that the dijkstra_shortest_paths method dosen't work when I provide a plain std::vector to the distance_map() and predecessor_map() parameter of the dijkstra_shortest_paths call because of the mapping from the vertex descriptor to position in the vector. Can anybody tell me how to provide the "right" type of parameter for distance_map() and predecessor_map() ? Maybe something like boost::property_map< Graph, double EP::*>::type m_weight_map = boost::get( &EP::weight, graph ); that I'm already have done for the weight_map parameter but I'm looking for something that can handle the mapping stuff of vertex descriptors correctly. Performance is not a subject because of a few hundred vertices and edges. I'm on Boost 1.39. Kindly, Ingo

2 1

Re: [Boost-users] wide-char version of boost::mapped_file?
by Tan, Tom (Shanghai) 26 May '09

26 May '09

By borrowing code from boost::filesystem V3, I re-implemented the to_string function like this: std::string to_string(const wstring& ws) { const size_t BUFFER_SIZE = (ws.size() << 1) + 1; shared_array<char> p_mcb(new char[BUFFER_SIZE]); int count = ::WideCharToMultiByte( AreFileApisANSI() ? CP_THREAD_ACP : CP_OEMCP, WC_NO_BEST_FIT_CHARS, ws.c_str(), ws.size(), p_mcb.get(), BUFFER_SIZE, 0, 0 ); return (-1 == count) ? std::string() : std::string(p_mcb.get(), count ); } This seems to have solved the conversion problem. Is it possible to add an overloaded constructor based on this code to take std::wstring or just take a boost::path when V3 comes out.? It would ease the usage a lot in my opinion. -----Original Message----- From: Tan, Tom (Shanghai) Sent: 2009-05-26 11:55 To: 'boost-users(a)lists.boost.org' Subject: wide-char version of boost::mapped_file? I am trying to use boost::mapped_file in the iostream library. While I like the interface. The fact that it only supports the ANSI version of windows API, thus dictating an ANSI version of file path, really drives me crazy. In my code I use std::wstring everywhere. Because boost::mapped_file asked for a std::string to construct like this: explicit mapped_file( const std::string& path, std::ios_base::openmode mode = std::ios_base | std::ios_base, size_type length = max_length, boost::intmax_t offset = 0 ); I wrote a small routine to convert it like this: std::string to_string(const wstring& ws) { const size_t BUFFER_SIZE = (ws.size() << 1) + 1; shared_array<char> p_mcb(new char[BUFFER_SIZE]); setlocale( LC_ALL, ".2052"); size_t count = wcstombs(p_mcb.get(), ws.c_str(), BUFFER_SIZE ); return (-1 == count) ? std::string() : std::string(p_mcb.get()); } It does not really work well when I have Enlish and Chinese characters mixed together in the path, while it does for pure Chinese paths. So I traced down to the source code to find out why a std::string instead of basic_string<Char> is needed, anyway, it's just a path, and has nothing to do with mapping it does. There seems to be no clue except for the ANSI version of Win32 APIs, which actually have wide-char versions. Did I missing any design requirement that force it to be like what it is today? Another issue is, it throws exception from inside the constructor when it tries to map a zero-length file. IMHO, it's not good to throw for a legal file, be its length zero, and not good to throw from the constructor either.

1 0

wide-char version of boost::mapped_file?
by Tan, Tom (Shanghai) 26 May '09

26 May '09

I am trying to use boost::mapped_file in the iostream library. While I like the interface. The fact that it only supports the ANSI version of windows API, thus dictating an ANSI version of file path, really drives me crazy. In my code I use std::wstring everywhere. Because boost::mapped_file asked for a std::string to construct like this: explicit mapped_file( const std::string& path, std::ios_base::openmode mode = std::ios_base | std::ios_base, size_type length = max_length, boost::intmax_t offset = 0 ); I wrote a small routine to convert it like this: std::string to_string(const wstring& ws) { const size_t BUFFER_SIZE = (ws.size() << 1) + 1; shared_array<char> p_mcb(new char[BUFFER_SIZE]); setlocale( LC_ALL, ".2052"); size_t count = wcstombs(p_mcb.get(), ws.c_str(), BUFFER_SIZE ); return (-1 == count) ? std::string() : std::string(p_mcb.get()); } It does not really work well when I have Enlish and Chinese characters mixed together in the path, while it does for pure Chinese paths. So I traced down to the source code to find out why a std::string instead of basic_string<Char> is needed, anyway, it's just a path, and has nothing to do with mapping it does. There seems to be no clue except for the ANSI version of Win32 APIs, which actually have wide-char versions. Did I missing any design requirement that force it to be like what it is today? Another issue is, it throws exception from inside the constructor when it tries to map a zero-length file. IMHO, it's not good to throw for a legal file, be its length zero, and not good to throw from the constructor either.

1 0

Re: [Boost-users] [Serialization] Guard against attempting to deserialize the wrong type
by Dan Eaton 25 May '09

25 May '09

Actually, it doesn't seem to be doing any check... looking at the contents of the XML emitted, the name is definitely different than the one I'm requesting. oarchive << BOOST_SERIALIZATION_NVP(foo); iarchive >> BOOST_SERIALIZATION_NVP(bar); This works fine where foo & bar are the same type (using xml_iarchive / oarchive) Am I doing something wrong? From: Dan Eaton Sent: Monday, May 25, 2009 1:30 PM To: 'boost-users(a)lists.boost.org' Subject: [Serialization] Guard against attempting to deserialize the wrong type Hello, I'm just wondering if NVP/XML archives check the name during deserialization? I just had a problem whereby I tried deserializing an object to one type, but the archive actually contained a different (larger ) object type. The first serialized element of the object just so happened to be an unsigned int, and I was trying to deserialize an enum, so the output actually seemed sensible, and didn't cause any problems until I later deserialized the full object from the same archive, which caused a segmentation fault in the boost::serialize source (trying to get ETI from a null pointer). I was using a polymorphic text archive, and as I mentioned above, am wondering if I switched to an XML archive if this sort of user-error would be detected. Thanks, Dan Eaton Software Developer Acceleware Corp. (TSX-V:AXE) www.acceleware.com<http://www.acceleware.com/> Phone: +1.403.249.9099 Ext.295 Fax: +1.403.249.9881 Email: daniel.eaton(a)acceleware.com<mailto:daniel.eaton@acceleware.com> Get superpowered! Acceleware gets your products to market faster, better and stronger! This e-mail may contain information that is privileged and confidential and subject to legal restrictions and penalties regarding its unauthorized disclosure or use. You are prohibited from copying, distributing or otherwise using this information if you are not the intended recipient. If you have received this e-mail in error, please notify us immediately by return e-mail and delete this e-mail and its attachments from your system. Thank you. (c) 2008 Acceleware, Inc. All Rights Reserved

2 1

[Serialization] Guard against attempting to deserialize the wrong type
by Dan Eaton 25 May '09

25 May '09

Hello, I'm just wondering if NVP/XML archives check the name during deserialization? I just had a problem whereby I tried deserializing an object to one type, but the archive actually contained a different (larger ) object type. The first serialized element of the object just so happened to be an unsigned int, and I was trying to deserialize an enum, so the output actually seemed sensible, and didn't cause any problems until I later deserialized the full object from the same archive, which caused a segmentation fault in the boost::serialize source (trying to get ETI from a null pointer). I was using a polymorphic text archive, and as I mentioned above, am wondering if I switched to an XML archive if this sort of user-error would be detected. Thanks, Dan Eaton Software Developer Acceleware Corp. (TSX-V:AXE) www.acceleware.com<http://www.acceleware.com/> Phone: +1.403.249.9099 Ext.295 Fax: +1.403.249.9881 Email: daniel.eaton(a)acceleware.com<mailto:daniel.eaton@acceleware.com> Get superpowered! Acceleware gets your products to market faster, better and stronger! This e-mail may contain information that is privileged and confidential and subject to legal restrictions and penalties regarding its unauthorized disclosure or use. You are prohibited from copying, distributing or otherwise using this information if you are not the intended recipient. If you have received this e-mail in error, please notify us immediately by return e-mail and delete this e-mail and its attachments from your system. Thank you. (c) 2008 Acceleware, Inc. All Rights Reserved

2 1

[ASIO / Serialization] How to avoid the copy?
by Dan Eaton 25 May '09

25 May '09

Hello, Referring to the boost::asio "Serialization" example, and specifically to the file connection.hpp which handles serialization over sockets: http://www.boost.org/doc/libs/1_37_0/doc/html/boost_asio/example/serializat… When new data is to be received, first the message header is read, which contains the number of bytes for the body. Storage must be allocated to receive the body, and is then passed into ::read as boost::asio::buffer. For the purpose of using Serialize, it must then be converted to an std::istream, (in the example above, istringstream). As shown in the example, this requires an extra copy to be held in memory for the std::string. What's the best route to avoid this copy? Thanks, Dan Eaton Software Developer Acceleware Corp. (TSX-V:AXE) www.acceleware.com<http://www.acceleware.com/> Phone: +1.403.249.9099 Ext.295 Fax: +1.403.249.9881 Email: daniel.eaton(a)acceleware.com<mailto:daniel.eaton@acceleware.com> Get superpowered! Acceleware gets your products to market faster, better and stronger! This e-mail may contain information that is privileged and confidential and subject to legal restrictions and penalties regarding its unauthorized disclosure or use. You are prohibited from copying, distributing or otherwise using this information if you are not the intended recipient. If you have received this e-mail in error, please notify us immediately by return e-mail and delete this e-mail and its attachments from your system. Thank you. (c) 2008 Acceleware, Inc. All Rights Reserved

3 2

[ASIO / Serialization] How to avoid the copy?
by Dan Eaton 25 May '09

25 May '09

Ah, yes, it looks like it does have something like that (an implementation of streambuf). Thanks! Dan Eaton Software Developer Acceleware Corp. (TSX-V:AXE) www.acceleware.com<http://www.acceleware.com/> Phone: +1.403.249.9099 Ext.295 Fax: +1.403.249.9881 Email: daniel.eaton(a)acceleware.com<mailto:daniel.eaton@acceleware.com> Get superpowered! Acceleware gets your products to market faster, better and stronger! This e-mail may contain information that is privileged and confidential and subject to legal restrictions and penalties regarding its unauthorized disclosure or use. You are prohibited from copying, distributing or otherwise using this information if you are not the intended recipient. If you have received this e-mail in error, please notify us immediately by return e-mail and delete this e-mail and its attachments from your system. Thank you. (c) 2008 Acceleware, Inc. All Rights Reserved

1 0

[serialization] appending to an archive
by hurcan solter 25 May '09

25 May '09

I am trying to append one or more records to the existing archive file, using something like this; void Logger::save(const std::string& fileName) { assert(fileName != "logger.dmp"); bp::time_duration endRecordTime = getCurrentTime(); ofs.flush(); path dst = complete(path(fileName, native)); path src = complete(path("logger.dmp", native)); remove(dst); copy_file(src, dst); ofstream saveFile(dst,std::ios::app); ArchiveType archive(saveFile,boost::archive::no_header); *mArchive << endRecordTime } although i specify no_header flag, it inserts a '0' as a preamble, how can i turn it off? have you guys ever needed to use serialization like this? what was your solution Thanks in advance Hurcan

2 1

[Container] ptr_set with user define compare function
by 梁绍池 25 May '09

25 May '09

I've defined a function object as below: struct BaseAddrLess : public std::binary_function<Base, Base, bool> { result_type operator() (const first_argument_type& lhs, const second_argument_type& rhs) const { return &lhs < &rhs; } }; and use as a compare function in ptr_set like this: ptr_set<Base, BaseAddrLess> bset; when the class Base is a abstract class the vc9 compiler will complain use of undefined type 'boost::result_of<F>' What causes this problem? How to solve it? Thank you for your patience to read my poor english. S.C. Leung

3 3

exception: use of error_info can mask real exceptions
by Andrew Venikov 25 May '09

25 May '09

Just wanted to ask if there were commonly accepted solutions to the following problem: typedef boost::error_info<struct tag_f1, std::string> f1_descr; and then throw f1exception() << f1_descr("blah blah blah"). and later catch(f1exception & ex){...} The constructor of std::string may throw an exception in which case f1exception will never be thrown. This is not necessarily the desired outcome as the intention was obviously to indicate f1exception error, not the string() error. This problem pertains to any type that throws exceptions in its constructor and is used with error_info idiom. What may be more appropriate is something like this typedef boost::error_info<struct tag_f1, shared_pointer<string> > f1_descr ... error condition is detected shared_ptr<string> pErrStr; try { pErrStr = new string("Error description"); } catch(bad_alloc & ex) { } throw f1exception() << f1_descr(pErrStr); Meaning that if string fails to allocate memory, I'm willing to forgo the error description but still throw the intended exception. Is there a cleaner way to do that? Thanks, Andy.

7 14

boost::thread_specific_ptr
by jono 25 May '09

25 May '09

hi all, i'm using thread_specific_ptr (boost 1.33.1, sorry) in a plugin architecture, where the tls identifies a singleton object of type Context (initialized using DCLP). boost::thread_specific_ptr<Context> Context::instance_; i also have a set of shared libraries and a main executable linked against a static library defining the Context class. this all works fine so long as the libraries are loaded and the threads created in that order, however, if a library is loaded after thread is started, then the thread_specific_ptr in that thread appears to be reset to null, without calling cleanup(). if i use the debugger to inspect the singleton ptr before and after loading the second module, it is, before: $1 = {<boost::noncopyable_::noncopyable> = {<No data fields>}, m_tss = {<boost::noncopyable_::noncopyable> = {<No data fields>}, m_slot = 8}} ..and after: $2 = {<boost::noncopyable_::noncopyable> = {<No data fields>}, m_tss = {<boost::noncopyable_::noncopyable> = {<No data fields>}, m_slot = 1}} is this correct behaviour for thread_specific_ptr? is there a way i can obtain a handle for the first Context object before it is destroyed? here's some info about my system. $ cat /proc/cpuinfo ... AMD Athlon(tm) 64 X2 Dual Core Processor 3800+ ... $ uname -a Linux lumpen 2.6.19 #2 SMP Fri Jan 12 17:58:33 NZDT 2007 x86_64 x86_64 x86_64 GNU/Linux $ gcc -v Using built-in specs. Target: x86_64-redhat-linux Configured with: ../configure --prefix=/usr --mandir=/usr/share/man --infodir=/usr/share/info --enable-shared --enable-threads=posix --enable-checking=release --with-system-zlib --enable-__cxa_atexit --disable-libunwind-exceptions --enable-libgcj-multifile --enable-languages=c,c++,objc,obj-c++,java,fortran,ada --enable-java-awt=gtk --disable-dssi --with-java-home=/usr/lib/jvm/java-1.4.2-gcj-1.4.2.0/jre --with-cpu=generic --host=x86_64-redhat-linux Thread model: posix gcc version 4.1.1 20060525 (Red Hat 4.1.1-1) any help would be appreciated. cheers, Jono

1 0

Build 1.39.0 under VC2010?
by Mantas Matelis 24 May '09

24 May '09

Hi, is vc10 support implemented? And if so, is this the right way to build for vc10:bjam.exe --build-dir="c:\development\boost" --prefix="c:\development\boost" --build-type=complete toolset=msvc-100 stage > C:\development\boost\build-output-vc10.txt When running this, everything builds, but the files have improper names. Visual studio expects libboost_filesystem-vc100-mt-gd-1_39.lib but in the stage directory there are no files with vc100, just vc.

2 2

How do I build with an alternate compiler location?
by Eric Brown 24 May '09

24 May '09

I'm trying to build on freebsd 4. (Those are my production machines, so I'm stuck.) The default install is gcc 2.95 and freebsd's old ports tree contains patches to build boost's libraries. However, when I try to include boost include files, it inevitably complains about any number of templates gcc can't grok. I suppose I can maybe build the libs with gcc 2.95 and my code with gcc 3.4.6, but I'd rather build boost with 3.4.6 too. Plus, the patches are for boost 1.32 and I'd rather use a later version of boost. However, gcc34 installs into /usr/local/bin/gcc34 and a bunch of include files I'd usually specify -I directives in my CXXFLAGS in my makefile. I'm just not clear how to set these overrides for bjam. I've looked at the bjam docs, but it just seems a lot more complicated than it should be. Cheers, Eric

3 2

ICMP Ping ASIO
by cmicel1＠cct.lsu.edu 23 May '09

23 May '09

I am trying to recreate a simple ping utility that utilizes the Internet Control Message Protocol(ICMP) to gather information about a host. Boost ASIO has an implementation of the ICMP protocol and presents this protocol as a method to transmit messages similar to UDP or TCP. I need to create ICMP messages that are crafted with certain control messages (0 - Echo Reply, 8 - Echo Request), but I am unsure of how asio crafts messages when this protocol is in use. I do not want to utilize a server application for my network diagnosis and figured that this would be the appropriate method. Any information on the subject matter would be helpful to me. -Chris

1 0

Noob question - undefined reference to boost::system::get_system_category
by mx270a 23 May '09

23 May '09

I'm a relatively new to programming on Linux, previous experience was with VB.net in Windows. I'm trying to make the switch to C++, but I'm having a difficult time. I started to follow one of the basic tutorials for Boost ASIO, but I can't get it to compile with the ASIO.hpp file included. The environment is Kubuntu 9.04 and Kdevelop 3.5.3. Code: ---------------- #include <boost/asio.hpp> int main() { return 0; } ---------------- Compile Messages and Errors: ---------------- cd '/home/lance/TS1/debug' && WANT_AUTOCONF_2_5="1" WANT_AUTOMAKE_1_6="1" LC_MESSAGES="C" LC_CTYPE="C" make -k make all-recursive Making all in src compiling ts1.cpp (g++) mv -f .deps/ts1.Tpo .deps/ts1.Po linking ts1 (g++) linking ts1 (g++) ts1.o: In function `__static_initialization_and_destruction_0': /usr/include/boost/system/error_code.hpp:205: undefined reference to `boost::system::get_system_category()' /usr/include/boost/system/error_code.hpp:206: undefined reference to `boost::system::get_generic_category()' /usr/include/boost/system/error_code.hpp:211: undefined reference to `boost::system::get_generic_category()' /usr/include/boost/system/error_code.hpp:212: undefined reference to `boost::system::get_generic_category()' /usr/include/boost/system/error_code.hpp:213: undefined reference to `boost::system::get_system_category()' ts1.o: In function `boost::asio::error::get_system_category()': /usr/include/boost/asio/error.hpp:218: undefined reference to `boost::system::get_system_category()' ts1.o: In function `posix_tss_ptr': /usr/include/boost/asio/detail/posix_tss_ptr.hpp:47: undefined reference to `pthread_key_create' ts1.o: In function `~posix_tss_ptr': /usr/include/boost/asio/detail/posix_tss_ptr.hpp:61: undefined reference to `pthread_key_delete' collect2: ld returned 1 exit status make[2]: *** [ts1] Error 1 make[2]: Target `all' not remade because of errors. make[2]: Nothing to be done for `all-am'. make[1]: *** [all-recursive] Error 1 make: *** [all] Error 2 *** Exited with status: 2 *** ---------------- How do I resolve the boost::system errors? Thanks, Lance -- View this message in context: http://www.nabble.com/Noob-question---undefined-reference-to-boost%3A%3Asys… Sent from the Boost - Users mailing list archive at Nabble.com.

4 5

[wave] assertion failed - multithread issue?
by Ein Held 23 May '09

23 May '09

Hello when parsing some cpp files via boost.wave using multiple threads, I randomly get a failed assertion. "Assertion failed: static_cast<RefCountType>(*d.begin()) != 0, file C:\projekte\libs\boost\include\boost-1_38/boost/wave/util/flex_string.hpp, line 1216" I am pretty sure that this is a multi-thread issue, as when using only one thread to parse the files, everything works fine. Unfortunately I cannot give you more specific information as I cannot get gdb to run on my system. I am using gcc 4.3.3 Thank you

2 2