Versions in this module Expand all Collapse all v2 v2.1.0 Dec 11, 2025 Changes in this version + type Deque struct + func New[T any](size ...int) *Deque[T] + func (q *Deque[T]) At(i int) T + func (q *Deque[T]) Back() T + func (q *Deque[T]) Cap() int + func (q *Deque[T]) Clear() + func (q *Deque[T]) Front() T + func (q *Deque[T]) Index(f func(T) bool) int + func (q *Deque[T]) Insert(at int, item T) + func (q *Deque[T]) Len() int + func (q *Deque[T]) PopBack() T + func (q *Deque[T]) PopFront() T + func (q *Deque[T]) PushBack(elem T) + func (q *Deque[T]) PushFront(elem T) + func (q *Deque[T]) RIndex(f func(T) bool) int + func (q *Deque[T]) Remove(at int) T + func (q *Deque[T]) Rotate(n int) + func (q *Deque[T]) Set(i int, elem T) + func (q *Deque[T]) SetMinCapacity(minCapacityExp uint) + type Item struct + Index int + Priority int + Value interface{} + type PriorityQueue struct + func (pq *PriorityQueue) GetHighest() *Item + func (pq *PriorityQueue) Init(initItemSliceNum int) + func (pq *PriorityQueue) Len() int + func (pq *PriorityQueue) Pop() *Item + func (pq *PriorityQueue) Push(item *Item) + func (pq *PriorityQueue) Remove(item *Item) + func (pq *PriorityQueue) Update(item *Item, value interface{}, priority int) + type PriorityQueueSlice []*Item + func (pq *PriorityQueueSlice) Pop() interface{} + func (pq *PriorityQueueSlice) Push(x interface{}) + func (pq *PriorityQueueSlice) Update(item *Item, value interface{}, priority int) + func (pq PriorityQueueSlice) Len() int + func (pq PriorityQueueSlice) Less(i, j int) bool + func (pq PriorityQueueSlice) Swap(i, j int) + type Queue struct + func NewQueue() *Queue + func (q *Queue) Add(elem interface{}) + func (q *Queue) Get(i int) interface{} + func (q *Queue) Length() int + func (q *Queue) Peek() interface{} + func (q *Queue) Pop() interface{} + type SCursor struct + func (s *SCursor[ElementType]) First() + func (s *SCursor[ElementType]) Next() (elem ElementType, ret bool) + type SQueue struct + func NewSQueue[ElementType any](maxElementNum int) *SQueue[ElementType] + func (s *SQueue[ElementType]) GetCursor() (cur SCursor[ElementType]) + func (s *SQueue[ElementType]) GetPosCursor(pos int) (cur SCursor[ElementType], ret bool) + func (s *SQueue[ElementType]) IsEmpty() bool + func (s *SQueue[ElementType]) IsFull() bool + func (s *SQueue[ElementType]) Len() int + func (s *SQueue[ElementType]) Pop() (elem ElementType, ret bool) + func (s *SQueue[ElementType]) Push(elem ElementType) bool + func (s *SQueue[ElementType]) RemoveElement(elementNum int) (removeNum int) + type SyncQueue struct + func NewSyncQueue() *SyncQueue + func (q *SyncQueue) Add(elem interface{}) + func (q *SyncQueue) Get(i int) interface{} + func (q *SyncQueue) Len() int + func (q *SyncQueue) Peek() interface{} + func (q *SyncQueue) Pop() interface{} + func (q *SyncQueue) RLockRange(f func(interface{}))
Go to main page