3299 lines
880 KiB
Plaintext
3299 lines
880 KiB
Plaintext
|
rust
|
|||
|
|
|¼
|
|||
|
|
#rustc 1.96.0 (ac68faa20 2026-05-25)ÁíàÄTËŸ ÜJîÄ)'ß\¥! -3d1337db07d0b3aeÁ ¤²XctÔ'ÐÓ©z¨É½Ó -a4945860e1c53b00Á ¤°ð ¾ä-±($²ï=©Ã -7e98a21bfd32b0edÁ‰ À §
|
|||
|
|
‚ $†
|
|||
|
|
¦TÉ» nightlyÁœ¦ innerÁ,ˆ»Òœîã,ò» allocator-api2ÁÔÐ likelyÁ4Ö»Òœ©ûDÞ»Ò test_mapÁDæ� ‚ $Û� rayonÁ,¦ »ïŒ– @ “ »@|ü Œû ÷ï,)»ïŒ÷ rkyvÁ$M»¹„6÷ serdeÁ,q»ÒŒYø DefaultHashBuilderÁ”œ» ahashÁŒÿø make_hashÁLƒF»Òœ²EøÒD™…
|
|||
|
|
‚ $Ž…
|
|||
|
|
rustc_entryÁ\ç » rustc-internal-apiÁôÂ É test_setÁD¯Õ‚ $¤Õéï,ø »ïŒè ëï,Ô »ïŒÄ íï,¸ »ïŒ¦
|
|||
|
|
EquivalentÁT– »
|
|||
|
|
equivalentÁ´é µ$Ôðµ¼Ø impÁ îðµ genericÁ<Ù
|
|||
|
|
ðµ9ìôœýìõ´’üü-µ $·4¶üÎu 쀼”ðà ¼µí littleÁÄÞ µ $„
|
|||
|
|
4ƒ
|
|||
|
|
üŠ†XÃ
|
|||
|
|
€¿
|
|||
|
|
¥ ù
|
|||
|
|
ðµÎìô•ìõ“‘µ ŽŒŠ 쀇ðà …íª}µ {ywspr í ¤ macrosÁ cfg_ifÁ ¦ @ ã
|
|||
|
|
|
|||
|
|
¤ ã AllocatorÁ # allocateÁ #
|
|||
|
|
deallocateÁ &ˆ
|
|||
|
|
&—
|
|||
|
|
)> do_allocÁ +’ bitmaskÁ 1 111111 8 invertÁ 8 remove_lowest_bitÁ 8 any_bit_setÁ 8 lowest_set_bitÁ 8 trailing_zerosÁ 8 nonzero_trailing_zerosÁ 8
|
|||
|
|
leading_zerosÁ 1@› @ IntoIterÁ @ê 1D flipÁ 1F› Fó invalid_mutÁ M¥ offset_fromÁ O¥ Q capacity_overflowÁ Q alloc_errÁ SizedTypePropertiesÁ T
|
|||
|
|
IS_ZERO_SIZEDÁ T
|
|||
|
|
NEEDS_DROPÁ W¥ EMPTYÁ DELETEDÁ is_fullÁ
|
|||
|
|
is_specialÁ special_is_emptyÁ h1Á MIN_HASH_LENÁ h2Á ProbeSeqÁ a posÁ a strideÁ d move_nextÁ capacity_to_bucketsÁ bucket_mask_to_capacityÁ hæ i¥ h calculate_layout_forÁ
|
|||
|
|
InsertSlotÁ lÖ BucketÁ n¥ nµ q¥ s¥ sƒ v¥ v from_base_indexÁ v
|
|||
|
|
to_base_indexÁ v as_ptrÁ v next_nÁ vã v readÁ v writeÁ vÉ 'aÁ v as_mutÁ �ø v copy_from_nonoverlappingÁ RawTableÁ „¥ „’ „ tableÁ „¤ „Ú
|
|||
|
|
RawTableInnerÁ Š bucket_maskÁ Š ctrlÁ Š growth_leftÁ Š itemsÁ �¥ �æ � try_with_capacityÁ �
|
|||
|
|
with_capacityÁ ”¥ ”’ ” TABLE_LAYOUTÁ ” new_inÁ ” new_uninitializedÁ ” try_with_capacity_inÁ ” with_capacity_inÁ ”¨ ” data_endÁ ”
|
|||
|
|
data_startÁ ” allocation_infoÁ ” bucket_indexÁ ” bucketÁ ”
|
|||
|
|
erase_no_dropÁ ” eraseÁ ” erase_entryÁ ¤ impl FnMut(&T) -> boolÁ ” removeÁ ” remove_entryÁ §¢ ”
|
|||
|
|
clear_no_dropÁ ” clearÁ ª ” shrink_toÁ ¬ impl Fn(&T) -> u64Á ” reserveÁ ®¢ ” try_reserveÁ °¢ ” reserve_rehashÁ ²¢ ² ” resizeÁ µ¢ µ ” insertÁ ¸¢ ” try_insert_no_growÁ ” insert_entryÁ »¢ ” insert_no_growÁ ” 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Á é¥ é’
|
|||
|
|
ì¥ ì’ ï NEWÁ ïæ ò½ ó’ ò 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Á ò prepare_insert_no_growÁ ò record_item_insert_atÁ ò is_in_same_groupÁ � ò set_ctrl_h2Á ò replace_ctrl_h2Á ò set_ctrlÁ ò™ ò° ò¿ ò num_ctrl_bytesÁ ò is_empty_singletonÁ ò prepare_resizeÁ šø š’ š š ò reserve_rehash_innerÁ Ÿ’ ò full_buckets_indicesÁ ò resize_innerÁ ¢’ ò rehash_in_placeÁ ¤ ò free_bucketsÁ ¦’ ò´ ò allocation_info_or_zeroÁ òê ò‚
|
|||
|
|
¬¥ ¬’ ¬ƒ ¬† °
|
|||
|
|
RawTableCloneÁ ² clone_from_specÁ ´¥ ´’ ·¥ ·’ · clone_from_implÁ º · clone_from_with_hasherÁ ¼¢ ¼ ¿¥ ¿’ ¿> Ã¥ Ã’ Ãã Ç¥ Ç’ Ç› DZ Çê RawIterRangeÁ Í¥ Í
|
|||
|
|
current_groupÁ Í dataÁ Í next_ctrlÁ Íþ Ó¥ Óæ Ó next_implÁ Ö DO_CHECK_PTR_RANGEÁ Ó fold_implÁ Ø— Ø“ Û¥ Ý¥ ߥ ߃ ⥠⛠âó å â size_hintÁ è¥ RawIterÁ ê¥ êù ê¸ î¥ î reflect_removeÁ î reflect_insertÁ î reflect_toggle_fullÁ îŸ ô¥ ôƒ ÷¥ ÷› ÷ó ú ÷¤) ÷ foldÁ ý“ ý— €¥ ‚¥ FullBucketsIndicesÁ „½' „ group_first_indexÁ „™ „¸ ‰‹( ‹› ‹ó ‹¤) ! RawIntoIterÁ ‘¥ ‘’ ‘ù ‘
|
|||
|
|
allocationÁ ‘Ú "—¥ —’ —ù #›¥ ›’ $ž¥ ž’ %¡¥ ¡’ ¡ã &¥¥ ¥’ ¥› ¥ó ¥¤) '«¥ «’ (®¥ ®’ RawDrainÁ ±ø ±¥ ±’ ±ù ±Õ ±
|
|||
|
|
orig_tableÁ ±Ú )¹¥ ¹’ ¹ù *½¥ ½’ +À¥ À’ ,Ã¥ Ã’ Ãã -Ç¥ Ç’ Ç› Çó Ǥ) .Í¥ Í’ /Ð¥ Ð’ RawIterHashÁ Ó¥ Óã Ó _markerÁ RawIterHashInnerÁ ׆ ×™ × h2_hashÁ ×–! × groupÁ ×ê
|
|||
|
|
0Þ¥ Þæ à’ 1âæ 2ä¥ ä› äó 3è› èó RawExtractIfÁ ëø ë¥ ë’ ëù ëÕ 4ñ¥ ñ’ ñó ô— 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Á ÓÀ ¢ ÓÎ ¢¢ ø¤œ ¤§ ¤¤ ¤’ ¤
|
|||
|
|
raw_entry_mutÁ ¤ raw_entryÁ ¤ raw_tableÁ ¤
|
|||
|
|
raw_table_mutÁ øœ § ¤ ’ � ² ³ øµœ µ§ µ¤ µ’ øºœ º§ º¤ º’ º× øÀœ À§ À¤ À’ À> ø Æœ Æ¢ Ƨ Ƥ Æ’ Æ° ÆÖ ø IterÁ Îø Îœ Χ Îã ÎÚ ø
|
|||
|
|
Ôœ Ô§ Ôƒ ø Øœ ا Ø× ø IterMutÁ Üø Üœ ܧ Üã ÜÚ ø ✠⧠ø
|
|||
|
|
åœ å§ åù ø± éœ é§ é’ éã øîœ î§ î’ îù ø IntoKeysÁ óœ ó§ ó’ óã øøœ ø§ ø’ ø› øó ý ø¤) øÿ* €“ €— € ø„œ „§ „’ „‘ ø‰œ ‰§ ‰’ ø�œ �§ �’ �× ‘ ø
|
|||
|
|
IntoValuesÁ “œ “§ “’ “ã ø˜œ ˜§ ˜’ ˜› ˜ó � ˜¤) ˜ÿ* “ — ø¤œ ¤§ ¤’ ¤‘ ø©œ ©§ ©’ øœ § ’ × ± ø KeysÁ ³ø ³œ ³§ ³ã ø¸œ ¸§ ¸ƒ ø¼œ ¼§ ¼× ø ValuesÁ Àø Àœ À§ Àã øÅœ ŧ Ń øÉœ ɧ É× ø DrainÁ Íø Íœ ͧ Í’ Íã øÓœ Ó§ Ó’ Óù ø ExtractIfÁ Øø Øœ ا Ø— Ø’ ر Øã ø àœ à§ à— à’ à› àó æ à¤) ø éœ é§ é— ø ValuesMutÁ íø íœ í§ íã ø RawEntryBuilderMutÁ òø òœ ò§ ò¤ ò’ òØ ø RawEntryMutÁ ùø ùœ ù§ ù¤ ù’ ù OccupiedÁ ÿ
|
|||
|
|
ÿˆ ù VacantÁ ‚
|
|||
|
|
‚ˆ ø RawOccupiedEntryMutÁ …ø …œ …§ …¤ …’ … elemÁ …Õ …®4 ø Žœ Ž§ Ž¤ Ž’ ø “œ “§ “¤ “’ ø RawVacantEntryMutÁ ˜ø ˜œ ˜§ ˜¤ ˜’ ˜Õ ˜®4 ø RawEntryBuilderÁ ø œ § ¤ ’ Ø ø §ø §œ §§ §¤ §’ § from_keyÁ ¢ § from_key_hashed_nocheckÁ ¯¢ ø!±ø ±œ ±§ ±¤ ±’ ± from_hashÁ ·— ·™: ± searchÁ º— º™: º ø"¾ø ¾œ ¾§ ¾¤ ¾’ ¾êP Ä¢ ¾‚Q Æ¢ ¾÷Q È— È ¾ÖQ Ë— ø#Íø Íœ ͧ ͤ Í’ ͬ Í or_insertÁ Í or_insert_withÁ Õ— Í
|
|||
|
|
and_modifyÁ ×— Í and_replace_entry_withÁ Ù— ø$Ûø Ûœ Û§ Û¤ Û’ Û keyÁ Û key_mutÁ Û into_keyÁ Û• Û into_mutÁ Û¨ Û»: Ûñ: Û into_key_valueÁ Û¬ Û
|
|||
|
|
insert_keyÁ ÛÀ ÛÎ Û replace_entry_withÁ î— î ð ø%òø òœ ò§ ò¤ ò’ ò¬ ò insert_hashed_nocheckÁ ò insert_with_hasherÁ ú™ ú òÜ ø&þœ þ§ þ¤ þ’ þ× ø'„œ „§ „¤ „’ „× ø(Šœ Š§ Š¤ Š’ Š× ø)�œ �§ �¤ �’ �× ø*–œ –§ –¤ –’ –× ø EntryÁ œø œœ œ§ œ¤ œ’ œÄM ¢
|
|||
|
|
¢ˆ œáM ¥
|
|||
|
|
¥ˆ ø+¨œ ¨§ ¨¤ ¨’ ¨× ø
|
|||
|
|
OccupiedEntryÁ ®ø ®œ ®§ ®¤ ®’ ®§ ®ÝT ®¿N ®Õ ø,¸œ ¸§ ¸¤ ¸’ ø-½œ ½§ ½¤ ½’ ø.Âœ § ¤ Â’ Â× ø VacantEntryÁ Èø Èœ ȧ Ȥ È’ ȧ ÈÝT ÈÕ ø/Ñœ ѧ Ѥ Ñ’ Ñ× ø EntryRefÁ ×ø ×™: ל ×¢ ק פ ×’ ×ÄM ß
|
|||
|
|
߈ ×áM â
|
|||
|
|
∠ø0åœ å¢ å§ å¤ å’ å× ø KeyOrRefÁ ìø ìœ ì¢ ì BorrowedÁ ð
|
|||
|
|
ðˆ ì OwnedÁ ó
|
|||
|
|
óˆ ø1öø öœ ö¢ ö
|
|||
|
|
into_ownedÁ ø2ûø ûœ û¢ ûÉ ø OccupiedEntryRefÁ € ø € ™: € œ € ¢ € § € ¤ € ’ € § € ÝT € ¿N € Õ ø3Œ ø Œ ™: Œ œ Œ ¢ Œ § Œ ¤ Œ ’ ø4” ø ” ™: ” œ ” ¢ ” § ” ¤ ” ’ ø5œ œ œ ¢ œ § œ ¤ œ ’ œ × ø VacantEntryRefÁ £ ø £ ™: £ œ £ ¢ £ § £ ¤ £ ’ £ § £ ÝT £ Õ ø6® œ ® ¢ ® § ® ¤ ® ’ ® × ø
|
|||
|
|
OccupiedErrorÁ µ ø µ œ µ § µ ¤ µ ’ µ ó9 µ » ø7½ œ ½ § ½ ¤ ½ ’ ½ × ø8à ø à œ à § à ¤ à ’ Ã × ø9Ê ø Ê œ Ê § Ê ¤ Ê ’ Ê › Ê ± Ê ê ø:Ó ø Ó œ Ó § Ó ¤ Ó ’ Ó › Ó ± Ó ê ø;Ü œ Ü § Ü ¤ Ü ’ Ü › Ü ± Ü ê ø<ä ø ä œ ä § ä › ä ó ä ¤) ä ÿ* ë “ ë — ë ø=ï œ ï § ï ‘ ø>ó œ ó § ø?ö ø ö œ ö § ö › ö ó ö ¤) ö ÿ* ý “ ý — ý ø@�
|
|||
|
|
œ �
|
|||
|
|
§ �
|
|||
|
|
‘ øA…
|
|||
|
|
œ …
|
|||
|
|
§ øBˆ
|
|||
|
|
œ ˆ
|
|||
|
|
§ ˆ
|
|||
|
|
× øCŒ
|
|||
|
|
œ Œ
|
|||
|
|
§ Œ
|
|||
|
|
’ Œ
|
|||
|
|
› Œ
|
|||
|
|
ó Œ
|
|||
|
|
¤) Œ
|
|||
|
|
ÿ* “
|
|||
|
|
“ “
|
|||
|
|
— øD–
|
|||
|
|
œ –
|
|||
|
|
§ –
|
|||
|
|
’ –
|
|||
|
|
‘ øE›
|
|||
|
|
œ ›
|
|||
|
|
§ ›
|
|||
|
|
’ øFŸ
|
|||
|
|
œ Ÿ
|
|||
|
|
§ Ÿ
|
|||
|
|
’ Ÿ
|
|||
|
|
× øG¤
|
|||
|
|
ø ¤
|
|||
|
|
œ ¤
|
|||
|
|
§ ¤
|
|||
|
|
› ¤
|
|||
|
|
ó ¤
|
|||
|
|
¤) ¤
|
|||
|
|
ÿ* «
|
|||
|
|
“ «
|
|||
|
|
— «
|
|||
|
|
øH¯
|
|||
|
|
œ ¯
|
|||
|
|
§ ¯
|
|||
|
|
‘ øI³
|
|||
|
|
œ ³
|
|||
|
|
§ øJ¶
|
|||
|
|
ø ¶
|
|||
|
|
œ ¶
|
|||
|
|
§ ¶
|
|||
|
|
› ¶
|
|||
|
|
ó ¶
|
|||
|
|
¤) ¶
|
|||
|
|
ÿ* ½
|
|||
|
|
“ ½
|
|||
|
|
— ½
|
|||
|
|
øKÁ
|
|||
|
|
œ Á
|
|||
|
|
§ Á
|
|||
|
|
‘ øLÅ
|
|||
|
|
œ Å
|
|||
|
|
§ øMÈ
|
|||
|
|
ø È
|
|||
|
|
œ È
|
|||
|
|
§ È
|
|||
|
|
› È
|
|||
|
|
ó È
|
|||
|
|
¤) È
|
|||
|
|
ÿ* Ï
|
|||
|
|
“ Ï
|
|||
|
|
— Ï
|
|||
|
|
øNÓ
|
|||
|
|
œ Ó
|
|||
|
|
§ Ó
|
|||
|
|
‘ øO×
|
|||
|
|
œ ×
|
|||
|
|
§ øPÚ
|
|||
|
|
œ Ú
|
|||
|
|
§ Ú
|
|||
|
|
× Ý
|
|||
|
|
øQß
|
|||
|
|
ø ß
|
|||
|
|
œ ß
|
|||
|
|
§ ß
|
|||
|
|
’ ß
|
|||
|
|
› ß
|
|||
|
|
ó ß
|
|||
|
|
¤) ß
|
|||
|
|
ÿ* ç
|
|||
|
|
“ ç
|
|||
|
|
— øRê
|
|||
|
|
œ ê
|
|||
|
|
§ ê
|
|||
|
|
’ ê
|
|||
|
|
‘ øSï
|
|||
|
|
œ ï
|
|||
|
|
§ ï
|
|||
|
|
’ øTó
|
|||
|
|
œ ó
|
|||
|
|
§ ó
|
|||
|
|
’ ó
|
|||
|
|
× øUø
|
|||
|
|
ø ø
|
|||
|
|
œ ø
|
|||
|
|
§ ø
|
|||
|
|
¤ ø
|
|||
|
|
’ ø
|
|||
|
|
¬ ø
|
|||
|
|
ÁS ø
|
|||
|
|
ÒS € — ø
|
|||
|
|
or_insert_with_keyÁ ‚ — ø
|
|||
|
|
ÝT ø
|
|||
|
|
ðS … — ø
|
|||
|
|
ŠT ‡ — øV‰ ø ‰ œ ‰ § ‰ ¤ ‰ ’ ‰
|
|||
|
|
or_defaultÁ øW� ø � œ � § � ¤ � ’ � ÝT � Î � • � ¨ � �U � ¬ � À �
|
|||
|
|
replace_entryÁ � replace_keyÁ � ÷U Ÿ — Ÿ øX¢ ø ¢ œ ¢ § ¢ ¤ ¢ ’ ¢ ÝT ¢ ÷T ¢ ¬ ¢ Ü øY¬ ø ¬ ™: ¬ œ ¬ ¢ ¬ § ¬ ¤ ¬ ’ ¬ ¬ ¬ ÁS ¬ ÒS ¶ — ¬ ÿn ¸ — ¬ ÝT ¬ ðS » — ¬ ŠT ½ — øZ¿ ø ¿ ™: ¿ œ ¿ ¢ ¿ § ¿ ¤ ¿ ’ ¿ öo ø[È ø È ™: È œ È ¢ È § È ¤ È ’ È ÝT È Î È • È ¨ È �U È ¬ È À È íp È ‚q È ÷U Ù — Ù ø\Ü ø Ü ™: Ü œ Ü ¢ Ü § Ü ¤ Ü ’ Ü ÝT Ü ÷T Ü ¬ Ü Ü ø]è œ è § è ¤ è ’ è ù í ¥ í ø^ð œ ð § ð ¤ ð ’ ð extendÁ õ ¥ õ ø_ø ø ø œ ø § ø ¤ ø ’ ø §v þ ¥ þ ø`� ø � œ � § � ¤ � ’ � §v ‡ ¥ ‡ ø assert_covarianceÁ Š map_keyÁ ‹ 'newÁ Š map_valÁ � îw Š iter_keyÁ � ø � îw Š iter_valÁ ’ ø ’ îw Š
|
|||
|
|
into_iter_keyÁ • îw • ’ Š
|
|||
|
|
into_iter_valÁ ˜ îw ˜ ’ Š keys_keyÁ › ø › îw Š keys_valÁ ž ø ž îw Š
|
|||
|
|
values_keyÁ ¡ ø ¡ îw Š
|
|||
|
|
values_valÁ ¤ ø ¤ îw Š î § îw
|
|||
|
|
scopeguardÁ © © © © © © ©
|
|||
|
|
ScopeGuardÁ ° ¥ ° — ° dropfnÁ ° » © £ µ ¥ µ — © ¸ ¥ ¸ — ¸
|
|||
|
|
into_innerÁ © ¼ ¥ ¼ — ¼ å ¼ ´ © Á ¥ Á — Á ¶ © Å ¥ Å — Å ã setÁ É É É É É É É É É É É
|
|||
|
|
É É É
|
|||
|
|
É É É É É É É É É É É É É � ä ¥ ä ¤ ä ’ ä Ø É é ¥ é ¤ é ’ é ƒ é † É ï ¥ ï ¤ ï ’ ï ˆ ï ù ï ‘ ï ï î ï Å8 ø — ø ï Û8 û — ï ÿ É þ ¥ þ ¤ þ È6 þ Û6 É ƒ
|
|||
|
|
¥ ƒ
|
|||
|
|
¤ ƒ
|
|||
|
|
’ ƒ
|
|||
|
|
¨ ƒ
|
|||
|
|
¨7 ƒ
|
|||
|
|
¾7 ƒ
|
|||
|
|
á7 É ‹
|
|||
|
|
¥ ‹
|
|||
|
|
¤ ‹
|
|||
|
|
’ ‹
|
|||
|
|
¼ ‹
|
|||
|
|
Ó ‹
|
|||
|
|
Ö9 ‹
|
|||
|
|
‘ ‹
|
|||
|
|
|
|||
|
|
differenceÁ “
|
|||
|
|
ø ‹
|
|||
|
|
symmetric_differenceÁ •
|
|||
|
|
ø ‹
|
|||
|
|
intersectionÁ —
|
|||
|
|
ø ‹
|
|||
|
|
C ™
|
|||
|
|
ø ‹
|
|||
|
|
containsÁ ›
|
|||
|
|
¢ ‹
|
|||
|
|
• �
|
|||
|
|
¢ ‹
|
|||
|
|
|
|||
|
|
get_or_insertÁ ‹
|
|||
|
|
get_or_insert_ownedÁ
|
|||
|
|
¢
|
|||
|
|
‹
|
|||
|
|
get_or_insert_withÁ £
|
|||
|
|
¢ £
|
|||
|
|
— £
|
|||
|
|
‹
|
|||
|
|
ó9 ‹
|
|||
|
|
is_disjointÁ ¨
|
|||
|
|
‹
|
|||
|
|
is_subsetÁ ª
|
|||
|
|
‹
|
|||
|
|
is_supersetÁ ‹
|
|||
|
|
¬ ‹
|
|||
|
|
þ> ‹
|
|||
|
|
replaceÁ ‹
|
|||
|
|
À °
|
|||
|
|
¢ ‹
|
|||
|
|
takeÁ ²
|
|||
|
|
¢ É ´
|
|||
|
|
¥ ´
|
|||
|
|
¤ ´
|
|||
|
|
’ ´
|
|||
|
|
š@ ´
|
|||
|
|
«@ É º
|
|||
|
|
¥ º
|
|||
|
|
¤ º
|
|||
|
|
’ º
|
|||
|
|
� ¾
|
|||
|
|
É À
|
|||
|
|
¥ À
|
|||
|
|
¤ À
|
|||
|
|
’ É Ä
|
|||
|
|
¥ Ä
|
|||
|
|
¤ Ä
|
|||
|
|
’ Ä
|
|||
|
|
× É É
|
|||
|
|
¥ É
|
|||
|
|
¤ É
|
|||
|
|
’ É
|
|||
|
|
÷ É
|
|||
|
|
Î
|
|||
|
|
¥ Î
|
|||
|
|
¤ Î
|
|||
|
|
’ Î
|
|||
|
|
ù Ò
|
|||
|
|
š É Ô
|
|||
|
|
¥ Ô
|
|||
|
|
¤ Ô
|
|||
|
|
’ Ô
|
|||
|
|
§v Ø
|
|||
|
|
š Ø
|
|||
|
|
É Û
|
|||
|
|
ø Û
|
|||
|
|
¥ Û
|
|||
|
|
¤ Û
|
|||
|
|
’ Û
|
|||
|
|
§v à
|
|||
|
|
š É
|
|||
|
|
â
|
|||
|
|
¥ â
|
|||
|
|
¤ â
|
|||
|
|
’ â
|
|||
|
|
> É ç
|
|||
|
|
¥ ç
|
|||
|
|
¤ ç
|
|||
|
|
’ ç
|
|||
|
|
° ç
|
|||
|
|
± É í
|
|||
|
|
¥ í
|
|||
|
|
¤ í
|
|||
|
|
’ í
|
|||
|
|
° í
|
|||
|
|
¯ É ó
|
|||
|
|
¥ ó
|
|||
|
|
¤ ó
|
|||
|
|
° ó
|
|||
|
|
µ É ø
|
|||
|
|
¥ ø
|
|||
|
|
¤ ø
|
|||
|
|
° ø
|
|||
|
|
Ú É ²B ý
|
|||
|
|
ø ý
|
|||
|
|
œ ý
|
|||
|
|
ù É ± �œ �’ �ù É ŒJ …ø …œ …’ …ù É æJ Šø Šœ Š— Š’ Š± Šã É IntersectionÁ ‘ø ‘¥ ‘¤ ‘’ ‘ù ‘¹
|
|||
|
|
É
|
|||
|
|
DifferenceÁ ˜ø ˜¥ ˜¤ ˜’ ˜ù ˜¹
|
|||
|
|
É SymmetricDifferenceÁ Ÿø Ÿ¥ Ÿ¤ Ÿ’ Ÿù É ô ¥ø ¥¥ ¥¤ ¥’ ¥ù É «ø «¥ «¤ «’ «› «± «ê É ³¥ ³¤ ³’ ³› ³± ³ê É ºœ ºƒ É ½ø ½œ ½› ½ó ½¤) ½ÿ* Ó × É Æø Æœ Æ‘ É Êœ É Ìœ Ì× É Ïœ Ï’ Ï› Ïó Ϥ) Ïÿ* Õ“ Õ— Õ É Ùœ Ù’ Ù‘ É Ýœ Ý’ É àœ à’ à× ã É åœ å’ å› åó å¤) åÿ* ë“ ë— ë É ïœ ï’ ï‘ É óœ ó’ É öœ ö’ ö× ù É !ûœ û— û’ û› ûó € € û¤) É "„œ „— „’ É #ˆ¥ ˆ¤ ˆ’ ˆƒ É $�ø �¥ �¤ �’ �› �ó �¤) �ÿ* •“ •— • É %™¥ ™¤ ™’ ™× É &ž¥ ž¤ ž’ É '¢¥ ¢¤ ¢’ ¢ƒ É (§ø §¥ §¤ §’ §› §ó §¤) §ÿ* ¯“ ¯— ¯ É )³¥ ³¤ ³’ É *·¥ ·¤ ·’ ·× É +¼¥ ¼¤ ¼’ ¼ƒ É ,Áø Á¥ Á¤ Á’ Á› Áó Á¤) Áÿ* É“ É— É -Ì¥ ̤ Ì’ É .Ð¥ Ф Ð’ Ð× É /Õ¥ Õ¤ Õ’ Õƒ É 0Ú¥ Ú¤ Ú’ É 1Þ¥ Þ¤ Þ’ Þ× É 2ãø 㥠㤠㒠㛠ãó ã¤) ãÿ* ë“ ë— É …Y îø î¥ î¤ î’ îÄM ó
|
|||
|
|
óˆ îáM ö
|
|||
|
|
öˆ É 3ù¥ ù¤ ù’ ù× É ‘Z þø þ¥ þ¤ þ’ þã É 4„¥ „¤ „’ „× É å[ ‰ø ‰¥ ‰¤ ‰’ ‰ã É 5�¥ �¤ �’ �× É 6”ø ”¥ ”¤ ”’ ”¬ ”ÁS ”• É 7œ¥ œ¤ œ’ œ• œÀ œü‚ É 8£ø £¥ £¤ £’ £• £
|
|||
|
|
into_valueÁ £¬ £Ü É Æw ¬³| îw ¬ù ¯ø ¯îw ¬ê ²îw ²’ ¬¦€ µø µîw µ’ ¬À€ ¹ø ¹îw ¹’ ¬ä€ ½ø ½îw ½’ ¬C Áø Áîw Á’ ¬î Åîw Å’ Õ È ÈÈÈÈÈÈÈÈÈ È
|
|||
|
|
È È È
|
|||
|
|
ÈÈÈ HashTableÁ Ù¥ Ù’ Ù@ È Ý¥ Ýæ Ýò Èᥠᒠᯠáò ᨠáü ç¢ á find_mutÁ é¢ á
|
|||
|
|
find_entryÁ ë¢ áó9 í¢ í¢ á
|
|||
|
|
insert_uniqueÁ ð¢ áÿ áÖ9 ó¢ á‘ õ¢ á¼ ÷¢ áÓ ù¢ ሠᑠá áù áú áÅ8 € impl FnMut(&mut T) -> boolÁ áî áÛ8 ƒ— á¿ …Ÿ … …à … á� ŠŸ Š Šà Š È�¥ �’ �› �± �ê È•ø •¥ •’ •› •± •ê Èœø œ¥ œ’ œ› œ± œê È£¥ £’ £> ȧ¥ §’ §ƒ È«¥ «’ «× È…Y ¯ø ¯¥ ¯’ ¯ÄM ³
|
|||
|
|
³ˆ ¯áM ¶
|
|||
|
|
¶ˆ ȹ¥ ¹’ ¹× È ½ø ½¥ ½’ ½¬ ½ÁS ½ÒS à impl FnOnce() -> TÁ ½ðS Å impl FnOnce(&mut T)Á È‘Z Çø Ç¥ Ç’ ǧ Çß ÇÕ È
|
|||
|
|
Î¥ Î’ È Ñ¥ Ñ’ È Ô¥ Ô’ Ô× È
|
|||
|
|
Øø Ø¥ Ø’ ØÀ Ø• ب Ø�U Ø
|
|||
|
|
into_tableÁ Èå[ áø ᥠᒠ᧠á insert_slotÁ áÕ Èè¥ è’ è× Èìø ì¥ ì’ ì¬ ìü¤ È AbsentEntryÁ òø ò¥ ò’ òÕ È÷¥ ÷’ ÷× Èûø û¥ û’ ûü¤ ȲB €ø €¥ €ã €Ú È…ø …¥ …› …ó …¤) …ÿ* ‹“ ‹— ‹ È�¥ �‘ È’¥ È C ”ø ”¥ ”ã ”Ú È™ø ™¥ ™› ™ó ™¤) ™ÿ* Ÿ“ Ÿ— Ÿ È£¥ £‘ Ȧ¥ ȱ ¨¥ ¨’ ¨ã Ȭ¥ ¬’ ¬› ¬ó ¬¤) ¬ÿ* ²“ ²— ȵ¥ µ’ µ‘ ȹ¥ ¹’ ÈŒJ ¼ø ¼¥ ¼’ ¼ã ÈÁ¥ Á’ Áù È Å¥ Å’ Å› Åó Ť) È Ë¥ Ë’ Ë‘ È Ï¥ Ï’ È Ò¥ Ò’ Ò× ÈæJ Öø Ö¥ Ö— Ö’ Ö± Öã È Ý¥ Ý— Ý’ Ý› Ýó â ݤ) È!å¥ å— å’ hash_mapÁ é hash_setÁ ë
|
|||
|
|
hash_tableÁ í å òœ òû õ¢ õœ õû à ù ùùùùù BitMaskWordÁ ù NonZeroBitMaskWordÁ ù BITMASK_STRIDEÁ ù BITMASK_MASKÁ ù BITMASK_ITER_MASKÁ ù „ WIDTHÁ „ static_emptyÁ † † AlignedBytesÁ ˆ _alignÁ ‰ ˆ bytesÁ ‹ †
|
|||
|
|
ALIGNED_BYTESÁ � „¬ „ load_alignedÁ „
|
|||
|
|
store_alignedÁ „
|
|||
|
|
match_byteÁ „ match_emptyÁ „ match_empty_or_deletedÁ „
|
|||
|
|
match_fullÁ „ ,convert_special_to_empty_and_full_to_deletedÁ ù GroupÁ ˜
|
|||
|
|
˜ˆ ùùù�ƒ GlobalÁ Ÿ
|
|||
|
|
£ƒ 1 BitMaskÁ ¥
|
|||
|
|
¥ˆ 111ªƒ 1 BitMaskIterÁ ¬
|
|||
|
|
¬ˆ 111 ±ƒ FallibilityÁ ³ FallibleÁ ´
|
|||
|
|
³
|
|||
|
|
InfallibleÁ ¶
|
|||
|
|
567ºƒ TableLayoutÁ ¼™ ¼
|
|||
|
|
ctrl_alignÁ 89:Áƒ ´¹% TryReserveErrorÁ Ä CapacityOverflowÁ Å
|
|||
|
|
Ä
|
|||
|
|
AllocErrorÁ Ç layoutÁ Ƀ Ì� ÎÖ Ð× $
|
|||
|
|
%
|
|||
|
|
'
|
|||
|
|
(
|
|||
|
|
+
|
|||
|
|
E
|
|||
|
|
H
|
|||
|
|
e
|
|||
|
|
u
|
|||
|
|
y
|
|||
|
|
z
|
|||
|
|
{
|
|||
|
|
|
|
|||
|
|
}
|
|||
|
|
~
|
|||
|
|
|
|||
|
|
�
|
|||
|
|
ƒ
|
|||
|
|
ƒ
|
|||
|
|
œ
|
|||
|
|
�
|
|||
|
|
ž
|
|||
|
|
Ÿ
|
|||
|
|
|
|||
|
|
|
|||
|
|
¡
|
|||
|
|
¢
|
|||
|
|
¢
|
|||
|
|
£
|
|||
|
|
¤
|
|||
|
|
¤
|
|||
|
|
¦
|
|||
|
|
§
|
|||
|
|
§
|
|||
|
|
©
|
|||
|
|
ª
|
|||
|
|
¬
|
|||
|
|
¬
|
|||
|
|
®
|
|||
|
|
®
|
|||
|
|
°
|
|||
|
|
°
|
|||
|
|
²
|
|||
|
|
²
|
|||
|
|
µ
|
|||
|
|
µ
|
|||
|
|
¸
|
|||
|
|
¸
|
|||
|
|
º
|
|||
|
|
»
|
|||
|
|
»
|
|||
|
|
½
|
|||
|
|
¾
|
|||
|
|
À
|
|||
|
|
À
|
|||
|
|
À
|
|||
|
|
Ä
|
|||
|
|
Å
|
|||
|
|
Å
|
|||
|
|
È
|
|||
|
|
È
|
|||
|
|
Ê
|
|||
|
|
Ê
|
|||
|
|
Ì
|
|||
|
|
Ì
|
|||
|
|
Ò
|
|||
|
|
Ò
|
|||
|
|
×
|
|||
|
|
×
|
|||
|
|
Þ
|
|||
|
|
ß
|
|||
|
|
à
|
|||
|
|
á
|
|||
|
|
â
|
|||
|
|
ã
|
|||
|
|
ä
|
|||
|
|
å
|
|||
|
|
æ
|
|||
|
|
ó
|
|||
|
|
õ
|
|||
|
|
ø
|
|||
|
|
ú
|
|||
|
|
û
|
|||
|
|
û
|
|||
|
|
û
|
|||
|
|
ü
|
|||
|
|
ü
|
|||
|
|
ý
|
|||
|
|
þ
|
|||
|
|
ÿ
|
|||
|
|
ÿ
|
|||
|
|
€
|
|||
|
|
�
|
|||
|
|
ƒ
|
|||
|
|
…
|
|||
|
|
…
|
|||
|
|
ˆ
|
|||
|
|
Š
|
|||
|
|
‹
|
|||
|
|
�
|
|||
|
|
Ž
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
’
|
|||
|
|
“
|
|||
|
|
”
|
|||
|
|
•
|
|||
|
|
–
|
|||
|
|
—
|
|||
|
|
˜
|
|||
|
|
™
|
|||
|
|
š
|
|||
|
|
š
|
|||
|
|
Ÿ
|
|||
|
|
Ÿ
|
|||
|
|
Ÿ
|
|||
|
|
Ÿ
|
|||
|
|
¡
|
|||
|
|
¢
|
|||
|
|
¢
|
|||
|
|
¢
|
|||
|
|
¢
|
|||
|
|
¤
|
|||
|
|
¤
|
|||
|
|
¤
|
|||
|
|
¦
|
|||
|
|
¦
|
|||
|
|
¨
|
|||
|
|
©
|
|||
|
|
ª
|
|||
|
|
«
|
|||
|
|
¯
|
|||
|
|
°
|
|||
|
|
°
|
|||
|
|
³
|
|||
|
|
³
|
|||
|
|
º
|
|||
|
|
º
|
|||
|
|
¼
|
|||
|
|
¼
|
|||
|
|
¼
|
|||
|
|
Æ
|
|||
|
|
Ö
|
|||
|
|
á
|
|||
|
|
å
|
|||
|
|
ç
|
|||
|
|
ð
|
|||
|
|
ð
|
|||
|
|
ñ
|
|||
|
|
ñ
|
|||
|
|
ò
|
|||
|
|
ò
|
|||
|
|
ó
|
|||
|
|
ö
|
|||
|
|
ú
|
|||
|
|
ü
|
|||
|
|
Š
|
|||
|
|
�
|
|||
|
|
Ž
|
|||
|
|
š
|
|||
|
|
¤
|
|||
|
|
©
|
|||
|
|
ª
|
|||
|
|
¹
|
|||
|
|
¼
|
|||
|
|
½
|
|||
|
|
À
|
|||
|
|
Ã
|
|||
|
|
Æ
|
|||
|
|
Ç
|
|||
|
|
Ë
|
|||
|
|
Ì
|
|||
|
|
Í
|
|||
|
|
Ð
|
|||
|
|
à
|
|||
|
|
ã
|
|||
|
|
ç
|
|||
|
|
ê
|
|||
|
|
ñ
|
|||
|
|
ô
|
|||
|
|
ô
|
|||
|
|
�
|
|||
|
|
ž
|
|||
|
|
ž
|
|||
|
|
Ÿ
|
|||
|
|
Ÿ
|
|||
|
|
¥
|
|||
|
|
¥
|
|||
|
|
«
|
|||
|
|
«
|
|||
|
|
°
|
|||
|
|
°
|
|||
|
|
¿
|
|||
|
|
Â
|
|||
|
|
Ã
|
|||
|
|
Ä
|
|||
|
|
Å
|
|||
|
|
Æ
|
|||
|
|
Ç
|
|||
|
|
È
|
|||
|
|
É
|
|||
|
|
Ê
|
|||
|
|
Ë
|
|||
|
|
Ì
|
|||
|
|
Ì
|
|||
|
|
Ì
|
|||
|
|
Î
|
|||
|
|
Î
|
|||
|
|
Î
|
|||
|
|
Ð
|
|||
|
|
Ø
|
|||
|
|
Ù
|
|||
|
|
Ú
|
|||
|
|
Û
|
|||
|
|
Ü
|
|||
|
|
á
|
|||
|
|
á
|
|||
|
|
ã
|
|||
|
|
ã
|
|||
|
|
å
|
|||
|
|
å
|
|||
|
|
ç
|
|||
|
|
ç
|
|||
|
|
é
|
|||
|
|
é
|
|||
|
|
ë
|
|||
|
|
ë
|
|||
|
|
í
|
|||
|
|
í
|
|||
|
|
ï
|
|||
|
|
ï
|
|||
|
|
ö
|
|||
|
|
ö
|
|||
|
|
ý
|
|||
|
|
ý
|
|||
|
|
„
|
|||
|
|
„
|
|||
|
|
‹
|
|||
|
|
‹
|
|||
|
|
‘
|
|||
|
|
‘
|
|||
|
|
—
|
|||
|
|
—
|
|||
|
|
�
|
|||
|
|
ž
|
|||
|
|
Ÿ
|
|||
|
|
|
|||
|
|
|
|||
|
|
¢
|
|||
|
|
¢
|
|||
|
|
©
|
|||
|
|
ª
|
|||
|
|
«
|
|||
|
|
¬
|
|||
|
|
²
|
|||
|
|
²
|
|||
|
|
¿
|
|||
|
|
¿
|
|||
|
|
¿
|
|||
|
|
Æ
|
|||
|
|
Í
|
|||
|
|
Í
|
|||
|
|
Ô
|
|||
|
|
×
|
|||
|
|
Ø
|
|||
|
|
Û
|
|||
|
|
Û
|
|||
|
|
Û
|
|||
|
|
â
|
|||
|
|
å
|
|||
|
|
è
|
|||
|
|
ò
|
|||
|
|
ý
|
|||
|
|
ÿ
|
|||
|
|
ˆ
|
|||
|
|
‘
|
|||
|
|
‘
|
|||
|
|
‘
|
|||
|
|
�
|
|||
|
|
Ÿ
|
|||
|
|
¨
|
|||
|
|
±
|
|||
|
|
±
|
|||
|
|
±
|
|||
|
|
¸
|
|||
|
|
»
|
|||
|
|
¼
|
|||
|
|
¿
|
|||
|
|
¿
|
|||
|
|
¿
|
|||
|
|
Å
|
|||
|
|
È
|
|||
|
|
É
|
|||
|
|
Ì
|
|||
|
|
Ì
|
|||
|
|
Ì
|
|||
|
|
Ó
|
|||
|
|
×
|
|||
|
|
Ø
|
|||
|
|
Ø
|
|||
|
|
à
|
|||
|
|
à
|
|||
|
|
à
|
|||
|
|
æ
|
|||
|
|
è
|
|||
|
|
é
|
|||
|
|
é
|
|||
|
|
é
|
|||
|
|
Ž
|
|||
|
|
“
|
|||
|
|
|
|||
|
|
¯
|
|||
|
|
Ä
|
|||
|
|
Æ
|
|||
|
|
È
|
|||
|
|
Ë
|
|||
|
|
×
|
|||
|
|
×
|
|||
|
|
Ù
|
|||
|
|
á
|
|||
|
|
â
|
|||
|
|
ä
|
|||
|
|
æ
|
|||
|
|
ç
|
|||
|
|
è
|
|||
|
|
ê
|
|||
|
|
ë
|
|||
|
|
î
|
|||
|
|
ú
|
|||
|
|
þ
|
|||
|
|
ƒ
|
|||
|
|
ƒ
|
|||
|
|
ƒ
|
|||
|
|
„
|
|||
|
|
‰
|
|||
|
|
‰
|
|||
|
|
‰
|
|||
|
|
Š
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
•
|
|||
|
|
•
|
|||
|
|
•
|
|||
|
|
–
|
|||
|
|
›
|
|||
|
|
›
|
|||
|
|
›
|
|||
|
|
¨
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
¸
|
|||
|
|
½
|
|||
|
|
Â
|
|||
|
|
Ç
|
|||
|
|
Ç
|
|||
|
|
Ç
|
|||
|
|
Ñ
|
|||
|
|
Ö
|
|||
|
|
Ö
|
|||
|
|
Ö
|
|||
|
|
å
|
|||
|
|
å
|
|||
|
|
ë
|
|||
|
|
ë
|
|||
|
|
ë
|
|||
|
|
ÿ
|
|||
|
|
œ
|
|||
|
|
œ
|
|||
|
|
¢
|
|||
|
|
¢
|
|||
|
|
¢
|
|||
|
|
®
|
|||
|
|
®
|
|||
|
|
´
|
|||
|
|
´
|
|||
|
|
´
|
|||
|
|
½
|
|||
|
|
Â
|
|||
|
|
Â
|
|||
|
|
Â
|
|||
|
|
É
|
|||
|
|
É
|
|||
|
|
É
|
|||
|
|
é
|
|||
|
|
ê
|
|||
|
|
ï
|
|||
|
|
ò
|
|||
|
|
ó
|
|||
|
|
û
|
|||
|
|
ü
|
|||
|
|
�
|
|||
|
|
|
|||
|
|
„
|
|||
|
|
|
|||
|
|
…
|
|||
|
|
|
|||
|
|
ˆ
|
|||
|
|
|
|||
|
|
‹
|
|||
|
|
|
|||
|
|
‹
|
|||
|
|
|
|||
|
|
‹
|
|||
|
|
|
|||
|
|
‘
|
|||
|
|
|
|||
|
|
’
|
|||
|
|
|
|||
|
|
š
|
|||
|
|
|
|||
|
|
£
|
|||
|
|
|
|||
|
|
£
|
|||
|
|
|
|||
|
|
£
|
|||
|
|
|
|||
|
|
©
|
|||
|
|
|
|||
|
|
ª
|
|||
|
|
|
|||
|
|
¯
|
|||
|
|
|
|||
|
|
²
|
|||
|
|
|
|||
|
|
³
|
|||
|
|
|
|||
|
|
»
|
|||
|
|
|
|||
|
|
¼
|
|||
|
|
|
|||
|
|
Á
|
|||
|
|
|
|||
|
|
Ä
|
|||
|
|
|
|||
|
|
Å
|
|||
|
|
|
|||
|
|
Í
|
|||
|
|
|
|||
|
|
Î
|
|||
|
|
|
|||
|
|
Ó
|
|||
|
|
|
|||
|
|
Ö
|
|||
|
|
|
|||
|
|
×
|
|||
|
|
|
|||
|
|
Ú
|
|||
|
|
|
|||
|
|
Ý
|
|||
|
|
|
|||
|
|
Ý
|
|||
|
|
|
|||
|
|
Ý
|
|||
|
|
|
|||
|
|
å
|
|||
|
|
|
|||
|
|
æ
|
|||
|
|
|
|||
|
|
ê
|
|||
|
|
|
|||
|
|
î
|
|||
|
|
|
|||
|
|
ï
|
|||
|
|
|
|||
|
|
ó
|
|||
|
|
|
|||
|
|
÷
|
|||
|
|
|
|||
|
|
÷
|
|||
|
|
|
|||
|
|
÷
|
|||
|
|
|
|||
|
|
‚
|
|||
|
|
„
|
|||
|
|
…
|
|||
|
|
‡
|
|||
|
|
–
|
|||
|
|
˜
|
|||
|
|
™
|
|||
|
|
›
|
|||
|
|
Ÿ
|
|||
|
|
¨
|
|||
|
|
¸
|
|||
|
|
º
|
|||
|
|
»
|
|||
|
|
½
|
|||
|
|
Ð
|
|||
|
|
Ò
|
|||
|
|
Ó
|
|||
|
|
Õ
|
|||
|
|
Ù
|
|||
|
|
ä
|
|||
|
|
õ
|
|||
|
|
þ
|
|||
|
|
‡
|
|||
|
|
°
|
|||
|
|
µ
|
|||
|
|
¸
|
|||
|
|
¼
|
|||
|
|
À
|
|||
|
|
Á
|
|||
|
|
Ä
|
|||
|
|
Å
|
|||
|
|
È
|
|||
|
|
í
|
|||
|
|
î
|
|||
|
|
î
|
|||
|
|
ó
|
|||
|
|
ô
|
|||
|
|
õ
|
|||
|
|
ö
|
|||
|
|
÷
|
|||
|
|
ø
|
|||
|
|
ø
|
|||
|
|
û
|
|||
|
|
û
|
|||
|
|
ý
|
|||
|
|
‡
|
|||
|
|
|
|||
|
|
Š
|
|||
|
|
|
|||
|
|
�
|
|||
|
|
|
|||
|
|
�
|
|||
|
|
|
|||
|
|
‘
|
|||
|
|
|
|||
|
|
’
|
|||
|
|
|
|||
|
|
›
|
|||
|
|
|
|||
|
|
›
|
|||
|
|
|
|||
|
|
�
|
|||
|
|
|
|||
|
|
�
|
|||
|
|
|
|||
|
|
Ÿ
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
£
|
|||
|
|
|
|||
|
|
£
|
|||
|
|
|
|||
|
|
£
|
|||
|
|
|
|||
|
|
§
|
|||
|
|
|
|||
|
|
¨
|
|||
|
|
|
|||
|
|
¨
|
|||
|
|
|
|||
|
|
ª
|
|||
|
|
|
|||
|
|
ª
|
|||
|
|
|
|||
|
|
¬
|
|||
|
|
|
|||
|
|
¬
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
®
|
|||
|
|
|
|||
|
|
¯
|
|||
|
|
|
|||
|
|
°
|
|||
|
|
|
|||
|
|
°
|
|||
|
|
|
|||
|
|
²
|
|||
|
|
|
|||
|
|
²
|
|||
|
|
|
|||
|
|
¸
|
|||
|
|
|
|||
|
|
¹
|
|||
|
|
|
|||
|
|
¾
|
|||
|
|
|
|||
|
|
¾
|
|||
|
|
|
|||
|
|
È
|
|||
|
|
|
|||
|
|
È
|
|||
|
|
|
|||
|
|
È
|
|||
|
|
|
|||
|
|
Ø
|
|||
|
|
|
|||
|
|
à
|
|||
|
|
|
|||
|
|
ç
|
|||
|
|
|
|||
|
|
ç
|
|||
|
|
|
|||
|
|
ì
|
|||
|
|
|
|||
|
|
í
|
|||
|
|
|
|||
|
|
í
|
|||
|
|
|
|||
|
|
ò
|
|||
|
|
|
|||
|
|
ó
|
|||
|
|
|
|||
|
|
ó
|
|||
|
|
|
|||
|
|
÷
|
|||
|
|
|
|||
|
|
ø
|
|||
|
|
|
|||
|
|
ø
|
|||
|
|
|
|||
|
|
ü
|
|||
|
|
|
|||
|
|
Š
|
|||
|
|
º
|
|||
|
|
¼
|
|||
|
|
Á
|
|||
|
|
Â
|
|||
|
|
É
|
|||
|
|
Ê
|
|||
|
|
Ì
|
|||
|
|
Î
|
|||
|
|
Î
|
|||
|
|
Î
|
|||
|
|
Ó
|
|||
|
|
Ô
|
|||
|
|
Ü
|
|||
|
|
ã
|
|||
|
|
ã
|
|||
|
|
ã
|
|||
|
|
å
|
|||
|
|
é
|
|||
|
|
ê
|
|||
|
|
ï
|
|||
|
|
ò
|
|||
|
|
ó
|
|||
|
|
ö
|
|||
|
|
ù
|
|||
|
|
ù
|
|||
|
|
ù
|
|||
|
|
û
|
|||
|
|
û
|
|||
|
|
€
|
|||
|
|
ƒ
|
|||
|
|
„
|
|||
|
|
„
|
|||
|
|
ˆ
|
|||
|
|
Œ
|
|||
|
|
“
|
|||
|
|
”
|
|||
|
|
™
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
ž
|
|||
|
|
¢
|
|||
|
|
¦
|
|||
|
|
|
|||
|
|
®
|
|||
|
|
³
|
|||
|
|
·
|
|||
|
|
»
|
|||
|
|
»
|
|||
|
|
»
|
|||
|
|
¼
|
|||
|
|
À
|
|||
|
|
Ç
|
|||
|
|
È
|
|||
|
|
Ì
|
|||
|
|
Ð
|
|||
|
|
Ô
|
|||
|
|
Ô
|
|||
|
|
Ô
|
|||
|
|
Õ
|
|||
|
|
Ù
|
|||
|
|
Ú
|
|||
|
|
Þ
|
|||
|
|
â
|
|||
|
|
â
|
|||
|
|
â
|
|||
|
|
é
|
|||
|
|
ê
|
|||
|
|
ù
|
|||
|
|
ý
|
|||
|
|
ý
|
|||
|
|
ý
|
|||
|
|
„
|
|||
|
|
ˆ
|
|||
|
|
ˆ
|
|||
|
|
ˆ
|
|||
|
|
�
|
|||
|
|
“
|
|||
|
|
“
|
|||
|
|
“
|
|||
|
|
›
|
|||
|
|
œ
|
|||
|
|
|
|||
|
|
¨
|
|||
|
|
æ
|
|||
|
|
ç
|
|||
|
|
ç
|
|||
|
|
é
|
|||
|
|
é
|
|||
|
|
ë
|
|||
|
|
ë
|
|||
|
|
í
|
|||
|
|
í
|
|||
|
|
í
|
|||
|
|
ð
|
|||
|
|
ð
|
|||
|
|
ò
|
|||
|
|
ó
|
|||
|
|
ó
|
|||
|
|
õ
|
|||
|
|
õ
|
|||
|
|
÷
|
|||
|
|
÷
|
|||
|
|
ù
|
|||
|
|
ù
|
|||
|
|
û
|
|||
|
|
ü
|
|||
|
|
ý
|
|||
|
|
þ
|
|||
|
|
ÿ
|
|||
|
|
€
|
|||
|
|
€
|
|||
|
|
‚
|
|||
|
|
ƒ
|
|||
|
|
ƒ
|
|||
|
|
…
|
|||
|
|
…
|
|||
|
|
Š
|
|||
|
|
Š
|
|||
|
|
ª
|
|||
|
|
®
|
|||
|
|
®
|
|||
|
|
®
|
|||
|
|
¹
|
|||
|
|
¼
|
|||
|
|
¼
|
|||
|
|
¼
|
|||
|
|
Å
|
|||
|
|
Î
|
|||
|
|
Ñ
|
|||
|
|
Ô
|
|||
|
|
×
|
|||
|
|
×
|
|||
|
|
×
|
|||
|
|
Ý
|
|||
|
|
Þ
|
|||
|
|
è
|
|||
|
|
ë
|
|||
|
|
ë
|
|||
|
|
ë
|
|||
|
|
÷
|
|||
|
|
ú
|
|||
|
|
ú
|
|||
|
|
ú
|
|||
|
|
‰
|
|||
|
|
Š
|
|||
|
|
�
|
|||
|
|
‘
|
|||
|
|
’
|
|||
|
|
�
|
|||
|
|
ž
|
|||
|
|
£
|
|||
|
|
¥
|
|||
|
|
¦
|
|||
|
|
°
|
|||
|
|
±
|
|||
|
|
¸
|
|||
|
|
Á
|
|||
|
|
Ä
|
|||
|
|
Å
|
|||
|
|
É
|
|||
|
|
Ê
|
|||
|
|
Ë
|
|||
|
|
Î
|
|||
|
|
Ï
|
|||
|
|
Ò
|
|||
|
|
Õ
|
|||
|
|
Õ
|
|||
|
|
Õ
|
|||
|
|
Ö
|
|||
|
|
Ý
|
|||
|
|
Ý
|
|||
|
|
â
|
|||
|
|
ä
|
|||
|
|
å
|
|||
|
|
å
|
|||
|
|
ô
|
|||
|
|
ô
|
|||
|
|
ø
|
|||
|
|
ø
|
|||
|
|
’ ” • ž
|
|||
|
|
¤
|
|||
|
|
«
|
|||
|
|
²
|
|||
|
|
»
|
|||
|
|
Â
|
|||
|
|
Ã
|
|||
|
|
Ã
|
|||
|
|
Ê
|
|||
|
|
Í
|
|||
|
|
Í
|
|||
|
|
Ï
|
|||
|
|
Ñ
|
|||
|
|
Ñ
|
|||
|
|
Ñ
|
|||
|
|
£8 ©8 ®8 �ø #T²òŠ ˜ ˜ ™ê± šˆ ù
|
|||
|
|
f¼Éw؈ Û”Ó Ø”Ó Š Ÿ Ÿ š² TGÅ § ÛäÓ ØäÓ #äÓ ³ äÓ Š ¥ ¥ ¦À² §ˆ œËôò%È°ó Û½Ô Ø½Ô ÇL½Ô Š ¬ ¬ ï² ®ˆ ÏZžî6 ÉY Û—Õ Ø—Õ ùM—Õ Š ³ ´ µµ³ ¶ ·Ê³ º
|
|||
|
|
’µ*‹ª ÛñÕ ØñÕ T ¥ Š ¼ ¼ ô³ ½™ ¾�´ Âî]¬vEÖ3 ÛÒÖ ØÒÖ Ìì n n Ì pµ zw0üCÅÖ Øª× Ìì „ „ µ ‡Õ ˆ¤ ‰Ú ‰³sÚ§´–ÖÅÖ’ � ë× Øë× ²ë× ³ ë× Œ"ë× ÇLë× Ìì Í Í ¡' Ͻ' ÐÒ' ÑÞ' Òþ ¬©ºIfi]ÅÖ � ‚Ù Ø‚Ù ùM‚Ù òP‚Ù Ø ê ê À) ìù í¸ >:3�’!ÖLÅÖ ùM‡Ú ÃM‡Ú òP‡Ú ùM „ „ ²+ …½' †Ô+ ‡™ ˆ¸ `«;=.tòŸ ÃMëÚ òPëÚ Ìì ‘ ‘ ¬, ”ù •×, –Ú Œ1§õVûÙ‚ÅÖ²Ø � ×Û Œ"×Û ùM×Û ÃM×Û òP×Û Ìì ± ± ¤. µù ¶Õ ·Ü. ¸Ú ëž¼/ž„¸ 8¥’ � áÜ Œ"áÜ ùMáÜ ÃMáÜ òPáÜ ùM Ó Ó ©0 Õã ÖÌ0 ÄÍ3¸ÛµCÅÖ ùM × × Ú0 ؆ Ù™ Ú‚1 Û–! Ü™1 Ýê
|
|||
|
|
¡²t4ÆrN Ø ‘ ‘ � –®4 —Õ Ï¹$�º œ§¤’ µß¬ß¬ß ™¬ß ¿c¬ß ³ ¬ß Ù¢ ‘ ‘ � –®4 —Õ Ï¹$�ºœ§¤’ 8¢ Ø Î Î ²B Òã ø ÓÚ ø ܦ‹n=ð~“ 8íৠ¿c˜á Ìì Ü Ü C àã ø áÚ ø •�Ù 0¦ 8íàÛá ùM ó ó ÖD ÷ã ø ᜠBÁvŽðäßêßºÝ ÃMÂâ òPÂâ ¿cÂâ ùM “ “ ÉF —ã ø �Ì ~@µ;¶äßêßºÝ ÃM¤ã òP¤ã ¿c¤ã Ø ³ ³ ¾H ·ã ø 0‘ÍÔ áô/ 8íàÛá ¿c†ä Ø À À ¤I Äã ø ýŒ´Õ~3ÌË 8íàÛá ¿cÓä ùM Ø Ø æJ Þ± ø ßã ø ‘®.xˆ—< 8íàÛá—’ òP Ø Ø æJ Þ± ø ßã ø ‘®.xˆ—< 8íàÛáçåäÓ Ìì … … üM ‹¿N ø ŒÕ ø �®4 ø zšÅ鑤ìÍ 8íàÛá¤íå � Ñæ ¿c ò ò ¿L øØ ø êOÂ~–r 8íàÛá¤çíå ¿c ù ÿ €ÄM �ˆ ‚ ƒáM „ˆ ^ÂÝðÉ\3 8íàÛá¤çíå ¿cÑæ ¿c ˜ ˜ ¥O žÕ ø Ÿ®4 ø ›æŽ)W ; 8íàÛá¤çíå ¿c öO ¦Ø ø ¥ ’ÊÃ"j 8íàÛá¤çíå ¿c œ ¢ £ÄM ¤ˆ ¥ ¦áM §ˆ ofrU%H 9 8íàÛá¤çíå Ìì ® ® ‘Z ´§ ø µÝT ø ¶¿N ø ·Õ ø v”„š\`Ùs 8íàÛá¤çíå � þê ¿cþê ¿c È È å[ Χ ø ÏÝT ø ÐÕ ø ÐX,§nóq 8íàÛá¤çíå ¿c × ß àÄM ሠâ ãáM äˆ a,Ã]Œ] 8 8œ¢§¤’ à ì ð ñ´^ òˆ ø ó ôÑ^ õˆ ø �”e%@NbJ øíàŠáŠá Ìì € € ¿_ ˆ § ø ‰ ÝT ø Š ¿N ø ‹ Õ ø é‚HNK8 ø ™:¶í¼íÂíÈíÎí � Ãî ¿c € € ¿_ ˆ § ø ‰ ÝT ø Š ¿N ø ‹ Õ ø é‚HNK8 8 8¶í¼íÂíÈíÎí ¿c £ £ Þa « § ø ¬ ÝT ø Õ ø ¨1A¥üÆ{� 8 8¶í¼íÂíÈíÎí ¿c µ µ ùb » ó9 ¼ » +EtQ›>ø 8íàÛá¤çíå Äc µ µ ùb » ó9 ¼ » +EtQ›>ø øíàÛá¤çíå ÇL ø ‘ ‘ � –®4 —Õ Ï¹$�ºíàÛá¤çíå ÇL øÐò ÇL¬ß ùM Î Î ²B Òã ø ÓÚ ø ܦ‹n=ð~“ øíàÛá ÃM˜á òP˜á ùM Ü Ü C àã ø áÚ ø •�Ù 0¦ øíàÛá ÃMôá òPôá ¿côá ùM é é ± íã ø Õ’-Ãè!áäßêßºÝ ÃM’õ òP’õ ¿c’õ ùM ³ ³ ¾H ·ã ø 0‘ÍÔ áô/ øíàÛá ÃM†ä òP†ä ùM À À ¤I Äã ø ýŒ´Õ~3ÌË øíàÛá ÃMÓä òPÓä ùM í í ŽL ñã ø ‰éç>{9EÍ øíàÛá ÃM í í ŽL ñã ø ‰éç>{9EÍ 8íàÛá òPé÷ ¿cé÷ ùM Í Í ŒJ Òã ø Îþç>øiÉ’ øíàÛáöß ÃM Í Í ŒJ Òã ø Îþç>øiÉ’ 8íàÛáöß òPˆù ¿cˆù ÃL¬ßäßêß ÐL¬ßèù ÐLÐò øíà øÛá ÐLÐò øíàÛá é! ° ° Þz ³ €{ © ´ » © MTRa@ÊêÅÖ— ö!Äú Œ"Äú Ø ä ä � è Ø n‡@Ö‹5ÏÅÖ¤ºÝ µß¥û¥û ™¥û ¿c¥û é ¥û ‘ ‘ � –®4 —Õ Ï¹$�ºÅÖ ÖûºÝ ÃL¥ûÅÖ ÐL¥ûÅÖ ÐL ä ä � è Ø n‡@Ö‹5Ï´Ýðßöß ø´Ý ³ ¥û –ú 8 ä ä � è Ø n‡@Ö‹5Ï¥¤çíå 8Ùý öøÔý•þ ¶û 8 ä ä � è Ø n‡@Ö‹5φþ¤çäÓ 8¼þ �ï·þ
|
|||
|
|
Â÷ 8íà—öß òP“‚ Ø ‘ ‘ éˆ –ù É —¹
|
|||
|
|
É 1×�ž $ñ 8´Ýðßöß ùM ‘ ‘ éˆ –ù É —¹
|
|||
|
|
É 1×�ž $ñ ø´Ýðßöß ¿cò‚ òPò‚ Ø ˜ ˜ ‰ �ù É ž¹
|
|||
|
|
É ÷#cK·nÁò 8´Ýðßöß ùM ˜ ˜ ‰ �ù É ž¹
|
|||
|
|
É ÷#cK·nÁò ø´Ýðßöß òP¯„ ¿c¯„ Ø Ÿ Ÿ ï‰ ¤ù É Ê–„ sÐ\ó 8´Ýðßöß ùM Ÿ Ÿ ï‰ ¤ù É Ê–„ sÐ\ó ø´Ýðßöß òPì… ¿cì… Ø ¥ ¥ ô ªù É t
|
|||
|
|
ï/p/' 8´Ýðßöß òP‘‡ ¿c‘‡ ùM ¥ ¥ ô ªù É t
|
|||
|
|
ï/p/' ø´Ýðßöß ¿c î ó ôÄM õˆ ö ÷áM øˆ ñe*bJý 8´Ýðßöß ¿c þ þ ‘Z ƒã É þ1ÇÒ©¾Ä 8´Ýðßöß ¿c ‰ ‰ å[ Žã É ÀUÄÉ"_G 8´Ýðßöß ÇL Ù Ù ›œ Ü@ š57;‘TèÅÖ²Ø ÇL ø Ù Ù ›œ Ü@ š57;‘Tè´ÝºÝ ÇL ø⊠³ Š Ø Š ¿c Š ¿c ¯ ³ ´ÄM µˆ ¶ ·áM ¸ˆ ÆAÒ—Êw ~ 8´ÝºÝ Ìì Ç Ç ‘Z ˧ È Ìß È ÍÕ È 3
|
|||
|
|
¶À¨ldO 8´ÝºÝ � ¯Œ ¿c¯Œ ¿c á á å[ å§ È æ¶¥ È çÕ È è�[,hxoç 8´ÝºÝ ¿c ò ò œ¦ öÕ È ³*ÄYY’Y 8´ÝºÝ ùM € € ²B ƒã È „Ú È 2E[Ñ…Ü ø´Ý ÃM € € ²B ƒã È „Ú È 2E[Ñ…Ü 8´Ý òPˆ� ùM ” ” C —ã È ˜Ú È 1±‹Ð/’lÖ ø´Ý ÃM ” ” C —ã È ˜Ú È 1±‹Ð/’lÖ 8´Ý òP¨� ùM ¨ ¨ ± «ã È Â"Ï;©ƒÅÖ²Ø ÃMý� òPý� ùM ¼ ¼ ŒJ Àã È s‰àü|º?M 8´ÝºÝ ÃMБ òPБ ¿cБ ùM Ö Ö æJ Û± È Üã È Á©vV.èv 8´ÝÖ‚öß òP³’ ò ¢íà Ø Ä Å ÆÓ´ Ç ð´ È‚µ ‰±Y¿V‚²1 Ðì¡“ µß¡“¡“ ™¡“ ¿c¡“ › ˜¡ Ÿ¨ ¥¯ ¬¸ ³¿ ¼œ ˜¢ Ÿ© ¥° ¬¹ ³À ¼� ˜£ Ÿª ¥± ¬º ³Á ¼s n¬ „ß Íô ê˜ ‘Ô Î¸ ³Å Àé ä º ý
|
|||
|
|
ˆ ‘¢ ˜¼ ŸÕ ¥§ ÙÉ Ä& Ÿ) Ÿ¿ „À ‘â
|
|||
|
|
ä £ Ù@ ¥Ç „Ê
|
|||
|
|
Ó
|
|||
|
|
Ü ‘«
|
|||
|
|
³ ä � Ù•
|
|||
|
|
œ
|
|||
|
|
F ¬â Í÷ ê‹ „¥ ‘Ç ±ä Óè ×ø ó˜ “à Øä Îö ÜŒ
|
|||
|
|
é¤
|
|||
|
|
³¶
|
|||
|
|
ÀÈ
|
|||
|
|
íß
|
|||
|
|
ͽ ý
|
|||
|
|
Ï �å …û Š� ‘§ ˜Á Ÿã ¥… €™ ”¬ ¨Å ¼Ý ÖW q né „Û Í› ‘½ ±â ÜŽ …¸ ®Œ € Î Çì „Ý Íž ‘À ±“ …½ ®” € Ñ Ç´ „à „¡ ‘à ±Å ° è Í‚ ê� „® ‘Ð ±‰ ó© “é Øó Î…
|
|||
|
|
Ü›
|
|||
|
|
é³
|
|||
|
|
³Å
|
|||
|
|
À×
|
|||
|
|
íï
|
|||
|
|
ÍÊ ý
|
|||
|
|
Ý �ó …„ Šž ‘³ ˜Ì ŸÚ ¥’ €¦ ”¹ ¨Ï ¼å Ö€ ê� „« ‘Í ±„ ó¤ “ï Î�
|
|||
|
|
Ü–
|
|||
|
|
é¯
|
|||
|
|
³Á
|
|||
|
|
ÀÓ
|
|||
|
|
íê
|
|||
|
|
ÍÆ ý
|
|||
|
|
Ù �ï …� €£ ”µ ¨Ë ¼ ‘º
|
|||
|
|
ä Ì Äµ ‘À
|
|||
|
|
ä Πĺ ‘Ø Î� ó “¼ ³É Àþ ò„ ùŠ …� ˜– ¨ œÂ ®Ñ Èå ל € ® £ ½ µ ˆ
|
|||
|
|
ÜŸ
|
|||
|
|
éÚ
|
|||
|
|
íó
|
|||
|
|
ÍÄ
|
|||
|
|
ä Ì ý
|
|||
|
|
à �ö …™ ‘· ˜Ð ŸÞ ¥ù î„ þ� ‰« Ù¹ ¯Ô Çè á÷ òÒ ¼Ð ÄÆ ‘û ìà µ è ‘Î
|
|||
|
|
ä ð ‘ø ‘� ‘Ô
|
|||
|
|
ä Û
|
|||
|
|
ä ¼ ° Á ° É
|
|||
|
|
ä ç
|
|||
|
|
|
|||
|
|
í
|
|||
|
|
|
|||
|
|
ó
|
|||
|
|
|
|||
|
|
ø
|
|||
|
|
|
|||
|
|
õ Ë ÄŠ Ó Û*Ø* #˜³ ÇL
|
|||
|
|
"ùM ; TØÌì
|
|||
|
|
� D ²8Œ"òP ÃMĵߌ™¿c(Ù¢˜à ÄcÃLÐLé!#ö!é –úöø¶û�ï òÐì 8Á¨ © üû0 ‚ \š % _Á €€€€€€€€ 0x8080_8080_8080_8080Á´´
|
|||
|
|
¤´
|
|||
|
|
À”Ó % ü”7 … ,¬ % _Á ¤í † ˆ ˆ Ù¯ ‰í¯ ù ‹€° ù .“ŠÞäP Z y †
|
|||
|
|
‡
|
|||
|
|
† ü—ð ñ£ ܽ µ¤ ½ ¥£ lî ££ Ï 6 � ¥£ * 2 � ¥£ † ƒ ££ / ¥£ s ? � ¥£ dË
|
|||
|
|
… ‡ & 1 8< … Group::WIDTHÁ 0ÁdÄ
|
|||
|
|
… Œ & 1 8< … Group::WIDTHÁ ¬ ”Ó ¬Ã ,Ä Y ü‰ Z ˆ â üå � ¥£ dú ”Ó ž ñ£ ‘ DŒ Y _Á dË
|
|||
|
|
… Ž & 1 8< … Group::WIDTHÁ 0Á 0Á 0Á´–
|
|||
|
|
¤–
|
|||
|
|
À - Ü– ° üú8 U $� ~ * _Á ÌÐ
|
|||
|
|
¼Ð
|
|||
|
|
иª & ü·3 V $É # _Á ÿ 0b1111_1111Á € 0b1000_0000Áüá!/ ¼á!
|
|||
|
|
‡!
|
|||
|
|
À * ¬û!
|
|||
|
|
Ϟ!
|
|||
|
|
À * e v �" ¼—"
|
|||
|
|
¬—" ä¬ 1 7 ¬¼"
|
|||
|
|
œ¼" ’ Ò" üÂ!’ _ ,Ö! ë ; _Á 4Ç? ”Ð?
|
|||
|
|
„Ð?
|
|||
|
|
Ë‚ÅÖ ' l…@ 4…@
|
|||
|
|
#$Œ@
|
|||
|
|
È‚ 1 4Œ@ ‘@ ü¬@� ì¯@ t¯@ 4¯@
|
|||
|
|
#,¶@
|
|||
|
|
É‚ 1 <¶@ ¼@ W dÀ@ … s Ë@ 4ß@ tß@
|
|||
|
|
,æ@ À° 0 <æ@ ì@ Û W d“A
|
|||
|
|
… ¬A üì?Ì ¼ ·A ½A ¾A i üŸ?Ÿ üÃ?û ÒÖ $´? èØèØ éØ™²‚ êØŸ²‚ ªë¥CHÈ 4 ñ²
|
|||
|
|
Î Ë Ë ¾³ Ì ¾³ \ ‚µ} ²› … , … 4 þ Ÿ \¼þ • ÅÖ üßýs „ ÅÖäÓ ”ùý ð Š Š ñ ‹† Œ™ �¥ Ž¸ ”’g"måT> Ñþ Øþ ‘ üºýž „ „ µ ‡Õ ˆ¤ ‰Ú ‰³sÚ§´–ÖÅÖäÓ $Ðý äÓ ; • • – PhantomDataÁ Fu\»ŸÅÖ [ ¥+ 𠊵 ¼Ýƒ
|
|||
|
|
|
|||
|
|
¬Ýƒ
|
|||
|
|
iÅÖ ' ü»ƒ: — ÒÖ \σ ( _Á ,Ї \ë‡ • ÅÖ ü–‡k „ ÅÖ²Ø ”°‡ 𠊵 €ˆ ‡ˆ ˜ ü憡 ë× $‡‡ ²Ø ,ú† ²Ø ¯ è¶ £ ¤ C 𠊵 ¤Æ›
|
|||
|
|
|
|||
|
|
”Æ›
|
|||
|
|
ñ # ü´›' 𠊵 $¿› ( _Á ü¦ŸO üÆŸ, üÆŸ!
|
|||
|
|
¬ÆŸ
|
|||
|
|
œÆŸ
|
|||
|
|
† ) - I ^ ñŸ ü¯ŸD
|
|||
|
|
´¯Ÿ
|
|||
|
|
ž œ - òŸ üÈž† Š �  ¦ Í Ó Ô ñ ü§ž Šµ $¹ž ‰‰ § ‹‰ ï íe¼îËè¿* ‡ ä» † ñ£ ‡ †¾ � µ¤ ‰ w trueÁ falseÁd˜† |¹†
|
|||
|
|
l¹†
|
|||
|
|
‘èù / ü…†N ‘ äßêßðßäÓ Ò† Ù† üÉ…� ¸ ‘ ‘ � –®4 —Õ Ï¹$�ºäßêßðßäÓ $ö… ðß dâ… ðß „ „ µ ‡Õ ˆ¤ ‰Ú ‰³sÚ§´–ÖèùäÓ T ®4f Þ dúŸ ¼› ,¬
|
|||
|
|
$ „›
|
|||
|
|
˜èùöß : L ± üçŸV ‘ äßêßðßöß ¼ à üžŸ¥ À ¬ß $ØŸ ðß dºŸ öß ,ËŸ ðß „ „ µ ‡Õ ˆ¤ ‰Ú ‰³sÚ§´–Öèùöß A öß A ®4z ¤| » äÈz 4Ýz
|
|||
|
|
" ¤Èz
|
|||
|
|
¸ÅÖ Öû ; L ãz ü°z? ä ÅÖÖûäÓ îz õz üúy{ �
|
|||
|
|
ä ä � è Ø n‡@Ö‹5ÏÅÖÖûäÓ $¡z Öû 4“z ‘ ‘ � –®4 —Õ Ï¹$�ºÅÖ ÖûäÓ 9 Öû : á7a Ç üë”& 4ƒ• ,‹• 2
|
|||
|
|
9 ¼ë”
|
|||
|
|
ÀÅÖ ÖûºÝ U F m �• üÓ”I ä ÅÖÖûºÝ ›• ¢• ü�”’ ˆ
|
|||
|
|
¥û $Ä” Öû 4¬” ºÝ ,·” ‘ü û Öû ù ºÝ í á70 ¤2 q |¦
|
|||
|
|
l¦
|
|||
|
|
‘ÅÖ , üŽ2 Ù ÅÖäÓ ¿ Æ ß üé] Ù Ù ›œ Ü@ š57;‘TèÅÖäÓ $ÿ �¶ ´ Q ¼¼% ,Í%
|
|||
|
|
" „¼%
|
|||
|
|
˜ÅÖ²Ø 8 I Ò% ü¤%: Ù ÅÖ²Ø Ý% ä% üô$p ä Š $•% ²Ø ,ˆ% ë× º ²Ø º ¤ M ¼— ˜ ™ % ”Ó 1 ç‘ç‘ è‘ uint8x8_tÁ 鑈 õÝ–äº s z ÌÖ ¥ ¦ % ½Ô 1 8 ? ìþ ¬ % —Õ 1 ½Ô 9 @ Dƒû ù íàÛá¤çíå + € 8 ù ÿ €ÄM �ˆ ‚ ƒáM „ˆ ^ÂÝðÉ\3 íàÛá¤çíå š … … üM ‹¿N ø ŒÕ ø �®4 ø zšÅ鑤ìÍ íàÛá¤çíå ö ý 4¢þ ù íàÛá¤çíå + ƒ 8 ”Ð D ˜ ˜ ¥O žÕ ø Ÿ®4 ø ›æŽ)W ; íàÛá¤çíå ” › Dî¬ œ íàÛá¤çíå + £ 8 œ ¢ £ÄM ¤ˆ ¥ ¦áM §ˆ ofrU%H 9 íàÛá¤çíå š ® ® ‘Z ´§ ø µÝT ø ¶¿N ø ·Õ ø v”„š\`Ùs íàÛá¤çíå
|
|||
|
|
4㯠œ íàÛá¤çíå + ¦ 8 ÈÓ D È È å[ Χ ø ÏÝT ø ÐÕ ø ÐX,§nóq íàÛá¤çíå § DÇÜ × ¶í¼íÂíÈíÎí 1 à > × ß àÄM ሠâ ãáM äˆ a,Ã]Œ] ¶í¼íÂíÈíÎí ¦ € € ¿_ ˆ § ø ‰ ÝT ø Š ¿N ø ‹ Õ ø é‚HNK8 ¶í¼íÂíÈíÎí 4Õß × ¶í¼íÂíÈíÎí 1 ã > œ× J £ £ Þa « § ø ¬ ÝT ø Õ ø ¨1A¥üÆ{� ¶í¼íÂíÈíÎí ¬ ³ D°ã ì íàŠá # ñ 0 ì ð ñ´^ òˆ ø ó ôÑ^ õˆ ø �”e%@NbJ íàŠá � Šá › ¢ ,Åã ì íàŠá # ô 0 úÚ < íà D K DŒ€ î ´Ýðßöß ' ô 4 î ó ôÄM õˆ ö ÷áM øˆ ñe*bJý ´Ýðßöß ’ þ þ ‘Z ƒã É þ1ÇÒ©¾Ä ´Ýðßöß Ò Ù 4ù‚ î ´Ýðßöß ' ÷ 4 ‡Ý @ ‰ ‰ å[ Žã É ÀUÄÉ"_G ´Ýðßöß € ‡ Dè® ¯ ´ÝºÝ # ´ 0 ¯ ³ ´ÄM µˆ ¶ ·áM ¸ˆ ÆAÒ—Êw ~ ´ÝºÝ Š Ç Ç ‘Z ˧ È Ìß È ÍÕ È 3
|
|||
|
|
¶À¨ldO ´ÝºÝ Þ å 4þ´ ¯ ´ÝºÝ # · 0 ÿß < á á å[ å§ È æ¶¥ È çÕ È è�[,hxoç ´ÝºÝ ‘ ˜ ÷ø© É ÈéëíòÄí ¤,×
|
|||
|
|
�<› ‘ ï�<¸ ä ð›œL× Ù ñü ˆ+ ü 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Á ÷ø© É ÈéëíòÄíø ¤ù �ø ‘ ï�÷ ä ð›œö Ù ñKNQ”Ê
|
|||
|
|
HTÀ 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¯ ù
|
|||
|
|
ü \Ô üå P M Experimental and unsafe `RawTable` API. This module is only available if theÁ ì¶ `raw` feature is enabled.Á »@|Ó ¼Í Ü Ä
|
|||
|
|
D¯ + ö . ø L¹ # ö / ´TÙH l öÌ4‚K n öµD¼ô „ ö¡'dÇ“
|
|||
|
|
Í öÀ)<¥í
|
|||
|
|
ê ö²+”Ȫ „ ö¬,\õË ‘ ö¤.DóÚ ± ö©0\Ÿñ Ó ö…2dÉ ë öš²4) Ÿ ö 0 š² ö 0 Lê
|
|||
|
|
,î
|
|||
|
|
1MOTYZ[\]^_`afgln„Š²Íê„‘±Ó×ëù³¼ handle_alloc_errorÁ” œ
|
|||
|
|
4. èØ £,O µ
|
|||
|
|
ÞzTV ° ¼´|n Ä
|
|||
|
|
FusedIteratorÁl� òP öµ\° • öµ – í Ç ë MaybeUninitÁ\Û ÑÛ §<÷ ‰ hintÁ$‹ ‹ µ ‘ “ Ä
|
|||
|
|
† + . ø � # / š²4Ä Ÿ 0 š² 0 ï²\ï ¬ Iï² Iê±,‹ ˜ J¢4Ñ
|
|||
|
|
Þ KûD™ Þ L¥ ù —œÞáÒÕŒ;È˼¿´g²ÌƒšÌ¢�LÁm´ÐV”ìI$„9<,/L‡ ,‹ Ä
|
|||
|
|
D + ø L' # š²42 Ÿ š² \IK<>.0L® »Òœú
|
|||
|
|
»ŠÔ�üù
|
|||
|
|
1üõ
|
|||
|
|
6üì
|
|||
|
|
A ,²#+Ÿ ¤,Ø � ˜<ß ‚ 4è èØ !§<„ ‰ "œÂNP?A02”ù$Ôà Lñ # # Î츪 üà° # ¥� ¥� $%$% % $ ü…>Dˆ Ò Ò¸ª ñ²Ö¿Ù¿ Ú¿« Û¿ˆ Ü¿ Ý¿Þ¿ˆ ‚†f|Â
|
|||
|
|
ǽ # ‘ #
|
|||
|
|
$¸ª$’‚µ4˜üÌ>TÖ Ó Ó¸ª ǽñ² # á #
|
|||
|
|
%¸ª$ⵠ肵4úüÉ äÓ'( $ % ' ( ü†=D‰ Ô ÔäÓ ñ²”Ž & ’ &
|
|||
|
|
' $“‚µ4™ü§=T± Õ ÕäÓ Ç½ñ² & ¼ &
|
|||
|
|
( $½µ µ4Õ¼§ äÓ* ´ * ¤Û<Þ äÓ ) )
|
|||
|
|
* üšZD¨ Ö Ö ’ ñ²”Ž ’ , , Æ Íìç’ ± #ç’ L´
|
|||
|
|
+ç’¤,¿‚µ4Ê,. \¡ íð]`\Î <Ò ¬¥¦¾®\ ÿ 1 3Ñ®”# € 1 4•¯Œ7 ƒ 1 5�¯dJ ‚ 1 6ë®tX � 1 7T acRTCE35#%d¥ ½Ô9:;<=>? ü¦ " .\þ 4´ ½Ô½Ô 8 8
|
|||
|
|
9 $» üØ
|
|||
|
|
" .\È
|
|||
|
|
ŒÛ
|
|||
|
|
1 ½Ô½Ô 8 8
|
|||
|
|
: $í
|
|||
|
|
üý ' \‹ ½Ô 8 8
|
|||
|
|
; $— ü™
|
|||
|
|
3 t§
|
|||
|
|
½Ôۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ 8 8
|
|||
|
|
< $¶
|
|||
|
|
üÍ+ tÛ ½Ô 8 8
|
|||
|
|
= $ê ü”? ´— 1 ô ô õ ¨ ÷ ˆÐ mjç�ítoé 8 8
|
|||
|
|
> nonzeroÁ<® ü´* l ½Ô 8 8
|
|||
|
|
? $Ð ì£ ½ÔABC ÈL ÉL ÊL C LÇ $Ì @ @ lÞ Dã @ @ —ÕüŽ! L‘ ½Ô—Õ @ @
|
|||
|
|
C $› „² —ÕE ü‘ : »@|û ¼õ $¦ × ×—Õ D « D
|
|||
|
|
E $° Ö,¶ ìÉ" —ÕGH úM ûM H Lí" $ò" F F ü“## $–# Ø Ø—Õ‡— F ›# F
|
|||
|
|
H $ # Ôà Ì „€ « ¼¶
|
|||
|
|
Ÿ ¼þ
|
|||
|
|
“ üÄ(\Ç ÅÖ ¥ N N ÍìÅÖ Ó
|
|||
|
|
MÅÖ addrÁ$Ö ü¦?\° ÅÖ ž ¥ P P Û� ¼
|
|||
|
|
OÅÖ toÁ¿÷$Í „ž ñÕRS ü”- Œ— ñÕ¡“ Q Q
|
|||
|
|
R $©üã5 Læ ñÕñ²¡“ Q Q
|
|||
|
|
S $ð‚µ4öüÓ œÙ T T Í츪 ,î T Æ Æ UVUV Ìúl€ T T ´·T½ T T üî! ¥ X X Û� óÅÖ
|
|||
|
|
|À,Æ Œ�<“ äˆ <‹
|
|||
|
|
[ ™$“ ü˜ T›
|
|||
|
|
\ ™$¦ ü¤ %„§
|
|||
|
|
] ™$¸ ÌŠ �
|
|||
|
|
^ §$� ÌÂ!dÈ! ´Õ#Ø#
|
|||
|
|
` §$Û#|ý* D„+ a a • b¤ c® ® ÿ‚È ® ÿ‚È bcT“+ “+ a a l£+4£+ a a lµ+ ̤e ü×++LÚ+ Ù Ṳ̀ d ä+ d
|
|||
|
|
e $é+†\ï+ü–13 œ™1 ‡—
|
|||
|
|
f capÁ 1ü÷97¼ú9
|
|||
|
|
g †\’:„ú> ÒÖik ÌŸ? ¨? ÒÖ h ¥ j j h Û� ¬? ×· üÒAH¤ÕA ÒÖ Û¼Ý¼Þ¼© ß¼ à¼ÛἈ cSñŸ«‡zÙñ² h h
|
|||
|
|
k $êA° <ðA¬ÎH üŒHA > A reference to an empty bucket into which an can be inserted.Á ù l l ´ mÖ 0AY¸?G 0AY¸?G mdêH,êH l l ¤÷J üûH8 5 A reference to a hash table bucket containing a `T`.Á ´Iú ü¸IP M This is usually just a pointer to the element itself. However if the elementÁ ü‰JL I is a ZST, then we instead track the index of the element in the table soÁ üÖJ that `erase` works properly.Á x ¥ o o Û� ‰Kª× zw0üC p |‰M ‰M n n ‰‰ § ‹‰ ï íe¼îËè¿*ÅÖü‹N! ¥ r r Û� —Nª×
|
|||
|
|
ܱN ¥ t t Û� ¶Nª×u Ù u ¼áN,äN Ú Úª× ª× s êN s
|
|||
|
|
uÅÖ$ëNŒ£O ¥ w w Û� ¨Oª×xyz{|}~�ƒ ü¶cA|Àc ò ª× v v
|
|||
|
|
xÅÖ baseÁ$ÐcÖ,âcü™€9l£€ Û Ûª× ò v ±€ v
|
|||
|
|
yÅÖ$²€÷¯$¸€ôä üŽ�; 8 Acquires the underlying raw pointer `*mut T` to `data`.Á Î�ú TÖ� # NoteÁ å�ú üí�R O If `T` is not [`Copy`], do not use `*mut T` methods that can cause calling theÁ üÄ�S P destructor of `T` (for example the [`<*mut T>::drop_in_place`] method), becauseÁ üœ‘T Q for properly dropping the data we also need to clear `data` control bytes. If weÁ üõ‘P M drop data, but do not clear `data control byte` it leads to double drop whenÁ üÊ’# [`RawTable`] goes out of scope.Á ò’ú üú’S P If you modify an already initialized `value`, so [`Hash`] and [`Eq`] on the newÁ üÒ“X U `T` value and its borrowed form *must* match those for the old `T` value, as the mapÁ ü¯”T Q will not re-evaluate where the new value should go, meaning the value may becomeÁ üˆ•: 7 "lost" if their location does not reflect their state.Á Ç•ú üÏ•& # [`RawTable`]: crate::raw::RawTableÁ üú•k h [`<*mut T>::drop_in_place`]: https://doc.rust-lang.org/core/primitive.pointer.html#method.drop_in_placeÁ üê–A > [`Hash`]: https://doc.rust-lang.org/core/hash/trait.Hash.htmlÁ ü°—< 9 [`Eq`]: https://doc.rust-lang.org/core/cmp/trait.Eq.htmlÁ ñ—ú tù— # ExamplesÁ Œ˜ú <”˜ ```Á ì ˜ # #[cfg(feature = "raw")]Á ŒÂ˜ # fn test() {Á üؘ( % use core::hash::{BuildHasher, Hash};Á ü…™+ ( use hashbrown::raw::{Bucket, RawTable};Á µ™ú ü½™I F type NewHashBuilder = core::hash::BuildHasherDefault<ahash::AHasher>;Á ‹šú ü“šV S fn make_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()Á ,ˆœ }Á ’œú üšœ1 . let hash_builder = NewHashBuilder::default();Á üÐœ$ ! let mut table = RawTable::new();Á ùœú Ü�� let value = ("a", 100);Á ü¡�2 / let hash = make_hash(&hash_builder, &value.0);Á Ø�ú üà�N K table.insert(hash, value.clone(), |val| make_hash(&hash_builder, &val.0));Á ³žú ü»žZ W let bucket: Bucket<(&str, i32)> = table.find(hash, |(k1, _)| k1 == &value.0).unwrap();Á šŸú ü¢Ÿ: 7 assert_eq!(unsafe { &*bucket.as_ptr() }, &("a", 100));Á <០# }Á ŒíŸ # fn main() {Á üƒ ! # #[cfg(feature = "raw")]Á „©
|
|||
|
|
# test()Á <¾ Þà <Ê ƒ»4ë Ü Üª× ½� v ò v
|
|||
|
|
zÅÖ$ó üÀ´.4Ê´ Ý Ýª× ª× v Ñ´ v
|
|||
|
|
{ÅÖ$Ò´ž
|
|||
|
|
4Ø´ü™½ $®½ Þ Þª× v ³½ v
|
|||
|
|
|ÅÖ$´½üÉÃ%$ÞÃ ß ßª× ÅÖ v ãà v
|
|||
|
|
}ÅÖ$äÃü™Ê),®Ê à àª× ÅÖ v ´Ê v
|
|||
|
|
~ÅÖ$µÊ¹ »ÊüÑÖ( üòÊ8 5 Returns a shared immutable reference to the `value`.Á ¯Ëú d·Ë # SafetyÁ ÈËú üÐË0 - See [`NonNull::as_ref`] for safety concerns.Á …Ìú ü�Ì] Z [`NonNull::as_ref`]: https://doc.rust-lang.org/core/ptr/struct.NonNull.html#method.as_refÁ ïÌú t÷ÌÞº ŠÍú <’̓» ìžÍ”» ŒÀÍ»» üÖÍ(×» üƒÎ+Š¼ ³Îú ü»ÎIͼ ‰Ïú ü‘ÏV®½ üìÏ �¾ ü�Ð4¹¾ ìÉÐ÷¾ ´ëО¿ ,†Ñ¾¿ �Ñú ü˜Ñ1Û¿ üÎÑ$—À ÷Ñú üÿÑJ G let value: (&str, String) = ("A pony", "is a small horse".to_owned());Á üÎÒ2øÀ …Óú ü�ÓNÂÁ àÓú üèÓ[ X let bucket: Bucket<(&str, String)> = table.find(hash, |(k, _)| k == &value.0).unwrap();Á ÈÔú |ÐÔ assert_eq!(Á üäÔ# unsafe { bucket.as_ref() },Á üŒÕ2 / &("A pony", "is a small horse".to_owned())Á 4ÃÕ );Á <ÎÕÞà ŒÚÕïà üðÕ!‹Ä „–Ö¶Ä <«ÖÞà <·Öƒ»4ßÖ á áª× øÅÖ vø € € êÖ v
|
|||
|
|
ÅÖ ø$ëÖæÖü¦è, üŸ×6 3 Returns a unique mutable reference to the `value`.Á Ú×ú dâ×žÉ ó×ú üû×0 - See [`NonNull::as_mut`] for safety concerns.Á °Øú T¸ØÔ± ÇØú üÏØO L [`Hash`] and [`Eq`] on the new `T` value and its borrowed form *must* matchÁ ü£ÙN K those for the old `T` value, as the map will not re-evaluate where the newÁ üöÙJ G value should go, meaning the value may become "lost" if their locationÁ üÅÚ! does not reflect their state.Á ëÚú üóÚ] Z [`NonNull::as_mut`]: https://doc.rust-lang.org/core/ptr/struct.NonNull.html#method.as_mutÁ üÕÛA¿¹ ü›Ü<‹º ÜÜú täÜÞº ÷Üú <ÿ܃» ì‹Ý”» ŒÝ»» üÃÝ(×» üðÝ+Š¼ Þú ü¨ÞIͼ öÞú üþÞV®½ üÙß �¾ üýß4¹¾ ì¶à÷¾ ´Øàž¿ ,ó྿ ýàú ü…á1Û¿ ü»á$—À äáú üìáJšÍ ü»â2øÀ òâú üúâNÂÁ Íãú üÕã[§Î µäú d½ä unsafe {Á tÎä bucketÁ ¬áä .as_mut()Á tûä .1Á üŽå9 6 .push_str(" less than 147 cm at the withers")Á 4Ìå };Á |×å™Ï üëå#³Ï T“æ &(Á ¬¢æ "A pony",Á ü¼æI F "is a small horse less than 147 cm at the withers".to_owned()Á LŠç )Á 4˜ç�Ð <£çÞà Œ¯çïà üÅç!‹Ä „ëç¶Ä <€èÞà <Œèƒ»4´è â âª× øÅÖ vø ‚ ‚ ¿è v
|
|||
|
|
�ÅÖ ø$Àè»èüþò; üüè@ = Copies `size_of<T>` bytes from `other` to `self`. The sourceÁ üÁé& # and destination may *not* overlap.Á ìéú dôéžÉ …êú ü�ê9 6 See [`ptr::copy_nonoverlapping`] for safety concerns.Á Ëêú üÓêU R Like [`read`], `copy_nonoverlapping` creates a bitwise copy of `T`, regardless ofÁ üëL I whether `T` is [`Copy`]. If `T` is not [`Copy`], using *both* the valuesÁ üþëO L in the region beginning at `*self` and the region beginning at `*other` canÁ äÒì [violate memory safety].Á óìú TûìÔ± Šíú ü’íOÌÓ üæíN¦Ô ü¹îJÿÔ üˆï!ÔÕ ®ïú ü¶ï` ] [`ptr::copy_nonoverlapping`]: https://doc.rust-lang.org/core/ptr/fn.copy_nonoverlapping.htmlÁ ü›ð= : [`read`]: https://doc.rust-lang.org/core/ptr/fn.read.htmlÁ üÝðk h [violate memory safety]: https://doc.rust-lang.org/std/ptr/fn.read.html#ownership-of-t
|
|||
|
|
,¬óü±ô- üˆô( % A raw hash table with an unsafe API.Á Y2 ¥ … ’ † … † Û� Åô Íì²Ø ¬Èô #²Ø LËôë× ‰³sÚ§´–Ö ‡ˆ‰ ÆHJ C Èô äÓ ¤åô,åô „ „ ŠµDÿô,ÿô „ „ ²Ø´¼õ4¼õ „ „ 趤íö lôö Šµ ”’g"måT> ‹Œ�Ž”ý÷\ý÷ Š Š Œüø$üø Š Š ǽ”äù\äù Š Š d¿ú,¿ú Š Š ÜÐú ¥ � � Û� Õú�¶‘’“ Ôºý üòúA > Creates a new empty hash table without allocating any memory.Á ¸ûú üÀûH E In effect this returns a table with exactly 1 bucket. However we canÁ ü�üI F leave the data pointer dangling since that bucket is never written toÁ üÛüL I due to our load factor forcing us to always have at least 1 free bucket.Á Çý �¶ � � ¢Êü�€J üÞþG D Attempts to allocate a new hash table with at least enough capacityÁ üªÿD A for inserting the given number of elements without reallocating.Á »@|ùÿ¼óÿŒ–€ Ö¿Ù¿ Ú¿« Û¿ˆ Ü¿ Ý¿Þ¿ˆ ‚†f|Â
|
|||
|
|
�¶¡“ � �
|
|||
|
|
’ÅÖˆ D¨€ü¦‚- üœ�J G Allocates a new hash table with at least enough capacity for insertingÁ üë�6 3 the given number of elements without reallocating.Ál‚ �¶ � �
|
|||
|
|
“ÅÖˆ D»‚ü�ƒ$ ¥ • ’ – – • Û� •ƒ ¼é ˜ƒ ÎéL›ƒë×—˜™š›œ�žŸ ¡¢£¤¦§©ª¬®°²µ¸º»½¾ÀÄÅÈÊÌÒ×Þßàáâãäåæçè ¨ª ¬® ü»ƒ dÁƒ ” ” ÒÖüæ†% üûƒK H Creates a new empty hash table without allocating any memory, using theÁ ¤Ë„ given allocator.Á ä„ú üì„HÆì ü¹…I™í ü‡†Líí4ó† ²Øë× ” ” ýˤU_ü½‰� ŒÇ‰ ²Ø ñÕÖ¿Ù¿ Ú¿« Û¿ˆ Ü¿ Ý¿Þ¿ˆ ‚†f|Â
|
|||
|
|
ëס“ ” ”
|
|||
|
|
™Åֲؤ,≰ <ô‰ fallibilityÁ\ŒŠüáŽW ü•�Y V Attempts to allocate a new hash table using the given allocator, with at least enoughÁ üó�M J capacity for inserting the given number of elements without reallocating.Á »@|ËŽ¼ÅŽ¤èŽ ²ØÓø ” ”
|
|||
|
|
šÅֲ؈ DýŽ¤,Ž�üƒ“: üÞ‘[ X Allocates a new hash table using the given allocator, with at least enough capacity forÁ ü¾’@ = inserting the given number of elements without reallocating.Á„Š“ ²Øë× ” ”
|
|||
|
|
›Åֲ؈ D›“¤,¬“축 üï”4 1 Returns a reference to the underlying allocator.ÁL½• å åë× å²Ø ” Ç• ”
|
|||
|
|
œÅÖ²Ø$È•ü“™$ üõ•O L Returns pointer to one past last `data` element in the table as viewed fromÁ üÉ–& # the start point of the allocation.Á ô–ú üü–T Q The caller must ensure that the `RawTable` outlives the returned [`NonNull<T>`],Á üÕ—< 9 otherwise using it may result in [`undefined behavior`].Á –˜ú üž˜b _ [`undefined behavior`]: https://doc.rust-lang.org/reference/behavior-considered-undefined.htmlÁDš™ æ æë× ò ” £™ ”
|
|||
|
|
�ÅÖ²Ø$¤™üô£- ü€£+ ( Returns pointer to start of data table.Á »@|È£»ÒœÙ£üÇ£&ü¾£1T‚¤ ç çë× ò ” �¤ ”
|
|||
|
|
žÅÖ²Ø$Ž¤üɨ6 ü…¥? < Return the information about memory allocated by the table.Á É¥ú üÑ¥M J `RawTable` allocates single memory block to store both data and metadata.Á ü£¦V S This function returns allocation size and alignment and the beginning of the area.Á üþ¦X U These are the arguments which will be passed to `dealloc` when the table is dropped.Á Û§ú üã§7 4 This
|
|||
|
|
additionalÁTöøá74‰ù|~ ü”€Š üíþI F Tries to ensure that at least `additional` items can be inserted intoÁ ü»ÿ# the table without reallocation.Á \›€ ú úë× ð¤Ö¿Ù¿ Ú¿« Û¿ˆ Ü¿ Ý¿Þ¿ˆ ‚†f|Â
|
|||
|
|
¡“ ”¢ ± ± °€ ” �¥”æ€ û �"ð¤ ûÅÖ lë€ û ð¤í«˜" õ€
|
|||
|
|
°ÅÖ²Øð¤$µ€ó§TÀá74Þ€su ü ‡²tª‡ ü üë× ð¤ñÕÚª ”¢ ³ ³ ‡ ” �¥”ø‡ ý �"ð¤ ýÅÖ lý‡ ý ð¤Ù˜" ‡ˆ
|
|||
|
|
²ÅÖ²Øð¤$LJó§TÕ‡á74ð‡Úø\”ˆ} t�� ²ç¡ ´ €¢ ´ ž¢ ´ ´ ² ´ÅÖ²Ø𤠊µ ð¤ üÖ™¨4à™ þ þë× ð¤ñÕÚª ”¢ ¶ ¶ ð™ ” �¥”¤š ÿ �"ð¤ ÿÅÖ l©š ÿ ð¤Ó°˜" ³š
|
|||
|
|
µÅÖ²Øð¤$õ™ˆ Dƒšá74œšÚø\Àš|~ tÝž µç¡ · €¢ · ž¢ · · µ ·ÅÖ²Ø𤰯ɯü¶¡V üåŸE B Inserts a new element into the table, and returns its raw bucket.Á ¯ ú ü· I F This does not check if the given element already exists in the table.Á 4½¡ € €ë×ÅÖð¤ª× ”¢ ¹ ¹ Ä¡ ” �¥”ì¡ � �"ð¤ �ÅÖ lñ¡ � ð¤ã´˜" û¡
|
|||
|
|
¸ÅÖ²Øð¤$É¡§$Ï¡»,Ú¡á74ä¡{} üë®Q üó«Y V Attempts to insert a new element without growing the table and return its raw bucket.Á Ѭú üÙ¬[ X Returns an `Err` containing the given element if inserting it would require growing theÁ T¹ table.Á Èú üÐIŸ² »@|¤®¼ž® ”ò® ‚ ‚ë×ÅÖÖ¿Ù¿ Ú¿« Û¿ˆ Ü¿ Ý¿Þ¿ˆ ‚†f|Â
|
|||
|
|
ª×ÅÖ ” …¯ ”
|
|||
|
|
ºÅÖ²Ø$Š¯§$�¯»,›¯üà³Y ü„²P M Inserts a new element into the table, and returns a mutable reference to it.Á Ù²ú üá²IŸ² dç³ ƒ ƒë×ÅÖ𤠃ÅÖ ”¢ ¼ ¼ ô³ ” �¥”œ´ „ �"𤠄ÅÖ l¡´ „ ð¤Á»˜" «´
|
|||
|
|
»ÅÖ²Øð¤$ù³§$ÿ³»,Š´á74”´{} üè·I ü„µD A Inserts a new element into the table, without growing the table.Á ͵ú üÕµF C There must be enough space in the table to insert the new element.Á ¶ú ü¨¶IŸ² »@|±·»æô·ü°·1ü§·< tö· … …ë×ÅÖª× ” …¸ ”
|
|||
|
|
½ÅÖ²Ø$Š¸§$�¸»,›¸ü•¾} ü±»J G Temporary removes a bucket, applying the given function to the removedÁ ü€¼J G element and optionally put back the returned value in the same bucket.Á ϼú ü×¼: 7 Returns `true` if the bucket still contains an elementÁ –½ú üž½A > This does not check if the given bucket is actually occupied.Á œ£¾ † †ëת×Ö‚ ”— ¿ ¿ º¾ ” ÍìÖ‚ ·¾ –"Ö‚ÅÖ ´û¾ Ö‚ù˜" ì�Lˆ¿
|
|||
|
|
¾ÅÖ²ØÖ‚$¿¾ß4ž± ؾ_a üùŹ üºÃF C Searches for an element in the table. If the element is not found,Á ü…ÄG D returns `Err` with the position of a slot where an element with theÁ üÑÄ same hash could be inserted.Á öÄú üþÄJ G This function may resize the table if additional space is required forÁ ÌÍÅ inserting an element.ÁÄ€Æ ‡ ‡ë×›™¢Ö¿Ù¿ Ú¿« Û¿ˆ Ü¿ Ý¿Þ¿ˆ ‚†f|Â
|
|||
|
|
ª×�ª ”¢ Á ¢   Á ¢Æ ” Ç™´ÐÆ ÍìäÆ ”øÆ ˆ “"›™ ˆÅÖ ŒÕÆ ˆ ›™žÈ˜" $âÆ ‰ �"äÆ ‰ÅÖ lýÆ
|
|||
|
|
: ¥ À ’ Á À Á Û� ž‚
|
|||
|
|
¼é ¡‚
|
|||
|
|
ÎéL¤‚
|
|||
|
|
³ ²Ø <°‚
|
|||
|
|
ë× ´  79 ;= ¤è‚
|
|||
|
|
<ë‚
|
|||
|
|
ë× ¿ ¿
|
|||
|
|
ÂÅÖ²Øü†Š
|
|||
|
|
- »Òœï‰
|
|||
|
|
¬î‰
|
|||
|
|
üå‰
|
|||
|
|
¥ Ä ’ Å Ä Å Û� ‹Š
|
|||
|
|
¼é ŽŠ
|
|||
|
|
ÎéL‘Š
|
|||
|
|
ë×Æ �" Æ &( *, ”ëŠ
|
|||
|
|
$îŠ
|
|||
|
|
ß ßë× Ã óŠ
|
|||
|
|
Ã
|
|||
|
|
ÆÅÖ²Ø$øŠ
|
|||
|
|
üŠ�
|
|||
|
|
5 ¥ È ’ É È É Û� ��
|
|||
|
|
¼é ’�
|
|||
|
|
ÎéL•�
|
|||
|
|
ë×ÊËÌ ÈL ÉL ÊL Ì 46 8: LÆ�
|
|||
|
|
$�
|
|||
|
|
Ç Ç ÅÖlÙ�
|
|||
|
|
D�
|
|||
|
|
Ç Ç ×Ûü²‘
|
|||
|
|
' Lµ‘
|
|||
|
|
ë××Û Ç Ç
|
|||
|
|
ÌÅÖ²Ø$¿‘
|
|||
|
|
üµ“
|
|||
|
|
! »¢ ¥ Î Î Û� Ô“
|
|||
|
|
‚Ù ¬©ºIfi] ÏÐÑÒ%' ÔÔ”
|
|||
|
|
lÔ”
|
|||
|
|
Í Í —Õ|ª•
|
|||
|
|
$ª•
|
|||
|
|
Í Í ª×¤�–
|
|||
|
|
L�–
|
|||
|
|
Í Í tõ–
|
|||
|
|
õ–
|
|||
|
|
Í Í ¢Ë¼ˆ—
|
|||
|
|
¥ Ô Ô Û� �—
|
|||
|
|
‚ÙÕÖØ ü½
|
|||
|
|
C Ç
|
|||
|
|
¢Ëª× ‚Ù Ó Ó
|
|||
|
|
ÕÅÖ™$Ë
|
|||
|
|
Ò'$Ü
|
|||
|
|
‘ í
|
|||
|
|
üÕ¶
|
|||
|
|
S L߶
|
|||
|
|
à à‚Ù¬Ï Óœ( × × ‰·
|
|||
|
|
Ó œ( ôé¶
|
|||
|
|
|
|||
|
|
ÖÅÖ œ($Ž·
|
|||
|
|
”ï¶
|
|||
|
|
ü¹Ç
|
|||
|
|
{ LÃÇ
|
|||
|
|
‚Ù “‚û¡Î Ó— Ù “ Ú Ù Ú Ó Íì‚û ÍÇ
|
|||
|
|
Íì¡Î ÐÇ
|
|||
|
|
“"‚û¡Îª× Ä›È
|
|||
|
|
‚û‹Ï˜" ¡Î ²È
|
|||
|
|
|
|||
|
|
ØÅÖ‚û¡Î$×Ç
|
|||
|
|
¹ áÇ
|
|||
|
|
accÁ ïÇ
|
|||
|
|
± ûÇ
|
|||
|
|
€‚ {} üíÝ
|
|||
|
|
' ¥ Ü Ü Û� ùÝ
|
|||
|
|
‚Ù ü˜Þ
|
|||
|
|
' ¥ Þ Þ Û� ¤Þ
|
|||
|
|
‚Ù üÄÞ
|
|||
|
|
! ¥ à à Û� ÉÞ
|
|||
|
|
‚Ùá Ù á ¼�ß
|
|||
|
|
, ß
|
|||
|
|
á á‚Ù ‚Ù ß ¦ß
|
|||
|
|
ß
|
|||
|
|
áÅÖ$§ß
|
|||
|
|
üïà
|
|||
|
|
$ ¥ ã ã Û� ôà
|
|||
|
|
‚Ùäåç úM ûM ÿM ç å &( Lšá
|
|||
|
|
$Ÿá
|
|||
|
|
â â ª×üçá
|
|||
|
|
' $êá
|
|||
|
|
â â‚Ù¬Ï â ïá
|
|||
|
|
â
|
|||
|
|
åÅÖ$ôá
|
|||
|
|
$óâ
|
|||
|
|
üžã
|
|||
|
|
-L¡ã
|
|||
|
|
ã ã‚Ù ‡— â «ã
|
|||
|
|
â
|
|||
|
|
çÅÖ$¬ã
|
|||
|
|
üÐæ
|
|||
|
|
) ¥ é é Û� Õæ
|
|||
|
|
‚Ù ¬ší
|
|||
|
|
üþæ
|
|||
|
|
K H Iterator which returns a raw pointer to every full bucket in the table.Á Êç
|
|||
|
|
ú üÎç
|
|||
|
|
M J For maximum flexibility this iterator is not bound by a lifetime, but youÁ üœè
|
|||
|
|
- * must observe several rules when using it:Á üÊè
|
|||
|
|
Y V - You must not free the hash table while iterating (including via growing/shrinking).Á ü¤é
|
|||
|
|
I F - It is fine to erase a bucket that has been yielded by the iterator.Á üîé
|
|||
|
|
N K - Erasing a bucket that has not yet been yielded by the iterator may stillÁ ü½ê
|
|||
|
|
V S result in the iterator yielding that bucket (unless `reflect_remove` is called).Á ü”ë
|
|||
|
|
J G - It is unspecified whether an element inserted after the iterator wasÁ üßë
|
|||
|
|
S P created will be yielded by that iterator (unless `reflect_insert` is called).Á ü³ì
|
|||
|
|
J G - The order in which the iterator yields bucket is unspecified and mayÁ Üþì
|
|||
|
|
change in the future.Á ׫ ¥ ë ë Û� í
|
|||
|
|
‡Ú >:3�’!ÖL ìí!# ü¶í
|
|||
|
|
$Áí
|
|||
|
|
ê ê ‚ÙdÜí
|
|||
|
|
,Üí
|
|||
|
|
ê ê ”íí
|
|||
|
|
¥ ï ï Û� òí
|
|||
|
|
‡Úðñòó üÄñ
|
|||
|
|
6 ü†î
|
|||
|
|
M J Refresh the iterator so that it reflects a removal from the given bucket.Á Øî
|
|||
|
|
ú üàî
|
|||
|
|
E B For the iterator to remain valid, this method must be called onceÁ üªï
|
|||
|
|
: 7 for each removed bucket before `next` is called again.Á éï
|
|||
|
|
ú üñï
|
|||
|
|
_ \ This method should be called _before_ the removal is made. It is not necessary to call thisÁ üÕð
|
|||
|
|
N K method if you are removing an item that this iterator yielded in the past.Á »@|®ñ
|
|||
|
|
¼¨ñ
|
|||
|
|
tÒñ
|
|||
|
|
ä å ä‡Ú åª× î áñ
|
|||
|
|
î
|
|||
|
|
ðÅÖ$æñ
|
|||
|
|
ìñ
|
|||
|
|
ü¤ö
|
|||
|
|
6 ü´ò
|
|||
|
|
P M Refresh the iterator so that it reflects an insertion into the given bucket.Á ‰ó
|
|||
|
|
ú ü‘ó
|
|||
|
|
EïÝ üÛó
|
|||
|
|
2 / for each insert before `next` is called again.Á ’ô
|
|||
|
|
ú üšô
|
|||
|
|
O L This method does not guarantee that an insertion of a bucket with a greaterÁ üîô
|
|||
|
|
F C index than the last one yielded will be reflected in the iterator.Á ¹õ
|
|||
|
|
ú üÁõ
|
|||
|
|
B ? This method should be called _after_ the given insert is made.Á »@|Žö
|
|||
|
|
¼ˆö
|
|||
|
|
t²ö
|
|||
|
|
æ ç æ‡Ú çª× î Áö
|
|||
|
|
î
|
|||
|
|
ñÅÖ$Æö
|
|||
|
|
Ìö
|
|||
|
|
ü‹ø
|
|||
|
|
H »@|õ÷
|
|||
|
|
¼ï÷
|
|||
|
|
œ•ø
|
|||
|
|
è é è‡Ú éª× î ©ø
|
|||
|
|
î
|
|||
|
|
òÅÖ$®ø
|
|||
|
|
´ø
|
|||
|
|
is_insertÁLÃø
|
|||
|
|
üð™ "lú™ ê ê‡Ú î ˆš î
|
|||
|
|
óÅÖ$�š ä › ¥ õ õ Û� ¥› ‡Úö Ù ö ¼ô› ,÷› ë ë‡Ú ‡Ú ô ý› ô
|
|||
|
|
öÅÖ$þ› üôœ ¥ ø ø Û� ùœ ‡Úùúüý úM ûM ÿM óN ý ü ú 13 Lš� $Ÿ� ÷ ÷ ª×üç� ' $ê� ì ì‡Ú¬Ï ÷ ï� ÷
|
|||
|
|
úÅÖ$ô� ,× üÑ¡ -LÔ¡ í í‡Ú ¬Ô ÷ Þ¡ ÷
|
|||
|
|
üÅÖ$ß¡ üÁ¢ l$Ä¢ ‡Ú“Ö‚±í ÷“ þ — ÿ þ ÿ ÷ Íì±í É¢ Ü ̢ Íì‡Ú ,�£ “"Ö‚±í‡Ú úM Ì“£ Ö‚¤î˜" ±í «£
|
|||
|
|
ýÅÖ±íÖ‚$Ï¢ initÁ$Õ¢ ± Þ¢ ˆŠ ŒŽ üù£ ( ¥ � � Û� þ£ ‡Ú ü¥¤ $ ¥ ƒ ƒ Û� ª¤ ‡Ú ü¶ª $ ¬µ ëÚ `«;=.tòŸ …†‡ˆÔØ« lØ« „ „ —ÕÄî¬ Œî¬ „ „ Œü $ü „ „ ǽd¼® ,¼® „ „ ¼Í® ëÚŠ ü†³ /L�³ î îëÚ‡— ‰ š³ ‰
|
|||
|
|
Š $Ÿ³ üÊà $ ëÚŒ�Ž úM ûM ÿM � Ž Lõà $úà ‹ ‹ üöÅ #$ùÅ ï ïëÚ‡— ‹ þÅ ‹
|
|||
|
|
� $ƒÆ üñÉ -LôÉ ð ðëÚ ¬Ô ‹ þÉ ‹
|
|||
|
|
Ž $ÿÉ üÑÊ - ëÚ ü‚Ë ) ëÚ üêË 0 ü°Ë 9 6 Iterator which consumes a table and returns elements.Á ¸ ¥ ’ ’ “ ’ “ Û� �Ì ¼é¬„Ì ÎéL‡Ì ×Û Œ1§õVûÙ‚ ”•– ¤8: < „Ì äÓ „¡Ì $¡Ì ‘ ‘ ‡Úü·Ì ,T·Ì ‘ ‘ Þ€´éÌ 4éÌ ‘ ‘ è¶ü„Í ' ¥ ˜ ’ ™ ˜ ™ Û� ‰Í ¼é ŒÍ ÎéL�Í ×Ûš "$ üãÍ $êÍ ñ ñ×Û ‡Ú — ïÍ —
|
|||
|
|
šÅÖ²Ø$ðÍ ü©Î W ¥ œ ’ � � œ Û� µÎ ¼é ¸Î ÎéL»Î ž‚$îÎ °‚$ûÎ ×Û -/ 13 ü…Ï W ¥ Ÿ ’ Ÿ Û� ‘Ï ¼é ”Ï ÎéL—Ï ©ƒ$ÊÏ ºƒ$×Ï ×Û -/ 13 üÈÓ 0 »Òœ±Ó ¬°Ó ü§Ó ¥ ¢ ’ £ ¢ £ Û� ÍÓ ¼é ÐÓ ÎéLÓÓ ×Û¤ �" ¤ &( *, ”°Ô $³Ô ò ò×Û ¡ ¸Ô ¡
|
|||
|
|
¤ÅÖ²Ø$½Ô üÝÖ 4 ¥ ¦ ’ § ¦ § Û� âÖ ¼é åÖ ÎéLèÖ ×Û¨©ª úM ûM ÿM ª © 8: <> L˜× $�× ¥ ¥ ÅÖüÝ× $à× ó ó×Ûì� ¥ å× ¥
|
|||
|
|
©ÅÖ²Ø$ê× üÊØ -LÍØ ô ô×Û ¬Ô ¥ ×Ø ¥
|
|||
|
|
ªÅÖ²Ø$ØØ ü¡Ù = ¥ ¬ ’ ¬ Û� ¦Ù ¼é ©Ù ÎéL¬Ù ×Û ! üâÙ 9 ¥ ¯ ’ ° ° ¯ Û� çÙ ¼é êÙ ÎéLíÙ ×Û ! üèÚ 1 ü Ú G D Iterator which consumes elements without freeing the table storage.Á &¾ ø ² ¥ ³ ’ ´ ² ´ ³ Íì´Ý €Û ÍìºÝ ¬ƒÛ #ºÝ L†Û ´Ý øü�Þ ' ºÝ ø ± ± ¤. µù ¶Õ ·Ü. ¸Ú ëž¼/ž„¸ ø´ÝºÝ ëž¼/ž„¸ µ¶·¸ ÆüÚ ÇÉ Â ƒÛ äÓ „ Û $ Û ± ± ê ê À) ìù í¸ >:3�’!ÖL´Ý¤ëÜ ,ëÜ ± ± Šµü…Ý "T…Ý ± ± ‰‰ § ‹‰ ï íe¼îËè¿*Šµs4�Þ ± ± • • – öµ Fu\»Ÿ ø „ „ µ ‡Õ ˆ¤ ‰Ú ‰³sÚ§´–Ö´ÝºÝ ü¼Þ ( 8 õ ¥ º ’ » » º õ ñ� ÁÞ ƒ‚ ÄÞ •‚LÇÞ áܼ "$ üœß $£ß ö öáÜ þƒ ¹ ¨ß ¹
|
|||
|
|
¼ 8´ÝºÝ$©ß üâß X 8 ÷ ¥ ¾ ’ ¿
|
|||
|
|
ë ë …2 ïù ðÕ =ÆâçLl4 ø´ÝºÝ =ÆâçLl4 ïðЉ ˆŠ ŒŽ ¤ë‰ $ï‰ ë ë þƒ£,‰Š ë ë øç…ü«Š , 8 „ ¥ ò ’ ó ó „ ò ñ� °Š ƒ‚ ³Š •‚L¶Š ë ë …2 ïù ðÕ =ÆâçLl4 8´ÝºÝô [] _a ü�‹ c $�‹ † †ý¢ç劎 ñ— õ õ ¥‹ ñ Íìçå ¢‹ … “"çå …´Ý ¬Ü‹ … çå㤘" $í‹
|
|||
|
|
ô 8´ÝºÝçå$ª‹ ± ´‹ mo ,� Ä™ ¤� <³ · �‘Ÿ¥«°ÎÜéó“³ÀÍØíòù…˜ œ®È×ì€ £ µ Š ø L # ø ú ö / Ì4! n ø û öš²L Ÿ ø ü ö 0 š²L ø ü ö 0 ¤.D1 ± ø ý ö…2d; ë ø þ ö¬,\I ‘ ø ÿ öÀ)<V ê ø € öµD_ „ ø � öåTx ò ø ƒ¼´|„ Ä ø „Y4¨ ø …×$À ` ø ‡p,Æ ¿c ø ˆp Âc ø ˆ\\ß Åe ø ŠŽ$ì še ø ‹Ž e ø ‹¦†lƒ òP ø Œöµ\¤ • ø �öµ – ø �í » ë ø Ž IndexÁ,Ï Ù¢ ø �TþLÂL³¶¡¤�’}€kn,p\_MP¤šCL´5 º(+TÒ üþÌ÷ÚÌ–ÊLµ¥„Ä‘Ü© üâ' $ Dummy default hasher for `HashMap`.Á »ŠŒ”œ“ôŠ ”² � ¥Y& Ê®—õ ¥Y& Ê®—õ ü´5G üÉB ? A hash map implemented with quadratic probing and SIMD lookup.Á Œú ü�H E The default hashing algorithm is currently [`AHash`], 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þÞº �ú <‘ƒ» Ü™ 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("def
|
|||
|
|
*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 üàüh üèö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 üžÿol¡ÿ ø µ ¶ µ¬ß ¶ÿ± ۼݼ޼© ß¼ à¼ÛἈ 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Á üžƒZ W mutable reference will be returned to any value. `None` will be returned if any of theÁ üýƒ# keys are duplicates or missing.Á ¥„ú 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);Á ³‡ú ü»‡& # let got = libraries.get_many_mut([Á ¤æ‡ "Athenæum",Á ôÿ‡ "Library of Congress",Á <¢ˆ ]);Á |®ˆ™Ï dˆ got,Á tÓˆ Some([Á ´æˆ &mut 1807,Á ´�‰ &mut 1800,Á \œ‰ ]),Á 4¬‰�Ð ·‰ú ü¿‰" // Missing keys result in NoneÁ üæ‰&—Ü ¤‘ŠÇÜ üªŠ" "New York Public Library",Á <ÑŠ�Ý ÔÝŠ assert_eq!(got, None);Á üŠú ü„‹$ ! // Duplicate keys result in NoneÁ ü‹&—Ü ¤Ø‹ÇÜ ¤ñ‹ÇÜ <ŠŒ�Ý Ô–ŒÏß <µŒƒ»dÈŒ · ¸ ·¬ß ¸ÿ± ŸÛ¼Ý¼Þ¼© ß¼ à¼ÛἈ cSñŸ«‡zÙ ·êß Ÿ Ó¢ ð Ÿ ñ ñ ð ðŒ Ó ˜³ ÕŒ Ÿ tàŒ ª³$·� »³l¾�
|
|||
|
|
ïäßêßðßößÿ± Ÿ$õŒ ksÁûŒXZ V æŒ ,û� ïç¡ ô €¢ ô ž¢ ô ô ï ô äßêßðßößÿ± Ÿ èù Ÿ êß Ÿ D‰Ž ïç¡ õ €¢ õ ž¢ õ õ ï õ äßêßðßößÿ±
|
|||
|
|
,ˆÅt‘Æ ²ç¡ ³ €¢ ³ ž¢ ³ ³ ² ³äßêßðßöß §€ êß ¬ß ½Æ ²ç¡ ´ €¢ ´ ž¢ ´ ´ ² ´äßêßðßöß ª�
|
|||
|
|
§�
|
|||
|
|
üÙÆt œ ¶ § · ¤ ¸ ’ ¹ ¸ ¶ ¹ · ßç ÞÆ ðç áÆ �è äÆ ’è çÆ Ó…’Ç ä…$—Ç ™êß ¤Ç îî\¯Ç £èLÃÇ¬ß Y[ ]_ ac eg üÓÇb œ » § ¼ ¤ ½ ’ ¾ ¾ ¼ » ½ ßç ØÇ ðç ÛÇ �è ÞÇ ’è áÇ ¿cäß ,�È ¿cêß ,�È £èL«È¬ß¿ Àc ¿ Z\ ^` bd fh ü¼È8 ¿È Ò Ó Ô Ò¬ß Ó c c ˆ ¢cµ
|
|||
|
|
` £c bufÁ ` àB¤GS
|
|||
|
|
ÔÖ¿Ù¿ Ú¿« Û¿ˆ Ü¿ Ý¿Þ¿ˆ ‚†f|Â
|
|||
|
|
ŸÈŸÈ È ErrorÁ O˜éBL º ÃÈ º
|
|||
|
|
¿äßêßðßöß$Äȱ ÊÈü´É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ùà \ŠÑ #ÿà 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íàŠáóàùàÿà$¥ÕÝT «Õ̧á üªÚ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Á ü¿Ü$¶þ äÜú 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);Á üüà"ݪ
|
|||
|
|
<Ÿáƒ» $²á ø Ï œ Ð § Ñ Ñ Ï Ð Äó »á Õó ¾á íà øüãá# Ûá ø½ó ܦ‹n=ð~“ ÒÓ·áOQ SU ´Çá,Çáø Î Î ê ê À) ìù í¸ >:3�’!ÖL³ú¦4ãáø Î Î • • – öµ Fu\»Ÿ‹úüÂâ# 8 Ø œ Õ § Ö Õ Ø Ö Äó Çâ Õó Êâ˜á× Ù × !# ¼�ã , ã Ù Ù˜á ˜á Ô ¦ã Ô
|
|||
|
|
× 8íàÛá$§ãü¡ä6 8 Ú œ Ù § Ú Ú Ú Ù Äó ¦ä Õó °ä ¿cíà ,©ä ¿cÛá ,³ä˜áÛ Àc Û ?A CE üÞä8 áä Û Ü Ý Û˜á Ü c c ˆ ¢cµ
|
|||
|
|
` £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());Á <Ë샻 <Þì ø Ý œ Þ § ß Þ Ý ß Äó êì Õó íì ì¬
|
|||
|
|
üÀí' ý¬
|
|||
|
|
|
|||
|
|
¢ô •�Ù 0¦ àáæìAC EG ´öì,öìø Ü Ü á
|
|||
|
|
g4Àíø Ü Ü • • – öµ Fu\»Ÿ�ú øÛáü¤ï8 8 Þ œ ã § ä ã ä Þ Äó °ï Õó ¹ï Ììíà $³ï ÌìÛá $¼ïôá 68 :< äáï 8 ß œ æ § ç æ ç ß Äó æï Õó éïôáè üøð+ $†ñ à àôá Î Î ²B Òã ø ÓÚ ø ܦ‹n=ð~“ àíàÛá å ‹ñ å
|
|||
|
|
è 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ìú’õ Õ’-Ãè!á í:< >@ B éú äÓ ì†û,†ûø é é ‘ ‘ ¬, ”ù •×, –Ú Œ1§õVûÙ‚èùºÝü¨û* œ ï § ð ’ ñ ð ñ ï ßç û ðç °û ƒ‚ ³û •‚L¶û’õò ') +- /1 üÍü+ $Ûü á á’õ Î Î ²B Òã ø ÓÚ ø ܦ‹n=ð~“ áäßêß î àü î
|
|||
|
|
òäßêߺÝ$áüü‰…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¦…Ââ ᜠBÁvŽð ÷:< >@ B £… äÓ ÄÀ…,À…ø ó ó ’õüÝ…7 œ ù § ú ’ û ù ú û ßç â… ðç å… ƒ‚ è… •‚Lë…Ââüýÿ€ úM ûM ÿM óN € ÿ ý LN PR TV L›†$ † ø ø äßü½† $À† â âÂâۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙäß ø ņ ø
|
|||
|
|
ýäßêߺÝ$ʆDý† ýç¡ þ €¢ þ ž¢ þ þ ý þäßêßºÝ èùäß ü¡‡-L¤‡ ã ãÂâ ¬Ô ø ®‡ ø
|
|||
|
|
ÿäßêߺÝ$¯‡üˆˆp$‹ˆ Â⓲ã÷Ø
|
|||
|
|
ø“ � — ‚ � ‚ ø Íì÷Ø
|
|||
|
|
�ˆ ßã “ˆ ÍìÂâ ,̈ “"²ã÷Ø
|
|||
|
|
Ââ úM ÌÞˆ ²ãêÙ
|
|||
|
|
˜" ÷Ø
|
|||
|
|
öˆ
|
|||
|
|
€äßêߺÝ÷Ø
|
|||
|
|
²ã$–ˆìí$œˆ± ©ˆ�� ‘“ l�‰ €ç¡ ƒ €¢ ƒ ž¢ ƒ ƒ € ƒäßêߺÝ÷Ø
|
|||
|
|
²ã ÷Ø
|
|||
|
|
èù÷Ø
|
|||
|
|
²ãü¿‰@ œ … § † ’ ‡ … † ‡ ßç ĉ ðç lj ƒ‚ ʉ •‚L͉Â∠ÄM ˆ /1 35 79 ´”Š —Š ä äÂâ „ ›Š „
|
|||
|
|
ˆäßêߺÝ$œŠüÏŠ< œ Š § ‹ ’ Œ Œ Š ‹ ßç ÔŠ ðç ׊ ƒ‚ ÚŠ •‚LÝŠÂâ $& (* ,. ü�‹G œ Ž § � ’ � � Ž � ßç •‹ ðç Ÿ‹ ƒ‚ ©‹ ‚“
|
|||
|
|
,˜‹ ““
|
|||
|
|
,¢‹ •‚L¬‹Ââ‘ Àc ‘ AC EG IK üÞ‹8 á‹ å æ ç åÂâ æ c c ˆ ¢cµ
|
|||
|
|
` £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ê� ć“úª ü “7 4 assert_eq!(vec, [Some("a"), Some("b"), Some("c")]);Á Ø“ú ÜÜ“·ª
|
|||
|
|
üø“$ ! assert_eq!(values.next(), None);Á ü�”$óç
|
|||
|
|
<”ƒ» TÕ” œ ” § • ’ – • – ” ßç à” ðç ã” ƒ‚¬æ” •‚L锤ã �Ì ~@µ;¶ —:< >@ B æ” äÓ Äƒ•,ƒ•ø “ “ ’õü •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)]);Á ´¢ú ܸ¢·ª
|
|||
|
|
üÔ¢"îÐ
|
|||
|
|
ü÷¢"îÐ
|
|||
|
|
<š£ƒ» $£ ø ´ œ µ § ¶ ´ µ ¶ Äó ¶£ Õó ¹£ ì¬
|
|||
|
|
Ô( ý¬
|
|||
|
|
Û(ôõ 0‘ÍÔ áô/ ·²£=? 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…® ø Á œ  § à Á à  Äó �® Õó “® ì¬
|
|||
|
|
K. ý¬
|
|||
|
|
R.Íö ýŒ´Õ~3ÌË ÄŒ®=? 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£¹ ì¬
|
|||
|
|
J ý¬
|
|||
|
|
!J öß ø 0JÁø Îþç>øiÉ’ Ò–¹`b df h ¹ äÓ ô½¹,½¹ø Í Í ± ± ¤. µù ¶Õ ·Ü. ¸Ú ëž¼/ž„¸ ø³úößüà¹+ 8 ú œ Ô § Õ ’ Ö Õ ú Ö Ô Äó å¹ Õó è¹ ’è ë¹ £èLù× ') +- /1 ü†»+ $”» û ûˆù Î Î ²B Òã ø ÓÚ ø ܦ‹n=ð~“ ûíàÛá Ó ™» Ó
|
|||
|
|
× 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);Á ˆÄú ìŒÄ assert_eq!(map.len(), 1);Á <ªÄƒ» .ü²Ä2 "Iterators are lazy unless consumedÁ LðÄ ø Ù œ Ú § Û — Ü ’ Ý Û Ü Ú Ý Ù Äó þÄ Õó �Å Á¤ „Å Íìíå ¬‡Å #íå LŠÅ ü ý “"çå üíà ýÛá Ì«Å ü ý ç寥 ˜" $ÀÅ ì¬
|
|||
|
|
�B ý¬
|
|||
|
|
˜B íå ø §B Ø Ø æJ Þ± ø ßã ø ‘®.xˆ—< øíàÛáçåíå ‘®.xˆ—< ÞßúÄ " %( +. ( ‡Å äÓ $ÌÅ ÌÅø Ø Ø çåüÖÅ",ÖÅø Ø Ø ë ë …2 ïù ðÕ =ÆâçLl4 ø³úíåüýÅ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‹Ñ ø î œ ï § ð î ï ð Äó ™Ñ Õó œÑ ì¬
|
|||
|
|
Å= ý¬
|
|||
|
|
Ì=¦÷ ‰éç>{9EÍ ñ•Ñ=? AC Ä¥Ñ,¥Ñø í í ¢ôüÏàA üÂÑT Q A builder for computing where in a [`HashMap`] a key-value pair would be stored.Á —Òú ü›Ò? < See the [`HashMap::raw_entry_mut`] docs for usage examples.Á ÛÒú üßÒH E [`HashMap::raw_entry_mut`]: struct.HashMap.html#method.raw_entry_mutÁ ¨Óú t¬ÓÞº »Óú <¿Óƒ» üÇÓ^ [ use hashbrown::hash_map::{RawEntryBuilderMut, RawEntryMut::Vacant, RawEntryMut::Occupied};Á ܦ԰º üÂÔ(×» ëÔú üïÔ!æ¦ ü‘ÕG D map.extend([(1, 11), (2, 12), (3, 13), (4, 14), (5, 15), (6, 16)]);Á ìÙÕ assert_eq!(map.len(), 6);Á ÷Õú üûÕYÌÚ üÕÖ �¾ üõÖ4¹¾ ìª×÷¾ ´Èמ¿ ,ß×¾¿ å×ú üé×C @ 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�Á üãß1æÁ L•à¤È ,Ÿà¾¿ ¥àú ì©àÒº <Çàƒ» ”Úà ø ó œ ô § õ ¤ ö ’ ÷ ö ô ÷ ó õ Äó ñà Õó ôà Íì¤ç ÷à ø¤ ¬úà Š¥ Lýà ì¬
|
|||
|
|
ü—á ý¬
|
|||
|
|
|
|||
|
|
¤ç ø ‚¦ ò ò ¿L øØ ø êOÂ~–r øíàÛá¤çíå êOÂ~–r øíම º¼ µ· ¹ úà äÓ º —áø ò ò óüÈ÷8 ü¼áP M A view into a single entry in a map, which may either be vacant or occupied.Á �âú ü‘â/ , This is a lower-level version of [`Entry`].Á Áâú üÅâS P This `enum` is constructed through the [`raw_entry_mut`] method on [`HashMap`],Á ü™ãC @ then calling one of the methods of that [`RawEntryBuilderMut`].Á Ýãú üáã$¶þ ô†ä [`Entry`]: enum.Entry.htmlÁ ü¥ä? < [`raw_entry_mut`]: struct.HashMap.html#method.raw_entry_mutÁ üåä: 7 [`RawEntryBuilderMut`]: struct.RawEntryBuilderMut.htmlÁ åú t¤åÞº ³åú <·åƒ» ü¿å(×» üèåI F use hashbrown::hash_map::{HashMap, RawEntryMut, RawOccupiedEntryMut};Á ²æú ü¶æ!æ¦ üØæ/ , map.extend([('a', 1), ('b', 2), ('c', 3)]);Á ìˆçô§ ¦çú üªçYÌÚ ü„è �¾ ü¤è4¹¾ ìÙè÷¾ ´÷èž¿ ,Žé¾¿ ”éú ä˜é // Existing key (insert)Á üµéG D let raw: RawEntryMut<_, _, _> = map.raw_entry_mut().from_key(&'a');Á üýéC @ let _raw_o: RawOccupiedEntryMut<_, _, _> = raw.insert('a', 10);Á ìÁêô§ ßêú üãê // Nonexistent key (insert)Á üƒë7 4 map.raw_entry_mut().from_key(&'d').insert('d', 40);Á ì»ë�à Ùëú üÝë // Existing key (or_insert)Á üýë0 - let hash = compute_hash(map.hasher(), &'b');Á „®ì
|
|||
|
|
let kv = mapÁ Ä¿ì .raw_entry_mut()Á üØì, ) .from_key_hashed_nocheck(hash, &'b')Á ä…í .or_insert('b', 20);Á ü¢í' $ assert_eq!(kv, (&mut 'b', &mut 2));Á |Êí *kv.1 = 20;Á ìÚí�à øíú üüí" // Nonexistent key (or_insert)Á üŸî0 - let hash = compute_hash(map.hasher(), &'e');Á „Ðî¹Ò ÄáîÓÒ üúî, ) .from_key_hashed_nocheck(hash, &'e')Á ä§ï .or_insert('e', 50);Á üÄï( % assert_eq!(kv, (&mut 'e', &mut 50));Á ìíï assert_eq!(map.len(), 5);Á ‹ðú ü�ð$ ! // Existing key (or_insert_with)Á ü´ð0 - let hash = compute_hash(map.hasher(), &'c');Á „åð¹Ò ÄöðÓÒ ü�ñ' $ .from_hash(hash, |q| q == &'c')Á ü·ñ& # .or_insert_with(|| ('c', 30));Á üÞñ' $ assert_eq!(kv, (&mut 'c', &mut 3));Á |†ò *kv.1 = 30;Á ì–òÌÖ ´òú ü¸ò' $ // Nonexistent key (or_insert_with)Á üàò0 - let hash = compute_hash(map.hasher(), &'f');Á „‘ó¹Ò Ä¢óÓÒ ü»ó' $ .from_hash(hash, |q| q == &'f')Á üãó& # .or_insert_with(|| ('f', 60));Á üŠô( % assert_eq!(kv, (&mut 'f', &mut 60));Á ì³ôÒº Ñôú üÕô' $ println!("Our HashMap: {:?}", map);Á ýôú ü�õF C let mut vec: Vec<_> = map.iter().map(|(&k, &v)| (k, v)).collect();Á üÈõDܾ ü�ö@«¿ ÄÎöúª üçöX U assert_eq!(vec, [('a', 10), ('b', 20), ('c', 30), ('d', 40), ('e', 50), ('f', 60)]);Á <À÷ƒ» \Ñ÷ ø ú œ û § ü ¤ ý ’ þ ú þ ý û ü Äó á÷ Õó ä÷ ÃÆ ç÷ ø¤ ¬ê÷ Š¥ Lí÷ ì¬
|
|||
|
|
üÓŽ" ý¬
|
|||
|
|
|
|||
|
|
‚¦ ÷Æ œûŽ ù ÿ €ÄM �ˆ ‚ ƒáM „ˆ ^ÂÝðÉ\3 øíàÛá¤çíå ^ÂÝðÉ\3 ÿ€‚ƒ € � … … üM ‹¿N ø ŒÕ ø �®4 ø zšÅ鑤ìÍ øíàÛá¤çíåÕà ƒ „ ˜ ˜ ¥O žÕ ø Ÿ®4 ø ›æŽ)W ; øíàÛá¤çíåÕà Ý÷’• ˜› ž¡ ¤ ê÷ äÓ T§ ´‡ø An occupied entry.Á ¢øú tªøÞº ½øú <Åøƒ» üÑø4 1 use hashbrown::{hash_map::RawEntryMut, HashMap};Á üŠùA > let mut map: HashMap<_, _> = [("a", 100), ("b", 200)].into();Á Ðùú üØù.·Ü ü‹ú1ðÜ üÁú' $ RawEntryMut::Occupied(_) => { }Á ,íú¾¿ <÷úƒ» T§ ù ù
|
|||
|
|
€ øíàÛá¤çíåT§T§ Öá Õà ù ù Ñæ üŒû# ù ù Öá _¨ œ¶û A vacant entry.Á Îûú tÖûÞº éûú <ñûƒ» üýû4Åã ü¶ü5ŽŒ ðüú üøü- * match map.raw_entry_mut().from_key("a") {Á üªý3Ôå üâý% " RawEntryMut::Vacant(_) => { }Á ,Œþ¾¿ <–þƒ» _¨ ù ù
|
|||
|
|
ƒ øíàÛá¤çíå_¨_¨ Ãâ Õà ù ù ëé ü©þ! ù ù Ãâ üð�B üÐþ1 . A view into an occupied entry in a `HashMap`.Á ü‚ÿ+ ( It is part of the [`RawEntryMut`] enum.Á ®ÿú ü²ÿ* ' [`RawEntryMut`]: enum.RawEntryMut.htmlÁ Ýÿú táÿÞº ðÿú <ôÿƒ» üüÿ(×» ü¥€IÄÌ ï€ú üó€!æ¦ ü•�2òÿ È�ú üÌ�YÌÚ ü¦‚ �¾ üÆ‚4¹¾ ìû‚÷¾ ´™ƒž¿ ,°ƒ¾¿ ¶ƒú üºƒc ` let _raw_o: RawOccupiedEntryMut<_, _, _> = map.raw_entry_mut().from_key(&"a").insert("a", 100);Á ìž„ô§ ¼„ú üÀ„'…Ü üè„.·Ü ü—…1ðÜ üÉ…,¬Ý üö…)ãÝ ü †#—Þ üĆ"ÅÞ ¼ç†ñÞ üÿ†0“ß L°‡¤È ,º‡¾¿ À‡ú üć ÷ß ìå‡ô§ ƒˆú Ô‡ˆ¼à ü¢ˆ0áà üÓˆCœá ü—‰1ðÜ üɉ(ùá üò‰7 4 assert_eq!(view.remove_entry(), ("c", 30));Á LªŠ¤È ,´Š¾¿ üºŠ5‹ã ìðŠÊã Ž‹ú ü’‹0 - let hash = compute_hash(map.hasher(), &"b");Á üË> ; match map.raw_entry_mut().from_hash(hash, |q| *q == "b") {Á ü‚Œ1ðÜ ü´Œ(ùá üÝŒ7 4 assert_eq!(view.remove_entry(), ("b", 20));Á L•�¤È ,Ÿ�¾¿ ü¥�$ ! assert_eq!(map.get(&"b"), None);Á ìÊ�¦¢ <è�ƒ» œû� ø † œ ‡ § ˆ ¤ ‰ ’ Š ‡ ˆ † Š ‰ Äó “Ž Õó –Ž ÃÆ ™Ž ø¤ ¬œŽ Š¥ LŸŽ ì¬
|
|||
|
|
Û
|
|||
|
|
ý¬
|
|||
|
|
â
|
|||
|
|
‚¦ é
|
|||
|
|
÷Æ Ú
|
|||
|
|
Öá zšÅ鑤ìÍ ‹Œ��Žjl np rt v œŽ äÓ ¤¹Ž$¹Žø … … n n Ì pµ zw0üC³úš ,ÓŽø … … ø „ „ µ ‡Õ ˆ¤ ‰Ú ‰³sÚ§´–Ö³úíåî dûŽø … … ø¤ç ü“�Š 8 † œ � § � ¤ ‘ ’ ’ ’ � ‘ † � Äó Ÿ� Õó ¢� ÃÆ ¥� ø¤ ¨� Û¼
|
|||
|
|
$å� í¼
|
|||
|
|
$ò� Ìì¤ç $ÿ� Ììíå $Œ� Š¥ L“�Ñæ ce gi km oq ü¢�Š 8 ‡ œ ” § • ¤ – ’ — – ‡ — • ” Äó ®� Õó ±� ÃÆ ´� ø¤ ·� � íà $ô� � Ûá $�‘ � ¤ç $Ž‘ � íå $›‘ Š¥ L¢‘Ñæ qs uw y{ } ü�ž@ ü²‘. + A view into a vacant entry in a `HashMap`.Á üá‘+«ê �’ú ü‘’*îê ¼’ú tÀ’Þº Ï’ú <Ó’ƒ» üÛ’(×» ü„“G D use hashbrown::hash_map::{HashMap, RawEntryMut, RawVacantEntryMut};Á Ì“ú üГ. + let mut map = HashMap::<&str, i32>::new();Á ÿ“ú üƒ”YÌÚ üÝ” �¾ üý”4¹¾ 첕÷¾ ´Ð•ž¿ ,畾¿ í•ú üñ•V S let raw_v: RawVacantEntryMut<_, _, _> = match map.raw_entry_mut().from_key(&"a") {Á üÈ–* ' RawEntryMut::Vacant(view) => view,Á üó–3Ôå 4§—ÆÛ Ô®— raw_v.insert("a", 10);Á üÉ—/ , assert!(map[&"a"] == 10 && map.len() == 1);Á ù—ú üý—*ÿã ü¨˜0Çñ üÙ˜C @ match map.raw_entry_mut().from_key_hashed_nocheck(hash, &"b") {Á ü�™3Ôå üÑ™&’æ üø™1 . let (k, value) = view.insert("b", 2);Á üªš/ , assert_eq!((*k, *value), ("b", 2));Á ÄÚš *value = 20;Á Lóš¤È ,ýš¾¿ üƒ›/ , assert!(map[&"b"] == 20 && map.len() == 2);Á ³›ú ü·›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);Á <…žƒ» Œ˜ž ø ™ œ š § › ¤ œ ’ � � › ™ œ š Äó ®ž Õó ±ž ÃÆ ´ž ø¤ ¬·ž Š¥ Lºž ì¬
|
|||
|
|
üÔž" ý¬
|
|||
|
|
|
|||
|
|
‚¦ ÷Æ œüžÃâ ›æŽ)W ; žŸªžkm oq su w ·ž äÓ x,Ôžø ˜ ˜ í÷ }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óô ,†¨¾¿ <Œ¨ƒ» |Ÿ¨ ø ¡ œ ¢ § £ ¤ ¤ ’ ¥ ¢ ¤ ¥ £ ¡ Äó ³¨ Õó ¶¨ ÃÆ ¹¨ ø¤ ¬¼¨ Š¥ L¿¨ ì¬
|
|||
|
|
äÙ¨ ý¬
|
|||
|
|
÷Æ ‚¦ öO ¦Ø ø ¥ ’ÊÃ"j øíàÛá¤çíå ¥ ’ÊÃ"j ¦¯¨¥§ ©« ¯ ± ¼¨ äÓ ² Ù¨ø Êòüú¨B ø ¨ œ © § ª ¤ « ’ ¬ ¨ ª « © ¬ Äó ƒ© Õó †© ÃÆ ‰© ø¤ Œ© Š¥ L�©‰Ç ¯ ÿ¨:< >@ BD FH ü¸‰ üé/ , Creates a `RawEntryMut` from the given key.Á ÷©ú tÿ©Þº ’ªú <šªƒ» ü¦ª4¤Ù ߪú üçª5 2 let mut map: HashMap<&str, u32> = HashMap::new();Á ”¡« let key = "a";Á ü¸«N K let entry: RawEntryMut<&str, u32, _> = map.raw_entry_mut().from_key(&key);Á Ü‹¬ entry.insert(key, 100);Á ü«¬ assert_eq!(map[&"a"], 100);Á <Ϭƒ» D¿ ˆ‰Ç ˆ¢ Õà §¢ ® ® Ü § Îìó˜ È Åe¤ç \”® šeó˜ $¬® òó˜ íà l³®
|
|||
|
|
øíàÛá¤çíåó˜ $Ó¶ Ùln ü¢¶„ ü¯< 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ÐÉ Š™’ Šó˜ ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ‹ú ¾¢ Å Å íÉ ¾ ¢™ ÙÉ ´™ \ Ê Å™ $¸Ê Ö™ l¿Ê
|
|||
|
|
Ä øíàÛá¤çíåó˜ $äɶ êÉPR üîÑ üÎË4 1 Access an immutable entry by a key and its hash.Á ‡Ìú t�ÌÞº ¢Ìú <ªÌƒ» ü¶Ì(×» ÜãÌ°º ƒÍú ü‹ÍYÌÚ üéÍ �¾ ü�Î4¹¾ ìÆÎ÷¾ ´èΞ¿ ,ƒÏ¾¿ �Ïú ü•ÏB¤« ”ÜÏø• üóÏ0Ðä
|
|||
|
|
$šâ ´™ \«â
|
|||
|
|
Ó øíàÛá¤çíå$ÆáÝT Ìá»,Ôáü•éƒ üäR O Ensures a value is in the entry by inserting the default if empty, and returnsÁ ü„å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);Á ü¨ç$ ! assert_eq!(map["poneyland"], 3);Á Ñçú üÙçQ N *map.raw_entry_mut().from_key("poneyland").or_insert("poneyland", 10).1 *= 2;Á ü¯è$ ! assert_eq!(map["poneyland"], 6);Á <Ø胻 Lœé Õà íàÛá øíà„¼
|
|||
|
|
Í Í þž
|
|||
|
|
$ûé ´™ \Œê
|
|||
|
|
Ô øíàÛá¤çíå$¦é default_keyÁ\¬é default_valÁ\¼éü¦ð– üßë] Z Ensures a value is in the entry by inserting the result of the default function if empty,Á üÁì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Œñ þž
|
|||
|
|
$Ÿñ ´™ \°ñ
|
|||
|
|
Õ øíàÛá¤çí凥 $¿ð><Åðqs üüøU ü¶óD A Provides in-place mutable access to an occupied entry before anyÁ üÿó# potential inserts into the map.Á §ôú t¯ôÞº Âôú <Êôƒ» ÜÖô°º öôú üþô5¹• ¸õú ¼Àõ map.raw_entry_mut()Á ìÜõ .from_key("poneyland")Á üþõ' $ .and_modify(|_k, v| { *v += 1 })Á üªö# .or_insert("poneyland", 42);Á üÒö% " assert_eq!(map["poneyland"], 42);Á üöú ¼„÷ÞÎ ì ÷ÿÎ üÂ÷'§Ï üî÷" .or_insert("poneyland", 0);Á ü•ø% " assert_eq!(map["poneyland"], 43);Á <¿øƒ» Tƒù Õà ‡¥ Õà Í— Ø Ø Í °¥ Žù Ž � –"‡¥ Žíà �Ûá ´ºù Ž � ‡¥ ¹Ó ˜" !
|
|||
|
|
× øíàÛá¤çí凥 $‘ù± —ù‹� ü¬‰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::RawEntryMut;Á êþú üòþ5¹• ¬ÿú œ´ÿ let entry = mapÁ ÄÌÿÓÒ ôéÿ .from_key("poneyland")Á üŒ€3 0 .and_replace_entry_with(|_k, _v| panic!());Á Ä€ú ŒÌ€ match entry {Á üâ€% " RawEntryMut::Vacant(_) => {},Á üŒ�- * RawEntryMut::Occupied(_) => panic!(),Á ,¾�¾¿ È�ú üÐ� map.insert("poneyland", 42);Á õ�ú œý�µÖ Ä•‚ÓÒ ô²‚àÖ üÕ‚( % .and_replace_entry_with(|k, v| {Á ü‚ƒ( % assert_eq!(k, &"poneyland");Á ô¯ƒ assert_eq!(v, 42);Á ¼Òƒ Some(v + 1)Á \îƒ });Á þƒú Œ†„Ó× üœ„% " RawEntryMut::Occupied(e) => {Á üÆ„. + assert_eq!(e.key(), &"poneyland");Á üù„% " assert_eq!(e.get(), &43);Á T£…‹˜ ü²…+ ( RawEntryMut::Vacant(_) => panic!(),Á ,â…¾¿ ì…ú üô…%œÑ ž†ú œ¦†µÖ ľ†ÓÒ ôÛ†àÖ üþ†/ , .and_replace_entry_with(|_k, _v| None);Á ²‡ú Œº‡Ó× üЇ%ï× üú‡-ŸØ ,¬ˆ¾¿ ¶ˆú ü¾ˆ, ) assert!(!map.contains_key("poneyland"));Á <» ´³‰ Õà ‡¥ Õà Í— Ú Ú Í °¥ ʉ � –"‡¥ �íà Ûá Ôö‰ � ‡¥ žá ˜" ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙÛáL‡Š
|
|||
|
|
Ù øíàÛá¤çí凥 $͉± Ó‰À üµ‹C ø Ü œ Ý § Þ ¤ ß ’ à Ý ß à Þ Ü Äó ¾‹ Õó Á‹ ÃÆ Ä‹ ø¤ Ç‹ Š¥ LÊ‹Öá áâãäåæçèéêëìíî º‹^` bd fh jl ¼à� üÿ‹- * Gets a reference to the key in the entry.Á ±Œú 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) {Á
|
|||
|
|
Û Û
|
|||
|
|
å øíàÛá¤çíå$öªüÚ¯# üë7 4 Gets a mutable reference to the value in the entry.Á ÿ«ú 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 in the entry.Á –¶ú tž¶Þº ±¶ú <¹¶ƒ» üŶ4¤Ù ¤þ¶Ãè —·ú üŸ· ïè ü÷ ™é ç·ú üï·9Ðé ü¸$”ê Ö¸ú üÞ¸"Ðê ü…¹Pýê Ú¹ú üâ¹2åë ü™º+ÚÜ üɺ)±ì ü÷ºC @ let (inside_key, inside_value) = o.get_key_value_mut();Á ü¿»* ' *inside_key = key_two.clone();Á üî» *inside_value = 100;Á L“¼¤È ,¡¼¾¿ ü«¼# assert_eq!(map[&key_two], 100);Á üÓ¼Päí <¨½ƒ» Œì½ – –Öá –íà –Ûá Û þ½ Û
|
|||
|
|
è øíàÛá¤çíå$ƒ¾üñÈ5 ü¦¿Y V Converts the OccupiedEntry into a mutable reference to the key and value in the entryÁ ü„À,Ÿð µÀú t½ÀÞº ÐÀú <ØÀƒ» üäÀ4¤Ù ¤�ÁÃè ¶Áú ü¾Á ïè üâÁ ™é †Âú üŽÂ9Ðé üÌÂ$”ê õÂú üýÂ"Ðê ü¤ÃPýê ùÃú ü�Ä"·ò ü¨Ä let inside_value: &mut u32;Á üÌÄ2åë üƒÅ+ÚÜ ü³Å% " RawEntryMut::Occupied(o) => {Á üÝÅ+ ( let tuple = o.into_key_value();Á ü�Æ! inside_key = tuple.0;Á ü³Æ# inside_value = tuple.1;Á LÛÆ¤È ,éƾ¿ üóÆ"æó ÄšÇ *inside_value = 100;Á ü·Ç#׈
|
|||
|
|
üßÇPäí <´Èƒ» tøÈ Öá ÌÆ Û Û
|
|||
|
|
é øíàÛá¤çíå$‡ÉüßÎ' ü°ÊC @ Sets the value of the entry, and returns the entry's old value.Á øÊú t€ËÞº “Ëú <›Ëƒ» ü§Ë4¤Ù àËú üèËFßä ³Ìú ü»Ì.·Ü üîÌ+ÚÜ üžÍH E RawEntryMut::Occupied(mut o) => assert_eq!(o.insert(1000), 100),Á ,ë;¿ õÍú üýÍ ùû <¢Îƒ» 4æÎ — —Öá ÛáÛá Û íÎ Û
|
|||
|
|
ê øíàÛá¤çíå$òλ,øÎü°×) üÀÏC÷�
|
|||
|
|
ˆÐú t�ÐÞº £Ðú <«Ðƒ» ü·Ð4¤Ù ¤ðÐÃè ‰Ñú ü‘Ñ ïè üµÑ ™é ÙÑú üáÑ9Ðé üŸÒ$”ê ÈÒú üÐÒ"Ðê ü÷ÒPýê ÌÓú üÔÓ2åë ü‹Ô+ÚÜ ü»Ô)±ì üéÔ8 5 let old_key = o.insert_key(key_two.clone());Á ü¦Õ4 1 assert!(Rc::ptr_eq(&old_key, &key_one));Á LßÕ¤È ,íÕ¾¿ ü÷Õ"·í üžÖPäí <óÖƒ» T·× ˜ ˜Öá íàíà Û Â× Û
|
|||
|
|
ë øíàÛá¤çíå$Ç×ÝT Í×Ä¦Ü ü‘Ø5 2 Takes the value out of the entry, and returns it.Á ËØú tÓØÞº æØú <î؃» üúØ4¤Ù ³Ùú ü»ÙFßä †Úú üŽÚ.·Ü üÁÚ+ÚÜ üñÚ@ = RawEntryMut::Occupied(o) => assert_eq!(o.remove(), 100),Á ,¶Û¾¿ üÀÛ$þˆ
|
|||
|
|
<éÛƒ» 4Ü Öá Ûá Û Û
|
|||
|
|
ì øíàÛá¤çíå$´Üü�á# üêÜ9 6 Take the ownership of the key and value from the map.Á ¨Ýú t°ÝÞº ÃÝú <Ë݃» ü×Ý4¤Ù �Þú ü˜ÞFßä ãÞú üëÞ.·Ü üžß+ÚÜ üÎßM J RawEntryMut::Occupied(o) => assert_eq!(o.remove_entry(), ("a", 100)),Á , ྿ üªà$þˆ
|
|||
|
|
<Óàƒ» d—á Öá ³ú Û Û
|
|||
|
|
í øíàÛá¤çíå$¤áü¦ëx üóáFÈÓ ü¾â= : the entry and allows to replace or remove it based on theÁ ü€ã!éÔ ¦ãú t®ãÞº Áãú <É・ üÕã4¤Ù Žäú ü–äFßä áäú üéä> ; let raw_entry = match map.raw_entry_mut().from_key(&"a") {Á ü¬å+ÚÜ üÜåA > RawEntryMut::Occupied(o) => o.replace_entry_with(|k, v| {Á ü¢æ assert_eq!(k, &"a");Á üÇæ assert_eq!(v, 100);Á Ìëæ Some(v + 900)Á \‰ç }),Á 4™çÆÛ ü¤ç% " let raw_entry = match raw_entry {Á üÎç+ÚÜ üþçAË¢
|
|||
|
|
üÄè —£
|
|||
|
|
üéè assert_eq!(v, 1000);Á „Žé
|
|||
|
|
NoneÁ \£éŽ¤
|
|||
|
|
4³éÆÛ ¬¾é match raw_entry {Á üØé& # RawEntryMut::Vacant(_) => { },Á üƒê-ŸØ 4µêÆÛ üÀê$þˆ
|
|||
|
|
<éꃻ ”ë Öá ‡¥ Õà Û— ï ï Û °¥ Àë ™ –"‡¥ ™íà Ûá Ôƒì ™ ‡¥ Ô¨
|
|||
|
|
˜" Ëá L”ì
|
|||
|
|
î øíàÛá¤çí凥 $Ãë± Éë{} t«í îç¡ ð €¢ 𠞢 ð ð î ð íàÛá¤çí凥 ³úۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ³ú ‡¥ \ãí îç¡ ñ €¢ ñ ž¢ ñ ñ î ñ íàÛá¤çí凥 Ûá³ú íàü¿ðA ø ó œ ô § õ ¤ ö ’ ÷ ÷ õ ó ô ö Äó Èð Õó Ëð ÃÆ Îð ø¤ Ñ𠊥 LÔðÃâ øùúý Äð@B DF HJ LN üíõr ü‡ñ; 8 Sets the value of the entry with the VacantEntry's key,Á üÇñ* ' and returns a mutable reference to it.Á öñú 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ôõ Ãâ íàÛáÌÆ ò ò þž
|
|||
|
|
$Âö ´™ \Óö
|
|||
|
|
ø øíàÛá¤çíå$ûõÝT �ö»,‰öüÍ€Œ üå÷;ð¬
|
|||
|
|
ü¥ø*¶
|
|||
|
|
Ôøú 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¤ÿ ),Á ,³ÿ¾¿ ½ÿú üÅÿ ž°
|
|||
|
|
<éÿƒ» ¬Ô€ Ãâ íàÛáÌÆ ò ò þž
|
|||
|
|
$¼� ´™ \Í�
|
|||
|
|
ù øíàÛá¤çíå$ꀧ$ð€ÝT û€»,ƒ�üµ�· ü«ƒ< 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Ó…¦„
|
|||
|
|
Ìá… 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ÞŽ š �Â
|
|||
|
|
ØÂ
|
|||
|
|
˜" èŽ
|
|||
|
|
ú øíàÛá¤çíå�Â
|
|||
|
|
$Û�§$é�ÝT ü�»,ŒŽá74žŽ’” ã� úç¡ ü €¢ ü ž¢ ü ü ú ü íàÛá¤çíå�Â
|
|||
|
|
÷ô �Â
|
|||
|
|
üÁ�� dÄ� ø Ãâ íàÛáÖá ò ò þž
|
|||
|
|
$¥‘ ´™ \¶‘
|
|||
|
|
ý øíàÛá¤çíå$Ñ�ÝT ×�»,ß�ü«”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íàÛá¤çíå$ª�± °�üÒ©' ü™žPÑÇ êžú üîž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òÿ ìÆ¡ô§ ä¡ú äè¡ìÎ ü…¢/ , let entry: Entry<_, _, _> = map.entry("a");Á üµ¢9 6 let _raw_o: OccupiedEntry<_, _, _> = entry.insert(1);Á ìï¢ô§ ü�£ ÎÐ ì£ map.entry("d").insert(4);Á Ë£ú üÏ£ ÕÑ üï£( % let v = map.entry("b").or_insert(2);Á ü˜¤, ) assert_eq!(std::mem::replace(v, 2), 20);Á üŤ"¹Ô üè¤ map.entry("e").or_insert(5);Á ‰¥ú ü�¥$�× ü²¥0 - let v = map.entry("c").or_insert_with(|| 3);Á üã¥, ) assert_eq!(std::mem::replace(v, 3), 30);Á ü�¦'ÐÙ ü¸¦( % map.entry("f").or_insert_with(|| 6);Á á¦ú üå¦'ŠÜ �§ú ü‘§FÉÜ üاDܾ ü�¨@«¿ ÄÞ¨úª ü÷¨R O assert_eq!(vec, [("a", 1), ("b", 2), ("c", 3), ("d", 4), ("e", 5), ("f", 6)]);Á <Ê©ƒ» ,Û© ø � œ ž § Ÿ ¤ ’ ¡ ž ¡ Ÿ � Äó å© Õó è© ÃÆ ë© ø¤ Tî© Š¥ L‡ª ì¬
|
|||
|
|
üª¼" ý¬
|
|||
|
|
|
|||
|
|
÷Æ ‚¦ œ ¢ £ÄM ¤ˆ ¥ ¦áM §ˆ ofrU%H 9 øíàÛá¤çíå ofrU%H 9¢£¥¦ £ ¤ ® ® ‘Z ´§ ø µÝT ø ¶¿N ø ·Õ ø v”„š\`Ùs øíàÛá¤çíåƒá
|
|||
|
|
¦ § È È å[ Χ ø ÏÝT ø ÐÕ ø ÐX,§nóq øíàÛá¤çíåƒá
|
|||
|
|
ᩧª ° ³¶ ¹ î© äÓ © ´˜ªîâ ³ªú t»ªÞº Ϊú <Öªƒ» üâª. + use hashbrown::hash_map::{Entry, HashMap};Á ü•«A„ä Û«ú Ôã« match map.entry("a") {Á ü‚¬+ ( Entry::Vacant(_) => unreachable!(),Á ü²¬! Entry::Occupied(_) => { }Á ,ج¾¿ <⬃» © œ œ
|
|||
|
|
£ øíàÛá¤çíå©© „â
|
|||
|
|
ć
|
|||
|
|
œ œ øæ
|
|||
|
|
ì÷¬ œ œ „â
|
|||
|
|
!ª œœÑæ ´ú t¼Þº Ïú <׃» üã.ùã
|
|||
|
|
ü–®5ŽŒ Юú ÔØ®Íä
|
|||
|
|
ü÷®- * Entry::Occupied(_) => unreachable!(),Á ü©¯ Entry::Vacant(_) => { }Á ,ͯ¾¿ <ׯƒ» !ª œ œ
|
|||
|
|
¦ øíàÛá¤çíå!ª!ª ýâ
|
|||
|
|
ć
|
|||
|
|
œ œ ûé
|
|||
|
|
Üê¯ œ œ ýâ
|
|||
|
|
ü‹°I 8 ¯ œ © § ª ¤ « ’ ¬ © « ¯ ª ¬ Äó �° Õó š° ÃÆ ¤° ø¤ §° Š±
|
|||
|
|
,“° ›±
|
|||
|
|
,�° Š¥ Lª°™ê Àc JL NP RT VX üÛ°8 Þ° ° ± ² °™ê ± c c ˆ ¢cµ
|
|||
|
|
` £cØ“
|
|||
|
|
` àB¤GS
|
|||
|
|
²ÿ”
|
|||
|
|
¨ â° ¨
|
|||
|
|
8íàÛá¤çíå$ã°± é°ü•»Q üݲ1ïé ü�³% " It is part of the [`Entry`] enum.Á µ³ú ô¹³ÇÊ Ø³ú tܳ޺ ë³ú <ﳃ» ü÷³=«×
|
|||
|
|
µ´ú ü¹´!æ¦ üÛ´2òÿ Žµú ü’µF C let _entry_o: OccupiedEntry<_, _, _> = map.entry("a").insert(100);Á ìÙµô§ ÷µú üûµ'…Ü Ô£¶Íä
|
|||
|
|
ü¾¶+òä
|
|||
|
|
üê¶& # Entry::Occupied(mut view) => {Á ü‘·)ãÝ ü»·#—Þ ¬ß· *v *= 10;Á üõ·0“ß L¦¸¤È ,°¸¾¿ ¶¸ú üº¸ ÷ß ìÛ¸ô§ ù¸ú Ôý¸¼à Ô˜¹ match map.entry("c") {Á ü³¹+òä
|
|||
|
|
üß¹" Entry::Occupied(view) => {Á ü‚º7¿ð Lºº¤È ,ĺ¾¿ üʺ$ ! assert_eq!(map.get(&"c"), None);Á ìïºÊã <�»ƒ» l » ø ¯ œ ° § ± ¤ ² ’ ³ ² ° ³ ¯ ± Äó ²» Õó µ» ÃÆ ´¸» ø¤ ¬Ð» Š¥ LÓ» ì¬
|
|||
|
|
f
|
|||
|
|
ý¬
|
|||
|
|
m
|
|||
|
|
֮ t
|
|||
|
|
‚¦ {
|
|||
|
|
„â
|
|||
|
|
v”„š\`Ùs ´µ¶·®»ln pr t ¸» �¬ ~ л äÓ Lí»$í»ø ® ® tü» ü»ø ® ® ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙíà¤�¼$�¼ø ® ® §÷ ƒ ,ª¼ø ® ® óüѼ„ 8 ³ œ ¹ § º ¤ » ’ ¼ ³ ¹ » ¼ º Äó ݼ Õó ༠ÃÆ ã¼ ø¤ æ¼ Û¼
|
|||
|
|
$�½ í¼
|
|||
|
|
$ª½ ñù $·½ ƒú $Ľ Š¥ L˽þê QS UW Y[ ]_ üÚ½„ 8 ´ œ ¾ § ¿ ¤ À ’ Á Á ¿ ¾ ´ À Äó æ½ Õó é½ ÃÆ ì½ ø¤ ï½ Óû $¦¾ äû $³¾ õû $À¾ †ü $; Š¥ LÔ¾þê QS UW Y[ ]_ üä¾Q 8 µ œ à § Ä ¤ Å ’ Æ Ã µ Ä Æ Å Äó é¾ Õó ó¾ ÃÆ ý¾ ø¤ €¿ Š±
|
|||
|
|
,ì¾ ›±
|
|||
|
|
,ö¾ Š¥ Lƒ¿þêÇ Àc Ç JL NP RT VX ü¼¿8 ¿¿ ¶ · ¸ ¶þê · c c ˆ ¢cµ
|
|||
|
|
` £cØ“
|
|||
|
|
` àB¤GS
|
|||
|
|
¸ÿ”
|
|||
|
|
 ÿ Â
|
|||
|
|
Ç 8íàÛá¤çíå$Ä¿± Ê¿ü¼ÇO üŒÁ.éû ü»Á%ºí
|
|||
|
|
áÁú ôåÁÇÊ „Âú tˆÂÞº —Âú <›Âƒ» ü£Â; 8 use hashbrown::hash_map::{Entry, HashMap, VacantEntry};Á ßÂú üãÂ.ñý ’Ãú ü–Ã> ; let entry_v: VacantEntry<_, _, _> = match map.entry("a") {Á üÕÃ$ ! Entry::Vacant(view) => view,Á üúÃ-õç
|
|||
|
|
4¨ÄÆÛ ¼¯Ä entry_v.insert(10);Á üÇÄ/ò€ ÷Äú üûÄ*ÿã ԦŠmatch map.entry("b") {Á üÁÅ-õç
|
|||
|
|
üïÅ Entry::Vacant(view) => {Á ü�Æ' $ let value = view.insert(2);Á ü¸Æ" assert_eq!(*value, 2);Á ÄÛƸƒ LôÆ¤È ,þƾ¿ ü„Ç/÷ƒ <´Çƒ» \ÇÇ ø É œ Ê § Ë ¤ Ì ’ Í Ì Ê Í Ë É Äó ×Ç Õó ÚÇ ÃÆ ´ÝÇ ø¤ ¬õÇ Š¥ LøÇ ì¬
|
|||
|
|
üÈ" ý¬
|
|||
|
|
|
|||
|
|
÷Æ ‚¦ ýâ
|
|||
|
|
ÐX,§nóq ÎÏÐÓÇ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øÏÞº ‡Ðú <‹Ðƒ» ü“ÐC @ use hashbrown::hash_map::{EntryRef, HashMap, OccupiedEntryRef};Á ×Ðú üÛÐ!æ¦ üýÐ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);Á üäÒ? < let _raw_o: OccupiedEntryRef<_, _, _, _> = 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)Á ,Îؾ¿ ìÔØÒº <ò؃» DƒÙ ø Ø ™: Ù œ Ú ¢ Û § Ü ¤ Ý ’ Þ Ù Ý Þ Ü Ø Ú Û Íì¶í ”Ù Îì¼í —Ù ÍìÂí ¢Ù ÍìÈí ¥Ù ÍìÎí T¨Ù #Îí LÁÙ ¼í ™:,¹ã ¶í øü†ò" Âí ø Èí ø Îí ø+ × ß àÄM ሠâ ãáM äˆ a,Ã]Œ] ø ™:¶í¼íÂíÈíÎí a,Ã]Œ] ßàâã à á Ãî—› ã ä £ £ Þa « § ø ¬ ÝT ø Õ ø ¨1A¥üÆ{� ø ™:¶í¼íÂíÈíÎí—› ŒÙ�Ù¾Á »¾ ¸» µ¸ ² ¨Ù äÓ Öª ´ÒÙîâ íÙú 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(_) => { }Á ,±Ü¾¿ <»Üƒ» Öª × ×
|
|||
|
|
à ø ™:¶í¼íÂíÈíÎíÖªÖª Ãî—› × × ®¡üÐÜ' × × Ãî¬ œÿÜÑæ —Ýú tŸÝÞº ²Ýú <ºÝƒ» üÆÝ1Ó� üüÝ7 4 let mut map: HashMap<String, i32> = HashMap::new();Á ¸Þú ôÀÞùž üãÞ0 - EntryRef::Occupied(_) => unreachable!(),Á ü˜ß" EntryRef::Vacant(_) => { }Á ,¿ß¾¿ <É߃» ¬ × ×
|
|||
|
|
ã ø ™:¶í¼íÂíÈíÎí¬¬ ·œ—› × × ÷¤üÜß% × × ·œü‡àn 8 ½ 8 ¾ œ æ ¢ ç § è ¤ é ’ ê æ è ¾ ç é ê ½ æ™ Œà ø™ šà Šš à œš ·à ®š ºà ¶í¼í L�à ¿c¼í ,¦à ¿cÂí ,°à ÀšL½àäìë Àc ë xz |~ €‚ „† ˆŠ üüà8 ÿà ¿ À Á ¿äì À c c ˆ ¢cµ
|
|||
|
|
` £cØ“
|
|||
|
|
` àB¤GS
|
|||
|
|
Áÿ”
|
|||
|
|
å ƒá å
|
|||
|
|
ë 8 8¶í¼íÂíÈíÎí$„á± ŠáüŠã D�ãø ø í œ î ¢ ï í î ï Äó œã ¥ž
|
|||
|
|
Ÿã Šá ø Ûí �”e%@NbJðñóô ñ ò øŠá Ûí ô õ íàÛí ˜ãoq su ¬ ¬ø ì ì
|
|||
|
|
ñ øíàŠá¬¬ ø �«Ûí ì ì ï«åèø ì ì �«r rø ì ì
|
|||
|
|
ô øíàŠárr ø íàÛí ì ì ò¬ Ëãø ì ì íàüÒã) ø ÷ œ ø ¢ ù ø ÷ ù Äó Ûã ¥ž
|
|||
|
|
ÞãÛíú ×ã " ü‚ä:T…ä ø Ûííà ö ö é íà�« \°ä
|
|||
|
|
ú øíàŠá$�äüÍåA ø ü œ ý ¢ þ ü ý þ Äó Öå ¥ž
|
|||
|
|
äå íàŠá LÙåÛíÿ â ÿ Òå9; =? ´•æ4˜æ  ÂÛí Šá û Ÿæ û
|
|||
|
|
ÿ øíàŠá$ æüãðN üºç1ïé üìç( % It is part of the [`EntryRef`] enum.Á •èú ü™è$ ! [`EntryRef`]: enum.EntryRef.htmlÁ ¾èú tÂèÞº Ñèú <Õ胻 üÝèCÞ� ¡éú ü¥é!æ¦ üÇéKÈ� “êú ü—ê Ç‘ ü¸êQ N let _entry_o: OccupiedEntryRef<_, _, _, _> = map.entry_ref(&key).insert(100);Á ìŠëô§ ¨ëú ü¬ë'…Ü ôÔëùž üóë.¢Ÿ ü¢ì) & EntryRef::Occupied(mut view) => {Á üÌì)ãÝ üöì#—Þ ¬šíèð
|
|||
|
|
ü°í0“ß Láí¤È ,ëí¾¿ ñíú üõí assert_eq!(map["a"], 1111);Á ì•îô§ ³îú Ô·î¼à ôÒî match map.entry_ref("c") {Á üñî.¢Ÿ ü ï% " EntryRef::Occupied(view) => {Á üÆïB ? assert_eq!(view.remove_entry(), ("c".to_owned(), 30));Á L‰ð¤È ,“𾿠ü™ð# assert_eq!(map.get("c"), None);Á ì½ðÊã <Ûðƒ» „îð ø � ™: ‚ œ ƒ ¢ „ § … ¤ † ’ ‡ ‡ … � ƒ „ ‚ † æ™ ‡ñ ø™ Šñ Šš •ñ œš ˜ñ ®š¬›ñ ÀšLžñ ÐšØ àšÏ ñšÖ þšÝ ‹›äÃî é‚HNK8 ˆ ‰ Š ‹ ÿðƒñƒ… ‡‰ ‹� �‘ “ ›ñ äÓ L¸ñ$¸ñø € € üÇñ Çñø € € ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ ì ð ñ´^ òˆ ø ó ôÑ^ õˆ ø �”e%@NbJ ™:¶í¼í¤ìñ$ìñø € € n n Ì pµ zw0üC¶íÂí‚,†òø € € ø ‘ ‘ � –®4 —Õ Ï¹$�º¶íÂíÈíÎíüò¯ ø � ™: Ž œ � ¢ � § ‘ ¤ ’ ’ “ � Ž ’ “ ‘ � � æ™ Áò ø™ Äò Šš Çò œš Êò ®š Íò Ìì¶í $Žó � ¼í $›ó ÌìÂí $±ó ÌìÈí $¾ó ÌìÎí $Ëó ÀšLÒóÃî ¹ò½ò�Ÿ ¡£ ¥§ ©« ¯ üáó¯ ø • ™: – œ — ¢ ˜ § ™ ¤ š ’ › ˜ ™ — • › š – æ™ õó ø™ øó Šš ûó œš þó ®š �ô � ¶í $Âô ‰À$Ïô � Âí $åô � Èí $òô � Îí $ÿô ÀšL†õÃî íóñó‘“ •— ™› �Ÿ ¡£ ü–õv 8 à 8 Ä œ � ¢ ž § Ÿ ¤ ’ ¡ Ä � Ÿ ¡ à ž æ™ ›õ ø™ ©õ Šš ¼õ œš Æõ ®š Éõ –§Lžõ «§,µõ ¼§,¿õ ÀšLÌõÇï¢ Àc ¢ \^ `b df hj ln ü“ö8 –ö Å Æ Ç ÅÇï Æ c c ˆ ¢cµ
|
|||
|
|
` £cØ“
|
|||
|
|
` àB¤GS
|
|||
|
|
Çÿ”
|
|||
|
|
œ šö œ
|
|||
|
|
¢ 8 8¶í¼íÂíÈíÎí$›ö± ¡öüÊþL üñ÷.éû ü ø(å° Éøú üÍø$¥± òøú 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ƒÿ КU àšüÉÿ" ñš
|
|||
|
|
þš ‹›·œ ¨1A¥üÆ{� « ¬ äþèþ�ƒ …‡ ‰‹ �� ‘ €ÿ äÓ L�ÿ$�ÿø £ £ ¼¬ÿ ¬ÿø £ £ ļÆ,Éÿø £ £ …¾üðÿm 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!(),Á ,ƒˆ ¾¿ ü‰ˆ “— <©ˆ ƒ» l¼ˆ ø ¶ œ · § ¸ ¤ ¹ ’ º · º ¶ ¸ ¹ Äó Έ Õó ш ÃÆ Ôˆ ø¤ ¬×ˆ Š¥ LÚˆ ì¬
|
|||
|
|
£> ý¬
|
|||
|
|
ª> ÷Æ ±> ‚¦ ¸>ùñ +EtQ›>ø » ¼ ʈ hj ln pr t ׈ äÓ ü¬‰ ( üôˆ 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íàÛá¤çíå$�‹ ± £‹ ü¢� \ ø Ä œ Å § Æ ¤ Ç ’ È Ä Å Ç È Æ Äó «� Õó µ� ÃÆ ¿� ø¤ Â� Š±
|
|||
|
|
,®� ›±
|
|||
|
|
,¸� Š¥ LÅ� ùñÉ Åc É §� QS UW Y[ ]_ ü…Ž 8 ˆŽ Ñ Ò Ó Ñùñ Ò c c ˆ ¢cµ
|
|||
|
|
` £cØ“
|
|||
|
|
` àB¤GS
|
|||
|
|
Óÿ”
|
|||
|
|
à ŒŽ Ã
|
|||
|
|
É øíàÛá¤çíå$�Ž ± “Ž ü”� 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);Á ü–– 6 3 map_two.insert_unique_unchecked(*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í¢ Ü Ü é é ± íã ø Õ’-Ãè!áäßêßößüô¨ ' ü�£ 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÷¨ ¬ßªû Ü Ü
|
|||
|
|
ã äßêßðßöß$�© üï© * ø å œ æ § ç å æ ç Äó ø© Õó û© ½óè é ê ë úM ûM ÿM óN ê ë é ô© AC EG L ª $¥ª ä ä ‹úüòª , $õª Ô Ô½ó‡® ä úª ä
|
|||
|
|
é øíàÛá$ÿª üÒ - LÕ Õ Õ½ó ¬Ô ä ß ä
|
|||
|
|
ê øíàÛá$à üÜ® p $ß® ½ó÷Ø
|
|||
|
|
²ã÷Ø
|
|||
|
|
ä “ ì — í ì í ä ²Ù
|
|||
|
|
ä® ßã ç® Íì½ó , ¯ “"²ã÷Ø
|
|||
|
|
½ó úM ̲¯ ²ã‰†˜" ÷Ø
|
|||
|
|
ʯ
|
|||
|
|
ë øíàÛá÷Ø
|
|||
|
|
²ã$ê® ìí$ð® ± ý® �‘ “• Dñ¯ ë ç¡ î €¢ î ž¢ î î ë î íàÛá÷Ø
|
|||
|
|
²ã ÷Ø
|
|||
|
|
§÷ ÷Ø
|
|||
|
|
âÛ
|
|||
|
|
üÖ° / 8 Ö œ ð § ñ ñ ð Ö Äó Û° Õó Þ° ˜áò ÄM ò !# ´½± À± × ×˜á ï ı ï
|
|||
|
|
ò 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íàÛá$Û» ± á» ü̼ 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
|
|||
|
|
çÿ”
|
|||
|
|
Ÿ
|
|||
|
|
¾Ã Ÿ
|
|||
|
|
|
|||
|
|
£
|
|||
|
|
äßêߺÝ$¿Ã ± Åà ü°Ä * ø ¥
|
|||
|
|
œ ¦
|
|||
|
|
§ §
|
|||
|
|
§
|
|||
|
|
¦
|
|||
|
|
¥
|
|||
|
|
Äó ¹Ä Õó ¼Ä ôõ¨
|
|||
|
|
©
|
|||
|
|
ª
|
|||
|
|
«
|
|||
|
|
úM ûM ÿM óN «
|
|||
|
|
©
|
|||
|
|
ª
|
|||
|
|
µÄ AC EG LáÄ $æÄ ¤
|
|||
|
|
¤
|
|||
|
|
�úüªÅ # $Å è èôõۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ�ú ¤
|
|||
|
|
²Å ¤
|
|||
|
|
|
|||
|
|
©
|
|||
|
|
øíàÛá$·Å ü°Ç - L³Ç é éôõ ¬Ô ¤
|
|||
|
|
½Ç ¤
|
|||
|
|
|
|||
|
|
ª
|
|||
|
|
øíàÛá$¾Ç üºÈ p $½È ôõ÷Ø
|
|||
|
|
²ã÷Ø
|
|||
|
|
¤
|
|||
|
|
“ ¬
|
|||
|
|
—
|
|||
|
|
¬
|
|||
|
|
|
|||
|
|
¤
|
|||
|
|
²Ù
|
|||
|
|
ÂÈ ßã ÅÈ Íìôõ ,þÈ “"²ã÷Ø
|
|||
|
|
ôõ úM Ì�É ²ã˦˜" ÷Ø
|
|||
|
|
¨É
|
|||
|
|
«
|
|||
|
|
øíàÛá÷Ø
|
|||
|
|
²ã$ÈÈ ìí$ÎÈ ± ÛÈ �‘ “• lÏÉ «
|
|||
|
|
ç¡ ®
|
|||
|
|
€¢ ®
|
|||
|
|
ž¢ ®
|
|||
|
|
®
|
|||
|
|
«
|
|||
|
|
®
|
|||
|
|
íàÛá÷Ø
|
|||
|
|
²ã ÷Ø
|
|||
|
|
íà Ûá ÷Ø
|
|||
|
|
âÛ
|
|||
|
|
üðÉ / 8 ê œ °
|
|||
|
|
§ ±
|
|||
|
|
°
|
|||
|
|
±
|
|||
|
|
ê Äó õÉ Õó øÉ †ä²
|
|||
|
|
ÄM ²
|
|||
|
|
!# ´×Ê ÚÊ ë ë†ä ¯
|
|||
|
|
ÞÊ ¯
|
|||
|
|
|
|||
|
|
²
|
|||
|
|
8íàÛá$ßÊ ü‘Ë + 8 ì œ ´
|
|||
|
|
§ µ
|
|||
|
|
´
|
|||
|
|
µ
|
|||
|
|
ì Äó –Ë Õó ™Ë †ä üÁË , ø ·
|
|||
|
|
œ ¸
|
|||
|
|
§ ¹
|
|||
|
|
·
|
|||
|
|
¸
|
|||
|
|
¹
|
|||
|
|
Äó ÊË Õó ÍË Íöº
|
|||
|
|
»
|
|||
|
|
¼
|
|||
|
|
½
|
|||
|
|
úM ûM ÿM óN ¼
|
|||
|
|
½
|
|||
|
|
»
|
|||
|
|
ÆË AC EG LôË $ùË ¶
|
|||
|
|
¶
|
|||
|
|
—úü½Ì # $ÀÌ í íÍöۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ—ú ¶
|
|||
|
|
ÅÌ ¶
|
|||
|
|
|
|||
|
|
»
|
|||
|
|
øíàÛá$ÊÌ üÃÎ - LÆÎ î îÍö ¬Ô ¶
|
|||
|
|
ÐÎ ¶
|
|||
|
|
|
|||
|
|
¼
|
|||
|
|
øíàÛá$ÑÎ üÍÏ p $ÐÏ Íö÷Ø
|
|||
|
|
²ã÷Ø
|
|||
|
|
¶
|
|||
|
|
“ ¾
|
|||
|
|
— ¿
|
|||
|
|
¾
|
|||
|
|
¿
|
|||
|
|
¶
|
|||
|
|
²Ù
|
|||
|
|
ÕÏ ßã ØÏ ÍìÍö ,‘Ð “"²ã÷Ø
|
|||
|
|
Íö úM ̣Р²ãÿ¯˜" ÷Ø
|
|||
|
|
»Ð
|
|||
|
|
½
|
|||
|
|
øíàÛá÷Ø
|
|||
|
|
²ã$ÛÏ ìí$áÏ ± îÏ �‘ “• lâÐ ½
|
|||
|
|
ç¡ À
|
|||
|
|
€¢ À
|
|||
|
|
ž¢ À
|
|||
|
|
À
|
|||
|
|
½
|
|||
|
|
À
|
|||
|
|
íàÛá÷Ø
|
|||
|
|
²ã±¨âÛ
|
|||
|
|
üƒÑ 1 8 ï œ Â
|
|||
|
|
§ Ã
|
|||
|
|
Ã
|
|||
|
|
Â
|
|||
|
|
ï Äó ˆÑ Õó ‹Ñ ÓäÄ
|
|||
|
|
ÄM Ä
|
|||
|
|
!# ´ìÑ ïÑ ð ðÓä Á
|
|||
|
|
óÑ Á
|
|||
|
|
|
|||
|
|
Ä
|
|||
|
|
8íàÛá$ôÑ ü¦Ò - 8 ñ œ Æ
|
|||
|
|
§ Ç
|
|||
|
|
Ç
|
|||
|
|
ñ Æ
|
|||
|
|
Äó «Ò Õó ®Ò Óä üØÒ / ø É
|
|||
|
|
œ Ê
|
|||
|
|
§ Ë
|
|||
|
|
Ë
|
|||
|
|
É
|
|||
|
|
Ê
|
|||
|
|
Äó áÒ Õó äÒ ¦÷Ì
|
|||
|
|
Í
|
|||
|
|
Î
|
|||
|
|
Ï
|
|||
|
|
úM ûM ÿM óN Ï
|
|||
|
|
Í
|
|||
|
|
Î
|
|||
|
|
ÝÒ AC EG LŽÓ $“Ó È
|
|||
|
|
È
|
|||
|
|
„¼
|
|||
|
|
üÛÓ ' $ÞÓ ò ò¦÷ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ„¼
|
|||
|
|
È
|
|||
|
|
ãÓ È
|
|||
|
|
|
|||
|
|
Í
|
|||
|
|
øíàÛá$èÓ üåÕ - LèÕ ó ó¦÷ ¬Ô È
|
|||
|
|
òÕ È
|
|||
|
|
|
|||
|
|
Î
|
|||
|
|
øíàÛá$óÕ üïÖ p $òÖ ¦÷÷Ø
|
|||
|
|
²ã÷Ø
|
|||
|
|
È
|
|||
|
|
“ Ð
|
|||
|
|
— Ñ
|
|||
|
|
Ð
|
|||
|
|
Ñ
|
|||
|
|
È
|
|||
|
|
²Ù
|
|||
|
|
÷Ö ßã úÖ Íì¦÷ ,³× “"²ã÷Ø
|
|||
|
|
¦÷ úM ÌÅ× ²ãš¹˜" ÷Ø
|
|||
|
|
Ý×
|
|||
|
|
Ï
|
|||
|
|
øíàÛá÷Ø
|
|||
|
|
²ã$ýÖ ìí$ƒ× ± �× �‘ “• l„Ø Ï
|
|||
|
|
ç¡ Ò
|
|||
|
|
€¢ Ò
|
|||
|
|
ž¢ Ò
|
|||
|
|
Ò
|
|||
|
|
Ï
|
|||
|
|
Ò
|
|||
|
|
íàÛá÷Ø
|
|||
|
|
²ã ÷Ø
|
|||
|
|
»¨ Ûá÷Ø
|
|||
|
|
âÛ
|
|||
|
|
ü¥Ø 4 8 ô œ Ô
|
|||
|
|
§ Õ
|
|||
|
|
ô Ô
|
|||
|
|
Õ
|
|||
|
|
Äó ªØ Õó Ø é÷Ö
|
|||
|
|
ÄM Ö
|
|||
|
|
!# ´‘Ù ”Ù õ õé÷ Ó
|
|||
|
|
˜Ù Ó
|
|||
|
|
|
|||
|
|
Ö
|
|||
|
|
8íàÛá$™Ù üËÙ 0 8 ö œ Ø
|
|||
|
|
§ Ù
|
|||
|
|
Ø
|
|||
|
|
Ù
|
|||
|
|
ö Äó ÐÙ Õó ÓÙ é÷ ü€Ú 4 8 ÷ œ Û
|
|||
|
|
§ Ü
|
|||
|
|
Û
|
|||
|
|
Ü
|
|||
|
|
÷ Äó …Ú Õó ˆÚ ›±
|
|||
|
|
,‹Ú é÷Ý
|
|||
|
|
Àc Ý
|
|||
|
|
&( *, ü»Ú 8 ¾Ú ø ù ú øé÷ ù c c ˆ ¢cµ
|
|||
|
|
` £cØ“
|
|||
|
|
` àB¤GS
|
|||
|
|
úÿ”
|
|||
|
|
Ú
|
|||
|
|
ÂÚ Ú
|
|||
|
|
|
|||
|
|
Ý
|
|||
|
|
8íàÛá$ÃÚ ± ÉÚ T¸Û Ý
|
|||
|
|
ç¡ Þ
|
|||
|
|
€¢ Þ
|
|||
|
|
ž¢ Þ
|
|||
|
|
Þ
|
|||
|
|
Ý
|
|||
|
|
Þ
|
|||
|
|
íàÛá ¹¨Á¨ üèÛ < ø à
|
|||
|
|
œ á
|
|||
|
|
§ â
|
|||
|
|
’ ã
|
|||
|
|
à
|
|||
|
|
â
|
|||
|
|
ã
|
|||
|
|
á
|
|||
|
|
Äó ñÛ Õó ôÛ ’è ÷Û £èLúÛ Áøä
|
|||
|
|
å
|
|||
|
|
æ
|
|||
|
|
ç
|
|||
|
|
úM ûM ÿM óN æ
|
|||
|
|
å
|
|||
|
|
ç
|
|||
|
|
íÛ SU WY [] L«Ü $°Ü ß
|
|||
|
|
ß
|
|||
|
|
³úüõÜ $ $øÜ û ûÁø»ª
|
|||
|
|
ß
|
|||
|
|
ýÜ ß
|
|||
|
|
|
|||
|
|
å
|
|||
|
|
øíàÛáöß$‚Ý üñÝ - LôÝ ü üÁø ¬Ô ß
|
|||
|
|
þÝ ß
|
|||
|
|
|
|||
|
|
æ
|
|||
|
|
øíàÛáöß$ÿÝ üûÞ l $þÞ Áø“‡¥ �Å ß
|
|||
|
|
“ è
|
|||
|
|
— é
|
|||
|
|
è
|
|||
|
|
é
|
|||
|
|
ß
|
|||
|
|
Íì�Å ƒß °¥ †ß ÍìÁø ,»ß “"‡¥ �ÅÁø úM ÌÍß ‡¥ ƒÆ˜" �Å åß
|
|||
|
|
ç
|
|||
|
|
øíàÛáöß�Ň¥ $‰ß ìí$�ß ± ˜ß “• —™ ü—à 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Žä ƒá
|
|||
|
|
þ
|
|||
|
|
ÿ
|
|||
|
|
€ ‚ „ … ‡ þã IK MO QS UW ü¶ç q üµä > ; Sets the value of the entry, and returns an OccupiedEntry.Á øä ú t€å Þº “å ú <›å ƒ» Ü§å °º Çå ú üÏå 5¹• ü‰æ 3 0 let entry = map.entry("horseyland").insert(37);Á Áæ ú üÉæ + ( assert_eq!(entry.key(), &"horseyland");Á <ùæ ƒ» 4½ç ƒá
|
|||
|
|
Ûá„â
|
|||
|
|
ø
|
|||
|
|
ø
|
|||
|
|
þž
|
|||
|
|
$Šè ´™ \›è
|
|||
|
|
þ
|
|||
|
|
øíàÛá¤çíå$Äç »,Êç üÞî b üŒê R÷À üãê 2¨° šë ú t¢ë Þº µë ú <½ë ƒ» ÜÉë °º éë ú üñë 5¹• «ì ú ´³ì // nonexistent keyÁ üÎì ( % map.entry("poneyland").or_insert(3);Á üûì $Øà ¤í ú œ¬í // existing keyÁ üÄí / , *map.entry("poneyland").or_insert(10) *= 2;Á üøí $ðÄ <¡î ƒ» Låî ƒá
|
|||
|
|
Ûᄼ
|
|||
|
|
ø
|
|||
|
|
ø
|
|||
|
|
þž
|
|||
|
|
$£ï ´™ \´ï
|
|||
|
|
ÿ
|
|||
|
|
øíàÛá¤çíå$ïî ><õî üÝõ y üäð ]ÜÆ üÆñ > ; 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öõ ‡¥ ˜" Ûá ‚ö þž
|
|||
|
|
$¹ö ´™ \Êö
|
|||
|
|
€ øíàÛá¤çí凥 $…ö ><‹ö fh üÌÿ üü÷ _ \ 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õÌ ü—ˆ
|
|||
|
|
#ÄÍ ¿ˆ
|
|||
|
|
ú tLj
|
|||
|
|
Þº Úˆ
|
|||
|
|
ú <âˆ
|
|||
|
|
ƒ» Üîˆ
|
|||
|
|
°º Ž‰
|
|||
|
|
ú ü–‰
|
|||
|
|
5¹• Љ
|
|||
|
|
ú Ô؉
|
|||
|
|
map.entry("poneyland")Á ü÷‰
|
|||
|
|
# .and_modify(|e| { *e += 1 })Á ´ŸŠ
|
|||
|
|
.or_insert(42);Á üºŠ
|
|||
|
|
%‡Ð äŠ
|
|||
|
|
ú ÔìŠ
|
|||
|
|
Áè ü‹‹
|
|||
|
|
#æè ´³‹
|
|||
|
|
“é ü΋
|
|||
|
|
%œÑ <ø‹
|
|||
|
|
ƒ» T¼Œ
|
|||
|
|
ć
|
|||
|
|
ഠć
|
|||
|
|
ø
|
|||
|
|
— † † ø
|
|||
|
|
°¥ ÇŒ
|
|||
|
|
† –"‡¥ †Ûá tóŒ
|
|||
|
|
† ‡¥ òë˜"
|
|||
|
|
… øíàÛá¤çí凥 $ÊŒ
|
|||
|
|
± ÐŒ
|
|||
|
|
tv ü¿›
|
|||
|
|
e üòŽ
|
|||
|
|
FÈÓ ü½�
|
|||
|
|
E™Ô ü‡�
|
|||
|
|
!éÔ �
|
|||
|
|
ú tµ�
|
|||
|
|
޺ �
|
|||
|
|
ú <Ð�
|
|||
|
|
ƒ» ÜÜ�
|
|||
|
|
°º üü�
|
|||
|
|
# use hashbrown::hash_map::Entry;Á ¤‘
|
|||
|
|
ú ü¬‘
|
|||
|
|
5¹• æ‘
|
|||
|
|
ú œî‘
|
|||
|
|
µÖ ܆’
|
|||
|
|
.entry("poneyland")Á ü¦’
|
|||
|
|
3‰× Þ’
|
|||
|
|
ú Œæ’
|
|||
|
|
Ó× ìü’
|
|||
|
|
Entry::Vacant(e) => {Á üž“
|
|||
|
|
.ãÛ LÑ“
|
|||
|
|
¤È üß“
|
|||
|
|
' $ Entry::Occupied(_) => panic!(),Á ,‹”
|
|||
|
|
¾¿ •”
|
|||
|
|
ú ü�”
|
|||
|
|
òØ Â”
|
|||
|
|
ú œÊ”
|
|||
|
|
µÖ Üâ”
|
|||
|
|
Äí ü‚•
|
|||
|
|
(ÔÙ ü¯•
|
|||
|
|
(‡Ú ôÜ•
|
|||
|
|
¹Ú ¼ÿ•
|
|||
|
|
áÚ \›–
|
|||
|
|
‚Û «–
|
|||
|
|
ú Œ³–
|
|||
|
|
Ó× üÉ–
|
|||
|
|
Entry::Occupied(e) => {Á üí–
|
|||
|
|
.ãÛ ü —
|
|||
|
|
%œÜ LÊ—
|
|||
|
|
¤È üØ—
|
|||
|
|
% " Entry::Vacant(_) => panic!(),Á ,‚˜
|
|||
|
|
¾¿ Œ˜
|
|||
|
|
ú ü”˜
|
|||
|
|
%œÑ ¾˜
|
|||
|
|
ú œÆ˜
|
|||
|
|
µÖ ÜÞ˜
|
|||
|
|
Äí üþ˜
|
|||
|
|
/ñÝ ²™
|
|||
|
|
ú Œº™
|
|||
|
|
Ó× üЙ
|
|||
|
|
> ; Entry::Vacant(e) => assert_eq!(e.key(), &"poneyland"),Á ü“š
|
|||
|
|
'Øî ,¿š
|
|||
|
|
¾¿ Éš
|
|||
|
|
ú üÑš
|
|||
|
|
,ÿÞ <‚›
|
|||
|
|
ƒ» ´Æ›
|
|||
|
|
ć
|
|||
|
|
ഠć
|
|||
|
|
ø
|
|||
|
|
— ˆ ˆ ø
|
|||
|
|
°¥ Ý›
|
|||
|
|
‡ –"‡¥ ‡íà Ûá Ô‰œ
|
|||
|
|
‡ ‡¥ õ˜" Ëá 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™¥
|
|||
|
|
„â
|
|||
|
|
– — ˜ ™ š › œ � ž Ÿ ‰¥
|
|||
|
|
RT VX Z\ ^` ¼¹©
|
|||
|
|
üÈ¥
|
|||
|
|
-Õã ú¥
|
|||
|
|
ú t‚¦
|
|||
|
|
Þº •¦
|
|||
|
|
ú <�¦
|
|||
|
|
ƒ» ü©¦
|
|||
|
|
.ùã
|
|||
|
|
ܦ
|
|||
|
|
ú üä¦
|
|||
|
|
5¹• üž§
|
|||
|
|
) & map.entry("poneyland").or_insert(12);Á ̧
|
|||
|
|
ú üÔ§
|
|||
|
|
" match map.entry("poneyland") {Á üû§
|
|||
|
|
%–ñ ü¥¨
|
|||
|
|
H E Entry::Occupied(entry) => assert_eq!(entry.key(), &"poneyland"),Á ,ò¨
|
|||
|
|
¾¿ <ü¨
|
|||
|
|
ƒ» À©
|
|||
|
|
ˆ ˆ„â
|
|||
|
|
ˆíà � Ä©
|
|||
|
|
�
|
|||
|
|
– øíàÛá¤çíå$Å©
|
|||
|
|
ü¹°
|
|||
|
|
# ü‡ª
|
|||
|
|
9êœ
|
|||
|
|
üŪ
|
|||
|
|
)—ê óª
|
|||
|
|
ú 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À°
|
|||
|
|
„â
|
|||
|
|
³ú � �
|
|||
|
|
— øíàÛá¤çíå$Í°
|
|||
|
|
¼¡µ
|
|||
|
|
ü¢±
|
|||
|
|
/õ Ö±
|
|||
|
|
ú tÞ±
|
|||
|
|
Þº ñ±
|
|||
|
|
ú <ù±
|
|||
|
|
ƒ» Ü…²
|
|||
|
|
°º ü¥²
|
|||
|
|
#àì Ͳ
|
|||
|
|
ú üÕ²
|
|||
|
|
5¹• ü�³
|
|||
|
|
)‚ÿ ½³
|
|||
|
|
ú üų
|
|||
|
|
"Ãÿ üì³
|
|||
|
|
%–ñ ü–´
|
|||
|
|
? < Entry::Occupied(entry) => assert_eq!(entry.get(), &12),Á ,Ú´
|
|||
|
|
¾¿ <ä´
|
|||
|
|
ƒ» ¨µ
|
|||
|
|
‰ ‰„â
|
|||
|
|
‰Ûá � ¬µ
|
|||
|
|
�
|
|||
|
|
˜ øíàÛá¤çíå$µ
|
|||
|
|
üä¼
|
|||
|
|
# üïµ
|
|||
|
|
7”ý «¶
|
|||
|
|
ú ü³¶
|
|||
|
|
H E If you need a reference to the `OccupiedEntry` which may outlive theÁ ü€·
|
|||
|
|
7 4 destruction of the `Entry` value, see [`into_mut`].Á ¼·
|
|||
|
|
ú üÄ·
|
|||
|
|
" [`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);Á <§¼
|
|||
|
|
ƒ» <ë¼
|
|||
|
|
Š Š„â
|
|||
|
|
ŠÛá � ó¼
|
|||
|
|
�
|
|||
|
|
™ øíàÛá¤çíå$ø¼
|
|||
|
|
ü˜Ä
|
|||
|
|
" ü½
|
|||
|
|
QØø ü˜¾
|
|||
|
|
,Ÿð ɾ
|
|||
|
|
ú üѾ
|
|||
|
|
L I If you need multiple references to the `OccupiedEntry`, see [`get_mut`].Á ¢¿
|
|||
|
|
ú üª¿
|
|||
|
|
[`get_mut`]: #method.get_mutÁ Ï¿
|
|||
|
|
ú t׿
|
|||
|
|
Þº ê¿
|
|||
|
|
ú <ò¿
|
|||
|
|
ƒ» üþ¿
|
|||
|
|
.ùã
|
|||
|
|
±À
|
|||
|
|
ú ü¹À
|
|||
|
|
5¹• üóÀ
|
|||
|
|
)‚ÿ ¡Á
|
|||
|
|
ú ü©Á
|
|||
|
|
%ùŒ ÓÁ
|
|||
|
|
ú ÄÛÁ
|
|||
|
|
°ú üøÁ
|
|||
|
|
"Ãÿ üŸÂ
|
|||
|
|
; 8 Entry::Occupied(entry) => value = entry.into_mut(),Á üßÂ
|
|||
|
|
%–ñ ,‰Ã
|
|||
|
|
¾¿ Œ“Ã
|
|||
|
|
*value += 10;Á ©Ã
|
|||
|
|
ú ü±Ã
|
|||
|
|
% " assert_eq!(map["poneyland"], 22);Á <ÛÃ
|
|||
|
|
ƒ» DŸÄ
|
|||
|
|
„â
|
|||
|
|
„¼
|
|||
|
|
� �
|
|||
|
|
š øíàÛá¤çíå$¨Ä
|
|||
|
|
ü�É
|
|||
|
|
' üõÄ
|
|||
|
|
C÷�
|
|||
|
|
½Å
|
|||
|
|
ú tÅÅ
|
|||
|
|
Þº ØÅ
|
|||
|
|
ú <àÅ
|
|||
|
|
ƒ» ÜìÅ
|
|||
|
|
°º üŒÆ
|
|||
|
|
#àì ´Æ
|
|||
|
|
ú ü¼Æ
|
|||
|
|
5¹• üöÆ
|
|||
|
|
)‚ÿ ¤Ç
|
|||
|
|
ú ü¬Ç
|
|||
|
|
<©� üíÇ
|
|||
|
|
% " assert_eq!(o.insert(15), 12);Á ,—È
|
|||
|
|
¾¿ ¡È
|
|||
|
|
ú ü©È
|
|||
|
|
% " assert_eq!(map["poneyland"], 15);Á <ÓÈ
|
|||
|
|
ƒ» 4—É
|
|||
|
|
‹ ‹„â
|
|||
|
|
ÛáÛá � žÉ
|
|||
|
|
�
|
|||
|
|
› øíàÛá¤çíå$£É
|
|||
|
|
»,©É
|
|||
|
|
ÄÙÏ
|
|||
|
|
üñÉ
|
|||
|
|
5Æ™
|
|||
|
|
ü«Ê
|
|||
|
|
)—ê ÙÊ
|
|||
|
|
ú táÊ
|
|||
|
|
Þº ôÊ
|
|||
|
|
ú <üÊ
|
|||
|
|
ƒ» ܈Ë
|
|||
|
|
°º ü¨Ë
|
|||
|
|
#àì ÐË
|
|||
|
|
ú üØË
|
|||
|
|
5¹• ¼’Ì
|
|||
|
|
“¼ ü®Ì
|
|||
|
|
3µ¼ æÌ
|
|||
|
|
ú üîÌ
|
|||
|
|
)‚ÿ œÍ
|
|||
|
|
ú ü¤Í
|
|||
|
|
8Áƒ üáÍ
|
|||
|
|
# assert_eq!(o.remove(), 12);Á ,‰Î
|
|||
|
|
¾¿ “Î
|
|||
|
|
ú ü›Î
|
|||
|
|
5™… üÕÎ
|
|||
|
|
!ÀÄ äûÎ
|
|||
|
|
¹¾ <œÏ
|
|||
|
|
ƒ» 4àÏ
|
|||
|
|
„â
|
|||
|
|
Ûá � �
|
|||
|
|
œ øíàÛá¤çíå$çÏ
|
|||
|
|
üùÙ
|
|||
|
|
. ü�Ð
|
|||
|
|
\ Y Replaces the entry, returning the old key and value. The new key in the hash map will beÁ üþÐ
|
|||
|
|
& # the key used to create this entry.Á ©Ñ
|
|||
|
|
ú d±Ñ
|
|||
|
|
ò‡ ÂÑ
|
|||
|
|
ú üÊÑ
|
|||
|
|
K H Will panic if this OccupiedEntry was created through [`Entry::insert`].Á šÒ
|
|||
|
|
ú t¢Ò
|
|||
|
|
Þº µÒ
|
|||
|
|
ú <½Ò
|
|||
|
|
ƒ» üÉÒ
|
|||
|
|
/ , use hashbrown::hash_map::{Entry, HashMap};Á ¬ýÒ
|
|||
|
|
use std::rc::Rc;Á —Ó
|
|||
|
|
ú üŸÓ
|
|||
|
|
< 9 let mut map: HashMap<Rc<String>, u32> = HashMap::new();Á üàÓ
|
|||
|
|
6 3 let key_one = Rc::new("Stringthing".to_string());Á ü›Ô
|
|||
|
|
6 3 let key_two = Rc::new("Stringthing".to_string());Á ÖÔ
|
|||
|
|
ú üÞÔ
|
|||
|
|
% " map.insert(key_one.clone(), 15);Á üˆÕ
|
|||
|
|
Q N assert!(Rc::strong_count(&key_one) == 2 && Rc::strong_count(&key_two) == 1);Á ÞÕ
|
|||
|
|
ú üæÕ
|
|||
|
|
' $ match map.entry(key_two.clone()) {Á ü’Ö
|
|||
|
|
$ ! Entry::Occupied(entry) => {Á ü»Ö
|
|||
|
|
S P let (old_key, old_value): (Rc<String>, u32) = entry.replace_entry(16);Á ü“×
|
|||
|
|
H E assert!(Rc::ptr_eq(&key_one, &old_key) && old_value == 15);Á Tà×
|
|||
|
|
}Á üï×
|
|||
|
|
& # Entry::Vacant(_) => panic!(),Á 4šØ
|
|||
|
|
}Á ¥Ø
|
|||
|
|
ú üØ
|
|||
|
|
Q N assert!(Rc::strong_count(&key_one) == 1 && Rc::strong_count(&key_two) == 2);Á üƒÙ
|
|||
|
|
4 1 assert_eq!(map[&"Stringthing".to_owned()], 16);Á <¼Ù
|
|||
|
|
ƒ» l€Ú
|
|||
|
|
„â
|
|||
|
|
Ûá³ú � �
|
|||
|
|
� øíàÛá¤çíå$ŽÚ
|
|||
|
|
»,”Ú
|
|||
|
|
ìýè
|
|||
|
|
ü‡Ü
|
|||
|
|
L I Replaces the key in the hash map with the key used to create this entry.Á ØÜ
|
|||
|
|
ú dàÜ
|
|||
|
|
ò‡ ñÜ
|
|||
|
|
ú üùÜ
|
|||
|
|
Kßž ÉÝ
|
|||
|
|
ú tÑÝ
|
|||
|
|
Þº äÝ
|
|||
|
|
ú <ìÝ
|
|||
|
|
ƒ» üøÝ
|
|||
|
|
.ùã
|
|||
|
|
¤«Þ
|
|||
|
|
Ãè ÄÞ
|
|||
|
|
ú üÌÞ
|
|||
|
|
H E let mut map: HashMap<Rc<String>, usize> = HashMap::with_capacity(6);Á ü™ß
|
|||
|
|
> ; let mut keys_one: Vec<Rc<String>> = Vec::with_capacity(6);Á üÜß
|
|||
|
|
> ; let mut keys_two: Vec<Rc<String>> = Vec::with_capacity(6);Á Ÿà
|
|||
|
|
ú ü§à
|
|||
|
|
P M for (value, key) in ["a", "b", "c", "d", "e", "f"].into_iter().enumerate() {Á üüà
|
|||
|
|
- * let rc_key = Rc::new(key.to_owned());Á ü®á
|
|||
|
|
& # keys_one.push(rc_key.clone());Á üÙá
|
|||
|
|
* ' map.insert(rc_key.clone(), value);Á üˆâ
|
|||
|
|
/ , keys_two.push(Rc::new(key.to_owned()));Á ,¼â
|
|||
|
|
¾¿ Æâ
|
|||
|
|
ú dÎâ
|
|||
|
|
assert!(Á üßâ
|
|||
|
|
= : keys_one.iter().all(|key| Rc::strong_count(key) == 2)Á ü¡ã
|
|||
|
|
D A && keys_two.iter().all(|key| Rc::strong_count(key) == 1)Á 4êã
|
|||
|
|
�Ð õã
|
|||
|
|
ú üýã
|
|||
|
|
( % reclaim_memory(&mut map, &keys_two);Á ªä
|
|||
|
|
ú d²ä
|
|||
|
|
÷® üÃä
|
|||
|
|
= : keys_one.iter().all(|key| Rc::strong_count(key) == 1)Á ü…å
|
|||
|
|
D A && keys_two.iter().all(|key| Rc::strong_count(key) == 2)Á 4Îå
|
|||
|
|
�Ð Ùå
|
|||
|
|
ú üáå
|
|||
|
|
R O fn reclaim_memory(map: &mut HashMap<Rc<String>, usize>, keys: &[Rc<String>]) {Á ̸æ
|
|||
|
|
for key in keys {Á üÖæ
|
|||
|
|
D A if let Entry::Occupied(entry) = map.entry(key.clone()) {Á üŸç
|
|||
|
|
I F // Replaces the entry's key with our version of it in `keys`.Á üíç
|
|||
|
|
$ ! entry.replace_key();Á l–è
|
|||
|
|
|
|||
|
|
}Á L¨è
|
|||
|
|
¤È ,¶è
|
|||
|
|
¾¿ <Àè
|
|||
|
|
ƒ» \„é
|
|||
|
|
„â
|
|||
|
|
íà � �
|
|||
|
|
ž øíàÛá¤çíå$�é
|
|||
|
|
üôõ
|
|||
|
|
r ü‘ê
|
|||
|
|
FÈÓ üÜê
|
|||
|
|
=®
|
|||
|
|
üžë
|
|||
|
|
!éÔ Äë
|
|||
|
|
ú 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‹ø
|
|||
|
|
Ÿ ç¡ ¡ €¢ ¡ ž¢ ¡ ¡ Ÿ ¡ íàÛá¤çí凥 ³ª
|
|||
|
|
‡¥ ˆ÷
|
|||
|
|
üÈü
|
|||
|
|
; ø £ œ ¤ § ¥ ¤ ¦ ’ § £ ¤ ¦ § ¥ Äó Ñü
|
|||
|
|
Õó Ôü
|
|||
|
|
ÃÆ ×ü
|
|||
|
|
ø¤ Úü
|
|||
|
|
Š¥ 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÷ƒ ýâ
|
|||
|
|
íà ¢ ¢
|
|||
|
|
© øíàÛá¤çíå$€„ üŸˆ ] ü©„ ;ð¬
|
|||
|
|
üé„ *¶
|
|||
|
|
˜… ú t … Þº ³… ú <»… ƒ» ÜÇ… °º üç… #àì �† ú ü—† 5¹• ц ú üÙ† 6 3 if let Entry::Vacant(o) = map.entry("poneyland") {Á ¬”‡ o.insert(37);Á ,®‡ ¾¿ ü¸‡ % " assert_eq!(map["poneyland"], 37);Á <⇠ƒ» 4¦ˆ ýâ
|
|||
|
|
Ûᄼ
|
|||
|
|
¢ ¢ þž
|
|||
|
|
$߈ ´™ \ðˆ
|
|||
|
|
ª øíàÛá¤çíå$ˆ »,³ˆ ü¦‹ ~ d´‹ ýâ
|
|||
|
|
Ûá„â
|
|||
|
|
¢ ¢ þž
|
|||
|
|
$‡Œ ´™ \˜Œ
|
|||
|
|
« øíàÛá¤çíå$Á‹ »,Ç‹ üæŽ N ø ™: ® œ ¯ ¢ ° § ± ¤ ² ’ ³ ® ³ ¯ ± ² ° æ™ óŽ ø™ öŽ Šš �� œš „� ®š ‡� ÀšLŠ� —›´ µ ¶ ¸ º » ½ ëŽ ïŽ Y[ ]_ ac eg ik üÄ’ ‰ ü»� A > Sets the value of the entry, and returns an OccupiedEntryRef.Á �� ú 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Èí \Á“
|
|||
|
|
´ ø ™:¶í¼íÂíÈíÎí$Ò’ »,Ø’ ü”š p ü¸• 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–¸ � îÚÂé˜"
|
|||
|
|
» ø ™:¶í¼íÂíÈíÎíîÚ$í· ± ó· ~€ ü™Ç e ü¡º FÈÓ üìº E™Ô ü¶» !éÔ Ü» ú tä» Þº ÷» ú <ÿ» ƒ» Ü‹¼ °º ü«¼ & # use hashbrown::hash_map::EntryRef;Á Ö¼ ú üÞ¼ 7ðÏ š½ ú œ¢½ µÖ üº½ .entry_ref("poneyland")Á üÞ½ 3‰× –¾ ú Œž¾ Ó× ü´¾
|
|||
|
|
Û
|
|||
|
|
Ù Û ¶í¼íÂíÈíÎíîÚ ä½Û¼Ý¼Þ¼© ß¼ à¼ÛἈ cSñŸ«‡zÙä½ îÚ Û¼Ý¼Þ¼© ß¼ à¼ÛἈ cSñŸ«‡zÙ ì ð ñ´^ òˆ ø ó ôÑ^ õˆ ø �”e%@NbJ ¶í¼íü‘© T ø Ý ™: Þ œ ß ¢ à § á ¤ â ’ ã à á ß Ý ã â Þ æ™ ž© ø™ ¡© Šš ¬© œš ¯© ®š ²© ÀšLµ© ·œä å æ ç –© š© PR TV XZ \^ `b ü� 7 üì© I� üºª ! through the `VacantEntryRef`.Á ઠú tèª Þº ûª ú <ƒ« ƒ» Ü�« °º ¯« ú ü·« 7ðÏ üó« let key: &str = "poneyland";Á ü˜¬ 6 3 assert_eq!(map.entry_ref(key).key(), "poneyland");Á <Ó¬ ƒ» — — —·œ —¼í Ü › Ü –§L½
|
|||
|
|
ä ø ™:¶í¼íÂíÈíÎí$œ üÚ± < ôó øÄ –® ú tž® Þº ±® ú <¹® ƒ» üÅ® 1Ó� û® ú üƒ¯ 7ðÏ ü¿¯ Ù¼ ä¯ ú ôì¯ match map.entry_ref(key) {Á ü�° *çì ü¾° P M EntryRef::Vacant(v) => assert_eq!(v.into_key(), "poneyland".to_owned()),Á ,“± ¾¿ <�± ƒ» Dá± ·œ¶í Ü Ü ˆÓ\Š²
|
|||
|
|
å ø ™:¶í¼íÂíÈíÎí$ê± üè¶ k üƲ > ; Sets the value of the entry with the VacantEntryRef's key,Á ü‰³ *¶
|
|||
|
|
¸³ ú tÀ³ Þº Ó³ ú <Û³ ƒ» Üç³ °º ü‡´ &ºê ²´ ú üº´ 7ðÏ üö´ Ù¼ ›µ ú ü£µ 5 2 if let EntryRef::Vacant(o) = map.entry_ref(key) {Á ¬Ýµ ÒÉ ,÷µ ¾¿ ü�¶ %€Ê <«¶ ƒ» 4ï¶ ·œÂíïÖ Ü Ü ÷Ò$¨· ˆÓ\¯· ¤Ó\Ç·
|
|||
|
|
æ ø ™:¶í¼íÂíÈíÎí$ö¶ »,ü¶ üŠº ‹ 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¿Ä
|
|||
|
|
üðÌ @«¿ ÄµÍ úª üÒÍ 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<Âû ø ‘ ‘ � –®4 —Õ Ï¹$�º �¬äÓ ‘ ‘ � –®4 —Õ Ï¹$�º îw �¬äÓ îw Œ Œ
|
|||
|
|
‹ îwÁ Ðû $Êû üžü H<¡ü ø ‘ ‘ � –®4 —Õ Ï¹$�ººò�¬äÓ ‘ ‘ � –®4 —Õ Ï¹$�º�ó�¬äÓ îw Ž Ž
|
|||
|
|
� îwÁ ¯ü $©ü üýü OD€ý ø � Î Î ²B Òã ø ÓÚ ø ܦ‹n=ð~“ � ºò Î Î ²B Òã ø ÓÚ ø ܦ‹n=ð~“ � �ó îw ‘ ‘ ‰ý
|
|||
|
|
� îwÁ “ý $�ý üãý ODæý ø “ Î Î ²B Òã ø ÓÚ ø ܦ‹n=ð~“ “ ºò Î Î ²B Òã ø ÓÚ ø ܦ‹n=ð~“ “ �ó îw ” ” ïý
|
|||
|
|
’ îwÁ ùý $óý üÉþ slÌþ ø é é ± íã ø Õ’-Ãè!áºò²Ø é é ± íã ø Õ’-Ãè!á�ó²Ø îw – ’ — – — ¼é àþ ÎéLãþ
|
|||
|
|
• îw²ØÁ ÷þ $Úþ -/ üÓÿ slÖÿ ø é é ± íã ø Õ’-Ãè!áºò²Ø é é ± íã ø Õ’-Ãè!á�ó²Ø îw ™ ’ š š ™ ¼é êÿ ÎéLíÿ
|
|||
|
|
˜ îw²ØÁ �€
|
|||
|
|
$äÿ -/ üÝ€
|
|||
|
|
ODà€
|
|||
|
|
ø œ ³ ³ ¾H ·ã ø 0‘ÍÔ áô/ œ ºò ³ ³ ¾H ·ã ø 0‘ÍÔ áô/ œ �ó îw � � é€
|
|||
|
|
|
|||
|
|
› îwÁ ó€
|
|||
|
|
$í€
|
|||
|
|
üÃ�
|
|||
|
|
OD�
|
|||
|
|
ø Ÿ ³ ³ ¾H ·ã ø 0‘ÍÔ áô/ Ÿ ºò ³ ³ ¾H ·ã ø 0‘ÍÔ áô/ Ÿ �ó îw Ï�
|
|||
|
|
|
|||
|
|
ž îwÁ Ù�
|
|||
|
|
$Ó�
|
|||
|
|
ü©‚
|
|||
|
|
UT¬‚
|
|||
|
|
ø ¢ À À ¤I Äã ø ýŒ´Õ~3ÌË ¢ ºò À À ¤I Äã ø ýŒ´Õ~3ÌË ¢ �ó îw £ £ ·‚
|
|||
|
|
|
|||
|
|
¡ îwÁ Á‚
|
|||
|
|
$»‚
|
|||
|
|
ü•ƒ
|
|||
|
|
UT˜ƒ
|
|||
|
|
ø ¥ À À ¤I Äã ø ýŒ´Õ~3ÌË ¥ ºò À À ¤I Äã ø ýŒ´Õ~3ÌË ¥ �ó îw ¦ ¦ £ƒ
|
|||
|
|
|
|||
|
|
¤ îwÁ ƒ
|
|||
|
|
$§ƒ
|
|||
|
|
ü�„
|
|||
|
|
q,„„
|
|||
|
|
ø Í Í ŒJ Òã ø Îþç>øiÉ’ ºòºòäÓ Í Í ŒJ Òã ø Îþç>øiÉ’ îw�ó�óäÓ îw ¨ ¨
|
|||
|
|
§ îw¯ ™„
|
|||
|
|
$Š„
|
|||
|
|
tô Tø ° µ ManuallyDropÁd<
|
|||
|
|
ÃÛ © « r,T
|
|||
|
|
é! © DerefMutÁD[
|
|||
|
|
ö! © ® µ j
|
|||
|
|
“ © ¯ $+
|
|||
|
|
Œ7
|
|||
|
|
[ü+&
|
|||
|
|
MO57%'Üs
|
|||
|
|
T~
|
|||
|
|
¥ ± — ² ² ± Û� ‰
|
|||
|
|
ÜÎ Œ
|
|||
|
|
› “"‚û ›ÅÖ lœ
|
|||
|
|
› ‚û·‡˜" Äú MTRa@Êê ³ ´ È ik np L±
|
|||
|
|
4±
|
|||
|
|
© ° ° ‚ûDÀ
|
|||
|
|
,À
|
|||
|
|
© ° ° ÅÖü×W
|
|||
|
|
,Þ
|
|||
|
|
ÅÖ‚ûÄú ¥ ¶ — · ¶ · Û� ä
|
|||
|
|
ÜÎ ç
|
|||
|
|
œ “"‚û œÅÖ l
|
|||
|
|
œ ‚ûɉ˜"
|
|||
|
|
µ ÅÖ‚û»,ê
|
|||
|
|
€{4ô
|
|||
|
|
gi ln üÕ7
|
|||
|
|
¥ ¹ — º ¹ º � ‚û �ÅÖ˜" lþ
|
|||
|
|
ÜÎ Ý
|
|||
|
|
� “"‚ûèŠ ! Û� Ú
|
|||
|
|
Äú»
|
|||
|
|
79 ü¡#
|
|||
|
|
T¨
|
|||
|
|
ÄúÅÖ ¸ ¸
|
|||
|
|
» ÅÖ‚û£,³
|
|||
|
|
üõA
|
|||
|
|
¥ ½ — ¾ ¾ ½ ž ‚û žÅÖ˜" l¨
|
|||
|
|
ÜÎ ý
|
|||
|
|
ž “"‚ûÑŒ ! Û� ú
|
|||
|
|
Äú¿ À ê! ë! À FH \½
|
|||
|
|
4Â
|
|||
|
|
¼ ¼ ÅÖ¬à
|
|||
|
|
,ã
|
|||
|
|
Ÿ ŸÄú ŸÅÖ ¼ é
|
|||
|
|
¼
|
|||
|
|
À ÅÖ‚û$ê
|
|||
|
|
ü•D
|
|||
|
|
¥ Â — Ã Â Ã ‚û ÅÖ˜" lË
|
|||
|
|
ÜÎ �
|
|||
|
|
“"‚ûþŽ ! Û� š
|
|||
|
|
ÄúÄ ÷! Ä ?A üî!
|
|||
|
|
Lñ
|
|||
|
|
¡ ¡Äú ¡ÅÖ Á û
|
|||
|
|
Á
|
|||
|
|
Ä ÅÖ‚û$€
|
|||
|
|
ü³ @
|
|||
|
|
¥ Æ — Ç Æ Ç ¢ ‚û ¢ÅÖ˜" lå
|
|||
|
|
ÜÎ »
|
|||
|
|
¢ “"‚û‹‘ ! Û� ¸
|
|||
|
|
ÄúÈ �" È ?A ”ˆ
|
|||
|
|
|
|||
|
|
$‹
|
|||
|
|
|
|||
|
|
£ £Äú Å �
|
|||
|
|
|
|||
|
|
Å
|
|||
|
|
È ÅÖ‚û$•
|
|||
|
|
|
|||
|
|
<„ ˆ ä ý
|
|||
|
|
�…Š‘˜Ÿ¥îþ‰¬µD( „ É Ê öåT> ò É Ì ¼´|J Ä É Í ToOwnedÁ<o ² É Î × ‚ ` É Ï \\˜ Åe É Ñ Ž$¥ še É Ò Ž e É Ò ChainÁ,½ ð¬ É Ô ¦†lÄ òP É Õ BitAndÁ4ä öø É × BitOrÁ,ì –ú É Ø BitXorÁ4ó ¶û É Ù SubÁ û �ï É Ú Ø$“ ø É Ü ì”™ � É Ý �< ‘ É Þ ¾H$¶ ³ É ß ø LÎ # É á ö / š²4Ù Ÿ É â ö 0 š² É â ö 0 …2dá ë É ã ö¤ ,6õø´`ãL|ÕT‹È˹¼T°•˜„‡LØsv^aHK58T†) � ýÿ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‹Ø <„ ¥ å ¤ æ ’ ç å æ ç Û� Œ Àü´� ƒ‚¬§ •‚Lª ¥û n‡@Ö‹5Ï è 68 ; � �¬ E § äÓ üÄ $ Ï ä ä ‘üüí I ¥ ê ¤ ë ’ ì ê ì ë Û� ò Àü ü ƒ‚ † �¸,õ ØÖû ,ÿ •‚L‰ ØºÝ ,• ¥ûí î Ù Ú î í ^` ce hj ¼½ ,À ¤ ¤¥û ¥û é Æ é
|
|||
|
|
í ÅÖÖûºÝ$Ç ü¡!'T¤! ¥ ¦ ¥¥û ¦¥û é ¯! é
|
|||
|
|
î ÅÖÖûºÝ$´!·¹4º!üÞI) ¥ ð ¤ ñ ’ ò ñ ð ò Û� ãI Àü æI ƒ‚ éI •‚LìI¥ûó ô õ ö ÷ ø û ý 8: =? BD üÍL üŽJI F Returns the number of elements the set can hold without reallocating.Á ÜJú täJÞº ÷Jú <ÿJƒ» Ü‹KÓŸ ü«K8 5 let set: HashSet<i32> = HashSet::with_capacity(100);Á üèK# assert!(set.capacity() >= 100);Á <�Lƒ» DÔL § §¥û ï ÝL ï
|
|||
|
|
ó ÅÖÖûºÝ$ÞLüâP! ü–M9 6 An iterator visiting all elements in arbitrary order.Á üÔM) & The iterator element type is `&'a T`.Á ‚Nú tŠNÞº �Nú <¥Nƒ» ܱNÓŸ üÑN! let mut set = HashSet::new();Á ¤÷N set.insert("a");Á ¤�O set.insert("b");Á ©Oú ü±O( % // Will print in an arbitrary order.Á ÌÞO for x in set.iter() {Á ÔüO println!("{}", x);Á ,›P¾¿ <¥Pƒ» $éP ¨ ¨¥û ý
|
|||
|
|
ý
|
|||
|
|
²B €ù É
|
|||
|
|
Â÷ ¯ÅÖçåºÝ ï — ü ü Òi ï Á¤ Ïi ® “"çå ®ÅÖ Œ’j ® çåµÖ˜" $Ÿj
|
|||
|
|
û ÅÖÖûºÝçå$×i± Ýigi ¼¤n üøk( % Clears the set, removing all values.Á ¥lú tlÞº Àlú <Èlƒ» ÜÔlÓŸ ôlú üül ÷¾ „ mÿ tµm v.clear();Á ÔÈm‡Â <çmƒ» ,«n ° °¥û ï ±n ï
|
|||
|
|
ý ÅÖÖûºÝ$¶nüán ¥ ÿ ¤ €
|
|||
|
|
€
|
|||
|
|
ÿ Û� æn Àü én’Æ�
|
|||
|
|
‚
|
|||
|
|
üúy+ üˆoH 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Á üºp-„ÿ ìpú ÄôpÆÿ ‘qú ü™qHôÿ üæqP M not allow the `HashSet` to be protected against attacks such as [`HashDoS`].Á ü»r> � üþrIè� üÌs. + as the hasher when creating a [`HashSet`].Á ÿsú ü‡tLÿ‚ üØt@ = the HashSet to be useful, see its documentation for details.Á �uú ü¥u?„ üéu{÷„ üévNý… ¼wú tÄwÞº ×wú <ßwƒ» ÜëwÓŸ ü‹x0š‡ Àxú üÈx*⇠ü÷x* ' let mut set = HashSet::with_hasher(s);Á ”¦y set.insert(2);Á <½yƒ» \‡z Öû’Æ þ þ
|
|||
|
|
�
|
|||
|
|
ÅÖÖûá7Õ¢ü¤†C üûzA > Creates an empty `HashSet` with the specified capacity, usingÁ ôÁ{ `hasher` to hash the keys.Á ä{ú üì{J G The hash set will be able to hold at least `capacity` elements withoutÁ ü»|E B reallocating. If `capacity` is 0, the hash set will not allocate.Á …}ú Ä�}Æÿ ª}ú ü²}Hôÿ üÿ}P²Û üÔ~> � ü—Iè� üå.¨Ü ˜€ú ü €Lÿ‚ üñ€@úÜ ¶�ú ü¾�?„ ü‚‚{÷„ ü‚ƒNý… Õƒú t݃޺ ðƒú <øƒƒ» Ü„„ÓŸ ü¤„0š‡ Ù„ú üá„*⇠ü�…; 8 let mut set = HashSet::with_capacity_and_hasher(10, s);Á ”Ð… set.insert(1);Á <ç…ƒ» Ä«† Öû’Æ þ þ
|
|||
|
|
‚
|
|||
|
|
ÅÖÖûˆ DĆá74Õ†üÒ‡6 ¥ „
|
|||
|
|
¤ …
|
|||
|
|
’ †
|
|||
|
|
…
|
|||
|
|
†
|
|||
|
|
„
|
|||
|
|
Û� ׇ Àü Ú‡ ƒ‚ ݇ •‚Lþ‡¥û‡
|
|||
|
|
ˆ
|
|||
|
|
‰
|
|||
|
|
Š
|
|||
|
|
02 46 8: ìÖˆ ü�ˆ4´ýL݈ ± ±¥û ±ºÝ ƒ
|
|||
|
|
çˆ ƒ
|
|||
|
|
|
|||
|
|
‡
|
|||
|
|
ÅÖÖûºÝ$èˆü�”8 üž‰H²Ù L뉑þ ù‰ú ü�ŠJ�Ú üЊ-„ÿ ‚‹ú ÄŠ‹Æÿ §‹ú ü¯‹Hôÿ üü‹P²Û üÑŒ> � ü”�Iè� üâ�.¨Ü •Žú ü�ŽLÿ‚ üîŽ@úÜ ³�ú ü»�?„ üÿ�{÷„ üÿ�Ný… Ò‘ú tÚ‘Þº í‘ú <õ‘ƒ» Ü�’ÓŸ ü¡’0š‡ Ö’ú üÞ’*⇠ü�“*áÞ ”¼“”ß <Ó“ƒ» t�” ÖûºÝ¥û ƒ
|
|||
|
|
ƒ
|
|||
|
|
|
|||
|
|
ˆ
|
|||
|
|
ÅÖÖûºÝá72¤¤=¤üÑ P ü¨•AŽà ôî•Øà ‘–ú ü™–JŒá üè–Eàá ²—ú ĺ—Æÿ ×—ú üß—Hôÿ ü¬˜P²Û ü�™> � üÄ™Iè� ü’š.¨Ü Åšú üÍšLÿ‚ üž›@úÜ ã›ú üë›?„ ü¯œ{÷„ ü¯�Ný… ‚žú tŠžÞº �žú <¥žƒ» ܱžÓŸ üÑž0š‡ †Ÿú üŽŸ*⇠ü½Ÿ;ïä ”ýŸ´å <” ƒ» ÜØ ÖûºÝ¥û ƒ
|
|||
|
|
ƒ
|
|||
|
|
|
|||
|
|
‰
|
|||
|
|
ÅÖÖûºÝˆ Dô á74…¡¤,�¡Ô ¦ ü˜¢5 2 Returns a reference to the set's [`BuildHasher`].Á Ò¢ú üÚ¢Ný… £ú tµ£Þº È£ú <Уƒ» ÜÜ£ÓŸ üü£0š‡ ±¤ú ü¹¤/”Ÿ üí¤9 6 let set: HashSet<i32> = HashSet::with_hasher(hasher);Á ü«¥3 0 let hasher: &DefaultHashBuilder = set.hasher();Á <㥃» 4§¦ ² ²¥û ²Öû ƒ
|
|||
|
|
®¦ ƒ
|
|||
|
|
|
|||
|
|
Š
|
|||
|
|
ÅÖÖûºÝ$¯¦üà¦\
|
|||
|
|
É ÷#cK·nÁò ”
|
|||
|
|
ÅÖÖûºÝ ‹
|
|||
|
|
¾Ç ‹
|
|||
|
|
|
|||
|
|
“
|
|||
|
|
ÅÖÖûºÝ$Æǹ
|
|||
|
|
,ÌÇ,.üæÎ^ üÖÈ< 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ÒÕ ˜
|
|||
|
|
˜
|
|||
|
|
¥û Æœ ‘ ‘ éˆ –ù É —¹
|
|||
|
|
É 1×�ž $ñ ˜
|
|||
|
|
ÅÖÖûºÝ ‹
|
|||
|
|
ßÕ ‹
|
|||
|
|
|
|||
|
|
—
|
|||
|
|
ÅÖÖûºÝ$çÕ¹
|
|||
|
|
,íÕ,.ü�Ý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());Á <Ó܃» ,—Ý š
|
|||
|
|
š
|
|||
|
|
¥û Ž¢ ¥ ¥ ô ªù É t
|
|||
|
|
ï/p/' š
|
|||
|
|
ÅÖÖûºÝ ‹
|
|||
|
|
�Ý ‹
|
|||
|
|
|
|||
|
|
™
|
|||
|
|
ÅÖÖûºÝ$¥Ý¹
|
|||
|
|
,«Ý,.ü—æ_ üúà/ , 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èæ
|
|||
|
|
›
|
|||
|
|
ÅÖÖûºÝ¼í$³æ»,¹æQS üîì` üç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Ù ¹ÅÖ ‹
|
|||
|
|
¢ ž
|
|||
|
|
ž
|
|||
|
|
„í ‹
|
|||
|
|
ø™ ùì Œ¨$¹í �¨lÀí
|
|||
|
|
�
|
|||
|
|
ÅÖÖûºÝ¼í$…í»,‹í=? üŸó/ ü‘ïE B Inserts the given `value` into the set if it is not present, thenÁ üÛï0 - returns a reference to the value in the set.Á �ðú t˜ðÞº «ðú <³ðƒ» Ü¿ðÓŸ ßðú üçð>ÜÄ ìªñ¾Ë üÌñ) & assert_eq!(set.get_or_insert(2), &2);Á üúñ- * assert_eq!(set.get_or_insert(100), &100);Á ü¬ò1 . assert_eq!(set.len(), 4); // 100 was insertedÁ <âòƒ» l¦ó » »¥ûÅÖ »ÅÖ ‹
|
|||
|
|
´ó ‹
|
|||
|
|
|
|||
|
|
Ÿ
|
|||
|
|
ÅÖÖûºÝ$¹ó»,¿óü‹û� ü–öH E Inserts an owned copy of the given `value` into the set if it is notÁ üãö> ; present, then returns a reference to the value in the set.Á ¦÷ú t®÷Þº Á÷ú <É÷ƒ» ÜÕ÷ÓŸ õ÷ú üý÷: 7 let mut set: HashSet<String> = ["cat", "dog", "horse"]Á ü¼ø5 2 .iter().map(|&pet| pet.to_owned()).collect();Á öøú ìþø¾Ë ü ù) & for &pet in &["cat", "dog", "fish"] {Á üÎù1 . let value = set.get_or_insert_owned(pet);Á ü„ú assert_eq!(value, pet);Á ,¨ú¾¿ ü²ú: 7 assert_eq!(set.len(), 4); // a new "fish" was insertedÁ <ñúƒ»œ’û ¼ ½ ¼¥û ½¼í ¼ÅÖ ‹
|
|||
|
|
¢ ¡
|
|||
|
|
¡
|
|||
|
|
±û ‹
|
|||
|
|
ø™ ¦û Œ¨$âû �¨léû ²¼í ”ùû ¼í³ ÅÖL�ü
|
|||
|
|
|
|||
|
|
ÅÖÖûºÝ¼í$¶û»,¼ûbd ·þ
|
|||
|
|
ç¡ ¢
|
|||
|
|
€¢ ¢
|
|||
|
|
ž¢ ¢
|
|||
|
|
¢
|
|||
|
|
|
|||
|
|
¢
|
|||
|
|
ÅÖÖûºÝ¼í ÅÖ ¼í ü˜„� üìþJ G Inserts a value computed from `f` into the set if the given `value` isÁ ü»ÿB ? not present, then returns a reference to the value in the set.Á ‚€ú tŠ€Þº �€ú <¥€ƒ» ܱ€ÓŸ Ñ€ú üÙ€:¸³ ü˜�5ý³ Ò�ú ìÚ�¾Ë üü�)Ø´ üª‚? < let value = set.get_or_insert_with(pet, str::to_owned);Á üî‚ Èµ ,’ƒ¾¿ üœƒ:€¶ <Ûƒƒ» ”Ÿ„ ¿ À ¿¥û À¼í ²ã ¿ÅÖ ‹
|
|||
|
|
¢ ¤
|
|||
|
|
— ¥
|
|||
|
|
¤
|
|||
|
|
¥
|
|||
|
|
À„ ‹
|
|||
|
|
ø™ ²„ ßã ½„ Œ¨$÷„ �¨lþ„ ¾ –"²ã ¾¼í |˜… ¾ ²ã³¿˜" ÅÖ ¦…
|
|||
|
|
£
|
|||
|
|
ÅÖÖûºÝ¼í²ã$Å„»,Ë„± Ö„–˜ šœ Ó‡ £
|
|||
|
|
ç¡ ¦
|
|||
|
|
€¢ ¦
|
|||
|
|
ž¢ ¦
|
|||
|
|
¦
|
|||
|
|
£
|
|||
|
|
¦
|
|||
|
|
ÅÖÖûºÝ¼í²ã–º²ã¨ºü¤’7 ü€ˆT Q Gets the given value's corresponding entry in the set for in-place manipulation.Á Ùˆú táˆÞº ôˆú <üˆƒ» ܈‰ÓŸ ü¨‰& # use hashbrown::hash_set::Entry::*;Á Ó‰ú
|
|||
|
|
,î˜ ž™ ¨
|
|||
|
|
ç¡ ©
|
|||
|
|
€¢ ©
|
|||
|
|
ž¢ ©
|
|||
|
|
©
|
|||
|
|
¨
|
|||
|
|
©
|
|||
|
|
ÅÖÖûºÝ ÅÖ ¥û üÉ�- üÁ™5 2 Returns `true` if the set is a subset of another,Á üû™= : i.e., `other` contains at least all the values in `self`.Á ½šú tÅšÞº Øšú <àšƒ» ÜìšÓŸ Œ›ú ü”›: 7 let sup: HashSet<_> = [1, 2, 3].into_iter().collect();Á üÓ›!Öº ù›ú ü�œ* ' assert_eq!(set.is_subset(&sup), true);Á ”°œ”ß üÇœ*ßÔ ”öœ set.insert(4);Á ü��+ ( assert_eq!(set.is_subset(&sup), false);Á <½�ƒ»LÐ� Ä Å Ä¥û Å¥û ‹
|
|||
|
|
Ú� ‹
|
|||
|
|
|
|||
|
|
ª
|
|||
|
|
ÅÖÖûºÝ$Û�¹
|
|||
|
|
,á� ®ž ª
|
|||
|
|
ç¡ «
|
|||
|
|
€¢ «
|
|||
|
|
ž¢ «
|
|||
|
|
«
|
|||
|
|
ª
|
|||
|
|
«
|
|||
|
|
ÅÖÖûºÝûÒ‹Óü¶£/ üО7 4 Returns `true` if the set is a superset of another,Á üŒŸ= : i.e., `self` contains at least all the values in `other`.Á Οú tÖŸÞº éŸú <ñŸƒ» ÜýŸÓŸ � ú ü¥ 7 4 let sub: HashSet<_> = [1, 2].into_iter().collect();Á üá !Öº ‡¡ú ü�¡- * assert_eq!(set.is_superset(&sub), false);Á Á¡ú ”É¡ set.insert(0);Á ”à¡´å ü÷¡-µÚ ©¢ú ”±¢”ß üÈ¢, ) assert_eq!(set.is_superset(&sub), true);Á <ù¢ƒ» \½£ Æ Ç Æ¥û Ç¥û ‹
|
|||
|
|
É£ ‹
|
|||
|
|
|
|||
|
|
¬
|
|||
|
|
ÅÖÖûºÝ$Ê£¹
|
|||
|
|
,Уü†¨* 䑤 Adds a value to the set.Á ²¤ú üº¤C @ If the set did not have this value present, `true` is returned.Á ‚¥ú üŠ¥@ = If the set did have this value present, `false` is returned.Á Ï¥ú t×¥Þº ê¥ú <ò¥ƒ» Üþ¥ÓŸ ž¦ú ü¦¦!Öº ̦ú üÔ¦$ ! assert_eq!(set.insert(2), true);Á üý¦% " assert_eq!(set.insert(2), false);Á 짧 assert_eq!(set.len(), 1);Á <ɧƒ» 4�¨ È È¥ûÅÖ ‹
|
|||
|
|
”¨ ‹
|
|||
|
|
|
|||
|
|
|
|||
|
|
ÅÖÖûºÝ$™¨»,Ÿ¨üœ°9 üë¨S P Insert a value the set without checking if the value already exists in the set.Á éú üË©3 0 Returns a reference to the value just inserted.Á ƒªú ü‹ª@ = This operation is safe if a value does not exist in the set.Á Ъú üتO L However, if a value exists in the set already, the behavior is unspecified:Á ü¬«S P this operation may panic, loop forever, or any following operation with the setÁ ü„¬7ô¢ À¬ú üȬJã ô——¤ ºú üÂMͤ ä”®¤¥ µ®ú ü½®B ? This operation is useful during initial population of the set.Á ü„¯B ? For example, when constructing a set from another set, we knowÁ Ü˯ that values are unique.Á ¼£° É É¥ûÅÖ ÉÅÖ ‹
|
|||
|
|
»° ‹
|
|||
|
|
|
|||
|
|
®
|
|||
|
|
ÅÖÖûºÝ$À°»,Æ°üµµ0 ü™±] Z Adds a value to the set, replacing the existing value, if any, that is equal to the givenÁ üû±$ ! one. Returns the replaced value.Á ¤²ú t¬²Þº ¿²ú <Dzƒ» ÜÓ²ÓŸ ó²ú üû²!Öº ü¡³" set.insert(Vec::<i32>::new());Á ȳú üг8 5 assert_eq!(set.get(&[][..]).unwrap().capacity(), 0);Á ü�´( % set.replace(Vec::with_capacity(10));Á üº´9 6 assert_eq!(set.get(&[][..]).unwrap().capacity(), 10);Á <ø´ƒ» <¼µ Ê Ê¥ûÅÖì� ‹
|
|||
|
|
ĵ ‹
|
|||
|
|
|
|||
|
|
¯
|
|||
|
|
ÅÖÖûºÝ$ɵ»,ϵü¬½a üá·? < Removes a value from the set. Returns whether the value wasÁ ¼¥¸ present in the set.Á Á¸ú üɸCõ¢ ü‘¹Cô œÙ¹Ñ£ ñ¹ú tù¹Þº Œºú <”ºƒ» Ü ºÓŸ Àºú üȺ!Öº îºú ”öº”ß ü�»% " assert_eq!(set.remove(&2), true);Á ü·»& # assert_eq!(set.remove(&2), false);Á <⻃» î»ú üö»;©Ö ü¶¼@îÖ 4³½ Ë Ì Ë¥û Ì¼í ‹
|
|||
|
|
¢ ±
|
|||
|
|
±
|
|||
|
|
Ž ‹
|
|||
|
|
ø™ º½ Œ¨$ø½ �¨lÿ½
|
|||
|
|
°
|
|||
|
|
ÅÖÖûºÝ¼í$ʽ»,н=? ü‰Äd üȾU R Removes and returns the value in the set, if any, that is equal to the given one.Á ¢¿ú üª¿Cõ¢ üò¿Cô œºÀÑ£ ÒÀú tÚÀÞº íÀú <õÀƒ» Ü�ÁÓŸ ¡Áú ü©Á>ÜÄ üìÁ& # assert_eq!(set.take(&2), Some(2));Á ü—Â# assert_eq!(set.take(&2), None);Á <¿Âƒ» ËÂú üÓÂ;©Ö ü“Ã@îÖ $�Ä Í Î Í¥û μí ì� ‹
|
|||
|
|
¢ ³
|
|||
|
|
³
|
|||
|
|
Ä ‹
|
|||
|
|
ø™ •Ä Œ¨$ØÄ �¨lßÄ
|
|||
|
|
²
|