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
|
package gojq
type stack struct {
data []block
index int
limit int
}
type block struct {
value any
next int
}
func newStack() *stack {
return &stack{index: -1, limit: -1}
}
func (s *stack) push(v any) {
b := block{v, s.index}
i := s.index + 1
if i <= s.limit {
i = s.limit + 1
}
s.index = i
if i < len(s.data) {
s.data[i] = b
} else {
s.data = append(s.data, b)
}
}
func (s *stack) pop() any {
b := s.data[s.index]
s.index = b.next
return b.value
}
func (s *stack) top() any {
return s.data[s.index].value
}
func (s *stack) empty() bool {
return s.index < 0
}
func (s *stack) save() (index, limit int) {
index, limit = s.index, s.limit
if s.index > s.limit {
s.limit = s.index
}
return
}
func (s *stack) restore(index, limit int) {
s.index, s.limit = index, limit
}
|
