|
27 | 27 | * |
28 | 28 | * @section DESCRIPTION |
29 | 29 | * |
| 30 | + * Gemm-based scoring. |
| 31 | + * |
30 | 32 | */ |
31 | 33 |
|
32 | 34 | #ifndef TDB_SCORING_H |
@@ -73,12 +75,103 @@ class without_ids {}; |
73 | 75 | // Distance functions |
74 | 76 | // ---------------------------------------------------------------------------- |
75 | 77 |
|
| 78 | +/** |
| 79 | + * @brief Compute sum of squares distance between two vectors. |
| 80 | + * @tparam V |
| 81 | + * @tparam U |
| 82 | + * @param a |
| 83 | + * @param b |
| 84 | + * @return |
| 85 | + */ |
| 86 | +#if 0 |
| 87 | +template <class V, class U> |
| 88 | +inline auto sum_of_squares(V const& a, U const& b) { |
| 89 | + float sum{0.0}; |
| 90 | + size_t size_a = size(a); |
| 91 | + |
| 92 | + if constexpr (std::is_same_v<decltype(a[0]),decltype(b[0])>) { |
| 93 | + for (size_t i = 0; i < size_a; ++i) { |
| 94 | + float diff = a[i]- b[i]; |
| 95 | + sum += diff * diff; |
| 96 | + } |
| 97 | + } else { |
| 98 | + for (size_t i = 0; i < size_a; ++i) { |
| 99 | + float diff = ((float)a[i]) - ((float)b[i]); |
| 100 | + sum += diff * diff; |
| 101 | + } |
| 102 | + } |
| 103 | + return sum; |
| 104 | +} |
| 105 | +#else |
| 106 | +template <class V, class U> |
| 107 | +inline auto sum_of_squares(V const& a, U const& b) { |
| 108 | + float sum{0.0}; |
| 109 | + size_t size_a = size(a); |
| 110 | + |
| 111 | + if constexpr ( |
| 112 | + std::unsigned_integral<std::remove_reference_t<decltype(a[0])>> || |
| 113 | + std::unsigned_integral<std::remove_reference_t<decltype(b[0])>>) { |
| 114 | + for (size_t i = 0; i < size_a; ++i) { |
| 115 | + // float diff = (float)a[i] - (float)b[i]; // converting to float is slow |
| 116 | + float diff = (float)a[i] - (float)b[i]; |
| 117 | + sum += diff * diff; |
| 118 | + } |
| 119 | + } else { |
| 120 | + for (size_t i = 0; i < size_a; ++i) { |
| 121 | + // float diff = (float)a[i] - (float)b[i]; // converting to float is slow |
| 122 | + float diff = a[i] - b[i]; |
| 123 | + sum += diff * diff; |
| 124 | + } |
| 125 | + } |
| 126 | + return sum; |
| 127 | +} |
76 | 128 |
|
77 | | -// sum_of_squares(a, b) |
78 | | -// sum_of_squares(a) |
79 | | -// sub_sum_of_squares(a, b, start, stop) |
| 129 | +template <class V> |
| 130 | +inline auto sum_of_squares(V const& a) { |
| 131 | + float sum{0.0}; |
| 132 | + size_t size_a = size(a); |
| 133 | + |
| 134 | + if constexpr (std::unsigned_integral< |
| 135 | + std::remove_reference_t<decltype(a[0])>>) { |
| 136 | + for (size_t i = 0; i < size_a; ++i) { |
| 137 | + // float diff = (float)a[i] - (float)b[i]; // converting to float is slow |
| 138 | + float diff = (float)a[i]; |
| 139 | + sum += diff * diff; |
| 140 | + } |
| 141 | + } else { |
| 142 | + for (size_t i = 0; i < size_a; ++i) { |
| 143 | + // float diff = (float)a[i] - (float)b[i]; // converting to float is slow |
| 144 | + float diff = a[i]; |
| 145 | + sum += diff * diff; |
| 146 | + } |
| 147 | + } |
| 148 | + return sum; |
| 149 | +} |
80 | 150 |
|
| 151 | +template <class V, class U> |
| 152 | +inline auto sub_sum_of_squares( |
| 153 | + V const& a, U const& b, size_t start, size_t end) { |
| 154 | + float sum{0.0}; |
| 155 | + |
| 156 | + if constexpr ( |
| 157 | + std::unsigned_integral<std::remove_reference_t<decltype(a[0])>> || |
| 158 | + std::unsigned_integral<std::remove_reference_t<decltype(b[0])>>) { |
| 159 | + for (size_t i = start; i < end; ++i) { |
| 160 | + // float diff = (float)a[i] - (float)b[i]; // converting to float is slow |
| 161 | + float diff = (float)a[i] - (float)b[i]; |
| 162 | + sum += diff * diff; |
| 163 | + } |
| 164 | + } else { |
| 165 | + for (size_t i = start; i < end; ++i) { |
| 166 | + // float diff = (float)a[i] - (float)b[i]; // converting to float is slow |
| 167 | + float diff = a[i] - b[i]; |
| 168 | + sum += diff * diff; |
| 169 | + } |
| 170 | + } |
| 171 | + return sum; |
| 172 | +} |
81 | 173 |
|
| 174 | +#endif |
82 | 175 |
|
83 | 176 | /** |
84 | 177 | * @brief Compute L2 distance between two vectors. |
|
0 commit comments