September 2009 - Boost - lists.preview.boost.org

Review Request: Boost.Itl; The Interval Template Library
by Joachim Faulhaber 03 Oct '09

03 Oct '09

Dear developers, the Interval Template Library is now in a state where I think it does conform the requirements and guidelines for boost libraries fairly well. To decide, whether it's design, implementation and overall usefulness is sufficient to be accepted in the boost libraries collection is now up to you. In the last round of refactoring I concentrated on efficiency and optimization issues. The implementation of the itl's interval containers is still based on std::set and std::map, but algorithms are now exploiting hinted insert and are manipulating intervals and values in place instead of copying in many instances. This way, it has been possible to improve performance significantly. Along the way of implementing optimizations I have documented the complexity guarantees for all important functions of the library's interface. Please note that the original ITL as presented in May 2008 has been split into 3 parts and only the *first* part is submitted for review: itl : Core library, interval containers, SUBMITTED FOR REVIEW Additional parts are: itl_xt : Extensions like histories and generalized crosstables validate: The law based test automaton (LaBatea). A validation tool using laws aka axioms. *itl* is a complete library containing all required ingredients particularly a separate test suite (NOT using LaBatea) and the quickbook documentation. The code is successfully compiled and tested with gcc-3.4.4, 4.1.0, 4.3.2 and msvc-8.0, 9.0. I have uploaded the review version as itl_3_1_0.zip to the vault in section containers. http://www.boostpro.com/vault/index.php?action=downloadfile&filename=itl_3_… Another file itl_plus_3_1_0.zip contains all three parts (itl, itl_xt and validate). http://www.boostpro.com/vault/index.php?action=downloadfile&filename=itl_pl… Reviewers interested in the law based testing part may have to refer to this file to examine those tests. The law base testing examples compile and run with gcc-4.3.2, msvc-8.0 and 9.0. LaBatea does not compile with gcc-4.1.0 or older. The quickbook generated documentation is included in the zip files and is also available online at http://herold-faulhaber.de/boost_itl/doc/libs/itl/doc/html/index.html Sources are also available form the sandbox: https://svn.boost.org/svn/boost/sandbox/itl/ To close my request for review, let me take the opportunity to do some advertisement ;-) focusing on some of the itl's highlights. * The Itl emerged out of real world software development extracting generic functionality from numerous use cases of the date time problem domain. (http://www.herold-faulhaber.de/boost_itl/doc/libs/itl/doc/html/boost_itl/ex…) But the need for the same data structures occurs in other fields as well. E.g. Zachary Turner uses a compressed_bitmap similar to an itl::interval_set to manage very large file system allocation bitmaps and gives more use cases here (http://lists.boost.org/Archives/boost/2009/06/152817.php) * Aggregation on overlap not only provides a useful feature to compute aggregation results on interval_maps like statistics, it also leads to a generalized addition operation on maps that exhibits interesting semantical properties. E.g. (http://herold-faulhaber.de/boost_itl/doc/libs/itl/doc/html/boost_itl/semant…) * The itl's design is based on sets of laws (aka axioms) that are described in the documentation. (http://herold-faulhaber.de/boost_itl/doc/libs/itl/doc/html/boost_itl/semant…) These law sets not only are giving a formal specification of the library. Using the law based testing tool (LaBatea) (https://svn.boost.org/svn/boost/sandbox/itl/boost/validate) allows to validate the library code for every specified law. * For the itl, 18 laws have been validated on the 7 container templates with varying instantiation types for template parameters, running a total of 719 different law instances (each of them for large numbers of randomly generated test data). (https://svn.boost.org/svn/boost/sandbox/itl/libs/validate/example/) This gives everyone a method to check semantical properties of the library in a way that is more powerful than traditional unit tests. To get the 'complete picture' of the library's interface you may want to refer to the synoptic function table first (http://www.herold-faulhaber.de/boost_itl/doc/libs/itl/doc/html/boost_itl/in…) before looking at more specific topics. Hoping to have quickened your appetite to take a closer look at this library before and during the review process. best regards Joachim Faulhaber

6 28

Hello and a quick question.
by S. Brad Daughdrill 02 Oct '09

02 Oct '09

Hello to all, I first want to say hello to all the members. I recently ran across your project, and I am really interested in working with you all. My question is are there an example that use forms? The example I found all seem to be console applications and while they are helpful, I really want my students to start programming with forms (initially at least). They will be using Visual C++ 2008 Express. Thank you for everything ahead of time. Brad *----- S. Brad Daughdrill The University of Alabama B.S. Management Information Systems M.S. Operations/Project Management M.B.A. Financial Risk M.A. Economics (Candidate) 146 Lenora Drive Tuscaloosa, AL 35401 (o) 205.348.7591, Bidgood Hall - 351E (c) 251.510.3089 (e) S.Brad.Daughdrill(a)Gmail.com*

3 2

[rdb] 0.0.10 + documentation
by Jean-Louis Leroy 01 Oct '09

01 Oct '09

I have uploaded a new revision to the vault. The only /visible/ change in the API is the syntax for the insert...select statement. It was `insert_into(table)(cols)(select(...))`, it is now `insert_into(table)(cols).select(...). The syntax engine is beginning to look more and more like a compile-time finite state machine. And there is the beginning of a documentation ! you can view it here : http://www.yorel.be/boost/libs/rdb/doc/html/index.html The tutorial is 2/3 complete for this phase (i.e. sans prepared statements). The structure of the doc is strongly influenced by Fusion's - no wonder, I spent so much time in it ;-) While I like the overall structure, I wonder if the Fusion style is appropriate for a tool that is not so much into meta-programming (well at least on the outside). I documented insert_into in this fashion (see http://www.yorel.be/boost/libs/rdb/doc/html/rdb/sql_subsystem/statements/in…) for a test. If you have opinions, please voice them. J-L

2 2

Re: [boost] On the Road to Aspen (BoostCon 2010)
by pete＠pcbartlett.com 01 Oct '09

01 Oct '09

On Tue 29/09/09 12:22 , Joel de Guzman <joel(a)boost-consulting.com> wrote: > Edouard A. wrote: > > Hi Joel, > > > > You can also create a twitter account and link your Facebook page > to this > > twitter account, mirroring all your facebook status updates to > your twitter > > account. > > > > This increases visibility and give the possibility to your fans to > choose > > the medium they like to follow you. > Thanks, Edouard. Done. BoostCon Facebook Linked to > Twitter (@BoostCon) > http://www.twitter.com/BoostCon Many users of Boost are in corporate environments. Many corporate environments block access to Facebook and/or Twitter (mine blocks both) domains. It'd be great therefore if Boost didn't move too much content there if equivalent

4 4

Double free from UTF
by janm-boost-devel＠transactionware.com 01 Oct '09

01 Oct '09

Hi, I am seeing a double free when using boost-test on: - FreeBSD 7.2-STABLE, amd64 (gcc 4.2.1) with boost 1.39 - Mac OSX 10.6.1, x86_64 (XCode 3.2, gcc 4.2) with boost 1.40 I don't see the problem on Windows XP with Visual C++ 2005 Express. A simple test case is below, just run. The _malloc_options is to make the system malloc() fill memory with 0xa5 on allocation and 0x5a on deallocation. #define BOOST_TEST_MAIN #include <boost/test/included/unit_test.hpp> #include <stdlib.h> const char* _malloc_options = "J"; BOOST_AUTO_TEST_CASE(broken) { BOOST_CHECK(true); } Output: Running 1 test case... *** No errors detected zsh: bus error (core dumped) ./a.out Stack Trace: #0 0x0000000800b1bdee in free () from /lib/libc.so.7 #1 0x000000000043e51c in boost::unit_test::framework_impl::clear (this=0x55ad20) at framework.ipp:133 #2 0x000000000043e652 in ~framework_impl (this=0x55ad20) at framework.ipp:122 #3 0x00000000004110c6 in __tcf_1 () at framework.ipp:222 #4 0x0000000800b6dbb6 in __cxa_finalize () from /lib/libc.so.7 #5 0x0000000800b1f7c7 in exit () from /lib/libc.so.7 #6 0x0000000000404595 in _start () Any ideas? Thanks, Jan Mikkelsen

6 12

Interest in flat_iterator for nested containers?
by Christoph Heindl 01 Oct '09

01 Oct '09

Hi, is there any interest in an iterator that provides a flat view of nested containers? For example ---------- using namespace boost::assign; typedef std::list<int> inner_container_type; typedef std::vector<inner_container_type> outer_container_type; outer_container_type elements(6); elements[1] += 1,2,3; elements[2] += 4,5; elements[4] += 6; BOOST_CHECK(std::equal( make_flat_iterator(elements.begin(), elements.end()), make_flat_iterator(elements.end(), elements.end()), list_of(1)(2)(3)(4)(5)(6).begin()) ); ---------- If so, I'll be glad to share my code with the boost community. I attach my current state of development and a single test suite. The current state of development contains a class named flat_iterator, a make_flat_iterator function and a set of meta-functions to derive required types. flat_iterator derives from boost::iterator_adaptor. It derives an inner_iterator type from the passed iterator to be adapted (outer_iterator type). The value_type of outer_iterator is required to model STL container concept. The value_type passed to boost::iterator_adaptor is const-qualified if the reference type of the outer_iterator or inner_iterator type is const-qualified (please see question 1 below). The traversal category of flat_iterator is bidirectional if the the outer_iterator and inner_iterator type are at least bidirectional. It models forward traversal else (question 2). flat_iterators can be stacked over each other to recursively flatten a hierarchy of arbitrary levels. ---------- using namespace boost::assign; typedef std::list<int> level_0; typedef std::vector<level_0> level_1; typedef std::vector<level_1> level_2; level_2 elements(10); elements[2] += list_of(1)(2); elements[4] += list_of(3)(4); typedef flat_iterator<level_2::iterator> flat_iterator_outer; typedef flat_iterator<flat_iterator_outer> flat_iterator_inner; flat_iterator_outer outer_begin(elements.begin(), elements.end()); flat_iterator_outer outer_end(elements.end(), elements.end()); flat_iterator_inner inner_begin(outer_begin, outer_end); flat_iterator_inner inner_end(outer_end, outer_end); BOOST_CHECK(std::equal(inner_begin, inner_end, list_of(1)(2)(3)(4).begin())); ---------- Open questions: * Currently the the value_type passed to boost::iterator_adaptor is const qualified based on required reference type of the outer_iterator, which renders the code for input iterators unusable, right? What's the best way to achieve const correctness? * The traversal category of flat_iterator is supposed to be the 'greatest common divisor' of the inner and outer iterator type. Is there a meta-function in boost that provides that type? Currently bidirectional traversal is chosen if both, inner and outer iterator, are at least of bidirectional traversal. Else forward traversal is chosen (which is of course incorrect when incrementable is passed). * Stacking flat_iterators to flatten out a hierarchy of arbitrary levels is possible but currently requires a lot of typing. I think that applying some recursive meta-functions to generate a correct iterator types for such situations should be possible but is beyond my current knowledge of meta-programming. Kind regards, Christoph

2 8

boost::variant and "Current Approach: Temporary Heap Backup" vs "An Initial Solution: Double Storage"
by Peter Foelsche 01 Oct '09

01 Oct '09

1) boost::variant and "Current Approach: Temporary Heap Backup" vs "An Initial Solution: Double Storage" Please provide both solutions. A potential heap allocation may prevent certain application areas. 2) I also do not understand that exception safety requires that the variant is never empty (e.g. empty() returning always false). What is the use of calling the constructor (of which type btw?) if somebody creates an unintialized variant variable? Or: In the following piece of code is the std::string constructor being called? boost::variant<std::string, int> s; Thanks Peter

2 8

Re: [boost] On the Road to Aspen (BoostCon 2010)
by Pete Bartlett 29 Sep '09

29 Sep '09

I'm sorry somehow my message was sent before I was ready... I wrote: >Many users of Boost are in corporate environments. Many corporate environments block access to Facebook and/or >Twitter (mine blocks both) domains. >It'd be great therefore if Boost didn't move too much content there if equivalent .. functionality is available on boost.org. I understand that many will think the problems lie with unenlightened corporate policies rather than boost, but the latter has a rich and noble history of BOOST_WORKAROUNDing the mistakes of others :-). Pete

1 0

[smart_ptr] comparison of intrusive_ptr objects
by Dmitry Vinogradov 29 Sep '09

29 Sep '09

Does anybody know why intrusive_ptr has ==, != and < operators, but the rest ones are missing (i.e. >, <=, >=)? It makes hard to use intrusive_ptr in generic code.

4 3

Using some of Boost on i5/OS but still problems
by Jon Brisbin 29 Sep '09

29 Sep '09

I was able to use Boost FOREACH in my tests, now I'm trying to use Boost optionals in a C++ ILE module. The compiler is yelling at me, though: "/home/jbrisbin/include/boost/optional/optional.hpp", line 434.66: CZP0210(30) "T" is not a base class of "basic_string<char,std::char_traits<char>,std::allocator<char> >". "/home/jbrisbin/include/boost/optional/optional.hpp", line 434.10: CZP0700(0) The previous message was produced while processing "boost::optional_detail::optional_base<std::basic_string<char,std::char_ traits<char>,std::allocator<char> > >::destroy_impl(is_not_reference_tag)". "/home/jbrisbin/include/boost/optional/optional.hpp", line 408.9: CZP0700(0) The previous message was produced while processing "boost::optional_detail::optional_base<std::basic_string<char,std::char_ traits<char>,std::allocator<char> > >::destroy()". "/home/jbrisbin/include/boost/optional/optional.hpp", line 237.24: CZP0700(0) The previous message was produced while processing "boost::optional_detail::optional_base<std::basic_string<char,std::char_ traits<char>,std::allocator<char> > >::~optional_base()". "/home/jbrisbin/include/boost/optional/optional.hpp", line 145.7: CZP0700(0) The previous message was produced while processing "boost::optional_detail::optional_base<std::basic_string<char,std::char_ traits<char>,std::allocator<char> > >::__dftbdt()". "/home/jbrisbin/include/boost/optional/optional.hpp", line 522.5: CZP0700(0) The previous message was produced while processing "boost::optional<std::basic_string<char,std::char_traits<char>,std::allo cator<char> > >::~optional()". "/home/jbrisbin/include/boost/optional/optional.hpp", line 454.7: CZP0700(0) The previous message was produced while processing "boost::optional<std::basic_string<char,std::char_traits<char>,std::allo cator<char> > >::__dftdt()". "/home/jbrisbin/src/boosttest.cpp", line 6.5: CZP0700(0) The previous message was produced while processing "main(int, char **)". Any hints on what I need to hack here? This seems to be a problem with: void destroy_impl ( is_not_reference_tag ) { get_ptr_impl()->T::~T () ; m_initialized = false ; } I understand what's happening, I'm just not sure how to make the i5/OS compiler happy with this. I keep running into little quirks like this where the AS400 needs a little different treatment. IBM says Boost won't work on the AS400, which I'm finding to be inaccurate at best. It DOES work, just not everything straight out of the box. Lots of things work fine, but some need a little bit of tweaking. What else can I try to get the destructor called? Jon Brisbin Portal Webmaster NPC International, Inc.

2 2

On the Road to Aspen (BoostCon 10)
by Joel de Guzman 29 Sep '09

29 Sep '09

Hi, The road to Aspen starts now. I've been to all three BoostCon events since its inaugural conference in 2007. I can tell you, the experience is definitely amazing. I've been a Boost developer since 2001. Boost is like a virtual family to me. From 2001, I've known and collaborated with countless people, many of which I haven't actually met, until the first BoostCon in 2007. Amazing people like Hartmut Kaiser, Dan Marsden, Eric Niebler, to name a few, were just names. Before BoostCon, I often wished to get to see the faces behind the names. It was exhilarating to finally meet these folks, have a couple of beer (and Pizza!), talk about C++, library development, the wondrous mountains of Aspen, the trees, the bears and coyotes (hah!). If this looks too much like a friendly post, well, it is! I'd like to break a bit from the highly technical discussions taking place in these mailing lists and point you to a FaceBook group named, ermm, "BoostCon" :-) http://www.facebook.com/group.php?gid=125839305706 My task is to invite you guys to join in. You do not have to be a former BoostCon attendee. Everyone here is invited to join. If you want to see the "faces" behind the names, get to know more of the people behind Boost, get to know more friends that share your passion for Boost, C++, templates, etc., in a more relaxed venue, this is the place. If you have even the slightest inkling to attend a future conference, well, join in. Here we can discuss things like sharing rooms to cut cost, where to find the best food in town, car pooling etc. In preparation time prior to the conference, we can discuss matters like which kind of talks you want to see, keynote speakers you'd be interested in seeing, etc. For past BoostCon attendees, here’s a chance to meet up again. Hey, even if you are not planning to attend, I'd like to invite you anyway. Consider this group as a friendly face of Boost :-). Hopefully, the friendly atmosphere will make you attend anyway ;-) Cheers, -- Joel de Guzman http://www.boostpro.com http://spirit.sf.net

3 5

Pretty type_info::name string?
by Emil Dotchevski 28 Sep '09

28 Sep '09

Do we have in Boost something that would attempt to return the pretty version (meaning, it'd fall back to returning the ugly version) of the std::type_info::name string? Emil Dotchevski Reverge Studios, Inc. http://www.revergestudios.com/reblog/index.php?n=ReCode

6 5

Trunk tests broken, missing file
by Belcourt, Kenneth 27 Sep '09

27 Sep '09

error: Unable to find file or target named error: 'algorithm/nview.cpp' error: referred from project at error: '../libs/fusion/test'

2 1

[fusion] inconsistency in size metafunction
by Jean-Louis Leroy 27 Sep '09

27 Sep '09

Consider : #include <boost/fusion/include/vector.hpp> #include <boost/fusion/include/push_back.hpp> #include <boost/fusion/include/size.hpp> #include <boost/mpl/assert.hpp> #include <boost/type_traits/is_same.hpp> int main() { using namespace boost; using namespace fusion; typedef vector<int, int> seq1; typedef result_of::push_back<vector<int>, int>::type seq2; BOOST_MPL_ASSERT((is_same<result_of::size<seq1>::type, result_of::size<seq2>::type>)); } One would not expect this to fail, however it does : 'boost::mpl::assertion_failed' : cannot convert parameter 1 from 'boost::mpl::failed ************boost::is_same<T,U>::* ***********' to 'boost::mpl::assert<false>::type' 1> with 1> [ 1> T=boost::mpl::int_<2>, 1> U=boost::mpl::integral_c<int,2> 1> ] J-L

2 2

Boost.Iterator filter_iterator issues
by Christoph Heindl 27 Sep '09

27 Sep '09

Hi, I think I've found an issue with boost::filter_iterator when decrementing a valid iterator without having any predicate evaluating to true on its way back. filter_iterator.hpp line# 93 states void decrement() { while(!this->m_predicate(*--(this->base_reference()))){}; } which will ?clearly? pass beyond the initial start iterator if no predicate evaluates to true. Is it a requirement for the iterator being adapted by filter_iterator to catch decrements past the containers begin range? The following test will iterate 'iter' past containers begin iterator which will trigger a debug assertion on MSVC. template<class _Iterator> void dec_iterator(_Iterator iter) { BOOST_CHECK(*iter == 2); --iter; // iterates past begin } BOOST_AUTO_TEST_CASE(test_filter_iterator) { using namespace boost::assign; typedef std::vector<int> container_type; container_type values = list_of(0)(1)(2); dec_iterator(boost::make_filter_iterator(std::bind2nd(std::greater<int>(), 1), values.begin(), values.end())); } Please help me clarifying this issue. Best regards, christoph

2 2

[fusion] useful as_variant in spirit2
by Christian Holmquist 26 Sep '09

26 Sep '09

Good day everyone, The function in boost\spirit\home\support\detail\as_variant.hpp seems to have no dep. on spirit, and it's a useful utility that would fit into fusion/support/as_variant.hpp> IIUC it's a meta function that computes a variant<T0, ..., TN> from a fusion sequence<T0, ..., TN>. I think there's no reason for a runtime counterpart, i.e. as_variant<Seq>::type is a valid expression but as_variant(Seq) and result_of::as_variant<Seq>::type is not. Thus, the function is already complete. Does it seem reasonable to you to include in fusion? The work of moving it would be to only update the docs, as spirit2 probably does excessive testing of this function anyway. I could collect the docs from other parts of fusion, and put together a separate test file if needed. All real work is already done, just presentation and formality that is lacking. Have a nice weekend, Christian

5 4

Tools for singleton or monostate or alternative
by Mateusz Loskot 25 Sep '09

25 Sep '09

Hi, I would like to kindly ask for advice in finding tools within Boost collection that could help me to solve my problem. I'm developing a library (it will be used as dynamic-linked library). I need to manage a bunch of related values (numbers) globally. All values are shared across a client process, by its all threads, so thread-safety is under consideration. Mostly, a client needs to read the values (defaults) and sometimes, very rarely, a client needs to re-set the values. I consider to implement it using singleton or monostate pattern with thread-safety (and DLL-safety in mind), so actually Tobias Schwinger's Singleton library [1] would solve this problem well. However, I would prefer something from the Boost collection - Tobias' lib hasn't been approved [2], quite pity as Boost lacks of such tool, IMHO. Also, I've considered digging out singleton stuff from the boost::pool::detail, but I'm not convinced to this idea. I haven't found anything related to monostate patter in Boost. Would anyone suggest a tool available in Boost that would be usable to wrap up some basic but robust solution for my problem? By the way, any plan for update and another round of review of Tobias' library? [1] http://torjo.com/tobias/index.html [2] http://lists.boost.org/boost-announce/2008/01/0171.php Best regards, -- Mateusz Loskot, http://mateusz.loskot.net Charter Member of OSGeo, http://osgeo.org

2 2

[rdb] Uploaded 0.0.07
by Jean-Louis Leroy 25 Sep '09

25 Sep '09

This version features : * insert...set syntax (but no insert...select yet) * update [where] * delete from [where] * create and drop follow the same syntax pattern as the others * attempts to simplify the internals (in insert - select still needs a second look) * some concept checks It's *beginning* to look like something one could use in simple real apps. What's missing before it qualifies is imo `like', 'exists' and transactions. That should not take long. This version compiles with msvc9 and gcc 4.4.1. I tested on Win32 with an Access db via ODBC. The sql engine tests pass on Linux but I have not tried the ODBC test suite on Unix yet. If somebody tries it, please tell me. I have changed the naming scheme : first number is major revision ; second is the milestone (crud with direct execution ; transactions ; prepared statements ; dialects ; constraints ; dynamic sql - which btw I am now nearly sure I can fit elegantly in my framework ; views). Third number is just there for getting ++'ed. The test suite is still the doc but after the transactions I'll begin documenting. Probably with QuickBook. It's funny to see that some people are still downloading 0.04. As I write this the downlaod count bumped to 21 :-D To avoid confusion due to the change in the versioning scheme I deleted the old versions. J-L

4 10

[interprocess][multi_index] emplace() is not sufficient for maps
by Thorsten Ottosen 25 Sep '09

25 Sep '09

Hi Ion and Joaquín, This issue is related to node-based containers. I think you both have added emplace() to provide efficient in-place construction. However, I often encounter a situation where emplace() is not sufficient for me. The situation is characterized by the need to calculate the key after the mapped value (a heavy object) has been placed in the pair. To calculate the key the mapped value needs to be modified (the key is calculated as a side-effect). I therefore suggest that we add a new function: typedef ... map; map m; map::node_ptr p = m.get_node_ptr(<like emplace, but only for constructing the mapped value>); p->pair.first = modify( p->pair.second ); m.insert( boost::move(p) ); Thoughts? -Thorsten

5 21

Boost build problem
by Emil Dotchevski 25 Sep '09

25 Sep '09

I'm trying to use <link>static and <runtime-link>static with my own code, which depends on boost filesystem, and I have the problem that the linker is passed libboost_filesystem-vc80-mt-sgd-1_41.lib while the debug\link-static\runtime-link-static folder has libboost_filesystem-vc80-sgd-1_41.lib. (I've built bjam from the latest trunk sources and I'm using the latest trunk revision of boost build.) HALP! :) Emil Dotchevski Reverge Studios, Inc. http://www.revergestudios.com/reblog/index.php?n=ReCode

5 7

[rdb] Uploaded 0.0.08
by Jean-Louis Leroy 24 Sep '09

24 Sep '09

Tonight: * insert...where (but doesn't check consistency between insert list and values returned form select) * like J-L

1 1

boost::variant -- this code compiles fine -- I think it should not compile
by Peter Foelsche 24 Sep '09

24 Sep '09

#include <boost/variant.hpp> struct test { }; int main(int argc, char **argv) { boost::variant<std::string, int, double> s; boost::get<test>(s); return 0; }

2 1

Matrix Library
by Cem Kalyoncu 24 Sep '09

24 Sep '09

As a part of our graphics study, we have built a 2D matrix class to implement few matrix operation. After the study we have expanded our aim for matrix operations system and started building a matrix and possibly a math library. Currently matrix library is quite near to the finish. To make it as generic as possible, we have used templates. Current state of the project can be accessed from http://sourceforge.net/projects/mathlibcpp/ (SVN: https://mathlibcpp.svn.sourceforge.net/svnroot/mathlibcpp/) A simple search revealed that there is no matrix module for boost libraries. We are willing to resolve compatibility issues and lend our support this module. However, before taking any action, I would like to ask your opinions. Thanks in advance, Cem Kalyoncu Following functions exists in the library: Set/Get/GetData/() Resize/GetSize/GetCols/GetRows isSquare/isIdentity Compare/==/!= =/Copy constructor/CopyTo [Row|Col|]Min/Max/Average/Sum/Median [Row|Col]MinIndex/MaxIndex SortRows RemoveCol/RemoveRow matrix operators (+, -, *, +=, -=, *=) scalar operator (+, -, /, *, +=, -=, *=, /=) Transpose/Determinant/Inverse/Minor/Cofactor/Adjoint Uses a managedbuffer and allows temporary matrixes which are not copied Identity/ZeroFilled/RandomFilled/RobertsCross/SobelX|Y conversion to string and output to a stream is supported

5 4

pool allocation
by Stefan Strasser 24 Sep '09

24 Sep '09

I took a closer look at Boost.Pool today to replace some default allocation of small objects. what I found there was a little disappointing, at least for my use case. the object_pool has 2 major downsides: - no dynamic block allocation - destroying one(!) object is O(N), with N being the number of unused objects in the pool so I wrote some code for my own use. I'm not suggesting this code should be added to boost, but something like it. struct A{ ... }; { pool<A,100> pool; A *a; for(int c=0;c<250;++c){ a=pool.new_(); // O(1) } pool.delete_(a); //O(1), destructs } //destruction of 249 objects, O(N) this allocates 3 memory blocks. but it also has one pointer memory overhead per object, to achieve constant time deletion. but you can use that pointer while the object is in use, which was what lead to this code: I needed to store unused boost.intrusive nodes: struct A : intrusive::[s]list_base_hook<>{ ... }; { [s]list_pool<A,[s]list_base_hook<>,100> pool; //same as above } this has no memory overhead, as the list hook can be used by the pool. here's the code: http://www.boostpro.com/vault/index.php?action=downloadfile&filename=intrus…

3 4

[asio] Mixing of sync and async calls
by Roland Schwarz 24 Sep '09

24 Sep '09

Is it legal to mix async and sync function calls? (I was not able to find the answer in the doc.) E.g. socket.async_read_some(buf); socket.write_some(otherbuf); Also when in a blocking sync call, will it be possible to "cancel" it from another thread, e.g. by posting to the io_service which will invoke a close on the socket? Thank you in advance. -- _________________________________________ _ _ | Roland Schwarz aka. speedsnail |_)(_ | sip:speedsnail@ekiga.net | \__) | mailto:roland.schwarz@chello.at ________| http://www.blackspace.at

2 2