herolib/vdocs/datatypes.md

module datatypes

Contents

• new_bloom_filter
• new_bloom_filter_fast
• new_ringbuffer
• BSTree[T]
  • insert
  • contains
  • remove
  • is_empty
  • in_order_traversal
  • post_order_traversal
  • pre_order_traversal
  • to_left
  • to_right
  • max
  • min
• BloomFilter[T]
  • add
  • exists
  • @union
  • intersection
• DoublyLinkedList[T]
  • is_empty
  • len
  • first
  • last
  • push_back
  • push_front
  • push_many
  • pop_back
  • pop_front
  • insert
  • index
  • delete
  • str
  • array
  • next
  • iterator
  • back_iterator
• DoublyListIterBack[T]
  • next
• DoublyListIter[T]
  • next
• LinkedList[T]
  • is_empty
  • len
  • first
  • last
  • index
  • push
  • push_many
  • pop
  • shift
  • insert
  • prepend
  • str
  • array
  • next
  • iterator
• ListIter[T]
  • next
• MinHeap[T]
  • insert
  • insert_many
  • pop
  • peek
  • len
• Queue[T]
  • is_empty
  • len
  • peek
  • last
  • index
  • push
  • pop
  • str
  • array
• RingBuffer[T]
  • push
  • pop
  • push_many
  • pop_many
  • is_empty
  • is_full
  • capacity
  • clear
  • occupied
  • remaining
• Set[T]
  • exists
  • add
  • remove
  • pick
  • rest
  • pop
  • clear
  • ==
  • is_empty
  • size
  • copy
  • add_all
  • @union
  • intersection
  • -
  • subset
• Stack[T]
  • is_empty
  • len
  • peek
  • push
  • pop
  • str
  • array
• Direction
• AABB
• BSTree
• DoublyLinkedList
• DoublyListIter
• DoublyListIterBack
• LinkedList
• ListIter
• ListNode
• MinHeap
• Quadtree
  • create
  • insert
  • retrieve
  • clear
  • get_nodes
• Queue
• RingBuffer
• Set
• Stack

new_bloom_filter

[Return to contents]

new_bloom_filter_fast

[Return to contents]

new_ringbuffer

[Return to contents]

BSTree[T]

insert

[Return to contents]

contains

[Return to contents]

remove

[Return to contents]

is_empty

[Return to contents]

in_order_traversal

[Return to contents]

post_order_traversal

[Return to contents]

pre_order_traversal

[Return to contents]

to_left

[Return to contents]

to_right

[Return to contents]

max

[Return to contents]

min

[Return to contents]

BloomFilter[T]

add

[Return to contents]

exists

[Return to contents]

@union

[Return to contents]

intersection

[Return to contents]

DoublyLinkedList[T]

is_empty

[Return to contents]

len

[Return to contents]

first

[Return to contents]

last

[Return to contents]

push_back

[Return to contents]

push_front

[Return to contents]

push_many

[Return to contents]

pop_back

[Return to contents]

pop_front

[Return to contents]

insert

[Return to contents]

index

[Return to contents]

delete

[Return to contents]

str

[Return to contents]

array

[Return to contents]

next

[Return to contents]

iterator

[Return to contents]

back_iterator

[Return to contents]

DoublyListIterBack[T]

next

[Return to contents]

DoublyListIter[T]

next

[Return to contents]

LinkedList[T]

is_empty

[Return to contents]

len

[Return to contents]

first

[Return to contents]

last

[Return to contents]

index

[Return to contents]

push

[Return to contents]

push_many

[Return to contents]

pop

[Return to contents]

shift

[Return to contents]

insert

[Return to contents]

prepend

[Return to contents]

str

[Return to contents]

array

[Return to contents]

next

[Return to contents]

iterator

[Return to contents]

ListIter[T]

next

[Return to contents]

MinHeap[T]

insert

[Return to contents]

insert_many

[Return to contents]

pop

[Return to contents]

peek

[Return to contents]

len

[Return to contents]

Queue[T]

is_empty

[Return to contents]

len

[Return to contents]

peek

[Return to contents]

last

[Return to contents]

index

[Return to contents]

push

[Return to contents]

pop

[Return to contents]

str

[Return to contents]

array

[Return to contents]

RingBuffer[T]

push

[Return to contents]

pop

[Return to contents]

push_many

[Return to contents]

pop_many

[Return to contents]

is_empty

[Return to contents]

is_full

[Return to contents]

capacity

[Return to contents]

clear

[Return to contents]

occupied

[Return to contents]

remaining

[Return to contents]

Set[T]

exists

[Return to contents]

add

[Return to contents]

remove

[Return to contents]

pick

[Return to contents]

rest

[Return to contents]

pop

[Return to contents]

clear

[Return to contents]

==

[Return to contents]

is_empty

[Return to contents]

size

[Return to contents]

copy

[Return to contents]

add_all

[Return to contents]

@union

[Return to contents]

intersection

[Return to contents]

-

[Return to contents]

subset

[Return to contents]

Stack[T]

is_empty

[Return to contents]

len

[Return to contents]

peek

[Return to contents]

push

[Return to contents]

pop

[Return to contents]

str

[Return to contents]

array

[Return to contents]

Direction

[Return to contents]

AABB

[Return to contents]

BSTree

[Return to contents]

DoublyLinkedList

[Return to contents]

DoublyListIter

[Return to contents]

DoublyListIterBack

[Return to contents]

LinkedList

[Return to contents]

ListIter

[Return to contents]

ListNode

[Return to contents]

MinHeap

[Return to contents]

Quadtree

[Return to contents]

create

[Return to contents]

insert

[Return to contents]

retrieve

[Return to contents]

clear

[Return to contents]

get_nodes

[Return to contents]

Queue

[Return to contents]

RingBuffer

[Return to contents]

Set

[Return to contents]

Stack

[Return to contents]

Powered by vdoc. Generated on: 7 Feb 2025 12:06:55