mirror of
https://github.com/emirpasic/gods
synced 2024-11-18 09:25:50 +00:00
101 lines
2.9 KiB
Go
101 lines
2.9 KiB
Go
/*
|
|
Copyright (c) 2015, Emir Pasic
|
|
All rights reserved.
|
|
|
|
Redistribution and use in source and binary forms, with or without
|
|
modification, are permitted provided that the following conditions are met:
|
|
|
|
* Redistributions of source code must retain the above copyright notice, this
|
|
list of conditions and the following disclaimer.
|
|
|
|
* Redistributions in binary form must reproduce the above copyright notice,
|
|
this list of conditions and the following disclaimer in the documentation
|
|
and/or other materials provided with the distribution.
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
|
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
|
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
package linkedliststack
|
|
|
|
import (
|
|
"testing"
|
|
)
|
|
|
|
func TestLinkedListStack(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.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)
|
|
}
|
|
|
|
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 BenchmarkLinkedListStack(b *testing.B) {
|
|
for i := 0; i < b.N; i++ {
|
|
stack := New()
|
|
for n := 0; n < 1000; n++ {
|
|
stack.Push(i)
|
|
}
|
|
for !stack.Empty() {
|
|
stack.Pop()
|
|
}
|
|
}
|
|
}
|