cyds

README

cyds

a data structures lib for go

Documentation

Index

• func BinarySearch(slice []interface{}, condition func(i int) bool) int
• type Elem
• type Node
  • func NewNode() Node
• type Queue
  • func (list *Queue) Empty() bool
  • func (q *Queue) Front() Elem
  • func (q *Queue) Pop() Elem
  • func (list *Queue) Push(v Elem)
  • func (list *Queue) Size() int
• type Sizet
• type Stack
  • func (list *Stack) Empty() bool
  • func (q *Stack) Pop() Elem
  • func (list *Stack) Push(v Elem)
  • func (list *Stack) Size() int
  • func (q *Stack) Top() Elem
• type Trie
  • func (t *Trie) Insert(str string, val interface{})
  • func (t *Trie) Match(str string) (*Node, bool)

Functions

func BinarySearch

func BinarySearch(slice []interface{}, condition func(i int) bool) int

Types

type Elem

type Elem interface{}

type Node

type Node struct {
	Values []interface{}
	// contains filtered or unexported fields
}

Node

func NewNode

func NewNode() Node

type Queue

type Queue struct {
	// contains filtered or unexported fields
}

func (*Queue) Empty

func (list *Queue) Empty() bool

func (*Queue) Front

func (q *Queue) Front() Elem

func (*Queue) Pop

func (q *Queue) Pop() Elem

func (*Queue) Push

func (list *Queue) Push(v Elem)

func (*Queue) Size

func (list *Queue) Size() int

type Sizet

type Sizet = int

type Stack

type Stack struct {
	// contains filtered or unexported fields
}

func (*Stack) Empty

func (list *Stack) Empty() bool

func (*Stack) Pop

func (q *Stack) Pop() Elem

func (*Stack) Push

func (list *Stack) Push(v Elem)

func (*Stack) Size

func (list *Stack) Size() int

func (*Stack) Top

func (q *Stack) Top() Elem

type Trie

type Trie struct {
	Nodes []Node
}

func (*Trie) Insert

func (t *Trie) Insert(str string, val interface{})

func (*Trie) Match

func (t *Trie) Match(str string) (*Node, bool)