52 lines
774 B
Go
52 lines
774 B
Go
package jsn
|
|
|
|
type skipInfo struct {
|
|
ss, se int
|
|
}
|
|
|
|
type Stack struct {
|
|
stA [20]skipInfo
|
|
st []skipInfo
|
|
top int
|
|
}
|
|
|
|
// Create a new Stack
|
|
func NewStack() *Stack {
|
|
s := &Stack{top: -1}
|
|
s.st = s.stA[:0]
|
|
return s
|
|
}
|
|
|
|
// Return the number of items in the Stack
|
|
func (s *Stack) Len() int {
|
|
return (s.top + 1)
|
|
}
|
|
|
|
// View the top item on the Stack
|
|
func (s *Stack) Peek() *skipInfo {
|
|
if s.top == -1 {
|
|
return nil
|
|
}
|
|
return &s.st[s.top]
|
|
}
|
|
|
|
// Pop the top item of the Stack and return it
|
|
func (s *Stack) Pop() *skipInfo {
|
|
if s.top == -1 {
|
|
return nil
|
|
}
|
|
|
|
s.top--
|
|
return &s.st[(s.top + 1)]
|
|
}
|
|
|
|
// Push a value onto the top of the Stack
|
|
func (s *Stack) Push(value skipInfo) {
|
|
s.top++
|
|
if len(s.st) <= s.top {
|
|
s.st = append(s.st, value)
|
|
} else {
|
|
s.st[s.top] = value
|
|
}
|
|
}
|