// BuildLang Standard Library - Iterator Combinators
// Operations on Vec<i32> using higher-order functions.
fn vec_map(data: Vec<i32>, f: fn(i32) -> i32) -> Vec<i32> {
let result = vec_new();
let len = vec_len(data);
let mut i: i32 = 0;
while i < len {
let val = vec_get(data, i);
vec_push(result, f(val));
i = i + 1;
}
result
}
fn vec_filter(data: Vec<i32>, pred: fn(i32) -> bool) -> Vec<i32> {
let result = vec_new();
let len = vec_len(data);
let mut i: i32 = 0;
while i < len {
let val = vec_get(data, i);
if pred(val) {
vec_push(result, val);
}
i = i + 1;
}
result
}
fn vec_fold(data: Vec<i32>, init: i32, f: fn(i32, i32) -> i32) -> i32 {
let mut acc = init;
let len = vec_len(data);
let mut i: i32 = 0;
while i < len {
acc = f(acc, vec_get(data, i));
i = i + 1;
}
acc
}
fn vec_any(data: Vec<i32>, pred: fn(i32) -> bool) -> bool {
let len = vec_len(data);
let mut i: i32 = 0;
while i < len {
if pred(vec_get(data, i)) { return true; }
i = i + 1;
}
false
}
fn vec_all(data: Vec<i32>, pred: fn(i32) -> bool) -> bool {
let len = vec_len(data);
let mut i: i32 = 0;
while i < len {
if !pred(vec_get(data, i)) { return false; }
i = i + 1;
}
true
}
fn vec_find(data: Vec<i32>, pred: fn(i32) -> bool) -> i32 {
let len = vec_len(data);
let mut i: i32 = 0;
while i < len {
let val = vec_get(data, i);
if pred(val) { return val; }
i = i + 1;
}
-1
}
fn vec_reduce(data: Vec<i32>, f: fn(i32, i32) -> i32) -> i32 {
let len = vec_len(data);
if len == 0 { return 0; }
let mut acc = vec_get(data, 0);
let mut i: i32 = 1;
while i < len {
acc = f(acc, vec_get(data, i));
i = i + 1;
}
acc
}
fn vec_foreach(data: Vec<i32>, f: fn(i32) -> i32) {
let len = vec_len(data);
let mut i: i32 = 0;
while i < len {
f(vec_get(data, i));
i = i + 1;
}
}