Sort search results

Author: lalinsky

src/InMemoryIndex.zig

@@ -326,6 +326,8 @@ pub fn search(self: *Self, hashes: []const u32, results: *SearchResults, deadlin
             }
         }
     }
+
+    results.sort();
 }
 
 test "insert and search" {

src/common.zig

@@ -93,7 +93,33 @@ pub const SearchResults = struct {
         return self.results.get(doc_id);
     }
 
+    pub fn sort(self: *SearchResults) void {
+        const Ctx = struct {
+            values: []SearchResult,
+            pub fn lessThan(ctx: @This(), a: usize, b: usize) bool {
+                return SearchResult.cmp({}, ctx.values[a], ctx.values[b]);
+            }
+        };
+        self.results.sort(Ctx{ .values = self.results.values() });
+    }
+
     pub fn values(self: *SearchResults) []SearchResult {
         return self.results.values();
     }
 };
+
+test "sort search results" {
+    var results = SearchResults.init(testing.allocator);
+    defer results.deinit();
+
+    try results.incr(1, 1);
+    try results.incr(2, 1);
+    try results.incr(2, 1);
+
+    results.sort();
+
+    try testing.expectEqualSlices(SearchResult, &[_]SearchResult{
+        SearchResult{ .docId = 2, .score = 2, .version = 1 },
+        SearchResult{ .docId = 1, .score = 1, .version = 1 },
+    }, results.values());
+}