Struct mofurun::unsorted_vec::UnsortedVec

pub struct UnsortedVec<T>(_);

An unsorted variant of the vector.

Implementations

impl<T> UnsortedVec<T>

Original functions.

pub fn new() -> UnsortedVec<T>

Creates a new empty UnsortedVec. This is different than Default because it does not require T to be Default.

Example

use mofurun::unsorted_vec::UnsortedVec;
pub fn main() {
#[derive(Debug)]
enum S {
A,
};
let s = UnsortedVec::<S>::new();
assert_eq!(s.len(), 0);
println!("{:?}", s);
}

pub fn push(self, item: T) -> Self

Push an element.

Example

let unsorted = UnsortedVec::default().push(1);
assert_eq!(unsorted.into_iter().next(), Some(1));

pub fn sort(self) -> SortedVec<T> where
    T: Ord, 

pub fn len(&self) -> usize

Trait Implementations

impl<T> AsRef<[T]> for UnsortedVec<T>

fn as_ref(&self) -> &[T]

Returns the reference.

impl<T: Debug> Debug for UnsortedVec<T>

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

Formats the value using the given formatter.

impl<T> Default for UnsortedVec<T> where
    T: Default, 

fn default() -> UnsortedVec<T>

Returns the "default value" for a type.

impl<T> Eq for UnsortedVec<T> where
    T: PartialEq + Eq, 

impl<T> IntoIterator for UnsortedVec<T>

UnsortedVec can be converted into an Iterator.

type Item = T

The type of the elements being iterated over.

type IntoIter = UnsortedVecIterator<Self::Item>

Which kind of iterator are we turning this into?

fn into_iter(self) -> UnsortedVecIterator<T>

Performs the conversion.

impl<T> PartialEq<UnsortedVec<T>> for UnsortedVec<T> where
    T: PartialEq, 

fn eq(&self, other: &Self) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=.