- Boost - lists.boost.org

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