|
template<typename SourceIterator , typename Iterator1 , typename Iterator2 > |
void | capd::vectalg::split (SourceIterator sourceBegin, SourceIterator sourceEnd, Iterator1 center, Iterator2 diameter) |
| splits source object given by [sourceBegin, sourceEnd] into form center + diameter where diameter = [-radius,radius] on each coordinatedimension More...
|
|
template<typename IObject > |
IObject::ScalarType | capd::vectalg::maxDiam (const IObject &v) |
| returns the upper bound for the biggest diameter of IntervalObject (vector or matrix) coordinates More...
|
|
template<typename IObject > |
capd::TypeTraits< typename IObject::ScalarType >::Real | capd::vectalg::maxWidth (const IObject &v) |
| returns the biggest diameter of the interval object (vector or matrix) coordinates (non-rigorous) More...
|
|
template<typename ResultType , typename IObject > |
ResultType | capd::vectalg::getWidths (const IObject &v) |
|
template<typename IObject > |
IObject::template rebind< typename capd::TypeTraits< typename IObject::ScalarType >::Real >::other | capd::vectalg::widths (const IObject &v) |
|
template<typename IntervalObject > |
bool | capd::vectalg::containsZero (const IntervalObject &v) |
| checks if IntervalObject v contains zero on all coordinates More...
|
|
template<typename IntervalObject > |
bool | capd::vectalg::subset (const IntervalObject &v1, const IntervalObject &v2) |
| checks if IntervalObject v1 is contained in IntervalObject v2 More...
|
|
template<typename IntervalObject > |
bool | capd::vectalg::subsetInterior (const IntervalObject &v1, const IntervalObject &v2) |
| checks if IntervalObject v1 is contained in interior of IntervalObject v2 More...
|
|
template<typename Iterator1 , typename Iterator2 , typename ResultIterator > |
bool | capd::vectalg::intersection (Iterator1 b1, Iterator2 b2, ResultIterator b, ResultIterator e) |
| intersection of two interval objects (vectors, matrices) More...
|
|
template<typename Iterator1 , typename Iterator2 > |
bool | capd::vectalg::intersectionIsEmpty (Iterator1 b, Iterator1 e, Iterator2 b1) |
| checks if intersection of two interval vectors is empty More...
|
|
template<typename IntervalObject > |
void | capd::vectalg::intervalHull (const IntervalObject &v1, const IntervalObject &v2, IntervalObject &result) |
|
template<typename IntervalObject , typename ResultContainer > |
void | capd::vectalg::diameter (const IntervalObject &v, ResultContainer &result) |
|
template<typename IntervalObject , typename ResultType > |
void | capd::vectalg::mid (const IntervalObject &v, ResultType &result) |
|
template<typename ResultType , typename IntervalObject > |
ResultType | capd::vectalg::midObject (const IntervalObject &v) |
|
template<typename ResultType , typename IntervalObject > |
void | capd::vectalg::leftObject (const IntervalObject &v, ResultType &result) |
|
template<typename ResultType , typename IntervalObject > |
void | capd::vectalg::rightObject (const IntervalObject &v, ResultType &result) |
|
template<typename ResultType , typename ContainerType > |
ResultType | capd::vectalg::convertObject (const ContainerType &v) |
|
template<typename VectorType > |
VectorType | capd::vectalg::conjVector (const VectorType &v) |
|