Struct CollationReorderingV1

pub struct CollationReorderingV1<'data> {
    pub min_high_no_reorder: u32,
    pub reorder_table: ZeroVec<'data, u8>,
    pub reorder_ranges: ZeroVec<'data, u32>,
}

Script reordering data

🚧 This code is considered unstable; it may change at any time, in breaking or non-breaking ways, including in SemVer minor releases. While the serde representation of data structs is guaranteed to be stable, their Rust representation might not be. Use with caution.

Fields

min_high_no_reorder: u32

Limit of last reordered range. 0 if no reordering or no split bytes.

Comment from ICU4C’s collationsettings.h

reorder_table: ZeroVec<'data, u8>

256-byte table for reordering permutation of primary lead bytes; NULL if no reordering. A 0 entry at a non-zero index means that the primary lead byte is “split” (there are different offsets for primaries that share that lead byte) and the reordering offset must be determined via the reorderRanges.

Comment from ICU4C’s collationsettings.h

reorder_ranges: ZeroVec<'data, u32>

Primary-weight ranges for script reordering, to be used by reorder(p) for split-reordered primary lead bytes.

Each entry is a (limit, offset) pair. The upper 16 bits of the entry are the upper 16 bits of the exclusive primary limit of a range. Primaries between the previous limit and this one have their lead bytes modified by the signed offset (-0xff..+0xff) stored in the lower 16 bits.

CollationData::makeReorderRanges() writes a full list where the first range (at least for terminators and separators) has a 0 offset. The last range has a non-zero offset. minHighNoReorder is set to the limit of that last range.

In the settings object, the initial ranges before the first split lead byte are omitted for efficiency; they are handled by reorder(p) via the reorderTable. If there are no split-reordered lead bytes, then no ranges are needed.

Comment from ICU4C’s collationsettings.h; names refer to ICU4C.

Implementations

impl<'data> CollationReorderingV1<'data>

pub(crate) fn reorder(&self, primary: u32) -> u32

fn reorder_ex(&self, primary: u32) -> u32

Trait Implementations

impl<'data> Clone for CollationReorderingV1<'data>

fn clone(&self) -> CollationReorderingV1<'data>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'data> Debug for CollationReorderingV1<'data>

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

Formats the value using the given formatter.

impl<'data> PartialEq for CollationReorderingV1<'data>

fn eq(&self, other: &CollationReorderingV1<'data>) -> bool

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

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

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

impl<'a> Yokeable<'a> for CollationReorderingV1<'static>

type Output = CollationReorderingV1<'a>

This type MUST be Self with the 'static replaced with 'a, i.e. Self<'a>

fn transform(&'a self) -> &'a Self::Output

This method must cast self between &'a Self<'static> and &'a Self<'a>.

fn transform_owned(self) -> Self::Output

This method must cast self between Self<'static> and Self<'a>.

unsafe fn make(this: Self::Output) -> Self

This method can be used to cast away Self<'a>’s lifetime.

fn transform_mut<F>(&'a mut self, f: F)

where F: 'static + for<'b> FnOnce(&'b mut Self::Output),

This method must cast self between &'a mut Self<'static> and &'a mut Self<'a>, and pass it to f.

impl<'zf, 'zf_inner> ZeroFrom<'zf, CollationReorderingV1<'zf_inner>> for CollationReorderingV1<'zf>

fn zero_from(this: &'zf CollationReorderingV1<'zf_inner>) -> Self

Clone the other C into a struct that may retain references into C.

impl<'data> StructuralPartialEq for CollationReorderingV1<'data>