scriptoriumadmin/featurebase
1
0
Fork 0
mirror of https://github.com/featurebasedb/featurebase.git synced 2026-10-10 04:47:53 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

trim the ranked cache set on the 1st recalculate call

Browse source
This commit is contained in:
Michael Baird 2017-03-17 13:45:30 -05:00 • committed by Travis
parent 4e7c2af572
commit 9321637d18
2 changed files with 4 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

1
cache.go
View file

@ -211,6 +211,7 @@ func (c *RankCache) recalculate() {
c.rankings = rankings
if len(c.rankings) > c.ThresholdIndex {
c.ThresholdValue = rankings[c.ThresholdIndex].Count
c.rankings = c.rankings[0:c.ThresholdIndex]
} else {
c.ThresholdValue = 1
}

9
fragment_test.go
View file

@ -309,16 +309,13 @@ func TestFragment_TopN_CacheSize(t *testing.T) {
p := []pilosa.Pair{
{Key: 104, Count: 7},
{Key: 103, Count: 6},
{Key: 102, Count: 5}}
// {Key: 101, Count: 4},
// {Key: 100, Count: 3}}
{Key: 103, Count: 6}}
// Retrieve top bitmaps.
if pairs, err := f.Top(pilosa.TopOptions{N: 5}); err != nil {
t.Fatal(err)
} else if len(pairs) != cacheLimit {
t.Fatalf("TopN count cannot exceed cache size: %d", len(pairs))
} else if len(pairs) > cacheLimit {
t.Fatalf("TopN count cannot exceed cache size: %d", cacheLimit)
} else if pairs[0] != (pilosa.Pair{Key: 104, Count: 7}) {
t.Fatalf("unexpected pair(0): %v", pairs)
} else if !reflect.DeepEqual(pairs, p) {