1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
|
/*
Author: Shane Neph & Scott Kuehn
Date: Sun Aug 19 19:01:10 PDT 2007
*/
//
// BEDOPS
// Copyright (C) 2011-2022 Shane Neph, Scott Kuehn and Alex Reynolds
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License along
// with this program; if not, write to the Free Software Foundation, Inc.,
// 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
//
#ifndef ORDERING_COMPARISONS_H
#define ORDERING_COMPARISONS_H
namespace Ordering {
// function objects for comparing values, then addresses
template <typename T1, typename T2=T1>
struct CompValueThenAddressLesser {
inline bool operator()(T1 const* t1, T2 const* t2) const {
if ( *t1 != *t2 )
return(*t1 < *t2);
return(t1 < t2);
}
};
template <typename T1, typename T2=T1>
struct CompValueThenAddressGreater {
inline bool operator()(T1 const* t1, T2 const* t2) const {
if ( *t1 != *t2 )
return(*t1 > *t2);
return(t1 > t2);
}
};
} // namespace Ordering
#endif // ORDERING_COMPARISONS_H
|
