- Boost - lists.preview.boost.org

Unordered Map/Set in VC++/Boost?
by Péter Szilágyi 23 May '07

23 May '07

Hello, I wanted to use hash maps in VC++, but it seems that they have only an old implementation, but not the tr1 unordered_map type. Actually the hash_map would have been fine if I could use it with the boost "hash" class. Anyway, after searching a bit on google, I've found a page where is mentioned something about boost having an implementation of the unordered_map. So my question is: does boost or does it not contain the unordered_map, and if not, then anyone has any idea how I could use the boost hash class with the VC++ (2005) hash_map class? Thx in advance, Peter

8 8

[bimap] Post review version
by Matias Capeletto 23 May '07

23 May '07

Hello boost! I have upload a new version of the Boost.Bimap library to the vault: http://tinyurl.com/2t8c87 Documentation can be viewed online here: http://tinyurl.com/22sja5 Or can be downloaded from: http://tinyurl.com/22jfdf I have take into consideration most of the advices from the formal review. In the next following days I will be posting the more important changes so we can discuss them. For now, the most important changes are: * Change replace and modify functions * Change operator[] (add standard at(key) function ) * Change the way we use tags, from free functions to member functions * Functions now takes templated CompatibleKey * Added projection of iterators * namespace boost::bimap -> namespace boost::bimaps * Improved performance * Lots of small fixes * Improved docs, new diagrams, more examples, new sections I will need CVS write access to start testing the lib. What are the steps to follow? Thanks to all Comments are welcome! Best regards Matias

1 0

result_of<F()>::type is void ... why?
by Eric Niebler 22 May '07

22 May '07

I've noticed something odd about the specification of tr1::result_of. In result_of<F()>::type, if F is a class type that doesn't have a nested result_type typedef, the result is "void". This is only true for F(); that is, when there are no arguments. That leads to the following strangeness: struct foo { typedef int result_type; }; struct bar { template<class Sig> struct result { typedef int type; }; }; result_of<foo()>::type == int // 1 result_of<bar()>::type == void // 2 huh? result_of<foo(int)>::type == int // 3 result_of<bar(int)>::type == int // 4 This is the way it's specified in TR1, and boost::result_of implements this behavior faithfully, but I just can't understand why (2) is void instead of int. Can somebody explain it to me? -- Eric Niebler Boost Consulting www.boost-consulting.com

6 11

Re: [boost] Slots and signals: Listening to a value
by Johan Torp 22 May '07

22 May '07

>Looks good to me. You might consider a few minor additions: > > - A copy constructor for signalling_value, that just copies the >underlying value > - A copy assignment operator for signalling_value, that just >copies the underlying value Both should definitely be there. > - A conversion to const T& (same functionality as get) > - An assignment operator that takes a const T& (same functionality >as set) I think I prefer forcing users to be specific about what they do, in this case to point out that they are not just setting a value but also possibly signalling receivers. On the other hand, enabling these two features would allow users to treat this class as a regular value in generic programming. Which do you think is better? >> 4. Do you have a better naming suggestion? >Did you consider "observable_value"? Or even just "observable"? I did, but I wanted to point out that I was using signals and slots. Observable would be great if it was in the namespace boost::signals. Do you think this class might be useful enough to be added to boost slots and signals? Best Regards, Johan Torp

2 1

Re: [boost] [wave] found_include_directive
by dherring＠ll.mit.edu 22 May '07

22 May '07

On 20070519, Felipe Magno de Almeida wrote: > I wanted to propose found_include_directive returning a bool. Where > false would skip including the file. > I need this so that I can selectively skip including files. I'm > writing a dependency analysis for C++ files. This analysis may fail unless all the files are processed... An #include file may #define something that changes how the rest of the source is processed (e.g. "#define USE_FALLBACK_LIB"). Instead, you probably want a filter which eliminates tokens based on their #include depth (obtained from context::get_iteration_depth()). This is convenient since the context is already passed to found_include_directive. To filter tokens before they are parsed, construct the context object, loop over context::begin() to end(), populate a new list with tokens of depth=0, and hand this second list to the parser. - Daniel Who learned this issue/solution from another user.

1 0

[1.34][hash] Breaking change?
by John Maddock 22 May '07

22 May '07

The recent changes to Boost.Hash seem to have broken rather a lot of our regression tests? Just a quick heads-up. John.

2 1

boost::test examples urls not found (404)
by Philippe Vaucher 22 May '07

22 May '07

Hello, The examples from http://boost.org/libs/test/doc/components/utf/index.html#Example gives a 404 by me. I'm talking about the "unit_test_exampleX" examples, the others seems to be there. Philippe

3 3

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

22 May '07

Boost Regression test failures Report time: 2007-05-21T23:00:52Z 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… 565 failures in 5 libraries functional/hash (210) multi_index (128) serialization (1) statechart (1) tr1 (225) |functional/hash| books: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 hash_built_in_array_test: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 hash_custom_test: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 hash_deque_test: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 hash_float_test: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 hash_friend_test: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 hash_function_pointer_test: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 hash_fwd_test_1: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 hash_global_namespace_test: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 hash_list_test: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 hash_map_test: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 hash_no_ext_macro_1: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 hash_no_ext_macro_2: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 hash_number_test: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 hash_pointer_test: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 hash_range_test: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 hash_set_test: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 hash_string_test: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 hash_value_array_test: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 hash_vector_test: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 link_ext_test: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 link_test: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 point: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 portable: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 |multi_index| test_basic: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 test_capacity: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 test_comparison: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 test_composite_key: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 test_conv_iterators: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 test_copy_assignment: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 test_hash_ops: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 test_iterators: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 test_modifiers: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 test_observers: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 test_projection: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 test_safe_mode: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 test_serialization: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 test_set_ops: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 test_special_set_ops: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 test_update: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 |serialization| test_polymorphic_binary_archive: msvc-8.0 |statechart| HistoryTestRelaxed: msvc-8.0 |tr1| std_run_complex_overloads: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 std_run_random: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 std_test_bind: gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 std_test_function: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 std_test_hash: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 std_test_hash_header: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 std_test_mem_fn: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 std_test_reference_wrapper: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 std_test_regex: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 std_test_result_of: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 std_test_shared_array_header: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 std_test_shared_ptr_header: darwin-4.0.1 gcc-3.3.6 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 std_test_tr1_include: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 std_test_tuple: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 std_test_tuple_tricky: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 test_bind: gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 test_function: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 test_functional_std_header: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 test_hash: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 test_hash_header: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 test_mem_fn: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 test_reference_wrapper: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 test_result_of: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 test_tr1_include: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 test_tuple: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8 test_tuple_tricky: darwin-4.0.1 gcc-3.3.6 gcc-3.4.5_linux_x86_64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc msvc-7.1 msvc-8.0 msvc-8.0 sun-5.8

3 2

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

22 May '07

Boost Inspection Report Run Date: 16:06:17 UTC, Tuesday 22 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) 1059 problems reported Problem counts: 661 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 (14) 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/doc/tutorial/doc/html/python/ embedding.html: *L* exception.html: *L* exposing.html: *L* functions.html: *L* hello.html: *L* iterators.html: *L* object.html: *L* techniques.html: *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

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

22 May '07

Boost Inspection Report Run Date: 16:06:11 UTC, Tuesday 22 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

[1.34.1] Release Procedures
by Thomas Witt 22 May '07

22 May '07

1.34.1 Principles and Practice ============================== We will do a 1.34.1 maintenance release to deal with a number of significant bugs that came up right after the 1.34.0 release. The plan is to release 1.34.1 within the next two weeks and then close 1.34.x development. We will be using Trac http://svn.boost.org to track 1.34.1 issues and changes. Every change to 1.34.1 requires an associated Trac ticket. I will not accept patches without Trac ticket. Furthermore for a change to be accepted the correponding Trac ticket needs to have the 1.34.1 milestone assigned. Please don't assign this milestone yourself. I will assign the milestone once it's decided it should go into 1.34.1. The deadline for submitting 1.34.1 tickets is Wednesday May 23rd 6.00 pm PST. Here is the detailed process. 1. Submit bug in Trac 2. Request 1.34.1 milestone for ticket by posting to the developer list. (please copy me directly on this one) 3. 1.34.1 milestone is assigned by Release Manager. Ticket is assigned to developer 4. Post patch referencing ticket to the developer list. (Attach patch to ticket in Trac)(please copy me directly on this one) 5. Once patch is agreed upon I'll apply it to 1.34.1. One more thing, … don't rely on me picking all the issues from the list. I'll most likely fail. Be vocal, add an issue to the tracker. Thomas -- Thomas Witt witt(a)acm.org

9 14

Request for 1.34.1 milestone (bug #906)
by Johan Nilsson 22 May '07

22 May '07

http://svn.boost.org/trac/boost/ticket/906

5 11

trac accounts
by Michael Caisse 22 May '07

22 May '07

Has the Trac Account Manager Plugin been considered to help with users acquiring accounts? http://trac-hacks.org/wiki/AccountManagerPlugin I use it to allow clients to get access to a ticket system; however, I have wiki write permissions set up so that only users of a certain group can modify the wiki pages. A solution like this might help satisfy the need for an individual to post on tickets and have traceability to the poster/commenter while not opening up wiki editing for anonymous. In other words... I have TICKET_MODIFY set to authenticated and WIKI_MODIFY set to wiki_write_group. Just a thought. Best regards - michael -- ---------------------------------- Michael Caisse Object Modeling Designs www.objectmodelingdesigns.com

2 1

[mpl] max/min arity
by Maurizio Vitale 22 May '07

22 May '07

min and max presently have a fixed arity of 2. Personally, I feel they should obey BOOST_MPL_LIMIT_METAFUNCTION_ARITY like mpl::plus and similar metafunctions. Any chances this could be considered for the future? Regards, Maurizio

3 3

.[asio] : Problem while clean shut down of multi threaded server
by Gaurav.Jain＠iflexsolutions.com 22 May '07

22 May '07

Hi, I am using boost boost 1.33.1 with asio 0.3.8rc2. I have develop a Multi-threaded server program using pool of io_service. In my design i have pool of io_service object and this pool is controlled by a pool manager, which is running over a seprate io_service. I want to do clean shutdown of the server. In the clean shut down i want to close each connection running over related io_service. What i am doing is, while shutting down the server, pool manager is posting a request to each io_service object to shut it down. Each io_service object in turn posting a request to all the connection it is hosting to stop themselves. The problem i am facing : connection stop method is not getting executed at all for each running connection. Here is a code snippet of what i am doing : bool io_object_pool::shutdown_pool() { std::vector<io_object*>::const_iterator iter_output = io_object_vec.begin(); std::vector<io_object*>::const_iterator iter_end_output = io_object_vec.end(); for(; iter_output != iter_end_output; ) { io_object* io_object_temp = *iter_output; iter_output++; io_object_temp->get_ioservice().post(boost::bind(&io_object::stop_all, io_object_temp) ); } io_object_vec.clear(); is_pool_destroyed = true; return true; } bool io_object::stop_all() { std::set<connection_ptr >::const_iterator iter_output = connections_.begin(); std::set<connection_ptr >::const_iterator iter_end_output = connections_.end(); for(; iter_output != iter_end_output;) { connection_ptr conn_temp = *iter_output; iter_output++; conn_temp->socket().io_service().post(boost::bind(&tcp_connection::stop, conn_temp) ); } scheduler.stop(); execution_thread->join(); return true; } bool tcp_connection::stop() { try { assigned_io_object_->stop(shared_from_this()); socket_.close(); std::cout << "tcp_connection stop called" << std::endl; assigned_io_object_->remove_request(); // remove the //connection from the repository of connection managed by the //related io service object assigned_io_object_ = NULL; is_connection_stop = true; } catch (std::exception&) { } return true; } The message "tcp_connection stop called" is not getting called for each of the io service. Any suggestion what might wrong in this case ? Or is this still considered as a clean shutdown (tcp_connection::stop still not getting execute for each of the connection). Regards, Gaurav Jain DISCLAIMER: This message contains privileged and confidential information and is intended only for an individual named. If you are not the intended recipient, you should not disseminate, distribute, store, print, copy or deliver this message. Please notify the sender immediately by e-mail if you have received this e-mail by mistake and delete this e-mail from your system. E-mail transmission cannot be guaranteed to be secure or error-free as information could be intercepted, corrupted, lost, destroyed, arrive late or incomplete or contain viruses. The sender, therefore, does not accept liability for any errors or omissions in the contents of this message which arise as a result of e-mail transmission. If verification is required, please request a hard-copy version.

2 1

[1.34.1][regex] A couple of trivial ICU Fixes
by John Maddock 22 May '07

22 May '07

Thomas, In case you don't have enough to look at :-) Here's another one to be considered for 1.34: http://svn.boost.org/trac/boost/ticket/976 John.

1 0

TRAC tickets for Boost.Thread
by Anthony Williams 22 May '07

22 May '07

Hi, Please could one of the admins change it so that new trac tickets for Boost.Thread are assigned to me (anthonyw) rather than Michael Glassford? Anthony -- Anthony Williams Just Software Solutions Ltd - http://www.justsoftwaresolutions.co.uk Registered in England, Company Number 5478976. Registered Office: 15 Carrallack Mews, St Just, Cornwall, TR19 7UL

2 1

Can't login to CVS
by John Ky 22 May '07

22 May '07

Hi, Anyone can help? Thanks -John bash-2.05b$ cvs -d:pserver:anonymous@boost.cvs.sourceforge.net:/cvsroot/boost l ogin Logging in to : pserver:anonymous@boost.cvs.sourceforge.net:2401/cvsroot/boost CVS password: cvs login: authorization failed: server boost.cvs.sourceforge.net rejected acces s to /cvsroot/boost for user anonymous

2 1

mis-filed emails!
by Gottlob Frege 22 May '07

22 May '07

I just (finally) realized that for the past month or so, gmail has been marking some boost mail as spam. In fact, all of Dave Abrahams emails have been going straight to the spam folder (sorry Dave!), as well as emails from a few others (not sure of the overall pattern). Anyhow, just in case anyone was expecting a reply from me and didn't get one, that would be why. I now have an extra 100 or so emails to catch up on, but I doubt I'll reply to any, so as to not re-open any old threads. Tony

1 0

[1.34.1][hash] Correction for ticket 952
by Daniel James 21 May '07

21 May '07

Hi Thomas, Thanks for checking in my previous patch. Unfortunately, there was a mistake in it, so I added a patch to fix it to the ticket: http://svn.boost.org/trac/boost/ticket/952 thanks, Daniel

1 0

[subversion] sandbox template
by Stjepan Rajko 21 May '07

21 May '07

Hi, There was a mention earlier of adding a template for boost projects in the sandbox - I have just started making such a template after getting somewhat acquainted with the boost build process. It basically consists of * a basic directory/file structure with a simple include-only library, test, example, doc built from doxygen and boostbook, as well as vc8 and xcode IDE projects which invoke bjam to build. * a (currently, windows .bat) script which (given a library id) copies the directory/file structure, renames where appropriate, and find/replaces the contents using sed. When I am (reasonably) done, should I add this to the sandbox (or, would someone like to review it before it is added?)? I'm sure that it will need a lot of improvement because my knowledge of the build system is pretty bleak (I basically got things to a point where it somehow works), but it might serve as an OK starting point for an expert to flesh things out. Stjepan

2 4

[Graph][reverse_graph] Problem using reverse_graph adapter with an adapted user defined graph
by Tye, Tony 21 May '07

21 May '07

I have had some difficulty using the current version of the reverse_graph adapter on the Boost Graph Library. It seems to require the class being reversed to have types that a user class that has been adapted using graph_traits et al may not have. I have attached an example that shows the problem which includes comments to describe what I think the problem is. I have also attached a modified version of reverse_graph.hpp that works with this example. I would appreciate any help. Thanks, -Tony Attached files: bug_report_example_skeleton.hpp An include file the contains a minimal user defined graph MyGraph together with the required interfaces to adapt it to be a Boost Graph. bug_report_example_reverse_graph.cpp An example showing the problems encountered with the current reverse_graph.hpp reverse_graph.hpp An altered version of reverse_graph.hpp that works with the example.

1 0

Boos Unit Test Framework - Bus Error on OS X
by Chad Maron 21 May '07

21 May '07

Hey everyone, I'm new to the Boost libraries but *love* everything I've seen so far. I am having some trouble running my code on OS X. Up until today I've been working in CentOS 4 on an older PIII server. I moved my code over to my Intel Mac workstation so I can use a fancier text editor (yea yea...). I made it through some linkage hurdles with Jam and everything compiled without issue. What happens now is I receive a Bus Error when running my unit tests. I've written a separate test app without using the Boost Unit Test Framework and I am error free. I would not be surprised if this was the result of my not quite understanding the caveats of the Boost testing framework. I am using boost version 1.33.1 from Darwin Ports. I understand it might be tricky to provide feedback given I am not including all the source. I am fairly certain the issue I am having is with the testing framework and not my code BUT I will send it along if you want to take a look. It also appears that the test app fails *after* running the test cases: ---------- # echo "SELECT attribute_id from attributes where interface_name = 'Login';" | ./sql_parse_test Running 2 test cases... -----1.38998 SELECT attribute_id from attributes where interface_name = 'Login'; SELECT : attributes Bus error ---------- Even when I pipe millions of SQL statements to the test it will not die until after it's finished. NOTE: The second test case is a function that spits out some timing information (all the timing code is crappy and temporary). Even without the timing output the error takes place after running the proper test cases. GDB provides this tidbit: ---------- Program received signal EXC_BAD_ACCESS, Could not access memory. Reason: KERN_PROTECTION_FAILURE at address: 0x00000000 0x00812b22 in boost::unit_test::framework::get () ---------- Here is my Jamfile (I'm also a Jam newbie): ---------- if $(OS) = MACOSX { C++ = "c++" ; C++FLAGS = "-g" ; LINK = "c++" ; HDRS = /opt/local/include/boost-1_33_1/ ; LINKLIBS = -lboost_unit_test_framework -lboost_thread ; LINKFLAGS += "-L/opt/local/lib" ; } else { HDRS = /usr/local/include/boost-1_33_1/ ; LINKLIBS = -lboost_unit_test_framework-gcc -lboost_thread-gcc-mt ; } Main sql_parse_test : SQLParser.cpp SQLDataCollector.cpp GenericSQLGrammar.cpp SQLParserTest.cpp ; ---------- Here is my (broken) test code: ---------- #include <sys/time.h> #include <unistd.h> #include <stdio.h> #include <iostream> #include <map> #include <string> // Boost.Test #include <boost/test/unit_test.hpp> #include <boost/test/parameterized_test.hpp> #include <boost/test/included/unit_test_framework.hpp> #include "SQLParser.h" using boost::unit_test::test_suite; int count = 0; SQLParser p; std::map<std::string,int> table_names; std::map<std::string,int> query_types; struct timeval tv; struct timezone tz; double total_time = 0.0; double start_time = 0.0; double end_time = 0.0; double execute_time = 0.0; double max_time = 0.0; double min_time = 1000000.0; void parse_test(const std::string& q) { gettimeofday(&tv, &tz); start_time = tv.tv_sec + (tv.tv_usec/1000000.0); BOOST_CHECK_MESSAGE(p.parse(q).full, "Statement: " << q); gettimeofday(&tv, &tz); end_time = tv.tv_sec + (tv.tv_usec/1000000.0); execute_time = end_time - start_time; if(execute_time > max_time) { max_time = execute_time; }; if(execute_time < min_time) { min_time = execute_time; }; total_time += execute_time; count++; // Output results of parse query_types = p.getQueryTypes(); table_names = p.getTableNames(); std::cout << "\n-----" << (execute_time*1000.0) << "\n" << q << "\n"; std::map<std::string,int>::iterator iter; for(iter = query_types.begin(); iter != query_types.end(); iter++ ) { std::cout << (*iter).first << " "; } std::cout << ": "; for(iter = table_names.begin(); iter != table_names.end(); iter++ ) { std::cout << (*iter).first << " "; } std::cout << std::endl; } void weee() { std::cout << "\n\ntotal: " << total_time << " count: " << count << " avg(ms): " << ((total_time / count)*1000) << " max(ms): " << (max_time*1000) << " min(ms): " << (min_time*1000) << std::endl; } struct sub_test_suite : public test_suite { sub_test_suite() { while(std::cin) { getline(std::cin, input_line); if(input_line.size() > 0) { queries.push_back(input_line); } } add( BOOST_PARAM_TEST_CASE( &parse_test, queries.begin(), queries.end() ), 0); } std::string input_line; std::vector<std::string> queries; }; test_suite* init_unit_test_suite( int, char* [] ) { test_suite* test= BOOST_TEST_SUITE( "Spirit SQL parser" ); test->add(new sub_test_suite); test->add(BOOST_TEST_CASE(&weee)); return test; } ---------- The working test code is quite similar: ---------- #include <sys/time.h> #include <unistd.h> #include <stdio.h> #include <iostream> #include <map> #include <string> #include "SQLParser.h" int count = 0; SQLParser p; struct timeval tv; struct timezone tz; double total_time = 0.0; double start_time = 0.0; double end_time = 0.0; double execute_time = 0.0; double max_time = 0.0; double min_time = 1000000.0; void parse_test(const std::string& q) { gettimeofday(&tv, &tz); start_time = tv.tv_sec + (tv.tv_usec/1000000.0); if(!p.parse(q).full) { std::cout << "Parse failed" << std::endl; } gettimeofday(&tv, &tz); end_time = tv.tv_sec + (tv.tv_usec/1000000.0); execute_time = end_time - start_time; if(execute_time > max_time) { max_time = execute_time; }; if(execute_time < min_time) { min_time = execute_time; }; total_time += execute_time; count++; // Output results of parse query_types = p.getQueryTypes(); table_names = p.getTableNames(); std::cout << "\n-----" << (execute_time*1000.0) << "\n" << q << "\n"; std::map<std::string,int>::iterator iter; for(iter = query_types.begin(); iter != query_types.end(); iter++ ) { std::cout << (*iter).first << " "; } std::cout << ": "; for(iter = table_names.begin(); iter != table_names.end(); iter++ ) { std::cout << (*iter).first << " "; } std::cout << std::endl; } int main() { std::string input_line; while(std::cin) { getline(std::cin, input_line); if(input_line.size() > 0) { parse_test(input_line); } } std::cout << "\n\ntotal: " << total_time << " count: " << count << " avg(ms): " << ((total_time / count)*1000) << " max(ms): " << (max_time*1000) << " min(ms): " << (min_time*1000) << std::endl; return 0; } ---------- Thanks in advance, any feedback would be greatly appreciated. Chad

2 1

[Log] Alpha 1 preliminary announement
by Andrey Semashev 21 May '07

21 May '07

Hello, I've uploaded to the Vault an alpha version of the Boost.Log library I'm working on. It is available here: http://tinyurl.com/3cdg88 During the development I tried to follow the results of previous discussions in this list and requirements collected on the Wiki page: http://tinyurl.com/2fndfg At the current stage the library has a quite formed core implementation and a framework for developing leaf components quite ready for further extension with a few components implemented to play around. There is no official documentation for now, but there is a well-commented example/tutorial in the package, which is suitable to catch the feeling of the lib and may be used to play around with the code. The library builds in a thread-safe dll only for now. The HEAD of the boost repository and "thread_rewrite" branch of Boost.Thread library are required to build the lib. Support for other configurations will be added later. The purpose of this announcement is to collect feedback on the early development stage. Please feel free to suggest any architectural improvements and point out any bugs. Another thing I'd like to settle is a set of features that should be available in the library out of the box. In particular, a set of available sink types (for now only text ostream sink is implemented), loggers and attributes. It is my belief that the library should be proposed for review in a sensible minimal set of features and be extended later, but finding this set is not an easy task. Looking forward for your comments. Some side announcements, proposals and comments: - The "thread_rewrite" branch of Boost.Thread does not yet support read_write_mutex, which is used by the Boost.Log. There is a reduced implementation of it for pthreads. I'll be happy if someone from the Boost.Thread development take it as a start to implement the final implementation of the R/W mutex for pthreads. - There is an empty_deleter class in the library package. It is intended to be used with shared_ptr in cases when the pointed object should not be deleted by the pointer (for example, when it resides on the stack). Obviously, there is no point to allocate reference counting object and perform thread-safe reference counting when this deleter is provided. I propose to optimize shared_ptr with respect to this deleter type and elide allocations and ref-counting when it is provided in constructor or reset. - Please see boost/log/detail/type_info_wrapper.hpp. There is a std::type_info wrapper class that allows to copy, compare and order type information objects via usual operators and constructors. This allows to store type_info in containers, for example. Is it worth extracting as a separate component to the boost directory. - In the same file there is a BOOST_NO_UNSPECIFIED_BOOL macro definition, which I believe should be in Boost.Config. Maybe it should be moved there? -- Best regards, Andrey mailto:andysem@mail.ru

3 4

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

21 May '07

Boost Inspection Report Run Date: 16:06:33 UTC, Monday 21 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) 1059 problems reported Problem counts: 661 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 (14) 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/doc/tutorial/doc/html/python/ embedding.html: *L* exception.html: *L* exposing.html: *L* functions.html: *L* hello.html: *L* iterators.html: *L* object.html: *L* techniques.html: *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