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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
|
/****************************************************************/
/* Parallel Combinatorial BLAS Library (for Graph Computations) */
/* version 1.6 -------------------------------------------------*/
/* date: 6/15/2017 ---------------------------------------------*/
/* authors: Ariful Azad, Aydin Buluc --------------------------*/
/****************************************************************/
/*
Copyright (c) 2010-2017, The Regents of the University of California
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/
#ifndef _COMPARE_H_
#define _COMPARE_H_
#include <cmath>
#include <type_traits>
#include "SpDefs.h"
#include "CombBLAS.h"
namespace combblas {
// third parameter of compare is about floating point-ness
template <class T>
inline bool compare(const T & a, const T & b, std::false_type) // not floating point
{
return (a == b);
}
template <class T>
inline bool compare(const T & a, const T & b, std::true_type) // floating point
{
// According to the IEEE 754 standard, negative zero and positive zero should
// compare as equal with the usual (numerical) comparison operators, like the == operators of C++
if(a == b) return true; // covers the "division by zero" case as well: max(a,b) can't be zero if it fails
else return ( std::abs(a - b) < EPSILON || (std::abs(a - b) / std::max(std::abs(a), std::abs(b))) < EPSILON ) ; // Fine if either absolute or relative error is small
}
template <class T>
struct ErrorTolerantEqual:
public std::binary_function< T, T, bool >
{
inline bool operator() (const T & a, const T & b) const
{
return compare(a,b, std::is_floating_point<T>());
}
};
template < typename T >
struct absdiff : std::binary_function<T, T, T>
{
T operator () ( T const &arg1, T const &arg2 ) const
{
using std::abs;
return abs( arg1 - arg2 );
}
};
template<class IT, class NT>
struct TupleEqual:
public std::binary_function< std::tuple<IT, IT, NT>, std::tuple<IT, IT, NT>, bool >
{
inline bool operator()(const std::tuple<IT, IT, NT> & lhs, const std::tuple<IT, IT, NT> & rhs) const
{
return ( (std::get<0>(lhs) == std::get<0>(rhs)) && (std::get<1>(lhs) == std::get<1>(rhs)) );
}
};
/**
** Functor class
** \return bool, whether lhs precedes rhs in column-sorted order
** @pre {No elements with same (i,j) pairs exist in the input}
**/
template <class IT, class NT>
struct ColLexiCompare: // struct instead of class so that operator() is public
public std::binary_function< std::tuple<IT, IT, NT>, std::tuple<IT, IT, NT>, bool > // (par1, par2, return_type)
{
inline bool operator()(const std::tuple<IT, IT, NT> & lhs, const std::tuple<IT, IT, NT> & rhs) const
{
if(std::get<1>(lhs) == std::get<1>(rhs))
{
return std::get<0>(lhs) < std::get<0>(rhs);
}
else
{
return std::get<1>(lhs) < std::get<1>(rhs);
}
}
};
template <class IT, class NT>
struct RowLexiCompare: // struct instead of class so that operator() is public
public std::binary_function< std::tuple<IT, IT, NT>, std::tuple<IT, IT, NT>, bool > // (par1, par2, return_type)
{
inline bool operator()(const std::tuple<IT, IT, NT> & lhs, const std::tuple<IT, IT, NT> & rhs) const
{
if(std::get<0>(lhs) == std::get<0>(rhs))
{
return std::get<1>(lhs) < std::get<1>(rhs);
}
else
{
return std::get<0>(lhs) < std::get<0>(rhs);
}
}
};
// Non-lexicographical, just compares columns
template <class IT, class NT>
struct ColCompare: // struct instead of class so that operator() is public
public std::binary_function< std::tuple<IT, IT, NT>, std::tuple<IT, IT, NT>, bool > // (par1, par2, return_type)
{
inline bool operator()(const std::tuple<IT, IT, NT> & lhs, const std::tuple<IT, IT, NT> & rhs) const
{
return std::get<1>(lhs) < std::get<1>(rhs);
}
};
// Non-lexicographical, just compares columns
template <class IT, class NT>
struct RowCompare: // struct instead of class so that operator() is public
public std::binary_function< std::tuple<IT, IT, NT>, std::tuple<IT, IT, NT>, bool > // (par1, par2, return_type)
{
inline bool operator()(const std::tuple<IT, IT, NT> & lhs, const std::tuple<IT, IT, NT> & rhs) const
{
return std::get<0>(lhs) < std::get<0>(rhs);
}
};
template <class IT, class NT>
struct ColLexiCompareWithID: // struct instead of class so that operator() is public
public std::binary_function< std::pair< std::tuple<IT, IT, NT> , int > , std::pair< std::tuple<IT, IT, NT> , int>, bool > // (par1, par2, return_type)
{
inline bool operator()(const std::pair< std::tuple<IT, IT, NT> , int > & lhs, const std::pair< std::tuple<IT, IT, NT> , int > & rhs) const
{
if(std::get<1>(lhs.first) == std::get<1>(rhs.first))
{
return std::get<0>(lhs.first) < std::get<0>(rhs.first);
}
else
{
return std::get<1>(lhs.first) < std::get<1>(rhs.first);
}
}
};
}
#endif
|
