datastructure

Documentation

Index

• type Deque
  • func NewDeque[T any]() *Deque[T]
  • func (deq *Deque[T]) AsSlice() []T
  • func (deq *Deque[T]) ExtendBack(slice []T)
  • func (deq *Deque[T]) ExtendFront(slice []T)
  • func (deq *Deque[T]) Len() int
  • func (deq *Deque[T]) PopBack() *T
  • func (deq *Deque[T]) PopFront() *T
  • func (deq *Deque[T]) PushBack(val T)
  • func (deq *Deque[T]) PushFront(val T)
• type Set
  • func NewSet[T comparable]() *Set[T]
  • func (s *Set[T]) AsSlice() []T
  • func (s *Set[T]) Delete(item T) bool
  • func (s *Set[T]) Has(val T) bool
  • func (s *Set[T]) Insert(item T)
  • func (s *Set[T]) Len() int

Types

type Deque

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

func NewDeque

func NewDeque[T any]() *Deque[T]

func (*Deque[T]) AsSlice

func (deq *Deque[T]) AsSlice() []T

func (*Deque[T]) ExtendBack

func (deq *Deque[T]) ExtendBack(slice []T)

func (*Deque[T]) ExtendFront

func (deq *Deque[T]) ExtendFront(slice []T)

func (*Deque[T]) Len

func (deq *Deque[T]) Len() int

func (*Deque[T]) PopBack

func (deq *Deque[T]) PopBack() *T

func (*Deque[T]) PopFront

func (deq *Deque[T]) PopFront() *T

func (*Deque[T]) PushBack

func (deq *Deque[T]) PushBack(val T)

func (*Deque[T]) PushFront

func (deq *Deque[T]) PushFront(val T)

type Set

type Set[T comparable] struct {
	// contains filtered or unexported fields
}

func NewSet

func NewSet[T comparable]() *Set[T]

func (*Set[T]) AsSlice

func (s *Set[T]) AsSlice() []T

func (*Set[T]) Delete

func (s *Set[T]) Delete(item T) bool

func (*Set[T]) Has

func (s *Set[T]) Has(val T) bool

func (*Set[T]) Insert

func (s *Set[T]) Insert(item T)

func (*Set[T]) Len

func (s *Set[T]) Len() int