May 2006 - Boost - lists.boost.org

interest in patience sorting/longest increasing subsequence lib?
by Vassilii Khachaturov 12 May '06

12 May '06

Dear boost developers, would there be interest in a library implementing the patience sorting/ longest increasing subsequence(s) recovery/length measurement? I do have some preliminary code (which is presently GPL but of course can be released under the boost license as well), which deals with what I myself need to compute in the <subj>, available off http://www.tarunz.org/~vassilii/pub/c++/ (Maybe it's not worth a separate library, but should go into a larger library for whatever sorting-related algorithms, along with the bucket sorter?) I'd be happy to make the code more generic, add the docs, more tests (I actually have more regression tests available), add the concept checking/archetypes, and implement more things beyond what I have already done, but obviously if you folks don't feel that longest increasing subsequences/patience sorting is too narrow a domain to be worth depositing it into boost. Regards, Vassilii

1 0

[wave] ifndef/ifdef callbacks
by Felipe Magno de Almeida 12 May '06

12 May '06

Hi, I see that there are some hooks for appending callbacks for certain situations in the preprocessing. I think this is great. But, I would like to know if it is possible for the user to know when the preprocessor is evaluating an preprocessor conditional, and to know what the condition is. And to fork the preprocessing to when the condition is met and when not. Thanks, -- Felipe Magno de Almeida

3 11

Mailing lists to go down Saturday
by David Abrahams 12 May '06

12 May '06

-- Dave Abrahams Boost Consulting www.boost-consulting.com

1 0

[Boost-bugs] [ boost-Bugs-1487256 ] boost 1.33.1 build error
by SourceForge.net 12 May '06

12 May '06

Bugs item #1487256, was opened at 2006-05-12 11:54 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1487256&group_… Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: None Group: None Status: Open Resolution: None Priority: 5 Submitted By: Paul E.C. Melis (paulmelis) Assigned to: Nobody/Anonymous (nobody) Summary: boost 1.33.1 build error Initial Comment: When trying to build 1.33.1 with bjam 3.1.12 under linux (debian, dual AMD opteron, 2.6.11 kernel) I get the following error output (see attachment for full output): Building Boost.Regex with the optional Unicode/ICU support disabled. Please refer to the Boost.Regex documentation for more information (and if you don't know what ICU is then you probably don't need it). Jamfile:278: in load-jamfiles *** argument error * rule stage ( name : sources + : requirements * : local-build * ) * called with: ( : /home1/rugrchpc/melis/boost_1_33_1/boost/compatibili [...] ucket_sorter.hpp /home1/rugrchpc/melis/boost_1_33_1/boost/pending/fibonacci_heap.hpp /home1/rugrchpc/melis/boost_1_33_1/boost/pending/iterator_tests.hpp /home 1/rugrchpc/melis/boost_1_33_1/boost/pending/detail/int_iterator.hpp /home1/rugrchpc/melis/boost_1_33_1/boost/pending/detail/property.hpp /home1/rugrchpc/melis /boost_1_33_1/boost/pending/detail/disjoint_sets.hpp : <locate>stage <tree-subdirs>/home1/rugrchpc/melis/boost_1_33_1 <target>all : <suppress>true ) * missing argument name /home1/rugrchpc/melis/boost_1_33_1/tools/build/v1/boost-base.jam:2330:see definition of rule 'stage' being called /home1/rugrchpc/melis/boost_1_33_1/tools/build/v1/bootstrap.jam:21: in boost-build /home1/rugrchpc/melis/boost_1_33_1/boost-build.jam:16: in module scope I've tried the following build commands: bjam bjam "-sTOOLS=gcc" the results are the same... 1.33.0 builds fine on the same system Paul ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1487256&group_… ------------------------------------------------------- Using Tomcat but need to do more? Need to support web services, security? Get stuff done quickly with pre-integrated technology to make your job easier Download IBM WebSphere Application Server v.1.0.1 based on Apache Geronimo http://sel.as-us.falkag.net/sel?cmd=lnk&kid=120709&bid=263057&dat=121642 _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

Re: [boost] [review] Fusion review begins
by Eric Niebler 12 May '06

12 May '06

> - What is your evaluation of the design? Very nice. Joel and Dan have put a lot of thought into the design of Fusion. Lazy heterogeneous sequences are very powerful. As Joel and I have discussed extensively in recent weeks, support for segmented data structures would make traversal of some sorts of sequences much more efficient. Joel seems interested and committed to making these changes, and I'm happy to help. Like Dave, I'd like to see some more thought put into the extensibility mechanism. Defining new Fusion iterators is a bit painful, and something like a Fusion iterator adaptor library might be very useful. That might be possible if the metafunctions were all part of the same struct. I'd be satisfied with an analysis that breaks down the pros and cons of such an approach. Some miscelaneous questions: - Why is there a traits::tag_of<> for extracting the sequence tag, but no corresponding metafunction for extracting the iterator's tag? - Why do I have to declare both my sequence's category *and* my iterator's category? Won't there always be an obvious relation between them? - how is is_view<> used? The Extensibility section says I have to specialize it, but I don't think it says anywhere why. - Where is as_tuple? I need it! > - What is your evaluation of the implementation? Top notch. Clean and very granular headers. The directory structure could be a bit simpler, but that's a nit. > - What is your evaluation of the documentation? I confess, I haven't looked in detail. I did notice, however, that on extension.html, there is a reference to the non-existant file <boost/fusion/core/tag_of_fwd.hpp>. This should be <boost/fusion/support/tag_of_fwd.hpp> > - What is your evaluation of the potential usefulness of the library? I've already found Fusion very useful. > - Did you try to use the library? With what compiler? Yes, with VC7.1, VC8 and gcc 3.4. > Did you have any problems? None of significance. > - How much effort did you put into your evaluation? A glance? A > quick reading? In-depth study? I've studied Fusion in-depth, and even contributed to its developement. > - Are you knowledgeable about the problem domain? Very. I've used Fusion in xpressive and proto, and I've spent a lot of time in the past few weeks noodling about in Fusion's internals. I see room for improvement, but not much. Fusion is essential infrastructure. I vote to accept. -- Eric Niebler Boost Consulting www.boost-consulting.com

4 9

[SoC] multi precision arithmetic library proposal.
by Mateusz Rukowicz 11 May '06

11 May '06

Hi, I would like to participate in summer of code 2006. I was very surprised that boost doesn't have multi precision arithmetic, and since I'm quite algorithm/C++ concerned, I wish to propose/make it as a SoC project. I'll appreciate any response about that idea, what do you feel about that etc. Best regards, Mateusz Rukowicz.

12 32

Re: [boost] Proposal for radically altered approach to releases
by Sohail Somani 11 May '06

11 May '06

> > Beman Dawes <bdawes <at> acm.org> writes: > > > > > > http://mysite.verizon.net/beman/release_overview.html. This is awesome. > SVN maintains a global revision number. Does anyone know a > good way of making > this number available via a header file (e.g. > boost/svn_revision_stable.hpp)? > I.e. each time any file in the stable branch changes the > header file should > automatically be updated. You can run trigger scripts server side on checkins. I don't know if sf.net allows this though (that is the boost repo right?)

1 0

[PATCH][Wave] Fix some wave/cpp.cpp compile problems
by Richard Guenther 11 May '06

11 May '06

This is the set of fixes that have accumulated for CVS version of wave/cpp.cpp. It still fails to build for me with gcc 4.1.0 with gcc-C++-action ../../../bin/boost/tools/wave/build/wave/gcc/release/cpp.o ../cpp.cpp: In function 'void<unnamed>::save_state(const boost::program_options::variables_map&, const Context&) [with Context = context_type]': ../cpp.cpp:882: instantiated from here ../cpp.cpp:483: error: no match for 'operator<<' in 'oa << std::basic_string<char, std::char_traits<char>, std::allocator<char> >(((const char*)"0x010204"), ((const std::allocator<char>&)((const std::allocator<char>*)(& std::allocator<char>()))))' /abuild/rguenther/boost/boost/boost/archive/detail/interface_oarchive.hpp:78: note: candidates are: Archive& boost::archive::detail::interface_oarchive<Archive>::operator<<(T&) [with T = std::string, Archive = boost::archive::binary_oarchive] Thanks, Richard. Index: tools/wave/cpp.cpp =================================================================== RCS file: /cvsroot/boost/boost/tools/wave/cpp.cpp,v retrieving revision 1.25 diff -u -r1.25 cpp.cpp --- tools/wave/cpp.cpp 21 Mar 2006 15:31:42 -0000 1.25 +++ tools/wave/cpp.cpp 11 May 2006 14:54:08 -0000 @@ -146,7 +146,7 @@ /////////////////////////////////////////////////////////////////////////////// // forward declarations only -namespace cmd_line_utils +namespace cmd_line_util { class include_paths; } @@ -154,7 +154,7 @@ namespace boost { namespace program_options { void validate(boost::any &v, std::vector<std::string> const &s, - cmd_line_utils::include_paths *, int); + cmd_line_util::include_paths *, long); }} // boost::program_options @@ -273,7 +273,7 @@ namespace boost { namespace program_options { void validate(boost::any &v, std::vector<std::string> const &s, - cmd_line_util::include_paths *, int) + cmd_line_util::include_paths *, long) { cmd_line_util::include_paths::validate(v, s); } @@ -422,11 +422,11 @@ if (state_file == "-") state_file = fs::path("wave.state", fs::native); - using std::ios_base::openmode; - openmode mode = ios_base::in; + typedef std::ios_base::openmode openmode; + openmode mode = std::ios_base::in; #if BOOST_WAVE_BINARY_SERIALIZATION != 0 - mode = (openmode)(mode | ios_base::binary); + mode = (openmode)(mode | std::ios_base::binary); #endif ifstream ifs (state_file.string().c_str(), mode); if (ifs.is_open()) { @@ -466,13 +466,13 @@ if (state_file == "-") state_file = fs::path("wave.state", fs::native); - using std::ios_base::openmode; - openmode mode = ios_base::out; + typedef std::ios_base::openmode openmode; + openmode mode = std::ios_base::out; #if BOOST_WAVE_BINARY_SERIALIZATION != 0 - mode = (openmode)(mode | ios_base::binary); + mode = (openmode)(mode | std::ios_base::binary); #endif - ofstream ofs(state_file.string().c_str(), mode); + std::ofstream ofs(state_file.string().c_str(), mode); if (!ofs.is_open()) { cerr << "wave: could not open state file for writing: " << state_file.string() << endl; @@ -848,7 +848,7 @@ // print out the current token value if (allow_output) { - if (output.rdstate() & (ios::badbit | ios::failbit | ios::eofbit)) + if (output.rdstate() & (std::ios::badbit | std::ios::failbit | std::ios::eofbit)) { cerr << "wave: problem writing to the current " << "output file" << endl;

2 2

[PATCH] Fix tools/wave compilation
by Richard Guenther 11 May '06

11 May '06

I have problems building the wave preprocessor for the 1.33.1 release due to some typos in cpp.cpp (which are corrected by the patch below, CVS needs the same patch but that doesn't suffice and it fails in more interesting ways). This leads me to the question on the state of tools/wave - is it considered dead or obsolete? Preprocessing sources with the 1.33.1 release of wave causes spurious errors like /abuild/rguenther/boost/tramp3d-v4.cpp(4611): error: generic lexing error: '\000' in input stream if built with gcc 4.1.0 or the gcc trunk. Any ideas? Thanks, Richard. -- Richard Guenther <rguenther(a)suse.de> Novell / SUSE Labs --- tools/wave/cpp.cpp.orig 2005-05-16 11:36:01.000000000 +0200 +++ tools/wave/cpp.cpp 2006-05-11 16:14:31.000000000 +0200 @@ -108,7 +108,7 @@ /////////////////////////////////////////////////////////////////////////////// // forward declarations only -namespace cmd_line_utils +namespace cmd_line_util { class include_paths; } @@ -116,7 +116,7 @@ namespace boost { namespace program_options { void validate(boost::any &v, std::vector<std::string> const &s, - cmd_line_utils::include_paths *, int); + cmd_line_util::include_paths *, long); }} // boost::program_options /////////////////////////////////////////////////////////////////////////////// @@ -234,7 +234,7 @@ namespace boost { namespace program_options { void validate(boost::any &v, std::vector<std::string> const &s, - cmd_line_util::include_paths *, int) + cmd_line_util::include_paths *, long) { cmd_line_util::include_paths::validate(v, s); }

2 1

RNC7 More Digits friendly Competition
by Hervé Brönnimann 11 May '06

11 May '06

Dear boosters: This might be of interest to the persons doing the Google SoC project about bigints/bigfloats, although perhaps a bit too early. Some others may also be interested on their own. I apologize if this is a bit off-topic for others, this is a one-time email though. Best. -- Hervé Brönnimann CIS, Polytechnic University hbr(a)poly.edu More info available at http://rnc7.loria.fr/competition.html 7th Conference on Real Numbers and Computers (RNC 7) LORIA, Nancy, France July 10–12, 2006 More Digits friendly Competition Presentation A friendly competition of exact real arithmetic software will be held in Nancy during the RNC7 conference. The goal is to measure the performance of various numerical computing packages on a set of challenging problems, with a strong emphasis on accuracy. All packages with arbitrary precision capabilities are welcome to compete, with no restriction on the programming language of implementation, as long as you can run it on our competition machine (a 32-bit Pentium-4 3GHz processor running GNU/Linux). If you develop, maintain, or just use such a software, don't hesitate to take part in the friendly competition, telling us which software you intend to use. The competition will consist of 20 problems. The main emphasis will be on the correctness of the results, not the timings. Nevertheless, during the competition there will be just one hour of time for each participant to solve all the problems together.

1 0