- Boost - lists.preview.boost.org

Re: [boost] Boost building with CMake
by Boris Gubenko 17 May '07

17 May '07

Johan Nilsson wrote: > While I'm at that point (cross-platform) - does anyone know if CMake is > available for OpenVMS? I'm well aware that Boost.Build isn't compatible > with OpenVMS currently, but I also believe that porting the current > system would not be impossible as most of the Jam stuff is VMS-capable. I don't know if Cmake is available VMS. From http://www.vtk.org/Bug/bug.php?op=show&bugid=3974&pos=6 it looks like the only problem with Cmake on VMS is that it does not generate MMS rules (as you, probably, know, MMS is VMS native make, it is close to Posix make. Since VMS has gmake (on the Freeware CD) and Cmake can generate rules for gmake, I'm not sure what's the point in adding support for MMS to Cmake. Anyway, I'll try to find out if Cmake was ported to VMS and will get back to you. Thanks, Boris

2 1

[math toolkit] Review results
by Matthias Schabel 17 May '07

17 May '07

I'd like to congratulate John Maddock, Paul Bristow, and their contributors on putting together an outstanding submission to Boost. It is rare to have complete unanimity among votes, but in this case there were no dissenters to accepting either the special functions or the statistical distributions portions of the library, so I'm glad to announce that it has been accepted for inclusion in Boost. Thanks to the many participants in the review : Gottlob Frege, Guillaume Melquiond, Johan Råde, Arnaldur Gylfason, John Phillips, Mark Van De Vyver, Stephan Tolksdorf, Hubert Holin, Seweryn Habdank-Wojewodski, Kevin Lynch, Leonaldo Peralta, Jeff Garland, and Stefan Seefeld (apologies for anyone I might have missed in this list). Here is a brief summary of the relatively few major issues that were raised during the course of the review : 1) Error handling is an issue that arises because this library is at the frontier between traditional numerical libraries and a (hopefully) new breed of such libraries that utilize modern programming techniques and facilities. Jeff Garland suggested that the default behavior should be to throw an exception, with errno being an option enabled by macro. It would also be nice to have more granular control over which instances throw exceptions and which do not (so, for example, a user could choose to ignore denormals). It was also suggested that additional, more transparent exceptions be provided for cases such as failure to converge rather than reusing tools::logic_error. 2) Jeff Garland also pointed out, rightly in my opinion, that attempts to use statistical functions that do not exist for a distribution should fail to compile rather than leading to a runtime error (e.g. mean of a Cauchy distribution). A reasonable method of implementing this should be devised or a strong argument for why it is not feasible/desirable provided. 3) Arnaldur Gylfason did some nice accuracy and performance testing vs. R. It was noted that the performance of quantile functions in this library was significantly worse than R, unlike non-quantile functions. He also pointed out that, for discrete distributions, the current behavior of returning fractional results for quantiles may not be the expected one. These issues should be addressed and documented. 4) Hubert Holin suggested the possibility of use of a policy parameter to choose between speed and accuracy. Another interesting possibility would be to allow the user to specify the desired precision either at compile or runtime. 5) It appears that this library will actually become two "sublibraries" within the Boost.Math library. Currently all code lives in the boost::math namespace; I would like to at least see a discussion of the possibility of having boost::math::special_functions, boost::math::statistics, and, perhaps, boost::math::statistics::distributions namespaces - as more functionality gets added to boost::math, collisions will become more likely, so some thought given now to logical partitioning may save pain later. During the review a number of typos and minor issues of documentation were raised, which the authors will need to address if they haven't already. In particular, John Phillips noted that the rationale behind using rational (vs. polynomial) approximations be clarified, the derivation of coefficients be documented, and the list of special functions in the documentation be expanded to encompass all functions actually implemented in the library. Stephan Tolksdorf requested a table listing standard statistical tests and the corresponding library implementations and enumerated a number of other documentation issues. Overall, the library was very well received, and the authors are to be commended on the tremendous amount of care and effort devoted to its preparation. Matthias Schabel Review Manager

4 5

[random] lognormal_distribution fix
by Tim Blechmann 17 May '07

17 May '07

hi all, i just figured out, that the problem, that was discussed in this thread: http://lists.boost.org/Archives/boost/2003/02/44916.php somehow hasn't been fixed ... i've attached a small regression test, showing the problem ... the fix is rather trivial, though: --- boost/random/lognormal_distribution.hpp (revision 681) +++ boost/random/lognormal_distribution.hpp (working copy) @@ -60,8 +60,8 @@ // compiler-generated copy ctor and assignment operator are fine - RealType& mean() const { return _mean; } - RealType& sigma() const { return _sigma; } + RealType mean() const { return _mean; } + RealType sigma() const { return _sigma; } void reset() { _normal.reset(); } template<class Engine> would be great to see this fixed ... cheers, tim -- tim(a)klingt.org ICQ: 96771783 http://tim.klingt.org The aim of education is the knowledge, not of facts, but of values William S. Burroughs

2 2

[GSoC 07] Visualizing STL
by Jake Voytko 17 May '07

17 May '07

I'm working on the Summer of Code project "Visualization of STL Containers", the goal of which is to create 2D graphs of data stored in STL containers. (For more details, see the Trac link at the bottom of the email) The basic organization of the code is a "svg" class for working directly in the SVG format, and a "svg_graph" class that inherits from "svg" that the user uses as an interface. My current predicament is the design of the "svg" class itself. My personal view of the "svg" class was simply that it separates the handling of the svg document from the handling of the graphing logic. This was the way I designed the rapid prototype, and ostensibly, it worked. In my head, the "svg" class could technically be implemented without any external interface for users, and exist as a worker class. However, this doesn't seem at all ideal from a long-term planning perspective. I want to know if people would want me to spend some of the time of this project making the "svg" class act as a stand-alone (yet not fully implemented, obviously) SVG solution. Should it have a proper user interface? Should it be extensible to a full-blown SVG solution in the future? More specifically, are people looking for both a SVG manipulating class *AND* a way to graph STL data? There were suggestions of even treating the "svg" class as manipulating a document as per the DOM standard, which is indeed possible, but would require a complete overhaul of my current design, which I set up my current design in order to make optimizations on space and speed in the future. I see the obvious long term benefits of this method, but I question the benefit to the current project. I only have a finite amount of time in which to complete this, and it seems like it would take away from the stated goal. However, I'd be more than glad to implement a DOM if there were clamorous demand for this feature! Thank you for your time Jake Voytko Link to wiki on the project: http://svn.boost.org/trac/boost/wiki/soc/2007/VisualizationOfContainers

5 5

Trac milestones
by Vladimir Prus 17 May '07

17 May '07

Is it possible for somebody with enough karma to create "1.34.1" milestone in trac, so that bugs can be assigned to that milestone? - Volodya

4 4

[algorithm][string] example fails to compile with bjam.v2
by JD 17 May '07

17 May '07

Hi, bjam on 1_34_0 and on HEAD fails to compile algorithm/string/example: *********************************************************************** bjam --toolset=msvc-8.0 warning: Graph library does not contain optional GraphML reader. note: to enable GraphML support, set EXPAT_INCLUDE and EXPAT_LIBPATH to the note: directories containing the Expat headers and libraries, respectively. warning: skipping optional Message Passing Interface (MPI) library. note: to enable MPI support, add "using mpi ;" to user-config.jam. note: to suppress this message, pass "--without-mpi" to bjam. note: otherwise, you can safely ignore this message. warning: Python location is not configured warning: the Boost.Python library won't be built Building Boost.Regex with the optional Unicode/ICU support disabled. Please refer to the Boost.Regex documentation for more information (don't panic: this is a strictly optional feature). Jamfile:10: in modules.load rule subproject unknown in module Jamfile</G:/Program Files/boost-cvs/boost/libs /algorithm/string/example>. G:/Program Files/boost-cvs/boost/tools/build/v2/build\project.jam:312: in load-j amfile G:/Program Files/boost-cvs/boost/tools/build/v2/build\project.jam:68: in load G:/Program Files/boost-cvs/boost/tools/build/v2/build\project.jam:170: in projec t.find G:/Program Files/boost-cvs/boost/tools/build/v2\build-system.jam:237: in load G:\Program Files\boost-cvs\boost\tools\build\v2/kernel\modules.jam:261: in impor t G:\Program Files\boost-cvs\boost\tools\build\v2/kernel/bootstrap.jam:132: in boo st-build G:\Program Files\boost-cvs\boost\boost-build.jam:9: in module scope *********************************************************************** Seems that the jamfile has not been updated for the new build system. I'm no expert in bjam and I don't find the documentation very helpful but the Jamfile attached can at least compile most of the example (apart regex_example). Thanks. JD # Boost string_algo library examples Jamfile --------------------------------- # # Copyright Pavol Droba 2002-2003. Use, modification and # distribution is subject to the Boost Software License, Version # 1.0. (See accompanying file LICENSE_1_0.txt or copy at # http://www.boost.org/LICENSE_1_0.txt) # # See http://www.boost.org for updates, documentation, and revision history. exe conv_example : conv_example.cpp : <include>$(BOOST_ROOT) : ; exe predicate_example : predicate_example.cpp : <include>$(BOOST_ROOT) : ; exe find_example : find_example.cpp : <include>$(BOOST_ROOT) : ; exe replace_example : replace_example.cpp : <include>$(BOOST_ROOT) : ; exe rle_example : rle_example.cpp : <include>$(BOOST_ROOT) : ; exe trim_example : trim_example.cpp : <include>$(BOOST_ROOT) : ; exe regex_example : regex_example.cpp : <include>$(BOOST_ROOT) : ; exe split_example : split_example.cpp : <include>$(BOOST_ROOT) : ;

3 2

bjam FAQ
by Michael Walter 17 May '07

17 May '07

Hi, I've stumbled on that "Duplicate name of actual target" error; unfortunately the FAQ doesn't seem to solve my problem, since I'm trying to compile two different files which happen to have the same basename, i.e. something like this: lib foo : bar/test.cpp baz/test.cpp ; What's the proper way to handle this situation, except for manually specifying the object file name? Regards, Michael

5 4

[iostreams] Entire iostreams library outdated in 1.34.0?
by Kim Barrett 17 May '07

17 May '07

Following up on a discussion started on the boost-users list, under the same subject. It seems that a significant number of changes were made to the boost.iostreams library on the RC_1_33_0 branch, but never merged into the trunk. There are also a few changes on the RC_1_34_0 branch that have not been merged to into the trunk. There has also been some work on the trunk, some of which is on one of those branches, a few cases of merges between one of those branches and the trunk, and I found at least one case of apparent merging with code rearrangement or other changes (at least, diff seemed to not match up the (similar by eye) changes). So basically there is a bit of a mess in the iostreams library. I'm volunteering to help clean it up. I'm planning to put together a patch to the trunk, and another patch to the RC_1_34_0 branch, such that * changes that are presently only on the RC_1_33_0 or RC_1_34_0 branch are merged to trunk * changes that are presently only on the RC_1_33_0 branch are merged to the RC_1_34_0 branch. A preliminary skim of differences doesn't look too bad; hopefully I won't find anything too icky. Some issues / questions: * I can test these changes against a couple of versions of gcc. I can't test against anything else. So I'll need help with that. * Somebody else should probably review the patches. * I don't have commit privilages, so someone else will need to take care of that step. * Thomas would of course need to approve any changes to the RC_1_34_0 branch. The library including the changes on the RC_1_33_0 branch tested as part of the 1.33.x series of releases, but testing with those changes stopped once testing resources were redirected away from that series. So there is some risk that some of these changes might prove incompatible with other parts of the 1.34.0 release. From a quick skim, that doesn't look to likely, but it is a risk. * Obviously 1.34.0 has gone out. So any changes on the RC_1_34_0 branch would only be picked up by a 1.34.1 release.

3 5

Re: [boost] "beyond graphs"
by Jeremy Siek 16 May '07

16 May '07

Hi Gordon, On May 14, 2007, at 11:59 PM, boost-request(a)lists.boost.org wrote: > From: Gordon Woodhull <gordon(a)woodhull.com> > Date: May 14, 2007 11:45:23 PM MDT > To: boost(a)lists.boost.org > Subject: [boost] "beyond graphs" > Reply-To: boost(a)lists.boost.org > > > Hullo fellow Boosters, > > I am writing especially to those of you in Aspen, but also to > anyone out there who is interested in, or who has already > implemented, any kind of "meta" graph (network). I would like to > create or contribute to some Boost libraries for graphlike > structures / "metagraphs" / higher order graphs / whatchamacallits. > > Below I describe some ideas simplistically/vaguely, both for lack > of time and to try to grab the interest of people who have thought > about these things but perhaps not in quite the same way. > > So far I have thought of three general types of graphs which are > beyond the scope of graph libraries I know about: > - Graphs in metadata, i.e. graphs of C++ types. This seems to be > pretty easy to implement using MPL and I did this a couple of years > ago, though poorly. I.e. it's easy to create a BGL-like interface > with angle brackets instead of parentheses. :-) > - Graphlike structures which are not graphs. Actually any objects > which point to other objects form a graph of sorts; what we know as > "graph" happens to be the special case where an edge points to two > nodes and nodes point to a bunch of edges. What if there are more > types than just Node and Edge, or they don't look quite like that? > This is something like a Fusion for heterogeneous/polymorphic graphs. > - (Here is my root problem.) Graphs that refer to other graphs, > such as subgraphs, graphs at different layers of detail (where a > node/edge at one level corresponds to a subgraph at another level), > constraints on graphs... > I have maybe mostly figured out a system for the last, which relies > on the other two. Any of the three might be generally useful; I > really need the last because it's prohibitively difficult and/or > inefficient to maintain correspondences between graphs, and all of > my dynamic graph drawing problems keep spawning more corresponding > graphs! All very interesting stuff! On the graphs in metadata/metaprogramming... I'm about to embark on a project to enable the use of normal run-time language features during compile time. Perhaps ultimately this would mean we could use the BGL as-is to manipulate type information at compile time. Of course, this won't be achieved for some years, so looking at what can be done in current C++ is also very interesting. > Disclaimer: because I'm interested in dynamic (changing) graphs, > I'm looking at the problem as a bunch of node and edge objects > pointing to each other, and using intrusive containers for > efficiency/locality of reference. But I'd like to generalize > wherever possible. > > Anyone who is here in Aspen who's interested in these ideas, please > seek me out. Anyone else, please write me. I think I have some > good ideas about how to proceed, and I will write up more specific > descriptions, but first I would like to know what of this space has > already been explored, additional requirements from similar > applications, etc. > My impression is that, with the reuse of MPL, Fusion, BGL, STL, and > intrusive containers, none of this would require a lot of code, but > there is a LOT to be designed and abstracted. I see it as at least > three libraries, each depending on the last in the order above. Wish I was still in Aspen to talk with you more about this! Cheers, Jeremy ______________________________________ Jeremy Siek <jeremy.siek(a)colorado.edu> http://www.cs.colorado.edu/~siek/ Visiting Assistant Professor Department of Computer Science University of Colorado at Boulder

1 0

[lexical_cast] doc update
by Alexander Nasonov 16 May '07

16 May '07

I'm going to commit to HEAD two new sections 'Frequently Asked Questions' and 'References' and also update 'Changes' section. Any objections, corrections etc? New documentation is here http://194.6.223.221/~nasonov/lexical_cast.htm Frequently Asked Questions Q: Why lexical_cast<int8_t>("127") throws bad_lexical_cast? A: The type int8_t is a typedef to char or signed char. Lexical conversion to these types is simply reading a byte from source but since the source has more than one byte, the exception is thrown. Please use other integer types such as int or short int. If bounds check is important, you can also call numeric_cast: numeric_cast<int8_t>(lexical_cast<int>("127")); Q: The implementation always resets the ios_base::skipws flag of an underlying stream object. It breaks my operator>> that works only in presence of this flag. Can you remove code that resets the flag? A: May be in a future version. The is no requirement in [N1973] to reset the flag but remember that [N1973] is not yet accepted by the commitee. By the way, it's a greate opportunity to make your operator>> conform to the standard. Read a good C++ book, study std::sentry and ios_state_saver. References * [N1973] Kevlin Henney, Beman Dawes, Lexical Conversion Library * Proposal for TR2, N1973. * [Tuning] Alexander Nasonov, Fine Tuning for lexical_cast, * Overload #74, August 2006. Changes August, October 2006: * Better performance for many combinations of Source and Target * types. Refer to [Tuning] for more details. -- Alexander Nasonov http://nasonov.blogspot.com

5 5

Boost Logging library - first draft
by JD 16 May '07

16 May '07

Hello, So here is the question: "Is there any interest in a logging library for boost?" John Torjo did not answer my mail, beside I looked at pantheios. it seems a little bit complex... My idea is that a logging library should be _simple_ to use. Here is a small example: // snippet on #include <fstream> #include <boost/logging.hpp> int main(int argc, char **argv) { BOOST_LOG_INIT(("[" >> boost::logging::level >> "]," >> boost::logging::filename >> "(" >> boost::logging::line >> ")," >> boost::logging::time >> "," >> boost::logging::trace >> boost::logging::eol), // log format 2); // log level BOOST_LOG_ADD_OUTPUT_STREAM(new std::ofstream("./output.log")); BOOST_LOG_ADD_OUTPUT_STREAM(&std::cout); BOOST_LOG(1, "something"); BOOST_LOG(2, "something else"); BOOST_LOG(3, "doesn't matter"); char you_want[256] = "you want"; BOOST_LOG(1, "Let's say " << you_want << " to display " << 2); return 0; } // snippet off You can find the first draft of a logging library in the boost Sandbox vault. It consists of a header files, some examples and documentation. Put the file at your boost root folder and unzip it. It compiles with msvc and vc-8_0. I'll try with gcc asap. So let me know if you think it worth something or not. JD

15 34

Improving Boost Build?
by John Maddock 16 May '07

16 May '07

Irrespective of what happens with the CMake vs BBv2 debate, it's apparent that there is still plenty of support for bbv2: indeed, I would echo comments that it's a pleasure to use, provided you don't need to dig in and write new rules yourself :-) So, can we improve things to the point where 99% of the remaining issues are dealt with? I think so, the things that come to mind are: 1) Consistent command line options (as Vladimir has already brought up): use "feature=xyz" or "--feature=xyz" consistently throughout. The first of these looks to be the more commonly used within BBv2 at present, so I'd vote for that, and keep "-" and "--" options for controlling how bjam itself behaves (as in the -d and -a options). 2) Better docs. Yes, I know it's been said before, but we really must get the existing toolsets and their options documented. This need not take too long if someone would step up and volunteer to do it. 3) Most of the current problems seem to stem from folks trying to build with non-default options. Can we have a consistent way (across toolsets) to inject compiler or linker specific flags into the command line: actually I suspect we may have this already? If so it needs documenting and pointing to from the getting started docs. Likewise a consistent way of name custom-name-mangling the resulting libraries. 4) Relating to the above, I wonder if we could have a "generic" toolset that used the environment variables CXX, CXXFLAGS, LDFLAGS in much the same way that the autotools do. If necessary the top-level configure script could make use of this to behave in a more autotools-like manner. 5) More BBv2 developers :-) I actually think we do tools rather well - both quickbook and BBv2 are so very nearly where they need to be, but just need that final push that only more developers (and a wider audience) can bring. Part of the problem here is that Boost attracts folks interested in C++ libraries, and who don't necessarily want to spend their time hacking Jamfiles or whatever. I'm not sure how solve this, unless maybe these tools can acquire a life of their own outside of Boost as well as within it. Anyway these are just a few random thoughts, hopefully presented in the spirit of trying to find a positive way forward. I'll look forward to seeing what people think, Regards, John Maddock.

5 4

1.34 RC3
by Christian Henning 16 May '07

16 May '07

Hi there, I'm compiling RC3 using VC7.1 SP1 and it's looks quite good. Although I got several batches of "Could not find .... " I compiled boost using: bjam --build-dir=c:\boost_temp --toolset=msvc stage > log.txt cl : Command line warning D4025 : overriding '/GR' with '/GR-' Could Not Find C:\boost_1.34\boost_1_34_0\stage\lib\boost_date_time-vc71-mt.lib Could Not Find C:\boost_1.34\boost_1_34_0\stage\lib\boost_filesystem-vc71-mt.lib Could Not Find C:\boost_1.34\boost_1_34_0\stage\lib\boost_graph-vc71-mt.lib Could Not Find C:\boost_1.34\boost_1_34_0\stage\lib\boost_iostreams-vc71-mt.lib Could Not Find C:\boost_1.34\boost_1_34_0\stage\lib\boost_program_options-vc71-mt.lib Could Not Find C:\boost_1.34\boost_1_34_0\stage\lib\boost_python-vc71-mt.lib Could Not Find C:\boost_1.34\boost_1_34_0\stage\lib\boost_regex-vc71-mt.lib Could Not Find C:\boost_1.34\boost_1_34_0\stage\lib\boost_serialization-vc71-mt.lib Could Not Find C:\boost_1.34\boost_1_34_0\stage\lib\boost_wserialization-vc71-mt.lib Could Not Find C:\boost_1.34\boost_1_34_0\stage\lib\boost_signals-vc71-mt.lib Could Not Find C:\boost_1.34\boost_1_34_0\stage\lib\boost_prg_exec_monitor-vc71-mt.lib Could Not Find C:\boost_1.34\boost_1_34_0\stage\lib\libboost_test_exec_monitor-vc71-mt.lib Could Not Find C:\boost_1.34\boost_1_34_0\stage\lib\boost_unit_test_framework-vc71-mt.lib Could Not Find C:\boost_1.34\boost_1_34_0\stage\lib\boost_thread-vc71-mt.lib Could Not Find C:\boost_1.34\boost_1_34_0\stage\lib\boost_wave-vc71-mt.lib cl : Command line warning D4025 : overriding '/GR' with '/GR-' Could Not Find C:\boost_1.34\boost_1_34_0\stage\lib\libboost_date_time-vc71-mt-gd.lib Could Not Find C:\boost_1.34\boost_1_34_0\stage\lib\libboost_filesystem-vc71-mt-gd.lib Could Not Find C:\boost_1.34\boost_1_34_0\stage\lib\libboost_graph-vc71-mt-gd.lib Could Not Find C:\boost_1.34\boost_1_34_0\stage\lib\libboost_iostreams-vc71-mt-gd.lib Could Not Find C:\boost_1.34\boost_1_34_0\stage\lib\libboost_program_options-vc71-mt-gd.lib Could Not Find C:\boost_1.34\boost_1_34_0\stage\lib\libboost_python-vc71-mt-gd.lib Could Not Find C:\boost_1.34\boost_1_34_0\stage\lib\libboost_regex-vc71-mt-gd.lib Could Not Find C:\boost_1.34\boost_1_34_0\stage\lib\libboost_serialization-vc71-mt-gd.lib Could Not Find C:\boost_1.34\boost_1_34_0\stage\lib\libboost_wserialization-vc71-mt-gd.lib Could Not Find C:\boost_1.34\boost_1_34_0\stage\lib\libboost_signals-vc71-mt-gd.lib Could Not Find C:\boost_1.34\boost_1_34_0\stage\lib\libboost_prg_exec_monitor-vc71-mt-gd.lib Could Not Find C:\boost_1.34\boost_1_34_0\stage\lib\libboost_unit_test_framework-vc71-mt-gd.lib Could Not Find C:\boost_1.34\boost_1_34_0\stage\lib\libboost_thread-vc71-mt-gd.lib Could Not Find C:\boost_1.34\boost_1_34_0\stage\lib\libboost_wave-vc71-mt-gd.lib [snip] In the end I had 260 libs in my stage/lib folder. Is that about right? Thanks a lot to all people in this effort. Christian

4 4

Boost inspection notification (2007-05-16/RC_1_34_0) *X*
by Rene Rivera 16 May '07

16 May '07

Boost Inspection Report Run Date: 16:05:58 UTC, Wednesday 16 May 2007 An inspection program <http://www.boost.org/tools/inspect/index.html> checks each file in the current Boost CVS for various problems, generating this as output. Problems detected include tabs in files, missing copyrights, broken URL's, and similar misdemeanors. Totals: 11453 files scanned 909 directories scanned (including root) 193 problems reported Problem counts: 0 files with invalid line endings 0 bookmarks with invalid characters 3 invalid urls 101 broken links 22 unlinked files 22 file/directory names issues 1 files with tabs 9 violations of the Boost min/max guidelines 35 usages of unnamed namespaces in headers (including .ipp files) Summary: archive (3) bind (1) boost-root (1) build (1) date_time (1) doc (2) filesystem (33) graph (2) iostreams (3) lambda (3) math (8) more (4) mpl (4) multi_array (2) ptr_container (1) python (8) regex (1) regression (32) serialization (1) test (81) type_traits (1) Details: *R* invalid (cr only) line-ending *A* invalid bookmarks, invalid urls, broken links, unlinked files *N* file/directory names issues *T* tabs in file *M* uses of min or max that have not been protected from the min/max macros, or unallowed #undef-s *U* unnamed namespace in header |archive| boost/archive/basic_streambuf_locale_saver.hpp: *N* name exceeds 31 characters boost/archive/impl/xml_wiarchive_impl.ipp: *U* unnamed namespace at line 53 boost/archive/iterators/remove_whitespace.hpp: *U* unnamed namespace at line 57 |bind| boost/bind/placeholders.hpp: *U* unnamed namespace at line 25 |boost-root| index.htm: *A* broken link: doc/hmtl/date_time/details.html#changes |build| tools/build/v2/test/test_system.html: *A* unlinked file |date_time| libs/date_time/xmldoc/date_time_docs_howto.html: *A* unlinked file |doc| doc/html/boost_math/inverse_complex.html: *A* unlinked file doc/html/jam.html: *A* unlinked file |filesystem| libs/filesystem/doc/do-list.htm: *A* invalid URL (hardwired file): file://?/ *A* invalid URL (hardwired file): file://?/UNC/ libs/filesystem/doc/i18n.html: *A* broken link: convenience.htm#basic_recursive_directory_iterator *A* broken link: exception.htm *A* broken link: operations.htm *A* broken link: operations.htm#Do-the-right-thing *A* broken link: operations.htm#is_directory *A* broken link: operations.htm#is_file *A* broken link: operations.htm#status libs/filesystem/doc/index.htm: *A* broken link: ../build/Jamfile *A* broken link: convenience.htm *A* broken link: operations.htm#create_directory *A* broken link: operations.htm#create_hard_link *A* broken link: operations.htm#current_path *A* broken link: operations.htm#equivalent *A* broken link: operations.htm#file_size *A* broken link: operations.htm#initial_path *A* broken link: operations.htm#is_file *A* broken link: operations.htm#is_symlink *A* broken link: operations.htm#status *A* broken link: operations.htm#symlink_status *A* broken link: path.htm#Canonical *A* broken link: path.htm#Normalized *A* broken link: path.htm#default_name_check *A* broken link: path.htm#name_check_mechanism *A* broken link: path.htm#normalize *A* broken link: path.htm#operator_eq libs/filesystem/doc/portability_guide.htm: *A* broken link: path.htm#name_check_typedef libs/filesystem/doc/tr2_proposal.html: *A* invalid URL (hardwired file): file:///C|/boost/site/libs/filesystem/doc/operations.htm#complete_note |graph| libs/graph/example/file_dependencies.cpp: *M* violation of Boost min/max guidelines on line 139 libs/graph/test/serialize.cpp: *T* |iostreams| libs/iostreams/doc/acknowledgments.html: *A* unlinked file libs/iostreams/doc/concepts/multi-character.html: *A* unlinked file libs/iostreams/doc/installation.html: *A* broken link: ../../../tools/build/v1/build_system.htm |lambda| boost/lambda/core.hpp: *U* unnamed namespace at line 62 boost/lambda/detail/lambda_functors.hpp: *U* unnamed namespace at line 25 boost/lambda/exceptions.hpp: *U* unnamed namespace at line 24 |math| libs/math/test/common_factor_test.cpp: *M* violation of Boost min/max guidelines on line 146 *M* violation of Boost min/max guidelines on line 147 *M* violation of Boost min/max guidelines on line 193 *M* violation of Boost min/max guidelines on line 194 |more| more/cvs.html: *A* unlinked file more/getting_started/unix-variants.html: *A* broken link: ../../doc/html/thread/build.html#thread.build more/getting_started/windows.html: *A* broken link: ../../doc/html/thread/build.html#thread.build more/separate_compilation.html: *A* broken link: ../libs/config/test/link/test/Jamfile.v2 |mpl| boost/mpl/alias.hpp: *U* unnamed namespace at line 17 libs/mpl/doc/refmanual/for-each.html: *A* broken link: ./value-initialized.html |multi_array| boost/multi_array/base.hpp: *U* unnamed namespace at line 69 libs/multi_array/test/generative_tests.hpp: *U* unnamed namespace at line 57 |ptr_container| libs/ptr_container/doc/tutorial_example.html: *A* unlinked file |python| libs/python/doc/building.html: *A* broken link: ../index.htm libs/python/doc/tutorial/doc/html/python/hello.html: *A* broken link: ../../../../../example/tutorial/Jamrules libs/python/doc/tutorial/index.html: *A* broken link: ../../../LICENSE_1_0.txt libs/python/doc/v2/May2002.html: *A* broken link: ../../../../tools/build/v1/build_system.htm *A* broken link: ../../../../tools/build/v1/gen_aix_import_file.py libs/python/doc/v2/faq.html: *A* broken link: ../../../../tools/build/v1/build_system.htm |regex| libs/regex/performance/input.html: *A* unlinked file |regression| regression/.htaccess: *N* leading character of ".htaccess" is not alphabetic tools/regression/test/test-cases/incremental/bjam.log.1: *N* name contains more than one dot character ('.') tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/compile-fail.xml: *N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/ tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/completed.xml: *N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/ tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/compile-fail.xml: *N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/ tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/completed.xml: *N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/ tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/lib.xml: *N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/ tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/misfire.xml: *N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/ tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/no-run.xml: *N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/ tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/run_pyd.xml: *N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/ tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/test-case.xml: *N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/ tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/test-case.xml: *N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/ tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/test-driver.xsl: *N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/ tools/regression/xsl_reports/test/test-components/test_re_match/expected/test_re_match.xml: *N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/ tools/regression/xsl_reports/test/test-components/test_test_case_status/explicit-failures-markup.xml.test: *N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/ *N* name contains more than one dot character ('.') *N* name exceeds 31 characters tools/regression/xsl_reports/test/test-components/test_test_structure/explicit-failures-markup.xml.test: *N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/ *N* name contains more than one dot character ('.') *N* name exceeds 31 characters tools/regression/xsl_reports/xsl/html/issues_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/html/library_developer_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/html/library_user_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/html/make_tinyurl.html: *A* unlinked file tools/regression/xsl_reports/xsl/html/summary_developer_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/html/summary_user_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/v2/html/issues_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/v2/html/library_developer_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/v2/html/library_user_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/v2/html/make_tinyurl.html: *A* unlinked file tools/regression/xsl_reports/xsl/v2/html/summary_developer_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/v2/html/summary_user_legend.html: *A* unlinked file |serialization| libs/serialization/src/basic_xml_grammar.ipp: *U* unnamed namespace at line 43 |test| boost/test/floating_point_comparison.hpp: *U* unnamed namespace at line 206 *U* unnamed namespace at line 228 boost/test/impl/cpp_main.ipp: *U* unnamed namespace at line 42 boost/test/impl/exception_safety.ipp: *U* unnamed namespace at line 400 boost/test/impl/framework.ipp: *U* unnamed namespace at line 199 boost/test/impl/plain_report_formatter.ipp: *U* unnamed namespace at line 45 boost/test/impl/progress_monitor.ipp: *U* unnamed namespace at line 38 boost/test/impl/results_collector.ipp: *U* unnamed namespace at line 106 boost/test/impl/results_reporter.ipp: *U* unnamed namespace at line 48 boost/test/impl/unit_test_log.ipp: *U* unnamed namespace at line 79 boost/test/impl/unit_test_monitor.ipp: *U* unnamed namespace at line 35 boost/test/impl/unit_test_parameters.ipp: *U* unnamed namespace at line 50 boost/test/results_collector.hpp: *U* unnamed namespace at line 40 boost/test/test_tools.hpp: *U* unnamed namespace at line 262 boost/test/utils/iterator/token_iterator.hpp: *U* unnamed namespace at line 166 boost/test/utils/named_params.hpp: *U* unnamed namespace at line 216 boost/test/utils/runtime/cla/dual_name_parameter.ipp: *U* unnamed namespace at line 43 boost/test/utils/runtime/cla/modifier.hpp: *U* unnamed namespace at line 34 boost/test/utils/runtime/env/modifier.hpp: *U* unnamed namespace at line 34 boost/test/utils/runtime/file/config_file.hpp: *U* unnamed namespace at line 169 *U* unnamed namespace at line 64 *U* unnamed namespace at line 74 boost/test/utils/runtime/file/config_file_iterator.hpp: *U* unnamed namespace at line 68 boost/test/utils/trivial_singleton.hpp: *U* unnamed namespace at line 52 *U* unnamed namespace at line 61 libs/test/build/msvc71_proj/config_file_iterator_test.vcproj: *N* name exceeds 31 characters libs/test/doc/components/prg_exec_monitor/compilation.html: *A* broken link: ../../../build/Jamfile libs/test/doc/components/prg_exec_monitor/index.html: *A* broken link: ../../../../../boost/test/cpp_main.hpp libs/test/doc/components/test_tools/index.html: *A* broken link: ../../tests/boost_check_equal_str.html libs/test/doc/components/test_tools/reference/BOOST_CHECK_CLOSE.html: *A* broken link: BOOST_CHECK_CLOSE_FRACTION.html libs/test/doc/components/test_tools/reference/BOOST_CHECK_MESSAGE.html: *A* broken link: BOOST_MESSAGE.html libs/test/doc/components/test_tools/reference/BOOST_CHECK_SMALL.html: *A* broken link: BOOST_CHECK_CLOSE_FRACTION.html libs/test/doc/components/test_tools/reference/tools_list.html: *A* broken link: ../../btl1.gif *A* broken link: BOOST_CHECK_CLOSE_FRACTION.html libs/test/doc/components/utf/compilation.html: *A* broken link: ../../../build/Jamfile libs/test/doc/components/utf/components/index.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/components/test_case/abstract_interface.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/auto_register_facility.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/boost_function_tc.html: *A* broken link: ../../../../../../../boost/test/unit_test_suite_ex.hpp *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/class_tc.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/function_tc.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/index.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/param_boost_function_tc.html: *A* broken link: ../../../../../../../boost/test/unit_test_suite_ex.hpp *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/param_class_tc.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/param_function_tc.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/tc_template.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_log/custom_log_formatter.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_log/index.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_result/index.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_suite/index.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/index.html: *A* broken link: getting_started/index.html libs/test/doc/components/utf/parameters/build_info.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/catch_system_errors.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/detect_memory_leaks.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/index.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/log_format.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/log_level.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/no_result_code.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/output_format.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/random.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/report_format.html: *A* broken link: ../../../../../LICENSE_1_0.txt *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/report_level.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/show_progress.html: *A* broken link: ../../btl1.gif libs/test/doc/examples/unit_test_example1.html: *A* broken link: ../../example/unit_test_example1.cpp libs/test/doc/examples/unit_test_example2.html: *A* broken link: ../../example/unit_test_example2.cpp libs/test/doc/examples/unit_test_example3.html: *A* broken link: ../../example/unit_test_example3.cpp libs/test/doc/examples/unit_test_example4.html: *A* broken link: ../../example/unit_test_example4.cpp libs/test/doc/examples/unit_test_example5.html: *A* broken link: ../../example/unit_test_example5.cpp *A* broken link: ../../example/unit_test_example5.input libs/test/doc/tests/auto_unit_test_test.html: *A* broken link: ../../test/auto_unit_test_test.cpp libs/test/doc/tests/auto_unit_test_test_mult.html: *A* broken link: ../../test/auto_unit_test_test_mult1.cpp *A* broken link: ../../test/auto_unit_test_test_mult2.cpp libs/test/doc/tests/unit_test_suite_ex_test.html: *A* broken link: ../../test/unit_test_suite_ex_test.cpp libs/test/doc/tutorials/hello_the_testing_world.html: *A* broken link: ../../../../../LICENSE_1_0.txt *A* broken link: ../execution_monitor/index.html libs/test/doc/tutorials/new_year_resolution.html: *A* broken link: ../../../../../../LICENSE_1_0.txt |type_traits| libs/type_traits/cxx_type_traits.htm: *A* unlinked file

1 0

Boost inspection notification (2007-05-16/RC_1_34_0) *LC*
by Rene Rivera 16 May '07

16 May '07

Boost Inspection Report Run Date: 16:06:05 UTC, Wednesday 16 May 2007 An inspection program <http://www.boost.org/tools/inspect/index.html> checks each file in the current Boost CVS for various problems, generating this as output. Problems detected include tabs in files, missing copyrights, broken URL's, and similar misdemeanors. Totals: 11453 files scanned 909 directories scanned (including root) 1051 problems reported Problem counts: 653 files missing Boost license info or having wrong reference text 398 files missing copyright notice Summary: any (1) archive (1) build (68) concept_check (22) conversion (5) doc (1) filesystem (2) function (1) graph (1) inspect (1) integer (9) lambda (10) libs (6) logic (2) math (1) more (13) mpl (417) multi_array (13) numeric (188) optional (1) people (4) program_options (35) property_map (15) ptr_container (8) python (6) rational (5) regex (4) regression (118) release (2) serialization (16) signals (2) smart_ptr (8) test (3) timer (1) tr1 (2) tuple (5) utility (12) variant (42) Details: *L* missing Boost license info, or wrong reference text *C* missing copyright notice |any| libs/any/doc/ any.xml: *L* |archive| boost/archive/detail/ utf8_codecvt_facet.hpp: *L* |build| tools/build/v2/build/ build-request.jam: *L* modifiers.jam: *L* tools/build/v2/doc/ Jamfile.v2: *C* *L* tools/build/v2/doc/src/ advanced.xml: *C* *L* architecture.xml: *C* *L* catalog.xml: *C* *L* extending.xml: *C* *L* faq.xml: *C* *L* fragments.xml: *C* *L* howto.xml: *C* *L* install.xml: *C* *L* recipes.xml: *C* *L* reference.xml: *C* *L* standalone.xml: *C* *L* tutorial.xml: *C* *L* userman.xml: *C* *L* tools/build/v2/example/generate/ REAME.txt: *C* *L* a.cpp: *C* *L* tools/build/v2/example/generator/ README.txt: *C* *L* soap.jam: *C* *L* tools/build/v2/example/python_modules/ python_helpers.jam: *C* *L* python_helpers.py: *C* *L* tools/build/v2/test/ abs_workdir.py: *C* *L* dependency_property.py: *L* dependency_test.py: *C* *L* direct_request_test.py: *C* *L* dll_path.py: *L* double_loading.py: *L* duplicate.py: *L* echo_args.jam: *C* *L* empty.jam: *C* *L* expansion.py: *L* explicit.py: *L* gcc_runtime.py: *L* tools/build/v2/test/project-test3/lib3/ Jamfile: *C* *L* tools/build/v2/test/ readme.txt: *C* *L* svn_tree.py: *L* tag.py: *L* test_system.html: *L* tools/build/v2/tools/ sun.jam: *L* xsltproc.jam: *L* |concept_check| libs/concept_check/ bibliography.htm: *L* concept_check.htm: *L* concept_covering.htm: *L* creating_concepts.htm: *L* libs/concept_check/doc/ Jamfile.v2: *C* *L* libs/concept_check/doc/reference/ Assignable.xml: *L* BidirectionalIterator.xml: *L* CopyConstructible.xml: *L* DefaultConstructible.xml: *L* EqualityComparable.xml: *L* ForwardIterator.xml: *L* InputIterator.xml: *L* LessThanComparable.xml: *L* OutputIterator.xml: *L* RandomAccessIterator.xml: *L* SignedInteger.xml: *L* concepts.xml: *L* libs/concept_check/ implementation.htm: *L* prog_with_concepts.htm: *L* reference.htm: *L* using_concept_check.htm: *L* |conversion| libs/conversion/ cast.htm: *L* index.html: *C* *L* lexical_cast.htm: *L* libs/conversion/test/ Jamfile.v2: *L* |doc| doc/html/ docutils.css: *L* |filesystem| libs/filesystem/doc/ tr2_proposal.html: *L* libs/filesystem/src/ utf8_codecvt_facet.hpp: *L* |function| boost/function/detail/ gen_maybe_include.pl: *L* |graph| libs/graph/doc/ lengauer_tarjan_dominator.htm: *L* |inspect| tools/inspect/build/ Jamfile.v2: *L* |integer| libs/integer/ cstdint.htm: *C* *L* libs/integer/doc/ integer_mask.html: *L* static_min_max.html: *L* libs/integer/ index.html: *C* *L* integer.htm: *L* integer_traits.html: *C* *L* |lambda| libs/lambda/doc/ Jamfile.v2: *C* *L* libs/lambda/doc/detail/ README: *C* *L* lambda_doc.xsl: *C* *L* lambda_doc_chunks.xsl: *C* *L* libs/lambda/test/ Makefile: *C* *L* |libs| libs/ expected_results.xml: *C* *L* maintainers.txt: *C* *L* platform_maintainers.txt: *C* *L* |logic| libs/logic/doc/ Jamfile.v2: *C* *L* |math| boost/math/ common_factor_rt.hpp: *L* |more| more/ error_handling.html: *L* generic_exception_safety.html: *C* *L* generic_programming.html: *L* getting_started.rst: *C* *L* moderators.html: *C* regression.html: *C* *L* report-apr-2006.html: *C* *L* report-jan-2006.html: *C* *L* |mpl| libs/mpl/doc/src/refmanual/ ASSERT.rst: *C* *L* ASSERT_MSG.rst: *C* *L* ASSERT_NOT.rst: *C* *L* ASSERT_RELATION.rst: *C* *L* AUX_LAMBDA_SUPPORT.rst: *C* *L* Acknowledgements.rst: *C* *L* Algorithms-Iteration.rst: *C* *L* Algorithms-Querying.rst: *C* *L* Algorithms-Runtime.rst: *C* *L* Algorithms-Transformation.rst: *C* *L* Algorithms.rst: *C* *L* AssociativeSequence.rst: *C* *L* BackExtensibleSequence.rst: *C* *L* BidirectionalIterator.rst: *C* *L* BidirectionalSequence.rst: *C* *L* CFG_NO_HAS_XXX.rst: *C* *L* CFG_NO_PREPROCESSED.rst: *C* *L* Categorized.rst: *C* *L* Data.rst: *C* *L* ExtensibleAssociativeSeq.rst: *C* *L* ExtensibleSequence.rst: *C* *L* ForwardIterator.rst: *C* *L* ForwardSequence.rst: *C* *L* FrontExtensibleSequence.rst: *C* *L* HAS_XXX_TRAIT_DEF.rst: *C* *L* HAS_XXX_TRAIT_NAMED_DEF.rst: *C* *L* Inserter.rst: *C* *L* IntegralConstant.rst: *C* *L* IntegralSequenceWrapper.rst: *C* *L* Iterators-Concepts.rst: *C* *L* Iterators-Metafunctions.rst: *C* *L* Iterators.rst: *C* *L* LIMIT_LIST_SIZE.rst: *C* *L* LIMIT_MAP_SIZE.rst: *C* *L* LIMIT_METAFUNCTION_ARITY.rst: *C* *L* LIMIT_SET_SIZE.rst: *C* *L* LIMIT_UNROLLING.rst: *C* *L* LIMIT_VECTOR_SIZE.rst: *C* *L* LambdaExpression.rst: *C* *L* Macros-Asserts.rst: *C* *L* Macros-Configuration.rst: *C* *L* Macros.rst: *C* *L* Metafunction.rst: *C* *L* MetafunctionClass.rst: *C* *L* Metafunctions-Arithmetic.rst: *C* *L* Metafunctions-Bitwise.rst: *C* *L* Metafunctions-Comparisons.rst: *C* *L* Metafunctions-Composition.rst: *C* *L* Metafunctions-Conditional.rst: *C* *L* Metafunctions-Invocation.rst: *C* *L* Metafunctions-Logical.rst: *C* *L* Metafunctions-Trivial.rst: *C* *L* Metafunctions-Type.rst: *C* *L* Metafunctions.rst: *C* *L* NumericMetafunction.rst: *C* *L* PlaceholderExpression.rst: *C* *L* Placeholders.rst: *C* *L* RandomAccessIterator.rst: *C* *L* RandomAccessSequence.rst: *C* *L* ReversibleAlgorithm.rst: *C* *L* Sequences-Classes.rst: *C* *L* Sequences-Concepts.rst: *C* *L* Sequences-Intrinsic.rst: *C* *L* Sequences-Views.rst: *C* *L* Sequences.rst: *C* *L* TagDispatchedMetafunction.rst: *C* *L* TrivialMetafunction.rst: *C* *L* VariadicSequence.rst: *C* *L* accumulate.rst: *C* *L* advance.rst: *C* *L* always.rst: *C* *L* and_.rst: *C* *L* apply.rst: *C* *L* apply_wrap.rst: *C* *L* arg.rst: *C* *L* at.rst: *C* *L* at_c.rst: *C* *L* back.rst: *C* *L* back_inserter.rst: *C* *L* begin.rst: *C* *L* bind.rst: *C* *L* bitand_.rst: *C* *L* bitor_.rst: *C* *L* bitxor_.rst: *C* *L* bool_.rst: *C* *L* clear.rst: *C* *L* contains.rst: *C* *L* copy.rst: *C* *L* copy_if.rst: *C* *L* count.rst: *C* *L* count_if.rst: *C* *L* deque.rst: *C* *L* deref.rst: *C* *L* distance.rst: *C* *L* divides.rst: *C* *L* empty.rst: *C* *L* empty_base.rst: *C* *L* empty_sequence.rst: *C* *L* end.rst: *C* *L* equal.rst: *C* *L* equal_to.rst: *C* *L* erase.rst: *C* *L* erase_key.rst: *C* *L* eval_if.rst: *C* *L* eval_if_c.rst: *C* *L* filter_view.rst: *C* *L* find.rst: *C* *L* find_if.rst: *C* *L* fold.rst: *C* *L* for_each.rst: *C* *L* front.rst: *C* *L* front_inserter.rst: *C* *L* greater.rst: *C* *L* greater_equal.rst: *C* *L* has_key.rst: *C* *L* identity.rst: *C* *L* if_.rst: *C* *L* if_c.rst: *C* *L* inherit.rst: *C* *L* inherit_linearly.rst: *C* *L* insert.rst: *C* *L* insert_range.rst: *C* *L* inserter_.rst: *C* *L* int_.rst: *C* *L* integral_c.rst: *C* *L* is_sequence.rst: *C* *L* iter_fold.rst: *C* *L* iter_fold_if.rst: *C* *L* iterator_category.rst: *C* *L* iterator_range.rst: *C* *L* joint_view.rst: *C* *L* key_type.rst: *C* *L* lambda.rst: *C* *L* less.rst: *C* *L* less_equal.rst: *C* *L* list.rst: *C* *L* list_c.rst: *C* *L* long_.rst: *C* *L* lower_bound.rst: *C* *L* map.rst: *C* *L* max.rst: *C* *L* max_element.rst: *C* *L* min.rst: *C* *L* min_element.rst: *C* *L* minus.rst: *C* *L* modulus.rst: *C* *L* multiplies.rst: *C* *L* negate.rst: *C* *L* next.rst: *C* *L* not_.rst: *C* *L* not_equal_to.rst: *C* *L* numeric_cast.rst: *C* *L* or_.rst: *C* *L* order.rst: *C* *L* pair.rst: *C* *L* partition.rst: *C* *L* plus.rst: *C* *L* pop_back.rst: *C* *L* pop_front.rst: *C* *L* preface.rst: *C* *L* prior.rst: *C* *L* protect.rst: *C* *L* push_back.rst: *C* *L* push_front.rst: *C* *L* quote.rst: *C* *L* range_c.rst: *C* *L* remove.rst: *C* *L* remove_if.rst: *C* *L* replace.rst: *C* *L* replace_if.rst: *C* *L* reverse.rst: *C* *L* reverse_copy.rst: *C* *L* reverse_copy_if.rst: *C* *L* reverse_fold.rst: *C* *L* reverse_iter_fold.rst: *C* *L* reverse_partition.rst: *C* *L* reverse_remove.rst: *C* *L* reverse_remove_if.rst: *C* *L* reverse_replace.rst: *C* *L* reverse_replace_if.rst: *C* *L* reverse_stable_partition.rst: *C* *L* reverse_transform.rst: *C* *L* reverse_unique.rst: *C* *L* sequence_tag.rst: *C* *L* set.rst: *C* *L* set_c.rst: *C* *L* shift_left.rst: *C* *L* shift_right.rst: *C* *L* single_view.rst: *C* *L* size.rst: *C* *L* size_t.rst: *C* *L* sizeof_.rst: *C* *L* sort.rst: *C* *L* stable_partition.rst: *C* *L* terminology.rst: *C* *L* times.rst: *C* *L* transform.rst: *C* *L* transform_view.rst: *C* *L* unique.rst: *C* *L* unpack_args.rst: *C* *L* upper_bound.rst: *C* *L* value_type.rst: *C* *L* vector.rst: *C* *L* vector_c.rst: *C* *L* void_.rst: *C* *L* zip_view.rst: *C* *L* libs/mpl/doc/ style.css: *L* libs/mpl/example/fsm/ README.txt: *C* *L* libs/mpl/test/ Jamfile.v2: *C* *L* |multi_array| libs/multi_array/doc/ iterator_categories.html: *C* *L* reference.html: *L* libs/multi_array/doc/xml/ MultiArray.xml: *C* *L* const_multi_array_ref.xml: *C* *L* multi_array.xml: *C* *L* multi_array_ref.xml: *C* *L* reference.xml: *L* libs/multi_array/test/ Jamfile.v2: *L* |numeric| boost/numeric/ublas/ banded.hpp: *L* blas.hpp: *L* boost/numeric/ublas/detail/ concepts.hpp: *L* config.hpp: *L* definitions.hpp: *L* documentation.hpp: *L* duff.hpp: *L* iterator.hpp: *L* matrix_assign.hpp: *L* raw.hpp: *L* temporary.hpp: *L* vector_assign.hpp: *L* boost/numeric/ublas/ exception.hpp: *L* expression_types.hpp: *L* functional.hpp: *L* fwd.hpp: *L* hermitian.hpp: *L* io.hpp: *L* lu.hpp: *L* matrix.hpp: *L* matrix_expression.hpp: *L* matrix_proxy.hpp: *L* matrix_sparse.hpp: *L* operation.hpp: *L* operation_blocked.hpp: *L* operation_sparse.hpp: *L* storage.hpp: *L* storage_sparse.hpp: *L* symmetric.hpp: *L* traits.hpp: *L* triangular.hpp: *L* vector.hpp: *L* vector_expression.hpp: *L* vector_of_vector.hpp: *L* vector_proxy.hpp: *L* vector_sparse.hpp: *L* libs/numeric/conversion/test/ Jamfile.v2: *C* *L* test_helpers.cpp: *C* test_helpers2.cpp: *C* test_helpers3.cpp: *C* traits_test.cpp: *C* udt_example_0.cpp: *C* udt_support_test.cpp: *C* libs/numeric/ublas/bench1/ bench1.cpp: *L* bench1.hpp: *L* bench11.cpp: *L* bench12.cpp: *L* bench13.cpp: *L* libs/numeric/ublas/bench2/ bench2.cpp: *L* bench2.hpp: *L* bench21.cpp: *L* bench22.cpp: *L* bench23.cpp: *L* libs/numeric/ublas/bench3/ bench3.cpp: *L* bench3.hpp: *L* bench31.cpp: *L* bench32.cpp: *L* bench33.cpp: *L* libs/numeric/ublas/bench4/ bench4.cpp: *L* bench41.cpp: *L* bench42.cpp: *L* bench43.cpp: *L* libs/numeric/ublas/doc/ Release_notes.txt: *C* *L* array_adaptor.htm: *C* *L* banded.htm: *L* blas.htm: *L* bounded_array.htm: *C* *L* container_concept.htm: *L* doxygen.css: *C* *L* expression_concept.htm: *L* hermitian.htm: *L* index.htm: *L* iterator_concept.htm: *L* matrix.htm: *L* matrix_expression.htm: *L* matrix_proxy.htm: *L* matrix_sparse.htm: *L* operations_overview.htm: *L* overview.htm: *L* products.htm: *L* range.htm: *C* *L* libs/numeric/ublas/doc/samples/ banded_adaptor.cpp: *L* banded_matrix.cpp: *L* bounded_array.cpp: *L* compressed_matrix.cpp: *L* compressed_vector.cpp: *L* coordinate_matrix.cpp: *L* coordinate_vector.cpp: *L* hermitian_adaptor.cpp: *L* hermitian_matrix.cpp: *L* identity_matrix.cpp: *L* map_array.cpp: *L* mapped_matrix.cpp: *L* mapped_vector.cpp: *L* matrix.cpp: *L* matrix_binary.cpp: *L* matrix_binary_scalar.cpp: *L* matrix_column.cpp: *L* matrix_column_project.cpp: *L* matrix_matrix_binary.cpp: *L* matrix_matrix_solve.cpp: *L* matrix_range.cpp: *L* matrix_range_project.cpp: *L* matrix_row.cpp: *L* matrix_row_project.cpp: *L* matrix_slice.cpp: *L* matrix_slice_project.cpp: *L* matrix_unary.cpp: *L* matrix_vector_binary.cpp: *L* matrix_vector_range.cpp: *L* matrix_vector_slice.cpp: *L* matrix_vector_solve.cpp: *L* range.cpp: *L* slice.cpp: *L* symmetric_adaptor.cpp: *L* symmetric_matrix.cpp: *L* triangular_adaptor.cpp: *L* triangular_matrix.cpp: *L* unbounded_array.cpp: *L* unit_vector.cpp: *L* vector.cpp: *L* vector_binary.cpp: *L* vector_binary_outer.cpp: *L* vector_binary_redux.cpp: *L* vector_binary_scalar.cpp: *L* vector_range.cpp: *L* vector_range_project.cpp: *L* vector_slice.cpp: *L* vector_slice_project.cpp: *L* vector_unary.cpp: *L* vector_unary_redux.cpp: *L* zero_matrix.cpp: *L* zero_vector.cpp: *L* libs/numeric/ublas/doc/ storage_concept.htm: *C* *L* storage_sparse.htm: *L* symmetric.htm: *L* triangular.htm: *L* types_overview.htm: *L* ublas.css: *C* *L* unbounded_array.htm: *C* *L* vector.htm: *L* vector_expression.htm: *L* vector_proxy.htm: *L* vector_sparse.htm: *L* libs/numeric/ublas/test/ README: *C* *L* concepts.cpp: *L* test1.cpp: *L* test1.hpp: *L* test11.cpp: *L* test12.cpp: *L* test13.cpp: *L* test2.cpp: *L* test2.hpp: *L* test21.cpp: *L* test22.cpp: *L* test23.cpp: *L* test3.cpp: *L* test3.hpp: *L* test31.cpp: *L* test32.cpp: *L* test33.cpp: *L* test4.cpp: *L* test4.hpp: *L* test42.cpp: *L* test43.cpp: *L* test5.cpp: *L* test5.hpp: *L* test52.cpp: *L* test53.cpp: *L* test6.cpp: *L* test6.hpp: *L* test62.cpp: *L* test63.cpp: *L* test7.cpp: *L* test7.hpp: *L* test71.cpp: *L* test72.cpp: *L* test73.cpp: *L* |optional| libs/optional/test/ Jamfile.v2: *L* |people| people/ paul_moore.htm: *C* *L* vesa_karvonen.htm: *C* *L* |program_options| boost/program_options/detail/ utf8_codecvt_facet.hpp: *L* libs/program_options/build/ Jamfile.v2: *C* *L* libs/program_options/doc/ Jamfile.v2: *C* *L* acknowledgements.xml: *C* *L* changes.xml: *C* *L* design.xml: *C* *L* glossary.xml: *C* *L* howto.xml: *C* *L* overview.xml: *C* *L* post_review_plan.txt: *C* *L* todo.txt: *C* *L* tutorial.xml: *C* *L* libs/program_options/example/ Jamfile.v2: *C* *L* libs/program_options/test/ Jamfile.v2: *C* *L* program_options_size_test.py: *C* *L* ucs2.txt: *C* *L* utf8.txt: *C* *L* winmain.py: *C* *L* |property_map| libs/property_map/ LvaluePropertyMap.html: *L* ReadWritePropertyMap.html: *L* ReadablePropertyMap.html: *L* WritablePropertyMap.html: *L* associative_property_map.html: *L* const_assoc_property_map.html: *L* libs/property_map/doc/ dynamic_property_map.html: *C* *L* dynamic_property_map.rst: *C* *L* libs/property_map/ example2.cpp: *L* identity_property_map.html: *L* iterator_property_map.html: *L* property_map.html: *L* vector_property_map.html: *L* |ptr_container| libs/ptr_container/doc/ default.css: *L* intro.xml: *C* *L* ptr_container.xml: *L* libs/ptr_container/test/ Jamfile.v2: *C* *L* sequence_point.cpp: *C* *L* |python| libs/python/doc/ internals.html: *L* internals.rst: *L* libs/python/test/ operators_wrapper.cpp: *C* *L* operators_wrapper.py: *C* *L* |rational| boost/ rational.hpp: *L* libs/rational/ index.html: *L* rational.html: *L* rational_example.cpp: *L* rational_test.cpp: *L* |regex| libs/regex/build/ gcc-shared.mak: *C* *L* libs/regex/example/timer/ input_script.txt: *C* *L* |regression| tools/regression/build/ Jamfile.v2: *C* *L* tools/regression/detail/ tiny_xml_test.txt: *C* *L* tools/regression/ index.htm: *C* *L* run_tests.sh: *C* *L* tools/regression/test/test-cases/general/expected/ results.xml: *C* *L* tools/regression/test/test-cases/incremental/expected/ results.xml: *C* *L* tools/regression/test/ test.bat: *C* *L* tools/regression/xsl_reports/ boostbook_report.py: *C* *L* tools/regression/xsl_reports/db/ load.py: *C* *L* test-runs.xsd: *C* *L* tools/regression/xsl_reports/ empty_expected_results.xml: *C* *L* tools/regression/xsl_reports/runner/ __init__.py: *C* *L* default.css: *L* instructions.html: *L* instructions.rst: *C* *L* tools/regression/xsl_reports/test/ common.py: *C* *L* expected_results.xml: *C* *L* generate_test_results.py: *C* *L* generate_test_results_v1.py: *C* *L* restrict_to_library.xsl: *C* *L* run_notes_regression.py: *C* *L* run_v1.py: *C* *L* tools/regression/xsl_reports/test/test-components/ test.py: *C* *L* tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/ compile-fail.xml: *C* *L* completed.xml: *C* *L* tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/ compile-fail.xml: *C* *L* completed.xml: *C* *L* lib.xml: *C* *L* misfire.xml: *C* *L* no-run.xml: *C* *L* run_pyd.xml: *C* *L* test-case.xml: *C* *L* tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/ lib.xml: *L* misfire.xml: *C* *L* no-run.xml: *C* *L* run_pyd.xml: *C* *L* test-case.xml: *L* test-driver.xsl: *C* *L* tools/regression/xsl_reports/test/test-components/test_re_match/expected/ test_re_match.xml: *C* *L* tools/regression/xsl_reports/test/test-components/test_test_case_status/ a.xml: *C* *L* tools/regression/xsl_reports/test/test-components/test_test_case_status/expected/ a.xml: *C* *L* tools/regression/xsl_reports/test/test-components/test_test_case_status/ test-driver.xsl: *C* *L* tools/regression/xsl_reports/test/test-components/test_test_structure/ a.xml: *C* *L* tools/regression/xsl_reports/test/test-components/test_test_structure/expected/ a.xml: *C* *L* tools/regression/xsl_reports/test/test-components/test_test_structure/ test-driver.xsl: *C* *L* tools/regression/xsl_reports/test/ test.py: *C* *L* test_boost_wide_report.py: *C* *L* tools/regression/xsl_reports/ test_results.xsd: *C* *L* tools/regression/xsl_reports/utils/ __init__.py: *C* *L* accept_args.py: *C* *L* char_translation_table.py: *C* *L* check_existance.py: *C* *L* checked_system.py: *C* *L* libxslt.py: *C* *L* log.py: *C* *L* makedirs.py: *C* *L* send_mail.py: *C* *L* sourceforge.py: *C* *L* tar.py: *C* *L* zip.py: *C* *L* tools/regression/xsl_reports/xsl/v2/ expected_to_1_33_format.xsl: *C* *L* |release| tools/release/ utils.py: *C* *L* |serialization| libs/serialization/doc/ style.css: *C* *L* libs/serialization/example/ demo_output.txt: *C* *L* demo_save.xml: *C* *L* demofile.txt: *C* *L* libs/serialization/test/ run_archive_test.bat: *C* *L* runtest.bat: *C* *L* runtest.sh: *C* *L* libs/serialization/vc7ide/ readme.txt: *C* *L* |signals| libs/signals/doc/ tutorial.xml: *C* *L* |smart_ptr| libs/smart_ptr/ compatibility.htm: *L* scoped_array.htm: *L* scoped_ptr.htm: *L* shared_array.htm: *L* shared_ptr.htm: *L* smart_ptr.htm: *L* smarttests.htm: *L* weak_ptr.htm: *L* |test| boost/test/utils/runtime/cla/detail/ argument_value_usage.hpp: *L* libs/test/test/auto-link-test/ run_bjam.bat: *C* *L* |timer| libs/timer/ timer.htm: *L* |tr1| boost/tr1/ tuple.hpp: *C* *L* |tuple| libs/tuple/doc/ design_decisions_rationale.html: *L* tuple_advanced_interface.html: *L* tuple_users_guide.html: *L* libs/tuple/test/ README: *C* *L* |utility| boost/ shared_container_iterator.hpp: *L* libs/utility/ OptionalPointee.html: *L* call_traits.htm: *L* compressed_pair.htm: *L* enable_if.html: *L* libs/utility/test/ Jamfile.v2: *L* libs/utility/ utility.htm: *L* value_init.htm: *L* value_init_test.cpp: *C* value_init_test_fail1.cpp: *C* value_init_test_fail2.cpp: *C* value_init_test_fail3.cpp: *C* |variant| libs/variant/doc/ Jamfile.v2: *C* *L* biblio.xml: *C* *L* design.xml: *C* *L* introduction.xml: *C* *L* misc.xml: *C* *L* libs/variant/doc/reference/ apply_visitor.xml: *C* *L* bad_visit.xml: *C* *L* concepts.xml: *C* *L* get.xml: *C* *L* recursive_variant.xml: *C* *L* recursive_wrapper.xml: *C* *L* reference.xml: *C* *L* static_visitor.xml: *C* *L* variant.xml: *C* *L* variant_fwd.xml: *C* *L* visitor_ptr.xml: *C* *L* libs/variant/doc/tutorial/ advanced.xml: *C* *L* basic.xml: *C* *L* tutorial.xml: *C* *L* libs/variant/doc/ variant.xml: *L* libs/variant/ index.html: *C* *L* libs/variant/test/ Jamfile.v2: *L*

1 0

[Report] 0 regressions on RC_1_34_0 (2007-05-16)
by Douglas Gregor 16 May '07

16 May '07

Boost Regression test failures Report time: 2007-05-14T23:41:53Z This report lists all regression test failures on release platforms. Detailed report: http://engineering.meta-comm.com/boost-regression/CVS-RC_1_34_0/developer/i… No failures! Yay!

1 0

[proto] problem w/ context
by Maurizio Vitale 16 May '07

16 May '07

I'm not sure whether what I'm trying is possible, but I'm asking anyhow, that's cheap. I have a context like the following, which overloads operator() for a bunch of terminals and a predefined mask(left,right) and mask(what, left, right): template<typename Expr, typename Target, typename Source> struct meta_context : proto::callable_context<const meta_context<Expr,Target,Source> > { typedef meta_context<Expr, Target, Source> self; typedef unsigned int result_type; meta_context (const Target& target, const Source& source) : m_target (target), m_source (source) {} #define RESULT_FOR(NAME, EXPR) result_type operator () (proto::tag::terminal, NAME##_tag NAME) const { return EXPR; } RESULT_FOR (source, proto::arg(m_source).m_data) RESULT_FOR (source_left, proto::arg(m_source).left ()) RESULT_FOR (source_right, proto::arg(m_source).right ()) RESULT_FOR (target, proto::arg(m_target).m_data) RESULT_FOR (target_left, proto::arg(m_target).left ()) RESULT_FOR (target_right, proto::arg(m_target).right ()) template<typename What, typename Left, typename Right> result_type operator () (mask_tag, const What& what, const Left& left, const Right& right) const { std::size_t what_value = proto::eval (what, *this); std::size_t left_value = proto::eval (left, *this); std::size_t right_value = proto::eval (right, *this); if (left_value == sizeof (unsigned long long)*8) return what_value & (~0ULL << right_value); else return what_value & (~(~1ull << (left_value-1) | ~(~0ull << right_value))); } template<typename Left, typename Right> result_type operator () (mask_tag, const Left& left, const Right& right) const { std::size_t left_value = proto::eval (left, *this); std::size_t right_value = proto::eval (right, *this); if (left_value == sizeof (unsigned long long)*8) return ~0ULL << right_value; else return ~(~1ull << (left_value-1) | ~(~0ull << right_value)); } #undef RESULT_FOR const Target& m_target; const Source& m_source; }; This is find and does its job, delegating most of the work to inherithed defaults. Now I'd like to shortcut the run-time evaluation when a value can be determined solely from the type. Let's assume I have a transform that returns either an mpl::int_<> giving the compile time value or the special type run_time when no compile time result can be computed. I know (haven't tried, so it's just a semi-educated guess) that I could just overload everything, check whether none of the arguments returns run_time, rebuild the original expression type (because I think once I'm in one of the operator() overloads the expression is decomposed in tag and arguments, with the complete one available nowhere), call the transform on the newly created expression and return the compile time value. If any of the arguments evaluate to run_time, do the run-time processing. But this overloading everything is not what I'd like. What I'd like is to leave the few overloads that do something special in the context and in addition overload eval like this: template<typename Expr1> struct eval { typedef typename self::result_type result_type; result_type operator()(Expr1 const &expr, self &ctx) { ... do compile time evaluation ... ... if known, return value, otherwise: return proto::default_eval<Expr1, self>()(expr, ctx); } }; Except that this doesn't quite do it, default_eval knows nothing about the semantics of my terminals and non-terminals. But I cannot simply call proto::eval either. Is there a way to do this in proto already, so that some additional behaviour can be spliced in before the normal (but not the default) behaviour? Thanks, Maurizio

4 5

[string algorithm] Missing documentation for join
by Joe Gottman 16 May '07

16 May '07

The string algorithm documentation still hasn't been fully updated to include information on join. You need to edit the front page under "usage" (http://www.boost.org/doc/html/string_algo.html) and the usage page (http://www.boost.org/doc/html/string_algo/usage.html) Joe Gottman

2 1

Re: [boost] [lexical_cast] doc update
by Alexander Nasonov 16 May '07

16 May '07

16.05.07, 11:48, John Maddock <john(a)johnmaddock.co.uk>: > Just noticed what look like a couple of missing links [tuning] for example, All links are in References section. Do you mean to add anchor links that jump right to the references section? > and was [N1973] supposed to be a quickbook template that links to the doc? Sorry, I don't follow you. Neither N1973 nor lexical_cast.htm have any relations with quickbook (well, N1973 may be related, I don't own this document but anyway it's not a part of boost). -- Alexander Nasonov

2 1

Re: [boost] [lexical_cast] doc update
by Alexander Nasonov 16 May '07

16 May '07

16.05.07, 13:28, Phil Endecott <spam_from_boost_dev(a)chezphil.org>: > Q: What does lexical_cast<string> of an int8_t or uint8_t not do what I expect? > A: As above, note that int8_t and uint8_t are actually chars and are > formatted as such. To avoid this, cast to an integer type first: lexical_cast<string>(static_cast<int>(n)). Looks good. I'll add it. > Following are some minor edits to your text: > Q: Why does lexical_cast<int8_t>("127") throw bad_lexical_cast? > commitee --> committee > greate --> great Thanks. -- Alexander Nasonov

1 0

stlport.jam error?
by rasmus ekman 16 May '07

16 May '07

It doesn't seem right that stlport.jam should force linking to dll when <runtime-debugging> is on? See [boost-path] \tools\build\v2\tools\ stlport.jam:220-24 Some other <feature> should control this flag, docs at top of stlport.jam suggest so. re

1 0

Re: [boost] Improving Boost Build?
by Matthew Herrmann 15 May '07

15 May '07

> > Date: Tue, 15 May 2007 19:15:41 +0100 > From: "John Maddock" <john(a)johnmaddock.co.uk> > Subject: [boost] Improving Boost Build? > > 2) Better docs. Yes, I know it's been said before, but we really must get > the existing toolsets and their options documented. This need not take too > long if someone would step up and volunteer to do it. > I would like to add my vote to continuing the active maintenance of Boost Build V2. I've only ever used V2, and found it to have the best syntax for expressing hierarchies of libraries out of any of the tools I reviewed. The fact that there is no middle-man is a great guarantee that you will never get an unexpected interaction between this and makefiles, where both sides blame each other. Better Docs: The biggest documentation hole for me is in the programming "primitives" of boost build. To put it in perspective of a language, there are descriptions of some commonly used functions (exe, lib, alias) and some common arguments to those functions. But there is no description of what valid types there are, or what a function _is_. How does the "<variant>debug" trick work? Is it a map entry, or a single-element dictionary? How, precisely, does adding a new type of variant work? Is there language magic, or is the rule referring to a global variable? How do I make a list of things? How do I take the first one? How do I make a rule call another rule? How does module import work? Can you import a module twice? How do exceptions work? If these areas were better documented, a lot of people (including myself) would be able to "teach themselves to fish", and hopefully submit well-written patches to do things like add timeouts to unit test invocation. I can do the big stuff with bjam, like massively nested library builds, but just trying to pass an argument to a rule was an huge and ultimately fruitless exercise. Regards, Matthew Herrmann

1 0

The migration to svn & Spirit's release plans
by Nicola Musatti 15 May '07

15 May '07

Hallo, I'd like to know what are the current plans for the migration of the Boost CVS repository to Subversion. I'm asking because I volunteered to handle the release of Spirit 1.6.4 & 1.8.5, which basically means tagging the appropriate subset of Boost 1.34.0 . As I'm still not as familiar with Subversion as I am with CVS, I'd rather do it in the current repository. On the other hand this isn't going to happen before some time next week and I do not want to alter anybody's plans. Thank you, Nicola Musatti

4 6

boost::mem_fn suggestion/question
by Piyo 15 May '07

15 May '07

Hello, I was using boost::mem_fun and noticed that only with the 1 or 2 argument form of boost::mem_fun exposes the arguments types (first_argument_type and second_argument_type) for "compatibility" purposes. I was wondering if it were possible to expose in general all argument types just like boost::function does ( arg1_type, arg2_type, etc..). Any ideas/comments about this? Thanks!

3 7

RC_1_34_0 is still frozen
by Thomas Witt 15 May '07

15 May '07

The subject says it all. Please do not check in to RC_1_34_0 without prior talking to me. RC_1_34_0 is and will be frozen until I say otherwise. Thanks Thomas -- Thomas Witt witt(a)acm.org

1 0