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

RE: [Boost-Users] Re: help with mersenne_twister
by scleary＠jerviswebb.com 17 Mar '03

17 Mar '03

> Hello Steve, and thank you for your kind help. I am trying to use > the boost library as part of a project in which I demonstrate the > validity of various random number generation algorithms and > methodologies. I wanted to use boost to demonstrate what can be > achieved through top class C++ generic programming. It sounds like Boost.Random may be a good choice for this. > I used mt19937 as you directed and my example did compile but when I > ran the binary file through Diehard it failed every single test > every time. I am sure this can not be due to the algorithm, but I > can not pinpoint what I could be doing in error. Here is the code I > used to create a binary file for diehard: I am not familiar with the "Diehard" tests. But I see a couple of problems in your example code: you are not creating a binary file, and you are not generating random numbers. > ofstream file("MTRNG.bin", ios::binary); "ios::binary" means open the output text file without \n -> \r\n conversions. It does not make insertions and extractions binary. > file << MT; This means to save the current state of the random number generator in the text output file. To output the generated random numbers (instead of the random number generator state), use: file << MT(); To output the generated random numbers to a binary file, use: const mt19937::result_type x = MT(); file.write((const char *) &x, sizeof(x)); > I was intending on using boost::random to demonstrate various > deterministic and non-deterministic RNGs and their validity as far > as randomness using Diehard. A last note: Boost.Random currently only provides one non-deterministic RNG, and it only works on Linux. -Steve

2 1

RE: [Boost-Users] help with mersenne_twister
by scleary＠jerviswebb.com 17 Mar '03

17 Mar '03

> -----Original Message----- > From: Jon Agiato [mailto:JonAgiato@nyc.rr.com] > > I am having difficulty in understanding the documentation regarding > the use of the pseudo-random number generators in boost::random. > Below, I have created a small sample program of the type I am trying > to create in order to use the various classes in boost::random with > Diehard (requires a binary file of 32 bit integers for testing). > This program does not compile as it says that mersenne_twister > requires template arguments. I understand what that means of > course, but am unsure as to what arguments should go in there. I am > using MSVC++ 7.0 and would really apprechiate any assistance. > Thanks! The Boost.Random library defines fully-generic random number generator algorithms, e.g., boost::random::mersenne_twister, boost::random::linear_congruential, etc. These are only for advanced users. The Boost.Random library also provides specializations of those generic random number generator algorithms for use by normal users. e.g., boost::mt19937 and boost::mt11213b are both specializations of the Mersenne twister; and boost::minstd_rand is a specialization of the linear congruential algorithm. So, unless you have really exceptional random number requirements, you should be using boost::mt19937 instead of boost::random::mersenne_twister: > using boost::random::mersenne_twister; using boost::mt19937; > mersenne_twister MT; mt19937 MT; Then your example should compile. -Steve

2 1

help with mersenne_twister
by agiatojon 17 Mar '03

17 Mar '03

Hello all, I am having difficulty in understanding the documentation regarding the use of the pseudo-random number generators in boost::random. Below, I have created a small sample program of the type I am trying to create in order to use the various classes in boost::random with Diehard (requires a binary file of 32 bit integers for testing). This program does not compile as it says that mersenne_twister requires template arguments. I understand what that means of course, but am unsure as to what arguments should go in there. I am using MSVC++ 7.0 and would really apprechiate any assistance. Thanks! #include <iostream> using std::cout; using std::cin; #include <cstdlib> #include <boost/random/mersenne_twister.hpp> using boost::random::mersenne_twister; #include <iomanip> using std::ios; #include <fstream> using std::ofstream; int main() { ofstream file("MTRNG.bin", ios::binary); const unsigned int N = 10; unsigned int i = 0; mersenne_twister MT; for(; i != N; ++i) { file << MT; } cin.get(); return EXIT_SUCCESS; } Jon Agiato JonAgiato(a)nyc.rr.com

2 1

RE: [Boost-Users] boost install and library linking
by scleary＠jerviswebb.com 17 Mar '03

17 Mar '03

> Clearly, I need to link to one of the boost::test library. How > should I be linking to this library? All libraries that were built > have a .lib extention and are spread over a huge directory > structure. How can I tell which library I need? I'm not that familiar with Boost.Test (yet), so I really can't answer this one. > Is there a way to finnish the build process so that all of the > statically-linked debug libraries are in one place? If somebody > would send me a make file or let me know what is a good approach to > building applications with boost, I'd appreciate it. AFAIK, there is no way to place all the .lib files in a single directory. The phrase "building applications with boost" leads me to state: Boost is not a library. Rather, Boost is a collection of libraries. Most of the Boost libraries (such as Boost.Random) are header libraries, which means that you add ${BOOST} to the include path of your compiler and you're done with the "installation". There are a few Boost libraries (Python, Regex, Signals, Test, and Thread) that produce actual .lib library files. If you are not using those libraries, you do not need to build the .lib files. HTH, -Steve

2 1

Re: [boost] Re: Regressions in type_traits and lexical_cast (was: Re: Questionabout boost::function)
by Douglas Gregor 15 Mar '03

15 Mar '03

On Saturday 15 March 2003 06:03 pm, Andreas Huber wrote: > [ ... ] > > > Index: is_class.hpp > > =================================================================== > > RCS file: /cvsroot/boost/boost/boost/type_traits/is_class.hpp,v > > retrieving revision 1.5 > > retrieving revision 1.6 > > diff -r1.5 -r1.6 > > 84a85 > > > > > ::boost::type_traits::ice_not< ::boost::is_function<T>::value > > >:: > > >::value > > > > John? > > This is due to the missing comma I reported in > > http://lists.boost.org/MailArchives/boost/msg45211.php > > Regards, > > Andreas Ah, yes it is. I've applied the patch (actually, Daniel Frey's version: no need to duplicate code) on mainline and the RC_1_30_0 branch. Doug

2 1

boost install and library linking
by adam_speight 15 Mar '03

15 Mar '03

I have a general question about finnishing the install process for boost. I have built boost on Cygwin/Gcc3.x/winXP and now have many versions of various libraries in a deep directory tree. Now, suppose I want to compile something, say random_test.cpp from http://www.boost.org/libs/random/index.html I get the following compiler error /cygdrive/c/DOCUME~1/aspeight/LOCALS~1/Temp/ccQGyqEq.o (.text$_Z8validateIN5boost6rand48EEvRKSsRKT_+0x103):random_test.cpp: undefined reference to `boost::test_toolbox::detail::test_and_continue_impl(bool, boost::test_toolbox::detail::wrapstrstream const&, char const*, int, bool, boost::unit_test_framework::report_level)' Clearly, I need to link to one of the boost::test library. How should I be linking to this library? All libraries that were built have a .lib extention and are spread over a huge directory structure. How can I tell which library I need? Is there a way to finnish the build process so that all of the statically-linked debug libraries are in one place? If somebody would send me a make file or let me know what is a good approach to building applications with boost, I'd appreciate it. Thanks, Adam

1 0

Generic output manipulator for lists
by Reece H Dunn 14 Mar '03

14 Mar '03

I have a manipulator that will display lists in the basic form: [ i1, i2, ... , in ] It has a usage for a container where it prints the entire container in the list notation; it also has the ability to select the range to be displayed: template< typename ForwardIterator > inline formatlist_t< ForwardIterator > formatlist( ForwardIterator first, ForwardIterator last ); template< typename Container > inline formatlist_t< typename Container::iterator > formatlist( Container & c ); Example usage of the manipulator is thus: std::vector< int > v( 10 ); std::generate( v.begin(), v.end(), std::rand ); // basic list formatting std::cout << "list = " << stl::formatlist( v ) << '\n'; // use the form :- ( i1, ..., in ) std::cout << "list = " << stl::formatlist( v ).format( '(', ')' ) << '\n'; // use the form :- [ i1 | ... | in ] std::cout << "list = " << stl::formatlist( v ).format( '|' ).space( true, true ) << '\n'; You can currently configure the opening and closing elements of the list (default to '[' and ']'); the seperator used (defaults to ','); the spacing around the list (default true) and before/after the seperator (defaults to after the seperator only). I would like to submit it into the boost library. Are there any comments/suggestions/questions? I have currently only tested it with MS VC++.NET 7, but have written the code to not use any MS specific features so it should be usable on most of the current compilers. -rhd- mailto:msclrhd@hotmail.com

2 1

boost::random examples of pseudo-random number generation
by agiatojon 14 Mar '03

14 Mar '03

Hello all, I would like to use boost for a project I am doing but have not been able to find an example of how one would use each class. I am sure it must be me but I am finding the doumentation a bit hard to read, and I am sure it is much easier than I am finding it. In case it is relevant, I am using MSVC++ 7.0. Thanks for any and all help/suggestions! Jon Agiato JonAgiato(a)nyc.rr.com

2 1

Regex++ bug?
by sugi＠dream.big.or.jp 14 Mar '03

14 Mar '03

Hi. I found some strange behaviors in Regex++. For details, please see the following source. These are bugs? or do I have mistaken? boost's version is 1.29.0. --- #include <iostream> #include <boost/regex.hpp> using namespace std; void p(const char *r, const char *s){ cout << endl << "*********" << endl; cout << "regex: " << r << endl; cout << "string: " << s << endl; cout << "result: " << (boost::RegEx(r).Search(s) ? "found" : "not found") << endl; } int main(){ // I think this must not match, but this do. p("a\\Z", "a\nb"); // These match. Correct behaviors. p("()", "abc"); p("^()", "abc"); p("^()+", "abc"); p("^(){1}", "abc"); // But these don't match. // Are these wrong? p("^(){2}", "abc"); p("^((){2})", "abc"); // I feel these somewhat strange. // But I have little confidence to say that this is a bug. p("()", ""); // found (OK) p("()\\1", ""); // not found (this must match?) p("()\\1", "a"); // found (OK) p("a()\\1b", "ab"); // found (OK) p("a()b\\1", "ab"); // not found (this must match?) return 0; } --- Kouhei Yanagita

2 2

filling in vertex_name_t property for adjacency_list
by Dieter Vrancken 14 Mar '03

14 Mar '03

Hi, I'm trying to create a graph that has a name for each vertex. Below is what I've come up with so far. I really don't know what's wrong with it. Can any of you help me out? I'm using boost 1.29.0 with Visual Studio6.0sp5 on win2k. I'm getting some errors on the line that's supposed to get the property map. Then a whole bunch of others because in the end 'name' has an incomplete type. kind regards, Dieter Vrancken // create some vertex names typedef std::set<std::string> StringSet; StringSet v_names; std::string names[] = { "v1", "v2", "v3" }; v_names.insert(names, names + sizeof(names)/sizeof(names[0])); // declare the graph typedef boost::adjacency_list<boost::setS, boost::vecS, boost::directedS, boost::vertex_name_t, boost::no_property, boost::graph_name_t, boost::setS> Graph; Graph g(v_names.size()); // get the property map for the vertex names boost::property_map<Graph, boost::vertex_name_t>::type name = boost::get(boost::vertex_name, g); // fill in the names StringSet::const_iterator ss_it = v_names.begin(), ss_end = v_names.end(); int i = 0; for(; ss_it!=ss_end; ++ss_it, ++i) boost::put(name, i, *ss_it);

3 3

What is the relationship between BGL's edge_descriptor and edge_iterator?
by Jeff Holle 14 Mar '03

14 Mar '03

What is the relationship between an "edge_descriptor" and what an edge_iterator dereferences? I'm having problems coding the following: myFunct(GraphT& g) { typedef graph_traits<GraphT>::edge_descriptor Edge; typedef map< Edge, Edge_Datum> Edge_Data; Edge_Data edge_data; graph_traits<GraphT>::edge_iterator ei, ei_end; for(tie(ei,ei_end)=edges(graph);ei!=ei_end;++ei) edge_data.insert( make_pair(*ei, Edge_Data())); << blows up here. }

1 1

Minor bug in docu of lambda library
by Peter Klotz 13 Mar '03

13 Mar '03

URL: http://www.boost.org/libs/lambda/doc/ar01s03.html#id2741989 The code fragment template <class T> : public binary_function<T, T, T> struct plus { should read template <class T> struct plus : public binary_function<T, T, T> { Best regards, Peter.

1 0

slightly off-topic: recommendation for algorithm timing?
by Alejandro Escalante Medina 13 Mar '03

13 Mar '03

This is may a little out of the topic, but maybe you could recommend me some good class for measuring code execution times... Thanks, Alex _________________________________________________________ Do You Yahoo!? La mejor conexión a internet y 25MB extra a tu correo por $100 al mes. http://net.yahoo.com.mx

3 2

Blind dynamic cast
by lorydido 13 Mar '03

13 Mar '03

Good morning, First of all, thank you very much for your help in advance. I have a problem in dynamic casting. sc_object *o = (sc_object*)(x[i]); if (typeid(*o)==typeid(sc_out<bool>)) sc_out<bool> *thisPort=dynamic_cast<sc_out<bool> *>(o); sc_out<T> type is a polymorphic template class that inherits sc_object class. I would like to cast the polymorphic object (*o) without to know the template type T of sc_out<T>. I would avoid all the possible casts that can result in an enormous computational burden. I would like to access to the methods of sc_out<T> type.I cannot modify the code of sc_out<T> and sc_object.Does exist any way to perform this "blind" operation? Does exist a boost library that allows the use of the string typeid.name() as type in dynamic cast operation? thank you very much in advance Lorenzo PIERALISI

2 1

compose_f_gx problem
by pirx 13 Mar '03

13 Mar '03

hi, I've got a question regarding the compose_f_gx function object. I tried to use it in combination with this small example. class Element { public: explicit Element(int nVal) : m_nValue(nVal) {} const int getValue() const { return m_nValue; } private: int m_nValue; }; Element el(3); // a == true; bool a = bind<bool>(equal_to<int>(), _1, 3)(3); // b == 3; int b = mem_fn(&Element::getValue)(el); // c == true bool c = bind<bool>(equal_to<int>(), _1, 3) (mem_fn(&Element::getValue)(el)); // d should also be true, but does not compile bool d = compose_f_gx(bind<bool>(equal_to<int>(), _1, 3), mem_fn(&Element::getValue))(el); The last line does not compile. I don't know why. So what's wrong? thanks, andreas

2 1

Re: [Boost-Users] slightly off-topic: recommendation for algorithm timing?
by Paul Grenyer 13 Mar '03

13 Mar '03

Hi > This is may a little out of the topic, but maybe you > could recommend me some good class for measuring code > execution times... Would boost's timer do what you want? Regards Paul Paul Grenyer Email: pjgrenyer(a)iee.org Web: www.paulgrenyer.co.uk "So long and thanks for all the fish."

1 0

filling in vertex_name_t property for adjacency_list
by Jack Rabbit 13 Mar '03

13 Mar '03

Hi, I'm trying to create a graph that has a name for each vertex. Below is what I've come up with so far. I really don't know what's wrong with it. Can any of you help me out? I'm using boost 1.29.0 with Visual Studio6.0sp5 on win2k. I'm getting some errors on the line that's supposed to get the property map. Then a whole bunch of others because in the end 'name' has the wrong type. kind regards, Dieter Vrancken // create some vertex names typedef std::set<std::string> StringSet; StringSet v_names; std::string names[] = { "v1", "v2", "v3" }; v_names.insert(names, names + sizeof(names)/sizeof(names[0])); // declare the graph typedef boost::adjacency_list<boost::setS, boost::vecS, boost::directedS, boost::vertex_name_t, boost::no_property, boost::graph_name_t, boost::setS> Graph; Graph g(v_names.size()); // get the property map for the vertex names boost::property_map<Graph, boost::vertex_name_t>::type name = boost::get(boost::vertex_name, g); // fill in the names StringSet::const_iterator ss_it = v_names.begin(), ss_end = v_names.end(); int i = 0; for(; ss_it!=ss_end; ++ss_it, ++i) boost::put(name, i, *ss_it);

1 0

Efficient implementation of associative_property_map
by Martin Okrslar 12 Mar '03

12 Mar '03

Dear Boost users, for an application in computational biology I am intendig to use the BGL to compute strongly connected components of a graph with about 600.000 nodes. In the BGL book on page 103 it is mentioned, that "The choice to use std::map to implement the property map is rather inefficient in this case...". Since my graph is large I'm a bit worried about this statement. Could anybody of you please give me a hint, what other datastructure I might use here, to make it efficient? all the best Martin -- ----------------------------------------------------------------------------- Martin Okrslar MPI for Molecular Genetics phone: ++ 49 + 30 / 8413-1166 Computational Molecular Biology Fax: ++ 49 + 30 / 8413-1152 Ihnestrasse 73 email: okrslar(a)molgen.mpg.de D-14195 Berlin URL: http://cmb.molgen.mpg.de -----------------------------------------------------------------------------

7 9

adjacency_matrix
by agiatojon 12 Mar '03

12 Mar '03

Hello all, I'm new to the list and to Boost in general and am trying to use an adjacency_matrix in order to plot coordinates (hopefully that is a good use for it). I just started trying to learn it and have entered the sample program from page 237 into my compiler (VS.NET) Below is the program I have entered. I am getting errors in that print_vertices, print_edges, and print_graph are undefined and are not members of boost. Any help apprechiated! Thanks. /** * adjaMatri.cpp * Nov 7th, 2002 * Boost Graph Library, pg. 237 */ #include <iostream> using std::cout; using std::cin; using std::endl; #include <boost/graph/adjacency_matrix.hpp> using namespace boost; int main() { enum { A, B, C, D, E, F, N }; const char *name = "ABCDEF"; typedef boost::adjacency_matrix<boost::undirectedS> UGraph; UGraph ug(N); add_edge(B, C, ug); add_edge(B, F, ug); add_edge(C, A, ug); add_edge(D, E, ug); add_edge(F, A, ug); cout << "vertex set: "; boost::print_vertices(ug, name); cout << endl; cout << "edge_set: "; boost::print_edges(ug, name); cout << endl; cout << "incident edges: "; boost::print_graph(ug, name); cout << endl; cout << "Press enter to exit..."; cin.get(); return EXIT_SUCCESS; } Jon Agiato JonAgiato(a)nyc.rr.com

2 1

BGL: getting components of graphs with properties
by Martin Okrslar 12 Mar '03

12 Mar '03

Dear Group, when computing the connected components of a BGL graph one has to create a vector that holds the component integer assigned to each vertex (See http://www.boost.org/libs/graph/example/connected_components.cpp and http://www.boost.org/libs/graph/doc/connected_components.html) OK, that works very well. But how can I get the component number of each vertex? If my graph has internal properties, I can not simply access the vector with an iterator on the graph vertices: component[*vi]; //doesn't work! This doesn't work, because the vertices (to be specific: the vertex desriptors) of the graph aren't integers if the graph has internal properties. Any idea how to get the component of each vertex? all the best Martin -- ----------------------------------------------------------------------------- Martin Okrslar MPI for Molecular Genetics phone: ++ 49 + 30 / 8413-1166 Computational Molecular Biology Fax: ++ 49 + 30 / 8413-1152 Ihnestrasse 73 email: okrslar(a)molgen.mpg.de D-14195 Berlin URL: http://cmb.molgen.mpg.de -----------------------------------------------------------------------------

1 0

[V2] Problems with stage rule
by klapshin 12 Mar '03

12 Mar '03

Hi, I am having few problems on CygWin with latest boost CVS snapshot. I am building project with a number of dlls, and I need a way to run program easily. I tried hardcode-dll-paths=true, but it does not seem to work on CygWin, so I decided to use stage rule to copy all binaries in top/bin folder. First problem was that CP variable is empty and copying of the dlls failed. I worked around this one with bjam -sCP=cp. BTW, was not it supposed to be relinked rather then copied? Next problem was with exe file. Stage failed with following errors: ----------------- /cygdrive/c/work/boost1/tools/build/new/stage.jam:97: in object(stage-exe-gener tor)(a)1.run *** argument error * rule object(file-target)(a)174.depends ( d + ) * called with: ( ) * missing argument d /cygdrive/c/work/boost1/tools/build/new/virtual-target.jam:86:see definition of rule 'object(file-target)(a)174.depends' being called /cygdrive/c/work/boost1/tools/build/new/generators.jam:638: in try-one-generato /cygdrive/c/work/boost1/tools/build/new/generators.jam:885: in construct-withou -caching /cygdrive/c/work/boost1/tools/build/new/generators.jam:937: in generators.const uct /cygdrive/c/work/boost1/tools/build/new/stage.jam:56: in construct /cygdrive/c/work/boost1/tools/build/new/targets.jam:604: in object(stage-target class)(a)3.generate /cygdrive/c/work/boost1/tools/build/new/targets.jam:386: in generate-really /cygdrive/c/work/boost1/tools/build/new/targets.jam:363: in object(main-target) 3.generate /cygdrive/c/work/boost1/tools/build/new/targets.jam:182: in object(project-targ t)(a)1.generate /cygdrive/c/work/boost1/tools/build/new/build-system.jam:140: in load /cygdrive/c/work/boost1/tools/build/new/modules.jam:171: in import /cygdrive/c/work/boost1/tools/build/new/bootstrap.jam:41: in boost-build /cygdrive/c/work/pricing/boost-build.jam:13: in module scope ------------------ One more thing. Suppose I want to install all dlls to bin subfolder of project root. I tried to define path-constant in project-root, and then in one of subprojects apply stage on target and supply path from that path-constant. I end up with dll being copied into bin subfolder of subproject, rather then root. Is it expected behavior? My workaround was to put all stage rules in root Jamfile. - Kirill

1 1

BOOST_PP_NOT documentation
by Staggs Mark - mstagg 11 Mar '03

11 Mar '03

This is a _very_ minor thing, but I noticed in the documentation for BOOST_PP_NOT the following line: If x is non-zero, this macro expands to 1. Otherwise, it expands to 0. Should read: If x is zero, this macro expands to 1. Otherwise, it expands to 0. URL: http://www.boost.org/libs/preprocessor/doc/ref/not.html ---- Mark Staggs Acxiom Corp. ********************************************************************* The information contained in this communication is confidential, is intended only for the use of the recipient named above, and may be legally privileged. If the reader of this message is not the intended recipient, you are hereby notified that any dissemination, distribution, or copying of this communication is strictly prohibited. If you have received this communication in error, please re-send this communication to the sender and delete the original message or any copy of it from your computer system. Thank You.

2 1

boost::thread not started
by justin_michel 11 Mar '03

11 Mar '03

Platform : Windows XP, Pentium 4, Visual C++ 6 sp5 I've traced down my problem with starting a thread from a DLL called from Java JNI. If you look at the source code thread.cpp in boost, you can see that a condition variable is used block the creating thread until the new thread function is started. Basically, what I am seeing is that if you wait on this condition variable, then the thread will never start. If I remove the call to param.wait() at the bottom of the constructor then everything works fine. I can't think of a logical explanation, but it's very repeatable. I was also able to recreate this problem using the latest source from CVS. The simple solution would be to remove the condition variable from thread_param code entirely. This would simplify everything, and I don't really see the value anyway. All that is currently guaranteed is that thread_proxy will be called before the boost::thread() constructor is finished. But it doesn't guarantee that threadfunc() will be called before the constructor is finished. Thanks, Justin Michel OCI

2 3

uBLAS: Can I make my vector<...> derived class 'copy constructible' ?
by speedsnaii 11 Mar '03

11 Mar '03

Hi Joerg, or anyone who can help! As I am still on my spline templates, I came on to the following beast: template<class T> struct index_vector : public vector<std::pair<T, vector<ublas::vector<T>::size_type> > > {}; This should be an index vector that relates to a double (first) a vector of indices (second) which happens to be different for each 'first'. So far so easy. I can say: index_vector<double> IY; IY.resize(5); IY[0].first = 3.14; IY[0].second.reset(vector<double>(3)); IY[0].second[2] = 1; But I cannot: index_vector<double> IZ(IY); or index_vector<double> IZ; IZ = IY; or IZ.reset(IY); This compiles, but gives me runtime assertions because of size mismatches. I think my derived class is not 'copy constructible' and 'assignable'. Is there a simple way to fix this? (I am not even sure whether this is a uBLAS matter. So please simple tell me, and I will try to learn the missing parts.) Thank you, Roland

2 2

How to get extents of multi_array dimensions
by Neil Mackie 11 Mar '03

11 Mar '03

I am using multi-array for the first time, without problems. Now I want to pass the multi_array around and the users of it need to find out what the maximum array indexes are in each dimension. But I do not know how to obtain them from the object. I have read the documentation and the header file but if there are any clues there I have missed them. I have also searched the archives of this list for relevant posts. Is there a call on multi_array to return the array bounds and if so how do you specify which dimension you are requesting the bounds of? Does anyone have an example they could post? Regards, Neil (J Mackie).

1 0