algorithms/data-structure/stack/stack.go at master · TTWShell/algorithms · GitHub

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 stack

import "sync"

type Stack struct {
	stack []interface{}
	len   int
	sync.RWMutex
}

func Constructor() *Stack {
	s := &Stack{}
	s.stack = make([]interface{}, 0)
	s.len = 0

	return s
}

func (s *Stack) Len() int {
	s.RLock()
	defer s.RUnlock()

	return s.len
}

func (s *Stack) IsEmpty() bool {
	s.RLock()
	defer s.RUnlock()

	return s.len == 0
}

func (s *Stack) Pop() (element interface{}) {
	s.Lock()
	defer s.Unlock()

	element = s.stack[s.len-1]
	s.stack = s.stack[:s.len-1]
	s.len--
	return
}

func (s *Stack) Push(element interface{}) {
	s.Lock()
	defer s.Unlock()

	s.stack = append(s.stack, element)
	s.len++
}

func (s *Stack) Top() interface{} {
	s.RLock()
	defer s.RUnlock()

	return s.stack[s.len-1]
}