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.
334 lines
8.0 KiB
Go
334 lines
8.0 KiB
Go
// Copyright (c) 2015, Emir Pasic. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style
|
|
// license that can be found in the LICENSE file.
|
|
|
|
package arraystack
|
|
|
|
import (
|
|
"testing"
|
|
)
|
|
|
|
func TestStackPush(t *testing.T) {
|
|
stack := New()
|
|
if actualValue := stack.Empty(); actualValue != true {
|
|
t.Errorf("Got %v expected %v", actualValue, true)
|
|
}
|
|
stack.Push(1)
|
|
stack.Push(2)
|
|
stack.Push(3)
|
|
|
|
if actualValue := stack.Values(); actualValue[0].(int) != 3 || actualValue[1].(int) != 2 || actualValue[2].(int) != 1 {
|
|
t.Errorf("Got %v expected %v", actualValue, "[3,2,1]")
|
|
}
|
|
if actualValue := stack.Empty(); actualValue != false {
|
|
t.Errorf("Got %v expected %v", actualValue, false)
|
|
}
|
|
if actualValue := stack.Size(); actualValue != 3 {
|
|
t.Errorf("Got %v expected %v", actualValue, 3)
|
|
}
|
|
if actualValue, ok := stack.Peek(); actualValue != 3 || !ok {
|
|
t.Errorf("Got %v expected %v", actualValue, 3)
|
|
}
|
|
}
|
|
|
|
func TestStackPeek(t *testing.T) {
|
|
stack := New()
|
|
if actualValue, ok := stack.Peek(); actualValue != nil || ok {
|
|
t.Errorf("Got %v expected %v", actualValue, nil)
|
|
}
|
|
stack.Push(1)
|
|
stack.Push(2)
|
|
stack.Push(3)
|
|
if actualValue, ok := stack.Peek(); actualValue != 3 || !ok {
|
|
t.Errorf("Got %v expected %v", actualValue, 3)
|
|
}
|
|
}
|
|
|
|
func TestStackPop(t *testing.T) {
|
|
stack := New()
|
|
stack.Push(1)
|
|
stack.Push(2)
|
|
stack.Push(3)
|
|
stack.Pop()
|
|
if actualValue, ok := stack.Peek(); actualValue != 2 || !ok {
|
|
t.Errorf("Got %v expected %v", actualValue, 2)
|
|
}
|
|
if actualValue, ok := stack.Pop(); actualValue != 2 || !ok {
|
|
t.Errorf("Got %v expected %v", actualValue, 2)
|
|
}
|
|
if actualValue, ok := stack.Pop(); actualValue != 1 || !ok {
|
|
t.Errorf("Got %v expected %v", actualValue, 1)
|
|
}
|
|
if actualValue, ok := stack.Pop(); actualValue != nil || ok {
|
|
t.Errorf("Got %v expected %v", actualValue, nil)
|
|
}
|
|
if actualValue := stack.Empty(); actualValue != true {
|
|
t.Errorf("Got %v expected %v", actualValue, true)
|
|
}
|
|
if actualValue := stack.Values(); len(actualValue) != 0 {
|
|
t.Errorf("Got %v expected %v", actualValue, "[]")
|
|
}
|
|
}
|
|
|
|
func TestStackIteratorOnEmpty(t *testing.T) {
|
|
stack := New()
|
|
it := stack.Iterator()
|
|
for it.Next() {
|
|
t.Errorf("Shouldn't iterate on empty stack")
|
|
}
|
|
}
|
|
|
|
func TestStackIteratorNext(t *testing.T) {
|
|
stack := New()
|
|
stack.Push("a")
|
|
stack.Push("b")
|
|
stack.Push("c")
|
|
|
|
it := stack.Iterator()
|
|
count := 0
|
|
for it.Next() {
|
|
count++
|
|
index := it.Index()
|
|
value := it.Value()
|
|
switch index {
|
|
case 0:
|
|
if actualValue, expectedValue := value, "c"; actualValue != expectedValue {
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
}
|
|
case 1:
|
|
if actualValue, expectedValue := value, "b"; actualValue != expectedValue {
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
}
|
|
case 2:
|
|
if actualValue, expectedValue := value, "a"; actualValue != expectedValue {
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
}
|
|
default:
|
|
t.Errorf("Too many")
|
|
}
|
|
if actualValue, expectedValue := index, count-1; actualValue != expectedValue {
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
}
|
|
}
|
|
if actualValue, expectedValue := count, 3; actualValue != expectedValue {
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
}
|
|
}
|
|
|
|
func TestStackIteratorPrev(t *testing.T) {
|
|
stack := New()
|
|
stack.Push("a")
|
|
stack.Push("b")
|
|
stack.Push("c")
|
|
|
|
it := stack.Iterator()
|
|
for it.Next() {
|
|
}
|
|
count := 0
|
|
for it.Prev() {
|
|
count++
|
|
index := it.Index()
|
|
value := it.Value()
|
|
switch index {
|
|
case 0:
|
|
if actualValue, expectedValue := value, "c"; actualValue != expectedValue {
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
}
|
|
case 1:
|
|
if actualValue, expectedValue := value, "b"; actualValue != expectedValue {
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
}
|
|
case 2:
|
|
if actualValue, expectedValue := value, "a"; actualValue != expectedValue {
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
}
|
|
default:
|
|
t.Errorf("Too many")
|
|
}
|
|
if actualValue, expectedValue := index, 3-count; actualValue != expectedValue {
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
}
|
|
}
|
|
if actualValue, expectedValue := count, 3; actualValue != expectedValue {
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
}
|
|
}
|
|
|
|
func TestStackIteratorBegin(t *testing.T) {
|
|
stack := New()
|
|
it := stack.Iterator()
|
|
it.Begin()
|
|
stack.Push("a")
|
|
stack.Push("b")
|
|
stack.Push("c")
|
|
for it.Next() {
|
|
}
|
|
it.Begin()
|
|
it.Next()
|
|
if index, value := it.Index(), it.Value(); index != 0 || value != "c" {
|
|
t.Errorf("Got %v,%v expected %v,%v", index, value, 0, "c")
|
|
}
|
|
}
|
|
|
|
func TestStackIteratorEnd(t *testing.T) {
|
|
stack := New()
|
|
it := stack.Iterator()
|
|
|
|
if index := it.Index(); index != -1 {
|
|
t.Errorf("Got %v expected %v", index, -1)
|
|
}
|
|
|
|
it.End()
|
|
if index := it.Index(); index != 0 {
|
|
t.Errorf("Got %v expected %v", index, 0)
|
|
}
|
|
|
|
stack.Push("a")
|
|
stack.Push("b")
|
|
stack.Push("c")
|
|
it.End()
|
|
if index := it.Index(); index != stack.Size() {
|
|
t.Errorf("Got %v expected %v", index, stack.Size())
|
|
}
|
|
|
|
it.Prev()
|
|
if index, value := it.Index(), it.Value(); index != stack.Size()-1 || value != "a" {
|
|
t.Errorf("Got %v,%v expected %v,%v", index, value, stack.Size()-1, "a")
|
|
}
|
|
}
|
|
|
|
func TestStackIteratorFirst(t *testing.T) {
|
|
stack := New()
|
|
it := stack.Iterator()
|
|
if actualValue, expectedValue := it.First(), false; actualValue != expectedValue {
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
}
|
|
stack.Push("a")
|
|
stack.Push("b")
|
|
stack.Push("c")
|
|
if actualValue, expectedValue := it.First(), true; actualValue != expectedValue {
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
}
|
|
if index, value := it.Index(), it.Value(); index != 0 || value != "c" {
|
|
t.Errorf("Got %v,%v expected %v,%v", index, value, 0, "c")
|
|
}
|
|
}
|
|
|
|
func TestStackIteratorLast(t *testing.T) {
|
|
stack := New()
|
|
it := stack.Iterator()
|
|
if actualValue, expectedValue := it.Last(), false; actualValue != expectedValue {
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
}
|
|
stack.Push("a")
|
|
stack.Push("b")
|
|
stack.Push("c")
|
|
if actualValue, expectedValue := it.Last(), true; actualValue != expectedValue {
|
|
t.Errorf("Got %v expected %v", actualValue, expectedValue)
|
|
}
|
|
if index, value := it.Index(), it.Value(); index != 2 || value != "a" {
|
|
t.Errorf("Got %v,%v expected %v,%v", index, value, 2, "a")
|
|
}
|
|
}
|
|
|
|
func benchmarkPush(b *testing.B, stack *Stack, size int) {
|
|
for i := 0; i < b.N; i++ {
|
|
for n := 0; n < size; n++ {
|
|
stack.Push(n)
|
|
}
|
|
}
|
|
}
|
|
|
|
func benchmarkPop(b *testing.B, stack *Stack, size int) {
|
|
for i := 0; i < b.N; i++ {
|
|
for n := 0; n < size; n++ {
|
|
stack.Pop()
|
|
}
|
|
}
|
|
}
|
|
|
|
func BenchmarkArrayStackPop100(b *testing.B) {
|
|
b.StopTimer()
|
|
size := 100
|
|
stack := New()
|
|
for n := 0; n < size; n++ {
|
|
stack.Push(n)
|
|
}
|
|
b.StartTimer()
|
|
benchmarkPop(b, stack, size)
|
|
}
|
|
|
|
func BenchmarkArrayStackPop1000(b *testing.B) {
|
|
b.StopTimer()
|
|
size := 1000
|
|
stack := New()
|
|
for n := 0; n < size; n++ {
|
|
stack.Push(n)
|
|
}
|
|
b.StartTimer()
|
|
benchmarkPop(b, stack, size)
|
|
}
|
|
|
|
func BenchmarkArrayStackPop10000(b *testing.B) {
|
|
b.StopTimer()
|
|
size := 10000
|
|
stack := New()
|
|
for n := 0; n < size; n++ {
|
|
stack.Push(n)
|
|
}
|
|
b.StartTimer()
|
|
benchmarkPop(b, stack, size)
|
|
}
|
|
|
|
func BenchmarkArrayStackPop100000(b *testing.B) {
|
|
b.StopTimer()
|
|
size := 100000
|
|
stack := New()
|
|
for n := 0; n < size; n++ {
|
|
stack.Push(n)
|
|
}
|
|
b.StartTimer()
|
|
benchmarkPop(b, stack, size)
|
|
}
|
|
|
|
func BenchmarkArrayStackPush100(b *testing.B) {
|
|
b.StopTimer()
|
|
size := 100
|
|
stack := New()
|
|
b.StartTimer()
|
|
benchmarkPush(b, stack, size)
|
|
}
|
|
|
|
func BenchmarkArrayStackPush1000(b *testing.B) {
|
|
b.StopTimer()
|
|
size := 1000
|
|
stack := New()
|
|
for n := 0; n < size; n++ {
|
|
stack.Push(n)
|
|
}
|
|
b.StartTimer()
|
|
benchmarkPush(b, stack, size)
|
|
}
|
|
|
|
func BenchmarkArrayStackPush10000(b *testing.B) {
|
|
b.StopTimer()
|
|
size := 10000
|
|
stack := New()
|
|
for n := 0; n < size; n++ {
|
|
stack.Push(n)
|
|
}
|
|
b.StartTimer()
|
|
benchmarkPush(b, stack, size)
|
|
}
|
|
|
|
func BenchmarkArrayStackPush100000(b *testing.B) {
|
|
b.StopTimer()
|
|
size := 100000
|
|
stack := New()
|
|
for n := 0; n < size; n++ {
|
|
stack.Push(n)
|
|
}
|
|
b.StartTimer()
|
|
benchmarkPush(b, stack, size)
|
|
}
|