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

const shared_ptr<>
by Hossein Haeri 02 May '03

02 May '03

Dear all, I'm a newbie in boost! I want to know what the following means: int a = 5; const boost::shared_ptr<int> sp(&a); Does it mean that the following line is an error? *sp = 7; If so, what are the guarantees? Is there any documented guarantee? (I couldn't find anything in the documentation. Excuseme if I'm careless!) Thanks, --Hossein __________________________________ Do you Yahoo!? The New Yahoo! Search - Faster. Easier. Bingo. http://search.yahoo.com

3 11

RE: [Boost-Users] Is there a "known issues" page anywhere?
by Jim.Hyslop 02 May '03

02 May '03

Alisdair Meredith [mailto:yg-boost-users@gmane.org] wrote: > Is there a place where known problems for libraries/compilers are > stored? > > For instance, trying to use boost/time we hit a problem with MSVC7 and > lexical_cast unless we enable the "wchar_t as a native type" option. > While this may be good practice <g> it is not the default, > and caught us > out (and the error is none-too helpful) > > I can imagine this sort of issue is discovered and re-discovered on a > regular basis, and wonder where to look for such known issues before > using list bandwidth. There is a "Known Issues" section on the wiki (see the link in the auto-appended .sig) which is intended to document these common "gotchas". I haven't looked at it for a while, so I don't know how up-to-date it is. If that issue's not documented there, would you mind adding it? -- Jim

3 2

graph (BGL): bad documentation
by schlumpfi106 01 May '03

01 May '03

I just tried to use the boost graph library to create a spanning tree generation algorithm. After wasting a whole day I gave up and wrote all the graph code myself. I'm quiet upset about the useless online documentation for the graph library. Maybe I have to buy the book to be able to use it? Normally I would rely on some good, instructive examples and start my own program by copy-and-paste. Here, there are only a few examples and they are either too simple or too specific. Most documentation topics provide no examples at all. Sometimes I head to guess through the template-loaded headerfiles because there was no documentation. I failed in creating a graph from a given adjacency matrix. I failed in understanding the "interior property" concept. I failed in printing a graph and its properties to graphviz. To the developers: Please, before you implement anything new -- document the old things.

1 0

RE: [Boost-Users] Regexp Homework :-)
by Ben Hutchings 01 May '03

01 May '03

Simon Brown <simon.brown(a)kns.ch> wrote: > A few days ago I received great help with a regexp question - > now here's > another which I doubt can be done. > > Question: if the text string contains three words AAA BBB AAA > then return > the string (if any) which is repeated two or three times. > > Examples: > AAA AAA AAA return AAA > AAA BBB AAA return AAA > AAA AAA BBB return AAA > AAA BBB CCC return <nothing> > > Can this be done with a regular expression? Match against "(\\w+) (?:\\1 \\w+|\\w+ \\1)|\\w+ (\\w+) \\2" and return the match for whichever sub-expression (1 or 2) was matched. (I tested this with Python not Boost regex, but they should be compatible.)

2 1

Is there a "known issues" page anywhere?
by Alisdair Meredith 01 May '03

01 May '03

Is there a place where known problems for libraries/compilers are stored? For instance, trying to use boost/time we hit a problem with MSVC7 and lexical_cast unless we enable the "wchar_t as a native type" option. While this may be good practice <g> it is not the default, and caught us out (and the error is none-too helpful) I can imagine this sort of issue is discovered and re-discovered on a regular basis, and wonder where to look for such known issues before using list bandwidth. -- AlisdairM

1 0

regexp match question
by Simon Brown 01 May '03

01 May '03

Hi All, Here's a question I can't answer. I'm using regexp to dig out strings from data received via Ham Radio, so the txt often is corrupted. What I want to match is two consecutive callsigns separated by whitespace, for example 'hb9drv hb9drv' but not 'hb9drv hb9drX'. I can define the match condition for a callsign, but can I use the match option {2,3} somehow to match the same callsign two or three times? Effectively match the same word two or three times? Help received with much thanks, Simon Brown, Casa Bergenia, CH-7031 Laax www.hb9drv.ch [Non-text portions of this message have been removed]

3 5

Licence terms
by Ben Hutchings 30 Apr '03

30 Apr '03

Where should I post to ask questions and make suggestions about licence terms for Boost libraries? I am specifically concerned about the large number of slightly different wordings of some of the licences, which I think would all have to be included in documentation of a program using the covered libraries.

1 0

RE: [Boost-Users] const shared_ptr<>
by Tom Matelich 30 Apr '03

30 Apr '03

> From: Hossein Haeri [mailto:powerprogman@yahoo.com] > Sent: Wednesday, April 30, 2003 8:29 AM > > I want to know what the following means: > > int a = 5; > const boost::shared_ptr<int> sp(&a); > I assume you know this, but this code is in error. When the last shared_ptr referencing &a goes away, it will try to delete a, which is illegal. There is a workaround defined at http://www.boost.org/libs/smart_ptr/sp_techniques.html#static , though. ----------------------------------------------------------------------- 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. -----------------------------------------------------------------------

1 0

ptime and time_duration
by Andre du Toit 30 Apr '03

30 Apr '03

Hi. Since time_duration uses <long> to represent each of the fields (H:M:S:FS), I should be able to add any hour offset to a ptime, as long as the resultant ptime is inside the date/time range representable by boost? With the date ranges of boost being 1400-Jan-1 00:00:00 -> 10000-Jan-1 00:00:00, the number of hours between these dates is (very roughly!) 7.534E7. This is less than the <long> limit on my system, which is +/- 2.147E9. That is good. So; doing the following: ptime t_max( date(10000,Jan,1) ); ptime t_min( date(1400,Jan,1) ); time_duration td = t_max - t_min; std::cout << to_simple_string( td ) << std::endl; should produce something like : 7.534E7:0:0 or if you want to write it out: 7533600:0:0 not? Instead; the output I get is : 224112:19:12. This corresponds to a timespan of roughly 25 years which means I just ran into some overflow/underflow problem somewhere. What gives? What time range is supported by time_duration if it does not use the <long> limits? I have difficulty deducing this information from the header files, the source for the lib is not too helpfull either! What am I missing here? Greetings, Andre.

2 1

Re: Re: running regression tests
by Dave Abrahams 30 Apr '03

30 Apr '03

Peter Dimov wrote: > David Abrahams wrote: >> BTW, Vaclav, the place to post about Boost.Build issues is >> jamboost(a)yahoogroups.com. >> >> http://groups.yahoo.com/group/jamboost/ > > ... and the place to announce mailing lists is > > http://www.boost.org/more/mailing_lists.htm Updated.

1 0

running regression tests
by Vaclav Vesely 30 Apr '03

30 Apr '03

It's possible to execute all regression tests so it's possible to execute one test suite: bjam test or bjam filesystem But it's impossible to execute several (but not all) test suits at once: bjam config filesystem Only the last (filesystem) suit is executed. It's possible to improve testing.jam to allow it? Can someone give a bit of advice? Thanks and regards, w

4 5

boost::spirit multiline comment parsing - how?
by Markus Werle 30 Apr '03

30 Apr '03

Hi! While playing around with the examples of the spirit library I feel like I missed some essential points. The far goal I have is to parse a file containing C/C++ comments and assignments of the form name = value; where I drop the comments and store the assignments in a map<string, string>. If You have done something similar, please share Your knowledge with the rest of us. Below is a modifed version of comments.cpp. Here I only try to output any comment found while dropping the other stuff. Why does the parser drop stuff after the 1st assignment? the output of the code is Parsed C-comment successfully! Matched (27) characters: "//test2 /* test1 */// test Any help appreciated. Also I would like not to gather all commenst in one string ... -------- #include "boost/spirit.hpp" #include <iterator> #include <string> #include <iostream> #include <cassert> #include <fstream> #include <map> #include <cassert> /////////////////////////////////////////////////////////////////////////////// // actor called after successfully matching a single character class actor_string { public: actor_string(std::string &rstr) : matched(rstr) { } void operator() (const char *pbegin, const char *pend) const { matched += std::string(pbegin, pend-pbegin); } private: std::string &matched; }; /////////////////////////////////////////////////////////////////////////////// // actor called after successfully matching a C++-comment void actor_cpp (const char *pfirst, const char *plast) { std::cerr << "Parsing C++-comment" << std::endl; std::cerr << "Matched (" << plast-pfirst << ") characters: "; char cbbuffer[128]; strncpy(cbbuffer, pfirst, plast-pfirst); cbbuffer[plast-pfirst] = '\0'; std::cerr << "\"" << cbbuffer << "\"" << std::endl; } /////////////////////////////////////////////////////////////////////////////// // main entry point int main () { using namespace boost::spirit; ///////////////////////////////////////////////////////////////////////////// char const* pCComment = "//test2\n/* test1 */\n\n// test\nalpha = 3.0;\n\n// beta is soo important\nbeta=5.6;\n\n/* \n\nSometimes comments are\ngood since\nbeta = 4.5;\nis a good choice, too\n\n*/"; typedef skipper_iteration_policy<> iter_policy_t; typedef scanner_policies<iter_policy_t> scanner_policies_t; typedef scanner<char const*, scanner_policies_t> phrase_scanner_t; rule<phrase_scanner_t> cpp_comment, ignored, all; cpp_comment = comment_p("/*", "*/") // rule for C-comments | comment_p("//") // rule for C++ comments ; std::string comment_c; all = ( *cpp_comment[actor_string(comment_c)] | *anychar_p ) ; ignored = (space_p | chlit<char>('\n')); parse_info<> result; result = parse (pCComment, all, space_p); if (result.hit) { std::cerr << "Parsed C-comment successfully!" << std::endl; std::cerr << "Matched (" << comment_c.size() << ") characters: "; std::cerr << "\"" << comment_c << "\"" << std::endl; } else { std::cerr << "Failed to parse C/C++-comment!" << std::endl; } std::cerr << std::endl; } Markus -- Compile time analytic differentiation? Yes, at http://daixtrose.sourceforge.net/

2 1

bjam, targets from another projects
by Vaclav Vesely 30 Apr '03

30 Apr '03

Hi, It's possible to specify dependency on a target from another project tree? I want to write to my project's "Jamfile" something like this: --- Jamfile --- exe test : test.cpp <dll>$(BOOST_ROOT)/libs/threads/build/boost_thread : <include>$(BOOST_ROOT) ; --- Thanks and regards, w

2 1

bjam - several projects and ALL_LOCATE_TARGET
by Vaclav Vesely 30 Apr '03

30 Apr '03

Hi, I would like to ask for help with using bjam. I want to have more project directory trees, for example: C:\src\boost C:\src\my_projects\first C:\src\my_projects\first and I want to compile binaries to separate directories: C:\build\boost C:\build\my_projects\first C:\build\my_projects\second So I have to set different values of the ALL_LOCATE_TARGET environment variable for each project. It's unconfortable to set that value each time I want to inovoke the bjam, so I want to set it in the Jamfile of each project. I mean somethin like this: --- C:\src\my_first_project\Jamfile --- project-root ; ALL_LOCATE_TARGET = C:\build\my_projects\first --- Of course, this doesn't work. Can someone propose the solustion? BTW it would be handy to use the "project-root" directive for this reason: --- C:\src\my_first_project\Jamfile --- project-root my_projects/first ; --- The specified path is ment as relative to the ALL_LOCATE_TARGET. Thanks and regards, w

2 1

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