pub struct List { /* private fields */ }
Expand description
Wrapper around RefCell<Vec
Implementations§
Source§impl List
impl List
pub fn borrow(&self) -> Ref<'_, Vec<Value>>
pub fn borrow_mut(&self) -> RefMut<'_, Vec<Value>>
pub fn into_inner(self) -> Vec<Value>
pub fn generator(list: Rc<List>) -> NativeGenerator
pub fn unwrap_or_clone(list: Rc<List>) -> Vec<Value>
pub fn sort(vec: &mut Vec<Value>) -> Result<(), Error>
Trait Implementations§
Source§impl FromIterator<Key> for List
impl FromIterator<Key> for List
Source§impl FromIterator<Value> for List
impl FromIterator<Value> for List
Source§impl PartialOrd for List
impl PartialOrd for List
impl StructuralPartialEq for List
Auto Trait Implementations§
impl !Freeze for List
impl !RefUnwindSafe for List
impl !Send for List
impl !Sync for List
impl Unpin for List
impl !UnwindSafe for List
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> SetParameter for T
impl<T> SetParameter for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).Source§unsafe fn to_subset_unchecked(&self) -> SS
unsafe fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.