- Boost-users - lists.boost.org

case insensitive less_than string comparison
by Matthias Kaeppler 07 Mar '06

07 Mar '06

Hi, I am aware that string_algo has an if_iequal functor. Is there also an equivalent for a less-than comparison? I have to compare strings ignoring the case but taking locales into account. Right now I'm calling boost::algorithm::to_lower on two copies of the original strings. I'm not so sure if this is very efficient when I'm comparing thousands of strings. Here's the functor as it is now: struct FileLessNameA : std::binary_function<const File&,const File&,bool> { bool operator() (const File& lhs, const File& rhs) const { std::string path1( lhs.get_name().c_str() ); std::string path2( rhs.get_name().c_str() ); boost::algorithm::to_lower( path1 ); boost::algorithm::to_lower( path2 ); return path1 < path2; } }; Any suggestions for improvements appreciated :) Regards, Matthias -- Matthias Kaeppler

7 17

(no subject)
by Karim Bakir 07 Mar '06

07 Mar '06

Hi , I have a problem, I download boost, I followed the steps on www.boost .org so first I build jam to obtain jam.exe, I copy it in my directorie where I installed boost. I run Msdos, I run VCVARS32 to set the environement of vc++ after I execute : bjam "-sTOOLS=msvc" install It compiles , however I have many errors and failed. At the end , It has copied in a directory boost include... the include , and the . lib. But I don't have all the libs I have the following message: ...failed updating 82 targets... ...skipped 60 targets... ...updated 4598 targets... Can you help me please. Thanks

2 1

String compare (instead of just less) that returns -1, 0 or 1
by Olaf van der Spek 07 Mar '06

07 Mar '06

Hi, Does Boost contain a (string) compare function that returns -1 if a < b, 0 if a == b and 1 if a > b? Doing both < and == sounds like a lot of extra work in for example sorting algorithms.

3 3

Re: [Boost-users] Linking problems with 'scoped_static_mutex_lock'fromregex library?!
by arno.schaefer＠sqs.de 07 Mar '06

07 Mar '06

Thanks for the hint and sorry for that stupid matter. Arno

1 0

[Numeric Conversion] Trivial typos in documentation
by Scott Meyers 07 Mar '06

07 Mar '06

Twice on http://boost.org/libs/numeric/conversion/doc/numeric_cast.html, "Traget" ==> "Target" Scott

1 0

Re: [Boost-users] Property map design
by Dmitry Bufistov 06 Mar '06

06 Mar '06

Hi all! Sorry if this is second time)) Regards, --dima

2 2

[multi_array] Resize changes storage order irreversibly
by Antonio Piccolboni 06 Mar '06

06 Mar '06

Hi, I noticed that after a resize the storage order is reset to the default value. This is apparent not only printing the contents (see attached test case) but also by inspecting strides() directly. Not only this breaks my program, but the only way to set the storage order is apparently in the constructor and therefore resize becomes de facto unusable for non default storage orders, so I don't even have a workaround. I couldn't find anything regarding this in the docs. I believe this is a serious bug. Can anyone advise? Antonio #include <boost/multi_array.hpp> #include <iostream> int main() { typedef boost::multi_array<double,3> array_type; int tiling_graph_storage_order[] = {2, 0, 1}; bool tiling_graph_index_order[] = {true, true, true}; array_type A(boost::extents[3][4][2], boost::general_storage_order<3>(tiling_graph_storage_order, tiling_graph_index_order)); for (int i = 0; i < 3; i++) { for (int j = 0; j < 4; j++) { for (int k = 0; k < 2; k++) { A[i][j][k] = 100 * i + 10 * j + k + 10000; } } } for (int i = 0; i < A.num_elements(); i++) { std::cout << *(A.origin() + i) << std::endl; } A.resize(boost::extents[3][4][2]); std::cout << "After resize" << std::endl; for (int i = 0; i < 3; i++) { for (int j = 0; j < 4; j++) { for (int k = 0; k < 2; k++) { std::cout << A[i][j][k] << std::endl; } } } }

2 2

Re: [Boost-users] How to organize my Unit Tests
by Dmitry Bufistov 06 Mar '06

06 Mar '06

> Mateusz Å�oskot wrote: > > >>3. Include Boost.Test source code and allow user of my project to build > >>UTF library on his own. Here I expect some problems with bjam/makefiles > >>incompatibility. So, bjam would be required on user's platform. > >>Simply, this solution seems to be quite confusing for user. > > > > Hello Mateusz, > > One obsevation concerning 3th approach for using boost.test framework. > > You just can include > > #include <boost/test/included/unit_test_framework.hpp> > > to your project and compile everything using your build system, isn't it? >Hi Dmitry, >But what about building Unit Test Framework library? >How should I provide building it? Using bjam (bjam would be requirement) >or own home-made makefiles for UTF? >Cheers It is for sure that I didn't build anything separate in boost (of cause exept the "date_time" library ) and things more or less work for me. I have just to projects in my solution - second is unit_test_framework and I doesn't link with external boost libraries. You can try to compile and execute the following code (without any external linking): Good luck! --dima // BOOST_TEST_TEST.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include <boost/test/included/unit_test_framework.hpp> using namespace boost::unit_test; void test1_suit1() { BOOST_REQUIRE(false); } void test2_suit1() { BOOST_REQUIRE(false); } void test1_suit2() { BOOST_REQUIRE(false); } test_suite* init_unit_test_suite( int argc, char* argv[] ) { test_suite* master_test_unit = BOOST_TEST_SUITE("Master"); test_suite* ts_1 = BOOST_TEST_SUITE( "test_suite1" ); ts_1->add( BOOST_TEST_CASE( &test1_suit1), 1 ); ts_1->add( BOOST_TEST_CASE( &test2_suit1), 1 ); test_suite* ts_2 = BOOST_TEST_SUITE( "test_suite2" ); ts_2->add( BOOST_TEST_CASE( &test1_suit2), 1 ); /**Add test suites here in order to run them**/ master_test_unit->add(ts_1); master_test_unit->add(ts_2); return master_test_unit; }

2 1

How to organize my Unit Tests
by Mateusz Łoskot 06 Mar '06

06 Mar '06

Hi, I'd like to ask yet another questions related to Unit Test Framework usage. Especially, I'm interested in best practice of Unit Tests organization in the project. I have a project that consists of more than 100 classes. Some of those classes are general purpose (e.g. Point) but some are organized in components (e.g. spatial index component consisting of 5 classes). Now, I'd like to add Unit Tests (yes, I know I should have them prepared before I created those classes ;-)). I've read almost all docs about Boost.Test, downloaded from CVS. I know how to create Test Case and how to combine those cases into Test Suite. I also read introductory docs from "Tutorials and usage recommendations" part as well as I walked through unit_test_examples but I'm still a bit confused about the bigger picture. As far as I understand, every Test Case or Test Suite of cases is to be compiled to separate executable. Is this correct? So, unit_test_example_01.cpp and unit_test_example_02.cpp and so on create separate programs that can be executed e.g. from Visual Studio Post-Build Event as explained in docs. More precisely, every .cpp file that: - include #include <boost/test/unit_test.hpp> - uses defines cases using BOOST_AUTO_TEST_CASE - or defines suites of cases using BOOST_TEST_SUITE + BOOST_AUTO_TEST_CASE will be a separate program. Right? So, if I have 100 classes and I'd like to define Test Suite, with a number of Test Cases in every suite, for every my class then should I expect I will get 100 test executables? From Visual Studio point of view, I will have 100 projects in my test solution. Am I right? I feel I don't understand something, so I'd be very thankful for some light on this subject. So, what is the best way to organize Test Cases and Suites for my 100 classes? Should I try to build them into one executable or into number of separate executables as described in my assumptions above? If there are e.g. 100 executables for my 100 tests, how should I run them e.g. during complete rebuild of project using automake or bjam? Not using Visual Studio Post-Build Events, should I run those tests from makefiles/jamfiles or there is a kind of test runner program I can use? Best regards -- Mateusz Łoskot http://mateusz.loskot.net

3 3

Property map design
by Daniel Mitchell 06 Mar '06

06 Mar '06

I'd like to know a little more about the design rationale for property maps, specifically the (maybe implicit) decision not to overload operator[] with respect to constness. The design leads to a situation that is, in some respects, at odds with convention. The most obvious point of conflict is put_get_helper. In fact, I wouldn't be surprised if the decision not to overload operator[] was simply a consequence of writing put_get_helper. (Pure speculation.) template<class Reference, class PropertyMap> struct put_get_helper { }; template<class R, class P, class K> R get( put_get_helper<R,P> const& map, K const& key ); template<class R, class P, class K, class V> void put( put_get_helper<R,P> const& map, K const& key, V const& value ); In contrast with standard containers, the constness of the property map isn't correlated to the constness of its elements. I wonder why the above wasn't written as template<class Reference, class PropertyMap, class ConstReference> struct put_get_helper { }; template<class R, class P, class C, class K> R get( put_get_helper<R,P,C>& map, K const& key ); template<class R, class P, class C, class K> C get( put_get_helper<R,P,C> const& map, K const& key ); template<class R, class P, class C, class K, class V> void put( put_get_helper<R,P,C>& map, K const& key, V const& value ); Another point of conflict is the property_map traits class, with its nested 'type' and 'const_type'. Doesn't convention suggest that 'type const' is the appropriate type for a non-mutable property map? My initial statement was that the design leads to a situation that is *in some respects* at odds with convention. When property maps are viewed, not as first class containers of their data, but as having more-or-less the same status as container iterators, the situation clarifies. I suppose that must have been the author's intent. // A deficient, but harmless implementation of put(), get() for iterators. template<class Reference, class Iterator> struct put_get_helper { }; template<class R, class I, class K> R get( put_get_helper<R,I> const& it, K const& key ); template<class R, class I, class K, class V> void put( put_get_helper<R,I> const& it, K const& key, V const& value ); // Parallel to property_map. template<class Container> struct container_iterator { typedef typename Container::iterator type; typedef typename Container::const_iterator const_type; };

2 1