algorithms/data-structures/stack/stack.go at master · arnauddri/algorithms · GitHub

History

57 lines (43 loc) · 792 Bytes

Raw

package stack

import "sync"

type Stack struct {

stack []interface{}

len int

lock sync.Mutex

}

func New() *Stack {

s := &Stack{}

s.stack = make([]interface{}, 0)

s.len = 0

return s

}

func (s *Stack) Len() int {

s.lock.Lock()

defer s.lock.Unlock()

return s.len

}

func (s *Stack) isEmpty() bool {

s.lock.Lock()

defer s.lock.Unlock()

return s.len == 0

}

func (s *Stack) Pop() (el interface{}) {

s.lock.Lock()

defer s.lock.Unlock()

el, s.stack = s.stack[0], s.stack[1:]

s.len--

return

}

func (s *Stack) Push(el interface{}) {

s.lock.Lock()

defer s.lock.Unlock()

prepend := make([]interface{}, 1)

prepend[0] = el

s.stack = append(prepend, s.stack...)

s.len++

}

func (s *Stack) Peek() interface{} {

s.lock.Lock()

defer s.lock.Unlock()

return s.stack[0]

}

algorithms/data-structures/stack/stack.go at master · arnauddri/algorithms · GitHub

Expand file tree

Breadcrumbs

stack.go

Latest commit

History

Breadcrumbs

stack.go

File metadata and controls