12#ifndef MFEM_SORT_PAIRS
13#define MFEM_SORT_PAIRS
22template <
class A,
class B>
35template <
class A,
class B>
38 return (
p.one < q.
one);
42template <
class A,
class B>
45 return (
p.one == q.
one);
49template <
class A,
class B>
52 std::sort(pairs, pairs + size);
56template <
class A,
class B,
class C>
71template <
class A,
class B,
class C>
74 return (
p.one < q.
one ||
80template <
class A,
class B,
class C>
83 std::sort(triples, triples + size);
Pair(const A &one, const B &two)
Triple(const A &one, const B &two, const C &three)
bool operator==(const Array< T > &LHS, const Array< T > &RHS)
void SortPairs(Pair< A, B > *pairs, int size)
Sort an array of Pairs with respect to the first element.
void SortTriple(Triple< A, B, C > *triples, int size)
Lexicographic sort for arrays of class Triple.
bool operator<(const Pair< A, B > &p, const Pair< A, B > &q)
Comparison operator for class Pair, based on the first element only.
real_t p(const Vector &x, real_t t)