Versions in this module Expand all Collapse all v3 v3.0.0 Oct 11, 2026 Changes in this version + func RegisterStdPreload(v *vm.VM) + type BTree struct + func (tree *BTree[T]) Delete(key T) + func (tree *BTree[T]) Insert(key T) + func (tree *BTree[T]) Search(key T) bool + type BTreeNode struct + func NewBTreeNode[T constraints.Ordered](maxKeys int, isLeaf bool) *BTreeNode[T] + func (node *BTreeNode[T]) Append(key T, child *BTreeNode[T]) + func (node *BTreeNode[T]) Concat(other *BTreeNode[T], idx int) + func (node *BTreeNode[T]) Delete(tree *BTree[T], key T) + func (node *BTreeNode[T]) DeleteIthKey(i int) + func (node *BTreeNode[T]) InsertKeyChild(key T, child *BTreeNode[T]) + func (node *BTreeNode[T]) InsertNonFull(tree *BTree[T], key T) + func (node *BTreeNode[T]) IsFull(maxKeys int) bool + func (node *BTreeNode[T]) Max() T + func (node *BTreeNode[T]) Merge(idx int) + func (node *BTreeNode[T]) Min() T + func (node *BTreeNode[T]) Search(key T) bool + func (node *BTreeNode[T]) Verify(tree *BTree[T]) + func (parent *BTreeNode[T]) Split(idx int, maxKeys int) + type Deque struct + func NewDeque() *Deque + func (d *Deque) Back() (any, bool) + func (d *Deque) Clear() + func (d *Deque) Empty() bool + func (d *Deque) Front() (any, bool) + func (d *Deque) PopBack() (any, bool) + func (d *Deque) PopFront() (any, bool) + func (d *Deque) PushBack(v any) + func (d *Deque) PushFront(v any) + func (d *Deque) Size() int + type HashMap struct + func DefaultHashMap() *HashMap + func (hm *HashMap) Contains(key any) bool + func (hm *HashMap) Get(key any) any + func (hm *HashMap) Put(key, value any) + type Heap struct + func NewAny[T any](less func(a, b T) bool) (*Heap[T], error) + func (h *Heap[T]) Empty() bool + func (h *Heap[T]) Pop() + func (h *Heap[T]) Push(t T) + func (h *Heap[T]) Size() int + func (h *Heap[T]) Top() T + type LinkedList struct + func NewLinkedList() *LinkedList + func (l *LinkedList) Back() (any, bool) + func (l *LinkedList) Clear() + func (l *LinkedList) Empty() bool + func (l *LinkedList) Front() (any, bool) + func (l *LinkedList) PopBack() (any, bool) + func (l *LinkedList) PopFront() (any, bool) + func (l *LinkedList) PushBack(v any) + func (l *LinkedList) PushFront(v any) + func (l *LinkedList) Size() int + func (l *LinkedList) ToArray() []any + type Node struct + func NewNode() *Node + func (n *Node) Capacity() int + func (n *Node) Compact() (remove bool) + func (n *Node) Find(s string) bool + func (n *Node) Insert(s ...string) + func (n *Node) Remove(s ...string) + func (n *Node) Size() int + type Queue struct + func NewQueue() *Queue + func (q *Queue) Clear() + func (q *Queue) Empty() bool + func (q *Queue) Peek() (any, bool) + func (q *Queue) Pop() (any, bool) + func (q *Queue) Push(v any) + func (q *Queue) Size() int + type Set struct + func NewSet() *Set + func (s *Set) Add(v any) bool + func (s *Set) Clear() + func (s *Set) Contains(v any) bool + func (s *Set) Empty() bool + func (s *Set) Remove(v any) bool + func (s *Set) Size() int + func (s *Set) Values() []any + type Stack struct + func NewStack() *Stack + func (s *Stack) Clear() + func (s *Stack) Empty() bool + func (s *Stack) Peek() (any, bool) + func (s *Stack) Pop() (any, bool) + func (s *Stack) Push(v any) + func (s *Stack) Size() int Other modules containing this package github.com/hilthontt/luascript
Go to main page