stdlib/iterView source ↗
iter
22 items · generated by scribe fromstdlib/iter.fd· synced 2026-11-15
Contents
- iter_map (function)
- iter_filter (function)
- iter_reduce (function)
- iter_sum (function)
- iter_product (function)
- iter_min (function)
- iter_max (function)
- iter_find_index (function)
- iter_find (function)
- iter_any (function)
- iter_all (function)
- iter_count (function)
- iter_flatten (function)
- iter_take (function)
- iter_skip (function)
- iter_chain (function)
- iter_range (function)
- iter_range_step (function)
- iter_repeat (function)
- iter_partition (function)
- iter_dedup (function)
- iter_chunk (function)
iter_map
Map each element through a function, returning a new Vec.
Example: var v = iter_range(1, 4); var sq = iter_map(v, fn(x: i64) -> i64 { x * x }); assert_eq(sq.get(2), 9);
pub fn iter_map(v: Vec<i64>, f: fn(i64) -> i64) -> Vec<i64> {Parameters:
v:Vec<i64>f:fn(i64) -> i64
Returns: Vec<i64>
Defined at line 23
iter_filter
Filter elements that satisfy a predicate, returning a new Vec.
Example: var odd = iter_filter(iter_range(0, 6), fn(x: i64) -> bool { x % 2 == 1 }); assert_eq(odd.len(), 3); assert_eq(odd.get(0), 1);
pub fn iter_filter(v: Vec<i64>, pred: fn(i64) -> bool) -> Vec<i64> {Parameters:
v:Vec<i64>pred:fn(i64) -> bool
Returns: Vec<i64>
Defined at line 39
iter_reduce
Reduce a Vec to a single value using a function. iter_reduce([1,2,3], add) → add(add(0, 1), 2), 3) = 6
Example: var prod = iter_reduce(iter_range(1, 5), fn(a: i64, x: i64) -> i64 { a * x }, 1); println(int_to_str(prod)); assert_eq(prod, 24);
pub fn iter_reduce(v: Vec<i64>, f: fn(i64, i64) -> i64, initial: i64) -> i64 {Parameters:
v:Vec<i64>f:fn(i64initial:i64
Returns: i64
Defined at line 58
iter_sum
Sum all elements in a Vec.
Example: assert_eq(iter_sum(iter_range(1, 11)), 55);
pub fn iter_sum(v: Vec<i64>) -> i64 {Parameters:
v:Vec<i64>
Returns: i64
Defined at line 72
iter_product
Product of all elements in a Vec.
Example: assert_eq(iter_product(iter_range(1, 6)), 120);
pub fn iter_product(v: Vec<i64>) -> i64 {Parameters:
v:Vec<i64>
Returns: i64
Defined at line 86
iter_min
Find the minimum element. Returns 0 if empty.
Example: var v: Vec
pub fn iter_min(v: Vec<i64>) -> i64 {Parameters:
v:Vec<i64>
Returns: i64
Defined at line 102
iter_max
Find the maximum element. Returns 0 if empty.
Example: var v: Vec
pub fn iter_max(v: Vec<i64>) -> i64 {Parameters:
v:Vec<i64>
Returns: i64
Defined at line 123
iter_find_index
Find the first index of a value. Returns -1 if not found.
Example: var v = iter_range(10, 15); assert_eq(iter_find_index(v, 12), 2); assert_eq(iter_find_index(v, 99), -1);
pub fn iter_find_index(v: Vec<i64>, value: i64) -> i64 {Parameters:
v:Vec<i64>value:i64
Returns: i64
Defined at line 146
iter_find
Find the first index matching a predicate. Returns -1 if not found.
Example: var i = iter_find(iter_range(0, 10), fn(x: i64) -> bool { x * x > 20 }); assert_eq(i, 5);
pub fn iter_find(v: Vec<i64>, pred: fn(i64) -> bool) -> i64 {Parameters:
v:Vec<i64>pred:fn(i64) -> bool
Returns: i64
Defined at line 162
iter_any
Check if any element satisfies a predicate.
Example: assert(iter_any(iter_range(0, 5), fn(x: i64) -> bool { x == 3 }));
pub fn iter_any(v: Vec<i64>, pred: fn(i64) -> bool) -> bool {Parameters:
v:Vec<i64>pred:fn(i64) -> bool
Returns: bool
Defined at line 177
iter_all
Check if all elements satisfy a predicate.
Example: assert(iter_all(iter_range(1, 5), fn(x: i64) -> bool { x > 0 })); assert(!iter_all(iter_range(0, 5), fn(x: i64) -> bool { x > 0 }));
pub fn iter_all(v: Vec<i64>, pred: fn(i64) -> bool) -> bool {Parameters:
v:Vec<i64>pred:fn(i64) -> bool
Returns: bool
Defined at line 193
iter_count
Count elements that satisfy a predicate.
Example: assert_eq(iter_count(iter_range(0, 10), fn(x: i64) -> bool { x % 3 == 0 }), 4);
pub fn iter_count(v: Vec<i64>, pred: fn(i64) -> bool) -> i64 {Parameters:
v:Vec<i64>pred:fn(i64) -> bool
Returns: i64
Defined at line 208
iter_flatten
Flatten a Vec of Vecs into a single Vec. Note: Since Vec elements are i64 (opaque pointers), this treats each element as a Vec pointer and flattens them.
Example: var outer: Vec<Vec
pub fn iter_flatten(v: Vec<Vec<i64>>) -> Vec<i64> {Parameters:
v:Vec<Vec<i64>>
Returns: Vec<i64>
Defined at line 233
iter_take
Take the first n elements, returning a new Vec.
Example: var t = iter_take(iter_range(0, 10), 3); assert_eq(t.len(), 3); assert_eq(t.get(2), 2);
pub fn iter_take(v: Vec<i64>, n: i64) -> Vec<i64> {Parameters:
v:Vec<i64>n:i64
Returns: Vec<i64>
Defined at line 254
iter_skip
Skip the first n elements, returning a new Vec with the rest.
Example: var s = iter_skip(iter_range(0, 10), 7); assert_eq(s.len(), 3); assert_eq(s.get(0), 7);
pub fn iter_skip(v: Vec<i64>, n: i64) -> Vec<i64> {Parameters:
v:Vec<i64>n:i64
Returns: Vec<i64>
Defined at line 274
iter_chain
Concatenate two Vecs.
Example: var c = iter_chain(iter_range(0, 2), iter_range(10, 12)); assert_eq(c.len(), 4); assert_eq(c.get(2), 10);
pub fn iter_chain(a: Vec<i64>, b: Vec<i64>) -> Vec<i64> {Parameters:
a:Vec<i64>b:Vec<i64>
Returns: Vec<i64>
Defined at line 292
iter_range
Generate a range [start, end) as a Vec.
Example: var r = iter_range(3, 6); assert_eq(r.len(), 3); assert_eq(r.get(0), 3); assert_eq(iter_range(5, 5).len(), 0);
pub fn iter_range(start: i64, end: i64) -> Vec<i64> {Parameters:
start:i64end:i64
Returns: Vec<i64>
Defined at line 316
iter_range_step
Generate a range with a step. iter_range_step(0, 10, 2) → [0, 2, 4, 6, 8]
Example: var r = iter_range_step(0, 10, 3); assert_eq(r.len(), 4); assert_eq(r.get(3), 9);
pub fn iter_range_step(start: i64, end: i64, step: i64) -> Vec<i64> {Parameters:
start:i64end:i64step:i64
Returns: Vec<i64>
Defined at line 333
iter_repeat
Repeat a value n times.
Example: var r = iter_repeat(7, 3); assert_eq(r.len(), 3); assert_eq(iter_sum(r), 21);
pub fn iter_repeat(value: i64, n: i64) -> Vec<i64> {Parameters:
value:i64n:i64
Returns: Vec<i64>
Defined at line 352
iter_partition
Partition a Vec into two: elements that pass and elements that fail the predicate. Returns a Vec of two Vecs: [passing, failing].
Example: var parts = iter_partition(iter_range(0, 5), fn(x: i64) -> bool { x < 2 }); var low: Vec
pub fn iter_partition(v: Vec<i64>, pred: fn(i64) -> bool) -> Vec<Vec<i64>> {Parameters:
v:Vec<i64>pred:fn(i64) -> bool
Returns: Vec<Vec<i64>>
Defined at line 373
iter_dedup
Deduplicate a Vec (remove consecutive duplicates).
Example: var v: Vec
pub fn iter_dedup(v: Vec<i64>) -> Vec<i64> {Parameters:
v:Vec<i64>
Returns: Vec<i64>
Defined at line 398
iter_chunk
Chunk a Vec into groups of size elements.
Example: var chunks = iter_chunk(iter_range(0, 5), 2); assert_eq(chunks.len(), 3); var last: Vec
pub fn iter_chunk(v: Vec<i64>, size: i64) -> Vec<Vec<i64>> {Parameters:
v:Vec<i64>size:i64
Returns: Vec<Vec<i64>>
Defined at line 422
Generated by scribe, the Fides documentation generator