- Boost - lists.preview.boost.org

[test] max_digits10 code breaks regression testing for many older platforms
by David Deakins 13 Jun '12

13 Jun '12

Paul, I noticed that the change to set_precision in Boost.Test (rev 78908) seems to have broken regression testing on the trunk for all of the platforms that don't have max_digits10 in their standard library (even for non-math-related tests). Is there any way to restrict this new code to only platforms that can support it? Thanks, -Dave

1 0

Boost mpi, serialization and shared_ptr
by Max Moorkamp 13 Jun '12

13 Jun '12

Hi, I have started to parallelize one of my applications using MPI and I am running into trouble with serializing classes that contain shared_ptr member to be send through MPI. Below is a minimal case that demonstrates my problem. #include <boost/serialization/serialization.hpp> #include <boost/shared_ptr.hpp> #include <boost/mpi.hpp> #include <boost/serialization/shared_ptr.hpp> #include <boost/serialization/export.hpp> class Base { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { } public: Base() { } virtual ~Base() { } }; class Derived: public Base { private: double b; boost::shared_ptr<Base> MemberPointer; friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & boost::serialization::base_object<Base>(*this); ar & MemberPointer; ar & b; } public: Derived() { } virtual ~Derived() { } }; //BOOST_CLASS_EXPORT(Base) BOOST_CLASS_EXPORT(Derived) int main(int argc, char *argv[]) { boost::mpi::environment env(argc, argv); boost::mpi::communicator world; boost::shared_ptr<Base> Pointer(new Derived()); boost::mpi::broadcast(world, Pointer, 0); } I want to broadcast the derived class that has a member that is a shared_ptr. When I compile this code with gcc-4.6, intel or clang all compilers complain, this is the output from gcc-4.6 In file included from Hacks/serialization_mpi.cpp:11:0: /usr/local/include/boost/serialization/shared_ptr.hpp: In function ‘void boost::serialization::load(Archive&, boost::shared_ptr<U>&, unsigned int) [with Archive = boost::mpi::packed_skeleton_iarchive, T = Base]’: /usr/local/include/boost/serialization/split_free.hpp:58:9: instantiated from ‘static void boost::serialization::free_loader<Archive, T>::invoke(Archive&, T&, unsigned int) [with Archive = boost::mpi::packed_skeleton_iarchive, T = boost::shared_ptr<Base>]’ /usr/local/include/boost/serialization/split_free.hpp:74:5: instantiated from ‘void boost::serialization::split_free(Archive&, T&, unsigned int) [with Archive = boost::mpi::packed_skeleton_iarchive, T = boost::shared_ptr<Base>]’ /usr/local/include/boost/serialization/shared_ptr.hpp:171:5: instantiated from ‘void boost::serialization::serialize(Archive&, boost::shared_ptr<U>&, unsigned int) [with Archive = boost::mpi::packed_skeleton_iarchive, T = Base]’ /usr/local/include/boost/serialization/serialization.hpp:128:9: instantiated from ‘void boost::serialization::serialize_adl(Archive&, T&, unsigned int) [with Archive = boost::mpi::packed_skeleton_iarchive, T = boost::shared_ptr<Base>]’ /usr/local/include/boost/archive/detail/iserializer.hpp:188:5: instantiated from ‘void boost::archive::detail::iserializer<Archive, T>::load_object_data(boost::archive::detail::basic_iarchive&, void*, unsigned int) const [with Archive = boost::mpi::packed_skeleton_iarchive, T = boost::shared_ptr<Base>]’ Hacks/serialization_mpi.cpp:64:3: instantiated from here /usr/local/include/boost/serialization/shared_ptr.hpp:133:9: error: ‘class boost::mpi::packed_skeleton_iarchive’ has no member named ‘append’ /usr/local/include/boost/serialization/shared_ptr.hpp:139:5: error: ‘class boost::mpi::packed_skeleton_iarchive’ has no member named ‘reset’ If I remove the shared_ptr member, it compiles and runs. If I remove BOOST_CLASS_EXPORT(Derived) it compiles, but when running it I get terminate called after throwing an instance of 'boost::archive::archive_exception' what(): unregistered class - derived class not registered or exported Is this a bug or am I doing something wrong? A google search shows an old discussion (2007) that concludes that this problem is fixed in boost 1.45. I see this happening with both 1.48 and 1.49. Any help is appreciated. Regards Max

3 6

[Nowide] Formal Review Request
by Artyom Beilis 13 Jun '12

13 Jun '12

Hello, I'd like to ask to add Boost.Nowide to review queue: Boost.Nowide is a library implemented by Artyom Beilis that make cross platform Unicode aware programming easier. The library provides an implementation of standard C and C++ library functions, such that their inputs are UTF-8 aware on Windows without requiring to use Wide API. Sources: http://cppcms.com/files/nowide/ Docs: http://cppcms.com/files/nowide/html/ Git: git://cppcms.git.sourceforge.net/gitroot/cppcms/nowide Thank You Very Much! Artyom Beilis P.S.: Previous mail was sent accidentally to boost.users list, sorry. -------------- CppCMS - C++ Web Framework: http://cppcms.com/ CppDB - C++ SQL Connectivity: http://cppcms.com/sql/cppdb/

3 4

[pool] Broken documentation
by Klaim - Joël Lamotte 12 Jun '12

12 Jun '12

Hi, http://www.boost.org/doc/libs/1_49_0/libs/pool/doc/html/boost_pool/pool/poo… In this page all images are broken for me. Joel Lamotte

3 3

Review Request : Boost.Range Extension
by Akira Takahashi 11 Jun '12

11 Jun '12

Hi, Neil Groves and Boosters. OvenToBoost is a project that intend to add some features of Oven Range Library into Boost.Range. I'd like to request a review. Features: - Additional Range Adaptors (taken, taken_while, dropped, dropped_while, elements, elements_key, memoized, outdirected) - Extensions for using Lambda (regular function, regular operator) - Infinite Range (iteration function) - and additional range utilities. Future Plan: I have written primary features. If these features are accept, I'd like to implement/add following features: - Range of Range Adaptors (concatenated, transposed) - Cyclic Range - Range Utilities for String Source Code: https://github.com/faithandbrave/OvenToBoost Document: http://dl.dropbox.com/u/1682460/git/OvenToBoost/libs/range/doc/html/index.h… Regards, Akira >>======================== Akira Takahashi mailto:faithandbrave@gmail.com site: https://sites.google.com/site/faithandbrave/about/en

4 24

From an user to developers
by Oodini 10 Jun '12

10 Jun '12

Hello, I am an user, and I am currently reviewing all the Boost libraries. But for a common user, some needs are not satisfied in the libraries descriptions. The Boost organization should compel the libraries authors to put in their documentation : 1. the history of all releases, with notes for each release 2. the motivation of their library 3. when they offer services similar to the ones provided by the STL, why did they feel the need to complete it, and what are the differences 3. for the relevant libraries, their status regarding the new features of C++11 (are they obsolete ? do they remain some differences ? ex : Array, Chrono, DateTime), especially the ones related to TR1 An homogeneous structure for the documentation would be welcome.

5 6

[1.50] OK to merge documentation changes?
by John Maddock 10 Jun '12

10 Jun '12

I have some documentation changes that I'd like to merge: * Corrected typos in Boost.Math docs. * Updated some scripts and Jamfiles for correct PDF doc build generation. Is there a good time to commit these to release, or is it all to late for 1.50 now? Thanks, John.

2 1

[git/modularization] Suggested names for branches?
by Beman Dawes 10 Jun '12

10 Jun '12

At the C++Now! session discussing moving to git and modularization, I showed the usual git flow overview graphic from http://nvie.com/posts/a-successful-git-branching-model/ showing the workflow for a library. Someone (Dave?) mentioned that the git flow choices for branch names were not what we would like for Boost. I agree, but don't recall the exact suggestions for more appropriate names. The three branches in question, with the git-flow names in parens, were the main development branch (develop), release prep branches (?), and the branch with actual releases (master). Is there a better usual convention for these names? I have a vague memory of someone mentioning "master" for the main development branch, "release" for the branch with the actual releases, and maybe "beta-x.xx.x" for release prep branches. To try to avoid an extended bicycle shed discussion, perhaps people could mention names they have actually seen used and know worked well. --Beman

8 14

Re: [boost] [review] Multiprecision review scheduled for June 8th - 17th, 2012
by Marc Glisse 09 Jun '12

09 Jun '12

(sorry for the broken thread, I wasn't subscribed yet) A few quick comments: * gmpxx != mpfr_class * the version of gmpxx in the repository hasn't used any temporary for the example given in the introduction for a while, it is only because of a slow release cycle that you haven't seen it yet (will be in 5.1). * the example about using 0 vs 11 temporaries doesn't mention what happens to the boost package if we disable expression template. Does it use a single temporary (using rvalue-references) or plenty? * having an implicit narrowing conversion from double to bigint is a bad idea, it should be explicit (it isn't completely obvious from the doc if that is the case). * you could get good results with a backend that uses gmp's mpn_* functions but not the mpz_t type. * what about infinite precision floats? By that I mean something like bigint*2^n, where operations + - * are computed exactly. It can be quite a bit faster than rationals, when it is sufficient. * if I want reference-counting, I guess that should be done in a back-end. -- Marc Glisse

5 22

C++Now! keynote videos are available
by Marshall Clow 08 Jun '12

08 Jun '12

Howard's was not recorded Daveed: http://www.youtube.com/watch?v=8SOCYQ033K8 Sean: http://www.youtube.com/watch?v=iGenpw2NeKQ The full list of videos is at: http://www.youtube.com/user/BoostCon (more will be added soon) -- Marshall Marshall Clow Idio Software <mailto:mclow.lists@gmail.com> A.D. 1517: Martin Luther nails his 95 Theses to the church door and is promptly moderated down to (-1, Flamebait). -- Yu Suzuki

1 0

basic information: code post
by Majid Qureshi 08 Jun '12

08 Jun '12

Hi I am new to boost mailing list. I am wondering if I wish to submit my template class for review to be added as part of boost library, what do I need to do? and please advise if I am not suppose to send email to this mailing list for any such proposal. Also what mailing list do I need to send such emails? Very much appreciated.Thanks

2 1

[Who's using boost?] Sankel Software
by David Sankel 08 Jun '12

08 Jun '12

Sankel Software Sankel Software has been using boost for over 10 years to develop high performance and customized CAD/CAM applications, industrial control, computer artistry, and business software. If it wasn't for Boost, we would have stopped using C++ long ago. Its libraries allow us to write more concise code and, more importantly, give us the tools to implement higher level constructs such as denotational semantics based, top-down program design. Home Page: http://sankelsoftware.com Here is a list of the libraries we currently use: - Boost.Any - Boost.Serialization - Boost.Array - Boost.Assign - Boost.Bind - Boost.Integer - Boost.DateTime - Boost.Foreach - Boost.Function - Boost.Fusion - Boost.Variant - Boost.Optional - Boost.LexicalCast - Boost.SmartPtr - Boost.Math - Boost.MPL - Boost.MultiIndex - Boost.Operators - Boost.Signals2 - Boost.Thread - Boost.Tuple - Boost.TypeTraits - Boost.Utility - David -- David Sankel Sankel Software www.sankelsoftware.com 585 617 4748 (Office)

1 0

[1.50.0] Release branch open for bug fixes and doc updates
by Beman Dawes 07 Jun '12

07 Jun '12

The final release is scheduled for Monday, June 25th. The release candidate is scheduled to to be built Thursday, June 21st. That gives us two weeks to apply post-beta bug fixes and doc updates. Let's try a slightly more streamlined procedure for this post-beta period; until Monday, June 18th permission is not required to merge bug fixes and documentation updates. Starting June 18th permission of a release manager is required for all merges. As always, New libraries and new features are not allowed during a post-beta period. Thanks, --Beman

2 1

[1.50] Can't build quickbook PDF docs.
by John Maddock 07 Jun '12

07 Jun '12

Just a note that the quickbook docs don't build as a PDF due to XML validation failures at the FO stage: fop.render.pdf ..\..\bin.v2\tools\quickbook\doc\msvc-10.0\debug\link-static\threading-multi\quickbook.pdf M:/download/programs/xep/xep.bat ..\..\bin.v2\tools\quickbook\doc\msvc-10.0\debug\link-static\threading-multi\quickbook.fo ..\..\bin.v2\tools\quickbook\doc\msvc-10.0\debug\link-static\threading-multi\quickbook.pdf (document [system-id file:/M:/data/boost/branches/release/doc/pdf/../../bin.v2/tools/quickbook/doc/msvc-10.0/debug/link-static/threading-multi/quickbook.fo] (validate [error] Element 'fo:block' cannot be a child of 'fo:root'. [error] Element 'fo:block' cannot be a child of 'fo:root'. [error] Element 'fo:block' cannot be a child of 'fo:root'. [error] Attribute 'space-before.optimum' cannot occur at element 'fo:block'. [error] Attribute 'space-before.minimum' cannot occur at element 'fo:block'. [error] Attribute 'space-before.maximum' cannot occur at element 'fo:block'. [error] Attribute 'id' cannot occur at element 'fo:inline'. [error] Attribute 'break-before' cannot occur at element 'fo:block'. [error] Attribute 'id' cannot occur at element 'fo:block'. [error] Attribute 'margin-left' cannot occur at element 'fo:block'. [error] Attribute 'font-family' cannot occur at element 'fo:block'. [error] Attribute 'keep-together.within-column' cannot occur at element 'fo:block'. [error] Attribute 'keep-with-next.within-column' cannot occur at element 'fo:block'. [error] Attribute 'font-family' cannot occur at element 'fo:block'. [error] Attribute 'font-weight' cannot occur at element 'fo:block'. [error] Attribute 'keep-with-next.within-column' cannot occur at element 'fo:block'. [error] Attribute 'space-before.minimum' cannot occur at element 'fo:block'. [error] Attribute 'space-before.optimum' cannot occur at element 'fo:block'. [error] Attribute 'space-before.maximum' cannot occur at element 'fo:block'. [error] Attribute 'text-align' cannot occur at element 'fo:block'. [error] Attribute 'start-indent' cannot occur at element 'fo:block'. [error] Attribute 'marker-class-name' cannot occur at element 'fo:marker'. [error] Element 'fo:marker' should be a descendant of 'flow'. [error] Attribute 'font-size' cannot occur at element 'fo:block'. [error] Attribute 'id' cannot occur at element 'fo:inline'. [error] Attribute 'internal-destination' cannot occur at element 'fo:basic-link'. [error] Attribute 'color' cannot occur at element 'fo:inline'. [error] Attribute 'space-before.optimum' cannot occur at element 'fo:block'. [error] Attribute 'space-before.minimum' cannot occur at element 'fo:block'. [error] Attribute 'space-before.maximum' cannot occur at element 'fo:block'. [error] Attribute 'id' cannot occur at element 'fo:block'. [error] Attribute 'border-color' cannot occur at element 'fo:block'. [error] Attribute 'border-width' cannot occur at element 'fo:block'. [error] Attribute 'border-style' cannot occur at element 'fo:block'. [error] Attribute 'padding-left' cannot occur at element 'fo:block'. [error] Attribute 'padding-right' cannot occur at element 'fo:block'. [error] Attribute 'padding-top' cannot occur at element 'fo:block'. [error] Attribute 'padding-bottom' cannot occur at element 'fo:block'. [error] Attribute 'widows' cannot occur at element 'fo:block'. [error] Attribute 'orphans' cannot occur at element 'fo:block'. [error] Attribute 'font-size' cannot occur at element 'fo:block'. [error] Attribute 'hyphenate' cannot occur at element 'fo:block'. etc. Any ideas? Thanks, John.

2 1

status of sp_counted_base_solaris.hpp
by Graham Bennett 07 Jun '12

07 Jun '12

Hi all, I'm interested in getting boost::shared_ptr to use atomic ops on Solaris. I notice there is an implementation using the OS-provided atomics in boost/detail/sp_counted_base_solaris.hpp, but it doesn't seem to be included. According to this thread: http://lists.boost.org/Archives/boost/2006/07/107144.php, it seems the reason might be that it wasn't possible to come up with a proper preprocessor condition to include it on the right versions of Solaris. I'm considering modifying my boost installation to include this header on Solaris - does anyone know of any issues with the code, or can they confirm that it has been well tested? Are there any other reasons for its omission? Thanks, Graham -- Graham Bennett

4 7

[review] Multiprecision review scheduled for June 8th - 17th, 2012
by Jeffrey Lee Hellrung, Jr. 07 Jun '12

07 Jun '12

Hi all, The review of the proposed Boost.Multiprecision library authored by John Maddock and Christopher Kormanyos has been scheduled for June 8th - June 17th, 2012 and will be managed by myself. >From the Introduction: -------- "The Multiprecision Library provides *User-defined* integer, rational and floating-point C++ types which try to emulate as closely as practicable the C++ built-in types, but provide for more range and precision. Depending upon the number type, precision may be arbitrarily large (limited only by available memory), fixed at compile time values, for example 50 decimal digits, or a variable controlled at run-time by member functions. The types are expression-template-enabled for better performance than naive user-defined types." -------- And from the original formal review request from John: -------- Features: * Expression template enabled front end. * Support for Integer, Rational and Floating Point types. Supported Integer backends: * GMP. * Libtommath. * cpp_int. cpp_int is an all C++ Boost licensed backend, supports both arbitrary precision types (with Allocator support), and signed and unsigned fixed precision types (with no memory allocation). There are also some integer specific functions - for Miller Rabin testing, bit fiddling, random numbers. Plus interoperability with Boost.Rational (though that loses the expression template frontend). Supported Rational Backends: * GMP * libtommath * cpp_int (as above) Supported Floating point backends: * GMP * MPFR * cpp_dec_float cpp_dec_float is an all C++ Boost licensed type, adapted from Christopher Kormanyos' e_float code (published in TOMS last year). All the floating point types, have full std lib support (cos sin exp, pow etc), as well as full interoperability with Boost.Math. There's nothing in principal to prevent extension to complex numbers and interval arithmetic types (plus any other number types I've forgotten!), but I've run out of energy for now ;-) Code is in the sandbox under /big_number/. Docs can be viewed online here: http://svn.boost.org/svn/boost/sandbox/big_number/libs/multiprecision/doc/h… -------- I hope everyone interested can reserve some time to read through the documentation, try the code out, and post a formal review, either during the formal review window or before. I expect to conduct the review in the "traditional" manner, i.e., entirely within the regular boost developers' mailing list (boost(a)lists.boost.org) I will send a reminder of review process details closer to the review window. Thanks! - Jeff

4 23

1.50.0 beta 1 Beta release available
by Beman Dawes 06 Jun '12

06 Jun '12

Boost release 1.50.0 beta 1 is now available from SourceForge See http://sourceforge.net/projects/boost/files/ This release contains 4 new libraries (Algorithm, Functional/OverloadedFunction, LocalFunction, Utility/IdentityType) and numerous enhancements and bug fixes for existing libraries. For details of what's in the release, see http://beta.boost.org/users/history/version_1_50_0.html. Note that the links to files on this web page are for the final release - use the SourceForge link above to get the beta files. Please download the beta, give it a try, and report any problems you encounter. Thanks, -- The Boost Release Team

2 1

[1.50.0] Beta 1 release candidates available for testing
by Beman Dawes 06 Jun '12

06 Jun '12

Release candidate files for 1.50.0 beta 1 are available at http://boost.cowic.de/rc/ As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. This helps ensure the candidates build OK before we push them out to SourceForge. Thanks, --Beman --PS: I tested the 7z version, and it built without errors on Win7/VC++ Express 2010 sp1

16 43

Re: [boost] [review] Multiprecision review scheduled for June 8th - 17th, 2012
by John Maddock 06 Jun '12

06 Jun '12

>>Let us know as soon as you have some results. > > Tested the time taken to run through all the Boost.Math Bessel function > tests, with type double, real_concept (a simple wrapper around double from > Boost.Math's test suite) and mp_number<float_backend<double> > (a trivial > mp_number backend that wraps a floating point type): > > Time for double = 0.0157549 seconds > Time for real_concept = 0.0166421 seconds > Time for float_backend<double> = 0.0408635 seconds > Time for float_backend<double> - no expression templates = 0.0253047 > seconds > > So as you can see, expression templates are a dis-optimization for such > simple types, and even without them you take a noticeable hit: I'm a > little disappointed by this, but not that surprised, mp_number is a rather > heavyweight solution for lightweight types if you see what I mean. > > In any case I'll have a look at the assembly to see if there are any > obvious non-optimizations going on. >From a quick casual look it appears as though the extra time is going in functions not expanded inline - that's certainly the case for the expression template unpacking code. Seems like there may be some small opportunity for optimization of the comparison operators as well (i.e. not evaluating in terms of a compare() function). However, that latter case is only appropriate for exceptionally lightweight backends, for most typical extended precision backends, non of this will make the slightest difference at all... John.

3 3

[COUNTERTREE + SUBALLOCATOR ] New Version
by Francisco José Tapia 05 Jun '12

05 Jun '12

Hi this message is to announce the new version of the [countertree + suballocator] library. You can find in (http://dl.dropbox.com/u/8437476/works/countertree/index.html)<http://dl.dropbox.com/u/8437476/works/countertree/index.html> When I was writing the document explaining the allocator's algorithm. I reexamined my code , and It run well and have an easy interface , but the internal design was obscure and difficult to understand. Due this, I decided redesign it in order to make it clear and easy to understand. I changed too the version of the GCC compiler form the 4.6 to 4.7, and the machine used for the benchmarks. My old computer, where I developed the code, had a good cache but a bad bus memory (Single channel 533Mz), and this introduce a distortion in the comparison of some algorithms. The new machine is a QuadCore with 8M of cache and 8G dual channel 1066 MHz. The results obtained are more similar to the obtained in a modern machine. I added a new point to the documentation explaining the additional features of the countertree set, multiset, map and multimap with two examples. You can find in ( http://dl.dropbox.com/u/8437476/works/countertree/ordered.html#functionality) For the people who don't know this project, this is a description : *COUNTERTREE* This library is an implementation of a binary red-black counter tree. This tree have an additional counter in each leaf. This permit the access to the elements by the position, like in a vector. It is a random access container with random access iterators . With this tree we have vectors (cntree::vector_tree) with identical interface than std::vector. The vector_tree have the same speed inserting and deleting in any position (all the operations are O(log N)).It is slower than std:vector inserting and deleting at end, but much faster for to insert and delete in any other position. With ordered information, we have in the cntree namespace the classes set, multiset, map and multimap, with identical interface than the STL classes, with the plus of access to the elements by position, like in a vector. The iterators are random access , and you can subtract two iterators in a O(log N) time for to know the number of nodes between them (even with the end( ) and rend( ) iterators) *SUBALLOCATOR* The allocator is the data structure defined in the STL, as interface between the data structures and the memory provided by the Operating System (O.S.). The allocator manages the memory received from the Operating System, and the memory requested in the allocate operations and the memory returned in the deallocate operations. To write an allocator for to manage a wide range of size elements and a big number of elements (several millions) of each size in a fast way, it's a very difficult task. When the number of elements grows, many allocators begin to have speed problems. For to improve the speed allocating of the small size elements, many allocators request to the Operating System big chucks of memory. With this, the allocator don't need request memory to the operating system for each allocation. But many allocators don't return well the unused chucks of memory to the Operating System and the memory used by the allocator is the maximum used, never decrease . These allocators are named pool allocators. If you have a small number of elements, you have a small problem, small resources and small time operations. But, if you have several millions of elements allocated, perhaps you are using several GB of memory. Running a program with GB of memory don't used, because the allocator don't return the memory request, is a great waste of resources. This problem is specially important in two environments : - When you have a limited resources, as occurs in the mobile phones, pads , tablets... - When the programs must run continuously in a multitask environment If you use an allocator for the allocation of variable size elements, and a pool allocator for the allocation of fixed size elements, this improve the speed, but increase the memory consumption, which is the sum of the maximum memory of the pool allocator and the memory used by the allocator. If the pool allocator don't return to the Operating System the unused memory, this can't be reused by the allocator. The *suballocator is a solution to these problems*, and others memory problems described in the suballocator page. The suballocator is a layer between the allocator and the data structures, compatible with any allocator with the STL definition. The suballocator request memory to the allocator, and return to it when unused. With the suballocator a) *We have a very fast allocation* *(around 2 times faster than the std::allocator of GCC 4.7, CLANG 3.0 and 3 times than Visual Studio 10 *See details in the *Suballocator Benchmark<http://dl.dropbox.com/u/8437476/works/countertree/suballocator.html#benchma…> *)* b) *Return memory to the allocator, for to be used by others types of data*. Many allocators, return this memory to the Operating System, and decrease the memory used by the program, *( as you can see in the *Suballocator Benchmark <http://dl.dropbox.com/u/8437476/works/countertree/suballocator.html#benchma…> *)* c) *You can use with any allocator if it is according with the STL definition*. The suballocator provides speed and memory management to any allocator d) Even the time of the allocation is a small part of the time spent in the insertion in a std::set, the suballocator obtain time reductions over over the 30% respect the std::allocator. The secret is the cache performance due to the data locality improvement. *COUNTERTREE + SUBALLOCATOR* The join of the two ideas provide us data structures with a suballocator built-in. They are, in the namespace cntree, the vector_tree_pool, set_pool, multiset_pool,map_pool and multimap_pool, with identical interface than the STL classes but better performance. Tray it. It fast, useful and easy to understand and use,. They are the STL classes with a few additional functions. I had checked this code with GCC 4.7 (32 and 64) , CLANG/LLVM 3.0 and Visual Studio 1010 (32 and 64). If you find any error or problem in the code , the documentation or in any other part ( as friendly do Mr Rene Rivera in the first version). Please mail me ( fjtapia(a)gmail.com) or if you mail Boost, please insert [countertree] in the head of the message. Some days I have not time to read all messages arrived to my mail, but if I see that I detect and respond first. If you have some idea, or have any comment, please mail me, always two legs run more than only one in the pursuit of the goal, to be useful to the community of programmers in the same way than our predecessors had been useful to us. Sincerely yours Francisco Tapia fjtapia(a)gmail.com

1 0

[Who's Using Boost?] FaceBook
by Brian Wood 05 Jun '12

05 Jun '12

Thanks for the link. I notice Folly has an IntrusiveList derived from boost::intrusive::list. We have a nickname for boost::intrusive::list also -- ilist. Perhaps there are others who have done the same? Shalom, Brian Wood Ebenezer Enterprises http://webEbenezer.net

1 0

[bind] Move Parameters?
by Daniel Larimer 05 Jun '12

05 Jun '12

Say I have some synchronous code like this: vector<data> v; some_method( std::move(v) ) Now I want to call to make that some_method call asynchronous so what I really want is function<void()> f = bind( some_method, boost::rref( std::move(v) ) ) asio_io_service.post(f); // performs async move of v into some_method asio_io_service.post(f); // undefined, or throw bound parameter has already moved... As far as I can tell there is no current support for anything like this, and I think it could be very useful. Dan

1 0

Re: [boost] [git/modularization] Suggested names for branches?
by Sean Chittenden 04 Jun '12

04 Jun '12

> The three branches in question, with the git-flow names in parens, > were the main development branch (develop), release prep branches (?), > and the branch with actual releases (master). > > Is there a better usual convention for these names? I have a vague > memory of someone mentioning "master" for the main development branch, > "release" for the branch with the actual releases, and maybe > "beta-x.xx.x" for release prep branches. re: git flow branch names, I'd advocate for their use simply because it matches all of the external training material (videos, docs, flow charts, etc) available regarding the use of git flow (and it reduces the friction for getting initially setup). I agree that they aren't ideal and much prefer the naming convention used by the FreeBSD project (where branch names indicate a stable API, 9-STABLE, 8-STABLE, etc., vs -CURRENT), but I'd stick with the default names for now and then in a release or three consider changing from the defaults to something boost specific. -sc # Initialize default git flow branches git flow init -d # From project/.git/config [gitflow "branch"] master = master develop = develop [gitflow "prefix"] feature = feature/ release = release/ hotfix = hotfix/ support = support/ versiontag = -- Sean Chittenden sean(a)chittenden.org

1 0

folly (Facebook's open source C++ library)
by Tudor Bosman 04 Jun '12

04 Jun '12

https://www.facebook.com/notes/facebook-engineering/folly-the-facebook-open… I'm Tudor, one of the folly developers. I'll try to answer your questions or poke the appropriate people :) Re: "NO EXCEPTIONS" in the README -- the README file was intended for internal Facebook contributors (hence stray references to internal paths), and "NO EXCEPTIONS" referred to "no exceptions to the rules above", NOT "no C++ exceptions". Will fix / clarify / remove soon. -Tudor.

2 1

[Who's Using Boost?] FaceBook
by Dave Abrahams 04 Jun '12

04 Jun '12

as noted in https://www.facebook.com/notes/facebook-engineering/folly-the-facebook-open… -- Dave Abrahams BoostPro Computing http://www.boostpro.com

5 4