pub struct CollationReordering<'data> {
pub min_high_no_reorder: u32,
pub reorder_table: ZeroVec<'data, u8>,
pub reorder_ranges: ZeroVec<'data, u32>,
}
Expand description
Script reordering data
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.
Trait Implementations§
Source§impl<'data> Bake for CollationReordering<'data>
impl<'data> Bake for CollationReordering<'data>
Source§fn bake(&self, env: &CrateEnv) -> TokenStream
fn bake(&self, env: &CrateEnv) -> TokenStream
Source§impl<'data> BakeSize for CollationReordering<'data>
impl<'data> BakeSize for CollationReordering<'data>
Source§fn borrows_size(&self) -> usize
fn borrows_size(&self) -> usize
Source§impl<'data> Clone for CollationReordering<'data>
impl<'data> Clone for CollationReordering<'data>
Source§fn clone(&self) -> CollationReordering<'data>
fn clone(&self) -> CollationReordering<'data>
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moreSource§impl<'data> Debug for CollationReordering<'data>
impl<'data> Debug for CollationReordering<'data>
Source§impl<'de: 'data, 'data> Deserialize<'de> for CollationReordering<'data>
impl<'de: 'data, 'data> Deserialize<'de> for CollationReordering<'data>
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Source§impl MaybeAsVarULE for CollationReordering<'_>
impl MaybeAsVarULE for CollationReordering<'_>
Source§type EncodedStruct = [()]
type EncodedStruct = [()]
VarULE
] type for this data struct, or [()]
if it cannot be represented as [VarULE
].Source§impl MaybeEncodeAsVarULE for CollationReordering<'_>
impl MaybeEncodeAsVarULE for CollationReordering<'_>
Source§fn maybe_encode_as_varule(&self) -> Option<&Self::EncodedStruct>
fn maybe_encode_as_varule(&self) -> Option<&Self::EncodedStruct>
MaybeAsVarULE::EncodedStruct
] that represents this data struct,
or None
if the data struct does not support this representation.Source§impl<'data> PartialEq for CollationReordering<'data>
impl<'data> PartialEq for CollationReordering<'data>
Source§impl<'data> Serialize for CollationReordering<'data>
impl<'data> Serialize for CollationReordering<'data>
Source§impl<'a> Yokeable<'a> for CollationReordering<'static>
impl<'a> Yokeable<'a> for CollationReordering<'static>
Source§type Output = CollationReordering<'a>
type Output = CollationReordering<'a>
Self
with the 'static
replaced with 'a
, i.e. Self<'a>
Source§fn transform_owned(self) -> Self::Output
fn transform_owned(self) -> Self::Output
Source§unsafe fn make(this: Self::Output) -> Self
unsafe fn make(this: Self::Output) -> Self
Self<'a>
’s lifetime. Read moreSource§fn transform_mut<F>(&'a mut self, f: F)where
F: 'static + for<'b> FnOnce(&'b mut Self::Output),
fn transform_mut<F>(&'a mut self, f: F)where
F: 'static + for<'b> FnOnce(&'b mut Self::Output),
self
between &'a mut Self<'static>
and &'a mut Self<'a>
,
and pass it to f
. Read moreSource§impl<'zf, 'zf_inner> ZeroFrom<'zf, CollationReordering<'zf_inner>> for CollationReordering<'zf>
impl<'zf, 'zf_inner> ZeroFrom<'zf, CollationReordering<'zf_inner>> for CollationReordering<'zf>
Source§fn zero_from(this: &'zf CollationReordering<'zf_inner>) -> Self
fn zero_from(this: &'zf CollationReordering<'zf_inner>) -> Self
C
into a struct that may retain references into C
.impl<'data> StructuralPartialEq for CollationReordering<'data>
Auto Trait Implementations§
impl<'data> Freeze for CollationReordering<'data>
impl<'data> RefUnwindSafe for CollationReordering<'data>
impl<'data> Send for CollationReordering<'data>
impl<'data> Sync for CollationReordering<'data>
impl<'data> Unpin for CollationReordering<'data>
impl<'data> UnwindSafe for CollationReordering<'data>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more