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 clear(both: vector)Remove all elements from the vector, setting its length to 0.
pub fn hash_sorted(h: reference, tp: integer) -> referenceC60 Step 3a-part2: iterate a hash in ascending key order. Returns a fresh vector<reference<T>> with the hash's records sorted by key field(s). The parser desugars `for e in h { … }` into a call with the hash's type id; direct user calls need to supply the id via `sizeof`-style introspection (not yet exposed). Inefficient by design — walks + sorts all records per call. See CAVEATS.md C60.