Skip to content

stdlib/vecView source ↗

vec

12 items · generated by scribe fromstdlib/vec.fd· synced 2026-11-15

stdlib/vec12 items

Contents

Vec

A growable array. The basic operations (push, pop, len, get, set, …) are core’s; this module adds map, filter, fold and the other helpers.

Example: var v: Vec= Vec::new(); v.push(1); v.push(2); v.push(3); v.push(4); var doubled = v.map(fn(x: i64) -> i64 { x * 2 }); var evens = v.filter(fn(x: i64) -> bool { x % 2 == 0 }); var sum = v.fold(0, fn(acc: i64, x: i64) -> i64 { acc + x }); println(int_to_str(sum)); assert_eq(doubled.get(3), 8); assert_eq(evens.len(), 2); assert_eq(sum, 10); assert(v.any(fn(x: i64) -> bool { x > 3 })); assert_eq(v.position(fn(x: i64) -> bool { x == 3 }), 2);

pub struct Vec<T> {

Fields:

NameType
datai64
leni64, cap: i64

Defined at line 36


Vec

impl Vec {

Defined at line 41


vec_take

The first n elements (all of them if there are fewer) as a new Vec.

Example: var v: Vec= Vec::new(); v.push(10); v.push(20); v.push(30); var t = vec_take(v, 2); assert_eq(t.len(), 2); assert_eq(t.get(1), 20);

pub fn vec_take(self: Vec<i64>, n: i64) -> Vec<i64> {

Parameters:

  • self: Vec<i64>
  • n: i64

Returns: Vec<i64>

Defined at line 213


vec_skip

Everything after the first n elements, as a new Vec.

Example: var v: Vec= Vec::new(); v.push(10); v.push(20); v.push(30); var t = vec_skip(v, 1); assert_eq(t.len(), 2); assert_eq(t.get(0), 20);

pub fn vec_skip(self: Vec<i64>, n: i64) -> Vec<i64> {

Parameters:

  • self: Vec<i64>
  • n: i64

Returns: Vec<i64>

Defined at line 236


vec_zip

The elements of both Vecs interleaved pairwise (a0, b0, a1, b1, …), up to the length of the shorter one.

Example: var a: Vec= Vec::new(); a.push(1); a.push(2); var b: Vec= Vec::new(); b.push(10); b.push(20); b.push(30); var z = vec_zip(a, b); assert_eq(z.len(), 4); assert_eq(z.get(1), 10); assert_eq(z.get(2), 2);

pub fn vec_zip(self: Vec<i64>, other: Vec<i64>) -> Vec<i64> {

Parameters:

  • self: Vec<i64>
  • other: Vec<i64>

Returns: Vec<i64>

Defined at line 263


vec_enumerate

Index and element pairs flattened into one Vec (0, v0, 1, v1, …).

Example: var v: Vec= Vec::new(); v.push(7); v.push(8); var e = vec_enumerate(v); assert_eq(e.len(), 4); assert_eq(e.get(2), 1); assert_eq(e.get(3), 8);

pub fn vec_enumerate(self: Vec<i64>) -> Vec<i64> {

Parameters:

  • self: Vec<i64>

Returns: Vec<i64>

Defined at line 289


vec_flat_map

Concatenation of the Vecs that f returns for each element (f returns a Vec handle as an i64).

pub fn vec_flat_map(self: Vec<i64>, f: fn(i64) -> i64) -> Vec<i64> {

Parameters:

  • self: Vec<i64>
  • f: fn(i64) -> i64

Returns: Vec<i64>

Defined at line 303


vec_chunk

The start index of each chunk of size elements.

Example: var v: Vec= Vec::new(); v.push(1); v.push(2); v.push(3); v.push(4); v.push(5); var starts = vec_chunk(v, 2); assert_eq(starts.len(), 3); assert_eq(starts.get(2), 4);

pub fn vec_chunk(self: Vec<i64>, size: i64) -> Vec<i64> {

Parameters:

  • self: Vec<i64>
  • size: i64

Returns: Vec<i64>

Defined at line 328


vec_window

The start index of every full window of size consecutive elements.

Example: var v: Vec= Vec::new(); v.push(1); v.push(2); v.push(3); v.push(4); var starts = vec_window(v, 3); assert_eq(starts.len(), 2); assert_eq(starts.get(1), 1);

pub fn vec_window(self: Vec<i64>, size: i64) -> Vec<i64> {

Parameters:

  • self: Vec<i64>
  • size: i64

Returns: Vec<i64>

Defined at line 347


vec_dedup

Remove consecutive duplicates in place (sort first to remove all).

Example: var v: Vec= Vec::new(); v.push(1); v.push(1); v.push(2); v.push(2); v.push(1); vec_dedup(&mut v); assert_eq(v.len(), 3); assert_eq(v.get(2), 1);

pub fn vec_dedup(self: & mut Vec<i64>) -> void {

Parameters:

  • self: & mut Vec<i64>

Returns: void

Defined at line 369


vec_sort_by

Sort in place with a comparison function (negative, zero or positive, like a - b). Stable insertion sort.

Example: var v: Vec= Vec::new(); v.push(3); v.push(1); v.push(2); vec_sort_by(&mut v, fn(a: i64, b: i64) -> i64 { b - a }); assert_eq(v.get(0), 3); assert_eq(v.get(2), 1);

pub fn vec_sort_by(self: & mut Vec<i64>, cmp: fn(i64, i64) -> i64) -> void {

Parameters:

  • self: & mut Vec<i64>
  • cmp: fn(i64

Returns: void

Defined at line 395


vec_contains_val

Whether the Vec holds value.

Example: var v: Vec= Vec::new(); v.push(4); v.push(5); assert(vec_contains_val(v, 5)); assert(!vec_contains_val(v, 6));

pub fn vec_contains_val(self: Vec<i64>, value: i64) -> bool {

Parameters:

  • self: Vec<i64>
  • value: i64

Returns: bool

Defined at line 420


Generated by scribe, the Fides documentation generator