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

confused by ublas submatrix assignment
by cerenoc 08 Jun '03

08 Jun '03

Hi, I am new to this and am confused by the (sub)matrix operations and also not up on the math nomenclature this group is using such as slices and strides. I am trying a reasonably simple operation of assigning a vector v(2) to a submatrix (3,3). For example, in matlab notation: m = 0 1 2 3 4 5 6 7 8 v = 15 16 m(2, 1:2) = v resulting in: m = 0 1 2 15 16 5 6 7 8 What is the best way to do this with ublas? I suppose I need to convert the vector into another type first, but which one - a slice, a range? I tried both with no success. Thanks a lot, Julian

2 1

uBLA performance
by Matt Hurd 07 Jun '03

07 Jun '03

Hi, Ran off a simple test of the uBLA performance for sqare matrix multiplication. Looks quite good. Put in Intels Math Kernel Library for good measure using uBLA as the data holder but with a call to dgemm. Do you think these are the kind of numbers I should be expecting? Numbers below. Added a chart to the files section http://groups.yahoo.com/group/Boost-Users/files/ called uBLA Performance.pdf Used head of CVS from today. Regards, Matthew Hurd ___________________________________________ Figures in the raw: Matrix Size intel7.1 vc7.0 mingw intel_mkl6.0_vc7.0 ___________________________________________ 1 2 2 2 1 2 13 12 13 11 3 32 30 34 31 4 51 46 59 70 5 67 59 85 109 7 70 78 92 180 9 85 94 113 262 12 99 115 139 304 16 110 131 159 362 20 118 127 178 355 26 125 135 196 334 33 132 148 209 390 42 134 158 217 389 53 130 163 228 451 67 133 171 233 459 84 138 177 241 467 105 133 176 239 473 132 133 178 241 468 166 106 174 233 448 208 90 148 196 445 261 40 63 63 427 327 24 43 45 434 409 24 44 45 421 512 11 12 12 404 640 12 12 12 459 800 36 38 38 455 1000 36 37 38 448 ___________________________________________

1 0

Newbie query: no "deamon" thread?
by dick.bridges＠tais.com 06 Jun '03

06 Jun '03

I need to spawn worker threads that simply perform a task and exit. All the examples I can find seem to use join() to cleanup the thread resources from another thread. Isn't there some way to declare worker threads so that they "do the right thing" as they exit the thread function? TIA

3 4

[BGL] bad edge iterator range returned by boost::out_edges(v,g)?
by Chris Russell 06 Jun '03

06 Jun '03

This is weird... I'm still using BGL from Boost 1_29_0 (which may be an issue?). Anyway, I've got a graph as so: typedef boost::property<vertex_forest_property_t, CProteinCircuitForestVertexProperty, boost::property<boost::vertex_index_t, long, boost::property<boost::vertex_color_t, boost::default_color_type> > > forest_vertex_property_maps_declaration_t; typedef boost::adjacency_list<boost::listS /*edges*/, boost::listS /*vertices*/, boost::bidirectionalS, forest_vertex_property_maps_declaration_t> forest_graph_t; I've done a lot with this class, including all kinds of edge traversal. Now suddenly I have a case where boost::out_edges seems to be returning an invalid iterator range. I'm absolutely certain the vertex descriptor is correct, boost::out_degree returns the expected number of out edges, however I fault inside my access loop because the iterator has gone out of range.... typedef boost::graph_traits<forest_graph_t>::vertex_descriptor forest_vertex_descriptor_t; typedef boost::graph_traits<forest_graph_t>::vertex_descriptor forest_vertex_descriptor_t; typedef boost::graph_traits<forest_graph_t>::edges_size_type forest_edges_size_t; typedef boost::graph_traits<forest_graph_t>::out_edge_iterator forest_edge_out_iterator_t; forest_edge_out_iterator_t edgeoutiterBegin, edgeoutiterEnd, edgeoutiterCurrent; boost::tie(edgeoutiterBegin, edgeoutiterEnd) = boost::out_edges(v/*forest_vertex_descriptor_t*/,g/*forest_graph_t); for (edgeoutiterCurrent = edgeoutiterBegin; edgeoutiterCurrent != edgeoutiterEnd ; ++edgeoutiterCurrent) { // works fine through the expected out edges - faults because the loop fails to terminate forest_vertex_descriptor_t vertexTarget = boost::target(*edgeoutiterCurrent, g); } // end for Any suggestions would be greatly appreciated. I'm really scratching my head because I've done this exact operation in several other places in the algorithm and it works just fine.... TIA - Chris

4 11

Tree Object Needed!
by Hossein Haeri 06 Jun '03

06 Jun '03

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

2 2

boost::filesystem help needed
by ericd 06 Jun '03

06 Jun '03

Hi all, I have compiled the boost::filesystem using bjam and that seemed to have gone well. The first question I have concerning this is if it is normal NOT to have a libfilesystem.so. I can only find the libfilesystem.a. The path where this lives is quite deep. /usr/local/boost_1_30_0/boost/libs/filesystem/build/bin/libboost_filesystem.a/gcc/release/runtime-link-dynamic and /usr/local/boost_1_30_0/boost/libs/filesystem/build/bin/libboost_filesystem.a/gcc/debug/runtime-link-dynamic My current setup is an Ultra 80 running Solaris 9. I use both gcc version 3.2.3 for compiling and linking. The version of Boost is 1.30.0. For my second question. Having this built, I have tried to use it but come up with undefined symbols The output follows: g++ -lboost_filesystem -o io main.o Undefined first referenced symbol in file boost::filesystem::path::native_directory_string() constmain.o boost::filesystem::path::native_file_string() constmain.o boost::filesystem::path::path[in-charge](char const*, boost::filesystem::path_fo rmat)main.o boost::filesystem::directory_iterator::directory_iterator[in-charge](boost::file system::path const&)main.o boost::filesystem::path::leaf() constmain.o boost::filesystem::initial_path() main.o boost::filesystem::system_complete(boost::filesystem::path const&)main.o boost::filesystem::directory_iterator::m_inc() main.o boost::filesystem::directory_iterator::directory_iterator[in-charge]()main.o boost::filesystem::is_directory(boost::filesystem::path const&)main.o boost::filesystem::directory_iterator::m_deref() constmain.o boost::filesystem::exists(boost::filesystem::path const&)main.o ld: fatal: Symbol referencing errors. No output written to io Now I am quite sure that the path to the filesystem library is correct and therefore, cannot figure out why this will not link properly. But then again, I might be mistaken. Here is a snip from my makefile. On second thought, here is the whole thing: SHELL = /bin/sh # PROJECTLOCATION = /home/ericd/Projects/FileSystemTest EXEDIR = $(PROJECTLOCATION)/bin # LIBPATH = -L/usr/local/lib # Sources, includes and the likes.. also output names SELFTESTSRC = main.cpp INCLUDE = -I/usr/local/boost_1_30_0/boost SELFTEST = io # ifeq (,$(filter _%,$(notdir $(CURDIR)))) include target.mk else VPATH = $(SRCDIR) # Compiler Linker Defines for test exe CXX = g++ LD = g++ DEBUG = -g CXXSELFTEST = $(DEBUG) $(INCLUDE) -c -O2 -W -Wall -Wno-unused -Wno-multichar -fexceptions LDSELFTESTFLAGS = -lboost_filesystem # Building options all: test test: CXXFLAGS = $(CXXSELFTEST) test: $(SELFTEST) # SELFTESTOBJ = $(SELFTESTSRC:.cpp=.o) # pull in dependency info for *existing* .o files -include $(SELFTESTOBJ:.o=.d) # Compile and generate dependency info %.o: %.cpp $(CXX) $(CXXFLAGS) -MMD $(SRCDIR)/$*.cpp -o $@ @mv -f $*.d $*.d.tmp @sed -e 's|.*:|$*.o:|' < $*.d.tmp > $*.d @sed -e 's/.*://' -e 's/\\$$//' < $*.d.tmp | fmt -1 | sed -e 's/^ *//' -e 's/$$/:/' >> $*.d @rm -f $*.d.tmp # Link all Object Files and copy them over to our bin $(SELFTEST): $(SELFTESTOBJ) $(LD) $(LDSELFTESTFLAGS) -o $(SELFTEST) $(SELFTESTOBJ) cp $(SELFTEST) $(EXEDIR)/$(SELFTEST) # endif I have added in my .cshrc at the LD_LIBRARY_PATH var the location of my filesystem library. Being relatively new to gcc my guess is that something has to be wrong with the flags I give it. I did do an nm -C libfilesystem.a and all missing symbols reported by the link are there. Does anyone have any clue as to why this aint working? Thanks in advance for your input, Eric

3 3

Re: Can't find a clear example of disallowing parallel edges
by Arthur 06 Jun '03

06 Jun '03

The section pointed out says to use a set instead of list if you don't want parallel edges. I guess I was hoping to have parallel edge removal using a list (insertion/deletion consideration appear to make the list a better choice for me). A --- In Boost-Users(a)yahoogroups.com, "Arthur" <arthurc@t...> wrote: > Saw that... didn't help. Too many program fragments and not enough > complete code examples IMHO. I guess I'll just have to figure it out > the hard way. > > A > > --- In Boost-Users(a)yahoogroups.com, "Chris Russell" <cdr@e...> wrote: > > Arthur, > > > > see the following: > > > > http://www.boost.org/libs/graph/doc/using_adjacency_list.html > > ^- see specifically "Choosing the EdgeList type".. Sequence vs. > > AssociativeContainer vs. UniqueAssociativeContainer > > > > http://cvs.sourceforge.net/cgi- > bin/viewcvs.cgi/boost/boost/libs/graph/example/container_gen.cpp? > rev=1.1&content-type=text/vnd.viewcvs-markup > > ^- container_gen.cpp example > > > > HTH - Chris > > > > > > > > "Arthur" <arthurc@t...> wrote in message > > news:bbnl0i+k498@e... > > > I'm trying to use this graph class without detailed reading. I > can't > > > find a decent, clear example of doing this. I have a simple > graph: > > > > > > typedef adjacency_list<list, listS, bidirectionalS> Graph; > > > > > > What do I do to prevent parallel edges to be inserted? > > > > > > Thanks for any help offered, > > > Arthur

2 1

How do I use Boost with the Visual Studio IDE?
by Ken Fogel 06 Jun '03

06 Jun '03

I can get the threads examples to compile and link with bjam but I am unable to get it to work from within the Visual Studio IDE (versions 6 or 7.1). Does anyone have a basic project structure that could be used in the IDE for threads? I am writing console applications rather than GUI apps.

2 2

Re: [Boost-Users] Re: Newbie query: no "deamon" thread?
by dick.bridges＠tais.com 06 Jun '03

06 Jun '03

I was asking this question for someone else. Except for trivial programs, I always use one form of pool or another. Spend a lot of time reading "pattern" books. To tell the truth, I have no idea what the "real" cost of creating & killing threads is for the various OSs. I just treat it like small object memory allocation: if you don't have a custom allocator, try to avoid doing it. ;) Mark Sizer <yg-boost-users@m To: boost-users(a)yahoogroups.com .gmane.org> cc: Sent by: news Subject: [Boost-Users] Re: Newbie query: no "deamon" thread? <news(a)main.gmane. org> 06/05/2003 05:23 PM Please respond to Boost-Users BTW: Is there enough of a penalty to creating threads that a thread pool should be used rather than creating them on-demand? I'm curious because I'm using a pool pulling from a work queue. - Mark P.S. I realize "enough" is a bit vague. Mark Sizer wrote: > What is "the right thing"? > > You don't HAVE to join(). The creating thread will just keep going if > you don't. If you join, it waits. > > If you're passing ownership (e.g. delete responsibility) across thread > boundaries, you have to be careful, but that doesn't have much to do > with join(). > > After starting the thread, you can use a condtional in the creator to > wait for the thread to "get going" and accept ownership, sort of a > "started()" rather than an "ended()", like join(). Or you can flip it > around and have the started thread wait on the conditional whilst the > creator thread continues to use what will eventually be given to the thread. > > Is that at all helpful? > > - Mark > > dick.bridges(a)tais.com wrote: > > >>I need to spawn worker threads that simply perform a task and exit. All >>the examples I can find seem to use join() to cleanup the thread resources >>from another thread. Isn't there some way to declare worker threads so >>that they "do the right thing" as they exit the thread function? >> >>TIA >> >> >> >>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/ >> >> >> >> >> > > > > > > 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/ > > > > 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

[BGL] vistor works w/DFS, won't compile w/DFV - appearent concept check violation - but why?
by Chris Russell 06 Jun '03

06 Jun '03

I initially posted this to the devel list. Apologies for reposting it to the user list but this is really a library _user_ question - not a devel question. I've now screwed around with this for the better part of a day and haven't figured it out. I'm off re-reading BGL book 2.5 concept checking explanation but I'll still baffled. I will post the compiler errors if anyone is willing to give me hand understanding why I can't get what I believe should be quite a simple case working. Here's the problem statement: --- I've got a struct derived from boost::default_dfs_visitor that I've been using w/out any problems in an invocation of boost::depth_first_search. The call that works looks like: boost::depth_first_search(g, boost::visitor(MyDfsVisitor)); ^- NP. compiles and executes fine. Now I'm trying to use the exact same visitor in the context of a boost::depth_first_visit call (so I can set the starting vertex). But I'm having big troubles. I tried this: boost::depth_first_visit(g, s, boost::vistor(MyDfsVisitor), boost::get(boost::vertex_color, g)) // note I'm using an internal, default color map ^- this won't compile. It seems to be balking duing Jeremy's visitor concept checking? The compiler errors are extensive and it looks like none of the visitor methods are being correctly identified. (e.g. missing vis.InitializeVertex ... etc. etc..) p.172 of the BGL book on DFS notes: IN: visitor(DFSVisitor vis) whereas p.175 on DFV notes: IN: DFSVisitor visitor. So I guessed and tried this syntax: boost:depth_first_visit(g, s, MyDfsVisitor, boost::get(boost::vertex_color, g)) ^- this compiles. But I'm getting an exception fault during visitor invocation somewhere deep inside the the RTL. Can anyone enlighten me about what's going on here? What exactly does boost::vistor(X) do? And why is it needed on the DFS call, and apparently rejected in the DFV call? Any help would be sincerely appreciated. - Regards Chris

1 0

uBLAS file io
by cerenoc 06 Jun '03

06 Jun '03

Hi, I'm new to BOOST/uBLAS. I would like to use uBLAS on a matrix that I read in from a file. How does file io work with uBLAS? What are the specific formats? If someone could provide a small example it would be much appreciated. Thank you, Julian

4 3

Warning - Format library adds 48 KB
by Tom 05 Jun '03

05 Jun '03

Boost::Format adds 36KB (VC7.1) or 48 KB (VC6) to my release executable! Details: Take one C++ Win32 application which uses both MFC and the VC STL, but not std::string. Optimizations are set for minimum size. In VC7.1 the release exe is 552 KB. Add std::string, adds 4 KB. Add boost::format, adds another 36 KB. (For each I just added one statement.) For VC6 SP5 the release exe is also 552 KB. Add just the '#include's for string & format libraries, adds 20 KB (VC7.1 didn't do this). Add std::string and boost::format, adds another 32 KB. Total added by format is (20 + 32 - 4) = 48. This is not acceptable for my application. Is there a better way to use C-style printf statements with std::string? Tom. (Thanks to Gmane for making this list usenet accessible!)

1 0

Can't find a clear example of disallowing parallel edges
by Arthur 05 Jun '03

05 Jun '03

I'm trying to use this graph class without detailed reading. I can't find a decent, clear example of doing this. I have a simple graph: typedef adjacency_list<list, listS, bidirectionalS> Graph; What do I do to prevent parallel edges to be inserted? Thanks for any help offered, Arthur

2 1

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