Struct LinkedList

pub struct LinkedList<T, A: Allocator = Global> { /* private fields */ }

Implementations

impl<T> LinkedList<T>

pub fn new() -> Self

impl<T, A: Allocator> LinkedList<T, A>

pub fn new_in(alloc: A) -> Self

pub fn push_front(&mut self, elem: T)

pub fn push_back(&mut self, elem: T)

pub fn pop_front(&mut self) -> Option<T>

pub fn pop_back(&mut self) -> Option<T>

pub fn front(&self) -> Option<&T>

pub fn front_mut(&mut self) -> Option<&mut T>

pub fn back(&self) -> Option<&T>

pub fn back_mut(&mut self) -> Option<&mut T>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn clear(&mut self)

pub fn iter(&self) -> Iter<'_, T>

pub fn iter_mut(&mut self) -> IterMut<'_, T>

pub fn cursor_mut(&mut self) -> CursorMut<'_, T, A>

Trait Implementations

impl<T, A: Allocator + Default> BorshDeserialize for LinkedList<T, A>

where T: BorshDeserialize,

fn deserialize_reader<R: Read>(reader: &mut R) -> Result<Self>

fn deserialize(buf: &mut &[u8]) -> Result<Self, Error>

Deserializes this instance from a given slice of bytes. Updates the buffer to point at the remaining bytes.

fn try_from_slice(v: &[u8]) -> Result<Self, Error>

Deserialize this instance from a slice of bytes.

fn try_from_reader<R>(reader: &mut R) -> Result<Self, Error>

where R: Read,

impl<T, A: Allocator> BorshSerialize for LinkedList<T, A>

where T: BorshSerialize,

fn serialize<W: Write>(&self, writer: &mut W) -> Result<()>

impl<T: Clone, A: Allocator + Clone> Clone for LinkedList<T, A>

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T> DeBin for LinkedList<T>

where T: DeBin,

fn de_bin(o: &mut usize, d: &[u8]) -> Result<LinkedList<T>, DeBinErr>

Parse Self from the input bytes starting at index offset.

fn deserialize_bin(d: &[u8]) -> Result<Self, DeBinErr>

Parse Self from the input bytes.

impl<T> DeJson for LinkedList<T>

where T: DeJson,

fn de_json( s: &mut DeJsonState, i: &mut Chars<'_>, ) -> Result<LinkedList<T>, DeJsonErr>

Parse Self from the input string.

fn deserialize_json(input: &str) -> Result<Self, DeJsonErr>

Parse Self from the input string.

impl<T> DeRon for LinkedList<T>

where T: DeRon,

fn de_ron( s: &mut DeRonState, i: &mut Chars<'_>, ) -> Result<LinkedList<T>, DeRonErr>

Parse Self from a RON string.

fn deserialize_ron(input: &str) -> Result<Self, DeRonErr>

Parse Self from a RON string.

impl<T: Debug, A: Allocator> Debug for LinkedList<T, A>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T, A: Allocator + Default> Default for LinkedList<T, A>

fn default() -> Self

Returns the “default value” for a type.

impl<'de, T, A> Deserialize<'de> for LinkedList<T, A>

where T: Deserialize<'de>, A: Allocator + Default,

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T: Deserialize, A: Allocator + Default> Deserialize for LinkedList<T, A>

fn begin(out: &mut Option<Self>) -> &mut dyn Visitor

The only correct implementation of this method is:

impl<T, A: Allocator> Drop for LinkedList<T, A>

fn drop(&mut self)

Executes the destructor for this type.

impl<T, A: Allocator> Extend<T> for LinkedList<T, A>

fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<T, A: Allocator + Default> FromIterator<T> for LinkedList<T, A>

fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self

Creates a value from an iterator.

impl<T: Hash, A: Allocator> Hash for LinkedList<T, A>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'a, T, A: Allocator> IntoIterator for &'a LinkedList<T, A>

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

type Item = &'a T

The type of the elements being iterated over.

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, T, A: Allocator> IntoIterator for &'a mut LinkedList<T, A>

type IntoIter = IterMut<'a, T>

Which kind of iterator are we turning this into?

type Item = &'a mut T

The type of the elements being iterated over.

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T, A: Allocator> IntoIterator for LinkedList<T, A>

type IntoIter = IntoIter<T, A>

Which kind of iterator are we turning this into?

type Item = T

The type of the elements being iterated over.

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: Ord, A: Allocator> Ord for LinkedList<T, A>

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<T, U, A1, A2> PartialEq<LinkedList<U, A2>> for LinkedList<T, A1>

where T: PartialEq<U>, A1: Allocator, A2: Allocator,

fn eq(&self, other: &LinkedList<U, A2>) -> 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, A1, A2> PartialOrd<LinkedList<T, A2>> for LinkedList<T, A1>

where T: PartialOrd, A1: Allocator, A2: Allocator,

fn partial_cmp(&self, other: &LinkedList<T, A2>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T> SerBin for LinkedList<T>

where T: SerBin,

fn ser_bin(&self, s: &mut Vec<u8>)

Serialize Self to bytes.

fn serialize_bin(&self) -> Vec<u8>

Serialize Self to bytes.

impl<T> SerJson for LinkedList<T>

where T: SerJson,

fn ser_json(&self, d: usize, s: &mut SerJsonState)

Serialize Self to a JSON string.

fn serialize_json(&self) -> String

Serialize Self to a JSON string.

impl<T> SerRon for LinkedList<T>

where T: SerRon,

fn ser_ron(&self, d: usize, s: &mut SerRonState)

Serialize Self to a RON string.

fn serialize_ron(&self) -> String

Serialize Self to a RON string.

impl<T, A> Serialize for LinkedList<T, A>

where T: Serialize, A: Allocator,

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl<T: Serialize, A: Allocator> Serialize for LinkedList<T, A>

fn begin(&self) -> Fragment<'_>

impl<T: Eq, A: Allocator> Eq for LinkedList<T, A>

impl<T: Send> Send for LinkedList<T>

impl<T: Sync> Sync for LinkedList<T>