-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmem_test.go
114 lines (93 loc) · 2.03 KB
/
mem_test.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
// Copyright 2022 Mark Mandriota
//
// Licensed under the Apache License, Version 2.0 (the "License"): you may
// not use this file except in compliance with the License. You may obtain
// a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
// License for the specific language governing permissions and limitations
// under the License.
package impvm
import (
"testing"
)
func TestStack(t *testing.T) {
stack := new(Stack)
stack.Reset()
stack.AddHead(13)
t.Log(stack.PopHead())
t.Log(stack.PopHead())
}
func BenchmarkAddHead(b *testing.B) {
stack := new(Stack)
stack.Reset()
for i := 0; i < b.N; i++ {
stack.AddHead(13)
}
}
func BenchmarkAddTail(b *testing.B) {
stack := new(Stack)
stack.Reset()
for i := 0; i < b.N; i++ {
stack.AddTail(13)
}
}
func BenchmarkPopHead(b *testing.B) {
stack := new(Stack)
stack.Reset()
for i := 0; i < b.N; i++ {
stack.PopHead()
}
}
func BenchmarkPopTail(b *testing.B) {
stack := new(Stack)
stack.Reset()
for i := 0; i < b.N; i++ {
stack.PopTail()
}
}
func BenchmarkAddHeadPopHead(b *testing.B) {
stack := new(Stack)
stack.Reset()
for i := 0; i < b.N; i++ {
stack.AddHead(13)
stack.PopHead()
}
}
func BenchmarkAddHeadPopTail(b *testing.B) {
stack := new(Stack)
stack.Reset()
for i := 0; i < b.N; i++ {
stack.AddHead(13)
stack.PopTail()
}
}
func BenchmarkAddTailPopHead(b *testing.B) {
stack := new(Stack)
stack.Reset()
for i := 0; i < b.N; i++ {
stack.AddTail(13)
stack.PopHead()
}
}
func BenchmarkAddTailPopTail(b *testing.B) {
stack := new(Stack)
stack.Reset()
for i := 0; i < b.N; i++ {
stack.AddTail(13)
stack.PopTail()
}
}
func BenchmarkPopHeadAddHeadAddHead(b *testing.B) {
stack := new(Stack)
stack.Reset()
for i := 0; i < b.N; i++ {
el := stack.PopHead()
stack.AddHead(el)
stack.AddHead(el)
}
}