gotools/container/intsets/sparse_test.go

func TestBasics(t *testing.T) { … }

// Insert, Len, IsEmpty, Hash, Clear, AppendTo.
func TestMoreBasics(t *testing.T) { … }

func TestTakeMin(t *testing.T) { … }

func TestMinAndMax(t *testing.T) { … }

func TestEquals(t *testing.T) { … }

type pset …

func makePset() *pset { … }

func (set *pset) add(n int) { … }

func (set *pset) remove(n int) { … }

func (set *pset) check(t *testing.T, msg string) { … }

// randomPset returns a parallel set of random size and elements.
func randomPset(prng *rand.Rand, maxSize int) *pset { … }

// TestRandomMutations performs the same random adds/removes on two
// set implementations and ensures that they compute the same result.
func TestRandomMutations(t *testing.T) { … }

func TestLowerBound(t *testing.T) { … }

// TestSetOperations exercises classic set operations: ∩ , ∪, \.
func TestSetOperations(t *testing.T) { … }

// TestUnionWithChanged checks the 'changed' result of UnionWith.
func TestUnionWithChanged(t *testing.T) { … }

func TestIntersectionWith(t *testing.T) { … }

func TestIntersects(t *testing.T) { … }

func TestSubsetOf(t *testing.T) { … }

func TestBitString(t *testing.T) { … }

func TestFailFastOnShallowCopy(t *testing.T) { … }

func benchmarkInsertProbeSparse(b *testing.B, size, spread int) { … }

func BenchmarkInsertProbeSparse_2_10(b *testing.B) { … }

func BenchmarkInsertProbeSparse_10_10(b *testing.B) { … }

func BenchmarkInsertProbeSparse_10_1000(b *testing.B) { … }

func BenchmarkInsertProbeSparse_100_100(b *testing.B) { … }

func BenchmarkInsertProbeSparse_100_10000(b *testing.B) { … }

func BenchmarkUnionDifferenceSparse(b *testing.B) { … }

func BenchmarkUnionDifferenceHashTable(b *testing.B) { … }

func BenchmarkAppendTo(b *testing.B) { … }