- Boost - lists.boost.org

[SVN] Repository branches/libs experiments
by Beman Dawes 28 Aug '07

28 Aug '07

I've set up a couple of my development branches in SVN. See the attached screenshot of the Boost.System branch. It wasn't entirely clear how to cope with the fact that typical boost libraries have several sections. For example, Boost.System has one header in boost-root/boost, other headers in boost-root/boost/system, and then the rest of the library in boost-root/libs/system. I've currently got the filesystem branch organized like this: /svn/boost/branches/libs/ system/ boost/ system/... system/ build/... doc/... src/... test/... That works, but I'm wondering if it would be more consistent to have organized it like this: /svn/boost/branches/libs/ system/ boost/ system/... libs/ system/ build/... doc/... src/... test/... In other words, organized the sub-tree under /svn/boost/branches/libs/system exactly the same way the trunk is organized. That might be easier for others to understand. I also wonder if it has any advantages as far as various SVN operations go. Opinions? --Beman

10 20

Re: [boost] Possible bug in shared_array
by Hansi Hansi 27 Aug '07

27 Aug '07

Okay. I will make a test case Best regards Hansjörg _______________________________________________________________________ Jetzt neu! Schützen Sie Ihren PC mit McAfee und WEB.DE. 3 Monate kostenlos testen. http://www.pc-sicherheit.web.de/startseite/?mc=022220

1 0

[proto]context interface allowing "packaged" node args?
by Larry Evans 27 Aug '07

27 Aug '07

Hi Eric, I need a context with something like the following methods: template< typename Tag, typename Left, typename Right > result_type operator()(expr<Tag, Left, Right> const &expr) const { std::cout<<std::setw(indent) <<""<<"binary_expr:"<<expr.get_instance()<<"\n"; indent+=2; proto::eval(left, *this); proto::eval(right, *this); indent-=2; } where the expression tree node argument remains "packaged": (expr<Tag, Left, Right> const &expr) in contrast to the unpacked version: (Tag, Left const &left, Right const &right) shown in, for example: http://boost-sandbox.sourceforge.net/libs/proto/doc/html/boost_proto/user_s… IOW, the calculator.html page suggests an interface like: template< typename Tag, typename Left, typename Right > result_type operator()(Tag, Left const &left, Right const &right) const { std::cout<<std::setw(indent)<<""<<"binary_expr\n"; indent+=2; proto::eval(left, *this); proto::eval(right, *this); indent-=2; } where there's no access to the "packaged" extended node, expr<Tag,Left,Right>, where the extension is, for example: struct xmpl_domain; struct xmpl_delta { unsigned const my_instance; static unsigned our_instances; xmpl_delta(void) : my_instance(++our_instances) {} xmpl_delta(xmpl_delta const&) : my_instance(++our_instances) {} void operator=(xmpl_delta const&) {} unsigned get_instance(void)const { return my_instance; } }; unsigned xmpl_delta::our_instances=0; template<typename Expr> struct xmpl_expression : proto::extends<Expr, xmpl_expression<Expr>, xmpl_domain> , xmpl_delta { ... }; I've looked at the formated output of the preprocessed context.hpp; however, I'm still having difficulty figuring out if this "packaged" method interfaces is possible. Any help is appreciated. TIA. -regards, Larry

4 12

BOOST_WORKAROUND and gcc warnings
by John Maddock 27 Aug '07

27 Aug '07

Is the proposal here: http://svn.boost.org/trac/boost/ticket/1130 a viable way of fixing the pesky gcc warnings from BOOST_WORKAROUND? This one keeps coming up, but we've never had a way of fixing it that didn't involve a disproportionate amount of work... John.

3 5

Trac bugs - by assignee
by Marshall Clow 27 Aug '07

27 Aug '07

[ 356 open tickets today, 358 Saturday ] If you are maintaining a library, and have not logged into the trac system at <http://svn.boost.org/trac/boost/>, please do so ASAP. Until you do that, no tickets can be assigned to you, and will remain under "None". Instructions on working with tickets can be found at: <http://svn.boost.org/trac/boost/wiki/TicketWorkflow> and a mapping of user names to "real names" can be found at: <http://svn.boost.org/trac/boost/report/16> 27 grafik 27 djowel 24 doug_gregor 19 az_sw_dude 17 johnmaddock 16 rogeeff 15 ramey 15 jsiek 15 dave 15 None 14 bemandawes 13 dgregor 12 pdimov 12 agurtovoy 11 turkanis 10 vladimir_prus 8 nesotto 8 anthonyw 7 <Blank> 6 shammah 6 jbandela 5 witt 5 samuel_krempp 4 urzuga 4 mark_rodgers 4 ebf 4 danielw 3 nobody 3 jmaurer 3 igaztanaga 3 fcacciola 3 dlwalker 2 hubert_holin 2 eric_niebler 2 alnsn 1 t_schwinger 1 speedsnail 1 samuel_k 1 pavol_droba 1 mumiee 1 mistevens 1 kevlin 1 hkaiser 1 garcia 1 asutton 1 aaron_windsor None 1199 configure doesn't work with path containing whitespaces (MacOS X) None 1187 bcp copy not needed files None 1184 property_tree assignment (operator) bug None 1182 Specifying character-set by the guideline and the inspect program None 1166 [boostbook] paths relative to boost.root None 1161 warning: source_type/target_type shadows a member of this None 1116 disable some warnings in msvc build None 1094 Finding the correct library to link (feature request for pkg-config support)h None 1079 boost-1.34.0 fails to compile. concept checks not satisfied. None 1068 Mersenne twister disables streaming for Visual C++ None 1059 random_on_sphere can be made 10 times faster! None 991 [pool] None 986 Problem building Python modules on boost 1.34.0 None 982 x64 documentation for windows None 960 [random] lognormal_distribution problem <Blank> 1192 [boostbook] problem when two files have the same name <Blank> 1093 Mandatory source files shouldn't require_ or give the impression to require_ the Boost Build system <Blank> 1070 [iostreams]boost\iostreams\copy.hpp line80 copy_impl <Blank> 1033 iostreams::restrict doesn't work on an iostreams::file_source <Blank> 1011 amd64: #error Boost.Numeric.Interval: Please specify rounding control mechanism. <Blank> 824 BOOST_IOSTREAMS_HAS_LSEEK64 on Mac OS X <Blank> 823 Seekable file_descriptor_source /sink? aaron_windsor 778 top-level configure is broken agurtovoy 1215 Boost 1.34.1_ mpl: Wrong workaround detection using MinGW32 (or.hpp_ line #33) agurtovoy 1122 Update regression.py to use SVN repo. agurtovoy 1099 unable to iterate through a "non-explicitly-declared" mpl::set agurtovoy 1051 MPL header ordering triggers bug agurtovoy 1049 Getting mpl/has_xxx.hpp to compile on AIX agurtovoy 1001 gcc 4.1.2 segfaults on mpl/test/apply.cpp agurtovoy 861 Detect nested template members with has_template_xxx agurtovoy 816 duplicat initial members -> erase_key postcond. fail agurtovoy 761 [mpl] evc4 port agurtovoy 640 documentation mistake agurtovoy 637 Adjusts mpl::pair concept to be compatible with STL pairs agurtovoy 588 mpl::remove compile error with gcc 4.1.0 alnsn 839 lexical_cast - local variable shadow patch alnsn 754 boost::any - typeid comparison across shared boundaries anthonyw 1168 [thread] tss crashes randomly anthonyw 1154 tss destruction segfaults in conjunction with dlopen/dlclose anthonyw 1053 Error using boost::mutex and C++/CLI anthonyw 659 provide an abstract "Task" type based on Boost.Threads anthonyw 881 errors when build with Apache stdcxx anthonyw 876 xtime documentation incomplete anthonyw 868 [thread] thread_specific_ptr::element_type ? anthonyw 802 [thread] MSVS: Allow use of thread headers with /Za asutton 693 Add clique detection algorithms DFMax_ Bron-Kerbosch az_sw_dude 1207 Method "from_julian_day_number" (class gregorian_calendar) not documented az_sw_dude 1162 warning: ticks shadows a member of this az_sw_dude 1160 warning: month_format shadows a member of this az_sw_dude 1147 date_time library contains global #define ERROR az_sw_dude 1098 Urgent libboost-date-time1.33.1 : bugs on ia64 ? az_sw_dude 1078 from_iso_string cannot read the output from to_iso_string az_sw_dude 1028 typo in boost header: date_time/time_defs.hpp az_sw_dude 187 locale az_sw_dude 17 Socket wrapper class az_sw_dude 890 date_time library supports only the current dst rule az_sw_dude 889 Insane Dependencies az_sw_dude 827 Unused variable in format date parser az_sw_dude 642 operator<< for gregorian::date_duration not found az_sw_dude 614 new timezone db file for #1471723 - 2007 DST support az_sw_dude 605 support new 2007 DST rules for timezone db az_sw_dude 604 from_ftime incorrectly processes FILETIME filled with zeros az_sw_dude 596 make timezone csv file C/C++ compatible az_sw_dude 316 date_time type conversion warning az_sw_dude 287 wrong usage of ios_base::narrow bemandawes 1090 scoped_file class that deletes file at end of scope bemandawes 1073 operations.cpp_ dummy_first_name lifetime bemandawes 1014 rename throws an exception that is not documented bemandawes 897 exists() throws exeption on existing but locked file on wind bemandawes 842 typo in auto_unit_test.hpp Revision 1.17 bemandawes 752 directory_iterator doesn't work with catch bemandawes 680 significantly different timer class behaviour on Win and Lin bemandawes 621 filesystem::path as a template bemandawes 607 Log level names wrong in documentation bemandawes 590 mkstemp bemandawes 559 linker error mingw 3.4.5 bemandawes 366 handle double '/' in the boost::filesystem bemandawes 222 Code analysis_ flaw detection_ debugging bemandawes 1061 boost::filesystem::basic_recursive_directory_iterator fails on empty directories. danielw 1097 keyword.hpp generates many warnings C4180: qualifier applied to function type has no meaning; ignored danielw 1054 Parameter takes an "infinite" amount of time to compile with the Intel compiler. danielw 1044 Argument pack inaccessable in a functions return type danielw 863 [parameter] fix operator|| for lazy binding dave 1181 [boost.python] can modify enum value dave 1180 [boost.python] def_readwrite need a default docstring dave 1179 [boost.python] can not export a union in VC2005sp1 dave 1096 Tutorial needs updating for BBv2 dave 1085 Python rules for compiling in Mac OS X dave 1066 Patch to make Boost.Python compile on SunCC dave 1020 Boost.Iterator proposal to add is_constant_iterator dave 1019 iterator_facade::pointer should be the return type of operator-> (DR 445) dave 1010 linking boost.python on freebsd dave 918 __doc__ strings dave 916 BPL Support for Python Callable Objects dave 910 gcc strict-aliasing problems with python dave 903 inconsistent usage of function pointer typedefs dave 865 Use of C++0x keyword as identifier dave 857 add shared_ptr< const T> support dgregor 1198 patch: boost/function/function_template.hpp fails to compile with gcc -fno-exceptions dgregor 1185 iostreams::direct_streambuf<T_Tr>::is_open always returns false if output iterator is not null dgregor 1164 Floyd Warshall broken with unsigned edge weights dgregor 1163 Spurious warning supression needed? dgregor 1149 Minor doc error in basic_null_device dgregor 1140 boost::iostreams linked_streambuf bug dgregor 1139 [iostreams] Regex filter segfaults when zero matches found dgregor 1124 ./configure failed on cygwin dgregor 1101 [MPI] Const-incorrectness in boost::mpi::status dgregor 1003 [iostreams] copy-paste error in typedefs for wchar multichar_filters dgregor 1002 [iostreams] close_impl<closable_tag> does not comply with spec dgregor 116 creating my own properties dgregor 556 Bundled graph properties djowel 1214 Provide an error count from a bjam Quickbook build djowel 1213 Specify that [#named_anchors] are global djowel 1208 gcc initialization order warnings djowel 1206 Escaping from within code? djowel 1205 Quickbook getting started djowel 1204 Non-breaking-space? djowel 1202 Add a [teletype] source mode djowel 1200 Revamp the header information djowel 1194 Add ID to table to allow linking to tables easily djowel 1193 Nestable tables and lists and exlicit paragraph markup djowel 1190 Markups inside simple markups djowel 1189 Scoped Macros djowel 1176 Space after inline code djowel 1175 What is punctuation? djowel 1174 Simplified template arg handling djowel 1173 Balanced comments djowel 1172 non-utf djowel 1171 Quickbook title output djowel 1170 Emit Warnings instead of # symbols in the syntax highlighter djowel 1159 bibliography support djowel 1158 optional named parameters djowel 1157 On Images djowel 1156 feature request: linkid to the whole document djowel 664 crash in boost::spirit::parse djowel 543 Embedded python won't compile djowel 314 spirit insert_key_actor.hpp djowel 241 Miss " = ParserT()" dlwalker 766 "Bug" in comment (x2) dlwalker 653 [integer] add support for integers longer than long dlwalker 613 boost/crc.hpp uses non-standard conforming syntax doug_gregor 1087 Mismatch between BBv2 and bjam toolsets in configure script. doug_gregor 1076 compile error: disconnecting struct with operator()() doesn't work in VS2005 SP1 doug_gregor 1067 Function needs to use pass-by-reference internally doug_gregor 1021 [Graph][reverse_graph] Problem using reverse_graph adapter with an adapted user defined graph doug_gregor 954 boost::dynamic_properties has no copy-constructor doug_gregor 891 Bunch of compilation error reported while using function.hpp doug_gregor 870 boost::graph::graph_utility.hpp is_connected() bad call doug_gregor 862 [utility] Make result_of handle lambda expressions doug_gregor 852 Problem with Boost and GCC 4.1 doug_gregor 829 Implicit graph not implement doug_gregor 746 max flow with lower bounds (capacities) doug_gregor 738 Memory leaks with signal::connect? doug_gregor 736 Const correctness violation doug_gregor 735 Fruchterman-Reingold grid performance can be improved doug_gregor 733 Numbered headers don't work with "preferred" syntax doug_gregor 732 Johnson All-Pairs needs better "no path" information doug_gregor 708 Dijkstra no_init version should not require VertexListGraph doug_gregor 447 reverse_graph and constness of property maps doug_gregor 403 Document copy_component doug_gregor 402 random_vertex/random_edge are unnecessarily inefficient doug_gregor 395 BGL graph types do not support allocators doug_gregor 375 LEDA graph adaptors do not handle hidden nodes properly doug_gregor 373 LEDA graph adaptors for undirected graphs doug_gregor 372 adjacency_matrix should model BidirectionalGraph ebf 1112 reference_wrapper<T> should convert to reference_wrapper<U> when T& is convertible to U& ebf 993 Variant should use least common multiple of alignments_ rather than maximum ebf 965 [doc] boost::variant tutorial - final example uses v1_v2 should be seq1_seq2 ebf 547 [variant] Compile time checked getter eric_niebler 1119 enable_reference_tracking copy constructor does not call base class version eric_niebler 1071 Request for BOOST_REVERSE_FOREACH and rationale fcacciola 282 boost::optional<enum> fails with /CLR fcacciola 818 No zero-argument in_place() fcacciola 617 Numeric Conversion Documentation minor bug garcia 1045 [multi_array] Need a proper swap operation grafik 1203 Decouple the backend grafik 1146 KAI Referenced in compiler status acknowledgements grafik 1135 bjam crashes grafik 1128 boost-buil rule does not overrule BOOST_BUILD_PATH grafik 1088 Docs for template escape feature. grafik 1074 FreeBSD specific patches to boost 1.34.0 grafik 1041 Cygwin requires PATH setting. grafik 1040 boost.devel archive at ActiveState disconnected grafik 1031 AmigaOS fixes for bjam grafik 1023 inspect grafik 989 Boost build does not support building universal binaries on macintosh grafik 714 [jam] HardLink rule on NT platform grafik 94 Better reporting of failed expectation. grafik 93 Testing problems on AIX and OSF grafik 1062 Cygwin install stage fails with combination of patches grafik 977 bjam crashes when compiled with gcc 4.2 grafik 959 linking fails when Boost is compiled with STLport 5.1.* on Linux (names mismatch) grafik 896 <native-wchar_t>off does not work when build with vc-8.0 grafik 798 bjam: always define OSPLAT grafik 721 Generated files "@()" don't work in regular expressions. grafik 683 libraries won't build grafik 616 Boost Jam_ and non english directorys grafik 552 Building universal binary on MacOSX grafik 546 boost.build needs fixes for HP/UX grafik 497 Unable to build boost with Dinkumware STL version 4.02 grafik 481 Linker Problems with VC .NET 2003 / STLPort / Boost grafik 431 boost jam problem with parallel builds hkaiser 1077 Spirit integer parser does not always detect integer overflow hubert_holin 647 octonion documentation bug hubert_holin 162 Cannot compile octonion_test.cpp because of bug in sinc.hpp igaztanaga 1211 Interprocess tests hang when run in parallel. igaztanaga 1210 interprocess::barrier hangs during second use under linux (boost 1.33.1) igaztanaga 1080 boost::interprocess win32 global file mapping issue jbandela 665 bug in char_separator jbandela 501 token_iterator::at_end() result is inversed jbandela 306 Visual C++ "Language Extensions" support jbandela 283 Compiler error for tokenizer on Solaris jbandela 279 SLOOOWW tokenizer compilation on VC++6.0 jbandela 259 Problem compiling :/ jmaurer 920 Proposed extension to random library jmaurer 819 uniform_int<> with type's maximum availaible range error jmaurer 351 Diff in state of mersenne_twister gen between GCC3.41 & CW9 johnmaddock 1216 problems compiling template class using is_class and is_arithmetic johnmaddock 1178 Regular expression min match length johnmaddock 1130 GCC -wundef warnings johnmaddock 1083 boost_regex 1.34.0 uses ICU library without linking to it johnmaddock 1081 Empty string rejected as perl-style regex johnmaddock 1008 Undocumented type traits. johnmaddock 1148 boost_1_34_1 regex library compile failure on aix with xlv johnmaddock 1105 Add BOOST_NO_STD_TYPEINFO or inject ::type_info into std johnmaddock 1104 Add BOOST_NO_TYPEID johnmaddock 1103 Add BOOST_NO_IOSFWD johnmaddock 1102 Add BOOST_NO_IOSTREAM johnmaddock 883 errors when build with Apache stdcxx johnmaddock 764 [regex] add support for a BOOST_NO_CREGEX mode johnmaddock 633 [config] evc4 port johnmaddock 591 make portable stdint.h from boost code johnmaddock 502 Problem running configure for unsupported platform johnmaddock 492 Adding boost::is_complex to type_traits.hpp jsiek 905 Assertion failed in token_iterator.hpp jsiek 315 Implement operator[] for Tokenizer jsiek 900 graphml reader namespace handling is broken jsiek 875 No iterator based constructor for adjacency_matrix jsiek 815 remove_edge core dumps on self-circle jsiek 813 concept_check.hpp unused variable warning jsiek 694 Add Maximum Common Subgraph (MCS) algorithm jsiek 636 strange compiling problem for transitive_closure jsiek 580 Max Flow Algorithm jsiek 575 Calling subgraph::global_to_local on a root graph jsiek 541 [concept_check.hpp] remove unused variable warning in msvc jsiek 416 Spelling of Edmonds-Karp-Algorithm jsiek 193 Check ordering for mutexes jsiek 182 Support aspect-orientation jsiek 100 more use of the concept "allocator" kevlin 913 Specialization of lexical_cast mark_rodgers 821 allow_unregistered improvement mark_rodgers 558 add database library? mark_rodgers 87 function to get the size of a array mark_rodgers 30 parser mistevens 688 ublas: bug in mapped_vector_of_mapped_vector mumiee 1201 Regexify the syntax highlighter nesotto 1151 [range] make_indirect_range() nesotto 1145 Small bugs in Boost.Range documentation nesotto 1027 [ptr_container] optional serialization support nesotto 807 boost::assignment documentation: mathematical "typo" nesotto 730 The ptr_map iterator cannot be dereference to value type nesotto 518 [Boost.Range]boost::const_begin calls non-qualified 'begin' nesotto 471 boost.range and "const char[]". nesotto 723 local_time_facet error in VS2005 Win2003 nobody 922 Lexical cast and wide characters nobody 884 [iostreams] workaround for the boost + stdcxx on MSVC 7.1 nobody 795 [ublas] vector::back() pavol_droba 1152 rle_example fails pdimov 1114 Request for shared_ptr::type and shared_ptr::pointer pdimov 1113 shared_array<T> should convert to shared_array<T const> pdimov 1111 boost::bind objects should expose function_type and list_type pdimov 1110 Add a release method to scoped_array pdimov 1109 intrusive_ptr needs a helper base class pdimov 1108 shared_ptr does not compile under g++ with -fno-rtti pdimov 1107 Add weak_use_count to weak_ptr as a debugging aid pdimov 1106 shared_ptr<T> should not convert to shared_ptr<U> when T* doesn't convert to U* pdimov 997 error in boost::bind doc pdimov 810 support for weak_ptr binding pdimov 445 Can't delete automatically in circularly included object. pdimov 398 Support for embedded VC++ 4.0 ramey 1143 Archive headers appear to be missing multiple(?) include files ramey 1142 boost/serialization/optional doesn't include necessary header ramey 1141 Dangerious operator<< for wostream ramey 1137 Virtual destructor is missing ramey 1121 xml_archive_exception is missing seperate header file_ and documentation mismatch ramey 1089 missing boost::serialization::make_nvp in pointer container library ramey 1086 Serialization of weak_ptr produces invalid XML ramey 1038 "<" and ">" should be excaped in xml_oarchive ramey 1036 assert failure in oserializer.hpp:418 ramey 969 basic_binary_iprimitive::load_binary bug ramey 968 xml_grammar - incorrect define char ramey 961 boost::basic_binary_oprimitive not instantiated correctly ramey 874 Ability to partially specialize implementation_level ramey 757 xml serialization fails when using namespace ramey 878 error C2039: 'mbstate_t' : is not a member of 'std' rogeeff 1212 Template fixtures rogeeff 1169 errors in tutorial for test framework "new_year_resolution" rogeeff 1136 Let BOOST_CHECK_EQUAL support std::wstring rogeeff 1060 no example sources in online docs for Boost::Test rogeeff 1050 BOOST_CHECK_CLOSE_FRACTION documentation missing rogeeff 1032 typo in Boost.Test documentation rogeeff 1030 execution_monitor.ipp #warning directive breaks compilation on MSVC 8.0 rogeeff 999 prg_exec_fail3 fails on release variant rogeeff 998 prg_exec_fail2 fail on ppc rogeeff 962 Missing links in Test library documentation rogeeff 956 Doc error in test examples. rogeeff 893 grammatical error in error message rogeeff 847 [Test Library] How to init/free a singleton rogeeff 762 [test] evc4 issue with SEH support rogeeff 747 failing on 6 targets in MacOS X rogeeff 645 [test] no eh exception handling functions on evc4 samuel_k 585 64 bit compile warning/error for boost::format samuel_krempp 1196 Patch: when BOOST_NO_STD_LOCALE is not defined_ boost/format/internals.hpp fails to compile. samuel_krempp 1195 patch: boost/format/parsing.hpp does not compile if BOOST_NO_LOCALE_ISDIGIT is defined samuel_krempp 859 boost::format ignores a user defined locale samuel_krempp 980 boost.format vc8/win32 compilation warning samuel_krempp 704 format zero length string msvc-8 shammah 840 pool allocator - local variable shadow patch shammah 836 warning using pool.hpp shammah 386 boost::pool_allocator breaks with vector of vectors shammah 290 perfomance: memory cleanup for pool takes too long shammah 284 pool::purge_memory() does not reset next_size shammah 88 ct_gcd_lcm.hpp compilation error speedsnail 1138 Problems with TSS and static thread library t_schwinger 1100 Building boost.function_types fails cvs rev-1.1_ no chdir command in bash turkanis 869 [iostreams] patch for building by BBv2 turkanis 856 iostreams file_descriptor::write fails under Win32 turkanis 822 Incorrect usage of bad_write()_ bad_seek() etc. turkanis 817 Performance problem in iostreams turkanis 791 iostreams::tee_filter is for output only turkanis 786 bug in iostreams/copy.hpp line 81 turkanis 699 Changing size of memory-mapped file on Windows turkanis 586 iostreams // file_descriptor::seek BUG on files > 4 GB turkanis 579 boost.iostreams file_descriptor and sharing turkanis 525 problem with boost::iostreams when compiled with Visual C++ turkanis 484 Boost.Iostreams and newline translation urzuga 864 [lambda][utility] Make lambda support result<> urzuga 781 Lambda: (_1 + "y")(string("x")) Doesn't Compile urzuga 574 [boost::lambda] Compile error with libstdc++ debug mode urzuga 426 lambda vs pure virtual functions vladimir_prus 1177 Various bugs in STLport jamfile vladimir_prus 1165 more quoting problems vladimir_prus 1132 program_options documentation error. vladimir_prus 1129 Standalone doc_ outdated path from homepage vladimir_prus 1058 Cygwin libraries & GNU libtool vladimir_prus 985 Free features don't work when building boost vladimir_prus 850 program_options strips off escaped quotes in some situations vladimir_prus 689 [program_options] Endless loop with long default arguments vladimir_prus 674 find-library for boost decorated names vladimir_prus 469 multitoken broken witt 1046 Boost.Python quickstart instructions mention nonexistent target witt 973 zip_iterator has value_type == reference witt 957 The "Getting Started" page does not mention the stdlib option witt 834 Homepage regression links witt 145 filter iterator adaptor should be able to be bidirectional -- -- Marshall Marshall Clow Qualcomm, Inc. <mailto:mclow@qualcomm.com> The famous British scientist, Lord Kelvin, said: "When you measure what you are speaking about and express it in numbers, you know something about it, but when you cannot (or do not) measure it, when you cannot (or do not) express it in numbers, then your knowledge is of a meagre and unsatisfactory kind."

1 0

[statechart] Completion transitions again.
by Leandro Lucarella 27 Aug '07

27 Aug '07

Hi! I'm looking at the statechart library and I found myself in a situation where I need a completion transition. I saw in this thread[1] that they are not supported yet, so I wonder if you plan to implement them in a near future. The only way to simulate that now is to make a dummy event and call pocess_event/post_event/fifo_scheduler<>::queue_event|| at in the enter/transition action of the state? PS: Please Cc, I'm not in the list. [1] http://lists.boost.org/boost-users/2007/07/29795.php -- Leandro Lucarella Integratech S.A. 4571-5252

2 1

Possible bug in shared_array
by Hansi Hansi 26 Aug '07

26 Aug '07

Hello, I think I have found an bug in the shared_array implementation in version 1.34.1 for VC8.0. I have posted this mail also in the user list. Maybe one can fix this..(if it is really a bug) I think that the implementation needs this: #elif defined( _MANAGED ) static void unspecified_bool( this_type*** ) { } typedef void (*unspecified_bool_type)( this_type*** ); operator unspecified_bool_type() const // never throws { return px == 0? 0: unspecified_bool; } it is the same implementation as used in shared_ptr. If I don't have this I get during the call a buffer overrun. Best regards Hansjörg _______________________________________________________________________ Jetzt neu! Schützen Sie Ihren PC mit McAfee und WEB.DE. 3 Monate kostenlos testen. http://www.pc-sicherheit.web.de/startseite/?mc=022220

2 1

[intrusive] Comments on interface changes and stateful value_traits (long)
by Ion Gaztañaga 26 Aug '07

26 Aug '07

Hi to all, First of all, thanks to all who participated in recent threads about Boost.Intrusive options and extended configurability discussions. These days I've been experimenting a bit with this option and also with stateful value_traits (those who could allow non-intrusive hooks). ----------------------------------------- ----------------------------------------- Passing policies to hooks and containers ----------------------------------------- ------------------------------------------ As you know, one of my main concerns is that a container explicitly set with some options, should have the same type as another container defined with the same options in a different order. I meant: list<T, base_hook<my_base_hook>, constant_time_size<false> > should have the same type as: list<T, constant_time_size<false>, base_hook<my_base_hook> > l; My preferred alternative is the more verbose: typedef list_options < base_hook<my_base_hook> , constant_time_size<false> >::type options_t; list<T, options_t> l; that guarantees the same type for the same options. 1) Implemented interface: I've implemented all current container options using this approach. I've chosen a different options configurer "list_options", "slist_options"... because otherwise, I couldn't set defaults that could lead to the correct types. The default hooks is the base hook so a user can just say: class my_type : public list_base_hook<> {} list<my_type> l; Some options must not be set in the container *but in the hook*, since options affect both the hook and the container. Examples: void pointer definition, the linking policy. I think hook options can be unified so I have: typedef hook_options < void_pointer<offset_ptr<void> > , link<normal_link> , tag<my_tag> >::type hook_options_t; class my_type : public list_base_hook<hook_options_t> { typedef list_base_hook<hook_options_t> my_hook_t; } typedef list_options < base_hook<my_hook_t> , size_type<std::size_t> >::type options_t; list<T, options_t> l; As you can see, specifying options can be quite verbose (comparing it to the old way, but as new options are added (for example, custom buckets definition in hash containers) users don't have put arguments in order and can change only the options they want to change from the default. 2) Declaration of new classes: template<class T, class ListOptions> class list; template<class T, class SlistOptions> class slist; template<class T, class Pred, class SetOptions> class set; template<class T, class Hash, class Equal, class UsetOptions> class unordered_set; So the declaration of intrusive containers would be exactly the same as the STL containers plus an options argument. 3) Problem: Definition of member hooks is very long class my_type { list_member_hook member_hook_; } typedef list_options < member_hook<my_type, list_member_hook, &my_type::member_hook_> >::type options; list<my_type, options> l; Why? Because I can't make C++ deduce a pointer to member value in a single template parameter passed to a class. It would be nice that C++ could deduce my_type and list_member_hook from the value directly yielding to: typedef list_options //Deduce my_type and list_member_hook automatically < member_hook<&my_type::member_hook_> >::type options; If anyone can correct me, I would be *really* glad. 4) Custom value_traits Current interface takes a value_traits class as the first parameter in containers: template<class ValueTraits, bool...> class list; ValueTraits concept is very powerful because allows separating the concepts of a Node and a Value. The node is the minimal structure that is need to form a group of nodes (group of pointers to form a list, a tree...) and the Value is the whole user type that is somehow related to the node (via inheritance, membership, or other). Intrusive documentation offers examples of custom ValueTraits to reuse nodes for different containers or to deal with non modifiable ABI of old code. This is still possible specifying the value_traits instead of the hook: typedef list_options < value_traits<my_value_traits> >::type options; list<T, my_value_traits> l; --------------------------------------------------------- --------------------------------------------------------- Stateful value_traits (aka allowing extrusive containers) --------------------------------------------------------- --------------------------------------------------------- I've started experimenting with stateful value_traits, while trying to keep zero overhead when ValueTraits is an empty class. There are some problems though: 1) Iterators Iterators containa pointer to node and they use ValueTraits to obtain the user value from the node. If an stateful ValueTraits is used, we also need to store a pointer to the value traits stored in the container. If I want zero overhead when using hooks or just value traits with static functions I have to avoid storing the pointer when the iterator is stateless. How do we know if an allocator is stateless? One possibility is to check if the ValueTraits is empty, that is, has no members. However, this does not guarantee that ValuetTraits will define static functions so that no pointer to ValueTraits is needed to convert from a node to a container. I think it's a good aproximation or I could also define a traits or internal constant to say "this ValueTraits is stateless/stateful". For the moment, my current option is to consider an empty ValueTratis stateless, so it must define conversion functions as static members. 2) Losing static functions Some member functions of intrusive containers are static, so that there is no need to have a reference to the container. This sometimes is very useful (e.g. list::iterator_to) but this can't be achieved if stateful value traits are used. I can think 3 options: -> Convert static functions in non-static (losing some advantages) -> Offer static and non-static versions. Static versions won't compile with stateful allocators (via BOOST_STATIC_ASSERT). -> Someone knows have to make a function static or not depending on a compile-time boolean. 3) Stateless, but taking advantage of composition In a recent discussion about adding custom bucket traits to unordered containers a booster wanted to have the bucket outside the class (for example, to reuse that with other containers). With stateful allocators this can be possible if bucket traits are stateful an contain a pointer to the real bucket traits instance. But this increases the size of your intrusive container. However if the external bucket implementation is very near to the container (said, it's a member of the same structure or whatever), it's possible to obtain the address of the the external resource based on the address of the container or the internal traits instance included in the container. Rei Thiessen was requesting that when he explained the customized bucket info structure. template< unsigned n > struct bucket_info_size_n { /* appropriate constructors... */ bucket_ptr buckets_; template<class T> bucket_ptr buckets( T* container ) const { return buckets_; } size_type buckets_len() const { return 1<<n; } } So based on the address of the container, the user can find the resource (in this case, the bucket array) obtaining zero size overhead (the internal traits is empty). This logic can be extended to every traits class of the container, but specially to ValueTraits. But this would require passing the address of the container to every function the traits class implements. Users not wanting this composition hack surely don't want to change their signatures to just support this extremely advance practice: before class my_value_traits { node_ptr to_node_ptr(value_type &val) //... }; after class my_value_traits { template<class Container> node_ptr to_node_ptr(value_type &val, const Container& cont) //... }; So if there is any metaprogramming hack (if increases compilation time too much, forget it ;-) ) I would like to receive suggestions. Otherwise, a member static const bool saying "pass container address" in value traits might be useful, so that the container changes the calls to the traits with another equivalent one passing the address of the container. I haven't still experimented this composition hack so I'm really open to all suggestions from advanced users. My point is that this should be really optional and should not affect users not using these advanced features. As Rei said (inflating my ego): "These intrusive containers are so close to perfect that it's painful to have to modify them." So let's make them perfect ;-) Regards, Ion

5 13

[range] range library proposal implementation rev.2
by shunsuke 26 Aug '07

26 Aug '07

Hi, all A new version of Oven, a range library proposal implementation, has been uploaded to Boost.Vault/Algorithm. The file: http://tinyurl.com/2axp2l Range Library Proposal: http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1871.html An example "infinite sequence of factorials": void test() { BOOST_AUTO(factorials, expression(counting(1, max_count)|scanned(1, regular(lambda::_1 * lambda::_2))) ); int const answer[] = { 1,1,2,6,24,120,720,5040,40320,362880 }; BOOST_CHECK( equals(factorials|taken(10), answer) ); } This library is highly preliminary, but moderately tested. Any feedback appreciated. Regards, -- Shunsuke Sogame

2 12

Re: [boost] Idiot-proof mutex
by Steven Watanabe 26 Aug '07

26 Aug '07

AMDG Phil Endecott <spam_from_boost_dev <at> chezphil.org> writes: > > Hi Frank, > > Thanks; yes, I think this sort of thing would also be a useful addition > to Boost. The syntax that I presented had the advantage that > > a.push_back(123); > a.push_back(321); > > can have a single lock around both operations, while Bjarne's wrapper > would lock and unlock for each one. Also, I'm not sure whether his > could be extended to offer read locks for some operations and write > locks for others. > Here's something along these lines that I wrote a while back. In Christ, Steven Watanabe // locked_object.hpp // // Copyright (c) 2006-2007 // Steven Watanabe // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #ifndef LOCKED_OBJECT_H_INCLUDED #define LOCKED_OBJECT_H_INCLUDED #include <cassert> #include <iterator> #include <algorithm> #include <vector> #include <deque> #include <list> namespace providere_consulting { namespace iterators { class checked_container; class checked_iterator { friend class checked_container; public: checked_iterator() : prior(0), next(0), container(0) {} checked_iterator(const checked_iterator& other) : container(other.container) { if(other.is_valid()) { next = other.next; prior = &other; if(next != 0) { next->prior = this; } other.next = this; } else { next = 0; prior = 0; } } checked_iterator(const checked_container& container); ~checked_iterator() { if(is_valid()) { prior->next = next; if(next != 0) { next->prior = prior; } } } checked_iterator& operator=(checked_iterator other) { swap(other); return(*this); } bool is_valid() const { return(container != 0); } void swap(checked_iterator& other) { if(container != other.container) { std::swap(next, other.next); std::swap(prior, other.prior); set_other_pointers(); other.set_other_pointers(); } } void invalidate() const { if(next != 0) { next->prior = prior; } if(prior != 0) { prior->next = next; } container = 0; } private: static void invalidate_all(const checked_iterator* begin) { for(; begin != 0; begin = begin->next) { begin->container = 0; } } void set_other_pointers() { if(next != 0) { next->prior = this; } if(prior != 0) { prior->next = this; } } mutable const checked_iterator* next; mutable const checked_iterator* prior; mutable const checked_container* container; }; class checked_container { friend class checked_iterator; public: checked_container() : list() {} ~checked_container() { checked_iterator::invalidate_all(&list); } void invalidate_iterators() const { checked_iterator::invalidate_all(&list); } private: checked_iterator list; }; inline checked_iterator::checked_iterator(const checked_container& c) : container(&c) { next = container->list.next; prior = &container->list; set_other_pointers(); } template<class Iterator> class iterator_template; template<class Iterator> typename std::iterator_traits<Iterator>::difference_type operator-(const iterator_template<Iterator>& first, const iterator_template<Iterator>& second); template<class Iterator> bool operator==(const iterator_template<Iterator>& first, const iterator_template<Iterator>& second); template<class Iterator> bool operator<(const iterator_template<Iterator>& first, const iterator_template<Iterator>& second); template<class Iterator> class iterator_template : public checked_iterator { typedef ::std::iterator_traits<Iterator> traits; template<class Iter> friend class iterator_template; public: typedef typename traits::value_type value_type; typedef typename traits::reference reference; typedef typename traits::pointer pointer; typedef typename traits::difference_type difference_type; typedef typename traits::iterator_category iterator_category; iterator_template() {} iterator_template(const Iterator& iter, const checked_container& container) : checked_iterator(container), impl(iter) {} //iterator_template(const iterator_template& other); template<class Iter> iterator_template(const iterator_template<Iter>& other) : checked_iterator(static_cast<const checked_iterator&>(other)), impl(other.impl) {} iterator_template& operator=(iterator_template other) { swap(other); return(*this); } ~iterator_template() { } reference operator*() { check_invariants(); return(*impl); } Iterator operator->() { check_invariants(); return(impl); } iterator_template& operator++() { check_invariants(); ++impl; return(*this); } iterator_template operator++(int) { iterator_template temp(*this); ++*this; return(temp); } iterator_template& operator--() { check_invariants(); --impl; return(*this); } iterator_template operator--(int) { iterator_template temp(*this); --*this; return(temp); } iterator_template& operator+=(difference_type difference) { check_invariants(); impl += difference; return(*this); } iterator_template& operator-=(difference_type difference) { check_invariants(); impl -= difference; return(*this); } friend typename traits::difference_type operator-<Iterator>(const iterator_template<Iterator>& first, const iterator_template<Iterator>& second); friend bool operator== <>(const iterator_template<Iterator>& first, const iterator_template<Iterator>& second); friend bool operator< <>(const iterator_template<Iterator>& first, const iterator_template<Iterator>& second); void swap(iterator_template& other) { using std::swap; swap(impl, other.impl); checked_iterator::swap(static_cast<checked_iterator&>(other)); } Iterator get() { return(impl); } private: void check_invariants() const { assert(is_valid()); } Iterator impl; }; template<class Iterator> iterator_template<Iterator> operator+(iterator_template<Iterator> iter, typename std::iterator_traits<Iterator>::difference_type difference) { iter += difference; return(iter); } template<class Iterator> iterator_template<Iterator> operator+(typename std::iterator_traits<Iterator>::difference_type difference, iterator_template<Iterator> iter) { iter += difference; return(iter); } template<class Iterator> iterator_template<Iterator> operator-(iterator_template<Iterator> iter, typename std::iterator_traits<Iterator>::difference_type difference) { iter -= difference; return(iter); } template<class Iterator> typename std::iterator_traits<Iterator>::difference_type operator-(const iterator_template<Iterator>& first, const iterator_template<Iterator>& second) { first.check_invariants(); second.check_invariants(); return(first.impl - second.impl); } template<class Iterator> bool operator==(const iterator_template<Iterator>& first, const iterator_template<Iterator>& second) { first.check_invariants(); second.check_invariants(); return(first.impl == second.impl); } template<class Iterator> bool operator!=(const iterator_template<Iterator>& first, const iterator_template<Iterator>& second) { return(!(first == second)); } template<class Iterator> bool operator<(const iterator_template<Iterator>& first, const iterator_template<Iterator>& second) { first.check_invariants(); second.check_invariants(); return(first.impl < second.impl); } template<class Iterator> bool operator>(const iterator_template<Iterator>& first, const iterator_template<Iterator>& second) { return(second < first); } template<class Iterator> bool operator<=(const iterator_template<Iterator>& first, const iterator_template<Iterator>& second) { return(!(first > second)); } template<class Iterator> bool operator>=(const iterator_template<Iterator>& first, const iterator_template<Iterator>& second) { return(!(first < second)); } } template<class T, class Mutex> class locked_object; template<class T> struct locked_object_value { typedef T type; static void on_release(const T& t) {} }; template<class T> struct wrap_sequential_container : T, iterators::checked_container { typedef T base; typedef iterators::iterator_template<typename base::iterator> iterator; typedef iterators::iterator_template<typename base::const_iterator> const_iterator; typedef iterators::iterator_template<typename base::reverse_iterator> reverse_iterator; typedef iterators::iterator_template<typename base::const_reverse_iterator> const_reverse_iterator; using typename base::size_type; using typename base::const_reference; iterator begin() { iterator result(base::begin(), *this); return(result); } iterator end() { iterator result(base::end(), *this); return(result); } reverse_iterator rbegin() { reverse_iterator result(base::rbegin(), *this); return(result); } reverse_iterator rend() { reverse_iterator result(base::rend(), *this); return(result); } const_iterator begin() const { const_iterator result(base::begin(), *this); return(result); } const_iterator end() const { const_iterator result(base::end(), *this); return(result); } const_reverse_iterator rbegin() const { const_reverse_iterator result(base::rbegin(), *this); return(result); } const_reverse_iterator rend() const { const_reverse_iterator result(base::rend(), *this); return(result); } iterator insert(iterator pos, const_reference value) const { iterator result(base::insert(pos.get(), value), *this); return(result); } iterator insert(iterator pos, size_type size, const_reference value) const { iterator result(base::insert(pos.get(), size, value), *this); return(result); } template<class Iter> iterator insert(iterator pos, Iter begin, Iter end) const { iterator result(base::insert(pos.get(), begin, end), *this); return(result); } iterator erase(iterator pos) { iterator result(base::erase(pos.get()), *this); return(result); } iterator erase(iterator begin, iterator end) { iterator result(base::erase(begin.get(), end.get()), *this); return(result); } }; template<class T, class Allocator> struct locked_object_value<std::vector<T, Allocator> > { typedef wrap_sequential_container<std::vector<T, Allocator> > type; static void on_release(const type& t) { t.invalidate_iterators(); } }; template<class T, class Allocator> struct locked_object_value<std::deque<T, Allocator> > { typedef wrap_sequential_container<std::deque<T, Allocator> > type; static void on_release(const type& t) { t.invalidate_iterators(); } }; template<class T, class Allocator> struct locked_object_value<std::list<T, Allocator> > { struct type : wrap_sequential_container<std::list<T, Allocator> > { typedef wrap_sequential_container<std::list<T, Allocator> > base; void splice(typename base::iterator pos, std::list<T, Allocator>& other) { base::splice(pos.get(), other); } void splice(typename base::iterator pos, std::list<T, Allocator>& other, typename std::list<T, Allocator>::iterator begin) { base::splice(pos.get(), other, begin); } void splice(typename base::iterator pos, std::list<T, Allocator>& other, typename std::list<T, Allocator>::iterator begin, typename std::list<T, Allocator>::iterator end) { base::splice(pos.get(), other, begin, end); } }; static void on_release(const type& t) { t.invalidate_iterators(); } }; namespace scoped_lock_pointer_adl_barrier { template<class T> inline typename T::element_type& operator*(T& t) { return(*t.tptr); } template<class T, class Mutex> class scoped_lock_pointer { public: typedef T element_type; scoped_lock_pointer(locked_object<T, Mutex>& object) : tptr(&object.t), lock(object.mutex) {} ~scoped_lock_pointer() { locked_object_value<T>::on_release(*tptr); } template<class P> friend typename P::element_type& operator*(P&); T* operator->() { return(tptr); } private: scoped_lock_pointer(const scoped_lock_pointer&); scoped_lock_pointer& operator=(const scoped_lock_pointer&); typename locked_object_value<T>::type* tptr; typename Mutex::scoped_lock lock; }; template<class T, class Mutex> class const_scoped_lock_pointer { public: typedef const T element_type; const_scoped_lock_pointer(const locked_object<T, Mutex>& object) : tptr(&object.t), lock(object.mutex) {} ~const_scoped_lock_pointer() { locked_object_value<T>::on_release(*tptr); } template<class P> friend typename P::element_type& operator*(P&); const T* operator->() { return(tptr); } private: const_scoped_lock_pointer(const const_scoped_lock_pointer&); const_scoped_lock_pointer& operator=(const const_scoped_lock_pointer&); const typename locked_object_value<T>::type* tptr; typename Mutex::scoped_lock lock; }; } template<class T, class Mutex> class locked_object { public: friend class scoped_lock_pointer_adl_barrier::scoped_lock_pointer<T, Mutex>; typedef scoped_lock_pointer_adl_barrier::scoped_lock_pointer<T, Mutex> scoped_lock_pointer; friend class scoped_lock_pointer_adl_barrier::const_scoped_lock_pointer<T, Mutex>; typedef scoped_lock_pointer_adl_barrier::const_scoped_lock_pointer<T, Mutex> const_scoped_lock_pointer; locked_object() : t() {} locked_object(const T& arg) : t(t) {} template<class U> locked_object(U& u) : t(u) {} template<class U> locked_object(const U& u) : t(u) {} template<class U1, class U2> locked_object(U1& u1, U2& u2) : t(u1, u2) {} template<class U1, class U2> locked_object(const U1& u1, U2& u2) : t(u1, u2) {} template<class U1, class U2> locked_object(U1& u1, const U2& u2) : t(u1, u2) {} template<class U1, class U2> locked_object(const U1& u1, const U2& u2) : t(u1, u2) {} template<class U1, class U2, class U3> locked_object(U1& u1, U2& u2, U3& u3) : t(u1, u2) {} template<class U1, class U2, class U3> locked_object(const U1& u1, U2& u2, U3& u3) : t(u1, u2) {} template<class U1, class U2, class U3> locked_object(U1& u1, const U2& u2, U3& u3) : t(u1, u2) {} template<class U1, class U2, class U3> locked_object(U1& u1, U2& u2, const U3& u3) : t(u1, u2) {} template<class U1, class U2, class U3> locked_object(const U1& u1, const U2& u2, U3& u3) : t(u1, u2) {} template<class U1, class U2, class U3> locked_object(const U1& u1, U2& u2, const U3& u3) : t(u1, u2) {} template<class U1, class U2, class U3> locked_object(U1& u1, const U2& u2, const U3& u3) : t(u1, u2) {} template<class U1, class U2, class U3> locked_object(const U1& u1, const U2& u2, const U3& u3) : t(u1, u2) {} private: typename locked_object_value<T>::type t; mutable Mutex mutex; }; } #endif

1 0