June 2007 - Boost - lists.boost.org

[bimap] New Version
by Matias Capeletto 05 Jun '07

05 Jun '07

Hello boost, I have released a new version of the Boost.Bimap. The main attraction of this new release is the possibility to add information about each relation. I have been working very hard to ensure that Bimap works well with the others boost libraries. I have added new sections to the "Bimap and Boost" docs to show how to combine them. For example, from Bimap and Boost.Foreach: ------------------------------------------------------------------------------------------------------ typedef bimap< int, string > bm_type; bm_type bm; assign::insert( bm ) (1,"one") (2,"two") (3,"three"); BOOST_FOREACH( bm_type::right_const_reference p, bm.right ) { std::cout << p.first << " ---> " << p.second << std::endl; } ------------------------------------------------------------------------------------------------------ prints: ------------------------------------------------------------------------------------------------------ one ---> 1 three ---> 3 two ---> 2 ------------------------------------------------------------------------------------------------------ ================================================== I really need feedback! ================================================== If you are using this library please send me your comments (if you want by private email: matias <dot> capeletto <at> gmail <dot> com ) Library sources are in the vault: ---------------------------------------------------------------------------------------------------- http://tinyurl.com/2t8c87 Documentation can be viewed online here: ---------------------------------------------------------------------------------------------------- http://tinyurl.com/22sja5 Or can be downloaded from: ---------------------------------------------------------------------------------------------------- http://tinyurl.com/22jfdf Main changes ---------------------------------------------------------------------------------------------------- Lib: * Added support for information about the relations * Added range_type and const_range_type typedef to indexed views * Change the way you tag the collections. * hard implementation decision * Some small bug fixes Docs: * New relation and pair layout diagram * New section: Additional information * More examples in Bimap and Boost * New section: Bimap and Boost.Xpressive * New section: Bimap and Boost.Typeof * New section: Bimap and Boost.Foreach * Update the reference Comments are welcome Best regards Matias

1 1

[soc][regex] multiple existing practices for named sub-expressions
by Hugh Wimberly 05 Jun '07

05 Jun '07

Part of my GSoC project (and probably the easiest part) is to implement named sub-expressions in Boost.Regex. Right now, most regex engines have this capability, but there are two camps for how the named sub-expressions match up with the numbers used for backreferences. A very useful overview of the two possibilities can be found at http://www.regular-expressions.info/named.html Essentially, .NET numbers all the named captures after all the unnamed captures, and everybody else simply numbers them all in order from left to right. My personal opinion is that the Boost.Regex implementation should follow Python's and PCRE's practice instead of the .NET syntax or an amalgam of the two, but this is a decision for the boost community, not for me. Thoughts? -Hugh

3 2

[uuid] uuid::create() is extremely slow
by Dave Jenkins 05 Jun '07

05 Jun '07

Andy, You did a nice job speeding up the uuid::create(engine) function to 0.4 seconds for 1 million UUIDs. But now the uuid::create() function is extremely slow - 131 seconds for 1 million UUIDs (source code below). Can you change it to use a static mt19937 engine? Thanks, Dave Jenkins #include <boost/uuid.hpp> #include <boost/progress.hpp> #include <string> int main(int, char*[]) { using namespace boost; int const N = 1000000; // mt19937 engine; timer t1; for (int i=0; i<N; i++) uuid::create(); // uuid::create(engine); std::cout << "elapsed time: " << t1.elapsed() << '\n'; return 0; }

6 12

GSoC: "Boost.Extension and Reflection" library [plugin]
by Janek Kozicki 05 Jun '07

05 Jun '07

The link from http://code.google.com/soc/boost/about.html states: Title: Boost.Extension and Reflection Student: Mariano Gabriel Consoni Mentor: Hartmut Kaiser "The project that I propose is centered in adding to Boost a library that allows the programmer to include extensions/plugins. Additionally this will be the start point to implement reflection concepts. [...]" I want to ask what is the progress with this library? I remember from GSoC 2006 conclusions that we all agreed that the progress during SoC should be advertised on boost mailing list to encourage participation from other people (especially looking at code during its evolution). I'm not even sure if SoC has already started, or will it start next month? Anyway I want to point out that I'm particularly curious about the progress in this area. PS: why this wiki webpage for GSoC 2007 is wiped out? http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl?Google_Summe… -- Janek Kozicki |

6 13

[soc 07] SoC 2007 Projects
by Jeff Garland 05 Jun '07

05 Jun '07

Hi All - I'm happy to announce that Boost will be mentoring 9 Google SoC projects this year. They are: Title Student Mentor ----------------------------------------------------------------------------- User-friendly graphs and their measures Andrew Sutton Jeremy Siek FastCGi and SCGI-compatible CGI library Darren Garvey Christopher M Kohlhoff Boost 'Big Integer' proposal Arseny Kapoulkine Jeff Garland Signal Network library Stjepan Rajko Douglas Gregor Evolutionary Computation Library Aaron Garrett Jaakko Järvi Application to extend Boost regex with recursive matching, named sub-expressions, and automata-based matching Hugh Wimberly John Maddock Visualization Of Arrays And STL Containers Jacob R>Voytko Joaquín L. Muñoz Boost.Extension and Reflection Mariano G. Consoni Hartmut Kaiser A Generic Geometric Library Huseyin Akcan Herve Bronnimann You can find the abstracts of these projects online here: http://code.google.com/soc/boost/about.html As with last year, there were many worthy students and projects that ultimately were not selected. So, for all the students that were not selected realize that the competition for a very few slots was immense. My main advice for students that might want to try again next year is to start participating now -- it really helps to hang out on the list, submit patches, and work on ideas well in advance of SoC. I'd like to thank the mentoring team that evaluated the ~220 applications we received this year. It takes a huge effort to go thru these, read, rank, clarify and give feedback. Note that in addition to the mentors above Andreas Huber, Rene Rivera, and Daniel Wallin all helped with evaluations. For those coming to BoostCon I'll be giving a presentation on Friday about Boost and SoC: http://www.boostcon.com/program/sessions#garland-summer-of-code And, if you aren't coming to BoostCon, well, you should ;-) http://www.boostcon.com/registration Jeff

5 5

[ [bimap] CodeWarrior 9.4
by Matias Capeletto 05 Jun '07

05 Jun '07

I have solve all the problems with Boost.Bimap in CW 9.4 except for one. I do not know how to solve this last one. Regression are here: http://engineering.meta-comm.com/boost-regression/CVS-HEAD/developer/bimap.… Can a CW friend give me a hint? Thanks! Best Regards Matias

1 0

[bimap] typo in test_bimap_project.cpp
by Boris Gubenko 05 Jun '07

05 Jun '07

bimap library test test_bimap_project.cpp fails to compile because of typo: list_of< tagged< lstd::string, right_tag > ^ Thanks, Boris

2 1

[1.34.1] bug in xpressive regex_token_iterator
by Eric Niebler 04 Jun '07

04 Jun '07

I just opened http://svn.boost.org/trac/boost/ticket/1026 against myself, and attached a patch. There's a potential crashing bug in xpressive::regex_token_iterator. The change is fairly simple, and I'm running full regressions on it now. Assuming the tests all pass (and it's looking good), can I commit? Thomas? -- Eric Niebler Boost Consulting www.boost-consulting.com

2 2

[1.34.1] Release Notes
by Thomas Witt 04 Jun '07

04 Jun '07

Hi, Could the people who have either applied patches two or supplied patches that were included in 1.34.1 update the release notes in index.htm accordingly. Please modify index.htm on RC_1_34_0 not HEAD or the website directly. The chances that the release notes are correct are way higher when the respective developers do this. Thanks Thomas -- Thomas Witt witt(a)acm.org

1 0

Review Request: Boost.Time_series
by Eric Niebler 04 Jun '07

04 Jun '07

Looking at the review schedule, it occurs to me that I never officially put my Boost.Time_series library in the queue. So here goes ... Boost.Time_series is a library for computing with time series (http://en.wikipedia.org/wiki/Time_series) From the documentation: > The purpose of the Boost.Time_series library is to provide data structures, numerical operators and algorithms to operate on time series. A time series is a series of data points, sampled at regular intervals. The library provides numerous time series containers, each with different time/space trade-offs, and a hierarchy of concepts which allow the time series to be manipulated generically. The library also provides operators and algorithms which use the generic interfaces to perform calculations on time series and accumulate various statistics about them. > > Boost.Time_series does not yet contain all the algorithms one might want in order to perform full time series analysis. However, the key contribution of Boost.Time_series is the framework and the rich hierarchy of concepts with which such algorithms can be written to efficiently and generically process series of data with widely divergent in-memory representations and performance characteristics. Boost.Time_series provides several such series containers, as well as mechanisms for defining additional series types and algorithms that fit within the framework. Some examples of series types that are provided are: dense, sparse, piecewise constant, heaviside and others, as well as adaptors for providing shifted, scaled and clipped series views. The documentation can be found here: http://boost-sandbox.sf.net/libs/time_series/doc/html/index.html The code is in time_series.zip, which can be downloaded here: http://boost-consulting.com/vault/index.php?directory=Math%20-%20Numerics -- Eric Niebler Boost Consulting www.boost-consulting.com

1 0