2999 lines
858 KiB
Plaintext
2999 lines
858 KiB
Plaintext
|
rust
|
|||
|
|
h
|
|||
|
|
#rustc 1.96.0 (ac68faa20 2026-05-25)ÁíàÄTËŸ ÜJîÄ)'ß\¥! -3d1337db07d0b3aeÁ ¤²XctÔ'ÐÓ©z¨É½Ó -a4945860e1c53b00Á ¤°ð ¾ä-±($²ï=©Ã -7e98a21bfd32b0edÁ allocator_api2ÁÆÛŠfêxuìÌ@˜(}Ïu‘ -7b02f80e4eb85c1bÁ
|
|||
|
|
equivalentÁ˜úôa ,t ùƳJ8®ød -293c030140ba1879Á foldhashÁ¨%¹9ü'?ž˜ë‰4Î -307afae06628b423Á ‰ DefaultHashBuilderÁ”Ô
|
|||
|
|
» default-hasherÁÔ
|
|||
|
|
ä¬
|
|||
|
|
À ’ ‚ $ñ
|
|||
|
|
¦TÉ» nightlyÁœ¦[
|
|||
|
|
AllocErrorÁT)‚ $[ innerÁ,½»¨œ£`¹TÆ ‚ $œ [Ô,廨œ» allocator-api2ÁÔÂü¬1ü¨6A¹TÀ‚ $�A test_mapÁD�‘ ‚ $‚‘ ‡ likelyÁ4Œ»¨œT‡ûD”»¨� rayonÁ,)»¡Œ� serdeÁ,N»»Œ6Ž make_hashÁLšE»¨œÉDŽÒD—Š ‚ $ŒŠ õ
|
|||
|
|
ÒD‹€‚ $€€ rustc_entryÁ\› » rustc-internal-apiÁôö Ú test_setÁD—Ý‚ $ŒÝ€ testsÁ,ÿ· ‚ $ô· ì¡,¬ »¡Œœ î¡,ˆ »¡Œø ð¡,ì »¡ŒÚ
|
|||
|
|
EquivalentÁTÙ" »è´¤ Ä£ µ$¼
|
|||
|
|
ðµ¼À
|
|||
|
|
impÁ Ö
|
|||
|
|
ðµ lsxÁ Ì
|
|||
|
|
Ȭσ
|
|||
|
|
Œ ä
|
|||
|
|
»¨ genericÁ<‚
|
|||
|
|
|
|||
|
|
ðµfìôœå
|
|||
|
|
ìõ´ú
|
|||
|
|
üä-
|
|||
|
|
µ $Ÿ
|
|||
|
|
4ž
|
|||
|
|
ü¶u
|
|||
|
|
쀼ü
|
|||
|
|
ðà ¼�
|
|||
|
|
í littleÁÄÆ
|
|||
|
|
µ $ì
|
|||
|
|
4ë
|
|||
|
|
üò†
|
|||
|
|
»¨´ì¾Üæ
|
|||
|
|
𣴋
|
|||
|
|
µ $¯
|
|||
|
|
4®
|
|||
|
|
ü¿|
|
|||
|
|
XÃ
|
|||
|
|
€¿
|
|||
|
|
Œ ¢
|
|||
|
|
|
|||
|
|
ðµ2ìôÍìõËɵ ÆÄ 쀿ðà ½í¾ µµ ³±¯ »¨_쾬𣪵 ¨¦¤¡ž í Î ¤ macrosÁ cfg_ifÁ ¦ controlÁ bitmaskÁ invertÁ remove_lowest_bitÁ any_bit_setÁ lowest_set_bitÁ trailing_zerosÁ nonzero_trailing_zerosÁ
|
|||
|
|
leading_zerosÁ › IntoIterÁ ê › ó groupÁ tagÁ ' ''' + EMPTYÁ + DELETEDÁ + is_fullÁ +
|
|||
|
|
is_specialÁ + special_is_emptyÁ +… 1 MIN_HASH_LENÁ '3× ' TagSliceExtÁ 5 fill_tagÁ 5
|
|||
|
|
fill_emptyÁ '8Ã @ A AAAAAAAAA A
|
|||
|
|
A A A
|
|||
|
|
AAAAAAAAAAAA¤ [ [[[[Ô ` ````` do_allocÁ f’ AAAA A offset_fromÁ l¥ A n capacity_overflowÁ n alloc_errÁ A SizedTypePropertiesÁ q
|
|||
|
|
IS_ZERO_SIZEDÁ q
|
|||
|
|
NEEDS_DROPÁ At¥ A h1Á Aw move_nextÁ A capacity_to_bucketsÁ A bucket_mask_to_capacityÁ A{æ |¥ { calculate_layout_forÁ A
|
|||
|
|
InsertSlotÁ Ö A BucketÁ �¥ �µ A„¥ A†¥ †ƒ A‰¥ ‰ from_base_indexÁ ‰
|
|||
|
|
to_base_indexÁ ‰ as_ptrÁ ‰ as_non_nullÁ ‰ next_nÁ ‰ã ‰ readÁ ‰ writeÁ ‰É “ 'aÁ ‰ as_mutÁ •Ã A RawTableÁ —¥ —’ — tableÁ —¤ —Ú A
|
|||
|
|
RawTableInnerÁ � bucket_maskÁ � ctrlÁ � growth_leftÁ � itemsÁ A¢¥ ¢æ ¢
|
|||
|
|
with_capacityÁ A¦¥ ¦’ ¦ TABLE_LAYOUTÁ ¦ new_inÁ ¦ new_uninitializedÁ ¦ with_capacity_inÁ ¦¨ ¦ data_endÁ ¦ allocation_sizeÁ ¦ bucket_indexÁ ¦ bucketÁ ¦
|
|||
|
|
erase_no_dropÁ ¦ eraseÁ ¦ removeÁ ¦ remove_entryÁ µ impl FnMut(&T) -> boolÁ ¦
|
|||
|
|
clear_no_dropÁ ¦ clearÁ ¸ ¦ shrink_toÁ º impl Fn(&T) -> u64Á ¦ reserveÁ ¼í ¦ try_reserveÁ ¾í ¦ reserve_rehashÁ Àí À À ¦ resizeÁ Äí Ä ¦ insertÁ Çí ¦ insert_entryÁ Éí ¦ replace_bucket_withÁ Ë— ¦ find_or_find_insert_slotÁ Í— Íí Í ¦ insert_in_slotÁ ¦ findÁ Ò— Ò ¦ getÁ Õ— ¦ get_mutÁ ×— ¦ get_many_mutÁ ÙŸ Ù Ù impl FnMut(usize, &T) -> boolÁ Ù Ù Þ ¦ get_many_unchecked_mutÁ àŸ à à€ à à å ¦ get_many_mut_pointersÁ çŸ ç ç€ ç ç ì ì ¦ capacityÁ ¦‘ ¦ is_emptyÁ ¦ bucketsÁ ¦ is_bucket_fullÁ ¦ù ¦ iter_hashÁ ¦ drainÁ ¦ drain_iter_fromÁ ¦ into_iter_fromÁ ¦ into_allocationÁ A ú¥ ú’ A
|
|||
|
|
ý¥ ý’ A € NEWÁ €æ A ƒÑ „’ ƒ fallible_with_capacityÁ †’ † ƒ† ‰’ ƒ fix_insert_slotÁ ƒ find_insert_slot_in_groupÁ ƒ find_or_find_insert_slot_innerÁ ƒ prepare_insert_slotÁ ƒ find_insert_slotÁ ƒ
|
|||
|
|
find_innerÁ ƒ prepare_rehash_in_placeÁ ƒù ’¥ ƒ
|
|||
|
|
drop_elementsÁ ”¥ ƒ drop_inner_tableÁ –¥ –’ ƒÅ ™¥ ƒ
|
|||
|
|
bucket_ptrÁ ƒŠ œ¥ ƒ probe_seqÁ ƒ record_item_insert_atÁ ƒ is_in_same_groupÁ ƒ
|
|||
|
|
set_ctrl_hashÁ ƒ replace_ctrl_hashÁ ƒ set_ctrlÁ ƒÆ ƒ
|
|||
|
|
ctrl_sliceÁ ƒä ƒó ƒ num_ctrl_bytesÁ ƒ is_empty_singletonÁ ƒ prepare_resizeÁ «Ã «’ « « ƒ reserve_rehash_innerÁ °’ ƒ full_buckets_indicesÁ ƒ resize_innerÁ ³’ ƒ rehash_in_placeÁ µ ƒ free_bucketsÁ ·’ ƒ allocation_infoÁ ƒ allocation_size_or_zeroÁ ƒµ ƒè A
|
|||
|
|
½¥ ½’ ½ƒ ½† Á A
|
|||
|
|
RawTableCloneÁ Ã clone_from_specÁ AÅ¥ Å’ AÈ¥ È’ È clone_from_implÁ Ë AÍ¥ Í’ Í> AÑ¥ Ñ’ Ñã AÕ¥ Õ’ Õ› ÕÒ
|
|||
|
|
Õê A RawIterRangeÁ Û¥ Û
|
|||
|
|
current_groupÁ Û dataÁ Û next_ctrlÁ Ûþ Aᥠáæ á next_implÁ ä DO_CHECK_PTR_RANGEÁ á fold_implÁ æ— æ“ Aé¥ Aë¥ Aí¥ íƒ Að¥ ð› ðó ó ð size_hintÁ Aö¥ A RawIterÁ ø¥ øù øå Aü¥ üÓ" Aÿ¥ ÿƒ A‚¥ ‚> A …¥ …› …ó ˆ …´+ … foldÁ ‹“ ‹— A Ž¥ A �¥ A FullBucketsIndicesÁ ’Í) ’ group_first_indexÁ ’Æ ’å A —›* A ™› ™ó ™´+ A!A"A RawIntoIterÁ Ÿ¥ Ÿ’ Ÿù Ÿ
|
|||
|
|
allocationÁ ŸÚ A#¥¥ ¥’ ¥ù A$©¥ ©’ A%¬¥ ¬’ A&¯¥ ¯’ ¯ã A'³¥ ³’ ³> A(·¥ ·’ ·› ·ó ·´+ A)½¥ ½’ A*À¥ À’ A RawDrainÁ Ãà å Ã’ Ãù  Ã
|
|||
|
|
orig_tableÁ ÃÚ A+Ë¥ Ë’ Ëù A,Ï¥ Ï’ A-Ò¥ Ò’ A.Õ¥ Õ’ Õã A/Ù¥ Ù’ Ù› Ùó Ù´+ A0ߥ ß’ A1⥠⒠A RawIterHashÁ å¥ åÔ å _markerÁ A2é¥ éæ ë’ A3í¥ íƒ A4ð¥ ð> A5óæ A6õ¥ õ› õó A7ù› ùó A RawExtractIfÁ üà ü¥ ü’ üù ü‚ A8‚¥ ‚’ ‚ó …— utilÁ ‡› ‡ð ‡û ‡ invalid_mutÁ ‹¥ external_trait_implsÁ Ø Ž ŽŽŽŽŽŽŽŽŽ Ž
|
|||
|
|
Ž Ž Ž
|
|||
|
|
ŽŽŽŽŽŽŽŽŽŽŽŽ� ¨œ ¨§ ¨¤ ¨’ ¨ hash_builderÁ ¨‚ Ž ¯œ ¯§ ¯¤ ¯’ ¯ƒ ¯† Ž make_hasherÁ ¶¢ ¶§ ¶¤ ¶ ¶ Ž equivalent_keyÁ ¼¢ ¼œ ¼§ ¼ ¼ Žè ¢ Âœ   ŽÕ Ç¢ Ǥ Ç ŽËœ ˧ Ëæ ˆ ŽÐœ Ч Ð’ Ðà Ðê ŽÖœ Ö§ Ö¤ Ö with_hasherÁ Ö with_capacity_and_hasherÁ ŽÜœ ܧ ܤ Ü’ ܨ Ü with_hasher_inÁ Ü with_capacity_and_hasher_inÁ Ü hasherÁ ܼ Ü keysÁ ܼ Ü
|
|||
|
|
values_mutÁ Üù Üú Ü‘ ÜÔ Ü¢ Ü retainÁ î— Ü
|
|||
|
|
extract_ifÁ ð— ÜÊ Ü into_keysÁ Ü into_valuesÁ Žõœ õ§ õ¤ õ’ õ‡ õž õ
|
|||
|
|
shrink_to_fitÁ õÜ õ entryÁ õ entry_refÁ ÿà ÿ 'bÁ ÿ¢ õµ ƒ¢ õ
|
|||
|
|
get_key_valueÁ …¢ õ get_innerÁ ‡¢ õ get_key_value_mutÁ ‰¢ õ contains_keyÁ ‹¢ õÈ �¢ õ
|
|||
|
|
get_inner_mutÁ �¢ õß ‘¢ ‘Ÿ ‘ ‘ ‘ – õ´ ˜¢ ˜Ÿ ˜ ˜ ˜ � õ get_many_key_value_mutÁ Ÿ¢ ŸŸ Ÿ Ÿ Ÿ ¤ õ get_many_key_value_unchecked_mutÁ ¦¢ ¦Ÿ ¦ ¦ ¦ « õ get_many_mut_innerÁ ¢ Ÿ õ get_many_unchecked_mut_innerÁ ³¢ ³Ÿ ³ ³ ³ õ build_hashes_innerÁ ¹¢ ¹Ÿ ¹ ¹ ¹ õü õÑ À¢ õ insert_unique_uncheckedÁ õ
|
|||
|
|
try_insertÁ õõ Ä¢ õƒ Æ¢ õš ŽÉœ ɧ ɤ É’ É� Î Ï ŽÑœ ѧ Ѥ Ñ’ ŽÖœ Ö§ Ö¤ Ö’ Ö× Ž Üœ ܧ ܤ Ü’ Ü> Ž
|
|||
|
|
✠⢠⧠⤠⒠ⰠâÖ Ž êœ ê§ ê’ êŸ ê ê÷ ð Ž IterÁ òà òœ ò§ òÔ òÚ Ž øœ ø§ øƒ Ž
|
|||
|
|
üœ ü§ ü× Ž IterMutÁ €Ã €œ €§ €Ô €Ú Ž†œ †§ Ž‰œ ‰§ ‰ù ŽÒ
|
|||
|
|
�œ �§ �’ �Ô Ž’œ ’§ ’’ ’ù Ž IntoKeysÁ —œ —§ —’ —Ô Žœœ œ§ œ’ œ> Ž¡œ ¡§ ¡’ ¡› ¡ó ¦ ¡´+ ¡Û, ©“ ©— © Žœ § ’ ‘ Ž²œ ²§ ²’ Ž¶œ ¶§ ¶’ ¶× º Ž
|
|||
|
|
IntoValuesÁ ¼œ ¼§ ¼’ ¼Ô ŽÁœ Á§ Á’ Á> ŽÆœ Ƨ Æ’ Æ› Æó Ë Æ´+ ÆÛ, Γ Η Î ŽÒœ Ò§ Ò’ Ò‘ Ž×œ ק ×’ ŽÛœ Û§ Û’ Û× ß Ž KeysÁ áà ᜠ᧠áÔ Žæœ æ§ æƒ Ž êœ ê§ ê× Ž ValuesÁ îÃ îœ î§ îÔ Ž óœ ó§ óƒ Ž ÷œ ÷§ ÷× Ž DrainÁ ûà ûœ û§ û’ ûÔ Ž �œ �§ �’ �ù Ž ExtractIfÁ †Ã †œ †§ †— †’ †± †Ô Ž Žœ Ž§ Ž— Ž’ Ž› Žó ” Ž´+ Ž!—œ —§ —— Ž ValuesMutÁ ›Ã ›œ ›§ ›Ô Ž EntryÁ à œ § ¤ ’ OccupiedÁ ¦
|
|||
|
|
¦ˆ VacantÁ ©
|
|||
|
|
©ˆ Ž"¬œ ¬§ ¬¤ ¬’ ¬× Ž
|
|||
|
|
OccupiedEntryÁ ²Ã ²œ ²§ ²¤ ²’ ²§ ² elemÁ ²‚ Ž#»œ »§ »¤ »’ Ž$Àœ À§ À¤ À’ Ž%Åœ ŧ Ť Å’ Å× Ž VacantEntryÁ Ëà ˜ ˧ ˤ Ë’ ˧ Ë keyÁ Ë‚ Ž&Ôœ Ô§ Ô¤ Ô’ Ô× Ž EntryRefÁ Úà Úò< Úœ Ú¢ Ú§ Ú¤ Ú’ ÚóO â
|
|||
|
|
∠Ú�P å
|
|||
|
|
åˆ Ž'èœ è¢ è§ è¤ è’ è× Ž VacantEntryRefÁ ïà ïò< ïœ ï¢ ï§ ï¤ ï’ ï§ ïëR ï‚ Ž(úœ ú¢ ú§ ú¤ ú’ ú× Ž
|
|||
|
|
OccupiedErrorÁ �à �œ �§ �¤ �’ �Ì< �» Ž)‰œ ‰§ ‰¤ ‰’ ‰× Ž*�œ �§ �¤ �’ �× Ž+•Ã •œ •§ •¤ •’ •› •Ò
|
|||
|
|
•ê Ž,žÃ žœ ž§ ž¤ ž’ ž› žÒ
|
|||
|
|
žê Ž-§œ §§ §¤ §’ §› §Ò
|
|||
|
|
§ê Ž.¯œ ¯§ ¯> Ž/³Ã ³œ ³§ ³› ³ó ³´+ ³Û, º“ º— º Ž0¾œ ¾§ ¾‘ Ž1Âœ § Ž2Åœ ŧ Å> Ž3Éà ɜ ɧ É› Éó É´+ ÉÛ, Г З Ð Ž4Ôœ Ô§ Ô‘ Ž5Øœ ا Ž6Ûœ Û§ Û× Ž7ßœ ߧ ß’ ß> Ž8äœ ä§ ä’ ä› äó ä´+ äÛ, ë“ ë— Ž9îœ î§ î’ î‘ Ž:óœ ó§ ó’ Ž;÷œ ÷§ ÷’ ÷× Ž<üœ ü§ ü> Ž=€ à € œ € § € › € ó € ´+ € Û, ‡ “ ‡ — ‡ Ž>‹ œ ‹ § ‹ ‘ Ž?� œ � § Ž@’ œ ’ § ’ > ŽA– à – œ – § – › – ó – ´+ – Û, � “ � — � ŽB¡ œ ¡ § ¡ ‘ ŽC¥ œ ¥ § ŽD¨ œ ¨ § ¨ > ŽE¬ à ¬ œ ¬ § ¬ › ¬ ó ¬ ´+ ¬ Û, ³ “ ³ — ³ ŽF· œ · § · ‘ ŽG» œ » § ŽH¾ œ ¾ § ¾ × Á ŽIà œ à § à ’ à › à ó à ´+ à Û, Ê “ Ê — ŽJÍ œ Í § Í ’ Í ‘ ŽKÒ œ Ò § Ò ’ ŽLÖ œ Ö § Ö ’ Ö × ŽMÛ Ã Û œ Û § Û ¤ Û ’ Û ü Û or_insertÁ Û or_insert_entryÁ Û or_insert_withÁ ä — Û or_insert_with_keyÁ æ — Û ëR Û
|
|||
|
|
and_modifyÁ é — Û and_replace_entry_withÁ ë — ŽNí Ã í œ í § í ¤ í ’ í
|
|||
|
|
or_defaultÁ ŽOô à ô œ ô § ô ¤ ô ’ ô ëR ô ƒ ô µ ô È ô into_mutÁ ô ü ô õ ô replace_entry_withÁ �
|
|||
|
|
— �
|
|||
|
|
ŽP„
|
|||
|
|
à „
|
|||
|
|
œ „
|
|||
|
|
§ „
|
|||
|
|
¤ „
|
|||
|
|
’ „
|
|||
|
|
ëR „
|
|||
|
|
into_keyÁ „
|
|||
|
|
ü „
|
|||
|
|
’ ŽQŽ
|
|||
|
|
à Ž
|
|||
|
|
ò< Ž
|
|||
|
|
œ Ž
|
|||
|
|
¢ Ž
|
|||
|
|
§ Ž
|
|||
|
|
¤ Ž
|
|||
|
|
’ Ž
|
|||
|
|
ü Ž
|
|||
|
|
ûb Ž
|
|||
|
|
£c ˜
|
|||
|
|
— Ž
|
|||
|
|
Ác š
|
|||
|
|
— Ž
|
|||
|
|
ëR Ž
|
|||
|
|
ëc �
|
|||
|
|
— ŽRŸ
|
|||
|
|
à Ÿ
|
|||
|
|
ò< Ÿ
|
|||
|
|
œ Ÿ
|
|||
|
|
¢ Ÿ
|
|||
|
|
§ Ÿ
|
|||
|
|
¤ Ÿ
|
|||
|
|
’ Ÿ
|
|||
|
|
Ød Ÿ
|
|||
|
|
or_default_entryÁ ŽS©
|
|||
|
|
à ©
|
|||
|
|
ò< ©
|
|||
|
|
œ ©
|
|||
|
|
¢ ©
|
|||
|
|
§ ©
|
|||
|
|
¤ ©
|
|||
|
|
’ ©
|
|||
|
|
ëR ©
|
|||
|
|
ü ©
|
|||
|
|
’ ŽT´
|
|||
|
|
œ ´
|
|||
|
|
§ ´
|
|||
|
|
¤ ´
|
|||
|
|
’ ´
|
|||
|
|
ù ¹
|
|||
|
|
¥ ¹
|
|||
|
|
ŽU¼
|
|||
|
|
œ ¼
|
|||
|
|
§ ¼
|
|||
|
|
¤ ¼
|
|||
|
|
’ ¼
|
|||
|
|
extendÁ Á
|
|||
|
|
¥ Á
|
|||
|
|
ŽVÄ
|
|||
|
|
à Ä
|
|||
|
|
œ Ä
|
|||
|
|
§ Ä
|
|||
|
|
¤ Ä
|
|||
|
|
’ Ä
|
|||
|
|
éi Ê
|
|||
|
|
¥ Ê
|
|||
|
|
ŽWÍ
|
|||
|
|
à Í
|
|||
|
|
œ Í
|
|||
|
|
§ Í
|
|||
|
|
¤ Í
|
|||
|
|
’ Í
|
|||
|
|
éi Ó
|
|||
|
|
¥ Ó
|
|||
|
|
Ž assert_covarianceÁ Ö
|
|||
|
|
map_keyÁ ×
|
|||
|
|
'newÁ Ö
|
|||
|
|
map_valÁ Ù
|
|||
|
|
°k Ö
|
|||
|
|
iter_keyÁ Û
|
|||
|
|
à Û
|
|||
|
|
°k Ö
|
|||
|
|
iter_valÁ Þ
|
|||
|
|
à Þ
|
|||
|
|
°k Ö
|
|||
|
|
|
|||
|
|
into_iter_keyÁ á
|
|||
|
|
°k á
|
|||
|
|
’ Ö
|
|||
|
|
|
|||
|
|
into_iter_valÁ ä
|
|||
|
|
°k ä
|
|||
|
|
’ Ö
|
|||
|
|
keys_keyÁ ç
|
|||
|
|
à ç
|
|||
|
|
°k Ö
|
|||
|
|
keys_valÁ ê
|
|||
|
|
à ê
|
|||
|
|
°k Ö
|
|||
|
|
|
|||
|
|
values_keyÁ í
|
|||
|
|
à í
|
|||
|
|
°k Ö
|
|||
|
|
|
|||
|
|
values_valÁ ð
|
|||
|
|
à ð
|
|||
|
|
°k Ö
|
|||
|
|
¢ ó
|
|||
|
|
°k raw_entryÁ õ
|
|||
|
|
õ
|
|||
|
|
õ
|
|||
|
|
õ
|
|||
|
|
õ
|
|||
|
|
õ
|
|||
|
|
õ
|
|||
|
|
õ
|
|||
|
|
õ
|
|||
|
|
õ
|
|||
|
|
õ
|
|||
|
|
|
|||
|
|
õ
|
|||
|
|
õ
|
|||
|
|
õ
|
|||
|
|
|
|||
|
|
õ
|
|||
|
|
õ
|
|||
|
|
õ
|
|||
|
|
õ
|
|||
|
|
õ
|
|||
|
|
õ
|
|||
|
|
‰ œ ‰ § ‰ ¤ ‰ ’ ‰
|
|||
|
|
raw_entry_mutÁ ‰ ðm õ
|
|||
|
|
RawEntryBuilderMutÁ � à � œ � § � ¤ � ’ � Ø õ
|
|||
|
|
RawEntryMutÁ — à — œ — § — ¤ — ’ — óO �
|
|||
|
|
� ˆ — �P
|
|||
|
|
ˆ õ
|
|||
|
|
RawOccupiedEntryMutÁ £ à £ œ £ § £ ¤ £ ’ £ �Q £ ‚ £ µ6 õ
|
|||
|
|
¬ œ ¬ § ¬ ¤ ¬ ’ õ
|
|||
|
|
± œ ± § ± ¤ ± ’ õ
|
|||
|
|
RawVacantEntryMutÁ ¶ à ¶ œ ¶ § ¶ ¤ ¶ ’ ¶ ‚ ¶ µ6 õ
|
|||
|
|
RawEntryBuilderÁ ¾ à ¾ œ ¾ § ¾ ¤ ¾ ’ ¾ Ø õ
|
|||
|
|
Å Ã Å œ Å § Å ¤ Å ’ Å from_keyÁ Ë ¢ Å from_key_hashed_nocheckÁ Í ¢ õ
|
|||
|
|
Ï Ã Ï œ Ï § Ï ¤ Ï ’ Ï from_hashÁ Õ — Õ ò< Ï searchÁ Ø — Ø ò< Ø õ
|
|||
|
|
Ü Ã Ü œ Ü § Ü ¤ Ü ’ Ü »s â ¢ Ü Ós ä ¢ Ü Èt æ — æ Ü §t é — õ
|
|||
|
|
ë Ã ë œ ë § ë ¤ ë ’ ë ü ë ûb ë £c ó — ë ëc õ — ë …d ÷ — õ
|
|||
|
|
ù à ù œ ù § ù ¤ ù ’ ù ëR ù key_mutÁ ù ³f ù µ ù ·e ù È ù ”= ù Ê= ù into_key_valueÁ ù ü ù
|
|||
|
|
insert_keyÁ ù õ ù ƒ ù ×e Œ — Œ Ž õ
|
|||
|
|
� à � œ � § � ¤ � ’ � ü � insert_hashed_nocheckÁ � insert_with_hasherÁ ˜ ™ ˜ � ’ õ
|
|||
|
|
œ œ œ § œ ¤ œ ’ œ × õ
|
|||
|
|
|
|||
|
|
¢ œ ¢ § ¢ ¤ ¢ ’ ¢ × õ
|
|||
|
|
¨ œ ¨ § ¨ ¤ ¨ ’ ¨ × õ
|
|||
|
|
® œ ® § ® ¤ ® ’ ® × õ
|
|||
|
|
|
|||
|
|
´ œ ´ § ´ ¤ ´ ’ ´ ×
|
|||
|
|
scopeguardÁ º º º º º º º
|
|||
|
|
ScopeGuardÁ Á ¥ Á — Á dropfnÁ Á » º £ Æ ¥ Æ — º É ¥ É — É
|
|||
|
|
into_innerÁ º Í ¥ Í — Í å Í ´ º Ò ¥ Ò — Ò ¶ º Ö ¥ Ö — Ö ã setÁ Ú Ú Ú Ú Ú Ú Ú Ú Ú Ú Ú
|
|||
|
|
Ú Ú Ú
|
|||
|
|
Ú Ú Ú Ú Ú Ú Ú Ú Ú Ú Ú Ú Ú Ú Ú Ú Ú Ú � ú ¥ ú ¤ ú ’ ú Ø Ú ÿ ¥ ÿ ¤ ÿ ’ ÿ ƒ ÿ † Ú …
|
|||
|
|
¥ …
|
|||
|
|
æ …
|
|||
|
|
† Ú ‰
|
|||
|
|
¥ ‰
|
|||
|
|
’ ‰
|
|||
|
|
à ‰
|
|||
|
|
ê Ú Ž
|
|||
|
|
¥ Ž
|
|||
|
|
¤ Ž
|
|||
|
|
’ Ž
|
|||
|
|
¼ Ž
|
|||
|
|
ù Ž
|
|||
|
|
‘ Ž
|
|||
|
|
Ô Ž
|
|||
|
|
¢ Ž
|
|||
|
|
ž; —
|
|||
|
|
— —
|
|||
|
|
Ž
|
|||
|
|
´; š
|
|||
|
|
— Ž
|
|||
|
|
Ê Ú �
|
|||
|
|
¥ �
|
|||
|
|
¤ �
|
|||
|
|
¡9 �
|
|||
|
|
´9 Ú ¢
|
|||
|
|
¥ ¢
|
|||
|
|
¤ ¢
|
|||
|
|
’ ¢
|
|||
|
|
¨ ¢
|
|||
|
|
�: ¢
|
|||
|
|
—: ¢
|
|||
|
|
º: Ú ª
|
|||
|
|
¥ ª
|
|||
|
|
¤ ª
|
|||
|
|
’ ª
|
|||
|
|
‡ ª
|
|||
|
|
ž ª
|
|||
|
|
¯< ª
|
|||
|
|
Ü ª
|
|||
|
|
|
|||
|
|
differenceÁ ²
|
|||
|
|
à ª
|
|||
|
|
symmetric_differenceÁ ´
|
|||
|
|
à ª
|
|||
|
|
intersectionÁ ¶
|
|||
|
|
à ª
|
|||
|
|
C ¸
|
|||
|
|
à ª
|
|||
|
|
containsÁ º
|
|||
|
|
¢ ª
|
|||
|
|
µ ¼
|
|||
|
|
¢ ª
|
|||
|
|
|
|||
|
|
get_or_insertÁ ª
|
|||
|
|
get_or_insert_withÁ ¿
|
|||
|
|
¢ ¿
|
|||
|
|
— ª
|
|||
|
|
Ì< ª
|
|||
|
|
is_disjointÁ ª
|
|||
|
|
is_subsetÁ Ä
|
|||
|
|
ª
|
|||
|
|
is_supersetÁ ª
|
|||
|
|
ü ª
|
|||
|
|
çA ª
|
|||
|
|
replaceÁ ª
|
|||
|
|
õ Ê
|
|||
|
|
¢ ª
|
|||
|
|
takeÁ Ì
|
|||
|
|
¢ ª
|
|||
|
|
š Ú Ï
|
|||
|
|
¥ Ï
|
|||
|
|
¤ Ï
|
|||
|
|
’ Ï
|
|||
|
|
� Ó
|
|||
|
|
Ú Õ
|
|||
|
|
¥ Õ
|
|||
|
|
¤ Õ
|
|||
|
|
’ Ú Ù
|
|||
|
|
¥ Ù
|
|||
|
|
¤ Ù
|
|||
|
|
’ Ù
|
|||
|
|
× Ú
|
|||
|
|
Þ
|
|||
|
|
¥ Þ
|
|||
|
|
¤ Þ
|
|||
|
|
’ Þ
|
|||
|
|
÷ Ú ã
|
|||
|
|
¥ ã
|
|||
|
|
¤ ã
|
|||
|
|
’ ã
|
|||
|
|
ù ç
|
|||
|
|
š Ú é
|
|||
|
|
¥ é
|
|||
|
|
’ é
|
|||
|
|
Ÿ é
|
|||
|
|
é
|
|||
|
|
÷ î
|
|||
|
|
Ú
|
|||
|
|
ð
|
|||
|
|
¥ ð
|
|||
|
|
¤ ð
|
|||
|
|
’ ð
|
|||
|
|
éi ô
|
|||
|
|
š ô
|
|||
|
|
Ú ÷
|
|||
|
|
à ÷
|
|||
|
|
¥ ÷
|
|||
|
|
¤ ÷
|
|||
|
|
’ ÷
|
|||
|
|
éi ü
|
|||
|
|
š Ú þ
|
|||
|
|
¥ þ
|
|||
|
|
¤ þ
|
|||
|
|
’ þ
|
|||
|
|
> Ú ƒ¥ ƒ¤ ƒ’ ƒ° ƒ± Ú ‰¥ ‰¤ ‰’ ‰° ‰¯ Ú �¥ �¤ �’ �° �µ Ú •¥ •¤ •’ •° •Ú Ú ›¥ ›¤ ›’ ›² Ú ¥ ¤ ’ ° ¤ Ú ¦¥ ¦¤ ¦’ ¦¶ Ú «¥ «¤ «’ «Û ¯ Ú éD ±Ã ±œ ±ù Ú Ò
|
|||
|
|
µœ µ’ µù Ú ‹M ¹Ã ¹œ ¹’ ¹ù Ú åM ¾Ã ¾œ ¾— ¾’ ¾± ¾Ô Ú IntersectionÁ Åà ť Ť Å’ Åù Ź
|
|||
|
|
Ú
|
|||
|
|
DifferenceÁ Ìà ̥ ̤ Ì’ Ìù ̹
|
|||
|
|
Ú SymmetricDifferenceÁ Óà ӥ Ó¤ Ó’ Óù Ú ô Ùà ٥ Ù¤ Ù’ Ùù Ú ßà ߥ ߤ ß’ ß› ßÒ
|
|||
|
|
ßê Ú ç¥ ç¤ ç’ ç› çÒ
|
|||
|
|
çê Ú îœ îƒ Ú ñœ ñ> Ú ôà ôœ ô› ôó ô´+ ôÛ, ú“ ú— Ú ýœ ý‘ Ú €œ Ú ‚œ ‚× Ú …œ …’ …> Ú !‰œ ‰’ ‰› ‰ó ‰´+ ‰Û, �“ �— � Ú "“œ “’ “‘ Ú #—œ —’ Ú $šœ š’ š× � Ú %Ÿœ Ÿ’ Ÿ› Ÿó Ÿ´+ ŸÛ, ¥“ ¥— ¥ Ú &©œ ©’ ©‘ Ú 'œ ’ Ú (°œ °’ °× ³ Ú )µœ µ— µ’ µ› µó º º µ´+ Ú *¾œ ¾— ¾’ Ú +Â¥ ¤ Â’ ƒ Ú ,Çà ǥ Ǥ Ç’ Ç› Çó Ç´+ ÇÛ, Ï“ Ï— Ï Ú -Ó¥ Ó¤ Ó’ Ó× Ú .Ø¥ ؤ Ø’ Ú /Ü¥ ܤ Ü’ ܃ Ú 0áà ᥠᤠᒠᛠáó á´+ áÛ, é“ é— é Ú 1í¥ í¤ í’ Ú 2ñ¥ ñ¤ ñ’ ñ× Ú 3ö¥ ö¤ ö’ öƒ Ú 4ûà û¥ û¤ û’ û› ûó û´+ ûÛ, ƒ“ ƒ— Ú 5†¥ †¤ †’ Ú 6Š¥ Š¤ Š’ Š× Ú 7�¥ �¤ �’ �ƒ Ú 8”¥ ”¤ ”’ Ú 9˜¥ ˜¤ ˜’ ˜× Ú :�à �¥ �¤ �’ �› �ó �´+ �Û, ¥“ ¥— Ú ¾O ¨Ã ¨¥ ¨¤ ¨’ ¨óO
|
|||
|
|
ˆ ¨�P °
|
|||
|
|
°ˆ Ú ;³¥ ³¤ ³’ ³× Ú ØP ¸Ã ¸¥ ¸¤ ¸’ ¸Ô Ú <¾¥ ¾¤ ¾’ ¾× Ú ¨R Ãà å ä Ã’ ÃÔ Ú =É¥ ɤ É’ É× Ú >Îà Υ Τ Î’ Îü Îûb ε Ú ?Ö¥ Ö¤ Ö’ Öµ Öõ Ú @Üà ܥ ܤ Ü’ ܵ Ü
|
|||
|
|
into_valueÁ Üü Ú ˆk äþ| å°k äù çà ç°k äê ê°k ê’ äÌ� íà í°k í’ äæ� ñà ñ°k ñ’ 䊂 õà õ°k õ’ äC ùà ù°k ù’ ä¢ ý°k ý’ ‚ € €€€€€€€€€ €
|
|||
|
|
€ € €
|
|||
|
|
€€€€ HashTableÁ ’¥ ’’ ’@ € –¥ –æ –† €š¥ š’ šÃ šê š¨ šœ — š find_mutÁ ¢— š
|
|||
|
|
find_entryÁ ¤— šÌ< ¦— ¦í š
|
|||
|
|
insert_uniqueÁ ©í šÊ š¯< ¬í šÜ ®í š‡ °í šž ²í š¼ š‘ šÔ šù šú š‘ š
|
|||
|
|
iter_hash_mutÁ šž; » impl FnMut(&mut T) -> boolÁ š¢ š´; ¾— šß ÀŸ À À€ À š´ ÅŸ Šŀ Å šš €Ë¥ Ë’ Ë› ËÒ
|
|||
|
|
Ëê €Ñà ѥ Ñ’ Ñ› ÑÒ
|
|||
|
|
Ñê €Øà إ Ø’ Ø› ØÒ
|
|||
|
|
Øê €ß¥ ß’ ß> €ã¥ 㒠ム€ç¥ ç’ ç× €¾O ëÃ ë¥ ë’ ëóO ï
|
|||
|
|
ïˆ ë�P ò
|
|||
|
|
òˆ €õ¥ õ’ õ× € ùà ù¥ ù’ ùü ùûb ù£c ÿ impl FnOnce() -> TÁ ùëc � impl FnOnce(&mut T)Á €ØP ƒÃ ƒ¥ ƒ’ ƒ§ ƒÅ ƒ‚ €
|
|||
|
|
Š¥ Š’ € �¥ �’ € �¥ �’ �× €
|
|||
|
|
”à ”¥ ”’ ”õ ”µ ”È ”·e ”
|
|||
|
|
into_tableÁ €¨R �à �¥ �’ �§ � insert_slotÁ �‚ €¤¥ ¤’ ¤× €¨Ã ¨¥ ¨’ ¨ü ¨é§ € AbsentEntryÁ ®Ã ®¥ ®’ ®‚ €³¥ ³’ ³× €·Ã ·¥ ·’ ·é§ €éD ¼Ã ¼¥ ¼Ô ¼Ú €Á¥ Á> €Äà ĥ Ä› Äó Ä´+ ÄÛ, Ê“ Ê— Ê €Î¥ Α €Ñ¥ €Óà ӥ Óƒ €×¥ ×× €×E Úà ڥ ÚÔ ÚÚ €ß¥ ß> €âà ⥠⛠âó â´+ âÛ, è“ è— è €ì¥ ì‘ €ï¥ € ñ¥ ñ× € IterHashÁ ôà ô¥ ôÔ ôÚ € ù¥ ù> € üà ü¥ ü› üó üÛ, �“ �— � € …¥ € ‡Ã ‡¥ ‡ƒ €!‹¥ ‹× € IterHashMutÁ ŽÃ Ž¥ ŽÔ ŽÚ €"“¥ “> €#–à –¥ –› –ó –Û, ›“ ›— › €$Ÿ¥ €%¡¥ ¡× €Ò
|
|||
|
|
¤¥ ¤’ ¤Ô €&¨¥ ¨’ ¨> €'¬¥ ¬’ ¬› ¬ó ¬´+ ¬Û, ²“ ²— €(µ¥ µ’ µ‘ €)¹¥ ¹’ €*¼¥ ¼’ ¼× €‹M Àà À¥ À’ ÀÔ €+Å¥ Å’ Å› Åó Å´+ ÅÛ, Ë“ Ë— €,Î¥ Î’ Α €-Ò¥ Ò’ €.Õ¥ Õ’ Õ× €åM Ùà ٥ Ù— Ù’ Ù± ÙÔ €/à¥ à— à’ à› àó å à´+ €0è¥ è— è’ hash_mapÁ ì hash_setÁ î
|
|||
|
|
hash_tableÁ ð BitMaskÁ ö
|
|||
|
|
öˆ ûƒ BitMaskIterÁ ý
|
|||
|
|
ýˆ €ƒ à ‚ ‚‚‚‚‚‚ BitMaskWordÁ ‚ NonZeroBitMaskWordÁ ‚ BITMASK_STRIDEÁ ‚ BITMASK_MASKÁ ‚ BITMASK_ITER_MASKÁ ‚ Ž WIDTHÁ Ž static_emptyÁ � � AlignedTagsÁ ’ _alignÁ “ ’ tagsÁ • � ALIGNED_TAGSÁ — Ž¬ Ž load_alignedÁ Ž
|
|||
|
|
store_alignedÁ Ž match_tagÁ Ž match_emptyÁ Ž match_empty_or_deletedÁ Ž
|
|||
|
|
match_fullÁ Ž ,convert_special_to_empty_and_full_to_deletedÁ ‚ GroupÁ ¢
|
|||
|
|
¢ˆ ‚‚‚§ƒ ' TagÁ ©
|
|||
|
|
©ˆ '''®ƒ ''±� '³Ö A FallibilityÁ µ FallibleÁ ¶
|
|||
|
|
µ
|
|||
|
|
InfallibleÁ ¸
|
|||
|
|
A9A:A;¼ƒ A ProbeSeqÁ ¾ posÁ ¾ strideÁ A<Áƒ A TableLayoutÁ Ù Ã
|
|||
|
|
ctrl_alignÁ A=A>A?ȃ Åô' A RawIterHashInnerÁ ˳ ËÆ Ë tag_hashÁ ËÊ# Ëú
|
|||
|
|
Ë‹ A@Òƒ TryReserveErrorÁ Ô CapacityOverflowÁ Õ
|
|||
|
|
Ô¹ × layoutÁ Ùƒ Ü� ÞÖ à×
|
|||
|
|
4
|
|||
|
|
4
|
|||
|
|
4
|
|||
|
|
6
|
|||
|
|
7
|
|||
|
|
9
|
|||
|
|
f
|
|||
|
|
x
|
|||
|
|
ˆ
|
|||
|
|
Œ
|
|||
|
|
�
|
|||
|
|
Ž
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
‘
|
|||
|
|
’
|
|||
|
|
“
|
|||
|
|
•
|
|||
|
|
|
|||
|
|
®
|
|||
|
|
¯
|
|||
|
|
°
|
|||
|
|
°
|
|||
|
|
±
|
|||
|
|
²
|
|||
|
|
²
|
|||
|
|
³
|
|||
|
|
´
|
|||
|
|
µ
|
|||
|
|
µ
|
|||
|
|
·
|
|||
|
|
¸
|
|||
|
|
º
|
|||
|
|
º
|
|||
|
|
¼
|
|||
|
|
¼
|
|||
|
|
¾
|
|||
|
|
¾
|
|||
|
|
À
|
|||
|
|
À
|
|||
|
|
Ä
|
|||
|
|
Ä
|
|||
|
|
Ç
|
|||
|
|
Ç
|
|||
|
|
É
|
|||
|
|
É
|
|||
|
|
Ë
|
|||
|
|
Í
|
|||
|
|
Í
|
|||
|
|
Í
|
|||
|
|
Ñ
|
|||
|
|
Ò
|
|||
|
|
Ò
|
|||
|
|
Õ
|
|||
|
|
Õ
|
|||
|
|
×
|
|||
|
|
×
|
|||
|
|
Ù
|
|||
|
|
Ù
|
|||
|
|
à
|
|||
|
|
à
|
|||
|
|
ç
|
|||
|
|
ç
|
|||
|
|
ï
|
|||
|
|
ð
|
|||
|
|
ñ
|
|||
|
|
ò
|
|||
|
|
ó
|
|||
|
|
ô
|
|||
|
|
õ
|
|||
|
|
ö
|
|||
|
|
÷
|
|||
|
|
„
|
|||
|
|
†
|
|||
|
|
‰
|
|||
|
|
‹
|
|||
|
|
Œ
|
|||
|
|
Œ
|
|||
|
|
Œ
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
Ž
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
‘
|
|||
|
|
’
|
|||
|
|
”
|
|||
|
|
–
|
|||
|
|
–
|
|||
|
|
™
|
|||
|
|
›
|
|||
|
|
œ
|
|||
|
|
ž
|
|||
|
|
Ÿ
|
|||
|
|
|
|||
|
|
¢
|
|||
|
|
£
|
|||
|
|
¤
|
|||
|
|
¥
|
|||
|
|
¦
|
|||
|
|
§
|
|||
|
|
¨
|
|||
|
|
©
|
|||
|
|
ª
|
|||
|
|
«
|
|||
|
|
«
|
|||
|
|
°
|
|||
|
|
°
|
|||
|
|
°
|
|||
|
|
°
|
|||
|
|
²
|
|||
|
|
³
|
|||
|
|
³
|
|||
|
|
³
|
|||
|
|
³
|
|||
|
|
µ
|
|||
|
|
µ
|
|||
|
|
µ
|
|||
|
|
·
|
|||
|
|
·
|
|||
|
|
¹
|
|||
|
|
º
|
|||
|
|
»
|
|||
|
|
¼
|
|||
|
|
À
|
|||
|
|
Á
|
|||
|
|
Á
|
|||
|
|
Ä
|
|||
|
|
Ä
|
|||
|
|
Ë
|
|||
|
|
Ë
|
|||
|
|
Ô
|
|||
|
|
ä
|
|||
|
|
ï
|
|||
|
|
ó
|
|||
|
|
õ
|
|||
|
|
þ
|
|||
|
|
�
|
|||
|
|
ˆ
|
|||
|
|
Š
|
|||
|
|
˜
|
|||
|
|
›
|
|||
|
|
œ
|
|||
|
|
¨
|
|||
|
|
²
|
|||
|
|
»
|
|||
|
|
¼
|
|||
|
|
Ë
|
|||
|
|
Î
|
|||
|
|
Ï
|
|||
|
|
Ò
|
|||
|
|
Õ
|
|||
|
|
Ø
|
|||
|
|
Ù
|
|||
|
|
Ý
|
|||
|
|
Þ
|
|||
|
|
ß
|
|||
|
|
â
|
|||
|
|
ë
|
|||
|
|
ï
|
|||
|
|
ô
|
|||
|
|
ø
|
|||
|
|
û
|
|||
|
|
‚
|
|||
|
|
…
|
|||
|
|
…
|
|||
|
|
´
|
|||
|
|
µ
|
|||
|
|
µ
|
|||
|
|
¶
|
|||
|
|
¶
|
|||
|
|
¼
|
|||
|
|
¼
|
|||
|
|
Â
|
|||
|
|
Â
|
|||
|
|
Ç
|
|||
|
|
Ç
|
|||
|
|
á
|
|||
|
|
ä
|
|||
|
|
å
|
|||
|
|
æ
|
|||
|
|
ç
|
|||
|
|
è
|
|||
|
|
é
|
|||
|
|
ê
|
|||
|
|
ë
|
|||
|
|
ì
|
|||
|
|
í
|
|||
|
|
î
|
|||
|
|
î
|
|||
|
|
î
|
|||
|
|
ð
|
|||
|
|
ð
|
|||
|
|
ð
|
|||
|
|
ò
|
|||
|
|
ú
|
|||
|
|
û
|
|||
|
|
ü
|
|||
|
|
ý
|
|||
|
|
þ
|
|||
|
|
ƒ
|
|||
|
|
ƒ
|
|||
|
|
…
|
|||
|
|
…
|
|||
|
|
‡
|
|||
|
|
‡
|
|||
|
|
‰
|
|||
|
|
‰
|
|||
|
|
‹
|
|||
|
|
‹
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
‘
|
|||
|
|
‘
|
|||
|
|
˜
|
|||
|
|
˜
|
|||
|
|
Ÿ
|
|||
|
|
Ÿ
|
|||
|
|
¦
|
|||
|
|
¦
|
|||
|
|
|
|||
|
|
|
|||
|
|
³
|
|||
|
|
³
|
|||
|
|
¹
|
|||
|
|
¹
|
|||
|
|
¿
|
|||
|
|
À
|
|||
|
|
À
|
|||
|
|
Â
|
|||
|
|
Ã
|
|||
|
|
Ä
|
|||
|
|
Ä
|
|||
|
|
Æ
|
|||
|
|
Æ
|
|||
|
|
È
|
|||
|
|
Î
|
|||
|
|
Î
|
|||
|
|
Û
|
|||
|
|
Û
|
|||
|
|
Û
|
|||
|
|
â
|
|||
|
|
é
|
|||
|
|
é
|
|||
|
|
ø
|
|||
|
|
û
|
|||
|
|
ü
|
|||
|
|
ÿ
|
|||
|
|
ÿ
|
|||
|
|
ÿ
|
|||
|
|
†
|
|||
|
|
‰
|
|||
|
|
Œ
|
|||
|
|
–
|
|||
|
|
¦
|
|||
|
|
¨
|
|||
|
|
±
|
|||
|
|
º
|
|||
|
|
º
|
|||
|
|
º
|
|||
|
|
Ë
|
|||
|
|
Í
|
|||
|
|
Ö
|
|||
|
|
ß
|
|||
|
|
ß
|
|||
|
|
ß
|
|||
|
|
æ
|
|||
|
|
é
|
|||
|
|
ê
|
|||
|
|
í
|
|||
|
|
í
|
|||
|
|
í
|
|||
|
|
ó
|
|||
|
|
ö
|
|||
|
|
÷
|
|||
|
|
ú
|
|||
|
|
ú
|
|||
|
|
ú
|
|||
|
|
�
|
|||
|
|
…
|
|||
|
|
Ž
|
|||
|
|
Ž
|
|||
|
|
Ž
|
|||
|
|
”
|
|||
|
|
–
|
|||
|
|
—
|
|||
|
|
—
|
|||
|
|
—
|
|||
|
|
¬
|
|||
|
|
±
|
|||
|
|
±
|
|||
|
|
±
|
|||
|
|
»
|
|||
|
|
À
|
|||
|
|
Å
|
|||
|
|
Ê
|
|||
|
|
Ê
|
|||
|
|
Ê
|
|||
|
|
Ô
|
|||
|
|
Ù
|
|||
|
|
Ù
|
|||
|
|
Ù
|
|||
|
|
è
|
|||
|
|
è
|
|||
|
|
î
|
|||
|
|
î
|
|||
|
|
î
|
|||
|
|
ú
|
|||
|
|
ú
|
|||
|
|
€
|
|||
|
|
€
|
|||
|
|
€
|
|||
|
|
‰
|
|||
|
|
Ž
|
|||
|
|
Ž
|
|||
|
|
Ž
|
|||
|
|
�
|
|||
|
|
”
|
|||
|
|
”
|
|||
|
|
”
|
|||
|
|
¯
|
|||
|
|
¸
|
|||
|
|
¹
|
|||
|
|
¾
|
|||
|
|
Á
|
|||
|
|
Â
|
|||
|
|
Å
|
|||
|
|
Î
|
|||
|
|
Ï
|
|||
|
|
Ô
|
|||
|
|
×
|
|||
|
|
Ø
|
|||
|
|
Û
|
|||
|
|
Þ
|
|||
|
|
Þ
|
|||
|
|
Þ
|
|||
|
|
é
|
|||
|
|
ê
|
|||
|
|
ò
|
|||
|
|
û
|
|||
|
|
û
|
|||
|
|
û
|
|||
|
|
ü
|
|||
|
|
…
|
|||
|
|
†
|
|||
|
|
‹
|
|||
|
|
Ž
|
|||
|
|
�
|
|||
|
|
’
|
|||
|
|
›
|
|||
|
|
œ
|
|||
|
|
¡
|
|||
|
|
¤
|
|||
|
|
¥
|
|||
|
|
¨
|
|||
|
|
±
|
|||
|
|
²
|
|||
|
|
·
|
|||
|
|
º
|
|||
|
|
»
|
|||
|
|
¾
|
|||
|
|
Á
|
|||
|
|
Á
|
|||
|
|
Á
|
|||
|
|
Ã
|
|||
|
|
È
|
|||
|
|
É
|
|||
|
|
Í
|
|||
|
|
Ñ
|
|||
|
|
Ò
|
|||
|
|
Ö
|
|||
|
|
Ú
|
|||
|
|
Ú
|
|||
|
|
Ú
|
|||
|
|
æ
|
|||
|
|
è
|
|||
|
|
é
|
|||
|
|
ë
|
|||
|
|
ú
|
|||
|
|
ü
|
|||
|
|
ý
|
|||
|
|
ÿ
|
|||
|
|
�
|
|||
|
|
|
|||
|
|
Š
|
|||
|
|
|
|||
|
|
š
|
|||
|
|
|
|||
|
|
œ
|
|||
|
|
|
|||
|
|
�
|
|||
|
|
|
|||
|
|
±
|
|||
|
|
|
|||
|
|
Á
|
|||
|
|
|
|||
|
|
Ê
|
|||
|
|
|
|||
|
|
Ó
|
|||
|
|
|
|||
|
|
Ž
|
|||
|
|
�
|
|||
|
|
¬
|
|||
|
|
±
|
|||
|
|
Ë
|
|||
|
|
Í
|
|||
|
|
â
|
|||
|
|
ä
|
|||
|
|
æ
|
|||
|
|
é
|
|||
|
|
õ
|
|||
|
|
õ
|
|||
|
|
÷
|
|||
|
|
ÿ
|
|||
|
|
€
|
|||
|
|
‚
|
|||
|
|
„
|
|||
|
|
…
|
|||
|
|
†
|
|||
|
|
ˆ
|
|||
|
|
‰
|
|||
|
|
Œ
|
|||
|
|
˜
|
|||
|
|
œ
|
|||
|
|
¡
|
|||
|
|
¡
|
|||
|
|
¡
|
|||
|
|
¢
|
|||
|
|
§
|
|||
|
|
§
|
|||
|
|
§
|
|||
|
|
¨
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
®
|
|||
|
|
³
|
|||
|
|
³
|
|||
|
|
³
|
|||
|
|
´
|
|||
|
|
¹
|
|||
|
|
¹
|
|||
|
|
¹
|
|||
|
|
Á
|
|||
|
|
Æ
|
|||
|
|
É
|
|||
|
|
Í
|
|||
|
|
Ñ
|
|||
|
|
Ò
|
|||
|
|
Õ
|
|||
|
|
Ö
|
|||
|
|
Ù
|
|||
|
|
ƒ
|
|||
|
|
|
|||
|
|
„
|
|||
|
|
|
|||
|
|
„
|
|||
|
|
|
|||
|
|
’
|
|||
|
|
|
|||
|
|
“
|
|||
|
|
|
|||
|
|
”
|
|||
|
|
|
|||
|
|
•
|
|||
|
|
|
|||
|
|
–
|
|||
|
|
|
|||
|
|
—
|
|||
|
|
|
|||
|
|
—
|
|||
|
|
|
|||
|
|
š
|
|||
|
|
|
|||
|
|
š
|
|||
|
|
|
|||
|
|
œ
|
|||
|
|
|
|||
|
|
¦
|
|||
|
|
|
|||
|
|
©
|
|||
|
|
|
|||
|
|
®
|
|||
|
|
|
|||
|
|
¯
|
|||
|
|
|
|||
|
|
°
|
|||
|
|
|
|||
|
|
±
|
|||
|
|
|
|||
|
|
º
|
|||
|
|
|
|||
|
|
º
|
|||
|
|
|
|||
|
|
¼
|
|||
|
|
|
|||
|
|
¼
|
|||
|
|
|
|||
|
|
¾
|
|||
|
|
|
|||
|
|
¿
|
|||
|
|
|
|||
|
|
¿
|
|||
|
|
|
|||
|
|
¿
|
|||
|
|
|
|||
|
|
Â
|
|||
|
|
|
|||
|
|
Ã
|
|||
|
|
|
|||
|
|
Ã
|
|||
|
|
|
|||
|
|
Ä
|
|||
|
|
|
|||
|
|
Ä
|
|||
|
|
|
|||
|
|
Æ
|
|||
|
|
|
|||
|
|
Æ
|
|||
|
|
|
|||
|
|
Ç
|
|||
|
|
|
|||
|
|
È
|
|||
|
|
|
|||
|
|
É
|
|||
|
|
|
|||
|
|
Ê
|
|||
|
|
|
|||
|
|
Ê
|
|||
|
|
|
|||
|
|
Ì
|
|||
|
|
|
|||
|
|
Ì
|
|||
|
|
|
|||
|
|
Î
|
|||
|
|
|
|||
|
|
Ó
|
|||
|
|
|
|||
|
|
Ó
|
|||
|
|
|
|||
|
|
Ý
|
|||
|
|
|
|||
|
|
Ý
|
|||
|
|
|
|||
|
|
Ý
|
|||
|
|
|
|||
|
|
ô
|
|||
|
|
|
|||
|
|
ü
|
|||
|
|
|
|||
|
|
ƒ
|
|||
|
|
ƒ
|
|||
|
|
ˆ
|
|||
|
|
‰
|
|||
|
|
‰
|
|||
|
|
Ž
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
”
|
|||
|
|
•
|
|||
|
|
•
|
|||
|
|
š
|
|||
|
|
›
|
|||
|
|
Ÿ
|
|||
|
|
Ÿ
|
|||
|
|
|
|||
|
|
¤
|
|||
|
|
¤
|
|||
|
|
¦
|
|||
|
|
ª
|
|||
|
|
ª
|
|||
|
|
«
|
|||
|
|
¯
|
|||
|
|
¯
|
|||
|
|
î
|
|||
|
|
ð
|
|||
|
|
ñ
|
|||
|
|
ø
|
|||
|
|
ù
|
|||
|
|
ý
|
|||
|
|
ÿ
|
|||
|
|
€
|
|||
|
|
‚
|
|||
|
|
„
|
|||
|
|
„
|
|||
|
|
„
|
|||
|
|
�
|
|||
|
|
Ž
|
|||
|
|
–
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
Ÿ
|
|||
|
|
£
|
|||
|
|
¤
|
|||
|
|
©
|
|||
|
|
¬
|
|||
|
|
|
|||
|
|
°
|
|||
|
|
³
|
|||
|
|
³
|
|||
|
|
³
|
|||
|
|
µ
|
|||
|
|
µ
|
|||
|
|
º
|
|||
|
|
½
|
|||
|
|
¾
|
|||
|
|
¾
|
|||
|
|
Â
|
|||
|
|
Æ
|
|||
|
|
Í
|
|||
|
|
Î
|
|||
|
|
Ó
|
|||
|
|
×
|
|||
|
|
×
|
|||
|
|
×
|
|||
|
|
Ø
|
|||
|
|
Ü
|
|||
|
|
à
|
|||
|
|
ç
|
|||
|
|
è
|
|||
|
|
í
|
|||
|
|
ñ
|
|||
|
|
õ
|
|||
|
|
õ
|
|||
|
|
õ
|
|||
|
|
ö
|
|||
|
|
ú
|
|||
|
|
�
|
|||
|
|
‚
|
|||
|
|
†
|
|||
|
|
Š
|
|||
|
|
Ž
|
|||
|
|
Ž
|
|||
|
|
Ž
|
|||
|
|
�
|
|||
|
|
“
|
|||
|
|
”
|
|||
|
|
˜
|
|||
|
|
œ
|
|||
|
|
œ
|
|||
|
|
œ
|
|||
|
|
£
|
|||
|
|
¤
|
|||
|
|
³
|
|||
|
|
·
|
|||
|
|
·
|
|||
|
|
·
|
|||
|
|
¾
|
|||
|
|
Â
|
|||
|
|
Â
|
|||
|
|
Â
|
|||
|
|
É
|
|||
|
|
Í
|
|||
|
|
Í
|
|||
|
|
Í
|
|||
|
|
Õ
|
|||
|
|
Ö
|
|||
|
|
Ú
|
|||
|
|
á
|
|||
|
|
Ÿ
|
|||
|
|
|
|||
|
|
|
|||
|
|
¢
|
|||
|
|
¢
|
|||
|
|
¤
|
|||
|
|
¤
|
|||
|
|
¦
|
|||
|
|
¦
|
|||
|
|
¦
|
|||
|
|
©
|
|||
|
|
©
|
|||
|
|
«
|
|||
|
|
¬
|
|||
|
|
¬
|
|||
|
|
®
|
|||
|
|
®
|
|||
|
|
°
|
|||
|
|
°
|
|||
|
|
²
|
|||
|
|
²
|
|||
|
|
´
|
|||
|
|
µ
|
|||
|
|
¶
|
|||
|
|
·
|
|||
|
|
¸
|
|||
|
|
¹
|
|||
|
|
º
|
|||
|
|
»
|
|||
|
|
»
|
|||
|
|
½
|
|||
|
|
¾
|
|||
|
|
¾
|
|||
|
|
À
|
|||
|
|
À
|
|||
|
|
Å
|
|||
|
|
Å
|
|||
|
|
Ê
|
|||
|
|
æ
|
|||
|
|
ê
|
|||
|
|
ê
|
|||
|
|
ê
|
|||
|
|
õ
|
|||
|
|
ø
|
|||
|
|
ø
|
|||
|
|
ø
|
|||
|
|
�
|
|||
|
|
Š
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
“
|
|||
|
|
“
|
|||
|
|
“
|
|||
|
|
™
|
|||
|
|
š
|
|||
|
|
¤
|
|||
|
|
§
|
|||
|
|
§
|
|||
|
|
§
|
|||
|
|
³
|
|||
|
|
¶
|
|||
|
|
¶
|
|||
|
|
¶
|
|||
|
|
Á
|
|||
|
|
È
|
|||
|
|
É
|
|||
|
|
Î
|
|||
|
|
Ð
|
|||
|
|
Ñ
|
|||
|
|
Ö
|
|||
|
|
×
|
|||
|
|
Ù
|
|||
|
|
Ù
|
|||
|
|
Ù
|
|||
|
|
ß
|
|||
|
|
æ
|
|||
|
|
ç
|
|||
|
|
ì
|
|||
|
|
î
|
|||
|
|
ï
|
|||
|
|
ñ
|
|||
|
|
ó
|
|||
|
|
ó
|
|||
|
|
ó
|
|||
|
|
ù
|
|||
|
|
€
|
|||
|
|
…
|
|||
|
|
Š
|
|||
|
|
‹
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
“
|
|||
|
|
š
|
|||
|
|
Ÿ
|
|||
|
|
¡
|
|||
|
|
£
|
|||
|
|
£
|
|||
|
|
£
|
|||
|
|
°
|
|||
|
|
±
|
|||
|
|
¸
|
|||
|
|
¿
|
|||
|
|
¿
|
|||
|
|
¿
|
|||
|
|
Å
|
|||
|
|
É
|
|||
|
|
Ê
|
|||
|
|
Î
|
|||
|
|
Ñ
|
|||
|
|
Ò
|
|||
|
|
Õ
|
|||
|
|
Ø
|
|||
|
|
Ø
|
|||
|
|
Ø
|
|||
|
|
à
|
|||
|
|
à
|
|||
|
|
å
|
|||
|
|
ç
|
|||
|
|
è
|
|||
|
|
è
|
|||
|
|
ü
|
|||
|
|
�
|
|||
|
|
œ ž Ÿ ¨
|
|||
|
|
¯
|
|||
|
|
²
|
|||
|
|
²
|
|||
|
|
´
|
|||
|
|
½
|
|||
|
|
Â
|
|||
|
|
É
|
|||
|
|
Ê
|
|||
|
|
Ê
|
|||
|
|
Ó
|
|||
|
|
Ú
|
|||
|
|
Ý
|
|||
|
|
Ý
|
|||
|
|
ß
|
|||
|
|
á
|
|||
|
|
á
|
|||
|
|
á
|
|||
|
|
º8 À8 Å8 ®Ã 5qÊ ö ö ÷î´ øˆ Û§áz®R ÛòÛ ØòÛ ÇLòÛ Ø ý ý þ�µ ÿˆ g+Â) èâX ùMÌÜ Š ¢ ¢ £–¹ ¤ˆ ‚ >‹%Y�c… Û�Ý Ø�Ý Š © © ªÆ¹ «ˆ ‡²hŠÄJ6l ÛàÝ ØàÝ ÐìàÝ µßàÝàÝ ™àÝ ¿càÝ 5
|
|||
|
|
àÝ Š µ ¶ · º ¸ ¹µº -?Á>:? ÛìÞ ØìÞ q ¥ Ø ¾ ¾ ߺ ¿ïº A Àúº A ²äþMGÛ Š à à “» Ä™ A Å®» A Z9Liú á Û�à Ø�à Ìì � � õ ƒµ A jùÜfB‚‹¨Àß Øçà Ìì — — â š‚ A ›¤ A œÚ A i†bªñüzÀß’ � «á Ø«á Ã«á ³ «á Œ"«á ÇL«á Ìì Û Û ±) ÝÍ) A Þâ) A ßî) A àþ A öyç¸QWY�Àß � Ââ ØÂâ ùMÂâ òPÂâ Ø ø ø Ð+ úù ûå A é9qeZï hÀß ³ Çã ùMÇã ÃMÇã òPÇã ùM ’ ’ Ž- “Í) A ”°- A •Æ A –å A ¢e ¶ÜìãA ÃM¶ä òP¶ä Ìì Ÿ Ÿ ˆ. ¢ù A £³. A ¤Ú A Ñ\ÈÝß^qÀßòá � ¢å Œ"¢å ³ ¢å ùM¢å ÃM¢å òP¢å Ìì à à ›0 Çù A È‚ A ÉÓ0 A ÊÚ A âPº� A… 8¥’ � ·æ Œ"·æ ùM·æ ÃM·æ òP·æ Ø Ë Ë Û» ̳ A ÍÆ A ΃¼ A ÏÊ# A Ðú
|
|||
|
|
A Ñ‹ A vÐ2HîÄ— Ø å å 2 çÔ A èÃ2 A “¦h§b¢
|
|||
|
|
žÀß ³ Áè ùMÁè ùMÔç Ø ¨ ¨ � µ6 ®‚ Õ:Ç$Ö> E œ§¤’ µß¥é¥é ™¥é ¿c¥é ³ ¥é Ù¢ ¨ ¨ � µ6 ®‚ Õ:Ç$Ö> Eœ§¤’ 8¢ é ¨ ¨ � µ6 ®‚ Õ:Ç$Ö> EÝéãé�� RandomStateÁ ž per_hasher_seedÁ Ÿ global_seedÁ Yhª»˜ d �çÝéãé Ÿ Ø ò ò éD öÔ Ž ÷Ú Ž 5G®Ï&€u 8æê§ ¿cÈì Ìì € € ×E „Ô Ž …Ú Ž P…sôhæþë 8æê‹í ³ — — �G ›Ô Ž £r7?&¿ãÀÝéãé�ç ùMòí ÃMòí òPòí ¿còí ³ ¼ ¼ ¤I ÀÔ Ž ‰eR‰sN¯oÝéãé�ç ùMßî ÃMßî òPßî ¿cßî Ø á á ½K åÔ Ž íýW*¸¡ÀÑ 8æê‹í ¿cÌï Ø î î £L òÔ Ž h ±ULö� 8æê‹í ¿c™ð ùM † † åM Œ± Ž �Ô Ž —!]±OÁ 8æê‹í—’ òP † † åM Œ± Ž �Ô Ž —!]±OÁ 8æê‹íñÄÄÅ GlobalÁ £‰]ÆÔ˜~ ¿c ¦ §óO ¨ˆ © ª�P «ˆ Û-k<׌E 8æê‹í¤³ñ Ìì ² ² ØP ¸§ Ž ¹�Q Ž º‚ Ž ¥±£PUPÄã 8æê‹í“ó³ñ � ¥ó ¿c¥ó ¿c Ë Ë ¨R ѧ Ž ÒëR Ž Ó‚ Ž Jò…ôËÙË 8æê‹í“ó³ñ ¿c Ú â ãóO äˆ å æ�P çˆ ì˜Ò—Y 8 8œ¢§¤’ ¿c ï ï ÒT ÷§ Ž øëR Ž ù‚ Ž -2RY±¾È 8 8Ñõ×õÝõãõéõ ¿c � � íU ‡Ì< ˆ» /ÁµŸ`š 8æê‹í“ó³ñ Äcáö ÇL à ¨ ¨ � µ6 ®‚ Õ:Ç$Ö> Eæê‹í“ó³ñ ÇL ÃÂ÷ ÇL¥é ³ Èì ùM ò ò éD öÔ Ž ÷Ú Ž 5G®Ï&€u Ãæê‹í ÃMÈì òPÈì ³ ¤í ùM € € ×E „Ô Ž …Ú Ž P…sôhæþë Ãæê‹í ÃM¤í òP¤í ¿c¤í ³ � � Ò
|
|||
|
|
‘Ô Ž õsY4è±ôÝéãé�ç ùMšú ÃMšú òPšú ¿cšú ³ Ìï ùM á á ½K åÔ Ž íýW*¸¡ÀÑ Ãæê‹í ÃMÌï òPÌï ³ ™ð ùM î î £L òÔ Ž h ±ULö� Ãæê‹í ÃM™ð òP™ð ³ › › �O ŸÔ Ž ½�F<ˆÑ Ò 8æê‹í ùM › › �O ŸÔ Ž ½�F<ˆÑ Ò Ãæê‹í ÃMÏü òPÏü ¿cÏü ùM û û ‹M €Ô Ž á6´ïÖ6 8æê‹íïé ÃMõý òPõý ¿cõý ÃL¥é³ì ÐL¥é³ì ÐLÂ÷ Ãæê Ëí ÐLÂ÷ Ãæê‹í Ìì £ £ Ñp © �Q õ
|
|||
|
|
ª ‚ õ
|
|||
|
|
« µ6 õ
|
|||
|
|
©B·á}ÂÞø 8æê‹í“ó³ñ � ¸ÿ ¿c � � ¢o – Ø õ
|
|||
|
|
Ì@™âP<Ý 8æê‹í“ó³ñ ¿c — � ž óO Ÿ ˆ ¡ �P ¢ ˆ "ø0ôÂw‚ 8æê‹í“ó³ñ ¿c¸ÿ ¿c ¶ ¶ öq ¼ ‚ õ
|
|||
|
|
½ µ6 õ
|
|||
|
|
⊶^_X 8æê‹í“ó³ñ ¿c ¾ ¾ Çr Ä Ø õ
|
|||
|
|
%ø:Îi1œÉ 8æê‹í“ó³ñ é! Á Á ©{ Ä Ë{ º Å » º Ú›"!‚'`Àß— ö!þ‚ Œ"þ‚ Ø ú ú � þ Ø )æÜ$à׶Àߤ�ç µß߃߃ ™ßƒ ¿c߃ é ߃ ¨ ¨ � µ6 ®‚ Õ:Ç$Ö> EÀß �„�ç ÃL߃Àß é ú ú � þ Ø )æÜ$à׶ÀßÑëòáÀß Ÿ ÐL߃Àß ÐL ú ú � þ Ø )æÜ$à׶Šçééïé ÃŠç ³ ߃ –ú 8 ú ú � þ Ø )æÜ$à׶¥“ó³ñ 8݆ öø؆™‡ ¶û؆™‡ �ï؆™‡ •˜�† 8�† Þ—�†ß‡ ̘�†ß‡ œö�†ß‡ ÇL Ã�† ÇL߃ Ø ± ± éD ´ù Ú D`¢ØïÄ0 8æê ³ ½ˆ ùM ± ± éD ´ù Ú D`¢ØïÄ0 Ãæê ÃM½ˆ òP½ˆ ¿c½ˆ ³ µ µ Ò
|
|||
|
|
¸ù Ú ñfnb…ÊÎÝéòá ùMæ‰ ÃMæ‰ òPæ‰ ¿cæ‰ ùM ¹ ¹ ‹M ½ù Ú øúU¾½³ð´ 8æê�ç ÃMÏŠ òPÏŠ ¿cÏŠ ùM ¾ ¾ åM ñ Ú ÄÔ Ú ™ÄÂ5JæG 8æê—ïé òP²‹ Ø Å Å •‹ Êù Ú Ë¹
|
|||
|
|
Ú _„$FËàä` 8Šçééïé ùM Å Å •‹ Êù Ú Ë¹
|
|||
|
|
Ú _„$FËàä` Êçééïé ¿c‘Œ òP‘Œ Ø Ì Ì Ù‹ Ñù Ú Ò¹
|
|||
|
|
Ú …Ø–†Ãñç 8Šçééïé ùM Ì Ì Ù‹ Ñù Ú Ò¹
|
|||
|
|
Ú …Ø–†Ãñç Êçééïé òPÎ� ¿cÎ� Ø Ó Ó ›Œ Øù Ú ßŸÖÚÈsž 8Šçééïé ùM Ó Ó ›Œ Øù Ú ßŸÖÚÈsž Êçééïé òP‹� ¿c‹� Ø Ù Ù ô Þù Ú ¥ �Æ 7ii 8Šçééïé òP°� ¿c°� ùM Ù Ù ô Þù Ú ¥ �Æ 7ii Êçééïé ¿c ¨ ®óO ¯ˆ ° ±�P ²ˆ h±¶)#‹j— 8Šçééïé ¿c ¸ ¸ ØP ½Ô Ú k]3BП B 8Šçééïé ¿c à à ¨R ÈÔ Ú F9 !›Ànt 8Šçééïé ÇL ’ ’ ãž •@ q)$Ø Í/€Àßòá ÇL à ’ ’ ãž •@ q)$Ø Í/€Šç�ç ÇL Ã�” ³ ¿“ Ø¿“ ¿c¿“ ¿c ë ï ðóO ñˆ ò ó�P ôˆ FÐWdÔæN 8Šç�ç Ìì ƒ ƒ ØP ‡§ € ˆÅ € ‰‚ € tÒæìše¾‚ 8Šç�ç � Ε ¿cΕ ¿c � � ¨R ¡§ € ¢£¨ € £‚ € €:X¦ßÎ 8Šç�ç ¿c ® ® ‰© ²‚ € ÖO?k`æ± 8Šç�ç ³ ¼ ¼ éD ¿Ô € ÀÚ € 5åTÉWªM° 8Šç ùM ¼ ¼ éD ¿Ô € ÀÚ € 5åTÉWªM° Êç ÃMÜ— òPÜ— ئ˜ ¿cÜ— ³ Ú Ú ×E ÝÔ € ÞÚ € ¼SvËcçM 8Šç ùM Ú Ú ×E ÝÔ € ÞÚ € ¼SvËcçM Êç ÃM�™ òP�™ ¿c�™ ³ ô ô – ÷Ô € øÚ € )¨°¨6%œ‡ 8Šç ùM ô ô – ÷Ô € øÚ € )¨°¨6%œ‡ Êç òPÓš Øž› ¿cÓš ³ Ž Ž Û® ‘Ô € ’Ú € /e‡§œ%0 8Šç ùM Ž Ž Û® ‘Ô € ’Ú € /e‡§œ%0 Êç òP‹œ ¿c‹œ ³ ¤ ¤ Ò
|
|||
|
|
§Ô € ÒÔŠ Ì‹¹Àßòá ùM¸� ÃM¸� òP¸� ¿c¸� ùM À À ‹M ÄÔ € ñ,y ä4Åç 8Šç�ç ÃM¡ž òP¡ž ¿c¡ž ùM Ù Ù åM Þ± € ßÔ € Çý!sº2Øq 8Šçõ‹ïé òP„Ÿ Ø Ô Õ Öͼ × ¹ Øò¼ xéƒi«Õ Ðì០µßáŸáŸ ™áŸ ¿c០ù ö¥ ¢¬ ©º µÆ Ãú ö¦ ¢ ©» µÇ Ãû ö€ ý§ ¢® ©¼ µÁ ¾È Æ �½ —í Ûÿ øÒ Ëí å¯ ¨ø òæ áó îÿ ú î ±Â ÅÜ Ìö Ó� Ùã ’Ó ¼‡ ôÙ Ô öÕ —•
|
|||
|
|
ž
|
|||
|
|
§ ¨ß
|
|||
|
|
ç ú Ë ’Ñ
|
|||
|
|
Ø
|
|||
|
|
ýð Û… ø™ ’· ŸÙ Ãõ åù Ë¡ —Æ ¼Ž †³ òÉ €ä �€ á– î¬ ›Ã ûô ±‰ µŸ ¹µ ¾Ç Åá Ìû Ó� ÙÄ ¼â Úü ô– Ž¬ ¤Å Àà Ù° ©Û Ô± ©É ¨Ï
|
|||
|
|
ú Ü Ô³ ©Ñ ¨Õ
|
|||
|
|
ú Þ Ô3 ©Ö ¨ü ò¶ —Û ¼ê á÷ î¬ Å ²Ô Ëè Úú ï‰ �Û €÷ �¾ ›Ö ûœ � ¢ — ¨ £ ® ¶ ´ ¾ Ù
|
|||
|
|
ú ‚ ±š µ° ¹Ó Åñ ÌŠ Ó˜ Ù³ ¨¾ ¸É Ãç ’õ ë� ƒ¤ �³ ®× ¼ñ Ú‹ ô¡ Ž¼ ¤Õ Àà Ô8 t „ �ú —é Û© ŸÏ Æ €» ²¬ £ Š ƒý —ë Û¬ ŸÒ ÃÀ ²± £ � ƒÅ —Í —‚ ø³ Ÿð åÜ ¨œ —Á ¼¯ òÅ €ß �ü á’ î¨ ›þ
|
|||
|
|
ú ñ ±… µß ’Á ¼ß Úù ô“ Ž¨ ¤Ñ —¯ ŸÕ ÃÖ Á ö Û� øž ’À Ÿâ ò —× ¼— †Â òØ €ó �� á¥ î» ›Ò û€ ±— µ ¹¾ ¾Ø Åí ̆ Ó” ÙÑ ¼ï Ú… ôŸ Ž¹ ¤Ò Àè ÙŽ ø� ’½ Ÿß à —Ò ¼¾ òÔ €î �‹ á¡ î· ›Í ûý ±“ µ© ¹Î ¼ì Úµ ¤Î Àâ ¨ê ¨Þ
|
|||
|
|
ú é
|
|||
|
|
ú � �´
|
|||
|
|
¨ã
|
|||
|
|
ú ¼
|
|||
|
|
¨Ä
|
|||
|
|
¨Í
|
|||
|
|
¨ð
|
|||
|
|
ú ÷
|
|||
|
|
ú Í Á Ò Á ƒ
|
|||
|
|
‰
|
|||
|
|
�
|
|||
|
|
•
|
|||
|
|
› ú ú ¦ ú « ú Š Æ
|
|||
|
|
Û#Ø#ÇL
|
|||
|
|
½ùM!;Ðìæµß™ ¿c- 5º qÌì � ? Ã1³ Œ"šòP ÃMÒÙ¢Œé ÄcÃLÐLé!#ö!–úöø¶û�ޗ̘œö 8Á› œ üî0 Œ \� % _Á €€€€€€€€ 0x8080_8080_8080_8080Á´¦
|
|||
|
|
¤¦
|
|||
|
|
À�Ý % ü†7 � ,ž % _Á ”ß � ’ ’ ‰· “œ· ‚ •¯· ‚ UD�lÎ@
|
|||
|
|
Z àÝ z ö ÷ � üˆï ²² ä® ÷² ¾ æ± dà ä± Ð 6 — æ± * 2 — æ± � ƒ ä± 0 æ± s @ — æ± d½
|
|||
|
|
� ‘ & 1 8< � Group::WIDTHÁ 0Ádµ
|
|||
|
|
� – & 1 8< � Group::WIDTHÁ š �Ý Ô° T± , àÝ üø] ’ Ô üÖ€ — æ± \ê �Ý ²² “ EŽ , àÝ _Á d½
|
|||
|
|
� ˜ & 1 8< � Group::WIDTHÁ 0Á 0Á 0Á„÷ © \û ÿ üÙ/ , àÝ ñ % _Á „Þ © \â € ü¾1 - àÝ Ø % _Á l‰ 4‰ $’ € • ”‰ š
|
|||
|
|
¡ . üÕL $ú àÝ $ñ ’ ‘ : l¾ 4¾ $Ç € Ê ”¾ Ï
|
|||
|
|
Ö / ü‡O $¯ àÝ $¦ ’ ‘ : ù!¤ST ñ"§S
|
|||
|
|
É#ÔS Œ� $�
|
|||
|
|
" T†
|
|||
|
|
/ . d† F ‘ #íS #ìS
|
|||
|
|
ù!ÆS2
|
|||
|
|
Ø J ® ´
|
|||
|
|
» À
|
|||
|
|
àW #
|
|||
|
|
Ý !øS . !÷S
|
|||
|
|
l� 4� $¦ © ”� ®
|
|||
|
|
µ 0 ü¶
|
|||
|
|
$ä àÝ $Û Ø Ô ° àÝ ® Ç À ¿ G h $±
|
|||
|
|
$¸
|
|||
|
|
´À
|
|||
|
|
„Á
|
|||
|
|
dÁ
|
|||
|
|
2 Ð
|
|||
|
|
4 1 2 / b y Ô
|
|||
|
|
› ' Á Õ
|
|||
|
|
ô¸
|
|||
|
|
@ " 6 M S ϊ
|
|||
|
|
lä
|
|||
|
|
|
|||
|
|
$å
|
|||
|
|
|
|||
|
|
$ì
|
|||
|
|
ð
|
|||
|
|
K
|
|||
|
|
ö
|
|||
|
|
|
|||
|
|
Äà
|
|||
|
|
© ÷
|
|||
|
|
‹ Œ 1 üÆÆ ü
|
|||
|
|
_ àÝ í $ß ü ü ÔÅ G þ ý ü §\ top7Ák ˜D 2 O 2 üâ / ¼â
|
|||
|
|
‰
|
|||
|
|
À * ¬ü
|
|||
|
|
ϟ
|
|||
|
|
À * e v �
|
|||
|
|
¼
|
|||
|
|
|
|||
|
|
¬
|
|||
|
|
ëÆ 1 7 ¬Õ
|
|||
|
|
|
|||
|
|
œÕ
|
|||
|
|
™Ç ó
|
|||
|
|
üà ² 2 ,× ë ; _Á ´‚
|
|||
|
|
¤‚
|
|||
|
|
À - Ü‚ œ üæ 8 r $û ~ * _Á ̼
|
|||
|
|
¼¼
|
|||
|
|
Ð¦É & ü£ 3 s $µ # _Á 4ð4 ”ù4
|
|||
|
|
„ù4
|
|||
|
|
Ë‚Àß ' l®5 4®5
|
|||
|
|
#$µ5
|
|||
|
|
È‚ 1 4µ5 º5 üÕ5� ìØ5 tØ5 4Ø5
|
|||
|
|
#,ß5
|
|||
|
|
É‚ 1 <ß5 å5 W dé5 � s ô5 4ˆ6 tˆ6
|
|||
|
|
,�6 ÃÌ 0 <�6 •6 Û W d¼6
|
|||
|
|
� Õ6 ü•5Ì Ã à6 æ6 ç6 | üÈ4Ÿ üì4û �à $Ý4 èØèØ éØ™²‚ êØŸ²‚ ªë¥CHÈ 4 ôÎ
|
|||
|
|
Î Ë Ë ÁÏ Ì ÁÏ \ ò¼} ²› � , � 4‡Í Ä \£Í • Àß üÆÌs — Àß‹ò ”àÌ � � � ž ž³ A ŸÆ A Ò A ¡å A ð�e”?ûES ¸Í ¿Í ¤ ü¡Ìž — — â š‚ A ›¤ A œÚ A i†bªñüzÀß‹ò $·Ì ‹ò ; • • – PhantomDataÁ Fu\»ŸÀß [ ¥+ � �Ñ ¼†Ð
|
|||
|
|
|
|||
|
|
¬†Ð
|
|||
|
|
|Àß ' üäÏ: © �à \øÏ ( _Á ,ÄÔ \ßÔ • Àß üŠÔk — Àßòá ”¤Ô � �Ñ ôÔ ûÔ ª üÚÓ¡ «á $ûÓ òá ,îÓ òá ¯ ëÒ £ ¤ C � �Ñ ¤…Ò
|
|||
|
|
|
|||
|
|
”…Ò
|
|||
|
|
‚ # üóÑ' � �Ñ $þÑ ( _Á üåÕo ü•Ö0 ü•Ö) ô•Ö ¬•Ö
|
|||
|
|
œ•Ö
|
|||
|
|
� 5 9 F àÞ ©Ö l
|
|||
|
|
s 4«Ö
|
|||
|
|
„tàÝ „ D«Ö ²Ö ¯
|
|||
|
|
¶ D´Ö
|
|||
|
|
áàÝ Æ T´Ö ½Ö ò
|
|||
|
|
ù $¿Ö
|
|||
|
|
ÂàÝ 4¿Ö ÄÖ üþÕH
|
|||
|
|
´þÕ
|
|||
|
|
ž T . ÅÖ ü‡Õ¦ � ïÖ ¡× …× ¬× ²× ³× ‚ üæÔÍ �Ñ $øÔ ‰‰ § ‹‰ ï íe¼îËè¿* : : àÝ ; àÝ < î× < ÷² E ÷² N Œ trueÁ falseÁd‚… |£…
|
|||
|
|
l£…
|
|||
|
|
¤³ì / üï„N ¨ Ýéãééé‹ò ¼… Ã… ü³„� Ú ¨ ¨ � µ6 ®‚ Õ:Ç$Ö> EÝéãééé‹ò $à„ éé dÌ„ éé — — â š‚ A ›¤ A œÚ A i†bªñüz³ì‹ò T µ6f Þ déž ¼ŠŸ ,›Ÿ
|
|||
|
|
$ „ŠŸ
|
|||
|
|
ª³ìïé : L Ÿ üÖžV ¨ Ýéãéééïé «Ÿ ²Ÿ ü�ž¥ â ¥é $Çž éé d©ž ïé ,ºž éé — — â š‚ A ›¤ A œÚ A i†bªñüz³ìïé A ïé A µ6z ¤| » ä§z 4¼z
|
|||
|
|
" ¤§z
|
|||
|
|
ÚÀß �„ ; L Âz ü�z? ú Àß�„‹ò Íz Ôz üÙy{
|
|||
|
|
ú ú � þ Ø )æÜ$à׶Àß�„‹ò $€z �„ 4òy ¨ ¨ � µ6 ®‚ Õ:Ç$Ö> EÀß �„‹ò 9 �„ : º:a Ç üÑ”& 4é” ,ñ” 2
|
|||
|
|
9 ¼Ñ”
|
|||
|
|
âÀß �„�ç U F m ö” ü¹”I ú Àß�„�ç �• ˆ• üö“’ §
|
|||
|
|
߃ $ª” �„ 4’” �ç ,�” Ë„ û �„ ù �ç í º:0 ¤2 q |°
|
|||
|
|
l°
|
|||
|
|
¤Àß , ü˜2 ’ Àß‹ò É Ð ˜ üó] ’ ’ ãž •@ q)$Ø Í/€Àß‹ò $‰ �Ò ´ Q ¼Ÿ& ,°&
|
|||
|
|
" „Ÿ&
|
|||
|
|
ªÀßòá 8 I µ& ü‡&: ’ Àßòá À& Ç& ü×%p � ¿“ $ø% òá ,ë% «á º òá º ¤ M ÌØ
|
|||
|
|
ö ÷ % òÛ 1 8 ? ìú
|
|||
|
|
ý þ % ÌÜ 1 òÛ 9 @ ¼‰ ¢ £ % �Ý 1 ç‘ç‘ è‘ uint8x8_tÁ 鑈 õÝ–äº s z ¬u © ª $ àÝ 0 7 > Dé« æê‹í“ó³ñ + § 8 ¦ §óO ¨ˆ © ª�P «ˆ Û-k<׌E æê‹í“ó³ñ š ² ² ØP ¸§ Ž ¹�Q Ž º‚ Ž ¥±£PUPÄã æê‹í“ó³ñ ö ý 4Þ® æê‹í“ó³ñ + ª 8 «î D Ë Ë ¨R ѧ Ž ÒëR Ž Ó‚ Ž Jò…ôËÙË æê‹í“ó³ñ § D™Û Ú Ñõ×õÝõãõéõ 1 ã > Ú â ãóO äˆ å æ�P çˆ ì˜Ò—Y Ñõ×õÝõãõéõ ¦ ² ² ØP ¸§ Ž ¹�Q Ž º‚ Ž ¥±£PUPÄã ÑõÝõãõéõ
|
|||
|
|
4�Þ Ú Ñõ×õÝõãõéõ 1 æ > ññ J ï ï ÒT ÷§ Ž øëR Ž ù‚ Ž -2RY±¾È Ñõ×õÝõãõéõ ¬ ³ DÖ\ — æê‹í“ó³ñ * ž 7 — � ž óO Ÿ ˆ ¡ �P ¢ ˆ "ø0ôÂw‚ æê‹í“ó³ñ ™ £ £ Ñp © �Q õ
|
|||
|
|
ª ‚ õ
|
|||
|
|
« µ6 õ
|
|||
|
|
©B·á}ÂÞø æê‹í“ó³ñ õ ü 4õ_ — æê‹í“ó³ñ * ¡ 7 Äõ C ¶ ¶ öq ¼ ‚ õ
|
|||
|
|
½ µ6 õ
|
|||
|
|
⊶^_X æê‹í“ó³ñ “ š D…“ ¨ Šçééïé ' ® 4 ¨ ®óO ¯ˆ ° ±�P ²ˆ h±¶)#‹j— Šçééïé ’ ¸ ¸ ØP ½Ô Ú k]3BП B Šçééïé Ò Ù 4ò• ¨ Šçééïé ' ± 4 óø @ à à ¨R ÈÔ Ú F9 !›Ànt Šçééïé € ‡ D—È ë Šç�ç # ð 0 ë ï ðóO ñˆ ò ó�P ôˆ FÐWdÔæN Šç�ç Š ƒ ƒ ØP ‡§ € ˆÅ € ‰‚ € tÒæìše¾‚ Šç�ç Þ å 4�Î ë Šç�ç # ó 0 ëû < � � ¨R ¡§ € ¢£¨ € £‚ € €:X¦ßÎ Šç�ç ‘ ˜ A‡�Žõ
|
|||
|
|
º Ú €ìîðÔí ¤,‰ �<Ï ¨ ò�<ì ú óãžL‹ ’ ôÑTÊ õü ¼* ü L I This crate is a Rust port of Google's high-performance [SwissTable] hashÁ üMO L map, adapted to make it a drop-in replacement for Rust's standard `HashMap`Á Ä� and `HashSet` types.Á ¶ ú üºJ G The original C++ version of [SwissTable] can be found [here], and thisÁ ü…? < [CppCon talk] gives an overview of how the algorithm works.Á Å ú üÉ= : [SwissTable]: https://abseil.io/blog/20180927-swisstablesÁ ü‡c ` [here]: https://github.com/abseil/abseil-cpp/blob/master/absl/container/internal/raw_hash_set.hÁ üë> ; [CppCon talk]: https://www.youtube.com/watch?v=ncHmEUmJZf4Á A‡�Žõ
|
|||
|
|
º Ú €ìîðÔí
|
|||
|
|
¤ �
|
|||
|
|
¨ ò� ú óãž ’ ôÑ
|
|||
|
|
õpsvÜ üÖ 3 0 Default hasher for [`HashMap`] and [`HashSet`].Á »íÔ� üŠ " ”¶ Ñë”ü ÒTò 4ö œ64C J � € ç , � ‚ ¼ 8 Œ + � � ¥ 8â ‘ ” ¤ , • – ¡ , — 8û $˜ & œ 8û $� $ ¢
|
|||
|
|
£ § ¶ , © ª ³ , « 8 itÁ ¬ & ® 8÷ $¯
|
|||
|
|
´ 8 $¾
|
|||
|
|
à 8 $Å Ê æ , Ô Õ ß , Ö 8 it2Á × & Ú 8÷ $Û
|
|||
|
|
à *é ì � 8é 4ö ü þ û Œ 8 __itemsÁ <� ¡ ¢ % ¤ , ² ³ Ñ µ Î ·  , ¸ ¹ ¿ , º 8û $» $ À
|
|||
|
|
Á Ä Ì , Å Æ Ê , Ç 8±‡ È
|
|||
|
|
Ë $ Ï
|
|||
|
|
Ò à ð â ã å î , æ ç ì , è 8šˆ é
|
|||
|
|
í $ ñ % ‚ ¼ Ï 8 Æ + É Ê à 8â Ë Î ß , Ï Ð Ü , Ñ 8 i_metÁ ,Ò & × 8û $Ø $ Ý
|
|||
|
|
Þ â ó , ä å ð , æ 8 i_itÁ $ç & ë 8÷ $ì
|
|||
|
|
ñ , ý þ È 8 $Œ 8 ‘ + ” • « 8â – ™ ª , š › § , œ 8 e_metÁ ,� & ¢ 8û $£ $ ¨
|
|||
|
|
© ¾ , ¯ ° » , ± 8 e_itÁ $² & ¶ 8÷ $·
|
|||
|
|
¼
|
|||
|
|
É *Ñ Ô � 8é 4Þ ä æ ‰ ô 8ûˆ <õ ‰ Š % Œ š ¶ œ ¨ , � ž ¥ , Ÿ 8�Œ , $ ¦
|
|||
|
|
§ ª ´ , « ¬ ² , 8åŒ $®
|
|||
|
|
³ $ · , Å Æ ç È ä Ê Ö , Ë Ì Ó , Í 8ü� ,Î $ Ô
|
|||
|
|
Õ Ø â , Ù Ú à , Û 8ÔŽ $Ü
|
|||
|
|
á $ å
|
|||
|
|
è ö þ ø ù û ü $ ÿ % � Ò ï Ó 8ûˆ <Ô Ü ë , Ý Þ é , ß 8”
|
|||
|
|
à & ã 8û $ä $ è
|
|||
|
|
ê % í *ñ ô õ % ö ü È ý 8ûˆ <þ † • , ‡ ˆ “ , ‰ 8”
|
|||
|
|
Š & � 8û $Ž $ ’
|
|||
|
|
” % — ™ ¹ › ¨ , œ � ¥ , ž 8¸ Ÿ & 8û $¡ $ ¦
|
|||
|
|
§ ª · , « ¬ µ , 8±‡ ® & ° 8÷ $±
|
|||
|
|
¶ $ º , ¼ ½ Æ , ¾ 8 restÁ $¿ & Ã 8¯ Ä
|
|||
|
|
Ç *Ê Í ƒ
|
|||
|
|
8é 4™
|
|||
|
|
Ÿ
|
|||
|
|
¡
|
|||
|
|
Û
|
|||
|
|
£
|
|||
|
|
8 __applyÁ <¤
|
|||
|
|
8â ¬
|
|||
|
|
¯
|
|||
|
|
Ð
|
|||
|
|
8£ °
|
|||
|
|
³
|
|||
|
|
Ï
|
|||
|
|
, ´
|
|||
|
|
µ
|
|||
|
|
¹
|
|||
|
|
, ¶
|
|||
|
|
8¸ ·
|
|||
|
|
$ ¸
|
|||
|
|
|
|||
|
|
º
|
|||
|
|
8”
|
|||
|
|
¼
|
|||
|
|
¿
|
|||
|
|
Î
|
|||
|
|
8º À
|
|||
|
|
Ã
|
|||
|
|
Í
|
|||
|
|
, Ä
|
|||
|
|
Å
|
|||
|
|
Ê
|
|||
|
|
, Æ
|
|||
|
|
8”
|
|||
|
|
Ç
|
|||
|
|
$ Ë
|
|||
|
|
|
|||
|
|
Ì
|
|||
|
|
$ Ñ
|
|||
|
|
, Ó
|
|||
|
|
Ô
|
|||
|
|
Ø
|
|||
|
|
, Õ
|
|||
|
|
8±‡ Ö
|
|||
|
|
|
|||
|
|
Ù
|
|||
|
|
8é 4Ê Ð Ò ý Ô 8ûˆ <Õ Ý ï , Þ ß å , à 8”
|
|||
|
|
á $ ä
|
|||
|
|
æ , è é í , ê 8¸ ë $ ì
|
|||
|
|
î % ñ , ó ô ú , õ 8– $ö
|
|||
|
|
û % „
|
|||
|
|
Í
|
|||
|
|
ì
|
|||
|
|
|
|||
|
|
Î
|
|||
|
|
8�— <Ï
|
|||
|
|
, ×
|
|||
|
|
8¸ Ø
|
|||
|
|
& Ù
|
|||
|
|
8û $Ú
|
|||
|
|
$ Þ
|
|||
|
|
, à
|
|||
|
|
á
|
|||
|
|
ê
|
|||
|
|
, â
|
|||
|
|
8±‡ ã
|
|||
|
|
& å
|
|||
|
|
8÷ $æ
|
|||
|
|
|
|||
|
|
ë
|
|||
|
|
*î
|
|||
|
|
ñ
|
|||
|
|
� , û
|
|||
|
|
ü
|
|||
|
|
† + ý
|
|||
|
|
þ
|
|||
|
|
� , ÿ
|
|||
|
|
8¸ € , ƒ 8±‡ „
|
|||
|
|
‡ % Ž ¼Á »¨œª¬©ü TÎ Ù „ Ü ç , Ý Þ å , ß 8¯ à & â 8¯ ã
|
|||
|
|
æ *é ì ‚ , ö ÷ û , ø 8¯ ù
|
|||
|
|
ü \ÿ <ƒ 'î´<5 ö :î´ ÷ :�µ\b ý <�µ þ <–¹,z ¢ = ƹ ‹ © ?ƹ ª ?±\� 5 @\ <ö÷ýþîµ\
|
|||
|
|
‰ "�¶”%
|
|||
|
|
Š #ŶŒ9
|
|||
|
|
�
|
|||
|
|
$±¶dL
|
|||
|
|
Π%ݦtZ
|
|||
|
|
‹ &d
|
|||
|
|
pr^`LN9;&(d§
|
|||
|
|
òÛ ü¨ "
|
|||
|
|
.\€
|
|||
|
|
4¶
|
|||
|
|
òÛòÛ
|
|||
|
|
$½
|
|||
|
|
üÚ
|
|||
|
|
"
|
|||
|
|
.\Ê
|
|||
|
|
|
|||
|
|
ŒÝ
|
|||
|
|
|
|||
|
|
òÛòÛ
|
|||
|
|
$ï
|
|||
|
|
|
|||
|
|
üÿ '
|
|||
|
|
\�
|
|||
|
|
òÛ
|
|||
|
|
$™
|
|||
|
|
ü›
|
|||
|
|
3
|
|||
|
|
t©
|
|||
|
|
|
|||
|
|
òÛۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ
|
|||
|
|
$¸
|
|||
|
|
|
|||
|
|
üÏ+
|
|||
|
|
tÝ
|
|||
|
|
òÛ
|
|||
|
|
$ì
|
|||
|
|
ü–?
|
|||
|
|
´™
|
|||
|
|
ô ô õ ¨ ÷ ˆÐ mjç�ítoé
|
|||
|
|
nonzeroÁ<°
|
|||
|
|
ü¶*
|
|||
|
|
lÄ
|
|||
|
|
òÛ
|
|||
|
|
$Ò
|
|||
|
|
ì¥
|
|||
|
|
òÛ ÈL ÉL ÊL LÉ
|
|||
|
|
$Î
|
|||
|
|
là
|
|||
|
|
Då
|
|||
|
|
ÌÜü�!
|
|||
|
|
L“
|
|||
|
|
òÛÌÜ
|
|||
|
|
$�
|
|||
|
|
ì®
|
|||
|
|
ÌÜ úM ûM LÒ
|
|||
|
|
$×
|
|||
|
|
üø #
|
|||
|
|
$û
|
|||
|
|
â âÌ܈¤ €
|
|||
|
|
|
|||
|
|
$…
|
|||
|
|
L
|
|||
|
|
,‚–¹,É
|
|||
|
|
|
|||
|
|
¢ îµ\ð
|
|||
|
|
|
|||
|
|
‰ "�¶”ý
|
|||
|
|
|
|||
|
|
Š #ŶŒ‘
|
|||
|
|
� $±¶d¤
|
|||
|
|
Œ %›¶t²
|
|||
|
|
‹ &Œ Ä
|
|||
|
|
|
|||
|
|
‚ ¡„¾
|
|||
|
|
|
|||
|
|
�Lß
|
|||
|
|
|
|||
|
|
�ƒqsacPR?A< 5©ª× ` ' )í ë ' *$ $&D› àÝ,-./01 ÜÙ ,ê + + àÝì¾ <Ï + + àÝüÕ) <é àÝ + +
|
|||
|
|
. g8ü‡, T› àÝ + + ò½ì7ü¶2 „Ê àÝ + +
|
|||
|
|
0 ,6üÆ* $Ú àÝ + +
|
|||
|
|
1 §4Ìà dÉ ' ¼� àÝ4 Àc 4 ü8 ° ã ä å ãàÝ ä c c ˆ ¢cµ
|
|||
|
|
` £c bufÁ ` àB¤GS
|
|||
|
|
åÖ¿Ù¿ Ú¿« Û¿ˆ Ü¿ Ý¿Þ¿ˆ ‚†f|Â
|
|||
|
|
ŸÈŸÈ È ErrorÁ O˜éBL 3 ´ 3
|
|||
|
|
4 $µ ± » ä¢ \³ 5 5 Îì¦É ü¢ê 5 À° À° 6767 6 7 üó! Dö æ æ¦ÉàÝ 5 ÿ 5
|
|||
|
|
6¦É$„ ¢ Š ÄÈ TË ç ç¦É 5 Ö 5
|
|||
|
|
7¦É$Û Ô� àÞ9 6 9 ü¼ D¿ è èàÞàÝ 8 È 8
|
|||
|
|
9 $Í ¢ Ó ´&ç $M¤YÉ ds¨ üM;™ œ x { <Œ � [lqvyz�—�ÃÛø’ŸÃåüµ¾ÃË handle_alloc_errorÁ” œ A C 4. èØ A D�µ\L ý A F <�µ þ A F <–¹,Y ¢ A G = ƹ ` © A H ?±\e 5 A I @£,‹ Æ A K©{T’ Á A LÓ4\± ‹ A Nð4¾ ‰ A OûDÆ Š A P¶¼|Ü Ô A QÇ,÷ ¸& A R
|
|||
|
|
FusedIteratorÁlŽ òP A SùÑ\¯ • A TùÑ – A Tí Æ ë A U§<Ú ‰ A Vž,í ‰f A W hintÁ$ÿ ‹ A Yµ … “ A Z¦Dé f i ] AllocatorÁLó 1 j ^ c™ñ4þ Ä k _ d™ñ Å k _ dœ03$'t; òõßâÐÓŒwÅȸ»\£¯²¢¥•˜´Õ‹\ñÌ‚fÌ¡YLÀ9”Ï-\ç!$øLŒ ,�A`¦DR f ]í¶L\ 1 ^ c™ñ4g Ä _ d™ñ Å _ d\DSUEG46Lá »¨œ¬¬»�ÔÃü¨6üŸA ,å[f 4Š èØ ` aí¶Lö 1 c™ñ4�
|
|||
|
|
Ä d™ñ Å d§<�
|
|||
|
|
‰ ` eÜõ]¬Þ NPAC”’
|
|||
|
|
&üÐ
|
|||
|
|
ZDÞ
|
|||
|
|
é é ’ ôÎÖ¿Ù¿ Ú¿« Û¿ˆ Ü¿ Ý¿Þ¿ˆ ‚†f|Â
|
|||
|
|
ýÚ ’ g g ü
|
|||
|
|
Í으 ç
|
|||
|
|
1œ¼ Lê
|
|||
|
|
|
|||
|
|
fœ¼¤,õ
|
|||
|
|
ò¼4€ ,. \ÛíðÚÝü’?\œ A Àß ’¾ ¥ m m ÍìÀß ¨
|
|||
|
|
lÀß toÁ«÷$¹ „Š ìÞop ü€- Œƒ A ìÞ០n n
|
|||
|
|
o $•üÏ 5 LÒ A ìÞôÎ០n n
|
|||
|
|
p $Ü ò¼4â ü¿ œÅ A q q Íì¦É ,Ú q ´À ´À rsrs Ìæ lì A q q ´£ T© A q q üÚ ! ¥ u u µ¾ ß Àß
|
|||
|
|
Ì�„ A
|
|||
|
|
v §$‡lÖ Íßx üø+Lû A ê êÍß w … w
|
|||
|
|
x $Š³\�ü·N œº A �àˆ¤
|
|||
|
|
y capÁ Î table_layoutÁdÚüœ/7¼Ÿ/ A
|
|||
|
|
z ³\·/„£4 �à|~ ÌÈ4 Ñ4 A �à { ¥ } } { µ¾ Õ4 ÚÓ üû6H¤þ6 A �à ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙôÎ { {
|
|||
|
|
~ $“7ä <™7¬÷= T‚> Ý €Ö A °æ…F☫ °æ…F☫ €d“>,“>A ¤ @ 4«@ ¥ ‚ ‚ µ¾ ²@çà jùÜfB‚‹¨ ƒ |²B ²BA � � ‰‰ § ‹‰ ï íe¼îËè¿*Àßü´C! ¥ … … µ¾ ÀCçà
|
|||
|
|
ÜÚC ¥ ‡ ‡ µ¾ ßCçàˆ Ù ˆ ¼ŠD,�D ë ëçà çà † “D †
|
|||
|
|
ˆÀß$”DŒÌD ¥ Š Š µ¾ ÑDçà‹Œ�Ž��‘’“• &( üßXA|éX A ÝÇ çà ‰ ‰
|
|||
|
|
‹Àß baseÁ$ùXÖ,‹YüÂu9lÌu A ì ìçà ÝÇ ‰ Úu ‰
|
|||
|
|
ŒÀß$ÛuøÉ$áuô¨�4¯� í íçà Àß ‰ ¶� ‰
|
|||
|
|
�Àß$·�üÂ�#\Å� A î îçà ÝÇ ‰ Ñ� ‰
|
|||
|
|
ŽÀß$Ò�üü¢.4†£ A ï ïçà çà ‰ �£ ‰
|
|||
|
|
�Àß$Ž£ž
|
|||
|
|
4”£üÕ« $ê« ð ðçà ‰ ï« ‰
|
|||
|
|
�Àß$ð«ü‡²%$œ² ñ ñçà Àß ‰ ¡² ‰
|
|||
|
|
‘Àß$¢²ü׸),ì¸ ò òçà Àß ‰ ò¸ ‰
|
|||
|
|
’Àß$ó¸¹ ù¸ü»»(4É» ó óçà ÃÀß ‰Ã ” ” Ô» ‰
|
|||
|
|
“Àß Ã$ջлüÔÁ,4âÁ ô ôçà ÃÀß ‰Ã – – íÁ ‰
|
|||
|
|
•Àß Ã$îÁéÁüÑÂ- DÜ ¥ ˜ ’ ™ ˜ ™ µ¾ å Íìòá ¬è 1òá Lë«á i†bªñüz š›œ ÔHJ C è ‹ò ¤…Ã,…ÃA — — �ÑDŸÃ,ŸÃA — — òá´ÜÃ4ÜÃA — — ëÒ¤�Å l”ÅA �Ñ ð�e”?ûES žŸ ¡”�Æ\�ÆA � � Œ˜Ç$˜ÇA � � ýÚ”€È\€ÈA � � dÛÈ,ÛÈA � � ÜìÈ ¥ £ £ µ¾ ñÈ�Ò¤¥ Ô¡Ì ®Ì �Ò ¢ ¢ íçüÏÎ-lÖÎ �Ò ¢ ¢
|
|||
|
|
¥Àß¼ DäÎü¹Ï$ ¥ § ’ ¨ ¨ § µ¾ ¾Ï �Ó ÁÏ “ÓLÄϫᩪ«¬®¯°±²³´µ·¸º¼¾ÀÄÇÉËÍÑÒÕ×Ùàçïðñòóôõö÷øù ™› �Ÿ üäÏ dêÏA ¦ ¦ �àüÚÓ% 4çÓ òá«á ¦ ¦ Èé¤ Bü±Ö� Œ»Ö A òá ìÞÖ¿Ù¿ Ú¿« Û¿ˆ Ü¿ Ý¿Þ¿ˆ ‚†f|Â
|
|||
|
|
«á០¦ ¦
|
|||
|
|
«Àßòá¤,ÖÖä <èÖ fallibilityÁ\€×ü®Û:„µÛ òá«á ¦ ¦
|
|||
|
|
¬Àßòá¼ DÆÛ¤,×ÛìáÝLèÝ õ õ«á õòá ¦ òÝ ¦
|
|||
|
|
Àßòá$óÝü¾á$DÅá ö ö«á ÝÇ ¦ Îá ¦
|
|||
|
|
®Àßòá$ÏáüŠï&|‘ï ÷ ÷«á ¦ ¡ï ¦
|
|||
|
|
¯Àßòá$¢ïü°ñ>d¾ñ ø ù ø«á ùçà ¦ Ëñ ¦
|
|||
|
|
°Àßòá$ÌñÅ4ÒñüÑû64ßû ú ú«á çà ¦ æû ¦
|
|||
|
|
±Àßòá$çûÖ,íûü¾�4 lÈ� A û ü û«á üçà ¦ Ö� ¦
|
|||
|
|
²Àßòá$Û�÷$á�üì�/ ,ú� ý ý«áçà ¦ €� ¦
|
|||
|
|
³Àßòá$…�÷$‹�ü—“C 4¥“ þ þ«áçàÀß›Æ ¦ ¬“ ¦
|
|||
|
|
´Àßòá$±“÷$·“ü…–R dŒ– ÿ ÿ«á—ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙÀß ¦— ¶ ¶ ™– ¦ ÍìÎã ´³– € “"Îã €Àß Œ¸– € Îããä˜" $Å–
|
|||
|
|
µÀßòáÎã$ž–§$¤–�¯–qs ü¦™ l™ � �«á ¦ »™ ¦
|
|||
|
|
·Àßòá$À™¼øš ,ÿš ‚ ‚«á ¦ …› ¦
|
|||
|
|
¸Àßòá$Š›<ˆ� ¸ <closure_kind>Á ¹ <closure_signature>Á ¹ <upvars>Á ¹ ¹ ¸ ¹Àßòá «á üÐ H L× ƒ ƒ«á í ¦í » » á ¦ Íìíè ”…¡ „ �"íè „Àß lŠ¡ „ íè¼é˜" ”¡
|
|||
|
|
ºÀßòáíè$æ min_sizeÁDì º:4ý z| ü�»H <–» … …«á íè ¦í ½ ½ ž» ¦ šé”Ä» † �"íè †Àß lÉ» † íè«ë˜" Ó»
|
|||
|
|
¼Àßòáíè$£»
|
|||
|
|
additionalÁT©»º:4¼»|~ üÇŠ \Π‡ ‡«á íèÖ¿Ù¿ Ú¿« Û¿ˆ Ü¿ Ý¿Þ¿ˆ ‚†f|Â
|
|||
|
|
០¦í ¿ ¿ ã ¦ šé”™Ã ˆ �"íè ˆÀß lžÃ ˆ íèïí˜" ¨Ã
|
|||
|
|
¾Àßòáíè$èÂ÷êTöº:4‘Ãsu üÓɲtÝÉ A ‰ ‰«á íèìÞÜì ¦í Á Á õÉ ¦ šé”«Ê Š �"íè ŠÀß l°Ê Š íèÛï˜" ºÊ
|
|||
|
|
ÀÀßòáíè$úÉ÷êTˆÊº:4£Ê¥Ú\ÇÊ} tÂÏ À±æ  Êæ  èæ   À ÂÀßòáíè �Ñ íè ,ùÐ À±æ à Êæ à èæ à à À ÃÀßòáíè ³Û üïÙ¨4ùÙ A ‹ ‹«á íèìÞÜì ¦í Å Å ‰Ú ¦ šé”½Ú Œ �"íè ŒÀß lÂÚ Œ íèÈó˜" ÌÚ
|
|||
|
|
ÄÀßòáíè$ŽÚ¼ DœÚº:4µÚ¥Ú\ÙÚ|~ töÞ Ä±æ Æ Êæ Æ èæ Æ Æ Ä ÆÀßòáíè²ñËñüÏáV 4Öá � �«áÀßíèçà ¦í È È Ýá ¦ šé”…â Ž �"íè ŽÀß lŠâ Ž íè§ö˜" ”â
|
|||
|
|
ÇÀßòáíè$âá§$èá»,óáº:4ýá{} üéíY dðí � �«áÀßíè �Àß ¦í Ê Ê ýí ¦ šé”¥î � �"íè �Àß lªî � íè¥ø˜" ´î
|
|||
|
|
ÉÀßòáíè$‚î§$ˆî»,“îº:4�î{} ü‰ø} œ—ø ‘ ‘«áçàõ‹ ¦— Ì Ì ®ø ¦ Íìõ‹ «ø –"õ‹Àß ´ïø õ‹™ú˜" ÓãLüø
|
|||
|
|
ËÀßòáõ‹$³øÅ4¹ø± Ìø_a üíÿ¹Äôÿ ’ ’«áÎãíÖ¿Ù¿ Ú¿« Û¿ˆ Ü¿ Ý¿Þ¿ˆ ‚†f|Â
|
|||
|
|
çà›Æ ¦— Î í Ï Î Ï –€ ¦ Áä´Ä€ Íì±û ”ì€ “ “"Îã “Àß ŒÉ€ “ Îãëü˜" $Ö€ ” �"±û ”Àß lñ€ ” ±û¬ý˜" û€
|
|||
|
|
ÍÀßòáÎã±û$›€§$©€�À€º:4ä€ÒÔ ÍÏ <¤‡ ͱæ Ð Êæ Ð èæ Ð Ð Í ÐÀßòáÎã±û Îã «á üÈ‹[tÖ‹ • •«á›ÆÀßçà ¦ å‹ ¦
|
|||
|
|
ÑÀßòá$ꋧ$ð‹ slotÁ$û‹»,�ŒüÃŽR$ÊŽ – –«á Îãۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙçà ¦— Ó Ó ÏŽ ¦ Áä´éŽ — “"Îã —Àß ŒîŽ — Îãü�˜" $ûŽ
|
|||
|
|
ÒÀßòáÎã$ÐŽ§$ÖŽ�åŽqs <»“ Ò±æ Ô Êæ Ô èæ Ô Ô Ò ÔÀßòáÎã–ÿ¢ÿü®–F µ– ˜ ˜«á Îãۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ ˜Àß ¦— Ö Ö ¹– ¦ Áä´Ï– ™ “"Îã ™Àß ŒÔ– ™ Îãš…˜" $á–
|
|||
|
|
ÕÀßòáÎã$º–§$À–�Ë–qs ü�™R<”™ š š«áÎãۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ šÀß ¦— Ø Ø œ™ ¦ Áä´¶™ › “"Îã ›Àß Œ»™ › Îã·˜" $È™
|
|||
|
|
×ÀßòáÎã$¡™§$§™�²™qs ü¢Ÿœd©Ÿ œ œ«á Ÿ€ ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ œÀß Ÿ ¦Ÿ Ú € Ü Ü Ú ÏŸ ¦ Ÿ t¶Ÿ Íìöˆ ì€ � “"öˆ �Àß Ä… � öˆ¸Š˜" $™
|
|||
|
|
ÙÀßòá Ÿöˆ$ÔŸ hashesÁ4âŸ�üŸ‘ ¼Ÿ ˆŠ ,ó£ Ù±æ Þ Êæ Þ èæ Þ
|
|||
|
|
' ¥ ê ê µ¾ ˜…
|
|||
|
|
Ââ ü·…
|
|||
|
|
' ¥ ì ì µ¾ Ã…
|
|||
|
|
Ââ üã…
|
|||
|
|
! ¥ î î µ¾ è…
|
|||
|
|
Ââï Ù ï ¼¼†
|
|||
|
|
,¿†
|
|||
|
|
é éÂâ Ââ í ņ
|
|||
|
|
í
|
|||
|
|
ïÀß$Ɔ
|
|||
|
|
ü–ˆ
|
|||
|
|
$ ¥ ñ ñ µ¾ ›ˆ
|
|||
|
|
Ââòóõ úM ûM ÿM õ ó &( LÁˆ
|
|||
|
|
$ƈ
|
|||
|
|
ð ð çàüŽ‰
|
|||
|
|
' $‘‰
|
|||
|
|
ê êÂâõ€ ð –‰
|
|||
|
|
ð
|
|||
|
|
óÀß$›‰
|
|||
|
|
$šŠ
|
|||
|
|
üÅŠ
|
|||
|
|
-LÈŠ
|
|||
|
|
ë ëÂâ ˆ¤ ð ÒŠ
|
|||
|
|
ð
|
|||
|
|
õÀß$ÓŠ
|
|||
|
|
ü÷�
|
|||
|
|
) ¥ ÷ ÷ µ¾ ü�
|
|||
|
|
Ââ ¬Á”
|
|||
|
|
<Ì”
|
|||
|
|
¥ ù ù µ¾ Ô”
|
|||
|
|
Çã é9qeZï h úû!# üÝ”
|
|||
|
|
$è”
|
|||
|
|
ø ø Ââdƒ•
|
|||
|
|
,ĥ
|
|||
|
|
A ø ø ””•
|
|||
|
|
¥ ý ý µ¾ ™•
|
|||
|
|
Çãþ ü•
|
|||
|
|
"l·•
|
|||
|
|
A ì ìÇã ü Å•
|
|||
|
|
ü
|
|||
|
|
þÀß$Ê•
|
|||
|
|
äÝ–
|
|||
|
|
¥ € € µ¾ â–
|
|||
|
|
Çã� Ù � ¼±—
|
|||
|
|
,´—
|
|||
|
|
í íÇã Çã ÿ º—
|
|||
|
|
ÿ
|
|||
|
|
�Àß$»—
|
|||
|
|
ô°˜
|
|||
|
|
¥ ƒ ƒ µ¾ µ˜
|
|||
|
|
Çã„ ´ „ ¤†™
|
|||
|
|
<‰™
|
|||
|
|
Çã ‚ ‚
|
|||
|
|
„Àßü š
|
|||
|
|
¥ † † µ¾ ¥š
|
|||
|
|
Ç㇈Š‹ úM ûM ÿM óN Š ˆ ‹ 13 LÆš
|
|||
|
|
$Ëš
|
|||
|
|
… … çàü“›
|
|||
|
|
' $–›
|
|||
|
|
î îÇãõ€ … ››
|
|||
|
|
…
|
|||
|
|
ˆÀß$ ›
|
|||
|
|
,ƒž
|
|||
|
|
üýž
|
|||
|
|
-L€Ÿ
|
|||
|
|
ï ïÇã †ñ … ŠŸ
|
|||
|
|
…
|
|||
|
|
ŠÀß$‹Ÿ
|
|||
|
|
üíŸ
|
|||
|
|
l$ðŸ
|
|||
|
|
Çã“õ‹ù …“ Œ — � Œ � … Íìù õŸ
|
|||
|
|
üù øŸ
|
|||
|
|
ÍìÇã ,
|
|||
|
|
“"õ‹ùÇã úM Ì¿
|
|||
|
|
õ‹ ú˜" ù ×
|
|||
|
|
|
|||
|
|
‹Àßùõ‹$ûŸ
|
|||
|
|
initÁ$�
|
|||
|
|
± Š
|
|||
|
|
ˆŠ ŒŽ ü¥¡
|
|||
|
|
( ¥ � � µ¾ ª¡
|
|||
|
|
Çã üÑ¡
|
|||
|
|
$ ¥ ‘ ‘ µ¾ Ö¡
|
|||
|
|
Çã üâ§
|
|||
|
|
$ ”ô§
|
|||
|
|
¶ä ¢e ¶ÜìãA “”•–Ô„©
|
|||
|
|
l„©
|
|||
|
|
A ’ ’ ÌÜÄšª
|
|||
|
|
Œšª
|
|||
|
|
A ’ ’ Œ¨«
|
|||
|
|
$¨«
|
|||
|
|
A ’ ’ ýÚdè«
|
|||
|
|
,è«
|
|||
|
|
A ’ ’ ¼ù«
|
|||
|
|
¶ä˜ ü²°
|
|||
|
|
/L¼°
|
|||
|
|
A ð ð¶äˆ¤ — Æ°
|
|||
|
|
—
|
|||
|
|
˜ $Ë°
|
|||
|
|
üýÀ
|
|||
|
|
$ ¶äš›œ úM ûM ÿM œ › L¨Á
|
|||
|
|
$Á
|
|||
|
|
™ ™ ü©Ã
|
|||
|
|
#$¬Ã
|
|||
|
|
ñ ñ¶äˆ¤ ™ ±Ã
|
|||
|
|
™
|
|||
|
|
› $¶Ã
|
|||
|
|
ü¤Ç
|
|||
|
|
-L§Ç
|
|||
|
|
ò ò¶ä †ñ ™ ±Ç
|
|||
|
|
™
|
|||
|
|
œ $²Ç
|
|||
|
|
ü„È
|
|||
|
|
- ¶ä üµÈ
|
|||
|
|
) ¶ä ü�É
|
|||
|
|
0 \¨É
|
|||
|
|
¥ ’ ¡ ¡ µ¾ ´É
|
|||
|
|
�Ó¬·É
|
|||
|
|
“ÓLºÉ
|
|||
|
|
¢å Ñ\ÈÝß^q ¢£¤ ²8: < ·É
|
|||
|
|
‹ò „ÔÉ
|
|||
|
|
$ÔÉ
|
|||
|
|
A Ÿ Ÿ ÇãüêÉ
|
|||
|
|
,TêÉ
|
|||
|
|
A Ÿ Ÿ ñ¡´œÊ
|
|||
|
|
4œÊ
|
|||
|
|
A Ÿ Ÿ ëÒü·Ê
|
|||
|
|
' ¥ ¦ ’ § ¦ § µ¾ ¼Ê
|
|||
|
|
�Ó ¿Ê
|
|||
|
|
“ÓLÂÊ
|
|||
|
|
¢å¨ "$ ü–Ë
|
|||
|
|
$�Ë
|
|||
|
|
ó ó¢å Çã ¥ ¢Ë
|
|||
|
|
¥
|
|||
|
|
¨Àßòá$£Ë
|
|||
|
|
üÜË
|
|||
|
|
W ¥ ª ’ « ª « µ¾ èË
|
|||
|
|
�Ó ëË
|
|||
|
|
“ÓLîË
|
|||
|
|
±£$¡Ì
|
|||
|
|
ã$®Ì
|
|||
|
|
¢å -/ 13 ü¸Ì
|
|||
|
|
W ¥ ’ ® ® µ¾ ÄÌ
|
|||
|
|
�Ó ÇÌ
|
|||
|
|
“ÓLÊÌ
|
|||
|
|
¼¤$ýÌ
|
|||
|
|
ͤ$ŠÍ
|
|||
|
|
¢å -/ 13 üûÐ
|
|||
|
|
0 »¨œäÐ
|
|||
|
|
¬ãÐ
|
|||
|
|
üÚÐ
|
|||
|
|
¥ ° ’ ± ° ± µ¾ €Ñ
|
|||
|
|
�Ó ƒÑ
|
|||
|
|
“ÓL†Ñ
|
|||
|
|
¢å² �" ² &( *, ”ãÑ
|
|||
|
|
$æÑ
|
|||
|
|
ô ô¢å ¯ ëÑ
|
|||
|
|
¯
|
|||
|
|
²Àßòá$ðÑ
|
|||
|
|
ü�Ô
|
|||
|
|
3 ¥ ´ ’ µ µ ´ µ¾ •Ô
|
|||
|
|
�Ó ˜Ô
|
|||
|
|
“ÓL›Ô
|
|||
|
|
¢å¶ ´ ¶ &( *, ¤ÊÔ
|
|||
|
|
<ÍÔ
|
|||
|
|
¢å ³ ³
|
|||
|
|
¶ÀßòáüçÕ
|
|||
|
|
4 ¥ ¸ ’ ¹ ¸ ¹ µ¾ ìÕ
|
|||
|
|
�Ó ïÕ
|
|||
|
|
“ÓLòÕ
|
|||
|
|
¢åº»¼ úM ûM ÿM » ¼ 8: <> L¢Ö
|
|||
|
|
$§Ö
|
|||
|
|
· · ÀßüçÖ
|
|||
|
|
$êÖ
|
|||
|
|
õ õ¢åÓã · ïÖ
|
|||
|
|
·
|
|||
|
|
»Àßòá$ôÖ
|
|||
|
|
üÔ×
|
|||
|
|
-L××
|
|||
|
|
ö ö¢å †ñ · á×
|
|||
|
|
·
|
|||
|
|
¼Àßòá$â×
|
|||
|
|
ü«Ø
|
|||
|
|
= ¥ ¾ ’ ¿ ¿ ¾ µ¾ °Ø
|
|||
|
|
�Ó ³Ø
|
|||
|
|
“ÓL¶Ø
|
|||
|
|
¢å ! üìØ
|
|||
|
|
9 ¥ Á ’  Á  µ¾ ñØ
|
|||
|
|
�Ó ôØ
|
|||
|
|
“ÓL÷Ø
|
|||
|
|
¢å ! üòÙ
|
|||
|
|
1 DýÙ
|
|||
|
|
Ã Ä ¥ Å ’ Æ Ä Å Æ ÍìŠç ŠÚ
|
|||
|
|
Íì�ç ¬�Ú
|
|||
|
|
1�ç L�Ú
|
|||
|
|
Šç ÃüšÝ
|
|||
|
|
' �ç à à à ›0 Çù A È‚ A ÉÓ0 A ÊÚ A âPº� A… Êç�ç âPº� A… ÇÈÉÊ Ø†Ú
|
|||
|
|
ÇÉ Â �Ú
|
|||
|
|
‹ò „ªÚ
|
|||
|
|
$ªÚ
|
|||
|
|
A à à ø ø Ð+ úù ûå A é9qeZï hŠç¤õÛ
|
|||
|
|
,õÛ
|
|||
|
|
A à à �Ñü�Ü
|
|||
|
|
"T�Ü
|
|||
|
|
A à à ‰‰ § ‹‰ ï íe¼îËè¿*�Ñs4šÝ
|
|||
|
|
A à à • • – ùÑ Fu\»Ÿ à — — â š‚ A ›¤ A œÚ A i†bªñüzŠç�ç üÆÝ
|
|||
|
|
( 8 ÷ ¥ Ì ’ Í Ì Í ÷ ’Ž ËÝ
|
|||
|
|
¤Ž ÎÝ
|
|||
|
|
¶ŽLÑÝ
|
|||
|
|
·æÎ "$ ü¦Þ
|
|||
|
|
$Þ
|
|||
|
|
ø ø·æ Ÿ� Ë ²Þ
|
|||
|
|
Ë
|
|||
|
|
Î 8Šç�ç$³Þ
|
|||
|
|
üìÞ
|
|||
|
|
X 8 ù ¥ Ð ’ Ñ Ð ù Ñ ’Ž øÞ
|
|||
|
|
¤Ž ûÞ
|
|||
|
|
¶ŽLþÞ
|
|||
|
|
ÌìŠç $²ß
|
|||
|
|
Ìì�ç $¿ß
|
|||
|
|
·æ ?A CE üÉß
|
|||
|
|
X 8 ú ¥ Ó ’ Ô Ó Ô ú ’Ž Õß
|
|||
|
|
¤Ž Øß
|
|||
|
|
¶ŽLÛß
|
|||
|
|
� Šç $�à
|
|||
|
|
� �ç $œà
|
|||
|
|
·æ =? AC ü§à
|
|||
|
|
1 8 û ¥ Ö ’ × × û Ö ’Ž ¬à
|
|||
|
|
¤Ž ¯à
|
|||
|
|
¶ŽL²à
|
|||
|
|
·æØ �" Ø &( *, ”�á
|
|||
|
|
$“á
|
|||
|
|
ü ü·æ Õ ˜á
|
|||
|
|
Õ
|
|||
|
|
Ø 8Šç�ç$�á
|
|||
|
|
üÿä
|
|||
|
|
5 8 ý ¥ Ú ’ Û ý Ú Û ’Ž „å
|
|||
|
|
¤Ž ‡å
|
|||
|
|
¶ŽLŠå
|
|||
|
|
·æÜÝÞ úM ûM ÿM Ý Þ 8: <> L»å
|
|||
|
|
$Àå
|
|||
|
|
Ù Ù Šçü€æ
|
|||
|
|
$ľ
|
|||
|
|
þ þ·æۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙŠç Ù ˆæ
|
|||
|
|
Ù
|
|||
|
|
Ý 8Šç�ç$�æ
|
|||
|
|
üžç
|
|||
|
|
-L¡ç
|
|||
|
|
ÿ ÿ·æ †ñ Ù «ç
|
|||
|
|
Ù
|
|||
|
|
Þ 8Šç�ç$¬ç
|
|||
|
|
üõç
|
|||
|
|
> 8 € ¥ à ’ á à á € ’Ž úç
|
|||
|
|
¤Ž ýç
|
|||
|
|
¶ŽL€è
|
|||
|
|
·æ ! ü·è
|
|||
|
|
: 8 � ¥ ã ’ ä ã ä � ’Ž ¼è
|
|||
|
|
¤Ž ¿è
|
|||
|
|
¶ŽLÂè
|
|||
|
|
·æ ! Ìžð
|
|||
|
|
\©ð
|
|||
|
|
¥ æ æ µ¾ µð
|
|||
|
|
Áè “¦h§b¢
|
|||
|
|
ž çè!# ¼¾ð
|
|||
|
|
,¾ð
|
|||
|
|
A å å Ôç¼Ûð
|
|||
|
|
<Ûð
|
|||
|
|
A å å ëÒ´‹õ
|
|||
|
|
¥ ê ê µ¾ �õ
|
|||
|
|
Áèë üÙõ
|
|||
|
|
F ãõ
|
|||
|
|
A ‚ ‚«á Áè é’ ì ì üõ
|
|||
|
|
é �Ó çõ
|
|||
|
|
“ÓLêõ
|
|||
|
|
|
|||
|
|
ëÀßòá‚,õõ
|
|||
|
|
§$�ö
|
|||
|
|
-/ ü«÷
|
|||
|
|
¥ î î µ¾ °÷
|
|||
|
|
Áèï Ù ï ¼ƒø
|
|||
|
|
,†ø
|
|||
|
|
ƒ ƒÁè Áè í Œø
|
|||
|
|
í
|
|||
|
|
ïÀß$�ø
|
|||
|
|
üˆù
|
|||
|
|
" ¥ ñ ñ µ¾ �ù
|
|||
|
|
Áèò ´ ò ¤âù
|
|||
|
|
<åù
|
|||
|
|
Áè ð ð
|
|||
|
|
òÀ߬Ûû
|
|||
|
|
Ôçô ü¨ü
|
|||
|
|
7 ²ü
|
|||
|
|
A „ „�Ñ Ôç ó ½ü
|
|||
|
|
ó
|
|||
|
|
ô ‚,¶ü
|
|||
|
|
§$Íü
|
|||
|
|
ü€€ # ¥ ö ö µ¾ …€ Áè÷ø úM ûM ø Lª€ $¯€ õ õ çàüÆ€ '$É€ … …Áèõ€ õ ΀ õ
|
|||
|
|
øÀß$Ó€ üß„ " Ôçúû úM ûM û Lˆ… $�… ù ù ü … ($£… † †Ôçۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙÔç úM ù ¨… ù
|
|||
|
|
û $… üØŒ 3 dêŒ Ã ý ¥ þ ’ ÿ ÿ ý þ ’Ž ûŒ ¤Ž þŒ ¶ŽL�� ÆŽü¬� ! ׎
|
|||
|
|
ü ü Ð3 €ù �‚ +xS
|
|||
|
|
;jà
|
|||
|
|
Êç�ç +xS
|
|||
|
|
;jà
|
|||
|
|
€�÷Œ ˆŠ ŒŽ ¤’� $–� ü ü Ÿ�£,°� ü ü È’üÒ� , 8 ‡ ¥ ƒ ’ „ ƒ ‡ „ ’Ž ×� ¤Ž Ú� ¶ŽLÝ� ü ü Ð3 €ù �‚ +xS
|
|||
|
|
;jà
|
|||
|
|
8Šç�ç… [] _a ü¶Ž c $ÄŽ ‰ ‰ªªñ«š ‚— † † ÌŽ ‚ Íìñ ÉŽ ˆ “"ñ ˆŠç ¬ƒ� ˆ ñ�¬˜" $”�
|
|||
|
|
… 8Šç�çñ$ÑŽ ± ÛŽ mo D• $™ ˆ‰Š‹tÛ »¨œª¬©ü LÞ ‡
|
|||
|
|
ˆ ü¡% »¨œø¬÷üî 4¯
|
|||
|
|
‰ ¶üÍ' »¨œ¤¬£üš DÛ
|
|||
|
|
Š äü¢3\° £Ì ¥ Œ Œ µ¾ ¼
|
|||
|
|
‹Àß addrÁ$¿ Ä ¤¤ <º ¾ ¨¶¼ÂÇò€�—¼áîû†› ²ËÚï�Ö
|
|||
|
|
í¶L 1 Ž � j ^ cõ4! � Ž ‘™ñ4) Ä Ž ’ k _ d™ñ Å Ž ’ k _ d›0D1 à Ž “Ð3d; ü Ž ”ˆ.\I Ÿ Ž •Ð+<V ø Ž –âD_ — Ž —Δx Ž ™ÑTŒ Ž š õ¶¼|˜ Ô Ž ›Y4¼ Ž œ×$Ô ` Ž žp,Ú ¿c Ž Ÿp Âc Ž Ÿ\\ó Åe Ž ¡Ž$€ še Ž ¢Ž e Ž ¢µl— òP Ž £ùÑ\¸ • Ž ¤ùÑ – Ž ¤í Ï ë Ž ¥ IndexÁ,ã Ù¢ Ž ¦¢o”B � §ìo\¤Y — §ÑpœÎo £ §öqŒë ¶ §Çr|ò‰ ¾ §TloVYGJõøçêÙÜ,pÎÑÁÄ®±¤®¤LÈ– ΉŒTælo]`Ì‹=̪.LÉ
|
|||
|
|
„Ø÷„‘ü›4G ü§B ? A hash map implemented with quadratic probing and SIMD lookup.Á êú üîK H The default hashing algorithm is currently [`foldhash`], though this isÁ üºL I subject to change at any point in the future. This hash function is veryÁ ü‡O L fast for all types of keys, but this algorithm will typically *not* protectÁ ü×$ ! against attacks such as HashDoS.Á üú ü€L I The hashing algorithm can be replaced on a per-`HashMap` basis using theÁ üÍP M [`default`], [`with_hasher`], and [`with_capacity_and_hasher`] methods. ManyÁ üžQ N alternative algorithms are available on crates.io, such as the [`fnv`] crate.Á ðú üôS P It is required that the keys implement the [`Eq`] and [`Hash`] traits, althoughÁ üÈN K this can frequently be achieved by using `#[derive(PartialEq, Eq, Hash)]`.Á ü— G D If you implement these yourself, it is important that the followingÁ œß property holds:Á ó ú \÷ ```textÁ üƒ
|
|||
|
|
$ ! k1 == k2 -> hash(k1) == hash(k2)Á <¨
|
|||
|
|
```Á °
|
|||
|
|
ú ü´
|
|||
|
|
F C In other words, if two keys are equal, their hashes must be equal.Á û
|
|||
|
|
ú üÿ
|
|||
|
|
M J It is a logic error for a key to be modified in such a way that the key'sÁ üÍ P M hash, as determined by the [`Hash`] trait, or its equality, as determined byÁ üž K H the [`Eq`] trait, changes while it is in the map. This is normally onlyÁ üê N K possible through [`Cell`], [`RefCell`], global state, I/O, or unsafe code.Á ¹
|
|||
|
|
ú ü½
|
|||
|
|
O L It is also a logic error for the [`Hash`] implementation of a key to panic.Á ü�N K This is generally only possible if the trait is implemented manually. If aÁ üÜP M panic does occur then the contents of the `HashMap` may become corrupted andÁ ü- * some items may be dropped from the table.Á Ûú tß # ExamplesÁ îú <òϽ Üú use hashbrown::HashMap;Á –ú üšD A // Type inference lets us omit an explicit type signature (whichÁ üß; 8 // would be `HashMap<String, String>` in this example).Á ü›* ' let mut book_reviews = HashMap::new();Á Æú ÌÊ // Review some books.Á Ää book_reviews.insert(Á üý5 2 "Adventures of Huckleberry Finn".to_string(),Á ü³( % "My favorite book.".to_string(),Á 4Ü );Á ÄãÔÆ üü* ' "Grimms' Fairy Tales".to_string(),Á ü§# "Masterpiece.".to_string(),Á 4ËæÇ ÄÒÔÆ üë* ' "Pride and Prejudice".to_string(),Á ü–& # "Very enjoyable.".to_string(),Á 4½æÇ ÄÄÔÆ üÝ8 5 "The Adventures of Sherlock Holmes".to_string(),Á ü–) & "Eye lyked it alot.".to_string(),Á 4ÀæÇ Çú üË // Check for a specific one.Á üìF C // When collections store owned values (String), they can still beÁ ü³' $ // queried using references (&str).Á üÛ6 3 if !book_reviews.contains_key("Les Misérables") {Á ü’H E println!("We've got {} reviews, but Les Misérables ain't one.",Á üÛ% " book_reviews.len());Á ,� }Á ‡ú ü‹I F // oops, this review has a lot of spelling mistakes, let's delete it.Á üÕ= : book_reviews.remove("The Adventures of Sherlock Holmes");Á “ú ü—4 1 // Look up the values associated with some keys.Á üÌM J let to_find = ["Pride and Prejudice", "Alice's Adventure in Wonderland"];Á Üš for &book in &to_find {Á ü¶& # match book_reviews.get(book) {Á üÝ= : Some(review) => println!("{}: {}", book, review),Á ü›7 4 None => println!("{} is unreviewed.", book)Á LÓ }Á ,ÝõÍ ãú üçH E // Look up the value for a key (will panic if the key is not found).Á ü° I F println!("Review for Jane: {}", book_reviews["Pride and Prejudice"]);Á ú ú üþ // Iterate over everything.Á üž ) & for (book, review) in &book_reviews {Á üÈ - * println!("{}: \"{}\"", book, review);Á ,ö õÍ <ü Ͻ „ ú üˆ K H `HashMap` also implements an [`Entry API`](#method.entry), which allowsÁ üÔ P M for more complex methods of getting, setting, updating and removing keys andÁ Œ¥ their values:Á · ú <» Ͻ Üà ¯Ä ß ú üã D A // type inference lets us omit an explicit type signature (whichÁ ü¨ 5 2 // would be `HashMap<&str, u8>` in this example).Á üÞ * ' let mut player_stats = HashMap::new();Á ‰!ú ü�!! fn random_stat_buff() -> u8 {Á ü¯!K H // could actually return some random value here - let's just returnÁ üû!# // some fixed value for nowÁ TŸ" 42Á ,ª"õÍ °"ú ü´"4 1 // insert a key only if it doesn't already existÁ üé"0 - player_stats.entry("health").or_insert(100);Á š#ú üž#I F // insert a key using a function that provides a new value only if itÁ äè# // doesn't already existÁ ü…$C @ player_stats.entry("defence").or_insert_with(random_stat_buff);Á É$ú üÍ$D A // update a key, guarding against the key possibly not being setÁ ü’%; 8 let stat = player_stats.entry("attack").or_insert(100);Á üÎ%
|
|||
|
|
*v = "b";Á ü‡ê@ = assert_eq!(map.get_key_value_mut(&1), Some((&1, &mut "b")));Á üÌê0 - assert_eq!(map.get_key_value_mut(&2), None);Á <�ëϽŒ¢ë ² ³ ²¥é ³óÛ Û¼Ý¼Þ¼© ß¼ à¼ÛἈ cSñŸ«‡zÙ ²Ýé ²ãé õ¢ Š Š ·ë õ ŒÝ ´ë žÝ$öë ¯Ýlýë
|
|||
|
|
‰ÝéãéééïéóÛ$¼ë¶ ÂëAC ü©ó` üñíE B Returns `true` if the map contains a value for the specified key.Á »îú üÃî?ìÝ ü‡ïC¶Þ ŒÏïƒß åïú üíï;«à üð@ðà òðú túðÿà �ñú <•ñϽ Ü¡ñ¯Ä Áñú üÉñ!ÜÐ ¼ïñ©à ü‹ò+ ( assert_eq!(map.contains_key(&1), true);Á ü»ò, ) assert_eq!(map.contains_key(&2), false);Á <ìòϽ d°ó ´ µ ´¥é µóÛ õ¢ Œ Œ Àó õ ŒÝ ½ó žÝ$ëó ¯Ýlòó
|
|||
|
|
‹ÝéãéééïéóÛ$Áó¶ ÇóAC ü·úi ü¿ôF C Returns a mutable reference to the value corresponding to the key.Á Šõú ü’õ?ìÝ üÖõC¶Þ Œžöƒß ´öú ü¼ö;«à üüö@ðà Á÷ú tÉ÷ÿà Ü÷ú <ä÷Ͻ Üð÷¯Ä �øú ü˜ø!ÜÐ ¼¾ø©à üÚø& # if let Some(x) = map.get_mut(&1) {Á Œ…ù *x = "b";Á ,›ùõÍ ì¥ù assert_eq!(map[&1], "b");Á Çùú üÏù& # assert_eq!(map.get_mut(&2), None);Á <úùϽ <¾ú ¶ · ¶¥é ·óÛ Û¼Ý¼Þ¼© ß¼ à¼ÛἈ cSñŸ«‡zÙ ¶ãé õ¢ Ž Ž Éú õ ŒÝ Æú žÝ$‚û ¯Ýl‰û
|
|||
|
|
�ÝéãéééïéóÛ$Îú¶ ÔúAC üöüplùü Ž ¸ ¹ ¸¥é ¹óÛ Û¼Ý¼Þ¼© ß¼ à¼ÛἈ cSñŸ«‡zÙ ¸³ì õ¢ � � Šý õ ŒÝ ‡ý žÝ$Èý ¯ÝlÏý
|
|||
|
|
�ÝéãéééïéóÛ$�ý¶ •ýAC üÄŽŒ üÀÿH E Attempts to get mutable references to `N` values in the map at once.Á �€ú ü•€] Z Returns an array of length `N` with the results of each query. For soundness, at most oneÁ ü÷€_ \ mutable reference will be returned to any value. `None` will be used if the key is missing.Á Û�ú dã�î± ô�ú üü�' $ Panics if any keys are overlapping.Á ¨‚ú t°‚ÿà Âú <˂Ͻ Üׂ¯Ä ÷‚ú üÿ‚' $ let mut libraries = HashMap::new();Á ü«ƒ; 8 libraries.insert("Bodleian Library".to_string(), 1602);Á üëƒ4 1 libraries.insert("Athenæum".to_string(), 1807);Á ü¤„J G libraries.insert("Herzogin-Anna-Amalia-Bibliothek".to_string(), 1691);Á üó„> ; libraries.insert("Library of Congress".to_string(), 1800);Á ¶…ú ü¾…) & // Get Athenæum and Bodleian LibraryÁ üì…5 2 let [Some(a), Some(b)] = libraries.get_many_mut([Á ¤¦† "Athenæum",Á Ü¿† "Bodleian Library",Á Ì߆ ]) else { panic!() };Á ý†ú ü…‡9 6 // Assert values of Athenæum and Library of CongressÁ üÇ& # let got = libraries.get_many_mut([Á ¤î‡®‡ ô‡ˆ "Library of Congress",Á <ªˆ ]);Á |¶ˆ assert_eq!(Á dʈ got,Á LÛˆ [Á äéˆ Some(&mut 1807),Á 䊉 Some(&mut 1800),Á T«‰ ],Á 4º‰æÇ Å‰ú ü͉" // Missing keys result in NoneÁ üô‰&æˆ ¤ŸŠ®‡ ü¸Š" "New York Public Library",Á <ߊ̉ |ëŠÝ‰ dÿŠö‰ L�‹ŒŠ äž‹ŸŠ „¿‹
|
|||
|
|
NoneÁ LÔ‹ ]Á 4â‹æÇ <í‹Ï½ ù‹ú œ�Œ ```should_panicÁ Ü™Œ¯Ä ¹Œú üÁŒ'Ùƒ üíŒ4Ñ„ ¦�ú ä®� // Duplicate keys panic!Á üÏ�&æˆ ¤ú�®‡ ¤“Ž®‡ <¬ŽÌ‰ <¸ŽÏ½dËŽ º » º¥é
|
|||
|
|
,Ü�tåŽ Î±æ Ï Êæ Ï èæ Ï Ï Î ÏÝéãéééïé ®³ ãé ¥é ‘� αæ Ð Êæ Ð èæ Ð Ð Î ÐÝéãéééïé ¶ˆ ³‰ ü�t œ Ò § Ó ¤ Ô ’ Õ Ò Ô Õ Ó çñ ²� øñ µ� ‰ò ¸� šò »� ɯæ� Ú¯$ë� ™ãé ø� øø\ƒ� «òL—�¥é Y[ ]_ ac eg ü§�b œ × § Ø ¤ Ù ’ Ú Ú Ù × Ø çñ ¬� øñ ¯� ‰ò ²� šò µ� ¿cÝé ,ã� ¿cãé ,ñ� «òLÿ�¥éÛ Àc Û Z\ ^` bd fh ü�‘8 “‘ Ô Õ Ö Ô¥é Õ c c ˆ ¢cµ
|
|||
|
|
` £cÔ ` àB¤GS
|
|||
|
|
Öû® Ö —‘ Ö
|
|||
|
|
ÛÝéãéééïé$˜‘± ž‘üˆ’b œ Ý § Þ ¤ ß ’ à ß Ý Þ à çñ �’ øñ �’ ‰ò “’ šò –’ ³ éé <Æ’ ³ ïé <Ö’ «òLà’¥éá ´ á Z\ ^` bd fh ¤ÿ— üñ’b _ Creates an empty `HashMap<K, V, S, A>`, with the `Default` value for the hasher and allocator.Á Ø“ú tà“ÿà ó“ú <û“Ͻ ܇”¯Ä ü§”0 - use std::collections::hash_map::RandomState;Á Ü”ú üä”L I // You can specify all types of HashMap, including hasher and allocator.Á üµ•5 2 // Created map is empty and don't allocate memoryÁ üï•7 4 let map: HashMap<u32, String> = Default::default();Á ü«–"�� üÒ–D A let map: HashMap<u32, String, RandomState> = HashMap::default();Á ü›—"�� <—Ͻ <‚˜ ¥é Ü Ü
|
|||
|
|
áÝéãéééïéü䘙 8 × œ ã ¢ ä § å ¤ æ ’ ç ã ç ä æ × å Íý é˜ Îìƒë ì˜ Íììê ï˜ Íìòê ò˜ Íìøê õ˜ ™æê §™ šeæê $¬™ šeƒë $¹™ ƒëæê lÀ™ Åeòê \ß™ 1øê Ló™®êèé Û¢ Ü¢ é ÍÏ ÈÊ ÃÅ ¾À ¹» \„š4‰š â â ìêôð� üššG D Returns a reference to the value corresponding to the supplied key.Á æšú dîšî± ÿšú ü‡›6 3 Panics if the key is not present in the `HashMap`.Á ›ú tÊ›ÿà ݛú <å›Ï½ Üñ›¯Ä ‘œú ü™œA > let map: HashMap<_, _> = [("a", "One"), ("b", "Two")].into();Á ßœú üçœ! assert_eq!(map[&"a"], "One");Á ü��! assert_eq!(map[&"b"], "Two");Á <³�Ͻ ,ó�€ Ø Ù Ø®ê Ùƒë Øìê â ù� â
|
|||
|
|
é 8æêƒëìêòêøê$ú�ëR €žü¼ŸŒ »íÔŸŸü™Ÿ" œ ë § ì ’ í Ÿ î ì î í ë çñ ÁŸ øñ ÄŸ ¤Ž ÇŸ Ÿ tÊŸ ɯ¢ Ú¯$§ ³ �ç <´ ¶ŽL¾ ‘ëð ë ð ac eg ik g П ü¹¢! tÏ ÿà â ú <ê Ͻ Üö ¯Ä –¡ú üž¡/ , let map1 = HashMap::from([(1, 2), (3, 4)]);Á üÒ¡6 3 let map2: HashMap<_, _> = [(1, 2), (3, 4)].into();Á Ü�¢ assert_eq!(map1, map2);Á <¢Ï½$¼¢ ²ì‘ë ê ê
|
|||
|
|
ðÝéãé�ç Ÿ arrÁ Á¢Ì…ª üˆ£C @ An iterator over the entries of a `HashMap` in arbitrary order.Á üÌ£2‹å ÿ£ú üƒ¤K H This `struct` is created by the [`iter`] method on [`HashMap`]. See itsÁ ÜϤ documentation for more.Á ë¤ú üï¤- * [`iter`]: struct.HashMap.html#method.iterÁ ü�¥$ ! [`HashMap`]: struct.HashMap.htmlÁ Â¥ú tÆ¥ÿà եú <٥Ͻ Üá¥¯Ä ý¥ú ü�¦C @ let map: HashMap<_, _> = [(1, "a"), (2, "b"), (3, "c")].into();Á Ŧú ôɦ let mut iter = map.iter();Á üè¦> ; let mut vec = vec![iter.next(), iter.next(), iter.next()];Á §§ú ü«§DÒè üð§@¡é ı¨ðÔ üʨL I assert_eq!(vec, [Some((&1, &"a")), Some((&2, &"b")), Some((&3, &"c"))]);Á —©ú Ü›© // It is fused iteratorÁ ü·©" assert_eq!(iter.next(), None);Á üÚ©"Ó§ <ý©Ï½ $�ª Ã ó œ ô § õ õ ó ô Íý ™ª Þý œª æê ÃüÁª# ‹í úø 5G®Ï&€u ö÷•ªOQ SU ´¥ª,¥ªŽ ò ò ø ø Ð+ úù ûå A é9qeZï h¦ÿ¦4ÁªŽ ò ò • • – ùÑ Fu\»Ÿþþü «# 8 Ú œ ù § ú ù Ú ú Íý ¥« Þý ¨«Èìû Ù û !# ¼û« ,þ« Û ÛÈì Èì ø „¬ ø
|
|||
|
|
û 8æê‹í$…¬üÿ¬6 8 Ü œ ý § þ
|
|||
|
|
` £cÔ ` àB¤GS
|
|||
|
|
ßû® ü Ã ü
|
|||
|
|
ÿ 8æê‹í$ı Êä±µ ü¶®J G A mutable iterator over the entries of a `HashMap` in arbitrary order.Á ü�¯6˜í ¸¯ú ü¼¯O L This `struct` is created by the [`iter_mut`] method on [`HashMap`]. See itsÁ ÜŒ°Ú¢ ¨°ú ü¬°5 2 [`iter_mut`]: struct.HashMap.html#method.iter_mutÁ üâ°$Å£ ‡±ú t‹±ÿà š±ú <ž±Ï½ ܦ±¯Ä ±ú üƱS P let mut map: HashMap<_, _> = [(1, "One".to_owned()), (2, "Two".into())].into();Á š²ú üž²" let mut iter = map.iter_mut();Á üÁ²9 6 iter.next().map(|(_, v)| v.push_str(" Mississippi"));Á üû²9³ µ³ú ܹ³§ üÕ³"Ó§ üø³"Ó§ ›´ú üŸ´D A assert_eq!(map.get(&1).unwrap(), &"One Mississippi".to_owned());Á üä´D A assert_eq!(map.get(&2).unwrap(), &"Two Mississippi".to_owned());Á <©µÏ½ <¼µ à � œ ‚ § ƒ � ‚ ƒ Íý ȵ Þý ˵ â© üž¶' ó©
|
|||
|
|
ªù P…sôhæþë „…ĵAC EG ´Ôµ,ÔµŽ € € ת g4ž¶Ž € € • • – ùÑ Fu\»Ÿ€ÿ Ëíü‚¸8 8 à œ ‡ § ˆ ‡ ˆ à Íý Ž¸ Þý —¸ Ììæê $‘¸ Ìì‹í $š¸¤í 68 :< 俸 8 á œ Š § ‹ ‹ á Š Íý ĸ Þý Ǹ¤íŒ üÖ¹+ $ä¹ â â¤í ò ò éD öÔ Ž ÷Ú Ž 5G®Ï&€u âæê‹í ‰ é¹ ‰
|
|||
|
|
Œ 8æê‹í$ê¹üÃ0 üîºJ G An owning iterator over the entries of a `HashMap` in arbitrary order.Á ü¹»* ' The iterator element type is `(K, V)`.Á ä»ú üè»G D This `struct` is created by the [`into_iter`] method on [`HashMap`]Á ü°¼M J (provided by the [`IntoIterator`] trait). See its documentation for more.Á üþ¼5 2 The map cannot be used after calling that method.Á ´½ú ü¸½7 4 [`into_iter`]: struct.HashMap.html#method.into_iterÁ üð½$Å£ ü•¾Q N [`IntoIterator`]: https://doc.rust-lang.org/core/iter/trait.IntoIterator.htmlÁ ç¾ú të¾ÿà ú¾ú <þ¾Ï½ ܆¿¯Ä ¢¿ú ü¦¿CŤ ê¿ú üî¿# let mut iter = map.into_iter();Á ü’À>È¥ ÑÀú üÕÀH E // The `IntoIter` iterator produces items in arbitrary order, so theÁ üžÁ@¡é ÄßÁðÔ üøÁF C assert_eq!(vec, [Some((1, "a")), Some((2, "b")), Some((3, "c"))]);Á ¿Âú Üç üßÂ"Ó§ ü‚Ã"Ó§ <¥ÃϽ D¸Ã œ Ž § � ’ � � Ž � çñ Áà øñ Äà ¤Ž¬Çà ¶ŽLÊÚú õsY4è±ô ‘:< >@ B Çà ‹ò ìäÃ,äÃŽ � � Ÿ Ÿ ˆ. ¢ù A £³. A ¤Ú A Ñ\ÈÝß^q³ì�çü†Ä* œ “ § ” ’ • ” • “ çñ ‹Ä øñ ŽÄ ¤Ž ‘Ä ¶ŽL”Äšú– ') +- /1 ü«Å+ $¹Å ã ãšú ò ò éD öÔ Ž ÷Ú Ž 5G®Ï&€u ãÝéãé ’ ¾Å ’
|
|||
|
|
–Ýéãé�ç$¿ÅüçÍ0 üÂÆG D An owning iterator over the keys of a `HashMap` in arbitrary order.Á üŠÇ%࣠°Çú ü´ÇH E This `struct` is created by the [`into_keys`] method on [`HashMap`].Á üýÇ# See its documentation for more.Á ü¡È5„¾ ×Èú üÛÈ7 4 [`into_keys`]: struct.HashMap.html#method.into_keysÁ ü“É$Å£ ¸Éú t¼Éÿà ËÉú <ÏÉϽ Ü×É¯Ä óÉú ü÷ÉCŤ »Êú ü¿Ê# let mut keys = map.into_keys();Á üãÊ> ; let mut vec = vec![keys.next(), keys.next(), keys.next()];Á ¢Ëú ü¦ËGö¥ üîË?§Ô Ä®ÌðÔ üÇÌ1 . assert_eq!(vec, [Some(1), Some(2), Some(3)]);Á ùÌú Üý̧ ü™Í" assert_eq!(keys.next(), None);Á ü¼Í"äÍ <ßÍϽ DòÍ œ ˜ § ™ ’ š ˜ ™ š çñ ûÍ øñ þÍ ¤Ž¬�Î ¶ŽL„Îòí £r7?&¿ãÀ ›:< >@ B �Î ‹ò ÄžÎ,žÎŽ — — šúü»Î6 œ � § ž ’ Ÿ � Ÿ ž çñ ÀÎ øñ ÃÎ ¤Ž ÆÎ ¶ŽLÉÎòí ´ /1 35 79 ¤©Ï <¬Ï òí œ œ
|
|||
|
|
Ýéãé�çüˆÐ7 œ ¢ § £ ’ ¤ ¤ ¢ £ çñ �Ð øñ �Ð ¤Ž “Ð ¶ŽL–Ðòí¥¦¨© úM ûM ÿM óN ¨ ¦ © LN PR TV LÆÐ$ËÐ ¡ ¡ ÝéüèÐ $ëÐ ä äòíۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙÝé ¡ ðÐ ¡
|
|||
|
|
¦Ýéãé�ç$õÐD¨Ñ ¦±æ § Êæ § èæ § § ¦ §Ýéãé�ç ³ìÝé üÌÑ-LÏÑ å åòí †ñ ¡ ÙÑ ¡
|
|||
|
|
¨Ýéãé�ç$ÚÑü³Òp$¶Ò ò퓨�Î×
|
|||
|
|
` £cÔ ` àB¤GS
|
|||
|
|
éû® ¶ �Ö ¶
|
|||
|
|
ºÝéãé�ç$‘Ö± —ÖD†× º±æ » Êæ » èæ » » º »Ýéãé�ç ¯ˆ ®³ üõÞ2 ü²×I F An owning iterator over the values of a `HashMap` in arbitrary order.Á üü×%÷¨ ¢Øú ü¦ØJ G This `struct` is created by the [`into_values`] method on [`HashMap`].Á üñØU R See its documentation for more. The map cannot be used after calling that method.Á ÇÙú üËÙ; 8 [`into_values`]: struct.HashMap.html#method.into_valuesÁ ü‡Ú$Å£ ¬Úú t°Úÿà ¿Úú <ÃÚϽ ÜËÚ¯Ä çÚú üëÚCŤ ¯Ûú ü³Û' $ let mut values = map.into_values();Á üÛÛD A let mut vec = vec![values.next(), values.next(), values.next()];Á Üú ü¤ÜGŽ« üìÜEૠIJÝðÔ üËÝ7 4 assert_eq!(vec, [Some("a"), Some("b"), Some("c")]);Á ƒÞú ܇ާ ü£Þ$ ! assert_eq!(values.next(), None);Á üÈÞ$Êæ <íÞϽ T€ß œ ½ § ¾ ’ ¿ ¿ ½ ¾ çñ ‹ß øñ Žß ¤Ž¬‘ß ¶ŽL”ßßî ‰eR‰sN¯o À:< >@ B ‘ß ‹ò Ä®ß,®ßŽ ¼ ¼ šúüËß8 œ  § à ’ Ä Ã Ä Â çñ Ðß øñ Óß ¤Ž Öß ¶ŽLÙßßîÅ ´ Å /1 35 79 ¤»à <¾à ßî Á Á
|
|||
|
|
ÅÝéãé�çüšá9 œ Ç § È ’ É Ç È É çñ Ÿá øñ ¢á ¤Ž ¥á ¶ŽL¨áßîÊËÍÎ úM ûM ÿM óN Ë Î Í LN PR TV LÚá$ßá Æ Æ ãéüüá $ÿá ê êßîÊÓ Æ „â Æ
|
|||
|
|
ËÝéãé�ç$‰âD¼â ˱æ Ì Êæ Ì èæ Ì Ì Ë ÌÝéãé�ç ¯Ö ãé üàâ-Lãâ ë ëßî †ñ Æ íâ Æ
|
|||
|
|
ÍÝéãé�ç$îâüÇãp$Êã ßîÎ× ¨�Î× Æ“ Ï — Ð Ð Ï Æ ‰Ø Ïã Õ� Òã Íìßî ,‹ä “"¨�Î× ßî úM Ì�ä ¨�×ð ˜" Î× µä
|
|||
|
|
ÎÝéãé�çÎ× ¨�$Õãèù$Ûã± èã�� ‘“ lÜä αæ Ñ Êæ Ñ èæ Ñ Ñ Î ÑÝéãé�çÎ× ¨�§Ú ¹Ú üþäB œ Ó § Ô ’ Õ Ó Ô Õ çñ ƒå øñ †å ¤Ž ‰å ¶ŽLŒåßîÖ ÄM Ö /1 35 79 ´Õå Øå ì ìßî Ò Üå Ò
|
|||
|
|
ÖÝéãé�ç$Ýåü�æ> œ Ø § Ù ’ Ú Ø Ú Ù çñ •æ øñ ˜æ ¤Ž ›æ ¶ŽLžæßî $& (* ,. üÓæB œ Ü § Ý ’ Þ Þ Ü Ý çñ Øæ øñ Ûæ ¤Ž åæ ŸŒ ,Þæ ¶ŽLèæßîß Àc ß 8: <> @B üœç8 Ÿç í î ï íßî î c c ˆ ¢cµ
|
|||
|
|
` £cÔ ` àB¤GS
|
|||
|
|
ïû® Û £ç Û
|
|||
|
|
ßÝéãé�ç$¤ç± ªçD™è ß±æ à Êæ à èæ à à ß àÝéãé�ç ¯ˆ ¶ˆ Ìœï üÅè@ = An iterator over the keys of a `HashMap` in arbitrary order.Á ü†é)×Ï °éú ü´éK H This `struct` is created by the [`keys`] method on [`HashMap`]. See itsÁ Ü€êÚ¢ œêú ü ê- * [`keys`]: struct.HashMap.html#method.keysÁ üÎê$Å£ óêú t÷êÿà †ëú <ŠëϽ Ü’ë¯Ä ®ëú ü²ëCŤ öëú ôúë let mut keys = map.keys();Á ü™ì>‹Ì Øìú üÜìCÙÓ ü í?§Ô ÄàíðÔ üùí4 1 assert_eq!(vec, [Some(&1), Some(&2), Some(&3)]);Á ®îú Ü²î§ üÎî"äÍ üñî"äÍ <”ïϽ $§ï à ⠜ ã § ä â ã ä Íý °ï Þý ³ï â© –* ó© �*’û íýW*¸¡ÀÑ å¬ï=? AC ¬¼ï,¼ïŽ á á ºøü�ð# 8 ð œ ç § è ð è ç Íý ’ð Þý •ðÌïé Ù é !# ¼èð ,ëð ñ ñÌï Ìï æ ñð æ
|
|||
|
|
é 8æê‹í$òðüËñ/ 8 ò œ ë § ì ò ë ì Íý Ðñ Þý Úñ €® ,ÓñÌïí Àc í &( *, ü�ò8 „ò ó ô õ óÌï ô c c ˆ ¢cµ
|
|||
|
|
` £cÔ ` àB¤GS
|
|||
|
|
õû® ê ˆò ê
|
|||
|
|
í 8æê‹í$‰ò± �òÜôù üûòB ? An iterator over the values of a `HashMap` in arbitrary order.Á ü¾ó)Ø× èóú üìóM J This `struct` is created by the [`values`] method on [`HashMap`]. See itsÁ ܺôÚ¢ Öôú üÚô1 . [`values`]: struct.HashMap.html#method.valuesÁ üŒõ$Å£ ±õú tµõÿà Äõú <ÈõϽ ÜÐõ¯Ä ìõú üðõCŤ ´öú ü¸ö" let mut values = map.values();Á üÛöDåä ÷ú ü¤÷GìÚ üì÷A¾Û Ä®øðÔ üÇø: 7 assert_eq!(vec, [Some(&"a"), Some(&"b"), Some(&"c")]);Á ‚ùú ܆ù§ ü¢ù$Êæ üÇù$Êæ <ìùϽ 4ÿù Ã ï œ ð § ñ ï ñ ð Íý Šú Þý �ú â©
|
|||
|
|
0 ó© 0öû h ±ULö� ò†ú=? AC ¬–ú,–úŽ î î ºøüçú% 8 ö œ ô § õ õ ô ö Íý ìú Þý ïú™ðö Ù ö !# ¼Äû ,Çû ÷ ÷™ð ™ð ó Íû ó
|
|||
|
|
ö 8æê‹í$Îûü©ü1 8 ø œ ø § ù ù ø ø Íý ®ü Þý ±ü ‘® ,´ü™ðú Àc ú &( *, üáü8 äü ù ú û ù™ð ú c c ˆ ¢cµ
|
|||
|
|
` £cÔ ` àB¤GS
|
|||
|
|
ûû® ÷ èü ÷
|
|||
|
|
ú 8æê‹í$éü± ïüüÿ„1 üÛýD A A draining iterator over the entries of a `HashMap` in arbitraryÁ ü þ1 . order. The iterator element type is `(K, V)`.Á Òþú üÖþL I This `struct` is created by the [`drain`] method on [`HashMap`]. See itsÁ Ü£ÿÚ¢ ¿ÿú üÃÿ/ , [`drain`]: struct.HashMap.html#method.drainÁ üóÿ$Å£ ˜€ú tœ€ÿà «€ú <¯€Ï½ Ü·€¯Ä Ó€ú ü×€G D let mut map: HashMap<_, _> = [(1, "a"), (2, "b"), (3, "c")].into();Á Ÿ�ú ü£�% " let mut drain_iter = map.drain();Á üÉ�P M let mut vec = vec![drain_iter.next(), drain_iter.next(), drain_iter.next()];Á š‚ú üž‚E B // The `Drain` iterator produces items in arbitrary order, so theÁ üä‚@¡é Ä¥ƒðÔ ü¾ƒF¥Â …„ú ܉„§ ü¥„( % assert_eq!(drain_iter.next(), None);Á ü΄(Æ”
|
|||
|
|
<÷„Ͻ ,Š… à ü œ ý § þ ’ ÿ þ ÿ ý ü Íý ”… Þý —… šò¬š… «òL�… â© 0D ó© 8D ïé à GD û û ‹M €Ô Ž á6´ïÖ6 Ãæê‹íïé á6´ïÖ6 €�…œž ¢ ¤ š… ‹ò ô·…,·…Ž û û à à ›0 Çù A È‚ A ÉÓ0 A ÊÚ A âPº� A… æÿïéüÚ…+ 8 ü œ ‚ § ƒ ’ „ ƒ ü ‚ „ Íý ß… Þý â… šò å… «òLè…õý… ') +- /1 ü€‡+ $Ž‡ ý ýõý ò ò éD öÔ Ž ÷Ú Ž 5G®Ï&€u ýæê‹í � “‡ �
|
|||
|
|
… 8æê‹íïé$”‡üß�8 ü—ˆU R A draining iterator over entries of a `HashMap` which don't satisfy the predicateÁ üíˆN K `f(&k, &mut v)` in arbitrary order. The iterator element type is `(K, V)`.Á ¼‰ú üÀ‰Q N This `struct` is created by the [`extract_if`] method on [`HashMap`]. See itsÁ Ü’ŠÚ¢ ®Šú ü²Š9 6 [`extract_if`]: struct.HashMap.html#method.extract_ifÁ üìŠ$Å£ ‘‹ú t•‹ÿà ¤‹ú <¨‹Ï½ Ü°‹¯Ä Ì‹ú üЋL I let mut map: HashMap<i32, &str> = [(1, "a"), (2, "b"), (3, "c")].into();Á �Œú ü¡Œ< 9 let mut extract_if = map.extract_if(|k, _v| k % 2 != 0);Á üÞŒ= : let mut vec = vec![extract_if.next(), extract_if.next()];Á œ�ú ü �I F // The `ExtractIf` iterator produces items in arbitrary order, so theÁ üê�@¡é Ä«ŽðÔ üÄŽ5 2 assert_eq!(vec, [Some((1, "a")),Some((3, "c"))]);Á úŽú ÜþŽ§ üš�( % assert_eq!(extract_if.next(), None);Á üÃ�(¢
|
|||
|
|
¬ì� drop(extract_if);Á ‚�ú ì†�†Ÿ <¤�Ͻ .ü¬�2 "Iterators are lazy unless consumedÁ Lê� à ‡ œ ˆ § ‰ — Š ’ ‹ ‡ ˆ Š ‹ ‰ Íý ø� Þý û� î« þ� Íì³ñ ¬�‘ 1³ñ L„‘ â© æ> ó© î> ³ñ à ý> † † åM Œ± Ž �Ô Ž —!]±OÁ Ãæê‹íñ³ñ —!]±OÁ Œ�ô�ÇÉ ËÍ ÏÑ Ê �‘ ‹ò $ž‘ ž‘Ž † † ñü¨‘",¨‘Ž † † ü ü Ð3 €ù �‚ +xS
|
|||
|
|
;jà
|
|||
|
|
æÿ³ñüÏ‘q 8 € œ � § � — ‘ ’ ’ ’ � € � ‘ þ ÿ ñ þæê ÿ‹í˜" $©’ Þý ב î« Ú‘ Ó¥
|
|||
|
|
Ý‘ þ ÿ “"ñ¢©
|
|||
|
|
Ì”’ Íý Ô‘ å¥
|
|||
|
|
L¶’æð“”– úM ûM ÿM – ” /1 vx z| ~€ LÇ’$Ì’ Ž Ž ¦ÿü‘“( $”“ � �æðۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙæð úM Ž ™“ Ž
|
|||
|
|
” 8æê‹íñ³ñ$ž“ÌÔ“ ”±æ • Êæ • èæ • • ” • æê‹íñ³ñ ¦ÿ ñü—”-Lš” ‚ ‚æð †ñ Ž ¤” Ž
|
|||
|
|
– 8æê‹íñ³ñ$¥”üû”Y 8 … œ ˜ § ™ — š ™ š … ˜ ƒ „ ñ ƒæê „‹í˜" $Е Þý ƒ• î« †• ƒ „ “"ñœ¯
|
|||
|
|
Ì»• Íý €•Àñ GI KM ôÒœ üÙ•I F A mutable iterator over the values of a `HashMap` in arbitrary order.Á ü£–-ßÞ Ñ–ú üÕ–Q N This `struct` is created by the [`values_mut`] method on [`HashMap`]. See itsÁ ܧ—Ú¢ ×ú üÇ—9 6 [`values_mut`]: struct.HashMap.html#method.values_mutÁ ü�˜$Å£ ¦˜ú tª˜ÿà ¹˜ú <½˜Ï½ ÜŘ¯Ä á˜ú üå˜Sª² ¹™ú ü½™& # let mut values = map.values_mut();Á üä™6 3 values.next().map(|v| v.push_str(" Mississippi"));Á ü›š6�³
|
|||
|
|
Òšú ÜÖš§ üòš$Êæ ü—›$Êæ ¼›ú üÀ›DÛ´ ü…œDªµ <ʜϽ LÝœ à œ œ � § ž œ � ž Íý ëœ Þý îœ â© K? ó© R?‘ý ½�F<ˆÑ Ò Ÿçœ=? AC Ä÷œ,÷œŽ › › ªùüͨ' ü”�P M A view into a single entry in a map, which may either be vacant or occupied.Á å�ú üé�H E This `enum` is constructed from the [`entry`] method on [`HashMap`].Á ²žú ü¶ž$Å£ üÛž/ , [`entry`]: struct.HashMap.html#method.entryÁ ‹Ÿú t�Ÿÿà žŸú <¢ŸÏ½ üªŸ= : use hashbrown::hash_map::{Entry, HashMap, OccupiedEntry};Á èŸú üìŸ!ÜÐ üŽ 2 / map.extend([("a", 10), ("b", 20), ("c", 30)]);Á ìÁ êÑ ß ú äã // Existing key (insert)Á ü€¡/ , let entry: Entry<_, _, _> = map.entry("a");Á ü°¡9 6 let _raw_o: OccupiedEntry<_, _, _> = entry.insert(1);Á ìê¡êÑ üˆ¢ // Nonexistent key (insert)Á 쨢 map.entry("d").insert(4);Á Æ¢ú üÊ¢ // Existing key (or_insert)Á üê¢( % let v = map.entry("b").or_insert(2);Á ü“£, ) assert_eq!(std::mem::replace(v, 2), 20);Á üÀ£" // Nonexistent key (or_insert)Á ü㣠map.entry("e").or_insert(5);Á „¤ú üˆ¤$ ! // Existing key (or_insert_with)Á ü¤0 - let v = map.entry("c").or_insert_with(|| 3);Á üÞ¤, ) assert_eq!(std::mem::replace(v, 3), 30);Á ü‹¥' $ // Nonexistent key (or_insert_with)Á ü³¥( % map.entry("f").or_insert_with(|| 6);Á Ü¥ú üà¥' $ println!("Our HashMap: {:?}", map);Á ˆ¦ú üŒ¦F C let mut vec: Vec<_> = map.iter().map(|(&k, &v)| (k, v)).collect();Á üÓ¦DÒè ü˜§@¡é ÄÙ§ðÔ üò§R O assert_eq!(vec, [("a", 1), ("b", 2), ("c", 3), ("d", 4), ("e", 5), ("f", 6)]);Á <ŨϽ ,Ö¨ à ¡ œ ¢ § £ ¤ ¤ ’ ¥ ¢ ¤ ¥ £ ¡ Íý ਠÞý 㨠Íì“ó æ¨ Ó¥
|
|||
|
|
Té¨ å¥
|
|||
|
|
L‚© â© ü‚»" ó©
|
|||
|
|
“ó Ã …¦
|
|||
|
|
¦ §óO ¨ˆ © ª�P «ˆ Û-k<׌E Ãæê‹í“ó³ñ Û-k<׌E¦§©ª § ¨ ² ² ØP ¸§ Ž ¹�Q Ž º‚ Ž ¥±£PUPÄã Ãæê‹í“ó³ñ€Å
|
|||
|
|
ª « Ë Ë ¨R ѧ Ž ÒëR Ž Ó‚ Ž Jò…ôËÙË Ãæê‹í“ó³ñ€Å
|
|||
|
|
ܨ«® ±´ ®± ´ é¨ ‹ò k¶ ´“© An occupied entry.Á ®©ú t¶©ÿà ɩú <ѩϽ üÝ©. + use hashbrown::hash_map::{Entry, HashMap};Á ü�ªA > let mut map: HashMap<_, _> = [("a", 100), ("b", 200)].into();Á Öªú ÔÞª match map.entry("a") {Á üýª+ ( Entry::Vacant(_) => unreachable!(),Á ü«! Entry::Occupied(_) => { }Á ,Ó«õÍ <ݫϽ k¶
|
|||
|
|
§ Ãæê‹í“ó³ñk¶k¶ �Æ
|
|||
|
|
ہ
|
|||
|
|
¸Ë
|
|||
|
|
ìò« �Æ
|
|||
|
|
v· œ—¬ A vacant entry.Á ¯¬ú t·¬ÿà ʬú <ҬϽ üÞ¬.üÇ
|
|||
|
|
ü‘5¸� Ëú ÔÓ�É
|
|||
|
|
üò- * Entry::Occupied(_) => unreachable!(),Á ü¤® Entry::Vacant(_) => { }Á ,È®õÍ <ҮϽ v·
|
|||
|
|
ª Ãæê‹í“ó³ñv·v· îÆ
|
|||
|
|
ہ
|
|||
|
|
ÊÎ
|
|||
|
|
Üå® îÆ
|
|||
|
|
ü†¯I 8 † œ § ® ¤ ¯ ’ ° † ¯ ® ° Íý ‹¯ Þý •¯ ºÄ
|
|||
|
|
Ÿ¯ Ó¥
|
|||
|
|
¢¯ €® ,Ž¯ ‘® ,˜¯ å¥
|
|||
|
|
L¥¯¾ò± Àc ± JL NP RT VX üÖ¯8 Ù¯ ‡ ˆ ‰ ‡¾ò ˆ c c ˆ ¢cµ
|
|||
|
|
` £cÔ ` àB¤GS
|
|||
|
|
‰û® ¬ ݯ ¬
|
|||
|
|
± 8æê‹í“ó³ñ$Þ¯± ä¯ü�ºQ üر3 0 A view into an occupied entry in a [`HashMap`].Á üŒ²7 4 It is part of the [`Entry`] and [`EntryRef`] enums.Á IJú tȲÿà ײú <۲Ͻ üã²=Ö¸
|
|||
|
|
¡³ú ü¥³!ÜÐ üdz2º¹
|
|||
|
|
ú³ú üþ³F C let _entry_o: OccupiedEntry<_, _, _> = map.entry("a").insert(100);Á ìÅ´êÑ ã´ú üç´' $ // Existing key (insert and update)Á Ô�µ�É
|
|||
|
|
üªµ+²É
|
|||
|
|
üÖµ& # Entry::Occupied(mut view) => {Á üýµ) & assert_eq!(view.get(), &100);Á ü§¶# let v = view.get_mut();Á ¬Ë¶ *v *= 10;Á üá¶0 - assert_eq!(view.insert(1111), 1000);Á L’·¦Ò ,œ·õÍ ¢·ú ü¦· assert_eq!(map[&"a"], 1111);Á ìÇ·êÑ å·ú Ôé· // Existing key (take)Á Ô„¸ match map.entry("c") {Á üŸ¸+²É
|
|||
|
|
ü˸" Entry::Occupied(view) => {Á üî¸7 4 assert_eq!(view.remove_entry(), ("c", 30));Á L¦¹¦Ò ,°¹õÍ ü¶¹$ ! assert_eq!(map.get(&"c"), None);Á ìÛ¹ assert_eq!(map.len(), 2);Á <ù¹Ï½ lŒº à ³ œ ´ § µ ¤ ¶ ’ · µ ³ ´ ¶ · Íý žº Þý ¡º ºÄ
|
|||
|
|
´¤º Ó¥
|
|||
|
|
¬¼º å¥
|
|||
|
|
L¿º â© ö ó© ý îÄ
|
|||
|
|
…¦
|
|||
|
|
�Æ
|
|||
|
|
¥±£PUPÄã ¸¹ºšºjl np r ¤º Ñë | ¼º ‹ò LÙº$ÙºŽ ² ² ¤èº$躎 ² ² � � õ ƒµ A jùÜfB‚‹¨¦ÿÛ ,‚»Ž ² ² ’øü©»„ 8 Š œ ¼ § ½ ¤ ¾ ’ ¿ Š ¾ ¼ ½ ¿ Íý µ» Þý ¸» ºÄ
|
|||
|
|
»» Ó¥
|
|||
|
|
¾» ѹ $õ» ã¹ $‚¼ Ìì“ó $�¼ Ìì³ñ $œ¼ å¥
|
|||
|
|
L£¼¥ó ce gi km oq ü²¼„ 8 ‹ œ Á §  ¤ à ’ Ä Â Ã ‹ Á Ä Íý ¾¼ Þý Á¼ ºÄ
|
|||
|
|
ļ ӥ
|
|||
|
|
Ǽ � æê $þ¼ � ‹í $‹½ � “ó $˜½ � ³ñ $¥½ å¥
|
|||
|
|
L¬½¥ó qs uw y{ } ü¼½Q 8 Œ œ Æ § Ç ¤ È ’ É Œ É Ç È Æ Íý Á½ Þý ˽ ºÄ
|
|||
|
|
Õ½ Ó¥
|
|||
|
|
ؽ €® ,Ľ ‘® ,ν å¥
|
|||
|
|
LÛ½¥óÊ Àc Ê JL NP RT VX ü”¾8 —¾ � Ž � �¥ó Ž c c ˆ ¢cµ
|
|||
|
|
` £cÔ ` àB¤GS
|
|||
|
|
�û® Å ›¾ Å
|
|||
|
|
Ê 8æê‹í“ó³ñ$œ¾± ¢¾ü”ÆO üä¿. + A view into a vacant entry in a `HashMap`.Á ü“À% " It is part of the [`Entry`] enum.Á ¹Àú ô½À [`Entry`]: enum.Entry.htmlÁ ÜÀú tàÀÿà ïÀú <óÀϽ üûÀ; 8 use hashbrown::hash_map::{Entry, HashMap, VacantEntry};Á ·Áú ü»Á. + let mut map = HashMap::<&str, i32>::new();Á êÁú üîÁ> ; let entry_v: VacantEntry<_, _, _> = match map.entry("a") {Á üÂ$ ! Entry::Vacant(view) => view,Á üÒÂ-ÄÌ
|
|||
|
|
4€Ã };Á ¼‡Ã entry_v.insert(10);Á üŸÃ/ , assert!(map[&"a"] == 10 && map.len() == 1);Á ÏÃú üÓÃ* ' // Nonexistent key (insert and update)Á Ôþà match map.entry("b") {Á ü™Ä-ÄÌ
|
|||
|
|
üÇÄ Entry::Vacant(view) => {Á üèÄ' $ let value = view.insert(2);Á ü�Å" assert_eq!(*value, 2);Á ijŠ*value = 20;Á LÌÅ¦Ò ,ÖÅõÍ üÜÅ/ , assert!(map[&"b"] == 20 && map.len() == 2);Á <ŒÆϽ \ŸÆ Ã Ì œ Í § Î ¤ Ï ’ Ð Í Î Ì Ð Ï Íý ¯Æ Þý ²Æ ºÄ
|
|||
|
|
´µÆ Ó¥
|
|||
|
|
¬ÍÆ å¥
|
|||
|
|
LÐÆ â© ü…Ç" ó©
|
|||
|
|
îÄ
|
|||
|
|
…¦
|
|||
|
|
îÆ
|
|||
|
|
Jò…ôËÙË ÑÒÓ«Æjl np r µÆ Ñë | ÍÆ ‹ò LêÆ$êÆŽ Ë Ë 4ùÆ ùÆŽ Ë Ë æê¸,…ÇŽ Ë Ë ’øü¬ÇH 8 � œ Õ § Ö ¤ × ’ Ø Ø Ö × Õ � Íý ±Ç Þý »Ç ºÄ
|
|||
|
|
¾Ç Ó¥
|
|||
|
|
ÁÇ €® ,´Ç å¥
|
|||
|
|
LÄÇ�ôÙ Àc Ù AC EG IK MO üûÇ8 þÇ ‘ ’ “ ‘�ô ’ c c ˆ ¢cµ
|
|||
|
|
` £cÔ ` àB¤GS
|
|||
|
|
“û® Ô ‚È Ô
|
|||
|
|
Ù 8æê‹í“ó³ñ$ƒÈ± ‰ÈüÌ×9 üÿÈP M A view into a single entry in a map, which may either be vacant or occupied,Á üÐÉ1 . with any borrowed form of the map's key type.Á ‚Êú †Êú üŠÊL I This `enum` is constructed from the [`entry_ref`] method on [`HashMap`].Á ×Êú üÛÊU R [`Hash`] and [`Eq`] on the borrowed form of the map's key type *must* match thoseÁ ü±ËS P for the key type. It also require that key may be constructed from the borrowedÁ ü…Ì$ ! form through the [`From`] trait.Á ªÌú ü®Ì$Å£ üÓÌ7 4 [`entry_ref`]: struct.HashMap.html#method.entry_refÁ ü‹Í;«à üÇÍ@ðà üˆÎC @ [`From`]: https://doc.rust-lang.org/std/convert/trait.From.htmlÁ ÌÎú tÐÎÿà ßÎú <ãÎϽ üëÎ@ = use hashbrown::hash_map::{EntryRef, HashMap, OccupiedEntry};Á ¬Ïú ü°Ï!ÜÐ üÒÏK H map.extend([("a".to_owned(), 10), ("b".into(), 20), ("c".into(), 30)]);Á ìžÐêÑ ¼Ðú äÀБº
|
|||
|
|
üÝÐ let key = String::from("a");Á üþÐ: 7 let entry: EntryRef<_, _, _, _> = map.entry_ref(&key);Á ü¹Ñ< 9 let _raw_o: OccupiedEntry<_, _, _, _> = entry.insert(1);Á ìöÑêÑ ü”Ò Ä»
|
|||
|
|
ü´Ò! map.entry_ref("d").insert(4);Á ÖÒú üÚÒ ¢¼
|
|||
|
|
üúÒ, ) let v = map.entry_ref("b").or_insert(2);Á ü§Ó,ÿ¼
|
|||
|
|
üÔÓ"¶½
|
|||
|
|
ü÷Ó$ ! map.entry_ref("e").or_insert(5);Á œÔú ü Ô$›¾
|
|||
|
|
üÅÔ4 1 let v = map.entry_ref("c").or_insert_with(|| 3);Á üúÔ,…¿
|
|||
|
|
ü§Õ'¼¿
|
|||
|
|
üÏÕ, ) map.entry_ref("f").or_insert_with(|| 6);Á üÕú ü€Ö'®À
|
|||
|
|
¨Öú ü¬ÖO L for (key, value) in ["a", "b", "c", "d", "e", "f"].into_iter().zip(1..=6) {Á üüÖ# assert_eq!(map[key], value)Á , ×õÍ ì¦× assert_eq!(map.len(), 6);Á <Ä×Ͻ DÕ× Ã Û ò< Ü œ Ý ¢ Þ § ß ¤ à ’ á á Ý Û ß à Þ Ü ÍìÑõ æ× Îì×õ é× ÍìÝõ ô× Íìãõ ÷× Íìéõ Tú× 1éõ L“Ø Ñõ à Ýõ û ãõ ÃÉ éõ Ã× ×õ ò<T³é Ú â ãóO äˆ å æ�P çˆ ì˜Ò—Y à ò<Ñõ×õÝõãõéõ ì˜Ò—Y âãåæ ã ä ² ² ØP ¸§ Ž ¹�Q Ž º‚ Ž ¥±£PUPÄã ÃÑõÝõãõéõË„ æ ç ï ï ÒT ÷§ Ž øëR Ž ù‚ Ž -2RY±¾È à ò<Ñõ×õÝõãõéõË„ Þ×â×
|
|||
|
|
|
|||
|
|
ú× ‹ò +¸ ´¤Ø¥Ç
|
|||
|
|
¿Øú tÇØÿà ÚØú <âØϽ üîØ1 . use hashbrown::hash_map::{EntryRef, HashMap};Á ü¤ÙS P let mut map: HashMap<_, _> = [("a".to_owned(), 100), ("b".into(), 200)].into();Á üÙú ô„Ú match map.entry_ref("a") {Á ü§Ú. + EntryRef::Vacant(_) => unreachable!(),Á üÚÚ$ ! EntryRef::Occupied(_) => { }Á ,ƒÛõÍ <�ÛϽ +¸ Ú Ú
|
|||
|
|
ã à ò<Ñõ×õÝõãõéõ+¸+¸ Ö… Ë„ Ú Ú º‹ ì¢Û Ú Ú Ö… D¹ œÇÛ·Ë
|
|||
|
|
ßÛú tçÛÿà úÛú <‚ÜϽ üŽÜ1߇ üÄÜ7 4 let mut map: HashMap<String, i32> = HashMap::new();Á €Ýú ôˆÝ…‰ ü«Ý0 - EntryRef::Occupied(_) => unreachable!(),Á üàÝ" EntryRef::Vacant(_) => { }Á ,‡ÞõÍ <‘ÞϽ D¹ Ú Ú
|
|||
|
|
æ à ò<Ñõ×õÝõãõéõD¹D¹ Æ Ë„ Ú Ú ‚� ü¤Þ% Ú Ú Ã† üÏÞ” 8 ” 8 • œ é ¢ ê § ë ¤ ì ’ í í • ê ì ” é ë
|
|||
|
|
šƒ ÔÞ ¬ƒ ×Þ ¾ƒ ÚÞ Ðƒ ÝÞ âƒ àÞ ¿cÑõ ,šß Ñõ×õ L¢ß ¿c×õ ,´ß ¿cÝõ ,Ëß ôƒ LÙßÿôî Àc î ‰‹ �� ‘“ •— ™› üêß8 íß – — ˜ –ÿô — c c ˆ ¢cµ
|
|||
|
|
` £cÔ ` àB¤GS
|
|||
|
|
˜û® è ñß è
|
|||
|
|
î 8 8Ñõ×õÝõãõéõ$òß± øßüÑèL üøá.�å
|
|||
|
|
ü§â( % It is part of the [`EntryRef`] enum.Á Ðâú üÔâ$ ! [`EntryRef`]: enum.EntryRef.htmlÁ ùâú týâÿà Œãú <�ãϽ ü˜ãA > use hashbrown::hash_map::{EntryRef, HashMap, VacantEntryRef};Á Úãú üÞã0 - let mut map = HashMap::<String, i32>::new();Á �äú ü“äH E let entry_v: VacantEntryRef<_, _, _, _> = match map.entry_ref("a") {Á üÜä' $ EntryRef::Vacant(view) => view,Á ü„å0öŒ 4µå€é
|
|||
|
|
¼¼å�é
|
|||
|
|
üÔå. + assert!(map["a"] == 10 && map.len() == 1);Á ƒæú ü‡æ*ùé
|
|||
|
|
ô²æ match map.entry_ref("b") {Á üÑæ0öŒ ü‚ç# EntryRef::Vacant(view) => {Á ü¦ç'Œë
|
|||
|
|
üÎç"¾ë
|
|||
|
|
Äñçêë
|
|||
|
|
LŠè¦Ò ,”èõÍ üšè. + assert!(map["b"] == 20 && map.len() == 2);Á <ÉèϽ tÜè à ð ò< ñ œ ò ¢ ó § ô ¤ õ ’ ö ð ö õ ó ñ ô ò šƒ óè ¬ƒ öè ¾ƒ �é Ѓ „é ⃠¬‡é ôƒ LŠé ¼„ ä „„ üÃé" ’„
|
|||
|
|
„ ®„ Æ -2RY±¾È ÷øùëèïè�ƒ …‡ ‰‹ �� ‘ ‡é ‹ò L¤é$¤éŽ ï ï “ ³éŽ ï ï ò<×õ Ë,ÃéŽ ï ï à ¨ ¨ � µ6 ®‚ Õ:Ç$Ö> EÑõÝõãõéõüêé„ 8 ™ 8 š œ û ¢ ü § ý ¤ þ ’ ÿ û ý ÿ š ü þ ™ šƒ ïé ¬ƒ òé ¾ƒ õé Ѓ øé ⃠ûé ³‘ L»ê È‘ ,Íê ôƒ Läêöõ€ Àc € SU WY [] _a ce üõê8 øê › œ � ›öõ œ c c ˆ ¢cµ
|
|||
|
|
` £cÔ ` àB¤GS
|
|||
|
|
�û® ú üê ú
|
|||
|
|
€ 8 8Ñõ×õÝõãõéõ$ýê± ƒëüÂò< üýëZ W The error returned by [`try_insert`](HashMap::try_insert) when the key already exists.Á Øìú üÜìE B Contains the occupied entry, and the value that was not inserted.Á ¢íú t¦íÿà µíú <¹íϽ üÁí6 3 use hashbrown::hash_map::{HashMap, OccupiedError};Á øíú üüí? < let mut map: HashMap<_, _> = [("a", 10), ("b", 20)].into();Á ¼îú üÀîS P // try_insert method returns mutable reference to the value if keys are vacant,Á ü”ïP M // but if the map did have key present, nothing is updated, and the providedÁ üåï0 - // value is returned inside `Err(_)` variantÁ ü–ð$ ! match map.try_insert("a", 100) {Á ü»ð4 1 Err(OccupiedError { mut entry, value }) => {Á üðð* ' assert_eq!(entry.key(), &"a");Á ü›ñ# assert_eq!(value, 100);Á ü¿ñ- * assert_eq!(entry.insert(100), 10)Á Líñ¦Ò ä÷ñ _ => unreachable!(),Á ,”òõÍ üšò assert_eq!(map[&"a"], 100);Á <ºòϽ lÍò à ‚ œ ƒ § „ ¤ … ’ † † „ ‚ ƒ … Íý ßò Þý âò ºÄ
|
|||
|
|
åò Ó¥
|
|||
|
|
¬èò å¥
|
|||
|
|
Lëò â© ”3 ó© ›3 îÄ
|
|||
|
|
¢3 …¦
|
|||
|
|
©3 � � íU ‡Ì< ˆ» /ÁµŸ`š Ãæê‹í“ó³ñ /ÁµŸ`š ‡ˆÛò®° ²´ ¶¸ º èò ‹ò ü½ó( ü…ó3 0 The entry in the map that was already occupied.Á,Áó � � �Æ
|
|||
|
|
d½ô üëóM J The value which was not inserted, because the entry was already occupied.Á,Áô � � ‹íüÎôQ 8 ž œ Š § ‹ ¤ Œ ’ � ž ‹ � Œ Š Íý Óô Þý Ýô ºÄ
|
|||
|
|
çô Ó¥
|
|||
|
|
êô €® ,Öô ‘® ,àô å¥
|
|||
|
|
LíôáöŽ Àc Ž JL NP RT VX ü¦õ8 ©õ Ÿ ¡ Ÿáö c c ˆ ¢cµ
|
|||
|
|
` £cÔ ` àB¤GS
|
|||
|
|
¡û® ‰ õ ‰
|
|||
|
|
Ž 8æê‹í“ó³ñ$®õ± ´õü³÷X 8 ¢ œ � § ‘ ¤ ’ ’ “ ¢ ‘ “ ’ � Íý ¸÷ Þý Â÷ ºÄ
|
|||
|
|
Ì÷ Ó¥
|
|||
|
|
Ï÷ €® ,»÷ ‘® ,Å÷ å¥
|
|||
|
|
LÒ÷áö” Åc ” JL NP RT VX ü’ø8 •ø £ ¤ ¥ £áö ¤ c c ˆ ¢cµ
|
|||
|
|
` £cÔ ` àB¤GS
|
|||
|
|
¥û® � ™ø �
|
|||
|
|
” 8æê‹í“ó³ñ$šø± øü¡úH à – œ — § ˜ ¤ ™ ’ š ˜ – š ™ — Íý ªú Þý ú ºÄ
|
|||
|
|
°ú Ó¥
|
|||
|
|
³ú å¥
|
|||
|
|
L¶ú¼÷›œ� ÈL ÉL ÊL � ¦úMO QS UW Y[ Lðú$õú • • þþl�ûD•û • • ºøüÂ�$ üµûK H Creates an iterator over the entries of a `HashMap` in arbitrary order.Á ü…ü2‹å ¼üú üÄüK H Return the same `Iter` struct as by the [`iter`] method on [`HashMap`].Á ”ýú üœý-�£ üÎý$Å£ ÷ýú tÿýÿà ’þú <šþϽ ܦþ¯Ä üÆþG D let map_one: HashMap<_, _> = [(1, "a"), (2, "b"), (3, "c")].into();Á ü’ÿ% " let mut map_two = HashMap::new();Á ¼ÿú üÄÿ" for (key, value) in &map_one {Á üëÿ3 0 println!("Key: {}, Value: {}", key, value);Á ü£€% " map_two.insert(*key, *value);Á ,Í€õÍ ×€ú ü߀! assert_eq!(map_one, map_two);Á <…�Ͻ LÅ� ¼÷ºø • •
|
|||
|
|
� Ãæê‹í“ó³ñ$Ï�ü†‚L à Ÿ œ § ¡ ¤ ¢ ’ £ ¢ £ ¡ Ÿ Íý �‚ Þý ’‚ ºÄ
|
|||
|
|
•‚ Ó¥
|
|||
|
|
˜‚ å¥
|
|||
|
|
L›‚’ø¤¥¦ ÈL ÉL ÊL ¦ ‹‚MO QS UW Y[ LÙ‚$Þ‚ ž ž õ¸ lý‚D‚ƒ ž ž ªùüº‹' ü¥ƒJ G Creates an iterator over the entries of a `HashMap` in arbitrary orderÁ üôƒG D with mutable references to the values. The iterator element type isÁ ÌÀ„ `(&'a K, &'a mut V)`.Á Þ„ú üæ„E B Return the same `IterMut` struct as by the [`iter_mut`] method onÁ „°…
|
|||
|
|
[`HashMap`].Á Å…ú üÍ…5Š± ü‡†$Å£ °†ú t¸†ÿà ˆú <ӆϽ Ü߆¯Ä üÿ†G D let mut map: HashMap<_, _> = [("a", 1), ("b", 2), ("c", 3)].into();Á ˇú üÓ‡" for (key, value) in &mut map {Á üú‡3ôº ¤²ˆ *value *= 2;Á ,ˈõÍ Õˆú ü݈1 . let mut vec = map.iter().collect::<Vec<_>>();Á ü“‰DÒè ü܉@¡é Ä¡ŠðÔ ü¾Š: 7 assert_eq!(vec, [(&"a", &2), (&"b", &4), (&"c", &6)]);Á <ýŠÏ½ L½‹ ’øªù ž ž
|
|||
|
|
¦ Ãæê‹í“ó³ñ$Ç‹ü…Œ@ œ ¨ § © ¤ ª ’ « © « ª ¨ çñ ŠŒ øñ �Œ ‰ò �Œ šò “Œ «òL–Œ¥é¬® ÈL ÉL ÊL ® FH JL NP RT LÌŒ$ÑŒ § § ³ìläŒDéŒ § § � � Ò
|
|||
|
|
‘Ô Ž õsY4è±ôÝéãéïéüð’' üŒ�H E Creates a consuming iterator, that is, one that moves each key-valueÁ üÙ�H E pair out of the map in arbitrary order. The map cannot be used afterÁ Œ¦Ž calling this.Á ¼Žú tÄŽÿà ׎ú <ߎϽ ÜëŽ¯Ä ‹�ú ü“�C @ let map: HashMap<_, _> = [("a", 1), ("b", 2), ("c", 3)].into();Á Û�ú üã� // Not possible with .iter()Á üˆ�> ; let mut vec: Vec<(&str, i32)> = map.into_iter().collect();Á üË�D A // The `IntoIter` iterator produces items in arbitrary order, soÁ ü”‘D A // the items must be sorted to test them against a sorted array.Á ÄÝ‘ðÔ üú‘4úé <³’Ͻ Ló’ ¥é½É § §
|
|||
|
|
®Ýéãéééïé$ý’üë“% 8 ¦ œ ° § ± ± ° ¦ Íý ð“ Þý ó“Èì² ´ ² !# ¤È” <Ë” Èì ¯ ¯
|
|||
|
|
² 8æê‹íüÈ•* à ´ œ µ § ¶ µ ´ ¶ Íý Ñ• Þý Ô•ºø·¸¹º úM ûM ÿM óN ¹ º ¸ Í•AC EG Lù•$þ• ³ ³ þþüË–, $Ζ § §ºøۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙþþ ³ Ó– ³
|
|||
|
|
¸ Ãæê‹í$Ø–ü«™- L®™ ¨ ¨ºø †ñ ³ ¸™ ³
|
|||
|
|
¹ Ãæê‹í$¹™üµšp $¸š ºøÎ× ¨�Î× ³“ » — ¼ » ¼ ³ ‰Ø ½š Õ� Àš Íìºø ,ùš “"¨�Î× ºø úM Ì‹› ¨�¡Ö ˜" Î× £›
|
|||
|
|
º Ãæê‹íÎ× ¨�$Úèù$Éš± Öš�‘ “• DÊ› º±æ ½ Êæ ½ èæ ½ ½ º ½ æê‹íÎ× ¨� Î× ŒÞ
|
|||
|
|
Î× ¹Ú ü¯œ/ 8 © œ ¿ § À ¿ © À Íý ´œ Þý ·œÈìÁ ÄM Á !# ´–� ™� ª ªÈì ¾ �� ¾
|
|||
|
|
Á 8æê‹í$ž�üÑ�+ 8 « œ à § Ä Ã « Ä Íý Ö� Þý Ù�Èì ü�ž( 8 ¬ œ Æ § Ç ¬ Ç Æ Íý †ž Þý ‰ž¤íÈ ´ È !# ¤áž <äž ¤í Å Å
|
|||
|
|
È 8æê‹íüáŸ- Ã Ê œ Ë § Ì Ì Ê Ë Íý êŸ Þý ퟪùÍÎÏÐ úM ûM ÿM óN Î Ð Ï æŸAC EG L• $š É É õ¸ üë 0 $î ªùۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙõ¸ É ó É
|
|||
|
|
Î Ãæê‹í$ø üÓ£- LÖ£ ® ®ªù †ñ É à£ É
|
|||
|
|
Ï Ãæê‹í$á£üݤp $ठªùÎ× ¨�Î× É“ Ñ — Ò Ò Ñ É ‰Ø å¤ Õ� è¤ Íìªù ,¡¥ “"¨�Î× ªù úM ̳¥ ¨�Šá ˜" Î× Ë¥
|
|||
|
|
Ð Ãæê‹íÎ× ¨�$ë¤èù$ñ¤± þ¤�‘ “• Dò¥ бæ Ó Êæ Ó èæ Ó Ó Ð Ó æê‹íÎ× ¨�‡Ø ¹Ú üצ2 8 ¯ œ Õ § Ö ¯ Õ Ö Íý ܦ Þý ߦ¤í× ÄM × !# ´Á§ ħ ° °¤í Ô È§ Ô
|
|||
|
|
× 8æê‹í$ɧüû§. 8 ± œ Ù § Ú Ù Ú ± Íý €¨ Þý ƒ¨¤í ü®¨W 8 ² œ Ü § Ý Ü Ý ² Íý ³¨ Þý ¶¨ €® Tç¨ ‘® Tú¨¤íÞ Àc Þ /1 35 üŒ©8 �© ³ ´ µ ³¤í ´ c c ˆ ¢cµ
|
|||
|
|
` £cÔ ` àB¤GS
|
|||
|
|
µû® Û “© Û
|
|||
|
|
Þ 8æê‹í$”©± š©ü…ª6 œ à § á ’ â á à â çñ Šª øñ �ª ¤Ž �ª ¶ŽL“ªšúã ´ ã /1 35 79 ¤óª <öª šú ß ß
|
|||
|
|
ãÝéãé�çüÒ«7 œ å § æ ’ ç å æ ç çñ ׫ øñ Ú« ¤Ž Ý« ¶ŽLà«šúèéêë úM ûM ÿM óN ë ê é LN PR TV L�¬$•¬ ä ä ³ìüÚ¬$ $ݬ ¶ ¶šú©€ ä ⬠ä
|
|||
|
|
éÝéãé�ç$ç¬üÖ- LÙ · ·šú †ñ ä ã ä
|
|||
|
|
êÝéãé�ç$äüà®l $ã® šúÎ× ¨�Î× ä“ ì — í í ì ä ‰Ø è® Õ� ë® Íìšú , ¯ “"¨�Î× šú úM ̲¯ ¨�§î ˜" Î× Ê¯
|
|||
|
|
ëÝéãé�çÎ× ¨�$î®èù$ô®± ý®�� ‘“ üü¯@ œ ï § ð ’ ñ ð ï ñ çñ �° øñ „° ¤Ž ‡° ¶ŽLŠ°šúò ÄM ò /1 35 79 ´ô° ÷° ¸ ¸šú î û° î
|
|||
|
|
òÝéãé�ç$ü°ü®±< œ ô § õ ’ ö õ ö ô çñ ³± øñ ¶± ¤Ž ¹± ¶ŽL¼±šú $& (* ,. üï±G œ ø § ù ’ ú ø ù ú çñ ô± øñ þ± ¤Ž ˆ² ŽŒ ,÷± ŸŒ ,�² ¶ŽL‹²šúû Àc û AC EG IK ü½²8 À² ¹ º » ¹šú º c c ˆ ¢cµ
|
|||
|
|
` £cÔ ` àB¤GS
|
|||
|
|
»û® ÷ IJ ÷
|
|||
|
|
ûÝéãé�ç$Ų± ˲ü¶³% 8 ¼ œ ý § þ ý þ ¼ Íý »³ Þý ¾³Ìïÿ ´ ÿ !# ¤“´ <–´ Ìï ü ü
|
|||
|
|
ÿ 8æê‹íüò´* à � œ ‚ § ƒ ƒ � ‚ Íý û´ Þý þ´’û„ … † ‡ úM ûM ÿM óN ‡ … † ÷´AC EG L£µ$¨µ € € €ÿüìµ# $ïµ ½ ½’ûۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ€ÿ € ôµ €
|
|||
|
|
… Ãæê‹í$ùµüò·- Lõ· ¾ ¾’û †ñ € ÿ· €
|
|||
|
|
† Ãæê‹í$€¸üü¸p $ÿ¸ ’ûÎ× ¨�Î× € “ ˆ — ‰ ˆ ‰ € ‰Ø „¹ Õ� ‡¹ Íì’û ,À¹ “"¨�Î× ’û úM ÌÒ¹ ¨�Äû ˜" Î× ê¹
|
|||
|
|
‡ Ãæê‹íÎ× ¨�$Š¹èù$�¹± �¹�‘ “• l‘º ‡ ±æ Š Êæ Š èæ Š Š ‡ Š æê‹íÎ× ¨� Î× æê ‹í Î× ¹Ú ü²º/ 8 ¿ œ Œ § � � ¿ Œ Íý ·º Þý ººÌïŽ ÄM Ž !# ´™» œ» À ÀÌï ‹ » ‹
|
|||
|
|
Ž 8æê‹í$¡»üÓ»+ 8 Á œ � § ‘ � Á ‘ Íý Ø» Þý Û»Ìï üƒ¼' 8  œ “ § ” “  ” Íý ˆ¼ Þý ‹¼™ð• ´ • !# ¤â¼ <å¼ ™ð ’ ’
|
|||
|
|
• 8æê‹íüÁ½, à — œ ˜ § ™ ˜ ™ — Íý ʽ Þý ͽöûš › œ � úM ûM ÿM óN œ › � ƽAC EG Lô½$ù½ – – Šÿü½¾# $À¾ à Ãöûۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙŠÿ – ž –
|
|||
|
|
› Ãæê‹í$ʾüÃÀ- LÆÀ Ä Äöû †ñ – ÐÀ –
|
|||
|
|
œ Ãæê‹í$ÑÀüÍÁp $ÐÁ öûÎ× ¨�Î× – “ ž — Ÿ Ÿ ž – ‰Ø ÕÁ Õ� ØÁ Íìöû ,‘ “"¨�Î× öû úM ̣ ¨�¸† ˜" Î× »Â
|
|||
|
|
� Ãæê‹íÎ× ¨�$ÛÁèù$áÁ± îÁ�‘ “• lâ � ±æ Êæ èæ � æê‹íÎ× ¨�ªý ¹Ú üƒÃ1 8 Å œ ¢ § £ Å £ ¢ Íý ˆÃ Þý ‹Ã™ð¤ ÄM ¤ !# ´ìà ïÃ Æ Æ™ð ¡ óà ¡
|
|||
|
|
¤ 8æê‹í$ôÃü¦Ä- 8 Ç œ ¦ § § Ç § ¦ Íý «Ä Þý ®Ä™ð üØÄ* 8 È œ © § ª ª © È Íý ÝÄ Þý àÄÏü« ´ « !# ¤ºÅ <½Å Ïü ¨ ¨
|
|||
|
|
« 8æê‹íü™Æ/ à œ ® § ¯ ® ¯ Íý ¢Æ Þý ¥Æ‘ý° ± ² ³ úM ûM ÿM óN ³ ± ² žÆAC EG LÏÆ$ÔÆ ¬ ¬ ú¸ üœÇ' $ŸÇ É É‘ýۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙú¸ ¬ ¤Ç ¬
|
|||
|
|
± Ãæê‹í$©Çü¦É- L©É Ê Ê‘ý †ñ ¬ ³É ¬
|
|||
|
|
² Ãæê‹í$´Éü°Êp $³Ê ‘ýÎ× ¨�Î× ¬ “ ´ — µ ´ µ ¬ ‰Ø ¸Ê Õ� »Ê Íì‘ý ,ôÊ “"¨�Î× ‘ý úM Ì†Ë ¨�“‘ ˜" Î× žË
|
|||
|
|
³ Ãæê‹íÎ× ¨�$¾Êèù$Äʱ ÑÊ�‘ “• lÅË ³ ±æ ¶ Êæ ¶ èæ ¶ ¶ ³ ¶ æê‹íÎ× ¨� Î× ´ý ‹íÎ× ¹Ú üæË4 8 Ë œ ¸ § ¹ ¸ Ë ¹ Íý ëË Þý îËÏüº ÄM º !# ´ÒÌ ÕÌ Ì
|
|||
|
|
` £cÔ ` àB¤GS
|
|||
|
|
Ñû® ¾ ƒÎ ¾
|
|||
|
|
Á 8æê‹í$„α ŠÎTùÎ Á ±æ  Êæ  èæ   Á  æê‹í ²ý ºý ü©Ï8 8 Ò œ Ä § Å ’ Æ Ò Ä Å Æ Íý ®Ï Þý ±Ï šò ´Ï «òL·ÏõýÇ È É Ê úM ûM ÿM óN Ê È É LN PR TV LèÏ$íÏ Ã Ã ¦ÿü²Ð$ $µÐ Ó Óõýۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ¦ÿ à ºÐ Ã
|
|||
|
|
È 8æê‹íïé$¿Ðü®Ñ- L±Ñ Ô Ôõý †ñ à »Ñ Ã
|
|||
|
|
É 8æê‹íïé$¼Ñü¸Òl $»Ò õý“—Ä� à “ Ë — Ì Ë Ì Ã ÍìÄ� ÀÒ ÍìÉ� ÃÒ Íìõý ,øÒ “"É� Ä� õý úM ÌŠÓ É� ž ˜" Ä� ¢Ó
|
|||
|
|
Ê 8æê‹íïéÄ� É� $ÆÒèù$ÌÒ± ÕÒ›� –˜ üÔÓA 8 Õ œ Î § Ï ’ Ð Ï Õ Î Ð Íý ÙÓ Þý ÜÓ šò ßÓ «òLâÓõýÑ ÄM Ñ /1 35 79 ´ÍÔ ÐÔ Ö Öõý Í ÔÔ Í
|
|||
|
|
Ñ 8æê‹íïé$ÕÔü‡Õ= 8 × œ Ó § Ô ’ Õ × Ô Ó Õ Íý ŒÕ Þý �Õ šò ’Õ «òL•Õõý $& (* ,. üÉÕm 8 Ø œ × § Ø ’ Ù Ø Ù × Ø Íý ÎÕ Þý ÑÕ šò ÔÕ €® T†Ö ‘® T™Ö «òL¬ÖõýÚ Àc Ú AC EG IK ü½Ö8 ÀÖ Ù Ú Û Ùõý Ú c c ˆ ¢cµ
|
|||
|
|
` £cÔ ` àB¤GS
|
|||
|
|
Ûû® Ö ÄÖ Ö
|
|||
|
|
Ú 8æê‹íïé$ÅÖ± ËÖü¶×5 Ã Ü œ Ý § Þ ¤ ß ’ à Þ ß Ý à Ü Íý ¿× Þý Â× ºÄ
|
|||
|
|
Å× Ó¥
|
|||
|
|
È× å¥
|
|||
|
|
LË×€Å
|
|||
|
|
á â ã ä æ è é ë »×LN PR TV XZ üõÚq üò×@ = Sets the value of the entry, and returns an `OccupiedEntry`.Á ·Øú t¿Øÿà ÒØú <ÚØϽ ÜæØ¯Ä †Ùú üŽÙ5 2 let mut map: HashMap<&str, u32> = HashMap::new();Á üÈÙ3 0 let entry = map.entry("horseyland").insert(37);Á €Úú üˆÚ+ ( assert_eq!(entry.key(), &"horseyland");Á <¸ÚϽ 4üÚ €Å
|
|||
|
|
‹í�Æ
|
|||
|
|
Û Û �— $ÉÛ Åe“ó \ÚÛ
|
|||
|
|
á Ãæê‹í“ó³ñ$ƒÛ»,‰Ûü�âb üËÝR O Ensures a value is in the entry by inserting the default if empty, and returnsÁ ü¢Þ2�ê ÙÞú táÞÿà ôÞú <üÞϽ Üˆß¯Ä ¨ßú ü°ß5ù§ êßú ´òß // nonexistent keyÁ ü�à( % map.entry("poneyland").or_insert(3);Á üºà$ ! assert_eq!(map["poneyland"], 3);Á ãàú œëà // existing keyÁ üƒá/ , *map.entry("poneyland").or_insert(10) *= 2;Á ü·á$ ! assert_eq!(map["poneyland"], 6);Á <àáϽ L¤â €Å
|
|||
|
|
‹íú¸ Û Û �— $ââ ‚« \óâ
|
|||
|
|
â Ãæê‹í“ó³ñ$®â><´âüÔé| ü£äF C Ensures a value is in the entry by inserting the default if empty,Á üîä% " and returns an [`OccupiedEntry`].Á ˜åú t åÿà ³åú <»åϽ ÜÇå¯Ä çåú üïå5ù§ ©æú ´±æ¨¬ üÌæ: 7 let entry = map.entry("poneyland").or_insert_entry(3);Á ü‹ç* ' assert_eq!(entry.key(), &"poneyland");Á üºç assert_eq!(entry.get(), &3);Á ßçú œçç· üÿç? < let mut entry = map.entry("poneyland").or_insert_entry(10);Á üÃè*Œ² üòè Á² <—éϽ |Ûé €Å
|
|||
|
|
‹í�Æ
|
|||
|
|
Û Û �— $³ê ‚« \Äê
|
|||
|
|
ã Ãæê‹í“ó³ñ$ëé><ñéüèðy üïë] Z Ensures a value is in the entry by inserting the result of the default function if empty,Á üÑì> ; and returns a mutable reference to the value in the entry.Á ”íú tœíÿà ¯íú <·íϽ ÜÃí¯Ä ãíú üëí5ù§ ¥îú ´î¨¬ üÈî0 - map.entry("poneyland").or_insert_with(|| 3);Á üýî$ü¬ ¦ïú œ®ï· üÆï7 4 *map.entry("poneyland").or_insert_with(|| 10) *= 2;Á ü‚ð$�® <«ðϽ tïð €Å
|
|||
|
|
É� ú¸ Û — å å Û “ž þð –"É� l�ñ É� ˜" ‹í �ñ �— $Äñ ‚« \Õñ
|
|||
|
|
ä Ãæê‹í“ó³ñÉ� $�ñ><–ñqs ü×ú ü‡ó_ \ Ensures a value is in the entry by inserting, if empty, the result of the default function.Á üëó_ \ This method allows for generating key-derived values for insertion by providing the defaultÁ üÏôX U function a reference to the key that was moved during the `.entry(key)` method call.Á ¬õú ü´õT Q The reference to the moved key is provided so that cloning or copying the key isÁ ü�ö8 5 unnecessary, unlike with `.or_insert_with(|| ... )`.Á Êöú tÒöÿà åöú <íöϽ Üùö¯Ä ™÷ú ü¡÷7 4 let mut map: HashMap<&str, usize> = HashMap::new();Á Ý÷ú ´å÷¨¬ ü€øI F map.entry("poneyland").or_insert_with_key(|key| key.chars().count());Á üÎø$ ! assert_eq!(map["poneyland"], 9);Á ÷øú œÿø· ü—ùT Q *map.entry("poneyland").or_insert_with_key(|key| key.chars().count() * 10) *= 2;Á üðù% " assert_eq!(map["poneyland"], 18);Á <šúϽ ”Þú €Å
|
|||
|
|
É� ú¸ Û — ç ç Û “ž ñú Ü –"É� Üæê |ôú Ü É� éà ˜" ‹í ‚û �— $¹û ‚« \Êû
|
|||
|
|
æ Ãæê‹í“ó³ñÉ� $…û><‹û‰‹ ¼¨� üÉý, ) Returns a reference to this entry's key.Á úýú t‚þÿà •þú <�þϽ Ü©þ¯Ä Éþú üÑþ5ù§ ü‹ÿ(ɬ œ¸ÿ· üÐÿ; 8 assert_eq!(map.entry("poneyland").key(), &"poneyland");Á ´�€¨¬ ü«€; 8 assert_eq!(map.entry("horseland").key(), &"horseland");Á <ë€Ï½ ¯� Ý Ý€Å
|
|||
|
|
Ýæê Û ³� Û
|
|||
|
|
è Ãæê‹í“ó³ñ$´�üÀ‡M üÙ‚D A Provides in-place mutable access to an occupied entry before anyÁ ü¢ƒ# potential inserts into the map.Á ʃú tÒƒÿà åƒú <íƒÏ½ Üùƒ¯Ä ™„ú ü¡„5ù§ Û„ú Ôã„ map.entry("poneyland")Á ü‚…# .and_modify(|e| { *e += 1 })Á ´ª… .or_insert(42);Á üÅ…% " assert_eq!(map["poneyland"], 42);Á ï…ú Ô÷…¿É ü–†#äÉ ´¾†‘Ê üÙ†% " assert_eq!(map["poneyland"], 43);Á <ƒ‡Ï½ TLJ €Å
|
|||
|
|
É� €Å
|
|||
|
|
Û — ê ê Û “ž Ò‡ Þ –"É� Þ‹í tþ‡ Þ É� ²Í ˜"
|
|||
|
|
é Ãæê‹í“ó³ñÉ� $Õ‡± Û‡tv üÊ–e üý‰F C Provides shared access to the key and owned access to the value ofÁ üÈŠE B an occupied entry and allows to replace or remove it based on theÁ ü’‹! value of the returned option.Á ¸‹ú tÀ‹ÿà Ӌú <ۋϽ Üç‹¯Ä ü‡Œ# use hashbrown::hash_map::Entry;Á ¯Œú ü·Œ5ù§ ñŒú œùŒ let entry = mapÁ Ü‘� .entry("poneyland")Á ü±�3 0 .and_replace_entry_with(|_k, _v| panic!());Á é�ú Œñ� match entry {Á 쇎 Entry::Vacant(e) => {Á ü©Ž. + assert_eq!(e.key(), &"poneyland");Á LÜŽ¦Ò üêŽ' $ Entry::Occupied(_) => panic!(),Á ,–�õÍ �ú ü¨� map.insert("poneyland", 42);Á Í�ú œÕ�–Ð Üí�³Ð ü��( % .and_replace_entry_with(|k, v| {Á üº�( % assert_eq!(k, &"poneyland");Á ôç� assert_eq!(v, 42);Á ¼Š‘ Some(v + 1)Á \¦‘ });Á ¶‘ú Œ¾‘£Ñ üÔ‘ Entry::Occupied(e) => {Á üø‘.æÑ ü«’% " assert_eq!(e.get(), &43);Á LÕ’¦Ò üã’% " Entry::Vacant(_) => panic!(),Á ,�“õÍ —“ú üŸ“%šË É“ú œÑ“–Ð Ü铳Рü‰”/ , .and_replace_entry_with(|_k, _v| None);Á ½”ú ŒÅ”£Ñ üÛ”> ; Entry::Vacant(e) => assert_eq!(e.key(), &"poneyland"),Á üž•'Ò ,Ê•õÍ Ô•ú üÜ•, ) assert!(!map.contains_key("poneyland"));Á <�–Ͻ ´Ñ– €Å
|
|||
|
|
É� €Å
|
|||
|
|
Û — ì ì Û “ž è– ß –"É� ßæê ‹í Ô”— ß É� ŽÛ ˜" ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ‹íL¥—
|
|||
|
|
ë Ãæê‹í“ó³ñÉ� $ë–± ñ–À üǘ> Ã î œ ï § ð ¤ ñ ’ ò ò î ð ñ ï Íý И Þý Ó˜ ºÄ
|
|||
|
|
ߘ ӥ
|
|||
|
|
☠³ ‹í <Ö˜ å¥
|
|||
|
|
L嘀Å
|
|||
|
|
ó ̘HJ LN PR TV ü‹žW üŒ™L I Ensures a value is in the entry by inserting the default value if empty,Á üÝ™>äµ šú t¨šÿà »šú <ÚϽ ÜÏš¯Ä ïšú ü÷š= : let mut map: HashMap<&str, Option<u32>> = HashMap::new();Á ¹›ú ´Á›¨¬ üÜ›( % map.entry("poneyland").or_default();Á ü‰œ' $ assert_eq!(map["poneyland"], None);Á µœú ü½œ% " map.insert("horseland", Some(3));Á çœú œïœ· ü‡�B ? assert_eq!(map.entry("horseland").or_default(), &mut Some(3));Á <Î�Ͻ T’ž €Å
|
|||
|
|
ú¸ í í �— $Åž ‚« \Öž
|
|||
|
|
ó Ãæê‹í“ó³ñ$�žü� = à õ œ ö § ÷ ¤ ø ’ ù ÷ õ ù ø ö Íý ˜ Þý › ºÄ
|
|||
|
|
ž Ó¥
|
|||
|
|
¡ å¥
|
|||
|
|
L¤ �Æ
|
|||
|
|
ú û ü ý þ ÿ €
|
|||
|
|
�
|
|||
|
|
” LN PR TV XZ ¼Ä¤ üÓ - * Gets a reference to the key in the entry.Á …¡ú t�¡ÿà ¡ú <¨¡Ï½ ü´¡.üÇ
|
|||
|
|
ç¡ú üï¡5ù§ ü©¢) & map.entry("poneyland").or_insert(12);Á ×¢ú üߢ" match map.entry("poneyland") {Á ü†£%¤Ö ü°£H E Entry::Occupied(entry) => assert_eq!(entry.key(), &"poneyland"),Á ,ý£õÍ <‡¤Ï½ ˤ à à�Æ
|
|||
|
|
àæê ô Ϥ ô
|
|||
|
|
ú Ãæê‹í“ó³ñ$ФüÄ«# ü’¥9 6 Take the ownership of the key and value from the map.Á üÐ¥)�” þ¥ú t†¦ÿà ™¦ú <¡¦Ï½ ܦ¯Ä üͦ#ÀÏ õ¦ú üý¦5ù§ ¼·§úõ üÓ§3œö ‹¨ú ü“¨)Ëå Á¨ú üɨ8 5 if let Entry::Occupied(o) = map.entry("poneyland") {Á ü†©, ) // We delete the entry from the map.Á ü·©8 5 assert_eq!(o.remove_entry(), ("poneyland", 12));Á ,ô©õÍ þ©ú ü†ª5 2 assert_eq!(map.contains_key("poneyland"), false);Á üÀª!§þ äæª ø <‡«Ï½ dË« �Æ
|
|||
|
|
¦ÿ ô ô
|
|||
|
|
û Ãæê‹í“ó³ñ$Ø«¼¬° ü¬/ , Gets a reference to the value in the entry.Á á¬ú té¬ÿà ü¬ú <„Ͻ Ü�¯Ä ü°#ÀÏ Øú üà5ù§ üš®)Ëå È®ú üЮ"Œæ ü÷®%¤Ö ü¡¯? < Entry::Occupied(entry) => assert_eq!(entry.get(), &12),Á ,å¯õÍ <ï¯Ï½ ³° á á�Æ
|
|||
|
|
á‹í ô ·° ô
|
|||
|
|
ü Ãæê‹í“ó³ñ$¸°üï·# üú°7 4 Gets a mutable reference to the value in the entry.Á ¶±ú ü¾±H E If you need a reference to the `OccupiedEntry` which may outlive theÁ ü‹²7 4 destruction of the `Entry` value, see [`into_mut`].Á Dzú üϲ" [`into_mut`]: #method.into_mutÁ ö²ú tþ²ÿà ‘³ú <™³Ï½ Ü¥³¯Ä üų#ÀÏ í³ú üõ³5ù§ ü¯´)Ëå Ý´ú üå´% " assert_eq!(map["poneyland"], 12);Á ü�µ< 9 if let Entry::Occupied(mut o) = map.entry("poneyland") {Á Üе *o.get_mut() += 10;Á üðµ! assert_eq!(*o.get(), 22);Á –¶ú üž¶4 1 // We can use the same Entry multiple times.Á Ô׶ *o.get_mut() += 2;Á ,ö¶õÍ €·ú üˆ·% " assert_eq!(map["poneyland"], 24);Á <²·Ï½ <ö· â â�Æ
|
|||
|
|
â‹í ô þ· ô
|
|||
|
|
ý Ãæê‹í“ó³ñ$ƒ¸ü¥¿" ü͸S P Converts the `OccupiedEntry` into a mutable reference to the value in the entryÁ ü¥¹, ) with a lifetime bound to the map itself.Á Ö¹ú üÞ¹L I If you need multiple references to the `OccupiedEntry`, see [`get_mut`].Á ¯ºú ü·º [`get_mut`]: #method.get_mutÁ ܺú täºÿà ÷ºú <ÿºÏ½ ü‹».üÇ
|
|||
|
|
¾»ú üÆ»5ù§ ü€¼)Ëå ®¼ú ü¶¼%Õô à¼ú Äè¼ let value: &mut u32;Á ü…½"Œæ ü¬½; 8 Entry::Occupied(entry) => value = entry.into_mut(),Á üì½%¤Ö ,–¾õÍ Œ ¾ *value += 10;Á ¶¾ú ü¾¾% " assert_eq!(map["poneyland"], 22);Á <è¾Ï½ D¬¿ �Æ
|
|||
|
|
ú¸ ô ô
|
|||
|
|
þ Ãæê‹í“ó³ñ$µ¿ü�Ä' ü‚ÀC @ Sets the value of the entry, and returns the entry's old value.Á ÊÀú tÒÀÿà åÀú <íÀϽ ÜùÀ¯Ä ü™Á#ÀÏ ÁÁú üÉÁ5ù§ üƒÂ)Ëå ±Âú ü¹Â<…õ üúÂ% " assert_eq!(o.insert(15), 12);Á ,¤ÃõÍ ®Ãú ü¶Ã% " assert_eq!(map["poneyland"], 15);Á <àÃϽ 4¤Ä ã ã�Æ
|
|||
|
|
‹í‹í ô «Ä ô
|
|||
|
|
ÿ Ãæê‹í“ó³ñ$°Ä»,¶ÄÄæÊ üþÄ5 2 Takes the value out of the entry, and returns it.Á ü¸Å)�” æÅú tîÅÿà �Æú <‰ÆϽ Ü•Æ¯Ä üµÆ#ÀÏ ÝÆú üåÆ5ù§ ¼ŸÇúõ ü»Ç3œö óÇú üûÇ)Ëå ©Èú ü±È8¿ê üîÈ# assert_eq!(o.remove(), 12);Á ,–ÉõÍ Éú ü¨É5—ì üâÉ!§þ äˆÊ ø <©ÊϽ 4íÊ �Æ
|
|||
|
|
‹í ô ô
|
|||
|
|
€
|
|||
|
|
Ãæê‹í“ó³ñ$ôÊü�×r üªËF¯Í üõË= : the entry and allows to replace or remove it based on theÁ ü·Ì!ÐÎ ÝÌú tåÌÿà øÌú <€ÍϽ ÜŒÍ¯Ä ü¬Í#ÀÏ ÔÍú üÜÍ5ù§ ü–Î úÒ »Îú üÃÎ. + let entry = match map.entry("poneyland") {Á üöÎ Õ üšÏ) & e.replace_entry_with(|k, v| {Á üÈÏ, ) assert_eq!(k, &"poneyland");Á üùÏ" assert_eq!(v, 42);Á Ü Ð Some(v + 1)Á tÀÐ })Á LÓÐ¦Ò üáÐ%¤Ö 4‹Ñ€é
|
|||
|
|
–Ñú ŒžÑ£Ñ ü´Ñ Õ üØÑ.æÑ ü‹Ò%æÕ LµÒ¦Ò üÃÒ%¤Ö ,íÒõÍ ÷Òú üÿÒ%šË ©Óú ü±Ó.çˆ
|
|||
|
|
üäÓB ? Entry::Occupied(e) => e.replace_entry_with(|_k, _v| None),Á ü«Ô%¤Ö 4ÕÔ€é
|
|||
|
|
àÔú Œè ìþÔ¾Ñ ü Õ.æÑ LÓÕ¦Ò üáÕ'Ò ,�ÖõÍ —Öú üŸÖ,ïØ <ÐÖϽ ””× �Æ
|
|||
|
|
É� €Å
|
|||
|
|
ô — ‚
|
|||
|
|
‚
|
|||
|
|
ô “ž §× ä –"É� äæê ‹í Ôä× ä É� «�
|
|||
|
|
˜" »Û Lõ×
|
|||
|
|
�
|
|||
|
|
Ãæê‹í“ó³ñÉ� $ª×± °×{} t¤Ù �
|
|||
|
|
±æ ƒ
|
|||
|
|
Êæ ƒ
|
|||
|
|
èæ ƒ
|
|||
|
|
ƒ
|
|||
|
|
�
|
|||
|
|
ƒ
|
|||
|
|
æê‹í“ó³ñÉ� ¦ÿ¬› É� ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙæêüáÝ; à …
|
|||
|
|
œ †
|
|||
|
|
§ ‡
|
|||
|
|
¤ ˆ
|
|||
|
|
’ ‰
|
|||
|
|
ˆ
|
|||
|
|
†
|
|||
|
|
‰
|
|||
|
|
…
|
|||
|
|
‡
|
|||
|
|
Íý êÝ Þý íÝ ºÄ
|
|||
|
|
ðÝ Ó¥
|
|||
|
|
óÝ å¥
|
|||
|
|
LöÝîÆ
|
|||
|
|
Š
|
|||
|
|
‹
|
|||
|
|
Œ
|
|||
|
|
�
|
|||
|
|
æÝ@B DF HJ LN ¼¢á ü£ÞI F Gets a reference to the key that would be used when inserting a valueÁ ôñÞ through the `VacantEntry`.Á ”ßú tœßÿà ¯ßú <·ßϽ ÜÃß¯Ä ãßú üëß5ù§ ü¥à;®Å <åàϽ ©á å åîÆ
|
|||
|
|
åæê „
|
|||
|
|
á „
|
|||
|
|
|
|||
|
|
Š
|
|||
|
|
Ãæê‹í“ó³ñ$®áÔ‰å ôÙá Take ownership of the key.Á üáú t„âÿà —âú <ŸâϽ ü«â.üÇ
|
|||
|
|
Þâú üæâ5ù§ ãú ü¨ã"Œæ üÏã'Ò üûãB ? Entry::Vacant(v) => assert_eq!(v.into_key(), "poneyland"),Á ,ÂäõÍ <ÌäϽ D�å îÆ
|
|||
|
|
æê „
|
|||
|
|
„
|
|||
|
|
|
|||
|
|
‹
|
|||
|
|
Ãæê‹í“ó³ñ$™åü¼é] üÂå? < Sets the value of the entry with the [`VacantEntry`]'s key,Á ü†æ* ' and returns a mutable reference to it.Á µæú t½æÿà Ðæú <ØæϽ Üäæ¯Ä ü„ç#ÀÏ ¬çú ü´ç5ù§ îçú üöç6 3 if let Entry::Vacant(o) = map.entry("poneyland") {Á ¬±è o.insert(37);Á ,ËèõÍ üÕè% " assert_eq!(map["poneyland"], 37);Á <ÿèϽ 4Ãé îÆ
|
|||
|
|
‹íú¸ „
|
|||
|
|
„
|
|||
|
|
�— $üé ‚« \�ê
|
|||
|
|
Œ
|
|||
|
|
Ãæê‹í“ó³ñ$Êé»,Ðéü‘ðw ü’ì?™
|
|||
|
|
üÖì%œ° €íú tˆíÿà ›íú <£íϽ ܯí¯Ä üÏí#ÀÏ ÷íú üÿí5ù§ ¹îú üÁî6 3 if let Entry::Vacant(v) = map.entry("poneyland") {Á üüî# let o = v.insert_entry(37);Á ü¤ï! assert_eq!(o.get(), &37);Á ,ÊïõÍ <ÔïϽ d˜ð îÆ
|
|||
|
|
‹í�Æ
|
|||
|
|
„
|
|||
|
|
„
|
|||
|
|
�— $ëð ‚« \üð
|
|||
|
|
�
|
|||
|
|
Ãæê‹í“ó³ñ$¥ð»,«ðü³óN à �
|
|||
|
|
ò< �
|
|||
|
|
œ ‘
|
|||
|
|
¢ ’
|
|||
|
|
§ “
|
|||
|
|
¤ ”
|
|||
|
|
’ •
|
|||
|
|
•
|
|||
|
|
‘
|
|||
|
|
�
|
|||
|
|
“
|
|||
|
|
”
|
|||
|
|
’
|
|||
|
|
�
|
|||
|
|
šƒ Àó ¬ƒ Ãó ¾ƒ Îó Ѓ Ñó ⃠Ôó ôƒ L×óË„ –
|
|||
|
|
—
|
|||
|
|
˜
|
|||
|
|
š
|
|||
|
|
œ
|
|||
|
|
�
|
|||
|
|
¸ó¼óVX Z\ ^` bd fh ü�÷‰ üˆô@ݦ Íôú tÕôÿà èôú <ðôϽ Üüô¯Ä œõú ü¤õ7 4 let mut map: HashMap<String, u32> = HashMap::new();Á üàõ7 4 let entry = map.entry_ref("horseyland").insert(37);Á œöú ü¤ö* ' assert_eq!(entry.key(), "horseyland");Á <ÓöϽ 4—÷ Ë„ ÝõÖ… Ž
|
|||
|
|
Ž
|
|||
|
|
šeÑõ $ä÷ æ ò� Ñõ <ù÷ Åeãõ \�ø
|
|||
|
|
–
|
|||
|
|
à ò<Ñõ×õÝõãõéõ$ž÷»,¤÷üàþz ü„úRЪ üÛú2�ê ’ûú tšûÿà ûú <µûϽ ÜÁû¯Ä áûú üéû7«¤
|
|||
|
|
¥üú ´ü¨¬ üÈü, ) map.entry_ref("poneyland").or_insert(3);Á üùü$ü¬ ¢ýú œªý· üÂý3 0 *map.entry_ref("poneyland").or_insert(10) *= 2;Á üúý$�® <£þϽ Lçþ Ë„ Ýõ ÃÝõ Ž
|
|||
|
|
Ž
|
|||
|
|
²§
|
|||
|
|
$¥ÿ ç
|
|||
|
|
<ºÿ ا
|
|||
|
|
\Îÿ
|
|||
|
|
—
|
|||
|
|
à ò<Ñõ×õÝõãõéõ$ñþ><÷þü‡†‘ ü„�]ü´ üæ�>äµ ©‚ú t±‚ÿà Ăú <̂Ͻ ÜØ‚¯Ä ø‚ú ü€ƒ7«¤
|
|||
|
|
¼ƒú ´Äƒ¨¬ ü߃4 1 map.entry_ref("poneyland").or_insert_with(|| 3);Á ü˜„$ü¬ Á„ú œÉ„· üá„; 8 *map.entry_ref("poneyland").or_insert_with(|| 10) *= 2;Á ü¡…$�® <ʅϽ tŽ† Ë„ —£«
|
|||
|
|
Ž
|
|||
|
|
— ™
|
|||
|
|
™
|
|||
|
|
Ž
|
|||
|
|
Í좯
|
|||
|
|
�† –"¢¯
|
|||
|
|
l † ¢¯
|
|||
|
|
˜" Ýõ ¬† ²§
|
|||
|
|
$ㆠç
|
|||
|
|
<ø† ا
|
|||
|
|
\Œ‡
|
|||
|
|
˜
|
|||
|
|
à ò<Ñõ×õÝõãõéõ¢¯
|
|||
|
|
$¯†><µ†„† üߎ£ üĈ_Àº ü¨‰_ª» üŒŠ7 4 function an access to the borrower form of the key.Á ÈŠú tЊÿà ãŠú <ëŠÏ½ Ü÷Š¯Ä —‹ú üŸ‹9 6 let mut map: HashMap<String, usize> = HashMap::new();Á Ý‹ú ´å‹¨¬ ü€ŒM J map.entry_ref("poneyland").or_insert_with_key(|key| key.chars().count());Á üÒŒ$¨À ûŒú œƒ�· ü›�X U *map.entry_ref("poneyland").or_insert_with_key(|key| key.chars().count() * 10) *= 2;Á üø�%ÑÁ <¢ŽÏ½ ”æŽ Ë„ ¢¯
|
|||
|
|
£«
|
|||
|
|
Ž
|
|||
|
|
— ›
|
|||
|
|
›
|
|||
|
|
Ž
|
|||
|
|
˯
|
|||
|
|
ùŽ æ –"¢¯
|
|||
|
|
æ×õ |üŽ æ ¢¯
|
|||
|
|
éµ
|
|||
|
|
˜" Ýõ Š� ²§
|
|||
|
|
$Á� ³‘ LÈ� ç
|
|||
|
|
<â� ا
|
|||
|
|
\ö�
|
|||
|
|
š
|
|||
|
|
à ò<Ñõ×õÝõãõéõ¢¯
|
|||
|
|
$��><“�¥§ üä•7 üù‘,úà ª’ú t²’ÿà Œú <͒Ͻ ÜÙ’¯Ä ù’ú ü�“7«¤
|
|||
|
|
ü½“,ɨ
|
|||
|
|
œî“· ü†”> ; assert_eq!(map.entry_ref("poneyland").key(), "poneyland");Á ´É”¨¬ üä”> ; assert_eq!(map.entry_ref("horseland").key(), "horseland");Á <§•Ï½ ë• ç çË„ ç×õ Ž
|
|||
|
|
ï• Ž
|
|||
|
|
³‘ L‘–
|
|||
|
|
œ
|
|||
|
|
à ò<Ñõ×õÝõãõéõ$ð•ü¹œM üÈ—DÖÇ ü‘˜#¥È ¹˜ú tÁ˜ÿà Ԙú <ܘϽ Üè˜¯Ä ˆ™ú ü�™7«¤
|
|||
|
|
Ì™ú ôÔ™ map.entry_ref("poneyland")Á ü÷™#äÉ ´Ÿš‘Ê üºš%²Ê äšú ôìšðº
|
|||
|
|
ü�›#äÉ ´·›‘Ê üÒ›%šË <ü›Ï½ TÀœ Ë„ ¢¯
|
|||
|
|
Ë„ Ž
|
|||
|
|
— ž
|
|||
|
|
ž
|
|||
|
|
Ž
|
|||
|
|
˯
|
|||
|
|
Ëœ è –"¢¯
|
|||
|
|
èÝõ t÷œ è ¢¯
|
|||
|
|
ö½
|
|||
|
|
˜"
|
|||
|
|
�
|
|||
|
|
à ò<Ñõ×õÝõãõéõ¢¯
|
|||
|
|
$Îœ± Ôœ~€ ü€ŸW Ã
|
|||
|
|
ò< ¡
|
|||
|
|
œ ¢
|
|||
|
|
¢ £
|
|||
|
|
§ ¤
|
|||
|
|
¤ ¥
|
|||
|
|
’ ¦
|
|||
|
|
|
|||
|
|
¢
|
|||
|
|
£
|
|||
|
|
¡
|
|||
|
|
¥
|
|||
|
|
¦
|
|||
|
|
¤
|
|||
|
|
šƒ �Ÿ ¬ƒ �Ÿ ¾ƒ ›Ÿ Ѓ §Ÿ ⃠ªŸ ³ Ýõ <žŸ ôƒ LŸË„ §
|
|||
|
|
¨
|
|||
|
|
…Ÿ‰Ÿ[] _a ce gi km üó¤o üÞŸL°Ý ü¯ >äµ ò ú tú ÿà �¡ú <•¡Ï½ Ü¡¡¯Ä Á¡ú üÉ¡? < let mut map: HashMap<String, Option<u32>> = HashMap::new();Á �¢ú ´•¢¨¬ ü°¢, ) map.entry_ref("poneyland").or_default();Á üá¢'ýß �£ú ü•£1 . map.insert("horseland".to_string(), Some(3));Á Ë£ú œÓ£· üë£F C assert_eq!(map.entry_ref("horseland").or_default(), &mut Some(3));Á <¶¤Ï½ Tú¤ Ë„ £«
|
|||
|
|
Ÿ
|
|||
|
|
Ÿ
|
|||
|
|
²§
|
|||
|
|
$¥ ç
|
|||
|
|
<¥ ا
|
|||
|
|
\Ö¥
|
|||
|
|
§
|
|||
|
|
à ò<Ñõ×õÝõãõéõ$…¥üš ü—§L°Ý üè§%œ° ’¨ú tš¨ÿà ¨ú <µ¨Ï½ ÜÁ¨¯Ä á¨ú üé¨?�Á
|
|||
|
|
©ú ´µ©¨¬ üЩ> ; let entry = map.entry_ref("poneyland").or_default_entry();Á ü“ª*Œ² üª# assert_eq!(entry.get(), &None);Á êªú œòª· üŠ«1¹Â
|
|||
|
|
üÀ«> ; let entry = map.entry_ref("horseland").or_default_entry();Á üƒ¬* ' assert_eq!(entry.key(), &"horseland");Á ü²¬& # assert_eq!(entry.get(), &Some(3));Á <ݬϽ „¡ Ë„ Ö… Ÿ
|
|||
|
|
Ÿ
|
|||
|
|
²§
|
|||
|
|
$î é Ñõò� \õ ا
|
|||
|
|
\�®
|
|||
|
|
¨
|
|||
|
|
à ò<Ñõ×õÝõãõéõ$²üǯT à ª
|
|||
|
|
ò< «
|
|||
|
|
œ ¬
|
|||
|
|
¢
|
|||
|
|
§ ®
|
|||
|
|
¤ ¯
|
|||
|
|
’ °
|
|||
|
|
«
|
|||
|
|
|
|||
|
|
®
|
|||
|
|
¬
|
|||
|
|
ª
|
|||
|
|
°
|
|||
|
|
¯
|
|||
|
|
šƒ Ô¯ ¬ƒ ׯ ¾ƒ ⯠Ѓ å¯ âƒ è¯ ôƒ Lë¯Ã† ±
|
|||
|
|
²
|
|||
|
|
³
|
|||
|
|
̯ЯMO QS UW Y[ ]_ ÔƳ ü¢°IË“
|
|||
|
|
üð°! through the `VacantEntryRef`.Á –±ú tž±ÿà ±±ú <¹±Ï½ Üű¯Ä å±ú üí±7«¤
|
|||
|
|
ü©² let key: &str = "poneyland";Á üβ6 3 assert_eq!(map.entry_ref(key).key(), "poneyland");Á <‰³Ï½ ͳ é éÆ ò� ©
|
|||
|
|
ѳ ©
|
|||
|
|
|
|||
|
|
±
|
|||
|
|
à ò<Ñõ×õÝõãõéõ$Ò³ü£¸u üÿ³@ = Sets the value of the entry with the `VacantEntryRef`'s key,Á üÄ´*Œš
|
|||
|
|
ó´ú tû´ÿà Žµú <–µÏ½ Ü¢µ¯Ä üµ& # use hashbrown::hash_map::EntryRef;Á íµú üõµ7«¤
|
|||
|
|
ü±¶ ´Í
|
|||
|
|
Ö¶ú üÞ¶5 2 if let EntryRef::Vacant(o) = map.entry_ref(key) {Á ¬˜·ý›
|
|||
|
|
,²·õÍ ü¼·%«œ
|
|||
|
|
<æ·Ï½ 4ª¸ Æ Ýõ£«
|
|||
|
|
©
|
|||
|
|
©
|
|||
|
|
²§
|
|||
|
|
$㸠ç
|
|||
|
|
<ø¸ ا
|
|||
|
|
\Œ¹
|
|||
|
|
²
|
|||
|
|
à ò<Ñõ×õÝõãõéõ$±¸»,·¸ü¤¿� ü˜»B ? Sets the value of the entry with the [`VacantEntryRef`]'s key,Á üß»%œ° ‰¼ú t‘¼ÿà ¤¼ú <¬¼Ï½ ܸ¼¯Ä üؼ&ÎÐ
|
|||
|
|
ƒ½ú ü‹½5ù§ Žú üͽ= : if let EntryRef::Vacant(v) = map.entry_ref("poneyland") {Á ü�¾#ÄŸ
|
|||
|
|
ü·¾!òŸ
|
|||
|
|
,ݾõÍ <ç¾Ï½ d«¿ Æ ÝõÖ… ©
|
|||
|
|
©
|
|||
|
|
²§
|
|||
|
|
$þ¿ ç
|
|||
|
|
<“À ا
|
|||
|
|
\§À
|
|||
|
|
³
|
|||
|
|
à ò<Ñõ×õÝõãõéõ$¸¿»,¾¿üåÂ� œ µ
|
|||
|
|
§ ¶
|
|||
|
|
¤ ·
|
|||
|
|
’ ¸
|
|||
|
|
¸
|
|||
|
|
¶
|
|||
|
|
·
|
|||
|
|
µ
|
|||
|
|
|
|||
|
|
çñ ê øñ í ‰ò ð šò ó ɯ°Ã Ú¯$µÃ øø\Âà ¹� <Ðà Ê� <àà «òLêÃ¥é¹
|
|||
|
|
ÅL ¹
|
|||
|
|
eg ik mo qs ü¬Ä= L¯Ä ¥¥é ´
|
|||
|
|
¥ º
|
|||
|
|
º
|
|||
|
|
´
|
|||
|
|
ÍìµÚ
|
|||
|
|
¹Ä ÇLµÚ
|
|||
|
|
Ü¼Ä µÚ
|
|||
|
|
ÈL ³ìlÉÄ
|
|||
|
|
¹
|
|||
|
|
ÝéãéééïéµÚ
|
|||
|
|
ù$ÙÄLN DœÆ ¹
|
|||
|
|
±æ »
|
|||
|
|
Êæ »
|
|||
|
|
èæ »
|
|||
|
|
»
|
|||
|
|
¹
|
|||
|
|
»
|
|||
|
|
ÝéãéééïéµÚ
|
|||
|
|
¯Ö ¥éüîÇu üæÆR O Inserts all new key-values from the iterator and replaces values with existingÁ ü¹Ç4 1 keys with new values returned from the iterator.Á œ ½
|
|||
|
|
§ ¾
|
|||
|
|
¤ ¿
|
|||
|
|
’ À
|
|||
|
|
½
|
|||
|
|
¿
|
|||
|
|
À
|
|||
|
|
¾
|
|||
|
|
çñ óÇ øñ öÇ ‰ò ùÇ šò üÇ É¯³È Ú¯$¸È øø\ÅÈ «òLÙÈ¥éÁ
|
|||
|
|
ÒL Á
|
|||
|
|
SU WY [] _a üØÓ= üêÈS P Inserts all new key-values from the iterator to existing `HashMap<K, V, S, A>`.Á üÂÉQ N Replace values with existing keys with new values returned from the iterator.Á ˜Êú t Êÿà ³Êú <»ÊϽ üÇÊ% " use hashbrown::hash_map::HashMap;Á ñÊú üùÊ!ÜÐ ¼ŸË map.insert(1, 100);Á »Ëú üÃË1 . let some_iter = [(1, 1), (2, 2)].into_iter();Á ÔùË map.extend(some_iter);Á ü˜ÌT Q // Replace values with existing keys with new values returned from the iterator.Á üñÌ9 6 // So that the map.get(&1) doesn't return Some(&100).Á ü¯Í& # assert_eq!(map.get(&1), Some(&1));Á ÚÍú üâÍ0 - let some_vec: Vec<_> = vec![(3, 3), (4, 4)];Á Ì—Î map.extend(some_vec);Á µÎú ü½Î$ ! let some_arr = [(5, 5), (6, 6)];Á ÌæÎ map.extend(some_arr);Á ü„Ï let old_map_len = map.len();Á ©Ïú ü±Ï/ , // You can also extend from another HashMapÁ üåÏ% " let mut new_map = HashMap::new();Á Ä�Ð new_map.extend(map);Á ü¬Ð+ ( assert_eq!(new_map.len(), old_map_len);Á ÜÐú üäÐ8 5 let mut vec: Vec<_> = new_map.into_iter().collect();Á ü¡ÑHµÁ üîÑ@¡é ijÒðÔ üÐÒF C assert_eq!(vec, [(1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6)]);Á <›ÓϽ 4ÛÓ ê ê¥éµÚ
|
|||
|
|
¼
|
|||
|
|
¥ Â
|
|||
|
|
Â
|
|||
|
|
‚Ô ¼
|
|||
|
|
ÞÚ
|
|||
|
|
âÓ ðÚ
|
|||
|
|
ÜåÓ �Û
|
|||
|
|
lòÓ
|
|||
|
|
Á
|
|||
|
|
ÝéãéééïéµÚ
|
|||
|
|
$‡Ôù$�ÔAC l�Ø Á
|
|||
|
|
±æ Ã
|
|||
|
|
Êæ Ã
|
|||
|
|
èæ Ã
|
|||
|
|
Ã
|
|||
|
|
Á
|
|||
|
|
Ã
|
|||
|
|
ÝéãéééïéµÚ
|
|||
|
|
®Ü
|
|||
|
|
ºÜ
|
|||
|
|
üíÞ• üåÝRÔÛ
|
|||
|
|
ü¸Þ4±Ü
|
|||
|
|
à Å
|
|||
|
|
œ Æ
|
|||
|
|
§ Ç
|
|||
|
|
¤ È
|
|||
|
|
’ É
|
|||
|
|
Å
|
|||
|
|
Æ
|
|||
|
|
È
|
|||
|
|
É
|
|||
|
|
Ç
|
|||
|
|
|
|||
|
|
Íý öÞ Þý ùÞ ºÄ
|
|||
|
|
üÞ Ó¥
|
|||
|
|
ÿÞ ü– ¾ß �— $Ãß Š æê $Êß Š ‹í $×ß ‚« \äß å¥
|
|||
|
|
LøßÂ÷Ê
|
|||
|
|
ÒL Ê
|
|||
|
|
òÞ|~ €‚ „† ˆŠ ü¯ìE ü‰àSÇÞ
|
|||
|
|
üáàQ¥ß
|
|||
|
|
ü·á6 3 The keys and values must implement [`Copy`] trait.Á òáú üúáC @ [`Copy`]: https://doc.rust-lang.org/core/marker/trait.Copy.htmlÁ Ââú tÊâÿà Ýâú <åâϽ üñâ%·à
|
|||
|
|
›ãú ü£ã!ÜÐ ¼Éã‚á
|
|||
|
|
åãú üíã let arr = [(1, 1), (2, 2)];Á ü‘ä4 1 let some_iter = arr.iter().map(|(k, v)| (k, v));Á ÔÊäìá
|
|||
|
|
üéäT‘â
|
|||
|
|
üÂå9ðâ
|
|||
|
|
ü€æ&´ã
|
|||
|
|
«æú ü³æ0òã
|
|||
|
|
üèæ5 2 map.extend(some_vec.iter().map(|(k, v)| (k, v)));Á ¢çú üªç$Ýä
|
|||
|
|
üÓç5 2 map.extend(some_arr.iter().map(|(k, v)| (k, v)));Á �èú ü•è/çå
|
|||
|
|
üÉè%¡æ
|
|||
|
|
Ìóè new_map.extend(&map);Á ì‘é assert_eq!(new_map, map);Á ³éú ü»é8¶ç
|
|||
|
|
üøéHµÁ üÅê@¡é ÄŠëðÔ ü§ëF¥è
|
|||
|
|
<òëϽ 4²ì ë ëÂ÷¥ Ä
|
|||
|
|
¥ Ë
|
|||
|
|
Ë
|
|||
|
|
áì Ä
|
|||
|
|
Íìíõ
|
|||
|
|
¹ì ÇLíõ
|
|||
|
|
ü¼ì# íõ
|
|||
|
|
ÈL þþ¬Éì
|
|||
|
|
Ê
|
|||
|
|
Ãæê‹í“ó³ñíõ
|
|||
|
|
$æìù$ìì[] „ í Ê
|
|||
|
|
±æ Ì
|
|||
|
|
Êæ Ì
|
|||
|
|
èæ Ì
|
|||
|
|
Ì
|
|||
|
|
Ê
|
|||
|
|
Ì
|
|||
|
|
æê‹í“ó³ñíõ
|
|||
|
|
‰™ ¦ÿ ü‚ñ‘ üúïRÔÛ
|
|||
|
|
üÍð4±Ü
|
|||
|
|
à Î
|
|||
|
|
œ Ï
|
|||
|
|
§ Ð
|
|||
|
|
¤ Ñ
|
|||
|
|
’ Ò
|
|||
|
|
Ð
|
|||
|
|
Î
|
|||
|
|
Ï
|
|||
|
|
Ñ
|
|||
|
|
Ò
|
|||
|
|
|
|||
|
|
Íý ‹ñ Þý Žñ ºÄ
|
|||
|
|
‘ñ Ó¥
|
|||
|
|
”ñ ü– Ïñ �— $Ôñ Éí
|
|||
|
|
$Ûñ Úí
|
|||
|
|
$èñ ‚« \õñ å¥
|
|||
|
|
L‰òÂ÷Ó
|
|||
|
|
ÒL Ó
|
|||
|
|
‡ñln pr tv xz üËüA üšòSÇÞ
|
|||
|
|
üòòQ¥ß
|
|||
|
|
üÈó6öí
|
|||
|
|
ƒôú ü‹ôCÄî
|
|||
|
|
Óôú tÛôÿà îôú <öôϽ ü‚õ%·à
|
|||
|
|
¬õú ü´õ!ÜÐ ¼Úõ‚á
|
|||
|
|
öõú üþõ Žð
|
|||
|
|
ü¢ö let some_iter = arr.iter();Á ÔÆöìá
|
|||
|
|
üåöT‘â
|
|||
|
|
ü¾÷9ðâ
|
|||
|
|
üü÷&´ã
|
|||
|
|
§øú ü¯ø0òã
|
|||
|
|
Ôäø map.extend(&some_vec);Á ƒùú ü‹ù$Ýä
|
|||
|
|
Ô´ù map.extend(&some_arr);Á Óùú üÛù4 1 let mut vec: Vec<_> = map.into_iter().collect();Á ü”úHµÁ üáú@¡é ĦûðÔ üÃûF¥è
|
|||
|
|
<ŽüϽ 4Îü ì ìÂ÷íõ
|
|||
|
|
Í
|
|||
|
|
¥ Ô
|
|||
|
|
Ô
|
|||
|
|
ùü Í
|
|||
|
|
šö
|
|||
|
|
Õü ¬ö
|
|||
|
|
üØü íõ
|
|||
|
|
ÈL ÿŒåü
|
|||
|
|
Ó
|
|||
|
|
Ãæê‹í“ó³ñíõ
|
|||
|
|
$þüù$„ýSU |¸ý Ó
|
|||
|
|
±æ Õ
|
|||
|
|
Êæ Õ
|
|||
|
|
èæ Õ
|
|||
|
|
Õ
|
|||
|
|
Ó
|
|||
|
|
Õ
|
|||
|
|
æê‹í“ó³ñíõ
|
|||
|
|
¦ÿ ¦ÿ ´ € Œ£€ Ž
|
|||
|
|
Ö
|
|||
|
|
ü½€ H<À€ Ž ¨ ¨ � µ6 ®‚ Õ:Ç$Ö> E Ñë‹ò ¨ ¨ � µ6 ®‚ Õ:Ç$Ö> E °k Ñë‹ò °k Ø
|
|||
|
|
Ø
|
|||
|
|
|
|||
|
|
×
|
|||
|
|
°kÁ ΀ $È€ üœ� H<Ÿ� Ž ¨ ¨ � µ6 ®‚ Õ:Ç$Ö> E΂Ñë‹ò ¨ ¨ � µ6 ®‚ Õ:Ç$Ö> E•ƒÑë‹ò °k Ú
|
|||
|
|
Ú
|
|||
|
|
|
|||
|
|
Ù
|
|||
|
|
°kÁ � $§� üû� ODþ� Ž Ü
|
|||
|
|
ò ò éD öÔ Ž ÷Ú Ž 5G®Ï&€u Ü
|
|||
|
|
΂ ò ò éD öÔ Ž ÷Ú Ž 5G®Ï&€u Ü
|
|||
|
|
•ƒ °k Ý
|
|||
|
|
Ý
|
|||
|
|
‡‚
|
|||
|
|
Û
|
|||
|
|
°kÁ ‘‚ $‹‚ üá‚ ODä‚ Ž ß
|
|||
|
|
ò ò éD öÔ Ž ÷Ú Ž 5G®Ï&€u ß
|
|||
|
|
΂ ò ò éD öÔ Ž ÷Ú Ž 5G®Ï&€u ß
|
|||
|
|
•ƒ °k à
|
|||
|
|
à
|
|||
|
|
í‚
|
|||
|
|
Þ
|
|||
|
|
°kÁ ÷‚ $ñ‚ üǃ slʃ Ž � � Ò
|
|||
|
|
‘Ô Ž õsY4è±ô΂òá � � Ò
|
|||
|
|
‘Ô Ž õsY4è±ô•ƒòá °k â
|
|||
|
|
’ ã
|
|||
|
|
ã
|
|||
|
|
â
|
|||
|
|
�Ó Þƒ “ÓLáƒ
|
|||
|
|
á
|
|||
|
|
°kòáÁ õƒ $؃ -/ üÑ„ slÔ„ Ž � � Ò
|
|||
|
|
‘Ô Ž õsY4è±ô΂òá � � Ò
|
|||
|
|
‘Ô Ž õsY4è±ô•ƒòá °k å
|
|||
|
|
’ æ
|
|||
|
|
æ
|
|||
|
|
å
|
|||
|
|
�Ó è„ “ÓLë„
|
|||
|
|
ä
|
|||
|
|
°kòáÁ ÿ„ $â„ -/ üÛ… ODÞ… Ž è
|
|||
|
|
á á ½K åÔ Ž íýW*¸¡ÀÑ è
|
|||
|
|
΂ á á ½K åÔ Ž íýW*¸¡ÀÑ è
|
|||
|
|
•ƒ °k é
|
|||
|
|
é
|
|||
|
|
ç…
|
|||
|
|
ç
|
|||
|
|
°kÁ ñ… $ë… üÁ† ODĆ Ž ë
|
|||
|
|
á á ½K åÔ Ž íýW*¸¡ÀÑ ë
|
|||
|
|
΂ á á ½K åÔ Ž íýW*¸¡ÀÑ ë
|
|||
|
|
•ƒ °k ì
|
|||
|
|
ì
|
|||
|
|
͆
|
|||
|
|
ê
|
|||
|
|
°kÁ ׆ $ц ü§‡ UTª‡ Ž î
|
|||
|
|
î î £L òÔ Ž h ±ULö� î
|
|||
|
|
΂ î î £L òÔ Ž h ±ULö� î
|
|||
|
|
•ƒ °k ï
|
|||
|
|
ï
|
|||
|
|
µ‡
|
|||
|
|
í
|
|||
|
|
°kÁ ¿‡ $¹‡ ü“ˆ UT–ˆ Ž ñ
|
|||
|
|
î î £L òÔ Ž h ±ULö� ñ
|
|||
|
|
΂ î î £L òÔ Ž h ±ULö� ñ
|
|||
|
|
•ƒ °k ò
|
|||
|
|
ò
|
|||
|
|
¡ˆ
|
|||
|
|
ð
|
|||
|
|
°kÁ «ˆ $¥ˆ üÿˆ q,‚‰ Ž û û ‹M €Ô Ž á6´ïÖ6 ΂΂‹ò û û ‹M €Ô Ž á6´ïÖ6 °k•ƒ•ƒ‹ò °k ô
|
|||
|
|
ô
|
|||
|
|
|
|||
|
|
ó
|
|||
|
|
°k¯ —‰ $ˆ‰ lá » raw-entryÁ¬É ìà Lå � — £ ¶ ¾ èT  õ
|
|||
|
|
÷
|
|||
|
|
íÕL" Ç õ
|
|||
|
|
ø
|
|||
|
|
í†7\- ¶ õ
|
|||
|
|
ù
|
|||
|
|
íí¶LL 1 õ
|
|||
|
|
û
|
|||
|
|
j ^ cõ4W � õ
|
|||
|
|
ü
|
|||
|
|
™ñ4_ Ä õ
|
|||
|
|
ý
|
|||
|
|
k _ d™ñ Å õ
|
|||
|
|
ý
|
|||
|
|
k _ dâDg — õ
|
|||
|
|
þ
|
|||
|
|
ÑT~ õ
|
|||
|
|
€ õ�<Š ¨ õ
|
|||
|
|
� ò×$¤ ` õ
|
|||
|
|
ƒ p,ª ¿c õ
|
|||
|
|
„ p Âc õ
|
|||
|
|
„ \\Ã Åe õ
|
|||
|
|
† Ž$Ð še õ
|
|||
|
|
‡ Ž e õ
|
|||
|
|
‡ í á ë õ
|
|||
|
|
ˆ |ˆ‹vydgT?TW>A/2ùû,vìîÙÛL˜È žº¼T¶›�ŠŒLÛiüç/ œ Š § ‹ ¤ Œ ’ � ‹ Œ Š � çñ ì øñ ï ‰ò ò šò õ «òLø¥éŽ � .0 35 8: =? üç#E ü�2 / Creates a raw entry builder for the `HashMap`.Á Ôú üÜE B Raw entries provide the lowest level of control for searching andÁ ü¦I F manipulating a map. They must be manually initialized with a hash andÁ üôF C then manually searched. After this, insertions into a vacant entryÁ ü¿. + still require an owned key to be provided.Á òú üú9 6 Raw entries are useful for such exotic situations as:Á ¸ú ´À * Hash memoizationÁ üÛM J * Deferring the creation of an owned key until it is known to be requiredÁ ü@ = * Using a search key that doesn't work with the Borrow traitÁ üò< 9 * Using custom comparison logic without newtype wrappersÁ ³ú ü»M J Because raw entries provide much more low-level control, it's much easierÁ ü�M J to put the `HashMap` into an inconsistent state which, while memory-safe,Á üßL I will cause the map to produce seemingly random results. Higher-level andÁ ü° G D more foolproof APIs like `entry` should be preferred when possible.Á ü ú ü„
|
|||
|
|
K H In particular, the hash used to initialized the raw entry must still beÁ üÔ
|
|||
|
|
O L consistent with the hash of the key that is ultimately stored in the entry.Á ü¨ M J This is because implementations of `HashMap` may need to recompute hashesÁ üú > ; when resizing, at which point only the keys are available.Á ½ ú üÅ F C Raw entries give mutable access to the keys. This must not be usedÁ ü�
|
|||
|
|
P M to modify how the key would compare or hash, as the map will not re-evaluateÁ üå
|
|||
|
|
H E where the key should go, meaning the keys may become "lost" if theirÁ ü²L I location does not reflect their state. For instance, if you change a keyÁ üƒK H so that the map now contains keys which compare equal, search may startÁ üÓR O acting erratically, with two keys randomly masking each other. ImplementationsÁ üªP M are free to assume this doesn't happen (within the limits of memory-safety).Á ÿú t‡ÿà šú <¢Ï½ ü®( % use core::hash::{BuildHasher, Hash};Á üÛ4 1 use hashbrown::hash_map::{HashMap, RawEntryMut};Á ”ú üœ!ÜÐ üÂ5 2 map.extend([("a", 100), ("b", 200), ("c", 300)]);Á üú ü„Y V fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {Á üâ use core::hash::Hasher;Á ü†4 1 let mut state = hash_builder.build_hasher();Á ì¿ key.hash(&mut state);Á ´á state.finish()Á ,üõÍ †ú üŽ'ãÔ
|
|||
|
|
üº. + match map.raw_entry_mut().from_key(&"a") {Á üí1 . RawEntryMut::Vacant(_) => unreachable!(),Á ü£, ) RawEntryMut::Occupied(mut view) => {Á üÔ)ãÕ
|
|||
|
|
ü‚#—Ö
|
|||
|
|
üª" let new_v = (*v) * 10;Á ¼Ñ *v = new_v;Á üí0äÖ
|
|||
|
|
L¢¦Ò ,°õÍ ºú ü È×
|
|||
|
|
ìçêÑ ‰ú Ô‘�Ø
|
|||
|
|
ü°0 - let hash = compute_hash(map.hasher(), &"c");Á üåC @ match map.raw_entry_mut().from_key_hashed_nocheck(hash, &"c") {Á ü1¬¯ üã( % RawEntryMut::Occupied(view) => {Á ü�8 5 assert_eq!(view.remove_entry(), ("c", 300));Á LÍ¦Ò ,ÛõÍ üå5 2 assert_eq!(map.raw_entry().from_key(&"c"), None);Á ìŸ žÚ
|
|||
|
|
Á ú üÉ *ùé
|
|||
|
|
”ø let key = "d";Á ü� 0 - let hash = compute_hash(map.hasher(), &key);Á üÄ > ; match map.raw_entry_mut().from_hash(hash, |q| *q == key) {Á ü‡ 3 0 RawEntryMut::Occupied(_) => unreachable!(),Á ü¿ & # RawEntryMut::Vacant(view) => {Á üê 4 1 let (k, value) = view.insert("d", 4000);Á ü£ 2 / assert_eq!((*k, *value), ("d", 4000));Á ÜÚ *value = 40000;Á Lú ¦Ò ,ˆ õÍ ü’ ! assert_eq!(map[&"d"], 40000);Á ì¸ êÑ Ú ú üâ >˵ ü¥!1¬¯ üÛ!(‚³ üˆ": 7 assert_eq!(view.remove_entry(), ("d", 40000));Á LÇ"¦Ò ,Õ"õÍ üß"$ ! assert_eq!(map.get(&"d"), None);Á ìˆ#žÚ
|
|||
|
|
<ª#Ͻ lî# í í¥é � � ¢o – Ø õ
|
|||
|
|
Ì@™âP<Ý íÝéãéééïé ‰ ü# ‰
|
|||
|
|
Ž Ýéãéééïé$�$ü©2: üã$< 9 Creates a raw immutable entry builder for the `HashMap`.Á ¤%ú ü¬%E‰› üö%IØ› ÜÄ& then manually searched.Á ä&ú ´ì& This is useful forÁ ´‡'�ž ü¢'@„Ÿ üç'<Ο ¨(ú ü°(Q N Unless you are in such a situation, higher-level and more foolproof APIs likeÁ ô†) `get` should be preferred.Á ©)ú ü±)X U Immutable raw entries have very limited use; you might instead want `raw_entry_mut`.Á Ž*ú t–*ÿà ©*ú <±*Ͻ ü½*(éª Üê*¯Ä Š+ú ü’+!ÜÐ ü¸+5ó« ò+ú üú+Y¾¬ üØ, ¡ üü,4Ê ìµ-‡® ´×-® ,ò-õÍ ü-ú ü„.- * for k in ["a", "b", "c", "d", "e", "f"] {Á ü¶.1 . let hash = compute_hash(map.hasher(), k);Á üì.% " let v = map.get(&k).cloned();Á ü–/- * let kv = v.as_ref().map(|v| (&k, v));Á È/ú üÐ/2 / println!("Key: {} and value: {:?}", k, v);Á ‡0ú ü�05 2 assert_eq!(map.raw_entry().from_key(&k), kv);Á üÉ0E B assert_eq!(map.raw_entry().from_hash(hash, |q| *q == k), kv);Á ü“1J G assert_eq!(map.raw_entry().from_key_hashed_nocheck(hash, &k), kv);Á ,â1õÍ <ì1Ͻ L°2 î î¥é ¾ ¾ Çr Ä Ø õ
|
|||
|
|
%ø:Îi1œÉ îÝéãéééïé ‰ º2 ‰
|
|||
|
|
� Ýéãéééïé$»2ü¢BA ü•3T Q A builder for computing where in a [`HashMap`] a key-value pair would be stored.Á ê3ú üî3? < See the [`HashMap::raw_entry_mut`] docs for usage examples.Á ®4ú ü²4H E [`HashMap::raw_entry_mut`]: struct.HashMap.html#method.raw_entry_mutÁ û4ú tÿ4ÿà Ž5ú <’5Ͻ üš5^ [ use hashbrown::hash_map::{RawEntryBuilderMut, RawEntryMut::Vacant, RawEntryMut::Occupied};Á Üù5¯Ä ü•6(éª ¾6ú üÂ6!ÜÐ üä6G D map.extend([(1, 11), (2, 12), (3, 13), (4, 14), (5, 15), (6, 16)]);Á ì¬7ó€ Ê7ú üÎ7Y¾¬ ü¨8 ¡ üÈ84Ê ìý8‡® ´›9® ,²9õÍ ¸9ú ü¼9C @ let builder: RawEntryBuilderMut<_, _, _> = map.raw_entry_mut();Á €:ú œ„: // Existing keyÁ ü˜: match builder.from_key(&6) {Á ü¹:$ ! Vacant(_) => unreachable!(),Á üÞ:6 3 Occupied(view) => assert_eq!(view.get(), &16),Á ,•;õÍ ›;ú ´Ÿ; for key in 0..12 {Á ü¶;4 1 let hash = compute_hash(map.hasher(), &key);Á üë;+ ( let value = map.get(&key).cloned();Á ü—<: 7 let key_value = value.as_ref().map(|v| (&key, v));Á Ò<ú üÖ<8 5 println!("Key: {} and value: {:?}", key, value);Á �=ú ü“=2 / match map.raw_entry_mut().from_key(&key) {Á üÆ=N K Occupied(mut o) => assert_eq!(Some(o.get_key_value()), key_value),Á ü•>1 . Vacant(_) => assert_eq!(value, None),Á LÇ>¦Ò üÑ>G D match map.raw_entry_mut().from_key_hashed_nocheck(hash, &key) {Á ü™?NÉÑ üè?1¡Ò Lš@¦Ò ü¤@B ? match map.raw_entry_mut().from_hash(hash, |q| *q == key) {Á üç@NÉÑ ü¶A1¡Ò LèA¦Ò ,òAõÍ øAú ìüAó€ <šBϽ ¼Y à ‘ œ ’ § “ ¤ ” ’ • ’ ” • “ ‘ Íý ÄB Þý ÇB ºÄ
|
|||
|
|
ÊB Ó¥
|
|||
|
|
¬ÍB å¥
|
|||
|
|
LÐB â© üêB ó© îÄ
|
|||
|
|
…¦
|
|||
|
|
� � ¢o – Ø õ
|
|||
|
|
Ì@™âP<Ý Ãæê‹í“ó³ñ Ì@™âP<Ý – ÀBŸ¡ ¤¦ ©« ® ÍB ‹ò ° êBõ
|
|||
|
|
� � ’øü›Y8 ü�CP�¶
|
|||
|
|
àCú üäC/ , This is a lower-level version of [`Entry`].Á ”Dú ü˜DS P This `enum` is constructed through the [`raw_entry_mut`] method on [`HashMap`],Á üìDC @ then calling one of the methods of that [`RawEntryBuilderMut`].Á °Eú ü´E$Å£ ôÙE‚æ
|
|||
|
|
üøE? < [`raw_entry_mut`]: struct.HashMap.html#method.raw_entry_mutÁ ü¸F: 7 [`RawEntryBuilderMut`]: struct.RawEntryBuilderMut.htmlÁ óFú t÷Fÿà †Gú <ŠGϽ ü’G(éª ü»GI F use hashbrown::hash_map::{HashMap, RawEntryMut, RawOccupiedEntryMut};Á …Hú ü‰H!ÜÐ ü«H/ , map.extend([('a', 1), ('b', 2), ('c', 3)]);Á ìÛHêÑ ùHú üýHY¾¬ ü×I ¡ ü÷I4Ê ì¬J‡® ´ÊJ® ,áJõÍ çJú äëJ‘º
|
|||
|
|
üˆKG D let raw: RawEntryMut<_, _, _> = map.raw_entry_mut().from_key(&'a');Á üÐKC @ let _raw_o: RawOccupiedEntryMut<_, _, _> = raw.insert('a', 10);Á ì”LêÑ ²Lú ü¶L Ä»
|
|||
|
|
üÖL7 4 map.raw_entry_mut().from_key(&'d').insert('d', 40);Á ìŽM“Š ¬Mú ü°M ¢¼
|
|||
|
|
üÐM0 - let hash = compute_hash(map.hasher(), &'b');Á „�N
|
|||
|
|
let kv = mapÁ Ä’N .raw_entry_mut()Á ü«N, ) .from_key_hashed_nocheck(hash, &'b')Á äØN .or_insert('b', 20);Á üõN' $ assert_eq!(kv, (&mut 'b', &mut 2));Á |�O *kv.1 = 20;Á ìO“Š ËOú üÏO"¶½
|
|||
|
|
üòO0 - let hash = compute_hash(map.hasher(), &'e');Á „£Pïà Ä´Pˆá üÍP, ) .from_key_hashed_nocheck(hash, &'e')Á äúP .or_insert('e', 50);Á ü—Q( % assert_eq!(kv, (&mut 'e', &mut 50));Á ìÀQ¨© ÞQú üâQ$›¾
|
|||
|
|
ü‡R0 - let hash = compute_hash(map.hasher(), &'c');Á „¸Rïà ÄÉRˆá üâR' $ .from_hash(hash, |q| q == &'c')Á üŠS& # .or_insert_with(|| ('c', 30));Á ü±S' $ assert_eq!(kv, (&mut 'c', &mut 3));Á |ÙS *kv.1 = 30;Á ìéS¨© ‡Tú ü‹T'¼¿
|
|||
|
|
ü³T0 - let hash = compute_hash(map.hasher(), &'f');Á „äTïà ÄõTˆá üŽU' $ .from_hash(hash, |q| q == &'f')Á ü¶U& # .or_insert_with(|| ('f', 60));Á üÝU( % assert_eq!(kv, (&mut 'f', &mut 60));Á ì†Vó€ ¤Vú ü¨V'®À
|
|||
|
|
ÐVú üÔVFíÀ
|
|||
|
|
ü›WDÒè üàW@¡é Ä¡XðÔ üºXX U assert_eq!(vec, [('a', 10), ('b', 20), ('c', 30), ('d', 40), ('e', 50), ('f', 60)]);Á <“YϽ ÎY à ˜ œ ™ § š ¤ › ’ œ š › ™ œ ˜ Íý ´Y Þý ·Y ºÄ
|
|||
|
|
ºY Ó¥
|
|||
|
|
¬½Y å¥
|
|||
|
|
LÀY â© ü¦p" ó© …¦
|
|||
|
|
îÄ
|
|||
|
|
œÎp — � ž óO Ÿ ˆ ¡ �P ¢ ˆ "ø0ôÂw‚ Ãæê‹í“ó³ñ "ø0ôÂw‚ � ž ¡ ž Ÿ £ £ Ñp © �Q õ
|
|||
|
|
ª ‚ õ
|
|||
|
|
« µ6 õ
|
|||
|
|
©B·á}ÂÞø Ãæê‹í“ó³ñùì ¡ ¢ ¶ ¶ öq ¼ ‚ õ
|
|||
|
|
½ µ6 õ
|
|||
|
|
⊶^_X Ãæê‹í“ó³ñùì °YŠ� ‘” ˜› Ÿ ½Y ‹ò º ´ÚY¥Ç
|
|||
|
|
õYú týYÿà �Zú <˜ZϽ ü¤Z4 1 use hashbrown::{hash_map::RawEntryMut, HashMap};Á üÝZAµÈ
|
|||
|
|
£[ú ü«[.ô® üÞ[1¬¯ ü”\' $ RawEntryMut::Occupied(_) => { }Á ,À\õÍ <Ê\Ͻ º — —
|
|||
|
|
ž Ãæê‹í“ó³ñºº úíùì — — —òüß\# — — úí» œ‰]·Ë
|
|||
|
|
¡]ú t©]ÿà ¼]ú <Ä]Ͻ üÐ]4Ïï ü‰^5¸� Ã^ú üË^- * match map.raw_entry_mut().from_key("a") {Á üý^3“¶ üµ_% " RawEntryMut::Vacant(_) => { }Á ,ß_õÍ <é_Ͻ » — —
|
|||
|
|
¡ Ãæê‹í“ó³ñ»» çîùì — — ”õüü_! — — çîüÃoB ü£`1 . A view into an occupied entry in a `HashMap`.Á üÕ`+ ( It is part of the [`RawEntryMut`] enum.Á �aú ü…a* ' [`RawEntryMut`]: enum.RawEntryMut.htmlÁ °aú t´aÿà Ãaú <ÇaϽ üÏa(éª üøaIàÛ Âbú üÆb!ÜÐ üèb2º¹
|
|||
|
|
›cú üŸcY¾¬ üùc ¡ ü™d4Ê ìÎd‡® ´ìd® ,ƒeõÍ ‰eú ü�ec ` let _raw_o: RawOccupiedEntryMut<_, _, _> = map.raw_entry_mut().from_key(&"a").insert("a", 100);Á ìñeêÑ �fú ü“f'ãÔ
|
|||
|
|
ü»f.ô® üêf1¬¯ üœg,ç¯ üÉg)ãÕ
|
|||
|
|
üóg#—Ö
|
|||
|
|
ü—h"¹° ¼ºhä° üÒh0äÖ
|
|||
|
|
Lƒi¦Ò ,�iõÍ “iú ü—i È×
|
|||
|
|
ì¸iêÑ Öiú ÔÚi�Ø
|
|||
|
|
üõi0í± ü¦jC§² üêj1¬¯ üœk(‚³ üÅk7’Ù
|
|||
|
|
Lýk¦Ò ,‡lõÍ ü�l5�´ ìÃlžÚ
|
|||
|
|
álú üål0 - let hash = compute_hash(map.hasher(), &"b");Á ü–m> ; match map.raw_entry_mut().from_hash(hash, |q| *q == "b") {Á üÕm1¬¯ ü‡n(‚³ ü°n7 4 assert_eq!(view.remove_entry(), ("b", 20));Á Lèn¦Ò ,ònõÍ üøn$ ! assert_eq!(map.get(&"b"), None);Á ì�o†Ÿ <»oϽ àY à ¤ œ ¥ § ¦ ¤ § ’ ¨ ¨ ¤ ¦ § ¥ Íý æo Þý éo ºÄ
|
|||
|
|
ìo Ó¥
|
|||
|
|
¬ïo å¥
|
|||
|
|
Lòo â© ç ó© î …¦
|
|||
|
|
õ îÄ
|
|||
|
|
ç úí ©B·á}ÂÞø © ª « âodf ik np s ïo ‹ò ¤Œp$Œpõ
|
|||
|
|
£ £ ŒÞ
|
|||
|
|
x
|
|||
|
|
,¦põ
|
|||
|
|
£ £ à — — â š‚ A ›¤ A œÚ A i†bªñüz¦ÿ³ñÌ
|
|||
|
|
dÎpõ
|
|||
|
|
£ £ Óó üæpŠ 8 ï œ § ® ¤ ¯ ’ ° ® ï ¯ ° Íý òp Þý õp ºÄ
|
|||
|
|
øp Ó¥
|
|||
|
|
ûp ѹ $¸q ã¹ $Åq èß
|
|||
|
|
$Òq úß
|
|||
|
|
$ßq å¥
|
|||
|
|
Læq¸ÿ HJ MO RT WY üõqŠ 8 ð œ ² § ³ ¤ ´ ’ µ ´ µ ³ ð ² Íý �r Þý „r ºÄ
|
|||
|
|
‡r Ó¥
|
|||
|
|
Šr Êá
|
|||
|
|
$Çr Ûá
|
|||
|
|
$Ôr ìá
|
|||
|
|
$ár ýá
|
|||
|
|
$îr å¥
|
|||
|
|
Lõr¸ÿ HJ MO RT WY üà@ ü…s.�å
|
|||
|
|
ü´s+Ðõ àsú üäs*‘ö �tú t“tÿà ¢tú <¦tϽ ü®t(éª ü×tG D use hashbrown::hash_map::{HashMap, RawEntryMut, RawVacantEntryMut};Á Ÿuú ü£u.´ç
|
|||
|
|
Òuú üÖuY¾¬ ü°v ¡ üÐv4Ê ì…w‡® ´£w® ,ºwõÍ Àwú üÄwV S let raw_v: RawVacantEntryMut<_, _, _> = match map.raw_entry_mut().from_key(&"a") {Á ü›x* ' RawEntryMut::Vacant(view) => view,Á üÆx3“¶ 4úx€é
|
|||
|
|
Ô�y raw_v.insert("a", 10);Á üœy/²é
|
|||
|
|
Ìyú üÐy*ùé
|
|||
|
|
üûy0ˆü ü¬zC @ match map.raw_entry_mut().from_key_hashed_nocheck(hash, &"b") {Á üðz3“¶ ü¤{&ж üË{1 . let (k, value) = view.insert("b", 2);Á üý{/ , assert_eq!((*k, *value), ("b", 2));Á Ä|êë
|
|||
|
|
LÆ|¦Ò ,Ð|õÍ üÖ|/©ì
|
|||
|
|
†}ú üŠ}0í± ü»}> ; match map.raw_entry_mut().from_hash(hash, |q| *q == "c") {Á üú}3“¶ ü®~&ж üÕ~B ? assert_eq!(view.insert("c", 30), (&mut "c", &mut 30));Á L˜¦Ò ,¢õÍ ü¨/ , assert!(map[&"c"] == 30 && map.len() == 3);Á <ØϽ òY à · œ ¸ § ¹ ¤ º ’ » ¹ · ¸ º » Íý �€ Þý „€ ºÄ
|
|||
|
|
‡€ Ó¥
|
|||
|
|
¬Š€ å¥
|
|||
|
|
L�€ â© ü§€" ó©
|
|||
|
|
…¦
|
|||
|
|
îÄ
|
|||
|
|
œÏ€çî ⊶^_X ¼ ½ ýjl np rt v Š€ ‹ò w,§€õ
|
|||
|
|
¶ ¶ ð�|dÏ€õ
|
|||
|
|
¶ ¶ Ù‚üç‰> üç€T�Ç ¼�ú üÀ�; 8 See the [`HashMap::raw_entry`] docs for usage examples.Á ü�ú ü€‚@ = [`HashMap::raw_entry`]: struct.HashMap.html#method.raw_entryÁ Á‚ú tÅ‚ÿà Ԃú <؂Ͻ üà‚8 5 use hashbrown::hash_map::{HashMap, RawEntryBuilder};Á ü™ƒ(éª Âƒú üƃ!ÜÐ üèƒ, ) map.extend([(1, 10), (2, 20), (3, 30)]);Á •„ú ü™„Y¾¬ üó„ ¡ ü“…4Ê ìÈ…‡® ´æ…® ,ý…õÍ ƒ†ú œ‡† for k in 0..6 {Á ü›†2 / let hash = compute_hash(map.hasher(), &k);Á üΆ%¬Â üô†-Û ¢‡ú ü¦‡2žÃ üÙ‡@ = let builder: RawEntryBuilder<_, _, _> = map.raw_entry();Á üšˆ- * assert_eq!(builder.from_key(&k), kv);Á üȈE¥Ä üŽ‰JôÄ ,Ù‰õÍ <߉Ͻ Z à ¿ œ À § Á ¤  ’ à  À Á ¿ à Íý †Š Þý ‰Š ºÄ
|
|||
|
|
ŒŠ Ó¥
|
|||
|
|
¬�Š å¥
|
|||
|
|
L’Š ⩠䬊 ó© îÄ
|
|||
|
|
…¦
|
|||
|
|
¾ ¾ Çr Ä Ø õ
|
|||
|
|
%ø:Îi1œÉ Ãæê‹í“ó³ñ %ø:Îi1œÉ Ä ‚Š¥§ ©« ¯ ± �Š ‹ò ² ¬Šõ
|
|||
|
|
¾ ¾ ¼÷üÍŠB Ã Æ œ Ç § È ¤ É ’ Ê Æ Ç É Ê È Íý ÖŠ Þý ÙŠ ºÄ
|
|||
|
|
ÜŠ Ó¥
|
|||
|
|
ߊ å¥
|
|||
|
|
L⊠×Ë Í ÒŠ:< >@ BD FH ü‹�Š ü–‹/ , Creates a `RawEntryMut` from the given key.Á Ê‹ú tÒ‹ÿà å‹ú <í‹Ï½ üù‹4›« ²Œú üºŒ5ù§ ”ôŒ let key = "a";Á ü‹�N K let entry: RawEntryMut<&str, u32, _> = map.raw_entry_mut().from_key(&key);Á ÜÞ� entry.insert(key, 100);Á üþ� º© <¢ŽÏ½ D’� ñ × ñ¢ ùì Å ¢ Ì Ì §� Å ÎìñŸ ›� ‚« \ß� šeñŸ $÷� ñŸæê lþ�
|
|||
|
|
Ë Ãæê‹í“ó³ññŸ$ž�¶ ¤�ce üö—… ü–‘< 9 Creates a `RawEntryMut` from the given key and its hash.Á בú tß‘ÿà ò‘ú <ú‘Ͻ ü†’(éª ü³’4›« ì’ú üô’Y¾¬ üÒ“ ¡ üö“4Ê ì¯”‡® ´Ñ”® ,ì”õÍ ö”ú üþ”5ù§ ”¸•‘� üÏ•0‘µ ü„–c ` let entry: RawEntryMut<&str, u32, _> = map.raw_entry_mut().from_key_hashed_nocheck(hash, &key);Á Üì–†ž üŒ— º© <°—Ͻ¼ý— ò × òñŸ ùì Å ¢ Î Î ¬˜ Å •˜ Ì lä˜
|
|||
|
|
Í Ãæê‹í“ó³ññŸ$˜˜§$ž˜¶ ©˜GI ü·™B à Рœ Ñ § Ò ¤ Ó ’ Ô Ñ Ô Ð Ò Ó Íý À™ Þý Ù ºÄ
|
|||
|
|
Æ™ Ó¥
|
|||
|
|
É™ å¥
|
|||
|
|
LÌ™ ×Õ Ø ¼™:< >@ BD FH üˆ¡ƒ ü€šF C Creates a `RawEntryMut` from the given hash and matching function.Á Ëšú tÓšÿà æšú <îšÏ½ üúš(éª ü§›4›« à›ú üè›Y¾¬ üÆœ ¡ üêœ4Ê ì£�‡® ´Å�® ,à�õÍ ê�ú üò�5ù§ ”¬ž‘� üÞ0‘µ üøž^ [ let entry: RawEntryMut<&str, u32, _> = map.raw_entry_mut().from_hash(hash, |k| k == &key);Á ÜÛŸ†ž üûŸ º© <Ÿ Ͻ L�¡ ×É� ùì Ï — Ö Ö Ï “ž ™¡ × “"É� × æê ¤ö¡ × É� ¼¬˜" $†¢
|
|||
|
|
Õ Ãæê‹í“ó³ñÉ� $œ¡§$¢¡ is_matchÁD¡‡‰ ï¡üò¢€ 4õ¢ õ
|
|||
|
|
×É� ùì Ï — Ù Ù Ï “ž ü¢ Ú “"É� Ú æê ¤Ý£ Ú É� ²®˜" $í£
|
|||
|
|
Ø Ãæê‹í“ó³ñÉ� $ÿ¢§$…£ž¬D”£€‚ Ö£D¡¤ Ø ±æ Û Êæ Û èæ Û Û Ø Û æê‹í“ó³ñÉ� úþ É� üȧ? Ã Ý œ Þ § ß ¤ à ’ á à á ß Ý Þ Íý ѧ Þý Ô§ ºÄ
|
|||
|
|
ק ӥ
|
|||
|
|
Ú§ å¥
|
|||
|
|
Lݧã™â ä æ é ͧ@B DF HJ LN üž«… üŽ¨% " Access an immutable entry by key.Á ¸¨ú tÀ¨ÿà Өú <ۨϽ Üç¨¯Ä ‡©ú ü�©B ? let map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();Á ”Ö©‘� üí©C @ assert_eq!(map.raw_entry().from_key(&key), Some((&"a", &100)));Á <µªÏ½ D¥« óã™ óñŸ ©Ó Ü ¢ ã ã º« Ü ®« ‚« \í« » $…¬ Ì lŒ¬
|
|||
|
|
â Ãæê‹í“ó³ññŸ$±«¶ ·«PR üij€ ü¤4 1 Access an immutable entry by a key and its hash.Á Ýú tåÿà øú <€®Ï½ üŒ®(éª Ü¹®¯Ä Ù®ú üá®Y¾¬ ü¿¯ ¡ üã¯4Ê ìœ°‡® ´¾°® ,Ù°õÍ ã°ú üë°BŽ² ”²±‘� üɱ0‘µ üþ±X U assert_eq!(map.raw_entry().from_key_hashed_nocheck(hash, &key), Some((&"a", &100)));Á <۲Ͻ ¼Ë³ ôã™ ôñŸ ©Ó Ü ¢ å å ú³ Ü ã³ Ì l´
|
|||
|
|
ä Ãæê‹í“ó³ññŸ$泧$쳶 ÷³GI ü³µp 4¶µ õ
|
|||
|
|
ã™É� ©Ó Ü — ç ç Ü “ž ½µ õ “"É� õæê Œ‘¶ õ É� Ë»˜" $ž¶
|
|||
|
|
æ Ãæê‹í“ó³ñÉ� $Àµ§$Ƶž¬DÕµ€‚ DѶ æ ±æ è Êæ è èæ è è æ è æê‹í“ó³ñÉ� úþ¡°üñ½s üη< 9 Access an immutable entry by hash and matching function.Á �¸ú t—¸ÿà ª¸ú <²¸Ï½ ü¾¸(éª Üë¸¯Ä ‹¹ú ü“¹Y¾¬ üñ¹ ¡ ü•º4Ê ìꇮ ´ðº® ,‹»õÍ •»ú ü�»BŽ² ”仑� üû»0‘µ ü°¼S P assert_eq!(map.raw_entry().from_hash(hash, |k| k == &key), Some((&"a", &100)));Á <ˆ½Ï½ Lø½ ã™É� ©Ó Ü — ê ê Ü “ž ‚¾ ö “"É� öæê ŒÒ¾ ö É� ÇÁ˜" $ß¾
|
|||
|
|
é Ãæê‹í“ó³ñÉ� $…¾§$‹¾ž¬D–¾€‚ ü˜¿; Ã ì œ í § î ¤ ï ’ ð ð î ì í ï Íý ¡¿ Þý ¤¿ ºÄ
|
|||
|
|
§¿ Ó¥
|
|||
|
|
ª¿ å¥
|
|||
|
|
L¿ùìñ ò ó õ ÷ �¿CE GI KM OQ ü‘à üÚ¿E B Sets the value of the entry, and returns a `RawOccupiedEntryMut`.Á ¤Àú t¬Àÿà ¿Àú <ÇÀϽ ÜÓÀ¯Ä óÀú üûÀ5ù§ üµÁT Q let entry = map.raw_entry_mut().from_key("horseyland").insert("horseyland", 37);Á ŽÂú ü–Â9 6 assert_eq!(entry.remove_entry(), ("horseyland", 37));Á <ÔÂϽ 4˜Ã ùìæê‹íúí ë ë �— $óà ‚« \„Ä
|
|||
|
|
ñ Ãæê‹í“ó³ñ$ŸÃëR ¥Ã»,Ãüîʃ ü†ÆRЪ üÝÆ9 6 mutable references to the key and value in the entry.Á ›Çú t£Çÿà ¶Çú <¾ÇϽ ÜÊÇ¯Ä êÇú üòÇ5ù§ ¬Èú ü´ÈH E map.raw_entry_mut().from_key("poneyland").or_insert("poneyland", 3);Á ü�É$ü¬ ªÉú ü²ÉQ N *map.raw_entry_mut().from_key("poneyland").or_insert("poneyland", 10).1 *= 2;Á üˆÊ$�® <±ÊϽ LõÊ ùìæê‹í Ãæêú¸ ë ë �— $ÔË ‚« \åË
|
|||
|
|
ò Ãæê‹í“ó³ñ$ÿÊ default_keyÁ\…Ë default_valÁ\•ËüÿÑ– ü¸Í]ü´ üšÎE B and returns mutable references to the key and value in the entry.Á äÎú tìÎÿà ÿÎú <‡ÏϽ Ü“Ï¯Ä ³Ïú ü»Ï8 5 let mut map: HashMap<&str, String> = HashMap::new();Á øÏú ü€ÐA > map.raw_entry_mut().from_key("poneyland").or_insert_with(|| {Á üÆÐ) & ("poneyland", "hoho".to_string())Á <ôÐ });Á €Ñú üˆÑ5 2 assert_eq!(map["poneyland"], "hoho".to_string());Á <ÂÑϽ t†Ò ùìÉ� æË ë — ô ô ë “ž •Ò ¶º ”ÙÒ É� ˜" ¦ÿ4åÒ �— $øÒ ‚« \‰Ó
|
|||
|
|
ó Ãæê‹í“ó³ñÉ� $˜Ò><žÒfh üÕÚU ü�ÕDÖÇ üØÕ#¥È €Öú tˆÖÿà ›Öú <£ÖϽ Ü¯Ö¯Ä ÏÖú ü×Ö5ù§ ‘×ú ¼™× map.raw_entry_mut()Á ìµ× .from_key("poneyland")Á ü××' $ .and_modify(|_k, v| { *v += 1 })Á üƒØ# .or_insert("poneyland", 42);Á ü«Ø%²Ê ÕØú ¼ÝØµÒ ìùØÖÒ ü›Ù'þÒ üÇÙ" .or_insert("poneyland", 0);Á üîÙ%šË <˜ÚϽ TÜÚ ùìÉ� ùì ë — ö ö ë “ž çÚ ÷ ø –"É� ÷æê ø‹í ´“Û ÷ ø É� ÎÖ˜" !
|
|||
|
|
õ Ãæê‹í“ó³ñÉ� $êÚ± ðÚ‹� ü…ëe ü‹ÞF¯Í üÖÞE€Î ü ß!ÐÎ Æßú tÎßÿà áßú <éßϽ Üõß¯Ä ü•à) & use hashbrown::hash_map::RawEntryMut;Á Ãàú üËà5ù§ …áú œ�á–Рĥáˆá ôÂá .from_key("poneyland")Á üåá3ÙÐ �âú Œ¥â£Ñ ü»â% " RawEntryMut::Vacant(_) => {},Á üåâ- * RawEntryMut::Occupied(_) => panic!(),Á ,—ãõÍ ¡ãú ü©ã úÒ Îãú œÖã–Ð Äîãˆá ô‹äÆØ ü®ä(ÎÓ üÛä(�Ô ôˆå³Ô ¼«åÛÔ \ÇåüÔ ×åú Œßå£Ñ üõå% " RawEntryMut::Occupied(e) => {Á üŸæ.æÑ üÒæ%æÕ TüæãÁ ü‹ç+ ( RawEntryMut::Vacant(_) => panic!(),Á ,»çõÍ Åçú üÍç%šË ÷çú œÿç–Ð Ä—èˆá ô´èÆØ ü×è/§× ‹éú Œ“é£Ñ ü©é%™Ù üÓé-ÉÙ ,…êõÍ �êú ü—ê,ïØ <ÈêϽ ´Œë ùìÉ� ùì ë — ø ø ë “ž £ë ù –"É� ùæê ‹í ÔÏë ù É� ’à˜" »Û Làë
|
|||
|
|
÷ Ãæê‹í“ó³ñÉ� $¦ë± ¬ë{} üŽíC à ú œ û § ü ¤ ý ’ þ ý û ü ú þ Íý —í Þý ší ºÄ
|
|||
|
|
�í Ó¥
|
|||
|
|
í å¥
|
|||
|
|
L£íúíÿ € � ‚ ƒ „ … † ‡ ˆ ‰ Š ‹ Œ “í^` bd fh jl ¼¹ñ üØí-²ä Šîú t’îÿà ¥îú <îϽ ü¹î4›« òîú üúîF C let mut map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();Á Åïú üÍï.ô® ü€ð+¡Ü ü°ð= : RawEntryMut::Occupied(o) => assert_eq!(o.key(), &"a")Á ,òðõÍ <üðϽ Àñ ú úúí úæê ù Äñ ù
|
|||
|
|
ÿ Ãæê‹í“ó³ñ$Åñü£ù# ü‡ò5 2 Gets a mutable reference to the key in the entry.Á Áòú tÉòÿà Üòú <äòϽ üðò4›« ¤©ó use std::rc::Rc;Á Âóú üÊó let key_one = Rc::new("a");Á üîó let key_two = Rc::new("a");Á ’ôú üšô9 6 let mut map: HashMap<Rc<&str>, u32> = HashMap::new();Á üØô$ ! map.insert(key_one.clone(), 10);Á �õú ü‰õ" assert_eq!(map[&key_one], 10);Á ü°õP M assert!(Rc::strong_count(&key_one) == 2 && Rc::strong_count(&key_two) == 1);Á …öú ü�ö2 / match map.raw_entry_mut().from_key(&key_one) {Á üÄö+¡Ü üôö) & RawEntryMut::Occupied(mut o) => {Á ü¢÷+ ( *o.key_mut() = key_two.clone();Á LÒ÷¦Ò ,à÷õÍ üê÷" assert_eq!(map[&key_two], 10);Á ü‘øP M assert!(Rc::strong_count(&key_one) == 1 && Rc::strong_count(&key_two) == 2);Á <æøϽ <ªù û ûúí ûæê ù ²ù ù
|
|||
|
|
€ Ãæê‹í“ó³ñ$·ùü•‚" ü�úG D Converts the entry into a mutable reference to the key in the entryÁ üÍú,Äù þúú t†ûÿà ™ûú <¡ûϽ üû4›« ¤æûÉæ ÿûú ü‡ü õæ ü«ü Ÿç Ïüú ü×ü9Öç ü•ý$šè ¾ýú üÆý"Öè üíýPƒé Âþú üÊþ" let inside_key: &mut Rc<&str>;Á ñþú üùþ2ëé ü°ÿ+¡Ü üàÿ> ; RawEntryMut::Occupied(o) => inside_key = o.into_key(),Á ,£€õÍ ü€" *inside_key = key_two.clone();Á Ô€ú üÜ€"½ë üƒ�Pêë <Ø�Ͻ Dœ‚ úíèË ù ù
|
|||
|
|
� Ãæê‹í“ó³ñ$¥‚¼Ö† üò‚/ãí ¦ƒú t®ƒÿà Áƒú <ɃϽ üÕƒ4›« Ž„ú ü–„Fåâ á„ú üé„.ô® üœ…+¡Ü üÌ…> ; RawEntryMut::Occupied(o) => assert_eq!(o.get(), &100),Á ,�†õÍ <™†Ï½ ݆ ü üúí ü‹í ù ᆠù
|
|||
|
|
‚ Ãæê‹í“ó³ñ$â†üÁŒ" ü¤‡Sæø üü‡,Äù ˆú tµˆÿà Ȉú <ЈϽ ü܈4›« •‰ú ü�‰Fåâ è‰ú Äð‰¯ü �Šú ü•Š.ô® üÈŠ+¡Ü üøŠ9 6 RawEntryMut::Occupied(o) => value = o.into_mut(),Á ,¶‹õÍ ”À‹ *value += 900;Á ׋ú üß‹ assert_eq!(map[&"a"], 1000);Á <„ŒÏ½ DÈŒ úíú¸ ù ù
|
|||
|
|
ƒ Ãæê‹í“ó³ñ$ÑŒüµ‘# üž�7¬ñ Ú�ú tâ�ÿà õ�ú <ý�Ͻ ü‰Ž4›« ÂŽú üÊŽFåâ •�ú ü��.ô® üÐ�+¡Ü ü€�< 9 RawEntryMut::Occupied(mut o) => *o.get_mut() += 900,Á ,Á�õÍ Ë�ú üÓ� Ëø <ø�Ͻ <¼‘ ý ýúí ý‹í ù Ä‘ ù
|
|||
|
|
„ Ãæê‹í“ó³ñ$É‘ü‘–' ü“’7 4 Gets a reference to the key and value in the entry.Á Ï’ú t×’ÿà ê’ú <ò’Ͻ üþ’4›« ·“ú ü¿“Fåâ Š”ú ü’”.ô® üÅ”+¡Ü üõ”P M RawEntryMut::Occupied(o) => assert_eq!(o.get_key_value(), (&"a", &100)),Á ,Ê•õÍ <ԕϽ l˜– þ þúí þæê þ‹í ù ¦– ù
|
|||
|
|
… Ãæê‹í“ó³ñ$§–üÀŸ7 ü—? < Gets a mutable reference to the key and value
|
|||
|
|
ü�É% " let raw_entry = match raw_entry {Á ü«É+¡Ü üÛÉA®� ü¡Ê ú� üÆÊ assert_eq!(v, 1000);Á „ëÊ׌ \€Ëñž 4�Ë€é
|
|||
|
|
¬›Ë match raw_entry {Á üµË& # RawEntryMut::Vacant(_) => { },Á üàË-ÉÙ 4’Ì€é
|
|||
|
|
ü�Ì$œ— <ÆÌϽ ”ŠÍ úíÉ� ùì ù — � � ù “ž �Í ‚ –"É� ‚æê ‹í ÔàÍ ‚ É� «£˜" »Û LñÍ
|
|||
|
|
Œ Ãæê‹í“ó³ñÉ� $ ͱ ¦Í{} tˆÏ Œ ±æ Ž Êæ Ž èæ Ž Ž Œ Ž æê‹í“ó³ñÉ� Š’
|
|||
|
|
É� \ÀÏ Œ ±æ � Êæ � èæ � � Œ � æê‹í“ó³ñÉ� ‹í¦ÿ æêüœÒA à ‘ œ ’ § “ ¤ ” ’ • “ ‘ • ” ’ Íý ¥Ò Þý ¨Ò ºÄ
|
|||
|
|
«Ò Ó¥
|
|||
|
|
®Ò å¥
|
|||
|
|
L±Òçî– — ˜ › ¡Ò@B DF HJ LN üÌ×r üäÒ= : Sets the value of the entry with the `VacantEntry`'s key,Á ü¦Ó*Œš
|
|||
|
|
ÕÓú tÝÓÿà ðÓú <øÓϽ ü„Ô4›« ½Ôú üÅÔFåâ �Õú ü˜Õ. + match map.raw_entry_mut().from_key(&"c") {Á üËÕ-ÉÙ üýÕW T RawEntryMut::Vacant(v) => assert_eq!(v.insert("c", 300), (&mut "c", &mut 300)),Á ,ÙÖõÍ ãÖú üëÖ assert_eq!(map[&"c"], 300);Á <�×Ͻ 4Ó× çîæê‹íæË � � �— $¡Ø ‚« \²Ø
|
|||
|
|
– Ãæê‹í“ó³ñ$Ú×ëR à×»,è×ü®âŒ üÄÙ=÷¦ ü†Ú*Œš
|
|||
|
|
µÚú t½Úÿà ÐÚú <ØÚϽ üäÚ(éª ü‘Û4›« ÊÛú üÒÛY¾¬ ü°Ü ¡ üÔÜ4Ê ì�݇® ´¯Ý® ,ÊÝõÍ ÔÝú üÜÝFåâ ”§Þ let key = "c";Á ü¾Þ0‘µ óÞú üûÞC @ match map.raw_entry_mut().from_key_hashed_nocheck(hash, &key) {Á üÃß-ÉÙ üõß- * RawEntryMut::Vacant(v) => assert_eq!(Á ü§à4 1 v.insert_hashed_nocheck(hash, key, 300),Á üàà (&mut "c", &mut 300)Á T…á ),Á ,”áõÍ žáú ü¦á �ª <ÊáϽ ¬µâ çîæê‹íæË � � �— $�ã ‚« \®ã
|
|||
|
|
— Ãæê‹í“ó³ñ$Ëâ§$ÑâëR Üâ»,äâü–ï· üŒå< 9 Set the value of an entry with a custom hasher function.Á Íåú tÕåÿà èåú <ðåϽ üüå(éª ü©æ4›« âæú üêæE B fn make_hasher<K, S>(hash_builder: &S) -> impl Fn(&K) -> u64 + '_Á L´ç whereÁ ÌÂç K: Hash + ?Sized,Á ¼àç S: BuildHasher,Á ,üç {Á Ćè move |key: &K| {Á ü£è# use core::hash::Hasher;Á üËè8 5 let mut state = hash_builder.build_hasher();Á üˆé! key.hash(&mut state);Á Ô®é state.finish()Á LÍé¦Ò ,ÛéõÍ åéú üíé5ù§ ”§ê‘� ü¾ê, ) let hash_builder = map.hasher().clone();Á üïê0 - let hash = make_hasher(&hash_builder)(&key);Á ¤ëú ü¬ë> ; match map.raw_entry_mut().from_hash(hash, |q| q == &key) {Á üïë-ÉÙ ü¡ì-Í® üÓìM J v.insert_with_hasher(hash, key, 100, make_hasher(&hash_builder)),Á ü¥í (&mut "a", &mut 100)Á TÊíî¯ ,ÙíõÍ üãíM J map.extend([("b", 200), ("c", 300), ("d", 400), ("e", 500), ("f", 600)]);Á üµî º© <ÙîϽ ”�ï çîæê‹í™æË � ™ ™ ™ � Íìö» °ï ƒ �"ö» ƒæê l¿ð ƒ ö»Á¼˜" Éð
|
|||
|
|
˜ Ãæê‹í“ó³ñö»$¼ï§$ÊïëR Ýï»,íïº:4ÿï’” Äñ ˜ ±æ š Êæ š èæ š š ˜ š æê‹í“ó³ñö» ÿþ ö» ü¢ò� d¥ò õ
|
|||
|
|
çîæê‹íúí � � �— $†ó ‚« \—ó
|
|||
|
|
› Ãæê‹í“ó³ñ$²òëR ¸ò»,ÀòüŒöH 8 „ œ � § ž ¤ Ÿ ’ ž Ÿ � „ Íý ‘ö Þý ”ö ºÄ
|
|||
|
|
—ö Ó¥
|
|||
|
|
šö å¥
|
|||
|
|
L�ö¥€¡ Àc ¡ 8: <> @B DF üÛö8 Þö … † ‡ …¥€ † c c ˆ ¢cµ
|
|||
|
|
` £cÔ ` àB¤GS
|
|||
|
|
‡û® œ âö œ
|
|||
|
|
¡ 8æê‹í“ó³ñ$ãö± éöüÒ÷O 8 ˆ œ £ § ¤ ¤ ¥ ’ ¦ ¤ ¥ £ ˆ ¦ Íý ×÷ Þý á÷ ºÄ
|
|||
|
|
ë÷ Ó¥
|
|||
|
|
î÷ €® ,Ú÷ ‘® ,ä÷ å¥
|
|||
|
|
Lñ÷ Àc § JL NP RT VX ü¨ø8 «ø ‰ Š ‹ ‰ï€ Š c c ˆ ¢cµ
|
|||
|
|
` £cÔ ` àB¤GS
|
|||
|
|
‹û® ¢ ¯ø ¢
|
|||
|
|
§ 8æê‹í“ó³ñ$°ø± ¶øü¼úW 8 Œ œ © § ª ¤ « ’ ¬ « © Œ ¬ ª Íý Áú Þý Ëú ºÄ
|
|||
|
|
Õú Ó¥
|
|||
|
|
Øú €® ,Äú ‘® ,Îú å¥
|
|||
|
|
LÛú¸ÿ Àc JL NP RT VX üšû8 �û � Ž � �¸ÿ Ž c c ˆ ¢cµ
|
|||
|
|
` £cÔ ` àB¤GS
|
|||
|
|
�û® ¨ ¡û ¨
|
|||
|
|
8æê‹í“ó³ñ$¢û± ¨ûüðüG 8 � œ ¯ § ° ¤ ± ’ ² ¯ � ° ² ± Íý õü Þý øü ºÄ
|
|||
|
|
ûü Ó¥
|
|||
|
|
þü å¥
|
|||
|
|
L�ýÞ�³ Àc ³ 8: <> @B DF ü¾ý8 Áý ‘ ’ “ ‘Þ� ’ c c ˆ ¢cµ
|
|||
|
|
` £cÔ ` àB¤GS
|
|||
|
|
“û® ® Åý ®
|
|||
|
|
³ 8æê‹í“ó³ñ$Æý± Ìýü·þE 8 ” œ µ § ¶ ¤ · ’ ¸ ” ¶ ¸ · µ Íý ¼þ Þý ¿þ ºÄ
|
|||
|
|
Âþ Ó¥
|
|||
|
|
Åþ å¥
|
|||
|
|
LÈþ´‚¹ Àc ¹ 8: <> @B DF üƒÿ8 †ÿ • – — •´‚ – c c ˆ ¢cµ
|
|||
|
|
` £cÔ ` àB¤GS
|
|||
|
|
—û® ´ Šÿ ´
|
|||
|
|
¹ 8æê‹í“ó³ñ$‹ÿ± ‘ÿt¨ T¬ Á Æ ManuallyDropÁd< ÃÛ º ¼ r,T é! º ¾ DerefMutÁD[ ö! º ¿ µ j “ º À $+Œ7[ü+&MO57%'Üs T~ ¥  — à  à µ¾ ‰ ¶ë Œ ˜ “"¼ƒ ˜Àß lœ ˜ ¼ƒåј" þ‚ Ú›"!‚'` Ä Å Ù ik np L±4±º Á Á ¼ƒDÀ,Àº Á Á Àßü×W,Þ Àß¼ƒþ‚ ¥ Ç — È Ç È µ¾ ä ¶ë ç ™ “"¼ƒ ™Àß l ™ ¼ƒ÷Ó˜"
|
|||
|
|
Æ Àß¼ƒ»,êË{4ôgi ln üÕ7 ¥ Ê — Ë Ë Ê š ¼ƒ šÀߘ" lþ ¶ë Ý š “"¼ƒ–Õ ! µ¾ Úþ‚Ì
|
|||
|
|
79 ü¡#T¨ þ‚Àß É É
|
|||
|
|
Ì Àß¼ƒ£,³üõA ¥ Î — Ï Î Ï › ¼ƒ ›Àߘ" l¨ ¶ë ý › “"¼ƒÿÖ ! µ¾ úþ‚Ð Ñ ê! ë! Ñ FH \½4Â Í Í À߬à,ã œ œþ‚ œÀß Í é Í
|
|||
|
|
Ñ Àß¼ƒ$êü•D ¥ Ó — Ô Ó Ô � ¼ƒ �Àߘ" lË ¶ë � � “"¼ƒ¬Ù ! µ¾ šþ‚Õ ÷! Õ ?A üî!Lñ ž žþ‚ žÀß Ò û Ò
|
|||
|
|
Õ Àß¼ƒ$€ ü³ @ ¥ × — Ø × Ø Ÿ ¼ƒ ŸÀߘ" lå ¶ë » Ÿ “"¼ƒ¹Û ! µ¾ ¸ þ‚Ù �" Ù ?A ”ˆ
|
|||
|
|
$‹
|
|||
|
|
þ‚ Ö �
|
|||
|
|
Ö
|
|||
|
|
Ù Àß¼ƒ$•
|
|||
|
|
<¸ ¼ ú ±µ¹¾ÅÌÓÙ¨¸ÃäÑT Ú Ü õ¶¼| Ô Ú Ý \\; Åe Ú ß Ž$H še Ú à Ž e Ú à ChainÁ,` ð¬ Ú â µlg òP Ú ã BitAndÁ4‡ öø Ú å BitAndAssignÁd� Þ— Ú æ BitOrÁ,� –ú Ú ç BitOrAssignÁ\¤ •˜ Ú è BitXorÁ4± ¶û Ú é BitXorAssignÁd¹ ̘ Ú ê SubÁ Ç �ï Ú ë SubAssignÁLÌ œö Ú ì × ã ` Ú î í è ë Ú ï ÕL÷ Ç Ú ð Ø$” Ž Ú ò �<š ¨ Ú ó ½K$£ á Ú ô í¶L» 1 Ú ö j ^ c™ñ4Æ Ä Ú ÷ k _ d™ñ Å Ú ÷ k _ dÐ3dÎ ü Ú ø Δè Ú ù ,‰ŒwzT.mp_bTS;>+.L{ þéìÎѸ»œŸ‰Œps$ÜdgUXtòJT‡< Ž.1 "T®ûýÂÄÌáµü… D üèB ? A hash set implemented as a `HashMap` where the value is `()`.Á «ú ü¯H E As with the [`HashMap`] type, a `HashSet` requires that the elementsÁ üøP M implement the [`Eq`] and [`Hash`] traits. This can frequently be achieved byÁ üÉL I using `#[derive(PartialEq, Eq, Hash)]`. If you implement these yourself,Á ü–6 3 it is important that the following property holds:Á Íú \Ñ�½ üÝ$¢½ <‚Ͻ Šú üŽFì½ Õú Ùú üÝI F It is a logic error for an item to be modified in such a way that theÁ ü§ I F item's hash, as determined by the [`Hash`] trait, or its equality, asÁ üñ K H determined by the [`Eq`] trait, changes while it is in the set. This isÁ ü½
|
|||
|
|
O L normally only possible through [`Cell`], [`RefCell`], global state, I/O, orÁ „�
|
|||
|
|
unsafe code.Á ž ú ü¢ O²Á üò N‹Â üÁ P M panic does occur then the contents of the `HashSet` may become corrupted andÁ ü’
|
|||
|
|
-½Ã À
|
|||
|
|
ú tÄ
|
|||
|
|
ÿÃ Ó
|
|||
|
|
ú <×
|
|||
|
|
Ͻ Üß
|
|||
|
|
use hashbrown::HashSet;Á üû
|
|||
|
|
DàÄ üÀ3 0 // would be `HashSet<String>` in this example).Á üô# let mut books = HashSet::new();Á ˜ú ´œ // Add some books.Á ü³5 2 books.insert("A Dance With Dragons".to_string());Á üé6 3 books.insert("To Kill a Mockingbird".to_string());Á ü , ) books.insert("The Odyssey".to_string());Á üÍ1 . books.insert("The Great Gatsby".to_string());Á ÿú üƒ ŠË ü¤/ , if !books.contains("The Winds of Winter") {Á üÔH E println!("We have {} books, but The Winds of Winter ain't one.",Á ô� books.len());Á ,¼õÍ Âú ¬Æ // Remove a book.Á üÜ books.remove("The Odyssey");Á ýú ü� ƒÔ Ä¡ for book in &books {Á ìº println!("{}", book);Á ,ØõÍ <ÞϽ æú üêD A The easiest way to use `HashSet` with a custom type is to deriveÁ ü¯L I [`Eq`] and [`Hash`]. We must also derive [`PartialEq`]. This will in theÁ üü future be implied by [`Eq`].Á �ú <¡Ï½ Ü©’ë üÅ)óå œï¥æ ¬ƒÁæ ¬™ power: usize,Á ,¯õÍ µú ü¹% " let mut vikings = HashSet::new();Á ßú üãC @ vikings.insert(Viking { name: "Einar".to_string(), power: 9 });Á ü§CŒõ üëB ? vikings.insert(Viking { name: "Olaf".to_string(), power: 4 });Á ü®D A vikings.insert(Viking { name: "Harald".to_string(), power: 8 });Á óú ü÷7 4 // Use derived implementation to print the vikings.Á ¼¯ for x in &vikings {Á äÇ println!("{:?}", x);Á ,äõÍ <êϽ òú üöM J A `HashSet` with fixed list of elements can be initialized from an array:Á Äú <ÈϽ ÜÐ’ë ìú üð- * let viking_names: HashSet<&'static str> =Á üž< 9 [ "Einar", "Olaf", "Harald" ].into_iter().collect();Á üÛ' $ // use the values stored in the setÁ <ƒ Ͻ ‹ ú ü� AÞâ üÑ ;«à ü� @ðà üÎ $Å£ üó Iºá ü½ G�â <� ¥ û ¤ ü ’ ý ý û ü µ¾ ˜ dž´› ¤Ž¬³ ¶ŽL¶ ߃ )æÜ$à׶ þ 68 ; › Ñë E ³ ‹ò üÐ $ Û ú ú Ë„üù I ¥ €
|
|||
|
|
¤ �
|
|||
|
|
’ ‚
|
|||
|
|
€
|
|||
|
|
�
|
|||
|
|
‚
|
|||
|
|
µ¾ þ dž ˆ ¤Ž ’ ˜Ø,� Ø�„ ,‹ ¶ŽL• Ø�ç ,¡ ߃ƒ
|
|||
|
|
„
|
|||
|
|
Ù Ú „
|
|||
|
|
ƒ
|
|||
|
|
^` ce hj ¼É ,Ì ¡ ¡ßƒ ߃ ÿ Ò ÿ
|
|||
|
|
ƒ
|
|||
|
|
Àß�„�ç$Ó ü!'T°! ¢ £ ¢ßƒ £ßƒ ÿ »! ÿ
|
|||
|
|
„
|
|||
|
|
Àß�„�ç$À!ÎÙ4Æ!ü"& »íÔ�"üŠ"" ¥ †
|
|||
|
|
†
|
|||
|
|
µ¾ ²" ú ú � þ Ø )æÜ$à׶ÀßÑë‹ò‡
|
|||
|
|
ˆ
|
|||
|
|
CE ¤Ï* üÚ" Creates an empty `HashSet`.Á þ"ú ü†#\ Y The hash set is initially created with a capacity of 0, so it will not allocate until itÁ Üç#�‰ ‡$ú Ä�$À‰ ¬$ú ü´$Hî‰ ü�%P M not allow the `HashSet` to be protected against attacks such as [`HashDoS`].Á üÖ%>š‹ ü™&/â‹ üÍ&? < as the hasher when creating a [`HashSet`], for example withÁ ü‘'1 . [`with_hasher`](HashSet::with_hasher) method.Á Ç'ú üÏ'?«� ü“({ô� “)ú t›)ÿà ®)ú <¶)Ͻ ÜÂ)’ë üâ)+ ( let set: HashSet<i32> = HashSet::new();Á <’*Ͻ Ö* ø� …
|
|||
|
|
…
|
|||
|
|
|
|||
|
|
‡
|
|||
|
|
Àßü¡4- ü«+; 8 Creates an empty `HashSet` with the specified capacity.Á ë+ú üó+J G The hash set will be able to hold at least `capacity` elements withoutÁ üÂ,E B reallocating. If `capacity` is 0, th
|
|||
|
|
üóhg üŠ`=‡Ž üÌ`3ÏŽ „aú üŒaN K In other words, move all elements `e` such that `f(&e)` returns `true` outÁ Ôßaü� þaú ü†b^Ø‘ üébRÁ’ üÀcWž“ œdú ü¤d! [`retain()`]: HashSet::retainÁ Êdú tÒdÿà ådú <ídϽ Üùd’ë ™eú ü¡e1 . let mut set: HashSet<i32> = (0..8).collect();Á ü×eI F let drained: HashSet<i32> = set.extract_if(|v| v % 2 == 0).collect();Á ¥fú üf< 9 let mut evens = drained.into_iter().collect::<Vec<_>>();Á üîf7 4 let mut odds = set.into_iter().collect::<Vec<_>>();Á Œªg£˜ „Àg¾˜ Õgú üÝg(æ˜ üŠh'™™ <¶hϽ Túh ¬ ¬ßƒñ ¾ ¾ åM ñ Ú ÄÔ Ú ™ÄÂ5JæG ¬Àßñ�ç Ž
|
|||
|
|
— ›
|
|||
|
|
›
|
|||
|
|
ˆi Ž
|
|||
|
|
î« …i « “"ñ «Àß ŒÈi « ñȶ˜" $Õi
|
|||
|
|
š
|
|||
|
|
Àß�„�çñ$�i± “igi ¼Úm ü®k( % Clears the set, removing all values.Á Ûkú tãkÿà ökú <þkϽ ÜŠl’ë ªlú ü²l ŠŸ „ÖlÖŸ tël v.clear();Á Ôþlš¢ <�mϽ ,ám ߃ Ž
|
|||
|
|
çm Ž
|
|||
|
|
|
|||
|
|
œ
|
|||
|
|
Àß�„�ç$ìmü—n ¥ ž
|
|||
|
|
¤ Ÿ
|
|||
|
|
ž
|
|||
|
|
Ÿ
|
|||
|
|
µ¾ œn dž ŸnÝã
|
|||
|
|
¡
|
|||
|
|
üÙy+ ü¾nH E Creates a new empty hash set which will use the given hasher to hashÁ L‹oÿ¬ ™oú ü¡oJ G The hash set is initially created with a capacity of 0, so it will notÁ üðo-ò ¢pú ĪpÀ‰ Çpú üÏpHî‰ üœqP®ƒ üñq>š‹ ü´r/â‹ üèr. + as the hasher when creating a [`HashSet`].Á ›sú ü£sLʯ üôsB ? the `HashSet` to be useful, see its documentation for details.Á »tú üÃt?«� ü‡u{ô� ü‡vN•± Úvú tâvÿà õvú <ývϽ ܉w’ë ü©w&²² Ôwú üÜw*ð² ü‹x* ' let mut set = HashSet::with_hasher(s);Á ”ºx set.insert(2);Á <ÑxϽ \æy �„Ýã �
|
|||
|
|
�
|
|||
|
|
|
|||
|
|
|
|||
|
|
Àß�„º: ±üá…C üÚzA > Creates an empty `HashSet` with the specified capacity, usingÁ ô { `hasher` to hash the keys.Á Ã{ú üË{Jᇠüš|Eµˆ ä|ú Äì|À‰ ‰}ú ü‘}Hî‰ üÞ}P®ƒ ü³~>š‹ üö~/â‹ üª.ï» Ýú üåLʯ ü¶€BÁ¼ ý€ú ü…�?«� üÉ�{ô� üÉ‚N•± œƒú t¤ƒÿà ·ƒú <¿ƒÏ½ Ü˃’ë üëƒ&²² –„ú üž„*ð² üÍ„; 8 let mut set = HashSet::with_capacity_and_hasher(10, s);Á ”�… set.insert(1);Á <¤…Ͻ Äè… �„Ýã �
|
|||
|
|
�
|
|||
|
|
|
|||
|
|
¡
|
|||
|
|
Àß�„¼ D�†º:4’†ü�‡6 ¥ £
|
|||
|
|
¤ ¤
|
|||
|
|
’ ¥
|
|||
|
|
£
|
|||
|
|
¤
|
|||
|
|
¥
|
|||
|
|
µ¾ ”‡ dž —‡ ¤Ž š‡ ¶ŽL»‡ßƒ¦
|
|||
|
|
§
|
|||
|
|
¨
|
|||
|
|
©
|
|||
|
|
02 46 8: 쓈 ü̇4ȼLšˆ ® ®ßƒ ®�ç ¢
|
|||
|
|
¤ˆ ¢
|
|||
|
|
|
|||
|
|
¦
|
|||
|
|
Àß�„�ç$¥ˆüö“8 üÛˆHŹ L¨‰ÿ¬ ¶‰ú ü¾‰J°º ü�Š-ò ¿Šú ÄÇŠÀ‰ äŠú üìŠHî‰ ü¹‹P®ƒ üŽŒ>š‹ üÑŒ/â‹ ü…�.ï» ¸�ú üÀ�Lʯ ü‘ŽBÁ¼ ØŽú üàŽ?«� ü¤�{ô� ü¤�N•± ÷�ú tÿ�ÿà ’‘ú <š‘Ͻ ܦ‘’ë üÆ‘&²² ñ‘ú üù‘*ð² ü¨’*ª¾ ”גݾ <î’Ͻ tƒ” �„�ç߃ ¢
|
|||
|
|
¢
|
|||
|
|
|
|||
|
|
§
|
|||
|
|
Àß�„�çº:ý²¤³ü• P üŽ•A׿ ôÔ•¡À ÷•ú üÿ•JᇠüΖEµˆ ˜—ú Ä —À‰ ½—ú üÅ—Hî‰ ü’˜P®ƒ üç˜>š‹ üª™/â‹ üÞ™.ï» ‘šú ü™šLʯ üêšBÁ¼ ±›ú ü¹›?«� üý›{ô� üýœN•± Ð�ú tØ�ÿà ë�ú <ó�Ͻ Üÿ�’ë üŸž&²² Êžú üÒž*ð² ü�Ÿ;¯Ã ”ÁŸô
|
|||
|
|
Ú …Ø–†Ãñç ³
|
|||
|
|
Àß�„�ç ª
|
|||
|
|
øÆ ª
|
|||
|
|
|
|||
|
|
²
|
|||
|
|
Àß�„�ç$€Ç¹
|
|||
|
|
,†Ç,.ü Î^ ü�È< 9 Visits the values representing the symmetric difference,Á üÑÈF C i.e., the values that are in `self` or in `other` but not in both.Á œÉú t¤Éÿà ·Éú <¿ÉϽ ÜËÉ’ë üëÉ8ßç ü¨Ê;¢è èÊú üðÊ% " // Print 1, 4 in arbitrary order.Á üšË) & for x in a.symmetric_difference(&b) {Á ÔÈËœ ,çËõÍ ñËú üùËA > let diff1: HashSet<_> = a.symmetric_difference(&b).collect();Á ü¿ÌA > let diff2: HashSet<_> = b.symmetric_difference(&a).collect();Á …Íú ì�Í assert_eq!(diff1, diff2);Á ü¯Í/ , assert_eq!(diff1, [1, 4].iter().collect());Á <ãÍϽ ¤§Î µ
|
|||
|
|
µ
|
|||
|
|
߃ �õ Ó Ó ›Œ Øù Ú ßŸÖÚÈsž µ
|
|||
|
|
Àß�„�ç ª
|
|||
|
|
¼Î ª
|
|||
|
|
|
|||
|
|
´
|
|||
|
|
Àß�„�ç$Äι
|
|||
|
|
,ÊÎ,.ü…ÕO üüÏ4 1 Visits the values representing the intersection,Á üµÐ9 6 i.e., the values that are both in `self` and `other`.Á óÐú tûÐÿà ŽÑú <–ÑϽ ܢђë üÂÑ8ßç üÿÑ;¢è ¿Òú üÇÒ% " // Print 2, 3 in arbitrary order.Á üñÒ! for x in a.intersection(&b) {Á Ô—Óœ ,¶ÓõÍ ÀÓú üÈÓ@ = let intersection: HashSet<_> = a.intersection(&b).collect();Á ü�Ô6 3 assert_eq!(intersection, [2, 3].iter().collect());Á <ÈÔϽ dŒÕ ·
|
|||
|
|
·
|
|||
|
|
߃ Øú Å Å •‹ Êù Ú Ë¹
|
|||
|
|
Ú _„$FËàä` ·
|
|||
|
|
Àß�„�ç ª
|
|||
|
|
™Õ ª
|
|||
|
|
|
|||
|
|
¶
|
|||
|
|
Àß�„�ç$¡Õ¹
|
|||
|
|
,§Õ,.üÊÜA üÏ×- * Visits the values representing the union,Á ü�ØB ? i.e., all the values in `self` or `other`, without duplicates.Á ÈØú tÐØÿà ãØú <ëØϽ Ü÷Ø’ë ü—Ù8ßç üÔÙ;¢è ”Úú üœÚ+ ( // Print 1, 2, 3, 4 in arbitrary order.Á ÔÌÚ for x in a.union(&b) {Á ÔëÚœ ,ŠÛõÍ ”Ûú üœÛ2 / let union: HashSet<_> = a.union(&b).collect();Á üÓÛ5 2 assert_eq!(union, [1, 2, 3, 4].iter().collect());Á <�ÜϽ ,ÑÜ ¹
|
|||
|
|
¹
|
|||
|
|
߃ € Ù Ù ô Þù Ú ¥ �Æ 7ii ¹
|
|||
|
|
Àß�„�ç ª
|
|||
|
|
×Ü ª
|
|||
|
|
|
|||
|
|
¸
|
|||
|
|
Àß�„�ç$ßܹ
|
|||
|
|
,åÜ,.üÑå` ü´à/ , Returns `true` if the set contains a value.Á èàú üðàC @ The value may be any borrowed form of the set's value type, butÁ ü¸áC¶Þ œ€â the value type.Á ˜âú t âÿà ³âú <»âϽ ÜÇâ’ë çâú üïâ: 7 let set: HashSet<_> = [1, 2, 3].into_iter().collect();Á ü®ã' $ assert_eq!(set.contains(&1), true);Á üÚã( % assert_eq!(set.contains(&4), false);Á <‡äϽ “äú ü›ä;«à üÛä@ðà DØå ´ µ ´ßƒ µ×õ ª
|
|||
|
|
¢ »
|
|||
|
|
»
|
|||
|
|
äå ª
|
|||
|
|
¬ƒ áå še×õ $“æ ×õÀß lšæ
|
|||
|
|
º
|
|||
|
|
Àß�„�ç×õ$åå»,ëåPR ü©ìa üèæZ W Returns a reference to the value in the set, if any, that is equal to the given value.Á Ççú üÏçC‡� ü—èC¶Þ œßèã� ÷èú tÿèÿà ’éú <šéϽ ܦé’ë Æéú üÎé:Ò‚ ü�ê& # assert_eq!(set.get(&2), Some(&2));Á ü¸ê" assert_eq!(set.get(&4), None);Á <ßêϽ ëêú üóê;«à ü³ë@ðà °ì ¶ · ¶ßƒ ·×õ ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ ¶Àß ª
|
|||
|
|
¢ ½
|
|||
|
|
½
|
|||
|
|
·ì ª
|