- Boost - lists.preview.boost.org

big_integer cln and gmp
by Joel Young 14 May '04

14 May '04

Feature Request: Can support for alternate numerics packages be specified in the type declaration for big_integer rather then with a macro? I'd like to be able to have multiple implementations declared in the same program. Joel

2 2

[Boost-bugs] [ boost-Bugs-953876 ] Bug in build via MSVC Solution
by SourceForge.net 14 May '04

14 May '04

Bugs item #953876, was opened at 2004-05-14 15:03 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=953876&group_i… Category: test Group: None Status: Open Resolution: None Priority: 5 Submitted By: sdanil (sdanil) Assigned to: Beman Dawes (beman_dawes) Summary: Bug in build via MSVC Solution Initial Comment: When build via %boost%\libs\test\build\msvc71_proj\boost_test_library.sln uniX_test_framework.lib is created. ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=953876&group_i… ------------------------------------------------------- This SF.Net email is sponsored by: SourceForge.net Broadband Sign-up now for SourceForge Broadband and get the fastest 6.0/768 connection for only $19.95/mo for the first 3 months! http://ads.osdn.com/?ad_id=2562&alloc_id=6184&op=click _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

regex lib bug: failed assertion in perl_matcher
by Benzinger, Ralph 14 May '04

14 May '04

Hello, When searching for regex "(a)(?:b)" with the nosubs flag set, perl_matcher cores with failed assertion "m.subs() > 2" in perl_matcher.hpp, match_results::set_second(). Regards, Ralph

2 1

Regex Documentation Issue (and two pings)
by Stephan T. Lavavej 14 May '04

14 May '04

I was just bitten by an extremely nasty bug, caused in part by my own foolishness, but also by a subtlety of Boost Regex that probably should be documented explicitly. http://boost.org/libs/regex/doc/format_syntax.html gives a list of "The following Perl like expressions" and says that $N "Expands to the text that matched sub-expression N." HOWEVER, Boost Regex is sufficiently general that $10 will match the tenth subexpression, $25 the twenty fifth, and so forth. Perl is not that general - it recognizes only $1 through $9 here. I believed that Boost behaved like Perl. I concatenated "$1" with a random hexadecimal string, occasionally producing "$10", "$15", etc. before the letter hexits appeared. This led to many hours of misery. The documentation should note Boost Regex's generality. The generality is a good thing - $1 can be separated from later digits with empty () parentheses - but it needs to be made clear. Does this also affect the regex standardization proposal? It'd be bad if some implementers thought they only had to support $1 - $9. On an unrelated note, the following issues have not yet been addressed: Lambda Doc Bug, http://lists.boost.org/MailArchives/boost/msg64450.php Boost Array Documentation, http://lists.boost.org/MailArchives/boost/msg64502.php Stephan T. Lavavej http://nuwen.net

2 1

RE: [boost] Lambda/functions
by Roman Yakovenko 14 May '04

14 May '04

>best2=bind(&Node::value2, > bind( &std::vector<Node>::at, //Ask for an element > bind(&Node::children,_1), //Get the vector object > 0 ) //Ask for element zero > ); > > [3]: > function.cpp: In function `int main(int, char**)': > function.cpp:69: no matching function for call to > `bind(<unknown type>, const > > boost::lambda::lambda_functor<boost::lambda::lambda_functor_ba > se<boost::lambda::action<2, > boost::lambda::function_action<2, > boost::lambda::detail::unspecified> >, > boost::tuples::tuple<std::vector<Node, > std::allocator<Node> > Node::*, const > boost::lambda::lambda_functor<boost::lambda::placeholder<1> >, > boost::tuples::null_type, boost::tuples::null_type, > boost::tuples::null_type, boost::tuples::null_type, > boost::tuples::null_type, boost::tuples::null_type, > boost::tuples::null_type, boost::tuples::null_type> > >, int)' > It's simple, compiler can't guess which function "at" you try to bind. See overloading section of lambda documentation. Hint: typedef std::vector<int> ints; typedef ints::const_reference ( ints::*ConstAtFunc ) (ints::size_type) const; Now call bind with ConstAtFunc( at ) as function Roman

2 1

[Boost-bugs] [ boost-Bugs-953818 ] recursive matching for regular expression fails.
by SourceForge.net 14 May '04

14 May '04

Bugs item #953818, was opened at 2004-05-14 01:57 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=953818&group_i… Category: regex Group: None Status: Open Resolution: None Priority: 5 Submitted By: Nobody/Anonymous (nobody) Assigned to: John Maddock (johnmaddock) Summary: recursive matching for regular expression fails. Initial Comment: I am looking for regular expression "http://$[^ ]+$+" in a buffer containing following text http://business.jet2web.at. and it failes in file "perl_matcher_non_recursive.hpp" function match_all_states() { ...... if(state_count > max_state_count) raise_error(traits_inst, REG_ESPACE); } I work with bersion BOOST 1.31 in Visual Studio .NET 2003. My User.hpp is attached. I set following flags of compilation: boost::regbase::flag_type reg_flags = boost::regbase::char_classes | boost::regbase::escape_in_lists | boost::regbase::bk_parens | boost::regbase::intervals; Maya ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=953818&group_i… ------------------------------------------------------- This SF.Net email is sponsored by: SourceForge.net Broadband Sign-up now for SourceForge Broadband and get the fastest 6.0/768 connection for only $19.95/mo for the first 3 months! http://ads.osdn.com/?ad_id=2562&alloc_id=6184&op=click _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

[serialization] function pointers
by Christoph Ludwig 14 May '04

14 May '04

Is it possible with the serialization library to serialize function pointers and pointers to member functions? If it is not directly supported, is there a "best practice" workaround? I didn't find this info in the documentation. BTW: Is the version of the serialization library available at http://www.rrsd.com/boost/ still the most recent or is there a post review version? Thanks Christoph -- http://www.informatik.tu-darmstadt.de/TI/Mitarbeiter/cludwig.html LiDIA: http://www.informatik.tu-darmstadt.de/TI/LiDIA/Welcome.html

1 0

boost][serialization] Adding State to Archives
by Robert Ramey 14 May '04

14 May '04

Martin Ecker wrote: > One way of achieving all this would, of course, be to derive from one of > the existing archive classes and add the required functionality. > However, we don't want to lose the flexibility of being able to write > out data to a binary, text, XML, or any other archive with some other > kind of representation. So basically we're looking for a good way of > inserting an additional layer in between the archives and the actual > serialize functions that can store state variables. > Have you consider making a template which takes the base class as a parameter? Example template <class BaseArchive> class stately_iarchive : public BaseArchive { ... // your overloads here ... // you extra control functions here }; To be used thusly: // can't use typedef because it typedef does like self-reference class stately_binary_archive : public stately_archive<binary_iarchive_impl<stately_binary_archive> { stately_binary_archive(istream &is, flags = 0) : stately_archive<binary_iarchive_impl<stately_binary_archive>(is, flags); }; Now just use stately_binary_archive anywhere you used binary_archive before. Robert Ramey

2 1

[hash container patch]
by Thorsten Ottosen 14 May '04

14 May '04

Some fixes to the implementation. I couldn't find the a newer version of the container. There are still problems with friends. You should use BOOST_DEDUCED_TYPENAME. br Thorsten begin 666 detail_hash_table_new_old_diff.txt M*BHJ(&AA<VA?=&%B;&4N:'!P"49R:2!-87D@,30@,# Z,30Z,S0@,C P- T* M+2TM(&AA<VA?=&%B;&4N;VQD+FAP< E&<FD@36%Y(#$T(# P.C T.C$P(#(P M,#0-"BHJ*BHJ*BHJ*BHJ*BHJ*@T**BHJ(#(R,"PR,C8@*BHJ*@T*(" @(" @ M(" @(')E='5R;B J8F]U;F0[#0H@(" @(" @('T-"B @#0HA(" @(" @('-T M871I8R!C;VYS="!S=&0Z.G-I>F5?="!D969A=6QT7VEN:71I86Q?8G5C:V5T M7V-O=6YT(#T@-3 [#0H@( T*(" -"B @(" @(" @+R\@97%U:79A;&5N="!K M97ES('-P96-I86QI>F%T:6]N#0HM+2T@,C(P+#(R-B M+2TM#0H@(" @(" @ M(" @<F5T=7)N("IB;W5N9#L-"B @(" @(" @?0T*(" -"B$@(" @(" @8V]N M<W0@<W1A=&EC('-T9#HZ<VEZ95]T(&1E9F%U;'1?:6YI=&EA;%]B=6-K971? M8V]U;G0@/2 U,#L-"B @#0H@( T*(" @(" @(" O+R!E<75I=F%L96YT(&ME M>7,@<W!E8VEA;&EZ871I;VX-"BHJ*BHJ*BHJ*BHJ*BHJ*@T**BHJ(#0Y,"PT M.38@*BHJ*@T*(" @(" @(" @(&YO9&4@*FYE>'0[#0H@(" @(" @('T[#0H@ M( T*(2 @(" @("!T>7!E9&5F('1Y<&5N86UE($%L;&]C.CH@0D]/4U1?3D53 M5$5$7U1%35!,051%(')E8FEN9#QN;V1E/CHZ;W1H97(@;F]D95]A;&QO8V%T M;W([#0H@( T*(" @(" @("!N;V1E7V%L;&]C871O<B!A;&QO8SL-"B @#0HM M+2T@-#DP+#0Y-B M+2TM#0H@(" @(" @(" @;F]D92 J;F5X=#L-"B @(" @ M(" @?3L-"B @#0HA(" @(" @('1Y<&5D968@='EP96YA;64(a)06QL;V,Z.G)E M8FEN9#QN;V1E/CHZ;W1H97(@;F]D95]A;&QO8V%T;W([#0H@( T*(" @(" @ M("!N;V1E7V%L;&]C871O<B!A;&QO8SL-"B @#0HJ*BHJ*BHJ*BHJ*BHJ*BH- M"BHJ*B U,#(L-3$W("HJ*BH-"B @#0H@(" @("!P<F]T96-T960Z#0H@( T* M(2 @(" @("!T>7!E9&5F('1Y<&5N86UE($%L;&]C.CH@0D]/4U1?3D535$5$ M7U1%35!,051%(')E8FEN9#QN;V1E("H^.CIO=&AE<B!B=6-K971?86QL;V-A M=&]R.PT*(" -"B @(" @(" @8G5C:V5T7V%L;&]C871O<B!G971?8G5C:V5T M7V%L;&]C871O<B@I('L-"B @(" @(" @("!R971U<FX@8G5C:V5T7V%L;&]C M871O<BAA;&QO8RD[#0H@(" @(" @('T-"BT@(" @(" @#0HM(" @(" @(&-O M;G-T(&)U8VME=%]A;&QO8V%T;W(@9V5T7V)U8VME=%]A;&QO8V%T;W(H*2!C M;VYS= T*+2 @(" @("![#0HM(" @(" @(" @("!R971U<FX@8G5C:V5T7V%L M;&]C871O<BAA;&QO8RD[#0HM(" @(" @('T-"B @#0H@(" @(" @(&AA<VAE M<B!H9CL-"B @(" @(" @:V5Y7V5Q=6%L(&5Q.PT*+2TM(#4P,BPU,3(@+2TM M+0T*(" -"B @(" @('!R;W1E8W1E9#H-"B @#0HA(" @(" @('1Y<&5D968@ M='EP96YA;64(a)06QL;V,Z.G)E8FEN9#QN;V1E("H^.CIO=&AE<B!B=6-K971? M86QL;V-A=&]R.PT*(" -"B @(" @(" @8G5C:V5T7V%L;&]C871O<B!G971? M8G5C:V5T7V%L;&]C871O<B@I('L-"B @(" @(" @("!R971U<FX@8G5C:V5T M7V%L;&]C871O<BAA;&QO8RD[#0H@(" @(" @('T-"B @#0H@(" @(" @(&AA M<VAE<B!H9CL-"B @(" @(" @:V5Y7V5Q=6%L(&5Q.PT**BHJ*BHJ*BHJ*BHJ M*BHJ#0HJ*BH@-C0P+#8T-B J*BHJ#0H@(" @(" @(" @(" ^('L-"B @(" @ M(" @(" -"B @(" @(" @("!F<FEE;F0@8VQA<W,@8F]O<W0Z.FET97)A=&]R M7V-O<F5?86-C97-S.PT*(2 @(" @(" @("\O9G)I96YD(&-L87-S(&)A<VEC M7VAA<VA?=&%B;&5?='EP93L@+R\@<')O8FQE;0T*(" -"B @(" @(" @("!T M96UP;&%T92 \8VQA<W,^(&9R:65N9"!C;&%S<R!I=&5R871O<E]B87-E.PT* M(" -"BTM+2 V,S4L-C0Q("TM+2T-"B @(" @(" @(" @(#X@>PT*(" @(" @ M(" @( T*(" @(" @(" @(&9R:65N9"!C;&%S<R!B;V]S=#HZ:71E<F%T;W)? M8V]R95]A8V-E<W,[#0HA(" @(" @(" @9G)I96YD(&-L87-S(&)A<VEC7VAA M<VA?=&%B;&5?='EP93L-"B @#0H@(" @(" @(" @=&5M<&QA=&4@/&-L87-S M/B!F<FEE;F0@8VQA<W,@:71E<F%T;W)?8F%S93L-"B @#0HJ*BHJ*BHJ*BHJ M*BHJ*BH-"BHJ*B V.3@L-S V("HJ*BH-"B @#0H@(" @(" @(&-L87-S(&ET M97)A=&]R(#H@<'5B;&EC(&ET97)A=&]R7V)A<V4\=F%L=65?='EP93X@>PT* M(" -"B$@(" @(" @(" O+V9R:65N9"!C;&%S<R!B87-I8U]H87-H7W1A8FQE M7W1Y<&4[("\O('!R;V)L96T-"B @#0HA(" @(" @(" @+R]F<FEE;F0@<W1R M=6-T('-P96-I86QI>F5D7V]P97)A=&EO;G,[#0H@( T*(" @(" @(" @(&9R M:65N9"!C;&%S<R!C;VYS=%]I=&5R871O<CL-"B @(" @(" @("!T>7!E9&5F M(&ET97)A=&]R7V)A<V4\#0HM+2T@-CDS+#<P,2 M+2TM#0H@( T*(" @(" @ M("!C;&%S<R!I=&5R871O<B Z('!U8FQI8R!I=&5R871O<E]B87-E/'9A;'5E M7W1Y<&4^('L-"B @#0HA(" @(" @(" @9G)I96YD(&-L87-S(&)A<VEC7VAA M<VA?=&%B;&5?='EP93L-"B @#0HA(" @(" @(" @9G)I96YD('-T<G5C="!S M<&5C:6%L:7IE9%]O<&5R871I;VYS.PT*(" -"B @(" @(" @("!F<FEE;F0@ M8VQA<W,@8V]N<W1?:71E<F%T;W([#0H@(" @(" @(" @='EP961E9B!I=&5R M871O<E]B87-E/ T**BHJ*BHJ*BHJ*BHJ*BHJ#0HJ*BH@-S$X+#<R-B J*BHJ M#0H@( T*(" @(" @("!C;&%S<R!C;VYS=%]I=&5R871O<B Z('!U8FQI8R!I M=&5R871O<E]B87-E/'9A;'5E7W1Y<&4@8V]N<W0^('L-"B @(" @(" @(" - M"B$@(" @(" @(" O+V9R:65N9"!C;&%S<R!B87-I8U]H87-H7W1A8FQE7W1Y M<&4[#0H@(" @(" @(" @#0HA(" @(" @(" @+R]F<FEE;F0@<W1R=6-T('-P M96-I86QI>F5D7V]P97)A=&EO;G,[#0H@( T*(" @(" @(" @('1Y<&5D968@ M:71E<F%T;W)?8F%S93P-"B @(" @(" @(" @('1Y<&5N86UE(&)A<VEC7VAA M<VA?=&%B;&5?='EP93HZ=F%L=65?='EP92!C;VYS= T*+2TM(#<Q,RPW,C$@ M+2TM+0T*(" -"B @(" @(" @8VQA<W,@8V]N<W1?:71E<F%T;W(@.B!P=6)L M:6,@:71E<F%T;W)?8F%S93QV86QU95]T>7!E(&-O;G-T/B![#0H@(" @(" @ M(" @#0HA(" @(" @(" @9G)I96YD(&-L87-S(&)A<VEC7VAA<VA?=&%B;&5? M='EP93L-"B @(" @(" @(" -"B$@(" @(" @("!F<FEE;F0@<W1R=6-T('-P M96-I86QI>F5D7V]P97)A=&EO;G,[#0H@( T*(" @(" @(" @('1Y<&5D968@ M:71E<F%T;W)?8F%S93P-"B @(" @(" @(" @('1Y<&5N86UE(&)A<VEC7VAA M<VA?=&%B;&5?='EP93HZ=F%L=65?='EP92!C;VYS= T**BHJ*BHJ*BHJ*BHJ M*BHJ#0HJ*BH@-SDP+#<Y-B J*BHJ#0H@(" @(" @(" @(" @('1Y<&5N86UE M(&)A<VEC7VAA<VA?=&%B;&5?='EP93HZ=F%L=65?='EP90T*(" @(" @(" @ M(" @/B![#0H@( T*(2 @(" @(" @("\O9G)I96YD(&-L87-S(&)A<VEC7VAA M<VA?=&%B;&5?='EP93L-"B @#0H@(" @(" @(" @='EP961E9B!L;V-A;%]I M=&5R871O<E]B87-E/ T*(" @(" @(" @(" @='EP96YA;64@8F%S:6-?:&%S M:%]T86)L95]T>7!E.CIV86QU95]T>7!E#0HM+2T@-S@U+#<Y,2 M+2TM#0H@ M(" @(" @(" @(" @('1Y<&5N86UE(&)A<VEC7VAA<VA?=&%B;&5?='EP93HZ M=F%L=65?='EP90T*(" @(" @(" @(" @/B![#0H@( T*(2 @(" @(" @(&9R M:65N9"!C;&%S<R!B87-I8U]H87-H7W1A8FQE7W1Y<&4[#0H@( T*(" @(" @ M(" @('1Y<&5D968@;&]C86Q?:71E<F%T;W)?8F%S93P-"B @(" @(" @(" @ M('1Y<&5N86UE(&)A<VEC7VAA<VA?=&%B;&5?='EP93HZ=F%L=65?='EP90T* M*BHJ*BHJ*BHJ*BHJ*BHJ#0HJ*BH@.# X+#@Q-" J*BHJ#0H@(" @(" @(&-L M87-S(&-O;G-T7VQO8V%L7VET97)A=&]R#0H@(" @(" @(" @.B!P=6)L:6,@ M;&]C86Q?:71E<F%T;W)?8F%S93QV86QU95]T>7!E(&-O;G-T/B![#0H@( T* M(2 @(" @(" @("\O9G)I96YD(&-L87-S(&)A<VEC7VAA<VA?=&%B;&5?='EP M93L-"B @#0H@(" @(" @(" @='EP961E9B!L;V-A;%]I=&5R871O<E]B87-E M/ T*(" @(" @(" @(" @='EP96YA;64@8F%S:6-?:&%S:%]T86)L95]T>7!E M.CIV86QU95]T>7!E(&-O;G-T#0HM+2T@.# S+#(a)P.2 M+2TM#0H@(" @(" @ M(&-L87-S(&-O;G-T7VQO8V%L7VET97)A=&]R#0H@(" @(" @(" @.B!P=6)L M:6,@;&]C86Q?:71E<F%T;W)?8F%S93QV86QU95]T>7!E(&-O;G-T/B![#0H@ M( T*(2 @(" @(" @(&9R:65N9"!C;&%S<R!B87-I8U]H87-H7W1A8FQE7W1Y M<&4[#0H@( T*(" @(" @(" @('1Y<&5D968@;&]C86Q?:71E<F%T;W)?8F%S M93P-"B @(" @(" @(" @('1Y<&5N86UE(&)A<VEC7VAA<VA?=&%B;&5?='EP M93HZ=F%L=65?='EP92!C;VYS= T**BHJ*BHJ*BHJ*BHJ*BHJ#0HJ*BH@.38X M+#DW-" J*BHJ#0H@(" @(" @(" @("!R96AA<V@H<W1A=&EC7V-A<W0\<VEZ M95]T>7!E/BAM;&8@*B!N("L(a),2DI.PT*(" @(" @("!]#0H@( T*(2 @(" @ M(" O+V9R:65N9"!S=')U8W0@<W!E8VEA;&EZ961?;W!E<F%T:6]N<SL-"B @ M#0H@(" @("!P=6)L:6,Z#0H@( T*+2TM(#DV,RPY-CD@+2TM+0T*(" @(" @ M(" @(" @<F5H87-H*'-T871I8U]C87-T/'-I>F5?='EP93XH;6QF("H@;B K M(#$I*3L-"B @(" @(" @?0T*(" -"B$@(" @(" @9G)I96YD('-T<G5C="!S M<&5C:6%L:7IE9%]O<&5R871I;VYS.PT*(" -"B @(" @('!U8FQI8SH-"B @ M#0HJ*BHJ*BHJ*BHJ*BHJ*BH-"BHJ*B Q,#4R+#$P-C$@*BHJ*@T*(" -"B @ M(" @(" @=F]I9"!E<F%S92AC;VYS=%]I=&5R871O<B!R*2![#0H@(" @(" @ M(" @<VEZ95]T>7!E(&D@/2!B=6-K970H97AT<F%C=%]K97DH*G(I*3L-"B$@ M(" @(" @("!N;V1E("HJ;F]D95]P;VEN=&5R(#T@8G5C:V5T("L@:3L-"B @ M(" @(" @("!W:&EL92 H*FYO9&5?<&]I;G1E<B A/2!R+FYO9&5?<&]I;G1E M<BD-"B @(" @(" @(" @(&YO9&5?<&]I;G1E<B ]("8H*"IN;V1E7W!O:6YT M97(I+3YN97AT*3L-"B$@(" @(" @("!N;V1E("IN(#T@*FYO9&5?<&]I;G1E M<CL-"B @(" @(" @(" J;F]D95]P;VEN=&5R(#T@;BT^;F5X=#L-"B @(" @ M(" @("!N+3Y^;F]D92(a)I.R O+R!M=7-T(&YO="!T:')O=PT*(" @(" @(" @ M('1R>2![#0HM+2T@,3 T-RPQ,#4V("TM+2T-"B @#0H@(" @(" @('9O:60@ M97)A<V4H8V]N<W1?:71E<F%T;W(@<BD@>PT*(" @(" @(" @('-I>F5?='EP M92!I(#T@8G5C:V5T*&5X=')A8W1?:V5Y*"IR*2D[#0HA(" @(" @(" @;F]D M95]P;VEN=&5R("HJ;F]D95]P;VEN=&5R(#T@8G5C:V5T("L@:3L-"B @(" @ M(" @("!W:&EL92 H*FYO9&5?<&]I;G1E<B A/2!R+FYO9&5?<&]I;G1E<BD- M"B @(" @(" @(" @(&YO9&5?<&]I;G1E<B ]("8H*"IN;V1E7W!O:6YT97(I M+3YN97AT*3L-"B$@(" @(" @("!N;V1E7W!O:6YT97(@*FX@/2 J;F]D95]P M;VEN=&5R.PT*(" @(" @(" @("IN;V1E7W!O:6YT97(@/2!N+3YN97AT.PT* M(" @(" @(" @(&XM/GYN;V1E*"D[("\O(&UU<W0@;F]T('1H<F]W#0H@(" @ -(" @(" @=')Y('L-"@`` ` end

2 4

[Graph] Bundled properties
by Douglas Gregor 14 May '04

14 May '04

Introducing internal properties for vertices and edges is too hard, and is one of the various things that came up in the "forced client complexity" thread. For a simple task, I ended up writing this: -------------------------------------------------------- namespace boost { enum edge_length_t { edge_length }; enum edge_speed_limit_t { edge_speed_limit }; enum edge_direction_t { edge_direction }; enum edge_snow_route_t { edge_snow_route} ; BOOST_INSTALL_PROPERTY(edge, length); BOOST_INSTALL_PROPERTY(edge, direction); BOOST_INSTALL_PROPERTY(edge, speed_limit); BOOST_INSTALL_PROPERTY(edge, snow_route); } typedef boost::adjacency_list< boost::listS, boost::vecS, boost::bidirectionalS, // Vertex properties boost::property<boost::vertex_name_t, std::string>, // Edge properties boost::property<boost::edge_name_t, std::string, boost::property<boost::edge_length_t, double, boost::property<boost::edge_speed_limit_t, int, boost::property<boost::edge_direction_t, char, boost::property<boost::edge_snow_route_t, bool> > > > > > RouteMap; -------------------------------------------------------- I'm basically enumerating all of the fields in a struct, but it's not represented efficiently (for the human, compiler, or run-time). I'd really like to do something like this: -------------------------------------------------------- struct Intersection { std::string name; }; struct Street { std::string name; double length; int speed_limit; char direction; bool snow_route; }; typedef boost::adjacency_list< boost::listS, boost::vecS, boost::bidirectionalS, Intersection, Street> RouteMap; -------------------------------------------------------- It's a heck of a lot shorter and more intuitive. The attached patch introduces this capability for adjacency_list. The UDT's Intersection and Street are referred to as "bundled properties", and may occur at the end of the vertex or edge property list passed to adjacency_list. Accessing these bundled properties is done using the graph's subscript operator: void foo(Map& g, Map::vertex_descriptor v, Map::edge_descriptor e) { map[v].name = "Albany"; map[e].length = 25.3; } Often one needs a property map for an internal property. With bundled properties this is achieved through an overloaded ->* operator. So if you want to create a property map from edge descriptors to the speed_limit property for a graph g, use: g->*&Street::speed_limit And here's a real usage: void shortest(Map& g, Map::vertex_descriptor from) { dijkstra_shortest_paths(g, from, weight_map(g->*&Street::length)); } The attached patch implements this functionality. It is completely backward-compatible (no new regressions on GCC 3.3.x), includes documentation and a test case, and seems to work well. Comments? Doug

1 1