Operations on vector<T> — the primary ordered collection type. Vectors are grown by appending with += and elements are accessed by index. All structures are passed by reference instead of by value
pub fn len(both: vector) -> integerNumber of elements in the vector. Use in loop bounds: for i in 0..v.len().
pub fn len(both: sorted) -> integerNumber of elements in a sorted collection.
pub fn clear(both: vector)Remove all elements from the vector, setting its length to 0.
pub fn len(both: hash) -> integerNumber of elements in a hash collection.
pub fn size(both: hash) -> integerThe byte footprint of a hash (@PLN110): its full bucket table, holes included. The table is the hash's own allocation — `elms` slots, each a 4-byte record-id (an empty slot is a hole and still counts, because open addressing's spare capacity IS the format). Allocation-local: the entry records live in separate allocations and are not counted. Grows in steps as the table rehashes (load factor 0.75). 0 for an empty (unallocated) hash.