[−][src]Enum unicode_types::tibetan::Tibetan
An enum to represent all characters in the Tibetan block.
Variants
SyllableOm\u{f00}: 'ༀ'
MarkGterYigMgoTruncatedA\u{f01}: '༁'
MarkGterYigMgoDashUmRnamBcadMa\u{f02}: '༂'
MarkGterYigMgoDashUmGterTshegMa\u{f03}: '༃'
MarkInitialYigMgoMdunMa\u{f04}: '༄'
MarkClosingYigMgoSgabMa\u{f05}: '༅'
MarkCaretYigMgoPhurShadMa\u{f06}: '༆'
MarkYigMgoTshegShadMa\u{f07}: '༇'
MarkSbrulShad\u{f08}: '༈'
MarkBskurYigMgo\u{f09}: '༉'
MarkBkaDashShogYigMgo\u{f0a}: '༊'
MarkIntersyllabicTsheg\u{f0b}: '་'
MarkDelimiterTshegBstar\u{f0c}: '༌'
MarkShad\u{f0d}: '།'
MarkNyisShad\u{f0e}: '༎'
MarkTshegShad\u{f0f}: '༏'
MarkNyisTshegShad\u{f10}: '༐'
MarkRinChenSpungsShad\u{f11}: '༑'
MarkRgyaGramShad\u{f12}: '༒'
\u{f13}: '༓'
MarkGterTsheg\u{f14}: '༔'
\u{f15}: '༕'
\u{f16}: '༖'
\u{f17}: '༗'
AstrologicalSignDashKhyudPa\u{f18}: '༘'
AstrologicalSignSdongTshugs\u{f19}: '༙'
SignRdelDkarGcig\u{f1a}: '༚'
SignRdelDkarGnyis\u{f1b}: '༛'
SignRdelDkarGsum\u{f1c}: '༜'
SignRdelNagGcig\u{f1d}: '༝'
SignRdelNagGnyis\u{f1e}: '༞'
SignRdelDkarRdelNag\u{f1f}: '༟'
DigitZero\u{f20}: '༠'
DigitOne\u{f21}: '༡'
DigitTwo\u{f22}: '༢'
DigitThree\u{f23}: '༣'
DigitFour\u{f24}: '༤'
DigitFive\u{f25}: '༥'
DigitSix\u{f26}: '༦'
DigitSeven\u{f27}: '༧'
DigitEight\u{f28}: '༨'
DigitNine\u{f29}: '༩'
DigitHalfOne\u{f2a}: '༪'
DigitHalfTwo\u{f2b}: '༫'
DigitHalfThree\u{f2c}: '༬'
DigitHalfFour\u{f2d}: '༭'
DigitHalfFive\u{f2e}: '༮'
DigitHalfSix\u{f2f}: '༯'
DigitHalfSeven\u{f30}: '༰'
DigitHalfEight\u{f31}: '༱'
DigitHalfNine\u{f32}: '༲'
DigitHalfZero\u{f33}: '༳'
\u{f34}: '༴'
MarkNgasBzungNyiZla\u{f35}: '༵'
\u{f36}: '༶'
\u{f37}: '༷'
MarkCheMgo\u{f38}: '༸'
MarkTsaDashPhru\u{f39}: '༹'
\u{f3a}: '༺'
\u{f3b}: '༻'
MarkAngKhangGyon\u{f3c}: '༼'
MarkAngKhangGyas\u{f3d}: '༽'
SignYarTshes\u{f3e}: '༾'
SignMarTshes\u{f3f}: '༿'
LetterKa\u{f40}: 'ཀ'
LetterKha\u{f41}: 'ཁ'
LetterGa\u{f42}: 'ག'
LetterGha\u{f43}: 'གྷ'
LetterNga\u{f44}: 'ང'
LetterCa\u{f45}: 'ཅ'
LetterCha\u{f46}: 'ཆ'
LetterJa\u{f47}: 'ཇ'
LetterNya\u{f49}: 'ཉ'
LetterTta\u{f4a}: 'ཊ'
LetterTtha\u{f4b}: 'ཋ'
LetterDda\u{f4c}: 'ཌ'
LetterDdha\u{f4d}: 'ཌྷ'
LetterNna\u{f4e}: 'ཎ'
LetterTa\u{f4f}: 'ཏ'
LetterTha\u{f50}: 'ཐ'
LetterDa\u{f51}: 'ད'
LetterDha\u{f52}: 'དྷ'
LetterNa\u{f53}: 'ན'
LetterPa\u{f54}: 'པ'
LetterPha\u{f55}: 'ཕ'
LetterBa\u{f56}: 'བ'
LetterBha\u{f57}: 'བྷ'
LetterMa\u{f58}: 'མ'
LetterTsa\u{f59}: 'ཙ'
LetterTsha\u{f5a}: 'ཚ'
LetterDza\u{f5b}: 'ཛ'
LetterDzha\u{f5c}: 'ཛྷ'
LetterWa\u{f5d}: 'ཝ'
LetterZha\u{f5e}: 'ཞ'
LetterZa\u{f5f}: 'ཟ'
LetterDashA\u{f60}: 'འ'
LetterYa\u{f61}: 'ཡ'
LetterRa\u{f62}: 'ར'
LetterLa\u{f63}: 'ལ'
LetterSha\u{f64}: 'ཤ'
LetterSsa\u{f65}: 'ཥ'
LetterSa\u{f66}: 'ས'
LetterHa\u{f67}: 'ཧ'
LetterA\u{f68}: 'ཨ'
LetterKssa\u{f69}: 'ཀྵ'
LetterFixedDashFormRa\u{f6a}: 'ཪ'
LetterKka\u{f6b}: 'ཫ'
LetterRra\u{f6c}: 'ཬ'
VowelSignAa\u{f71}: 'ཱ'
VowelSignI\u{f72}: 'ི'
VowelSignIi\u{f73}: 'ཱི'
VowelSignU\u{f74}: 'ུ'
VowelSignUu\u{f75}: 'ཱུ'
VowelSignVocalicR\u{f76}: 'ྲྀ'
VowelSignVocalicRr\u{f77}: 'ཷ'
VowelSignVocalicL\u{f78}: 'ླྀ'
VowelSignVocalicLl\u{f79}: 'ཹ'
VowelSignE\u{f7a}: 'ེ'
VowelSignEe\u{f7b}: 'ཻ'
VowelSignO\u{f7c}: 'ོ'
VowelSignOo\u{f7d}: 'ཽ'
SignRjesSuNgaRo\u{f7e}: 'ཾ'
SignRnamBcad\u{f7f}: 'ཿ'
VowelSignReversedI\u{f80}: 'ྀ'
VowelSignReversedIi\u{f81}: 'ཱྀ'
SignNyiZlaNaaDa\u{f82}: 'ྂ'
SignSnaLdan\u{f83}: 'ྃ'
MarkHalanta\u{f84}: '྄'
MarkPaluta\u{f85}: '྅'
\u{f86}: '྆'
\u{f87}: '྇'
SignLceTsaCan\u{f88}: 'ྈ'
SignMchuCan\u{f89}: 'ྉ'
SignGruCanRgyings\u{f8a}: 'ྊ'
SignGruMedRgyings\u{f8b}: 'ྋ'
SignInvertedMchuCan\u{f8c}: 'ྌ'
SubjoinedSignLceTsaCan\u{f8d}: 'ྍ'
SubjoinedSignMchuCan\u{f8e}: 'ྎ'
SubjoinedSignInvertedMchuCan\u{f8f}: 'ྏ'
SubjoinedLetterKa\u{f90}: 'ྐ'
SubjoinedLetterKha\u{f91}: 'ྑ'
SubjoinedLetterGa\u{f92}: 'ྒ'
SubjoinedLetterGha\u{f93}: 'ྒྷ'
SubjoinedLetterNga\u{f94}: 'ྔ'
SubjoinedLetterCa\u{f95}: 'ྕ'
SubjoinedLetterCha\u{f96}: 'ྖ'
SubjoinedLetterJa\u{f97}: 'ྗ'
SubjoinedLetterNya\u{f99}: 'ྙ'
SubjoinedLetterTta\u{f9a}: 'ྚ'
SubjoinedLetterTtha\u{f9b}: 'ྛ'
SubjoinedLetterDda\u{f9c}: 'ྜ'
SubjoinedLetterDdha\u{f9d}: 'ྜྷ'
SubjoinedLetterNna\u{f9e}: 'ྞ'
SubjoinedLetterTa\u{f9f}: 'ྟ'
SubjoinedLetterTha\u{fa0}: 'ྠ'
SubjoinedLetterDa\u{fa1}: 'ྡ'
SubjoinedLetterDha\u{fa2}: 'ྡྷ'
SubjoinedLetterNa\u{fa3}: 'ྣ'
SubjoinedLetterPa\u{fa4}: 'ྤ'
SubjoinedLetterPha\u{fa5}: 'ྥ'
SubjoinedLetterBa\u{fa6}: 'ྦ'
SubjoinedLetterBha\u{fa7}: 'ྦྷ'
SubjoinedLetterMa\u{fa8}: 'ྨ'
SubjoinedLetterTsa\u{fa9}: 'ྩ'
SubjoinedLetterTsha\u{faa}: 'ྪ'
SubjoinedLetterDza\u{fab}: 'ྫ'
SubjoinedLetterDzha\u{fac}: 'ྫྷ'
SubjoinedLetterWa\u{fad}: 'ྭ'
SubjoinedLetterZha\u{fae}: 'ྮ'
SubjoinedLetterZa\u{faf}: 'ྯ'
SubjoinedLetterDashA\u{fb0}: 'ྰ'
SubjoinedLetterYa\u{fb1}: 'ྱ'
SubjoinedLetterRa\u{fb2}: 'ྲ'
SubjoinedLetterLa\u{fb3}: 'ླ'
SubjoinedLetterSha\u{fb4}: 'ྴ'
SubjoinedLetterSsa\u{fb5}: 'ྵ'
SubjoinedLetterSa\u{fb6}: 'ྶ'
SubjoinedLetterHa\u{fb7}: 'ྷ'
SubjoinedLetterA\u{fb8}: 'ྸ'
SubjoinedLetterKssa\u{fb9}: 'ྐྵ'
SubjoinedLetterFixedDashFormWa\u{fba}: 'ྺ'
SubjoinedLetterFixedDashFormYa\u{fbb}: 'ྻ'
SubjoinedLetterFixedDashFormRa\u{fbc}: 'ྼ'
KuRuKha\u{fbe}: '྾'
KuRuKhaBzhiMigCan\u{fbf}: '྿'
CantillationSignHeavyBeat\u{fc0}: '࿀'
CantillationSignLightBeat\u{fc1}: '࿁'
CantillationSignCangTeDashU\u{fc2}: '࿂'
CantillationSignSbubDashChal\u{fc3}: '࿃'
SymbolDrilBu\u{fc4}: '࿄'
SymbolRdoRje\u{fc5}: '࿅'
SymbolPadmaGdan\u{fc6}: '࿆'
SymbolRdoRjeRgyaGram\u{fc7}: '࿇'
SymbolPhurPa\u{fc8}: '࿈'
SymbolNorBu\u{fc9}: '࿉'
SymbolNorBuNyisDashKhyil\u{fca}: '࿊'
SymbolNorBuGsumDashKhyil\u{fcb}: '࿋'
SymbolNorBuBzhiDashKhyil\u{fcc}: '࿌'
SignRdelNagRdelDkar\u{fce}: '࿎'
SignRdelNagGsum\u{fcf}: '࿏'
MarkBskaDashShogGiMgoRgyan\u{fd0}: '࿐'
MarkMnyamYigGiMgoRgyan\u{fd1}: '࿑'
MarkNyisTsheg\u{fd2}: '࿒'
MarkInitialBrdaRnyingYigMgoMdunMa\u{fd3}: '࿓'
MarkClosingBrdaRnyingYigMgoSgabMa\u{fd4}: '࿔'
RightDashFacingSvastiSign\u{fd5}: '࿕'
LeftDashFacingSvastiSign\u{fd6}: '࿖'
RightDashFacingSvastiSignWithDots\u{fd7}: '࿗'
LeftDashFacingSvastiSignWithDots\u{fd8}: '࿘'
\u{fd9}: '࿙'
\u{fda}: '࿚'
Methods
impl Tibetan[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 Tibetan[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<Tibetan> for Tibetan[src]
fn eq(&self, other: &Tibetan) -> bool[src]
#[must_use]
fn ne(&self, other: &Rhs) -> bool1.0.0[src]
This method tests for !=.
impl Clone for Tibetan[src]
ⓘImportant traits for Tibetanfn clone(&self) -> Tibetan[src]
fn clone_from(&mut self, source: &Self)1.0.0[src]
Performs copy-assignment from source. Read more
impl Into<char> for Tibetan[src]
impl Into<u32> for Tibetan[src]
impl Eq for Tibetan[src]
impl Copy for Tibetan[src]
impl Hash for Tibetan[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 Tibetan[src]
impl TryFrom<char> for Tibetan[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 Tibetan[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>,