October 2006 - Boost - lists.preview.boost.org

[fusion] Tuples partly broken in cvs HEAD?
by John Maddock 25 Oct '06

25 Oct '06

Some of my code that uses the TR1/Tuples code has stopped working. Sorry don't know when, haven't built this particular program in a while. The test case is: #include <boost/tr1/tuple.hpp> std::tr1::tuple<double, double, double, double, double, double, double> foo(int i) { return std::tr1::make_tuple(i, i+1, i+2, i+3, i+4, i+5, i+6); } int main() { foo(2); } Which generates the errors: $ cl -EHsc -I. -c scrap.cpp Microsoft (R) 32-bit C/C++ Optimizing Compiler Version 14.00.50727.42 for 80x86 Copyright (C) Microsoft Corporation. All rights reserved. scrap.cpp scrap.cpp(6) : error C2664: 'boost::fusion::tuple<T0,T1,T2,T3,T4,T5,T6>::tuple(const boost::fusion::tuple<T0,T1,T2,T3,T4,T5,T6> &)' : cannot convert parameter 1 from 'boost::fusion::tuple<T0,T1,T2,T3,T4,T5,T6,T7,T8,T9>' to 'const boost::fusion::tuple<T0,T1,T2,T3,T4,T5,T6> &' with [ T0=double, T1=double, T2=double, T3=double, T4=double, T5=double, T6=double ] and [ T0=int, T1=int, T2=int, T3=int, T4=int, T5=int, T6=int, T7=boost::fusion::void_, T8=boost::fusion::void_, T9=boost::fusion::void_ ] and [ T0=double, T1=double, T2=double, T3=double, T4=double, T5=double, T6=double ] Reason: cannot convert from 'boost::fusion::tuple<T0,T1,T2,T3,T4,T5,T6,T7,T8,T9>' to 'const boost::fusion::tuple<T0,T1,T2,T3,T4,T5,T6>' with [ T0=int, T1=int, T2=int, T3=int, T4=int, T5=int, T6=int, T7=boost::fusion::void_, T8=boost::fusion::void_, T9=boost::fusion::void_ ] and [ T0=double, T1=double, T2=double, T3=double, T4=double, T5=double, T6=double ] No user-defined-conversion operator available that can perform this conversion, or the operator cannot be called Looks like the definition of make_tuple is out of synch with tuple? It works OK with the release branch BTW. Thanks, John.

3 4

GIL review
by Jose 25 Oct '06

25 Oct '06

I vote to accept GIL into Boost This is a short review as most comments/suggestions have already been made in the mailing list. My review is from the library user point of view. Design ====== It's GIL strength. Implementation ============= Average. The dynamic_image, io and numeric extensions are not part of the review but they should. They have not been added because the authors consider the numeric extensions are not fully optimized. Although there are claims of performance superiority no benchmarks are provided. The most common image operations, save jpeg and downsample jpeg are provided but it is not clear they are optimized for speed. Useful downsample jpeg performance optimizations are not provided. Check epeg. "It makes use of libjpeg features of being able to load an image by only decoding the DCT coefficients needed to reconstruct an image of the size desired. This gives a massive speedup. If you do not try to access the pixels in a format other than YUV (or GRAY8 if the source is grayscale) then it also avoids colorspace conversions as well." I don't find the library syntax very easy but I don't have clear suggestions either. Documentation ============= Good reference documentation in the design guide but awful documentation for the library end user. The tutorial could be improved by emulating Boost.asio clear step-by-step tutorial examples. The numeric extensions are not documented and there is not much use for the core library without the numeric extensions. I miss the traditional Boost-like docs, with Rationale, FAQ, ... Potential usefulness ================ Great potential, somewhat hampered by providing just the image container. Did you try to use the library? With what compiler? Did you have any problems? ================================================================ Yes g++ 4.0.2 x86_64 The library had not been tested on x86_64 so a few bugs were uncovered before the review started How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? ============================================================================ 5-10 hours. Wrote a few programs and had multiple private e-mails with the developers. Are you knowledgeable about the problem domain? ========================================== Yes but not an expert Overall strengths ============== - Library design - Willingness of the developers to continue to improve the library - Opportunity for VIGRA or other specialized libraries to provide algorithms as separate Boost libraries Weaknesses ========== - No algorithms library provided (= no basic set of image processing algorithms provided) - Theoretical approach (core is container only) - Lacks what VIGRA does well (practical image processing, filters, segmentation, image analysis ..) - Not conforming to Boost standards (directory structure, docs, tests, ...) Thanks for providing GIL and I hope you continue to develop it. I will use it !

3 2

GIL Review - PixelDereferenceAdaptors vs. DataAccessors
by Ullrich Koethe 25 Oct '06

25 Oct '06

Hi again, the issue of PixelDereferenceAdaptors vs. DataAccessors has been intensively discussed during this review, especially the issues arising when the PixelDereferenceAdaptor must support both rvalue and lvalue use. To get objective data on this, I want to do some experiments comparing the concepts. But to my big surprise, I couldn't find any PixelDereferenceAdaptor in the public part of GIL which supports lvalue use. I'd appreciate if the GIL authors could provide an implementation of a mutable interleaved_rgb_image_view(a_planar_rgb_image) or point me to the right construct. Thanks Ulli -- ________________________________________________________________ | | | Ullrich Koethe Universitaet Hamburg / University of Hamburg | | FB Informatik / Dept. of Informatics | | AB Kognitive Systeme / Cognitive Systems Group | | | | Phone: +49 (0)40 42883-2573 Vogt-Koelln-Str. 30 | | Fax: +49 (0)40 42883-2572 D - 22527 Hamburg | | Email: u.koethe(a)computer.org Germany | | koethe(a)informatik.uni-hamburg.de | | WWW: http://kogs-www.informatik.uni-hamburg.de/~koethe/ | |________________________________________________________________|

4 6

Generic Image Library (GIL) Review
by Timothy M. Shead 25 Oct '06

25 Oct '06

What is your evaluation of the design? -------------------------------------- Excellent! The design provides useful degrees of flexibility without getting mired in generality-for-generality's-sake. What is your evaluation of the documentation? --------------------------------------------- Needs work - somehow the documentation in its present form manages to be less than the sum of its parts. Sorry for the vague hand-waving, but it just seems as if the information you're looking for in the current documentation is always Somewhere Else. Having received very clear and straightforward responses from the library authors on a number of questions, I am confident that this is a matter of organization rather than any fundamental flaw in design or content. I would recommend focusing on "howto" type documentation rather than the concepts and reference docs. What is your evaluation of the potential usefulness of the library? ------------------------------------------------------------------- A must-have! Images have become so ubiquitous in computer applications that having a standard container for images makes as much sense as standard containers for strings, vectors, etc. Did you try to use the library? With what compiler? Did you have any problems? ---------------------------------------------------------------------- Yes - I used the library with gcc 3.4.4 on Gentoo Linux without any difficulty. How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? ------------------------------------------------------------------- I retrofitted GIL into a mature 3D graphics pipeline, replacing the home-grown floating-point HDR bitmap storage with GIL and using it to implement several readers, filters (algorithms) and writers, and integrating it with the gtkmm GUI toolkit for image previews. Total time spent with the library: ~ 5 hours. Are you knowledgeable about the problem domain? ----------------------------------------------- Yes, having implemented a bitmap storage library of my own that was also parameterized on pixel type (albeit much more limited in scope). Do you think the library should be accepted as a Boost library? --------------------------------------------------------------- I recommend that GIL be accepted for inclusion in boost. Regards, Tim Shead

1 0

[numeric_interval] patch for HP-UX/ia64
by Boris Gubenko 25 Oct '06

25 Oct '06

boost does not have rounding control header file for HP-UX/ia64 and, as a result, numeric_interval library tests fail on this platform with the following #error directive: "../boost/numeric/interval/hw_rounding.hpp", line 36: error #2035: #error directive: Boost.Numeric.Interval: Please specify rounding control mechanism. # error Boost.Numeric.Interval: Please specify rounding control mechanism. ^ I've created rounding control file and amended hw_rounding.hpp to include it when appropriate -- see below. With these changes, all numeric_interval library tests pass and the change does not cause any regression in boost build and tests. Can the patch for hw_rounding.hpp below and the new header file be committed to both the HEAD and the RC branch? (I don't have developer privileges in cvs) Thanks, Boris Index: hw_rounding.hpp =================================================================== RCS file: /cvsroot/boost/boost/boost/numeric/interval/hw_rounding.hpp,v retrieving revision 1.8 diff -r1.8 hw_rounding.hpp 27a28,29 > #elif defined(ia64) || defined(__ia64) || defined(__ia64__) > # include <boost/numeric/interval/detail/ia64_rounding_control.hpp> boost/numeric/interval/detail/ia64_rounding_control.hpp ======================================================= /* Boost interval/detail/ia64_rounding_control.hpp file * * Copyright 2006 Boris Gubenko * * Distributed under 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) */ #ifndef BOOST_NUMERIC_INTERVAL_DETAIL_IA64_ROUNDING_CONTROL_HPP #define BOOST_NUMERIC_INTERVAL_DETAIL_IA64_ROUNDING_CONTROL_HPP #if !defined(ia64) && !defined(__ia64) && !defined(__ia64__) #error This header only works on ia64 CPUs. #endif #if defined(__HP_aCC) namespace boost { namespace numeric { namespace interval_lib { namespace detail { # include <fenv.h> struct ia64_rounding_control { typedef unsigned int rounding_mode; static void set_rounding_mode(const rounding_mode& mode) { fesetround(mode); } static void get_rounding_mode(rounding_mode& mode) { mode = fegetround(); } static void downward() { set_rounding_mode(FE_DOWNWARD); } static void upward() { set_rounding_mode(FE_UPWARD); } static void to_nearest() { set_rounding_mode(FE_TONEAREST); } static void toward_zero() { set_rounding_mode(FE_TOWARDZERO); } }; } // namespace detail extern "C" { float rintf(float); double rint(double); long double rintl(long double); } template<> struct rounding_control<float>: detail::ia64_rounding_control { static float force_rounding(const float r) { volatile float _r = r; return _r; } static float to_int(const float& x) { return rintf(x); } }; template<> struct rounding_control<double>: detail::ia64_rounding_control { static const double & force_rounding(const double& r) { return r; } static double to_int(const double& r) { return rint(r); } }; template<> struct rounding_control<long double>: detail::ia64_rounding_control { static const long double & force_rounding(const long double& r) { return r; } static long double to_int(const long double& r) { return rintl(r); } }; } // namespace interval_lib } // namespace numeric } // namespace boost #undef BOOST_NUMERIC_INTERVAL_NO_HARDWARE #endif /* __HP_aCC */ #endif /* BOOST_NUMERIC_INTERVAL_DETAIL_IA64_ROUNDING_CONTROL_HPP */

2 3

My GIL Review
by Simon Francis 25 Oct '06

25 Oct '06

I vote to accept GIL into boost. I am sorry I don't have time to write a more in-depth review at this point. ***What is your evaluation of the design?*** The design is very well thought out and seems surprisingly mature for a new library. ***What is your evaluation of the implementation?*** Convoluted and confusing, but there likely isn't a better way. ***What is your evaluation of the documentation?*** If I have one complaint about GIL its about the documentation. The tutorial is good, and so is the reference material ***What is your evaluation of the potential usefulness of the library?*** Extremely useful. While there are not as many algorithms as I would like, GIL by itself provides a remarkably stable base to build upon. I think it is really important that this is incorperated into boost because a lot of good things can be built off it. ***Did you try to use the library? With what compiler? Did you have any problems?*** GCC. My only problem was debugging templated code is hard, but I don't blame that on GIL. ***How much effort did you put into your evaluation? A glance? A quick reading? In-depth study?*** I have been using GIL as now for a few months as a part on a project on image compression. ***Are you knowledgeable about the problem domain?*** Moderately so.

1 0

Re: [boost] Bugs/Patches/Support requests and "Nobody"
by Christopher Kohlhoff 24 Oct '06

24 Oct '06

Hi Marshall, Marshall Clow <marshall(a)idio.com> wrote: > The remaining "unassigned" bugs are: > One for ASIO I just reassigned this one to me -- asio bugs should come my way. Thanks. Cheers, Chris

1 0

Boost inspection notification (2006-10-22/RC_1_34_0) *LC*
by Rene Rivera 24 Oct '06

24 Oct '06

Boost Inspection Report Run Date: 16:02:59 UTC, Sunday 22 October 2006 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: 11670 files scanned 903 directories scanned (including root) 2177 problems reported Problem counts: 1419 files missing Boost license info or having wrong reference text 758 files missing copyright notice Summary: any (3) archive (1) array (3) assign (2) bind (9) boost-root (4) boostbook (70) build (431) compatibility (2) compose (2) concept_check (24) conversion (5) detail (4) disjoint_sets (6) doc (56) filesystem (7) format (12) function (17) functional (8) graph (180) inspect (1) integer (9) io (2) iostreams (2) lambda (14) libs (8) logic (2) math (1) mem_fn (2) more (31) mpl (425) multi_array (16) numeric (214) optional (3) people (90) pool (32) program_options (45) property_map (17) ptr_container (113) python (6) quickbook (11) random (22) range (18) rational (5) regex (4) regression (67) release (3) serialization (16) signals (32) smart_ptr (15) test (5) timer (3) tokenizer (9) tools (6) tr1 (2) tuple (9) utility (26) variant (43) wiki (2) Details: *L* missing Boost license info, or wrong reference text *C* missing copyright notice |any| libs/any/doc/ any.xml: *L* libs/any/ index.html: *C* *L* |archive| boost/archive/detail/ utf8_codecvt_facet.hpp: *L* |array| libs/array/doc/ array.xml: *L* libs/array/ index.html: *C* *L* |assign| libs/assign/doc/ style.css: *L* libs/assign/ index.html: *L* |bind| libs/bind/ bind.html: *L* libs/bind/doc/ ref.xml: *L* libs/bind/ index.html: *C* *L* mem_fn.html: *L* ref.html: *C* *L* libs/bind/test/ Jamfile: *L* Jamfile.v2: *L* |boost-root| / README: *C* boost.css: *C* *L* rst.css: *L* |boostbook| tools/boostbook/doc/ Jamfile.v2: *C* *L* boostbook.xml: *L* documenting.xml: *C* *L* reference.xml: *L* together.xml: *C* *L* tools/boostbook/ setup_boostbook.py: *C* *L* setup_boostbook.sh: *C* *L* tools/boostbook/xsl/ admon.xsl: *C* *L* annotation.xsl: *C* *L* tools/boostbook/xsl/caramel/ concept2docbook.xsl: *L* cpp-operators.xml: *L* unparser.xsl: *L* tools/boostbook/xsl/ chunk-common.xsl: *C* *L* docbook-layout.xsl: *C* *L* docbook.xsl: *C* *L* tools/boostbook/xsl/doxygen/ collect.xsl: *C* *L* doxygen2boostbook.xsl: *C* *L* tools/boostbook/xsl/dtd/ dtd2boostbook.xsl: *C* *L* tools/boostbook/xsl/ error.xsl: *C* *L* fo.xsl: *C* *L* function.xsl: *C* *L* global.xsl: *C* *L* html-single.xsl: *C* *L* html.xsl: *L* index.xsl: *C* *L* library.xsl: *L* lookup.xsl: *C* *L* macro.xsl: *C* *L* manpages.xsl: *C* *L* navbar.xsl: *C* *L* reference.xsl: *C* *L* relative-href.xsl: *C* *L* source-highlight.xsl: *C* *L* template.xsl: *C* *L* tools/boostbook/xsl/testing/ Jamfile.xsl: *L* testsuite.xsl: *C* *L* tools/boostbook/xsl/ type.xsl: *C* *L* utility.xsl: *C* *L* xref.xsl: *C* *L* |build| tools/build/v1/ gcc-nocygwin-tools.html: *L* gcc-nocygwin-tools.jam: *L* stlport.jam: *L* sunpro-stlport-tools.jam: *L* tools/build/v1/test/ test-testing.jam: *L* tools/build/v1/ vacpp-tools.jam: *L* tools/build/v2/ boost-build.jam: *C* *L* boost.css: *C* *L* build-system.jam: *L* tools/build/v2/build/ alias.jam: *L* build-request.jam: *L* feature.jam: *L* modifiers.jam: *L* project.jam: *L* property-set.jam: *L* property.jam: *L* readme.txt: *C* *L* scanner.jam: *L* toolset.jam: *L* type.jam: *L* version.jam: *L* virtual-target.jam: *L* tools/build/v2/ changes.txt: *C* *L* tools/build/v2/doc/ Jamfile.v2: *C* *L* development_plan.html: *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* howto.xml: *C* *L* install.xml: *C* *L* recipes.xml: *C* *L* reference.xml: *C* *L* standalone.xml: *C* *L* tasks.xml: *C* *L* tutorial.xml: *C* *L* userman.xml: *C* *L* v1_vs_v2.xml: *C* *L* tools/build/v2/doc/ tools.html: *L* tools/build/v2/example/ boost-build.jam: *C* *L* tools/build/v2/example/customization/ Jamfile: *C* *L* inline_file.py: *L* project-root.jam: *C* *L* readme.txt: *C* *L* verbatim.jam: *L* tools/build/v2/example/gettext/ Jamfile: *C* *L* project-root.jam: *C* *L* readme.txt: *C* *L* tools/build/v2/example/libraries/app/ Jamfile: *C* *L* tools/build/v2/example/libraries/util/foo/ Jamfile: *C* *L* tools/build/v2/example/make/ readme.txt: *C* *L* tools/build/v2/example/qt/ README.txt: *C* *L* tools/build/v2/example/variant/ Jamfile: *C* *L* tools/build/v2/example/variant/libs/ Jamfile: *C* *L* tools/build/v2/example/variant/ project-root.jam: *C* *L* readme.txt: *C* *L* tools/build/v2/example/versioned/ jamfile.jam: *L* project-root.jam: *L* tools/build/v2/ generators_prototype.py: *L* hacking.txt: *C* *L* index.html: *L* tools/build/v2/kernel/ boost-build.jam: *L* bootstrap.jam: *L* class.jam: *L* errors.jam: *L* modules.jam: *L* tools/build/v2/ nightly.sh: *C* *L* tools/build/v2/notes/ README.txt: *C* *L* build_dir_option.txt: *C* *L* relative_source_paths.txt: *C* *L* tools/build/v2/options/ help.jam: *L* tools/build/v2/ release_procedure.txt: *C* *L* roll.sh: *C* *L* site-config.jam: *L* tools/build/v2/test/ BoostBuild.py: *C* *L* Jamfile: *C* *L* TestCmd.py: *L* abs_workdir.py: *C* *L* absolute_sources.py: *C* *L* alias.py: *C* *L* alternatives.py: *C* *L* assert-equal.jam: *C* *L* bad_dirname.py: *L* boost-build.jam: *C* *L* boostbook.py: *L* tools/build/v2/test/boostbook/ a.hpp: *C* *L* docs.xml: *L* tools/build/v2/test/ build_dir.py: *C* *L* c_file.py: *L* chain.py: *C* *L* check-arguments.jam: *L* check-bindrule.jam: *C* *L* check-jam-patches.jam: *C* *L* check-test-tools.jam: *C* *L* composite.py: *L* conditionals.py: *C* *L* conditionals2.py: *L* conditionals3.py: *L* core_d12.py: *C* *L* core_delete_module.py: *C* *L* core_dependencies.py: *C* *L* core_import_module.py: *L* core_modifiers.py: *C* *L* core_typecheck.py: *C* *L* core_varnames.py: *C* *L* custom_generator.py: *L* default_build.py: *C* *L* default_features.py: *L* tools/build/v2/test/dependency-test/ Jamfile: *C* *L* foo.jam: *C* *L* project-root.jam: *C* *L* tools/build/v2/test/dependency-test/src1/ z.h: *C* *L* tools/build/v2/test/ dependency_property.py: *L* dependency_test.py: *C* *L* tools/build/v2/test/direct-request-test/ Jamfile: *C* *L* project-root.jam: *C* *L* tools/build/v2/test/ 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/generators-test/ Jamfile: *C* *L* extra.jam: *C* *L* lex.jam: *L* tools/build/v2/test/generators-test/lib/ Jamfile: *C* *L* tools/build/v2/test/generators-test/ nm.jam: *C* *L* project-root.jam: *C* *L* qt.jam: *C* *L* tools/build/v2/test/ generators_test.py: *C* *L* glob.py: *L* inherit_toolset.py: *L* inline.py: *L* library_chain.py: *L* library_order.py: *L* library_property.py: *L* loop.py: *L* m1-01.py: *C* *L* m1-02.py: *C* *L* m1-03.py: *C* *L* make_rule.py: *C* *L* tools/build/v2/test/module-actions/ boost-build.jam: *C* *L* bootstrap.jam: *C* *L* tools/build/v2/test/ module_actions.py: *C* *L* ndebug.py: *L* no_type.py: *C* *L* ordered_properties.py: *L* path_features.py: *C* *L* prebuilt.py: *C* *L* tools/build/v2/test/prebuilt/ Jamfile: *C* *L* tools/build/v2/test/prebuilt/ext/ Jamfile: *C* *L* project-root.jam: *C* *L* tools/build/v2/test/prebuilt/ project-root.jam: *C* *L* tools/build/v2/test/ print.py: *C* *L* project-test1.jam: *C* *L* tools/build/v2/test/project-test1/ Jamfile: *C* *L* tools/build/v2/test/project-test1/dir/ Jamfile: *C* *L* tools/build/v2/test/project-test1/dir2/ Jamfile: *C* *L* project-root.jam: *C* *L* tools/build/v2/test/project-test1/ project-root.jam: *C* *L* project-test1.jam: *C* *L* readme.txt: *C* *L* standalone-project.jam: *C* *L* tools/build/v2/test/project-test3/ Jamfile: *C* *L* tools/build/v2/test/project-test3/lib/ Jamfile: *C* *L* tools/build/v2/test/project-test3/lib2/ Jamfile: *C* *L* tools/build/v2/test/project-test3/lib2/helper/ Jamfile: *C* *L* tools/build/v2/test/project-test3/lib3/ Jamfile: *C* *L* project-root.jam: *C* *L* tools/build/v2/test/project-test3/ project-root.jam: *C* *L* readme.txt: *C* *L* tools/build/v2/test/project-test4/ Jamfile: *C* *L* tools/build/v2/test/project-test4/lib/ Jamfile: *C* *L* tools/build/v2/test/project-test4/lib2/ Jamfile: *C* *L* tools/build/v2/test/project-test4/ project-root.jam: *C* *L* readme.txt: *C* *L* tools/build/v2/test/ project_dependencies.py: *C* *L* project_root_constants.py: *L* project_test1.py: *C* *L* project_test3.py: *C* *L* project_test4.py: *C* *L* property_expansion.py: *L* railsys.py: *L* readme.txt: *C* *L* rebuilds.py: *C* *L* recursive.jam: *L* regression.py: *L* relative_sources.py: *C* *L* searched_lib.py: *C* *L* skipping.py: *L* stage.py: *C* *L* standalone.py: *L* tools/build/v2/test/startup/boost-root/ boost-build.jam: *C* *L* tools/build/v2/test/startup/boost-root/build/ boost-build.jam: *C* *L* bootstrap.jam: *C* *L* tools/build/v2/test/startup/bootstrap-env/ boost-build.jam: *C* *L* tools/build/v2/test/startup/bootstrap-explicit/ boost-build.jam: *C* *L* tools/build/v2/test/startup/bootstrap-implicit/ readme.txt: *C* *L* tools/build/v2/test/startup/no-bootstrap1/ boost-build.jam: *C* *L* tools/build/v2/test/startup/no-bootstrap1/subdir/ readme.txt: *C* *L* tools/build/v2/test/startup/no-bootstrap2/ boost-build.jam: *C* *L* tools/build/v2/test/startup/no-bootstrap3/ boost-build.jam: *C* *L* tools/build/v2/test/ startup_v1.py: *C* *L* startup_v2.py: *C* *L* suffix.py: *L* svn_tree.py: *L* symlink.py: *C* *L* tag.py: *L* test-config-example.jam: *C* *L* test.jam: *C* *L* test1.py: *C* *L* test2.py: *C* *L* tools/build/v2/test/test2/ Jamfile: *C* *L* tools/build/v2/test/ test_all.py: *C* *L* test_nt_line_length.jam: *L* test_system.html: *L* tools/build/v2/test/testing-primitives/ boost-build.jam: *C* *L* bootstrap.jam: *C* *L* tools/build/v2/test/ testing_primitives.py: *C* *L* tree.py: *L* unit-tests.jam: *L* unit_test.py: *L* unit_tests.py: *C* *L* unused.py: *C* *L* tools/build/v2/test/unused/ Jamfile: *C* *L* b.cpp: *C* *L* project-root.jam: *C* *L* tools/build/v2/test/ use_requirements.py: *C* *L* tools/build/v2/test/v1-testing/ Jamfile: *C* *L* boost-build.jam: *C* *L* tools/build/v2/test/ v1_testing.py: *C* *L* tools/build/v2/test/v1_testing/ Jamfile: *C* *L* boost-build.jam: *C* *L* project-root.jam: *C* *L* tools/build/v2/test/ wrapper.py: *L* tools/build/v2/tools/ bison.jam: *L* boostbook.jam: *L* borland.jam: *L* builtin.jam: *L* common.jam: *L* como-linux.jam: *L* darwin.jam: *L* doxygen.jam: *L* gettext.jam: *L* kylix.jam: *L* lex.jam: *L* make.jam: *L* qt3.jam: *L* stage.jam: *L* stlport.jam: *L* sun.jam: *L* symlink.jam: *L* testing.jam: *L* xsltproc.jam: *L* tools/build/v2/ user-config.jam: *L* tools/build/v2/util/ assert.jam: *L* container.jam: *L* doc.jam: *L* indirect.jam: *L* numbers.jam: *L* os.jam: *L* print.jam: *L* regex.jam: *L* sequence.jam: *L* set.jam: *L* string.jam: *L* utility.jam: *L* |compatibility| libs/compatibility/ generate_cpp_c_headers.py: *L* index.html: *L* |compose| libs/compose/ index.htm: *C* *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* index.html: *C* *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* |detail| boost/detail/ algorithm.hpp: *L* endian.hpp: *L* limits.hpp: *L* utf8_codecvt_facet.hpp: *L* |disjoint_sets| libs/disjoint_sets/ Jamfile: *C* *L* bibliography.html: *L* disjoint_sets.html: *L* index.html: *C* *L* |doc| doc/ Jamfile.v2: *C* *L* doc/html/ CopyConstructible.html: *C* *L* any.html: *C* *L* array.html: *C* *L* doc/html/bbv2/ installation.html: *C* *L* doc/html/ boost_math.html: *C* *L* doc/html/boost_math/ gcd_lcm.html: *C* *L* inverse_complex.html: *C* *L* doc/html/ boost_staticassert.html: *C* *L* boost_tr1.html: *C* *L* boost_typetraits.html: *C* *L* doc/html/boost_typetraits/ background.html: *C* *L* doc/html/ boostbook.html: *C* *L* date_time.html: *C* *L* foreach.html: *C* *L* function.html: *C* *L* functionN.html: *C* *L* lambda.html: *C* *L* program_options.html: *C* *L* ref.html: *C* *L* reference.css: *C* *L* signals.html: *C* *L* string_algo.html: *C* *L* tribool.html: *C* *L* variant.html: *C* *L* who_s_using_boost_.html: *C* *L* xpressive.html: *C* *L* doc/src/ boost.xml: *C* *L* |filesystem| libs/filesystem/build/ Jamfile.v2: *C* *L* libs/filesystem/doc/ tr2_proposal.html: *L* libs/filesystem/example/ Jamfile.v2: *C* *L* libs/filesystem/src/ utf8_codecvt_facet.hpp: *L* libs/filesystem/test/ Jamfile.v2: *L* |format| libs/format/ Jamfile: *L* libs/format/benchmark/ Jamfile: *L* bench_format.cpp: *C* results.txt: *C* *L* libs/format/doc/ choices.html: *L* format.html: *C* libs/format/example/ Jamfile: *L* libs/format/ index.html: *C* *L* libs/format/test/ Jamfile: *L* Jamfile.v2: *L* |function| boost/function/detail/ gen_maybe_include.pl: *L* libs/function/doc/ Jamfile.v2: *C* *L* faq.xml: *C* *L* history.xml: *C* *L* misc.xml: *C* *L* reference.xml: *C* *L* tests.xml: *C* *L* tutorial.xml: *C* *L* libs/function/ index.html: *C* *L* |functional| boost/ functional.hpp: *L* libs/functional/ binders.html: *L* function_test.cpp: *L* function_traits.html: *L* index.html: *L* mem_fun.html: *L* negators.html: *L* ptr_fun.html: *L* |graph| libs/graph/build/ Jamfile: *C* *L* Jamfile.v2: *C* *L* libs/graph/doc/ AStarHeuristic.html: *L* AStarVisitor.html: *L* AdjacencyGraph.html: *L* AdjacencyMatrix.html: *L* BFSVisitor.html: *L* BasicMatrix.html: *L* BellmanFordVisitor.html: *L* BidirectionalGraph.html: *L* Buffer.html: *L* ColorValue.html: *L* DFSVisitor.html: *L* DijkstraVisitor.html: *L* EdgeListGraph.html: *L* EdgeMutableGraph.html: *L* EventVisitor.html: *L* EventVisitorList.html: *L* Graph.html: *L* IncidenceGraph.html: *L* IteratorConstructibleGraph.html: *L* Makefile: *C* *L* Monoid.html: *L* MutableGraph.html: *L* MutablePropertyGraph.html: *L* PropertyGraph.html: *L* PropertyTag.html: *L* VertexAndEdgeListGraph.html: *L* VertexListGraph.html: *L* VertexMutableGraph.html: *L* acknowledgements.html: *L* adjacency_iterator.html: *L* adjacency_list.html: *L* adjacency_list_traits.html: *L* adjacency_matrix.html: *L* astar_heuristic.html: *L* astar_search.html: *L* astar_visitor.html: *L* bandwidth.html: *L* bc_clustering.html: *L* bellman_ford_shortest.html: *L* bellman_visitor.html: *L* betweenness_centrality.html: *L* bfs_visitor.html: *L* bgl_named_params.html: *L* bibliography.html: *L* breadth_first_search.html: *L* breadth_first_visit.html: *L* challenge.html: *L* circle_layout.html: *L* compressed_sparse_row.html: *L* connected_components.html: *L* constructing_algorithms.html: *L* copy_graph.html: *L* cuthill_mckee_ordering.html: *L* dag_shortest_paths.html: *L* default.css: *L* depth_first_search.html: *L* depth_first_visit.html: *L* dfs_visitor.html: *L* dijkstra_shortest_paths.html: *L* dijkstra_visitor.html: *L* distance_recorder.html: *L* edge_list.html: *L* edmunds_karp_max_flow.html: *L* exception.html: *L* faq.html: *L* libs/graph/doc/figs/ Makefile: *C* *L* libs/graph/doc/ file_dependency_example.html: *L* filtered_graph.html: *L* floyd_warshall_shortest.html: *L* fruchterman_reingold.html: *L* graph_coloring.html: *L* graph_concepts.html: *L* graph_theory_review.html: *L* graph_traits.html: *L* gursoy_atun_layout.html: *L* history.html: *L* incident.html: *L* incremental_components.html: *L* index.html: *L* inv_adjacency_iterator.html: *L* isomorphism.html: *L* johnson_all_pairs_shortest.html: *L* jwebfrob.pl: *C* *L* kamada_kawai_spring_layout.html: *L* kevin_bacon.html: *L* king_ordering.html: *L* known_problems.html: *L* kruskal_min_spanning_tree.html: *L* layout_tolerance.html: *C* *L* leda_conversion.html: *L* lengauer_tarjan_dominator_tree.htm: *L* minimum_degree_ordering.html: *L* null_visitor.html: *L* opposite.html: *L* predecessor_recorder.html: *L* prim_minimum_spanning_tree.html: *L* profile.htm: *L* property.html: *L* property_map.html: *L* property_writer.html: *L* publications.html: *L* push_relabel_max_flow.html: *L* python.html: *L* quick_tour.html: *L* random.html: *L* random_layout.html: *L* read_graphviz.html: *C* *L* read_graphviz.rst: *C* *L* reverse_graph.html: *L* sequential_vertex_coloring.html: *L* sloan_ordering.htm: *L* sloan_start_end_vertices.htm: *L* sparse_matrix_ordering.html: *L* stanford_graph.html: *L* strong_components.html: *L* subgraph.html: *L* table_of_contents.html: *L* time_stamper.html: *L* topological_sort.html: *L* transitive_closure.html: *L* transpose_graph.html: *L* trouble_shooting.html: *L* undirected_dfs.html: *L* users.html: *C* *L* using_adjacency_list.html: *L* using_property_maps.html: *L* visitor_concepts.html: *L* wavefront.htm: *L* write-graphviz.html: *L* libs/graph/example/ Jamfile: *C* *L* cuthill_mckee_ordering.cpp: *L* data1.txt: *C* *L* data2.txt: *C* *L* data3.txt: *C* *L* king_ordering.cpp: *L* property_iterator.cpp: *L* libs/graph/example/python/ breadth_first_search.py: *C* *L* vis.py: *C* *L* libs/graph/example/ regrtest.py: *C* *L* sloan_ordering.cpp: *L* libs/graph/ index.html: *C* *L* libs/graph/src/ Makefile: *C* *L* README: *C* *L* graphviz_digraph_lex.cpp: *L* graphviz_digraph_parser.hpp: *C* *L* graphviz_graph_lex.cpp: *L* graphviz_graph_parser.hpp: *C* *L* libs/graph/test/ Jamfile: *C* *L* Jamfile.v2: *C* *L* cuthill_mckee_ordering.cpp: *L* dag_longest_paths.cpp: *C* *L* king_ordering.cpp: *L* serialize.cpp: *C* *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* |io| libs/io/ index.html: *C* *L* |iostreams| libs/iostreams/doc/ menu.html: *C* libs/iostreams/test/detail/ utf8_codecvt_facet.hpp: *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/doc/ index.html: *C* *L* libs/lambda/ index.html: *C* *L* libs/lambda/test/ Makefile: *C* *L* |libs| libs/ expected_results.xml: *C* *L* index.html: *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* |mem_fn| libs/mem_fn/ index.html: *C* *L* |more| more/ blanket-permission.txt: *C* borland_cpp.html: *C* *L* count_bdy.htm: *L* discussion_policy.htm: *C* error_handling.html: *L* generic_exception_safety.html: *C* *L* generic_programming.html: *L* microsoft_vcpp.html: *C* *L* moderators.html: *C* regression.html: *C* *L* report-apr-2006.html: *C* *L* report-jan-2006.html: *C* *L* more/writingdoc/ design.html: *L* index.html: *L* introduction.html: *L* structure.html: *L* more/writingdoc/template/ acknowledgments.html: *L* bibliography.html: *L* configuration.html: *L* definitions.html: *L* faq.html: *L* header.html: *L* index.html: *L* overview.html: *L* rationale.html: *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* refmanual.py: *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/ Jamfile: *C* *L* libs/mpl/ index.html: *C* *L* libs/mpl/test/ Jamfile: *C* *L* Jamfile.v2: *C* *L* libs/mpl/test/aux_/ Jamfile: *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/ index.html: *C* *L* libs/multi_array/test/ Jamfile: *L* 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/ index.html: *C* *L* libs/numeric/conversion/test/ Jamfile: *C* *L* 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/ index.html: *C* *L* libs/numeric/interval/doc/ checking.htm: *L* comparisons.htm: *L* examples.htm: *L* guide.htm: *L* includes.htm: *L* index.html: *C* *L* interval.htm: *L* numbers.htm: *L* policies.htm: *L* rounding.htm: *L* todo.htm: *L* libs/numeric/ublas/bench1/ Jamfile: *L* bench1.cpp: *L* bench1.hpp: *L* bench11.cpp: *L* bench12.cpp: *L* bench13.cpp: *L* libs/numeric/ublas/bench2/ Jamfile: *L* bench2.cpp: *L* bench2.hpp: *L* bench21.cpp: *L* bench22.cpp: *L* bench23.cpp: *L* libs/numeric/ublas/bench3/ Jamfile: *L* bench3.cpp: *L* bench3.hpp: *L* bench31.cpp: *L* bench32.cpp: *L* bench33.cpp: *L* libs/numeric/ublas/bench4/ Jamfile: *L* 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/ Jamfile: *L* 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/ index.html: *C* *L* libs/numeric/ublas/test/ Jamfile: *L* 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/ index.html: *C* *L* libs/optional/test/ Jamfile.v2: *L* |people| people/ aleksey_gurtovoy.htm: *C* *L* andreas_huber.html: *C* *L* beman_dawes.html: *C* *L* darin_adler.htm: *C* *L* daryle_walker.html: *C* *L* dietmar_kuehl.htm: *C* *L* doug_gregor.html: *C* *L* ed_brey.htm: *C* *L* eric_friedman.htm: *C* *L* fernando_cacciola.html: *C* *L* gary_powell.htm: *C* *L* gennadiy_rozental.htm: *C* *L* greg_colvin.htm: *C* *L* hartmut_kaiser.htm: *C* *L* herve_bronnimann.htm: *C* *L* howard_hinnant.htm: *C* *L* hubert_holin.html: *C* *L* jaakko_jarvi.htm: *C* *L* jeff_garland.html: *C* *L* jens_maurer.htm: *C* *L* jeremy_siek.htm: *C* *L* joaquin_lopez.htm: *C* *L* joel_de_guzman.htm: *C* *L* john_maddock.htm: *C* *L* jonathan_turkanis.htm: *C* *L* kevlin_henney.htm: *C* *L* liequan_lee.htm: *C* *L* mac_murrett.htm: *C* *L* mark_rodgers.htm: *C* *L* mat_marcus.htm: *C* *L* paul_mensonides.htm: *C* *L* paul_moore.htm: *C* *L* pavol_droba.htm: *C* *L* people.htm: *C* *L* peter_dimov.htm: *C* *L* ralf_w_grosse_kunstleve.htm: *C* *L* rene_rivera.htm: *C* *L* robert_ramey.htm: *C* *L* ronald_garcia.htm: *C* *L* samuel_krempp.htm: *C* *L* thomas_witt.html: *C* *L* thorsten_ottosen.html: *C* *L* vesa_karvonen.htm: *C* *L* vladimir_prus.htm: *C* *L* william_kempf.htm: *C* *L* |pool| boost/pool/detail/ pool_construct.bat: *L* pool_construct.sh: *L* pool_construct_simple.bat: *L* pool_construct_simple.sh: *L* libs/pool/ TODO.txt: *C* *L* libs/pool/doc/ concepts.html: *L* copyright.html: *L* libs/pool/doc/implementation/ alignment.html: *L* ct_gcd_lcm.html: *L* for.html: *L* gcd_lcm.html: *L* guard.html: *L* mutex.html: *L* object_pool.html: *L* pool.html: *L* pool_alloc.html: *L* pool_construct.html: *L* simple_segregated_storage.html: *L* singleton.html: *L* singleton_pool.html: *L* libs/pool/doc/ index.html: *L* interfaces.html: *L* libs/pool/doc/interfaces/ object_pool.html: *L* pool.html: *L* pool_alloc.html: *L* simple_segregated_storage.html: *L* singleton_pool.html: *L* user_allocator.html: *L* libs/pool/doc/ pool.css: *L* libs/pool/ index.html: *C* *L* |program_options| boost/program_options/detail/ utf8_codecvt_facet.hpp: *L* libs/program_options/build/ Jamfile: *C* *L* 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* index.html: *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: *C* *L* Jamfile.v2: *C* *L* libs/program_options/ index.html: *C* *L* libs/program_options/test/ Jamfile: *C* *L* 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* index.html: *C* *L* iterator_property_map.html: *L* property_map.html: *L* vector_property_map.html: *L* |ptr_container| libs/ptr_container/doc/ Jamfile.v2: *C* *L* associative_ptr_container.html: *L* associative_ptr_container.rst: *L* comp.sh: *C* *L* comp_all.sh: *C* *L* comp_assoc_ptr_container.sh: *C* *L* comp_conventions.sh: *C* *L* comp_examples.sh: *C* *L* comp_faq.sh: *C* *L* comp_guidelines.sh: *C* *L* comp_headers.sh: *C* *L* comp_indirect_fun.sh: *C* *L* comp_ptr_array.sh: *C* *L* comp_ptr_container.sh: *C* *L* comp_ptr_deque.sh: *C* *L* comp_ptr_list.sh: *C* *L* comp_ptr_map.sh: *C* *L* comp_ptr_map_adapter.sh: *C* *L* comp_ptr_multimap.sh: *C* *L* comp_ptr_multimap_adapter.sh: *C* *L* comp_ptr_multiset.sh: *C* *L* comp_ptr_multiset_adapter.sh: *C* *L* comp_ptr_sequence_adapter.sh: *C* *L* comp_ptr_set.sh: *C* *L* comp_ptr_set_adapter.sh: *C* *L* comp_ptr_vector.sh: *C* *L* comp_reference.sh: *C* *L* comp_rever_ptr_container.sh: *C* *L* comp_tutorial.sh: *C* *L* conventions.html: *L* conventions.rst: *L* default.css: *L* examples.rst: *L* faq.html: *L* faq.rst: *L* guidelines.html: *L* guidelines.rst: *L* headers.html: *L* headers.rst: *L* indirect_fun.html: *L* indirect_fun.rst: *L* intro.xml: *C* *L* ptr_array.html: *L* ptr_array.rst: *L* ptr_container.xml: *L* ptr_deque.html: *L* ptr_deque.rst: *L* ptr_list.html: *L* ptr_list.rst: *L* ptr_map.html: *L* ptr_map.rst: *L* ptr_map_adapter.html: *L* ptr_map_adapter.rst: *L* ptr_multimap.html: *L* ptr_multimap.rst: *L* ptr_multimap_adapter.html: *L* ptr_multimap_adapter.rst: *L* ptr_multiset.html: *L* ptr_multiset.rst: *L* ptr_multiset_adapter.html: *L* ptr_multiset_adapter.rst: *L* ptr_sequence_adapter.html: *L* ptr_sequence_adapter.rst: *L* ptr_set.html: *L* ptr_set.rst: *L* ptr_set_adapter.html: *L* ptr_set_adapter.rst: *L* ptr_vector.html: *L* ptr_vector.rst: *L* reference.html: *L* reference.rst: *L* reversible_ptr_container.html: *L* reversible_ptr_container.rst: *L* style.css: *C* *L* todo.txt: *C* *L* tutorial.html: *L* tutorial.rst: *L* libs/ptr_container/ index.html: *C* *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* |quickbook| tools/quickbook/doc/ Jamfile.v2: *C* *L* tools/quickbook/doc/html/quickbook/ change_log.html: *L* intro.html: *L* ref.html: *L* syntax.html: *L* tools/quickbook/doc/html/quickbook/syntax/ block.html: *L* comments.html: *L* phrase.html: *L* tools/quickbook/ index.html: *C* *L* |random| libs/random/ index.html: *C* *L* nondet_random.html: *C* *L* random-concepts.html: *C* *L* random-distributions.html: *C* *L* random-generators.html: *C* *L* random-misc.html: *C* *L* random-performance.html: *C* *L* random-variate.html: *C* *L* libs/random/test/ Jamfile: *C* *L* Jamfile.v2: *C* *L* libs/random/ wg21-proposal.html: *C* *L* |range| libs/range/doc/ boost_range.html: *L* example.cpp: *C* *L* examples.html: *L* faq.html: *L* headers.html: *L* history_ack.html: *L* intro.html: *L* portability.html: *L* range.html: *L* style.css: *C* *L* style.html: *L* utility_class.html: *L* libs/range/test/ TODO: *C* *L* compat1.cpp: *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: *C* *L* 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/ Jamfile: *L* test.bat: *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* 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/ user-config.jam: *L* 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/ Jamfile.v2: *C* *L* design.xml: *C* *L* faq.xml: *C* *L* index.html: *C* *L* introduction.xml: *C* *L* rationale.xml: *C* *L* libs/signals/doc/reference/ connection.xml: *C* *L* last_value.xml: *C* *L* reference.xml: *C* *L* signal_header.xml: *C* *L* slot.xml: *C* *L* trackable.xml: *C* *L* visit_each.xml: *C* *L* libs/signals/doc/ tests.xml: *C* *L* tutorial.xml: *C* *L* libs/signals/ index.html: *C* *L* |smart_ptr| libs/smart_ptr/ compatibility.htm: *L* enable_shared_from_this.html: *L* index.html: *C* *L* intrusive_ptr.html: *L* scoped_array.htm: *L* scoped_ptr.htm: *L* shared_array.htm: *L* shared_ptr.htm: *L* smart_ptr.htm: *L* smarttests.htm: *L* sp_techniques.html: *L* libs/smart_ptr/test/ Jamfile: *L* Jamfile.v2: *L* libs/smart_ptr/ weak_ptr.htm: *L* |test| boost/test/utils/runtime/cla/detail/ argument_value_usage.hpp: *L* libs/test/example/ unit_test_example_01.cpp: *C* *L* libs/test/test/auto-link-test/ run_bjam.bat: *C* *L* |timer| libs/timer/ index.html: *C* *L* timer.htm: *L* |tokenizer| libs/tokenizer/ char_delimiters_separator.htm: *L* char_separator.htm: *L* escaped_list_separator.htm: *L* index.html: *L* introduc.htm: *L* offset_separator.htm: *L* token_iterator.htm: *L* tokenizer.htm: *L* tokenizerfunction.htm: *L* |tools| tools/ Jamfile.v2: *C* *L* index.html: *C* *L* make-cputime-page.pl: *C* *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/ index.html: *C* *L* libs/tuple/test/ Jamfile: *C* *L* README: *C* *L* |utility| boost/ shared_container_iterator.hpp: *L* libs/utility/ Assignable.html: *L* Collection.html: *L* CopyConstructible.html: *L* LessThanComparable.html: *L* MultiPassInputIterator.html: *L* OptionalPointee.html: *L* assert.html: *L* call_traits.htm: *L* checked_delete.html: *L* compressed_pair.htm: *L* current_function.html: *L* enable_if.html: *L* generator_iterator.htm: *C* *L* index.html: *C* *L* libs/utility/test/ Jamfile: *L* Jamfile.v2: *L* libs/utility/ throw_exception.html: *L* 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: *L* Jamfile.v2: *L* |wiki| wiki/ index.html: *C* *L*

2 2

GIL Review
by Tim Day 24 Oct '06

24 Oct '06

> Please always explicitly state in your review, > whether you think the library should be accepted into Boost. Yes, I think it should be accepted. - What is your evaluation of the design? - What is your evaluation of the implementation? I don't feel qualified to comment. I like _using_ libraries like this, but it's way beyond anything I'd contemplate putting together myself. It certainly seems to deal with a lot of issues very elegantly. - What is your evaluation of the documentation? I found it quite a steep learning curve to get anything running. The tutorial would IMHO be greatly improved if (in "hello world" tradition) it just added the few extra lines of code to make a complete app (perhaps loading and saving an image from/to file, or generating something synthetic). [But, I see the collection of examples recently put up address this]. The doxygen documentation I found fairly pointless; usually grepping the code directly found me what I was looking for quicker. Initially I found the most useful bit of the design guide was the specific examples in the later chapters, but then having used the library a bit I got more value out of the "concept" chapters on revisiting them. - What is your evaluation of the potential usefulness of the library? Well I'll certainly be using it in future whether it's accepted into boost or not. There seems to be a lot of unnecessary worrying on the list about it not being a full-featured image processing library, but that's not actually what I'm looking for... all I want is a flexible, efficient STL-like container for my pixels. It's like arguing std::vector or std::valarray shouldn't be in the standard if a heavy duty numerics library isn't also included. - Did you try to use the library? With what compiler? Did you have any problems? No problems with "g++ 4.1.2 20060901 (prerelease)" in Debian Etch. I got some GIL related compile errors with gcc 3.3.5 (Debian Sarge) but I didn't investigate for any longer than it took to boot up the Etch box. - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? GIL (and things like Vigra) have been on my radar for a while but seeing GIL was up for Boost adoption prompted me to actually try and use it. I've now spent a few tens of hours using it in some new development (in which I'd have probably used one of my old legacy image classes otherwise). The experience has been entirely positive, although I have to say I haven't done much but create images of various formats, pass views of them around and iterate over them. The best bit so far was finding that the gtkmm and Qt front ends for my app needed different RGB orderings and dealing with it by simply instantiating my rendering backend with the appropriate GIL image type. > Are you knowledgeable about the problem domain? I've been a C++ user since around 1990, always working in the field of computer graphics and imaging. I've lost track of the number of times I've written yet another templated-on-pixel-type Image/Raster class of varying degrees of unsophistication. One of the first things I looked for when I discovered boost was an image class; it's about time there was one and GIL certainly seems worthy. Tim

1 0

Re: [boost] [asio] Active Objects Library
by Christopher Kohlhoff 24 Oct '06

24 Oct '06

Hi Scott, Scott <cheesy4poofs(a)cox.net> wrote: > I recently switched to a pool of worker threads using a single > threaded io_service. If you remember, I posted several times > about SSL wasn't working reliably. Well, the single threaded > io_service seems to have fixed that problem (I do believe the > SSL portion of ASIO has thread issues). > > However, I could never figure out how to avoid thread locking. > The documentation says that asio::buffer() does not make a > copy of the data, instead it makes copies of the pointer to > the buffer. Because of this, I had to copy my heap data to be > sent over the socket into a deque before calling post(). I think this buffer stuff is orthogonal to the issue of locking, but have you seen the reference counted buffer example? <http://asio.sourceforge.net/boost_asio_0_3_7/libs/asio/doc/examples/buffers…> > After the handler is called (the socket write has finished), I > then remove the first entry in the deque and submit the next > entry. This requires thread locking on the deque. Ok, so here... > I should also point out that because of our design, 2 or more > worker threads could be doing work that will require data to > be sent out over the same socket at exactly the same time. I > had to lock access to the socket since the docs say it isn't > thread safe. ...and here are some places where you are doing some locking. An explicit lock will prevent concurrent access to the data, yes, but another approach is to keep all accesses to the data from the same thread. This second approach is what this whole active object thread is about. You say your design now has a single thread calling io_service::run(), so let's specify that accesses to the deque and socket are *only* allowed to occur from that thread. Problem solved :) Seriously though, to implement this solution you need to use io_service::post() in conjunction with boost::bind(). These calls let you package up and post units of work to be executed by the io_service. Since only one thread is calling io_service::run(), all of these work units will be executed by that thread. For example, your connection class might look something like this: class connection { public: connection(io_service& i) : io_service_(i), socket_(i) { } ... connection establishment stuff here ... void write_message(const std::string& msg) { io_service_.post( boost::bind( &connection::do_write_message, this, msg)); } private: void do_write_message(const std::string& msg) { if (msgs_.empty()) { // No write in progress, so start write now. msgs_.push_back(msg); async_write(socket_, buffer(msgs_.front()), boost::bind( &connection::handle_write, this, _1); } else { // Another write already in progress. msgs_.push_back(msg); } } void handle_write(error e) { if (!e) { msgs_.pop_front(); if (!msgs_.empty()) { // Another message is ready to write. async_write(socket_, buffer(msgs_.front()), boost::bind( &connection::handle_write, this, _1); } } } io_service& io_service_; tcp::socket socket_; std::deque<std::string> msgs_; }; The private member functions do_write_message() and handle_write() are the only places that access the socket and deque. These functions are only ever used as callback handlers with io_service::post() or async_write(), which means that they are guaranteed to be called only from the thread that is calling io_service::run(). The public member function write_message() is written so that it can be called from any thread at any time (since the io_service::post() function is designed that way). It doesn't matter if "2 or more worker threads" need to call connection::write_message() since it's now perfectly safe to do so. No locks in sight :) Cheers, Chris

1 0