/
stack.go
54 lines (41 loc) · 888 Bytes
/
stack.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
package data
import (
"fmt"
"github.com/thoas/go-funk"
)
type Stack[V any] struct {
Items []V
}
func NewStack[V any]() *Stack[V] {
return &Stack[V]{Items: []V{}}
}
func (s *Stack[V]) Add(item V) *Stack[V] {
s.Items = append(s.Items, item)
return s
}
func (s *Stack[V]) AddItems(items []V) *Stack[V] {
s.Items = append(s.Items, items...)
return s
}
func (s *Stack[V]) RemoveItems(count int, reverse bool) []V {
if count > len(s.Items) {
return nil
}
removed := s.Items[len(s.Items)-count:]
updated := s.Items[0 : len(s.Items)-count]
s.Items = updated
if reverse {
return funk.Reverse(removed).([]V)
}
return removed
}
func (s *Stack[V]) ReverseItems() *Stack[V] {
s.Items = funk.Reverse(s.Items).([]V)
return s
}
func (s *Stack[V]) LastItem() V {
return s.Items[len(s.Items)-1]
}
func (s *Stack[V]) Print() string {
return fmt.Sprintf("%v", s.Items)
}