API for mailund/ralgo
Algorithms and data structures for R programming

Global functions
appending_state Source code
as.list.linked_list Man page Source code
as.list.tree_bag Man page Source code
as.vector.linked_list Man page Source code
as.vector.tree_bag Man page Source code
back Man page Source code
back.env_deque Source code
bag_cons Source code
bag_node Source code
bag_to_list Source code
binomial_heap Source code
binomial_heap_node Source code
binomial_nodes_min_value Source code
binomial_tree_node Source code
binomial_trees_to_nodes Source code
build_leftist_heap Source code
car Source code
cdr Source code
check Source code
cons Source code
delete_minimal Man page Source code
delete_minimal.binomial_heap Source code
delete_minimal.leftist_heap Source code
delete_minimal.splay_heap Source code
delete_minimal_node Source code
depth_first_visit_binary_tree Source code
deque_environment Source code
dequeue Man page Source code
dequeue.closure_queue Source code
dequeue.env_queue Source code
dequeue.extended_queue Source code
dequeue.lazy_queue Source code
dequeue.rebuild_queue Source code
dequeue_back Man page Source code
dequeue_back.env_deque Source code
dequeue_front Man page Source code
dequeue_front.env_deque Source code
done_state Source code
empty_binomial_heap Man page Source code
empty_closure_queue Man page Source code
empty_env_deque Man page Source code
empty_env_queue Man page Source code
empty_extended_queue Man page Source code
empty_lazy_queue Man page Source code
empty_leftist_heap Man page Source code
empty_list Man page Source code
empty_list_bag Man page Source code
empty_rebuild_queue Man page Source code
empty_red_black_tree Man page Source code
empty_search_tree Man page Source code
empty_splay_heap Man page Source code
empty_splay_node Source code
empty_splay_tree Man page Source code
empty_stack Man page Source code
empty_tree_bag Man page Source code
enqueue Man page Source code
enqueue.closure_queue Source code
enqueue.env_queue Source code
enqueue.extended_queue Source code
enqueue.lazy_queue Source code
enqueue.rebuild_queue Source code
enqueue_back Man page Source code
enqueue_back.env_deque Source code
enqueue_front Man page Source code
enqueue_front.env_deque Source code
exec Source code
exec2 Source code
extract_binomial_heap_nodes_graph Source code
extract_graph Source code
extract_graph.binary_tree Source code
extract_graph.red_black_tree Source code
find_minimal Man page Source code
find_minimal.binomial_heap Source code
find_minimal.leftist_heap Source code
find_minimal.splay_heap Source code
front Man page Source code
front.closure_queue Source code
front.env_deque Source code
front.env_queue Source code
front.extended_queue Source code
front.lazy_queue Source code
front.rebuild_queue Source code
get_minimal_node Source code
idle_state Source code
insert Man page Source code
insert.binomial_heap Source code
insert.leftist_heap Source code
insert.list_bag Source code
insert.red_black_tree Source code
insert.splay_heap Source code
insert.splay_tree Source code
insert.tree_bag Source code
insert.unbalanced_search_tree Source code
insert_binomial_node Source code
invalidate Source code
is_case_1 Source code
is_case_2 Source code
is_case_3 Source code
is_case_4 Source code
is_case_5 Source code
is_case_6 Source code
is_empty Man page Source code
is_empty.binomial_heap Man page Source code
is_empty.closure_queue Source code
is_empty.env_deque Source code
is_empty.env_queue Source code
is_empty.extended_queue Source code
is_empty.lazy_queue Source code
is_empty.leftist_heap Man page Source code
is_empty.linked_list Source code
is_empty.list_bag Source code
is_empty.rebuild_queue Source code
is_empty.red_black_tree Source code
is_empty.splay_heap Man page Source code
is_empty.splay_node Source code
is_empty.splay_tree Source code
is_empty.stack Source code
is_empty.tree_bag Source code
is_empty.unbalanced_search_tree Source code
is_leaf Source code
is_nil Source code
lazy_queue Source code
leftist_heap_node Source code
link_binomial_trees Source code
list_concatenate Man page Source code
list_cons Man page Source code
list_drop_n Man page Source code
list_get_n Man page Source code
list_get_n_reversed Man page Source code
list_head Man page Source code
list_length Man page Source code
list_length.linked_list Source code
list_reverse Man page Source code
list_tail Man page Source code
make_q Source code
member Man page Source code
member.search_tree Source code
member.splay_tree Source code
merge Man page Source code
merge.binomial_heap Source code
merge.leftist_heap Source code
merge.list_bag Source code
merge.splay_heap Source code
merge.tree_bag Source code
merge_heap_nodes Source code
merge_splay_trees Source code
move_back_to_front Source code
move_front_to_back Source code
nil Source code
node_number_annotate_tree Source code
number_binomial_heap Source code
number_binomial_heap_nodes Source code
number_binomial_trees Source code
partition Source code
pattern_match Source code
plot.binary_tree Source code
plot.binomial_heap Source code
plot.red_black_tree Source code
plot.splay_heap Source code
plot.splay_tree Source code
pop Man page Source code
pop.stack Source code
push Man page Source code
push.stack Source code
queue Source code
queue_closure Source code
queue_environment Source code
queue_extended Source code
ral_binary_tree Source code
ral_cons Man page Source code
ral_head Man page Source code
ral_is_empty Man page Source code
ral_is_leaf Source code
ral_is_singleton Source code
ral_lookup Man page Source code
ral_node Source code
ral_singleton_node Source code
ral_tail Man page Source code
ral_tree_lookup Source code
ral_tree_update Source code
ral_update Man page Source code
rbt_balance Source code
rbt_insert Source code
rbt_remove Source code
rbt_rotate Source code
rebuild_queue_node Source code
red_black_tree_node Source code
remove Man page Source code
remove.linked_list Source code
remove.red_black_tree Source code
remove.splay_tree Source code
remove.unbalanced_search_tree Source code
reversing_state Source code
rot Source code
search_tree_node Source code
singleton_binomial_heap_node Source code
singleton_heap Source code
size Man page Source code
size.binomial_heap Source code
size.leftist_heap Source code
size.splay_heap Source code
splay Source code
splay_delete_minimal_value Source code
splay_find_minimal_value Source code
splay_heap Source code
splay_remove Source code
splay_tree_node Source code
st_insert Source code
st_leftmost Source code
st_member Source code
st_remove Source code
stack_cons Source code
top Man page Source code
top.stack Source code
transform_case_1 Source code
transform_case_2 Source code
transform_case_3 Source code
transform_case_4 Source code
transform_case_5 Source code
transform_case_6 Source code
vector_to_heap Man page Source code
mailund/ralgo documentation built on April 3, 2018, 9:29 p.m.