mirror of
https://github.com/emirpasic/gods.git
synced 2026-06-15 16:16:35 +03:00
array stack (with tests and benchmarks - kinda slow in comparison to the linked list stack)
This commit is contained in:
@@ -0,0 +1,88 @@
|
||||
/*
|
||||
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 arraystack
|
||||
|
||||
import (
|
||||
"testing"
|
||||
)
|
||||
|
||||
func TestArrayStack(t *testing.T) {
|
||||
|
||||
stack := New()
|
||||
|
||||
if actualValue := stack.Empty(); actualValue != true {
|
||||
t.Errorf("Got %v expected %v", actualValue, true)
|
||||
}
|
||||
|
||||
// insertions
|
||||
stack.Push(1)
|
||||
stack.Push(2)
|
||||
stack.Push(3)
|
||||
|
||||
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)
|
||||
}
|
||||
|
||||
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)
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
func BenchmarkArrayStack(b *testing.B) {
|
||||
// Slow in comparison to the LinkedListStack
|
||||
// BenchmarkArrayStack 50 31760994 ns/op 8540863 B/op 2010 allocs/op
|
||||
// BenchmarkLinkedListStack 5000 390812 ns/op 40016 B/op 2001 allocs/op
|
||||
for i := 0; i < b.N; i++ {
|
||||
stack := New()
|
||||
for n := 0; n < 1000; n++ {
|
||||
stack.Push(i)
|
||||
}
|
||||
for !stack.Empty() {
|
||||
stack.Pop()
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
Reference in New Issue
Block a user