|
|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r58116 - in sandbox/itl: boost/itl/detail boost/itl_xt/detail boost/validate boost/validate/driver boost/validate/std/algorithm boost/validate/validater libs/itl/test libs/itl/test/test_casual_ libs/validate/example/labat_sorted_associative_bitset_back_ libs/validate/example/labat_sorted_associative_map_back_ libs/validate/example/labat_sorted_associative_set_back_
From: afojgo_at_[hidden]
Date: 2009-12-03 11:56:10
Author: jofaber
Date: 2009-12-03 11:56:08 EST (Thu, 03 Dec 2009)
New Revision: 58116
URL: http://svn.boost.org/trac/boost/changeset/58116
Log:
Polishing and implementation of new warning policy. Replaced Tabs. Stable {msvc-9.0,10.0; gcc-3.4.4}
Text files modified:
sandbox/itl/boost/itl/detail/interval_subset_comparer.hpp | 2
sandbox/itl/boost/itl/detail/mapped_reference.hpp | 2
sandbox/itl/boost/itl/detail/subset_comparer.hpp | 2
sandbox/itl/boost/itl_xt/detail/bit_element_iterator.hpp | 4
sandbox/itl/boost/validate/driver/sorted_associative_bitset_back_driver.hpp | 2
sandbox/itl/boost/validate/driver/sorted_associative_bitset_driver.hpp | 2
sandbox/itl/boost/validate/std/algorithm/relation.hpp | 24
sandbox/itl/boost/validate/utility.hpp | 10
sandbox/itl/boost/validate/validater/sorted_associative_validater.hpp | 2
sandbox/itl/libs/itl/test/test_casual_/test_casual.cpp | 515 ----------------------------------------
sandbox/itl/libs/itl/test/test_value_maker.hpp | 4
sandbox/itl/libs/validate/example/labat_sorted_associative_bitset_back_/labat_sorted_associative_bitset_back.cpp | 4
sandbox/itl/libs/validate/example/labat_sorted_associative_map_back_/labat_sorted_associative_map_back.cpp | 4
sandbox/itl/libs/validate/example/labat_sorted_associative_set_back_/labat_sorted_associative_set_back.cpp | 4
14 files changed, 33 insertions(+), 548 deletions(-)
Modified: sandbox/itl/boost/itl/detail/interval_subset_comparer.hpp
==============================================================================
--- sandbox/itl/boost/itl/detail/interval_subset_comparer.hpp (original)
+++ sandbox/itl/boost/itl/detail/interval_subset_comparer.hpp 2009-12-03 11:56:08 EST (Thu, 03 Dec 2009)
@@ -86,7 +86,7 @@
class subset_comparer
{
private:
- subset_comparer& operator = (const subset_comparer&);
+ subset_comparer& operator = (const subset_comparer&);
public:
typedef typename LeftT::const_iterator LeftIterT;
typedef typename RightT::const_iterator RightIterT;
Modified: sandbox/itl/boost/itl/detail/mapped_reference.hpp
==============================================================================
--- sandbox/itl/boost/itl/detail/mapped_reference.hpp (original)
+++ sandbox/itl/boost/itl/detail/mapped_reference.hpp 2009-12-03 11:56:08 EST (Thu, 03 Dec 2009)
@@ -18,7 +18,7 @@
class mapped_reference
{
private:
- mapped_reference& operator = (const mapped_reference&);
+ mapped_reference& operator = (const mapped_reference&);
public:
typedef FirstT first_type;
typedef SecondT second_type;
Modified: sandbox/itl/boost/itl/detail/subset_comparer.hpp
==============================================================================
--- sandbox/itl/boost/itl/detail/subset_comparer.hpp (original)
+++ sandbox/itl/boost/itl/detail/subset_comparer.hpp 2009-12-03 11:56:08 EST (Thu, 03 Dec 2009)
@@ -86,7 +86,7 @@
class subset_comparer
{
private:
- subset_comparer& operator = (const subset_comparer&);
+ subset_comparer& operator = (const subset_comparer&);
public:
typedef typename LeftT::const_iterator LeftIterT;
typedef typename RightT::const_iterator RightIterT;
Modified: sandbox/itl/boost/itl_xt/detail/bit_element_iterator.hpp
==============================================================================
--- sandbox/itl/boost/itl_xt/detail/bit_element_iterator.hpp (original)
+++ sandbox/itl/boost/itl_xt/detail/bit_element_iterator.hpp 2009-12-03 11:56:08 EST (Thu, 03 Dec 2009)
@@ -415,8 +415,8 @@
{
half_type up_prev, low_prev;
if(half == cur_pos)
- // warning C4706: assignment within conditional expression
- // This is intentional here.
+ // warning C4706: assignment within conditional expression
+ // This is intentional here.
if(low_prev = static_cast<half_type>(lower_mask & value))
return index32[((high_bit(low_prev) * factor)) >> shift];
else
Modified: sandbox/itl/boost/validate/driver/sorted_associative_bitset_back_driver.hpp
==============================================================================
--- sandbox/itl/boost/validate/driver/sorted_associative_bitset_back_driver.hpp (original)
+++ sandbox/itl/boost/validate/driver/sorted_associative_bitset_back_driver.hpp 2009-12-03 11:56:08 EST (Thu, 03 Dec 2009)
@@ -26,7 +26,7 @@
void setProfile()
{
- const int used_choices = 4;
+ const int used_choices = 4;
setValid(true);
_freeChoice.setSize(used_choices);
_freeChoice.setMaxWeights(100);
Modified: sandbox/itl/boost/validate/driver/sorted_associative_bitset_driver.hpp
==============================================================================
--- sandbox/itl/boost/validate/driver/sorted_associative_bitset_driver.hpp (original)
+++ sandbox/itl/boost/validate/driver/sorted_associative_bitset_driver.hpp 2009-12-03 11:56:08 EST (Thu, 03 Dec 2009)
@@ -26,7 +26,7 @@
void setProfile()
{
- const int used_choices = 4;
+ const int used_choices = 4;
setValid(true);
_freeChoice.setSize(used_choices);
_freeChoice.setMaxWeights(100);
Modified: sandbox/itl/boost/validate/std/algorithm/relation.hpp
==============================================================================
--- sandbox/itl/boost/validate/std/algorithm/relation.hpp (original)
+++ sandbox/itl/boost/validate/std/algorithm/relation.hpp 2009-12-03 11:56:08 EST (Thu, 03 Dec 2009)
@@ -28,15 +28,15 @@
{
static void apply(const SourceT& left, const SourceT& right, TargetT& target)
{
- target = false;
- if(left.size() <= right.size())
- target = std::equal(left.begin(), left.end(), right.begin());
+ target = false;
+ if(left.size() <= right.size())
+ target = std::equal(left.begin(), left.end(), right.begin());
}
static void apply_elemental(const SourceT& left, const SourceT& right, TargetT& target)
{
- target = false;
- if(left.size() <= right.size())
+ target = false;
+ if(left.size() <= right.size())
target = std::equal(left.elements_begin(), left.elements_end(), right.elements_begin());
}
@@ -48,15 +48,15 @@
{
static void apply(const SourceT& left, const SourceT& right, TargetT& target)
{
- target = false;
- if(left.size() <= right.size())
- target = std::equal(left.rbegin(), left.rend(), right.rbegin());
+ target = false;
+ if(left.size() <= right.size())
+ target = std::equal(left.rbegin(), left.rend(), right.rbegin());
}
static void apply_elemental(const SourceT& left, const SourceT& right, TargetT& target)
{
- target = false;
- if(left.size() <= right.size())
+ target = false;
+ if(left.size() <= right.size())
target = std::equal(left.elements_rbegin(), left.elements_rend(), right.elements_rbegin());
}
@@ -82,7 +82,7 @@
static void apply_elemental(const SourceT& left, const SourceT& right, TargetT& target)
{
target = std::lexicographical_compare
- (left.elements_begin(), left.elements_end(),
+ (left.elements_begin(), left.elements_end(),
right.elements_begin(), right.elements_end());
}
@@ -102,7 +102,7 @@
static void apply_elemental(const SourceT& left, const SourceT& right, TargetT& target)
{
target = std::lexicographical_compare
- (left.elements_rbegin(), left.elements_rend(),
+ (left.elements_rbegin(), left.elements_rend(),
right.elements_rbegin(), right.elements_rend());
}
Modified: sandbox/itl/boost/validate/utility.hpp
==============================================================================
--- sandbox/itl/boost/validate/utility.hpp (original)
+++ sandbox/itl/boost/validate/utility.hpp 2009-12-03 11:56:08 EST (Thu, 03 Dec 2009)
@@ -32,9 +32,9 @@
return result;
}
- std::string msvc_stl_false_order_checking_for_reverse_iteration_message()
- {
- return std::string(
+ std::string msvc_stl_false_order_checking_for_reverse_iteration_message()
+ {
+ return std::string(
"+----------------------------------------------------------------------------+\n"
"| MSVC STL: Incorrect order checking for reverse iteration in _DEBUG mode: |\n"
"+----------------------------------------------------------------------------+\n"
@@ -45,8 +45,8 @@
"| For Msvc, law based tests on sorted associative containers in reverse |\n"
"| order, are therefore executed in RELEASE MODE only. |\n"
"+----------------------------------------------------------------------------+\n"
- );
- }
+ );
+ }
}} // namespace itl boost
Modified: sandbox/itl/boost/validate/validater/sorted_associative_validater.hpp
==============================================================================
--- sandbox/itl/boost/validate/validater/sorted_associative_validater.hpp (original)
+++ sandbox/itl/boost/validate/validater/sorted_associative_validater.hpp 2009-12-03 11:56:08 EST (Thu, 03 Dec 2009)
@@ -23,7 +23,7 @@
class sorted_associative_validater : public algebra_validater
{
public:
- typedef typename Type::value_type value_type;
+ typedef typename Type::value_type value_type;
public:
enum Laws
Modified: sandbox/itl/libs/itl/test/test_casual_/test_casual.cpp
==============================================================================
--- sandbox/itl/libs/itl/test/test_casual_/test_casual.cpp (original)
+++ sandbox/itl/libs/itl/test/test_casual_/test_casual.cpp 2009-12-03 11:56:08 EST (Thu, 03 Dec 2009)
@@ -41,520 +41,5 @@
BOOST_AUTO_TEST_CASE(reverse_iter)
{
- typedef interval_bitset<int, bits8> InterBitsT;
- InterBitsT lbs;
-
- lbs.add(0).add(3);
-
- InterBitsT::element_reverse_iterator rit_ = lbs.elements_rend();
- InterBitsT::element_reverse_iterator revbeg = lbs.elements_rbegin();
-
- // {< > 0 3 }
- // re!
- --rit_; //
- cout << "*rit_=" << *rit_ << endl;
- --rit_; //
- cout << "*rit_=" << *rit_ << endl;
-
- rit_ == revbeg;
-
- if(rit_ == lbs.elements_rbegin())
- cout << "at rbegin=last\n";
- else
- cout << "NOT at rbegin=last\n";
-
-/*
- cout << "{";
- while(!(rit_ == revbeg))
- {
- --rit_;
- cout << *rit_ << " ";
- }
- cout << "}";
-*/
-}
-
-
-/*
-BOOST_AUTO_TEST_CASE(bitter16_forward)
-{
- typedef interval_bitset<int, bits16> InterBitsT;
- InterBitsT lbs;
-
- lbs
- .add(-50).add(-62).add(-63).add(-64).add(-65)
- .add(-17).add(-20).add(-31).add(-32).add(-33)
- .add(-1).add(-2).add(-4).add(-7).add(-8).add(-9).add(-15).add(-16)
- .add(0)
- .add(1).add(2).add(4).add(7).add(8).add(9).add(15).add(16)
- .add(17).add(20).add(31).add(32).add(33)
- .add(50).add(62).add(63).add(64).add(65)
- ;
-
- lbs.show_segments();
- cout << lbs << endl;
-
- InterBitsT::element_iterator it = lbs.elements_begin();
- int ele;
- cout << "{";
- while(it != lbs.elements_end())
- {
- ele = *it;
- cout << *it << " ";
- if(ele == 65)
- {
- int dbg = 0;
- }
- ++it;
- }
- cout << "}";
-}
-
-
-BOOST_AUTO_TEST_CASE(itv_set_reverted_backwards)
-{
- typedef interval_set<int> InterSetT;
- InterSetT itv_set;
-
- itv_set;
- InterSetT::element_reverse_iterator rit;
- rit = itv_set.elements_rend();
- while(rit != itv_set.elements_rbegin())
- {
- cout << *rit << endl;
- --rit;
- }
-
- itv_set.add(0).add(1).add(3);
-
- rit = itv_set.elements_rend();
-
- if(rit != itv_set.elements_rbegin())
- --rit;
-
- cout << "{";
- while(rit != itv_set.elements_rbegin())
- {
- cout << *rit << " ";
- --rit;
- }
-
- BOOST_ASSERT(rit == itv_set.elements_rbegin());
- cout << *rit << "}\n";
-}
-
-
-BOOST_AUTO_TEST_CASE(itv_set_backwards)
-{
- typedef interval_set<int> InterSetT;
- InterSetT itv_set;
-
- itv_set;
- InterSetT::element_iterator rit;
- rit = itv_set.elements_end();
- while(rit != itv_set.elements_begin())
- {
- cout << *rit << endl;
- --rit;
- }
-
- itv_set.add(0).add(1).add(3);
-
- rit = itv_set.elements_end();
-
- if(rit != itv_set.elements_begin())
- --rit;
-
- cout << "{";
- while(rit != itv_set.elements_begin())
- {
- cout << *rit << " ";
- --rit;
- }
-
- BOOST_ASSERT(rit == itv_set.elements_begin());
- cout << *rit << "}\n";
-}
-
-
-
-BOOST_AUTO_TEST_CASE(bitter64_reverted_backwards)
-{
- typedef interval_bitset<int, bits64> InterBitsT;
- InterBitsT lbs;
-
- lbs
- .add(-50).add(-62).add(-63).add(-64).add(-65)
- .add(-17).add(-20).add(-31).add(-32).add(-33)
- .add(-1).add(-2).add(-4).add(-7).add(-8).add(-9).add(-15).add(-16)
- .add(0)
- .add(1).add(2).add(4).add(7).add(8).add(9).add(15).add(16)
- .add(17).add(20).add(31).add(32).add(33)
- .add(50).add(62).add(63).add(64).add(65)
- ;
-
- lbs.show_segments();
- cout << lbs << endl;
-
- InterBitsT::element_reverse_iterator it = lbs.elements_rend();
- InterBitsT::element_reverse_iterator rbeg_eq_at_64 = lbs.elements_rbegin();
- int ele;
- --it;
- cout << "{";
- while(it != lbs.elements_rbegin())
- {
- ele = *it;
- cout << *it << " ";
- if(ele == 64)
- {
- int dbg = 0;
- }
- --it;
- }
- ele = *it;
- cout << *it << " ";
- cout << "}";
-}
-
-
-BOOST_AUTO_TEST_CASE(bitter64_reverted)
-{
- typedef interval_bitset<int, bits64> InterBitsT;
- InterBitsT lbs;
-
- lbs
- .add(-50).add(-62).add(-63).add(-64).add(-65)
- .add(-17).add(-20).add(-31).add(-32).add(-33)
- .add(-1).add(-2).add(-4).add(-7).add(-8).add(-9).add(-15).add(-16)
- .add(0)
- .add(1).add(2).add(4).add(7).add(8).add(9).add(15).add(16)
- .add(17).add(20).add(31).add(32).add(33)
- .add(50).add(62).add(63).add(64).add(65)
- ;
-
- lbs.show_segments();
- cout << lbs << endl;
-
- InterBitsT::element_reverse_iterator it = lbs.elements_rbegin();
- int ele;
- cout << "{";
- while(it != lbs.elements_rend())
- {
- ele = *it;
- cout << *it << " ";
- if(ele == -65)
- {
- int dbg = 0;
- }
- ++it;
- }
- cout << "}";
-}
-*/
-
-/*---------------- bggy case
-BOOST_AUTO_TEST_CASE(bitter64_backwards)
-{
- typedef interval_bitset<int, bits64> InterBitsT;
- InterBitsT lbs;
-
- lbs
- .add(-50).add(-62).add(-63).add(-64).add(-65)
- .add(-17).add(-20).add(-31).add(-32).add(-33)
- .add(-1).add(-2).add(-4).add(-7).add(-8).add(-9).add(-15).add(-16)
- .add(0)
- .add(1).add(2).add(4).add(7).add(8).add(9).add(15).add(16)
- .add(17).add(20).add(31).add(32).add(33)
- .add(50).add(62).add(63).add(64).add(65)
- ;
-
- lbs.show_segments();
- cout << lbs << endl;
-
- InterBitsT::element_iterator it = lbs.elements_end();
- int ele;
- --it;
- cout << "{";
- while(it != lbs.elements_begin())
- {
- ele = *it;
- cout << *it << " ";
- if(ele == -65)
- {
- int dbg = 0;
- }
- --it;
- }
- ele = *it;
- cout << *it << " ";
- cout << "}";
-}
-*/
-
-/*
-BOOST_AUTO_TEST_CASE(bitter64_forward)
-{
- typedef interval_bitset<int, bits64> InterBitsT;
- InterBitsT lbs;
-
- lbs
- .add(-50).add(-62).add(-63).add(-64).add(-65)
- .add(-17).add(-20).add(-31).add(-32).add(-33)
- .add(-1).add(-2).add(-4).add(-7).add(-8).add(-9).add(-15).add(-16)
- .add(0)
- .add(1).add(2).add(4).add(7).add(8).add(9).add(15).add(16)
- .add(17).add(20).add(31).add(32).add(33)
- .add(50).add(62).add(63).add(64).add(65)
- ;
-
- lbs.show_segments();
- cout << lbs << endl;
-
- InterBitsT::element_iterator it = lbs.elements_begin();
- int ele;
- cout << "{";
- while(it != lbs.elements_end())
- {
- ele = *it;
- cout << *it << " ";
- if(ele == 65)
- {
- int dbg = 0;
- }
- ++it;
- }
- cout << "}";
-}
-
-/*
-BOOST_AUTO_TEST_CASE(biter64_test)
-{
- typedef nat64 worT ;
- const bit_range_type wdth = 64;
-
- worT val = 1;
- short pos = -1;
- short nxt, prv;
-
- cout << "------- bitter 64 ---------\n";
-
- val = 0;
- val |= 1ull << 63ull;
- val |= 1ull << 62ull;
- val |= 1ull << 55ull;
- val |= 1ull << 44ull;
- val |= 1ull << 33ull;
- val |= 1ull << 32ull;
- val |= 1ull << 31ull;
- val |= 1ull << 30ull;
- val |= 1ull << 22ull;
- val |= 1ull << 11ull;
- val |= 1ull << 3ull;
- val |= 1ull << 2ull;
- val |= 1ull << 1ull;
- val |= 1ull << 0ull;
- pos = -1;
-
- while(pos < wdth)
- {
- nxt = biterate::proceed<worT,wdth>::next(val,pos);
- cout << "next(" << val <<","<< pos << ")" << "=" << nxt << endl;
- pos = nxt;
- }
- cout << "- - - - - - - - - -\n";
- while(pos > -1)
- {
- if(pos == 31)
- {
- int dbg = 42;
- }
- prv = biterate::proceed<worT,wdth>::prev(val,pos);
- cout << "prev(" << val <<","<< pos << ")" << "=" << prv << endl;
- pos = prv;
- }
}
-BOOST_AUTO_TEST_CASE(biter64_up_test)
-{
- typedef nat64 worT ;
- const bit_range_type wdth = 64;
-
- worT val = 1;
- short pos = -1;
- short nxt, prv;
-
- cout << "------- bitter 64 up ---------\n";
-
- val = 0;
- val |= 1ull << 63ull;
- val |= 1ull << 62ull;
- val |= 1ull << 55ull;
- val |= 1ull << 44ull;
- val |= 1ull << 33ull;
- val |= 1ull << 32ull;
- pos = -1;
-
- while(pos < wdth)
- {
- nxt = biterate::proceed<worT,wdth>::next(val,pos);
- cout << "next(" << val <<","<< pos << ")" << "=" << nxt << endl;
- pos = nxt;
- }
- cout << "- - - - - - - - - -\n";
- while(pos > -1)
- {
- if(pos == 31)
- {
- int dbg = 42;
- }
- prv = biterate::proceed<worT,wdth>::prev(val,pos);
- cout << "prev(" << val <<","<< pos << ")" << "=" << prv << endl;
- pos = prv;
- }
-}
-
-BOOST_AUTO_TEST_CASE(biter64_low_test)
-{
- typedef nat64 worT ;
- const bit_range_type wdth = 64;
-
- worT val = 1;
- short pos = -1;
- short nxt, prv;
-
- cout << "------- bitter 64 low ---------\n";
-
- val = 0;
- val |= 1ull << 31ull;
- val |= 1ull << 30ull;
- val |= 1ull << 22ull;
- val |= 1ull << 11ull;
- val |= 1ull << 3ull;
- val |= 1ull << 2ull;
- val |= 1ull << 1ull;
- val |= 1ull << 0ull;
- pos = -1;
-
- while(pos < wdth)
- {
- nxt = biterate::proceed<worT,wdth>::next(val,pos);
- cout << "next(" << val <<","<< pos << ")" << "=" << nxt << endl;
- pos = nxt;
- }
- cout << "- - - - - - - - - -\n";
- while(pos > -1)
- {
- if(pos == 64)
- {
- int dbg = 42;
- }
- prv = biterate::proceed<worT,wdth>::prev(val,pos);
- cout << "prev(" << val <<","<< pos << ")" << "=" << prv << endl;
- pos = prv;
- }
-}
-
-BOOST_AUTO_TEST_CASE(biter32_test)
-{
- typedef nat32 worT ;
- const bit_range_type wdth = 32;
-
- worT val = 1;
- short pos = -1;
- short nxt, prv;
-
- cout << "------- bitter 32 ---------\n";
-
- val = 0;
- val |= 1ul << 31ul;
- val |= 1ul << 30ul;
- val |= 1ul << 22ul;
- val |= 1ul << 11ul;
- val |= 1ul << 3ul;
- val |= 1ul << 2ul;
- val |= 1ul << 1ul;
- val |= 1ul << 0ul;
- pos = -1;
-
- while(pos < wdth)
- {
- if(pos == wdth)
- {
- int dbg = 42;
- }
- nxt = biterate::proceed<worT,wdth>::next(val,pos);
- cout << "next(" << val <<","<< pos << ")" << "=" << nxt << endl;
- pos = nxt;
- }
-
- cout << "- - - - - - - - - -\n";
- while(pos > -1)
- {
- if(pos == 31)
- {
- int dbg = 42;
- }
- prv = biterate::proceed<worT,wdth>::prev(val,pos);
- cout << "prev(" << val <<","<< pos << ")" << "=" << prv << endl;
- pos = prv;
- }
-}
-
-
-BOOST_AUTO_TEST_CASE(biter16_test)
-{
- typedef nat16 worT ;
- const bit_range_type wdth = 16;
-
- worT val = 1;
- short pos = -1;
- short nxt;
-
- cout << "------- bitter 16 ---------\n";
-
- val = 0;
- val |= 1 << 15;
- val |= 1 << 14;
- val |= 1 << 12;
- val |= 1 << 11;
- val |= 1 << 3;
- val |= 1 << 2;
- val |= 1 << 1;
- val |= 1 << 0;
- pos = -1;
-
- while(pos < wdth)
- {
- nxt = biterate::proceed<worT,wdth>::next(val,pos);
- cout << "next(" << val <<","<< pos << ")" << "=" << nxt << endl;
- pos = nxt;
- }
-}
-
-BOOST_AUTO_TEST_CASE(biter8_test)
-{
- typedef nat8 worT ;
- const bit_range_type wdth = 8;
-
- worT val = 1;
- short pos = -1;
- short nxt;
-
- cout << "------- bitter 8 ---------\n";
-
- val = 0;
- val |= 1 << 7;
- val |= 1 << 4;
- val |= 1 << 2;
- val |= 1 << 1;
- val |= 1 << 0;
- pos = -1;
-
- while(pos < wdth)
- {
- nxt = biterate::proceed<worT,wdth>::next(val,pos);
- cout << "next(" << static_cast<short>(val) <<","<< pos << ")" << "=" << nxt << endl;
- pos = nxt;
- }
-}
-*/
Modified: sandbox/itl/libs/itl/test/test_value_maker.hpp
==============================================================================
--- sandbox/itl/libs/itl/test/test_value_maker.hpp (original)
+++ sandbox/itl/libs/itl/test/test_value_maker.hpp 2009-12-03 11:56:08 EST (Thu, 03 Dec 2009)
@@ -86,12 +86,12 @@
static interval<domain_type> interval_(int lower, int upper, int bounds = 2)
{
return interval_type(test_value<domain_type>::make(lower),
- test_value<domain_type>::make(upper), bounds);
+ test_value<domain_type>::make(upper), static_cast<bound_type>(bounds));
}
static value_type val_pair(int lower, int upper, int val, int bounds = 2)
{
- return value_type( interval_(lower, upper, bounds),
+ return value_type( interval_(lower, upper, static_cast<bound_type>(bounds)),
test_value<codomain_type>::make(val) );
}
Modified: sandbox/itl/libs/validate/example/labat_sorted_associative_bitset_back_/labat_sorted_associative_bitset_back.cpp
==============================================================================
--- sandbox/itl/libs/validate/example/labat_sorted_associative_bitset_back_/labat_sorted_associative_bitset_back.cpp (original)
+++ sandbox/itl/libs/validate/example/labat_sorted_associative_bitset_back_/labat_sorted_associative_bitset_back.cpp 2009-12-03 11:56:08 EST (Thu, 03 Dec 2009)
@@ -24,9 +24,9 @@
">> -------- Law based test automaton 'LaBatea' ---------- <<\n";
#if(_MSC_VER >= 1400 && defined(_DEBUG) ) // 1500=MSVC-9.0 1400=MSVC-8.0; 1310=MSVC-7.1; 1300=MSVC-7.0;
- cout << msvc_stl_false_order_checking_for_reverse_iteration_message();
+ cout << msvc_stl_false_order_checking_for_reverse_iteration_message();
#else
- cout <<
+ cout <<
">> Output will be generated in a few seconds\n"
">> terminate by typing <CTRL>C\n"
">> ------------------------------------------------------ <<\n";
Modified: sandbox/itl/libs/validate/example/labat_sorted_associative_map_back_/labat_sorted_associative_map_back.cpp
==============================================================================
--- sandbox/itl/libs/validate/example/labat_sorted_associative_map_back_/labat_sorted_associative_map_back.cpp (original)
+++ sandbox/itl/libs/validate/example/labat_sorted_associative_map_back_/labat_sorted_associative_map_back.cpp 2009-12-03 11:56:08 EST (Thu, 03 Dec 2009)
@@ -25,9 +25,9 @@
">> -------- Law based test automaton 'LaBatea' ---------- <<\n";
#if(_MSC_VER >= 1400 && defined(_DEBUG) ) // 1500=MSVC-9.0 1400=MSVC-8.0; 1310=MSVC-7.1; 1300=MSVC-7.0;
- cout << msvc_stl_false_order_checking_for_reverse_iteration_message();
+ cout << msvc_stl_false_order_checking_for_reverse_iteration_message();
#else
- cout <<
+ cout <<
">> Output will be generated in a few seconds\n"
">> terminate by typing <CTRL>C\n"
">> ------------------------------------------------------ <<\n";
Modified: sandbox/itl/libs/validate/example/labat_sorted_associative_set_back_/labat_sorted_associative_set_back.cpp
==============================================================================
--- sandbox/itl/libs/validate/example/labat_sorted_associative_set_back_/labat_sorted_associative_set_back.cpp (original)
+++ sandbox/itl/libs/validate/example/labat_sorted_associative_set_back_/labat_sorted_associative_set_back.cpp 2009-12-03 11:56:08 EST (Thu, 03 Dec 2009)
@@ -25,9 +25,9 @@
">> -------- Law based test automaton 'LaBatea' ---------- <<\n";
#if(_MSC_VER >= 1400 && defined(_DEBUG) ) // 1500=MSVC-9.0 1400=MSVC-8.0; 1310=MSVC-7.1; 1300=MSVC-7.0;
- cout << msvc_stl_false_order_checking_for_reverse_iteration_message();
+ cout << msvc_stl_false_order_checking_for_reverse_iteration_message();
#else
- cout <<
+ cout <<
">> Output will be generated in a few seconds\n"
">> terminate by typing <CTRL>C\n"
">> ------------------------------------------------------ <<\n";
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk