std/deque

Index

• type Deque
  • method Deque.push_back
  • method Deque.push_front
  • method Deque.pop_front
  • method Deque.pop_back
  • method Deque.front
  • method Deque.back
  • method Deque.get
  • method Deque.len
  • method Deque.is_empty
  • method Deque.to_list
• fn new

Types

Deque

struct Deque[T] {}

A double ended queue. A value, as List: a copy shares the elements until one of them is written, which then copies the ring once (O(n)).

Source: std/deque.xo:10

Deque.push_back

fn (var d: Deque[T]) push_back(x: T)

Source: std/deque.xo:13

Deque.push_front

fn (var d: Deque[T]) push_front(x: T)

Source: std/deque.xo:14

Deque.pop_front

fn (var d: Deque[T]) pop_front() -> T?

The first element, removed; None when empty.

Source: std/deque.xo:16

Deque.pop_back

fn (var d: Deque[T]) pop_back() -> T?

The last element, removed; None when empty.

Source: std/deque.xo:18

Deque.front

fn (d: Deque[T]) front() -> T?

Source: std/deque.xo:19

Deque.back

fn (d: Deque[T]) back() -> T?

Source: std/deque.xo:20

Deque.get

fn (d: Deque[T]) get(i: Int) -> T?

Element i from the front; None out of range.

Source: std/deque.xo:22

Deque.len

fn (d: Deque[T]) len() -> Int

Source: std/deque.xo:23

Deque.is_empty

fn (d: Deque[T]) is_empty() -> Bool

Source: std/deque.xo:24

Deque.to_list

fn (d: Deque[T]) to_list() -> List[T]

The elements front to back (iterate with for x in d.to_list()).

Source: std/deque.xo:26

Functions

new

fn new[T](cap: Int = 0) -> Deque[T]

Source: std/deque.xo:12