- Boost-users - lists.preview.boost.org

tokenizer: finding the last element. is it possible?
by Vincent LaBella 29 Apr '03

29 Apr '03

Hello, I'm using boost::tokenizer and want to goto the last token in the sequence, so I tried Tok::iterator last = tok.end(); last--; // error decrement not defined last = tok.begin(); advance(last,tok.size()-1); // error size() not defined. Is it possible to add decrement or a back() reference to tokenizer? Thanks Vince

3 4

scoped_ptr(auto_ptr) constructor
by Daniel Franklin 29 Apr '03

29 Apr '03

Is the constructor for scoped_ptr that takes an auto_ptr argument part of the proposed standard? The boost documentation makes no mention of it, yet it exists in the implementation as: explicit scoped_ptr(std::auto_ptr<T> p): ptr(p.release()) // never throws { } Personally I think it should be included in the proposed standard if it is not. I can't see any reason why it shouldn't be, as it doesn't seem to break the fundamental concepts behind auto_ptrs (ownership transferal) or scoped_ptrs (sole ownership). Ownership of the object is transfered from the auto_ptr to the scoped_ptr, and thereafter retained solely by that scoped_ptr. Regards, Daniel Franklin

1 0

[PP] Getting the size of a tuple
by Sam Partington 29 Apr '03

29 Apr '03

Hello, I've just started using the preprocessor library, for a fairly simple task. Essentially I have the have a macro called DECLARE_TESTS, which I use like the following DECLARE_TESTS(2, (Test1, Test2) ) which expands into the following void Test1(); void Test2(); suite() { ADDTEST(Test1); ADDTEST(Test2); } Now the problem: it is inconvenient to have to specify the size of the the tuple in the first macro. Is there any way to deduce the size? The macros I'm using are below. Thanks in advance for any help (positive or otherwise) Sam PS Before you suggest using Boost.Test, we have looked at it, and feel that it is not quite what we're looking for, and I don't want to get into that discussion! :-) #define DECLARE_TESTS(test_count, test_list) \ BOOST_PP_LIST_FOR_EACH(UNITTESTS_DECLARE_TEST, _, BOOST_PP_TUPLE_TO_LIST(test_count, test_list)) \ public: \ ClassToTest() \ { \ BOOST_PP_LIST_FOR_EACH(UNITTESTS_ADD_TEST, _, BOOST_PP_TUPLE_TO_LIST(test_count, test_list)) \ } // implementation macros #define UNITTESTS_DECLARE_TEST(R, _, name) void name(); #define UNITTESTS_ADD_TEST(R, _, name) ADDTEST(name)

1 0

uBLAS compile fail on sparse matrix debug code
by Zhang Le 29 Apr '03

29 Apr '03

Hi all, I just write a simple program to test the efficiency of sparse matrix operation in uBLAS and get the following error message on a FreeBSD with gcc 2.95 : !gmake 2>&1| tee /tmp/v446688/2g++ -c test.cpp -I. -I/usr/local/include -Wall -g -O2 -march=i686 -pipe -ftemplate-depth-30 -g3 -O0 -o test.o g++ test.o -o a.out test.o: In function `pair<unsigned int, unsigned int> * __copy_backward<pair<unsigned int, unsigned int> *, pair<unsigned int, unsigned int> *, int>(pair<unsigned int, unsigned int> *, pair<unsigned int, unsigned int> *, pair<unsigned int, unsigned int> *, random_access_iterator_tag, int *)': /usr/include/g++/stl_algobase.h(.gnu.linkonce.t.norm_inf__Q45boost7numeric5ublast11type_traits1ZUiRCUi+0x15): undefined reference to `boost::numeric::ublas::type_traits<unsigned int>::imag(unsigned int const &)' /usr/include/g++/stl_algobase.h(.gnu.linkonce.t.norm_inf__Q45boost7numeric5ublast11type_traits1ZUiRCUi+0x24): undefined reference to `boost::numeric::ublas::type_traits<unsigned int>::abs(unsigned int const &)' /usr/include/g++/stl_algobase.h(.gnu.linkonce.t.norm_inf__Q45boost7numeric5ublast11type_traits1ZUiRCUi+0x3a): undefined reference to `boost::numeric::ublas::type_traits<unsigned int>::real(unsigned int const &)' /usr/include/g++/stl_algobase.h(.gnu.linkonce.t.norm_inf__Q45boost7numeric5ublast11type_traits1ZUiRCUi+0x49): undefined reference to `boost::numeric::ublas::type_traits<unsigned int>::abs(unsigned int const &)' /usr/include/g++/stl_algobase.h(.gnu.linkonce.t.equals__H2ZQ45boost7numeric5ublast6vector2ZUiZQ45boost7numeric5ublast15unbounded_array1ZUiZQ45boost7numeric5ublast6vector2ZUiZQ45boost7numeric5ublast15unbounded_array1ZUi_Q35boost7numeric5ublasRCQ45boost7numeric5ublast17vector_expression1ZX01RCQ45boost7numeric5ublast17vector_expression1ZX11_b+0x2e): undefined reference to `boost::numeric::ublas::type_traits<unsigned int>::sqrt(unsigned int const &)' If I comment out the second prod() or use -DNDEBUG everything is ok. So I suspect the error is caused by debug code in sparse matrix prod operation. here is the main code block: int main(int argc,char* argv[]) { try { namespace ublas = boost::numeric::ublas; using namespace ublas; size_t d = 7000; ublas::vector<unsigned> v(d); ublas::matrix<unsigned> m (d,d); ublas::sparse_matrix<unsigned> ms (d,d); for (size_t i = 0;i < 10000;++i) { size_t r = (size_t)(drand48() * d); size_t c = (size_t)(drand48() * d); ++m(r,c); ++ms(r,c); ++v(r); ++v(c); } { progress_timer t; std::cout << "matrix * vector" << endl; ublas::prod(m,v); } { progress_timer t; std::cout << "sparse matrix * vector" << endl; ublas::prod(ms,v); } }

2 1

Trouble building 1.30.0 on Linux
by Garen Parham 29 Apr '03

29 Apr '03

When I try to build boost with this method: ./build.sh gcc || die "couldn't build bjam" cd $srcdir ./tools/build/jam_src/bin.linux${ARCH}/bjam -j2 \ -sBOOST_ROOT=${S} \ -sPYTHON_ROOT=/usr \ -sPYTHON_VERSION=2.2 \ -sTOOLS=gcc This happens: ...failed updating 6 targets... ...updated 539 targets... On the other hand, if I restart the build it seems to..magically work: ### ### Using 'gcc' toolset. ### rm -rf bootstrap.gcc mkdir bootstrap.gcc gcc -o bootstrap.gcc/jam0 command.c compile.c execnt.c execunix.c execvms.c expand.c filent.c fileos2.c fileunix.c filevms.c glob.c hash.c hdrmacro.c headers.c jam.c jambase.c jamgram.c lists.c make.c make1.c newstr.c option.c parse.c pathunix.c pathvms.c regexp.c rules.c scan.c search.c subst.c timestamp.c variable.c modules.c strings.c filesys.c builtins.c pwd.c ./bootstrap.gcc/jam0 -f build.jam --toolset=gcc --toolset-root= ...found 44 targets... ...found 3407 targets... ...updating 6 targets... FileClone libs/python/build/bin-stage/libboost_python_debug.so.1.30.0 FileClone libs/python/build/bin-stage/libboost_python.so.1.30.0 FileClone libs/regex/build/bin-stage/libboost_regex_debug.so.1.30.0 FileClone libs/regex/build/bin-stage/libboost_regex.so.1.30.0 FileClone libs/thread/build/bin-stage/libboost_threadd.so.1.30.0 FileClone libs/thread/build/bin-stage/libboost_thread.so.1.30.0 ...updated 6 targets... That didn't happen with 1.29. Is there a cleaner way not documented to get it to build nicely? I had less luck trying to build with icc.

1 0

bug in testing.jam
by Vaclav Vesely 29 Apr '03

29 Apr '03

There is missing enclosing parenthesis. Regards, w Index: tools/build/testing.jam =================================================================== RCS file: /cvsroot/boost/boost/tools/build/testing.jam,v retrieving revision 1.16 diff -u -r1.16 testing.jam --- tools/build/testing.jam 3 Mar 2003 19:59:45 -0000 1.16 +++ tools/build/testing.jam 26 Apr 2003 23:09:40 -0000 @@ -99,7 +99,7 @@ if $(files) { # make relative to the project root instead of "." - local file = $(files[1]:R=$(SUBDIR_TOKENS:J=/) ; + local file = $(files[1]:R=$(SUBDIR_TOKENS:J=/)) ; # try to undo absolute paths source-files += [ relative-path $(file) ] ; begin 666 testing.jam.patch M26YD97@Z('1O;VQS+V)U:6QD+W1E<W1I;F<N:F%M#0H]/3T]/3T]/3T]/3T] M/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T] M/3T]/3T]/3T]#0I20U,@9FEL93H@+V-V<W)O;W0O8F]O<W0O8F]O<W0O=&]O M;',O8G5I;&0O=&5S=&EN9RYJ86TL=@T*<F5T<FEE=FEN9R!R979I<VEO;B Q M+C$V#0ID:69F("UU("UR,2XQ-B!T97-T:6YG+FIA;0T*+2TM('1O;VQS+V)U M:6QD+W1E<W1I;F<N:F%M"3,@36%R(#(P,#,@,3DZ-3DZ-#4@+3 P,# ),2XQ M-@T**RLK('1O;VQS+V)U:6QD+W1E<W1I;F<N:F%M"3(V($%P<B R,# S(#(S M.C Y.C0P("TP,# P#0I 0" M.3DL-R K.3DL-R! 0 T*(" @(" @(" @:68@ M)"AF:6QE<RD-"B @(" @(" @('L-"B @(" @(" @(" @(" C(&UA:V4@<F5L M871I=F4@=&\@=&AE('!R;VIE8W0@<F]O="!I;G-T96%D(&]F("(N(@T*+2 @ M(" @(" @(" @(&QO8V%L(&9I;&4@/2 D*&9I;&5S6S%=.E(])"A354)$25)? M5$]+14Y3.DH]+RD@.PT**R @(" @(" @(" @(&QO8V%L(&9I;&4@/2 D*&9I M;&5S6S%=.E(])"A354)$25)?5$]+14Y3.DH]+RDI(#L-"B @(" @(" @(" @ M(" -"B @(" @(" @(" @(" C('1R>2!T;R!U;F1O(&%B<V]L=71E('!A=&AS M#0H@(" @(" @(" @(" @<V]U<F-E+69I;&5S("L](%L@<F5L871I=F4M<&%T 0:" @)"AF:6QE*2!=(#L-"@`` ` end

2 1

Patch for the bjam's build script
by Vaclav Vesely 29 Apr '03

29 Apr '03

When compiling the bjam under MSVC or VC7 tools and the LIB environment variable ends with a backslash, for example: LIB=C:\PROGRA~1\MICROS~3\VC98\LIB\ than the build.bat script fails. I've spend quite a long time with looking for the cause. The attached patch fixes it: Regards, w begin 666 jam_src.patch M26YD97@Z('1O;VQS+V)U:6QD+VIA;5]S<F,O8G5I;&0N8F%T#0H]/3T]/3T] M/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T] M/3T]/3T]/3T]/3T]/3T]#0I20U,@9FEL93H@+V-V<W)O;W0O8F]O<W0O8F]O M<W0O=&]O;',O8G5I;&0O:F%M7W-R8R]B=6EL9"YB870L=@T*<F5T<FEE=FEN M9R!R979I<VEO;B Q+C$Q#0ID:69F("UU("UR,2XQ,2!B=6EL9"YB870-"BTM M+2!T;V]L<R]B=6EL9"]J86U?<W)C+V)U:6QD+F)A= DR,2!!<'(@,C P,R P M-#HS-CHR.2 M,# P, DQ+C$Q#0HK*RL@=&]O;',O8G5I;&0O:F%M7W-R8R]B M=6EL9"YB870),C@@07!R(#(P,#,@,C,Z-#0Z-3$@+3 P,# -"D! ("TQ.#@L M-R K,3@X+#<@0$ -"B!I9B B7R5"3T]35%]*04U?5$]/3%-%5"5?(B ]/2 B M7VUS=F-?(B H#0H@(" @(&EF(&YO=" B7R5"3T]35%]*04U?5$]/3%-%5%]2 M3T]4)5\B(#T](")?7R(@* T*(" @(" @(" @<V5T(%!!5$@])5!!5$@E.R5" M3T]35%]*04U?5$]/3%-%5%]23T]4)6)I;BD-"BT@(" @<V5T($)/3U-47TI! M35]#0STB)4)/3U-47TI!35]43T],4T547U)/3U0E8FEN7&-L+F5X92(@+VYO M;&]G;R O1UH@+UII("]-3" M1$Y4("U$65E$14)51R O3$E"4$%42#HB)4Q) M0B4B(&ME<FYE;#,R+FQI8@T**R @("!S970@0D]/4U1?2D%-7T-#/2(E0D]/ M4U1?2D%-7U1/3TQ3151?4D]/5"5B:6Y<8VPN97AE(B O;F]L;V=O("]'6B O M6FD@+TU,("U$3E0@+419641%0E5'("],24)0051(.B(E3$E")3LB(&ME<FYE M;#,R+FQI8@T*(" @("!S970@0D]/4U1?2D%-7T]05%]*04T]+T9E8F]O='-T M<F%P+B5"3T]35%]*04U?5$]/3%-%5"5<:F%M, T*(" @("!S970@0D]/4U1? M2D%-7T]05%]-2TI!34)!4T4]+T9E8F]O='-T<F%P+B5"3T]35%]*04U?5$]/ M3%-%5"5<;6MJ86UB87-E, T*(" @("!S970@0D]/4U1?2D%-7T]05%]964%# M0STO1F5B;V]T<W1R87 N)4)/3U-47TI!35]43T],4T54)5QY>6%C8S -"D! M("TR,#,L-R K,C S+#<@0$ -"B!I9B B7R5"3T]35%]*04U?5$]/3%-%5"5? M(B ]/2 B7W9C-U\B("@-"B @(" @:68@;F]T(")?)4)/3U-47TI!35]43T], M4T547U)/3U0E7R(@/3T@(E]?(B H#0H@(" @(" @("!S970@4$%42#TE4$%4 M2"4[)4)/3U-47TI!35]43T],4T547U)/3U0E8FEN*0T*+2 @("!S970@0D]/ M4U1?2D%-7T-#/2(E0D]/4U1?2D%-7U1/3TQ3151?4D]/5"5B:6Y<8VPN97AE M(B O;F]L;V=O("]'6B O6FD@+TU,("U$3E0@+419641%0E5'("],24)0051( M.B(E3$E")2(@:V5R;F5L,S(N;&EB#0HK(" @('-E="!"3T]35%]*04U?0T,] M(B5"3T]35%]*04U?5$]/3%-%5%]23T]4)6)I;EQC;"YE>&4B("]N;VQO9V\@ M+T=:("]::2 O34P(a)+41.5" M1%E91$5"54<@+TQ)0E!!5$@Z(B5,24(E.R(@ M:V5R;F5L,S(N;&EB#0H@(" @('-E="!"3T]35%]*04U?3U!47TI!33TO1F5B M;V]T<W1R87 N)4)/3U-47TI!35]43T],4T54)5QJ86TP#0H@(" @('-E="!" M3T]35%]*04U?3U!47TU+2D%-0D%313TO1F5B;V]T<W1R87 N)4)/3U-47TI! M35]43T],4T54)5QM:VIA;6)A<V4P#0H@(" @('-E="!"3T]35%]*04U?3U!4 M7UE904-#/2]&96)O;W1S=')A<"XE0D]/4U1?2D%-7U1/3TQ3150E7'EY86-C M, T*26YD97@Z('1O;VQS+V)U:6QD+VIA;5]S<F,O8G5I;&0N:F%M#0H]/3T] M/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T]/3T] M/3T]/3T]/3T]/3T]/3T]/3T]#0I20U,@9FEL93H@+V-V<W)O;W0O8F]O<W0O M8F]O<W0O=&]O;',O8G5I;&0O:F%M7W-R8R]B=6EL9"YJ86TL=@T*<F5T<FEE M=FEN9R!R979I<VEO;B Q+C(T#0ID:69F("UU("UR,2XR-"!B=6EL9"YJ86T- M"BTM+2!T;V]L<R]B=6EL9"]J86U?<W)C+V)U:6QD+FIA;0DR-"!!<'(@,C P M,R Q,3HT,#HS." M,# P, DQ+C(T#0HK*RL@=&]O;',O8G5I;&0O:F%M7W-R M8R]B=6EL9"YJ86T),C@@07!R(#(P,#,@,C,Z-#0Z-3(@+3 P,# -"D! ("TQ M,3<L-R K,3$W+#<@0$ -"B!T;V]L<V5T(&US=F,@8VP@.B O1F4@.B M1 T* M(" @(" Z("]N;VQO9V\@+TU,("]/,B O3V(R("]'>2 O1T8@+T=!("]'0@T* M(" @(" Z("]N;VQO9V\@+TU,9" O1$5"54<@+UHW("]/9" O3V(P#0HM(" @ M(#H@+TQ)0E!!5$@Z)"A,24(Z2CTB("(I(&ME<FYE;#,R+FQI8B [#0HK(" @ M(#H@+TQ)0E!!5$@Z)"A,24(Z2CTB("(I.R!K97)N96PS,BYL:6(@.PT*(",C M(%-U;B!7;W)K<VAO<" V($,K*PT*('1O;VQS970@<W5N<')O($-#(#H@(BUO M("(@.B M1 T*(" @(" Z("US("UF87-T("U/- T*0$ @+3$S-"PW("LQ,S0L M-R! 0 T*('1O;VQS970@=F,W(&-L(#H@+T9E(#H@+40-"B @(" @.B O;F]L M;V=O("]-3" O3S(@+T]B,B O1WD@+T=&("]'02 O1T(-"B @(" @.B O;F]L M;V=O("]-3&0@+T1%0E5'("]:-R O3V0@+T]B, T*+2 @(" Z("],24)0051( M.B0H3$E".DH](B B*2!K97)N96PS,BYL:6(@.PT**R @(" Z("],24)0051( M.B0H3$E".DH](B B*3L@:V5R;F5L,S(N;&EB(#L-"B C(R!635,O3W!E;E9- M4R!$14,@0PT*('1O;VQS970@=FUS(&-C(#H@+T]"2D5#5#T@.B O1$5&24Y% :/0T*(" @(" Z("]35$%.1$%21#U605A##0H` ` end

1 0

Finite State Machine example
by b_trask 28 Apr '03

28 Apr '03

Hello, I am looking at http://www.boost.org/libs/mpl/doc/paper/html/example.html I have a dumb question or perhaps I am missing something (or both). Where is the state_machine class template that the player derives from using the curiously recurring template pattern? class player : state_machine<player> // where is the code for this class? { Regards, Bruce

2 1

enable_shared_from_this and constructor
by Petr Ferschmann 28 Apr '03

28 Apr '03

Hello, why is not possible to call this: -- cut here -- #include <boost/enable_shared_from_this.hpp> class Trida; boost::shared_ptr<Trida> trida; class Trida : public boost::enable_shared_from_this<Trida> { public: Trida() { trida = this->shared_from_this(); }; }; int main() { boost::shared_ptr<Trida> tr(new Trida()); return 0; } -- cut here -- It throws in constructor of shared_count(weak_count const & r). I think the problem is that there is no one shared_ptr instance that owns object tr yet when calling constructor. May be it is BUG (and I don't know how to handle that). Can be at least note in documentation? -- Petr "Fers" Ferschmann -=[ petr(a)ferschmann.cz ]==[ http://petr.ferschmann.cz/ ]=- -=[ Koukni na http://www.postcard.cz/ ]==[ +420 604/781 009 ]=- GPG Fingerprint: [83B0 6378 7A9D D993 035E 60BD FEEC F665 D2C8 1B9A] [Non-text portions of this message have been removed]

2 1

RE: [Boost-Users] Circular Buffer
by Tom Matelich 28 Apr '03

28 Apr '03

I've seen several implementations of things like this come up on the boost mailing list in the past. My impression is a lot of people gave up when confronted with all the different options that would have to be considered to make it through a Boost review. I did see cyclic_buffer.zip in the Files section at the old yahoo group site ( http://groups.yahoo.com/group/boost/files/ ). > -----Original Message----- > From: Joe Mariadassou [mailto:joemar@vcisnet.net] > Sent: Wednesday, April 23, 2003 11:56 PM > To: Boost-Users(a)yahoogroups.com > Subject: [Boost-Users] Circular Buffer > > > Does boost or any other open source have an implementation of > a bounded > circular buffer? My search in boost and google yielded naught. > The main purpose of this container is to pipeline messages in > a typical > producer-consumer scenario. I was surprised not to find any > implementation. > TIA > Joe > > > > [Non-text portions of this message have been removed] > > > ------------------------ Yahoo! Groups Sponsor > ---------------------~--> > Get 128 Bit SSL Encryption! > http://us.click.yahoo.com/xaxhjB/hdqFAA/bW3JAA/EbFolB/TM > -------------------------------------------------------------- > -------~-> > > Info: <http://www.boost.org> > Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> > > > Your use of Yahoo! Groups is subject to > http://docs.yahoo.com/info/terms/ > > ----------------------------------------------------------------------- DISCLAIMER: Information contained in this message and/or attachment(s) may contain confidential information of Zetec, Inc. If you have received this transmission in error, please notify the sender by return email. -----------------------------------------------------------------------

3 3

uBlas - diagonal_matrix
by Patrick Kowalzick 28 Apr '03

28 Apr '03

Dear all, I can use a banded_matrix to represent a diagonal matrix, but while some math for a diagonal matrix is a little bit easier than for a rectangular matrix, it would be nice to have such a type. In my case: I use a SVD A = U * S * V.T to calculate the moore-penrose-inverse A+. Therfore I use A+ = V * S+ * U.T (i do not remember exact, but focus on S+) with S+ as the moore-penrose-inverse of S which is very easy to calculate. but to use something like pinv(S) , do I need a symmetric_matrix type? Or can I implement a pinv() for a banded_matrix wich must fulfil the constraint of being diagonal? Thanks a lot Patrick

3 3

Re: pool_allocator problems on VC7.1 (real rele ase)
by scleary＠jerviswebb.com 26 Apr '03

26 Apr '03

> -----Original Message----- > From: John Harris [mailto:john.harris@tradingtechnologies.com] > > I can test this for you tomorrow (I'm about to go drinking now). In > return, could you possibly tell me how to change pool_allocator so > that it uses my own tag? My goal is to have a totally local > allocator for some special parts of the code. Why, BTW, does it have > to use the Singleton pool interface instead of the object pool > interface? The latter, I think is what I'm after. I'm going to start with a brief overview of the Boost.Pool interfaces: pool<> (pool.hpp): "The" pool interface. Provides allocation and deallocation of memory. object_pool<> (object_pool.hpp): Restricts access to the pool<> interface. Provides allocation and deallocation of memory for a single object type; and, when destroyed, will call the destructor for any non-deallocated objects allocated from that object_pool. singleton_pool<> (singleton_pool.hpp): Provides access to the pool<> interface as a singleton, distinguished mainly by size of the memory allocations and a tag. pool_allocator<> (pool_alloc.hpp): Restricts access to the singleton_pool<> interface. Provides a Standard-compliant Allocator interface. To answer the specific questions: 1) The pool_allocator<> (and fast_pool_allocator<>) can be relatively easily extended to use other tags for the singleton_pool<> interface underlying them - pass an additional template parameter (after the UserAllocator parameter), defaulting to the currently-used tag. This is a good idea, and I'll put it in when I can. 2) pool_allocator<> uses the singleton_pool<> interface instead of the object_pool<> interface for the following reasons: A) Standard Allocators only handle the allocation and deallocation of memory, and do not deal with actual object types [+]. The intent of object_pool<> is to cleanly call destructors for objects that were never deallocated. Such an action: 1) is unneeded (since all containers should free whatever memory they allocate, and destroy any objects they construct), and 2) would cause the Allocator to get into construction/destruction semantics, which is contrary to the Standard Allocator concept. B) Standard-compliant Allocators that can be used with STL-provided containers must be stateless. This requires an underlying singleton interface. Encapsulating a non-singleton interface within the Allocator, or even sharing one with the handle/body idiom does not satisfy the stateless requirement. [+] The object-related Allocator requirements (construct()/destroy()) do not have anything to do with allocation/deallocation, and are generally considered to be a useless overspecification. Please let me know if I haven't been clear enough - I've been a little lacking in sleep lately ;) -Steve

2 1

RE: [Boost-Users] NRVO (was Re: "Correct" way to return empty shared_ptr?)
by dick.bridges＠tais.com 25 Apr '03

25 Apr '03

return shared_ptr<int>(); works with VC6.0 but elicits the [AFAICT] uninformative <emsg>parse error before `;'</emsg> from gcc version 2.96 20000731 (Red Hat Linux 7.3 2.96-110). Drat! "Duane Murphy" <duanemurphy@mac To: "Boost Users" <Boost-Users(a)yahoogroups.com> .com> cc: Subject: RE: [Boost-Users] NRVO (was Re: "Correct" way to return empty shared_ptr?) 04/24/2003 09:40 AM Please respond to Boost-Users --- At Thu, 24 Apr 2003 16:56:40 +0100, Ben Hutchings wrote: <snip> shared_ptr<int> maybe_get_a_pointer() { return shared_ptr<int>(); } is perfectly reasonable and can also be optimized. Is there more recent and complete discussion concerning this optimization? Is naming actually required? ...Duane Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

RE: [Boost-Users] Re: pool_allocator problems on VC7.1 (real rele ase)
by scleary＠jerviswebb.com 25 Apr '03

25 Apr '03

> -----Original Message----- > From: John Harris [mailto:john.harris@tradingtechnologies.com] > > Since it seems to work on VC7.1, it would be nice if the author had > access to that compiler and could do some testing. In the mean time, > I'll try some stuff with this new toy and report any further problems. Some command-line tools ship with their DDK, so I do have a version of "cl.exe" that reports "13.00.9176" - no idea how this fits in with the VC versions, though. And the DDK doesn't include an STL anyway. There is one "common" failure case with some implementations of STL containers: passing 0 to Allocator::deallocate. When used with std::allocator, the 0 is passed through to operator delete() which of course ignores it. When used with pool_alloc, this generally causes a segfault. IIRC, STLPort's std::vector will do this if you construct & destroy an empty vector. Since I don't have the VC STL, could you do that test case for me? Thanks, -Steve

2 2

MP3 and C++
by steelgig 25 Apr '03

25 Apr '03

Hi, I'm working on a project for the university and I'm looking for some C++ library or application that could help me. My goal is to extract some kind of information related to the spectra of a signal coded in MP3. I'm looking for a spectrum analyzer that localizes peaks in the power spectrum (better if it works on a user-specified band) and allows the detection of the temporal occurence of each peak and its intensity. I also need to retrieve some sample of frequency components (or the MDCT coefficients) near the identified peaks. Every suggestion is welcome (even something that satisfies only partially the requests or that indicates a better place to found an answer to this message). Thanks in advance for the help, Gio PS: even some function that works on the MP3 file without decoding it, for example only partial decoding actions (IMDCT, Huffman decoding) or subband value retrieval function, could be useful.

1 0

Circular Buffer
by Joe Mariadassou 24 Apr '03

24 Apr '03

Does boost or any other open source have an implementation of a bounded circular buffer? My search in boost and google yielded naught. The main purpose of this container is to pipeline messages in a typical producer-consumer scenario. I was surprised not to find any implementation. TIA Joe [Non-text portions of this message have been removed]

2 1

Test for endian using MPL or PP(Wave?)
by Mike Wilson 24 Apr '03

24 Apr '03

Hi, There is an application I use that always produces a little endian binary file. I have written a program to process this file. As my program can port to both little/big endian platforms I have a #define (LITTLE_ENDIAN_TARGET) acting as a flag for the necessary byte swapping that is needed on the big-endian platforms. I was wondering if there is a better way to do this, so I searched the Web & boost archives. I found the following code snippet in the boost archives. bool isLittleEndian() { int temp = 1; return (*(char*)&temp) != 0; } which is of some help (eliminating my #define). However, I was wondering if there is a PP or mpl way of testing for endian-ness at compile time. For example, I'd like to do something like the following: const bool IsLittleEndian = ..to be determined automatically..; I've got a gut feeling that I can't do the above at complile time, but maybe something like Wave may do the job? Thanks for any assistance in this matter. Mike

4 4

RE: [Boost-Users] Re: "Correct" way to return empty shared_ptr?
by Ben Hutchings 24 Apr '03

24 Apr '03

dick.bridges(a)tais.com wrote: > This is one of the places where I get *REALLY* confused - the 'real' code > has multiple returns. Apologies: I should have included this psuedo code > in the original example. It looks like this. > > <snippet> > // v is populated somewhere else > typedef vector<shared_ptr<int> > V; > V v; > > shared_ptr<int> maybe_get_a_pointer() > { > shared_ptr<int>::iterator itr; > itr = find_if(v.begin(), v.end(), some_op); > > if(itr != v.end) > return(*itr); > > shared_ptr<int> p; > return(p); > } > </snippet> > > Are compilers supposed to be able to match *itr to p in order to apply the > NRVO? I don't know what you mean by "match *itr to p". The NRVO should be possible for the second return statement, because if p is constructed then it's always returned. However, optimisations are by definition optional so the implementation isn't "supposed to" perform them.

1 0

RE: [Boost-Users] NRVO (was Re: "Correct" way to return emptyshared_ptr?)
by Ben Hutchings 24 Apr '03

24 Apr '03

Duane Murphy <duanemurphy(a)mac.com> wrote: > --- At Thu, 24 Apr 2003 16:56:40 +0100, Ben Hutchings wrote: > >dick.bridges(a)tais.com wrote: > >> I don't understand C++ well enough to grok a compiler's interpretation of > >> the code, but I seems like I'm creating an extra copy for the return. > ><snip> > > > >Logically the local variable is copied to the the caller, but since the type > >of the returned expression matches the return type the compiler is allowed > >to optimise away that copy, even though the return type has a user-defined > >copy constructor. In this case you always return a certain named variable, > >so the compiler can arrange to construct it in the memory location where the > >caller expects the returned value. This is called the named-return-value > >optimisation, or NRVO. > > I dont want to start any kind of war, and this is a bit off topic, but I > was investigating NVRO and found a few discussions with Scott Meyers that > indicated that naming is not relevant to the optimization. That this: > > shared_ptr<int> maybe_get_a_pointer() > { > return shared_ptr<int>(); > } > > is perfectly reasonable and can also be optimized. > > Is there more recent and complete discussion concerning this > optimization? Is naming actually required? I realise that the implementation is allowed to optimise out the copy whether the return value is named or not. Actually doing so requires quite different treatment of the two cases, so it's worth considering them as separate optimisations. For NRVO to be possible at some return statement, there must not be any return statements reachable after the construction of the returned object that return any other object. The optimisation involves changing the code generated for the definition of the object, rather than the code for the return statement. So the implementation has to consider the whole function when doing this. Anonymous RVO is a very local optimisation, so it should require less work to apply.

1 0

RE: [Boost-Users] Re: "Correct" way to return empty shared_ptr?
by dick.bridges＠tais.com 24 Apr '03

24 Apr '03

This is one of the places where I get *REALLY* confused - the 'real' code has multiple returns. Apologies: I should have included this psuedo code in the original example. It looks like this. <snippet> // v is populated somewhere else typedef vector<shared_ptr<int> > V; V v; shared_ptr<int> maybe_get_a_pointer() { shared_ptr<int>::iterator itr; itr = find_if(v.begin(), v.end(), some_op); if(itr != v.end) return(*itr); shared_ptr<int> p; return(p); } </snippet> Are compilers supposed to be able to match *itr to p in order to apply the NRVO? "Ben Hutchings" <ben.hutchings@businesswebso To: <Boost-Users(a)yahoogroups.com> ftware.com> cc: Subject: RE: [Boost-Users] Re: "Correct" way to return empty shared_ptr? 04/24/2003 08:56 AM Please respond to Boost-Users dick.bridges(a)tais.com wrote: > I don't understand C++ well enough to grok a compiler's interpretation of > the code, but I seems like I'm creating an extra copy for the return. <snip> Logically the local variable is copied to the the caller, but since the type of the returned expression matches the return type the compiler is allowed to optimise away that copy, even though the return type has a user-defined copy constructor. In this case you always return a certain named variable, so the compiler can arrange to construct it in the memory location where the caller expects the returned value. This is called the named-return-value optimisation, or NRVO. Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

RE: [Boost-Users] Re: "Correct" way to return empty shared_ptr?
by Ben Hutchings 24 Apr '03

24 Apr '03

dick.bridges(a)tais.com wrote: > I don't understand C++ well enough to grok a compiler's interpretation of > the code, but I seems like I'm creating an extra copy for the return. <snip> Logically the local variable is copied to the the caller, but since the type of the returned expression matches the return type the compiler is allowed to optimise away that copy, even though the return type has a user-defined copy constructor. In this case you always return a certain named variable, so the compiler can arrange to construct it in the memory location where the caller expects the returned value. This is called the named-return-value optimisation, or NRVO.

2 1

Re: [Boost-Users] Re: "Correct" way to return empty shared_ptr?
by dick.bridges＠tais.com 24 Apr '03

24 Apr '03

I don't understand C++ well enough to grok a compiler's interpretation of the code, but I seems like I'm creating an extra copy for the return. Oh well, if the snippet seems ok, far be it from me to throw asparagus on it. ;) Thanks for the help. "Edward Diener" <eddielee@tropic To: boost-users(a)yahoogroups.com soft.com> cc: Sent by: news Subject: [Boost-Users] Re: "Correct" way to return empty shared_ptr? <news(a)main.gmane .org> 04/23/2003 05:47 PM Please respond to Boost-Users dick.bridges(a)tais.com wrote: > What is the 'correct' way to return a NULL/empty shared_ptr? For > example, this works > > <snippet> > shared_ptr<int> maybe_get_a_pointer() > { > shared_ptr<int> p; > return(p); > } > </snippet> > > but seems 'klunky'. I've clearly missed something in the > docs/examples somewhere. Can someone point me in the right direction? What is klunky about it ? It seems pretty normal to me. Another other possibility is to passed a reference to a shared_ptr<> and have your function above fill it in with an actual pointer to int and return a bool true if it succeeded or false if it did not. Another possibility is to use boost::optional<>. Another one to pass back a bool,shared_ptr<> std::pair or boost::tuple. But I prefer the method you used originally. Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

uBlas Lapack binds from Sandbox - VC6 workaround
by geert_ceuppens 24 Apr '03

24 Apr '03

As an introduction; my goal is to link together the uBlas matrix/vector classes with the Intel MKL library (I looked at ATLAS, but the Lapack coverage was insufficient). I have tried the bindings code in the Boost Sandbox (on which Toon and Kresimir are working), but VC6 falls over. I managed to work around the partial template specialisation problem (see my previous postings), thanks to Kresimir's and Toon's feedback. There is however one remaining question I need some help with. First the question; after that I post all the code which I've hacked together to assist other interested users using VC6. Due to my ignorance, I am obliged to pass the orientation as a template parameter to the matrix_traits class. What I would like to do is to obtain this information from the matrix class directly. The issue is that matrix_type::functor_type does not exist for all matrix classes. For example, hermitian, triangular and symmetrix matrix use matrix_type::functor2_type to store the orientation of the matrix. With a good compiler (i.e. *NOT* VC6), one could specialise matrix_traits for these matrix classes (at least that is what I think - but this isn't done yet in the ublas_matrix.hpp file in the Sandbox), here however I'm stuck. As a hack, I allow the orientation to be passed as a template parameter. Is there a better way to do this (the matrix class M knows the orientation already)? // M is type of matrix, RC is the row/column orientation template <typename M, // type of matrix typename RC = boost::numeric::ublas::row_major> struct matrix_traits { public: typedef RC row_column_major; typedef M matrix_type; ... static int stride1 (matrix_type& m) { //return matrix_type::functor_type::one1 (m.size1(), m.size2 ()); return row_column_major::one1 (m.size1(), m.size2()); } ... }; Here is the code I wrote: ---------------------//---------------------- traits.h: // (-*- C++ -*- header) /* * * Copyright (c) Kresimir Fresl and Toon Knapen 2002 * * Permission to copy, modify, use and distribute this software * for any non-commercial or commercial purpose is granted provided * that this license appear on all copies of the software source code. * * Authors assume no responsibility whatsoever for its use and makes * no guarantees about its quality, correctness or reliability. * * First author acknowledges the support of the Faculty of Civil * Engineering, University of Zagreb, Croatia. * * --> Modified/simplified for VC6 */ #ifndef BOOST_NUMERIC_BINDINGS_TRAITS_TRAITS_HPP #define BOOST_NUMERIC_BINDINGS_TRAITS_TRAITS_HPP #include <cstddef> //namespace boost { namespace numeric { namespace bindings { namespace traits { // vector_traits<> base: // .. implementation -- do not use it directly template <typename V, typename T = typename V::value_type> struct default_vector_traits { typedef T value_type; typedef T* pointer; // assumption: iterator==pointer // .. e.g. ublas::(un)bounded_array static pointer storage (V& v) { return v.begin(); } static const T* storage (const V& v) { return v.begin(); } static int size (V& v) { return v.size(); } static int size (const V& v) { return v.size(); } static int stride (V& v) { return 1; } static int stride (const V& v) { return 1; } }; // vector_traits<> generic version: template <typename V> struct vector_traits : default_vector_traits<V> {}; // matrix structure tags: struct general_t {}; struct symmetric_t {}; struct symmetric_packed_t {}; struct hermitian_t {}; struct hermitian_packed_t {}; // triangular, banded etc. struct unknown_structure_t {}; /* // matrix_traits<> generic version: template <typename M> struct matrix_traits { // typedefs: // matrix_structure // value_type // pointer // ordering_type // static functions: // pointer storage() // int storage_size() // int size1() // int size2() // int leading_dimension() // not all matrix types // symmetric/hermitian typedefs: // uplo_type }; */ // storage ordering tags: struct row_major_t {}; struct column_major_t {}; // upper/lower tags: struct upper_t {}; struct lower_t {}; // free accessor functions: template <typename VectorT> inline typename vector_traits<VectorT>::pointer vector_storage (VectorT& v) { return vector_traits<VectorT>::storage (v); } template <typename VectorT> inline int vector_size (VectorT& v) { return vector_traits<VectorT>::size (v); } template <typename VectorT> inline int vector_stride (VectorT& v) { return vector_traits<VectorT>::stride (v); } // All the matrix_traits<MatrixT> code has been removed here ... }}}} #endif // BOOST_NUMERIC_BINDINGS_TRAITS_TRAITS_HPP ---------------------//---------------------- ublas_matrix.h: // (-*- C++ -*- header) /* * * Copyright (c) Kresimir Fresl and Toon Knapen 2002 * * Permission to copy, modify, use and distribute this software * for any non-commercial or commercial purpose is granted provided * that this license appear on all copies of the software source code. * * Authors assume no responsibility whatsoever for its use and makes * no guarantees about its quality, correctness or reliability. * * First author acknowledges the support of the Faculty of Civil * Engineering, University of Zagreb, Croatia. * * --> Modified/simplified for VC6 */ #ifndef BOOST_NUMERIC_BINDINGS_TRAITS_UBLAS_MATRIX_H #define BOOST_NUMERIC_BINDINGS_TRAITS_UBLAS_MATRIX_H #include <boost/numeric/ublas/matrix.hpp> #include "traits.h" namespace boost { namespace numeric { namespace bindings { namespace traits { // Need to find a way to extract the orientation class (row / column) template <typename M, // type of matrix typename RC = boost::numeric::ublas::row_major> // row or column major struct matrix_traits { public: typedef RC row_column_major; typedef general_t matrix_structure; typedef M::value_type value_type; typedef M::value_type *pointer; typedef M matrix_type; static pointer storage (matrix_type& m) { typedef typename matrix_type::array_type array_type; return vector_traits<array_type>::storage (m.data()); } static const value_type *storage (const matrix_type& m) { typedef typename matrix_type::array_type array_type; return vector_traits<array_type>::storage(m.data()); } static int size1 (matrix_type& m) { return m.size1(); } static int size1 (const matrix_type& m) { return m.size1(); } static int size2 (matrix_type& m) { return m.size2(); } static int size2 (const matrix_type& m) { return m.size2(); } static int storage_size (matrix_type& m) { return size1 (m) * size2 (m); } static int storage_size (const matrix_type& m) { return size1 (m) * size2 (m); } // stride1 == distance (m (i, j), m (i+1, j)) static int stride1 (matrix_type& m) { //return matrix_type::functor_type::one1 (m.size1(), m.size2 ()); return row_column_major::one1 (m.size1(), m.size2()); } static int stride1 (const matrix_type& m) { //return matrix_type::functor_type::one1 (m.size1(), m.size2 ()); return row_column_major::one1 (m.size1(), m.size2()); } // stride2 == distance (m (i, j), m (i, j+1)) static int stride2 (matrix_type& m) { //return matrix_type::functor_type::one2 (m.size1(), m.size2 ()); return row_column_major::one2 (m.size1(), m.size2()); } static int stride2 (const matrix_type& m) { //return matrix_type::functor_type::one2 (m.size1(), m.size2 ()); return row_column_major::one2 (m.size1(), m.size2()); } static int leading_dimension (matrix_type& m) { //return matrix_type::functor_type::size2 (m.size1(), m.size2 ()); return row_column_major::size2 (m.size1(), m.size2()); } static int leading_dimension (const matrix_type& m) { //return matrix_type::functor_type::size2 (m.size1(), m.size2 ()); return row_column_major::size2 (m.size1(), m.size2()); } }; }}}} #endif ---------------------//---------------------- boost_mkl_lapack.cpp: namespace ublas = boost::numeric::ublas; #ifdef BOOST_MSVC #pragma warning (disable: 4355) #pragma warning (disable: 4503) #pragma warning (disable: 4786) #endif #define BOOST_UBLAS_USE_EXCEPTIONS #include <iostream> #include <boost/numeric/ublas/matrix.hpp> #include <boost/numeric/ublas/symmetric.hpp> #include <vector> // Intel MKL Lapack #include <mkl/include/mkl_lapack64.h> #include "ublas_matrix.h" // To make life easiertypedef ublas::matrix<double,ublas::row_major> Matrix; typedef std::vector<int> IntVector; template<class M> int getrf(M& a, IntVector& ipiv) { typedef matrix_traits<M> mtraits; typedef vector_traits<IntVector> vtraits; int m = a.size1(); int n = a.size2(); assert(ipiv.size() == (m < n ? m : n)); double *aStorage = mtraits::storage(a); int lda = mtraits::leading_dimension(a); int *ipivStorage = vtraits::storage(ipiv); int info; // return status dgetrf(&m, &n, aStorage, &lda, ipivStorage, &info); return info; } template<class M> int getrs(const M& a, const IntVector& ipiv, M& b, char trans = 'N' ) { typedef matrix_traits<M> mtraits; typedef vector_traits<IntVector> vtraits; int m = a.size1(); int n = a.size1(); assert(ipiv.size() == (m < n ? m : n)); // Note: we need to cast away the const for a and ipiv double *aStorage = const_cast<double*>(mtraits::storage(a)); double *bStorage = mtraits::storage(b); int lda = mtraits::leading_dimension(a); int ldb = mtraits::leading_dimension(b); int *ipivStorage = const_cast<int*>(vtraits::storage(ipiv)); // if b is column major, take size2 (i.e. columns) int nrhs = mtraits::size1(b); int info; // return status dgetrs(&trans, &n, &nrhs, aStorage, &lda, ipivStorage, bStorage, &ldb, &info); return info; } template <typename M> void init_symm (M& m, char uplo = 'f') { size_t n = matrix_traits<M>::size1 (m); for (size_t i = 0; i < n; ++i) { m(i, i) = n; for (size_t j = i + 1; j < n; ++j) { if (uplo == 'u' || uplo == 'U') m(i, j) = n - (j - i); else if (uplo == 'l' || uplo == 'L') m(j, i) = n - (j - i); else m(i, j) = m(j, i) = n - (j - i); } } } // printing: template <typename M> void print_m (const M& m, char const* ch = 0) { if (ch) std::cout << ch << ":\n"; size_t sz1 = matrix_traits<M>::size1 (m); size_t sz2 = matrix_traits<M>::size2 (m); for (std::size_t i = 0 ; i < sz1 ; ++i) { for (std::size_t j = 0 ; j < sz2 ; ++j) std::cout << m(i, j) << " "; std::cout << std::endl; } // std::cout << std::endl; } // printing: template <typename V> void print_v (V const& v, char const* ch = 0) { if (ch) std::cout << ch << ": "; size_t sz = vector_traits<V>::size (v); for (std::size_t i = 0; i < sz; ++i) std::cout << v[i] << " "; std::cout << std::endl; } using std::size_t; void main(void) { size_t n = 3; Matrix a(n, n), acopy(n, n); IntVector ipiv(n); init_symm(a); acopy = a; print_m (a, "A"); // Now factor int status = getrf(a, ipiv); print_v(ipiv, "ipiv"); print_m (a, "A"); // The solution (and the right hand side) are row oriented size_t nrhs = 2; Matrix b(nrhs, n), x(nrhs, n); int i; for(i = 0; i < n; i++) { x(0,i) = (double)i + 1; x(1,i) = (double)i + 4.0; } b = ublas::trans(ublas::prod(acopy, ublas::trans(x))); print_m (b, "b original"); print_m (x, "x original"); status = getrs (a, ipiv, b); // solve from factorization print_m (b, "X"); std::cout << std::endl; // Now try the same for a symmetrix matrix ublas::symmetric_matrix<double, ublas::lower> ml(n, n); init_symm(ml); print_m(ml, "symmetric matrix"); status = getrf(ml, ipiv); print_v(ipiv, "ipiv"); print_m (a, "A"); } You will need your project settings to be such that you link with the Intel lib files and the DLL should be in your path (see Intel MKL documentation). Your link tab in project/settings should contain (the lib directory is set using tools/options, same for the include): mkl_c.lib mkl_p3.lib mkl_lapack.lib You may want to do this in a different namespace than the boost namespace (I actually commented out all the namespace stuff above, but reintroduced it in this posting - if it does not compile, than that's probably the reason). More binds to Lapack still need to be done, but this is a start already. Geert

2 1

Intel compiler (7.0), STLport (4.3.5) and Boost?
by Andre du Toit 24 Apr '03

24 Apr '03

Is it possible to build bjam and the boost libraries using the Intel compiler (7.0) in conjunction with STLport(4.3.5) under Windows (2000)? If not, please tell me and do not bother reading the rest of this email! I did manage to build bjam and the boost libraries using msvc-stlport toolset, but we use the Intel compiler in conjunction with STLport for our Windows applications. Now I know I can't just start using the Intel compiler with source using boost libraries which were built with a different toolset (or could I?). I get a number of errors regarding multiple definitions of ptime iostream operators. But before I present the exact error messages, I would like to clear up the Intel + STLport issue. I would appreciate any suggestions. Greetings, Andre.

1 0

VC7 internal compiler error in mpl using graph & spirit
by Julius Muschaweck 24 Apr '03

24 Apr '03

Hi, with VC 7.0, with both boost_1_30 and the current CVS, and with both release and debug mode, #include <boost/graph/adjacency_list.hpp> #include <boost/spirit/core.hpp> gives an Internal Compiler Error 1001 at line 52 of h:\jmj\C++\Include\boost_1_30_0\boost\mpl\aux_\preprocessed\msvc70\apply.hpp while the error disappears when changing the order of the include files. I can live with the workaround of course, but maybe someone in charge of mpl would like to go after this. Regards, Julius

1 0