mirror of https://github.com/emirpasic/gods
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
99 lines
2.5 KiB
Go
99 lines
2.5 KiB
Go
/*
|
|
Copyright (c) Emir Pasic, All rights reserved.
|
|
|
|
This library is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU Lesser General Public
|
|
License as published by the Free Software Foundation; either
|
|
version 3.0 of the License, or (at your option) any later version.
|
|
|
|
This library is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public
|
|
License along with this library. See the file LICENSE included
|
|
with this distribution for more information.
|
|
*/
|
|
|
|
package treeset
|
|
|
|
import (
|
|
"fmt"
|
|
"testing"
|
|
)
|
|
|
|
func TestTreeSet(t *testing.T) {
|
|
|
|
set := NewWithIntComparator()
|
|
|
|
// insertions
|
|
set.Add()
|
|
set.Add(1)
|
|
set.Add(2)
|
|
set.Add(2, 3)
|
|
set.Add()
|
|
|
|
if actualValue := set.Empty(); actualValue != false {
|
|
t.Errorf("Got %v expected %v", actualValue, false)
|
|
}
|
|
|
|
if actualValue := set.Size(); actualValue != 3 {
|
|
t.Errorf("Got %v expected %v", actualValue, 3)
|
|
}
|
|
|
|
// Asking if a set is superset of nothing, thus it's true
|
|
if actualValue := set.Contains(); actualValue != true {
|
|
t.Errorf("Got %v expected %v", actualValue, true)
|
|
}
|
|
|
|
if actualValue := set.Contains(1); actualValue != true {
|
|
t.Errorf("Got %v expected %v", actualValue, true)
|
|
}
|
|
|
|
if actualValue := set.Contains(1, 2, 3); actualValue != true {
|
|
t.Errorf("Got %v expected %v", actualValue, true)
|
|
}
|
|
|
|
if actualValue := set.Contains(1, 2, 3, 4); actualValue != false {
|
|
t.Errorf("Got %v expected %v", actualValue, false)
|
|
}
|
|
|
|
// repeat 10 time since map in golang has a random iteration order each time and we want to make sure that the set is ordered
|
|
for i := 1; i <= 10; i++ {
|
|
if actualValue, expactedValue := fmt.Sprintf("%d%d%d", set.Values()...), "123"; actualValue != expactedValue {
|
|
t.Errorf("Got %v expected %v", actualValue, expactedValue)
|
|
}
|
|
}
|
|
|
|
set.Remove()
|
|
set.Remove(1)
|
|
|
|
if actualValue := set.Contains(1); actualValue != false {
|
|
t.Errorf("Got %v expected %v", actualValue, false)
|
|
}
|
|
|
|
set.Remove(1, 2, 3)
|
|
|
|
if actualValue := set.Contains(3); actualValue != false {
|
|
t.Errorf("Got %v expected %v", actualValue, false)
|
|
}
|
|
|
|
if actualValue := set.Empty(); actualValue != true {
|
|
t.Errorf("Got %v expected %v", actualValue, true)
|
|
}
|
|
|
|
}
|
|
|
|
func BenchmarkTreeSet(b *testing.B) {
|
|
for i := 0; i < b.N; i++ {
|
|
set := NewWithIntComparator()
|
|
for n := 0; n < 1000; n++ {
|
|
set.Add(i)
|
|
}
|
|
for n := 0; n < 1000; n++ {
|
|
set.Remove(n)
|
|
}
|
|
}
|
|
}
|