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

as.list.linked_list	Translate a linked list into an R list.
as.list.tree_bag	Translate a tree bag into an R list.
as.vector.linked_list	Translate a linked list into an R vector.
as.vector.tree_bag	Translate a tree bag into an R vector.
back	Get the back element of a deque
delete_minimal	Delete the minimal value in a heap
dequeue	Remove the front element of a queue
dequeue_back	Remove the back element of a deque
dequeue_front	Remove the front element of a deque
empty_binomial_heap	Construct an empty binomial heap
empty_closure_queue	Construct an empty closure based queue
empty_env_deque	Construct an empty deque
empty_env_queue	Construct an empty closure based queue
empty_extended_queue	Construct an empty extended queue
empty_lazy_queue	Creates an empty lazy queue
empty_leftist_heap	Construct an empty leftist heap
empty_list	Create an empty linked list.
empty_list_bag	Create an empty list bag.
empty_rebuild_queue	Create an empty "global rebuild" queue
empty_red_black_tree	Create empty red-black search tree
empty_search_tree	Create empty unbalanced search tree
empty_splay_heap	Construct an empty splay heap
empty_splay_tree	Create an empty splay search tree.
empty_stack	Create an empty stack.
empty_tree_bag	Create an empty tree bag.
enqueue	Add an element to a queue
enqueue_back	Add an element to the front of a deque
enqueue_front	Add an element to the front of a deque
find_minimal	Get the minimal value in a heap
front	Get the front element of a queue
insert	Insert a value into a data structure.
is_empty	Test if a data structure is empty
is_empty.binomial_heap	Test whether a binomial heap is empty
is_empty.leftist_heap	Test whether a leftist heap is empty
is_empty.splay_heap	Test whether a splay heap is empty
list_concatenate	Construct a list that is the concatenation of two other...
list_cons	Add a head item to a linked list.
list_drop_n	Get a new list containing the elements when n elements have...
list_get_n	Get a new list containing the first n elements of a list.
list_get_n_reversed	Get a new list containing the first n elements of a list...
list_head	Get the item at the head of a linked list.
list_length	Compute the length of a linked list
list_reverse	Reverse a list
list_tail	Get the tail of a linked list.
member	Check membership in a data structure
merge	Merge two data structures (of the same kind)
pop	Remove the top element from a stack.
push	Add an element to the top of a stack.
ral_cons	Construct a new random access list by prepending an element.
ral_head	Get the front element of a random access list
ral_is_empty	Check if a random access list is empty
ral_lookup	Get the value at a given index of a random access list.
ral_tail	Get the tail of a random access list
ral_update	Update the value at a given index of a random access list.
remove	Remove an element from a data structure
size	Get the size of a data structure
top	Get the top element of a stack.
vector_to_heap	Construct a heap from a vector of elements.