- Boost - lists.preview.boost.org

[filesystem] Normalize
by Konstantin Litvinenko 09 Mar '09

09 Mar '09

Hi All! I have noticed that fs::path("/foo/boo/.").normalize == fs::path("/foo/boo/.") and but I expect fs::path("/foo/boo/.").normalize == fs::path("/foo/boo") without trailing dot. I there is a reason why trailing dot is not removed? Is that paths is not equivalents on some systems?

1 1

wiki.boost.org Ancient
by Joel 09 Mar '09

09 Mar '09

Can wiki.boost.org be redirected to someplace useful? Right now it is an advertisement for crystal clear software. It is a bad advertisement since it is from 2005. Even worse, it has a link to a "boost wiki" that isn't being updated and has spam hidden away in it. It claims not to be official, but if the url is wiki.boost.org, it IS official! Thanks! Joel

4 6

[dynamic_bitset] intersects
by vicente.botet 08 Mar '09

08 Mar '09

Hi, I want to know if two dynamic_bitsets have an element in common. Is there an efficient way to get this? dynamic_bitset<> bs1, bs2; intersetcs(bs1, bs2)? Vicente

3 6

[Curry] generic and currying multimethod class
by Nowake 08 Mar '09

08 Mar '09

Hi, I implement curried function library and upload to Vault. http://www.boostpro.com/vault/index.php?action=downloadfile&filename=curry.… - This function object create the object that imitates curried function. you can call target function in incremental steps. # but you must regist each argument sets by hand. - This function is generic function. you can set different function object to each argument sets. - This function can also use multimethod. # but you must use holder (similar as boost::any) to hold argument. # this class act dynamic visitor for holder. - This function object is poor performance. it takes much time to execute function. Samples: ____________________________________________________________________ // target function object struct test_function { string operator()() { return "operator()()"; }; string operator()(int& a) { return "operator()(int:" + lexical_cast<string>(a) + ")"; }; string operator()(int& a, double& b) { return "operator()(int:" + lexical_cast<string>(a) + ", double:" + lexical_cast<string>(b) + ")"; }; string operator()(const int& a) { return "operator()(const int:" + lexical_cast<string>(a) + ")"; }; string operator()(const int& a, const double& b) { return "operator()(const int:" + lexical_cast<string>(a) + ", const double:" + lexical_cast<string>(b) + ")"; }; }; BOOST_AUTO_TEST_CASE(test_pod) { // setup curry // create string return curry boost::curry<string> m00; // "entry" function to each argument sets. // nullary function m00.entry(test_function()); // unary function m00.entry<int>(test_function()); // binary function m00.entry<int, double>(test_function()); // you must "entry" each const type if you use const arguments. m00.entry<const int>(test_function()); m00.entry<const int, const double>(test_function()); // execute // incremental execution BOOST_AUTO(c00, m00()); BOOST_AUTO(c01, c00(100)); BOOST_AUTO(c02, c01(100.0)); BOOST_AUTO(r00, c02()); BOOST_CHECK_EQUAL(r00, "operator()(const int:100, const double:100)"); int i(100); double d(100.0); BOOST_CHECK_EQUAL(m00()(), "operator()()"); BOOST_CHECK_EQUAL(m00()(i)(), "operator()(int:100)"); BOOST_CHECK_EQUAL(m00()(i)(d)(), "operator()(int:100, double:100)"); // const value BOOST_CHECK_EQUAL(m00()(100)(), "operator()(const int:100)"); BOOST_CHECK_EQUAL(m00()(100)(100.0)(), "operator()(const int:100, const double:100)"); // with holder object (holder is similar to boost::any) boost::holder h0(100); boost::holder h1(100.0); BOOST_CHECK_EQUAL(m00()(h0)(), "operator()(int:100)"); BOOST_CHECK_EQUAL(m00()(h0)(h1)(), "operator()(int:100, double:100)"); }; Regrads. Nowake

1 0

[math] Please give me some advice.
by Dongfei Yin 08 Mar '09

08 Mar '09

Hi, I have upload the file to Vault, file name is "[math]AD.zip". I have VC++ 2008 and the source can work under it. Please give me some advice to improve it. Dongfei.

1 0

Re: [boost] [Boost-users] C++03 unique_ptr emulation
by Howard Hinnant 08 Mar '09

08 Mar '09

On Mar 6, 2009, at 9:30 AM, Sergey Skorokhodov wrote: > Hi, > > Howard Hinnant wrote: >> I've put up a new version of an C++03 emulated unique_ptr here: > > <skip> > > I tried to use this implementation with MSVC 7.1 sp1 and 9.0 sp1 and > encounter ICE in the following code: Sorry I don't have MSVC 7.1 to test against. Fwiw I dropped your code (copy/paste) into g++ 4.0 and it compiled, linked and ran without any memory leak or other memory related problems. -Howard > > > <code> > > #include <cstdlib> > #include <string> > #include "unique_ptr.hpp" > > > class Base > { > protected: > explicit Base( std::string const & src ) > { > target.reset( new char[src.length() + 1] ); > memcpy( target.get(), src.c_str(), src.length() ); > target[src.length()] = '0'; > } > > explicit Base( boost::unique_ptr<char[]> src ) > : target( move(src) ) > {} > virtual ~Base() {} > > private: > boost::unique_ptr<char[]> target; > }; > > class Derived : public Base > { > public: > explicit Derived( std::string const & src ) : Base( src ) {} > explicit Derived( boost::unique_ptr<char[]> src ) > : Base( move( src ) ) {} > virtual ~Derived() {} > }; > > int main(int argc, char * argv[]) > { > char const TEXT[] = "This is a text"; > boost::unique_ptr<char[]> ptxt( new char[sizeof(TEXT)] ); > Derived drv( move( ptxt ) ); > return 0; > } > > </code> > > Here is the exact compiler output: > > 1>c:\prj\vs2005\projects\unique_tsts\unique_tst\unique_tst.cpp(21) : > fatal error C1001: An internal error has occurred in the compiler. > 1>(compiler file 'f:\dd\vctools\compiler\utc\src\p2\ehexcept.c', > line 1454) > 1> To work around this problem, try simplifying or changing the > program near the locations listed above. > 1>Please choose the Technical Support command on the Visual C++ > 1> Help menu, or open the Technical Support help file for more > information > 1>Build log was saved at "file://c:\prj\VS2005\Projects\unique_tsts > \unique_tst\Debug\BuildLog.htm" > 1>unique_tst - 1 error(s), 0 warning(s) > > Is something wrong with my code or is it a "pure" MSVC bug? > > TIA > > -- > Sergey Skorokhodov > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

Thoughts on make_shared and shared_from_this in a constructor
by Peter Dimov 07 Mar '09

07 Mar '09

Let's take an example make_shared overload: template< class T, class A1, class A2 > boost::shared_ptr< T > make_shared( A1 const & a1, A2 const & a2 ) { boost::shared_ptr< T > pt( static_cast< T* >( 0 ), detail::sp_ms_deleter< T >() ); detail::sp_ms_deleter< T > * pd = boost::get_deleter< detail::sp_ms_deleter< T > >( pt ); void * pv = pd->address(); // #1 ::new( pv ) T( a1, a2 ); pd->set_initialized(); T * pt2 = static_cast< T* >( pv ); boost::detail::sp_enable_shared_from_this( &pt, pt2, pt2 ); return boost::shared_ptr< T >( pt, pt2 ); } The primary problem with calling shared_from_this in a constructor is that a shared_ptr to the object does not exist yet and may never will. But, when using make_shared, at the line marked //#1 we do have a shared_ptr that owns the storage of the future object T. So we should, in principle, be able to return a copy of it from shared_from_this. Unfortunately, we can't just move the sp_enable_shared_from_this call to #1 because (a) we can't convert an yet-unconstructed T to its enable_shared_from_this base if there's virtual inheritance along the way, and (b) even if we could, we can't initialize the weak_this_ member since it's not constructed yet. I can't think of a good way to pass this shared_ptr to the enable_shared_from_this base since we have no control over T.

2 3

Future or Property Tree?
by Ryan Gallagher 07 Mar '09

07 Mar '09

Forwarding a question that someone asked in a trac bug, "Will PropertyTree? make it into Boost 1.39.0???": https://svn.boost.org/trac/boost/ticket/1989 I guess this has to be asked at least once a year. ;-) http://thread.gmane.org/gmane.comp.lib.boost.devel/171719/ >From this thread it appears that the original author, Marcin, may no longer be available to maintain this library. Was this ever confirmed? However, a year ago Sebastian mentioned that he would be willing to support the library. I don't know if this offer is still good, but it seems that we should figure out what we're doing with this library. There was a list of items in the following thread about what Marcin felt should be done before the release: http://thread.gmane.org/gmane.comp.lib.boost.devel/171825/ In that thread Marcin wrote: """ IMO the issues that should be addressed before release are: - Simplification by removing some of the template arguments (arguable - maybe someone is using that?) - Figure out which parsers are unneccessary and get rid of them (cmdline parser?) - Get some docs toolchain to work properly and provide up-to-date docs. Lots of the text can be ported over (and my monkey english corrected from the original docs. - Speedup through use of a custom container (to replace std::list, needs some profiling work if it's even worth it) """ I believe that some of the parsers were already removed from svn. In the first link I posted (the trac ticket) were some patches I gave a long time back for the docs in quickbook form + doxygen. However, these were just meant to be a start based upon the original documentation (with a few English grammar corrections) and aren't really release-ready quite yet. (I'd have to see about getting the doc toolchain setup again myself, which I don't remember working so well on Windows, though Linux didn't give me any major problems.) On top of this list, at this point I think there would may be a few patches to review and apply from Trac. Do we have a committed maintainer? Can we make any plan of action for making this library release-ready or are we giving up on it? -Ryan

2 3

[optional] little addition
by Arno Schödl 07 Mar '09

07 Mar '09

I just started using boost::optional, and this proved to be generically useful, but I believe is currently not in boost::optional: template< class T, class Tcompatible > bool optional_assign( T& t, boost::optional<Tcompatible> const& optt ) { if( optt ) { t=*optt; return true; } else { return false; } } so you can write boost::optional< TMyValue > TryToGetT(); T t; if( !optional_assign( t, TryToGetT () ) { ... other way to get t ... } instead of the more verbose: boost::optional< TMyValue > TryToGetT(); T t; boost::optional< TMyValue > const& optt=TryToGetT(); if( optt ) { t=*optt; } else { ... other way to get t ... } get_optional_value_or is similar, but the alternative must be an expression and is eagerly evaluated, both of which may be undesirable. Arno -- Dr. Arno Schoedl · aschoedl(a)think-cell.com Technical Director 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 Charlottenburg, HRB 85229

4 23

[1.38.0] PDF package of Boost documentation released.
by John Maddock 07 Mar '09

07 Mar '09

Folks, A package containing PDF versions of Boost's documentation is now available for Boost-1.38.0 from the usual sourceforge download site: http://sourceforge.net/project/showfiles.php?group_id=7586&package_id=15971… Please note that due to the diverse range of tools in use within Boost it has not been possible to produce PDF's for all of Boost's libraries, those currently included as PDF's are: accumulators any array asio bimap range complex-tr1 concepts config conversion date_time foreach function hash interprocess intrusive iterator math-gcd math mpi octonion optional phoenix program_options proto python_tutorial quaternion ref regex scope_exit signals static_assert string_algo thread tr1 tribool type_traits typeof units unordered variant xpressive Documentation for the following tools are also included in this package: bjam boost_build boostbook quickbook Regards, John Maddock.

6 9

[serialization] Text/Binary archive Is there a bug?
by Kasra 07 Mar '09

07 Mar '09

Hi guys, I was working withe boost.serialization and found a peculiar problem: when I use a binary archive I successfully serialize the objects but fail to deserialize them, while with text archive both of the operations occur without a problem!! Is there a special note about binary archives that I haven't done or could this be a bug? -- Kasra

2 1

Formal Review: Boost.RangeEx
by Thorsten Ottosen 06 Mar '09

06 Mar '09

Dear Developers and Users, It's my pleasure to announce that the review of Neil Groves' RangeEx library starts today and lasts until March 3, 2009. What is it? +++++++++++ The library provide two very useful extensions to the range library 1. Range-based algorithms. E.g. boost::sort( rng ); which is a convenient wrapper of instead of std::sort( boost::begin(rng), boost::end(rng) ); But the new interface also allows for more expressive code because (on the fly) composition of algorithms suddenly is possible. 2. Range adaptors. E.g. std::vector<int> vec = ...; boost::copy( vec | boost::adaptors::reversed, std::ostream_iterator<int>( std::cout ) ); where the expression "vec | boost::adaptors::reversed" wraps the iterators of the range on the left in reverse iterators. The library provides a wide range (no pun intended) of Range adaptors, and they are a powerful way to create ranges on the fly and pass them to algorithms. Getting the library +++++++++++++++++++ The library may be downloaded from http://www.cs.aau.dk/~nesotto/boost/range_ex.zip or from the Boost vault under "Algorithms". The docs may be browsed online here http://www.cs.aau.dk/~nesotto/boost/libs/range/ Please note that the documentation is integrated with the current Range ilbrary. Therefore the relevant sections for the review is http://www.cs.aau.dk/~nesotto/boost/libs/range/doc/adaptors.html and http://www.cs.aau.dk/~nesotto/boost/libs/range/doc/algorithms.html The code may be browsed here: http://www.cs.aau.dk/~nesotto/boost/boost/range/ Notice the library is header only (exception: the adaptor tokenized() depends on Boost.Regex). Writing a review ++++++++++++++++ If you feel this is an interesting library, then please submit your review to the developer list (preferably), or to the review manager. Here are some questions you might want to answer in your review: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick - reading? In-depth study? - Are you knowledgeable about the problem domain? And finally, every review should answer this question: - Do you think the library should be accepted as a Boost library? Be sure to say this explicitly so that your other comments don't obscure your overall opinion. Special considerations ++++++++++++++++++++++ Various RangeEx like libraries have been implemented in the past. You might want to compare with those libraries when you form your oppinion: 1. John Torjo's range lib http://rangelib.synesis.com.au/libs/boost-rangelib-20040913.zip http://torjo.com/rangelib/index.html 2. Adobe's ASL libraries include range-based algorithms: http://stlab.adobe.com/group__algorithm.html I'm looking forward to your review. best regards Thorsten, Review Manager

18 101

Re: [boost] [math] Does any one interesting in calculating derivative for a expression automatically?
by Brandon Kohn 06 Mar '09

06 Mar '09

-------------------------------------------------- From: "Dongfei Yin" <yin.dongfei(a)gmail.com> Sent: Friday, March 06, 2009 8:04 AM To: <boost(a)lists.boost.org> Subject: Re: [boost] [math] Does any one interesting in calculating derivative for a expression automatically? > You know, there are too many functions in math, so I think I can't > implement all of them, the functions included in standard library is > enough for me. and I will make it easy to be extended. what do you think > about it, I mean how many functions should I implement. > My advice would be to make the interface for supporting math functions extensible and held at arms length. The std math functions like pow, sin etc are generally working only with native types. There are those among us that use things like GMP or rational number libraries with unlimited precision for our numerical types. In these cases we have either defined our own trig or transcendental functions or had them supplied with a 3rd party lib. It would be nice to be able to generate derivative expressions which then may be applied to these types and with the use of our specialized math functions. Hope this helps, With regards, Brandon

1 0

Re: [boost] [math] Does any one interesting in calculating derivative for a expression automatically?
by Dongfei Yin 06 Mar '09

06 Mar '09

Hi Chris, The basic theory is same, but to do it at compile time, it can not be as simple as run time. CppAD do it during run time. type in run time is not so important as compile time. It can be done not only by operator overloading, but also by template specializing. As I say, when you get d(_x * _x, _x), that is a functor, then you want d(d(_x * _x, _x), _x), you see that there is no chance for operator to do anything, that means the result of d(_x * _x, _x) should be simplified before d(d(_x * _x, _x), _x) by template secializeing. Another example, Define hypersphere<N> as (pi^(N/2)*r^N) / gamma(N/2 + 1), suppose N is known at compile time,if all the type are under control, think about (double_<pi>^(int_<N>/2)*var(r)^int_<N> / gamma(int_<N)>/2 + 1), all the type can be controlled, then N/2 can be calculated during compile time. by if just using operator overloading, it can only be done during run time. you can not overload operator+(int, int) (just a example, actually, it can be optimized by compiler automatically). Dongfei. > While not strictly the same, there are all sorts of C++ based packages > out there for doing this kind of thing. The approach taken is > 'automatic differentiation', and it basically works by applying the > chain rule to every individual step in a sequence of operations. One > approach to doing this is through operator overloading, and replacing > the underlying 'double' class with something that maintains the > appropriate state. There are already some nice open source packages out > there for doing this. More info: > > http://en.wikipedia.org/wiki/Automatic_differentiation > http://www.autodiff.org/ > http://www.coin-or.org/CppAD/ > > Cheers, > > Chris >

1 0

Re: [boost] [math] Does any one interesting in calculating derivative for a expression automatically?
by Dongfei Yin 06 Mar '09

06 Mar '09

Hi Bruno, Till now, it can only work with polynomial and trigonometric functions. and I have a good idea of simplifying a expression. as you said, if N is compile time known, it should be int_<N>, then the expression with it can be simplified. As the hypersphere talked before, if N=2, and the volume expression will be simplified from (int_<N>^(int_<N>/int_<2>)*var(r)^int_<N>) / gamma(int_<N>/int_<2> + int_<1>) to int_<pi>*var(r)^int_<2> if gamma() has been specialized. Till now, (_x*_x*_x) is a functor, it can be simplified to something like pow(_x, int_<3>). without using d(...), it can be used to simplify expression as we talked before. this is another use of it. You know, there are too many functions in math, so I think I can't implement all of them, the functions included in standard library is enough for me. and I will make it easy to be extended. what do you think about it, I mean how many functions should I implement. My main purpose is calculating derivative easily, of course simplify expression is a important part, I am working on it. Dongfei.

1 0

Boost package maintenance for Cygwin
by bnv＠nc.rr.com 06 Mar '09

06 Mar '09

I make use of Boost in a Cygwin environment and was happy to see it supported as a package. Unfortunately, the current package is based on 1.33.1 and there have been many updates since. The maintainer has indicated difficulty working with the Boost distribution (see below, from the main cygwin mailing list), and has stopped supporting the package. I'm not the right person to take it over, but have an interest in seeing it maintained, and thought it worth bringing this to the attention of the boost community to potentially look into the issue(s). Thanks, Brian > I have given up on Boost package on Cygwin. Boost build AFAIK does not > follow the naming conventions Cygwin has for DLLs (or did not the last > time I checked) and I do not have the willpower to hack it into submission. > > If you feel like taking over the Cygwin Boost package, try Boost Cygport > as starting point for a new Cygwin package. > > - -- > wilx

2 1

Re: [boost] [math] Does any one interesting in calculating derivative for a expression automatically?
by Dongfei Yin 06 Mar '09

06 Mar '09

Hi Joel, I it is easy to map it onto d<N>(f,v), but I think it is difficult to be optimized for N=1, 2, 3 ... because to calculate the derivative of d<5>(f,v), actually, d<1>, d<2> ... d<5> will be calculated . but after each derivative is calculated, it will be simplified before next step. now the result of derivative expression can be saved as a functor, so d(d(x*x,x),x), y = d(x*x,x); d(y,x); is one of my purpose. I will implement d<N>(...), that is a good idea and convenience, thank you. Dongfei. > Can't this be mapped onto a d<N>(f,v) function that is optimized for N = > 1,2,3,... ? > I bet that if you use proto, matching d(d(d( ... )))) and repalcing by > d<N>(...) should be easy. > > Do you perform your derivation recursively on the derivative degree (ie > d(d(x*x,x),x) is y = d(x*x,x); d(y,x);) > If yes, you may want to use coarser grain. Let's say you specialized d() > d<2>() and d<3>() for ex. Computing d<5> > is d<2>(d<3>()) instead of d(d(d(d(d()))). Of course, using d,d2, d4 is > maybe a better option so you cna use bit representaiton of derivative > degree to find how to combine the derivative. >

1 0

An analogue of boost.function with multiple signatures
by Ji�� Pale�ek 06 Mar '09

06 Mar '09

Hello, I'd like to have an object similar to boost::function, but with multiple function signatures. Eg. something like that multifunction<std::string(std::string), float(float), unsigned(unsigned)> mf; mf=_1 + _1; // I mean boost::lambda::_1 mf("ab"); // should be "abab" mf((UINT_MAX/2)+1); // should be 0 mf((UINT_MAX/2)+1.0); // should be UINT_MAX+1.0 Would it be possible/feasible to change boost::function to allow this (as opposed to implementing it separately from boost::function)? Was something like this even proposed before (I vaguely recall something, but couldn't google anything useful, so I may be wrong)? Regards Jiri Palecek

2 2

BGL question about districting
by Barend Gehrels 06 Mar '09

06 Mar '09

Hi, We're about an automated districting tool. We want to create Y districts from X polygons, all having a specific value (e.g. area or inhabitants), where the total value of each district is as similar as possible and each district is also as similar as possible. Let's call the value the "potential". Of course this problem is NP-hard so we're glad with the first solution or e.g. the first ten solutions. We thought to implement this by the Boost Graph Library. First we detect neighbour relations with our own Geometry Library (using the still-to-build "touches" relationship). We've a graph then and can divide the graph into subgraphs, each having connected nodes and an (nearly) equal "potential". I've some experience with BGL, having used the "connected_components". But I cannot find an appropriate algorithm for this problem, if it is available. Actually it even could be a "network flow" algorithm dividing the total potential by Y, and starting at some point flowing the potential through the graph. But all network flow algorithms seem to be on directed graphs. This is an undirected graph. It it is not possible with a standard BGL algorithm I think we can still solve it using BGL and e.g. breadth-sort-first, but just want to verify if it is possible or maybe by an unexpected workaround. Thanks, Barend

4 5

Blocking Queue implementation in C++
by Filip Klasson 06 Mar '09

06 Mar '09

Hi, I need to create a Blocking queue implementation in *C++* with the help of Boost libraries and i am looking for some advise. What i need is a queue with linked nodes. The queue needs to be ordered as FIFO (first-in-first-out). I need the following functionality (Functionality from BlockingQueue implementation in Java) INSERT: Insert new items into the queue and if there is no space the queue needs to wait until space is available. RETRIEVE: Retrieve and removes the element that has waited the longest. If there is no elements in the queue it waits until an element becomes available. SIZE: Return the number of elements in the queue. POLL: The same as retrieve but only waits for a specified time for items to become available. I found a messageQueue that looks something like what i need (found here: http://www.boost.org/doc/libs/1_36_0/boost/interprocess/ipc/message_queue.h…) is that correct? /Filip

1 0

[itl] Preview 4 of the Interval Template Library
by Joachim Faulhaber 05 Mar '09

05 Mar '09

Dear list, I am happy to announce that the Interval Template Library (Boost.Itl) converges to a state, that conforms the standards of the boost libraries. It now contains substantial test suites and almost complete quickbook documentation. I hope it will soon be mature for a formal review after a last round of feedback and subsequent improvements. Since the last progress report in November last year the following work has been done. + Interoperability of interval_containers: Addition, subtraction, intersection and symmetric difference are now interoperable for all combinations of interval containers that make sense: You may for instance intersect a split_interval_map with an interval_map, an interval_set an interval or an element. + Added symmetric difference and renamed operators in accordance to other set class templates like e.g. boost::dynamic_bitset. + Introduced infix operators as itl::namespace global functions that are interoperable between interval_maps, sets, intervals and elements, so far as the combinations make sense. + Operators are now +=, +, |=, | : Set union / Map union with aggregation -=, - : Set difference / Map union with aggregation &=, & : Set intersection / Map intersection with aggregation ^=, ^ : Set symmetric difference / Map symmetric difference with aggregation. + Extended the test suite, specifically for the new operators and their overloadings. + Wrote quickbook documentation for the library. Please note that the original ITL as presented in May 2008 has been split into 3 parts and only the *first* part is prepared for boost now: itl : Core library, interval containers, PREPARED FOR BOOST itl_xt : Extensions like histories and generalized crosstables validate: The law based test automaton (LaBatea). A validation tool using laws aka axioms. So please focus on the core part (itl). Download the current version 'preview 4' from the boost vault's containers section: itl.zip http://www.boostpro.com/vault/index.php?action=downloadfile&filename=itl.zi… If you are interested in extended parts or LaBatea you may download all parts as itl_plus.zip http://www.boostpro.com/vault/index.php?action=downloadfile&filename=itl_pl… The quickbook generated documentation is included in the zip files and is also availabe 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/ The documentation has a focus on tree aspects (1) A short introduction, that wants to be easy to understand and to provide good and use case related examples: http://herold-faulhaber.de/boost_itl/doc/libs/itl/doc/html/index.html#boost… http://herold-faulhaber.de/boost_itl/doc/libs/itl/doc/html/boost_itl/exampl… (2) Synoptical representations that allows to see the complete 'picture' of the library. For instance the function matrix http://herold-faulhaber.de/boost_itl/doc/libs/itl/doc/html/boost_itl/interf… is supposed to give a complete overview over the most important functions across all itl containers. (3) A description of the semantics which is characterized by sets of laws that apply for the different interval containers. The semantical analysis, based on sets of laws, was a quite interesting work, where software development sometimes transformed into software discovery guided by the validation tool LaBatea ;) My main finding out of that process was, that the semantics of the aggregating itl::Maps is determined by the semantics of their data or codomain parameter U, so that if U is model of concept C then itl::Map<T,U> is model of C which is stated in section concept induction: http://herold-faulhaber.de/boost_itl/doc/libs/itl/doc/html/boost_itl/semant… All your feedback is welcome. Cheers Joachim

3 4

[time series] What happened to this library?
by Christian Henning 05 Mar '09

05 Mar '09

Hi there, as far as I can tell this lib has been approved but it doesn't show up in boost. Why is it not in there? Thanks, Christian

11 21

Trunk Inspection Report fixed + other reminders
by Beman Dawes 05 Mar '09

05 Mar '09

The trunk Inspection Report is now cycling daily, with a new URL. See http://boost.cowic.de/rc/inspect-trunk.html The release branch Inspection Report also cycles daily. See http://boost.cowic.de/rc/inspect-release.html The links to these and other useful "State of Boost" links are found at http://www.boost.org/development/testing.html --Beman

2 1

Submission of a new application to 'Who's Using Boost'
by Carlo Medas 05 Mar '09

05 Mar '09

Dears, this is a submission of a brand new free application which is using boost. It is also a chance to say thanks to you all. Boost is amazing and thanks to your excellent work we've been able not only to speed up the development but also to make the new app available on several platforms, without a huge effort. Application name: fing Company/team name: overlook App description: Fing is the ultimate command line tool for network and service discovery; born from the ashes of Look@LAN, it takes advantage of a brand new cross-platform network engine and reaches an impressive discovery sharpness and speed. Its network discovery reaches 100% hit in any ethernet-based network. Supported operating systems: Linux, Mac OS, Windows. Boost parts used: thread, system, filesystem, asio, multi-index containers, smart pointers, program options URL: http://www.over-look.com Thank you all once more for your great work, Overlook team Carlo Medas, Daniele Galdi, Marco De Angelis

2 1

Re: [boost] [math] Does any one interesting in calculating derivative for a expression automatically?
by Dongfei Yin 05 Mar '09

05 Mar '09

Hi Bruno, thank you for your interesting, I will try to use proto, I never use it before. yes, It's technically feasible. but the type of all the symbol in the expression can not be the build-in type. and gamma function should be a special version. integral is more difficult than derivative, else, to calculate the volume will be more easier. to simplify the expression is a interesting work. especially in compile time. BTW: I do not know how to upload source to this system, do you know how to do that? Dongfei. > >From my point of view, the main interest would be to compute > expressions containing some compile-time values provided by the user. > For example I want to calculate the volume of a hypersphere which is: > (pi^(N/2)*r^N) / gamma(N/2 + 1), with dimension N known at > compile-time. If the user happens to work only with N=2, that is > circles, I want the resulting expression to be as effective as a > hand-written pi*r^2 (the volume of a hypersphere<2> is the area of a > circle). It's technically feasible. > > Bruno > >

3 2