Module collections 

Rust std::collections exposed as R data structures.

Each collection is stored on the Interpreter struct in a Vec<CollectionObject>. R sees a collection as an integer ID with a class attribute (e.g. "hashmap", "btreemap", "hashset", "heap", "deque"). Functions like hashmap_set(), hashset_add(), heap_push(), etc. mutate the collection in place through the ID.

This gives R users O(1) hash lookups, ordered maps, priority queues, and deques — data structures that have no native equivalent in base R.

Structs

OrdF64

Wrapper around f64 that implements Ord for use in BinaryHeap.

Enums

CollectionObject

A single collection object stored on the interpreter.

Statics

__INTERP_REG_INTERP_BTREEMAP 🔒

__INTERP_REG_INTERP_BTREEMAP_GET 🔒

__INTERP_REG_INTERP_BTREEMAP_HAS 🔒

__INTERP_REG_INTERP_BTREEMAP_KEYS 🔒

__INTERP_REG_INTERP_BTREEMAP_REMOVE 🔒

__INTERP_REG_INTERP_BTREEMAP_SET 🔒

__INTERP_REG_INTERP_BTREEMAP_SIZE 🔒

__INTERP_REG_INTERP_BTREEMAP_TO_LIST 🔒

__INTERP_REG_INTERP_BTREEMAP_VALUES 🔒

__INTERP_REG_INTERP_DEQUE 🔒

__INTERP_REG_INTERP_DEQUE_POP_BACK 🔒

__INTERP_REG_INTERP_DEQUE_POP_FRONT 🔒

__INTERP_REG_INTERP_DEQUE_PUSH_BACK 🔒

__INTERP_REG_INTERP_DEQUE_PUSH_FRONT 🔒

__INTERP_REG_INTERP_DEQUE_SIZE 🔒

__INTERP_REG_INTERP_DEQUE_TO_LIST 🔒

__INTERP_REG_INTERP_HASHMAP 🔒

__INTERP_REG_INTERP_HASHMAP_GET 🔒

__INTERP_REG_INTERP_HASHMAP_HAS 🔒

__INTERP_REG_INTERP_HASHMAP_KEYS 🔒

__INTERP_REG_INTERP_HASHMAP_REMOVE 🔒

__INTERP_REG_INTERP_HASHMAP_SET 🔒

__INTERP_REG_INTERP_HASHMAP_SIZE 🔒

__INTERP_REG_INTERP_HASHMAP_TO_LIST 🔒

__INTERP_REG_INTERP_HASHMAP_VALUES 🔒

__INTERP_REG_INTERP_HASHSET 🔒

__INTERP_REG_INTERP_HASHSET_ADD 🔒

__INTERP_REG_INTERP_HASHSET_DIFF 🔒

__INTERP_REG_INTERP_HASHSET_HAS 🔒

__INTERP_REG_INTERP_HASHSET_INTERSECT 🔒

__INTERP_REG_INTERP_HASHSET_REMOVE 🔒

__INTERP_REG_INTERP_HASHSET_SIZE 🔒

__INTERP_REG_INTERP_HASHSET_TO_VECTOR 🔒

__INTERP_REG_INTERP_HASHSET_UNION 🔒

__INTERP_REG_INTERP_HEAP 🔒

__INTERP_REG_INTERP_HEAP_PEEK 🔒

__INTERP_REG_INTERP_HEAP_POP 🔒

__INTERP_REG_INTERP_HEAP_PUSH 🔒

__INTERP_REG_INTERP_HEAP_SIZE 🔒

Functions

collection_id 🔒

Extract a collection ID from an RValue (integer scalar, possibly with a class attribute).

collection_value 🔒

Build an integer scalar with a class attribute representing a collection.

interp_btreemap 🔒

Create an empty BTreeMap (ordered key-value store).

interp_btreemap_get 🔒

Look up a key in a BTreeMap, with an optional default.

interp_btreemap_has 🔒

Check whether a key exists in a BTreeMap.

interp_btreemap_keys 🔒

Return all keys of a BTreeMap as a sorted character vector.

interp_btreemap_remove 🔒

Remove a key from a BTreeMap, returning the old value.

interp_btreemap_set 🔒

Insert or update a key-value pair in a BTreeMap.

interp_btreemap_size 🔒

Return the number of key-value pairs in a BTreeMap.

interp_btreemap_to_list 🔒

Convert a BTreeMap to a named R list (in key-sorted order).

interp_btreemap_values 🔒

Return all values of a BTreeMap as a list (in key-sorted order).

interp_deque 🔒

Create an empty deque (double-ended queue of R values).

interp_deque_pop_back 🔒

Remove and return the last element of a deque.

interp_deque_pop_front 🔒

Remove and return the first element of a deque.

interp_deque_push_back 🔒

Append a value to the back of a deque.

interp_deque_push_front 🔒

Prepend a value to the front of a deque.

interp_deque_size 🔒

Return the number of elements in a deque.

interp_deque_to_list 🔒

Convert a deque to an R list.

interp_hashmap 🔒

Create an empty HashMap (unordered key-value store).

interp_hashmap_get 🔒

Look up a key in a HashMap, with an optional default.

interp_hashmap_has 🔒

Check whether a key exists in a HashMap.

interp_hashmap_keys 🔒

Return all keys of a HashMap as a character vector.

interp_hashmap_remove 🔒

Remove a key from a HashMap, returning the old value.

interp_hashmap_set 🔒

Insert or update a key-value pair in a HashMap.

interp_hashmap_size 🔒

Return the number of key-value pairs in a HashMap.

interp_hashmap_to_list 🔒

Convert a HashMap to a named R list.

interp_hashmap_values 🔒

Return all values of a HashMap as a list.

interp_hashset 🔒

Create an empty HashSet (unordered unique-element set).

interp_hashset_add 🔒

Add a string element to a HashSet.

interp_hashset_diff 🔒

Compute the difference of two HashSets (s1 minus s2), returning a new HashSet.

interp_hashset_has 🔒

Check whether a string element is in a HashSet.

interp_hashset_intersect 🔒

Compute the intersection of two HashSets, returning a new HashSet.

interp_hashset_remove 🔒

Remove a string element from a HashSet.

interp_hashset_size 🔒

Return the number of elements in a HashSet.

interp_hashset_to_vector 🔒

Convert a HashSet to a character vector.

interp_hashset_union 🔒

Compute the union of two HashSets, returning a new HashSet.

interp_heap 🔒

Create an empty max-heap (priority queue of numeric values).

interp_heap_peek 🔒

Peek at the maximum value in a max-heap without removing it.

interp_heap_pop 🔒

Pop and return the maximum value from a max-heap.

interp_heap_push 🔒

Push a numeric value onto a max-heap.

interp_heap_size 🔒

Return the number of elements in a max-heap.

require_string 🔒

Extract a string key from an argument at the given position.