April 2008 - Boost - lists.preview.boost.org

Re: [boost] thoughts on logging library: orthogonal runtime configuration
by brass goowy 09 Apr '08

09 Apr '08

Vicente Botet writes: >Hi Christian, [snip] >> Configuring the above with a compiled library like boost serialization >> is an interesting task as well, that I definitely think should be >> addressed. could be that the flexibility decreases some in such a >> scenario, or it could be configued in site-config.jam or whatever. > >Once the serialization library provide traces or log, if you want to use the >serialization library with logs you should add a define at compile time >e.g. -DBOOST_SERIALIZATION_LOG_ENABLE and link with the serialization logged >variant e.g. -lboost_lserialization. > This is a good example of the need for compilers that output the code they generate based on templates. If they did that, the library writer could have an online service that spits out the final deliverable rather than users having to maintain different versions of a library. It is a slow and error prone process to rebuild a library/application as suggested here. Alternatively, service providers would have logging versions of their code available for users in the field, in effect eliminating the long and unproductive process of a rebuild. Because the code is built by the service provider rather than less experienced users, configuration confusion is mitigated. As the needs here are pressing, we hope the problems with the status quo will be addressed sooner than later. Brian Wood Ebenezer Enterprises www.webEbenezer.net

3 2

[Boost][graph] Planar test file corruption problem?
by K. Noel Belcourt 09 Apr '08

09 Apr '08

Hi, I'm on an Intel Mac running Tiger 10.4.11 and find that subversion is having a problem with libs/graph/test/planar_input_graphs/ planar_K_3_3_sub_4_p7.dimacs. > ./libs/graph/test/planar_input_graphs/planar_K_3_3␀忀翿 > ␀_4_p7.dimacs This file seems to update okay on my other systems, could it be some problem with the subversion client on the Mac? -- Noel On Apr 1, 2008, at 9:19 PM, K. Noel Belcourt wrote: > s896822:~/boost kbelco$ svn up > ... > ./libs/graph/test/planar_input_graphs/planar_K_3_3_sub_4_p4.dimacs > ./libs/graph/test/planar_input_graphs/planar_K_3_3_sub_4_p5.dimacs > ./libs/graph/test/planar_input_graphs/planar_K_3_3_sub_4_p6.dimacs > ./libs/graph/test/planar_input_graphs/planar_K_3_3␀忀翿 > ␀_4_p7.dimacs > ./libs/graph/test/planar_input_graphs/planar_K_3_3_sub_4_p8.dimacs > ./libs/graph/test/planar_input_graphs/planar_K_3_3_sub_4_p9.dimacs

1 0

Release notes
by Vladimir Prus 09 Apr '08

09 Apr '08

I think it would be rather good to keep a 'release notes' document that is updated as new changes are done, merged to release branch during release process, and then becomes part of new release. Am I right that we don't have such a document right now, or I'm missing something? - Volodya

3 2

Updating getting started?
by Vladimir Prus 09 Apr '08

09 Apr '08

I'm looking into updating getting started a bit, but is stuck before even beginning: 1. Looking at boost.org, I don't actually see any link to "Getting Started". Have I missed it? 2. I don't see getting started in checkout of https://svn.boost.org/svn/boost/website/public_html/beta I presume it still lives in more/getting_started.html. Ok, good. If I change it, will the changed version appear either boost.org, or beta.boost.org ? - Volodya

3 6

[review][proto]suggest doc debug & category guided design
by Larry Evans 09 Apr '08

09 Apr '08

It's all in the attachment. I had several other topics I wanted to explore; however, this will have to do for now. NOTE: The following is based on a download on 2007-02-17 of proto.zip from boost vault. * What is your evaluation of the design? Fair. One problem is the "mixing" of grammars with transforms. As stated here: <boost-root>/libs/proto/doc/html/boost_proto/users_guide/expression_transformation/canned_transforms/pass_through.html all expression generator meta-functions (For example, posit<>, shift_right<>, function<>, nary_expr<>, etc.) have a pass-through transform by default. which means that when, for example, matches<posit<_>,Expr> is compiled, the associated pass-through transform is not used. If it's not used in matches, then it should be eliminated. Of course it is used when the transform is applied; however, a transform template class taking a grammar as argument (the proto::when template seems appropriate) should be used to do that. This would make it clearer what the programmer's intention is. That means another template instantiation, thus slowing compile times; however, I think the time saved in understanding the code would compensate for that. Of course that's a judgment call. This "unused transform" feature is especially obvious with and_. Only the last transform (call it Xn) associated with the list of and_ args can ever be used. If transforms were eliminated from the and_ args and and_ was only used for matches, then: when<and_<G1,...,Gn>,Xn> could be used with the same effect as and_ with transforms associated with the args. Here, when is more obviously a transform, Tn,enabled by condition and_<G1,...,Gn>. Hm..., but that "looks" (based on what if means in c++) more like proto::if_, however I've never used proto::if_ and haven't read proto::if_ docs; hence, maybe that conclusion is all wrong. I have read somewhere that proto::if_'s 1st argument is a transform, which seems odd when the if_ name would suggest it's a grammar with a noop (unused) transform. What about proto::or_<T0,T1,...,Tn>? If the T0,T1,...,Tn were changed to "pure" grammars, G0,G1,...,Gn, then how would the *very* useful examples of transforms such as CalcArity in: <boost-root>/libs/proto/doc/html/boost_proto/users_guide/expression_transformation/example__calculator_arity_transform.html be done? Well, as explained in the in-source comments to proto::switch_ in matches.hpp, proto::switch_<Cases> could be used instead. OOPS, looking at switch_ shows it contains: template<typename This, typename Expr, typename State, typename Visitor> struct result<This(Expr, State, Visitor)> { typedef typename Cases::template case_<typename Expr::proto_tag> which; typedef typename which::template result<void(Expr, State, Visitor)>::type type; }; and, along with the example in code in /libs/proto/test/matches.cpp, shows that the only test is on the tag of the grammar and not the children. So.. maybe switch_ should be renamed to switch_tag and a new template, switch_gram, which does what the current or_ does except the template argument's are instances of a new template, proto::case_, where proto::case_ is like the current proto::when except: 1) The first arguments don't have to have a transform associated with them. 2) There's a default 2nd argument to proto::case_ which is identity_t (identity transform, which is the same as the transform part of the current proto::terminal): struct identity_t { template<typename Sig> struct result; template<typename This, typename Expr, typename State, typename Visitor> struct result<This(Expr, State, Visitor)> { typedef Expr type; }; template<typename Expr, typename State, typename Visitor> Expr const &operator ()(Expr const &expr, State const &, Visitor &) const { return expr; } } So, with these additional templates, the CalcArity might be: struct CalcArity : switch_gram< case_< terminal_g< placeholder1 >, mpl::int_<1>() > , case_< terminal_g< placeholder2 >, mpl::int_<2>() > , case_< terminal_g<_>, mpl::int_<0>() > , case_< unary_expr_g<_, CalcArity>, CalcArity(_arg) > , case_< binary_expr_g<_, CalcArity, CalcArity>, mpl::max<CalcArity(_left), CalcArity(_right)>() > > {}; where: XXX_g, for XXX={terminal,unary_expr,binary_expr}, is the "grammar part" of the current XXX template. However, even here there's a sortof mixture of grammar and transform. The "source" grammar of the transform is the one that appeared earlier on the example__calculator_arity_transform.html page (here, renamed CalcGram and with XXX->XXX_g [see where: paragraph under CalcArity above]): struct CalcGram : or_< terminal_g< placeholder1 > , terminal_g< placeholder2 > , terminal_g< _ > , unary_expr_g< _, CalcGram > , binary_expr_g< _, CalcGram, CalcGram > > {}; In order to completely separate the grammar from the transforms, something like an algebraic homomorphism: http://planetmath.org/encyclopedia/HomomorphismBetweenAlgebraicSystems.html is needed. Each function name, w_A, in source algebra in that reference would correspond to some grammar, G_w, in the or_: or_<G1,G2,...,Gn> The bad thing about that is that the function names would be sorta a duplication of the grammars, I think (I haven't thought it thru really). The only way I can be more certain of this is to try and implement it; however, I'm already way late in doing this review, so, that suggestion about complete separation of grammar from transform is just *highly* speculative. * What is your evaluation of the implementation? Not done. * What is your evaluation of the documentation? Good. However: 1) Some transform template's are barely documented or not documented (except in-source) at all (e.g. switch_). There really needs a full toc like the mpl one here: http://www.boost.org/libs/mpl/doc/refmanual/refmanual_toc.html I almost always go there when I want to figure out what mpl templates do. 2) Some transform documents are verify formally documented. IOW, they have almost a set of rules for guiding the reader, step-by-step, into how the transforms work. Each step in the process is described by a table in documentation of the outermost template. These tables have the before expression in the 1st column and the step's resulting expression in the 2nd column. This is very good. I used it to help me understand parts of proto. However, manual execution of rules on a given expression is hard because the user has to keep track in his mind the intermediates steps, and that's a lot of mental bookkeeping. It would be very helpful if there was a "proto-debugger" which, given an source expression, executes each of these steps (noting which table is being executed) and shows the correspondence between names in the "rules tables" with names in the source expression or intermediate expression, and finally stops when the expression cannot be reduced further. Maybe even proto could be used to do this. A sorta "self-aware" proto ;) This ability to take an expression and simply it using a set of rules would have uses in other domains, as shown by Task 3 in Markus' post: http://lists.boost.org/Archives/boost/2008/03/134376.php There's a prototype of doing something similar (although no association is shown between rules and tables) for language grammar analysis in the vault: http://www.boost-consulting.com/vault/index.php?&directory=Strings%20-%20Te… It just uses proto::eval to go through the steps until not further change is possible. 2) There needs to be a more detailed description of how the 1st argument, the expression argument, of proto::matches "relates" to the 2nd argument, the grammar argument. The description here: <boost-root>/libs/proto/doc/html/boost/proto/result_of/matches.html only uses "expression grammars" but makes no mention of proto meta-functions for generating expressions: <boost-root>/libs/proto/doc/html/boost_proto/users_guide /expression_construction/tags_and_meta_functions.html Judging from the example of using a terminal grammar, terminal<X>, to generate an expression by appending ::type: terminal<X>::type I jumped to the rash conclusion that a similar technique would work for binary_expr<Tag,L,R>. IOW, an expression could be generated by: binary_expr<Tag,L,R>::type However, this is only true if L and R are already expression. This rash conclusion lead to a time consuming "debugging of my thinking" as evidenced by the thread: http://lists.boost.org/Archives/boost/2008/03/133715.php Instead, the ::type appending must be propagated to all sub grammar expressions, as done by the morphism template attached to: http://lists.boost.org/Archives/boost/2008/03/134964.php Avoiding the rash conclusion mentioned above would probably be easier if proto grammars were prominently classified on some page into the following grammar subtypes: 1) expression grammars: These are the grammars appearing in the matches.html page mentioned above. These also are expression types; hence, the can also be used as the first argument to matches. In contrast to the meta-function grammars [2) below], for any expression grammar, E, the following expression fails to compile: E::type (Digression to design review: This "schizophrenic" feature of expression grammars makes understanding match harder in a similar way that untyped variables in an interpreted language makes understanding that code's functions harder. If there were an as_gram<ExprType> meta-function which returned the corresponding meta-function grammar generator, and only meta-function and predicate grammars [see below] were allowed as the 2nd argument to matches, then this would ease understanding and probably debugging [since, hopefully, deciphering compiler error messages would be easier]. Alternately, there could be an is_gram<ExprType> that when used in some kinda debug mode, diagnosed, with clearer error messages than the compilers, that ExprType was not a valid grammar. This is_gram could implemented using the boost concept checking library, AFAICT. ) 2) meta-function grammar: These (except for the nullary ones) appear in the last column of the table on: <boost-root>/libs/proto/doc/html/boost_proto/users_guide /expression_construction/tags_and_meta_functions.html As the name, meta-function, implies, they all have a nested ::type which returns the corresponding expression type [a.k.a. expression grammar, see 1) immediately above]. These are classified as nullary and non-nullary depending on the number of "sub-grammars": nullary) These are the ones formed by the proto::op::terminal template. They have no sub-grammars. non-nullary) These have an associated number (the arity) defining the number of sub-grammars. Each non-nullary template also is associated with its own c++ operator. The arity of the grammars is the same as the arity of the associated c++ operator. definition: meta-function grammar instance: basis-step) A nullary meta-function grammar is an meta-function grammar instance. induction-step) If O is a non-nullary meta-function grammar template with arity, N, and O1_inst,O2_inst, ... ,ON_inst are all meta-function grammar instances, then O<O1_inst,O2_inst, ... ,ON_inst> is an meta-function grammar instance. 3) predicate grammar: These are grammars with no corresponding c++ operators. In contrast to meta-function grammars, for any predicate grammar, B, the following expressions fail to compile: B::type tag_of<B>::type One reason for this is because there maybe be more than one type of proto expression that matches a given predicate grammar. For example, either an expression matching T0 or one matching T1 matches or_<T0,T1>. There one special case of a predicate grammar, the wild-card predicate: proto::wildcardns_::_ which matches any proto expression. This is analogous to a Boolean predicate always returning true no matter what the argument. Other important predicate grammars (in proto::control namespace) are not_, and_ and or_. AFAICT, just like any predicate logic expression can be constructed using: true not and or the equivalent of all other predicate grammars, such as: if_ can be constructed using just these four: _ not_ and_ or_ * What is your evaluation of the potential usefulness of the library? Very. * Did you try to use the library? With what compiler? Did you have any problems? Yes: http://www.boost-consulting.com/vault/index.php?&directory=Strings%20-%20Te… &filename=cfg_lookahead_extends.zip &filename=toy_attract.pair.zip * How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? In-depth, although till have a long way to go. * Are you knowledgeable about the problem domain? Somewhat; however, I'm obviously unfamiliar with the specific problems proto was designed to solve. For example, I was unaware of some of proto viewpoints expressed by Eric in the last 2 paragraphs of this post: http://lists.boost.org/Archives/boost/2008/03/134959.php * Do you think the library should be accepted as a Boost library? Be sure to say this explicitly so that your other comments don't obscure your overall opinion. Eventually, but not yet. There needs to be more documentation debugging and also more exploration of alternative designs, in particular, designs guided by algebraic morphisms and category theory. One justification for this exploration is the morphism template in attachment to: http://lists.boost.org/Archives/boost/2008/03/134964.php Although that post observed that that morphism template: is correct in the limited case of those dual-purpose grammars-and-metafunctions. that doesn't mean it couldn't be extended to handle more general cases. In particular, in the case of expression grammars, I'd think the morphism template in the attachment could just be specialized to be an identity morphism: template < class Tag , class Args , int Arity > struct morphism < expr<Tag,Args,Arity> > { typedef expr<Tag,Args,Arity> type; }; Further specialization designed to error when given a predicate grammar would, AFAICT, correctly calculate from either a meta-function grammar or an expression grammar the matching expression type. Category theory *might* be used to guide the predicate grammar design, as suggested (very indirectly) by parts of: http://www.amazon.com/Algebraic-Approaches-Semantics-Monographs-Computer/dp… For Section 3.3, "The Boolean Algebra of Guards", contains: Pascal allows a statement of the form: if x>0 and not x=5 then S_1 else S_2 If S_1,S_2 are to be semantically interpreted as morphisms X->Y in a category _C_, how can "P and not Q" be interpreted, where P is "x>0" and Q is "x=5"? ... Equivalently, they [i.s. P and Q] may be represented as guard functions as in 1.5.20. ... for an object X in a partially additive category _C_, there is a subset, Guard(X) of _C_(X,X) of "guard morphisms" which form a Boolean algebra. On the same page where 1.5.20 mentioned in the above quote appears, there's: 22 Definition. let (p1,...,pn) be an n-way test on X and let f1,...,fn be in SC(X,Y). Then a natural generalization of the case statement in Pascal is: case(p1,...,pn)of(f1,...,fn)=f1 p1+...+fn pn where the p's correspond to the lhs of the when's in an or_ with elements decorated with transforms and the f's correspond to the transforms on rhs of the corresponding when's. In conclusion, the somewhat vague similarities, noted above, of proto with algebraic morphisms and, more generally, with category theory strongly suggests (to me at least) there could be a large benefit to trying to make these similarities more concrete and using that knowledge to improve proto's design.

3 3

future: Where can I find the code
by Johan Torp 09 Apr '08

09 Apr '08

Where can I find the latest code for the future proposal? http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2276.html Johan -- View this message in context: http://www.nabble.com/future%3A-Where-can-I-find-the-code-tp16587203p165872… Sent from the Boost - Dev mailing list archive at Nabble.com.

3 3

Trac open bugs - by assignee
by Marshall Clow 09 Apr '08

09 Apr '08

[ 283 open bugs today, 276 yesterday ] 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> Bug summary 28 grafik 25 djowel 24 az_sw_dude 15 vladimir_prus 14 dave 14 bemandawes 13 dgregor 12 doug_gregor 11 no-maintainer 11 agurtovoy 9 jsiek 9 anthonyw 7 turkanis 7 nesotto 7 johnmaddock 6 ramey 6 matias 5 witt 5 rogeeff 5 igaztanaga 5 None 4 ebf 4 danielw 3 pdimov 3 pavol_droba 3 nasonov 3 kaalus 3 danieljames 2 troyer 2 shammah 2 samuel_krempp 2 jmaurer 2 hkaiser 2 aaron_windsor 1 urzuga 1 t_schwinger 1 speedsnail 1 marshall 1 garcia 1 fcacciola 1 eric_niebler 1 dlwalker 1 chris_kohlhoff 1 <Blank> <Blank> 1750 Autolink library name not in sync with actually build lib None 1644 Boost.Test missing documentation file BOOST_CHECK_CLOSE_FRACTION.html None 1736 Headers containing non ASCII characters cause MS VC to issue warning 4819 in some locales None 1744 No information on building static libraries with bjam under Windows None 1763 wrong AST when parser_tag==0 None 1799 Boost.Test docs missing reference pages aaron_windsor 1622 Adjacency list needs to handle self-edges correctly aaron_windsor 778 top-level configure is broken agurtovoy 1001 gcc 4.1.2 segfaults on mpl/test/apply.cpp agurtovoy 1051 MPL header ordering triggers bug agurtovoy 1099 unable to iterate through a "non-explicitly-declared" mpl::set agurtovoy 1215 Boost 1.34.1_ mpl: Wrong workaround detection using MinGW32 (or.hpp_ line #33) agurtovoy 1317 has_xxx randomly broken in msvc agurtovoy 1469 [mpl] nested typedef of set has two different meanings agurtovoy 1476 always<> is not nullary. agurtovoy 1528 g++ 4.3.0 reports error because of redeclaration of next agurtovoy 1549 Boost.MPL: 'index_of' algorithm is not documented agurtovoy 1568 duplicate include guards agurtovoy 588 mpl::remove compile error with gcc 4.1.0 anthonyw 1154 tss destruction segfaults in conjunction with dlopen/dlclose anthonyw 1168 [thread] tss crashes randomly anthonyw 1268 xtime_cmp changes to deal with overflow were reverted anthonyw 1470 Boost.Thread: Compilation errors with non-__cdecl calling convention anthonyw 1657 Bug in boost::threads sample anthonyw 1713 no definitions for copy ctor and assignment operator for basic_condition_variable anthonyw 1780 Boost 1.35.0 on linux missing thread_start and get_current_thread_state anthonyw 876 xtime documentation incomplete anthonyw 881 errors when build with Apache stdcxx az_sw_dude 1028 typo in boost header: date_time/time_defs.hpp az_sw_dude 1078 from_iso_string cannot read the output from to_iso_string az_sw_dude 1098 Urgent libboost-date-time1.33.1 : bugs on ia64 ? az_sw_dude 1147 date_time library contains global #define ERROR az_sw_dude 1160 warning: month_format shadows a member of this az_sw_dude 1162 warning: ticks shadows a member of this az_sw_dude 1289 posix_time::time_facet forgets to pass a_ref argument to base class az_sw_dude 1299 change in typedef stringstream_type in format_date_parser.hpp causing compilation error az_sw_dude 1306 invalid docbook in date_period.xml az_sw_dude 1384 Linking problem with date_time library on Visual C++ 2008 Express az_sw_dude 1386 date_time documentation Jamfile breaks building of boost docs az_sw_dude 1524 format_date_parser.hpp(221) : cannot convert parameter 1 az_sw_dude 1574 operator<< for boost::posix_time::ptime ignores ostream flags az_sw_dude 1674 date_time::date_formatting.hpp: incorrectly formats year using global locale az_sw_dude 1695 add correct namespace to class to fix compilation bug az_sw_dude 1726 boost/date_time/posix_time/time_formatters.hpp incorrectly formats fractional seconds using global locale az_sw_dude 1740 date_time includes <windows.h> az_sw_dude 1788 local_time::local_time_period streaming operators not implemented az_sw_dude 287 wrong usage of ios_base::narrow az_sw_dude 316 date_time type conversion warning az_sw_dude 604 from_ftime incorrectly processes FILETIME filled with zeros az_sw_dude 642 operator<< for gregorian::date_duration not found az_sw_dude 889 Insane Dependencies az_sw_dude 890 date_time library supports only the current dst rule bemandawes 1378 filesystem path invalid name for hidden files (LINUX) bemandawes 1389 filesystem::ostream << boost::format generates operator ambigious error (in MSVC++) bemandawes 1458 Darwin Tiger throws std::runtime_error: locale::facet::_S_create_c_locale name not valid bemandawes 1578 bug in readdir_r_simulator() in a multi-threaded environment bemandawes 1583 Serious flaw in boost::filesystem filename handling (opensuse) bemandawes 1589 [filesystem] 'mbstate_t' : is not a member of 'std' bemandawes 1606 filesystem/src/exception.cpp doesn't build with gcc bemandawes 1613 Link Errors against file_system on OS X with Intel Version 10.1 C++ compilers bemandawes 1682 path_traits needs imbue() bemandawes 1701 boost::filesystem::remove_all - segmentation fault with wpath on Linux bemandawes 1711 Boost Serialization export facility broken on gcc 4.1_ 4.2 bemandawes 1767 missing file: boost/filesystem/cerrno.hpp bemandawes 1768 system: error_code.cpp #defines macros without checking whether already defined bemandawes 752 directory_iterator doesn't work with catch chris_kohlhoff 1703 [asio] Compiler warnings on VC8/9 + warning level 4 danieljames 1554 When BOOST_HASH_NO_EXTENSIONS is defined hash doesn't support new string types. danieljames 1555 When BOOST_HASH_NO_EXTENSIONS is defined hash doesn't support boost::system::error_code danieljames 1705 [boostbook] Spaces in reference file names for types like 'long long' danielw 1044 Argument pack inaccessable in a functions return type danielw 1054 Parameter takes an "infinite" amount of time to compile with the Intel compiler. danielw 1097 keyword.hpp generates many warnings C4180: qualifier applied to function type has no meaning; ignored danielw 1784 [parameter] missing include dave 1010 linking boost.python on freebsd dave 1019 iterator_facade::pointer should be the return type of operator-> (DR 445) dave 1085 Python rules for compiling in Mac OS X dave 1179 [boost.python] can not export a union in VC2005sp1 dave 1181 [boost.python] can modify enum value dave 1387 Review / update docs to reflect changes dave 1460 Python classes with multiple bases are convertible only to the first class in the lists dave 1482 boost::python::throw_error_already_set should be marked noreturn dave 1516 [python] Failing VC9 regression tests dave 1599 [python] '_set_se_translator': identifier not found dave 1697 [utility][noncopyable] ADL barrier broken by msvc-9.0 dave 1730 No debug libs on Windows by default dave 865 Use of C++0x keyword as identifier dave 910 gcc strict-aliasing problems with python dgregor 1009 Improper overflow handling in shortest paths algorithms dgregor 1164 Floyd Warshall broken with unsigned edge weights dgregor 1192 [boostbook] problem when two files have the same name dgregor 1199 configure doesn't work with path containing whitespaces (MacOS X) dgregor 1310 [result_of] const-qualified function pointer doesn't work dgregor 1326 Unable to check graph isomorphism using LEDA adapter dgregor 1391 dominator_tree_test on Borland/CodeGear outputs overly long line dgregor 1395 Write Tests for Python Bindings dgregor 1630 gcc-4.3: adjacency_list.hpp includes deprecated header dgregor 1680 long long and wchar_t support in MPI dgregor 556 Bundled graph properties dgregor 732 Johnson All-Pairs needs better "no path" information dgregor 736 Const correctness violation djowel 1170 Emit Warnings instead of # symbols in the syntax highlighter djowel 1171 Quickbook title output djowel 1172 non-utf djowel 1176 Space after inline code djowel 1206 Escaping from within code? djowel 1273 CR+LF newlines in position_iterator djowel 1276 spirit problem with _GLIBCXX_DEBUG djowel 1277 Closing section like [pre with } causes Quickbok to crash djowel 1280 sections in imported source files get put inside <para> elements in docbook output djowel 1281 Quickbook produces invalid BoostBook/DocBook XML djowel 1324 tuple should have a swap() that operates element-by-element djowel 1396 wrong result_of invocation around transform_view djowel 1436 [quickbook] inline code inside headings djowel 1484 Quickbook produces illegal docbook for some docinfo fields. djowel 1500 [Spirit/Phoenix] C4512 Compiler warnings from VC8 djowel 1570 Some boost headers aren't ready for gcc 4.3 djowel 1600 duplicate include guard djowel 1601 distane of boost::tuple djowel 1607 Tuple Library Documentation Changes djowel 1610 [MSVC/STLport] [tree/common.hpp] Standard library requirements violation(incomplete type as vector parameter) djowel 1614 vector workaround needed for MSVC9 djowel 1617 spirit gcc-4.3 fix djowel 1619 [Fusion] C4512 warnings from VC9 (Visual Studio 2008) djowel 1722 [TR1/Fusion] Conflict between TR1 and Fusion headers djowel 1764 wrong AST when parser_tag==0 dlwalker 613 boost/crc.hpp uses non-standard conforming syntax doug_gregor 1021 [Graph][reverse_graph] Problem using reverse_graph adapter with an adapted user defined graph doug_gregor 1076 compile error: disconnecting struct with operator()() doesn't work in VS2005 SP1 doug_gregor 375 LEDA graph adaptors do not handle hidden nodes properly doug_gregor 402 random_vertex/random_edge are unnecessarily inefficient doug_gregor 403 Document copy_component doug_gregor 447 reverse_graph and constness of property maps doug_gregor 708 Dijkstra no_init version should not require VertexListGraph doug_gregor 733 Numbered headers don't work with "preferred" syntax doug_gregor 735 Fruchterman-Reingold grid performance can be improved doug_gregor 738 Memory leaks with signal::connect? doug_gregor 829 Implicit graph not implement doug_gregor 852 Problem with Boost and GCC 4.1 ebf 1507 [variant] C4512 warnings from VC8.0 ebf 1548 [variant][docs]typo: formal arg_ operand_ should be v in times_two arglist ebf 1654 recursive variants do not handle nested variants correctly. ebf 993 Variant should use least common multiple of alignments_ rather than maximum eric_niebler 1796 compile error when SDL_syswm.h (from sdl library) is included before foreach.hpp fcacciola 1666 Visualizer for boost::optional garcia 1581 Boost.MultiArray: Resizing bug if the index is not 0-based grafik 1041 Cygwin requires PATH setting. grafik 1322 trac rejects patch attachment as spam grafik 1417 Regresson tests hang in Darwin (Tiger) grafik 1430 Regression fails under Cygwin grafik 1433 Trac's spam detection rejects too many valid messages grafik 1512 Broken link to vacpp in bjam docs. grafik 1513 Broken link to bcpp in bjam docs. grafik 1576 cannot read non-ASCII output messages grafik 1577 Some commands don't work because hStdInput == 0 grafik 1663 build.bat cannot set/reset ERRORLEVEL grafik 1731 Website 'bugs' grafik 1733 Website layout overlays on IE7 grafik 1735 [website] Wrong HTML on main documentation page. grafik 1738 Boost Jam details and download link grafik 1739 Search box and Google link grafik 1741 Review schedule out of date grafik 1742 Some bugs in http://www.boost.org/doc/libs/1_35_0 grafik 1743 Documentation has incorrect Build & Link settings for some libraries grafik 1753 Python docs: bad link to the Jamroot grafik 1769 Broken links in documentation index. grafik 1771 Statechart TOC mangled. grafik 1775 website bugs for 1.35.0 docs grafik 1776 Documentation page renders incorrectly in Safari 3.1 on OS X grafik 1779 Whos using boost link broken grafik 1783 No link to wiki grafik 616 Boost Jam_ and non english directorys grafik 959 linking fails when Boost is compiled with STLport 5.1.* on Linux (names mismatch) grafik 986 Problem building Python modules on boost 1.34.0 hkaiser 1079 boost-1.34.0 fails to compile. concept checks not satisfied. hkaiser 1670 wave almost unusably slow on real-world input igaztanaga 1080 boost::interprocess win32 global file mapping issue igaztanaga 1210 interprocess::barrier hangs during second use under linux (boost 1.33.1) igaztanaga 1390 Interpocess: managed shared memory failing completely under OS X igaztanaga 1634 boost::interprocess::vector cannot contain volatile int igaztanaga 1635 Incomplete include guard in boost/intrusive jmaurer 351 Diff in state of mersenne_twister gen between GCC3.41 & CW9 jmaurer 599 uniform_01 copies engine instead of using a reference johnmaddock 1081 Empty string rejected as perl-style regex johnmaddock 1411 Fix BOOST_PARTIAL_SPECIALIZATION_EXPLICT_ARGS johnmaddock 1446 POSIX API doesn't use C locale johnmaddock 1451 error: use of C99 long long integer constant johnmaddock 1765 Need a macro to determine whether basic streams are present johnmaddock 1790 [TR1] Test failures with VC9 + MS TR1 johnmaddock 1797 function_traits documentation errors jsiek 1531 segfault in dynamic_bitset::reference assign operator jsiek 1540 Poisson distribution very slow for large mean (and may also overflow). jsiek 1755 Boost.tokenizer is broken for wide characters - patch attached jsiek 1798 met an error using boost::tokenizer in multi-times in vs2005_ unicode jsiek 575 Calling subgraph::global_to_local on a root graph jsiek 636 strange compiling problem for transitive_closure jsiek 815 remove_edge core dumps on self-circle jsiek 875 No iterator based constructor for adjacency_matrix jsiek 900 graphml reader namespace handling is broken kaalus 1184 property_tree assignment (operator) bug kaalus 1604 property_tree xml parser doesn't compile with gcc kaalus 1678 Boost.property_tree::read_xml does not parse UNICODE file with BOMs marshall 1252 [pool] severe overhead with unaligned sizes. matias 1406 Understanding the Tables outdated matias 1651 incorrect typedefs in examples matias 1676 Dead links on Boost.Test example documentation. matias 1707 small typos in Boost.serialization documentation matias 1727 Sample code in documentation does not compile_ has namespace errors. matias 1794 Typo in RegEx Documentation nasonov 1220 lexical_cast requires RTTI nasonov 1704 [any] 4512 warning from VC8/9 on warning level 4 nasonov 754 boost::any - typeid comparison across shared boundaries nesotto 1629 range/iterator_range.hpp bug nesotto 1675 [range] VC8 - compiler warnings when including range/array headers nesotto 1694 NDEBUG vs. BOOST_ASSERT in iterator_range.hpp nesotto 1748 [ptr_container] compiler warnings from VC9 nesotto 1754 Illegal HTML in range docs. nesotto 1785 assign::list_of works poorly with class constructors nesotto 1795 [ptr_container] minor documentation typo no-maintainer 1068 Mersenne twister disables streaming for Visual C++ no-maintainer 1222 lambda::ret<T> should declare result_type. no-maintainer 1270 uniform_smallint doesn't compile with lagged_fibonacci random number generators no-maintainer 1515 [lambda] C4512 warnings from VC8.0 no-maintainer 1544 uniform_01 w/ref template param causes ref to ref error no-maintainer 1546 Method boost::random::uniform_int::operator()(engine_ value) is missing no-maintainer 1572 [lambda] smart pointer const-ness affects its contents no-maintainer 1632 Default Interval rounding policies incomplete no-maintainer 1691 [Random] Brokem MSVC workaround no-maintainer 781 Lambda: (_1 + "y")(string("x")) Doesn't Compile no-maintainer 819 uniform_int<> with type's maximum availaible range error pavol_droba 1152 rle_example fails pavol_droba 1385 begin must be boost-qualified pavol_droba 1761 StringAlgo: Error in an example pdimov 1106 shared_ptr<T> should not convert to shared_ptr<U> when T* doesn't convert to U* pdimov 1719 [addressof] Can't obtain the address of an instance of an anonymous struct pdimov 1762 BOOST_DISABLE_THREADS should imply BOOST_SP_DISABLE_THREADS ramey 1285 [serialization] problem when including shared_ptr_132.hpp ramey 1708 Can't serialize class with private destructor ramey 1734 BOOST_STATIC_WARNING can't be passed a dependent expression ramey 1747 [serialization] unreferenced formal parameter warnings from VC9 ramey 1773 VC8 compiler bug makes boost spill types into global namespace_ which breaks IntelTBB ramey 1782 missing include in boost/serialization/utility.hpp rogeeff 1383 signal.h features not found on Mac OS rogeeff 1542 [test] compiler errors when building with stdcxx library rogeeff 1723 No subprocess can be started in init_unit_test_suite rogeeff 1746 Online documentation for 1.35.0 is out of date for current lib version rogeeff 1781 Empty page in Test documentation samuel_krempp 1699 Compile warning about initialization order. samuel_krempp 859 boost::format ignores a user defined locale shammah 290 perfomance: memory cleanup for pool takes too long shammah 386 boost::pool_allocator breaks with vector of vectors speedsnail 1138 Problems with TSS and static thread library t_schwinger 1653 wave executable erroneously required for build of function_types lib troyer 1774 serialization: file written with 1.34.1 can't be read in with 1.35 troyer 1778 Possible regression in 1.35 serialization of 2D arrays turkanis 1523 [iostreams] VC8/VC9 compiler warnings turkanis 1545 [boost/rational.hpp] 'noskipws' is not a member of 'std' turkanis 1579 gzip compressor should model DualUseFilter turkanis 1580 Add static assert to prohibit instantiating a chain with mode dual_use turkanis 1649 Fix definition of JavaScript menu to avoid long chains of functions turkanis 1656 Consider implementing flush() for symmetric filters turkanis 1671 type mismatch of buffer size parameter causes overload resolution to fail urzuga 574 [boost::lambda] Compile error with libstdc++ debug mode vladimir_prus 1132 program_options documentation error. vladimir_prus 1165 more quoting problems vladimir_prus 1274 Useless error message vladimir_prus 1321 invalid docbook in tool documentation vladimir_prus 1527 [program_options] Second (and subsequent) lines in tabbed text not aligned correctly vladimir_prus 1530 Program options documentation - Overview - Syntactic Information example typo vladimir_prus 1537 no value given in 'mysql_password =' vladimir_prus 1584 cryptic bbv2 error building quickbook vladimir_prus 1587 [program_options] crashes if value part missing in external configuration file vladimir_prus 1588 [program_options] crashes if value part missing in external configuration file vladimir_prus 1645 Invalid unicode support for default_value vladimir_prus 1679 added 4-way universal binary support from mac osx (ppc_ ppc64_ i386_ x86_64) vladimir_prus 469 multitoken broken vladimir_prus 689 [program_options] Endless loop with long default arguments vladimir_prus 850 program_options strips off escaped quotes in some situations witt 1046 Boost.Python quickstart instructions mention nonexistent target witt 583 Fixes for build on IBM pSeries for AIX and Linux witt 834 Homepage regression links witt 957 The "Getting Started" page does not mention the stdlib option witt 973 zip_iterator has value_type == reference -- -- 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

Properties within planar graph face traversal visitor
by Vicen 09 Apr '08

09 Apr '08

Hello, I'm using the recent planar utilities of the boost graph library. The planarity test works quite well and now I'm wondering what would be the most elegant way for accessing to bundled edge properties within a planar_face_traversal_visitor. As far as I can see, contrary to the other visitors (BFS, DFS, etc) only the vertex or the edge (not the graph) are arguments in the next_vertex or next_edge event points... thanks, Vicen

2 1

[1.36.0] High priority compilers for this release?
by Beman Dawes 09 Apr '08

09 Apr '08

Changes I'd like to see include: * Add Microsoft VC++ 9.0. This is now the most current version. * Drop Microsoft VC++ 7.1. Supporting two versions (9.0 and 8.0) is about all we can afford. * Drop the Intel compiler on Windows. Not enough people seem to care about this compiler/platform. Other suggestions? In proposing additions, please remember that each added compiler costs us resources such as developer's time, and that our regression report processing system is easy to overload. Also, we won't accept a new platform unless someone is willing to run *daily* regression tests for it. --Beman

20 34

[coroutine] Where is the last implementation?
by vicente.botet 09 Apr '08

09 Apr '08

Hello Giovanni, I have read the documentation of the Boost.Corutine library you have done for the SOC 06. Impressive Job. I would like to start to ussing it, and I would like to know where I can download the last implementation. I have found it on the Vault and on the Sandbox. Which is the current state? Do you plan to submit the library for review soon? Best regards _____________________ Vicente Juan Botet Escriba

2 1