[−][src]Enum unicode_types::linear_b_syllabary::LinearBSyllabary
An enum to represent all characters in the LinearBSyllabary block.
Variants
LinearBSyllableB008A
\u{10000}: '𐀀'
LinearBSyllableB038E
\u{10001}: '𐀁'
LinearBSyllableB028I
\u{10002}: '𐀂'
LinearBSyllableB061O
\u{10003}: '𐀃'
LinearBSyllableB010U
\u{10004}: '𐀄'
LinearBSyllableB001Da
\u{10005}: '𐀅'
LinearBSyllableB045De
\u{10006}: '𐀆'
LinearBSyllableB007Di
\u{10007}: '𐀇'
LinearBSyllableB014Do
\u{10008}: '𐀈'
LinearBSyllableB051Du
\u{10009}: '𐀉'
LinearBSyllableB057Ja
\u{1000a}: '𐀊'
LinearBSyllableB046Je
\u{1000b}: '𐀋'
LinearBSyllableB036Jo
\u{1000d}: '𐀍'
LinearBSyllableB065Ju
\u{1000e}: '𐀎'
LinearBSyllableB077Ka
\u{1000f}: '𐀏'
LinearBSyllableB044Ke
\u{10010}: '𐀐'
LinearBSyllableB067Ki
\u{10011}: '𐀑'
LinearBSyllableB070Ko
\u{10012}: '𐀒'
LinearBSyllableB081Ku
\u{10013}: '𐀓'
LinearBSyllableB080Ma
\u{10014}: '𐀔'
LinearBSyllableB013Me
\u{10015}: '𐀕'
LinearBSyllableB073Mi
\u{10016}: '𐀖'
LinearBSyllableB015Mo
\u{10017}: '𐀗'
LinearBSyllableB023Mu
\u{10018}: '𐀘'
LinearBSyllableB006Na
\u{10019}: '𐀙'
LinearBSyllableB024Ne
\u{1001a}: '𐀚'
LinearBSyllableB030Ni
\u{1001b}: '𐀛'
LinearBSyllableB052No
\u{1001c}: '𐀜'
LinearBSyllableB055Nu
\u{1001d}: '𐀝'
LinearBSyllableB003Pa
\u{1001e}: '𐀞'
LinearBSyllableB072Pe
\u{1001f}: '𐀟'
LinearBSyllableB039Pi
\u{10020}: '𐀠'
LinearBSyllableB011Po
\u{10021}: '𐀡'
LinearBSyllableB050Pu
\u{10022}: '𐀢'
LinearBSyllableB016Qa
\u{10023}: '𐀣'
LinearBSyllableB078Qe
\u{10024}: '𐀤'
LinearBSyllableB021Qi
\u{10025}: '𐀥'
LinearBSyllableB032Qo
\u{10026}: '𐀦'
LinearBSyllableB060Ra
\u{10028}: '𐀨'
LinearBSyllableB027Re
\u{10029}: '𐀩'
LinearBSyllableB053Ri
\u{1002a}: '𐀪'
LinearBSyllableB002Ro
\u{1002b}: '𐀫'
LinearBSyllableB026Ru
\u{1002c}: '𐀬'
LinearBSyllableB031Sa
\u{1002d}: '𐀭'
LinearBSyllableB009Se
\u{1002e}: '𐀮'
LinearBSyllableB041Si
\u{1002f}: '𐀯'
LinearBSyllableB012So
\u{10030}: '𐀰'
LinearBSyllableB058Su
\u{10031}: '𐀱'
LinearBSyllableB059Ta
\u{10032}: '𐀲'
LinearBSyllableB004Te
\u{10033}: '𐀳'
LinearBSyllableB037Ti
\u{10034}: '𐀴'
LinearBSyllableB005To
\u{10035}: '𐀵'
LinearBSyllableB069Tu
\u{10036}: '𐀶'
LinearBSyllableB054Wa
\u{10037}: '𐀷'
LinearBSyllableB075We
\u{10038}: '𐀸'
LinearBSyllableB040Wi
\u{10039}: '𐀹'
LinearBSyllableB042Wo
\u{1003a}: '𐀺'
LinearBSyllableB017Za
\u{1003c}: '𐀼'
LinearBSyllableB074Ze
\u{1003d}: '𐀽'
LinearBSyllableB020Zo
\u{1003f}: '𐀿'
LinearBSyllableB025A2
\u{10040}: '𐁀'
LinearBSyllableB043A3
\u{10041}: '𐁁'
LinearBSyllableB085Au
\u{10042}: '𐁂'
LinearBSyllableB071Dwe
\u{10043}: '𐁃'
LinearBSyllableB090Dwo
\u{10044}: '𐁄'
LinearBSyllableB048Nwa
\u{10045}: '𐁅'
LinearBSyllableB029Pu2
\u{10046}: '𐁆'
LinearBSyllableB062Pte
\u{10047}: '𐁇'
LinearBSyllableB076Ra2
\u{10048}: '𐁈'
LinearBSyllableB033Ra3
\u{10049}: '𐁉'
LinearBSyllableB068Ro2
\u{1004a}: '𐁊'
LinearBSyllableB066Ta2
\u{1004b}: '𐁋'
LinearBSyllableB087Twe
\u{1004c}: '𐁌'
LinearBSyllableB091Two
\u{1004d}: '𐁍'
LinearBSymbolB018
\u{10050}: '𐁐'
LinearBSymbolB019
\u{10051}: '𐁑'
LinearBSymbolB022
\u{10052}: '𐁒'
LinearBSymbolB034
\u{10053}: '𐁓'
LinearBSymbolB047
\u{10054}: '𐁔'
LinearBSymbolB049
\u{10055}: '𐁕'
LinearBSymbolB056
\u{10056}: '𐁖'
LinearBSymbolB063
\u{10057}: '𐁗'
LinearBSymbolB064
\u{10058}: '𐁘'
LinearBSymbolB079
\u{10059}: '𐁙'
LinearBSymbolB082
\u{1005a}: '𐁚'
LinearBSymbolB083
\u{1005b}: '𐁛'
LinearBSymbolB086
\u{1005c}: '𐁜'
LinearBSymbolB089
\u{1005d}: '𐁝'
Methods
impl LinearBSyllabary
[src]
pub fn new() -> Self
[src]
The character with the lowest index in this unicode block
pub fn name(&self) -> &str
[src]
The character's name, all lowercase and space-separated
Trait Implementations
impl Iterator for LinearBSyllabary
[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,
[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<LinearBSyllabary> for LinearBSyllabary
[src]
fn eq(&self, other: &LinearBSyllabary) -> bool
[src]
#[must_use]
fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
This method tests for !=
.
impl Clone for LinearBSyllabary
[src]
ⓘImportant traits for LinearBSyllabaryfn clone(&self) -> LinearBSyllabary
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
Performs copy-assignment from source
. Read more
impl Into<char> for LinearBSyllabary
[src]
impl Into<u32> for LinearBSyllabary
[src]
impl Eq for LinearBSyllabary
[src]
impl Copy for LinearBSyllabary
[src]
impl Hash for LinearBSyllabary
[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 LinearBSyllabary
[src]
impl TryFrom<char> for LinearBSyllabary
[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 LinearBSyllabary
[src]
Auto Trait Implementations
impl Send for LinearBSyllabary
impl Sync for LinearBSyllabary
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>,