- Boost - lists.boost.org

[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

Why don't lambda funcs work for stl function objects?
by Neal D. Becker 13 May '04

13 May '04

Any reason lambda functions can't meet requirements for std::unary_function, for example? Specifically, it seems result_type is not defined. For example boost::constant(0) doesn't have result_type, so can't be used where a std::unary_function is needed.

3 2

Re: [boost] Re: static sized strings
by Reece Dunn 13 May '04

13 May '04

Rob Stewart wrote: >From: John Nagle <nagle(a)animats.com> > > > > STL strings are variable-sized, with no limit. When you > > add characters, "size()" increases. Should fixed-size > ^^^^ >I presume you're referring to fixed-capacity strings which can >have a variable size, right? yup. The idea is to make it a buffer-overflow safe replacement for C style character buffers, e.g.: char buf[ 100 ]; ::sprintf( buf, "...", ... ); while allowing it to behave like a basic_string. > > strings be similar? If the STL string operations are > > to be meaningful, they have to be. > >Only if you want to apply mutating algorithms that modify size. >IOW, it isn't unreasonable to choose either fixed-size or >fixed-capacity strings. If the former, then there are no >mutating algorithms that affect the size. If the latter, the >size can change, but an exception occurs when trying to exceed >the capacity. That's the way I see it, but instead of throwing an exception, the class simply prevents overrun and fills the available space, e.g.: char_string< 5 > buf; buf.copy( "Meine Grosse Welt!" ); std::cout << buf << '\n'; // prints "Mein" (null terminated) > > In STL strings, "size" doesn't include a trailing null. > > Using "c_str" can result in expanding the string to add a > > trailing null. With fixed-size strings, we don't have that > > option. > > > > If c_str is provided, there must always be space > > for a trailing null. So you can't use char_string > > when you need a specific fixed length, as for Macintosh > > 4-character file signatures. Perhaps "boost::array<char>" > > is the way to go for that sort of thing. Trying to do > > both null-terminated and non-null-terminated strings > > in the same class will get ugly. > >If the string if fixed-capacity *and* there remains sufficient >capacity, c_str() can null terminate the buffer. If there isn't >sufficient remaining capacity, then throw an exception. > >IOW, make it a runtime error to fix the capacity too small to >permit null termination when calling c_str(). That still leaves >room for things like the 4-character file signature to which you >referred, and yet prevents buffer overrun, but doesn't require >foregoing flexibility. That is a good idea. It will mean keeping track of the string length, but it does permit both versions without requiring complex internals/semasntics or seperate classes. In order to keep interoperability with C style usage (i.e. operator const char *()), we can have the following: inline const char_type * c_str() { // null-terninate buffer: str[ len ] = char_type( '\0' ); return( str ) } inilne operator const char *() { return( c_str()); } Regards, Reece _________________________________________________________________ Tired of 56k? Get a FREE BT Broadband connection http://www.msn.co.uk/specials/btbroadband

5 8

Re: [boost] Re: static sized strings
by Reece Dunn 13 May '04

13 May '04

Rob Stewart wrote: >From: John Nagle > Reece Dunn wrote: > > > Rob Stewart wrote: > > >> From: John Nagle >You're comparing apples to oranges. Either you mean for the >buffer to be exactly four bytes or you don't. If you do, then >there's no room for a null terminator. You're not dealing with a >"C string" (a null terminated string), you're dealing with a four >byte buffer. If you allocated four bytes for a "C string" and >write "ABCDE" to it, or even strcat() "ABCD" to it, you overrun >the buffer. Why would we want to provide consistent semantics >for that behavior? The idea is to prevent overrun when this type of situation occurs. Thus, it will be a 3 character buffer with the extra character being a null-terminator. > > >> IOW, make it a runtime error to fix the capacity too small to > > >> permit null termination when calling c_str(). That still leaves > > >> room for things like the 4-character file signature to which you > > >> referred, and yet prevents buffer overrun, but doesn't require > > >> foregoing flexibility. > > > > If you want a 4-char file signature, you can use > > "boost::array<char,4>", which does that job. Is there any > > real need for that functionality in char_string? Isn't boost::array specific to generic arrays, whereas using a variant of char_string, you can use string functions that will be optimized for string operations. This is the main reason for using a special string class. > > char_string might have some convenience template functions to > > interconvert "boost::array" and "boost::char_string". > > > > > That is a good idea. It will mean keeping track of the string length, > > > > Yes, that seems to be necessary. > >The question is, which is better: char_string<4> or >boost::array<char,4>? I suggest that the latter is better. In C >code, and similar C++ code, arrays of char are used as buffers of >fixed length and as memory for strings. Code will be clearer if >one uses boost::array<char,N> for the former and char_string<N> >for the latter. Once you make that distinction of purpose, null >termination can be integral to char_string without complication >or unwanted overhead. That makes sense. > > What about the base class issue? There's a need to be able to > > write something like "char_string_base& s" when you want to > > pass around fixed-capacity strings of more than one capacity. > >If that is a necessary feature, then the length can be stored in >the base class. However, such a base class means that the dtor >must be virtual. Is vtable overhead acceptable in such a class? >Perhaps two types are needed. My design does not use a virtual base class, so that isn't an issue. John Nagle's version does, so that is where the problem arises. I have several issues with the use of a virtual base class: [1] If you want to operate on a variable length character string specifically, why not templatize the function: template< int n > void myfn( boost::char_array< n > & s ){ ... } [2] How do you deal with wide-character strings? My update generalizes to support char and wchar_t based buffers, but with a virtual base class, you are limited to char buffers. [3] One of the reasons for having a virtual class is to supply custom string operations, e.g. using Windows-specific string functions instead of the standard library ones. This can also be solved with a policy template like that found in basic_string. My current version uses this approach, improving interoperability with basic_strings. Regards, Reece _________________________________________________________________ Use MSN Messenger to send music and pics to your friends http://www.msn.co.uk/messenger

3 2

Re: [boost] Re: static sized strings
by Reece Dunn 13 May '04

13 May '04

Rob Stewart wrote: >From: David Abrahams > John Nagle writes: > > > > > If you're willing to accept a call to "new", you can just > > > use std::string and reserve some initial size. > > > > It's not the same thing. You might only be willing to accept a call > > to "new" if things go beyond a certain length. That's *usually* the > > only reason I'd ever have a fixed-size buffer. Very occasionally > > I'll be in code that where I don't want to throw an exception, but > > then a string that responds to overflow by throwing is no better. > >char_string can throw a more meaningful exception than >std::bad_alloc. > >In the small string optimization or std::string with reserve >approaches, the buffer grows when the input is too large, and >other, downstream code may overflow or behave badly. Stopping >the overflow early may be better and having an automated >mechanism for preventing overflow is wise. There is not meant to be any buffer allocation. char_string is a fixed-capacity string that will not write beyond the length of that buffer. > > > So you don't need that capabiilty in char_string. char_string is > > > for situations when you don't want to invoke dynamic allocation at > > > all. In desktop applications, that's not too common, but in real > > > time work, inside operating systems, and in embedded applications > > > it's not unusual. > > > > I'm saying, it's almost always better to degrade performance > > gracefully as the program's input grows than it is to introduce an > > execution discontinuity like an exception (if possible). In many of > > those scenarios you've named, exceptions, like dynamic allocation have > > been banned anyway for similar real and/or imaginary reasons. > >There's probably room and need for both types of strings. I don't intend the char_string buffer to be increased. I intended that the operations on the buffer would not go beyond the buffer (which would lead to overflow) and also that going over the buffer would not generate an exception. It may be beneficial to have an error policy to determin the behaviour in the event of an overflow. I am not advocating this approach, just putting it up for discussion. The only exception I can see keeping is the one in the constructor to test for a buffer of 0, but this would be better re-implemented as a compile-time check using mpl code, e.g.: template< int n, ... > class char_string { class ok{ typedef char value; }; class zero_buffer_error{}; typedef mpl::if_< mpl::equal< n, 0 >, zero_buffer_error, ok >::value value; }; Regards, Reece _________________________________________________________________ Find a cheaper internet access deal - choose one to suit you. http://www.msn.co.uk/internetaccess

3 2

RE: [boost] Re: static sized strings
by Martin Bosticky 13 May '04

13 May '04

>> >>There's probably room and need for both types of strings. > >I don't intend the char_string buffer to be increased. I intended that the >operations on the buffer would not go beyond the buffer (which would lead >to >overflow) and also that going over the buffer would not generate an >exception. >It may be beneficial to have an error policy to determin the behaviour in >the event of an overflow. I am not advocating this approach, just putting >it >up for discussion. In the spirit of contributing to this 'discussion', I would suggest a size limited string that would throw exception if assigned data that is too long. However I would also add a friend function(s) that would assign and truncate supplied data. So by default the string would be safe for use, but you could assign using a 'truncation' technique in which case no exception could ever be thrown. This would then satisfy requirements of both parties. Martin Bosticky This email message contains confidential information and is intended for the use of its intended recipient only. Access to this email by anyone else is unauthorised. If you are not the intended recipient you are hereby notified that any use, disclosure, copying or distribution or any action taken or omitted to be taken in reliance on it is strictly prohibited. If this communication has been sent to you in error, please notify us immediately. Action Information Management Ltd. 129 Devizes Road, Hilperton, Trowbridge, Wiltshire BA14 7SZ. Tel: +44 (0) 1225 711200 Fax: +44 (0) 1225 711222 Website www.aimltd.co.uk email: support(a)aimltd.co.uk

1 0

big_integer and boost::random::uniform_int
by Joel Young 13 May '04

13 May '04

I tried to use boost::random::uniform_int with the in-development big_integer library. Here is a test code: #include <boost/random/uniform_int.hpp> #include "boost/big_integer.hpp" /////////////////////// int main(int argc, char* argv[]) { typedef boost::big_integer data_t; // typedef long long data_t; data_t n(235345345); boost::uniform_int<data_t> rng(0,n-1); return 0; } /////////////////////// ==> g++ --version g++ (GCC) 3.3.2 20031022 (Red Hat Linux 3.3.2-1) Compiling this yields: /////////////////////// g++ -o a -I ~/boost/boost/include/boost-1_31/ randomtest.cpp /home/afit1/fac/jyoung/boost/boost/include/boost-1_31/boost/random/uniform_int.hpp: In constructor `boost::uniform_int<IntType>::uniform_int(IntType,IntType) [with IntType = main(int, char**)::data_t]': randomtest.cpp:10: instantiated from here /home/afit1/fac/jyoung/boost/boost/include/boost-1_31/boost/random/uniform_int.hpp:52: error: invalid application of `sizeof' to an incomplete type ////////////////////// Joel

2 1

Boost.Test and free 7.1 tools
by Vladimir Prus 13 May '04

13 May '04

I've just tried building the Boost.Test library with the free VC 7.1 tools. I get this error: msvc.compile.c++ ..\..\.. \bin\libs\test\build\msvc-7.1\debug\link-static\execution_monitor.obj execution_monitor.cpp ..\..\..\libs\test\src\execution_monitor.cpp(52) : fatal error C1083: Cannot open include file: 'wtypes.h': No such file or directory call "W:/Program Files/Microsoft Visual C++ Toolkit 2003\bin\vcvars32.bat" > nul cl /Zm800 -nologo -TP -DBOOST_TEST_NO_AUTO_LINK=1 /Z7 /Od /Ob0 /GX /GR /MDd -I"..\..\.." -c -Fo"..\..\.. \bin\libs\test\build\msvc-7.1\debug\link-static\execution_monitor.obj" ".. \..\..\libs\test\src\execution_monitor.cpp" All the other files compile fine, so I assume it's not misconfiguration, and that Boost.Test uses some header which is not included in free tools. Is it possible to fix that? I guess that I'm not the only one Linux user who would like to test code with free vc 7.1 and if Boost.Test fails to build that's not possible. TIA, Volodya

2 1

signals lib bug
by Alexey Subbota 13 May '04

13 May '04

Under windows <signals>.dll not export some function because absent #include <boost/config.hpp> before #ifdef BOOST_HAS_DECLSPEC at boost/signals/detail/config.hpp

2 1