Man pages for mailund/ralgo
Algorithms and data structures for R programming

as.list.linked_listTranslate a linked list into an R list.
as.list.tree_bagTranslate a tree bag into an R list.
as.vector.linked_listTranslate a linked list into an R vector.
as.vector.tree_bagTranslate a tree bag into an R vector.
backGet the back element of a deque
delete_minimalDelete the minimal value in a heap
dequeueRemove the front element of a queue
dequeue_backRemove the back element of a deque
dequeue_frontRemove the front element of a deque
empty_binomial_heapConstruct an empty binomial heap
empty_closure_queueConstruct an empty closure based queue
empty_env_dequeConstruct an empty deque
empty_env_queueConstruct an empty closure based queue
empty_extended_queueConstruct an empty extended queue
empty_lazy_queueCreates an empty lazy queue
empty_leftist_heapConstruct an empty leftist heap
empty_listCreate an empty linked list.
empty_list_bagCreate an empty list bag.
empty_rebuild_queueCreate an empty "global rebuild" queue
empty_red_black_treeCreate empty red-black search tree
empty_search_treeCreate empty unbalanced search tree
empty_splay_heapConstruct an empty splay heap
empty_splay_treeCreate an empty splay search tree.
empty_stackCreate an empty stack.
empty_tree_bagCreate an empty tree bag.
enqueueAdd an element to a queue
enqueue_backAdd an element to the front of a deque
enqueue_frontAdd an element to the front of a deque
find_minimalGet the minimal value in a heap
frontGet the front element of a queue
insertInsert a value into a data structure.
is_emptyTest if a data structure is empty
is_empty.binomial_heapTest whether a binomial heap is empty
is_empty.leftist_heapTest whether a leftist heap is empty
is_empty.splay_heapTest whether a splay heap is empty
list_concatenateConstruct a list that is the concatenation of two other...
list_consAdd a head item to a linked list.
list_drop_nGet a new list containing the elements when n elements have...
list_get_nGet a new list containing the first n elements of a list.
list_get_n_reversedGet a new list containing the first n elements of a list...
list_headGet the item at the head of a linked list.
list_lengthCompute the length of a linked list
list_reverseReverse a list
list_tailGet the tail of a linked list.
memberCheck membership in a data structure
mergeMerge two data structures (of the same kind)
popRemove the top element from a stack.
pushAdd an element to the top of a stack.
ral_consConstruct a new random access list by prepending an element.
ral_headGet the front element of a random access list
ral_is_emptyCheck if a random access list is empty
ral_lookupGet the value at a given index of a random access list.
ral_tailGet the tail of a random access list
ral_updateUpdate the value at a given index of a random access list.
removeRemove an element from a data structure
sizeGet the size of a data structure
topGet the top element of a stack.
vector_to_heapConstruct a heap from a vector of elements.
mailund/ralgo documentation built on April 3, 2018, 9:29 p.m.