Man pages for oneilsh/rstackdeque
Persistent Fast Amortized Stack and Queue Data Structures
| as.data.frame.rdeque | Convert an rdeque to a data.frame |
| as.data.frame.rstack | Convert an rstack to a data.frame |
| as.list.rdeque | Convert an rdeque to a list |
| as.list.rstack | Convert an rstack to a list |
| as.rdeque | Create a pre-filled rdeque from a given input |
| as.rstack | Create an rstack pre-filled from a given input |
| head.rstack | Return the head (top) of an rstack |
| insert_back | Insert an element into the back of an rdeque or rpqueue |
| insert_front | Insert an element into the front of an rdeque |
| insert_top | Insert an element onto the top of an rstack |
| length.rdeque | Return the number of elements in an rdeque |
| length.rstack | Return the number of elements in an rstack |
| peek_back | Return the data element at the back of an rdeque |
| peek_front | Return the data element at the front of an rdeque |
| peek_top | Return the data element at the top of an rstack |
| rdeque | Create a new empty rdeque |
| rev.rstack | Reverse an rstack |
| rstack | Create a new, empty rstack |
| rstacknode | Internal structure used by rstacks, rdeques, and rpqueues |
| without_back | Return a version of an rdeque without the back element |
| without_front | Return a version of an rdeque or rpqueue without the front... |
| without_top | Return a version of an rstack without the top element |
