- Boost - lists.boost.org

Parsing boost 1.43 with gcc-xml (bug #4324 - fixed in trunk)
by Benoît Leveau 07 Jul '10

07 Jul '10

Hello, I have problems parsing boost 1.43 with gcc-xml, due to the lack of several preprocessor flags in /boost/config/compiler/gcc_xml.hpp. I saw this problem has been fixed in the trunk 4 weeks ago: /trunk/boost/config/compiler/gcc_xml.hpp Revision 62666: Disable all C++0x features in GCC-XML for now. Fixes #4324. I am not familiar with the details of the release process, so I'm wondering if a patched 1.43 version will be released? This bug is quite serious as it prevents boost from being parsed by gccxml (which, I guess, is listed as a supported compiler), and 1.44 hasn't been released yet, which leaves no option other than patching my local copy with the fix from the trunk. I would prefer to use an official release as it's not for a personal project, but will do the patch if I have to. Thanks for your help! Benoit

2 1

[thread] more generic future?
by Oliver Kowalke 07 Jul '10

07 Jul '10

The future implementation of boost.thread uses boost.mutex, condition and condition_any. What about renaming future to future_base or put it into namespace boost::detail and pass the sync. primitves (mutex, condition) as template args? This would provide the way that other libs could use the future impl with their own sync. primitives. namespace boost { namespace detail { template< typename MutexT, typename ConditionT > future {...}; }} namespace boost { typedef detail::future< mutex, condition > future; namespace fibers { class mutex {}; class condition {}; typedef detail::future< mutex, condition > future; }} boost::future -> uses pthreads/Win32 threads boost::fibers::future -> used for fibers Oliver

1 0

Boost Graph Library: Dijkstra Shortest Path ignores color_map in named parameters?
by Alex Hagen-Zanker 07 Jul '10

07 Jul '10

I am trying to use the dijkstra_shortest_path algorithm with named parameters. It worked well, until I wanted to pass the color map as an argument. Despite providing my own color_map, the algorithm ends up creating its own two_bit_color_map. I am using the following code: template<class TGraph, class TVisitor> int myDijkstra(TGraph& graph, TVisitor& visitor, int source) { bool earlyExit = false; const int nVertices =boost::num_vertices(graph); std::vector<double> distances(nVertices); std::vector<typename TGraph::vertex_descriptor> predecessors(nVertices); std::vector<boost::default_color_type> colors(nVertices); try { boost::dijkstra_shortest_paths<TSubGraph, TVisitor >( graph, source, boost::predecessor_map( &predecessors[0] ) .distance_map( &distances[0] ) .visitor( visitor ) .color_map( &colors[0] ) ); } catch( EarlyExitByVisitor ) { earlyExit = true; } return earlyExit ? CountBlackVertices(colors) : nVertices; } The code compiles and runs, but the vector of colors is never modified (I can initialize it with different colors, makes no difference). The predecessor and distance maps are fine. Tracing what happens in the source code (boost version 1.43). I notice that the Named Parameter Variant (line 466) gets the distance, weight and index from the named parameter object. It then passes on to the dijkstra_dispatch1 (line 443) that adds the default for the distance map. It passes on to dijkstra_dispatch2 (line 413) that sets even more parameters, but not the color map. Finally it calls dijkstra_shortest_paths variant with default color_map (line 342), which ignores the named parameter object and provides its own color map. (all of the line numbers are in file dijkstra_shortest_paths.hpp). My question is: is this a bug? Can I use named parameters if I want to provide my own color_map? How? Any help is appreciated. -- Alex Hagen-Zanker

2 7

Unicode and codecvt facets
by Mathias Gaunard 06 Jul '10

06 Jul '10

As some may know, I am working on a Unicode library that I plan to submit to Boost fairly soon. The codecs in that library are based around iterators and ranges, but since there was some demand for support for codecvt facets I am working on adapting those into that form as well. Unfortunately, it seems it is only possible to subclass std::codecvt<char, char, mbstate_t> and std::codecvt<wchar_t, char, mbstate_t>. I personally don't know and understand that much about iostreams/locales, but I have looked quickly at libstdc++'s implementation and it doesn't seem like it is possible for std::locale to contain any other instance of codecvt. What I wonder is if there is really a point to facets, then. std::codecvt<wchar_t, char, mbstate_t> means that the in-memory charset would be UTF-16 or UTF-32 (depending on the size of wchar_t) while the file would be UTF-8. The problem is that wchar_t is platform-dependent and not really reliable, so it's not really something I'd recommend to use as the in-memory representation to deal with Unicode. Why do people even use utf8_codecvt_facet anyway? What's wrong with dealing with UTF-8 rather than maybe UTF-16 or UTF-32?

4 10

auto-link with gcc/windows
by Robert Ramey 06 Jul '10

06 Jul '10

I've been seeing a problem in building MinGW version of he serializationalization library. This is related to auto-link. Now I notice that in config/compiler/gcc.hpp we've got: #if (__GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 2)) && defined(__GXX_EXPERIMENTAL_CXX0X__) # define BOOST_HAS_DECLTYPE ... # define BOOST_NO_DECLTYPE Also in another part of the same file I find: #if __GNUC__ >= 4 # if defined(_WIN32) || defined(__WIN32__) || defined(WIN32) // All Win32 development environments, including 64-bit Windows and MinGW, define // _WIN32 or one of its variant spellings. Note that Cygwin is a POSIX environment, // so does not define _WIN32 or its variants. # define BOOST_HAS_DECLSPEC In my code I use BOOST_HAS_DECLSPEC but I'm having problems with mingw. I'm not sure it has anything to do with this, but it's not at clear to me what the differing meanings are of BOOST_HAS_DECLTYPE and BOOST_HAS_DECLSPEC. Robert Ramey

3 2

Complexity of Goldberg's push_relabel max flow algorithm used in BOOST
by Dan Jiang 06 Jul '10

06 Jul '10

Anyone knows the time complexity of the Goldberg's push_relabel max flow algorithm used in BOOST? The BOOST documentation says O(n^3). But since the code seems to use highest label, global and gap relabeling and hence the complexity should be O(n^2 * m^1/2). According to literature, the complexity would be O(n^3) if FIFO is used in implementation. Please correct if I am wrong. Dan _________________________________________________________________ Look 'em in the eye: FREE Messenger video chat http://go.microsoft.com/?linkid=9734386

1 0

[function_types] is there an equivalent for functors?
by Edd Dawson 06 Jul '10

06 Jul '10

Hi all, I'm looking for code that does what boost::function_types::parameter_types does but for functors. Support for things such as boost::bind/lambda/function/signals(1&2)/etc and the standard binders and adaptors would be nice. I specifically want to be able to do something like: template<typename Functor> void f(const Functor &f) { typedef typename functor_params<Functor>::type params; // an mpl sequence const std::size_t arity = functor_arity<Functor>::value; // ... } I started writing code for this but I've come to the point where I can't see a way to support libraries such as boost::bind without relying on their implementation details. But perhaps something like this already exists? Thanks, Edd

6 19

[BGL] trunk@63671: `detail/adjacency_list.hpp` needs to include <algorithm>
by Daniel Trebbien 05 Jul '10

05 Jul '10

I get a compilation error in `boost/graph/detail/adjacency_list.hpp` that is fixed by adding `#include <algorithm>` to the top: /usr/local/include/boost/graph/detail/adjacency_list.hpp:1653: error: `equal_range` is not a member of `boost::graph_detail` A patch is attached.

2 3

Coming up on 1.44 code freeze
by Marshall Clow 05 Jul '10

05 Jul '10

I've been looking at the trunk and release branch, I've noticed that there are a lot of files that exist only in one or the other. My suspicion is that this is a result of work not getting merged to the release branch. The last day for "major code changes" for the 1.44 release is Monday, July 5th, Here's a list of what I found: Only in 'release/' boost/fusion/adapted/class/class_iterator.hpp boost/fusion/adapted/class/detail/at_impl.hpp boost/fusion/adapted/class/detail/at_key_impl.hpp boost/fusion/adapted/class/detail/begin_impl.hpp boost/fusion/adapted/class/detail/category_of_impl.hpp boost/fusion/adapted/class/detail/end_impl.hpp boost/fusion/adapted/class/detail/has_key_impl.hpp boost/fusion/adapted/class/detail/is_sequence_impl.hpp boost/fusion/adapted/class/detail/is_view_impl.hpp boost/fusion/adapted/class/detail/size_impl.hpp boost/fusion/adapted/class/detail/value_at_impl.hpp boost/fusion/adapted/class/detail/value_at_key_impl.hpp boost/fusion/adapted/class/extension.hpp boost/lambda/detail/control_structures_impl.hpp boost/numeric/ublas/tempfile.2.tmp boost/numeric/ublas/tempfile.3.tmp boost/numeric/ublas/tempfile.4.tmp boost/numeric/ublas/tempfile.tmp boost/smart_ptr/enable_shared_from_this2.hpp doc/test/accumulators.tag doc/test/dvips.version doc/test/gs.version doc/test/html/images/accumulators doc/test/latex.version libs/filesystem/doc libs/filesystem/example libs/filesystem/src libs/filesystem/test/convenience_test.cpp libs/filesystem/test/deprecated_test.cpp libs/filesystem/test/equivalent.cpp libs/filesystem/test/fstream_test.cpp libs/filesystem/test/large_file_support_test.cpp libs/filesystem/test/lpath.hpp libs/filesystem/test/msvc libs/filesystem/test/operations_test.cpp libs/filesystem/test/path_test.cpp libs/filesystem/test/wide_test.cpp libs/fusion/test/functional/make_unfused_generic.cpp libs/fusion/test/functional/make_unfused_lvalue_args.cpp libs/fusion/test/functional/make_unfused_rvalue_args.cpp libs/fusion/test/functional/unfused_generic.cpp libs/fusion/test/functional/unfused_lvalue_args.cpp libs/fusion/test/functional/unfused_rvalue_args.cpp libs/graph/example/kolmogorov-eg.cpp libs/graph/test/kolmogorov_max_flow_test.cpp libs/math/doc/html/standalone_HTML.manifest libs/range/doc/html/range/reference/adaptors/adaptors_reference.html libs/range/doc/reference/adaptors/adjacent_filtered.html libs/range/doc/reference/adaptors/copied.html libs/range/doc/reference/adaptors/filtered.html libs/range/doc/reference/adaptors/indexed.html libs/range/doc/reference/adaptors/indirected.html libs/range/doc/reference/adaptors/map_keys.html libs/range/doc/reference/adaptors/map_values.html libs/range/doc/reference/adaptors/replaced.html libs/range/doc/reference/adaptors/replaced_if.html libs/range/doc/reference/adaptors/reversed.html libs/range/doc/reference/adaptors/sliced.html libs/range/doc/reference/adaptors/strided.html libs/range/doc/reference/adaptors/tokenized.html libs/range/doc/reference/adaptors/transformed.html libs/range/doc/reference/adaptors/uniqued.html libs/test/example/cla/Jamfile libs/test/example/est_example1.cpp libs/test/example/est_example2.cpp libs/test/example/unit_test_example_011.cpp libs/test/example/unit_test_example_012.cpp libs/test/test/CMakeLists.txt Only in 'trunk/' boost/detail/extended_integer.hpp boost/filesystem/detail boost/filesystem/v2 boost/filesystem/v3 boost/fusion/algorithm/iteration/iter_fold.hpp boost/fusion/algorithm/iteration/reverse_fold.hpp boost/fusion/algorithm/iteration/reverse_iter_fold.hpp boost/fusion/include/iter_fold.hpp boost/fusion/include/reverse_fold.hpp boost/fusion/include/reverse_iter_fold.hpp boost/graph/boykov_kolmogorov_max_flow.hpp boost/graph/loop_erased_random_walk.hpp boost/graph/random_spanning_tree.hpp boost/io/detail boost/iterator/function_input_iterator.hpp boost/numeric/ublas/assignment.hpp boost/numeric/ublas/functional.hpp-0 boost/random/detail/operators.hpp boost/random/discrete_distribution.hpp boost/random/extreme_value_distribution.hpp boost/random/seed_seq.hpp boost/random/shuffle_order.hpp boost/random/weibull_distribution.hpp boost/serialization/item_version_type.hpp boost/signals2/detail/foreign_ptr.hpp boost/smart_ptr/enable_shared_from_raw.hpp boost/spirit/home/karma/detail/attributes.hpp boost/spirit/home/karma/detail/get_stricttag.hpp boost/spirit/home/karma/directive/strict_relaxed.hpp boost/spirit/home/karma/nonterminal/debug_handler.hpp boost/spirit/home/karma/nonterminal/debug_handler_state.hpp boost/spirit/home/karma/nonterminal/simple_trace.hpp boost/spirit/home/qi/detail/attributes.hpp boost/spirit/home/qi/nonterminal/debug_handler_state.hpp boost/spirit/include/karma_strict_relaxed.hpp boost/system/api_config.hpp boost/test/included/execution_monitor.hpp boost/test/prod_tools.hpp boost/test/utils/setcolor.hpp boost/type_traits/is_lvalue_reference.hpp boost/type_traits/is_rvalue_reference.hpp boost/typeof/unsupported.hpp libs/algorithm/string/test/find_format_test.cpp libs/exception/doc/source libs/filesystem/test/resize_file_test.txt libs/filesystem/test/xx libs/filesystem/v2 libs/filesystem/v3 libs/format/test/format_test_enum.cpp libs/fusion/test/algorithm/fold.hpp libs/fusion/test/algorithm/fold2.cpp libs/fusion/test/algorithm/iter_fold.cpp libs/fusion/test/algorithm/reverse_fold.cpp libs/fusion/test/algorithm/reverse_iter_fold.cpp libs/graph/doc/boykov_kolmogorov_max_flow.html libs/graph/doc/figs/bk_max_flow.gif libs/graph/doc/figs/warning.png libs/graph/example/boykov_kolmogorov-eg.cpp libs/graph/quickbook libs/graph/test/boykov_kolmogorov_max_flow_test.cpp libs/graph/test/random_spanning_tree_test.cpp libs/interprocess/proj/vc7ide/intermodule_singleton_test.vcproj libs/interprocess/test/intermodule_singleton_test.cpp libs/io/doc/quoted_manip.html libs/io/test/quoted_manip_test.cpp libs/iostreams/test/deprecated_file_descriptor_test.cpp libs/iostreams/test/detail/file_handle.hpp libs/iterator/doc/function_input_iterator.html libs/iterator/doc/function_input_iterator.rst libs/iterator/test/function_input_iterator_test.cpp libs/lambda/test/result_of_tests.cpp libs/multi_array/example/resize_from_other.cpp libs/multi_array/test/reverse_view.cpp libs/numeric/ublas/bench5 libs/numeric/ublas/doc/samples/assignment_examples.cpp libs/numeric/ublas/test/sparse_view_test.cpp libs/numeric/ublas/test/test_assignment.cpp libs/parameter/doc/README.txt libs/parameter/test/literate libs/ptr_container/test/const_element_containers.cpp libs/python/example/quickstart/bin libs/random/example/password.cpp libs/random/test/chi_squared_test.hpp libs/random/test/test_binomial.cpp libs/random/test/test_binomial_distribution.cpp libs/random/test/test_discrete.cpp libs/random/test/test_discrete_distribution.cpp libs/random/test/test_extreme_value.cpp libs/random/test/test_extreme_value_distribution.cpp libs/random/test/test_gamma.cpp libs/random/test/test_gamma_distribution.cpp libs/random/test/test_poisson.cpp libs/random/test/test_poisson_distribution.cpp libs/random/test/test_seed_seq.cpp libs/random/test/test_weibull.cpp libs/random/test/test_weibull_distribution.cpp libs/range/doc/html/range/reference/algorithms/range_algorithm_introduction.html libs/range/doc/html/range/reference/overview.html libs/range/test/algorithm_test/copy_n.cpp libs/range/test/algorithm_test/remove_copy.cpp libs/range/test/algorithm_test/remove_copy_if.cpp libs/range/test/algorithm_test/replace_copy.cpp libs/range/test/algorithm_test/replace_copy_if.cpp libs/range/test/algorithm_test/reverse_copy.cpp libs/range/test/algorithm_test/rotate_copy.cpp libs/range/test/algorithm_test/search_n.cpp libs/range/test/algorithm_test/swap_ranges.cpp libs/range/test/algorithm_test/unique_copy.cpp libs/range/test/replace_copy.cpp libs/serialization/test/test_diamond_complex.cpp libs/serialization/vc7ide/test_diamond_complex.vcproj libs/smart_ptr/test/enable_shared_from_raw_test.cpp libs/smart_ptr/test/make_shared_fp_test.cpp libs/spirit/doc/Missing.txt libs/spirit/doc/html/spirit/lex/reference/concepts libs/spirit/doc/html/spirit/what_s_new/spirit_2_4.html libs/spirit/example/scheme libs/spirit/test/karma/debug.cpp libs/spirit/test/karma/karma_optional_double.cpp libs/spirit/test/karma/semantic_action_attribute.cpp libs/spirit/test/lex/regression006.cpp libs/spirit/test/qi/attr_with_action.cpp libs/system/src/local_free_on_destruction.hpp libs/system/test/dynamic_link_test.cpp libs/system/test/throw_test.cpp libs/test/doc/Jamfile.v2 libs/test/doc/html/utf/user-guide/test-output/FPT.html libs/test/doc/src/Jamfile.v2 libs/test/doc/src/btl-toc.xml libs/test/doc/src/btl.xml libs/test/doc/src/execution-monitor.xml libs/test/doc/src/faq.xml libs/test/doc/src/minimal-testing.xml libs/test/doc/src/program-execution-monitor.xml libs/test/doc/src/snippet libs/test/doc/src/tutorial.hello-the-testing-world.xml libs/test/doc/src/tutorial.intro-in-testing.xml libs/test/doc/src/tutorial.new-year-resolution.xml libs/test/doc/src/utf.testing-tools.xml libs/test/doc/src/utf.tutorials.xml libs/test/doc/src/utf.usage-recommendations.xml libs/test/doc/src/utf.user-guide.runtime-config.xml libs/test/doc/src/utf.users-guide.fixture.xml libs/test/doc/src/utf.users-guide.test-organization.xml libs/test/doc/src/utf.users-guide.test-output.xml libs/test/doc/src/utf.users-guide.xml libs/test/doc/src/utf.xml libs/test/doc/src/xsl libs/test/doc/utf-boostbook.jam libs/test/example/test_example1.cpp libs/test/example/test_example2.cpp libs/test/example/unit_test_example_13.cpp libs/type_traits/doc/html/boost_typetraits/reference/is_lvalue_reference.html libs/type_traits/doc/html/boost_typetraits/reference/is_rvalue_reference.html libs/type_traits/doc/is_lvalue_reference.qbk libs/type_traits/doc/is_rvalue_reference.qbk libs/type_traits/test/is_lvalue_reference_test.cpp libs/type_traits/test/is_rvalue_reference_test.cpp libs/type_traits/test/tricky_rvalue_test.cpp libs/units/example/autoprefixes.cpp libs/utility/initialized_test.cpp libs/utility/initialized_test_fail1.cpp libs/utility/initialized_test_fail2.cpp libs/utility/value_init_workaround_test.cpp tools/boostbook/xsl/html-base.xsl tools/build/v2/test/exit_status.py tools/build/v2/tools/doxygen tools/build/v2/tools/xsltproc tools/release/merge2release.bat -- Marshall

5 5

[BGL] all_clustering_coefficients
by Barend Gehrels 05 Jul '10

05 Jul '10

Hi, Is the function all_clustering_coefficients documented in 1.44, or can it be documented in a new version? It has this functionality (?): <http://hosho.ees.hokudai.ac.jp/~kubo/Rdoc/library/RBGL/html/clusteringCoef.…> (taken from RBGL, "An interface to the BOOST graph library" for R) I tried it and it is a fast and probably useful algorithm, assigning a value between 0 and 1 (both included) to each vertex. Actually I'm looking for a way to find remote corners in a graph, and the vertices with 0 calculated by this algorithm are remote (but these can probably also be found other wise) Thanks, Barend

1 0