39 lines
504 B
Go
39 lines
504 B
Go
|
package crushmap
|
||
|
|
|
||
|
|
type runeNode struct {
|
||
|
|
r rune
|
||
|
|
next *runeNode
|
||
|
|
}
|
||
|
|
|
||
|
|
type runeStack struct {
|
||
|
|
start *runeNode
|
||
|
|
}
|
||
|
|
|
||
|
|
func newRuneStack() runeStack {
|
||
|
|
return runeStack{}
|
||
|
|
}
|
||
|
|
|
||
|
|
func (s *runeStack) push(r rune) {
|
||
|
|
node := &runeNode{r: r}
|
||
|
|
if s.start == nil {
|
||
|
|
s.start = node
|
||
|
|
} else {
|
||
|
|
node.next = s.start
|
||
|
|
s.start = node
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
func (s *runeStack) pop() rune {
|
||
|
|
if s.start == nil {
|
||
|
|
return EOFRune
|
||
|
|
} else {
|
||
|
|
n := s.start
|
||
|
|
s.start = n.next
|
||
|
|
return n.r
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
func (s *runeStack) clear() {
|
||
|
|
s.start = nil
|
||
|
|
}
|