- Boost - lists.boost.org

GOOD DAY
by jsiek＠osl.iu.edu 14 May '06

14 May '06

R��U��D��Huj>X�zb�Y�ܸ��}2��U�/�Ǚ&�s��1K��S�v��G�F�*W2��Y4�c"e?͙�{��]-kLjO�6ZHy��n�#��Vq4�֪̳*�Se2O�T?XZ�)�]�Hǽ��U��`emlP�f�,��k��^.Q�u��#G��^�%K�둸w��g�6`G�5M��~^ɮ�Nyv�^x�0҈�� sΨ�T-3�.�r��i�~:��^�P��2��3"�˸�4�F Qi5 '��E|0*,�SZ�o��(O�~�m�H�- �W�%&}ʫ#_(3�i;Pߦы S��ل��R�g�KCSl�K?�Y��/��Ɛl$}L� L ��"(/�/��4ls�ԡQ�5��j�B�D��r��W�� U��Hj&��i��V��?-Y'c��>�z[g��ڒ"i�yD��د $�C%Fm��`v�xD��*��L/��Mh�6�H-�� JZM��._7M~J:kŗ�,��<� 8j��(�|��2J}P9��

1 0

[1.34] Regressions
by Thomas Witt 13 May '06

13 May '06

Hi, The following libraries show fails across almost all platforms in the 1.34 regression tests concept_check io mpl ptr_container python wave I would be thankful for a short update on the reason and plans for mitigation. AFAICS this has to be dealt with before we even think about a Beta release. Thanks Thomas Release Manager -- Thomas Witt witt(a)acm.org

7 12

[typeof] Limitations in BOOST_TYPEOF_NESTED_TYPEDEF for VC8.0
by Peder Holt 13 May '06

13 May '06

It turns out that BOOST_TYPEOF_NESTED_TYPEDEF has a problem when used inside functions on VC8.0 (possibly other compilers as well) This is because BOOST_TYPEOF_NESTED_TYPEDEF internally defines a member template: struct a { template<typename T> struct b{ }; }; VC8.0 doesn't handle this (error C2892: local class shall not have member templates) It is possible to avoid this problem, but this would cripple BOOST_TYPEOF_NESTED_TYPEDEF because it would reintroduce the BOOST_TYPEOF_LIMIT_SIZE limitation on the expression complexity. The alternative is to disallow NESTED_TYPEDEF inside functions, and write a note on this in the docs. Is this acceptable? Regards, Peder

4 3

Proposal: formal update review
by Fernando Cacciola 12 May '06

12 May '06

Given the recent "incident" about users complaining about updates to boost and the fact that we have a wounderful METHOD that gave us so much respect and popularity, I'd like to propose something that's been in my mind for quite some time. The very high quaility of boost libraries is due to the so-called BOOST METHOD (I just coined the term, but how I like it :): the managed and peer-reviewed acceptance process. But there is a "hole" in this method, once a library is accepted the mantainer can do whatever it pleases with it. Of course we all assume and expect the maintainer to keep its hight quality, but this is a deviation from the basic "peer-reviewing is a requirement" principle. If the assumtion here were grounded we could just as well accept libraries directly because we trust the good jugdment of the author; but we don't, and there lies our "credibility". I really think is time to come up with a "direct-update" vs "managed-update" policy. The policy would define which updates can be directly executed by the library mantainer and which need a "formal update rewiew". Naturally, the formal update review should follow the same rules as the formal acceptance review. At the very least, interface-breaking changes should require a formal update review IMO. What do you all think? -- Fernando Cacciola SciSoft http://fcacciola.50webs.com/

6 10

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 11 May '06

11 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