Stacks

A stack that represents a last-in-first-out (LIFO) data structure. The usual push and pop operations are provided, as well as a method to peek at the top item on the stack.

Implements Container interface.

type Stack interface {
    Push(value interface{})
    Pop() (value interface{}, ok bool)
    Peek() (value interface{}, ok bool)
    containers.Container
    // Empty() bool
    // Size() int
    // Clear()
    // Values() []interface{}
}

LinkedListStack

A stack based on a linked list.

Implements Stack, IteratorWithIndex, JSONSerializer and JSONDeserializer interfaces.

package main
import lls "github.com/emirpasic/gods/stacks/linkedliststack"
func main() {
    stack := lls.New()  // empty
    stack.Push(1)       // 1
    stack.Push(2)       // 1, 2
    stack.Values()      // 2, 1 (LIFO order)
    _, _ = stack.Peek() // 2,true
    _, _ = stack.Pop()  // 2, true
    _, _ = stack.Pop()  // 1, true
    _, _ = stack.Pop()  // nil, false (nothing to pop)
    stack.Push(1)       // 1
    stack.Clear()       // empty
    stack.Empty()       // true
    stack.Size()        // 0
}

ArrayStack

A stack based on a array list.

Implements Stack, IteratorWithIndex, JSONSerializer and JSONDeserializer interfaces.

package main
import "github.com/emirpasic/gods/stacks/arraystack"
func main() {
    stack := arraystack.New() // empty
    stack.Push(1)             // 1
    stack.Push(2)             // 1, 2
    stack.Values()            // 2, 1 (LIFO order)
    _, _ = stack.Peek()       // 2,true
    _, _ = stack.Pop()        // 2, true
    _, _ = stack.Pop()        // 1, true
    _, _ = stack.Pop()        // nil, false (nothing to pop)
    stack.Push(1)             // 1
    stack.Clear()             // empty
    stack.Empty()             // true
    stack.Size()              // 0
}