Struct InlineTable
pub struct InlineTable { /* private fields */ }
dep_toml_edit
only.Expand description
Type representing a TOML inline table,
payload of the Value::InlineTable
variant
Implementations§
§impl InlineTable
Constructors
impl InlineTable
Constructors
See also FromIterator
pub fn new() -> InlineTable
pub fn new() -> InlineTable
Creates an empty table.
pub fn into_table(self) -> Table
pub fn into_table(self) -> Table
Convert to a table
§impl InlineTable
Formatting
impl InlineTable
Formatting
pub fn get_values(&self) -> Vec<(Vec<&Key>, &Value)> ⓘ
pub fn get_values(&self) -> Vec<(Vec<&Key>, &Value)> ⓘ
Get key/values for values that are visually children of this table
For example, this will return dotted keys
pub fn fmt(&mut self)
pub fn fmt(&mut self)
Auto formats the table.
pub fn sort_values(&mut self)
pub fn sort_values(&mut self)
Sorts the key/value pairs by key.
pub fn sort_values_by<F>(&mut self, compare: F)
pub fn sort_values_by<F>(&mut self, compare: F)
Sort Key/Value Pairs of the table using the using the comparison function compare
.
The comparison function receives two key and value pairs to compare (you can sort by keys or values or their combination as needed).
pub fn set_dotted(&mut self, yes: bool)
pub fn set_dotted(&mut self, yes: bool)
Change this table’s dotted status
pub fn is_dotted(&self) -> bool
pub fn is_dotted(&self) -> bool
Check if this is a wrapper for dotted keys, rather than a standard table
pub fn key_mut(&mut self, key: &str) -> Option<KeyMut<'_>> ⓘ
pub fn key_mut(&mut self, key: &str) -> Option<KeyMut<'_>> ⓘ
Returns an accessor to a key’s formatting
pub fn key_decor_mut(&mut self, key: &str) -> Option<&mut Decor> ⓘ
👎Deprecated since 0.21.1: Replaced with key_mut
pub fn key_decor_mut(&mut self, key: &str) -> Option<&mut Decor> ⓘ
key_mut
Returns the decor associated with a given key of the table.
pub fn key_decor(&self, key: &str) -> Option<&Decor> ⓘ
👎Deprecated since 0.21.1: Replaced with key_mut
pub fn key_decor(&self, key: &str) -> Option<&Decor> ⓘ
key_mut
Returns the decor associated with a given key of the table.
pub fn set_preamble(&mut self, preamble: impl Into<RawString>)
pub fn set_preamble(&mut self, preamble: impl Into<RawString>)
Set whitespace after before element
§impl InlineTable
impl InlineTable
pub fn iter(&self) -> Box<dyn Iterator<Item = (&str, &Value)> + '_>
pub fn iter(&self) -> Box<dyn Iterator<Item = (&str, &Value)> + '_>
Returns an iterator over key/value pairs.
pub fn iter_mut(
&mut self,
) -> Box<dyn Iterator<Item = (KeyMut<'_>, &mut Value)> + '_>
pub fn iter_mut( &mut self, ) -> Box<dyn Iterator<Item = (KeyMut<'_>, &mut Value)> + '_>
Returns an iterator over key/value pairs.
pub fn clear(&mut self)
pub fn clear(&mut self)
Clears the table, removing all key-value pairs. Keeps the allocated memory for reuse.
pub fn entry(&mut self, key: impl Into<InternalString>) -> InlineEntry<'_>
pub fn entry(&mut self, key: impl Into<InternalString>) -> InlineEntry<'_>
Gets the given key’s corresponding entry in the Table for in-place manipulation.
pub fn entry_format<'a>(&'a mut self, key: &Key) -> InlineEntry<'a>
pub fn entry_format<'a>(&'a mut self, key: &Key) -> InlineEntry<'a>
Gets the given key’s corresponding entry in the Table for in-place manipulation.
pub fn get(&self, key: &str) -> Option<&Value> ⓘ
pub fn get(&self, key: &str) -> Option<&Value> ⓘ
Return an optional reference to the value at the given the key.
pub fn get_mut(&mut self, key: &str) -> Option<&mut Value> ⓘ
pub fn get_mut(&mut self, key: &str) -> Option<&mut Value> ⓘ
Return an optional mutable reference to the value at the given the key.
pub fn get_key_value<'a>(&'a self, key: &str) -> Option<(&'a Key, &'a Item)> ⓘ
pub fn get_key_value<'a>(&'a self, key: &str) -> Option<(&'a Key, &'a Item)> ⓘ
Return references to the key-value pair stored for key, if it is present, else None.
pub fn get_key_value_mut<'a>(
&'a mut self,
key: &str,
) -> Option<(KeyMut<'a>, &'a mut Item)> ⓘ
pub fn get_key_value_mut<'a>( &'a mut self, key: &str, ) -> Option<(KeyMut<'a>, &'a mut Item)> ⓘ
Return mutable references to the key-value pair stored for key, if it is present, else None.
pub fn contains_key(&self, key: &str) -> bool
pub fn contains_key(&self, key: &str) -> bool
Returns true if the table contains given key.
pub fn get_or_insert<V>(
&mut self,
key: impl Into<InternalString>,
value: V,
) -> &mut Value
pub fn get_or_insert<V>( &mut self, key: impl Into<InternalString>, value: V, ) -> &mut Value
Inserts a key/value pair if the table does not contain the key. Returns a mutable reference to the corresponding value.
pub fn insert(
&mut self,
key: impl Into<InternalString>,
value: Value,
) -> Option<Value> ⓘ
pub fn insert( &mut self, key: impl Into<InternalString>, value: Value, ) -> Option<Value> ⓘ
Inserts a key-value pair into the map.
pub fn insert_formatted(&mut self, key: &Key, value: Value) -> Option<Value> ⓘ
pub fn insert_formatted(&mut self, key: &Key, value: Value) -> Option<Value> ⓘ
Inserts a key-value pair into the map.
Trait Implementations§
§impl Clone for InlineTable
impl Clone for InlineTable
§fn clone(&self) -> InlineTable
fn clone(&self) -> InlineTable
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read more§impl Debug for InlineTable
impl Debug for InlineTable
§impl Default for InlineTable
impl Default for InlineTable
§fn default() -> InlineTable
fn default() -> InlineTable
§impl Display for InlineTable
impl Display for InlineTable
§impl<K, V> Extend<(K, V)> for InlineTable
impl<K, V> Extend<(K, V)> for InlineTable
§fn extend<T>(&mut self, iter: T)where
T: IntoIterator<Item = (K, V)>,
fn extend<T>(&mut self, iter: T)where
T: IntoIterator<Item = (K, V)>,
Source§fn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)
extend_one
)Source§fn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one
)§impl From<InlineTable> for Value
impl From<InlineTable> for Value
§fn from(table: InlineTable) -> Value
fn from(table: InlineTable) -> Value
§impl<K, V> FromIterator<(K, V)> for InlineTable
impl<K, V> FromIterator<(K, V)> for InlineTable
§fn from_iter<I>(iter: I) -> InlineTablewhere
I: IntoIterator<Item = (K, V)>,
fn from_iter<I>(iter: I) -> InlineTablewhere
I: IntoIterator<Item = (K, V)>,
§impl<'s> Index<&'s str> for InlineTable
impl<'s> Index<&'s str> for InlineTable
§impl<'s> IndexMut<&'s str> for InlineTable
impl<'s> IndexMut<&'s str> for InlineTable
§impl<'s> IntoIterator for &'s InlineTable
impl<'s> IntoIterator for &'s InlineTable
§impl IntoIterator for InlineTable
impl IntoIterator for InlineTable
§type Item = (InternalString, Value)
type Item = (InternalString, Value)
§type IntoIter = Box<dyn Iterator<Item = (InternalString, Value)>>
type IntoIter = Box<dyn Iterator<Item = (InternalString, Value)>>
§fn into_iter(self) -> <InlineTable as IntoIterator>::IntoIter
fn into_iter(self) -> <InlineTable as IntoIterator>::IntoIter
§impl TableLike for InlineTable
impl TableLike for InlineTable
§fn iter(&self) -> Box<dyn Iterator<Item = (&str, &Item)> + '_>
fn iter(&self) -> Box<dyn Iterator<Item = (&str, &Item)> + '_>
§fn iter_mut(&mut self) -> Box<dyn Iterator<Item = (KeyMut<'_>, &mut Item)> + '_>
fn iter_mut(&mut self) -> Box<dyn Iterator<Item = (KeyMut<'_>, &mut Item)> + '_>
§fn clear(&mut self)
fn clear(&mut self)
§fn entry<'a>(&'a mut self, key: &str) -> Entry<'a>
fn entry<'a>(&'a mut self, key: &str) -> Entry<'a>
§fn entry_format<'a>(&'a mut self, key: &Key) -> Entry<'a>
fn entry_format<'a>(&'a mut self, key: &Key) -> Entry<'a>
§fn get<'s>(&'s self, key: &str) -> Option<&'s Item> ⓘ
fn get<'s>(&'s self, key: &str) -> Option<&'s Item> ⓘ
§fn get_mut<'s>(&'s mut self, key: &str) -> Option<&'s mut Item> ⓘ
fn get_mut<'s>(&'s mut self, key: &str) -> Option<&'s mut Item> ⓘ
§fn get_key_value<'a>(&'a self, key: &str) -> Option<(&'a Key, &'a Item)> ⓘ
fn get_key_value<'a>(&'a self, key: &str) -> Option<(&'a Key, &'a Item)> ⓘ
§fn get_key_value_mut<'a>(
&'a mut self,
key: &str,
) -> Option<(KeyMut<'a>, &'a mut Item)> ⓘ
fn get_key_value_mut<'a>( &'a mut self, key: &str, ) -> Option<(KeyMut<'a>, &'a mut Item)> ⓘ
§fn contains_key(&self, key: &str) -> bool
fn contains_key(&self, key: &str) -> bool
§fn insert(&mut self, key: &str, value: Item) -> Option<Item> ⓘ
fn insert(&mut self, key: &str, value: Item) -> Option<Item> ⓘ
§fn get_values(&self) -> Vec<(Vec<&Key>, &Value)> ⓘ
fn get_values(&self) -> Vec<(Vec<&Key>, &Value)> ⓘ
§fn sort_values(&mut self)
fn sort_values(&mut self)
§fn set_dotted(&mut self, yes: bool)
fn set_dotted(&mut self, yes: bool)
§fn is_dotted(&self) -> bool
fn is_dotted(&self) -> bool
§fn key_decor_mut(&mut self, key: &str) -> Option<&mut Decor> ⓘ
fn key_decor_mut(&mut self, key: &str) -> Option<&mut Decor> ⓘ
key_mut
Auto Trait Implementations§
impl Freeze for InlineTable
impl RefUnwindSafe for InlineTable
impl Send for InlineTable
impl Sync for InlineTable
impl Unpin for InlineTable
impl UnwindSafe for InlineTable
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
Source§impl<T> ByteSized for T
impl<T> ByteSized for T
Source§const BYTE_ALIGN: usize = _
const BYTE_ALIGN: usize = _
Source§fn byte_align(&self) -> usize
fn byte_align(&self) -> usize
Source§fn ptr_size_ratio(&self) -> [usize; 2]
fn ptr_size_ratio(&self) -> [usize; 2]
Source§impl<T, R> Chain<R> for Twhere
T: ?Sized,
impl<T, R> Chain<R> for Twhere
T: ?Sized,
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> ExtAny for T
impl<T> ExtAny for T
Source§fn type_hash_with<H: Hasher>(&self, hasher: H) -> u64
fn type_hash_with<H: Hasher>(&self, hasher: H) -> u64
TypeId
of Self
using a custom hasher.Source§fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
Source§impl<T> ExtMem for Twhere
T: ?Sized,
impl<T> ExtMem for Twhere
T: ?Sized,
Source§const NEEDS_DROP: bool = _
const NEEDS_DROP: bool = _
Source§fn mem_align_of<T>() -> usize
fn mem_align_of<T>() -> usize
Source§fn mem_align_of_val(&self) -> usize
fn mem_align_of_val(&self) -> usize
Source§fn mem_size_of<T>() -> usize
fn mem_size_of<T>() -> usize
Source§fn mem_size_of_val(&self) -> usize
fn mem_size_of_val(&self) -> usize
Source§fn mem_needs_drop(&self) -> bool
fn mem_needs_drop(&self) -> bool
true
if dropping values of this type matters. Read moreSource§fn mem_forget(self)where
Self: Sized,
fn mem_forget(self)where
Self: Sized,
self
without running its destructor. Read moreSource§fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
Source§unsafe fn mem_zeroed<T>() -> T
unsafe fn mem_zeroed<T>() -> T
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSource§unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSource§fn mem_as_bytes(&self) -> &[u8] ⓘ
fn mem_as_bytes(&self) -> &[u8] ⓘ
unsafe_slice
only.§impl<S> FromSample<S> for S
impl<S> FromSample<S> for S
fn from_sample_(s: S) -> S
Source§impl<T> Hook for T
impl<T> Hook for T
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more