feat: remove minimum-load option, hard-coded to 5%

cuckoo_fuzz_test.go

@@ -3,7 +3,6 @@ package cuckoo_test
 import (
 	"fmt"
 	"maps"
-	"math"
 	"os"
 	"testing"
 
@@ -30,7 +29,6 @@ type fuzzStep struct {
 type fuzzScenario struct {
 	seedA, seedB           uint32
 	capacity, growthFactor uint8
-	load                   float64
 	steps                  []fuzzStep
 }
 
@@ -48,7 +46,6 @@ func FuzzInsertLookup(f *testing.F) {
 		seedA, seedB := scenario.seedA, scenario.seedB
 		growthFactor := max(2, int(scenario.growthFactor))
 		capacity := int(scenario.capacity)
-		minimumLoad := math.Abs(math.Mod(scenario.load, 1.0))
 
 		// If they are the same number, the hashes will clash, always causing an
 		// error.
@@ -56,14 +53,8 @@ func FuzzInsertLookup(f *testing.F) {
 			t.Skip()
 		}
 
-		// If the load is too high, the hashs will not be able to allocate
-		// properly.
-		if minimumLoad > 0.20 {
-			t.Skip()
-		}
-
-		fmt.Fprintf(os.Stderr, "seedA=%d seedB=%d capacity=%d growthFactor=%d minimumLoad=%f\n",
-			seedA, seedB, capacity, growthFactor, minimumLoad)
+		fmt.Fprintf(os.Stderr, "seedA=%d seedB=%d capacity=%d growthFactor=%d\n",
+			seedA, seedB, capacity, growthFactor)
 
 		actual := cuckoo.NewCustomTable[uint32, uint32](
 			offsetHash(seedA),
@@ -71,7 +62,6 @@ func FuzzInsertLookup(f *testing.F) {
 			func(a, b uint32) bool { return a == b },
 			cuckoo.Capacity(capacity),
 			cuckoo.GrowthFactor(growthFactor),
-			cuckoo.MinimumLoad(minimumLoad),
 		)
 
 		expected := map[uint32]uint32{}