API for mailund/ralgo
Algorithms and data structures for R programming
| Global functions | |
|---|---|
| as.list.linked_list | Man page |
| as.list.tree_bag | Man page |
| as.vector.linked_list | Man page |
| as.vector.tree_bag | Man page |
| back | Man page |
| delete_minimal | Man page |
| dequeue | Man page |
| dequeue_back | Man page |
| dequeue_front | Man page |
| empty_binomial_heap | Man page |
| empty_closure_queue | Man page |
| empty_env_deque | Man page |
| empty_env_queue | Man page |
| empty_extended_queue | Man page |
| empty_lazy_queue | Man page |
| empty_leftist_heap | Man page |
| empty_list | Man page |
| empty_list_bag | Man page |
| empty_rebuild_queue | Man page |
| empty_red_black_tree | Man page |
| empty_search_tree | Man page |
| empty_splay_heap | Man page |
| empty_splay_tree | Man page |
| empty_stack | Man page |
| empty_tree_bag | Man page |
| enqueue | Man page |
| enqueue_back | Man page |
| enqueue_front | Man page |
| find_minimal | Man page |
| front | Man page |
| insert | Man page |
| is_empty | Man page |
| is_empty.binomial_heap | Man page |
| is_empty.leftist_heap | Man page |
| is_empty.splay_heap | Man page |
| list_concatenate | Man page |
| list_cons | Man page |
| list_drop_n | Man page |
| list_get_n | Man page |
| list_get_n_reversed | Man page |
| list_head | Man page |
| list_length | Man page |
| list_reverse | Man page |
| list_tail | Man page |
| member | Man page |
| merge | Man page |
| pop | Man page |
| push | Man page |
| ral_cons | Man page |
| ral_head | Man page |
| ral_is_empty | Man page |
| ral_lookup | Man page |
| ral_tail | Man page |
| ral_update | Man page |
| remove | Man page |
| size | Man page |
| top | Man page |
| vector_to_heap | Man page |
