|
|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r56649 - in sandbox/itl: boost/itl boost/itl_xt boost/validate/gentor boost/validate/itl boost/validate/laws boost/validate/validater libs/itl/test/test_casual_ libs/validate/example/labat_polygon_ libs/validate/example/labat_single_
From: afojgo_at_[hidden]
Date: 2009-10-08 10:49:07
Author: jofaber
Date: 2009-10-08 10:49:06 EDT (Thu, 08 Oct 2009)
New Revision: 56649
URL: http://svn.boost.org/trac/boost/changeset/56649
Log:
Boostifying: Replaced 'Tabs' for the latest changes (std::inserter support). Stable {msvc-8.0, 9.0; gcc-3.4.4}
Text files modified:
sandbox/itl/boost/itl/functors.hpp | 104 ++++++++++++++++++++--------------------
sandbox/itl/boost/itl/interval_base_map.hpp | 18 +++---
sandbox/itl/boost/itl/iterator.hpp | 84 ++++++++++++++++----------------
sandbox/itl/boost/itl/map.hpp | 10 +-
sandbox/itl/boost/itl_xt/map_segment_gentor.hpp | 28 +++++-----
sandbox/itl/boost/itl_xt/seqgentor.hpp | 6 +-
sandbox/itl/boost/validate/gentor/randomgentor.hpp | 10 +-
sandbox/itl/boost/validate/itl/functors.hpp | 26 +++++-----
sandbox/itl/boost/validate/laws/function_equality.hpp | 32 ++++++------
sandbox/itl/boost/validate/validater/signed_quantifier_validater.hpp | 2
sandbox/itl/libs/itl/test/test_casual_/test_casual.cpp | 4
sandbox/itl/libs/validate/example/labat_polygon_/polygon_gentor.hpp | 12 ++--
sandbox/itl/libs/validate/example/labat_single_/labat_single.cpp | 18 +++---
13 files changed, 177 insertions(+), 177 deletions(-)
Modified: sandbox/itl/boost/itl/functors.hpp
==============================================================================
--- sandbox/itl/boost/itl/functors.hpp (original)
+++ sandbox/itl/boost/itl/functors.hpp 2009-10-08 10:49:06 EDT (Thu, 08 Oct 2009)
@@ -64,7 +64,7 @@
void operator()(Type& object, const Type& operand)const
{ object += operand; }
- static void version(Type& object){}
+ static void version(Type& object){}
};
template<>
@@ -91,7 +91,7 @@
void operator()(Type& object, const Type& operand)const
{ object |= operand; }
- static void version(Type& object){}
+ static void version(Type& object){}
};
template<>
@@ -300,33 +300,33 @@
{ typedef itl::inplace_max<Type> type; };
- //--------------------------------------------------------------------------
+ //--------------------------------------------------------------------------
// Positive or negative functor trait
//--------------------------------------------------------------------------
template<class Functor> struct is_negative;
template<class Functor>
struct is_negative
- {
- typedef is_negative<Functor> type;
- BOOST_STATIC_CONSTANT(bool, value = false);
- };
-
- template<class Type>
- struct is_negative<itl::inplace_minus<Type> >
- {
- typedef is_negative type;
- BOOST_STATIC_CONSTANT(bool, value = true);
- };
-
- template<class Type>
- struct is_negative<itl::inplace_bit_subtract<Type> >
- {
- typedef is_negative type;
- BOOST_STATIC_CONSTANT(bool, value = true);
- };
+ {
+ typedef is_negative<Functor> type;
+ BOOST_STATIC_CONSTANT(bool, value = false);
+ };
+
+ template<class Type>
+ struct is_negative<itl::inplace_minus<Type> >
+ {
+ typedef is_negative type;
+ BOOST_STATIC_CONSTANT(bool, value = true);
+ };
- //--------------------------------------------------------------------------
+ template<class Type>
+ struct is_negative<itl::inplace_bit_subtract<Type> >
+ {
+ typedef is_negative type;
+ BOOST_STATIC_CONSTANT(bool, value = true);
+ };
+
+ //--------------------------------------------------------------------------
// Pro- or in-version functor
//--------------------------------------------------------------------------
template<class Combiner> struct version;
@@ -334,46 +334,46 @@
template<class Combiner>
struct version
{
- typedef version<Combiner> type;
- typedef typename
- remove_const<
- typename remove_reference<typename Combiner::first_argument_type
- >::type
- >::type
- argument_type;
- // The pro-version of an contruction functor lets the value unchanged
- // 0 o= x == x;
- argument_type operator()(const argument_type& value){ return value; }
- };
+ typedef version<Combiner> type;
+ typedef typename
+ remove_const<
+ typename remove_reference<typename Combiner::first_argument_type
+ >::type
+ >::type
+ argument_type;
+ // The pro-version of an contruction functor lets the value unchanged
+ // 0 o= x == x;
+ argument_type operator()(const argument_type& value){ return value; }
+ };
template<class Type>
struct version<itl::inplace_minus<Type> >
{
- typedef version type;
- typedef itl::inplace_minus<Type> Combiner;
+ typedef version type;
+ typedef itl::inplace_minus<Type> Combiner;
- Type operator()(const Type& value)
- {
- Type inverse = Combiner::neutron();
- Combiner()(inverse, value);
- return inverse;
- }
- };
+ Type operator()(const Type& value)
+ {
+ Type inverse = Combiner::neutron();
+ Combiner()(inverse, value);
+ return inverse;
+ }
+ };
template<class Type>
struct version<itl::inplace_bit_subtract<Type> >
{
- typedef version type;
- typedef itl::inplace_bit_subtract<Type> Combiner;
+ typedef version type;
+ typedef itl::inplace_bit_subtract<Type> Combiner;
- Type operator()(const Type& value)
- {
- Type inverse = Combiner::neutron();
- Combiner()(inverse, value);
- return inverse;
- }
- };
-
+ Type operator()(const Type& value)
+ {
+ Type inverse = Combiner::neutron();
+ Combiner()(inverse, value);
+ return inverse;
+ }
+ };
+
}} // namespace itl boost
Modified: sandbox/itl/boost/itl/interval_base_map.hpp
==============================================================================
--- sandbox/itl/boost/itl/interval_base_map.hpp (original)
+++ sandbox/itl/boost/itl/interval_base_map.hpp 2009-10-08 10:49:06 EDT (Thu, 08 Oct 2009)
@@ -763,7 +763,7 @@
template <class Combiner>
std::pair<iterator,bool> map_insert(const interval_type& inter_val, const codomain_type& co_val)
{
- if(Traits::is_total && has_inverse<codomain_type>::value && is_negative<Combiner>::value)
+ if(Traits::is_total && has_inverse<codomain_type>::value && is_negative<Combiner>::value)
return this->_map.insert(value_type(inter_val, version<Combiner>()(co_val)));
else
return this->_map.insert(value_type(inter_val, co_val));
@@ -775,12 +775,12 @@
map_insert(iterator prior_, const interval_type& inter_val, const codomain_type& co_val)
{
iterator inserted_
- = this->_map.insert(prior_, value_type(inter_val, co_val));
+ = this->_map.insert(prior_, value_type(inter_val, co_val));
if(inserted_ == prior_)
return std::pair<iterator,bool>(inserted_, false);
- else if(inserted_->first == inter_val)
- return std::pair<iterator,bool>(inserted_, true);
+ else if(inserted_->first == inter_val)
+ return std::pair<iterator,bool>(inserted_, true);
else
return std::pair<iterator,bool>(inserted_, false);
}
@@ -789,8 +789,8 @@
std::pair<iterator, bool>
map_add(iterator prior_, const interval_type& inter_val, const codomain_type& co_val)
{
- // Never try to insert a neutron into a neutron absorber here:
- BOOST_ASSERT(!(Traits::absorbs_neutrons && co_val==Combiner::neutron()));
+ // Never try to insert a neutron into a neutron absorber here:
+ BOOST_ASSERT(!(Traits::absorbs_neutrons && co_val==Combiner::neutron()));
iterator inserted_
= this->_map.base_insert(prior_, value_type(inter_val, Combiner::neutron()));
@@ -812,7 +812,7 @@
BOOST_ASSERT(this->_map.find(inter_val) == this->_map.end());
BOOST_ASSERT(!(Traits::absorbs_neutrons && co_val==Combiner::neutron()));
- if(has_inverse<codomain_type>::value && is_negative<Combiner>::value)
+ if(has_inverse<codomain_type>::value && is_negative<Combiner>::value)
return this->_map.insert(prior_, value_type(inter_val, version<Combiner>()(co_val)));
else
return this->_map.insert(prior_, value_type(inter_val, co_val));
@@ -929,7 +929,7 @@
typedef IntervalMap<DomainT,CodomainT,
Traits,Compare,Combine,Section,Interval,Alloc> sectant_type;
- if(Traits::is_total)
+ if(Traits::is_total)
{
intersection = *this;
intersection += sectant;
@@ -958,7 +958,7 @@
const typename interval_base_map<SubType,DomainT,CodomainT,Traits,Compare,Combine,Section,Interval,Alloc>
::segment_type& sectant)const
{
- if(Traits::is_total)
+ if(Traits::is_total)
{
section = *this;
section.add(sectant);
Modified: sandbox/itl/boost/itl/iterator.hpp
==============================================================================
--- sandbox/itl/boost/itl/iterator.hpp (original)
+++ sandbox/itl/boost/itl/iterator.hpp 2009-10-08 10:49:06 EDT (Thu, 08 Oct 2009)
@@ -15,30 +15,30 @@
/** Performes an addition using a container's memberfunction add, when operator= is called. */
template<class ContainerT> class add_iterator
- : public std::iterator<std::output_iterator_tag, void, void, void, void>
+ : public std::iterator<std::output_iterator_tag, void, void, void, void>
{
public:
- /// The container's type.
- typedef ContainerT container_type;
+ /// The container's type.
+ typedef ContainerT container_type;
- /** An add_iterator is constructed with a container and a position
- that has to be maintained. */
- add_iterator(ContainerT& cont, typename ContainerT::iterator iter)
- : _cont(&cont), _iter(iter) {}
-
- /** This assignment operator adds the \c value before the current position.
- It maintains it's position by incrementing after addition. */
- add_iterator& operator=(typename ContainerT::const_reference value)
- {
- _iter = _cont->add(_iter, value);
- if(_iter != _cont->end())
- ++_iter;
- return *this;
- }
-
- add_iterator& operator*() { return *this; }
- add_iterator& operator++() { return *this; }
- add_iterator& operator++(int){ return *this; }
+ /** An add_iterator is constructed with a container and a position
+ that has to be maintained. */
+ add_iterator(ContainerT& cont, typename ContainerT::iterator iter)
+ : _cont(&cont), _iter(iter) {}
+
+ /** This assignment operator adds the \c value before the current position.
+ It maintains it's position by incrementing after addition. */
+ add_iterator& operator=(typename ContainerT::const_reference value)
+ {
+ _iter = _cont->add(_iter, value);
+ if(_iter != _cont->end())
+ ++_iter;
+ return *this;
+ }
+
+ add_iterator& operator*() { return *this; }
+ add_iterator& operator++() { return *this; }
+ add_iterator& operator++(int){ return *this; }
private:
ContainerT* _cont;
@@ -55,30 +55,30 @@
/** Performes an insertion using a container's memberfunction add, when operator= is called. */
template<class ContainerT> class insert_iterator
- : public std::iterator<std::output_iterator_tag, void, void, void, void>
+ : public std::iterator<std::output_iterator_tag, void, void, void, void>
{
public:
- /// The container's type.
- typedef ContainerT container_type;
+ /// The container's type.
+ typedef ContainerT container_type;
- /** An insert_iterator is constructed with a container and a position
- that has to be maintained. */
- insert_iterator(ContainerT& cont, typename ContainerT::iterator iter)
- : _cont(&cont), _iter(iter) {}
-
- /** This assignment operator adds the \c value before the current position.
- It maintains it's position by incrementing after addition. */
- insert_iterator& operator=(typename ContainerT::const_reference value)
- {
- _iter = _cont->insert(_iter, value);
- if(_iter != _cont->end())
- ++_iter;
- return *this;
- }
-
- insert_iterator& operator*() { return *this; }
- insert_iterator& operator++() { return *this; }
- insert_iterator& operator++(int){ return *this; }
+ /** An insert_iterator is constructed with a container and a position
+ that has to be maintained. */
+ insert_iterator(ContainerT& cont, typename ContainerT::iterator iter)
+ : _cont(&cont), _iter(iter) {}
+
+ /** This assignment operator adds the \c value before the current position.
+ It maintains it's position by incrementing after addition. */
+ insert_iterator& operator=(typename ContainerT::const_reference value)
+ {
+ _iter = _cont->insert(_iter, value);
+ if(_iter != _cont->end())
+ ++_iter;
+ return *this;
+ }
+
+ insert_iterator& operator*() { return *this; }
+ insert_iterator& operator++() { return *this; }
+ insert_iterator& operator++(int){ return *this; }
private:
ContainerT* _cont;
Modified: sandbox/itl/boost/itl/map.hpp
==============================================================================
--- sandbox/itl/boost/itl/map.hpp (original)
+++ sandbox/itl/boost/itl/map.hpp 2009-10-08 10:49:06 EDT (Thu, 08 Oct 2009)
@@ -281,7 +281,7 @@
return base_type::insert(prior, value_pair);
}
- std::pair<iterator,bool> base_insert(const value_type& value_pair)
+ std::pair<iterator,bool> base_insert(const value_type& value_pair)
{
return base_type::insert(value_pair);
}
@@ -477,7 +477,7 @@
::add(iterator prior_, const domain_type& val, const codomain_type& co_val)
{
if(Traits::absorbs_neutrons && co_val == Combiner::neutron())
- return std::pair<iterator,bool>(prior_, false);
+ return std::pair<iterator,bool>(prior_, false);
iterator inserted_ = base_insert(prior_, value_type(val.first, Combiner::neutron()));
if(Traits::absorbs_neutrons && inserted_->second == Combiner::neutron())
@@ -486,10 +486,10 @@
return prior_;
}
else
- {
+ {
Combiner()(inserted_->second, val.second);
return inserted_;
- }
+ }
}
*/
@@ -544,7 +544,7 @@
void map<DomainT,CodomainT,Traits,Compare,Combine,Section,Alloc>
::add_intersection(map& section, const value_type& sectant)const
{
- if(Traits::is_total)
+ if(Traits::is_total)
{
section = *this;
section.add(sectant);
Modified: sandbox/itl/boost/itl_xt/map_segment_gentor.hpp
==============================================================================
--- sandbox/itl/boost/itl_xt/map_segment_gentor.hpp (original)
+++ sandbox/itl/boost/itl_xt/map_segment_gentor.hpp 2009-10-08 10:49:06 EDT (Thu, 08 Oct 2009)
@@ -23,10 +23,10 @@
class map_segment_gentor: public RandomGentorAT<std::pair<itl::interval<DomainT>, CodomainT> >
{
public:
- typedef DomainT domain_type;
- typedef CodomainT codomain_type;
- typedef itl::interval<DomainT> interval_type;
- typedef std::pair<itl::interval<DomainT>, CodomainT> segment_type;
+ typedef DomainT domain_type;
+ typedef CodomainT codomain_type;
+ typedef itl::interval<DomainT> interval_type;
+ typedef std::pair<itl::interval<DomainT>, CodomainT> segment_type;
public:
map_segment_gentor(): _codomain_gentor(NULL){}
@@ -34,13 +34,13 @@
virtual void some(segment_type& x);
- void set_range(const itl::interval<domain_type>& range)
+ void set_range(const itl::interval<domain_type>& range)
{ _interval_gentor.setRange(range); }
- void set_corange(const itl::interval<codomain_type>& range)
+ void set_corange(const itl::interval<codomain_type>& range)
{ _covalue_range = range; }
-
- void setMaxIntervalLength(domain_type max_itv_length)
+
+ void setMaxIntervalLength(domain_type max_itv_length)
{ _interval_gentor.setMaxIntervalLength(max_itv_length); }
void setCodomainGentor(RandomGentorAT<codomain_type>* gentor)
@@ -52,18 +52,18 @@
private:
ItvGentorT<domain_type> _interval_gentor;
RandomGentorAT<codomain_type>* _codomain_gentor;
- itl::interval<codomain_type> _covalue_range;
+ itl::interval<codomain_type> _covalue_range;
};
template <class DomainT, class CodomainT>
void map_segment_gentor<DomainT,CodomainT>::some(segment_type& value)
{
- interval_type inter_val;
- codomain_type co_val;
- _interval_gentor.some(inter_val);
- _codomain_gentor->some(co_val);
- value = segment_type(inter_val, co_val);
+ interval_type inter_val;
+ codomain_type co_val;
+ _interval_gentor.some(inter_val);
+ _codomain_gentor->some(co_val);
+ value = segment_type(inter_val, co_val);
};
}} // BOOST_ITL_XT_MAP_SEGMENT_GENTOR_HPP_JOFA_091004
Modified: sandbox/itl/boost/itl_xt/seqgentor.hpp
==============================================================================
--- sandbox/itl/boost/itl_xt/seqgentor.hpp (original)
+++ sandbox/itl/boost/itl_xt/seqgentor.hpp 2009-10-08 10:49:06 EDT (Thu, 08 Oct 2009)
@@ -55,9 +55,9 @@
void setDomainGentor(RandomGentorAT<DomainTD>* gentor)
{
- delete p_domainGentor;
- p_domainGentor = gentor;
- }
+ delete p_domainGentor;
+ p_domainGentor = gentor;
+ }
void setRangeOfSampleSize(int lwb, int upb)
{ m_sampleSizeRange = interval<int>::rightopen(lwb,upb); }
Modified: sandbox/itl/boost/validate/gentor/randomgentor.hpp
==============================================================================
--- sandbox/itl/boost/validate/gentor/randomgentor.hpp (original)
+++ sandbox/itl/boost/validate/gentor/randomgentor.hpp 2009-10-08 10:49:06 EDT (Thu, 08 Oct 2009)
@@ -69,7 +69,7 @@
public map_segment_gentor<DomainT,CodomainT> {};
template <class DomainT, class CodomainT>
- class RandomGentor<itl::list<std::pair<itl::interval<DomainT>, CodomainT> > > :
+ class RandomGentor<itl::list<std::pair<itl::interval<DomainT>, CodomainT> > > :
public SeqGentorT<itl::list<std::pair<itl::interval<DomainT>, CodomainT> > > {};
// ----- sets --------------------------------------------------------------
@@ -255,13 +255,13 @@
//--------------------------------------------------------------------------
// lists
//--------------------------------------------------------------------------
- template <>
+ template <>
struct Calibrater<std::pair<itl::interval<int>, int>, RandomGentor>
{
static void apply(RandomGentor< std::pair<itl::interval<int>, int> >& gentor){}
};
- template <>
+ template <>
struct Calibrater<std::pair<itl::interval<double>, int>, RandomGentor>
{
static void apply(RandomGentor< std::pair<itl::interval<double>, int> >& gentor){}
@@ -276,7 +276,7 @@
map_segment_gentor<double,int>* segment_gentor = new map_segment_gentor<double,int>;
NumberGentorT<int>* int_gentor = new NumberGentorT<int>;
int_gentor->setRange(GentorProfileSgl::it()->range_int());
- segment_gentor->setCodomainGentor(int_gentor);
+ segment_gentor->setCodomainGentor(int_gentor);
segment_gentor->set_range(GentorProfileSgl::it()->range_interval_double());
segment_gentor->setMaxIntervalLength(GentorProfileSgl::it()->maxIntervalLength());
segment_gentor->set_corange(GentorProfileSgl::it()->range_int()); // sets range of codomain_values
@@ -293,7 +293,7 @@
map_segment_gentor<int,int>* segment_gentor = new map_segment_gentor<int,int>;
NumberGentorT<int>* int_gentor = new NumberGentorT<int>;
int_gentor->setRange(GentorProfileSgl::it()->range_int());
- segment_gentor->setCodomainGentor(int_gentor);
+ segment_gentor->setCodomainGentor(int_gentor);
segment_gentor->set_range(GentorProfileSgl::it()->range_interval_int());
segment_gentor->setMaxIntervalLength(GentorProfileSgl::it()->maxIntervalLength());
segment_gentor->set_corange(GentorProfileSgl::it()->range_int()); // sets range of codomain_values
Modified: sandbox/itl/boost/validate/itl/functors.hpp
==============================================================================
--- sandbox/itl/boost/validate/itl/functors.hpp (original)
+++ sandbox/itl/boost/validate/itl/functors.hpp 2009-10-08 10:49:06 EDT (Thu, 08 Oct 2009)
@@ -26,7 +26,7 @@
{
void operator()(TargetT& collected, const SourceT& items)
{
- collected.clear();
+ collected.clear();
ITL_const_FORALL(typename SourceT, item_, items)
collected.insert(*item_);
}
@@ -40,8 +40,8 @@
{
void operator()(TargetT& collected, const SourceT& items)
{
- collected.clear();
- typename TargetT::iterator prior_ = collected.end();
+ collected.clear();
+ typename TargetT::iterator prior_ = collected.end();
ITL_const_FORALL(typename SourceT, item_, items)
prior_ = collected.insert(prior_, *item_);
}
@@ -55,8 +55,8 @@
{
void operator()(TargetT& collected, const SourceT& items)
{
- collected.clear();
- std::copy(items.begin(), items.end(), itl::inserter(collected, collected.end()));
+ collected.clear();
+ std::copy(items.begin(), items.end(), itl::inserter(collected, collected.end()));
}
};
@@ -69,9 +69,9 @@
{
void operator()(TargetT& collected, const SourceT& items)
{
- collected.clear();
- std::transform(items.begin(), items.end(),
- itl::inserter(collected, collected.end()), itl::to_pair);
+ collected.clear();
+ std::transform(items.begin(), items.end(),
+ itl::inserter(collected, collected.end()), itl::to_pair);
}
};
@@ -87,7 +87,7 @@
{
void operator()(TargetT& collected, const SourceT& items)
{
- collected.clear();
+ collected.clear();
ITL_const_FORALL(typename SourceT, item_, items)
collected.add(*item_);
}
@@ -101,8 +101,8 @@
{
void operator()(TargetT& collected, const SourceT& items)
{
- collected.clear();
- typename TargetT::iterator prior_ = collected.end();
+ collected.clear();
+ typename TargetT::iterator prior_ = collected.end();
ITL_const_FORALL(typename SourceT, item_, items)
prior_ = collected.add(prior_, *item_);
}
@@ -116,8 +116,8 @@
{
void operator()(TargetT& collected, const SourceT& items)
{
- collected.clear();
- std::copy(items.begin(), items.end(), itl::adder(collected, collected.end()));
+ collected.clear();
+ std::copy(items.begin(), items.end(), itl::adder(collected, collected.end()));
}
};
Modified: sandbox/itl/boost/validate/laws/function_equality.hpp
==============================================================================
--- sandbox/itl/boost/validate/laws/function_equality.hpp (original)
+++ sandbox/itl/boost/validate/laws/function_equality.hpp 2009-10-08 10:49:06 EDT (Thu, 08 Oct 2009)
@@ -34,14 +34,14 @@
public Law<FunctionEquality<SourceT,TargetT,Function_f,Function_g,Equality>,
LOKI_TYPELIST_1(SourceT), LOKI_TYPELIST_2(TargetT,TargetT)>
{
- /** S: SourceT, T: TargetT
+ /** S: SourceT, T: TargetT
For all S a: f(a) == g(a) : Equality of functions f and g.
Input = (a := inVal1)
Output = (lhs_result, rhs_result)
*/
public:
std::string name()const { return "FunctionEquality"; }
- std::string formula()const { return "S a: f(a) == g(a)"; }
+ std::string formula()const { return "S a: f(a) == g(a)"; }
std::string typeString()const
{
@@ -60,12 +60,12 @@
// For all S a: f(a) == g(a) : f == g.
// --- left hand side --------------------------------------------------
SourceT value_a = this->template getInputValue<operand_a>();
- TargetT lhs;
- Function_f<SourceT,TargetT>()(lhs, value_a); // lhs = f(a);
+ TargetT lhs;
+ Function_f<SourceT,TargetT>()(lhs, value_a); // lhs = f(a);
// --- right hand side -------------------------------------------------
- TargetT rhs;
- Function_g<SourceT,TargetT>()(rhs, value_a); // rhs = g(a);
+ TargetT rhs;
+ Function_g<SourceT,TargetT>()(rhs, value_a); // rhs = g(a);
this->template setOutputValue<lhs_result>(lhs);
this->template setOutputValue<rhs_result>(rhs);
@@ -73,26 +73,26 @@
return Equality<TargetT>()(lhs, rhs);
}
- bool debug_holds()
- {
+ bool debug_holds()
+ {
// For all S a: f(a) == g(a) : f == g.
// --- left hand side --------------------------------------------------
SourceT value_a = this->template getInputValue<operand_a>();
- std::cout << "a= " << value_a << std::endl;
- TargetT lhs;
- Function_f<SourceT,TargetT>()(lhs, value_a); // lhs = f(a);
- std::cout << "l= " << lhs << std::endl;
+ std::cout << "a= " << value_a << std::endl;
+ TargetT lhs;
+ Function_f<SourceT,TargetT>()(lhs, value_a); // lhs = f(a);
+ std::cout << "l= " << lhs << std::endl;
// --- right hand side -------------------------------------------------
- TargetT rhs;
- Function_g<SourceT,TargetT>()(rhs, value_a); // rhs = g(a);
- std::cout << "r= " << rhs << std::endl;
+ TargetT rhs;
+ Function_g<SourceT,TargetT>()(rhs, value_a); // rhs = g(a);
+ std::cout << "r= " << rhs << std::endl;
this->template setOutputValue<lhs_result>(lhs);
this->template setOutputValue<rhs_result>(rhs);
return Equality<TargetT>()(lhs, rhs);
- }
+ }
size_t size()const
{
Modified: sandbox/itl/boost/validate/validater/signed_quantifier_validater.hpp
==============================================================================
--- sandbox/itl/boost/validate/validater/signed_quantifier_validater.hpp (original)
+++ sandbox/itl/boost/validate/validater/signed_quantifier_validater.hpp 2009-10-08 10:49:06 EDT (Thu, 08 Oct 2009)
@@ -62,7 +62,7 @@
et_assoc_share = 0;
//NOTE: An Inverse exists only for a total signed quantifier
//CL if(!is_total<Type>::value)
- if(!is_total<Type>::value || !has_inverse<typename Type::codomain_type>::value)
+ if(!is_total<Type>::value || !has_inverse<typename Type::codomain_type>::value)
inv_ex_share = 0;
int rest_shares = sum_of_shares, item_index = 0;
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-10-08 10:49:06 EDT (Thu, 08 Oct 2009)
@@ -51,8 +51,8 @@
sim1.insert(make_pair(interval<int>::rightopen(2,4),1));
IntervalMapT jim1;
- std::copy(ivec.begin(), ivec.end(), itl::adder(jim1, jim1.end()));
- //std::copy(ivec.begin(), ivec.end(), std::inserter(jim2, jim2.end()));
+ std::copy(ivec.begin(), ivec.end(), itl::adder(jim1, jim1.end()));
+ //std::copy(ivec.begin(), ivec.end(), std::inserter(jim2, jim2.end()));
cout << jim1 << endl;
}
Modified: sandbox/itl/libs/validate/example/labat_polygon_/polygon_gentor.hpp
==============================================================================
--- sandbox/itl/libs/validate/example/labat_polygon_/polygon_gentor.hpp (original)
+++ sandbox/itl/libs/validate/example/labat_polygon_/polygon_gentor.hpp 2009-10-08 10:49:06 EDT (Thu, 08 Oct 2009)
@@ -32,9 +32,9 @@
void setDomainGentor(RandomGentorAT<DomainTD>* gentor)
{
- delete p_domainGentor;
- p_domainGentor = gentor;
- }
+ delete p_domainGentor;
+ p_domainGentor = gentor;
+ }
void setRangeOfSampleSize(int lwb, int upb)
{ m_sampleSizeRange = interval<int>::rightopen(lwb,upb); }
@@ -132,9 +132,9 @@
void setDomainGentor(RandomGentorAT<DomainTD>* gentor)
{
- delete p_domainGentor;
- p_domainGentor = gentor;
- }
+ delete p_domainGentor;
+ p_domainGentor = gentor;
+ }
void setRangeOfSampleSize(int lwb, int upb)
{ m_sampleSizeRange = interval<int>::rightopen(lwb,upb); }
Modified: sandbox/itl/libs/validate/example/labat_single_/labat_single.cpp
==============================================================================
--- sandbox/itl/libs/validate/example/labat_single_/labat_single.cpp (original)
+++ sandbox/itl/libs/validate/example/labat_single_/labat_single.cpp 2009-10-08 10:49:06 EDT (Thu, 08 Oct 2009)
@@ -96,20 +96,20 @@
// <interval_set<int>, itl::interval<int> > TestLawT;
//LawValidater<TestLawT, RandomGentor> test_law;
- typedef FunctionEquality
- <
- itl::list<std::pair<itl::interval<int>,int> >,
- interval_map<int,int,total_absorber>,
- base_addition,
- hint_addition
- > TestLawT;
- LawValidater<TestLawT, RandomGentor> test_law;
+ typedef FunctionEquality
+ <
+ itl::list<std::pair<itl::interval<int>,int> >,
+ interval_map<int,int,total_absorber>,
+ base_addition,
+ hint_addition
+ > TestLawT;
+ LawValidater<TestLawT, RandomGentor> test_law;
//-----------------------------------------------------------------------------
int test_count = 50000;
ptime start, stop;
- GentorProfileSgl::it()->set_std_profile(4,1);
+ GentorProfileSgl::it()->set_std_profile(4,1);
test_law.set_trials_count(test_count);
std::cout << "Start\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