diff --git a/‎test/gloh.cpp‎
Lines changed: 1 addition & 1 deletion b/‎test/gloh.cpp‎
Lines changed: 1 addition & 1 deletion
diff --git a/‎test/orb.cpp‎
Lines changed: 1 addition & 1 deletion b/‎test/orb.cpp‎
Lines changed: 1 addition & 1 deletion
diff --git a/‎test/sift.cpp‎
Lines changed: 1 addition & 1 deletion b/‎test/sift.cpp‎
Lines changed: 1 addition & 1 deletion
diff --git a/‎test/topk.cpp‎
Lines changed: 1 addition & 1 deletion b/‎test/topk.cpp‎
Lines changed: 1 addition & 1 deletion
@@ -46,7 +46,7 @@ static bool feat_cmp(feat_desc_t i, feat_desc_t j) {
         if (round(i.f[k] * 1e1f) != round(j.f[k] * 1e1f))
             return (round(i.f[k] * 1e1f) < round(j.f[k] * 1e1f));
 
-    return true;
+    return false;
 }
 
 static void array_to_feat_desc(vector<feat_desc_t>& feat, float* x, float* y,
 
@@ -45,7 +45,7 @@ static bool feat_cmp(feat_desc_t i, feat_desc_t j) {
     for (int k = 0; k < 5; k++)
         if (i.f[k] != j.f[k]) return (i.f[k] < j.f[k]);
 
-    return true;
+    return false;
 }
 
 static void array_to_feat_desc(vector<feat_desc_t>& feat, float* x, float* y,
 
@@ -46,7 +46,7 @@ static bool feat_cmp(feat_desc_t i, feat_desc_t j) {
         if (round(i.f[k] * 1e1f) != round(j.f[k] * 1e1f))
             return (round(i.f[k] * 1e1f) < round(j.f[k] * 1e1f));
 
-    return true;
+    return false;
 }
 
 static void array_to_feat_desc(vector<feat_desc_t>& feat, float* x, float* y,
 
@@ -121,7 +121,7 @@ void topkTest(const int ndims, const dim_t* dims, const unsigned k,
         } else {
             stable_sort(kvPairs.begin(), kvPairs.end(),
                         [](const KeyValuePair& lhs, const KeyValuePair& rhs) {
-                            return lhs.first >= rhs.first;
+                            return lhs.first > rhs.first;
                         });
         }
Original file line number	Diff line number	Diff line change
@@ -46,7 +46,7 @@ static bool feat_cmp(feat_desc_t i, feat_desc_t j) {
46	46	if (round(i.f[k] * 1e1f) != round(j.f[k] * 1e1f))
47	47	return (round(i.f[k] * 1e1f) < round(j.f[k] * 1e1f));
48	48
49		- return true;
	49	+ return false;
50	50	}
51	51
52	52	static void array_to_feat_desc(vector<feat_desc_t>& feat, float* x, float* y,
Original file line number	Diff line number	Diff line change
@@ -45,7 +45,7 @@ static bool feat_cmp(feat_desc_t i, feat_desc_t j) {
45	45	for (int k = 0; k < 5; k++)
46	46	if (i.f[k] != j.f[k]) return (i.f[k] < j.f[k]);
47	47
48		- return true;
	48	+ return false;
49	49	}
50	50
51	51	static void array_to_feat_desc(vector<feat_desc_t>& feat, float* x, float* y,
Original file line number	Diff line number	Diff line change
@@ -121,7 +121,7 @@ void topkTest(const int ndims, const dim_t* dims, const unsigned k,
121	121	} else {
122	122	stable_sort(kvPairs.begin(), kvPairs.end(),
123	123	[](const KeyValuePair& lhs, const KeyValuePair& rhs) {
124		- return lhs.first >= rhs.first;
	124	+ return lhs.first > rhs.first;
125	125	});
126	126	}
127	127