HewStandard Library

Module std::deque

Double-ended queue (deque).

A growable ring-buffer that supports efficient insertion and removal at both ends.

Examples

import std::deque;

fn main() {
    let dq = deque.new();
    dq.push_back(1);
    dq.push_back(2);
    dq.push_front(0);
    println(dq.len());          // 3
    println(dq.pop_front());    // 0
    println(dq.pop_back());     // 2
    dq.free();
}

Contents

Functions

Function new

pub fn new() -> Deque

Create a new, empty deque.

Types

Struct Deque

An opaque double-ended queue handle.

Created by deque.new(). Must be freed with free() when no longer needed to avoid leaking memory.

Traits

Trait DequeMethods

Methods available on a Deque.

Methods

fn push_front(self: Self, value: i64)
fn push_back(self: Self, value: i64)
fn pop_front(self: Self) -> i64
fn pop_back(self: Self) -> i64
fn len(self: Self) -> i64
fn is_empty(self: Self) -> bool
fn free(self: Self)