pub struct ArgList {
pub elems: Vec<Value>,
pub separator: ListSeparator,
/* private fields */
}Fields§
§elems: Vec<Value>§separator: ListSeparatorImplementations§
Source§impl ArgList
impl ArgList
pub fn new( elems: Vec<Value>, were_keywords_accessed: Rc<Cell<bool>>, keywords: BTreeMap<Identifier, Value>, separator: ListSeparator, ) -> Self
pub fn len(&self) -> usize
pub fn is_empty(&self) -> bool
pub fn is_blank(&self) -> bool
pub fn keywords(&self) -> &BTreeMap<Identifier, Value>
pub fn into_keywords(self) -> BTreeMap<Identifier, Value>
Trait Implementations§
impl Eq for ArgList
Auto Trait Implementations§
impl Freeze for ArgList
impl !RefUnwindSafe for ArgList
impl !Send for ArgList
impl !Sync for ArgList
impl Unpin for ArgList
impl !UnwindSafe for ArgList
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.