Skip to content

stdlib/collectionsView source ↗

collections

14 items · generated by scribe fromstdlib/collections.fd· synced 2026-11-15

stdlib/collections14 items

Contents

Deque

A double-ended queue. Supports O(1) push/pop at both ends (amortized). Uses a Vec with head/tail indices and periodic compaction.

Example: var d = Deque::new(); d.push_back(2); d.push_front(1); d.push_back(3); assert_eq(d.len(), 3); assert_eq(d.get(0), 1); assert_eq(d.pop_front(), 1); assert_eq(d.pop_back(), 3); assert_eq(d.peek_front(), 2);

pub struct Deque<T> {

Fields:

NameType
dataVec<i64>, pub head: i64

Defined at line 31


Deque

impl Deque {

Defined at line 35


LinkedList

A singly linked list using parallel arrays for values and next pointers.

Example: var l = LinkedList::new(); l.push_back(2); l.push_front(1); l.push_back(3); assert_eq(l.len(), 3); assert_eq(l.get(2), 3); assert_eq(l.find(2), 1); assert_eq(l.pop_front(), 1); assert(l.contains(3));

pub struct LinkedList {

Fields:

NameType
valuesVec<i64>
nextsVec<i64>
headi64
taili64
sizei64

Defined at line 172


LinkedList

impl LinkedList {

Defined at line 184


Set

A simple set of i64 values backed by a Vec. Not efficient for large sets — use HashMap for that.

Example: var a = Set::new(); a.insert(1); a.insert(2); a.insert(2); var b = Set::new(); b.insert(2); b.insert(3); assert_eq(a.len(), 2); assert_eq(Set::union(a, b).len(), 3); assert_eq(Set::intersection(a, b).len(), 1); assert(Set::difference(a, b).contains(1));

pub struct Set {

Fields:

NameType
dataVec<i64>

Defined at line 321


Set

impl Set {

Defined at line 325


HashSet

A set of i64 values in a hash table (open addressing).

Example: var s = HashSet::new(); s.insert(10); s.insert(20); s.insert(10); assert_eq(s.len(), 2); assert(s.contains(20)); assert(s.remove(10)); assert(!s.contains(10));

pub struct HashSet {

Fields:

NameType
tablei64

Defined at line 467


HashSet

impl HashSet {

Defined at line 471


BTreeMap

An ordered map from i64 keys to i64 values (a sorted Vec of keys and a parallel Vec of values); keys() and values() come in key order.

Example: var m = BTreeMap::new(); m.insert(30, 300); m.insert(10, 100); m.insert(20, 200); assert_eq(m.get(20), 200); assert_eq(m.get_or(99, -1), -1); assert_eq(m.first_key(), 10); assert_eq(m.last_key(), 30); assert_eq(m.keys().get(1), 20);

pub struct BTreeMap {

Fields:

NameType
keysVec<i64>
valuesVec<i64>

Defined at line 851


BTreeMap

impl BTreeMap {

Defined at line 857


BTreeSet

An ordered set of i64 values (a sorted Vec); to_vec() is ascending.

Example: var s = BTreeSet::new(); s.insert(5); s.insert(1); s.insert(3); s.insert(1); assert_eq(s.len(), 3); assert_eq(s.first(), 1); assert_eq(s.last(), 5); assert_eq(s.to_vec().get(1), 3);

pub struct BTreeSet {

Fields:

NameType
dataVec<i64>

Defined at line 1003


BTreeSet

impl BTreeSet {

Defined at line 1007


RingBuffer

A fixed-capacity circular buffer: push overwrites the oldest element when full, try_push refuses instead.

Example: var r = RingBuffer::new(3); r.push(1); r.push(2); r.push(3); r.push(4); assert(r.is_full()); assert_eq(r.peek_front(), 2); assert(!r.try_push(5)); assert_eq(r.pop_front(), 2); assert_eq(r.to_vec().get(1), 4);

pub struct RingBuffer {

Fields:

NameType
dataVec<i64>
capacityi64
headi64
leni64

Defined at line 1165


RingBuffer

impl RingBuffer {

Defined at line 1175


Generated by scribe, the Fides documentation generator