xbctnr

Documentation

Index

• type Deap
  • func (deap *Deap[T]) Clear()
  • func (deap *Deap[T]) Iterator() *DeapIterator[T]
  • func (deap *Deap[T]) PeekMax() (T, bool)
  • func (deap *Deap[T]) PeekMin() (T, bool)
  • func (deap *Deap[T]) PullMax() (T, bool)
  • func (deap *Deap[T]) PullMin() (T, bool)
  • func (deap *Deap[T]) Push(value T)
  • func (deap *Deap[T]) Sequence() iter.Seq2[int, T]
  • func (deap *Deap[T]) Size() int
  • func (deap *Deap[T]) Slice() []T
• type DeapIterator
  • func (iterator *DeapIterator[T]) Next() (T, bool)
• type DeapValue
• type Deque
  • func (deque *Deque[T]) Clear()
  • func (deque *Deque[T]) Drop(node *DequeNode[T]) (T, bool)
  • func (deque *Deque[T]) Iterator() *DequeIterator[T]
  • func (deque *Deque[T]) Peek() (T, bool)
  • func (deque *Deque[T]) Poll() (T, bool)
  • func (deque *Deque[T]) Pull() (T, bool)
  • func (deque *Deque[T]) Push(value T)
  • func (deque *Deque[T]) RIterator() *DequeReverseIterator[T]
  • func (deque *Deque[T]) RPeek() (T, bool)
  • func (deque *Deque[T]) RPoll() (T, bool)
  • func (deque *Deque[T]) RPull() (T, bool)
  • func (deque *Deque[T]) RPush(value T)
  • func (deque *Deque[T]) RSequence() iter.Seq[T]
  • func (deque *Deque[T]) RSlice() []T
  • func (deque *Deque[T]) Sequence() iter.Seq[T]
  • func (deque *Deque[T]) Size() int
  • func (deque *Deque[T]) Slice() []T
• type DequeIterator
  • func (iterator *DequeIterator[T]) Drop() (T, bool)
  • func (iterator *DequeIterator[T]) Next() (T, bool)
• type DequeNode
• type DequeReverseIterator
  • func (iterator *DequeReverseIterator[T]) Drop() (T, bool)
  • func (iterator *DequeReverseIterator[T]) Next() (T, bool)
• type Heap
  • func (heap *Heap[T]) Clear()
  • func (heap *Heap[T]) Iterator() *HeapIterator[T]
  • func (heap *Heap[T]) Peek() (T, bool)
  • func (heap *Heap[T]) Pull() (T, bool)
  • func (heap *Heap[T]) Push(value T)
  • func (heap *Heap[T]) Sequence() iter.Seq2[int, T]
  • func (heap *Heap[T]) Size() int
  • func (heap *Heap[T]) Slice() []T
• type HeapIterator
  • func (iterator *HeapIterator[T]) Next() (T, bool)
• type HeapValue
• type Queue
  • func (queue *Queue[T]) Clear()
  • func (queue *Queue[T]) Iterator() *QueueIterator[T]
  • func (queue *Queue[T]) Peek() (T, bool)
  • func (queue *Queue[T]) Poll() (T, bool)
  • func (queue *Queue[T]) Pull() (T, bool)
  • func (queue *Queue[T]) Push(value T)
  • func (queue *Queue[T]) Sequence() iter.Seq[T]
  • func (queue *Queue[T]) Size() int
  • func (queue *Queue[T]) Slice() []T
• type QueueIterator
  • func (iterator *QueueIterator[T]) Next() (T, bool)
• type QueueNode
• type Set
  • func NewSet[T comparable](values ...T) Set[T]
  • func (set Set[T]) Add(value T)
  • func (set Set[T]) Clear()
  • func (set Set[T]) Has(value T) bool
  • func (set Set[T]) Remove(value T)
  • func (set Set[T]) Sequence() iter.Seq[T]
  • func (set Set[T]) Slice() []T

Types

type Deap

type Deap[T DeapValue[T]] struct {
	// contains filtered or unexported fields
}

func (*Deap[T]) Clear

func (deap *Deap[T]) Clear()

func (*Deap[T]) Iterator

func (deap *Deap[T]) Iterator() *DeapIterator[T]

func (*Deap[T]) PeekMax

func (deap *Deap[T]) PeekMax() (T, bool)

func (*Deap[T]) PeekMin

func (deap *Deap[T]) PeekMin() (T, bool)

func (*Deap[T]) PullMax

func (deap *Deap[T]) PullMax() (T, bool)

func (*Deap[T]) PullMin

func (deap *Deap[T]) PullMin() (T, bool)

func (*Deap[T]) Push

func (deap *Deap[T]) Push(value T)

func (*Deap[T]) Sequence

func (deap *Deap[T]) Sequence() iter.Seq2[int, T]

func (*Deap[T]) Size

func (deap *Deap[T]) Size() int

func (*Deap[T]) Slice

func (deap *Deap[T]) Slice() []T

type DeapIterator

type DeapIterator[T DeapValue[T]] struct {
	// contains filtered or unexported fields
}

func (*DeapIterator[T]) Next

func (iterator *DeapIterator[T]) Next() (T, bool)

type DeapValue

type DeapValue[T any] HeapValue[T]

type Deque

type Deque[T any] struct {
	// contains filtered or unexported fields
}

func (*Deque[T]) Clear

func (deque *Deque[T]) Clear()

func (*Deque[T]) Drop

func (deque *Deque[T]) Drop(node *DequeNode[T]) (T, bool)

func (*Deque[T]) Iterator

func (deque *Deque[T]) Iterator() *DequeIterator[T]

func (*Deque[T]) Peek

func (deque *Deque[T]) Peek() (T, bool)

func (*Deque[T]) Poll

func (deque *Deque[T]) Poll() (T, bool)

func (*Deque[T]) Pull

func (deque *Deque[T]) Pull() (T, bool)

func (*Deque[T]) Push

func (deque *Deque[T]) Push(value T)

func (*Deque[T]) RIterator

func (deque *Deque[T]) RIterator() *DequeReverseIterator[T]

func (*Deque[T]) RPeek

func (deque *Deque[T]) RPeek() (T, bool)

func (*Deque[T]) RPoll

func (deque *Deque[T]) RPoll() (T, bool)

func (*Deque[T]) RPull

func (deque *Deque[T]) RPull() (T, bool)

func (*Deque[T]) RPush

func (deque *Deque[T]) RPush(value T)

func (*Deque[T]) RSequence

func (deque *Deque[T]) RSequence() iter.Seq[T]

func (*Deque[T]) RSlice

func (deque *Deque[T]) RSlice() []T

func (*Deque[T]) Sequence

func (deque *Deque[T]) Sequence() iter.Seq[T]

func (*Deque[T]) Size

func (deque *Deque[T]) Size() int

func (*Deque[T]) Slice

func (deque *Deque[T]) Slice() []T

type DequeIterator

type DequeIterator[T any] struct {
	// contains filtered or unexported fields
}

func (*DequeIterator[T]) Drop

func (iterator *DequeIterator[T]) Drop() (T, bool)

func (*DequeIterator[T]) Next

func (iterator *DequeIterator[T]) Next() (T, bool)

type DequeNode

type DequeNode[T any] struct {
	// contains filtered or unexported fields
}

type DequeReverseIterator

type DequeReverseIterator[T any] struct {
	// contains filtered or unexported fields
}

func (*DequeReverseIterator[T]) Drop

func (iterator *DequeReverseIterator[T]) Drop() (T, bool)

func (*DequeReverseIterator[T]) Next

func (iterator *DequeReverseIterator[T]) Next() (T, bool)

type Heap

type Heap[T HeapValue[T]] struct {
	// contains filtered or unexported fields
}

func (*Heap[T]) Clear

func (heap *Heap[T]) Clear()

func (*Heap[T]) Iterator

func (heap *Heap[T]) Iterator() *HeapIterator[T]

func (*Heap[T]) Peek

func (heap *Heap[T]) Peek() (T, bool)

func (*Heap[T]) Pull

func (heap *Heap[T]) Pull() (T, bool)

func (*Heap[T]) Push

func (heap *Heap[T]) Push(value T)

func (*Heap[T]) Sequence

func (heap *Heap[T]) Sequence() iter.Seq2[int, T]

func (*Heap[T]) Size

func (heap *Heap[T]) Size() int

func (*Heap[T]) Slice

func (heap *Heap[T]) Slice() []T

type HeapIterator

type HeapIterator[T HeapValue[T]] struct {
	// contains filtered or unexported fields
}

func (*HeapIterator[T]) Next

func (iterator *HeapIterator[T]) Next() (T, bool)

type HeapValue

type HeapValue[T any] xbtype.Comparable[T]

type Queue

type Queue[T any] struct {
	// contains filtered or unexported fields
}

func (*Queue[T]) Clear

func (queue *Queue[T]) Clear()

func (*Queue[T]) Iterator

func (queue *Queue[T]) Iterator() *QueueIterator[T]

func (*Queue[T]) Peek

func (queue *Queue[T]) Peek() (T, bool)

func (*Queue[T]) Poll

func (queue *Queue[T]) Poll() (T, bool)

func (*Queue[T]) Pull

func (queue *Queue[T]) Pull() (T, bool)

func (*Queue[T]) Push

func (queue *Queue[T]) Push(value T)

func (*Queue[T]) Sequence

func (queue *Queue[T]) Sequence() iter.Seq[T]

func (*Queue[T]) Size

func (queue *Queue[T]) Size() int

func (*Queue[T]) Slice

func (queue *Queue[T]) Slice() []T

type QueueIterator

type QueueIterator[T any] struct {
	// contains filtered or unexported fields
}

func (*QueueIterator[T]) Next

func (iterator *QueueIterator[T]) Next() (T, bool)

type QueueNode

type QueueNode[T any] struct {
	// contains filtered or unexported fields
}

type Set

type Set[T comparable] map[T]struct{}

func NewSet

func NewSet[T comparable](values ...T) Set[T]

func (Set[T]) Add

func (set Set[T]) Add(value T)

func (Set[T]) Clear

func (set Set[T]) Clear()

func (Set[T]) Has

func (set Set[T]) Has(value T) bool

func (Set[T]) Remove

func (set Set[T]) Remove(value T)

func (Set[T]) Sequence

func (set Set[T]) Sequence() iter.Seq[T]

func (Set[T]) Slice

func (set Set[T]) Slice() []T