- Boost - lists.boost.org

Novelty: autmatically assigning unique integral type ids
by Jonathan Turkanis 06 Dec '04

06 Dec '04

Hi all, Attached is some non-conforming code which automatically assigns a unique integer id to an arbitrary type. It's based on this post by Daniel Wallin: http://lists.boost.org/MailArchives/boost/msg69842.php Example: #include <boost/static_assert.hpp> #include <boost/unique_id.hpp> int main() { BOOST_STATIC_ASSERT(BOOST_UNIQUE_ID(void) == 0); BOOST_STATIC_ASSERT(BOOST_UNIQUE_ID(bool) == 1); BOOST_STATIC_ASSERT(BOOST_UNIQUE_ID(char) == 2); BOOST_STATIC_ASSERT(BOOST_UNIQUE_ID(void) == 0); BOOST_STATIC_ASSERT(BOOST_UNIQUE_ID(bool) == 1); BOOST_STATIC_ASSERT(BOOST_UNIQUE_ID(char) == 2); } Obviously the ids assigned will be different depending on the order in which types are passed to BOOST_UNIQUE_ID. It's a novelty not just because it's non-conforming but also because after assigning ids to about fifty types it slows down to a deadly crawl, and maxes out at about 110 types (on VC7.1, using over 300MB RAM). I tried several forms of loop unrolling, and they don't help much. I'm posting this now because yesterday I figured out how to make it work on EDG (except for Comeau). It now works on VC7.1, VC8.0 (beta), GCC 3.2 (MinGW), GCC 3.4.1 (Cygwin), Intel 7.0 and 8.0 for Windows (in strict mode), and on the preview of the Borland EDG-based compiler I downloaded about half a year ago. I still need conforming-compiler workarounds for Comeau and Metrowerks. ;-) Best Regards, Jonathan begin 666 unique_id.zip M4$L#! H``````'%R@S$````````````````/````;&EB<R]U;FEQ=65?:60O M4$L#!!0````(`!AP@S&5>-46[ ```+(&```7````;&EB<R]U;FEQ=65?:60O M=&5S="YC<'#MTT]/PC 8!O![DWZ')ERV"SB4?T%,4#GL`M&-<U/6RIJ4%M?6 MB_&[.SM%PHEW5^AQW2_/F_1Y.U(7RG-![C?&6->SCCE94&:MJ%RWW.\?,.J< M_..U?/>"2OY[CY'4CNR8U%&,T2=&I#Z/JU66TRR?Y^D3G6?9XC6/FF_K9?JR M7M#T.?HPDL=D-B,W\?1\50^A@DH@JBA9%50?HJS<:L')`=]"L->G_ Z479K* M!39HE?KOAQ!?OV5 HU:A?WH,T<KH;5"35ID'GH!Z]*8,:X9-0$WBQF^4:""H M3#]SDF,-:M-U6:[+<O'+\H71-U!+`P0*``````"<<H,Q```````````````` M!0```&QI8G,O4$L#!!0````(`$-O@S'*X)&D;@,``*,+```3````8F]O<W0O M=6YI<75E7VED+FAP<*5638^;,!"]K[3_8:1>8)M"4O7D4J0V&ZFI*K95V%XM M+PR)56*H,=VF5?][;2"$+!\;J3XA_&;FS;-G/*X+UM*&998?)-_N%'S*!%,[ M)B LY7<F> &OY_,WSO65Z\(M+Y3D#Z7"&$H1HP2U0_B0986"39:H1R81/O,( M18$S^(:RX)F A3-WP-H@`HNB;)\S<>!B6SE,>*H-ULM5L%G1!9T[ZI>"3$*D MZ0!3L%,J)Z[[^/CH/)@H3B:W[A.\8U]?'=E%*>-[E 2"3 %KF*7\03)Y< SL M!4\T[P0^W-UM0GH?K+_>K^CZEG[\\H6N@^7G^]O5K49I"!?X#,IX$U%:Q@A> MQ<Z-,I'PK;/+<[^_N<]3%W^RE/)D`L%C%(JKPQ1$J(G=G'$YLJT..5(E&5>% M&Z-B/'4/6%"14;-S@1$OZ,^,QR/(4O%4,W=1L(<43VF.ZFF%-A!2&1-2"OZC MU%:Q!R'XA)BXA&B]2C0N!-MCD;,(H<+#G_.?=3KF+_37]95"+0U3Z!FOQ@I" MMM74.LD1TN(a)`+1.ZPS1':6GL#!S'L=^:H .^M"==&&6D.K9<HXY\!L//0!\D M!'X-:>WW3'[7Y=7)I%9M$[X/UTNZO OT5Q!:1H=T!I5 \.X\[X+_QBRQAA*Q M[!E8F(a)TA.CKU`O_&GMMV7[9WPRZ'!+/!"',$FC^FPJH8AB/U*HY^M=,`_U9* M5O">-/<S:+^?J"/PEZ)#$AV#'@W[^51TFO+S!F])J[UWDF?NSR!H;J$_&S:K MT4W9CKAN<:8Z)S MKCZ<)C+<P.NQZ'VKN3^.'-F:3&U:-+,&A%M<()Q9EXK7 M8B\0L,7V1(27L'A.R'/KQ8289DUI?7':IJ>.G4S_=],;06)1IFJ@\OZK")H6 M[]7>QW(X*T3/E.R X$;LZ:O5*M!$&T]VN'<\2?@IK;!+:^ZWSLZEZWFI=PE) MN-0/S?CJ<!KU4:">">()'VS[]MCBF.*1GGR$#FI>AJ:S0^<AG.B:]7M6.ZIZ M98QZ&))($\E1##9+$Z23@UD-^*S+FQ&ADNT$&WXA3UI;-?=7AE5#W79U#[NQ MGS_#<]Z>%J@]MK/%M4Y,WQZF,JF]U1[_@IX#5SH#XRHO3I.!<_G+7?,BG71J M%YT1I7K<O= _-KC:Y \,D*C&DZ(>6NH)5&?%$P.Y;!:]OOH'4$L#! H````` M`)ER@S$````````````````&````8F]O<W0O4$L!`A0`"@``````<7*#,0`` M``````````````\````````````0`````````&QI8G,O=6YI<75E7VED+U!+ M`0(4`!0````(`!AP@S&5>-46[ ```+(&```7``````````$`( ```"T```!L M:6)S+W5N:7%U95]I9"]T97-T+F-P<%!+`0(4``H``````)QR@S$````````` M```````%````````````$ ```$X!``!L:6)S+U!+`0(4`!0````(`$-O@S'* MX)&D;@,``*,+```3``````````$`( ```'$!``!B;V]S="]U;FEQ=65?:60N M:'!P4$L!`A0`"@``````F7*#,0````````````````8````````````0```` @$ 4``&)O;W-T+U!+!08`````!0`%`"H!```T!0`````` ` end

5 11

[thread] SunPRO: test_mutex hangs when run via regression.py
by Caleb Epstein 06 Dec '04

06 Dec '04

The Boost.Threads test program test_mutex, when built with the SunPRO C++ compiler, always hangs when I run it on a Solaris machine under regression.py. The same binary finishes in short order with status 0 when run on the command line, but under regression.py it never exits. If I attach to it with the debugger, or with strace or truss, it finishes successfully. I'm unclear what could be going wrong here and expect it is either a bug in the code produced by SunPRO or a really subtle bug in the test program. Perhaps someone could take a look? I am stumped. Here's the output of a program I found called "thrstack" which produces a stack trace for each thread w/o attaching to it: status for pid 13551 (6 LWPs) -- LWP 1 -- ff19f48c: libc.so.1:__lwp_sema_wait + 0x8 ff2396dc: libthread.so.1:_park + 0x114 ff2393a4: libthread.so.1:_swtch + 0x424 ff23da10: libthread.so.1:_reap_wait_cancel + 0x40 ff23fc9c: libthread.so.1:_thrp_join + 0x344 ff33d0d8: libboost_thread-sw-mt-d-1_32.so:void boost::thread::join() + 0x18 000334a4: test_mutex:void __unnamed_lpburfiEtB2zM::indirect_adapter<void(*)()>::operator()()const + 0x44 000333b4: test_mutex:boost::detail::function::unusable boost::detail::function::void_function_obj_invoker0<__unnamed_lpburfiEtB2zM::indirect_adapter<void(*)()>,void>::invoke(boost::detail::function::any_pointer) + 0x1c ff330748: libboost_thread-sw-mt-d-1_32.so:void boost::function0<void,int>::operator()()const + 0x78 ff33cd4c: libboost_thread-sw-mt-d-1_32.so:thread_proxy + 0x44 ff24b01c: libthread.so.1:_thread_start + 0x40 ff33cd08: libboost_thread-sw-mt-d-1_32.so:thread_proxy + 0x0 -- LWP 2 -- ff19eddc: libc.so.1:__signotifywait + 0x4 ff23e950: libthread.so.1:_dynamiclwps + 0x1c ff241c2c: libthread.so.1:_thr_yield + 0x8c -- LWP 3 -- ff19f48c: libc.so.1:__lwp_sema_wait + 0x8 ff2396dc: libthread.so.1:_park + 0x114 ff2393a4: libthread.so.1:_swtch + 0x424 ff23ada0: libthread.so.1:_mutex_adaptive_lock + 0x160 ff23aab4: libthread.so.1:_cmutex_lock + 0x84 ff141cd0: libc.so.1:malloc + 0x18 ff136174: libc.so.1:calloc + 0x54 ff243e2c: libthread.so.1:_thr_setspecific + 0x38 ff2e54bc: libCrun.so.1:__Cimpl::ex_thread*__Cimpl::ex_thread::get_thr_data() + 0x118 ff2e4160: libCrun.so.1:__Cimpl::xstack*&__Cimpl::get_cur_xptr() + 0x4 ff2e41b0: libCrun.so.1:void*__Crun::ex_alloc(unsigned) + 0x14 0007c338: test_mutex:int boost::detail::catch_signals(boost::execution_monitor&,bool,int) + 0x310 0007ac38: test_mutex:int boost::execution_monitor::execute(bool,int) + 0x28 00076e40: test_mutex:boost::unit_test::ut_detail::unit_test_monitor::error_level boost::unit_test::ut_detail::unit_test_monitor::execute_and_translate(boost::unit_test::test_case*,void(boost::unit_test::test_case::*)(),int) + 0x60 0005c1b0: test_mutex:void boost::unit_test::test_case::run() + 0x498 0005cbc4: test_mutex:void boost::unit_test::test_suite::do_run() + 0x7c 0005c3e0: test_mutex:void boost::unit_test::test_case::run() + 0x6c8 00062208: test_mutex:main + 0x458 0002cbb0: test_mutex:_start + 0x108 -- LWP 4 -- ff19f48c: libc.so.1:__lwp_sema_wait + 0x8 ff2396dc: libthread.so.1:_park + 0x114 ff2393a4: libthread.so.1:_swtch + 0x424 ff23ada0: libthread.so.1:_mutex_adaptive_lock + 0x160 ff23aab4: libthread.so.1:_cmutex_lock + 0x84 ff142b64: libc.so.1:free + 0x18 ff2e6260: libCrun.so.1:void operator delete(void*) + 0x4 00031c24: test_mutex:__SLIP.DELETER__H + 0x2c 00031ba0: test_mutex:void boost::detail::sp_counted_base::destruct() + 0x40 00030a5c: test_mutex:void boost::detail::sp_counted_base::weak_release() + 0x6c 0002f9cc: test_mutex:void boost::detail::sp_counted_base::release() + 0x8c 0002f6ec: test_mutex:boost::detail::shared_count::~shared_count #Nvariant 1() + 0x24 0002ef58: test_mutex:boost::shared_ptr<boost::basic_wrap_stringstream<char> >::~shared_ptr() + 0x10 0002e540: test_mutex:boost::test_tools::extended_predicate_value::~extended_predicate_value() + 0x10 0002e2dc: test_mutex:bool boost::test_tools::tt_detail::equal_and_continue_impl<int,int>(const __type_0&,const __type_1&,boost::basic_wrap_stringstream<char>&,boost::unit_test::basic_cstring<const char>,unsigned,boost::unit_test::log_level,unsigned) + 0x37c 0002d6ac: test_mutex:boost::xtime __unnamed_lpburfiEtB2zM::delay(int,int,int) + 0x10c 0002d110: test_mutex:bool __unnamed_lpburfiEtB2zM::execution_monitor::wait() + 0x20 ff25c000: libthread.so.1:?? + 0x0 -- LWP 5 -- ff2491fc: libthread.so.1:private___lwp_cond_wait + 0x4 ff238998: libthread.so.1:_co_timerset + 0xa0 ff24b01c: libthread.so.1:_thread_start + 0x40 ff2388f8: libthread.so.1:_co_timerset + 0x0 -- LWP 6 -- ff19c980: libc.so.1:__door_return + 0xc ff2467c8: libthread.so.1:_sc_door_func + 0x54 ff23a358: libthread.so.1:_lwp_start + 0x18 ff241c2c: libthread.so.1:_thr_yield + 0x8c -- Caleb Epstein caleb dot epstein at gmail dot com

1 0

variant==dependent pair, dependent function possible?
by Larry Evans 06 Dec '04

06 Dec '04

IIUC, the variant library is similar to a "dependent product" which can be thought of as a pseudo_pair<Index,TypeList>. where an instance: pseudo_pair<I,T> dpIT; is a pair of values (i,t) where: I i; T<i> t; IOW, there is only one value, but it can be one of many types depending on the valid values of I. BTW, would variant be made for readable by making variant take an enumeration: enum I{i0, i1, ...., in-1} as the discriminator? Anyway, back to the original question. Is there any interest in a "dependent function" where: dependent_function<I,T> df; where: T<i0>& df<i0>(); T<i1>& df<i1>(); ... T<in-1>& df<in-1>(): IOW, this would be like a regular struct (a record type), however, instead of: df.ix there would be: df<ix>(); BTW, this idea comes from Nuprl: http://www.cs.cornell.edu/Info/Projects/NuPrl/nuprl.html and I've recently had a need for it because I've got a template which is specialized on an enumeration; hence, this would come in handy if I wanted to have a structure containing all instances of the specializations.

1 1

Unexpected behaviour of boost::filesystem::equivalent
by Daniel Krügler 06 Dec '04

06 Dec '04

Hi booster, its quite a long time ago since I could follow the threads here more thoroughly :-( , so the following information might not be new one. During tests of the current Win32 implementation of boost::filesystem::equivalent I observed that the function unexpectingly fails (my test environment was Win XP SP 1 with MSVC7.1) if it compares a "soft link" created via the DOS command "subst" (or its API analogon ::DefineDosDeviceA/W) with the corresponding mapped path object (Lets say I map M: to the existing directory C:\temp). To get an understanding of the test failure I debugged the implementation and found that actually the first test part (getting the handles and comparing the VSN's + further data) gave the expected positive result, but that the very last step, i.e. the comparison of both st_dev values, gave a final unequality. Did others also observe this failure and don't you think that the expected result should show the identity of the underlying path objects? Of course there might be legitimate arguments for the decision for the current behaviour, but I would like to know about them. I am not an expert to argue about the comments in the source code which say that "In theory, volume serial numbers are sufficient to distinguish between devices, but in practice VSN's are sometimes duplicated, so device id is also checked.[..]" The question now is: Should different (MS DOS) device names pointing to the same underlying (Windows NT) device not be compared equivalent? I could think of the following test extension (at least under Windows, regrettably I am not a posix expert to provide a similar solution): If the VSN' and further data have returned a positive result, but the check of both st_dev values fails, one should try to check whether the underlying devices are actually the same, e.g. using the ::QueryDosDeviceA/W API function. What do you think? Greetings, Daniel Krügler

3 8

3D logo
by Joaquín Mª López Muñoz 06 Dec '04

06 Dec '04

Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

3 4

! Wiki Spam
by Christopher D. Russell 06 Dec '04

06 Dec '04

I just found the start page of the Wiki completely replaced with xanax drug spam. I removed the offending content and left a note in its place. Sorry - I'm not sure where the original content is archived or I would go fix it myself right now. Perhaps we need a password mechanism on the Wiki? This seems to work well over at http://www.program-transformation.org/ where you need to register and login to edit. - Chris

7 14

[Review Results] Named Parameters Library
by Doug Gregor 06 Dec '04

06 Dec '04

The Named Parameters Library has been accepted into Boost. Congratulations to the authors, David Abrahams and Daniel Wallin. The vast majority of reviews were positive, although most reviewers requested additional documentation. Here is a list of the most important/commonly-requested changes or additions to the library: - More documentation! Specifically, + Automatic overload generation should go into the tutorial + Document operator, + Performance data (what's the cost?) + Reference section + "Best practices" section. - Add a metafunction for getting the type of a parameter, e.g., param_type<Params, width_t>::type. - Add test cases for the automatic overload generation macros. - Fix the BOOST_NAMED_PARAMS_MAX_ARITY bug; Cromwell Enage provided a solution. Doug Gregor Review Manager

2 1

Anyone interested in a virtual constructor lib?
by Roland Schwarz 06 Dec '04

06 Dec '04

As a byproduct of my current work I factored out a small utility library that implements a virtual constructor. The implementation is based on boost::any and typeid(...).name(). It features dynamic creation of objects by name (string), and allows for default and custom constructors beeing called. It could be used as the basic step to object deserialization from a file, creation of operating system dependent implementations, or allow a library to instantiate user-pluggable classes. The design is inspired by the Io_obj example from Stroustrup's book on C++ programming. A small example to show the usage: #include <string> #include <iostream> #include "dynanew.hpp" using namespace dynanew; // a simple class hierarchy with abstact base class struct shape { virtual void draw() = 0; }; struct square : public shape { virtual void draw() { std::cout << "I am a square" << std::endl; } }; struct circle : public shape { circle() : radius(0) {} circle(double dr) : radius(dr) {} virtual void draw() { std::cout << "I am a circle of radius: " << radius << std::endl; } double radius; }; // create the type map TYPE_MAP(shape); // square with default constructor TYPE_REGISTER(shape, square); // circle with custom constructor taking a double parameter TYPE_REGISTER1(shape, circle, double); // circle with default constructor TYPE_REGISTER(shape, circle); int main(int argc, char* argv[]) { std::string type; type = "square"; shape* ps1 = dynamic_new<shape>(type); shape* ps2 = dynamic_new<shape>("circle", 20.0); shape* ps3 = dynamic_new<shape>("circle"); shape* ps4 = dynamic_new<shape>("square", 10.0); if (ps1) ps1->draw(); // prints: I am a square if (ps2) ps2->draw(); // prints: I am a circle of radius: 20.0 if (ps3) ps3->draw(); // prints: I am a circle of radius: 0.0 if (ps4) ps4->draw(); // does nothing since no ctor available delete ps1; delete ps2; delete ps3; delete ps4; return 0; } regards, Roland

5 14

date-time out of whack?
by Victor A. Wagner Jr. 06 Dec '04

06 Dec '04

The program that causes this error used to compile (until a few days ago) I'm using the cvs HEAD c:\boost\include\boost-1_32\boost\iterator\iterator_facade.hpp(326) : error C2664: 'boost::implicit_cast' : cannot convert parameter 1 from 'const std::string *__w64 ' to 'boost::mpl::identity::type' with [ T=boost::detail::operator_arrow_result,std::basic_string,std::allocator>::const_iterator,std::string>,std::string,boost::detail::minimum_category::type>::type,const std::string &>::value_type,boost::iterator_facade,std::basic_string,std::allocator>::const_iterator,std::string>,std::string,boost::detail::minimum_category::type>::type,const std::string &>::reference,boost::iterator_facade,std::basic_string,std::allocator>::const_iterator,std::string>,std::string,boost::detail::minimum_category::type>::type,const std::string &>::pointer>::type ] Conversion loses qualifiers c:\boost\include\boost-1_32\boost\iterator\iterator_facade.hpp(325) : while compiling class-template member function 'boost::detail::operator_arrow_result::type boost::detail::operator_arrow_result::make(Reference)' with [ ValueType=boost::iterator_facade,std::basic_string,std::allocator>::const_iterator,std::string>,std::string,boost::detail::minimum_category::type>::type,const std::string &>::value_type, Reference=boost::iterator_facade,std::basic_string,std::allocator>::const_iterator,std::string>,std::string,boost::detail::minimum_category::type>::type,const std::string &>::reference, Pointer=boost::iterator_facade,std::basic_string,std::allocator>::const_iterator,std::string>,std::string,boost::detail::minimum_category::type>::type,const std::string &>::pointer ] c:\boost\include\boost-1_32\boost\iterator\iterator_facade.hpp(642) : see reference to class template instantiation 'boost::detail::operator_arrow_result' being compiled with [ ValueType=boost::iterator_facade,std::basic_string,std::allocator>::const_iterator,std::string>,std::string,boost::detail::minimum_category::type>::type,const std::string &>::va lue_type, Reference=boost::iterator_facade,std::basic_string,std::allocator>::const_iterator,std::string>,std::string,boost::detail::minimum_category::type>::type,const std::string &>::reference, Pointer=boost::iterator_facade,std::basic_string,std::allocator>::const_iterator,std::string>,std::string,boost::detail::minimum_category::type>::type,const std::string &>::pointer ] c:\boost\include\boost-1_32\boost\token_iterator.hpp(41) : see reference to class template instantiation 'boost::iterator_facade' being compiled with [ Derived=boost::token_iterator,std::basic_string,std::allocator>::const_iterator,std::string>, Value=std::string, CategoryOrTraversal=boost::detail::minimum_category::type>::type, Reference=const std::string & ] c:\boost\include\boost-1_32\boost\date_time\date_parsing.hpp(119) : see reference to class template instantiation 'boost::token_iterator' being compiled with [ TokenizerFunc=boost::char_delimiters_separator, Iterator=std::basic_string,std::allocator>::const_iterator, Type=std::string ] c:\boost\include\boost-1_32\boost\date_time\gregorian\parsers.hpp(24) : see reference to function template instantiation 'date_type boost::date_time::parse_date(const std::string &,int)' being compiled with [ date_type=boost::gregorian::date ] Victor A. Wagner Jr. http://rudbek.com The five most dangerous words in the English language: "There oughta be a law"

6 12

Boost.FileSystem, problem with exists()
by Martin Slater 06 Dec '04

06 Dec '04

Hi, I've been using boost.filesystem and have come up on a problem with exists(). Basically on a windows system it will return true if asking whether a file exists on a non-existent share. The problem is at, operations_posix_windows.cpp:327. There should (?) be an additional check against ERROR_BAD_NETPATH as well. The fuzziness of this function is quite disturbing as shown by the following comment in the code return false; // GetFileAttributes failed because the path does not exist // for any other error we assume the file does exist and fall through, // this may not be the best policy though... (JM 20040330) The windows docs don't really help that much by not specify exactly what the failures can be though. Personally I think it should always return false on GetAttributes() error to avoid false positives and the expense of the possible false negatives, but we need a list of all possible errors to be sure that this is the right thing to do. Oh and any chance you can put in serialization support for boost::filesystem::path? I've done it locally and the code is trivial but it would be nice to have it out the box. Anyhow, thanks for a great library (filesystem and the rest of boost). cheers martin

2 2