May 2007 - Boost - lists.boost.org

What happened to the typeid/type_info proposal?
by Johan Torp 26 May '07

26 May '07

I have seen several discussions regarding adding a small typeid/type_info library similar to the one introduced by Alexandrescu in Modern C++ Design. Has there been any progress on this issue? see: http://lists.boost.org/Archives/boost/2005/02/80969.php Best Regards, Johan Torp

2 2

[proto] macro for wrapping expressions
by Maurizio Vitale 26 May '07

26 May '07

What about introducing a macro: #define BOOST_PROTO_WRAP(DOMAIN,EXPRESSION) \ namespace boost { namespace proto { \ template<typename E> \ struct generate<DOMAIN, E> { \ typedef EXPRESSION<E> type; \ static type make (E const& expr) { \ return type (expr); \ } \ }; \ } } as far as I can tell one does never need something different from the above boilerplate code. (otherwise I'd like to see examples, for my own education) Not a big deal, I know, but looks nicer (and sound nicer in the docs as well, I think). Have fun in Colorado! Maurizio

2 3

[boost:proto] adding new tags
by Maurizio Vitale 25 May '07

25 May '07

Suppose I needed a new tag for representing some high-level concept that I do not want to express in terms of C++ operators [it could be a get_bit(N) operation that has very different implementation when for my numbers the unserlyining implementation is a builtin type or a GMP big int] Here's my code for adding a binary operator my_plus: struct my_plus {}; template<typename Left, typename Right> proto::expr<my_plus, proto::args2<proto::ref_<Left>, proto::ref_<Right> > > const make_my_plus_expr(Left& left, Right& right) { typedef proto::expr<my_plus, proto::args2<proto::ref_<Left>, proto::ref_<Right> > > expr_type; expr_type that={left,right}; return proto::generate<typename Left::domain, expr_type>::make (that); } Questions: - is the above the right way, or is there some friendlier interface? - if I wanted to support the case where left and/or right are not proto expressions, it would be enough to call generate<>::make on the non proto-ized one(s) to turn them into proto::terminal, right? Maybe proto could provide a mechanism for doing this, seems common enough [might be enough to raise as_expr_if2 from proto::detail]. But clearly then people like me will ask for N up to BOOST_PROTO_MAX_ARITY. Maybe a separate CPP constant could be used to keep the number of permutations low. Or deal separately with >2 args with an mpl (or fusion) sequence. Pretty please... [btw, if I understand the code in operators.hpp, proto doesn't explicitely check that the domains of the two operands are the same. This situation doesn't seem really supported, nor desirable, and maybe code doing it wouldn't compile anyhow. But in case it did compile and do wrong things you might consider slowing down compilation and adding a check] - is it correct that all I have to do then is to either: - make my_plus disappear before evaluation (via transforms), or - provide an evaluation context with the appropriate overload for operator()(my_plus, ...). For instance the following would give to my_plus the normal meaning of '+': template<typename Left, typename Right> double operator() (my_plus, const Left& left, const Right& right) const{ return proto::eval(left, *this) + proto::eval (right, *this); } - a simple example for this would be very nice for the documentation. Best regards, Maurizio

4 15

[sandbox] template processor for generating sandbox projects
by Stjepan Rajko 25 May '07

25 May '07

Hello, Under guidance from Rene Rivera, I've put together a template processor which can be used to create seed projects for the boost sandbox (with the appropriate directory structure and build files). The docs are at: http://dancinghacker.com/code/template/ The latest changes are in the sandbox. Please note that the actual template needs to be checked for Boost guidelines compliance. I think Rene was planning on doing that. I hope this is helpful! As always, any suggestions welcome. Stjepan

2 1

thread encapsulation with private attributes
by Nicolas Emiliani 25 May '07

25 May '07

Hi, I was thinking about using boost as much as I could on a proyect. The idea of using the pthread encapsulation ocurred to me. But I found that the interface was pretty poor. I guess it is like that cause of portability. So I thought, ok... I can inherit from it and encapsulate the pthread (thats my case) functioanlity I want. But to my surprise the pthread_t variable called m_thread was declared PRIVATE... why is that?!... I mean... why wouldn't u want somedy to inherit and extend the functionality to the user's will? thanks for clarifying my doubt. Nicolas-

2 1

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

25 May '07

Boost Inspection Report Run Date: 16:05:43 UTC, Friday 25 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-25/RC_1_34_0) *X*
by Rene Rivera 25 May '07

25 May '07

Boost Inspection Report Run Date: 16:05:36 UTC, Friday 25 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) 192 problems reported Problem counts: 0 files with invalid line endings 0 bookmarks with invalid characters 3 invalid urls 101 broken links 21 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 (2) 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/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

What's the boost::math::gamma_Q equivalent in 1.34
by John Ky 25 May '07

25 May '07

Hi, I'm trying to upgrade some software to use boost 1.34 from an earlier version, but I'm stuck on this particular function because I don't understand statistics. #include <boost/integer.hpp> #include <boost/random/gamma_distribution.hpp> inline double alpha_value(int df, double chisq) { if (chisq < 0.0 || df < 1) { return 0.0; } return boost::math::gamma_Q(((double)df) / 2.0, chisq / 2.0); } Does anyone know the equivalent way of doing this in 1.34? Thanks -John

2 1

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

25 May '07

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

1 0

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

25 May '07

> On Mon, 21 May 2007 16:37:28 +0530, Gaurav.Jain <at> iflexsolutions.com said: > > 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. > > It's worth noting that this is not the only way to do clean shutdown. > The new HTTP server examples ("server2" and "server3") also perform a > clean shutdown. However, rather than explicitly closing the connections, > they simply rely on the fact that the io_service destructor will destroy > all handler objects associated with unfinished operations. > > > 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 : > [...] > > scheduler.stop(); > > What is scheduler? Is it an io_service? If so, by explicitly stopping it > some of your completion handlers will never be called. If you want to > use this particular clean shutdown design, it is better to wait for the > io_service::run() call to finish automatically once all the outstanding > operations have finished Yes scheduler is an io_service. I am now not using scheduler.stop() in my code & doing what have you suggested in your reply. But still server is not getting cleanly shutdown as per my design. Here is what am I doing : void tcp_server::handle_stop() { acceptor_.close(); if(io_object_pool_) { delete io_object_pool_; io_object_pool_ = NULL; } } io_object_pool::~io_object_pool() { shutdown_pool(); } void 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(); } void 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(); } In above code I have also tried with io_service().wrap() instead of post(), but all in vein void tcp_connection::stop() { try { std::cout << "tcp_connection stop called" << std::endl; assigned_io_object_->stop(shared_from_this()); socket_.close(); assigned_io_object_->remove_request(); assigned_io_object_ = NULL; is_connection_stop = true; } catch (std::exception&) { } } The above cout statement is not getting printed, not even for single connection. Can you pls suggest what else is getting wrong here Regards, Gaurav 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

Re: [boost] [Boost-announce] Review Schedule - Spring 2007
by Talbot, George 25 May '07

25 May '07

I would like to help out. I haven't been a regular contributor to the mailing list--more of a silent lurker. -- George T. Talbot <gtalbot(a)locuspharma.com> > -----Original Message----- > From: boost-announce-bounces(a)lists.boost.org [mailto:boost-announce- > bounces(a)lists.boost.org] On Behalf Of Tom Brinkman > Sent: Friday, May 25, 2007 12:36 AM > To: boost(a)lists.boost.org; boost-announce(a)lists.boost.org; Ronald Garcia > Subject: [Boost-announce] Review Schedule - Spring 2007 > > We need review manager volunteers for most of the libraries > in the review queue. If your interested, let us know by > replying to this thread. Preferably, you would have a > background in the problem domain, a regular contributer to the > boost mailing list, but no association with the > library. Some of the libraries have been waiting > patiently for a volunteer for some time now. > > The review schedule is available here: > > http://www.boost.org/more/formal_review_schedule.html . > > You can read the "review manager" > requirements at the following link: > > http://www.boost.org/more/formal_review_process.htm > > Most of the libraries are located at the Boost Sandbox Vault, > located here: > > http://boost-consulting.com/vault/ > > Maintainers of the Review Queue: > > Ronald Garcia (garcia (at) cs.indiana.edu ) > Tom Brinkman (reportbase (at) gmail.com) > > If there is any errors or ommisions in this report, > please send them to Ron or Tom. > > > Here is a summary of the libraries that are in the queue. > > ------------------------------------- > Library: Exception > Author: Emil Dotchevski > Location: http://www.revergestudios.com/boost-exception/boost- > exception.zip > Review Manager: Needed > Date: Needed > Summary: > The purpose of Boost Exception is to free designers of > exception classes from having to consider what data needs to > be stored in exception objects in order for the catch site to > be able to make sense of what went wrong. When Boost Exception > is used, arbitrary values can be stored in any exception. This can be > done directly in the throw-expression, or at a later time as the > exception object propagates up the call stack. The ability to add > data to any exception object after it has been thrown is important, > because often some of the information needed to handle an > exception is unavailable at the time of the throw. > > > ----------------------------------------- > Library: Scope Exit > Author: Alexander Nasonov > Location: Boost Sandbox Vault > Review Manager: Needed > Date: Needed > Summary: > The scope-exit-arg-pp-seq is Boot.Preprocessor sequence > of identifiers that can be used inside scope-exit-body. > The direct-declarator is declarator-id followed by optional > argument of type boost::scope_exit_group (inside brackets or > after the equal sign). This construct executes scope-exit-body > at the close of the current scope. > > ----------------------------------------- > Library: Finite State Machines > Author: Andrey Semashev > Location: Boost Sandbox Vault > Review Manager: Martin Vuille > Date: Needed > Summary: > The Boost.FSM library is an implementation of FSM > (stands for Finite State Machine) programming concept. > There are many cases when a developer would like to distinguish the > behavior of a given object depending on some conditions or its > internal state. For example, when making software to control > an underground charging tourniquiet a programmer would like to > separate states in which the tourniquiet may persist: an idle state, > when the device awaits for another passenger that would like to > pass; a processing state, when the passenger have come > and put his ticket into the device; and the passing state, > when the tourniquiet lets the passenger pass through. In > fact, each state describes different reaction of the machine > at the same events (a passenger may only pass after paying > for ticket). Obviously, the tourniquiet have to be able to > change its internal state in order to function properly, > this is called state switching or transitions between > states (or just transitions for short). > > ----------------------------------- > Library: Floating Point Utilities > Author: Johan Råde > Location: Boost Sandbox Vault > http://boost-consulting.com/vault/index.php?directory=Math%20-%20Numerics > Review Manager: Needed > Date: Needed > Summary: > Proposed Additions to the Boost Math Library > > <boost/math/fpclassify.hpp> > Functions for floating point number classification: > fpclassify, isfinite, isinf, isnan, isnormal. Follows TR1. > > <boost/math/signbit.hpp> > Functions for floating point number sign bit access and modification: > signbit, copysign, changesign. Follows TR1. > > <boost/math/nonfinite_num_facets.hpp> > Facets that parse and format infinity and NaN according to the C99 > standard. > Used for portable handling of infinity and NaN in text streams. > > ----------------------------------- > Library: Switch > Author: Steven Watanabe > Location: Boost Sandbox Vault > http://tinyurl.com/yvssgx > Review Manager: Needed > Date: Needed > Introduction: The built in C/C++ switch statement is very efficient. > Unfortunately, unlike a chained if/else construct there is no easy way to > use it when the number of cases depends on a template parameter. > <TODO: more description needed> > _______________________________________________ > Unsubscribe & other changes: > http://lists.boost.org/mailman/listinfo.cgi/boost-announce

1 0

GSoC project "Visualization of STLContainers as SVG" - possible features?
by Paul A Bristow 25 May '07

25 May '07

I've been collecting a shopping list of possibly desirable features for Jake Voytko's GSoC STL containers as SVG plots. Project and class names? Boost.Plot? - as Boost.Graph is 'spoken for' - and does that mean that to avoid confusion we should always use the work plot rather than graph? Like svg_plot my_plot("my_plot1.svg"); rather than svg_graph my_graph("test.svg"); // Construct class Best to get the name right as early as possible? Features of plots I have thought that are (or might be) wanted are: General ======= * overall (called chart area in Excel - is this the right name?) background box colour, if any. * background border? colour, if any Axes ==== * axes area background and/or border? (called plot area in Excel) * title, font, size and colour * axis lines, thickness, colour? * axis labels (and perhaps separate units) default x axis (y axis, z axis)? * axis markers (or not), major (and minor?) width, length and colour. default of these, marks inside or outside * (separate for x, (y and z), logarithmic, and anti) axis?/axes * axis marker labels - as vector of pairs of values and short strings of values? max, min, Auto option, axis * must go through origin? * should axes be scaled, for example, if all values are in range 1e-6 to 9e-6, should be axes be 1. to 10. with a scale factor of 1e-6? Data ==== * data marker symbol like * x . | |_| etc, size, boldness and color (and outline?). Lines or Blocks can be used to show 1D as histograms if they can optionally be used to stack on top of each other. * data value labels? - showing the x (y & z) value of each data point: font, size, colour, position? format? * should data values be show with the same scale factor as axes, or include any exponent 1.23e6? * multiple data series, * series legend, position (top, bottom , left right exact) , font, colour, border? * gridlines?? Not a priority,but some people will probably want them, sometimes. * lines (colour, thinkness) and/or curves joining data points. * lines representing a fitted line or curve - lower prority as users can always do this themselves. * Will need greek for all sorts of text (labels, title legends), so use Unicode strings? Need sub and superscript too, and other symbols like sqrt? Maybe worry about this later? data sources ============ x data points in 'container' (C array, Boost array, std::vector, std::list, std::deque, circular_buffer) (I'm using container to include C arrays that are not strictly STL containers). * Default is to plot all in the container, but also: count of values, starting with 1st, index of 1st and last values. iterator to 1st and last. * Similarly for x & y data (perhaps even x & y & z data). * y values at equally spaced x with start and finish indexes and iterators, or count of values? Default for array, vector...? * array x values, array y values, container x & y pairs, (container x, y, z as tuples) * container of 'points' as a struct double, double? * Function like y = mx + c, y = sin(x) ... as source (but need to specify the limits of x (and/or y??)). (This will also be useful to show fitted lines or curves on top of the data points). * need to provide svg class member functions with defaults for all, as well as control of *all* details. * getter functions like my_graph.point_color() returning red? Views on priorities, and things I have missed? Paul --- Paul A Bristow Prizet Farmhouse, Kendal, Cumbria UK LA8 8AB +44 1539561830 & SMS, Mobile +44 7714 330204 & SMS pbristow(a)hetp.u-net.com

2 3

[filesystem] recursive_directory_iterator::pop() question
by Alexei Alexandrov 25 May '07

25 May '07

Hi, recursive iterator in the Boost Filesystem library has a function pop() which allows to break iteration over current level directory. But at the same time, recursive iterator doesn't seem to give any guarantees about the order of iteration regarding files and directories. But without such guarantees pop() seems to be pretty useless. What I'm missing? Is there any valid use case for recursive_directory_iterator::pop() at all?

1 0

[bimap][multi_index][range] sub_range vs std::pair<iter, iter>
by Matias Capeletto 25 May '07

25 May '07

Hi, Boost.MultiIndex and Boost.Bimap implements a function named range. It is designed to integrate well with the new Boost.Range framework. The actual signature is: template< class LowerBound, class UpperBound > std::pair<iterator,iterator> range(LowerBound lower, UpperBound upper); template< class LowerBound, class UpperBound > std::pair<const_iterator, const_iterator> range(LowerBound lower, UpperBound upper) const; In bimap docs it is stated that the way to use it is: typedef bimap<string,int> bm_type; bm_type bm; //... std::pair<bm_type::left_iterator, bm_type::left_iterator>r = bm.left.range(...,...); I want to know if this is the best approach. Boost.Range defines two range classes (iterator_range and sub_range) http://www.boost.org/libs/range/doc/utility_class.html It is said that they are better abstraction for ranges that std::pair<iter,iter> 1) Do you think that the range functions should return a sub_range<map_type> instead of a std::pair<iter,iter>? The signature will be: template< class LowerBound, class UpperBound > sub_range<map_type> range(LowerBound lower, UpperBound upper); template< class LowerBound, class UpperBound > const sub_range<map_type> range(LowerBound lower, UpperBound upper) const; 2) In any case do you think that including typedef for the returned range type will make code more readable? The idea is to define: typedef -range_type- sub_range; // the name can be different typedef -const_range_type- const_sub_range; So the user code will look like this: typedef bimap<string,int> bm_type; bm_type bm; //... bm_type::left_sub_range r = bm.left.range(...,...); Best regards Matias

4 15

Review Schedule - Spring 2007
by Tom Brinkman 25 May '07

25 May '07

We need review manager volunteers for most of the libraries in the review queue. If your interested, let us know by replying to this thread. Preferably, you would have a background in the problem domain, a regular contributer to the boost mailing list, but no association with the library. Some of the libraries have been waiting patiently for a volunteer for some time now. The review schedule is available here: http://www.boost.org/more/formal_review_schedule.html . You can read the "review manager" requirements at the following link: http://www.boost.org/more/formal_review_process.htm Most of the libraries are located at the Boost Sandbox Vault, located here: http://boost-consulting.com/vault/ Maintainers of the Review Queue: Ronald Garcia (garcia (at) cs.indiana.edu ) Tom Brinkman (reportbase (at) gmail.com) If there is any errors or ommisions in this report, please send them to Ron or Tom. Here is a summary of the libraries that are in the queue. ------------------------------------- Library: Exception Author: Emil Dotchevski Location: http://www.revergestudios.com/boost-exception/boost-exception.zip Review Manager: Needed Date: Needed Summary: The purpose of Boost Exception is to free designers of exception classes from having to consider what data needs to be stored in exception objects in order for the catch site to be able to make sense of what went wrong. When Boost Exception is used, arbitrary values can be stored in any exception. This can be done directly in the throw-expression, or at a later time as the exception object propagates up the call stack. The ability to add data to any exception object after it has been thrown is important, because often some of the information needed to handle an exception is unavailable at the time of the throw. ----------------------------------------- Library: Scope Exit Author: Alexander Nasonov Location: Boost Sandbox Vault Review Manager: Needed Date: Needed Summary: The scope-exit-arg-pp-seq is Boot.Preprocessor sequence of identifiers that can be used inside scope-exit-body. The direct-declarator is declarator-id followed by optional argument of type boost::scope_exit_group (inside brackets or after the equal sign). This construct executes scope-exit-body at the close of the current scope. ----------------------------------------- Library: Finite State Machines Author: Andrey Semashev Location: Boost Sandbox Vault Review Manager: Martin Vuille Date: Needed Summary: The Boost.FSM library is an implementation of FSM (stands for Finite State Machine) programming concept. There are many cases when a developer would like to distinguish the behavior of a given object depending on some conditions or its internal state. For example, when making software to control an underground charging tourniquiet a programmer would like to separate states in which the tourniquiet may persist: an idle state, when the device awaits for another passenger that would like to pass; a processing state, when the passenger have come and put his ticket into the device; and the passing state, when the tourniquiet lets the passenger pass through. In fact, each state describes different reaction of the machine at the same events (a passenger may only pass after paying for ticket). Obviously, the tourniquiet have to be able to change its internal state in order to function properly, this is called state switching or transitions between states (or just transitions for short). ----------------------------------- Library: Floating Point Utilities Author: Johan Råde Location: Boost Sandbox Vault http://boost-consulting.com/vault/index.php?directory=Math%20-%20Numerics Review Manager: Needed Date: Needed Summary: Proposed Additions to the Boost Math Library <boost/math/fpclassify.hpp> Functions for floating point number classification: fpclassify, isfinite, isinf, isnan, isnormal. Follows TR1. <boost/math/signbit.hpp> Functions for floating point number sign bit access and modification: signbit, copysign, changesign. Follows TR1. <boost/math/nonfinite_num_facets.hpp> Facets that parse and format infinity and NaN according to the C99 standard. Used for portable handling of infinity and NaN in text streams. ----------------------------------- Library: Switch Author: Steven Watanabe Location: Boost Sandbox Vault http://tinyurl.com/yvssgx Review Manager: Needed Date: Needed Introduction: The built in C/C++ switch statement is very efficient. Unfortunately, unlike a chained if/else construct there is no easy way to use it when the number of cases depends on a template parameter. <TODO: more description needed>

1 0

[bimap] Added to CVS (and question about images in CVS)
by Matias Capeletto 25 May '07

25 May '07

Hello, Boost.Bimap sources has been added to Boost CVS, and I include it in /status/Jamfile.v2. The html files of the docs are about 1.3MB. The images and diagrams sum up other 1.1MB. Can I add this files too in the CVS? Regards Matias Capeletto

2 2

[optional] Making optional more debugger friendly
by Jeffrey Faust 25 May '07

25 May '07

My only complaint about boost::optional is that it is very difficult to see values in the debugger. I brought this up in a discussion at BoostCon, and Jeff Garland suggested I submit a patch. Well, I have a patch. The change introduces a new private T* m_value and protected method update_debug() which sets this variable. The variable is only visible when building debug, and the method is empty in non-debug. From there, I simply call update_debug() in each public method that changes the storage. The final result is that debuggers can see the variable data by looking at opt.m_value. When not set, the value is null. Any thoughts? Jeff Faust

12 27

[iostreams] Iostreams status?
by Aaron W. LaFramboise 24 May '07

24 May '07

What is the status of Boost.Iostreams? I've noticed: 1) The original author does not seem to be available. 2) Significant portions of the documentation remain incomplete. 3) Asynchronous streams and other issues brought up during review appear to be incomplete. Is anyone still working on this library? Is it being proposed for standardization? Are there any other planned Boost libraries that do a similar thing to this one?

7 10

[extensions] some implementation questions
by Felipe Magno de Almeida 24 May '07

24 May '07

1. What is BOOST_EXTENSIONS_IMPL_NAMESPACE_BEGIN used for? It doesnt seem to add anything useful. Just complicates the implementation. 2. Why is functor defined? Why not use boost::bind and boost::function ? 3. Why does shared_library have two-phase construction? It seems to be common knowledge that two-phase construction is bad. IMO, a default-constructor and a constructor that throws would be better. And member functions for both options too. Now, IMO, factories are unnecessarily complicating the library. Couldn't a different approach be pursued? Like serialization does for type registration. Best regards, -- Felipe Magno de Almeida

1 0

[fusion] Problem in cvs head version of tuples?
by John Maddock 24 May '07

24 May '07

I'm getting errors from fusion in cvs HEAD that I don't see if I use the 1.34 release, only with gcc-3.4 though, not with msvc: In file included from c:/data/boost/develop/boost/boost/fusion/sequence/adapted/struct.hpp:11, from c:/data/boost/develop/boost/boost/fusion/sequence/adapted/std_pair.hpp:12, from c:/data/boost/develop/boost/boost/tr1/tuple.hpp:51, from ../../../boost/math/tools/roots.hpp:13, from ../../../boost/math/special_functions/detail/igamma_inverse.hpp:11, from ../../../boost/math/special_functions/gamma.hpp:1785, from ../../../boost/math/special_functions/erf.hpp:11, from ../../../boost/math/distributions/normal.hpp:16, from test_dist_overloads.cpp:24: c:/data/boost/develop/boost/boost/fusion/sequence/adapted/struct/extension.hpp: In static member function `static typename boost::add_const<typename boost::fusion::extension::struct_assoc_member<Struct, Key>::type>::type& boost::fusion::extension::struct_assoc_member<const Struct, Key>::call(const Struct&)': c:/data/boost/develop/boost/boost/fusion/sequence/adapted/struct/extension.hpp:59: error: type/value mismatch at argument 2 in template parameter list for `template<class Struct, int N> struct boost::fusion::extension::struct_member' c:/data/boost/develop/boost/boost/fusion/sequence/adapted/struct/extension.hpp:59: error: expected a constant of type `int', got `Key' c:/data/boost/develop/boost/boost/fusion/sequence/adapted/struct/extension.hpp:59: error: `call' is not a member of `<declaration error>' Anyone any ideas? Thanks, John.

2 1

[variant]bug: max used instead of lcm
by Larry Evans 24 May '07

24 May '07

The make_storage template at line 215 of: http://boost.cvs.sourceforge.net/boost/boost/boost/variant/variant.hpp?revi… uses max over the alignment_of's for the types in the variant (See line2 233-235) to calculate the variant's alignment. However, to handle the extended alignments described on page 3 of: http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2165.pdf the boost::math::static_lcm template should be used instead of max.

2 2

[typeof]Typeof with MinGW
by Minmin Gong 24 May '07

24 May '07

Hi all. Does Boost.Typeof work with MinGW in a little complex situation? I test it with this: #include <boost/typeof/typeof.hpp> #include <vector> using namespace std; int main() { std::vector<int> v; BOOST_TYPEOF(v)::value_type i; } It failed. But if the line 9 is changed from BOOST_TYPEOF(v)::value_type i; to typedef BOOST_TYPEOF(v) v_type; v_type::value_type i; It works. My question is why BOOST_TYPEOF(v)::value_type is not supported? I'm using MinGW with gcc 4.1.2. (3.4.2 fails too. But vc8 is OK.) Thanks.

4 5

Re: [boost] [Boost-users] [Serialization] Thread-unsafe singleton
by Sohail Somani 24 May '07

24 May '07

To those of us just joining the thread (boost developers list), we are discussing the use of Myers Singleton in the Boost.Serialization code and it's ramifications for thread-safety. You can see the thread here: http://thread.gmane.org/gmane.comp.lib.boost.user/27457 On Wed, 2007-05-23 at 22:38 -0700, Robert Ramey wrote: > Sohail Somani wrote: > > > I can develop a patch using boost once that I think would work. > > Locally, > > I'm going to have to do this anyway. Fortunately, my test has ceased > > to > > fail so I can't test it. To make it as "pay for what you use", one can > > #ifdef it out if they have special knowledge of the platform/compiler. > > > > OK - you've convinced me there could be a problem. > > I don't see a magic bullet solution. I think users need a couple of > options and a good explanation in the manual. > > Options > > a) don't use export - use explicit archive level registration instead. > b) some sort of explicit type registration. Users could just put > at after the main entry point and/or in the DLL loading phase How is (b) different from (a)? Is this related to your "load/save by name?" > c) an automatic method using thread safety primitives - maybe > there are some small ones. Then you have the *#ifdef ... There is a very small one ;-) The idea is here (copied and tweaked to protect the innocent - may not compile): // thread-safe lazily initialized singleton template<typename T> struct singleton { public: static T & instance() { boost::call_once(call_once,once_); // the magic happens here return get_instance(); } private: <*structors>; // call_once *MUST* be called before calling this function static T & get_instance() { static T object; return object; } static void call_once() { get_instance(); } static boost::once_flag once_; }; // guaranteed to be called before main since it uses initialization // with a constant expression (3.6.2.1) - language lawyers help please. // Also, what happens with dlopen'ish stuff???? This is heavily platform // specific. Someone save us from this mess. template<typename T> boost::once_flag singleton<T>::once_ = BOOST_ONCE_INIT; Then usage would be something like: static extended_type_info * get_instance() { return &(singleton<extended_type_info_typeid_1<T> >::instance()); } > The main obstacle is that requires a detailed understandable > explanation along with examples - a fair amount of work. Note > that this really applies to all extended type info systems so > the explanation is even more complex. Well I would have to rely on you to tell me where we need to apply the fixes. I would be happy to add some documentation to a patch against 1.34. > And once embarks upon this kind of effort, its interesting > to consider "finishing" extended type info with some missing > functionality like "construct from export name". I have no idea why the two affect each other! > It would also be interesting to investigate if there is some > sort of lock free solution - At least on some compilers/ > processors. I'm not going to touch lock-free lazily initialized singletons! I'd rather have my code work ;-) > Just goes to show that no good idea goes unpunished. :-) > SOOO I'm am positive about the idea. However, like most > good ideas, its a lot bigger than it first appears. Don't see why myself. In multi-threaded builds of serialization, we link with Boost.Thread and use boost::once. > Having written this, it would seem that this is territory > well traveled by those working on a good Singleton > suitable for such a purpose. I've worked on the above singleton, tested it on a few x86 OSes and it seems to work. But I would be very happy if someone has a better solution that is tested. > (Amazingly, I don't even know if boost has such a thiing) > Ideally, I would just like to use that (assuming it doesn't > import everything on planet earth). I believe that Boost has everything you need for a *correct* solution. Sohail

1 0

syntax highlighting for C++, Build v2 and QuickBook
by Matias Capeletto 24 May '07

24 May '07

Hello, boost::hs is a syntax highlighting for C++, doxygen, Boost.Build jamfiles and QuickBook. It is designed to work with Katepart, so it can be used in KWrite, Kate, Konqueror and KDevelop. Online docs and download link at: http://tinyurl.com/2l7u33 I have been using it in the development of Boost.Bimap and it makes my life a lot easier, specially when working with quickbook files. Some of the features * Support for C++ source code, including the standard library, some boost libraries, doxygen support, quickbook code import construct. * Support for Boost.Build v2 jamfiles * Support for Quickbook 1.4 * In general support for autocomment and region folding Comments are welcome. Do you think it belong somewhere in boost? Best regards Matias

5 6

[interprocess] Condition variables and a recursive mutex
by dherring＠ll.mit.edu 24 May '07

24 May '07

Hi, I think there's a minor mistake in the template code for interprocess_condition::wait. ***** Begin example ***** using namespace boost::interprocess; #ifdef USE_RECURSIVE typedef interprocess_recursive_mutex MutexT; #else typedef interprocess_mutex MutexT; #endif MutexT mutex; scoped_lock<MutexT> lock(mutex); interprocess_condition condition; condition.wait(lock); // compilation error when USE_RECURSIVE is defined ***** End example ***** Here, wait() is templated on the lock type; but this calls do_wait(), which requires interprocess_mutex. Is there a reason why do_wait() cannot accept a recursive mutex? The attached diff contains one possible solution: - Template do_wait() on the mutex type. - Add "friend class interprocess_condition" to the recursive mutex (as it is in the nonrecursive mutex). This seems to work on my computer (with POSIX_SHARED_MEMORY_OBJECTS); it has't been tested with the POSIX emulation. Thanks, Daniel

2 1