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
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
|
// Tideland Go Library - Collections - Stacks
//
// Copyright (C) 2015 Frank Mueller / Tideland / Oldenburg / Germany
//
// All rights reserved. Use of this source code is governed
// by the new BSD license.
package collections
//--------------------
// IMPORTS
//--------------------
import (
"fmt"
"github.com/tideland/golib/errors"
)
//--------------------
// STACK
//--------------------
// stack implements the Stack interface.
type stack struct {
values []interface{}
}
// NewStack creates a stack with the passed values
// as initial content.
func NewStack(vs ...interface{}) Stack {
return &stack{
values: vs,
}
}
// Push implements the Stack interface.
func (s *stack) Push(vs ...interface{}) {
s.values = append(s.values, vs...)
}
// Pop implements the Stack interface.
func (s *stack) Pop() (interface{}, error) {
lv := len(s.values)
if lv == 0 {
return nil, errors.New(ErrEmpty, errorMessages)
}
v := s.values[lv-1]
s.values = s.values[:lv-1]
return v, nil
}
// Peek implements the Stack interface.
func (s stack) Peek() (interface{}, error) {
lv := len(s.values)
if lv == 0 {
return nil, errors.New(ErrEmpty, errorMessages)
}
v := s.values[lv-1]
return v, nil
}
// All implements the Stack interface.
func (s *stack) All() []interface{} {
sl := len(s.values)
all := make([]interface{}, sl)
copy(all, s.values)
return all
}
// AllReverse implements the Stack interface.
func (s *stack) AllReverse() []interface{} {
sl := len(s.values)
all := make([]interface{}, sl)
for i, value := range s.values {
all[sl-1-i] = value
}
return all
}
// Len implements the Stack interface.
func (s *stack) Len() int {
return len(s.values)
}
// Deflate implements the Stack interface.
func (s *stack) Deflate() {
s.values = []interface{}{}
}
// Deflate implements the Stringer interface.
func (s *stack) String() string {
return fmt.Sprintf("%v", s.values)
}
//--------------------
// STRING STACK
//--------------------
// stringStack implements the StringStack interface.
type stringStack struct {
values []string
}
// NewStringStack creates a string stack with the passed values
// as initial content.
func NewStringStack(vs ...string) StringStack {
return &stringStack{
values: vs,
}
}
// Push implements the StringStack interface.
func (s *stringStack) Push(vs ...string) {
s.values = append(s.values, vs...)
}
// Pop implements the StringStack interface.
func (s *stringStack) Pop() (string, error) {
lv := len(s.values)
if lv == 0 {
return "", errors.New(ErrEmpty, errorMessages)
}
v := s.values[lv-1]
s.values = s.values[:lv-1]
return v, nil
}
// Peek implements the StringStack interface.
func (s *stringStack) Peek() (string, error) {
lv := len(s.values)
if lv == 0 {
return "", errors.New(ErrEmpty, errorMessages)
}
v := s.values[lv-1]
return v, nil
}
// All implements the StringStack interface.
func (s *stringStack) All() []string {
sl := len(s.values)
all := make([]string, sl)
copy(all, s.values)
return all
}
// AllReverse implements the StringStack interface.
func (s *stringStack) AllReverse() []string {
sl := len(s.values)
all := make([]string, sl)
for i, value := range s.values {
all[sl-1-i] = value
}
return all
}
// Len implements the Base interface.
func (s *stringStack) Len() int {
return len(s.values)
}
// Deflate implements the Base interface.
func (s *stringStack) Deflate() {
s.values = []string{}
}
// Deflate implements the Stringer interface.
func (s *stringStack) String() string {
return fmt.Sprintf("%v", s.values)
}
// EOF
|
