mirror/dolt
1
0
Fork 0
mirror of https://github.com/dolthub/dolt.git synced 2026-01-04 09:30:38 -06:00
Code Issues Packages Projects Releases 115 Wiki Activity

Update archive_test.go

Browse Source
This commit is contained in:
Nick Tobey
2025-08-05 12:13:47 -04:00
parent 81b521d34a
commit c84546fe38
1 changed files with 13 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
go/store/nbs/archive_test.go
View File

@@ -551,8 +551,8 @@ func TestProllyBinSearchUneven(t *testing.T) {
pf[i] = uint64(10000000 + i)
}
// In normal circumstances, a value of 12345 would be far to the left side of the list
found := prollyBinSearch(slicePrefixList(pf), target)
assert.Equal(t, int32(900), found)
found := prollyBinSearch(pf, target)
assert.Equal(t, 900, found)
// Same test, but from something on the right side of the list.
for i := 999; i > 100; i-- {
@@ -563,8 +563,8 @@ func TestProllyBinSearchUneven(t *testing.T) {
for i := 99; i >= 0; i-- {
pf[i] = uint64(10000000 - i)
}
found = prollyBinSearch(slicePrefixList(pf), target)
assert.Equal(t, int32(100), found)
found = prollyBinSearch(pf, target)
assert.Equal(t, 100, found)
}
func TestProllyBinSearch(t *testing.T) {
@@ -577,21 +577,21 @@ func TestProllyBinSearch(t *testing.T) {
}
for i := 0; i < 10000; i++ {
idx := prollyBinSearch(slicePrefixList(pf), pf[i])
idx := prollyBinSearch(pf, pf[i])
// There are dupes in the list, so we don't always end up with the same index.
assert.Equal(t, pf[i], pf[idx])
}
idx := prollyBinSearch(slicePrefixList(pf), pf[0]-1)
assert.Equal(t, int32(0), idx)
idx = prollyBinSearch(slicePrefixList(pf), pf[9999]+1)
assert.Equal(t, int32(10000), idx)
idx := prollyBinSearch(pf, pf[0]-1)
assert.Equal(t, 0, idx)
idx = prollyBinSearch(pf, pf[9999]+1)
assert.Equal(t, 10000, idx)
// 23 is not a dupe, and neighbors don't match. stable due to seed.
idx = prollyBinSearch(slicePrefixList(pf), pf[23]+1)
assert.Equal(t, int32(24), idx)
idx = prollyBinSearch(slicePrefixList(pf), pf[23]-1)
assert.Equal(t, int32(23), idx)
idx = prollyBinSearch(pf, pf[23]+1)
assert.Equal(t, 24, idx)
idx = prollyBinSearch(pf, pf[23]-1)
assert.Equal(t, 23, idx)
}