|
|
|
@ -271,16 +271,9 @@ func TestRedBlackTreeIterator1Next(t *testing.T) {
|
|
|
|
|
for it.Next() {
|
|
|
|
|
count++
|
|
|
|
|
key := it.Key()
|
|
|
|
|
switch key {
|
|
|
|
|
case count:
|
|
|
|
|
if actualValue, expectedValue := key, count; actualValue != expectedValue {
|
|
|
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
|
|
|
}
|
|
|
|
|
default:
|
|
|
|
|
if actualValue, expectedValue := key, count; actualValue != expectedValue {
|
|
|
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
if actualValue, expectedValue := count, tree.Size(); actualValue != expectedValue {
|
|
|
|
|
t.Errorf("Size different. Got %v expected %v", actualValue, expectedValue)
|
|
|
|
@ -310,16 +303,9 @@ func TestRedBlackTreeIterator1Prev(t *testing.T) {
|
|
|
|
|
countDown := tree.size
|
|
|
|
|
for it.Prev() {
|
|
|
|
|
key := it.Key()
|
|
|
|
|
switch key {
|
|
|
|
|
case countDown:
|
|
|
|
|
if actualValue, expectedValue := key, countDown; actualValue != expectedValue {
|
|
|
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
|
|
|
}
|
|
|
|
|
default:
|
|
|
|
|
if actualValue, expectedValue := key, countDown; actualValue != expectedValue {
|
|
|
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
countDown--
|
|
|
|
|
}
|
|
|
|
|
if actualValue, expectedValue := countDown, 0; actualValue != expectedValue {
|
|
|
|
@ -337,16 +323,9 @@ func TestRedBlackTreeIterator2Next(t *testing.T) {
|
|
|
|
|
for it.Next() {
|
|
|
|
|
count++
|
|
|
|
|
key := it.Key()
|
|
|
|
|
switch key {
|
|
|
|
|
case count:
|
|
|
|
|
if actualValue, expectedValue := key, count; actualValue != expectedValue {
|
|
|
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
|
|
|
}
|
|
|
|
|
default:
|
|
|
|
|
if actualValue, expectedValue := key, count; actualValue != expectedValue {
|
|
|
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
if actualValue, expectedValue := count, tree.Size(); actualValue != expectedValue {
|
|
|
|
|
t.Errorf("Size different. Got %v expected %v", actualValue, expectedValue)
|
|
|
|
@ -364,16 +343,9 @@ func TestRedBlackTreeIterator2Prev(t *testing.T) {
|
|
|
|
|
countDown := tree.size
|
|
|
|
|
for it.Prev() {
|
|
|
|
|
key := it.Key()
|
|
|
|
|
switch key {
|
|
|
|
|
case countDown:
|
|
|
|
|
if actualValue, expectedValue := key, countDown; actualValue != expectedValue {
|
|
|
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
|
|
|
}
|
|
|
|
|
default:
|
|
|
|
|
if actualValue, expectedValue := key, countDown; actualValue != expectedValue {
|
|
|
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
countDown--
|
|
|
|
|
}
|
|
|
|
|
if actualValue, expectedValue := countDown, 0; actualValue != expectedValue {
|
|
|
|
@ -389,16 +361,9 @@ func TestRedBlackTreeIterator3Next(t *testing.T) {
|
|
|
|
|
for it.Next() {
|
|
|
|
|
count++
|
|
|
|
|
key := it.Key()
|
|
|
|
|
switch key {
|
|
|
|
|
case count:
|
|
|
|
|
if actualValue, expectedValue := key, count; actualValue != expectedValue {
|
|
|
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
|
|
|
}
|
|
|
|
|
default:
|
|
|
|
|
if actualValue, expectedValue := key, count; actualValue != expectedValue {
|
|
|
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
if actualValue, expectedValue := count, tree.Size(); actualValue != expectedValue {
|
|
|
|
|
t.Errorf("Size different. Got %v expected %v", actualValue, expectedValue)
|
|
|
|
@ -414,16 +379,9 @@ func TestRedBlackTreeIterator3Prev(t *testing.T) {
|
|
|
|
|
countDown := tree.size
|
|
|
|
|
for it.Prev() {
|
|
|
|
|
key := it.Key()
|
|
|
|
|
switch key {
|
|
|
|
|
case countDown:
|
|
|
|
|
if actualValue, expectedValue := key, countDown; actualValue != expectedValue {
|
|
|
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
|
|
|
}
|
|
|
|
|
default:
|
|
|
|
|
if actualValue, expectedValue := key, countDown; actualValue != expectedValue {
|
|
|
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
countDown--
|
|
|
|
|
}
|
|
|
|
|
if actualValue, expectedValue := countDown, 0; actualValue != expectedValue {
|
|
|
|
@ -458,16 +416,9 @@ func TestRedBlackTreeIterator4Next(t *testing.T) {
|
|
|
|
|
for it.Next() {
|
|
|
|
|
count++
|
|
|
|
|
value := it.Value()
|
|
|
|
|
switch value {
|
|
|
|
|
case count:
|
|
|
|
|
if actualValue, expectedValue := value, count; actualValue != expectedValue {
|
|
|
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
|
|
|
}
|
|
|
|
|
default:
|
|
|
|
|
if actualValue, expectedValue := value, count; actualValue != expectedValue {
|
|
|
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
if actualValue, expectedValue := count, tree.Size(); actualValue != expectedValue {
|
|
|
|
|
t.Errorf("Size different. Got %v expected %v", actualValue, expectedValue)
|
|
|
|
@ -502,16 +453,9 @@ func TestRedBlackTreeIterator4Prev(t *testing.T) {
|
|
|
|
|
}
|
|
|
|
|
for it.Prev() {
|
|
|
|
|
value := it.Value()
|
|
|
|
|
switch value {
|
|
|
|
|
case count:
|
|
|
|
|
if actualValue, expectedValue := value, count; actualValue != expectedValue {
|
|
|
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
|
|
|
}
|
|
|
|
|
default:
|
|
|
|
|
if actualValue, expectedValue := value, count; actualValue != expectedValue {
|
|
|
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
count--
|
|
|
|
|
}
|
|
|
|
|
if actualValue, expectedValue := count, 0; actualValue != expectedValue {
|
|
|
|
|