Versions in this module Expand all Collapse all v0 v0.0.1 Mar 18, 2024 Changes in this version + type BSTree struct + Left *BSTree[T] + Right *BSTree[T] + func NewBSTNode[T Priority](data T) *BSTree[T] + func (p *BSTree[T]) Data() T + func (p *BSTree[T]) Has(newNode *BSTree[T]) bool + func (p *BSTree[T]) Insert(newNode *BSTree[T]) *BSTree[T] + func (p *BSTree[T]) Maximum() *BSTree[T] + func (p *BSTree[T]) Merge(b *BSTree[T]) *BSTree[T] + func (p *BSTree[T]) Minimum() *BSTree[T] + func (p *BSTree[T]) PreTravel(list *[]T) + func (p *BSTree[T]) Remove(newNode *BSTree[T]) *BSTree[T] + func (p *BSTree[T]) ToArray() []T + type CanHashUnique interface + Unique func() T + type Priority interface + Empty func() bool + Equal func(i, j interface{}) bool + Less func(i, j interface{}) bool + type Queue struct + func (q *Queue[T, K]) Dequeue() K + func (q *Queue[T, K]) Enqueue(key T, item K) + func (q *Queue[T, K]) Exists(key T) bool + func (q *Queue[T, K]) Instance(opts ...QueueOption) *Queue[T, K] + func (q *Queue[T, K]) Size() int64 + type QueueOption func(opts *QueueOptions) + func WithRemoveTicker(duration time.Duration) QueueOption + type QueueOptions struct + type QueueType interface + type SetType interface + type SetV2 struct + func InstanceSetAndMapFromStructSlice[T SetType, K CanHashUnique[T]](slice []K) (*SetV2[T], map[T]K) + func (s *SetV2[T]) Clear() + func (s *SetV2[T]) Clone() *SetV2[T] + func (s *SetV2[T]) Empty() bool + func (s *SetV2[T]) Has(val T) bool + func (s *SetV2[T]) HasAnyItem(val ...T) bool + func (s *SetV2[T]) Insert(val T) *SetV2[T] + func (s *SetV2[T]) InsertAll(val ...T) *SetV2[T] + func (s *SetV2[T]) Instance() *SetV2[T] + func (s *SetV2[T]) InstanceFromSlice(slice *[]T) *SetV2[T] + func (s *SetV2[T]) Remove(val T) + func (s *SetV2[T]) Size() uint + func (s *SetV2[T]) ToArray() []T + func (s *SetV2[T]) TryInsert(val T) (*SetV2[T], bool)
Go to main page