dsalg

Documentation

Index

• func Float64Less(a, b interface{}) bool
• func IntLess(a, b interface{}) bool
• func SlidingWindowMaxDiff(values []int, w int) []int
• func SlidingWindowMaximum(values []int, w int) []int
• func SlidingWindowMinimum(values []int, w int) []int
• func SlidingWindowSum(values []int, w int) []int
• func StringLess(a, b interface{}) bool
• type ArrayDeque
  • func NewArrayDeque(size int) *ArrayDeque
  • func (q *ArrayDeque) Back() int
  • func (q *ArrayDeque) BackValue() interface{}
  • func (q *ArrayDeque) Cap() int
  • func (q *ArrayDeque) Front() int
  • func (q *ArrayDeque) FrontValue() interface{}
  • func (q *ArrayDeque) IsEmpty() bool
  • func (q *ArrayDeque) IsFull() bool
  • func (q *ArrayDeque) Len() int
  • func (q *ArrayDeque) PopBack() interface{}
  • func (q *ArrayDeque) PopFront() interface{}
  • func (q *ArrayDeque) PushBack(v interface{}) int
  • func (q *ArrayDeque) PushBackValue(v interface{})
  • func (q *ArrayDeque) PushFront(v interface{}) int
  • func (q *ArrayDeque) PushFrontValue(v interface{})
  • func (q *ArrayDeque) Reverse()
  • func (q *ArrayDeque) String() string
• type BinaryTreeNode
  • func (node *BinaryTreeNode) LeftChild() *BinaryTreeNode
  • func (node *BinaryTreeNode) RightChild() *BinaryTreeNode
  • func (node *BinaryTreeNode) Value() interface{}
• type Deque
• type DequeNode
• type LinkedDeque
  • func NewLinkedDeque() *LinkedDeque
  • func (q *LinkedDeque) Back() *DequeNode
  • func (q *LinkedDeque) BackValue() interface{}
  • func (q *LinkedDeque) Cap() int
  • func (q *LinkedDeque) Front() *DequeNode
  • func (q *LinkedDeque) FrontValue() interface{}
  • func (q *LinkedDeque) IsEmpty() bool
  • func (q *LinkedDeque) IsFull() bool
  • func (q *LinkedDeque) Len() int
  • func (q *LinkedDeque) PopBack() interface{}
  • func (q *LinkedDeque) PopFront() interface{}
  • func (q *LinkedDeque) PushBack(v interface{}) *DequeNode
  • func (q *LinkedDeque) PushBackValue(v interface{})
  • func (q *LinkedDeque) PushFront(v interface{}) *DequeNode
  • func (q *LinkedDeque) PushFrontValue(v interface{})
  • func (q *LinkedDeque) Reverse()
  • func (q *LinkedDeque) String() string

Functions

func Float64Less

func Float64Less(a, b interface{}) bool

Reference: sort.Float64Slice.Less

func IntLess

func IntLess(a, b interface{}) bool

Reference: sort.IntSlice.Less

func SlidingWindowMaxDiff

func SlidingWindowMaxDiff(values []int, w int) []int

Time Complexity: O(n) Space Complexity: O(n)

func SlidingWindowMaximum

func SlidingWindowMaximum(values []int, w int) []int

Time Complexity: O(n) Space Complexity: O(n) Reference: http://articles.leetcode.com/sliding-window-maximum/

func SlidingWindowMinimum

func SlidingWindowMinimum(values []int, w int) []int

Time Complexity: O(n) Space Complexity: O(n)

func SlidingWindowSum

func SlidingWindowSum(values []int, w int) []int

Time Complexity: O(n) Space Complexity: O(n)

func StringLess

func StringLess(a, b interface{}) bool

Reference: sort.StringSlice.Less

Types

type ArrayDeque

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

func NewArrayDeque

func NewArrayDeque(size int) *ArrayDeque

func (*ArrayDeque) Back

func (q *ArrayDeque) Back() int

func (*ArrayDeque) BackValue

func (q *ArrayDeque) BackValue() interface{}

func (*ArrayDeque) Cap

func (q *ArrayDeque) Cap() int

func (*ArrayDeque) Front

func (q *ArrayDeque) Front() int

func (*ArrayDeque) FrontValue

func (q *ArrayDeque) FrontValue() interface{}

func (*ArrayDeque) IsEmpty

func (q *ArrayDeque) IsEmpty() bool

func (*ArrayDeque) IsFull

func (q *ArrayDeque) IsFull() bool

func (*ArrayDeque) Len

func (q *ArrayDeque) Len() int

func (*ArrayDeque) PopBack

func (q *ArrayDeque) PopBack() interface{}

func (*ArrayDeque) PopFront

func (q *ArrayDeque) PopFront() interface{}

func (*ArrayDeque) PushBack

func (q *ArrayDeque) PushBack(v interface{}) int

func (*ArrayDeque) PushBackValue

func (q *ArrayDeque) PushBackValue(v interface{})

func (*ArrayDeque) PushFront

func (q *ArrayDeque) PushFront(v interface{}) int

func (*ArrayDeque) PushFrontValue

func (q *ArrayDeque) PushFrontValue(v interface{})

func (*ArrayDeque) Reverse

func (q *ArrayDeque) Reverse()

func (*ArrayDeque) String

func (q *ArrayDeque) String() string

type BinaryTreeNode

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

BinaryTreeNode is a node of a binary tree.

func (*BinaryTreeNode) LeftChild

func (node *BinaryTreeNode) LeftChild() *BinaryTreeNode

LeftChild returns the left child of this node or nil.

func (*BinaryTreeNode) RightChild

func (node *BinaryTreeNode) RightChild() *BinaryTreeNode

RightChild returns the right child of this node or nil.

func (*BinaryTreeNode) Value

func (node *BinaryTreeNode) Value() interface{}

Value returns the value stored with this node.

type Deque

type Deque interface {
	BackValue() interface{}
	FrontValue() interface{}
	PushBackValue(v interface{})
	PushFrontValue(v interface{})
	PopBack() interface{}
	PopFront() interface{}
	Reverse()
	Len() int
	Cap() int
	IsEmpty() bool
	IsFull() bool
	String() string
}

type DequeNode

type DequeNode struct {
	Value interface{}
	// contains filtered or unexported fields
}

type LinkedDeque

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

func NewLinkedDeque

func NewLinkedDeque() *LinkedDeque

func (*LinkedDeque) Back

func (q *LinkedDeque) Back() *DequeNode

func (*LinkedDeque) BackValue

func (q *LinkedDeque) BackValue() interface{}

func (*LinkedDeque) Cap

func (q *LinkedDeque) Cap() int

func (*LinkedDeque) Front

func (q *LinkedDeque) Front() *DequeNode

func (*LinkedDeque) FrontValue

func (q *LinkedDeque) FrontValue() interface{}

func (*LinkedDeque) IsEmpty

func (q *LinkedDeque) IsEmpty() bool

func (*LinkedDeque) IsFull

func (q *LinkedDeque) IsFull() bool

func (*LinkedDeque) Len

func (q *LinkedDeque) Len() int

func (*LinkedDeque) PopBack

func (q *LinkedDeque) PopBack() interface{}

func (*LinkedDeque) PopFront

func (q *LinkedDeque) PopFront() interface{}

func (*LinkedDeque) PushBack

func (q *LinkedDeque) PushBack(v interface{}) *DequeNode

func (*LinkedDeque) PushBackValue

func (q *LinkedDeque) PushBackValue(v interface{})

func (*LinkedDeque) PushFront

func (q *LinkedDeque) PushFront(v interface{}) *DequeNode

func (*LinkedDeque) PushFrontValue

func (q *LinkedDeque) PushFrontValue(v interface{})

func (*LinkedDeque) Reverse

func (q *LinkedDeque) Reverse()

func (*LinkedDeque) String

func (q *LinkedDeque) String() string