July 2006 - Boost - lists.preview.boost.org

Numerical integration library?
by Frederick Akalin 31 Jul '06

31 Jul '06

I notice numerical integration was one of the items listed in the ExpandedMathematicsLibrary entry under WantedLibraries in the Wiki. Has anyone done any work on this? I've been looking into this problem space lately; I had the germ of an idea that, with the magic of templates, most ODE solvers (e.g. Euler, Runge-Kutta, etc.) could be written in a container-agnostic format and in a form closely resembling that which you would find in a textbook. (I can post some proof-of-concept code if this isn't clear.) I've looked around and haven't seen anything similar, but I'm no expert on scientific programming. Anyone else interested or have comments? Fred

5 4

Re: [boost] Numerical integration library?
by Wang Weiwei 31 Jul '06

31 Jul '06

>I notice numerical integration was one of the items listed in the >ExpandedMathematicsLibrary entry under WantedLibraries in the Wiki. Has >anyone done any work on this? I've been looking into this problem space >lately; I had the germ of an idea that, with the magic of templates, >most ODE solvers (e.g. Euler, Runge-Kutta, etc.) could be written in a >container-agnostic format and in a form closely resembling that which >you would find in a textbook. (I can post some proof-of-concept code if >this isn't clear.) I've looked around and haven't seen anything similar, >but I'm no expert on scientific programming. > >Anyone else interested or have comments? Yes, I have keen interest in it and am looking forward to have a feel. > >Fred >_______________________________________________ >Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost > >

1 0

Interest in Barton-Nackman's fallible<T>?
by Gennaro Prota 31 Jul '06

31 Jul '06

Hi guys, I don't know how and how much boost:optional<> overlaps with this (last time I checked it was different, but I know there's a proposal in which the template has been changed), anyway: is there interest for a Barton-Nackman's fallible<T> template? Basically the idea is (warning: not compiled): #include <assert.h> template<typename T> class fallible { public : fallible(); explicit fallible(const T & value); bool is_valid() const; const T& value() const; operator T() const; const T& else_default_to(const T& default_value) const; void invalidate(); void validate(const T& value); // alternative to operator= private : T m_value; bool m_valid; }; template<typename T> fallible<T>::fallible() : m_valid(false) { } template<typename T> fallible<T>::fallible( const T& v ) : m_value(v), m_valid(true) { } template<typename T> bool fallible<T>::is_valid() const { return m_valid; } template<typename T> const T& fallible<T>::value() const { assert(m_valid); // <--- return m_value; } template<typename T> fallible<T>::operator T() const { return value(); } template<typename T> const T& fallible<T>::else_default_to(const T& default_value) const { return is_valid() ? static_cast<const T&>(value()) : static_cast<const T&>(default_value); } template<typename T> void fallible<T>::invalidate() { m_valid = false; } template <typename T> void fallible<T>::validate(const T& value) { m_value = value; m_valid = true; } -- [ Gennaro Prota, C++ developer for hire ] [ resume: available on request ]

4 7

Interest in O(log n) linear list?
by Stephen Dolan 30 Jul '06

30 Jul '06

The STL contains vector, which has O(1) lookup and O(n) insertion. It also has list, which has O(n) lookup and O(1) insertion. There is also a third type of container, which doesn't exist in the STL, which has O(log n) lookup and O(log n) insertion. (For those who have read Knuth's TAOCP, it's a balanced tree with the RANK field). AFAIK, there is no well-known name for this structure, but a linear list with both operations fairly fast seems a useful item to have. Any interest? Thanks, Stephen Dolan

6 13

Boost regression notification (2006-07-30 [RC_1_34_0])
by Douglas Gregor 30 Jul '06

30 Jul '06

Boost Regression test failures Report time: 2006-07-30T10:46:58Z This report lists all regression test failures on release platforms. Detailed report: http://engineering.meta-comm.com/boost-regression/CVS-RC_1_34_0/developer/i… 257 failures in 23 libraries algorithm/string (1) concept_check (1) filesystem (4) graph (5) io (1) iostreams (10) mpl (6) numeric/conversion (4) numeric/interval (1) numeric/ublas (7) parameter (22) program_options (2) python (84) random (1) rational (4) regex (1) serialization (24) signals (16) spirit (1) test (2) tr1 (51) typeof (8) utility (1) |algorithm/string| regex: borland-5_6_4 |concept_check| class_concept_check_test: vc-7_1-stlport |filesystem| mbcopy: sun-5.8 operations_test: vc-7_1-stlport operations_test_dll: vc-7_1-stlport wide_test: sun-5.8 |graph| adjacency_matrix_test: vc-7_0 csr_graph_test: sun-5.8 graphviz_test: msvc-8.0 msvc-8.0 vc-7_1-stlport |io| ios_state_unit_test: gcc-4.1.0_linux_x86_64 |iostreams| bzip2_test: msvc-7.1 msvc-8.0 compose_test: borland-5_6_4 example_test: vc-6_5-stlport filtering_stream_test: msvc-8.0 vc-7_1-stlport gzip_test: msvc-7.1 msvc-8.0 zlib_test: msvc-7.1 msvc-8.0 |mpl| multiset: gcc-4.0.3_linux gcc-4.1.0_linux gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc gcc-4_0_3_tru64 vector_c: sun-5.8 |numeric/conversion| converter_test: borland-5_8_2 traits_test: borland-5_8_2 udt_example_0: borland-5_8_2 udt_support_test: borland-5_8_2 |numeric/interval| test_float: vc-7_1-stlport |numeric/ublas| concepts: vc-7_1-stlport vc-7_1-stlport test1: vc-7_1-stlport test2: vc-7_1-stlport test4: vc-7_1-stlport test5: vc-7_1-stlport vc-7_1-stlport |parameter| basics: borland-5_6_4 borland-5_8_2 duplicates: borland-5_6_4 borland-5_8_2 maybe: vc-6_5 vc-6_5-stlport vc-7_0 preprocessor: borland-5_6_4 borland-5_8_2 sun-5.8 vc-6_5 vc-6_5-stlport python-parameter-test: vc-6_5 vc-6_5-stlport vc-7_0 sfinae: borland-5_8_2 vc-6_5-stlport singular: borland-5_6_4 borland-5_8_2 unnamed_fail: vc-6_5 vc-6_5-stlport vc-7_0 |program_options| unicode_test_dll: borland-5_8_2 variable_map_test_dll: borland-5_8_2 |python| andreas_beyer: sun-5.8 args: sun-5.8 auto_ptr: sun-5.8 back_reference: sun-5.8 bases: gcc-3_4_4_tru64 gcc-4_0_3_tru64 sun-5.8 ben_scott1: sun-5.8 bienstman1: sun-5.8 bienstman2: sun-5.8 bienstman3: sun-5.8 borrowed: sun-5.8 callbacks: sun-5.8 const_argument: sun-5.8 crossmod_exception: sun-5.8 data_members: sun-5.8 defaults: sun-5.8 dict: sun-5.8 docstring: sun-5.8 enum: sun-5.8 exception_translator: sun-5.8 exec: darwin-4.0.1 gcc-3_4_4_tru64 gcc-4_0_3_tru64 msvc-8.0 qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp sun-5.8 extract: sun-5.8 implicit: sun-5.8 indirect_traits_test: sun-5.8 injected: sun-5.8 iterator: sun-5.8 keywords: sun-5.8 list: sun-5.8 long: sun-5.8 minimal: sun-5.8 multi_arg_constructor: sun-5.8 nested: sun-5.8 numpy: sun-5.8 object: sun-5.8 object_manager: sun-5.8 opaque: sun-5.8 operators: sun-5.8 pearu1: sun-5.8 pickle1: sun-5.8 pickle2: sun-5.8 pickle3: sun-5.8 pickle4: sun-5.8 pointee: gcc-3_4_4_tru64 gcc-4_0_3_tru64 sun-5.8 pointer_type_id_test: gcc-3_4_4_tru64 gcc-4_0_3_tru64 sun-5.8 pointer_vector: sun-5.8 polymorphism: sun-5.8 polymorphism2: sun-5.8 polymorphism2_auto_ptr: sun-5.8 properties: sun-5.8 raw_ctor: sun-5.8 return_arg: sun-5.8 select_arg_to_python_test: sun-5.8 select_from_python_test: darwin-4.0.1 sun-5.8 select_holder: sun-5.8 shared_ptr: sun-5.8 slice: sun-5.8 staticmethod: sun-5.8 stl_iterator: sun-5.8 str: sun-5.8 string_literal: sun-5.8 test_pointer_adoption: sun-5.8 try: sun-5.8 tuple: sun-5.8 upcast: gcc-3_4_4_tru64 gcc-4_0_3_tru64 sun-5.8 vector_indexing_suite: sun-5.8 virtual_functions: sun-5.8 voidptr: sun-5.8 wrapper_held_type: sun-5.8 |random| random_test: intel-linux-9.0 |rational| rational_test: borland-5_6_4 vc-6_5 vc-6_5-stlport vc-7_0 |regex| object_cache_test: darwin-4.0.1 |serialization| test_class_info_load_text_warchive: vc-6_5 test_non_default_ctor2_text_archive: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp test_non_default_ctor2_text_archive_dll: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp test_non_default_ctor2_text_warchive: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp test_non_default_ctor2_text_warchive_dll: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp test_reset_object_address: vc-7_0 test_reset_object_address_dll: vc-7_0 test_simple_class_binary_archive_dll: vc-6_5 test_simple_class_text_archive_dll: vc-6_5 test_simple_class_text_warchive_dll: vc-6_5 test_simple_class_xml_archive_dll: vc-6_5 test_simple_class_xml_warchive_dll: vc-6_5 test_variant_xml_archive: borland-5_8_2 test_variant_xml_archive_dll: borland-5_8_2 test_variant_xml_warchive: borland-5_8_2 test_variant_xml_warchive_dll: borland-5_8_2 |signals| dead_slot_test: gcc-3.3.6 gcc-3.3.6_linux qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp trackable_test: gcc-3.3.6 gcc-3.3.6_linux qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp |spirit| mix_and_match_trees: sun-5.8 |test| parameterized_test_test: vc-6_5 vc-6_5-stlport |tr1| run_random: sun-5.8 std_run_complex_overloads: sun-5.8 std_run_random: sun-5.8 std_test_bind: sun-5.8 std_test_complex: sun-5.8 std_test_function: sun-5.8 std_test_hash: sun-5.8 std_test_mem_fn: sun-5.8 std_test_random: sun-5.8 std_test_reference_wrapper: sun-5.8 std_test_reference_wrapper_tricky: gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux gcc-3.4.5_linux_x86_64 gcc-4.0.3_linux gcc-4.1.0_linux_x86_64 intel-linux-9.0 mingw-3_4_2 msvc-7.1 msvc-8.0 qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp vc-7_1-stlport std_test_result_of: sun-5.8 std_test_shared_ptr: sun-5.8 std_test_tuple: sun-5.8 std_test_tuple_tricky: sun-5.8 std_test_type_traits: sun-5.8 test_boost: vc-7_1-stlport test_hash: vc-7_1-stlport test_random: sun-5.8 vc-7_1-stlport test_reference_wrapper_tricky: gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux gcc-3.4.5_linux_x86_64 gcc-4.0.3_linux gcc-4.1.0_linux_x86_64 intel-linux-9.0 mingw-3_4_2 msvc-7.1 msvc-8.0 qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp test_regex: vc-7_1-stlport test_type_traits: sun-5.8 tr1_tky_function_type_test: sun-5.8 |typeof| function_binding_emulation: sun-5.8 function_binding_native: vc-6_5 vc-6_5-stlport vc-7_0 odr_no_uns: vc-6_5 vc-6_5-stlport vc-7_0 template_tpl_emulation: sun-5.8 |utility| operators_test: gcc-3.4.5_linux_x86_64

1 0

Re: [boost] interest in sorted vector containers?
by Lewis Hyatt 30 Jul '06

30 Jul '06

> Boost.Interprocess (formerly known as Boost.Shmem) already > provides these containers under the names flat_[multi]set, > flat_[multi]map, see http://tinyurl.com/m4beq . > > Joaqu?n M L?pez Mu?oz > Telef?nica, Investigaci?n y Desarrollo OK, great, I think it'll be excellent to have them in there. I hadn't seen that library, it looks like it will be useful for a lot of people! -lewis

2 1

Re: [boost] interest in sorted vector containers?
by JOAQUIN LOPEZ MU?Z 30 Jul '06

30 Jul '06

On 7/29/06, Lewis Hyatt <lhyatt(a)princeton.edu> wrote: > Is there any interest in providing Boost container classes > with the same functionality as set/map implemented with > sorted vectors? Boost.Interprocess (formerly known as Boost.Shmem) already provides these containers under the names flat_[multi]set, flat_[multi]map, see http://tinyurl.com/m4beq . Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

Boost logo - png version
by Gennaro Prota 30 Jul '06

30 Jul '06

Hi, the png version of our logo, in boost-root, looks quite different from the original artwork in the website cvs tree. I've attached the current version (boost.png) and one I directly created from the original (result.png). Besides (possibly deliberate) aesthetics differences there's also some ugly blurring, also noticeable from web pages, and no gray circle on the left. -- [ Gennaro Prota, C++ developer for hire ] begin 644 boost-logos.zip M4$L#!`H``````/1V_C2/V*>/)!L``"0;```*````<F5S=6QT+G!N9XE03D<- M"AH*````#4E(1%(```$5````5@@#```!H8S",````P!03%1%2F2$2V6%3&:% M36:&36>&3VB'3VF(46J)4VR*5&V+5V^-5FZ,56Z,67&.6G*/6W.07'.07'21 M7G:287>48'>387B48GF48WJ597N69GR79WV8:'Z9:G^::X":;(&;;8*<;H.= M;X2=<(6><H:?<X>@=8FA=XNC=8FB>(RC>HVE>8RD?(^F?I"G?Y&H@)*I@9.J M@Y6KA)6KA9>LAIBMAYBNB)JOB)FNBYNPBYRQC9VRCY^SC9ZRD*"SD:&TDJ*U ME*.VE:6WEZ:XEJ6XF*>YFZF[F:BZG*N\GJR]GZV^H:Z_NKJZO;V]BJS6C:[7 MBZW7CZ_8DK+9E[7;FK?<GKK=H:_`HK#`I+'!IK/"I+'"I[3#J;7$J[?&JK;% MK;G'KKK(KKG(L+O)L;S*M+_,L[[+H;S>M\'.M<#-N,+/N\71O<;2O<?2N</0 MO\G4K,3BI\#@M,KEL=+LLM/MM=7MM];NL]3MO]+IO-#HN=?NN]COO=GOPL+" MQ<7%R<G)SL[.P<K5P\S6Q,S7QL_9Q<W8R-#:RM+;R]+<S=3=SM7>T='1T]/3 MU=75U]?7UM;6V=G9V-C8VMK:V]O;W-S<W=W=WM[>W]_?Q-7KRMGMT-?@T]GA MTMGAU=OBUMSCU]WDV=[EQ=WQQ-WQQM[QPMSQR-_RT=[OV^#GW.'GW^/IW>+H MW^3JR>#RSN/TT>7TU>3RV^;RU^CVVNKWW>OVW^WXX.#@X>'AXN+BX^/CY.3D MY>7EYN;FY^?GXN;KX>7KX^?LY.CMY^KOY>GNZ.CHZ>GIZNKJZ^OK[.SL[>WM M[N[N[^_OY.SVZ>WPZ^[Q[._RZ.OPXN[X[O#S[_'TZ?+Z[?7[[/+XY?#Y\/#P M\?'Q[_#P\O+R\_/S\?/V\_7W\O3V]/3T]?7U\_/T]O;V]_?W]O;W\?;[]/;X M]O?Y\O?\]OCY]_CZ]OK]]/?[^?GY^/CX^/GZ^?K[^_O[^OKZ^OO\^_O\^/K] M^_S]^OS^_/S\_?W]_/S]_?W^_/W^_?[^_?[__O[^_O[______O__<6B'40`` M``EP2%ES```N(P``+B,!>*4_=@``%\I)1$%4>-KM7`E\%$6ZKQ#A<8@(*!$C M($>"^`B'>`""@'(3CST"1HARB(*R.KBN+A`NN7)`R.4#E'BP"BCKL9-D#A28 M,V-$P6/F-P/,_)(5%`WA,I"$F)2O[J[NZ0G@`PUO_33=U=W555__ZZOOJAH` MQ!0*P48(H#^?V^7V!/B5;AV/_0.#P>SR1Z@#T'\^N]%@6&`K<:/^`,"U`#B( M#U/@;G39$M]S%V<9#$&#X5T_:0>H#^14[S(:(30@\D%8@&[-X7T"V`DWNP05 MW(6)B8D+#89:']R'G@SLA!^_@@_+(:R$C^'*'C.J4YMI=`0P.X`Q)0XM<)<! MU[.)B=E&F[<Q?/QNN\7J\!(8>\(1$"X33^L(a)C(.EF+N0W^<+G`=G6!ZJ/L]8 M!#QH+'QEC8V%WV4V&$QV#ZYTM4Z-T1!4NTW/&0RY3A^"$!X._W;\O]^>>\;P M+8+978Z[>HSTMR8:'=IWA7`F&12?)1O"B:C.3R%\/9W4.8@/_5$;LVD=ZPF$ M,^K.'=(.:3->"CA0E<3T;+.',1$%0!V,!V`CXPF/J=>6F%B1:W(%&L&GWNNP M6NQN)#T]X%;8B]X>`?O`V;`OG`)7P+<P<P&?SQ\ZWUB@(0N@,4-5`XU.D,:; MJ?=[W0Z'V^5RVQUNK^@5@`ML`M!1][ILIA(L\X8/C2:;R\LP(")]@9P@8?8X MS,8<TDKVF_CHI)-Z!)N,D0Y/X$,K)$RT&9_;6IB]-@V5%QHHG?2%Q#<=P1RO MI+VF0'`-_XRI``QBS$3A0[W/93%F_Q&/>W4-;<9%F^%OQ-+2-$`'31F7GI0M M)NUN>W$BI1^*7WMCRSMH],LA[";XKP)(7&&T^)P^X&.X"AQAEU>S9JI];GL9 M;69M5K;19'?[V%B-[=/`4+PC[B@KW=.]@!8*>M]!"YOG,I;\'I<3WS`6%IOM M+H^?3-44U6@\14]SV!\I'X9(..%R?'V<?F;`YW%CN7%[?(&R7RI^E,I#H<85 MRP4U<Q:U4O%_;"5(9I3/'SSVRUL)^KTE"!B7N\3K#RJ/EEQ4*T%?B<N.6['9 M726^8#AFC=)^.BV#/K?#ZL"B^ZW9ZG#S9I(OL)58TDJ]K\1N+GJ-S`!3D=E> MP@3OXE1$P..T%):11DJL2.[8U":6C1I;.$:4MHH2*<30,YG:MN*\+W$C[UOQ M\4LV"P"X"<(!2!LCJ[@*PKF@)8030`*$1ZG%$*KB4?07]#K-QNP,_'[J\X0C MOY<@`YH)?@M$*1:7HG#I3E0HW<6U5<!C-^=EI>.GU50]_)5\4HW0#T"4XFEI M-+5>A\C%$MI*B=V4FXFO/9`IJQ+<2G^=5EBI'>"X,,98*QZB'";11B!IA;^[ M#8+>X>UQI#DVY(NHBH%>THK=H[32"C#-"-\&2LMS8+\>`JHVD*$+F<);O..U M+5O*G`1=\L8F,(^_*_I52K4`J1@PF2EQ6PUK)2UC75ZQC8XTF(8__!$A&E&* M#*'"9%+H!+FG0*3N#_2+,M?G%EJXU$'8:S(KS(V=PDI;>][#U6<L4XBS=O,9 M4((;>2`[)U^:`1>I&?!LQ$5O89$R&P_J5:Y%@ERW%!4V*BH8GU*$9K!9+!:U M9H!HEL`VX@I]R@`DN@.'HO)X)+=MZ>WA$)N>"%KJT&^E,2^5]N94$0H&`Y2" MP5#H!/PU2>*E(H@\-*_7X_&4E)2@H]>+G+5(a)Z.ROSTLPX/-ZT'@['79*#B<: M>8_7A]@)5]B@YI)R\2A0RPMBQ&FW6>M>8W3,;+79G8@=)$5J;G:#"[4R%T;) M`+03O(2P!X.GDKF8ZUY$U<@OPE,+NS7!DRIK"$9>TK$!X"UA[?%D=-C,ID+C M3PHK/]94YQD+36:;@TS2,M6[W%X.E=L<057AW?*]EZ+)O=@JY=8T6JW-1U15 M`&&$`67%9;>:BXQYWRJLP'3X=TH+CKLP,^6\K5?HN]VGCA+Z&%%K?-%_VC#R MC/FG2<26CQ]+GLT6XPOZ)27%X?,J[`9'H\@J*CHZ&O-2P5@IS,]97SY?#-#B M<Q)?F)E0/>NU%6KEOQ6(VA/W&!5.L7MW,7%"7@&8SNX=8N7EK#ZBAX$PDF`_ MFT=!)"MH@(H0*YGI[A>IP7>G?FF0""*9$:,DWA56%@/=7#6&4U&LKY+P.'IU M/3KM54M+C:@'L.?MLEM,A7G9F1EIBQ>G+EHX:=*DU/<-*OH6S6TVF>:)T`:; M%)[:`&I97$..*Y1[?0&X5O+00$P!?](?#2U[KSJ`K9'%9,S-SN16/_&3B6IF MWBPK$;Q$R?UV!N`V,BHM)=M'.*L-XV\U*\[\+\;/%/ZD-AR7'Q(%O;!XT3<* M*Q^Z71[!B]S'?GJ!YDH/5;=C"7P2+Z/"5%(,N[-/>:+(B^D?B1+]T9;:P%GY M'@7<0EY2I"]<QMH9+_>$RO'L_"J_UX56&*I,.^15TG<2`'%7*2]L'ME4K"0F M/NA)R\LW%A4C9P1YY,H\(N@V0_)7U571+]>@XC7'V>0`E:(SHL.(#I@I7B;I MI:?Q"^+6L'M6<R^(,F/Y1F;E+^;TC,QUV;E&Y!G99?V"/^<..M[-)5>I*Q?* M6;*58=1'W)K!;^'(@-!!<O625N]"A95_9F>MS\Z)H'<OJYWF]D@P\V-N'AJ@ M2/;H,OL,BITVF\TF3.BL8Z?W[H435._WE2\&,J5#CDOA9BK@R+&F4G\]?;P- MMJ#Z@`XN>[<WDN*+\U^&PGFG28&[]/-DI[J.F29R;(ORGO1\,SD/@J7$3$V# MKU#AWDV.G])W*O?4SFN2?EW3\G<9G0P1*OMU^0ACI1ZA$N2H!$-EOQDK9Q$; M?AHFX4C)CP>I_C=A)1CT4\$M(8*+Y=8?#);]^JR<1!.:S&@<@N(HE$QF/)O# M@#EPB6,`;.PE5LJ0HO.B3*:3JQ:'TXERFEZLX[3J=H;*@;L$=+KU<%4Z'R." M^'!36-PH^>?`^M:+1$837O<`X*Y+R<G-`&P0K)1A;8L9L=J^8#':&;/%BIG! M*E>C8)CK?BD#(R$K)Q$GQ`I9S")&FW_"A"TB`@;S4J_SZF5AA?@*3A2.F)P[ MA#_Y17&1";DL3N(HA"XC*ULE5K!I)IP4%TJ!J^%G["I@7K!]+E=>W7:)64%^ MZ0V,E;,!P8E_@6#DN?H:<[[@15Z=&@=`!WBH+?;!6I5*3>Z\F@:DGTGWZFZE MKINT-K&_"[UU!Y1SQVCI1XI;BXUY9Q1,&C(M-AN>0UZ/2^W+=0!@?!_>@IA* M1YL)E[&[/->`E*?FKC>C4IF5$3A=&*"^/PI$CHNHU?".N6@'"Z&_=ZAAP<XM M^AN5TA4H<ZF`?-E]DV/QN3>4OGC(U-LE7C"8,<-G#&[.;JV,QO$^BJ`WXBA$ MB:!/2'%JFB(VU026DU#N8#LNG1)=;`4B-,9-'Q85Z0@.0J7!N#!=Q"&/*,$J MCZ110.1U.VUH>'*SU_W`>_\ZC872)#8K<7M]RB0"2FBW00K(>TG/N\GA%Z8V MRK)!C5(-Y^S1DII@!8\/!65=9N`YIE3*4[_7A/)BA%:B5[=)W2XAJW1*T`5O MI6V7*APCSU%AA=\:N[J*IR%NH6V=).-#0M:LC/0ZVO>9116:Z%E)<:!76\AR M\V=Z4I(%LVE_*,?25Z6+]M-3G&8N(ZEYDE;!HN*TX_%!"8XT"WU<F/HO55+A M'!:6$^+5-7(/XVC,%Z9W9%!D5E#4/U>C,(\*5K"H%.'Q24_#^0V<X(#J_,;\ M:G64*+<SCTSOVY1[-(3?&)94((EU/G='A^MNP@I-^ZQ;*QY/3']'Q<J+%8IF MT;*RAQP+E'MCB>#<`L"-.L9B`U!T&J'O=%FQ/<-#Q",3U;!`MV#EB"PJ4"_K MTY(H/I21N5>YMU2ILJ^?2NO-%LZ/S,HY$3C_8]&BKR5.WO4IK,R6IBWO(6PL M=I+CTZJ$:W>IRB-1(a)$H9Q!LO!D.MK/S[026(APN5?"$"Q>D6LH)>'2Z:O(HN M):E8*1#LS52QMUVSP`I`9[7SH\R@_$^DU,8SN8M^5-P%IU.903RE(SNYZ*3D M::.HGE`,'EE#)!7'Q@"Y6H):]!2]4J_*^)Q+M2\03I0VY2,U-X+=&\'O36;/ MVTOUOF.CA4X'))QV:UCAVM;^@CKYY%\,7W_MC3>V;'GGG-7N5B7ER(8.ED06 M-NZ(DN69A@LK1`J0)'5:L7<[LGYODTR&E)0CPM*@SH,EGDO+1'F68A-R%6Q. MQ09]++3""@4?DD#"&R0^:ZFDFGC6J:Z_2('CI%5GK/<.=^0`[42%MN,&,%:H M9;9^HN+D3ZZT=+2](R>_D.?!3G+\'Q.J0=B=68H3`OAR9J5T[UJH]I,`'QXR M=L*AY/Y*Q?TR*S`]/3-K?4X>S8,IXX/,[;[*,(U)="NAZQ1E7]6*<RQ2EFA] MGI%(L_:46!$.RQF)DY?SUZ+<($K)%7-05`'KAMMO&K)9$S+>%]]ET`J-J9LZ MH'.?6>J<^A,)7>/'O"WGB)9-VU2E\6W]CRNL5&>M6Y^=J^_;7LZ8F7O\2I[R MJYSLG-R\"![_90W?61SD>IEQ\E`H%V<I(\5!EY,5'AW6\;M&8V%AL6YTN&+S M^=NDV<(Y<VES<^;LI+>9@&R?PQ+T1]CC/>2\9HDV9K:P?"E*F.K%S#%P"2UP M!T`.A/@:0`++9]+5K+LALUDSJ(<4![]K4+*3N]D[;Z')K\TDV*Q6M%/`8K7J M9A+>XE.PPPPR7[OVE%@9HD)EX""*1J\6E-TQIY+)^>J;J!,WE>9=AS-&D]M= M9'YE%$O^HEV1/$>L$-_60*;F45A)4$)I6FHGEK/GR2RUVU7*)2,G!ZV/7&36 MZ;O+);0'FF0NKDEE*)M2WK9)9;/#J+H"<154$V:T_$0]_'],D5$Y6T;@""!) MUA`1)`S.L?K_*%3JRX)D8I.9[=42G>I^,LE^^=:K*PR5ZA!7=5Z^@.=6B"_G M>846#%W0MK8I29@V7J&HE#-(B#%RD\4')R(')5S$IA(;2VRE.##GU8<LF?%1 M4\;BX+CX2#:(0D(1<7'OQ:80=V9<#!D*S'EGTG`"2M>F"\D\O/MHAAXJ&!,B M)=B!(H#8;/ZP]YT6*P$'K]!C_PH#@P6F,5P:6A)4IC953%9043X0CDHYQ41` M8K,A_S_TT]_5R4K##N(a)RXW``(\.!(;B$&MDUL)SV^FE31>5.]78;@4HU=6TI M)@@2'!&93<?./&?0TANPI*C81)&QVSDNV`\.E3?>:UQ3!>7T582_.5I4CK$] M(QP3#$E1T8EOYQO":<'/?A3(%K$=-P07OL<D@EM^FF[R?**IHO(4W516J4&E MC(!"-O903$S%187%U5_K8&)XX\//88AD&K#$,%R(N&#M<B)RKU%DQ:IVS9@! M/3KU&##RI=.-*:)M,^Y.Z-$I]M8[QFUH=!/T=VN2;K^UR_7=$X8^NB=RK5US MQ_3M>4-,CX0A4S;7J9[4GD+4E_#7_Q0A@4HHR#0*B=\Q)H5&HPE^H`?*!S\; M448J)R<O#Z4^&"XTT,=;\O5AH;TFP-H9;>3,(&@Y6^\3"OI$`36UF%RI4Z]N M9D=-/7!#^+:`RJ26VEK1(Y7?'?34/NS%46&@N`DH2)\@.3'F6>$./5"^.)NU M-CP'54+3#@26<)U+-P:":;$@G*9HZFZ_#NA2=^V/.:9?I5_Q856M5UOIU^K! M).:SL">S&"H55,\B4.P8%!/")!^!\JX.)O._+TO/J/A&JVW>A3Z6C?'KZ9:9 M2I_-[F5YIH(NV@PN<?;XN,:S14[XT2#^Z@RYXAAVL_GHCUE29_GU7``52U=U M(YVZ=XEEE_TCM&OUD.Z75FV!!]CZ!/Q<4JP4E+S<G&PK?"<,E!?/N1>GZVF; M!3^7,5@".(a)F(./YA?>5,464WU>8$K)1O8D*\3_7ZDV%[5U^ENPZB)C?(]:K8 M]H3FW.TX2G;.R^M26&.QO;!'Q)U2>F.-"I50T"]T"@<E>_VZS**P*?0Z+$[- MA._K3:SGSARGND5'M;!>0>?#&K1NE+9)('J%?FNG`UI42ZF>:<8_9"1]+_PW M%X_0!VQK*1RF78J@^4,":(>M2OJ?5&NKBH/.,E%QD0U&6,]24-:F9VO4[0ZX M=E&.C@31N?5-=21A8;^TN"?L(U;1!X\QC4*_?;".7IU`*])5>KR!1C.V@CK0 M1\RZM2,7K0^>QR[3N7R?"I5R1520]4&@Y*/I@T#)2$_+J/[\^>?G4S(8_E67 MNK#HYS<-D>CS!B\7EFJ=7G7VKQV4Q_P0W>D_2(_OU;3BG\G%;'JQ0J\BVSR^ MBU[%<TTS<G4C7L!'M%*!"A5)5*QT_N1DK\_*1*"D+4Y#GAS6O?EYB'(73G)4 M_=40F7:@WV!385&%1-M)I^T:=+P(RL^C-"U/Y;A6C_%-M"+Y_?8INM(V1O<+ MA]*IQ@S,?I4?$-U[ZL<PHB!V4F42Z@DJR'UC6H6+2KK):C%A7P[9H]P<!-2Z M11,G'?O2T!A]`'T4E?+P7F?H\+.$LKM!,I'3=3]V.E!V-4VABO:`;D6JP+N) MZZ1F898W-F6_^AUJNY)4J%3KHY)Y[*L'[U?1LS!MXD3O]\\;&IE"GA(=Q4)= M+;W?:PZ3U-Q8RG.E[L?VX3^MAG1]75&H:MH7[@,UK!X0'8;,0$EP-]-;.R\` ME?4U[R5JZ?&&W(F3K.=>-$12MS5NMPXJM-?K]=9=HB0IHA]^@^['OB4Y+'MI M.5FW(O5BHL+5Z_%5(U7>83,E_35*)_.C/X,*X<N)X?30CXY)D_+@ZX8(IMGA MXJC(,VA41"7:G^)%QXVZ%OUU/S960FPE_:QEC:"7'%&Q[AU_-8/E%G&OM4[F M1U?;VN"SB7KTP%?!A0O7ZCJ]R(W#0:*.MFT="95DJ@/WR=7:ZWW+W9)6X:B, MUZEWN+5&JYS>^6I8I37T_9LUYFVO!I5PR^QI>#PQ`KUW.G516D-XU+@%_4-' M#L6-JPXSJBVKM.Q15RR*&T2V,3?\,[A]7<Z&&T@Z1D5[R&Y5<,TI61`C>0,I M:C9Z:;/985Y<Z,>'$B/2RPWIJ6FGO]"`\CYTVR11D=7*$":R-ZLM\S;JG;0] MJ,D1-M^M34)0Y1,M(AD6%\5KZM4FL+"J0>7X:8/RFBX:>:+78\-R_&J/WWS\ MJP<2&Z%G8?[B-&W.K=YNDT5%\OCKQ#Z>JY3?6-7-H,.J,H?C^8R7;.[^N]A- M:8MF+?-?Y?W><&,,VT"T7.1=HG5"K^.W:T-#ML$IYI`6%4UT&&CX4V.H_$]# M5EI:>GK&VLRL=72_#4K*T4T=>J*RE`HH1:%YWU'3QMW>FN,T2.VQ+1-9E9;] MQTQ+&B9^T0CZ'M?1TL3U&C)AZNA!;86?]J14:Z=HKG7"Z.24I'MZ\@&Z=JM4 M2[9,3\FY.$TFP0/_$AF4#T]GI#-,\"\EZ=X?"\['Z6<2!I+N5M?&:5V&UCH_ M&YD5I9,)B=T0GDB*UZD7-43CG<'!NIF5_NJ`_%[IT5)5AE*3=7+"OT7`Y/YO M_IV1@2#!<L($I=B,07%$R#I5DN\D&U:>B%%V[(TLC6`ZZY[L*2'3HM^RV@@5 M]X_J('U.^Y';=6N53KA6!J3=L)7A=2HGM.>XKE+G;3492EO=/W5!^4.5+Q,C M<M$9RBMTG5F3S;:<_D0'E&>@<]WZ]=E82G(O+IM]I:Z^:U<^*GYX4`O*"]"2 MDX,!08A<Y,K'%;LG0;M*5G;N;VIZK]Z4GX_P0(`47O0JV96[4T.SHNH@4\E" M-E468RHB5%QL,EWPBNJR+@\_UF&)RK545S@:29ON53NO!SM(QK1C<E*<E';< MU6GZ]-%MY7_P\%1<-_GE$4.GI_25D^9M%4O?T#H9T2[EV:"[9_7K=][5=RO& M1466"UY]3]:LMC<<_KCW82E7</APYX,1=D*FJ!<P9DEQ3]+0U<OZ22!,'E^Z M9VF,%,@<ZG(J03;G;7:5OCU<RH^NDH*RY?&;-FV2EM?VMANRIN;R[M3H@I,6 M3\A6..5I586-(R+)<+==JLM>DN,5@_R2*1)*,?O@LANE#.3N]G%Q-TD_V%IY M)VSH+6]6'[Q<$@VUVW0<.^`I0R_KKIY/N\7$]/E%^Q!V1G?LV%%AOC166EEL MWC$F5DK9%>"(:,D-(LS:3'8CMU6R2'?A=GHHL-2T44*R4\VN0QU):8DY[;MU M?J3A5]L!=J5J6WDF_;Y;,`+]OK,T(OV^"[EQJJ^OKT9_\#^"_A=<TDA0>8X& M0P````!)14Y$KD)@@E!+`P0*``````!1>`PS8G(Q.:08``"D&```"0```&)O M;W-T+G!N9XE03D<-"AH*````#4E(1%(```$5````5@@"````;C>5PP````1G M04U!``"OR#<%BND````9=$58=%-O9G1W87)E`$%D;V)E($EM86=E4F5A9'EQ MR64\```8-DE$051XVNQ=79`<Q7WOF=G9G?TZ[>E.<`<2TF'@.'`(`H68X\-& MX4&2`ZE"44CLXD&A*JXRH:@X?J%P\I`RYB6FBB)QQ0]$#Q24"1\5XT)2Q42N MPNA4+@N=P$&'0'"2`-V=M*<[[=?LSN[.Y#\SN[-S,],]/;NSN[JC_S5:]?3T M=,]-_W_]_^A_]W":IB%&C!BU11S##R-&##^,&#'\,&+$\.,@RB8XCF/]P8CA M)P!F&)P8,?R$"1L&)$9?1?R0ZZ%IA8P3AB)&:Q,_N!K:KID`%88B1FL'/Y3( MH6_"`0]/M#`(,5H+^/&\T9[I+N!YBQL/]AP&(49K$#]D;)!11"^"K#1#$:.U M@Q\">#R1T\;\CR=RR)**$:-5B1\W3AR)H/@A)!B*&*UN_)#!0SX-A!]*.#$4 M,5HU^*$!C_NW$_PP%#%:F_BA`0]!M?-5VWJ/HF=^_L:[1V?<^==M'GWN1W_+ M>&6UT&L'C^Q[_5!O^C$2+G@H4>2HUF1W*T$04.["9IV.&STS?>G4F3G/_.LV MCS"F7$4T=V&I9_T8Z>1F''@\X82(\ZU!>=W$D@42SQJ"5CM_8=DS?W3#(&/* M542][,=((*B0%38W>&A$D!T`]E^<\+%^'2CJ4!`=GYG%76+R9W41KBLO._GC M@),;/$H=*7PB*G!H)0-SC7_(]K^>*LE*BJ]T0YWSA1!NT`(:&6;R9]4+GR[U M8Z1MM'B*'3MX@(IU*2%RFNZFL`,%K3QKY8I1L:94(KQ&;Q11JG.^]>"4YE1" M&MF087RY6@AGQ':I'SN5/SCD`%54+A85(/_8E^C$'-*YE]-_]8-O))`AF<S3 M73>@5(0K<O&D6G3#@$:I(WLCR!`Z=68>(_1'&5.N)OF37>YE/_)!C1_D%56@ M>9%<CPD\6I2U#[^$`OJ!-*M\*T?_4?7TQUG]DA05*EH$;E=5U:K*GG9KB4'= M%8'&+6;\K"[ZI+?]R`<J[0:29XZNN54%*:8+G_?/&F5,M"`;;%P0^F0172PC M@>/J@H0##QE(".-)QSV_1852&0[/2^EDG#'E&K!_NM2/?'NWX82/E:/R4:AZ M/J=]?E&UY;>0TTJ@EEQZ?]X40;R,8B9:@@()^47?>4(()WR8_%DS]D^7^C'2 M-G(\H[!-RE7%>%P7/E.?UC3#S-%M#\.)8#K<-)L73C-*Z#DJ^OJ5)J:Y2$RJ ME62!YP+YT-Q^.<I[<<8/T*T38XPI5PL1)B&ZU(_^\3N$4`,W@5BHU;4*GQ0C MW)?+VJ]GZIS.N;K'@..:29L+H77*H>W7H2L22#>%5+VYLBQ+FFS%[UCD.'7D M6&F$C_U!+(a)?W\R_N/_C.=-LO,960P#S=>M/8W;=/=.[D`0T$^&#NPA*@&K1* MQX`*?)!*2M=O'H4!-5R>Z':[4/EOC\Y`Y01I3T,O_.0QZR4_]>S+!,SX$M0# MM?7:_X8+PS'S"_58(LH5%?0_'U9U46`(&4Y3-4-7-*40QS4T-TL6C0T:X-&T M0BX?TV0H$>4XU08&2XS03`IYNN;:4)HI";@->A&.?:\?VKM[^U_NN+.]2@## M!H?-^0ZQ9IP>X/;N;1-[=DQV`MH>M`NO%T:H3AC=P?0TBC<-=>Z4:]-_[79; MFVE%1;&87N?'"_4&'YL(:4*HZ5Q>H<5!8N(*/5TLU^"D%AL"RZ(a)I/2QDM.0& M9][%H8A:E;B:>]<$3P@1@!16UP(!A&`(?_R174$Y^-4#4S@?!OE&.`"Q>W9. M`ENW<7NWVP46!RD1M`D:-8S@]:&DZWN,'X+_S4R7:K%$A+M85(^=5IP&CS'5 MXVD(;=N(!F((%#^U?"D^,!05'(!P"9GF?^4JI]6KGE*(;/;8+W4XAKG)5`4I M(?3:P2-M<+"[DN,SIQ]_9"?]@-J;=L,%3[C"1Z]M.--=_-`L0&AI;@IO^JRG MSRH64#2[O;%2BS.1D(BA:]<;PTFAQ(DI`$]>0=EBTS78#/TQY0['M9"W)8TD MD2_5HPE-<0L?1!U9UZ'RAH/0UHDQ4'+(H_@S__%&6*+/Y-2G?_`=7PCULMWG M7SP0(GC0RAA0@M>G#33V6G]S)ZJ:('*H4%$_6P#+AS=5+,O<P1E"=VY&HH!D MI:[52NGT,`#CTT7T4;85EV#W,=C3B0BZ(HXB8K1>J0@\\@Q90!3!H[@9ZTX5 MN3<.$?`3^L!L`@/XE;S$I9?MPB`2NFRWNZ%Q(5>7J?WC=L0Y<I)"M5*-)&/\ M/>/2;T]"#_$K8CJ]#*$MZ]%(2G<;E'/+8FH0<A=E-'.^`96&I<39?EMS1>CP M.;1C"XH+7)&/)S69L#*/[$+`S5C#X+3SWMMP=_D:W"#6@(%VW+NU;2:&WKUU M8HLY\9<ORJ`I^;(C%`"="N?`Z'&[KQZ<PM6_=_=]G3L/P7H9W=T21],G9CV% M*JX?@YJ+8<H?3UQ%>*U84:*B=.V&R/09OEA!3BW.90C=/*+G%$I5R$I(ANYW M;L6,$(@@,]K4S#3::YP"S>;038-(BD:JBA`UW=XK!8X[J-0=((=C#NA@@B<- M+D%O/?_B?H+Z-STSZ\8/L*\O$\-=GMXM:`O$FN<BV1;7'ICR?.P>MPMOU?/- M`->"LA<*[SK>K2Z.9@+W8X?$=V[\V&516E3*E3KH8]\<ES3-B#QH1N^L"/8Q M+MUVC9:)HYJJJ<6LE,Z`"K901`OYAMBQA\:MB/=!R*KFY$5T2=%#?JI\W#., ME=*[ZJMJXP#V]#]\E\`*G@P'M@>!B<TUQH\_LLM3-8?,)[_WT-[=V\G:U.70 M+D@M'-.'`IX0^[%;^"%XKCT9M(&E6AG^&\WP<#@@9/,V:`*O?FU(/R_D"EHT M'1>%2AV]<\H[-,XC9*YY_&%1KS4A<F4N2L`,+K_#97/`6&2N<@@WT.B(+8[2 M.`!@-"5[)MP::>_;!6W*L\S6F[H5S]'+97/^^*&,O'3'GB6$JBS7('W'UR3C MLNJ<*3)^MX_SDHC*BJI6+B63*2CQV2*JU#R@@BP((=MOL\#Y(KI0-G2T2$QU M&69M#UJ(>KD5#*@$-XYCR,>9!"84Z16;O0^10>MT3/6KW?;*A"A\4)>7/_K; M/[[*&W*%]O!JL:ZNVY#B;Q^+&2#EF_.>C8`:GD-7#8`I@DJY)2$Q)$:X7`4= M/=,T>URA<4T_@-,0,@M/S:&=FU%,X$HU*:E5[$X+AR_![4@(9=G<W;=/@/5, MX]0F=#/H3O2*#3P;B`M*[U:_VL692:%''J&>+YMKTW_@J;RY8Y^CJ%:0*P/) MV-;-4<YCH7;CI%!2D%I+IZ#SM)DYSHKH<7K>##\X4HW`4IO_S0)"K89.Y]`- M&12+BO6RPO.!WGL(R^8H8^,/X$/L@)^"LA1P(24?]Z7=5%+"">2GGGT97J\O M:*$A,%U`8Z2!=X^7S?G@A_X#)+B]1&+U7*&4X?@5@+'=ANJJJLI+L=0&D$4+ M>71R03.#Y=RA<0CA(63*)`[]7Q:-)-&`R,F11$0KT6^[$TJX.TUA=T2FG79Z MN;G)1&D6]ZO=K1-C!'\=#0)->V;?ZX?V[)ST=:!]TJ?ECWPGRILS(ANA?#52 MJ,?(a)4+2X6I7K9;DNE^IRL287X*B6]$.!0RZH<H[7ZG%)!_"I!9\U0C2&T,Q% M/2<N\K(F4O[Q82V;(VA'UMAY_,0LH0S9+O<DPNRA76/I5[M@%H8R]D,'`82> M?W%_>UW0[>6/P>9/R<I;7A&3J7A#L?((6ENAR*DJRBW.YXKE3$JZ^6KN5!:[ M1J@9`>1C"`E&`0V%L&8[Z+A%]@N3%8RV=0P":.TBHE_M&I;5SK!B'<"$@\H) M4NC4Y2-_VE/>JG4M&M.]!8N%>K90OYBOYV0U5]:/?%DM5-1\X]#R9?T`*R62 M&N)*"]6:EHES=XPU8>D0."L3N!DAH!N-OI.5>IRK=FC\H(#+K7"^6GLEGX2] MQ)72\]ZO=E'3+1[6;`\AVK7WR^:HY`\9.0[EK527DA*?E^O_-;5HF!_F:CF3 M^$8:F3G\E9G(`W\<2\7%B\54/I]?/SAP[1!__$Q=49UKA#BNI:T1#*%[-J*D MJ$_%2FJ9$VB-'YPJ$LAC8R[^\;8!;',=A6*Y0_<#)<<X!$N_VK5R7GCF,9`> M!]XYUODB*S"H/..A<#7W8.,Q*OW-][,+E2HOQ76KX_TS,K*[B0T$M.+?&K$\ MZL)R[8ME<6.&3PQDE.4O9"49CPK?'.=_?8*T1@@'(4E`5R;U2XI237'>>\L% M4D4"S1@<)'FWMG2IVZ;Q5@VEPZIG[4(FZ%TT$33F`E7"^\3)'UQ^#S:^#.`_ M(%@^94Y?L[-PJ?K!Z8*U)XBM@-::.6W$\J@'WY=+BB9%^7IL2,Y?A$)7#7"; MUL-5?<\0CVU&5FIK=OK&1OVW4M-27,6^6MNQQANY8K%IY(;OH`AZ!6[PHS0P M\D6Y#7N`X/BBK*1?[1)TK<<?V46.YPB$ZN[%.M#BA\;RN53A$I(N?`[/Y!J9 M#9AICK0CEN?D0AU^!U))7E7R)7T-SZV;!-,!X#"$W!:190A=G48;XGH$-ZI6 M[,CIQ/BA7U;U_(O[<8/?GAV3U$K1Z4`O_[6#1W"-!G*I]:M=,NT([E+'.0\Z M7QX7&#\TFP^NW+P*\:($W'KV8F5N26D5$+0ROK5]SZK+!9404!\8@,J9<%Z M61_GME[#F]&E;E\"\MIX\>8->GY9425.(2#'8]E<ELH/2^8GW!0'U$#/![A0 M99S.B9-X.FB#K.+N5[OA$F$2`C>'VU/Y0X[(7*[PDL@7*_6W?I?%:7>6!T"S M0DB;6MQ[9W3()1-BG8L6"B7=XMS`&U=70`AA-EZ\^4JT+J:[#6*V.5-/S<T- M)`+KT.A=N(\TX80/V=FU[XU#E+SRS,_?(`@!-VC[U6[;1)BP\K0G"9,0W5A9 MW*G^9H=35=5$PV?]T;E2S:ZDV3!#-H3.7*B>6ZKS')+2@Q%EJ5Q5DR*Z?T*P M(-2JR<L0NG;0%#XUD4.^@'%<.G6VS<@=D#E//?LR`3R@Q[OYB3QM#W42*K2X M`=HEL(MG)%N_VFU;F+R*B22DMR<M>O7@5+@K;=OWOWDN6,@K8B+.9?.UJ1/+ MJ+$TK1E]8YXVXVLL9]J*\!S#'??VA^6_^M.D%.67(YEZ,2=E,AO7<8-);:F( MR!LO?FL,)42DU+0D5^:\B*"\$<:M^0M+P"X$G8?<)<!)GCN'@'D`G$JX%P3: M?'9Y[T/;W=HCS48Y@%A/"Z1?[;8C>?0-P'Z#ZQ?"6F`"\I_X\0N@"W3/)\GY M^J9QE)/KNN7#<P>F%T^=*S7G=AH+K_EF%*<U"^28$=(O\;QYU^0-\9NOBM1J MFI([CQ+#"2FRD->J*K)YHAM[67&HM87(U0/Z;T6N)`6%YWG<!HL(\RG5/_^[ MGW3CA3[]@^_@YNS(*I]=``9=/@W\\>3W'FI/U0R]75W3*P8>]<D#$V#[N1\] MZHD!0!UAO'/3*\_]8XA8:G_]MJ*)<9X[MU0Y]671FN;4FM$[CF72K5^#A1M7 MF$EZF-Y=%UR?9*78^MY):=%!T?2'++#IQF[XX@,JBAJ*E)MS,_:I(W;9^T` M3X@;OCDT&<*$-PS5--.(P$F!%@A`M62?;X_;)2_S;OO%XI@^D%('E80KB*C6 M;WN2(.CWSB\I+7NF*;!PAI"M6J<A5%+T.9]H5(AQM4)1SI=TCW:^"$>U`$>I M6I3UHZ`?-3B*Y5JI7!.-U3Z>,@<1=]Y9R%X*MX--M8UL1D,9&*W#[3_@8%_S MHY?M=F-@(H]*@;P7H2]G(.&'/(M2J^JNLQNO3D0%H>55<R.$8D9H,,5OS.B2 M4"F701-+\J4DRJ>X`AQIOI`6BFE>/P:$TKJ(O$XH92)R)E+.B!5)4!OJH)?^ MAA,^*(RMCQR]`FH;32^&&!)FKANEW!FC9^V&OKS4=U0RO9V4?UKHX:0!]#?' MNL[U<;1<J25BD9UW;/CED7F[/H9<&T>1?0GWC.LZ=ZE<!PW.=TOX0`F\\R"< M;H9NHUF=XF#E%YYY#`R2MG>L!PX&C@GJ,NY-NVW$-!#<F'MWWT<C,4Q(@]WE MJZ.&OI<(E?_`X4BPOKVS7%)%*0[\^=^_.W_VO-P*$FURL86"1F.&4Z'A/#"D M!B0F-L;O'8]#(Y527N)KGA]6H,<)Y<<7'G[BIYUX-J\S/D-P_>;13N8]H+/! M+'GWO1G*:0K@$F`IWVU-^]MNAQ]$L-[M/=LF@H9.F]Y"W"YPOMZ=WN''#J&L M+"0E\7Q.^<4[<RUO&P9"GKZXOYG,#,3Y0DE)\Z4VA`_A%R>"Z%>G]H:`C_50 M@.PR#-X.P0B<E$[&1X;UJ8_0HXG[U>Y:(G_\(.+7?N0JJO'1",^_,[-T_--< M@S6M#_TTF!4+H6_?OF[3>E&IJD(U)PI<(.&#PPE!\ER&X&&TJHD/ZCQP.+CB M(JI4C-#/+0-6J,&*#=\0<L@QRW^0EOA-@R*D:DI%AZ!!%GZLM#M!^)86`P^C M?N('QW!NU[!UFA95I:8.Q(4'OS'2@I`--PBY1)R1?]_7TW"A7*ZGQ:H;-H&0 MXXD9AA9&?9,_E,,V7(J)?%U10%_;,BP-IJ(MA!!FA$##'HV/9O3OU`M:V0$/ M-UI\D>-(>#XS(a)Q.C_N#'H;RY:7T2R65]S]%OW3)D7VQ`F!':-I9`NL^ZFA0U M7\SX(L<M*AEX&/7!?X!<WZ;W],*YG0HY616BNB_[W8^6[+N--GT)K4DA.(E' M^5NW)&HU-8IDD2>Y#7R]`C06CF=F2:Y\,;]HIC>.#"7BL<ND2SZ?R\+OIM%A MFI)R6;EA["I<@8]GSUGIN!0EU&E_&R81JC5I<3F_N)3W?77V9_!]U5"8_)Q6 MNV9Z:#`]E$G3E/0MW!Y%/+G-\ULZGI^FLC('XOR%4C4IB7??..C8@(!S)XW_ ME4HUE>`I/Z#M]D2WC1R(a)J6,?O;*_M1J,_,TI*#P\.$##3\=/S/[9Y"T==LFO M#AV%W^]_=P=-R9.SYP@/_^\O';2?/KA]&^[Q`#R.PN-C5Y&?X96W#D/KA#H] MGR$1C_[3]_?@(`2%R>W^ZM#OWY[Z(a)W6Z=_=].$B\LO_PU+&3]IR'=TU.WG9C MU_&#0Y3]N[P6BNP06A>KY\N<ITKHWL,7[AJ,J[[>:E_DD&TSW"`'X*%_FU#X M,0IN!O``/W6.'Y,I*4N.^PD?$UT@7I[\Z4MD468QKEGXY$JYX1Y3/I_/`N^> M-:0ES3,`_>L+O_Q\;A&PZCD8F84)?]'_3GT`X/%%K/GG`'C@\?[Y[_=T55F( MT"#',\>N037V[(WPL8CJ7'GJ]1W%)B1X'&!HM+4VD&/2],PLO%D:\.Q[_1`H M2)!X\]#O0:EX>-==WLB9F87>RB[EY4KE9R\=O'_R%E]A11!BIJY%61)T$ER! M[)*^'<7/C.&_5*YL&AVZ<^LXMO!R'O!@%LX:.L_]DW]$4/:`C^^_4V?BMX]\ M0'A(QS,`>.`Q<"_'+$SXVP\;\@2`;6$;)ZF@?T'0P2MZXL?_22E.P\2/XRN\ MGI_@=2<(-;@YVS?HI@VO-*63`'3BX4$J/?B:T6%@+#2K;RY#Z->$%(/NR2Z= MW#0R#(FAP?:5;%-?!W61TDP:)FK_P*SF<`Z<!]@F&!Y0F_GP,+C`C>3O*QZ9 M/@EE``^`M)*LZ/=B+!8H!JP,U8*8`J8'3#ZP_4_((P+!^+%J\WTY\)>"EFA9 M=+\P5$V0;VV/:QWI;YY`<B/'K>9Y?D3$@9_.D1/4MP9(^/CT.1`:P/=DBQ;T M!-`9H,/("@/T"AQO'CKZU]^^J\,>,L?@Z68$%\'D-9%&X#9CL!]N%CCIA\9% MT%'AX:$\&"'`;3C\`!/#7PK(A%LLO0OW&%#FKMO&X>V!R()W/GWB-`$_9H6$ MOPA>!8P"\$[,CB.,4VYW"(@CZ.C>Z6]N$>0)(5_($?+=LH@0MQ:B2QKT*^BJ M?:__QCS]X:,/$@9FZ*3)P7'?.J'#0"_OO(>`:X%W01LT;5^"KF\:'H0601\S MJS*YYX'[MI%%F5D50`C&"[@+WI(G=%]YZS#D__#1OS!/_^7?7B680/`,D[>- MFP(!]#T`'AA..,T9"@,L"2\'AB>0)%;'$5X.2,@W#3>,!3S0O;OA8N4H]ZE" M^-`X1/>E5)P*%XJ'FA&COA!'7F1*`R'W*25^D%^X-)L&9;2Z\>,+H:#"ARR" M&'@8K7'\X'!"*7Q\/7(,/(S6%'[($`J*'!P>R$XV!AY&JQ(a)_.&"TAQP:%#'P M,%I3^*%$41OZ&T,.HZ\*?A#U=QG:DS\,/(S6.'[HH>)9II-95T:,U@A^.K%Y M&'(8,?R$!B2&&49?=?S00(OAA!'##R-&C!A^&#%B^&'$J+_T_P(,`.0D?F,: MW:Y9`````$E%3D2N0F""4$L!`A0`"@``````]';^-(_8IX\D&P``)!L```H` M```````````A`"2!`````')E<W5L="YP;F=02P$"%``*``````!1>`PS8G(Q M.:08``"D&```"0```````````"$`)(%,&P``8F]O<W0N<&YG4$L%!@`````" -``(`;P```!<T```````` ` end

1 0

[assert] Proposed patch
by Gennaro Prota 30 Jul '06

30 Jul '06

On Sat, 24 Jun 2006 14:17:37 +0200, Gennaro Prota <gennaro_prota(a)yahoo.com> wrote: >Tricky question. IMHO it is undefined behavior. When BOOST_ASSERT >falls back to the standard assert it really depends on the underlying >library. C90 does not require that assert works with expressions >having non-int type. In C99 it shall work for any scalar expression >(which anyway "out of range" is not; it has array type). > >We could perhaps protect against this kinds of things by using a >static_cast in assert.hpp (probably documenting that) I'd like to fix this problem. But I guess I should better explain that "perhaps". The static_cast would prevent using, for instance BOOST_STATIC_ASSERT("foo"); That's fine as long as we want the user to "perceive" the problem and be forced to write, for instance: BOOST_STATIC_ASSERT("foo" != 0 /*or nullptr*/); Otherwise the following choices come to mind: a) # define BOOST_ASSERT(expr) assert(0 != (expr)) b) # define BOOST_ASSERT(expr) assert(!!(expr)) c) # define BOOST_ASSERT(expr) assert("BOOST_LIBRARIES:" && (expr)) d) # define BOOST_ASSERT(expr) assert(!"BOOST_LIBRARIES:" || (expr)) The last one is for those who find "||" to be a better "separator" than "&&" :-o Looking forward for consensus and patching :) -- [ Gennaro Prota, C++ developer for hire ] [ resume: available on request ]

3 17

Re: [boost] Computational Geometry Library
by Arash Partow 30 Jul '06

30 Jul '06

Cromwell Enage wrote: >> One of the great bugbears I have with today's >> implementations of geometric primitives is the lack of >> a common interface between all of them. Take a point, >> for instance: should I access its coordinates using >> the public members x, y, and z? Or is that X, Y, and >> Z (capitalized)? Are they actually member functions >> instead of data? How about the subscript operator >> ([0], [1], and [2])? (Personally, I'd go with this >> one, since that is what the BGL and uBLAS algorithms >> are currently used to, and a point can be extended to >> have more than three dimensions if need be. But if >> you want interoperability with some of the other >> geometric libraries, you'll have to deal with their >> interfaces as well.) access types and methods relate more to how the back-end of the library is doing what its doing. for example if there was a very strong matrix oriented approach, one would assume everything would be constructed from vectors etc. vectors or point structures, simplex forms they are all much of a muchness. there is a minimum amount of information required to describe something say a point in an unambious manner in a particular dimension, any method of definition you use will have to use at least that much maybe even more information. the real question is does it matter? one could always use a set of adapter to interact with objects in a way that feel is satisfactory. I believe whatever model is chosen, there will always be some group of people that will disagree with it for one reason or another. >>Looking forward to seeing your work. Its already in the boost vault under geometry and can also be accessed from http://www.wykobi.com Arash Partow ________________________________________________________ Be one who knows what they don't know, Instead of being one who knows not what they don't know, Thinking they know everything about all things. http://www.partow.net

1 0

[Boost-bugs] [ boost-Support Requests-1531200 ] performance of boost::regex
by SourceForge.net 30 Jul '06

30 Jul '06

Support Requests item #1531200, was opened at 2006-07-30 03:57 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=207586&aid=1531200&group_… Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: None Group: None Status: Open Resolution: None Priority: 5 Submitted By: Nobody/Anonymous (nobody) Assigned to: Nobody/Anonymous (nobody) Summary: performance of boost::regex Initial Comment: Is there any differenc between PERL and POSIX regarding the speed of the matching? does the flag match_posix affect it? Does regex implement Knuth-Morris-Pratt or any other string matching algorithm? Is there such in boost at all? Cheers, Doris. ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=207586&aid=1531200&group_… ------------------------------------------------------------------------- Take Surveys. Earn Cash. Influence the Future of IT Join SourceForge.net's Techsay panel and you'll get the chance to share your opinions on IT & business topics through brief surveys -- and earn cash http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

[Boost-bugs] [ boost-Support Requests-1531178 ] replacing IsBasicLatin in extanded syntax
by SourceForge.net 30 Jul '06

30 Jul '06

Support Requests item #1531178, was opened at 2006-07-30 02:39 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=207586&aid=1531178&group_… Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: None Group: None Status: Open Resolution: None Priority: 5 Submitted By: Nobody/Anonymous (nobody) Assigned to: Nobody/Anonymous (nobody) Summary: replacing IsBasicLatin in extanded syntax Initial Comment: I'm trying to create an expression that replaces the \p {IsBasicLatin}, that is [\x00-\x7F]. I manage to do it with PERL syntax, but not with 'extended' or 'awk'. It simply doesn't find what I want it to find. The expressions I've tried are: [\\x00-\\x7F] [\\x{00}-\\x{7F}] [[.NUL.]-[.DEL.]] I don't understand the problem, or how I can make it work. Thanks, Moddy. ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=207586&aid=1531178&group_… ------------------------------------------------------------------------- Take Surveys. Earn Cash. Influence the Future of IT Join SourceForge.net's Techsay panel and you'll get the chance to share your opinions on IT & business topics through brief surveys -- and earn cash http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

Characters outside the basic source character set: what guideline?
by Gennaro Prota 30 Jul '06

30 Jul '06

Hi guys, do we have (or desire) a guideline about the usage of characters not in the basic source character set? One of the Adobe ASL patches for Boost <http://opensource.adobe.com/wiki/index.php/Annotated_List_of_Boost_Patches> (see is_base_and_derived.hpp) concerned this issue and was recently applied. Similarly, the bug database has: <https://sourceforge.net/tracker/index.php?func=detail&aid=1461533&group_id=…> In short, while the standard specifically provide for behavior in translation phase 1 (!) many compilers still have (supposedly) problems with them. Should we care about that and/or give a response to 1461533? -- [ Gennaro Prota, C++ developer for hire ]

1 0

Re: [boost] Inspect Tool Update (was: Boost regression testing, status)
by Steven Watanabe 29 Jul '06

29 Jul '06

AMDG The following regular expression seems to cover all the cases: boost::regex min_max_regex( "((^\\s*#\\s*undef\\s*\\b(min|max)\\b)|" //#undef min/max "(\\b(min|max)\\b\\s*\\())|" //min/max(... "(\"[^\"]*\")|" //character array literals "(\'[^\']*\')|" //character literals "(/\\*.*?\\*/)|" // /**/ comments "(//.*?$)", // // comments boost::regex::normal ); There is an error iff match_results[1].matched is true. All that is required is to use regex_search instead of regex_iterator and to skip to the end of each match before continuing. In Christ, Steven Watanabe

1 0

[Boost-bugs] [ boost-Bugs-1530999 ] permutation_iterator does not support conversions
by SourceForge.net 29 Jul '06

29 Jul '06

Bugs item #1530999, was opened at 2006-07-29 19:39 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=1530999&group_… Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: iterator Group: None Status: Open Resolution: None Priority: 5 Submitted By: Daniel Krügler (daniel_kruegler) Assigned to: David Abrahams (david_abrahams) Summary: permutation_iterator does not support conversions Initial Comment: The current implementation of boost::permutation_iterator does not support compatible conversions. The below attached example demonstrates the problem. The reason is due to the fact that the converting c'tor template<class OtherElementIterator, class OtherIndexIterator> permutation_iterator( permutation_iterator<OtherElementIterator, OtherIndexIterator> const& r , typename enable_if_convertible<OtherElementIterator, ElementIterator>::type* = 0 , typename enable_if_convertible<OtherIndexIterator, IndexIterator>::type* = 0 ) : super_t(r.base()), m_elt_iter(r.m_elt_iter) {} is provoked in the example and is generally defective: There exists no public accessor for the private member m_elt_iter and thus it's access is not allowed at the point of its copy construction. There exists two solutions to fix this issue. Since I'm not sure, which is the best one, I propose both: Solution (1): Add template <typename, typename> friend class permutation_iterator; inside the permutation_iterator class template. Advantage: Does not change the current interface of permutation_iterator<>, disadvantage: It provides friendship to every template permutation_iterator<typename>, which could theoretically be hijacked be programmers, which define their own template specialization of the c'tor (See http://www.gotw.ca/gotw/076.htm "The Language Lawyer"), although that risk is low. Solution (2): Provide a public accessor for member m_elt_iter, e.g. ElementIterator element_iterator() const { return m_elt_iter; } and call this member function in the conversion c'tor instead of direct member access. The advantage is that no friendship is needed (;-)), the disadvantage is, that it adds a new public member. I actual problem with that accessor for the internal element iterator is: What expect users, which position it corresponds to? Is it its current position or is it its initial position (which is true, of course). The last argument could be weakened by enforcing a more descriptive name, e.g. primary_element_iterator(). I will provide cvs patches in the following minutes ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1530999&group_… ------------------------------------------------------------------------- Take Surveys. Earn Cash. Influence the Future of IT Join SourceForge.net's Techsay panel and you'll get the chance to share your opinions on IT & business topics through brief surveys -- and earn cash http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

[Boost-bugs] [ boost-Feature Requests-1530990 ] Add Maximum Common Subgraph (MCS) algorithm
by SourceForge.net 29 Jul '06

29 Jul '06

Feature Requests item #1530990, was opened at 2006-07-29 21:24 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=357586&aid=1530990&group_… Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: graph Group: None Status: Open Resolution: None Priority: 5 Submitted By: Joerg Kurt Wegner (wegner) Assigned to: Jeremy Siek (jsiek) Summary: Add Maximum Common Subgraph (MCS) algorithm Initial Comment: A very easy way to implement this is to generate a product graph of two graphs and find cliques in this graph. Every clique is a MCS. I prefer that you provide the base objects for that instead of implementing them on my own. We need this for the OpenBabel project finding MCS in molecules. BTW, a short hint how to transform a molecule into a nominal or numerical labelled graph would be nice. And the product graph should allow both label types. ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=357586&aid=1530990&group_… ------------------------------------------------------------------------- Take Surveys. Earn Cash. Influence the Future of IT Join SourceForge.net's Techsay panel and you'll get the chance to share your opinions on IT & business topics through brief surveys -- and earn cash http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

[Boost-bugs] [ boost-Feature Requests-1530988 ] Add clique detection algorithms DFMax, Bron-Kerbosch
by SourceForge.net 29 Jul '06

29 Jul '06

Feature Requests item #1530988, was opened at 2006-07-29 21:20 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=357586&aid=1530988&group_… Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: graph Group: None Status: Open Resolution: None Priority: 5 Submitted By: Joerg Kurt Wegner (wegner) Assigned to: Jeremy Siek (jsiek) Summary: Add clique detection algorithms DFMax, Bron-Kerbosch Initial Comment: C++ sources are already available at ftp://dimacs.rutgers.edu/pub/challenge/graph/solvers/ @ARTICLE{bk73, author = {C. Bron and J. Kerbosch}, title = {{F}inding all cliques of an undirected graph}, journal = {Communications of the ACM}, year = {1973}, volume = {16}, pages = {575--577}, owner = {wegner(a)users.sf.net}, groupsearch = {0}, url = {http://www.netlib.org/tomspdf/457.pdf}, } @MISC{aj88, author = {D. Applegate and D. S. Johnson}, title = {dfmax.c [{C} program, {O}nline], available at ftp://dimacs.rutgers.edu/pub/challenge/graph/solvers}, year = {1988}, owner = {wegner(a)users.sf.net}, url = {ftp://dimacs.rutgers.edu/pub/challenge/graph/solvers/dfmax. c}, } ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=357586&aid=1530988&group_… ------------------------------------------------------------------------- Take Surveys. Earn Cash. Influence the Future of IT Join SourceForge.net's Techsay panel and you'll get the chance to share your opinions on IT & business topics through brief surveys -- and earn cash http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

[regex] Thread safety patch
by John Maddock 29 Jul '06

29 Jul '06

With apologies to all concerned, and thanks to Aleksey Sanin for tracking down the problem, there is a const-correctness bug in Boost.Regex-1.33.x that strikes only in multithreaded programs on Unix platforms, if: * Multiple threads construct regexes concurrently, or * Multiple threads perform search and replace operations concurrently. There are two possible fixes: * Apply the attached patch (this has just gone into cvs along with an updated test case that detects the issue). Or, * define BOOST_REGEX_USE_C_LOCALE in boost/user.hpp and rebuild everything. Regards, John Maddock.

1 0

Boost regression notification (2006-07-29 [RC_1_34_0])
by Douglas Gregor 29 Jul '06

29 Jul '06

Boost Regression test failures Report time: 2006-07-29T10:36:17Z This report lists all regression test failures on release platforms. Detailed report: http://engineering.meta-comm.com/boost-regression/CVS-RC_1_34_0/developer/i… 256 failures in 22 libraries algorithm/string (1) concept_check (1) filesystem (4) graph (5) io (1) iostreams (10) mpl (6) numeric/conversion (4) numeric/interval (1) numeric/ublas (7) parameter (22) program_options (2) python (84) random (1) rational (4) serialization (24) signals (16) spirit (1) test (2) tr1 (51) typeof (8) utility (1) |algorithm/string| regex: borland-5_6_4 |concept_check| class_concept_check_test: vc-7_1-stlport |filesystem| mbcopy: sun-5.8 operations_test: vc-7_1-stlport operations_test_dll: vc-7_1-stlport wide_test: sun-5.8 |graph| adjacency_matrix_test: vc-7_0 csr_graph_test: sun-5.8 graphviz_test: msvc-8.0 msvc-8.0 vc-7_1-stlport |io| ios_state_unit_test: gcc-4.1.0_linux_x86_64 |iostreams| bzip2_test: msvc-7.1 msvc-8.0 compose_test: borland-5_6_4 example_test: vc-6_5-stlport filtering_stream_test: msvc-8.0 vc-7_1-stlport gzip_test: msvc-7.1 msvc-8.0 zlib_test: msvc-7.1 msvc-8.0 |mpl| multiset: gcc-4.0.3_linux gcc-4.1.0_linux gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc gcc-4_0_3_tru64 vector_c: sun-5.8 |numeric/conversion| converter_test: borland-5_8_2 traits_test: borland-5_8_2 udt_example_0: borland-5_8_2 udt_support_test: borland-5_8_2 |numeric/interval| test_float: vc-7_1-stlport |numeric/ublas| concepts: vc-7_1-stlport vc-7_1-stlport test1: vc-7_1-stlport test2: vc-7_1-stlport test4: vc-7_1-stlport test5: vc-7_1-stlport vc-7_1-stlport |parameter| basics: borland-5_6_4 borland-5_8_2 duplicates: borland-5_6_4 borland-5_8_2 maybe: vc-6_5 vc-6_5-stlport vc-7_0 preprocessor: borland-5_6_4 borland-5_8_2 sun-5.8 vc-6_5 vc-6_5-stlport python-parameter-test: vc-6_5 vc-6_5-stlport vc-7_0 sfinae: borland-5_8_2 vc-6_5-stlport singular: borland-5_6_4 borland-5_8_2 unnamed_fail: vc-6_5 vc-6_5-stlport vc-7_0 |program_options| unicode_test_dll: borland-5_8_2 variable_map_test_dll: borland-5_8_2 |python| andreas_beyer: sun-5.8 args: sun-5.8 auto_ptr: sun-5.8 back_reference: sun-5.8 bases: gcc-3_4_4_tru64 gcc-4_0_3_tru64 sun-5.8 ben_scott1: sun-5.8 bienstman1: sun-5.8 bienstman2: sun-5.8 bienstman3: sun-5.8 borrowed: sun-5.8 callbacks: sun-5.8 const_argument: sun-5.8 crossmod_exception: sun-5.8 data_members: sun-5.8 defaults: sun-5.8 dict: sun-5.8 docstring: sun-5.8 enum: sun-5.8 exception_translator: sun-5.8 exec: darwin-4.0.1 gcc-3_4_4_tru64 gcc-4_0_3_tru64 msvc-8.0 qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp sun-5.8 extract: sun-5.8 implicit: sun-5.8 indirect_traits_test: sun-5.8 injected: sun-5.8 iterator: sun-5.8 keywords: sun-5.8 list: sun-5.8 long: sun-5.8 minimal: sun-5.8 multi_arg_constructor: sun-5.8 nested: sun-5.8 numpy: sun-5.8 object: sun-5.8 object_manager: sun-5.8 opaque: sun-5.8 operators: sun-5.8 pearu1: sun-5.8 pickle1: sun-5.8 pickle2: sun-5.8 pickle3: sun-5.8 pickle4: sun-5.8 pointee: gcc-3_4_4_tru64 gcc-4_0_3_tru64 sun-5.8 pointer_type_id_test: gcc-3_4_4_tru64 gcc-4_0_3_tru64 sun-5.8 pointer_vector: sun-5.8 polymorphism: sun-5.8 polymorphism2: sun-5.8 polymorphism2_auto_ptr: sun-5.8 properties: sun-5.8 raw_ctor: sun-5.8 return_arg: sun-5.8 select_arg_to_python_test: sun-5.8 select_from_python_test: darwin-4.0.1 sun-5.8 select_holder: sun-5.8 shared_ptr: sun-5.8 slice: sun-5.8 staticmethod: sun-5.8 stl_iterator: sun-5.8 str: sun-5.8 string_literal: sun-5.8 test_pointer_adoption: sun-5.8 try: sun-5.8 tuple: sun-5.8 upcast: gcc-3_4_4_tru64 gcc-4_0_3_tru64 sun-5.8 vector_indexing_suite: sun-5.8 virtual_functions: sun-5.8 voidptr: sun-5.8 wrapper_held_type: sun-5.8 |random| random_test: intel-linux-9.0 |rational| rational_test: borland-5_6_4 vc-6_5 vc-6_5-stlport vc-7_0 |serialization| test_class_info_load_text_warchive: vc-6_5 test_non_default_ctor2_text_archive: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp test_non_default_ctor2_text_archive_dll: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp test_non_default_ctor2_text_warchive: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp test_non_default_ctor2_text_warchive_dll: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp test_reset_object_address: vc-7_0 test_reset_object_address_dll: vc-7_0 test_simple_class_binary_archive_dll: vc-6_5 test_simple_class_text_archive_dll: vc-6_5 test_simple_class_text_warchive_dll: vc-6_5 test_simple_class_xml_archive_dll: vc-6_5 test_simple_class_xml_warchive_dll: vc-6_5 test_variant_xml_archive: borland-5_8_2 test_variant_xml_archive_dll: borland-5_8_2 test_variant_xml_warchive: borland-5_8_2 test_variant_xml_warchive_dll: borland-5_8_2 |signals| dead_slot_test: gcc-3.3.6 gcc-3.3.6_linux qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp trackable_test: gcc-3.3.6 gcc-3.3.6_linux qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp |spirit| mix_and_match_trees: sun-5.8 |test| parameterized_test_test: vc-6_5 vc-6_5-stlport |tr1| run_random: sun-5.8 std_run_complex_overloads: sun-5.8 std_run_random: sun-5.8 std_test_bind: sun-5.8 std_test_complex: sun-5.8 std_test_function: sun-5.8 std_test_hash: sun-5.8 std_test_mem_fn: sun-5.8 std_test_random: sun-5.8 std_test_reference_wrapper: sun-5.8 std_test_reference_wrapper_tricky: gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux gcc-3.4.5_linux_x86_64 gcc-4.0.3_linux gcc-4.1.0_linux_x86_64 intel-linux-9.0 mingw-3_4_2 msvc-7.1 msvc-8.0 qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp vc-7_1-stlport std_test_result_of: sun-5.8 std_test_shared_ptr: sun-5.8 std_test_tuple: sun-5.8 std_test_tuple_tricky: sun-5.8 std_test_type_traits: sun-5.8 test_boost: vc-7_1-stlport test_hash: vc-7_1-stlport test_random: sun-5.8 vc-7_1-stlport test_reference_wrapper_tricky: gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux gcc-3.4.5_linux_x86_64 gcc-4.0.3_linux gcc-4.1.0_linux_x86_64 intel-linux-9.0 mingw-3_4_2 msvc-7.1 msvc-8.0 qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp test_regex: vc-7_1-stlport test_type_traits: sun-5.8 tr1_tky_function_type_test: sun-5.8 |typeof| function_binding_emulation: sun-5.8 function_binding_native: vc-6_5 vc-6_5-stlport vc-7_0 odr_no_uns: vc-6_5 vc-6_5-stlport vc-7_0 template_tpl_emulation: sun-5.8 |utility| operators_test: gcc-3.4.5_linux_x86_64

1 0

[interest?] min, max and more ... solved!
by Eric Niebler 29 Jul '06

29 Jul '06

<< Background ... >> Way back in 1995, Scott Meyers issued a challenge to the C++ community to build a better min/max utility [1]. In 2003, Andrei took up the challenge [2], but his results were unsatisfactory for reasons both technical and aesthetic [3]. In 2005, I wrote about some tricks you can do with the conditional operator [4]. Andrei suggested a way the tricks could be used to finally resolve Scott's min/max challenge. Still, the nagging lvalue/rvalue problems remained. (Consider that for some user-defined type A, this: "A const &a = std::min(A(1),A(2));" causes the reference to "a" to dangle.) << The Present ... >> Last week, at Scott's prodding, I took the issue up again and finally resolved the lvalue/rvalue problem. The result is a macro MAX(a,b) that behaves *exactly* like ((a)<(b)?(b):(a)), except that it does not reevaluate its arguments. It has the following advantages over std::max: 1) It supports both const and non-const arguments (including mixing the two in a single call). 2) It supports arguments of different types. 3) The expression type of MAX(a,b) is naturally identical to "((a)<(b)?(b):(a))", relying on the compiler's type promotion rules. 4) The rvalue/lvalue-ness of MAX(a,b) is identical to "((a)<(b)?(b):(a))", making it possible to use it on the left side of an assignment, for instance: "MAX(a,b) = 1". This also means that dangling references are impossible. The code is 100% C++98 compliant, and should work on gcc and comeau. (msvc will need some work-arounds.) The code is below. << The Future ... >> Is there interest in turning this into a BOOST_MIN/BOOST_MAX library? << The Code >> #include <boost/type.hpp> #include <boost/mpl/if.hpp> #include <boost/mpl/or.hpp> #include <boost/type_traits/is_array.hpp> #include <boost/type_traits/is_abstract.hpp> template<typename Type> boost::type<Type>* encode_type(Type &) { return 0; } template<typename Type> boost::type<Type const>* encode_type(Type const &) { return 0; } /////////////////////////////////////////////////////////////////////////////// // max_impl template<typename Ret, typename Left, typename Right> struct max_impl { max_impl(Left &left, Right &right) : left_(left) , right_(right) {} struct private_type_ {}; // can't ever return an array or an abstract type by value typedef BOOST_DEDUCED_TYPENAME boost::mpl::if_< boost::mpl::or_<boost::is_abstract<Ret>, boost::is_array<Ret> > , private_type_ , Ret >::type value_type; operator value_type() { return this->left_ < this->right_ ? this->right_ : this->left_; } operator Ret &() const { return this->left_ < this->right_ ? this->right_ : this->left_; } private: Left &left_; Right &right_; }; /////////////////////////////////////////////////////////////////////////////// // max_fun template<typename Ret, typename Left, typename Right> max_impl<Ret, Left, Right> max_fun(Left &left, Right &right, boost::type<Ret> *) { return max_impl<Ret, Left, Right>(left, right); } template<typename Ret, typename Left, typename Right> max_impl<Ret, Left const, Right> max_fun(Left const &left, Right &right, boost::type<Ret> *) { return max_impl<Ret, Left const, Right>(left, right); } template<typename Ret, typename Left, typename Right> max_impl<Ret, Left, Right const> max_fun(Left &left, Right const &right, boost::type<Ret> *) { return max_impl<Ret, Left, Right const>(left, right); } template<typename Ret, typename Left, typename Right> max_impl<Ret, Left const, Right const> max_fun(Left const &left, Right const &right, boost::type<Ret> *) { return max_impl<Ret, Left const, Right const>(left, right); } #define MAX(a,b)\ (true\ ? max_fun((a), (b), \ (true? 0 : encode_type(true? (a) : (b))))\ : (true? (a) : (b))) [1] http://www.aristeia.com/Papers/C++ReportColumns/jan95.pdf [2] http://www.ddj.com/dept/cpp/184403774 [3] Andrei's solution ignores lvalue/rvalue issues as raised in Francis Glassborow's c++std-lib-15426, and it depends on Loki, requiring a large amount of template code that largely duplicates the type promotion logic already present in the compiler. [4] http://www.artima.com/cppsource/foreach.html -- Eric Niebler Boost Consulting www.boost-consulting.com

6 13

Boost Exception
by Emil Dotchevski 29 Jul '06

29 Jul '06

Hello, Some time ago I wrote a Boost version of the exception library I've been using in my own programs for several months now. I just finished a somewhat extensive redesign of the library, partly in responce to the initial feedback I received here after my original posting, and partly as a result of my own experience and several discussions with Peter Dimov. I believe the library is now easier to use and explain, yet achieves the same major design goals of the original interface. Here's a link to the new documentation: http://www.revergestudios.com/boost-exception/boost-exception.htm Click "Download" to get a zip file with the source code, complete with boost-build jamfiles and a test suite. I am very interested in your feedback; please download the code and try it out. I still consider Boost Exception as an experiment, but I think this revision brings me very close to requesting a formal review for addition to Boost. Thanks, Emil

1 0

[Boost-bugs] [ boost-Bugs-1530683 ] cpp_regex_traits<charT>::toi() method fails in the MT case
by SourceForge.net 28 Jul '06

28 Jul '06

Bugs item #1530683, was opened at 2006-07-28 16:19 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=1530683&group_… Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: None Group: None Status: Open Resolution: None Priority: 5 Submitted By: Aleksey Sanin (lsh123) Assigned to: Nobody/Anonymous (nobody) Summary: cpp_regex_traits<charT>::toi() method fails in the MT case Initial Comment: cpp_regex_traits<charT>::toi() method fails to parse the string correctly when it is used in multi-threaded environment. Originally, I run into this problem in regex parser code and traced it down to cpp_regex_traits<charT>::toi() method (btw, this happens on Linux only, Windows code goes thru a different code path). I believe that the problem is caused by the fact that *buffered* m_pimpl->m_sbuf and m_pimpl->m_is are used inside cpp_regex_traits<charT>::toi() method without locking. Thus, if two threads are trying to use it in the same time, it fails. ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1530683&group_… ------------------------------------------------------------------------- Take Surveys. Earn Cash. Influence the Future of IT Join SourceForge.net's Techsay panel and you'll get the chance to share your opinions on IT & business topics through brief surveys -- and earn cash http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

lamda question
by Joe Van Dyk 28 Jul '06

28 Jul '06

I have Boost 1.33.1 installed. I'm trying to use Boost.Lamda. I included all the headers mentioned in the documentation as an attempt to fix the compile error. #include <boost/lambda/lambda.hpp> #include <boost/lambda/bind.hpp> #include <boost/lambda/loops.hpp> #include <boost/lambda/algorithm.hpp> #include <boost/lambda/if.hpp> #include <boost/lambda/switch.hpp> #include <boost/lambda/construct.hpp> #include <boost/lambda/casts.hpp> #include <boost/lambda/exceptions.hpp> #include <iostream> #include <list> int main() { using namespace std; using boost::lambda; list<int> v(10); for_each(v.begin(), v.end(), _1 = 1); } % g++ lambda.cpp lambda.cpp: In function `int main()': lambda.cpp:20: error: `_1' undeclared (first use this function) lambda.cpp:20: error: (Each undeclared identifier is reported only once for each function it appears in.) Using gcc 3.3.1. Any ideas? Thansk, Joe

3 5

Re: [boost] cvs authorization
by JOAQUIN LOPEZ MU?Z 28 Jul '06

28 Jul '06

----- Mensaje original ----- De: Gennadiy Rozental <gennadiy.rozental(a)thomson.com> Fecha: Viernes, Julio 28, 2006 4:23 pm Asunto: [boost] cvs authorization > I am having problem authorizing myself in boost cvs. Does anyone > know what could be the reason and how to fix it? Maybe it has to do with the following issue reported at http://sourceforge.net/docman/display_doc.php?docid=2352&group_id=1 : ( 2006-07-13 09:23:52 - Project CVS Service, Project Shell Service, Project Subversion (SVN) Service, SourceForge.net Web Site ) A recent kernel exploit was released that allowed a non admin user to escalate privileges on the host pr-shell1. We urge all users who frequent this host to change their password immediately and check their project group space for any tampering. As a precaution, we have blocked access to all project resources by password until the user resets their password. After the password has been reset, project resources should be accessible within 5 minutes. > Gennadiy HTH Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

cvs authorization
by Gennadiy Rozental 28 Jul '06

28 Jul '06

I am having problem authorizing myself in boost cvs. Does anyone know what could be the reason and how to fix it? Gennadiy

3 3