[−][src]Enum unicode_types::geometric_shapes::GeometricShapes
An enum to represent all characters in the GeometricShapes block.
Variants
BlackSquare
\u{25a0}: '■'
WhiteSquare
\u{25a1}: '□'
WhiteSquareWithRoundedCorners
\u{25a2}: '▢'
WhiteSquareContainingBlackSmallSquare
\u{25a3}: '▣'
SquareWithHorizontalFill
\u{25a4}: '▤'
SquareWithVerticalFill
\u{25a5}: '▥'
SquareWithOrthogonalCrosshatchFill
\u{25a6}: '▦'
SquareWithUpperLeftToLowerRightFill
\u{25a7}: '▧'
SquareWithUpperRightToLowerLeftFill
\u{25a8}: '▨'
SquareWithDiagonalCrosshatchFill
\u{25a9}: '▩'
BlackSmallSquare
\u{25aa}: '▪'
WhiteSmallSquare
\u{25ab}: '▫'
BlackRectangle
\u{25ac}: '▬'
WhiteRectangle
\u{25ad}: '▭'
BlackVerticalRectangle
\u{25ae}: '▮'
WhiteVerticalRectangle
\u{25af}: '▯'
BlackParallelogram
\u{25b0}: '▰'
WhiteParallelogram
\u{25b1}: '▱'
BlackUpDashPointingTriangle
\u{25b2}: '▲'
WhiteUpDashPointingTriangle
\u{25b3}: '△'
BlackUpDashPointingSmallTriangle
\u{25b4}: '▴'
WhiteUpDashPointingSmallTriangle
\u{25b5}: '▵'
BlackRightDashPointingTriangle
\u{25b6}: '▶'
WhiteRightDashPointingTriangle
\u{25b7}: '▷'
BlackRightDashPointingSmallTriangle
\u{25b8}: '▸'
WhiteRightDashPointingSmallTriangle
\u{25b9}: '▹'
BlackRightDashPointingPointer
\u{25ba}: '►'
WhiteRightDashPointingPointer
\u{25bb}: '▻'
BlackDownDashPointingTriangle
\u{25bc}: '▼'
WhiteDownDashPointingTriangle
\u{25bd}: '▽'
BlackDownDashPointingSmallTriangle
\u{25be}: '▾'
WhiteDownDashPointingSmallTriangle
\u{25bf}: '▿'
BlackLeftDashPointingTriangle
\u{25c0}: '◀'
WhiteLeftDashPointingTriangle
\u{25c1}: '◁'
BlackLeftDashPointingSmallTriangle
\u{25c2}: '◂'
WhiteLeftDashPointingSmallTriangle
\u{25c3}: '◃'
BlackLeftDashPointingPointer
\u{25c4}: '◄'
WhiteLeftDashPointingPointer
\u{25c5}: '◅'
BlackDiamond
\u{25c6}: '◆'
WhiteDiamond
\u{25c7}: '◇'
WhiteDiamondContainingBlackSmallDiamond
\u{25c8}: '◈'
Fisheye
\u{25c9}: '◉'
Lozenge
\u{25ca}: '◊'
WhiteCircle
\u{25cb}: '○'
DottedCircle
\u{25cc}: '◌'
CircleWithVerticalFill
\u{25cd}: '◍'
Bullseye
\u{25ce}: '◎'
BlackCircle
\u{25cf}: '●'
CircleWithLeftHalfBlack
\u{25d0}: '◐'
CircleWithRightHalfBlack
\u{25d1}: '◑'
CircleWithLowerHalfBlack
\u{25d2}: '◒'
CircleWithUpperHalfBlack
\u{25d3}: '◓'
CircleWithUpperRightQuadrantBlack
\u{25d4}: '◔'
CircleWithAllButUpperLeftQuadrantBlack
\u{25d5}: '◕'
LeftHalfBlackCircle
\u{25d6}: '◖'
RightHalfBlackCircle
\u{25d7}: '◗'
InverseBullet
\u{25d8}: '◘'
InverseWhiteCircle
\u{25d9}: '◙'
UpperHalfInverseWhiteCircle
\u{25da}: '◚'
LowerHalfInverseWhiteCircle
\u{25db}: '◛'
UpperLeftQuadrantCircularArc
\u{25dc}: '◜'
UpperRightQuadrantCircularArc
\u{25dd}: '◝'
LowerRightQuadrantCircularArc
\u{25de}: '◞'
LowerLeftQuadrantCircularArc
\u{25df}: '◟'
UpperHalfCircle
\u{25e0}: '◠'
LowerHalfCircle
\u{25e1}: '◡'
BlackLowerRightTriangle
\u{25e2}: '◢'
BlackLowerLeftTriangle
\u{25e3}: '◣'
BlackUpperLeftTriangle
\u{25e4}: '◤'
BlackUpperRightTriangle
\u{25e5}: '◥'
WhiteBullet
\u{25e6}: '◦'
SquareWithLeftHalfBlack
\u{25e7}: '◧'
SquareWithRightHalfBlack
\u{25e8}: '◨'
SquareWithUpperLeftDiagonalHalfBlack
\u{25e9}: '◩'
SquareWithLowerRightDiagonalHalfBlack
\u{25ea}: '◪'
WhiteSquareWithVerticalBisectingLine
\u{25eb}: '◫'
WhiteUpDashPointingTriangleWithDot
\u{25ec}: '◬'
UpDashPointingTriangleWithLeftHalfBlack
\u{25ed}: '◭'
UpDashPointingTriangleWithRightHalfBlack
\u{25ee}: '◮'
LargeCircle
\u{25ef}: '◯'
WhiteSquareWithUpperLeftQuadrant
\u{25f0}: '◰'
WhiteSquareWithLowerLeftQuadrant
\u{25f1}: '◱'
WhiteSquareWithLowerRightQuadrant
\u{25f2}: '◲'
WhiteSquareWithUpperRightQuadrant
\u{25f3}: '◳'
WhiteCircleWithUpperLeftQuadrant
\u{25f4}: '◴'
WhiteCircleWithLowerLeftQuadrant
\u{25f5}: '◵'
WhiteCircleWithLowerRightQuadrant
\u{25f6}: '◶'
WhiteCircleWithUpperRightQuadrant
\u{25f7}: '◷'
UpperLeftTriangle
\u{25f8}: '◸'
UpperRightTriangle
\u{25f9}: '◹'
LowerLeftTriangle
\u{25fa}: '◺'
WhiteMediumSquare
\u{25fb}: '◻'
BlackMediumSquare
\u{25fc}: '◼'
WhiteMediumSmallSquare
\u{25fd}: '◽'
BlackMediumSmallSquare
\u{25fe}: '◾'
Methods
impl GeometricShapes
[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 GeometricShapes
[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<GeometricShapes> for GeometricShapes
[src]
fn eq(&self, other: &GeometricShapes) -> bool
[src]
#[must_use]
fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
This method tests for !=
.
impl Clone for GeometricShapes
[src]
ⓘImportant traits for GeometricShapesfn clone(&self) -> GeometricShapes
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
Performs copy-assignment from source
. Read more
impl Into<char> for GeometricShapes
[src]
impl Into<u32> for GeometricShapes
[src]
impl Eq for GeometricShapes
[src]
impl Copy for GeometricShapes
[src]
impl Hash for GeometricShapes
[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 GeometricShapes
[src]
impl TryFrom<char> for GeometricShapes
[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 GeometricShapes
[src]
Auto Trait Implementations
impl Send for GeometricShapes
impl Sync for GeometricShapes
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>,