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

Re: [Boost-users] A request for help using the Boost Unit Test Library
by Tim Allison 28 Feb '08

28 Feb '08

> ------------------------------ > > Message: 4 > Date: Thu, 28 Feb 2008 16:56:15 +0000 (UTC) > From: Gennadiy Rozental <rogeeff(a)gmail.com> > Subject: Re: [Boost-users] A request for help using the Boost Unit > Test Library > To: boost-users(a)lists.boost.org > Message-ID: <loom.20080228T165213-642(a)post.gmane.org> > Content-Type: text/plain; charset=us-ascii > > Tim Allison <tallison <at> meicompany.com> writes: > >> // each test module could contain no more then one ..... function defined >> // alternatively you could define init function yourself >> #define BOOST_TEST_MAIN >> #include <boost/test/unit_test.hpp> >> >> //___________________________________________________________________// >> >> // most frequently you implement test cases as a .... utomatic registration >> BOOST_AUTO_TEST_CASE( test1 ) > > You mean to say error is on above line, right? > >> The error messages are: >> FuserTests.cc:9: error: expected constructor, destructor, or type >> conversion before '(' token >> FuserTests.cc:18: error: expected constructor, destructor, or type >> conversion before '(' token > > What compiler are u using? Can you post compilation command? These errors may > only mean that you doing something funny during compilation and compiler do > not see BOOST_AUTO_TEST_CASE macro. I am using Gnu compiler 4.1.3-29. I have reduced the number of switches, so that the actual line used to build is: g++ -g -I../lib -I/usr/X11R6/include -I../../../source/ecs/shared -DOS_IS_LINUX -c FuserTests.cc Tim Allison > > Gennadiy > > > >

2 1

lexical_cast not throwing exception when converting negative value to UINT
by Kris Wragg 28 Feb '08

28 Feb '08

Dear subscribers, I am using lexical_cast to cast a string to an UINT, unfortunately, it is not throwing an exception if a value is negative. Example: std::wstring failString = L"-1"; UINT nTest = boost::lexical_cast<UINT>(failString); This does not throw a bad_lexical_cast exception, which it should, as -1 is not a valid unsigned integer. Perhaps I am using the wrong function, or using this one incorrectly, I've only just started using boost after moving to a new project that's not based on ancient legacy code! Regards, Kris Wragg ________________________________ This email and all attachments transmitted with it contain confidential information belonging to the sender. It is intended only for the addressee(s) stated above. Should you not be the intended recipient then any disclosure, copying, distribution or the taking of any action in reliance on the contents of this email is strictly prohibited. If you have received this transmission in error, please notify the sender immediately and permanently delete this message and destroy any copies. Internet communications cannot be guaranteed to be timely, secure, error-free or virus-free and Sender expressly does not warrant or guarantee that this e-mail is virus free. Recipient is advised to protect itself by taking the necessary steps to ensure that appropriate security measures are in place and to utilize a virus scanner before opening any attachment or down loading any information or documentation using links or other contents in this e-mail. You may opt out of receiving future communications from us by replying to this e-mail and replacing the subject line with UNSUBSCRIBE.

2 1

[mpl] Hierarchy Generation
by Scott Meyers 28 Feb '08

28 Feb '08

I have a set of types representing features code might have, e.g., typedef mpl::vector<ExceptionSafe, ThreadSafe, ReallyFast, GPLed> Features; These can occur in any combination as sets of features, e.g., tyepdef FeatureSet<ExceptionSafe> F1; typedef FeatureSet<ThreadSafe, ExceptionSafe> F2; typedef FeatureSet<ReallyFast, ExceptionSafe, GPLed> F3; There should be an implicit conversion from one FeatureSet to another if and only if we don't lose any features in the conversion. So converting from F1 to F2 or F3 is okay (since both F2 and F3 contain ExceptionSafe), but converting from F2 to F3 is not okay (because we'd lose ThreadSafe). Furthermore, a conversion that adds fewer features is preferable to one that adds more, so the conversion from F1 to F2 is better than the conversion from F1 to F3 (because the former adds only one feature while the latter adds two). I'm looking for a way to automatically generate an inheritance hierarchy that will give me the behavior I've described. For the above example, the hierarchy has four levels. The root is all the features, because any subset of features is permitted to be implicitly convertible to the set of all features. Root: FeatureSet<ExceptionSafe, ThreadSafe, ReallyFast, GPLed> The leaves are the individual features: Leaves: FeatureSet<ExceptionSafe> FeatureSet<ThreadSafe> FeatureSet<ReallyFast> FeatureSet<GPLed> The next level up is pairs of features: One level FeatureSet<ExceptionSafe, ThreadSafe> up from FeatureSet<ExceptionSafe, ReallyFast> leaves: FeatureSet<ExceptionSafe, GPLed> ... The next level up (which is one below the root) is triplets of features: One level FeatureSet<ExceptionSafe, ThreadSafe, ReallyFast> down from FeatureSet<ExceptionSafe, ThreadSafe, GPLed> root: FeatureSet<ExceptionSafe, ReallyFast, GPLed> ... In general, given a list of n features, I need a hierarchy n levels deep, with one class at the root, n classes at the leaves, and m-wise combinations of the n features at the intervening levels (where m varies from 2 to n-1). Fortunately, I don't need to worry about permutations of the ordering of the features, because I already have a way to canonically order them. (Not a great way, but it works, and that's a different problem.) Is there some way for me to use the MPL to automatically generate the hierarchy I need? Thanks, Scott

3 9

Re: [Boost-users] A request for help using the Boost Unit Test Library
by Tim Allison 28 Feb '08

28 Feb '08

I'm sorry, I completely missed your reply. Based on your comment that the new docs are for 1.34, The contents of FuserTest.cc are cut and pasted from example 1: // each test module could contain no more then one 'main' file with init function defined // alternatively you could define init function yourself #define BOOST_TEST_MAIN #include <boost/test/unit_test.hpp> //____________________________________________________________________________// // most frequently you implement test cases as a free functions with automatic registration BOOST_AUTO_TEST_CASE( test1 ) { // reports 'error in "test1": test 2 == 1 failed' BOOST_CHECK( 2 == 1 ); } //____________________________________________________________________________// // each test file may contain any number of test cases; each test case has to have unique name BOOST_AUTO_TEST_CASE( test2 ) { int i = 0; // reports 'error in "test2": check i == 2 failed [0 != 2]' BOOST_CHECK_EQUAL( i, 2 ); BOOST_CHECK_EQUAL( i, 0 ); } //____________________________________________________________________________// // EOF The error messages are: FuserTests.cc:9: error: expected constructor, destructor, or type conversion before '(' token FuserTests.cc:18: error: expected constructor, destructor, or type conversion before '(' token Tim Allison > > Today's Topics: > > 1. Re: A request for help using the Boost Unit Test Library > (Gennadiy Rozental) > > > ---------------------------------------------------------------------- > > Message: 1 > Date: Thu, 21 Feb 2008 20:05:42 +0000 (UTC) > From: Gennadiy Rozental <rogeeff(a)gmail.com> > Subject: Re: [Boost-users] A request for help using the Boost Unit > Test Library > To: boost-users(a)lists.boost.org > Message-ID: <loom.20080221T200258-326(a)post.gmane.org> > Content-Type: text/plain; charset=utf-8 > > Tim Allison <tallison <at> meicompany.com> writes: >> I am using boost 1.33.1-42 <at> 586 on Suse 10.2 (If it matters, my computer >> is a Latitude D510) and Gnu compiler 4.1.3-29 <at> 586 (as listed by Smart >> Package Manager). > > The new docs cover Boost.Test starting 1.34 > >> When I run the make file, it echos out the following line: >> g++ -Wno-deprecated -frepo -m32 -g -I../lib -I/usr/X11R6/include >> -I../../../source/ecs/shared -DOS_IS_LINUX -c FuserTests.cc >> >> FuserTests.cc is the file into which I have attempted to copy the >> examples. > > Would you care to share with us the file content? > >> The case I am most interested in running uses BOOST_AUTO_TEST_CASE( >> functionName ). This line produces the error: >> FuserTests.cc:16: error: expected constructor, destructor, or type >> conversion before ?(? token > > Obviosly Boost.Test headers are not included. > > Gennadiy > > > >

2 1

Boost::Function: Getting a pointer to a template function
by Hans Mull 28 Feb '08

28 Feb '08

Hi! I want to use a boost::function pointer to a template function. The template type should be determinated at the time the boost::function object is initialized. Example: template<class T> inline string addNumber(T inputNumber) { return lexical_cast<string>(inputNumber + 2); } template<class numType> inline boost::function<string(numType)> getFunction(numType number) { boost::function<string(numType)> f; f = //Which code can I use here? If I call f() I want to call addNumber<numType>(number) } ---------------------- I want to use it like that: void callFunction() { boost::function<string(double)> f; f = getFunction<unsigned long>(); for(int i = 0; i < 10000;i++) { std::cout << f(rand()) << endl; } } Thanks in advance, Hans

2 2

Looking for a boost graph algorithm
by Christian Sturz 28 Feb '08

28 Feb '08

Hi, I'm looking for an appropriate Boost Graph algorithm for the following problem: my graph (based on adjacency_list) represents the control-flow graph of a program where each vertex is a statement and the control-flow relations between the statements are modeled by edges. Now I'm looking for an algorithm that finds all vertices that can be reached from a defined statement. So, what I need is a back-traversal of the graph, from the given vertex to all predecessors and so forth. I didn't find any algorithm in the Boost Graph Library. The "strong_components" algorithm might be OK since it assumes a directed graph (as is mine) but the algorithm seems to operate in the direction of the directed edges. Obviously I need the the opposite direction. Do you know any approach/algorithm that might solve my problem? Regards, Chris -- Psssst! Schon vom neuen GMX MultiMessenger gehört? Der kann`s mit allen: http://www.gmx.net/de/go/multimessenger

2 3

Problems connecting to boost repository
by Lang Stefan 28 Feb '08

28 Feb '08

Hello List, I am trying to download (parts of) the current version of boost as described in http://svn.boost.org/trac/boost/wiki/BoostSubversion. I do have a subversion client installed (version 1.4.2) as well as TortoiseSVN for windows. However, so far I have been unable to download any file(s) from the repository at http://svn.boost.org. The IT staff advised me to use a proxy server and a specific port to establish that sort of internet connection, and I found and set the appropriate options for TortoiseSVN. Afterwards, when I tried to use TortoiseSVN for downloading from the boost repository, some administrative data was transferred, but still no actual files. The error messages I got were: REPORT request failed on '/svn/boost/!svn/vcc/default' REPORT of '/svn/boost/!svn/vcc/default': 400 Bad Request (http://svn.boost.org) Can anyone tell me what's wrong, or how to access the boost svn repository properly? I would try out the command line client directly, but am not sure how to set the proxy server and port. Mit freundlichen Grüssen / Kind regards Stefan Lang

2 1

Problems compiling programs with graphviz_read()
by Vivek Menon 28 Feb '08

28 Feb '08

Hello all,I am a newbie to Boost Graph Libraries. I am working on a Mac OSX (Intel) platform. I have compiled the libraries using the bjam executable from boost_1_34_1/tools/jam/src/bin.macosxx86/bjam This resulted in formation of libraries in bin.v2/libs/... Now I would like to compile the edge-connectivity.cpp file in boost_1_34_1/libs/graph/examples directory with the following command: g++ -I$BOOST edge-connectivity.cpp -o test1 $BOOST/bin.v2/libs/graph/build/darwin/debug/link-static/libboost_graph-d-1_34_1.a This gives me the following errors: Undefined symbols: "boost::read_graphviz(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, boost::subgraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_attribute_t, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >, boost::no_property>, boost::property<boost::edge_attribute_t, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >, boost::property<boost::edge_index_t, int, boost::no_property> >, boost::property<boost::graph_graph_attribute_t, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >, boost::property<boost::graph_vertex_attribute_t, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >, boost::property<boost::graph_edge_attribute_t, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >, boost::property<boost::graph_name_t, std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::no_property> > > >, boost::listS> >&)", referenced from: _main in cctmckT6.o ld: symbol(s) not found collect2: ld returned 1 exit status Can some one explain what's going on? I have tried using -L option as well with no success: g++ -I$BOOST edge-connectivity.cpp -o test1 -L$BOOST/boost_1_34_1/bin.v2/libs/graph/build/darwin/debug/link-static/ -lboost_graph-d-1_34_1.a The examples that do not use graphviz_read() are easily compiled. I would also like to know if someone uses a jam file that lists all the dependencies for the example files. This way I can compile all the example files in the /libs/graph/examples in one shot with no linking problems. Thanks, Vivek

1 0

[enable_if] Compiler Error with MSVC 7.1
by Christian Henning 28 Feb '08

28 Feb '08

Hi there, I'm trying to compile the following code using MSVC 7.1 but it fails. Using MSVC 8 works which leaves me with the impression that it might be a compiler bug. #include <boost/utility/enable_if.hpp> #include <boost/mpl/bool.hpp> using namespace boost; template < typename A > struct is_A : public mpl::true_ {}; template < typename B > struct is_B : public mpl::true_ {}; template< typename A > struct enable_if_A : public enable_if< typename is_A< A >::type > {}; template< typename B > struct enable_if_B : public enable_if< typename is_B< B >::type > {}; template < typename One > inline void foo( typename enable_if_A< One >::type* ptr = 0 ) {} template < typename One > inline void foo( typename enable_if_B< One >::type* ptr = 0 ) {} int _tmain(int argc, _TCHAR* argv[]) { return 0; } After a while of tinkering I got it to compile when inheriting the enable_if helper classes from enable_if<...>::type instead of from enable_if<...>. The following works: #include <boost/utility/enable_if.hpp> #include <boost/mpl/bool.hpp> using namespace boost; template < typename A > struct is_A : public mpl::true_ {}; template < typename B > struct is_B : public mpl::true_ {}; template< typename A > struct enable_if_A : public enable_if< typename is_A< A >::type >::type {}; template< typename B > struct enable_if_B : public enable_if< typename is_B< B >::type >::type {}; template < typename One > inline void foo( typename enable_if_A< One >* ptr = 0 ) {} template < typename One > inline void foo( typename enable_if_B< One >* ptr = 0 ) {} int _tmain(int argc, _TCHAR* argv[]) { return 0; } Is that a known issue with MSVC 7.1? Or is it always better to inherit from enable_if<...>::type? Regards, Christian

1 0

The Graph Library Applied to Trees
by Charles Brockman 28 Feb '08

28 Feb '08

I'm considering using the Boost Graph Library to represent binary trees in my application. This will be a planar acyclic directed graph with an adjacency-list representation. The vertices will have properties bundled in an exterior class. A. While building the tree I need to track the depth of each branch and the greatest depth of any branch, that is, the distance from the source vertex to the farthest target vertex. For that I plan to use the distance_recorder. Is that reasonable? Are there pitfalls? Is there a better way? B. I'll need to calculate the total length of the tree by which I mean the sum of all edges. I plan to do a depth-first search and increment a counter with a visitor event point such as discover_vertex. Is that the preferred method? C. On occasion I'll have to swap vertices between two independent trees. My plan is to just swap the bundled properties of each vertex. At first I considered the remove_vertex function but the edges connected to a vertex must be removed first with clear_vertex so before I remove the vertex I'll have to record the source and the target vertices. Then I'll have to add the replacement vertex into the correct position. I can imagine that blowing up in my face. I would appreciate any guidance on this problem. -- Charles Brockman

1 0