Struct List

pub struct List<T: ToValue + FromValue>(/* private fields */);

List<A> wraps an OCaml 'a list without converting it to Rust, this introduces no additional overhead compared to a Value type

Implementations

impl<T: ToValue + FromValue> List<T>

pub fn empty() -> List<T>

An empty list

pub unsafe fn len(&self) -> usize

Returns the number of items in self

pub fn is_empty(&self) -> bool

Returns true when the list is empty

pub unsafe fn add(self, rt: &Runtime, v: &T) -> List<T>

Add an element to the front of the list returning the new list

pub fn hd(&self) -> Option<Value>

List head

pub fn tl(&self) -> List<T>

List tail

pub fn into_vec(self) -> Vec<T>

List as Vec

pub fn into_linked_list(self) -> LinkedList<T>

List as LinkedList

pub fn into_iter(self) -> ListIterator

List iterator

Trait Implementations

impl<T: Clone + ToValue + FromValue> Clone for List<T>

fn clone(&self) -> List<T>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: ToValue + FromValue> FromValue for List<T>

fn from_value(value: Value) -> Self

Convert from OCaml value

impl<T: ToValue + FromValue> IntoIterator for List<T>

type Item = Value

The type of the elements being iterated over.

type IntoIter = ListIterator

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: PartialEq + ToValue + FromValue> PartialEq for List<T>

fn eq(&self, other: &List<T>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: ToValue + FromValue> ToValue for List<T>

fn to_value(&self, _rt: &Runtime) -> Value

Convert to OCaml value

impl<T: Eq + ToValue + FromValue> Eq for List<T>

impl<T: ToValue + FromValue> StructuralPartialEq for List<T>