[−][src]Enum unicode_types::linear_b_ideograms::LinearBIdeograms
An enum to represent all characters in the LinearBIdeograms block.
Variants
LinearBIdeogramB100Man
\u{10080}: '𐂀'
LinearBIdeogramB102Woman
\u{10081}: '𐂁'
LinearBIdeogramB104Deer
\u{10082}: '𐂂'
LinearBIdeogramB105Equid
\u{10083}: '𐂃'
LinearBIdeogramB105fMare
\u{10084}: '𐂄'
LinearBIdeogramB105mStallion
\u{10085}: '𐂅'
LinearBIdeogramB106fEwe
\u{10086}: '𐂆'
LinearBIdeogramB106mRam
\u{10087}: '𐂇'
LinearBIdeogramB107fSheDashGoat
\u{10088}: '𐂈'
LinearBIdeogramB107mHeDashGoat
\u{10089}: '𐂉'
LinearBIdeogramB108fSow
\u{1008a}: '𐂊'
LinearBIdeogramB108mBoar
\u{1008b}: '𐂋'
LinearBIdeogramB109fCow
\u{1008c}: '𐂌'
LinearBIdeogramB109mBull
\u{1008d}: '𐂍'
LinearBIdeogramB120Wheat
\u{1008e}: '𐂎'
LinearBIdeogramB121Barley
\u{1008f}: '𐂏'
LinearBIdeogramB122Olive
\u{10090}: '𐂐'
LinearBIdeogramB123Spice
\u{10091}: '𐂑'
LinearBIdeogramB125Cyperus
\u{10092}: '𐂒'
LinearBMonogramB127Kapo
\u{10093}: '𐂓'
LinearBMonogramB128Kanako
\u{10094}: '𐂔'
LinearBIdeogramB130Oil
\u{10095}: '𐂕'
LinearBIdeogramB131Wine
\u{10096}: '𐂖'
LinearBIdeogramB132
\u{10097}: '𐂗'
LinearBMonogramB133Arepa
\u{10098}: '𐂘'
LinearBMonogramB135Meri
\u{10099}: '𐂙'
LinearBIdeogramB140Bronze
\u{1009a}: '𐂚'
LinearBIdeogramB141Gold
\u{1009b}: '𐂛'
LinearBIdeogramB142
\u{1009c}: '𐂜'
LinearBIdeogramB145Wool
\u{1009d}: '𐂝'
LinearBIdeogramB146
\u{1009e}: '𐂞'
LinearBIdeogramB150
\u{1009f}: '𐂟'
LinearBIdeogramB151Horn
\u{100a0}: '𐂠'
LinearBIdeogramB152
\u{100a1}: '𐂡'
LinearBIdeogramB153
\u{100a2}: '𐂢'
LinearBIdeogramB154
\u{100a3}: '𐂣'
LinearBMonogramB156Turo2
\u{100a4}: '𐂤'
LinearBIdeogramB157
\u{100a5}: '𐂥'
LinearBIdeogramB158
\u{100a6}: '𐂦'
LinearBIdeogramB159Cloth
\u{100a7}: '𐂧'
LinearBIdeogramB160
\u{100a8}: '𐂨'
LinearBIdeogramB161
\u{100a9}: '𐂩'
LinearBIdeogramB162Garment
\u{100aa}: '𐂪'
LinearBIdeogramB163Armour
\u{100ab}: '𐂫'
LinearBIdeogramB164
\u{100ac}: '𐂬'
LinearBIdeogramB165
\u{100ad}: '𐂭'
LinearBIdeogramB166
\u{100ae}: '𐂮'
LinearBIdeogramB167
\u{100af}: '𐂯'
LinearBIdeogramB168
\u{100b0}: '𐂰'
LinearBIdeogramB169
\u{100b1}: '𐂱'
LinearBIdeogramB170
\u{100b2}: '𐂲'
LinearBIdeogramB171
\u{100b3}: '𐂳'
LinearBIdeogramB172
\u{100b4}: '𐂴'
LinearBIdeogramB173Month
\u{100b5}: '𐂵'
LinearBIdeogramB174
\u{100b6}: '𐂶'
LinearBIdeogramB176Tree
\u{100b7}: '𐂷'
LinearBIdeogramB177
\u{100b8}: '𐂸'
LinearBIdeogramB178
\u{100b9}: '𐂹'
LinearBIdeogramB179
\u{100ba}: '𐂺'
LinearBIdeogramB180
\u{100bb}: '𐂻'
LinearBIdeogramB181
\u{100bc}: '𐂼'
LinearBIdeogramB182
\u{100bd}: '𐂽'
LinearBIdeogramB183
\u{100be}: '𐂾'
LinearBIdeogramB184
\u{100bf}: '𐂿'
LinearBIdeogramB185
\u{100c0}: '𐃀'
LinearBIdeogramB189
\u{100c1}: '𐃁'
LinearBIdeogramB190
\u{100c2}: '𐃂'
LinearBIdeogramB191Helmet
\u{100c3}: '𐃃'
LinearBIdeogramB220Footstool
\u{100c4}: '𐃄'
LinearBIdeogramB225Bathtub
\u{100c5}: '𐃅'
LinearBIdeogramB230Spear
\u{100c6}: '𐃆'
LinearBIdeogramB231Arrow
\u{100c7}: '𐃇'
LinearBIdeogramB232
\u{100c8}: '𐃈'
LinearBIdeogramB233Sword
\u{100c9}: '𐃉'
LinearBIdeogramB234
\u{100ca}: '𐃊'
LinearBIdeogramB236
\u{100cb}: '𐃋'
LinearBIdeogramB240WheeledChariot
\u{100cc}: '𐃌'
LinearBIdeogramB241Chariot
\u{100cd}: '𐃍'
LinearBIdeogramB242ChariotFrame
\u{100ce}: '𐃎'
LinearBIdeogramB243Wheel
\u{100cf}: '𐃏'
LinearBIdeogramB245
\u{100d0}: '𐃐'
LinearBIdeogramB246
\u{100d1}: '𐃑'
LinearBMonogramB247Dipte
\u{100d2}: '𐃒'
LinearBIdeogramB248
\u{100d3}: '𐃓'
LinearBIdeogramB249
\u{100d4}: '𐃔'
LinearBIdeogramB251
\u{100d5}: '𐃕'
LinearBIdeogramB252
\u{100d6}: '𐃖'
LinearBIdeogramB253
\u{100d7}: '𐃗'
LinearBIdeogramB254Dart
\u{100d8}: '𐃘'
LinearBIdeogramB255
\u{100d9}: '𐃙'
LinearBIdeogramB256
\u{100da}: '𐃚'
LinearBIdeogramB257
\u{100db}: '𐃛'
LinearBIdeogramB258
\u{100dc}: '𐃜'
LinearBIdeogramB259
\u{100dd}: '𐃝'
LinearBIdeogramVesselB155
\u{100de}: '𐃞'
LinearBIdeogramVesselB200
\u{100df}: '𐃟'
LinearBIdeogramVesselB201
\u{100e0}: '𐃠'
LinearBIdeogramVesselB202
\u{100e1}: '𐃡'
LinearBIdeogramVesselB203
\u{100e2}: '𐃢'
LinearBIdeogramVesselB204
\u{100e3}: '𐃣'
LinearBIdeogramVesselB205
\u{100e4}: '𐃤'
LinearBIdeogramVesselB206
\u{100e5}: '𐃥'
LinearBIdeogramVesselB207
\u{100e6}: '𐃦'
LinearBIdeogramVesselB208
\u{100e7}: '𐃧'
LinearBIdeogramVesselB209
\u{100e8}: '𐃨'
LinearBIdeogramVesselB210
\u{100e9}: '𐃩'
LinearBIdeogramVesselB211
\u{100ea}: '𐃪'
LinearBIdeogramVesselB212
\u{100eb}: '𐃫'
LinearBIdeogramVesselB213
\u{100ec}: '𐃬'
LinearBIdeogramVesselB214
\u{100ed}: '𐃭'
LinearBIdeogramVesselB215
\u{100ee}: '𐃮'
LinearBIdeogramVesselB216
\u{100ef}: '𐃯'
LinearBIdeogramVesselB217
\u{100f0}: '𐃰'
LinearBIdeogramVesselB218
\u{100f1}: '𐃱'
LinearBIdeogramVesselB219
\u{100f2}: '𐃲'
LinearBIdeogramVesselB221
\u{100f3}: '𐃳'
LinearBIdeogramVesselB222
\u{100f4}: '𐃴'
LinearBIdeogramVesselB226
\u{100f5}: '𐃵'
LinearBIdeogramVesselB227
\u{100f6}: '𐃶'
LinearBIdeogramVesselB228
\u{100f7}: '𐃷'
LinearBIdeogramVesselB229
\u{100f8}: '𐃸'
LinearBIdeogramVesselB250
\u{100f9}: '𐃹'
LinearBIdeogramVesselB305
\u{100fa}: '𐃺'
Methods
impl LinearBIdeograms
[src]
pub fn new() -> Self
[src]
The character with the lowest index in this unicode block
pub fn name(&self) -> String
[src]
The character's name, in sentence case
Trait Implementations
impl Copy for LinearBIdeograms
[src]
impl Iterator for LinearBIdeograms
[src]
type Item = Self
The type of the elements being iterated over.
fn next(&mut self) -> Option<Self>
[src]
fn size_hint(&self) -> (usize, Option<usize>)
1.0.0[src]
Returns the bounds on the remaining length of the iterator. Read more
fn count(self) -> usize
1.0.0[src]
Consumes the iterator, counting the number of iterations and returning it. Read more
fn last(self) -> Option<Self::Item>
1.0.0[src]
Consumes the iterator, returning the last element. Read more
fn nth(&mut self, n: usize) -> Option<Self::Item>
1.0.0[src]
Returns the n
th element of the iterator. Read more
fn step_by(self, step: usize) -> StepBy<Self>
1.28.0[src]
Creates an iterator starting at the same point, but stepping by the given amount at each iteration. Read more
fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator<Item = Self::Item>,
1.0.0[src]
U: IntoIterator<Item = Self::Item>,
Takes two iterators and creates a new iterator over both in sequence. Read more
fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator,
1.0.0[src]
U: IntoIterator,
'Zips up' two iterators into a single iterator of pairs. Read more
fn map<B, F>(self, f: F) -> Map<Self, F> where
F: FnMut(Self::Item) -> B,
1.0.0[src]
F: FnMut(Self::Item) -> B,
Takes a closure and creates an iterator which calls that closure on each element. Read more
fn for_each<F>(self, f: F) where
F: FnMut(Self::Item),
1.21.0[src]
F: FnMut(Self::Item),
Calls a closure on each element of an iterator. Read more
fn filter<P>(self, predicate: P) -> Filter<Self, P> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
Creates an iterator which uses a closure to determine if an element should be yielded. Read more
fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where
F: FnMut(Self::Item) -> Option<B>,
1.0.0[src]
F: FnMut(Self::Item) -> Option<B>,
Creates an iterator that both filters and maps. Read more
fn enumerate(self) -> Enumerate<Self>
1.0.0[src]
Creates an iterator which gives the current iteration count as well as the next value. Read more
fn peekable(self) -> Peekable<Self>
1.0.0[src]
Creates an iterator which can use peek
to look at the next element of the iterator without consuming it. Read more
fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
Creates an iterator that [skip
]s elements based on a predicate. Read more
fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
Creates an iterator that yields elements based on a predicate. Read more
fn skip(self, n: usize) -> Skip<Self>
1.0.0[src]
Creates an iterator that skips the first n
elements. Read more
fn take(self, n: usize) -> Take<Self>
1.0.0[src]
Creates an iterator that yields its first n
elements. Read more
fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where
F: FnMut(&mut St, Self::Item) -> Option<B>,
1.0.0[src]
F: FnMut(&mut St, Self::Item) -> Option<B>,
An iterator adaptor similar to [fold
] that holds internal state and produces a new iterator. Read more
fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where
F: FnMut(Self::Item) -> U,
U: IntoIterator,
1.0.0[src]
F: FnMut(Self::Item) -> U,
U: IntoIterator,
Creates an iterator that works like map, but flattens nested structure. Read more
fn flatten(self) -> Flatten<Self> where
Self::Item: IntoIterator,
1.29.0[src]
Self::Item: IntoIterator,
Creates an iterator that flattens nested structure. Read more
fn fuse(self) -> Fuse<Self>
1.0.0[src]
Creates an iterator which ends after the first [None
]. Read more
fn inspect<F>(self, f: F) -> Inspect<Self, F> where
F: FnMut(&Self::Item),
1.0.0[src]
F: FnMut(&Self::Item),
Do something with each element of an iterator, passing the value on. Read more
fn by_ref(&mut self) -> &mut Self
1.0.0[src]
Borrows an iterator, rather than consuming it. Read more
#[must_use = "if you really need to exhaust the iterator, consider `.for_each(drop)` instead"]
fn collect<B>(self) -> B where
B: FromIterator<Self::Item>,
1.0.0[src]
B: FromIterator<Self::Item>,
Transforms an iterator into a collection. Read more
fn partition<B, F>(self, f: F) -> (B, B) where
B: Default + Extend<Self::Item>,
F: FnMut(&Self::Item) -> bool,
1.0.0[src]
B: Default + Extend<Self::Item>,
F: FnMut(&Self::Item) -> bool,
Consumes an iterator, creating two collections from it. Read more
fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R where
F: FnMut(B, Self::Item) -> R,
R: Try<Ok = B>,
1.27.0[src]
F: FnMut(B, Self::Item) -> R,
R: Try<Ok = B>,
An iterator method that applies a function as long as it returns successfully, producing a single, final value. Read more
fn try_for_each<F, R>(&mut self, f: F) -> R where
F: FnMut(Self::Item) -> R,
R: Try<Ok = ()>,
1.27.0[src]
F: FnMut(Self::Item) -> R,
R: Try<Ok = ()>,
An iterator method that applies a fallible function to each item in the iterator, stopping at the first error and returning that error. Read more
fn fold<B, F>(self, init: B, f: F) -> B where
F: FnMut(B, Self::Item) -> B,
1.0.0[src]
F: FnMut(B, Self::Item) -> B,
An iterator method that applies a function, producing a single, final value. Read more
fn all<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool,
1.0.0[src]
F: FnMut(Self::Item) -> bool,
Tests if every element of the iterator matches a predicate. Read more
fn any<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool,
1.0.0[src]
F: FnMut(Self::Item) -> bool,
Tests if any element of the iterator matches a predicate. Read more
fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
Searches for an element of an iterator that satisfies a predicate. Read more
fn find_map<B, F>(&mut self, f: F) -> Option<B> where
F: FnMut(Self::Item) -> Option<B>,
1.30.0[src]
F: FnMut(Self::Item) -> Option<B>,
Applies function to the elements of iterator and returns the first non-none result. Read more
fn position<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool,
1.0.0[src]
P: FnMut(Self::Item) -> bool,
Searches for an element in an iterator, returning its index. Read more
fn rposition<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool,
Self: ExactSizeIterator + DoubleEndedIterator,
1.0.0[src]
P: FnMut(Self::Item) -> bool,
Self: ExactSizeIterator + DoubleEndedIterator,
Searches for an element in an iterator from the right, returning its index. Read more
fn max(self) -> Option<Self::Item> where
Self::Item: Ord,
1.0.0[src]
Self::Item: Ord,
Returns the maximum element of an iterator. Read more
fn min(self) -> Option<Self::Item> where
Self::Item: Ord,
1.0.0[src]
Self::Item: Ord,
Returns the minimum element of an iterator. Read more
fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where
B: Ord,
F: FnMut(&Self::Item) -> B,
1.6.0[src]
B: Ord,
F: FnMut(&Self::Item) -> B,
Returns the element that gives the maximum value from the specified function. Read more
fn max_by<F>(self, compare: F) -> Option<Self::Item> where
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
1.15.0[src]
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Returns the element that gives the maximum value with respect to the specified comparison function. Read more
fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where
B: Ord,
F: FnMut(&Self::Item) -> B,
1.6.0[src]
B: Ord,
F: FnMut(&Self::Item) -> B,
Returns the element that gives the minimum value from the specified function. Read more
fn min_by<F>(self, compare: F) -> Option<Self::Item> where
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
1.15.0[src]
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Returns the element that gives the minimum value with respect to the specified comparison function. Read more
fn rev(self) -> Rev<Self> where
Self: DoubleEndedIterator,
1.0.0[src]
Self: DoubleEndedIterator,
Reverses an iterator's direction. Read more
fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
Self: Iterator<Item = (A, B)>,
1.0.0[src]
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
Self: Iterator<Item = (A, B)>,
Converts an iterator of pairs into a pair of containers. Read more
fn copied<'a, T>(self) -> Copied<Self> where
Self: Iterator<Item = &'a T>,
T: 'a + Copy,
1.36.0[src]
Self: Iterator<Item = &'a T>,
T: 'a + Copy,
Creates an iterator which copies all of its elements. Read more
fn cloned<'a, T>(self) -> Cloned<Self> where
Self: Iterator<Item = &'a T>,
T: 'a + Clone,
1.0.0[src]
Self: Iterator<Item = &'a T>,
T: 'a + Clone,
Creates an iterator which [clone
]s all of its elements. Read more
fn cycle(self) -> Cycle<Self> where
Self: Clone,
1.0.0[src]
Self: Clone,
Repeats an iterator endlessly. Read more
fn sum<S>(self) -> S where
S: Sum<Self::Item>,
1.11.0[src]
S: Sum<Self::Item>,
Sums the elements of an iterator. Read more
fn product<P>(self) -> P where
P: Product<Self::Item>,
1.11.0[src]
P: Product<Self::Item>,
Iterates over the entire iterator, multiplying all the elements Read more
fn cmp<I>(self, other: I) -> Ordering where
I: IntoIterator<Item = Self::Item>,
Self::Item: Ord,
1.5.0[src]
I: IntoIterator<Item = Self::Item>,
Self::Item: Ord,
Lexicographically compares the elements of this Iterator
with those of another. Read more
fn partial_cmp<I>(self, other: I) -> Option<Ordering> where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Lexicographically compares the elements of this Iterator
with those of another. Read more
fn eq<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are equal to those of another. Read more
fn ne<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are unequal to those of another. Read more
fn lt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are lexicographically less than those of another. Read more
fn le<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are lexicographically less or equal to those of another. Read more
fn gt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are lexicographically greater than those of another. Read more
fn ge<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are lexicographically greater than or equal to those of another. Read more
fn is_sorted(self) -> bool where
Self::Item: PartialOrd<Self::Item>,
[src]
Self::Item: PartialOrd<Self::Item>,
🔬 This is a nightly-only experimental API. (is_sorted
)
new API
Checks if the elements of this iterator are sorted. Read more
fn is_sorted_by<F>(self, compare: F) -> bool where
F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,
[src]
F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,
🔬 This is a nightly-only experimental API. (is_sorted
)
new API
Checks if the elements of this iterator are sorted using the given comparator function. Read more
fn is_sorted_by_key<F, K>(self, f: F) -> bool where
F: FnMut(&Self::Item) -> K,
K: PartialOrd<K>,
[src]
F: FnMut(&Self::Item) -> K,
K: PartialOrd<K>,
🔬 This is a nightly-only experimental API. (is_sorted
)
new API
Checks if the elements of this iterator are sorted using the given key extraction function. Read more
impl PartialEq<LinearBIdeograms> for LinearBIdeograms
[src]
fn eq(&self, other: &LinearBIdeograms) -> bool
[src]
#[must_use]
fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
This method tests for !=
.
impl Clone for LinearBIdeograms
[src]
ⓘImportant traits for LinearBIdeogramsfn clone(&self) -> LinearBIdeograms
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
Performs copy-assignment from source
. Read more
impl Eq for LinearBIdeograms
[src]
impl Into<char> for LinearBIdeograms
[src]
impl Into<u32> for LinearBIdeograms
[src]
impl Debug for LinearBIdeograms
[src]
impl Hash for LinearBIdeograms
[src]
fn hash<__H: Hasher>(&self, state: &mut __H)
[src]
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
Feeds a slice of this type into the given [Hasher
]. Read more
impl TryFrom<char> for LinearBIdeograms
[src]
type Error = ()
The type returned in the event of a conversion error.
fn try_from(c: char) -> Result<Self, Self::Error>
[src]
impl TryFrom<u32> for LinearBIdeograms
[src]
Auto Trait Implementations
impl Send for LinearBIdeograms
impl Sync for LinearBIdeograms
Blanket Implementations
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T> From<T> for T
[src]
impl<I> IntoIterator for I where
I: Iterator,
[src]
I: Iterator,
type Item = <I as Iterator>::Item
The type of the elements being iterated over.
type IntoIter = I
Which kind of iterator are we turning this into?
fn into_iter(self) -> I
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,