Man pages for mailund/pmtypes
Data structures and algorithms implemented using pattern matching
| as.list.llist | Translate a linked list into a list. |
| as.vector.llist | Translate a linked list into a vector |
| CONS | Constructs a new linked list from an element and another list |
| dequeue | Remove an element from the front of a queue |
| empty_queue | Create an empty queue |
| empty_red_black_map | Create an empty red-black tree representation for a map |
| empty_red_black_set | Create an empty red-black tree representation for a set. |
| empty_stack | Create an empty stack |
| enqueue | Add an element to the back of a queue |
| front | Get the element at the front of a queue |
| is_queue_empty | Tests if a queue is empty |
| is_red_black_map_empty | Check if a tree is empty |
| is_red_black_set_empty | Check if a tree is empty |
| is_stack_empty | Tests if a stack is empty |
| llcontains | Tests if an element is contained in a list |
| llength | Compute the length of a linked list. |
| ll_is_nil | Tests if a list is empty. |
| llist_from_list | Translate a list object into a linked list. |
| llmap | Map a function over a linked list. |
| llrev | Reverse a linked list. |
| lltake | Extract the first 'k' elements from a linked list. |
| move_lists | Move elements from the back list to the front list |
| NIL | An empty list |
| pop | Remove the top element from a stack |
| print.llist | Print linked list objects |
| print.rbt_colour | Print red-black colour objects |
| print.rbt_map | Print red-black map objects |
| print.rbt_set | Print red-black sets objects |
| push | Push an element onto a stack. |
| RBT_BLACK | Colour used in red-black trees. |
| RBT_DOUBLE_BLACK | Colour used in red-black trees. |
| RBT_MAP | Constructs a new node in a red-black tree map. |
| RBT_MAP_EMPTY | An empty map |
| rbt_map_get | Get the value associated with a key. |
| rbt_map_insert | Insert an element into a red-black tree map |
| rbt_map_member | Determines if a red-black map contains the key 'k' |
| RBT_RED | Colour used in red-black trees. |
| RBT_SET | Constructs a new node in a red-black tree set. |
| RBT_SET_EMPTY | An empty set |
| rbt_set_insert | Insert an element into a red-black tree set. |
| rbt_set_member | Determines if a red-black tree contains the value 'v' |
| top | Get the element at the top of the stack. |
| toString.llist | Make a string-representation of a linked list. |
| toString.rbt_colour | Make a string-representation of a red-black colour |
| toString.rbt_map | Make a string-representation of a red-black map. |
| toString.rbt_set | Make a string-representation of a red-black set. |
