A comparison functor implementing a strict weak ordering based total-order ordering, recursive on the dimension.
More...
#include <Stokhos_ProductBasisUtils.hpp>
|
|
typedef term_type | product_element_type |
|
typedef term_type::ordinal_type | ordinal_type |
|
typedef term_type::element_type | element_type |
|
| | TotalOrderLess (const compare_type &cmp_=compare_type()) |
| | Constructor.
|
|
bool | operator() (const term_type &a, const term_type &b) const |
|
| bool | equal (const element_type &a, const element_type &b) const |
| | Determine if two elements a and b are equal.
|
|
| compare_type | cmp |
| | Element comparison functor.
|
template<typename term_type, typename compare_type = std::less<typename term_type::element_type>>
class Stokhos::TotalOrderLess< term_type, compare_type >
A comparison functor implementing a strict weak ordering based total-order ordering, recursive on the dimension.
◆ TotalOrderLess()
template<typename term_type, typename compare_type = std::less<typename term_type::element_type>>
Constructor.
References cmp.
◆ equal()
template<typename term_type, typename compare_type = std::less<typename term_type::element_type>>
| bool Stokhos::TotalOrderLess< term_type, compare_type >::equal |
( |
const element_type & | a, |
|
|
const element_type & | b ) const |
|
inlineprotected |
Determine if two elements a and b are equal.
References cmp.
◆ cmp
template<typename term_type, typename compare_type = std::less<typename term_type::element_type>>
The documentation for this class was generated from the following file:
- Stokhos_ProductBasisUtils.hpp