[−][src]Enum unicode_types::miao::Miao
An enum to represent all characters in the Miao block.
Variants
LetterPa\u{16f00}: '𖼀'
LetterBa\u{16f01}: '𖼁'
LetterYiPa\u{16f02}: '𖼂'
LetterPla\u{16f03}: '𖼃'
LetterMa\u{16f04}: '𖼄'
LetterMha\u{16f05}: '𖼅'
LetterArchaicMa\u{16f06}: '𖼆'
LetterFa\u{16f07}: '𖼇'
LetterVa\u{16f08}: '𖼈'
LetterVfa\u{16f09}: '𖼉'
LetterTa\u{16f0a}: '𖼊'
LetterDa\u{16f0b}: '𖼋'
LetterYiTta\u{16f0c}: '𖼌'
LetterYiTa\u{16f0d}: '𖼍'
LetterTta\u{16f0e}: '𖼎'
LetterDda\u{16f0f}: '𖼏'
LetterNa\u{16f10}: '𖼐'
LetterNha\u{16f11}: '𖼑'
LetterYiNna\u{16f12}: '𖼒'
LetterArchaicNa\u{16f13}: '𖼓'
LetterNna\u{16f14}: '𖼔'
LetterNnha\u{16f15}: '𖼕'
LetterLa\u{16f16}: '𖼖'
LetterLya\u{16f17}: '𖼗'
LetterLha\u{16f18}: '𖼘'
LetterLhya\u{16f19}: '𖼙'
LetterTlha\u{16f1a}: '𖼚'
LetterDlha\u{16f1b}: '𖼛'
LetterTlhya\u{16f1c}: '𖼜'
LetterDlhya\u{16f1d}: '𖼝'
LetterKa\u{16f1e}: '𖼞'
LetterGa\u{16f1f}: '𖼟'
LetterYiKa\u{16f20}: '𖼠'
LetterQa\u{16f21}: '𖼡'
LetterQga\u{16f22}: '𖼢'
LetterNga\u{16f23}: '𖼣'
LetterNgha\u{16f24}: '𖼤'
LetterArchaicNga\u{16f25}: '𖼥'
LetterHa\u{16f26}: '𖼦'
LetterXa\u{16f27}: '𖼧'
LetterGha\u{16f28}: '𖼨'
LetterGhha\u{16f29}: '𖼩'
LetterTssa\u{16f2a}: '𖼪'
LetterDzza\u{16f2b}: '𖼫'
LetterNya\u{16f2c}: '𖼬'
LetterNyha\u{16f2d}: '𖼭'
LetterTsha\u{16f2e}: '𖼮'
LetterDzha\u{16f2f}: '𖼯'
LetterYiTsha\u{16f30}: '𖼰'
LetterYiDzha\u{16f31}: '𖼱'
LetterReformedTsha\u{16f32}: '𖼲'
LetterSha\u{16f33}: '𖼳'
LetterSsa\u{16f34}: '𖼴'
LetterZha\u{16f35}: '𖼵'
LetterZsha\u{16f36}: '𖼶'
LetterTsa\u{16f37}: '𖼷'
LetterDza\u{16f38}: '𖼸'
LetterYiTsa\u{16f39}: '𖼹'
LetterSa\u{16f3a}: '𖼺'
LetterZa\u{16f3b}: '𖼻'
LetterZsa\u{16f3c}: '𖼼'
LetterZza\u{16f3d}: '𖼽'
LetterZzsa\u{16f3e}: '𖼾'
LetterArchaicZza\u{16f3f}: '𖼿'
LetterZzya\u{16f40}: '𖽀'
LetterZzsya\u{16f41}: '𖽁'
LetterWa\u{16f42}: '𖽂'
LetterAh\u{16f43}: '𖽃'
LetterHha\u{16f44}: '𖽄'
LetterBri\u{16f45}: '𖽅'
LetterSyi\u{16f46}: '𖽆'
LetterDzyi\u{16f47}: '𖽇'
LetterTe\u{16f48}: '𖽈'
LetterTse\u{16f49}: '𖽉'
LetterRte\u{16f4a}: '𖽊'
SignConsonantModifierBar\u{16f4f}: '𖽏'
LetterNasalization\u{16f50}: '𖽐'
SignAspiration\u{16f51}: '𖽑'
SignReformedVoicing\u{16f52}: '𖽒'
SignReformedAspiration\u{16f53}: '𖽓'
VowelSignA\u{16f54}: '𖽔'
VowelSignAa\u{16f55}: '𖽕'
VowelSignAhh\u{16f56}: '𖽖'
VowelSignAn\u{16f57}: '𖽗'
VowelSignAng\u{16f58}: '𖽘'
VowelSignO\u{16f59}: '𖽙'
VowelSignOo\u{16f5a}: '𖽚'
VowelSignWo\u{16f5b}: '𖽛'
VowelSignW\u{16f5c}: '𖽜'
VowelSignE\u{16f5d}: '𖽝'
VowelSignEn\u{16f5e}: '𖽞'
VowelSignEng\u{16f5f}: '𖽟'
VowelSignOey\u{16f60}: '𖽠'
VowelSignI\u{16f61}: '𖽡'
VowelSignIa\u{16f62}: '𖽢'
VowelSignIan\u{16f63}: '𖽣'
VowelSignIang\u{16f64}: '𖽤'
VowelSignIo\u{16f65}: '𖽥'
VowelSignIe\u{16f66}: '𖽦'
VowelSignIi\u{16f67}: '𖽧'
VowelSignIu\u{16f68}: '𖽨'
VowelSignIng\u{16f69}: '𖽩'
VowelSignU\u{16f6a}: '𖽪'
VowelSignUa\u{16f6b}: '𖽫'
VowelSignUan\u{16f6c}: '𖽬'
VowelSignUang\u{16f6d}: '𖽭'
VowelSignUu\u{16f6e}: '𖽮'
VowelSignUei\u{16f6f}: '𖽯'
VowelSignUng\u{16f70}: '𖽰'
VowelSignY\u{16f71}: '𖽱'
VowelSignYi\u{16f72}: '𖽲'
VowelSignAe\u{16f73}: '𖽳'
VowelSignAee\u{16f74}: '𖽴'
VowelSignErr\u{16f75}: '𖽵'
VowelSignRoundedErr\u{16f76}: '𖽶'
VowelSignEr\u{16f77}: '𖽷'
VowelSignRoundedEr\u{16f78}: '𖽸'
VowelSignAi\u{16f79}: '𖽹'
VowelSignEi\u{16f7a}: '𖽺'
VowelSignAu\u{16f7b}: '𖽻'
VowelSignOu\u{16f7c}: '𖽼'
VowelSignN\u{16f7d}: '𖽽'
VowelSignNg\u{16f7e}: '𖽾'
VowelSignUog\u{16f7f}: '𖽿'
VowelSignYui\u{16f80}: '𖾀'
VowelSignOg\u{16f81}: '𖾁'
VowelSignOer\u{16f82}: '𖾂'
VowelSignVw\u{16f83}: '𖾃'
VowelSignIg\u{16f84}: '𖾄'
VowelSignEa\u{16f85}: '𖾅'
VowelSignIong\u{16f86}: '𖾆'
VowelSignUi\u{16f87}: '𖾇'
ToneRight\u{16f8f}: '𖾏'
ToneTopRight\u{16f90}: '𖾐'
ToneAbove\u{16f91}: '𖾑'
ToneBelow\u{16f92}: '𖾒'
LetterToneDash2\u{16f93}: '𖾓'
LetterToneDash3\u{16f94}: '𖾔'
LetterToneDash4\u{16f95}: '𖾕'
LetterToneDash5\u{16f96}: '𖾖'
LetterToneDash6\u{16f97}: '𖾗'
LetterToneDash7\u{16f98}: '𖾘'
LetterToneDash8\u{16f99}: '𖾙'
LetterReformedToneDash1\u{16f9a}: '𖾚'
LetterReformedToneDash2\u{16f9b}: '𖾛'
LetterReformedToneDash4\u{16f9c}: '𖾜'
LetterReformedToneDash5\u{16f9d}: '𖾝'
LetterReformedToneDash6\u{16f9e}: '𖾞'
Methods
impl Miao[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 Iterator for Miao[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) -> usize1.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 nth 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 Self1.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, [src]
Self: Iterator<Item = &'a T>,
T: 'a + Copy,
iter_copied)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<Miao> for Miao[src]
fn eq(&self, other: &Miao) -> bool[src]
#[must_use]
fn ne(&self, other: &Rhs) -> bool1.0.0[src]
This method tests for !=.
impl Clone for Miao[src]
ⓘImportant traits for Miaofn clone(&self) -> Miao[src]
fn clone_from(&mut self, source: &Self)1.0.0[src]
Performs copy-assignment from source. Read more
impl Into<char> for Miao[src]
impl Into<u32> for Miao[src]
impl Eq for Miao[src]
impl Copy for Miao[src]
impl Hash for Miao[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 Debug for Miao[src]
impl TryFrom<char> for Miao[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 Miao[src]
Auto Trait Implementations
Blanket Implementations
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> From for T[src]
impl<T, U> Into for T where
U: From<T>, [src]
U: From<T>,
impl<T> ToOwned for T where
T: Clone, [src]
T: Clone,
impl<T, U> TryFrom 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> Borrow for T where
T: ?Sized, [src]
T: ?Sized,
impl<T> Any for T where
T: 'static + ?Sized, [src]
T: 'static + ?Sized,
impl<T> BorrowMut for T where
T: ?Sized, [src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T[src]
impl<T, U> TryInto for T where
U: TryFrom<T>, [src]
U: TryFrom<T>,