Enum HelperTextComponent

Source

pub enum HelperTextComponent {
    Div,
    Ul,
}

Variants§

§

Div

§

Ul

Trait Implementations§

Source §

impl Clone for HelperTextComponent

Source §

fn clone(&self) -> HelperTextComponent

Returns a duplicate of the value. Read more

1.0.0§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more

Source §

impl Debug for HelperTextComponent

Source §

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more

Source §

impl Default for HelperTextComponent

Source §

fn default() -> HelperTextComponent

Returns the “default value” for a type. Read more

Source §

impl PartialEq for HelperTextComponent

Source §

fn eq(&self, other: &HelperTextComponent) -> bool

Tests for self and other values to be equal, and is used by ==.

1.0.0§

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

Source §

impl ToString for HelperTextComponent

Source §

fn to_string(&self) -> String

Converts the given value to a String. Read more

Source §

impl Copy for HelperTextComponent

Source §

impl Eq for HelperTextComponent

Source §

impl StructuralPartialEq for HelperTextComponent

Auto Trait Implementations§

§

impl UnwindSafe for HelperTextComponent

Blanket Implementations§

§

impl<T> Any for T
where T: 'static + ?Sized,

§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

§

impl<T> Borrow<T> for T
where T: ?Sized,

§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

§

impl<T> BorrowMut<T> for T
where T: ?Sized,

§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

§

impl<T> CloneToUninit for T
where T: Clone,

§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)

Performs copy-assignment from self to dest. Read more

Source §

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source §

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more

Source §

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source §

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.

§

impl<T> From<T> for T

§

fn from(t: T) -> T

Returns the argument unchanged.

Source §

impl<T> Instrument for T

Source §

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more

Source §

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more

§

impl<T, U> Into for T
where U: From<T>,

§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source §

impl<T> IntoPropValue<Option<T>> for T

Source §

fn into_prop_value(self) -> Option<T>

Convert self to a value of a Properties struct.

Source §

impl<T> IntoPropValue<T> for T

Source §

fn into_prop_value(self) -> T

Convert self to a value of a Properties struct.

Source §

impl<T> IntoTruncateContent for T
where T: ToString,

Source §

fn truncate_before(self, num: usize) -> TruncateContent

This function is supposed to truncate num characters before the end of the string.

§Bytes, Code Points, and Grapheme Clusters

However, what it actually does is to truncate the string at the next Unicode code point, after num bytes (not characters). This is quick and should work reasonably well with the Latin 1 character set (or, UTF-8 characters which are represented by a single byte).

Given a string with multi-byte code points, or even grapheme clusters (user-perceived characters, which may consists of multiple Unicode code points), this will split at the wrong location.

It will still split, and not skip any data. But it might lead to an unexpected (shorter) end section.

What about an actual correct implementation? That would be possible by using an additional dependency. It would also need to count all code points and grapheme clusters from the start of the string. The question is: is that worth it? Maybe, maybe not!?

Source §