668 lines
279 KiB
Plaintext
668 lines
279 KiB
Plaintext
|
rust
|
|||
|
|
W[ #rustc 1.93.0 (254b59607 2026-01-19)Á³VOÐêùÿ²?ÑL¼�§Ì± -a7a40eb546f9e2b0Á zerofromÁˆo“ÄÄx(ÃjBsÖ ›ªÅ -e7a4aaab09db7e3aÁ zerofrom_deriveÁ¿ &èéXЕ)ˆ ç -03b1dd1f2d87713aÁ ë&Gf·Ã ¬ëñq:¤»b -bb76018b1173caf6Á zerovecÁ9°I=µá’Ún÷£øתwÓ -187d4334a3106b07Á zerovec_deriveÁ44½é—FsÉR-*±È -f6b5d17a820a0cf7Á yokeÁÓ\¾^Œ†ícN¼è¸¼bH -17a2be691e559186Á stable_deref_traitÁþÖ›#Ÿžõ E4Õèr -80e318edb62c0e9cÁ yoke_deriveÁÙ@’÷ò +çšFåc�z -5e7d4687001d5481Á
|
|||
|
|
potential_utfÁüQ¿®R 2¡zI!�„Õ¯ -eb006b8a7f73122fÁ
|
|||
|
|
displaydocÁà¿ÿ©]n´ùRèê] -8a7302fc0e16b6baÁ ‰ á,� ¶<î á<ø Œî 4 builderÁ<Ƕ<¢á<¬Œ¢4 conversionsÁ\î¶<Öá<àŒÖ5á4ð¶<Ñ serdeÁ<ÛŒÑ5’4¥¶<þÛ<ˆŒþ5 ׶<³á<½Œ³5 UnicodeCodePointÁ„Ý&¶<¤&Û<®&Œ¤&5 testsÁ,þÞà$óÞ fØ,® à$£ 4 CodePointInversionListBuilderÁìÁ¶<œá<¦Œœw‰ìž¶<íá<÷Œíw’4½¶<•á<ŸŒ•w�DŶ á w ú¶<Öá<àŒÖwØ,²Xà$§X � CodePointInversionListÁ´Ô¶<£á<Œ£�Ÿd‹¶<çá<ñŒç� UleErrorÁDɶ<£á<Œ£�Ø,‰«à$þª °Ø,Àà$µ Œ tomlÁ$‘
|
|||
|
|
¶<õ Û<ÿ Œõ ŒÛ,¶
|
|||
|
|
¶<ž
|
|||
|
|
Û<¨
|
|||
|
|
Œž
|
|||
|
|
ÀØ,ˆà$ý ³
|
|||
|
|
char16trieÁ trieÁ !MAX_BRANCH_LINEAR_SUB_NODE_LENGTHÁ MIN_LINEAR_MATCHÁ MAX_LINEAR_MATCH_LENGTHÁ MIN_VALUE_LEADÁ NODE_TYPE_MASKÁ VALUE_IS_FINALÁ MAX_ONE_UNIT_VALUEÁ MIN_TWO_UNIT_VALUE_LEADÁ MAX_ONE_UNIT_NODE_VALUEÁ MIN_TWO_UNIT_NODE_VALUE_LEADÁ THREE_UNIT_NODE_VALUE_LEADÁ THREE_UNIT_VALUE_LEADÁ MAX_ONE_UNIT_DELTAÁ MIN_TWO_UNIT_DELTA_LEADÁ THREE_UNIT_DELTA_LEADÁ
|
|||
|
|
skip_valueÁ skip_node_valueÁ 'dataÁ • £ u16_leadÁ u16_tailÁ trie_unwrapÁ ! 'aÁ !• !¥ ! next32Á ! next16Á ! branch_nextÁ ! next_implÁ ! stopÁ !
|
|||
|
|
jump_by_deltaÁ !¬ !
|
|||
|
|
skip_deltaÁ ! value_resultÁ ! get_valueÁ !
|
|||
|
|
read_valueÁ ! read_node_valueÁ codepointinvlistÁ 4 cpinvlistÁ 5 555555555 5
|
|||
|
|
5 5 5
|
|||
|
|
55 BMP_MAXÁ 5 BMP_INV_LIST_VECÁ 5 ALL_VECÁ 5 H× H try_from_inversion_listÁ J H from_parts_uncheckedÁ Hà H bmpÁ H
|
|||
|
|
iter_charsÁ O O H iter_rangesÁ R R H iter_ranges_complementedÁ U U H get_range_countÁ H
|
|||
|
|
get_nth_rangeÁ Hè H is_emptyÁ H contains_queryÁ H containsÁ H
|
|||
|
|
contains32Á H contains_rangeÁ _ impl RangeBounds<char>Á H contains_setÁ H spanÁ b H span_backÁ d 4 utilsÁ f ffffffff is_valid_zvÁ o f deconstruct_rangeÁ q™ q impl RangeBounds<T>Á 4 44 codepointinvliststringlistÁ w wwwwwwwww �× �‰ �È �è � has_stringsÁ � contains_strÁ �² �£ � code_pointsÁ � stringsÁ
|
|||
|
|
codepointtrieÁ Œ cptrieÁ � ��������� �
|
|||
|
|
� � � TrieValueÁ › TryFromU32ErrorÁ › try_from_u32Á › to_u32Á � impl_primitive_trie_valueÁ � maybe_filter_valueÁ ™ � ¢” ¢‰ � wÁ �¦ 'trieÁ ¦™ ¦ from_parts_unstable_unchecked_v1Á ¦ try_newÁ ¦ validate_fieldsÁ ¦ to_typedÁ ¦ as_typed_refÁ ¦ trie_error_val_indexÁ ¦ internal_small_indexÁ ¦ small_indexÁ ¦
|
|||
|
|
fast_indexÁ ¦ get32_by_fast_indexÁ ¦ get32_assuming_fast_indexÁ ¦ get32_by_small_index_coldÁ ¦ get32_by_small_indexÁ ¦ get32Á ¦ getÁ ¦ get16Á ¦ get32_supplementaryÁ ¦ get32_uleÁ ¦ get_rangeÁ ¦� ¦ iter_ranges_for_valueÁ ½ ½ ½ ¦ iter_ranges_mappedÁ Á¥ Á UÁ Á impl FnMut(T) -> U + Copy + 'aÁ Á Á ¦ error_valueÁ �È™ È get32_u32Á �Ë™ ËÈ � CodePointMapRangeIteratorÁ Î¥ Ι Î cptÁ Î cpm_rangeÁ �Ó™ Ó½ Ó¥ � SealÁ � TypedCodePointTrieÁ ؈ Ø™ Ø TRIE_TYPEÁ Øö Øý ØŠ Øò Øå Øì Ø as_untyped_refÁ Ø
|
|||
|
|
to_untypedÁ �äˆ ä™ ä¼ äý ä“! äý �ëˆ ë™ �îˆ î™ î” î‰ �óˆ ó™ ó” ó‰ � øˆ ø™ ø¼ øý ø“! �
|
|||
|
|
þˆ þ™ � �ˆ �™ �” �‰ � †ˆ †™ †” †‰ � TypedÁ ‹ FÁ ‹ SÁ ‹ FastÁ Ž
|
|||
|
|
Žì ‹ SmallÁ ‘
|
|||
|
|
‘ì Œ errorÁ ” ” Œ
|
|||
|
|
impl_constÁ — FAST_TYPE_SHIFTÁ — FAST_TYPE_DATA_BLOCK_LENGTHÁ — FAST_TYPE_DATA_MASKÁ — FAST_TYPE_FAST_INDEXING_MAXÁ — SMALL_TYPE_FAST_INDEXING_MAXÁ — ERROR_VALUE_NEG_DATA_OFFSETÁ — HIGH_VALUE_NEG_DATA_OFFSETÁ — BMP_INDEX_LENGTHÁ — SMALL_LIMITÁ — SMALL_INDEX_LENGTHÁ — SHIFT_3Á — SHIFT_2Á — SHIFT_1Á — SHIFT_2_3Á — SHIFT_1_2Á — OMITTED_BMP_INDEX_1_LENGTHÁ — INDEX_2_BLOCK_LENGTHÁ — INDEX_2_MASKÁ — CP_PER_INDEX_2_ENTRYÁ — INDEX_3_BLOCK_LENGTHÁ — INDEX_3_MASKÁ — SMALL_DATA_BLOCK_LENGTHÁ — SMALL_DATA_MASKÁ — CODE_POINT_MAXÁ Œ planesÁ ° °° INDEX_ARRAY_AS_BYTESÁ ° get_planes_trieÁ Œ ŒŒŒŒŒŒŒŒŒ Œ
|
|||
|
|
iterator_utilsÁ À À RangeListIteratorCoalescerÁ  IÁ ™ £  peekÁ À ÇÝ* Ç™ Ç• ÀËÝ* Ë™ ˽ Ë¥
|
|||
|
|
Char16TrieÁ Ð× Ð dataÁ Ó× ÓÈ Ö× ÖÍ Ù× Û× ÛÕ Þ× Þ˜ á 'zfÁ á 'zf_innerÁ á zero_fromÁ Char16TrieIteratorÁ å¥ åí
|
|||
|
|
å posÁ å remaining_match_lengthÁ ê¥ êÈ
|
|||
|
|
TrieResultÁ í NoMatchÁ î
|
|||
|
|
í NoValueÁ ð
|
|||
|
|
í
|
|||
|
|
FinalValueÁ ò
|
|||
|
|
òì í IntermediateÁ õ
|
|||
|
|
õì
|
|||
|
|
ùÈ üÍ
|
|||
|
|
ÿÕ F G 5 CodePointInversionListULEÁ ƒè ƒ inv_listÁ 5†× † encode_var_ule_as_slicesÁ ˆ RÁ ˆ impl FnOnce(&[&[u8]]) -> RÁ † encode_var_ule_lenÁ † encode_var_ule_writeÁ Œ ZEROÁ Œ SIZE_0Á Œ OFFSET_0Á 5�× �Ñ/ ’ñ/ ’ú/ �œ0 �¶0 5—× —å, 5š× šï 5 4__IMPL_VarULE_FOR_CodePointInversionListULE_ULE_SIZEÁ 5ž validate_bytesÁ ŸÒ0 ŸÞ0 Ÿì0 ž from_bytes_uncheckedÁ 5¤Õ 55§Í 5Ì ©× ©µ/ ©è 5 × Í 5
|
|||
|
|
°× °˜ 5 ³× 5 µ× µÕ 5
|
|||
|
|
¸× ¸È 5»¥ »Ø » transformÁ » transform_ownedÁ » makeÁ À ÀÀ»
|
|||
|
|
transform_mutÁ ÄÒ# Ä 'bÁ 5ÇÉ, ÇÔ, Çå, 4 InvalidSetErrorÁ Ë
|
|||
|
|
4 Í ÎÍ 4 ÐÍ 4Ò ÓÍ 4ÕÍ 4
|
|||
|
|
RangeErrorÁ ×
|
|||
|
|
×ì ×í w &CodePointInversionListAndStringListULEÁ Û unsized_fieldsÁ Ü wÞ cp_inv_listÁ ߥ Þ str_listÁ ᥠwã× ãÑ/ åñ/ åú/ ãœ0 è ã¶0 êÒ0 ê wí× íÑ/ ïñ/ ïú/ íœ0 í¶0 wô× ôå, w÷× ÷ï w A__IMPL_VarULE_FOR_CodePointInversionListAndStringListULE_ULE_SIZEÁ wû—2 üÒ0 ü ûÅ2 ÿ w�Õ ww „Í w #CodePointInversionListAndStringListÁ †× †Ý6 †ø6 w
|
|||
|
|
Š× ŠÍ w �× �˜ w �× w
|
|||
|
|
’× ’Õ w•× •È w˜¥ ˜Ø ˜Œ4 ˜�4 ˜´4 � ��˜Ï4 ¡Ò# ¡ì4 w¤É, ¤Ô, ¤å, w InvalidStringListÁ ¨ InvalidStringLengthÁ ©
|
|||
|
|
¨ StringListNotUniqueÁ «
|
|||
|
|
¨ StringListNotSortedÁ
|
|||
|
|
w ¯ °Í w²Í � TrieTypeÁ ´ä# µ
|
|||
|
|
µ ´ý# ¸
|
|||
|
|
¸ �
|
|||
|
|
�¼È ���ÀÕ �ÂÍ �Ę �Æé Æ€ Æ” �Êé Ê€ Ê” �Îé ΀ Δ �Òé Ò€ Ò” �Öé Ö€ Ö” �Úé Ú€ Ú” �Þé Þ€ Þ” �
|
|||
|
|
CodePointTrieÁ ∠♠â headerÁ âö âÝ+ �èˆ è™ èÍ � ìˆ ì™ ì˜ � ðˆ ð™ � óˆ ó™ óÕ � ÷¥ ÷™ ÷Ø ÷Œ4 ÷�4 ÷´4 ý ýý÷Ï4 �Ò# �ì4 � „É, „Ô, „™ „å, âÖ � CodePointTrieHeaderÁ Š
|
|||
|
|
high_startÁ Š shifted12_high_startÁ Š index3_null_offsetÁ Š data_null_offsetÁ Š
|
|||
|
|
null_valueÁ Š trie_typeÁ �!�"�#“È �$•Í �%—˜ �&�'šÕ �(œ¥ œØ œŒ4 œ�4 œ´4 œÏ4 ¢Ò# ¢ì4 �)¥É, ¥å, � CodePointMapRangeÁ ¨™ ¨ rangeÁ ¨˜ �*¬™ �+®™ ®Õ �,±™ ±˜ �-´™ ´Í �.·™ ·È � FastCodePointTrieÁ ºˆ º™ º innerÁ �/¾ˆ ¾™ ¾Í � SmallCodePointTrieÁ ˆ ™ ÂÕE �0ƈ Æ™ ÆÍ � TypedCodePointTrieErrorÁ Ê
|
|||
|
|
�1ÌÍ ”” ”””ÑÈ ” Ó ÔÍ ”ÖÍ ””ÙÕ Î FromDeserializedÁ Û±
|
|||
|
|
Î EmptyDataVectorÁ Ý
|
|||
|
|
Î IndexTooShortForFastAccessÁ ß
|
|||
|
|
Î DataTooShortForFastAccessÁ á
|
|||
|
|
|
|||
|
|
$
|
|||
|
|
%
|
|||
|
|
&
|
|||
|
|
'
|
|||
|
|
(
|
|||
|
|
)
|
|||
|
|
*
|
|||
|
|
+
|
|||
|
|
,
|
|||
|
|
-
|
|||
|
|
.
|
|||
|
|
/
|
|||
|
|
0
|
|||
|
|
O
|
|||
|
|
R
|
|||
|
|
U
|
|||
|
|
X
|
|||
|
|
Y
|
|||
|
|
Z
|
|||
|
|
[
|
|||
|
|
\
|
|||
|
|
]
|
|||
|
|
^
|
|||
|
|
_
|
|||
|
|
a
|
|||
|
|
a
|
|||
|
|
b
|
|||
|
|
b
|
|||
|
|
d
|
|||
|
|
d
|
|||
|
|
o
|
|||
|
|
o
|
|||
|
|
…
|
|||
|
|
†
|
|||
|
|
‡
|
|||
|
|
‡
|
|||
|
|
ˆ
|
|||
|
|
‰
|
|||
|
|
Š
|
|||
|
|
‹
|
|||
|
|
«
|
|||
|
|
«
|
|||
|
|
«
|
|||
|
|
|
|||
|
|
®
|
|||
|
|
¯
|
|||
|
|
°
|
|||
|
|
±
|
|||
|
|
²
|
|||
|
|
³
|
|||
|
|
´
|
|||
|
|
µ
|
|||
|
|
¶
|
|||
|
|
·
|
|||
|
|
¸
|
|||
|
|
¹
|
|||
|
|
º
|
|||
|
|
»
|
|||
|
|
¼
|
|||
|
|
½
|
|||
|
|
Ç
|
|||
|
|
È
|
|||
|
|
Ê
|
|||
|
|
Ë
|
|||
|
|
Í
|
|||
|
|
Ó
|
|||
|
|
Ö
|
|||
|
|
Ü
|
|||
|
|
Ý
|
|||
|
|
Þ
|
|||
|
|
ß
|
|||
|
|
à
|
|||
|
|
á
|
|||
|
|
â
|
|||
|
|
è
|
|||
|
|
ê
|
|||
|
|
ü
|
|||
|
|
Ï
|
|||
|
|
Õ
|
|||
|
|
Ø
|
|||
|
|
Ø
|
|||
|
|
Ø
|
|||
|
|
Ý
|
|||
|
|
Ý
|
|||
|
|
à
|
|||
|
|
ì
|
|||
|
|
ú
|
|||
|
|
ý
|
|||
|
|
ý
|
|||
|
|
ý
|
|||
|
|
€
|
|||
|
|
€
|
|||
|
|
ˆ
|
|||
|
|
ˆ
|
|||
|
|
ˆ
|
|||
|
|
‹
|
|||
|
|
Œ
|
|||
|
|
Œ
|
|||
|
|
�
|
|||
|
|
’
|
|||
|
|
’
|
|||
|
|
’
|
|||
|
|
•
|
|||
|
|
–
|
|||
|
|
–
|
|||
|
|
Ÿ
|
|||
|
|
£
|
|||
|
|
¥
|
|||
|
|
¥
|
|||
|
|
¨
|
|||
|
|
¨
|
|||
|
|
¨
|
|||
|
|
¯
|
|||
|
|
¯
|
|||
|
|
¯
|
|||
|
|
²
|
|||
|
|
·
|
|||
|
|
·
|
|||
|
|
º
|
|||
|
|
Ï
|
|||
|
|
Ï
|
|||
|
|
Ï
|
|||
|
|
Ñ
|
|||
|
|
Ñ
|
|||
|
|
Ñ
|
|||
|
|
Ô
|
|||
|
|
Ô
|
|||
|
|
Ô
|
|||
|
|
Ö
|
|||
|
|
Ö
|
|||
|
|
Ö
|
|||
|
|
å
|
|||
|
|
å
|
|||
|
|
å
|
|||
|
|
è
|
|||
|
|
ê
|
|||
|
|
ê
|
|||
|
|
í
|
|||
|
|
ï
|
|||
|
|
ï
|
|||
|
|
ï
|
|||
|
|
ò
|
|||
|
|
ó
|
|||
|
|
ó
|
|||
|
|
ü
|
|||
|
|
ÿ
|
|||
|
|
‚
|
|||
|
|
‚
|
|||
|
|
…
|
|||
|
|
…
|
|||
|
|
…
|
|||
|
|
Œ
|
|||
|
|
Œ
|
|||
|
|
Œ
|
|||
|
|
�
|
|||
|
|
”
|
|||
|
|
”
|
|||
|
|
—
|
|||
|
|
±
|
|||
|
|
±
|
|||
|
|
±
|
|||
|
|
³
|
|||
|
|
³
|
|||
|
|
³
|
|||
|
|
½
|
|||
|
|
Á
|
|||
|
|
Á
|
|||
|
|
Ã
|
|||
|
|
Ã
|
|||
|
|
Ã
|
|||
|
|
Å
|
|||
|
|
ë
|
|||
|
|
ë
|
|||
|
|
ë
|
|||
|
|
ï
|
|||
|
|
ö
|
|||
|
|
ö
|
|||
|
|
”
|
|||
|
|
–
|
|||
|
|
–
|
|||
|
|
–
|
|||
|
|
˜
|
|||
|
|
›
|
|||
|
|
›
|
|||
|
|
Ÿ
|
|||
|
|
°
|
|||
|
|
°
|
|||
|
|
³
|
|||
|
|
¶
|
|||
|
|
¶
|
|||
|
|
¶
|
|||
|
|
¹
|
|||
|
|
Á
|
|||
|
|
Á
|
|||
|
|
Á
|
|||
|
|
É
|
|||
|
|
É
|
|||
|
|
É
|
|||
|
|
Í
|
|||
|
|
Í
|
|||
|
|
Í
|
|||
|
|
Ò
|
|||
|
|
Õ
|
|||
|
|
Õ
|
|||
|
|
Õ
|
|||
|
|
×
|
|||
|
|
×
|
|||
|
|
×
|
|||
|
|
Ú
|
|||
|
|
Ú
|
|||
|
|
Å¥ P8 S8 V8 ¾8 ›×ØÞ Ð Ð Ã+ ÒÝ+ TVGzÕ¯ÈR × à`ÿQ ¬âÿQ žÿQÿQ £ÿQ
|
|||
|
|
Ð Ð Ã+ ÒÝ+ TVGzÕ¯ÈR É, É, Ð Ð Ã+ ÒÝ+ TVGzÕ¯ÈR Ô, Þ å å õ, çí
|
|||
|
|
èŸ- éª- “5,¢ƒ5¥V ¥ á í î ïí- ð ñ�. ò ó•. ôì õ ö´. ÷ì U€}™¦|¹ Þ�T þ �T à`�T ¬â�T ž�T�T à` © © Ì «µ/ 5 ¬è 5 1¸crÒá5 × £ÁU ¬âÁU žÁUÁU ÞÁU À © © Ì «µ/ 5 ¬è 5 1¸crÒá5 ¥
|
|||
|
|
© © Ì «µ/ 5 ¬è 5 1¸crÒá5 É, É, © © Ì «µ/ 5 ¬è 5 1¸crÒá5 Ô, ÁU ƒ ƒ Œ/ „è 5 …µ/ 5 g› %/e¸ 8ÁU €X
|
|||
|
|
ÁU ×€X úÁU ×€X Ó€X ž€X€X £€X à`€X å` Ë Ë Ì‘5 ¿c8vI+<˜ à`£Y å` × × Øê5 Ùì Úí !ÞjJGmN à`ÙY à` † † »9 ˆÝ6 w ‰ø6 w Y-‡¬]‘k × £¡Z ¬â¡Z ž¡Z¡Z Þ¡Z À † † »9 ˆÝ6 w ‰ø6 w Y-‡¬]‘k ¥
|
|||
|
|
† † »9 ˆÝ6 w ‰ø6 w Y-‡¬]‘k É, É, † † »9 ˆÝ6 w ‰ø6 w Y-‡¬]‘k Ô, ¡Z Û Û �6 ܾ6 w Z{ !Ö¡ 8¡Z à\
|
|||
|
|
¡Z ×à\ ú¡Z ×à\ Óà\ žà\à\ £à\ à`à\ å` ¨ © ªá; « ¬�< ®¡< èR„E ¸ à`ø] á ´ µ ¶ä# · ¸ ¹ý# º ×·î.—9 ÞÎ^ þ Î^ ¬âÎ^ žÎ^Î^ à`Î^ £Î^ › › › › › › › à` â â ¢? åÇ? æö çÝ+ ‰Ö GÈ—ÂH·ï ˆ™ £“` ¬â“` ž“`“` À â â ¢? åÇ? æö çÝ+ ‰Ö GÈ—ÂH·ï æ` ¥
|
|||
|
|
â â ¢? åÇ? æö çÝ+ ‰Ö GÈ—ÂH·ï É,™ É, â â ¢? åÇ? æö çÝ+ ‰Ö GÈ—ÂH·ï Ô,Æb þ Š Š ÚA ‹õA Œ‡B �£B Ž½B �ÕB �çB †
|
|||
|
|
ÂÁî32& á¯c Þ¯c à`¯c £¯c ¬â¯c ž¯c¯c À¯c ¥
|
|||
|
|
¯c É,¯c �Î^Î_ Þ â â ¢? åÇ? æö çÝ+ ‰Ö GÈ—ÂH·ï 8æ` ¬â ¨ ¨ •D ª¶D «˜ v.¾¡C6}? ™ žÙeÙe £Ùe à`Ùe ÞÙe ÞK Î Î œ ÑÍ � ÒØ � Gƒ}O¤™Ew 8æ` à` º º ¬E ½ÕE � ¤%–™/T2 ˆæ` ØŒg ˆæ` ׌g � ˆŒg ˆ“` �Œg“` à`   ÿE ÅÕE � qŸ(åt x ˆæ` ØŽh ˆæ` ׎h � ˆŽh ðg �Žh“` à` Ê Ê ËÎF ¸Ï¯‚Vݽ þ Î Û ÑG ܱ
|
|||
|
|
Ý ÞñG ß à�H á â´H .¥ÑN¾ŠFß áµi Þµi å`µi à`µi ¬âµi žµiµi ϵi ÞK   »* Å£ À Æö* À “;"k‘ Hª Ý*æ` Ó Ðê åù í¸ ©• †¼ ´“ ŠË â· ¨Ñ ÎÖ Ðü í ©§ ƒÐ ËÕ ×Š †„ Û² ¨Â ´è â• Š´ ¨¾ ºÆ ÂÌ ÊÖ ÎÙ Ðþ í³ ©� †¿ ´ð â™ Š¬ ¨Ø ÎÛ Ðÿ íµ ©¤ ƒ’ †� ÛÀ ´ó âš Š® ¨Ù ÎÞ Ð° ©¦ ƒ� †ƒ ÛÄ ´ì â— Š± ¨á ÐÇ ©— ©¤ †ô †„ ⥠Šø í» ´’ ŠÐ Îû í¾ ´‘ ŠÏ λ ©˜ †÷ ✠Š† ©�
|
|||
|
|
ã †í
|
|||
|
|
š ©÷ †ž ƒû ÛÎ ËÓ ×° ¨Ô ÎÆÊÎÒÖÚÞ¢ ´î
|
|||
|
|
ó º�
|
|||
|
|
† ÂÓ ÎË Âä ºø Âë ºþ – ÎÞ
|
|||
|
|
Ïà`F¬â wž ?£ M
|
|||
|
|
?á1þ À úÓå` › �"ÞK Ø ×Ï 5Á 0 Ø_ 0x30Á Ø_ 0x10ÁüØ* „Ø
|
|||
|
|
Ø_¼ë Ø_ ( *
|
|||
|
|
Ø_( Ø_ O Ø_ ü¼G Ø_ Ò Ø_ ‡ .†
|
|||
|
|
Ø_ƒ Ø_š
|
|||
|
|
Ø_— Ø_ _Á ”¨ t¨ Ø_ ¹ Ø_ ( + Ø_) Ø_ P Ø_ üŒ/
|
|||
|
|
Ø_ ¢ Œs … +… Ø_� Ø_ _Á €Ø_ 0x8000Á ÿ?Ø_ 0x3fffÁ´À
|
|||
|
|
”À
|
|||
|
|
Ø_ Õ
|
|||
|
|
Ø_ ( + Ø_) Ø_ P Ø_ ü›
|
|||
|
|
< Ø_ º
|
|||
|
|
Œs … +… Ø_� Ø_ _Á ÿ Ø_ 0xffÁüÊ $ ìË ¼Ì Ø_ æ Ø_ . + Ø_) Ø_ V Ø_ n ì €`â_ ‰ • â_ ¥ < €` Ä Y €` í ü¹ 5 t¹ Ø_ Ø_ = Ø_ T ü� ` Ø_ ³ Ø_ ^ Ø_ ] Œs e â_ v } Œs Ÿ Rv Ø_� Ø_´ Ø_¾ Ø_ _Á ÀØ_ 0x7fc0Á ÿØ_ 0x7fffÁ ÿûØ_ 0xfbffÁ´À
|
|||
|
|
”À
|
|||
|
|
Ø_ Õ
|
|||
|
|
Ø_ ( + Ø_) Ø_ P Ø_ ü›
|
|||
|
|
< Ø_ º
|
|||
|
|
Œs … +… Ø_� Ø_ _Á ÿÿØ_ 0xffffÁ ÿÿ â_ 0xFFFFÁùtÛ³M
|
|||
|
|
ùtÛ³-
|
|||
|
|
Ì
|
|||
|
|
R
|
|||
|
|
R
|
|||
|
|
S PotentialCodePointÁ
|
|||
|
|
Tì
|
|||
|
|
Ñt{ŽEš9 ñt‰´ �
|
|||
|
|
© © ª RawBytesULEÁ ¬ ì Ö±ËúÇÒOUÞq Ð}[ Ò Ö ùs�º>
|
|||
|
|
|
|||
|
|
QsÁº
|
|||
|
|
Ƀ} asÁº s̺ üæÅ F ªª ZeroVecÁ ¨½ ® marker1Á½ ¯ marker2Á½ ʘ!ÚÆdG
|
|||
|
|
ƒ} Üþ  à ZeroSliceÁ Åì¾ ÈE(�mǃ} î �€ ÷ Ï” �Ð} Ð} _Á ¡t‘´ ™t’´ at•´ üÜ!
|
|||
|
|
äÜ
|
|||
|
|
ù â_ 9 H
|
|||
|
|
O ü¹
|
|||
|
|
Y l t ´ { üÿ) \œ <œ E â_ ¦ â_ 0 - E â_+ â_ Z â_ r
|
|||
|
|
y äÿ ¸� ƒ ” § !
|
|||
|
|
) Û í� º C Ø Y
|
|||
|
|
Ó} t¤´ Ž › © Ð} = t¦´ Át�´ �
|
|||
|
|
Ð} Ó}Þq ä„ æ„ Ó} ƒ} þ Ó} ƒ} ˜ â_ — â_ ¢ ƒ� E â_¨ E â_ _Á ùvÛ³M
|
|||
|
|
ùvÛ³- ý|ñv‰´ ‚Ð} Ð} I M ùu�º>
|
|||
|
|
|
|||
|
|
QuÁº Ò~ | auÁº u̺ ü€ Ç G œ Ü� �€ Æ �€ Î 5« ‚Ð} Ð} _Á ¡v‘´ ™v’´ av•´ üí !
|
|||
|
|
äí ¸� Š
|
|||
|
|
â_ 8 G
|
|||
|
|
N üÊ í� W j v ´ y ü�
|
|||
|
|
4 ´
|
|||
|
|
”
|
|||
|
|
L®
|
|||
|
|
®0 â_ (
|
|||
|
|
Â
|
|||
|
|
â_ F
|
|||
|
|
# â_ h
|
|||
|
|
â_ C †
|
|||
|
|
� ä�
|
|||
|
|
¸� — ¨ Ã
|
|||
|
|
3
|
|||
|
|
; î í� Î U ì k
|
|||
|
|
Ó} v¤´ » Ð} = v¦´ Áv�´ ‚ Ð} ä„ ä„ æ„ Ó} ƒ} Ó} ƒ} œ â_ › â_ › ·… ¬ yŸ ®0 _Á Þq 0Áøx– 2
|
|||
|
|
|
|||
|
|
˜© © ª á| ¬ ì Ö±ËúÇÒOUÞq ^ d Ž r Þq } „ _Á ˜ ¡ � Þq$¤ Ž Þq ½ Ë � Þq* Ž Þq æ Þq ÷ � Þq Þq $) � Þqˆ Ž Þq@ � ÞqŸ Ž Þq _Á g n
|
|||
|
|
v | ‡� � ’ œ Þq ´ à Þq Ü Þq xÇ ÷ � Þq Þq ‡� # + _Á Þq 0ÁT
|
|||
|
|
\ b ‡� s z ¡ ‰ Þq • � _Á ² ¼ Þq ¡ Þq Ø ç ÞqG ¡ Þq Þq ¢ % Þq 1 ‡� : BG Þq¦ ¡ Þq_ Þq¾ ¡ Þq _Á DûN $…O ¼ôN
|
|||
|
|
© ŠO ‘O L üéM¨ © © Ì «µ/ 5 ¬è 5 1¸crÒá5 $åN œ D›N â_ $ÑN œ Á â_ µ µ/# è' ˆ _Á _Á Þq 2usizeÁ Þq 2usizeÁ Þq 0Á Þq 2usizeÁ Þq 0Á Þq 0Á Þq 2usizeÁ Þq 2usizeÁ\Í* Dæ* ü›*^
|
|||
|
|
† ø* ÿ* „ ü‚)ý † † »9 ˆÝ6 w ‰ø6 w Y-‡¬]‘k $Œ* å” \) àà á
|
|||
|
|
VarZeroVecÁ åì 6
|
|||
|
|
ä>(ùOè ä ä å Index16Á ÁÀ;A®Î) Dá) å” + ò˜ ! Ý6Ž ø6+ ô _Á 0Á 1Á
|
|||
|
|
4˜^ ,¬^ $¿^ \Ñ^ ü…^b
|
|||
|
|
â æ` æ^ í^ © üÈZ¥ â â ¢? åÇ? æö çÝ+ ‰Ö GÈ—ÂH·ï æ` $‰\ ¯c 4†[ ªª ¦~ ¨½ ®Â~½ ¯Õ~½ ʘ!ÚÆdG
|
|||
|
|
Ø_ ,«[ ªª ¦~ ¨½ ®Â~½ ¯Õ~½ ʘ!ÚÆdG
|
|||
|
|
æ` $Ï[ æ` \ð[ ¯c · Ûœ «� £ æ` ˜ Ç?× ö” Ý+Q Ö U o táˆ
|
|||
|
|
´ üň+ ç Î^ DÖˆ ' TrieType::FastÁ |å�
|
|||
|
|
´ üÉ�, û Î^ DÚ� ' TrieType::SmallÁ _Á €` 6Á¤ñ
|
|||
|
|
|ö
|
|||
|
|
˜ €`â_ ' â_ 7 ñ
|
|||
|
|
â_G ˜ €` a ( â_m ˜ €` üÄB
|
|||
|
|
™ â_ ë
|
|||
|
|
â_ « ± 2± ˜ €`¼ ˜ €`Ç ˜ €` _Á üô
|
|||
|
|
Üô
|
|||
|
|
™ â_ ’
|
|||
|
|
â_ , . ™ â_, â_ W â_ üÏE
|
|||
|
|
š â_ î
|
|||
|
|
·… Ž -� ™ â_˜ ™ â_ _Á ÿÿ â_ 0xffffÁ ÿ â_ 0xfffÁ â_ 1Á â_ 2ÁÔ‘
|
|||
|
|
|œ
|
|||
|
|
˜ €`â_ ' â_ 7 <‘
|
|||
|
|
â_G ˜ €` a ( â_m ˜ €` üï=
|
|||
|
|
Ÿ â_ ‹
|
|||
|
|
â_ « ± 2± ˜ €`¼ ˜ €`Ç ˜ €` _Á â_ 0x1000Áôø
|
|||
|
|
|‡
|
|||
|
|
|
|||
|
|
˜ €`â_ ' â_ 7 \ø
|
|||
|
|
â_E ˜ €` _ & â_i ˜ €` üÔ C
|
|||
|
|
¡ â_ ò
|
|||
|
|
â_ § 2 ˜ €`� â_Ã ˜ €`— â_Ù ˜ €` _Á â_ 4Á\¹
|
|||
|
|
¹
|
|||
|
|
â_<½
|
|||
|
|
¢ â_ + . â_, ¢ â_ V â_ ü %
|
|||
|
|
£ â_ ³
|
|||
|
|
·… � -} ¢ â_ˆ ¢ â_ _Á \•
|
|||
|
|
•
|
|||
|
|
â_<™
|
|||
|
|
£ â_ + . â_, £ â_ V â_ üü %
|
|||
|
|
¤ â_ �
|
|||
|
|
·… � -} £ â_ˆ £ â_ _Á Œ§
|
|||
|
|
<§
|
|||
|
|
£ â_<±
|
|||
|
|
¢ â_ ) , £ â_* ¢ â_ R â_ üŒ
|
|||
|
|
-
|
|||
|
|
¥ â_ ¡
|
|||
|
|
·… ‰ -‰ £ â_† ¢ â_Ÿ £ â_œ ¢ â_ _Á Œ¿
|
|||
|
|
<¿
|
|||
|
|
¤ â_<É
|
|||
|
|
£ â_ ) , ¤ â_* £ â_ R â_ ü¤-
|
|||
|
|
¦ â_ ¹
|
|||
|
|
·… ‰ -‰ ¤ â_† £ â_Ÿ ¤ â_œ £ â_ _Á ”ö
|
|||
|
|
<�
|
|||
|
|
¤ â_ â_ ) <ö
|
|||
|
|
â_9 ¤ â_ S ( â__ ¤ â_ üÊ?
|
|||
|
|
§ â_ ð
|
|||
|
|
œ +œ ¤ â_§ ¤ â_² ¤ â_ _Á tä
|
|||
|
|
Lé
|
|||
|
|
¦ â_ â_ ) ä
|
|||
|
|
â_9 ¦ â_ S ( â__ ¦ â_ ü¾5
|
|||
|
|
¨ â_ Þ
|
|||
|
|
œ +œ ¦ â_§ ¦ â_² ¦ â_ _Á ÄØ
|
|||
|
|
¤Ø
|
|||
|
|
¨ â_ ï
|
|||
|
|
â_ + . ¨ â_, â_ V â_ üº7
|
|||
|
|
© â_ Ò
|
|||
|
|
·… � -� ¨ â_˜ ¨ â_ _Á dÖ
|
|||
|
|
<Û
|
|||
|
|
£ â_ â_ ) Ö
|
|||
|
|
â_9 £ â_ S ( â__ £ â_ ü°3
|
|||
|
|
ª â_ Ð
|
|||
|
|
œ +œ £ â_§ £ â_² £ â_ _Á t¾
|
|||
|
|
LÃ
|
|||
|
|
¥ â_ â_ ) ¾
|
|||
|
|
â_9 ¥ â_ S ( â__ ¥ â_ ü˜5
|
|||
|
|
« â_ ¸
|
|||
|
|
œ +œ ¥ â_§ ¥ â_² ¥ â_ _Á IJ
|
|||
|
|
¤²
|
|||
|
|
« â_ É
|
|||
|
|
â_ + . « â_, â_ V â_ ü”7
|
|||
|
|
¬ â_ ¬
|
|||
|
|
·… � -� « â_˜ « â_ _Á d«
|
|||
|
|
<°
|
|||
|
|
¢ â_ â_ ) «
|
|||
|
|
â_9 ¢ â_ S ( â__ ¢ â_ ü‚6
|
|||
|
|
â_ ¥
|
|||
|
|
œ +œ ¢ â_§ ¢ â_² ¢ â_ _Á Ü£
|
|||
|
|
¼£
|
|||
|
|
â_ ½
|
|||
|
|
â_ + . â_, â_ V â_ ü‚=
|
|||
|
|
® â_ �
|
|||
|
|
·… � -� â_˜ â_ _Á ÿÿ â_ 0x10ffffÁüþŒg
|
|||
|
|
³ Î_Þq 6 C P
|
|||
|
|
Î_ ‰j üÚ±g ³ ʼ ,ö �¼ œ �¼ ¤ ‘¼ üÿ‹g �¼ ¸ K _Á'
|
|||
|
|
Î_ … Î_ Š Î_$� @Î_ • Î_ š Î_ Ÿ Î_ ¤ Î_ © Î_ ® Î_ ³ Î_ ¸ Î_ ½ Î_  Î_ Ç Î_ Ì Î_ Ñ Î_ Ö Î_ Û Î_ à Î_ é Î_ î Î_ ó Î_ ø Î_ ý Î_ ‚ Î_ ‡ Î_ Œ Î_ ‘ Î_ – Î_ › Î_ Î_ ¥ Î_ ª Î_ ¯ Î_ ´ Î_ ¹ Î_ ¾ Î_ à Î_ Ì Î_ Ñ Î_ Ö Î_ Û Î_ à Î_ å Î_ ê Î_ ï Î_ ô Î_ ù Î_ þ Î_ ƒ Î_ ˆ Î_ � Î_ ’ Î_ — Î_ œ Î_ ¡ Î_ ¦ Î_ ¯ Î_ ´ Î_ ¹ Î_ ¾ Î_ à Î_ È Î_ Í Î_ Ò Î_ × Î_ Ü Î_ á Î_ æ Î_ ë Î_ ð Î_ õ Î_ ú Î_ ÿ Î_ „ Î_ ‰ Î_ ’ Î_ — Î_ œ Î_ ¡ Î_ ¦ Î_ « Î_ ° Î_ µ Î_ º Î_ ¿ Î_ Ä Î_ É Î_ Î Î_ Ó Î_ Ø Î_ Ý Î_ â Î_ ç Î_ ì Î_ õ Î_ ú Î_ ÿ Î_ „ Î_ ‰ Î_ Ž Î_ “ Î_ ˜ Î_ � Î_ ¢ Î_ § Î_ ¬ Î_ ± Î_ ¶ Î_ » Î_ À Î_ Å Î_ Ê Î_ Ï Î_ Ø Î_ Ý Î_ â Î_ ç Î_ ì Î_ ñ Î_ ö Î_ û Î_ € Î_ … Î_ Š Î_ � Î_ ” Î_ ™ Î_$ž ˆÎ_ ¤ Î_$© �Î_ ¯ Î_$¸ �Î_ ¾ Î_$à �Î_ É Î_$Î °Î_ Ô Î_$Ù °Î_ ß Î_$ä °Î_ ê Î_$ï °Î_ õ Î_$ú ÐÎ_ € Î_$… ÐÎ_ ‹ Î_$� ÐÎ_ š Î_$Ÿ ÐÎ_ ¥ Î_$ª ðÎ_ ° Î_$µ ðÎ_ » Î_$À ðÎ_ Æ Î_$Ë ðÎ_ Ñ Î_$Ö Î_ Ü Î_$á Î_ ç Î_$ì Î_ ò Î_$û Î_ �
|
|||
|
|
Î_$†
|
|||
|
|
0Î_ Œ
|
|||
|
|
Î_$‘
|
|||
|
|
0Î_ —
|
|||
|
|
Î_$œ
|
|||
|
|
0Î_ ¢
|
|||
|
|
Î_$§
|
|||
|
|
0Î_
|
|||
|
|
Î_$²
|
|||
|
|
PÎ_ ¸
|
|||
|
|
Î_$½
|
|||
|
|
PÎ_ Ã
|
|||
|
|
Î_$È
|
|||
|
|
PÎ_ Î
|
|||
|
|
Î_$Ó
|
|||
|
|
PÎ_ Ý
|
|||
|
|
Î_$â
|
|||
|
|
pÎ_ è
|
|||
|
|
Î_$í
|
|||
|
|
pÎ_ ó
|
|||
|
|
Î_$ø
|
|||
|
|
pÎ_ þ
|
|||
|
|
Î_$ƒ pÎ_ ‰ Î_$Ž �Î_ ” Î_$™ �Î_ Ÿ Î_$¤ �Î_ ª Î_$¯ �Î_ µ Î_$¾ °Î_ Ä Î_$É °Î_ Ï Î_$Ô °Î_ Ú Î_$ß °Î_ å Î_$ê ÐÎ_ ð Î_$õ ÐÎ_ û Î_$€ ÐÎ_ † Î_$‹ ÐÎ_ ‘ Î_$– ðÎ_ Î_$¥ ðÎ_ « Î_$° ðÎ_ ¶ Î_$» ðÎ_ Á Î_$Æ Î_ Ì Î_$Ñ Î_ × Î_$Ü Î_ â Î_$ç Î_ í Î_$ò 0Î_ ø Î_$�
|
|||
|
|
0Î_ ‡
|
|||
|
|
Î_$Œ
|
|||
|
|
0Î_ ’
|
|||
|
|
Î_$—
|
|||
|
|
0Î_ �
|
|||
|
|
Î_$¢
|
|||
|
|
PÎ_ ¨
|
|||
|
|
Î_$
|
|||
|
|
PÎ_ ³
|
|||
|
|
Î_$¸
|
|||
|
|
PÎ_ ¾
|
|||
|
|
Î_$Ã
|
|||
|
|
PÎ_ É
|
|||
|
|
Î_$Î
|
|||
|
|
pÎ_ Ô
|
|||
|
|
Î_$Ù
|
|||
|
|
pÎ_ ã
|
|||
|
|
Î_$è
|
|||
|
|
pÎ_ î
|
|||
|
|
Î_$ó
|
|||
|
|
pÎ_ ù
|
|||
|
|
Î_ þ
|
|||
|
|
Î_ ƒ Î_$ˆ Î_ Ž Î_$“ Î_ ™ Î_$ž 0Î_ ¤ Î_$© @Î_ ¯ Î_$´ PÎ_ º Î_$à `Î_ É Î_$Î pÎ_ Ô Î_ Ù Î_ Þ Î_$ã Î_ é Î_$î Î_ ô Î_$ù 0Î_ ÿ Î_ „ Î_ ‰ Î_$Ž Î_ ” Î_$™ Î_ £ Î_$¨ 0Î_ ® Î_ ³ Î_ ¸ Î_$½ Î_ à Î_$È Î_ Î Î_$Ó 0Î_ Ù Î_ Þ Î_ ã Î_$è Î_ î Î_$ó Î_ ù Î_$‚ 0Î_ ˆ Î_ � Î_ ’ Î_$— Î_ � Î_$¢ Î_ ¨ Î_$ 0Î_ ³ Î_ ¸ Î_ ½ Î_$ Î_ È Î_$Í Î_ Ó Î_$Ø 0Î_ â Î_ ç Î_ ì Î_$ñ Î_ ÷ Î_$ü Î_ ‚ Î_$‡ 0Î_ � Î_ ’ Î_ — Î_$œ Î_ ¢ Î_$§ Î_ Î_$² 0Î_ ¸ Î_$Á €Î_ Ç Î_$Ì €Î_ Ò Î_$× €Î_ Ý Î_$â €Î_ è Î_$í €Î_ ó Î_$ø €Î_ þ Î_$ƒ €Î_ ‰ Î_$Ž €Î_ ” Î_$™ €Î_ £ Î_$¨ €Î_ ® Î_$³ €Î_ ¹ Î_$¾ €Î_ Ä Î_$É €Î_ Ï Î_$Ô €Î_ Ú Î_$ß €Î_ å Î_$ê €Î_ ð Î_$õ €Î_ û Î_$„ €Î_ Š Î_$� €Î_ • Î_$š €Î_ Î_$¥ €Î_ « Î_$° €Î_ ¶ Î_$» €Î_ Á Î_$Æ €Î_ Ì Î_$Ñ €Î_ × Î_$Ü €Î_ æ Î_$ë €Î_ ñ Î_$ö €Î_ ü Î_$� €Î_ ‡ Î_$Œ €Î_ ’ Î_$— €Î_ � Î_$¢ €Î_ ¨ Î_$ �Î_ ³ Î_$¸ �Î_ ¾ Î_$Ç �Î_ Í Î_$Ò �Î_ Ø Î_$Ý �Î_ ã Î_$è �Î_ î Î_$ó �Î_ ù Î_$þ �Î_ „ Î_$‰ �Î_ � Î_$” �Î_ š Î_$Ÿ �Î_ © Î_$® �Î_ ´ Î_$¹ �Î_ ¿ Î_$Ä �Î_ Ê Î_$Ï �Î_ Õ Î_$Ú �Î_ à Î_$å �Î_ ë Î_$ð �Î_ ö Î_$û �Î_ � Î_$Š �Î_ � Î_$• �Î_ › Î_$ �Î_ ¦ Î_$« �Î_ ± Î_$¶ �Î_ ¼ Î_$Á �Î_ Ç Î_$Ì �Î_ Ò Î_$× �Î_ Ý Î_$â �Î_ ì Î_$ñ �Î_ ÷ Î_$ü �Î_ ‚ Î_$‡ �Î_ � Î_$’ �Î_ ˜ Î_$� Î_ £ Î_$¨ Î_ ® Î_$³ Î_ ¹ Î_$¾ Î_ Ä Î_$Í Î_ Ó Î_$Ø Î_ Þ Î_$ã Î_ é Î_$î Î_ ô Î_$ù Î_ ÿ Î_$„ Î_ Š Î_$� Î_ • Î_$š Î_ Î_$¥ Î_ ¯ Î_$´ Î_ º Î_$¿ Î_ Å Î_$Ê Î_ Ð Î_$Õ Î_ Û Î_$à Î_ æ Î_$ë Î_ ñ Î_$ö Î_ ü Î_$�
|
|||
|
|
í ó % �T 0 €` 7 > dí&
|
|||
|
|
í ö % �T 0 €` 7 > Ôú
|
|||
|
|
Ë Ì " £Y - 4 ¬ö
|
|||
|
|
× Ø ( ÙY 3 â_ : â_ A H œ×S
|
|||
|
|
¨ ª " ø] - 4 œžU
|
|||
|
|
¨ ¬ " ø] - 4 œ®W
|
|||
|
|
¨ ® " ø] - 4 $¾ª
|
|||
|
|
‹ Ò#Û# % � 2 ‹ Ž �ä# �ì ‘ ’ý# “ì 2�LWJfŸ¾¯Ä¯ ‰ ¾¯ ‘ ˜ ,ëª
|
|||
|
|
‹¾¯Ä¯ ! ’ . ç¯ : į B I 4wŒÀ³ üËÔ üË+ ( Efficient collections for Unicode data.Á ÷ Ë üû| y This module is published as its own crate ([`icu_collections`](https://docs.rs/icu_collections/latest/icu_collections/))Á üø| y and as part of the [`icu`](https://docs.rs/icu/latest/icu/) crate. See the latter for more details on the ICU4X project.Á õ Ë üùƒ € ICU4X [`CodePointTrie`](crate::codepointtrie::CodePointTrie) provides a read-only view of `CodePointTrie` data that is exportedÁ üým j from ICU4C. Detailed information about the design of the data structure can be found in the documentationÁ üëJ G for the [`CodePointTrie`](crate::codepointtrie::CodePointTrie) struct.Á ¶ Ë üºµ ² ICU4X [`CodePointInversionList`](`crate::codepointinvlist::CodePointInversionList`) provides necessary functionality for highly efficient querying of sets of Unicode characters.Á üð� š It is an implementation of the existing [ICU4C UnicodeSet API](https://unicode-org.github.io/icu-docs/apidoc/released/icu4c/classicu_1_1UnicodeSet.html).Á Ž Ë ü’ † ƒ ICU4X [`Char16Trie`](`crate::char16trie::Char16Trie`) provides a data structure for a space-efficient and time-efficient lookup ofÁ ü™
|
|||
|
|
N K sequences of 16-bit units (commonly but not necessarily UTF-16 code units)Á üè
|
|||
|
|
which map to integer values.Á ü‰ ˜ • It is an implementation of the existing [ICU4C UCharsTrie](https://unicode-org.github.io/icu-docs/apidoc/released/icu4c/classicu_1_1UCharsTrie.html)Á ü¢ z w / [ICU4J CharsTrie](https://unicode-org.github.io/icu-docs/apidoc/released/icu4j/com/ibm/icu/util/CharsTrie.html) API.Á 4wŒÀ³€ Ž‘””— üË\ Y This module provides a data structure for a space-efficient and time-efficient lookup ofÁ ü¨N ‰º ü÷ ຠ˜ Ë üœ˜ Š» üµz ¬¼ ° Ë œ´ ## ArchitectureÁ È Ë üÌr o ICU4X [`Char16Trie`] is designed to provide a read-only view of `UCharsTrie` data that is exported from ICU4C.Á ¿ Ë |à ## ExamplesÁ Ó Ë ü× ### Querying a `Char16Trie`Á ÷ Ë \û ```rustÁ ü‡? < use icu::collections::char16trie::{Char16Trie, TrieResult};Á ÌÇ use zerovec::ZeroVec;Á á Ë üåM J // A Char16Trie containing the ASCII characters mapping 'a' to 1 and 'ab'Á t³ // to 100.Á üÂ- * let trie_data = [48, 97, 176, 98, 32868];Á üðI F let trie = Char16Trie::new(ZeroVec::from_slice_or_alloc(&trie_data));Á º Ë ü¾ let mut iter = trie.iter();Á ìÞ let res = iter.next('a');Á üü 1 . assert_eq!(res, TrieResult::Intermediate(1));Á ì®
|
|||
|
|
let res = iter.next('b');Á üÌ
|
|||
|
|
1 . assert_eq!(res, TrieResult::FinalValue(100));Á ìþ
|
|||
|
|
let res = iter.next('c');Á üœ ) & assert_eq!(res, TrieResult::NoMatch);Á <Æ ```Á Î Ë üÒ [`ICU4X`]: ../icu/index.htmlÁ TŸ Ã+T� Ð 1õ,”§ å 2Û-TÉ í 3Dô $ø
|
|||
|
|
|
|||
|
|
Ðåí ZeroFromÁDÙ
|
|||
|
|
åÇ 5 ‘Lñ  ¦~<ü ª ”Ï Kìç -/ ü§. ü! ÞqÜ´ „º Ø_üØ" ¼Þ Ø_̼ t Ø_ÌŒ t’ Ø_Ìí tó Ø_ìò ”ø Ø_ü›
|
|||
|
|
" ¼¡
|
|||
|
|
Ø_üã
|
|||
|
|
" ¼é
|
|||
|
|
Ø_ü� ' ä• Ø_üû % Ô� Ø_ü¬ ¬² Ø_ìó ”ù Ø_ü›
|
|||
|
|
" ¼¡
|
|||
|
|
Ø_üâ
|
|||
|
|

|
|||
|
|
Ø_üŽ- T‘ ÞqØ_Þq
|
|||
|
|
Ÿ- œ leadÁ$¨ üÕ2 |Ø ÞqØ_Þq
|
|||
|
|
Ÿ- è ¼Ë$ô ì± × ÿQ ,¶ ü- üÕE B Returns a new [`Char16Trie`] with ownership of the provided data.Á ´ ªª ¦~ ¨½ ®Â~½ ¯Õ~½ ʘ!ÚÆdG
|
|||
|
|
×Ø_ÿQ
|
|||
|
|
×Ý+$¸ üæ, üþU R Returns a new [`Char16TrieIterator`] backed by borrowed data from the `trie` dataÁ$í ã ãÿQ å å õ, çí
|
|||
|
|
èŸ- éª- “5,¢ƒ5¥V ã ò
|
|||
|
|
×$ó üà(& Dã( €`Ø_
|
|||
|
|
|
|||
|
|
supplementaryÁlì( ü™+& Dœ+ €`Ø_
|
|||
|
|
¾Ðl¥+ Äß- \ì- ø- é/ þ- ‹. , ÿ- 8ä 4€. & †. 8ï $‡. *�. �. æ/ 8 ,š. , . 8ä 4¡. ¨. à/ 8� $¶. º. ¼. 8 xÁ ». *¾. 8©Ò Á. $ Â. 8Ð $Ð. *Õ. Ø. Ö/ 8 debug_assertÁ dˆ/ ”/ •/ ›/ 8 ,–/ % œ/ 8 4®/ 8Û- Tµ/ '¿/ 8í- <Á/ % È/ % ç/ üì/ ¥ " " ÎS#$%&'()*+,-./0 ñ/ üú0, ü’0U R Returns a new [`Char16TrieIterator`] backed by borrowed data for the `trie` arrayÁ �1 ¥Â Ñ Åì¾ ÈE(�mÇØ_ ÎS ! !
|
|||
|
|
# ¥í
|
|||
|
|
$…1 ü€8- ü£2B ? Traverses the trie from the current state for this input char.Á ê2 Ë tò2 # ExamplesÁ …3 Ë <�3 ÊÆ ü™3? ›Á ÌÝ3 âÁ û3 Ë üƒ4@ = // A Char16Trie containing the ASCII characters 'a' and 'b'.Á üÈ4- û üú4I ±Ã È5 Ë üÐ5 ŽÄ ìô5 µÄ ü–61 ÛÄ ìÌ6 ”Å üî61 ºÅ ì¤7 óÅ üÆ7) ™Æ <ô7 ÊÆ$‡8 ä äÎS�T ! Œ8 !
|
|||
|
|
$ ¥$‘8 Š —8 üð@. ü“;B „Ö Ú; Ë tâ; ÙÖ õ; Ë <ý; ÊÆ ü‰<? ›Á ÌÍ< âÁ ë< Ë üó<@ «× ü¸=- û üê=I ±Ã ¸> Ë üÀ> ŽÄ ìä> µÄ ü†?1 ÛÄ ì¼? ”Å üÞ?1 ºÅ ì”@ óÅ ü¶@) ™Æ <ä@ ÊÆ4÷@ å åÎSâ_�T ! þ@ !
|
|||
|
|
% ¥$ƒA Š ‰A üóI. üûCB „Ö ÂD Ë tÊD ÙÖ ÝD Ë <åD ÊÆ üñD? ›Á ̵E âÁ ÓE Ë üÛE@ «× ü F- û üÒFI ±Ã G Ë ü¨G ŽÄ üÌG& # let res = iter.next16('a' as u16);Á ü÷G1 ÛÄ üH& # let res = iter.next16('b' as u16);Á üØH1 ºÅ üŽI& # let res = iter.next16('c' as u16);Á ü¹I) ™Æ <çI ÊÆ4úI æ æÎSØ_�T ! �J !
|
|||
|
|
& ¥$†J Š ŒJ üÊQP \ÍQ ç çÎSÞqÞqØ_�T ! ÙQ !
|
|||
|
|
' ¥$ÞQ Ÿ- äQ lengthÁ4ðQ in_unitÁ<ÿQ ü¥g? L¨g è èÎSÞqØ_�T ! ²g !
|
|||
|
|
( ¥$·g Ÿ- ½g Õà<Ég ”®s $±s é éÎS ! ¶s !
|
|||
|
|
) ¥$»s ü®t4 l±t ê êÎS Þqø°ú°û°Ð ü° ý°�þ°ì H�ˈXêE>Þq ! ¿t !
|
|||
|
|
* ¥$Àt Ÿ- Æt üêy1 Tíy ë ëÎS Þq×ã ! øy !
|
|||
|
|
+ ¥$ùy Ÿ- ÿy üÓ{1 TÖ{ ì ìÎS Þq×ã ! á{ !
|
|||
|
|
, ¥$â{ Ÿ- è{ ü‹~0 dŽ~ í íÎS Þq�T ! ›~ !
|
|||
|
|
- ¥$œ~ Ÿ- ¢~ üî€5 Lñ€ î îÎS Þqø°ú°û°Ð ü° ý°�þ°ì H�ˈXêE>�T ! û€ !
|
|||
|
|
. ¥$ü€ Ÿ- ‚� üÄ„? TÇ„ ï ïÎS ÞqØ_ø°ú°û°Ð ü° ý°�þ°ì H�ˈXêE>€` ! Ò„ !
|
|||
|
|
/ ¥$Ó„ Ÿ- Ù„ lead_unitÁLå„ üˆD |ň ð ðÎS ÞqØ_Ïè ! Õˆ !
|
|||
|
|
0 ¥$Öˆ Ÿ- ܈ ÆèLèˆ „‡ >Ä¡ 4„à *Ä« üËm j This module provides necessary functionality for highly efficient querying of sets of Unicode characters.Á ¹Ë ü½E B It is an implementation of the code point portion of the existingÁ üƒu r [ICU4C UnicodeSet API](https://unicode-org.github.io/icu-docs/apidoc/released/icu4c/classicu_1_1UnicodeSet.html).Á ùË ”ý # ArchitectureÁ ü�� � ICU4X [`CodePointInversionList`] is split up into independent levels, with [`CodePointInversionList`] representing the membership/query API,Á ü¡G D and [`CodePointInversionListBuilder`] representing the builder API.Á éË |í # Examples:Á ýË ü�* ' ## Creating a `CodePointInversionList`Á ¬Ë ü°a ^ `CodePointSets` are created from either serialized [`CodePointSets`](CodePointInversionList),Á ü’Z W represented by [inversion lists](http://userguide.icu-project.org/strings/properties),Á üíF C the [`CodePointInversionListBuilder`], or from the Properties API.Á ´Ë <¸ÊÆ üÀ- * use icu::collections::codepointinvlist::{Á üî> ; CodePointInversionList, CodePointInversionListBuilder,Á 4 };Á ´ Ë ü¸ ; 8 let mut builder = CodePointInversionListBuilder::new();Á üô ! builder.add_range('A'..='Z');Á ü–
|
|||
|
|
6 3 let set: CodePointInversionList = builder.build();Á Í
|
|||
|
|
Ë üÑ
|
|||
|
|
assert!(set.contains('A'));Á <ñ
|
|||
|
|
ÊÆ ù
|
|||
|
|
Ë üý
|
|||
|
|
* ' ## Querying a `CodePointInversionList`Á ¨ Ë ü¬ Œ ‰ Currently, you can check if a character/range of characters exists in the [`CodePointInversionList`], or iterate through the characters.Á ¹ Ë <½ ÊÆ üÅ -çñ üó >�ò 4²
|
|||
|
|
ãò ¹
|
|||
|
|
Ë ü½
|
|||
|
|
;ýò üù
|
|||
|
|
!Áó ü›6ëó ÒË üÖ µô üö+ ( assert!(set.contains_range('A'..='C'));Á ü¢3 0 assert_eq!(set.iter_chars().next(), Some('A'));Á <ÖÊÆ ÞË üâ åÆ „³ 5fËÌÍÒ×ØÌ´ó © tŒ/Ìž ƒ u‹<É v 4 vlû Lÿ4EFG©ƒ�À$ç Ž/ 5 7ç\ò §! 5 8ìt„ Š™ 5 9Ž|”¨
|
|||
|
|
R 5 : YokeableÁDÆ À 5 ;†ú ( 5 ;åÇDÞ
|
|||
|
|
5 <åÇ 5 5 < AsULEÁ,û É 5 >ñ<‚ � 5 ?¦~<‹ ª 5 @‘5|¡ Ë 5 A‘5 Ì 5 AíŒ× q 5 C×\ê o 5 Düà3),„í œÿü™!tÀõ”ÔÕüì'Tö·¦¨–˜´š‹ü¶@ln^`”è<î5 â_üæ3„ì5 ªª ¦~ ¨½ ®Â~½ ¯Õ~½ ʘ!ÚÆdG
|
|||
|
|
ƒ}ü€ *<† 5 Úýü’:) × I I ÁUJLMNORUXYZ[\]^_abd ,—:üÞF| üÂ:s p Returns a new [`CodePointInversionList`] from an [inversion list](https://en.wikipedia.org/wiki/Inversion_list)Á üº;L I represented as a [`ZeroVec`]`<`[`PotentialCodePoint`]`>` of code points.Á ‹<Ë ü“<P M The inversion list must be of even length, sorted ascending non-overlapping,Á üè<Y V and within the bounds of `0x0 -> 0x10FFFF` inclusive, and end points being exclusive.Á Æ=Ë tÎ=ÙÖ á=Ë <é=ÊÆ üõ=C @ use icu::collections::codepointinvlist::CodePointInversionList;Á ü½>< 9 use icu::collections::codepointinvlist::InvalidSetError;Á üþ>* ' use potential_utf::PotentialCodePoint;Á Ì?âÁ Ë?Ë üÓ? let valid = [0x0, 0x10000];Á ü÷?5 2 let inv_list: ZeroVec<PotentialCodePoint> = validÁ ¤±@ .into_iter()Á üÊ@* ' .map(PotentialCodePoint::from_u24)Á œù@ .collect();Á ü‘AK H let result = CodePointInversionList::try_from_inversion_list(inv_list);Á üáA6 3 assert!(matches!(result, CodePointInversionList));Á œBË ü¤B' $ let invalid = vec![0x0, 0x80, 0x3];Á üÐB7 4 let inv_list: ZeroVec<PotentialCodePoint> = invalidÁ |ŒC .iter()Á Œ C .copied()Á ü¶C*±„ œåCã„ üýCKÿ„ üÍD7 4 assert!(matches!(result, Err(InvalidSetError(_))));Á ü‰E2 / if let Err(InvalidSetError(actual)) = result {Á œÀE assert_eq!(Á ¬ØE &invalid,Á üòEB ? &actual.into_iter().map(u32::from).collect::<Vec<_>>()Á T¹F );Á ,ÈF }Á <ÒFÊƼåF ªª ¦~ ¨½ ®Â~½ ¯Õ~½ ʘ!ÚÆdG
|
|||
|
|
׃}ê³í³ î³Ò ï³ì ð³ ñ³“ò³ì äs{ ©¶‘ÁU£Y H H
|
|||
|
|
J ×µ/D†Gd§I J <closure_kind>Á K <closure_signature>Á K <upvars>Á K K J K ö_ Ð}â_ üéM€ üñLK H Safety: no actual safety invariants, however has correctness invariantsÁ¡ ÃM ÆM ÍM 8° 4ÇM tÁM¤ýM œ‹â_ÁU H H
|
|||
|
|
L ×µ/'Jè0J¤èe ü aD A Returns [`CodePointInversionList`] spanning entire Unicode rangeÁ éaË üña5 2 The range spans from `0x0 -> 0x10FFFF` inclusive.Á ,«b Á tµbÙÖ ÈbË <ÐbÊÆ üÜbCÔ� ¤cË ü¬c1 . let expected = [0x0, (char::MAX as u32) + 1];Á |âc assert_eq!(Á üöc? < CodePointInversionList::all().get_inversion_list_vec(),Á „ºd
|
|||
|
|
expectedÁ 4Ïd );Á |ÚdÑ� üîd- * CodePointInversionList::all().size(),Á ü e, ) (expected[1] - expected[0]) as usizeÁ 4ÑeÈ‘ <ÜeÊÆ ïe ÁU H H
|
|||
|
|
M פÇk üìf9 6 Returns [`CodePointInversionList`] spanning BMP rangeÁ ªgË ü²g3 0 The range spans from `0x0 -> 0xFFFF` inclusive.Á êgË tògÙÖ …hË <�hÊÆ ü™hCÔ� áhË üéh const BMP_MAX: u32 = 0xFFFF;Á ŽiË ü–i& # let expected = [0x0, BMP_MAX + 1];Á |ÁiÑ� üÕi? < CodePointInversionList::bmp().get_inversion_list_vec(),Á „™j°‘ 4®jÈ‘ |¹jÑ� üÍj- * CodePointInversionList::bmp().size(),Á üÿj,™’ 4°kÈ‘ <»kÊÆ Îk ÁU H H
|
|||
|
|
N ×ü t; üÄn\ Y Yields an [`Iterator`] going through the character set in the [`CodePointInversionList`]Á ¥oË toÙÖ ÀoË <ÈoÊÆ üÔoCÔ� üœp0 - let example_list = [0x41, 0x44, 0x45, 0x46];Á üÑpL I let example = CodePointInversionList::try_from_u32_inversion_list_slice(Á ´¢q &example_list,Á ,½q )Á tÇq .unwrap();Á üÚq1 . let mut ex_iter_chars = example.iter_chars();Á ü�r0 - assert_eq!(Some('A'), ex_iter_chars.next());Á üÅr0 - assert_eq!(Some('B'), ex_iter_chars.next());Á üúr0 - assert_eq!(Some('C'), ex_iter_chars.next());Á ü¯s0 - assert_eq!(Some('E'), ex_iter_chars.next());Á üäs+ ( assert_eq!(None, ex_iter_chars.next());Á <”tÊÆT§t ñ ñÁU × ñ P H ²t H
|
|||
|
|
O ×$³tøÔ¼t O8 · · O ¢¢ FilterMapÁ Å¢£ ¦8 Æ¢þ¦8 14ßhø·µ©9©9 FlatMapÁ 9ÕE‘9 ²š–¬P³ÃråÂå ChunksÁ è vÁ®i éÂ
|
|||
|
|
chunk_sizeÁ®i L/?ø? PÈ 8Ó}ΘΘ æ ИŒ Ñ˜Ï ‰’ûÜžûñ'â_ Q ö_ 8Ò} õ
|
|||
|
|
µ0 ©â × 8 P k ÞKÞ¡ ¬Át Þ¡ßK \Êt Þ¡ 8Ùt Ö¡¡ ó¡. ƒ¢# ”¢ O 4óu Où‹ Q ‘Œ Q ®Œ Q Q O Q ö_ Ö�õ üŒT üÒwK H Yields an [`Iterator`] returning the ranges of the code points that areÁ ü¢x. + included in the [`CodePointInversionList`]Á ÕxË üÝxH E Ranges are returned as [`RangeInclusive`], which is inclusive of itsÁ üªyD A `end` bound value. An end-inclusive behavior matches the ICU4C/JÁ üóy[ X behavior of ranges, ex: `CodePointInversionList::contains(UChar32 start, UChar32 end)`.Á ÓzË lÛz
|
|||
|
|
# ExampleÁ ízË <õzÊÆ ü�{CÔ� üÉ{0þ˜ üþ{L·™ ´Ï|‹š ,ê|©š tô|¶š ü‡}8 5 let mut example_iter_ranges = example.iter_ranges();Á üÄ}> ; assert_eq!(Some(0x41..=0x43), example_iter_ranges.next());Á ü‡~> ; assert_eq!(Some(0x45..=0x45), example_iter_ranges.next());Á üÊ~1 . assert_eq!(None, example_iter_ranges.next());Á <€ÊÆ\“ ò òÁU × ò S H Ÿ H
|
|||
|
|
R ×$ øÖ©7 R8 ¸ ¸ R ø¢ø¢ MapÁ û¢£ ü¢þ¦> !õ°¹UBÔŸ T ö_ ¼¡Š™Š™ ì Œ™Œ �™Ï Ž™ exhaustedÁ ‡�Åã�NL¿â_ ©â × 8 S æ ©K‰¬ ü®- ‰¬ßK ¨«ÔÀ ‰¬ 8Þ �¬ �¬1 ®¬# Á¬ R 4Ì€ Rù‹ T ‘Œ T ®Œ T T R T ö_ Ö�¨« üÜŠX üÂK¬¢ ü“ƒ4 1 *not* included in the [`CodePointInversionList`]Á ÌƒË üÔƒH£ ü¡„D“¤ üê„[à¤ Ê…Ë lÒ…Î¥ ä…Ë <ì…ÊÆ üø…CÔ� üÀ†0þ˜ üõ†L·™ ´Æ‡‹š ,ᇩš t뇶š üþ‡E B let mut example_iter_ranges = example.iter_ranges_complemented();Á üȈ; 8 assert_eq!(Some(0..=0x40), example_iter_ranges.next());Á üˆ‰> ; assert_eq!(Some(0x44..=0x44), example_iter_ranges.next());Á üˉJ G assert_eq!(Some(0x46..=char::MAX as u32), example_iter_ranges.next());Á üšŠ1•¨ <ЊÊÆÄ㊠ó óÁU × ó V H üŠ H
|
|||
|
|
U ×$ýŠø݆‹. U8 ¹ ¹ U †¢†¢ ChainÁ ‰¢ aÁ¾4 Š¢ bÁ¾4 $C#“éù †¢†¢ µ² ‰¢Ä²¾4 Š¢Ò²¾4 $C#“éù �±�± IntoIterÁ Ÿ±ÕEíQ °"姦` *¨«ø¢ø¢ á© û¢£ ü¢þ¦> !õ°¹UBÔŸ W ö_¢« ´ ©â × 8 V Q ÞKǵ ü‹‹$ ǵßK ¨«Ô”‹ ǵ 8²‹ ¿µ� ܵ4 îµ% ‚¶ U 4È‘ Uù‹ W ‘Œ W ®Œ W W U W ö_¼ üÉ”& ü÷“M J Returns the number of ranges contained in this [`CodePointInversionList`]Á|Д ô ôÁU Þq H à” H
|
|||
|
|
X ×$á”ü––F ü�•S P Returns a specific range contained in this [`CodePointInversionList`] by index.Á äõ• Intended for use in FFI.Ál�– õ õÁU Þqø°ú°û°Ð ü° ý°�þ°ì H�ˈXêE>¨« H «– H
|
|||
|
|
Y ×$¬– idxÁ ²–Ü‘™ üȘD A Returns the number of elements of the [`CodePointInversionList`]Á$˜™ ö öÁU Þq H �™ H
|
|||
|
|
Z ×$ž™ôÙš ü’šB ? Returns whether or not the [`CodePointInversionList`] is emptyÁDàš ÷ ÷ÁU H éš H
|
|||
|
|
[ ×$êšü‰�5tŒ� 5 ø øÁU â_×ã H ›� H
|
|||
|
|
\ ×$œ� queryÁ,¢�ü¦+ üÁ¡@ = Checks to see the query is in the [`CodePointInversionList`]Á †¢Ë üŽ¢W T Runs a binary search in `O(log(n))` where `n` is the number of start and end pointsÁ üê¢, ) in the set using [`core`] implementationÁ ›£Ë t££ÙÖ ¶£Ë <¾£ÊÆ üÊ£CÔ� ü’¤0 - let example_list = [0x41, 0x43, 0x44, 0x45];Á üǤL·™ ´˜¥‹š ,³¥©š t½¥¶š üÐ¥# assert!(example.contains('A'));Á üø¥$ ! assert!(!example.contains('C'));Á <¡¦ÊÆD´¦ ù ùÁU H ½¦ H
|
|||
|
|
] ×$¾¦�½,Ħü�¯, üš§m j Checks to see the unsigned int is in the [`CodePointInversionList::all()`](CodePointInversionList::all())Á Œ¨Ë ü”¨O L Note: Even though [`u32`] and [`prim@char`] in Rust are non-negative 4-byteÁ üè¨M J values, there is an important difference. A [`u32`] can take values up toÁ üº©Q N a very large integer value, while a [`prim@char`] in Rust is defined to be inÁ ü�ª? < the range from 0 to the maximum valid Unic
|
|||
|
|
R f lØú,¿ É f m¦~<Ó ª f n IncludedÁEÚ¬o ¶™ f jŸë ·™ f j ExcludedÁE�®o ¹™ f jÒë º™ f j UnboundedÁMÞ¯o ¼™ f j…ì ½™ f jüÏ5ûý ,ëòôüŠ!蜱ۄÊÎüÐI\× ‚ ƒ ‚ªª ¦~ ¨½ ®Â~½ ¯Õ~½ ʘ!ÚÆdG
|
|||
|
|
ƒƒ} ð
|
|||
|
|
o inv_list_zvÁ\ã<— o ù‹ p ‘Œ p ®Œ p p o pö_ Ö� üädŒë Œâ_â_ ™ r Œ s s r ©âŒf ý ©â‚𠜇 ÷Œfâ_ L· þ Œf $à §!‚ðŒf tŒ
|
|||
|
|
qŒf‚ð¶D,€ \^ XZ üè!Ç;ü“$¾;œ½´;üÅ" üË_ \ This module provides functionality for querying of sets of Unicode code points and strings.Á «Ë ü¯` ] It depends on [`CodePointInversionList`] to efficiently represent Unicode code points, whileÁ ü�3 0 it also maintains a list of strings in the set.Á ÄË üÈ�Æ· ÔÍ Ûú†¨¯Ì´Û © w y tŒ/Ìó ƒ w z u‹<� v w {†úD¢ À w |†ú ( w |åÇDº
|
|||
|
|
w }åÇ 5 w } VarZeroSliceÁdÒ ‘ w €˜Tà à w €üÁLÀ®°œƒ tœ’”°rüÈ#IK9;ü„6 × ‚ ‚ ¡Zƒ„…†‡ˆ‰Š‹ ,‰üð— üÁh e Returns a new [`CodePointInversionListAndStringList`] from both a [`CodePointInversionList`] for theÁ ü®= : code points and a [`VarZeroVec`]`<`[`str`]`>` of strings.ÁD÷ ÁUàà ဘ åì 6
|
|||
|
|
ä>(ùOè ×°™ê³í³ î³Ò ï³ì ð³ ñ³“ò³ì äs{ ©¶‘¡Zø] � �
|
|||
|
|
ƒ ×Ý6\‰ø6D½ü‚)Ž¡ Ü( ß( æ( 8° 4à( tÚ(¤�) ÁU•ø¡Z � �
|
|||
|
|
„ ×Ý6ìKø6\Lܯ, ü…+A > Returns the number of elements in this set (its cardinality).Á üË+? < Note than the elements of a set may include both individualÁ Ü�, codepoints and strings.Á$¶, „ „¡Z Þq � », �
|
|||
|
|
… ×$¼,üå-! üŽ-R O Return true if this set contains multi-code point strings or the empty string.Á\ì- … …¡Z � ø- �
|
|||
|
|
† ×$ù-üÙ5+ ¶.Ë t¾.ÙÖ <Ñ.ÊÆ üÝ.CÔ� ü¥/Z W use icu::collections::codepointinvliststringlist::CodePointInversionListAndStringList;Á ä„0 use zerovec::VarZeroVec;Á ¥0Ë ü08 5 let cp_slice = &[0, 0x1_0000, 0x10_FFFF, 0x11_0000];Á Œê0 let cp_list =Á ü€1T Q CodePointInversionList::try_from_u32_inversion_list_slice(cp_slice).unwrap();Á üÙ1< 9 let str_slice = &["", "bmp_max", "unicode_max", "zero"];Á üš26 3 let str_list = VarZeroVec::<str>::from(str_slice);Á Õ2Ë üÝ2[ X let cpilsl = CodePointInversionListAndStringList::try_from(cp_list, str_list).unwrap();Á ½3Ë üÅ3, ) assert!(cpilsl.contains_str("bmp_max"));Á üö3% " assert!(cpilsl.contains_str(""));Á ü 4& # assert!(cpilsl.contains_str("A"));Á üË4J G assert!(cpilsl.contains_str("ቔ")); // U+1254 ETHIOPIC SYLLABLE QHEEÁ üš5. + assert!(!cpilsl.contains_str("bazinga!"));Á <Í5ÊÆdà5 † ‡ †¡Z ‡ � í5 �
|
|||
|
|
‡ ×$î5ö ô5ü¾>) ‡8Ë t�8ÙÖ <¢8ÊÆ ü®8CÔ� üö8ZÈý äÕ9ªþ ö9Ë üþ9F C let cp_slice = &[0, 0x80, 0xFFFF, 0x1_0000, 0x10_FFFF, 0x11_0000];Á ŒÉ:šÿ üß:U R CodePointInversionList::try_from_u32_inversion_list_slice(cp_slice).unwrap();Á ü¹;I F let str_slice = &["", "ascii_max", "bmp_max", "unicode_max", "zero"];Á ü‡<6Ö€ Â<Ë üÊ<[ � ª=Ë ü²=" assert!(cpilsl.contains32(0));Á üÙ=' $ assert!(cpilsl.contains32(0x0042));Á ü…>( % assert!(!cpilsl.contains32(0x0080));Á <²>ÊÆTÅ> ˆ ˆ¡Z â_ � Ð> �
|
|||
|
|
ˆ ×$Ñ> cpÁ×>ü¡F( �?Ë t¥?ÙÖ <¸?ÊÆ üÄ?CÔ� üŒ@ZÈý äë@ªþ ŒAË ü”A8Úþ ŒÑAšÿ üçAT´ÿ üÀB<‘€ ü�C6Ö€ ¼CË üÄC[ � ¤DË ü¬D" assert!(cpilsl.contains('A'));Á üÓDF C assert!(cpilsl.contains('ቔ')); // U+1254 ETHIOPIC SYLLABLE QHEEÁ üžE, ) assert!(!cpilsl.contains('\u{1_0000}'));Á üÏEM J assert!(!cpilsl.contains('🨫')); // U+1FA2B NEUTRAL CHESS TURNED QUEENÁD¨F ‰ ‰¡Z � ±F �
|
|||
|
|
‰ ×$²F chÁ¸Fü´G; üúF5 2 Access the underlying [`CodePointInversionList`].Á\»G Š Š¡Z ŠÁU � ÇG �
|
|||
|
|
Š ×$ÈGü½H+ ü—H! Access the contained strings.Á<ÄH ‹ ‹¡Z ‹‘‘ �ô ”‡
|
|||
|
|
� • entire_sliceÁ� Ž6Òß�ñ’K°™ � ÌH �
|
|||
|
|
‹ ×$ÍH¬é üËP M This module provides a data structure for an time-efficient lookup of valuesÁ ôœ associated to code points.Á »Ë ü¿‰ † It is an implementation of the existing [ICU4C UCPTrie](https://unicode-org.github.io/icu-docs/apidoc/released/icu4c/ucptrie_8h.html)Á üÉZ W / [ICU4J CodePointTrie](https://unicode-org.github.io/icu-docs/apidoc/dev/icu4j/) API.Á ¤Ë ”¨Ãì »Ë ü¿n k ICU4X [`CodePointTrie`] is designed to provide a read-only view of [`CodePointTrie`] data that is exportedÁ ü®m±´ üœ% " for the [`CodePointTrie`] struct.Á ÂË tÆÙÖ ÕË üÙ! ## Querying a `CodePointTrie`Á ûË <ÿÊÆ ü‡0 - use icu::collections::codepointtrie::planes;Á ü¸) & let trie = planes::get_planes_trie();Á âË üæ2 / assert_eq!(0, trie.get32(0x41)); // 'A' as u32Á ü™6 3 assert_eq!(0, trie.get32(0x13E0)); // 'á� ' as u32Á üÐ8 5 assert_eq!(1, trie.get32(0x10044)); // 'ð��„' as u32Á <‰ ÊÆ ‘ Ë ü• åÆ lñ �”—°•DŒÎ
|
|||
|
|
¨ µœ Ìñ
|
|||
|
|
Î ¶¢?lœ â ·ÚAœ» Š ¸¬EŒà º ¹ÿE”ƒ  ºà<D§ ´ »ØLÁ › ¼Å#,Ü ‹ ½’ ”ó Ø ¾ CodePointTrieErrorÁ”Ÿ
|
|||
|
|
Î ¿T· 4» Œ› Î×Ø‹¨âŠºÂ´ÊË”,ì Î � Ž CharTryFromErrorÁ„ü èŸ � �
|
|||
|
|
InfallibleÁT¡ äß � ‘¤<À � � ’‹<Ø å` � “ TryFromIntErrorÁ|¨ þŽ � ”ìtÈ Š™ � •†úDâ À � –†ú ( � –åÇDú
|
|||
|
|
� —åÇ 5 � —Øú,– É � ˜‘Là  � ™¦~<ø ª � šÀ$|Õ
|
|||
|
|
˜ � �×$ÜÎ
|
|||
|
|
™ � �ú$œÙ
|
|||
|
|
š � �•%ÜÍ
|
|||
|
|
› � �¸%ä±
|
|||
|
|
œ � �Ü%Üï
|
|||
|
|
� � �ÿ%Ô—
|
|||
|
|
ž � �¡&„ù
|
|||
|
|
Ÿ � �¹&\¸
|
|||
|
|
� �Ì&”Þ
|
|||
|
|
¡ � �æ&<Ø
|
|||
|
|
|
|||
|
|
¢ � �õ&<ª
|
|||
|
|
£ � �„'<†
|
|||
|
|
¤ � �“'L–
|
|||
|
|
¥ � �¤'L®
|
|||
|
|
¦ � �µ'ÔÔ
|
|||
|
|
§ � �×'¤È
|
|||
|
|
¨ � �ó'dÄ
|
|||
|
|
© � �‡(¤º
|
|||
|
|
ª � �£(¤¢
|
|||
|
|
« � �¿(dž
|
|||
|
|
¬ � �Ó(¼Œ
|
|||
|
|
� �ò(|Œ
|
|||
|
|
® � �‰)tË
|
|||
|
|
¯ � �üÏ"Mü÷ äð4Ì’´± ”ÍþÔ�á̽ÒtÜ”🜈}”×o„ïaüÝJ ü×T Q A trait representing the values stored in the data array of a [`CodePointTrie`].Á ü¬M J This trait is used as a type parameter in constructing a `CodePointTrie`.Á úË üþ^ [ This trait can be implemented on anything that can be represented as a u32s worth of data.Á Lç › › ªâ üÝñ þ Ϧ $ò £Ï¦ ù žÏ¦Ï¦ Lþ ÉϦ œŠ Ϧ< › Ǧi Û¦] ë¦S û¦E �§; Ÿ§6 Ǧ� Û¦� ë¦w û¦i �§_ Ÿ§Zœ�žœ�ž ©â Ϧ œ ôà å`—¨ <ö �¨ §¨ � ž ìà ü®N K Last-resort fallback value to return if we cannot read data from the trie.Á �Ë ü‰U R In most cases, the error value is read from the last element of the `data` array,Á üã5 2 this value is used for empty codepointtrie arraysÁ ü�> ; Error type when converting from a u32 to this `TrieValue`.Á|å › › üð? üƒO L A parsing function that is primarily motivated by deserialization contexts.Á ü×R O When the serialization type width is smaller than 32 bits, then it is expectedÁ ü®= : that the call site will widen the value to a `u32` first.Ádó â_ê³í³ î³Ò ï³ì ð³ ñ³“ò³ì äs{ ©¶‘Ϧ—¨ › ›
|
|||
|
|
�Ϧ» €¼µ üµF C A method for converting back to a `u32` that can roundtrip throughÁ ü€ F C [`Self::try_from_u32()`]. The default implementation of this traitÁ üË > ; method panics in debug mode and returns 0 in release mode.Á Ž Ë ü– J G This method is allowed to have GIGO behavior when fed a value that hasÁ üå K H no corresponding `u32` (since such values cannot be stored in the trie)Á4¸ Ϧâ_ › ›
|
|||
|
|
žÏ¦$¿ üÐ &ÌÝ ÷ ¿" ý – , þ 8 primitiveÁ Lÿ & ˆ 8” ‰ $ ‹ , � 8—$ ,Ž & “ 8” ” *˜ › ¼" 8 $¥ 8Ø Lª 8
|
|||
|
|
´ , ¸ 8Á± L¹ à ¶" 8! $Ñ 8é |Ö æ , è 8—$ ,é % î 8 ü 8€ dÿ ‹ ’ 8» Œ & � 8² � (” 8ý 4— � 8 $ž $ ¢ 8 $¤ '¨ 8é |ª ¹ » ë 8 $Í 'Ñ 8‰ DÓ Û Ý 8» Ü 8 ú 8” 4ý ƒ! ˆ! 8 $„! (Š! 8² �! ‘! ¬" 8 $”" 8 ™" 8² œ" % ½" üô(U”÷( � ŒfŒfŒfŒf ™ ¡ ¡ ³ð Š) ›Œf L�)
|
|||
|
|
Œf˜,˜) trie_null_valueÁ|¢)ÕBT¶)BD ìéJ Î^£¤ ƒ „ ¤ T�K,’K ¢ ¢ µiüÃKVDÆK Î_ê³í³ î³Ò ï³ì ð³ ñ³“ò³ì äs{ ©¶‘Î^µi ¢ ¢
|
|||
|
|
¤
|
|||
|
|
trie_type_intÁlÏKtéQ öQ ÷Q ºX šS ªS , ›S 8IJ œS & �S 8� žS ¡S , £S 8Ò² ¤S & ¥S 8ï $¦S *¬S ¯S ôT ¹S îT + ÇS ÈS ÝS 8è ,ÉS ÎS ÜS 8
|
|||
|
|
unused_parensÁ lÏS 8 ëS 8IJ ïS ñS , óS 8IJ ôS % õS 8 ƒT 8Ò² ‡T ‰T , ‹T 8Ò² ŒT % �T 8îÒ d›T §T ¨T ÃT 8IJ ©T ªT 8 checked_addÁ \«T ¶T ¸T 8Ò² ·T ¹T 8 is_someÁ <ºT ÁT ÂT % ÄT , ÒT 8IJ ÓT ÔT 8Ë dÕT áT äT , âT 8Ò² ãT % õT ûT ‹U , üT 8IJ ýT & þT 8� ÿT ‚U , „U 8Ò² …U & †U 8ï $‡U *�U �U ÖV ›U ÐV + ©U ªU ¿U 8è ,«U °U ¾U 8‡º l±U 8 ÍU 8IJ ÑU ÓU , ÕU 8IJ ÖU % ×U 8 åU 8Ò² éU ëU , íU 8Ò² îU % ïU 8îÒ dýU ‰V ŠV ¥V 8IJ ‹V ŒV 8 checked_subÁ \�V ˜V šV 8Ò² ™V ›V 8ö» <œV £V ¤V % ¦V , ´V 8IJ µV ¶V 8Ð d·V ÃV ÆV , ÄV 8Ò² ÅV % ×V ÝV íV , ÞV 8IJ ßV & àV 8� áV
|
|||
|
|
äV , æV 8Ò² çV & èV 8ï $éV *ïV òV ·X üV ±X + ŠW ‹W W 8è ,ŒW ‘W ŸW 8‡º l’W
|
|||
|
|
ˆØ_ªª ¦~ ¨½ ®Â~½ ¯Õ~½ ʘ!ÚÆdG
|
|||
|
|
ˆæ`æ`“` ¦ ¦
|
|||
|
|
© ˆæ`Ç?ÕMö%NÝ+uNÖ ~Nü…`© üó^K H Returns a new [`CodePointTrie`] backed by borrowed data for the `index`Á üÃ_= : array and `data` array, whose data values have width `W`.Á<Œ` ¯c„ÉÑÉê³í³ î³Ò ï³ì ð³ ñ³“ò³ì äs{ ©¶‘“`µi ¦ ¦
|
|||
|
|
ª ˆæ`Ç?4�`ö,Â`Ý+$æ`üÂg›|Ðg Œ � Ž Œ¯c �žÖ ŽÂ Ñ Åì¾ ÈE(�mÇæ` ê³í³ î³Ò ï³ì ð³ ñ³“ò³ì äs{ ©¶‘æ`µi ¦ ñg ¦
|
|||
|
|
« ˆæ`Ç?4égö,�hÝ+$¯hüÅ…Y üã„O L Turns this trie into a version whose trie type is encoded in the Rust type.ÁDÌ… “` ‹ Ž �ä# �ì ‘ ’ý# “ì 2�LWJfŸŒgŽh ¦ ¦
|
|||
|
|
¬ ˆæ`$Õ…üîˆo üû‡` ] Obtains a reference to this trie as a Rust type that encodes the trie type in the Rust type.Ádõˆ � �“` ‹ Ž �ä# �ì ‘ ’ý# “ì 2�LWJfŸ �Œg �Žh ¦ ‹‰ ¦
|
|||
|
|
ˆæ`$Œ‰üÀ�%¤Ã� � � �“` â_ ¦ Ø� ¦
|
|||
|
|
® ˆæ`$Ù�üË“6¤Î“ � ‘ ‘“` â_â_ ¦ ã“ ¦
|
|||
|
|
¯ ˆæ`$ä“
|
|||
|
|
code_pointÁTê“üÔ®-\×® � ’ ’“` â_â_ ¦ ã® ¦
|
|||
|
|
° ˆæ`$䮤ÔTê®ü›¶,Tž¶ � “ ““` â_â_ ¦ ©¶ ¦
|
|||
|
|
± ˆæ`$ª¶¤ÔT°¶üþ¼;œ�½ � ” ”“` â_ø°ú°û°Ð ü° ý°�þ°ì H�ˈXêE>æ` ¦ •½ ¦
|
|||
|
|
² ˆæ`$–½¤ÔTœ½üõÆ@ÌÿÆ � • •“` â_æ` ¦ ™Ç ¦
|
|||
|
|
³ ˆæ`$šÇ¤ÔT ÇüÊÕ9ÌÍÕ � – –“` â_æ` ¦ çÕ ¦
|
|||
|
|
´ ˆæ`$èÕ¤ÔTîÕüâÛ4¤åÛ � — —“` â_æ` ¦ úÛ ¦
|
|||
|
|
µ ˆæ`$ûÛ¤ÔT�ÜüÁã) üÏßU R Returns the value that is associated with `code_point` in this [`CodePointTrie`].Á ©àË t±àÙÖ ÄàË <ÌàÊÆ üØà0ÿ– ü�á)¸— »áË üÃá2õ— üúá6°˜ üµâ8ï˜ <òâÊÆ,Èã ˜ ˜“` â_æ` ¦ Îã ¦
|
|||
|
|
¶ ˆæ`$Ïã¤ÔTÕãüœé üæåO L Returns the value that is associated with `char` in this [`CodePointTrie`].Á ºæË tÂæÙÖ ÕæË <ÝæÊÆ üéæ0ÿ– üžç)¸— ÌçË üÔç/ , assert_eq!(0, trie.get('A')); // 'A' as u32Á üˆè3 0 assert_eq!(0, trie.get('á� ')); // 'á� ' as u32Á üÀè5 2 assert_eq!(1, trie.get('ð��„')); // 'ð��„' as u32Á <úèÊÆ £é ™ ™“` æ` ¦ §é ¦
|
|||
|
|
· ˆæ`$¨éŠ ®éü±í" üÈìN K Returns the value that is associated with `bmp` in this [`CodePointTrie`].Á,¸í š š“` Ø_æ` ¦ ¾í ¦
|
|||
|
|
¸ ˆæ`$¿íê Åíü²ó: üâðC @ Lookup trie value by non-Basic Multilingual Plane Scalar Value.Á ªñË ü²ñ` ] The return value may be bogus (not necessarily `error_value`) is the argument is actually inÁ ü—òB ? the Basic Multilingual Plane or above the Unicode Scalar ValueÁ üÞò9 6 range (panics instead with debug assertions enabled).Áœ¹ó › ›“` â_æ` ¦ Íó ¦
|
|||
|
|
¹ ˆæ`$Îó¾ÐlÔóüÌù; ü’õo l Returns a reference to the ULE of the value that is associated with `code_point` in this [`CodePointTrie`].Á †öË tŽöÙÖ ¡öË <©öÊÆ üµö0ÿ– üêö)¸— ˜÷Ë ü ÷= : assert_eq!(Some(&0), trie.get32_ule(0x41)); // 'A' as u32Á üâ÷A > assert_eq!(Some(&0), trie.get32_ule(0x13E0)); // 'á� ' as u32Á ü¨øC @ assert_eq!(Some(&1), trie.get32_ule(0x10044)); // 'ð��„' as u32Á <ðøÊÆLÓù œ œ“` â_ø°ú°û°Ð ü° ý°�þ°ì H�ˈXêE> œ æ`Ê ¦ Ýù ¦
|
|||
|
|
º ˆæ`$Þù¤ÔTäùü ¬C üü™K H Returns a [`CodePointMapRange`] struct which represents a range of codeÁ üÌšJ G points associated with the same trie value. The returned range will beÁ ü››K H the longest stretch of consecutive code points starting at `start` thatÁ ¬ë› share this value.Á …œË ü�œ: 7 This method is designed to use the internal details ofÁ üÌœK H the structure of [`CodePointTrie`] to be optimally efficient. This willÁ üœ�H E outperform a naive approach that just uses [`CodePointTrie::get()`].Á é�Ë üñ�J G This method provides lower-level functionality that can be used in theÁ üÀžI F implementation of other methods that are more convenient to the user.Á üŽŸ> ; To obtain an optimal partition of the code point space forÁ üÑŸ; 8 this trie resulting in the fewest number of ranges, seeÁ ü‘ % " [`CodePointTrie::iter_ranges()`].Á » Ë tà ÙÖ Ö Ë <Þ ÊÆ üê 0ÿ– Ÿ¡Ë ü§¡)¸— Õ¡Ë üÝ¡) & const CODE_POINT_MAX: u32 = 0x10ffff;Á Ì‹¢ let start = 0x1_0000;Á Ü©¢ let exp_end = 0x1_ffff;Á É¢Ë üÑ¢& # let start_val = trie.get32(start);Á üü¢/ , assert_eq!(trie.get32(exp_end),
|
|||
|
|
Ÿ»ðºº¼ ¸º Âø•Í»/ Á¥ ¶ ¶ Á ¥ ¥ú» ¥ ¥   »* Å£ À Æö* À “;"k‘ Hªø¢ø¢ á© û¢£ ü¢þ¦> !õ°¹UBÔ Î Î œ ÑÍ � ÒØ � Gƒ}O¤™Ew ¥æ` Æ æ` ¥é›Ñ›ö_ š“ ¨ ¨ •D ª¶D «˜ v.¾¡C6}?é› Ñ›é› ©â ˆæ` ¥é›Ñ› ¥ Å ” ÞKŽ¡ üÒ»% Ž¡ßK  ÜÛ» Ž¡ ¥’ †¡Ï ¶¡3 È¡$ Ü¡¬ Á dâ¼ Áù‹ Æ ‘Œ Æ ®Œ Æ Æ Á Æ æ` é›Ñ›ö_¼ ü ôìÅ üŸÅ: 7 Returns the value used as an error value for this trieÁ\óÅ “` æ` ¦ ÿÅ ¦
|
|||
|
|
Ç ˆæ`$€ÆüµÌ3 8 ¡ ™ É ¡ É …Æ ºÌ •ÆL½Ì ÷æ`â_ LÉÌüdÊ ') ü–Ñ/ üïÌU R Returns the value that is associated with `code_point` for this [`CodePointTrie`]Á |ÉÍ as a `u32`.Á ÝÍË tåÍÙÖ øÍË <€ÎÊÆ üŒÎ0ÿ– üÁÎ)¸— ïÎË Ü÷Î let cp = 'ð‘–Ž' as u32;Á ä—Ï assert_eq!(cp, 0x1158E);Á ¸ÏË üÀÏ' $ let plane_num: u8 = trie.get32(cp);Á üìÏ5 2 assert_eq!(trie.get32_u32(cp), plane_num as u32);Á <¦ÐÊÆL�Ñ ¢ ¢üd â_â_ È §Ñ È
|
|||
|
|
Ê 8æ`$¨Ñ¤ÔT®Ñü÷Ñc 8 £ ™ Ì £ Ì …Æ üÑ •ÆLÿÑ Þ”ë ,ÔÒüdÍ ß Í -/ ¼áÒ,äÒ ¤ ¤üd üd Ë êÒ Ë
|
|||
|
|
Í 8æ`$ëÒüöØ6 ü‹ØN K A custom [`Iterator`] type specifically for a code point trie that returnsÁ ÜÚØ [`CodePointMapRange`]s.Á Ì�Ù ¥ Ï ™ Ð Ï Ð …Æ ŸÙ •ÆL¢Ù ¥ ¥ì³Ù æ` ¥ Ø_Ê ¥ýü ”ë ¥ Î Î œ ÑÍ � ÒØ � Gƒ}O¤™Ew ¥æ` Gƒ}O¤™Ew ÑÒ›Ù°² ¢ ³Ù� Î Î ¥ â â ¢? åÇ? æö çÝ+ ‰Ö GÈ—ÂH·ï ¥æ` üÊÝ'LÊÝ� Î Î ÂÿüöÝ@ 8 ¥ ™ Ô ¥ Ô …Æ ûÝ •ÆLþÝÄfÕÖ ßK àK Ö #% L½Þ$ÂÞ Ó Ó †€üäÞ($çÞ ¦ ¦Äfø°ú°û°Ð ü° ý°�þ°ì H�ˈXêE> ÄfßK Ó ìÞ Ó
|
|||
|
|
Ö 8æ`$ñÞTòã $øã� × × Ç¦lòã × Ç¦ Ǧ üŸå7 ü�äA > Trait for writing trait bounds for monomorphizing over eitherÁ üÃä0 - `FastCodePointTrie` or `SmallCodePointTrie`.Á ”©å Ø ˆ Ù ™ Ú Ú Ø Ù Ç¦üŸå– ×Ϧ $Òå ©âÆb Ãå ›Æb LÆå Ø Ç¦M ˜³@ ǦY ˜³LÛÜÝÞßàáâãÛÜÝÞßàáâã Ý à Ü ã ß â Þ á ,¼å’” ̘ç üÝå< 9 The `TrieType` associated with this `TypedCodePointTrie`Á žæË ì¦æ # Safety Usable InvariantÁ ÈæË üÐæC @ This constant matches `self.as_untyped_ref().header.trie_type`.ÁLžç Ø Ø Î^ü©è+ ü¸çV S Lookup trie value as `u32` by Unicode Scalar Value without branching on trie type.ÁL¬è § §Ï¦ â_â_ Ø ¶è Ø
|
|||
|
|
ÜϦ ˆÆb$·è¤ÔT½èô�ê üŠé\ Y Lookup trie value by Basic Multilingual Plane Code Point without branching on trie type.Á,„ê ¨ ¨Ï¦ Ø_Æb Ø Šê Ø
|
|||
|
|
ÝϦ ˆÆb$‹êê ‘êü¼î6 ü¿íb _ Lookup trie value by non-Basic Multilingual Plane Scalar Value without branching on trie type.Áœ¿î © ©Ï¦ â_Æb Ø Óî Ø
|
|||
|
|
ÞϦ ˆÆb$Ôî¾ÐlÚîÜ©ð üÁïM J Lookup trie value by Unicode Scalar Value without branching on trie type.Á ¬ð ª ªÏ¦ Æb Ø °ð Ø
|
|||
|
|
ßϦ ˆÆb$±ðŠ ·ðüÈô% üâóK H Lookup trie value by Unicode Code Point without branching on trie type.Á,Ëô
|
|||
|
|
-^ €`üÄ*
|
|||
|
|
+^ â_üÏ"
|
|||
|
|
)^ â_üÃ*
|
|||
|
|
'^ â_ü§+
|
|||
|
|
%^ â_üå*
|
|||
|
|
#^ â_ü�)
|
|||
|
|
!^ â_üï
|
|||
|
|
^ â_Ô®
|
|||
|
|
^ â_üÔ !
|
|||
|
|
^ â_´Î
|
|||
|
|
|
|||
|
|
^ â_´
|
|||
|
|
^ â_´ü
|
|||
|
|
^ â_ÄŒ
|
|||
|
|
^ â_Ĥ
|
|||
|
|
^ â_üÊ)
|
|||
|
|
^ â_ü¾#
|
|||
|
|
^ â_ܺ
|