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

AW: [Boost-Users] Tree Object Needed!
by Jasper, Alexander 05 Jun '03

05 Jun '03

Isn't std::map what you want? > -----Ursprüngliche Nachricht----- > Von: Hossein Haeri [mailto:powerprogman@yahoo.com] > Gesendet: Dienstag, 3. Juni 2003 21:23 > An: Boost-Users(a)yahoogroups.com > Betreff: [Boost-Users] Tree Object Needed! > > > Dear all, > > I need to have some template doing the jobs of an > ordinary BST (Binary Search Tree). Nothing that fancy, > but something at the level we all have been educated > in CS1/FCS1, or similar courses. Does boosts > repository > contain such an object? > > Why don't I write it myself? Simply, because I want to > optimise the time! > > Thank you, > --Hossein > > __________________________________ > Do you Yahoo!? > Yahoo! Calendar - Free online calendar with sync to Outlook(TM). > http://calendar.yahoo.com > > ------------------------ Yahoo! Groups Sponsor > ---------------------~--> > Get A Free Psychic Reading! Your Online Answer To Life's > Important Questions. > http://us.click.yahoo.com/Lj3uPC/Me7FAA/ySSFAA/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/ > > >

5 4

Deprecated shared_ptr functionality in boost 1.30
by Anders Hybertz 05 Jun '03

05 Jun '03

Hi all I have simplified my previous question about this issue to the following sandbox code. ----------------------------------------------------------------- #include <iostream> #include <boost/shared_ptr.hpp> struct Test : public boost::counted_base { Test() : boost::counted_base( 1, 1 ) { std::cout << "Construction" << std::endl; } ~Test() { std::cout << "Destruction" << std::endl; } }; int main() { { boost::shared_ptr<Test> spTest( new Test ); } // In boost 1.29 the program output is : // Construction return 0; }----------------------------------------------------------------- Under boost 1.29.0 the program only writes out the text from the construction of the Test object - the destructor is never being called. I want the same functionality under boost 1.30.0 - but without changing any code in then main function - basically preserving the interface. I tried to used the boost::detail::sp_counted_base under 1.30.0 but that did not work. Any ideas ? Thanks in advance Anders Hybertz

1 0

norm_inf type-related error
by cerenoc 05 Jun '03

05 Jun '03

Can somebody help me with this? The following simple piece of code compiles fine if m, v, and s are declared as type <double> but not for type <int> as shown. Why is that? Can I cast vectors and matrices from int to double easily? ...define some matrix <int>m... boost::numeric::ublas::vector<int> v = row(m, 1); int s = norm_inf(v); The complaint is as follows: /tmp/ccA7KBD2.o: In function `boost::numeric::ublas::type_traits<int>::norm_inf(int const &)': /tmp/ccA7KBD2.o (.boost::numeric::ublas::type_traits<int>::gnu.linkonce.t.norm_inf (int const &)+0x12): undefined reference to `boost::numeric::ublas::type_traits<int>::imag(int const &)' /tmp/ccA7KBD2.o (.boost::numeric::ublas::type_traits<int>::gnu.linkonce.t.norm_inf (int const &)+0x21): undefined reference to `boost::numeric::ublas::type_traits<int>::abs(int const &)' /tmp/ccA7KBD2.o (.boost::numeric::ublas::type_traits<int>::gnu.linkonce.t.norm_inf (int const &)+0x31): undefined reference to `boost::numeric::ublas::type_traits<int>::real(int const &)' /tmp/ccA7KBD2.o (.boost::numeric::ublas::type_traits<int>::gnu.linkonce.t.norm_inf (int const &)+0x40): undefined reference to `boost::numeric::ublas::type_traits<int>::abs(int const &)' collect2: ld returned 1 exit status Thanks, Julian

2 1

Newbie needs thread lib sample code
by dick.bridges＠tais.com 04 Jun '03

04 Jun '03

I'm pretty sure I've seen sample code at www.boost.org that's pretty close to being a tutorial for using the thread library but I can't for the life of me find it. Anyone got a link?

2 1

building decision trees with mpl
by Markus Werle 04 Jun '03

04 Jun '03

Hi! The following piece of code works (finally, sigh), but I would like to hear some comments on whether and how one can do better. #include "boost/mpl/apply_if.hpp" #include "boost/mpl/identity.hpp" #include "boost/mpl/lower_bound.hpp" #include "boost/mpl/deref.hpp" #include "boost/mpl/find.hpp" #include "boost/mpl/vector.hpp" #include "boost/mpl/pair.hpp" #include "boost/mpl/bool.hpp" #include "boost/mpl/select1st.hpp" #include "boost/mpl/select2nd.hpp" #include "boost/mpl/lambda.hpp" #include "boost/type_traits/is_same.hpp" #include <typeinfo> #include <iostream> namespace mpl = boost::mpl; template <int m, int n> class ComplicatedDecision { private: template <int i> struct C { // typedef probably_very_expensive_template type; }; // order matters typedef mpl::vector < mpl::pair<mpl::bool_< (m == n) >, C<0> >, mpl::pair<mpl::bool_< (m == -n) >, C<1> >, mpl::pair<mpl::bool_< (m == 1) >, C<2> >, mpl::pair<mpl::bool_< (m < 0) >, C<3> >, mpl::pair<mpl::bool_< true >, C<4> > > decision_sequence; typedef typename mpl::find_if< decision_sequence, boost::is_same<mpl::select1st<mpl::_1>, mpl::bool_<true> > > iter_; typedef typename iter_::type::type pair_; public: typedef typename mpl::select2nd<pair_>::type type; }; int main() { std::cerr << typeid(ComplicatedDecision<1,1>::type).name() << std::endl; std::cerr << typeid(ComplicatedDecision<-1,1>::type).name() << std::endl; std::cerr << typeid(ComplicatedDecision<1,2>::type).name() << std::endl; std::cerr << typeid(ComplicatedDecision<-1,2>::type).name() << std::endl; std::cerr << typeid(ComplicatedDecision<2,3>::type).name() << std::endl; } best regards, Markus -- Compile time analytic differentiation? Yes, at http://daixtrose.sourceforge.net/

2 2

stlport-4.5.3+boost-1.30.0+msvc6(sp5)+platform sdk(5.2.3663.0)
by gong_wentao 04 Jun '03

04 Jun '03

I tried to build boost thread library on my computer,the following are my computer's configuration: stlport-4.5.3+boost-1.30.0+msvc6(sp5)+platform sdk(5.2.3663.0) I added boost installation directory into system's path variables, and i enter into the directory "boost_1_30_0\libs\thread\build\",Each time i typed command "bjam -sTOOLS=msvc-stlport -sSTLPORT_VERSION=4. 5.3 -sSTLPORT_PATH=D: -sSTLPORT_IOSTREAM=on >>d:\log1.txt", i got the following result: CALL "C:\Program Files\Microsoft Visual Studio\VC98 \bin\VCVARS32.BAT" >nul "C:\Program Files\Microsoft Visual Studio\VC98\bin\cl" /Zm800 - nologo -GX -c -DBOOST_THREAD_BUILD_DLL=1 -D_STLP_NO_SGI_IOSTREAMS=1 - D_STLP_DO_IMPORT_CSTD_FUNCTIONS=1 -D_STLP_DEBUG=1 - D_STLP_DEBUG_UNINITIALIZED=1 /Z7 /Od /Ob0 /GX /GR /MDd - I"..\..\..\libs\thread\build" -I"D:\STLport-4.5.3\stlport" - I"D:\boost_1_30_0" - Fo"..\..\..\libs\thread\build\bin\boost_thread.dll\msvc- stlport\debug\runtime-link-dynamic\stlport-cstd-namespace-std\stlport- iostream-off\stlport-version-4.5.3\threading-multi\condition.obj" - Tp"../src\condition.cpp" ...failed vc-C++ ..\..\..\libs\thread\build\bin\boost_thread.dll\msvc- stlport\debug\runtime-link-dynamic\stlport-cstd-namespace-std\stlport- iostream-off\stlport-version-4.5.3\threading-multi\condition.obj... It seems some configuration problem exists. Can anybody tell me why? Thanks in advance!

1 0

Multi-array usage problem - Bug or me?
by David Johnson 03 Jun '03

03 Jun '03

I have the following code that I don't feel is doing the right thing. Did I make some mistake or is the Multi-array code buggy? int nrows = 2; int aSize = 6; typedef array_type::extent_range range; array_type B(boost::extents[range(1,nrows)][range(1,aSize)],boost::fortran_storage_orde r()); B[1][1] = 1.0; printf("\n first B11 %lf %lf %lf %lf %lf %lf",B[1][1],B[2][1],B[3][1],B[4][1],B[5][1],B[5][1]); printf("\n first B21 %lf %lf %lf %lf %lf %lf",B[1][2],B[2][2],B[3][2],B[4][2],B[5][2],B[6][2]); B[2][1] = 2.0; printf("\n first B11 %lf %lf %lf %lf %lf %lf",B[1][1],B[2][1],B[3][1],B[4][1],B[5][1],B[5][1]); printf("\n first B21 %lf %lf %lf %lf %lf %lf",B[1][2],B[2][2],B[3][2],B[4][2],B[5][2],B[6][2]); B[3][1] = 3.0; B[4][1] = 4.0; B[5][1] = 5.0; B[6][1] = 6.0; printf("\n first B11 %lf %lf %lf %lf %lf %lf",B[1][1],B[2][1],B[3][1],B[4][1],B[5][1],B[5][1]); printf("\n first B21 %lf %lf %lf %lf %lf %lf",B[1][2],B[2][2],B[3][2],B[4][2],B[5][2],B[6][2]); B[1][2] = 7.0; printf("\n first B11 %lf %lf %lf %lf %lf %lf",B[1][1],B[2][1],B[3][1],B[4][1],B[5][1],B[5][1]); printf("\n first B21 %lf %lf %lf %lf %lf %lf",B[1][2],B[2][2],B[3][2],B[4][2],B[5][2],B[6][2]); B[2][2] = 8.0; printf("\n first B11 %lf %lf %lf %lf %lf %lf",B[1][1],B[2][1],B[3][1],B[4][1],B[5][1],B[5][1]); printf("\n first B21 %lf %lf %lf %lf %lf %lf",B[1][2],B[2][2],B[3][2],B[4][2],B[5][2],B[6][2]); B[3][2] = 9.0; B[4][2] = 10.0; B[5][2] = 11.0; B[6][2] = 12.0; printf("\n first B11 %lf %lf %lf %lf %lf %lf",B[1][1],B[2][1],B[3][1],B[4][1],B[5][1],B[5][1]); printf("\n first B21 %lf %lf %lf %lf %lf %lf",B[1][2],B[2][2],B[3][2],B[4][2],B[5][2],B[6][2]); Which when I ran it produced: first B11 1.000000 0.000000 0.000000 0.000000 0.000000 0.000000 first B21 0.000000 0.000000 0.000000 0.000000 -0.000000 -2656983832617227100000 0000000000000000000000000000000000000000000000000000000000000000000000000000 0000 0000000000000000000000000000000000000000000000000000000000000000000000000000 0000 0000000000000000000000000000000000000000000000000000000000000000000000000000 0000 000000000000000000000000000000000000000000.000000 first B11 1.000000 2.000000 0.000000 0.000000 0.000000 0.000000 first B21 2.000000 0.000000 0.000000 0.000000 -0.000000 -2656983832617227100000 0000000000000000000000000000000000000000000000000000000000000000000000000000 0000 0000000000000000000000000000000000000000000000000000000000000000000000000000 0000 0000000000000000000000000000000000000000000000000000000000000000000000000000 0000 000000000000000000000000000000000000000000.000000 first B11 1.000000 2.000000 3.000000 4.000000 5.000000 5.000000 first B21 2.000000 3.000000 4.000000 5.000000 6.000000 -26569838326172271000000 0000000000000000000000000000000000000000000000000000000000000000000000000000 0000 0000000000000000000000000000000000000000000000000000000000000000000000000000 0000 0000000000000000000000000000000000000000000000000000000000000000000000000000 0000 00000000000000000000000000000000000000000.000000 first B11 1.000000 7.000000 3.000000 4.000000 5.000000 5.000000 first B21 7.000000 3.000000 4.000000 5.000000 6.000000 -26569838326172271000000 0000000000000000000000000000000000000000000000000000000000000000000000000000 0000 0000000000000000000000000000000000000000000000000000000000000000000000000000 0000 0000000000000000000000000000000000000000000000000000000000000000000000000000 0000 00000000000000000000000000000000000000000.000000 first B11 1.000000 7.000000 8.000000 4.000000 5.000000 5.000000 first B21 7.000000 8.000000 4.000000 5.000000 6.000000 -26569838326172271000000 0000000000000000000000000000000000000000000000000000000000000000000000000000 0000 0000000000000000000000000000000000000000000000000000000000000000000000000000 0000 0000000000000000000000000000000000000000000000000000000000000000000000000000 0000 00000000000000000000000000000000000000000.000000 first B11 1.000000 7.000000 8.000000 9.000000 10.000000 10.000000 first B21 7.000000 8.000000 9.000000 10.000000 11.000000 12.000000 THis first thing to note is that i get 2 in two places in the output after only inputing it once. Why is B[1][2] identical with B[2][1] ? I have also tried referencing it as [1-6][1-2] and it still has garbage in the array( same results after adding [1][2], as I can see the same value in [2][1]). I also had the assignment statements as [1-2][1-6] with no change in the output for [1][2] and [2][1]. Any help greatly appreciated on this since it is really confusing me. I found that using the documention wasn'te much help since it seems to contain errors. I had to look in the examples to see that fortran_storage_order was a function that needed the parenthesis, since the doc left them out in the text. But the examples had them. Dave

2 1

Enabling boost::date_time::posix_time::nanosec().
by adutoit 03 Jun '03

03 Jun '03

Hi. Is there a quick way to determine whether one's operating system supports the nanosecond precision clock? Also; I realise that BOOST_DATE_TIME_HAS_NANOSECONDS needs to be defined to use nanosec() method. But; should I be able (if my operating system supports it) to define support for nanosecond time resolution at installation time? I.e. would it suffice to use a bjam commandline parameter defining nanosecond support when building the Boost date_time libraries? Also; how do I configure nanosecond support for subsequent compilation of programs which use Boost and require nanosecond posix_time resolution? Greetings, Andre. [Non-text portions of this message have been removed]

2 1

Agree totally.
by Dan Dimerman 03 Jun '03

03 Jun '03

Can anyone who successfuly wrote some code with BGL post it somewhere ?

2 1

RE: [Boost-Users] int64_t problem
by Jim.Hyslop 02 Jun '03

02 Jun '03

Sigis wrote: > I am using OpenInventor and boost 1.29 librariess. Both of > them have defined > int64_t: > > typedef __int64 int64_t; [...] > The only solution I found is to add #undef just before define at > boost/cstdint.hpp: > #undef int64_t > typedef __int64 int64_t; > > But it looks as dirty solution. Maybe it is possilbe to solve > this problme in > more elegant way? First step is to send a complaint (or enhancement request, if you prefer :=) to OpenInventor - any new types they introduce should be wrapped in their own namespace. Also, if #undef really *does* work, then that means either your compiler is buggy (#undef should only work on macros, not typedefs), or OpenInventor are using a #define, not a typedef - double penalty points for that! (well, I suppose if it's a C library, that _might_ be acceptable. Barely.) If it is a #define, you could try wrapping the OpenInventor headers in another header: // Wrapper file for using OpenInventor with Boost [include guard #ifdefs] #include "OpenInventorHeader.h" #undef int64_t #endif // #include guard In any source file that uses both Boost and OpenInventor, include the wrapper header instead of the OpenInventor header. You'll want to check for any include order problems, i.e. you may have to ensure all Boost headers are included after all OpenInventor headers. Subtle issue, though - could this violate the ODR (One Definition Rule)? I think we'd have to see exactly how OpenInventor defines/typedefs int64_t to be sure. Other possible solutions: - Decouple Boost and OpenInventor, by wrapping the OpenInventor objects you are using in proxy objects. The proxies will use an opaque handle to the OpenInventor objects. Use these proxy objects wherever you currently use OpenInventor. This, by the way, has the advantage of decoupling your application from OpenInventor, allowing you the option to move to a different library if you ever decide that should be necessary. - If OpenInventor's int64_t is a typedef, put it inside an OpenInventor namespace (this probably won't work if you do not have the source code to OI in order to rebuild the binaries). If it's not a typedef, then make it a typedef in an OpenInventor namespace (same caveats). - If OpenInventor really does use a typedef, and if the typedef is inside an OI namespace, then hunt down and destroy any using directives (i.e. "using namespace OI;" or "using OI::whatever;") in any headers, and move any using directives inside your source files *after* all #include directives. If you find a "using namespace" directive in any of the OpenInclude directives, then that's triple penalty points against them, and definite cause for a complaint (not an enhancement request :=). - [radical solution, probably unrealistic] change library vendors, and be sure to tell OI why you are dropping them (because they don't play well with everyone else). - <sigh> change library vendors, and be sure to tell Boost why you are dropping them :=( Boost plays nicely - int64_t is a typedef, and it is declared inside namespace boost. -- Jim

2 1

No more than 10 types in boost::tuple?
by Tarjei Knapstad 02 Jun '03

02 Jun '03

I tried constructing a tuple with 12 types today without much luck. I've read through the headers to see if there was any obvious way of getting around the 10 limit but couldn't find one (I half expected to find something along the way of vectorxx<>, in MPL). Am I being stupid, or is there really no way of constructing a tuple with more than 10 elements? Also, are there any plans of integrating and/or making boost::tuple dependant on the MPL? I realize that tuple predates the MPL, but there's no use in duplicating efforts. boost::tuple has it's own compile time IF<> and also provides it's own typelist class which are both readily available in the MPL. Cheers, -- Tarjei

2 3

How to compile jam.exe with Visual Studio .NET (Win2000) where to download it?
by rasasenkuviene 01 Jun '03

01 Jun '03

I was trying to build boost-jam and boost-build executable with build.bat in Visual Studio .NET (Windows 2000) from downloaded sources. However, ended with single non-functional jam0.exe and truncated to zero length my own compiler cl.exe from Visual Studio .NET. Nmake coul'nt be used, because makefiles were not included. What is going on? How to compile or obtain needed boost-jam or boost-build executables under Windows2000? Or this BOOST is intended for UNIX only?

3 2

Newbee Questions on Directory Structure of Boost Libs.
by Adalbert Perbandt 01 Jun '03

01 Jun '03

Hi there, I'm new to Boost and have some problems understanding the way Boost libs. are built and installed. I downloaded boost_1_30_0. unpacked the archive and built the test library (I had installed bjam previously). I did the build step on two different platforms and with different compilers: - On Linux (RedHat 7.3) with gcc/3.2.2 and - on Sun SPARC Solaris 2.7 with Sun's Forte 6.2 compiler. I created an installation directory /opt/boost_1.30.0. Into this directory I copied the directory tree below boost/test and libs/test: /opt/boost_1.30.0/boost/test/... /opt/boost_1.30.0/libs/test/... I think so far everything is correct, isn't it? I do not completely understand the directory structure generated during the build process: ../boost_1_30_0/libs/test/build/bin/libboost_prg_exec_monitor.a /libboost_prg_exec_monitor.so /libboost_test_exec_monitor.a /libboost_test_exec_monitor.so /libboost_unit_test_framework.a /libboost_unit_test_framework.so Below the directories given above a specific subdirectory tree was created. Example: .../libboost_prg_exec_monitor.a/ /sunpro/ /debug/ /runtime-link-dynamic/ /runtime-link-static/ /threading-multi/libboost_prg_exec_monitor.a /threading-single/libboost_prg_exec_monitor.a >From this I conclude: 1. The builds are separated from each other in compiler specific subdirectory trees, e.g. the "sunpro" subtree contains the build results from $ bjam "-sTOOLS=sunpro" i.e. the sun forte 6.2 compiler and the "gcc" subtree contains the build results from $ bjam "-sTOOLS=gcc" i.e. the gcc 3.2.2 compiler on Linux. Obviously there is no separation by OS platform (Solaris or Linux). What would I have to do to build the lib. with gcc on Solaris? Where would the products be installed? Furthermore there is no separation by compiler version (e.g. gcc 2.95.2 is not separated from gcc 3.2.2). Is this considered unnecessary? 2. The libs were built with debug symbols (-g option) only), correct? I'm not familiar with jam and therefore don't know what to do to get them built with optimization active. It seems to me as if this should be rather simple because in ../boost_1_30_0/tools/build/sunpro-tools.jam obviously two variants of the CFLAGS variable for optimization are defined: flags sunpro CFLAGS <optimization>speed : -fast -O4 ; flags sunpro CFLAGS <optimization>space : -O2 -xspace ; Any hints are welcome. Thanks, Adalbert Perbandt.

3 3