- Boost - lists.boost.org

[ptr_container] ptr_begin & family
by JOAQUIN LOPEZ MU?Z 29 Apr '05

29 Apr '05

Hello, If I'm understanding the Boost.PointerContainer docs, ptr_begin(), ptr_end() etc. are provided so that certain mutating std algorithms can be used on pointer containers. But wouldn't it be more convenient to provide a memfun like ptr_iterator make_ptr_iterator(iterator); for obtaining a ptr_iterator from a regular iterator? This way, one could easily use std algorithms not only with [ptr_begin(),ptr_end()), but also with any other range (for instance, those obtained from equal_range()). With this memfun, the ptr_begin() familiy would be kind of redundant. Just an idea... Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

boost::program_options
by daniel.egloff＠zkb.ch 29 Apr '05

29 Apr '05

Dear boost list It has been discussed several times already that boost::program_options throws an error if an unknown option is encountered. However, for command line options there is a boolean flag to handle unknown option (presumably?) In program_options/details/cmdline.hpp : cmdline(int argc, const char*const * argv, int style, bool allow_unregistered = false); However, common_command_line_parser::run(), when constructing a cmdline object does not forward this flag. I suggest that you change the signature of the run() method to forward that flag, and modify the code section in program_options/src/parsers.cpp current version: parsed_options common_command_line_parser::run() const { parsed_options result(m_desc); detail::cmdline cmd(m_args, m_style); cmd.set_additional_parser(m_ext); if (m_desc) { set<string> keys = m_desc->primary_keys(); for (set<string>::iterator i = keys.begin(); i != keys.end (); ++i) { const option_description& d = m_desc->find(*i); char s = d.short_name().empty() ? '\0' : d.short_name ()[0]; ........... new suggestion: parsed_options common_command_line_parser::run(bool allow_unregistered) const { parsed_options result(m_desc); detail::cmdline cmd(m_args, m_style, allow_unregistered); cmd.set_additional_parser(m_ext); if (m_desc) { set<string> keys = m_desc->primary_keys(); for (set<string>::iterator i = keys.begin(); i != keys.end (); ++i) { const option_description& d = m_desc->find(*i); char s = d.short_name().empty() ? '\0' : d.short_name ()[0]; ........... Does this allow then parsing cmd line option strings which contain unknown options without throwing exceptions? Comment very welcome. Freundliche Grüsse Daniel Egloff Zürcher Kantonalbank, VFEF Josefstrasse 222, 8005 Zürich Tel. +41 (0) 44 292 45 33, Fax +41 (0) 44 292 45 93 Briefadresse: Postfach, 8010 Zürich, http://www.zkb.ch ___________________________________________________________________ Disclaimer: Diese Mitteilung ist nur fuer die Empfaengerin / den Empfaenger bestimmt. Fuer den Fall, dass sie von nichtberechtigten Personen empfangen wird, bitten wir diese hoeflich, die Mitteilung an die ZKB zurueckzusenden und anschliessend die Mitteilung mit allen Anhaengen sowie allfaellige Kopien zu vernichten bzw. zu loeschen. Der Gebrauch der Information ist verboten. This message is intended only for the named recipient and may contain confidential or privileged information. If you have received it in error, please advise the sender by return e-mail and delete this message and any attachments. Any unauthorised use or dissemination of this information is strictly prohibited.

4 5

[1.33.0] Feature freeze tonight
by Douglas Gregor 29 Apr '05

29 Apr '05

At midnight tonight (Friday) the main trunk/CVS HEAD is feature-frozen and only bug fixes may be committed. New features should go on a separate development branch. We have > 700 regressions and > 3000 failures showing up in the regression tests. Library authors, please review the regression test summaries for your libraries and start fixing bugs. If there are bugs that cannot be fixed for release (due to broken compilers, the need for huge changes to the library, etc.), mark them as expected failures or mark the library as "unusable" in status/explicit-failures-markup.xml. I've updated the list of primary platforms for this release, which includes all newer versions of GCC, CodeWarrior, Visual C++, and Intel compilers. If all bugs can't be fixed, focus on the compilers in the "Release View" in the regression tests. Let's fix those bugs! Doug

8 23

Re: [Boost-testing] Re: [thread] test_read_write_mutex breaks regressiontesting
by Caleb Epstein 29 Apr '05

29 Apr '05

OK, after seeing two of these tests continue to perform poorly and hang in some cases, I decided it was time to break out the big guns: Purify. It found a number of problems with test_mutex and test_read_write_mutex, which seem to be triggered by Boost.Test making use of a string after it has been freed. Attached is the Purify output from test_mutex and test_read_write_mutex. -- Caleb Epstein caleb dot epstein at gmail dot com

6 11

FOEACH macro review in progress
by Gennadiy Rozental 29 Apr '05

29 Apr '05

Hi, everybody Just a reminder that FOREACH macro review crossed it's equator and there left 3 days until it's finished. So if you are interested to participate don't hesitate and do so. No pressure, of course - there is still time. Regards, Gennadiy

1 0

[Ann] Proposed Boost.TR1 library: first complete version now available.
by John Maddock 29 Apr '05

29 Apr '05

As some of you already know, I've been working on producing a Boost implementation of the Technical Report on C++ Library Extensions, the first full version is now available from: http://boost-sandbox.sourceforge.net/vault/index.php?&direction=0&order=&di… The documentation can also be viewed online at: http://freespace.virgin.net/boost.regex/tr1/doc/html/tr1.html For those new to the TR, the following are supported in this release: Reference Wrappers Smart Pointers Class template result_of. Function template mem_fn. Function Object Binders. Polymorphic function wrappers. Type Traits. Random Number Generators and Distributions. Tuples. Tuple Interface to std::pair. Fixed Size Array. Hash Function Objects. Regular Expressions. Complex Number Algorithm Overloads. Complex Number Additional Algorithms. The following are not yet supported, but will be as soon as hash-tables make it into Boost: Unordered Associative Set (Hash Table). Unordered Associative Map (Hash Table). The following do not currently have Boost-licence compatible implementations and are not supported: Mathematical Special Functions. C99 Math Functions. Finally, note that I may split the complex number stuff out into a separate submission (I'll post another message about this). As ever, comments are most welcome. John.

6 19

tuple patch (constructing from a pair)
by John Maddock 29 Apr '05

29 Apr '05

The following simple patch to tuple_basic.hpp allows tuples to be constructed from std::pairs (there is already an assignment operator, but the copy constructor is missing for some reason, and is required for TR1 conformity). RCS file: /cvsroot/boost/boost/boost/tuple/detail/tuple_basic.hpp,v retrieving revision 1.28 diff -r1.28 tuple_basic.hpp 627a628,636 > template <class T, class U> > tuple(const std::pair<T, U>& p) > : inherited(p.first, p.second, detail::cnull(), detail::cnull(), > detail::cnull(), detail::cnull(), detail::cnull(), > detail::cnull(), detail::cnull(), detail::cnull()) > { > BOOST_STATIC_ASSERT(length<tuple>::value == 2);// check_length = 2 > } > Is it acceptable to add this? Many thanks, John Maddock.

10 49

TEST
by jeff＠crystalclearsoftware.com 29 Apr '05

29 Apr '05

p� /K$�﹖�a�2�[S�sq��v��p��y;W8�f-��D�_Ok�UJ\b�È9��ͤ��6�gPD��,d�.�Z˶��^��s��\�3�ʕ�,k �f�dHZ�,��Nuƭ��d�w�6�%3��p` �0e�M�JÃ:��[��FR��%H �ӮP��Ƨ��S�C�rQ��Idmī�`2i��< Q��"�ח2�RJ�-n��*�o��{kR�ΰ��mk��"�"��e��E%�4��ٔi�4n�ڔ��l'�Ѧ)��3��O��f��TzX��G֬ŷ�"/,Y�r��C�!��]��J9Y��ߪkQ�(�r1�{�l��A ��~��tHJ��Yb��)��8py�K��W�& e҃z��sǚC��F7g`g�.��-��ϖq:�ch��r�$��Տ��Mm�tl� 7Z�2.�H��M�7��7j�؋_Tά�!u�N�K�L��0��!� ��%ҋ��VL� ��ӴZc�Iԕx��Bc��z%:�!U,B4ϩ��K�8WY&�J��ض-䭆�> t��a�Lӡˠ%��b:��F��\�5�HH��1�6�]?N��Д}oZ��*>; !��,��'��s��{��^V %�X��P�P͉y�m:��r��F��{�UULQc��8-��bqZwJO|��xiZ�b�r�L}�V�m%Yܨ�ֿ��%��bq^��W�5л��7��Z3MJf� �ܪ �2{��Q�fd��.�g��u��a�Я��Y �g� ��e{lk��W�]4�AGmΤ�Q�|��T��V��"ZP��Y��t��In�3<�A��_�51y_2�ӷ�۝�Az��y� �.㧞��wK�<ĉ�]�tr��K񏯅��_"��4�'��Z�!��ID�|��'�}o�c�� N�x��FHi��H^W�17��'qJD��I��;i��ߺ'ۺ�P��K��-mvM,7��ѥo�؄�0��A�`�ؾۄ�g�>FRGf��V�_�%C��(��؞�|G��t��o/��Ւ]/�v`��^v��FͶ�4��}��È�D�P,{��m�tsҐ�T��wf�_T\��<S�M�s*׸H�ȽA�s�1)�/ѳ�%;G�<p�a��H�3<�w��S݆} ��4pS�&�s5Ê5�ao-�;��n_��ڍk�a#LM��]G>$��/t5`�Djx�-�� ƭ��u� :��fyy螏��c�~Z�L��u�͔/��-Na�� :�wfxܸ��_rY��9?��ʃ�`�z(��d��z�J��R�#Ȫf�Zk5;"��$N�mӐPa�-O��\��e��mZP��XG�-$Xu�D�2�G��;�V�'��fb�&�Z�^Xv2e��s>.v>Ԍ�"4(��)��Q�G�\�5��۹ �mƟ~c|a��H��݊-I`fO�\�0 s�� GU:'��Vv�AS��^R��X�Dp%�i�.�X��9��gg�Z��#E �7mԧZtv ��ȁ��i �1�"�X��Κ��m;�ݪ��&�Eq��ZV�k�� HT�H�}��ԼƔ��!'Mr��q�.��s��$T��t�p�ͅ�u�� Ƈá�I~��iM�3D�u��5�m�a��S��dx֔��OW�c��X��Dx9$�Hd�ȝ��0*��v�8��Zn�S��[;�(� {0$�`�8�K��Ѿ��9��7��.�8�_�p�Dy��y��2��'��ߦ�:s8RyB��N��J։]X75�jؑV �{1��6��,0��{z��00�Ԛ��:�^�kq��x��g�Z�� o�$V^��R�� &a�R6�Xq�9ܻ�|�b/U�UAD�>hi�w"��1��aHY4�-j� S�p#��x�Wt��iZ�k��!]/�Ƒ�I�O%�� '!!V�R:�0��&�V�4}�{�wQ��GBy��:�<�]��|��~׸5߇B�h� �wE]Ey:�뺎$��_��W��F%��;UJ��ڷ�l�8��",�n�d|� ��dA��3�Hs��K�A��O��V|��{)m�aĸ��74UO��YT�ƨdSpt��MI��k'�c�cKn��o��;| ��JEv��jMF��Z"�D)n�[�C&�2vG�S��'��I�*��a��A�*�/�V��.�n%��h��\ٱ�K�3h`�IHB��g`��h.��Q6{��,�� $��7G��xv��(�o��C�7�w��;�r�.��}�l�5�<f �I�u�]E��v\�Ijz�[ű(^:�sVZ�K��OpTZ9?�U� �f��n:�F�H0O�-��e8/Ӷ\��Y ��K��T��9�1Q� pt��:��ͪ��nK�N�(tgd�Ya��ެ�Q}��C�9JN��Ke�N�?}��E�!˒n��j�\�_% �1��.eo�˛� $~5*��k9�!��E\~E�a��q�T�0MTd�SȦ��$wh^!`�p�L�֚�_�_�?ӵ*�� >F?��p<-*N��p��f��2��T-v��N�9t��-��,� b4�)��AX]��9�9��k[��G7MB�p!��5�� W�D�ֱ '�c��/>�>.ZE&T��b7��E�f�?Ї��R��a,g�"n��{�d��(eH`��O��eF��h�QZ��5��a�ĳ&α�V�`Ե3��ڿO�ɒu~˷f��(}�r�GB�9ҩ�:l^��[� ��&Oz��諤��O��Y�v�a��ی��C&l�?r��>C��`�2�f`�r0�3�t��R�'�J�7b3�جs�O�7T6V�&W>H�4µ��x��kO(�n�u�~U&7�p�B�Ah��g��[��o u��w�sz'�347��y�,�̻�"n�3��~D��䖈D�t�;�&��RLJBE��$��E�kZ}fG�mgLȈo Q��DT��A�;�� N��N�4$�Z�k`�G%��g \�W�D�%��{�[��h��RS��D��!� �\��/��F��s��Ћ��큓B�� ɷ�q�vX�{�\�?&��zx�w�ì�DT[��r��Ɏ�J�& %c�WXXށ6��2��L��ao��щ�p�

1 0

[1.33] bind_rel_test fails on g++ 2.95.3
by Peter Dimov 29 Apr '05

29 Apr '05

I have one unexpected failure in bind: bind_rel_test on g++ 2.9x. It's caused by the overeager relops operators and the lack of std:: by default. I think I know how this can be fixed, but this will trigger a recompilation of everything that includes bind.hpp. OK to proceed with the fix? On a related note, when are expected failures going to turn gray? :-) -- Peter Dimov http://www.pdimov.com

3 2

Re: [boost] Big integer continued
by brangdon＠cix.compulink.co.uk 29 Apr '05

29 Apr '05

In-Reply-To: <d4rdqo$vhr$1(a)sea.gmane.org> kalita(a)poczta.onet.pl (Marcin Kaliciñski) wrote (abridged): > There's an issue with some of the bitwise operations, as they are only > well defined for integers of fixed size. What should for example > ~boost::integer(0) return? Ideally an infinitely long integer filled > with binary 1s. Some of the functions in n1744 look like they would be most useful when using an integer as a kind of vector<bool>. Is that intended as a reasonable use? It could be convenient if there were some way to specify a mask of arbitrarily many 1s. In effect, a left-shift with 1-fill. Given that, don't see a need for ~boost::integer(0) and I'd rather it didn't compile. > boost::rational does not have a conversion operator to integer type, > which is good as most of rationals are not integers. Should > boost::integer have such an operator, with runtime range checking? The conversion should be explicit in my view, perhaps via boost::numeric_cast<>. > 2. Implementation Initially I'd be happy if you just provided one portable implementation and an efficient one for your favourite platform. Lack of an efficient implementation for any given platform should not be a reason to reject the library. -- Dave Harris, Nottingham, UK.

1 0