3229 lines
881 KiB
Plaintext
3229 lines
881 KiB
Plaintext
|
rust
|
|||
|
|
sÂ
|
|||
|
|
#rustc 1.96.0 (ac68faa20 2026-05-25)ÁíàÄTËŸ ÜJîÄ)'ß\¥! -3d1337db07d0b3aeÁ ¤²XctÔ'ÐÓ©z¨É½Ó -a4945860e1c53b00Á ¤°ð ¾ä-±($²ï=©Ã -7e98a21bfd32b0edÁÀ뉊 ]!ÜÛê(¹Þ—šên -5be7b69c3ff7b5b8Á –�òÖÀH•‘P IÓHã#£ -055f30b747f859b6Á rustc_std_workspace_coreÁCçß^ò½èÝ$Çÿ+Cé -c4878ee60b2242c9Á ŸÃï+Ñ]ŠqB<ÏïW# -8dd1dd90e70d0b6aÁ miniz_oxideÁ€š»J(P>àö÷g\K -1eb618da2918ab7fÁ adler2ÁÆ;+Þ®5¥ÌýÝ°¦ÛLˆ -f7919172d268e069Á hashbrownÁPäV9ÒÆèÜ�"ÊÖVŽ\ -0fc2184a5da6723aÁ rustc_std_workspace_allocÁs&ØòØy¯s•bæ!‰ýŠ -97e4bf30be240674Á
|
|||
|
|
std_detectÁhŠBîÙºÌI®Ë�Å�š -9dbbf8346ba7ac8bÁ rustc_demangleÁûë9´Ç×@Œ�’ùXFº -f33013f239bf9f14Á cfg_ifÁÜLh�ž§Œaã¯>� -0a71c8f33a838301Á addr2lineÁ׎Þ!]8V$É@@T· -e618e6be60e87ba2Á gimliÁ¸
|
|||
|
|
°µ~Î1‹Ñt ðÁ€w -1f7768a68858f670Á objectÁ
|
|||
|
|
áPÃ?À¶¼QHJ¥� -914cd6a4dbe590d1Á memchrÁ›º«8Ór2Ù $¨ûib‚ -cf21ca6f2bb15dcdÁë
|
|||
|
|
‹ás «LÖ€îâƒ×ɯŒ -ee6f3747e38367f0ÁÐ2Ïs/<Ñ�ƒótà“ -a971313051c2b5a1Á
|
|||
|
|
equivalentÁ˜úôa ,t ùƳJ8®ød -293c030140ba1879Á impl_arbitraryÁtW » arbitraryÁ¬ impl_quickcheckÁ|‚ »
|
|||
|
|
quickcheckÁ´¯ ê parallel_iterator_methodsÁÌ�/» rayonÁŒì.ê !indexed_parallel_iterator_methodsÁü“6!»¡ Œò5 borshÁ,¾$»é Œ¦$ serdeÁ,ã$»„
|
|||
|
|
ŒË$ svalÁ$‡%»Ÿ
|
|||
|
|
„ð$ÿ testsÁ,›�‚ $��‚ serde_seqÁLž»„
|
|||
|
|
ŒÑ‚º
|
|||
|
|
,»‚ $°‚¡ ,ü»¡ ŒË‚ IndexMapÁD‹»À|íŒì²º
|
|||
|
|
,íS‚ $âSÈ º
|
|||
|
|
,c‚ $XÈ ¡ ,þ»¡ ŒÍÈ IndexSetÁD¹»À|›Œš ¡ ,Ã&»¡ Œ«& í ¤ À º innerÁ entryÁ
|
|||
|
|
'aÁ œ § æ
|
|||
|
|
OccupiedEntryÁ §
|
|||
|
|
œ § Ø Ö bucketÁ §
|
|||
|
|
œ § from_hashÁ #— # into_coreÁ
|
|||
|
|
get_bucketÁ get_bucket_mutÁ into_bucketÁ Ö keyÁ getÁ get_mutÁ into_mutÁ insertÁ removeÁ swap_removeÁ shift_removeÁ remove_entryÁ swap_remove_entryÁ shift_remove_entryÁ remove_indexÁ
|
|||
|
|
move_indexÁ swap_indicesÁ 8 update_indexÁ ;§
|
|||
|
|
;œ ;§ ;÷ ? VacantEntryÁ A§
|
|||
|
|
Aœ A§ AØ A§ AŒ H§
|
|||
|
|
Hœ H§ HÖ HŒ H key_mutÁ H into_keyÁ H½ H insert_entryÁ H
|
|||
|
|
insert_sortedÁ H insert_sorted_byÁ S— S H insert_sorted_by_keyÁ V“ V— H shift_insertÁ H
|
|||
|
|
replace_indexÁ Z extractÁ \ \\\\\ bœ b§ bÖ e£ \ ExtractCoreÁ g§
|
|||
|
|
gœ g§ gØ g new_lenÁ g currentÁ gþ \oœ o§ oã \sœ s§ s
|
|||
|
|
extract_ifÁ v— s remainingÁ
|
|||
|
|
IndicesÁ EntriesÁ †œ †§
|
|||
|
|
CoreÁ �œ �§ � indicesÁ � entriesÁ get_hashÁ ’œ ’§ ’ ’ í —§
|
|||
|
|
—œ —§ —¢ — — erase_indexÁ ž û insert_bulk_no_growÁ ¢œ ¢§ ¢ ¦œ ¦§ ¦ƒ ¦† «œ «§ « MAX_ENTRIES_CAPACITYÁ «æ «
|
|||
|
|
with_capacityÁ « into_entriesÁ «
|
|||
|
|
as_entriesÁ « as_entries_mutÁ « with_entriesÁ ´— «‘ « capacityÁ « clearÁ « truncateÁ « drainÁ º£ « split_offÁ « split_spliceÁ ½£ « append_uncheckedÁ « reserveÁ «
|
|||
|
|
reserve_exactÁ « try_reserveÁ « try_reserve_entriesÁ « try_reserve_exactÁ « shrink_toÁ « popÁ « get_index_ofÁ Ç¢ « get_index_of_rawÁ É— É «
|
|||
|
|
push_entryÁ « insert_fullÁ « replace_fullÁ « shift_remove_fullÁ Ï¢ « swap_remove_fullÁ Ñ¢ «
|
|||
|
|
erase_indicesÁ Ó « retain_in_orderÁ Õ— Õ « rebuild_hash_tableÁ « reverseÁ « reserve_entriesÁ «
|
|||
|
|
insert_uniqueÁ « replace_index_uniqueÁ « shift_insert_uniqueÁ Ý « shift_remove_indexÁ « shift_remove_finishÁ « swap_remove_indexÁ « swap_remove_finishÁ « decrement_indicesÁ « increment_indicesÁ «Ó å « move_index_innerÁ «ä è macrosÁ ê indexmap_with_defaultÁ ê indexmapÁ ê indexset_with_defaultÁ ê indexsetÁ ê iterator_methodsÁ ê double_ended_iterator_methodsÁ utilÁ ñ ññññ thirdÁ ö’ ö“ ö” ñ simplify_rangeÁ ú£ ñ try_simplify_rangeÁ ü£ ñ slice_eqÁ þ¥ þ¦ þ impl Fn(&T, &U) -> boolÁ Ø ‚ë ƒ ƒƒƒƒƒƒƒƒ EntryÁ Œ§
|
|||
|
|
Œœ Œ§ Œ OccupiedÁ �
|
|||
|
|
�ˆ Œ VacantÁ “
|
|||
|
|
“ˆ ƒ –§
|
|||
|
|
–œ –§ –Ö –¹ – or_insertÁ – or_insert_withÁ �— – or_insert_with_keyÁ Ÿ— –Œ –
|
|||
|
|
and_modifyÁ ¢— –
|
|||
|
|
or_defaultÁ ƒ¥œ ¥§ ¥× ƒ©œ ©§ ©× ƒœ § × ƒ IndexedEntryÁ ±§
|
|||
|
|
±œ ±§ ±Ø ±Ö ƒ·§
|
|||
|
|
·œ ·§ ·æ ·Ö ·½ ·Í ·Þ ·ó ·Œ ·• ·– · ·½ ·® ·� ·§ ·× ·é ·Ó ·ä ƒÍœ ͧ Í× ƒÑ§
|
|||
|
|
Ñœ ѧ Ñ÷ ‚ù Ö ÖÖÖÖÖÖÖÖÖ Ö
|
|||
|
|
Ö Ö Ö
|
|||
|
|
ÖÖÖÖÖÖÖÖ ì§
|
|||
|
|
ìœ ì§ ì¤ ì› ì IntoIterÁ ìê Öô§
|
|||
|
|
ôœ ô§ ô¤ ô› ô�* ôê Öüœ ü§ ü¤ ü› ü�* üê Ö IterÁ ƒ§
|
|||
|
|
ƒœ ƒ§ ƒù Öˆ§
|
|||
|
|
ˆœ ˆ§ ˆæ ˆ as_sliceÁ ÖŽ§
|
|||
|
|
Žœ Ž§ Ž› Ö“œ “§ Ö–œ –§ –‘ Öšœ š§ Ö�œ �§ �ƒ Ö ¡œ ¡§ ¡× Ö
|
|||
|
|
¥œ ¥§ ¥> Ö IterMutÁ ©§
|
|||
|
|
©œ ©§ ©ù Ö ®§
|
|||
|
|
®œ ®§ ®æ ®ë+ ®
|
|||
|
|
into_sliceÁ Ö µ§
|
|||
|
|
µœ µ§ µ› Ö
|
|||
|
|
ºœ º§ Ö½œ ½§ ½‘ ÖÁœ Á§ ÖÄœ ħ Ä× ÖÈœ ȧ È> Ö IterMut2Á ̧
|
|||
|
|
Ìœ ̧ Ìù Öѧ
|
|||
|
|
Ñœ ѧ Ñæ Ñë+ Ñ™. Öا
|
|||
|
|
Øœ ا Ø› ÖÝœ ݧ Öàœ à§ à‘ Öäœ ä§ Öçœ ç§ ç× Öëœ ë§ ë> Öïœ ï§ ïæ ïë+ ï as_mut_sliceÁ Öõœ õ§ õ› Öùœ ù§ Ö üœ ü§ ü‘ Ö €œ €§ Ö ƒœ ƒ§ ƒ× Ö ‡œ ‡§ ‡> Ö DrainÁ ‹§
|
|||
|
|
‹œ ‹§ ‹ù Ö �§
|
|||
|
|
�œ �§ �æ �ë+ Ö!–œ –§ –› Ö"šœ š§ Ö#�œ �§ �‘ Ö$¡œ ¡§ Ö%¤œ ¤§ ¤× Ö KeysÁ ¨§
|
|||
|
|
¨œ ¨§ ¨ù Ö&§
|
|||
|
|
œ § æ Ö'²§
|
|||
|
|
²œ ²§ ²› Ö(·œ ·§ Ö)ºœ º§ º‘ Ö*¾œ ¾§ Ö+Áœ Á§ Áƒ Ö,Åœ ŧ Å× Ö-Éœ ɧ É> Ö.Íœ ͧ Í° ÍÖ Ö IntoKeysÁ Òœ Ò§ Òù Ö/Öœ Ö§ Öæ Ù Ö0Ûœ Û§ Ûƒ Þ Ö1àœ à§ à› Ö2äœ ä§ Ö3çœ ç§ ç‘ Ö4ëœ ë§ Ö5îœ î§ î× Ö6òœ ò§ ò> Ö ValuesÁ ö§
|
|||
|
|
öœ ö§ öù Ö7û§
|
|||
|
|
ûœ û§ ûæ Ö8€§
|
|||
|
|
€œ €§ €› Ö9…œ …§ Ö:ˆœ ˆ§ ˆ‘ Ö;Œœ Œ§ Ö<�œ �§ �ƒ Ö=“œ “§ “× Ö>—œ —§ —> Ö ValuesMutÁ ›§
|
|||
|
|
›œ ›§ ›ù Ö? §
|
|||
|
|
œ § æ Ö@¥§
|
|||
|
|
¥œ ¥§ ¥› ÖAªœ ª§ ÖBœ § ‘ ÖC±œ ±§ ÖD´œ ´§ ´× ÖE¸œ ¸§ ¸> Ö
|
|||
|
|
IntoValuesÁ ¼œ ¼§ ¼ù ÖFÀœ À§ Àæ à ÖGÅœ ŧ Ń È ÖHÊœ ʧ Ê› ÖIÎœ Χ ÖJÑœ ѧ Ñ‘ ÖKÕœ Õ§ ÖLØœ ا Ø× ÖMÜœ ܧ Ü> Ö SpliceÁ à§
|
|||
|
|
àš àœ à§ à¤ àØ à tailÁ àŒ à replace_withÁ ÖNê§
|
|||
|
|
êš êœ ê§ ê¤ êæ ð£ ÖOòš òœ ò§ ò¤ òã ÖPøš øœ ø§ ø¤ ø› øó ø size_hintÁ ÖQ€š €œ €§ €¤ € next_backÁ ÖR†š †œ †§ †¤ †‘ ÖSŒš Œœ Œ§ Œ¤ ÖT‘š ‘œ ‘§ ‘¤ ‘× Ö ExtractIfÁ —§
|
|||
|
|
—œ —§ —— —ß — predÁ ÖUžœ ž§ ž— žæ ¢£ ÖV¤œ ¤§ ¤— ¤› ¤ó © ¤ìA ÖW¬œ ¬§ ¬— ÖX°œ °§ °— °× ‚Ê µ µµµµµµµµµ µ
|
|||
|
|
µ µ MutableKeysÁ Â KeyÁ Â ValueÁ Â
|
|||
|
|
get_full_mut2Á Å¢  get_index_mut2Á  iter_mut2Á  retain2Á É— µ Ëœ ˧ ˤ Ë÷E Ë‚F Ë�F Ñ¢ ˬF ËÂF ËÓF Õ— µ MutableEntryKeyÁ ×÷E ו µÚœ Ú§ Ú÷E Ú• µßœ ߧ ß÷E ß• µäœ ä§ ä÷E ä• µéœ é§ é÷E é• µ SealedÁ µïœ ï§ ï¤ µóœ ó§ µöœ ö§ µùœ ù§ µ üœ ü§ ‚ž ÿ ÿÿÿÿÿÿÿÿÿ ÿ
|
|||
|
|
ÿ ÿ ÿ
|
|||
|
|
ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÙ œœ œ§ œÓ ÿ œ §
|
|||
|
|
from_sliceÁ from_mut_sliceÁ
|
|||
|
|
from_boxedÁ
|
|||
|
|
into_boxedÁ ÿ§œ §§ §ÿ §æ «§
|
|||
|
|
§ new_mutÁ §
|
|||
|
|
§‘ § is_emptyÁ § get_indexÁ §
|
|||
|
|
get_index_mutÁ § get_rangeÁ ³£ §
|
|||
|
|
get_range_mutÁ µ£ § firstÁ § first_mutÁ §‹ § last_mutÁ § split_atÁ § split_at_mutÁ § split_at_checkedÁ § split_at_mut_checkedÁ § split_firstÁ § split_first_mutÁ §
|
|||
|
|
split_lastÁ § split_last_mutÁ §ù §ú § keysÁ § into_keysÁ §¼ §
|
|||
|
|
values_mutÁ § into_valuesÁ § binary_search_keysÁ Ê § binary_search_byÁ ̧
|
|||
|
|
Ì— Ì § binary_search_by_keyÁ Ч
|
|||
|
|
Г З Ð § is_sortedÁ Õ § is_sorted_byÁ ק
|
|||
|
|
×— × § is_sorted_by_keyÁ Û§
|
|||
|
|
Û— Û¥ Û § partition_pointÁ à¡ à § get_disjoint_mutÁ 㟠ã ã § get_disjoint_opt_mutÁ çŸ ç ç ç ÿì§
|
|||
|
|
ìœ ì§ ì�* ì› ìê ÿó§
|
|||
|
|
óœ ó§ ó�* ó› óê ÿúœ ú§ ú�* ú› úê ÿ€œ €§ €> ÿ„œ „§ „> ÿˆœ ˆ§ ˆ> ÿŒœ Œ§ Œƒ ÿ �œ �§ �÷ ÿ
|
|||
|
|
”œ ”§ ”× ÿ ˜œ ˜§ ˜ K2Á ˜ V2Á ˜� � ÿ Ÿœ Ÿ§ ŸÙU ŸãU Ÿ� ¤ ÿ
|
|||
|
|
¦œ ¦§ ¦ÙU ¦ãU ¦� « ÿœ § ÙU ãU Ÿ � ´ ÿ¶œ ¶§ ¶Ÿ ¶ÙU ¶ãU ¶ ¶� ÿ¾œ ¾§ ÿÁœ Á§ Áï
|
|||
|
|
ÿÅœ ŧ Å‹ ÿÉœ ɧ ɧ Ì™ ÿÎœ Χ ΰ ÎÖ ÿÓœ Ó§ Ó× ÿ
|
|||
|
|
impl_indexÁ ‚ raw_entry_v1Á Ø ØØØØØØØØØ Ø
|
|||
|
|
Ø Ø Ø
|
|||
|
|
RawEntryApiV1Á æœ æ§ æ¤ æŸY æ raw_entry_mut_v1Á Ø ìœ ì§ ì¤ ìŸY ì©Z Ø RawEntryBuilderÁ ò§
|
|||
|
|
òœ ò§ ò¤ òØ Øøœ ø§ ø¤ ø× Øý§
|
|||
|
|
ýœ ý§ ý¤ ý from_keyÁ ‚ ¢ ý from_key_hashed_nocheckÁ „ ¢ ý¢ † — ý from_hash_fullÁ ˆ — ý index_from_hashÁ Š — Ø RawEntryBuilderMutÁ Œ §
|
|||
|
|
Œ œ Œ § Œ ¤ Œ Ø Ø’ œ ’ § ’ ¤ ’ × Ø— §
|
|||
|
|
— œ — § — ¤ — ÷[ œ ¢ — �\ ž ¢ ž — ¢ ¡ — Ø RawEntryMutÁ £ §
|
|||
|
|
£ œ £ § £ ¤ £ †$ ¨
|
|||
|
|
¨ ˆ £ £$ «
|
|||
|
|
« ˆ Ø® œ ® § ® ¤ ® × Ø³ §
|
|||
|
|
³ œ ³ § ³ ¤ ³ Ö ³ ë$ ³ ü$ º — ³ Ä% ¼ — Ø RawOccupiedEntryMutÁ ¾ §
|
|||
|
|
¾ œ ¾ § ¾ ¤ ¾ ß ¾ hash_builderÁ ØÅ œ Å § Å ¤ Å × ØÊ §
|
|||
|
|
Ê œ Ê § Ê ¤ Ê Ö Ê Œ Ê • Ê £ Ê – Ê Ê ® Ê
|
|||
|
|
get_key_valueÁ Ê get_key_value_mutÁ Ê into_key_value_mutÁ Ê ½ Ê
|
|||
|
|
insert_keyÁ Ê Ê Ê × Ê é Ê ü Ê � Ê § Ê Ó Ê ä Ø RawVacantEntryMutÁ ã §
|
|||
|
|
ã œ ã § ã ¤ ã Ø ã Þ` Ø ê œ ê § ê ¤ ê × Ø
|
|||
|
|
ï §
|
|||
|
|
ï œ ï § ï ¤ ï Ö ï ½ ï insert_hashed_nocheckÁ ï « ï shift_insert_hashed_nocheckÁ Ø‚I Ø ú œ ú § ú ¤ ‚ ‚‚‚‚‚‚‚‚‚ ‚
|
|||
|
|
‚ ‚ ‚
|
|||
|
|
‚‚‚‚‚‚‚‚‚‚‚‚‚‚‚ ‚ ‚ ‚ ‚ ‚!‚"‚#‚$‚%‚&‚'‚(‚)‚*‚+‚,‚-‚ ¬
|
|||
|
|
œ ¬
|
|||
|
|
§ ¬
|
|||
|
|
¤ ¬
|
|||
|
|
í ¬
|
|||
|
|
Þ` ‚ ²
|
|||
|
|
œ ²
|
|||
|
|
§ ²
|
|||
|
|
¤ ²
|
|||
|
|
ƒ ²
|
|||
|
|
† ‚¸
|
|||
|
|
œ ¸
|
|||
|
|
§ ¸
|
|||
|
|
¤ ¸
|
|||
|
|
× ‚½
|
|||
|
|
œ ½
|
|||
|
|
§ ½
|
|||
|
|
æ ½
|
|||
|
|
ê ‚Â
|
|||
|
|
œ Â
|
|||
|
|
§ Â
|
|||
|
|
¤ Â
|
|||
|
|
with_capacity_and_hasherÁ Â
|
|||
|
|
with_hasherÁ Â
|
|||
|
|
ÿ Â
|
|||
|
|
“ Â
|
|||
|
|
¥ Â
|
|||
|
|
» Ë
|
|||
|
|
— Â
|
|||
|
|
ß Â
|
|||
|
|
hasherÁ Â
|
|||
|
|
‘ Â
|
|||
|
|
âL Â
|
|||
|
|
ù Â
|
|||
|
|
ú Â
|
|||
|
|
¾O Â
|
|||
|
|
ÊO Â
|
|||
|
|
¼ Â
|
|||
|
|
ãO Â
|
|||
|
|
õO Â
|
|||
|
|
ï Â
|
|||
|
|
ü Â
|
|||
|
|
Œ Ú
|
|||
|
|
£ Â
|
|||
|
|
” Ü
|
|||
|
|
— Ü
|
|||
|
|
£ Â
|
|||
|
|
¡ Â
|
|||
|
|
æ Â
|
|||
|
|
õ Â
|
|||
|
|
Š Â
|
|||
|
|
¸ Â
|
|||
|
|
|
|||
|
|
shrink_to_fitÁ Â
|
|||
|
|
Ñ ‚æ
|
|||
|
|
œ æ
|
|||
|
|
§ æ
|
|||
|
|
¤ æ
|
|||
|
|
½ æ
|
|||
|
|
À æ
|
|||
|
|
Ì æ
|
|||
|
|
à í
|
|||
|
|
— í
|
|||
|
|
æ
|
|||
|
|
‚ ð
|
|||
|
|
“ ð
|
|||
|
|
— æ
|
|||
|
|
|
|||
|
|
insert_beforeÁ æ
|
|||
|
|
« æ
|
|||
|
|
¾ æ
|
|||
|
|
ë æ
|
|||
|
|
spliceÁ ÷
|
|||
|
|
£ ÷
|
|||
|
|
š æ
|
|||
|
|
appendÁ ú
|
|||
|
|
S2Á ‚ü
|
|||
|
|
œ ü
|
|||
|
|
§ ü
|
|||
|
|
¤ ü
|
|||
|
|
§ € ¢ ü
|
|||
|
|
contains_keyÁ ‚ ¢ ü
|
|||
|
|
– „ ¢ ü
|
|||
|
|
ôa † ¢ ü
|
|||
|
|
get_fullÁ ˆ ¢ ü
|
|||
|
|
í Š ¢ ü
|
|||
|
|
Œ ¢ ü
|
|||
|
|
‰b Ž ¢ ü
|
|||
|
|
get_full_mutÁ � ¢ ü
|
|||
|
|
¥R ’ ¢ ’ Ÿ ’ ’ ’ ’ ˜ ü
|
|||
|
|
Ê š ¢ ü
|
|||
|
|
ü œ ¢ ü
|
|||
|
|
× ž ¢ ü
|
|||
|
|
� ¢ ü
|
|||
|
|
ˆ ¢ ¢ ü
|
|||
|
|
é ¤ ¢ ü
|
|||
|
|
§ ¦ ¢ ü
|
|||
|
|
ç ¨ ¢ ‚ª œ ª § ª ¤ ª â ª pop_ifÁ ¯ impl FnOnce(&K, &mut V) -> boolÁ ª retainÁ ± — ± ª sort_keysÁ ´ µ ª sort_byÁ · — · ¹ ª sorted_byÁ » — » ª sort_by_keyÁ ¾ ¥ ¾ — ¾ Á ª sort_unstable_keysÁ Ã Ä ª sort_unstable_byÁ Æ — Æ È ª sorted_unstable_byÁ Ê — Ê ª sort_unstable_by_keyÁ Í ¥ Í — Í Ð ª sort_by_cached_keyÁ Ò ¥ Ò — Ò Õ ª ˆP ª §P Ø §
|
|||
|
|
Ø — ª ÔP Û §
|
|||
|
|
Û “ Û — ª �Q ª £Q à §
|
|||
|
|
à — ª ÌQ ã §
|
|||
|
|
ã — ã ¥ ª �R ç ¡ ª € ª ë+ ª ÿ1 ª into_boxed_sliceÁ ª òL ª ƒM ª get_index_entryÁ ª get_disjoint_indices_mutÁ ð Ÿ ð ð ª ˜M ô £ ª ±M ö £ ª ÎM ª ÛM ª first_entryÁ ª ‹ ª ôM ª
|
|||
|
|
last_entryÁ ª ¬ ª ÷ ª Ó ª ä ‚‚ œ ‚ § ‚ ¢ ‚ ¤ ‚ ° ‚ Ö ‚‰ œ ‰ § ‰ ¢ ‰ ¤ ‰ × ‚ � œ � § � ¤ � ° � Ö ‚
|
|||
|
|
• œ • § • ¤ • × ‚ š œ š § š ¤ š ù ž š ‚ œ § Ÿ ÷ ¥ ‚
|
|||
|
|
§ œ § § § ¤ § extendÁ « š « ‚® §
|
|||
|
|
® œ ® § ® ¤ ® ïx ³ š ³ ‚¶ œ ¶ § ¶ ¤ ¶ > ‚» œ » V1Á » S1Á » ãU » Ál » � Á  ‚Ä œ Ä § Ä ¤ setÁ È ù É É É É É É É É É É É
|
|||
|
|
É É É
|
|||
|
|
É É É É É É Ý §
|
|||
|
|
Ý ¥ Ý ¤ Ý › Ý �* Ý ê É ä ¥ ä ¤ ä › ä �* ä ê É š+ ê §
|
|||
|
|
ê ¥ ê ù É î §
|
|||
|
|
î ¥ î æ î ë+ É ó §
|
|||
|
|
ó ¥ ó › É ÷ ¥ É ù ¥ ù ‘ É ü ¥ É þ ¥ þ ƒ É �
|
|||
|
|
¥ �
|
|||
|
|
× É „
|
|||
|
|
¥ „
|
|||
|
|
> É
|
|||
|
|
‡
|
|||
|
|
¥ ‡
|
|||
|
|
æ ‡
|
|||
|
|
ë+ É ‹
|
|||
|
|
¥ ‹
|
|||
|
|
› É Ž
|
|||
|
|
¥ É
|
|||
|
|
�
|
|||
|
|
¥ �
|
|||
|
|
‘ É “
|
|||
|
|
¥ É •
|
|||
|
|
¥ •
|
|||
|
|
× É ˜
|
|||
|
|
¥ ˜
|
|||
|
|
> É °3 ›
|
|||
|
|
§
|
|||
|
|
›
|
|||
|
|
¥ ›
|
|||
|
|
ù É Ÿ
|
|||
|
|
§
|
|||
|
|
Ÿ
|
|||
|
|
¥ Ÿ
|
|||
|
|
æ Ÿ
|
|||
|
|
ë+ É ¤
|
|||
|
|
¥ ¤
|
|||
|
|
› É §
|
|||
|
|
¥ É ©
|
|||
|
|
¥ ©
|
|||
|
|
‘ É ¬
|
|||
|
|
¥ É ®
|
|||
|
|
¥ ®
|
|||
|
|
× É
|
|||
|
|
DifferenceÁ ±
|
|||
|
|
§
|
|||
|
|
±
|
|||
|
|
¥ ±
|
|||
|
|
¤ ±
|
|||
|
|
ù ±
|
|||
|
|
¹
|
|||
|
|
É ·
|
|||
|
|
§
|
|||
|
|
·
|
|||
|
|
¥ ·
|
|||
|
|
¤ ·
|
|||
|
|
æ »
|
|||
|
|
ÿy É ½
|
|||
|
|
§
|
|||
|
|
½
|
|||
|
|
¥ ½
|
|||
|
|
¤ ½
|
|||
|
|
› ½
|
|||
|
|
ó ½
|
|||
|
|
ìA É Ä
|
|||
|
|
¥ Ä
|
|||
|
|
¤ Ä
|
|||
|
|
¢B É È
|
|||
|
|
¥ È
|
|||
|
|
¤ É Ë
|
|||
|
|
¥ Ë
|
|||
|
|
¤ Ë
|
|||
|
|
ƒ É Ï
|
|||
|
|
¥ Ï
|
|||
|
|
¤ Ï
|
|||
|
|
× É IntersectionÁ Ó
|
|||
|
|
§
|
|||
|
|
Ó
|
|||
|
|
¥ Ó
|
|||
|
|
¤ Ó
|
|||
|
|
ù Ó
|
|||
|
|
¹
|
|||
|
|
É Ù
|
|||
|
|
§
|
|||
|
|
Ù
|
|||
|
|
¥ Ù
|
|||
|
|
¤ Ù
|
|||
|
|
æ Ý
|
|||
|
|
ÿy É ß
|
|||
|
|
§
|
|||
|
|
ß
|
|||
|
|
¥ ß
|
|||
|
|
¤ ß
|
|||
|
|
› ß
|
|||
|
|
ó ß
|
|||
|
|
ìA É æ
|
|||
|
|
¥ æ
|
|||
|
|
¤ æ
|
|||
|
|
¢B É ê
|
|||
|
|
¥ ê
|
|||
|
|
¤ É !í
|
|||
|
|
¥ í
|
|||
|
|
¤ í
|
|||
|
|
ƒ É "ñ
|
|||
|
|
¥ ñ
|
|||
|
|
¤ ñ
|
|||
|
|
× É SymmetricDifferenceÁ õ
|
|||
|
|
§
|
|||
|
|
õ
|
|||
|
|
¥ õ
|
|||
|
|
ÿy õ
|
|||
|
|
Ál õ
|
|||
|
|
ù É #û
|
|||
|
|
§
|
|||
|
|
û
|
|||
|
|
¥ û
|
|||
|
|
ÿy û
|
|||
|
|
Ál û
|
|||
|
|
æ É $�§
|
|||
|
|
�¥ �ÿy �Ál �› �ó �ìA � foldÁ ‰“ ‰— É %Œ¥ Œÿy ŒÁl Œ¢B Œ rfoldÁ ‘“ ‘— É &”¥ ”ÿy ”Ál É '˜¥ ˜ÿy ˜Ál ˜ƒ É (�¥ �ÿy �Ál �× É ô ¢§
|
|||
|
|
¢¥ ¢¤ ¢ù É )§§
|
|||
|
|
§¥ §¤ §æ «Ál É *§
|
|||
|
|
¥ ¤ › ó ìA Ñ… ´“ ´— É +·¥ ·¤ ·¢B ·’† »“ »— É ,¾¥ ¾¤ É -Á¥ Á¤ Áƒ É .Å¥ Ť Å× É ç? ɧ
|
|||
|
|
Éš É¥ ɤ Éù É /ϧ
|
|||
|
|
Ïš Ï¥ Ϥ Ïæ Ô£ É 0Öš Ö¥ Ö¤ Ö› Öó ÖìA É 1Ýš Ý¥ ݤ Ý¢B É 2âš â¥ â¤ â‘ É 3çš ç¥ ç¤ É UnitValueÁ ë
|
|||
|
|
ëš ëˆ É 4ïš ï› ïó ò É 5ôš ô¥ ô¤ ô× É 6ùš ù× É ²C ü§
|
|||
|
|
ü¥ ü— üß üëC É 7‚¥ ‚— ‚æ …£ É 8‡¥ ‡— ‡› ‡ó ‹ ‡ìA É 9Ž¥ Ž— É :‘¥ ‘— ‘× È Ê • •••••••
|
|||
|
|
MutableValuesÁ �‚F ��F Ÿ¢ �¬F �ÓF ¢— • ¤¥ ¤¤ ¤‚F ¤�F ¨¢ ¤¬F ¤ÓF «— « •‚I •¯¥ ¯¤ È ž ² ²²²²²²²²² ²
|
|||
|
|
² ² ²
|
|||
|
|
²²²²²²²Ù Ç¥ ÇÓ ² Ê¥ ÊÊK ÊòK Ê„L ²Ï¥ Ïÿ Ïæ Ò§
|
|||
|
|
Ï‘ ÏâL ÏòL ϘM ×£ ÏÎM Ï‹ Ï„N ϨN ÏÜN φO Ïù Ï
|
|||
|
|
binary_searchÁ à ϧP â§
|
|||
|
|
â— â ÏÔP æ§
|
|||
|
|
æ“ æ— æ Ï�Q ë Ï£Q í§
|
|||
|
|
í— í ÏÌQ ñ§
|
|||
|
|
ñ— ñœ ñ Ï�R ö¡ ö ²ù§
|
|||
|
|
ù¥ ù�* ù› ùê ²ÿ¥ ÿ�* ÿ› ÿê ²„¥ „> ²‡¥ ‡> ²Š¥ Šƒ ²�¥ �÷ ²�¥ �× ² “¥ “¦ “� – ²
|
|||
|
|
˜¥ ˜¦ ˜� › ² �¥ �¦ �� ² ¢¥ ¢¦ ¢Ÿ ¢ ¢� § ²
|
|||
|
|
©¥ ©Ÿ ©¦ © ©� ²¯¥ ²±¥ ±ï
|
|||
|
|
²´¥ ´‹ ²·¥ ·§ ¹™ ²»¥ »° »Ö ²�Y È È È È È È È È È È È
|
|||
|
|
È È È
|
|||
|
|
È È È È È È È È È È È È È È È È È È È BucketÁ à¥ È � ⥠⤠âØ È æ¥ æ¤ æƒ æ† È ë¥ ë¤ ë× È ï¥ ïæ ïê È ó¥ ó¤ óÐh óðh óÿ ó“ ó» ú— óß ó³i ó‘ óâL óù óï óü óŒ ƒ£ ó” …— …£ ó¡ óæ óõ óŠ ó¸ óéj óÑ È �¥ �¤ �½ �À �Ì �à •— • �‚ ˜“ ˜— ˜ �èk �« � replaceÁ �Ó �¾ �
|
|||
|
|
differenceÁ ¡§
|
|||
|
|
¡Ál � symmetric_differenceÁ ¤§
|
|||
|
|
¤Ál � intersectionÁ §§
|
|||
|
|
§Ál �C ª§
|
|||
|
|
ªÁl �•l £ š �³l °Ál È ²¥ ²¤ ² containsÁ µ¢ ²– ·¢ · ²´m º¢ º ²í ½¢ ²Ê ¿¢ ²× Á¢ ²é â ² takeÁ Å¢ ² swap_takeÁ Ç¢ Ç ²
|
|||
|
|
shift_takeÁ Ê¢ Ê ²ˆ Í¢ Í ²ç Т Ð È Ó¥ Ó¤ Óâ Ö Óîo Ø impl FnOnce(&T) -> boolÁ Ó£p Ú— Ú Ó sortÁ ÓÙp Þ— Þ Óúp á— á Ó˜q äœ ä— ä ç Ó
|
|||
|
|
sort_unstableÁ Óéq ê— ê Ó“r í— í Óºr ðœ ð— ð ó Óðr õœ õ— õ ø Óÿ‘ Ó§P û§
|
|||
|
|
û— ÓÔP þ§
|
|||
|
|
þ“ þ— Ó�Q Ó£Q ƒ§
|
|||
|
|
ƒ— ÓÌQ †§
|
|||
|
|
†— †œ Ó�R Š¡ Ó€ Óë+ ÓÌt ÓòL Ó˜M �£ ÓÎM Ó‹ Ó¬ ” Ó÷ – ÓÓ Óä È š¥ š¤ š° šÖ È Ÿ¥ Ÿ¤ Ÿù ¢š ¢ È ¥¥ ¥Ÿ ¥ ¥÷ © È
|
|||
|
|
«¥ «¤ «ïx ®š ® È ±§
|
|||
|
|
±¥ ±¤ ±ïx µš È ·¥ ·¤ ·> È
|
|||
|
|
»¥ »ÿy »Ál »� È À¥ À¤ È Ã¥ ä à is_disjointÁ ÆÁl Æ Æ Ã is_subsetÁ ÊÁl Ê Ã is_supersetÁ ÍÁl È Ï¥ Ïÿy ÏÁl Ï° ϯ È Õ¥ Õÿy ÕÁl Õ° Õ± È Û¥ Ûÿy ÛÁl Û° Ûµ È á¥ áÿy áÁl á° áÚ ê– ìœ ì§ ìƒ ì† ñœ ñ§ ñ key_refÁ ñ value_refÁ ñ value_mutÁ ñŒ ñ» ñ key_valueÁ ñ refsÁ ñ ref_mutÁ ñ mutsÁ ý
|
|||
|
|
from_allocÁ ý from_hashbrownÁ €× ƒ× Žó ŽìA Žü Ž nthÁ Ž‹ Ž collectÁ ‹” “¢B “ nth_backÁ µó µìA µü µ¾« µ‹ µÑ« ”” º¢B ºð« Øó ØìA Øü ؾ« Ø‹ ØÑ« �” Ý¢B Ýð« Ö�* ¡œ ¡§ ¡ù ÖY¥œ ¥§ ¥ƒ õó õìA õü õ¾« õ‹ õÑ« ®” ù¢B ùð« –ó –ìA –ü –¾« –‹ –Ñ« ·” š¢B šð« ²ó ²ìA ²ü ²¾« ²‹ ²Ñ« À” ·¢B ·ð« àó àìA àü ྫ à‹ àÑ« É” ä¢B äð« €ó €ìA €ü €¾« €‹ €Ñ« Ò” …¢B …ð« ¥ó ¥ìA ¥ü ¥¾« ¥‹ ¥Ñ« Û” ª¢B ªð« Êó ÊìA Êü ʾ« Ê‹ ÊÑ« ä” Î¢B Îð« ÿèœ è§ è¤ è° èÖ ÿîœ î§ î¤ î× ÿóœ ó§ ó° óÖ ÿøœ ø§ ø× ÿüœ ü§ ü¤ ü° üÖ ÿ‚œ ‚§ ‚¤ ‚× ÿ ‡œ ‡§ ‡° ‡Ö ÿ Œœ Œ§ Œ× ÿ �œ �§ �¤ �° �Ö ÿ –œ –§ –¤ –× ÿ ›œ ›§ ›° ›Ö ÿ! œ § × ÿ"¤œ ¤§ ¤¤ ¤° ¤Ö ÿ#ªœ ª§ ª¤ ª× ÿ$¯œ ¯§ ¯° ¯Ö ÿ%´œ ´§ ´× ÿ&¸œ ¸§ ¸¤ ¸° ¸Ö ÿ'¾œ ¾§ ¾¤ ¾× ÿ(Ãœ ç ð ÃÖ ÿ)Èœ ȧ È× ÿ*Ìœ ̧ ̤ Ì° ÌÖ ÿ+Òœ Ò§ Ò¤ Ò× ÿ,ל ק ×° ×Ö ÿ-Üœ ܧ Ü× ÿ.àœ à§ à¤ à° àÖ ÿ/æœ æ§ æ¤ æ× ÿ0ëœ ë§ ë° ëÖ ÿ1ðœ ð§ ð× ó ó ó ìA ó ü ó ¾« ó ‹ ó Ñ« ù” ÷ ¢B ÷ ð« É �* ý¥ ýù É ;€¥ €ƒ ‹
|
|||
|
|
ó ‹
|
|||
|
|
ìA ‹
|
|||
|
|
ü ‹
|
|||
|
|
¾« ‹
|
|||
|
|
‹ ‹
|
|||
|
|
Ñ« ˆ” Ž
|
|||
|
|
¢B Ž
|
|||
|
|
ð« ¤
|
|||
|
|
ó ¤
|
|||
|
|
ìA ¤
|
|||
|
|
ü ¤
|
|||
|
|
¾« ¤
|
|||
|
|
‹ ¤
|
|||
|
|
Ñ« ‘” §
|
|||
|
|
¢B §
|
|||
|
|
ð« ²•¥ •¤ •° •Ö ²š¥ š° šÖ ²ž¥ ž¤ ž° žÖ ²£¥ £° £Ö ²§¥ §¤ §° §Ö ²¬¥ ¬° ¬Ö ²°¥ °¤ °° °Ö ²µ¥ µ° µÖ ²¹¥ ¹¤ ¹° ¹Ö ² ¾¥ ¾° ¾Ö ² Â¥ ¤ ° ÂÖ ² Ç¥ Ç° ÇÖ ² Ë¥ ˤ Ë° ËÖ ² Ð¥ а ÐÖ HashValueÁ Ô
|
|||
|
|
Ԉ ؃
|
|||
|
|
Û×
|
|||
|
|
Þ� И àœ à§ à§ àŒ à» æœ æ§ éœ é§ é× TryReserveErrorÁ í‚ ïƒ ò� ôÖ ö× TryReserveErrorKindÁ ø StdÁ ù
|
|||
|
|
ùˆ ø CapacityOverflowÁ ü
|
|||
|
|
ø
|
|||
|
|
AllocErrorÁ þ layoutÁ €ƒ ƒ� …Ö ‡× GetDisjointMutErrorÁ ‰ IndexOutOfBoundsÁ Š
|
|||
|
|
‰ OverlappingIndicesÁ Œ
|
|||
|
|
Ž× �ƒ “� •Ö #
|
|||
|
|
#
|
|||
|
|
'
|
|||
|
|
(
|
|||
|
|
*
|
|||
|
|
+
|
|||
|
|
,
|
|||
|
|
-
|
|||
|
|
/
|
|||
|
|
6
|
|||
|
|
L
|
|||
|
|
M
|
|||
|
|
N
|
|||
|
|
S
|
|||
|
|
S
|
|||
|
|
S
|
|||
|
|
S
|
|||
|
|
V
|
|||
|
|
V
|
|||
|
|
e
|
|||
|
|
o
|
|||
|
|
r
|
|||
|
|
s
|
|||
|
|
v
|
|||
|
|
v
|
|||
|
|
x
|
|||
|
|
’
|
|||
|
|
’
|
|||
|
|
—
|
|||
|
|
ž
|
|||
|
|
|
|||
|
|
¢
|
|||
|
|
¢
|
|||
|
|
©
|
|||
|
|
ª
|
|||
|
|
ª
|
|||
|
|
²
|
|||
|
|
³
|
|||
|
|
´
|
|||
|
|
´
|
|||
|
|
¶
|
|||
|
|
·
|
|||
|
|
¸
|
|||
|
|
¹
|
|||
|
|
º
|
|||
|
|
¼
|
|||
|
|
½
|
|||
|
|
¿
|
|||
|
|
¿
|
|||
|
|
À
|
|||
|
|
Á
|
|||
|
|
Â
|
|||
|
|
Ã
|
|||
|
|
Ä
|
|||
|
|
Å
|
|||
|
|
Æ
|
|||
|
|
Ç
|
|||
|
|
Ç
|
|||
|
|
É
|
|||
|
|
É
|
|||
|
|
É
|
|||
|
|
Ì
|
|||
|
|
Í
|
|||
|
|
Î
|
|||
|
|
Ï
|
|||
|
|
Ï
|
|||
|
|
Ñ
|
|||
|
|
Ñ
|
|||
|
|
Ó
|
|||
|
|
Õ
|
|||
|
|
Õ
|
|||
|
|
Õ
|
|||
|
|
Ø
|
|||
|
|
Ù
|
|||
|
|
Ú
|
|||
|
|
Û
|
|||
|
|
Ü
|
|||
|
|
Ý
|
|||
|
|
ß
|
|||
|
|
à
|
|||
|
|
á
|
|||
|
|
â
|
|||
|
|
ã
|
|||
|
|
ä
|
|||
|
|
å
|
|||
|
|
ç
|
|||
|
|
è
|
|||
|
|
þ
|
|||
|
|
þ
|
|||
|
|
þ
|
|||
|
|
þ
|
|||
|
|
š
|
|||
|
|
Ÿ
|
|||
|
|
¡
|
|||
|
|
¢
|
|||
|
|
¥
|
|||
|
|
¨
|
|||
|
|
¨
|
|||
|
|
¨
|
|||
|
|
©
|
|||
|
|
¬
|
|||
|
|
¬
|
|||
|
|
¬
|
|||
|
|
|
|||
|
|
°
|
|||
|
|
°
|
|||
|
|
°
|
|||
|
|
¼
|
|||
|
|
¾
|
|||
|
|
¿
|
|||
|
|
Á
|
|||
|
|
Â
|
|||
|
|
Ã
|
|||
|
|
Ä
|
|||
|
|
Å
|
|||
|
|
Í
|
|||
|
|
Ð
|
|||
|
|
Ð
|
|||
|
|
Ð
|
|||
|
|
�
|
|||
|
|
“
|
|||
|
|
–
|
|||
|
|
™
|
|||
|
|
š
|
|||
|
|
�
|
|||
|
|
|
|||
|
|
¡
|
|||
|
|
¤
|
|||
|
|
¤
|
|||
|
|
¤
|
|||
|
|
¥
|
|||
|
|
³
|
|||
|
|
º
|
|||
|
|
½
|
|||
|
|
À
|
|||
|
|
Á
|
|||
|
|
Ä
|
|||
|
|
Ç
|
|||
|
|
Ç
|
|||
|
|
Ç
|
|||
|
|
È
|
|||
|
|
Ö
|
|||
|
|
Ý
|
|||
|
|
à
|
|||
|
|
ã
|
|||
|
|
ä
|
|||
|
|
ç
|
|||
|
|
ê
|
|||
|
|
ê
|
|||
|
|
ê
|
|||
|
|
ë
|
|||
|
|
ó
|
|||
|
|
ô
|
|||
|
|
ÿ
|
|||
|
|
†
|
|||
|
|
†
|
|||
|
|
†
|
|||
|
|
•
|
|||
|
|
–
|
|||
|
|
š
|
|||
|
|
�
|
|||
|
|
|
|||
|
|
¡
|
|||
|
|
¤
|
|||
|
|
§
|
|||
|
|
§
|
|||
|
|
§
|
|||
|
|
·
|
|||
|
|
º
|
|||
|
|
½
|
|||
|
|
¾
|
|||
|
|
Á
|
|||
|
|
Ä
|
|||
|
|
Å
|
|||
|
|
È
|
|||
|
|
È
|
|||
|
|
È
|
|||
|
|
É
|
|||
|
|
Í
|
|||
|
|
Ñ
|
|||
|
|
Þ
|
|||
|
|
ê
|
|||
|
|
ñ
|
|||
|
|
ñ
|
|||
|
|
ñ
|
|||
|
|
…
|
|||
|
|
ˆ
|
|||
|
|
‹
|
|||
|
|
Œ
|
|||
|
|
�
|
|||
|
|
’
|
|||
|
|
“
|
|||
|
|
–
|
|||
|
|
–
|
|||
|
|
–
|
|||
|
|
—
|
|||
|
|
ª
|
|||
|
|
|
|||
|
|
°
|
|||
|
|
±
|
|||
|
|
´
|
|||
|
|
·
|
|||
|
|
·
|
|||
|
|
·
|
|||
|
|
¸
|
|||
|
|
È
|
|||
|
|
Ô
|
|||
|
|
Û
|
|||
|
|
Û
|
|||
|
|
Û
|
|||
|
|
ò
|
|||
|
|
÷
|
|||
|
|
ø
|
|||
|
|
þ
|
|||
|
|
ÿ
|
|||
|
|
€
|
|||
|
|
…
|
|||
|
|
†
|
|||
|
|
‹
|
|||
|
|
Œ
|
|||
|
|
‘
|
|||
|
|
–
|
|||
|
|
–
|
|||
|
|
–
|
|||
|
|
ž
|
|||
|
|
¢
|
|||
|
|
¢
|
|||
|
|
¢
|
|||
|
|
¤
|
|||
|
|
¤
|
|||
|
|
¤
|
|||
|
|
©
|
|||
|
|
«
|
|||
|
|
¬
|
|||
|
|
¬
|
|||
|
|
¬
|
|||
|
|
°
|
|||
|
|
´
|
|||
|
|
´
|
|||
|
|
´
|
|||
|
|
Å
|
|||
|
|
Å
|
|||
|
|
Ç
|
|||
|
|
È
|
|||
|
|
É
|
|||
|
|
É
|
|||
|
|
É
|
|||
|
|
Ñ
|
|||
|
|
Ñ
|
|||
|
|
Ó
|
|||
|
|
Ô
|
|||
|
|
Õ
|
|||
|
|
Õ
|
|||
|
|
Õ
|
|||
|
|
Ù
|
|||
|
|
Ú
|
|||
|
|
Þ
|
|||
|
|
ß
|
|||
|
|
ã
|
|||
|
|
ä
|
|||
|
|
è
|
|||
|
|
é
|
|||
|
|
í
|
|||
|
|
ó
|
|||
|
|
ö
|
|||
|
|
ù
|
|||
|
|
ü
|
|||
|
|
£
|
|||
|
|
¤
|
|||
|
|
¯
|
|||
|
|
°
|
|||
|
|
±
|
|||
|
|
²
|
|||
|
|
³
|
|||
|
|
µ
|
|||
|
|
·
|
|||
|
|
¸
|
|||
|
|
¹
|
|||
|
|
º
|
|||
|
|
»
|
|||
|
|
¼
|
|||
|
|
½
|
|||
|
|
¾
|
|||
|
|
¿
|
|||
|
|
À
|
|||
|
|
Á
|
|||
|
|
Â
|
|||
|
|
Ã
|
|||
|
|
Ä
|
|||
|
|
Å
|
|||
|
|
Ç
|
|||
|
|
È
|
|||
|
|
Ê
|
|||
|
|
Ê
|
|||
|
|
Ð
|
|||
|
|
Õ
|
|||
|
|
à
|
|||
|
|
à
|
|||
|
|
à
|
|||
|
|
ã
|
|||
|
|
ç
|
|||
|
|
€
|
|||
|
|
„
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
“
|
|||
|
|
—
|
|||
|
|
—
|
|||
|
|
—
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
¤
|
|||
|
|
¤
|
|||
|
|
«
|
|||
|
|
«
|
|||
|
|
´
|
|||
|
|
´
|
|||
|
|
½
|
|||
|
|
½
|
|||
|
|
Ä
|
|||
|
|
Ä
|
|||
|
|
È
|
|||
|
|
È
|
|||
|
|
Ì
|
|||
|
|
Ì
|
|||
|
|
Ò
|
|||
|
|
Ö
|
|||
|
|
ê
|
|||
|
|
ë
|
|||
|
|
ð
|
|||
|
|
ñ
|
|||
|
|
ø
|
|||
|
|
ü
|
|||
|
|
ü
|
|||
|
|
ü
|
|||
|
|
‚
|
|||
|
|
„
|
|||
|
|
†
|
|||
|
|
ˆ
|
|||
|
|
Š
|
|||
|
|
’
|
|||
|
|
–
|
|||
|
|
–
|
|||
|
|
–
|
|||
|
|
œ
|
|||
|
|
ž
|
|||
|
|
¡
|
|||
|
|
®
|
|||
|
|
²
|
|||
|
|
²
|
|||
|
|
²
|
|||
|
|
¸
|
|||
|
|
¼
|
|||
|
|
¼
|
|||
|
|
Å
|
|||
|
|
É
|
|||
|
|
É
|
|||
|
|
É
|
|||
|
|
Ï
|
|||
|
|
Ð
|
|||
|
|
Ñ
|
|||
|
|
Ó
|
|||
|
|
Ô
|
|||
|
|
Ö
|
|||
|
|
×
|
|||
|
|
Ù
|
|||
|
|
Ú
|
|||
|
|
ê
|
|||
|
|
î
|
|||
|
|
î
|
|||
|
|
î
|
|||
|
|
ô
|
|||
|
|
¶
|
|||
|
|
|
|||
|
|
·
|
|||
|
|
|
|||
|
|
·
|
|||
|
|
|
|||
|
|
¼
|
|||
|
|
|
|||
|
|
¼
|
|||
|
|
|
|||
|
|
¼
|
|||
|
|
|
|||
|
|
É
|
|||
|
|
|
|||
|
|
Ê
|
|||
|
|
|
|||
|
|
Ë
|
|||
|
|
|
|||
|
|
Ë
|
|||
|
|
|
|||
|
|
Í
|
|||
|
|
|
|||
|
|
Î
|
|||
|
|
|
|||
|
|
Ï
|
|||
|
|
|
|||
|
|
Ð
|
|||
|
|
|
|||
|
|
Ñ
|
|||
|
|
|
|||
|
|
Ò
|
|||
|
|
|
|||
|
|
Ó
|
|||
|
|
|
|||
|
|
Õ
|
|||
|
|
|
|||
|
|
Ö
|
|||
|
|
|
|||
|
|
Ø
|
|||
|
|
|
|||
|
|
Ù
|
|||
|
|
|
|||
|
|
Ú
|
|||
|
|
|
|||
|
|
Ü
|
|||
|
|
|
|||
|
|
Ü
|
|||
|
|
|
|||
|
|
Ü
|
|||
|
|
|
|||
|
|
ß
|
|||
|
|
|
|||
|
|
à
|
|||
|
|
|
|||
|
|
á
|
|||
|
|
|
|||
|
|
â
|
|||
|
|
|
|||
|
|
ã
|
|||
|
|
|
|||
|
|
ä
|
|||
|
|
|
|||
|
|
å
|
|||
|
|
|
|||
|
|
ê
|
|||
|
|
|
|||
|
|
ë
|
|||
|
|
|
|||
|
|
ì
|
|||
|
|
|
|||
|
|
í
|
|||
|
|
|
|||
|
|
í
|
|||
|
|
|
|||
|
|
í
|
|||
|
|
|
|||
|
|
í
|
|||
|
|
|
|||
|
|
í
|
|||
|
|
|
|||
|
|
ð
|
|||
|
|
|
|||
|
|
ð
|
|||
|
|
|
|||
|
|
ð
|
|||
|
|
|
|||
|
|
ó
|
|||
|
|
|
|||
|
|
ô
|
|||
|
|
|
|||
|
|
õ
|
|||
|
|
|
|||
|
|
ö
|
|||
|
|
|
|||
|
|
÷
|
|||
|
|
|
|||
|
|
ú
|
|||
|
|
|
|||
|
|
ú
|
|||
|
|
|
|||
|
|
€
|
|||
|
|
€
|
|||
|
|
‚
|
|||
|
|
‚
|
|||
|
|
„
|
|||
|
|
„
|
|||
|
|
†
|
|||
|
|
†
|
|||
|
|
ˆ
|
|||
|
|
ˆ
|
|||
|
|
Š
|
|||
|
|
Š
|
|||
|
|
Œ
|
|||
|
|
Œ
|
|||
|
|
Ž
|
|||
|
|
Ž
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
’
|
|||
|
|
’
|
|||
|
|
š
|
|||
|
|
š
|
|||
|
|
œ
|
|||
|
|
œ
|
|||
|
|
ž
|
|||
|
|
ž
|
|||
|
|
|
|||
|
|
|
|||
|
|
¢
|
|||
|
|
¢
|
|||
|
|
¤
|
|||
|
|
¤
|
|||
|
|
¦
|
|||
|
|
¦
|
|||
|
|
¨
|
|||
|
|
¨
|
|||
|
|
®
|
|||
|
|
¯
|
|||
|
|
¯
|
|||
|
|
¯
|
|||
|
|
±
|
|||
|
|
±
|
|||
|
|
±
|
|||
|
|
´
|
|||
|
|
·
|
|||
|
|
·
|
|||
|
|
·
|
|||
|
|
·
|
|||
|
|
·
|
|||
|
|
»
|
|||
|
|
»
|
|||
|
|
»
|
|||
|
|
»
|
|||
|
|
¾
|
|||
|
|
¾
|
|||
|
|
¾
|
|||
|
|
Ã
|
|||
|
|
Æ
|
|||
|
|
Æ
|
|||
|
|
Æ
|
|||
|
|
Æ
|
|||
|
|
Æ
|
|||
|
|
Ê
|
|||
|
|
Ê
|
|||
|
|
Ê
|
|||
|
|
Ê
|
|||
|
|
Í
|
|||
|
|
Í
|
|||
|
|
Í
|
|||
|
|
Ò
|
|||
|
|
Ò
|
|||
|
|
Ò
|
|||
|
|
×
|
|||
|
|
×
|
|||
|
|
Û
|
|||
|
|
ß
|
|||
|
|
ç
|
|||
|
|
ç
|
|||
|
|
ç
|
|||
|
|
é
|
|||
|
|
ê
|
|||
|
|
ë
|
|||
|
|
í
|
|||
|
|
î
|
|||
|
|
ï
|
|||
|
|
ð
|
|||
|
|
ô
|
|||
|
|
ö
|
|||
|
|
ø
|
|||
|
|
ù
|
|||
|
|
ú
|
|||
|
|
û
|
|||
|
|
ü
|
|||
|
|
ý
|
|||
|
|
þ
|
|||
|
|
ÿ
|
|||
|
|
€
|
|||
|
|
�
|
|||
|
|
‚
|
|||
|
|
ˆ
|
|||
|
|
ˆ
|
|||
|
|
‰
|
|||
|
|
Ž
|
|||
|
|
Ž
|
|||
|
|
”
|
|||
|
|
™
|
|||
|
|
«
|
|||
|
|
³
|
|||
|
|
Á
|
|||
|
|
Á
|
|||
|
|
ò
|
|||
|
|
÷
|
|||
|
|
ù
|
|||
|
|
û
|
|||
|
|
ü
|
|||
|
|
þ
|
|||
|
|
€
|
|||
|
|
|
|||
|
|
�
|
|||
|
|
|
|||
|
|
ƒ
|
|||
|
|
|
|||
|
|
ƒ
|
|||
|
|
|
|||
|
|
ƒ
|
|||
|
|
|
|||
|
|
„
|
|||
|
|
|
|||
|
|
Š
|
|||
|
|
|
|||
|
|
’
|
|||
|
|
|
|||
|
|
—
|
|||
|
|
|
|||
|
|
—
|
|||
|
|
|
|||
|
|
—
|
|||
|
|
|
|||
|
|
£
|
|||
|
|
|
|||
|
|
¤
|
|||
|
|
|
|||
|
|
§
|
|||
|
|
|
|||
|
|
©
|
|||
|
|
|
|||
|
|
«
|
|||
|
|
|
|||
|
|
¬
|
|||
|
|
|
|||
|
|
®
|
|||
|
|
|
|||
|
|
°
|
|||
|
|
|
|||
|
|
°
|
|||
|
|
|
|||
|
|
°
|
|||
|
|
|
|||
|
|
Â
|
|||
|
|
|
|||
|
|
Ã
|
|||
|
|
|
|||
|
|
Ä
|
|||
|
|
|
|||
|
|
Ç
|
|||
|
|
|
|||
|
|
È
|
|||
|
|
|
|||
|
|
Ë
|
|||
|
|
|
|||
|
|
Î
|
|||
|
|
|
|||
|
|
Ï
|
|||
|
|
|
|||
|
|
Ò
|
|||
|
|
|
|||
|
|
Ò
|
|||
|
|
|
|||
|
|
Ò
|
|||
|
|
|
|||
|
|
ä
|
|||
|
|
|
|||
|
|
å
|
|||
|
|
|
|||
|
|
æ
|
|||
|
|
|
|||
|
|
é
|
|||
|
|
|
|||
|
|
ê
|
|||
|
|
|
|||
|
|
í
|
|||
|
|
|
|||
|
|
ð
|
|||
|
|
|
|||
|
|
ñ
|
|||
|
|
|
|||
|
|
ô
|
|||
|
|
|
|||
|
|
ô
|
|||
|
|
|
|||
|
|
ô
|
|||
|
|
|
|||
|
|
‡
|
|||
|
|
ˆ
|
|||
|
|
Œ
|
|||
|
|
�
|
|||
|
|
”
|
|||
|
|
˜
|
|||
|
|
œ
|
|||
|
|
�
|
|||
|
|
¡
|
|||
|
|
¡
|
|||
|
|
¡
|
|||
|
|
²
|
|||
|
|
³
|
|||
|
|
·
|
|||
|
|
º
|
|||
|
|
¾
|
|||
|
|
Á
|
|||
|
|
Ä
|
|||
|
|
Å
|
|||
|
|
È
|
|||
|
|
È
|
|||
|
|
È
|
|||
|
|
Ö
|
|||
|
|
Û
|
|||
|
|
Ü
|
|||
|
|
Ý
|
|||
|
|
á
|
|||
|
|
â
|
|||
|
|
æ
|
|||
|
|
ç
|
|||
|
|
ò
|
|||
|
|
ô
|
|||
|
|
ø
|
|||
|
|
ø
|
|||
|
|
ø
|
|||
|
|
û
|
|||
|
|
û
|
|||
|
|
û
|
|||
|
|
‚
|
|||
|
|
…
|
|||
|
|
…
|
|||
|
|
‡
|
|||
|
|
‡
|
|||
|
|
‹
|
|||
|
|
�
|
|||
|
|
Ž
|
|||
|
|
Ž
|
|||
|
|
‘
|
|||
|
|
”
|
|||
|
|
”
|
|||
|
|
”
|
|||
|
|
Ÿ
|
|||
|
|
Ÿ
|
|||
|
|
¡
|
|||
|
|
¢
|
|||
|
|
¢
|
|||
|
|
¨
|
|||
|
|
¨
|
|||
|
|
ª
|
|||
|
|
«
|
|||
|
|
«
|
|||
|
|
Ì
|
|||
|
|
Ô
|
|||
|
|
Õ
|
|||
|
|
Ö
|
|||
|
|
×
|
|||
|
|
Ù
|
|||
|
|
Ú
|
|||
|
|
Û
|
|||
|
|
Ü
|
|||
|
|
Ý
|
|||
|
|
Þ
|
|||
|
|
ß
|
|||
|
|
à
|
|||
|
|
à
|
|||
|
|
æ
|
|||
|
|
ë
|
|||
|
|
ö
|
|||
|
|
ö
|
|||
|
|
„
|
|||
|
|
Œ
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
’
|
|||
|
|
’
|
|||
|
|
’
|
|||
|
|
–
|
|||
|
|
–
|
|||
|
|
›
|
|||
|
|
›
|
|||
|
|
|
|||
|
|
|
|||
|
|
§
|
|||
|
|
§
|
|||
|
|
®
|
|||
|
|
®
|
|||
|
|
³
|
|||
|
|
³
|
|||
|
|
¶
|
|||
|
|
¶
|
|||
|
|
¹
|
|||
|
|
¹
|
|||
|
|
¾
|
|||
|
|
é
|
|||
|
|
ê
|
|||
|
|
ê
|
|||
|
|
î
|
|||
|
|
î
|
|||
|
|
î
|
|||
|
|
ù
|
|||
|
|
ú
|
|||
|
|
ú
|
|||
|
|
ü
|
|||
|
|
ý
|
|||
|
|
þ
|
|||
|
|
ÿ
|
|||
|
|
€
|
|||
|
|
�
|
|||
|
|
‚
|
|||
|
|
ƒ
|
|||
|
|
…
|
|||
|
|
…
|
|||
|
|
ˆ
|
|||
|
|
‰
|
|||
|
|
Š
|
|||
|
|
‹
|
|||
|
|
Œ
|
|||
|
|
�
|
|||
|
|
Ž
|
|||
|
|
’
|
|||
|
|
“
|
|||
|
|
”
|
|||
|
|
•
|
|||
|
|
•
|
|||
|
|
•
|
|||
|
|
˜
|
|||
|
|
˜
|
|||
|
|
œ
|
|||
|
|
�
|
|||
|
|
ž
|
|||
|
|
Ÿ
|
|||
|
|
|
|||
|
|
|
|||
|
|
°
|
|||
|
|
°
|
|||
|
|
µ
|
|||
|
|
µ
|
|||
|
|
·
|
|||
|
|
·
|
|||
|
|
º
|
|||
|
|
º
|
|||
|
|
½
|
|||
|
|
½
|
|||
|
|
¿
|
|||
|
|
¿
|
|||
|
|
Á
|
|||
|
|
Á
|
|||
|
|
Ã
|
|||
|
|
Ã
|
|||
|
|
Å
|
|||
|
|
Å
|
|||
|
|
Ç
|
|||
|
|
Ç
|
|||
|
|
Ê
|
|||
|
|
Ê
|
|||
|
|
Í
|
|||
|
|
Í
|
|||
|
|
Ð
|
|||
|
|
Ð
|
|||
|
|
Ö
|
|||
|
|
Ø
|
|||
|
|
Ø
|
|||
|
|
Ú
|
|||
|
|
Ú
|
|||
|
|
Ý
|
|||
|
|
Þ
|
|||
|
|
Þ
|
|||
|
|
Þ
|
|||
|
|
á
|
|||
|
|
á
|
|||
|
|
ä
|
|||
|
|
ä
|
|||
|
|
é
|
|||
|
|
ê
|
|||
|
|
ê
|
|||
|
|
ê
|
|||
|
|
í
|
|||
|
|
í
|
|||
|
|
ð
|
|||
|
|
ð
|
|||
|
|
õ
|
|||
|
|
õ
|
|||
|
|
ú
|
|||
|
|
ú
|
|||
|
|
þ
|
|||
|
|
‚
|
|||
|
|
Š
|
|||
|
|
Š
|
|||
|
|
Œ
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
’
|
|||
|
|
“
|
|||
|
|
”
|
|||
|
|
–
|
|||
|
|
˜
|
|||
|
|
™
|
|||
|
|
ž
|
|||
|
|
®
|
|||
|
|
µ
|
|||
|
|
¿
|
|||
|
|
¿
|
|||
|
|
Æ
|
|||
|
|
Æ
|
|||
|
|
Ê
|
|||
|
|
Ê
|
|||
|
|
Í
|
|||
|
|
Í
|
|||
|
|
Ï
|
|||
|
|
Ï
|
|||
|
|
Ô
|
|||
|
|
Õ
|
|||
|
|
Õ
|
|||
|
|
Ú
|
|||
|
|
Û
|
|||
|
|
Û
|
|||
|
|
à
|
|||
|
|
á
|
|||
|
|
á
|
|||
|
|
æ
|
|||
|
|
ï
|
|||
|
|
ð
|
|||
|
|
ð
|
|||
|
|
ô
|
|||
|
|
õ
|
|||
|
|
ö
|
|||
|
|
ú
|
|||
|
|
û
|
|||
|
|
ü
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
„
|
|||
|
|
„
|
|||
|
|
„
|
|||
|
|
†
|
|||
|
|
‡
|
|||
|
|
‰
|
|||
|
|
�
|
|||
|
|
Ž
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
’
|
|||
|
|
–
|
|||
|
|
—
|
|||
|
|
˜
|
|||
|
|
™
|
|||
|
|
›
|
|||
|
|
Ÿ
|
|||
|
|
|
|||
|
|
¨
|
|||
|
|
©
|
|||
|
|
ª
|
|||
|
|
¬
|
|||
|
|
°
|
|||
|
|
±
|
|||
|
|
²
|
|||
|
|
³
|
|||
|
|
µ
|
|||
|
|
¹
|
|||
|
|
º
|
|||
|
|
»
|
|||
|
|
¼
|
|||
|
|
¾
|
|||
|
|
Â
|
|||
|
|
Ã
|
|||
|
|
Ä
|
|||
|
|
Å
|
|||
|
|
Ç
|
|||
|
|
Ë
|
|||
|
|
Ì
|
|||
|
|
Í
|
|||
|
|
Î
|
|||
|
|
Ð
|
|||
|
|
Ô
|
|||
|
|
Õ
|
|||
|
|
Ö
|
|||
|
|
×
|
|||
|
|
Ù
|
|||
|
|
Ý
|
|||
|
|
Þ
|
|||
|
|
ß
|
|||
|
|
à
|
|||
|
|
â
|
|||
|
|
æ
|
|||
|
|
ç
|
|||
|
|
í
|
|||
|
|
ò
|
|||
|
|
÷
|
|||
|
|
û
|
|||
|
|
�
|
|||
|
|
†
|
|||
|
|
‹
|
|||
|
|
�
|
|||
|
|
•
|
|||
|
|
š
|
|||
|
|
Ÿ
|
|||
|
|
£
|
|||
|
|
©
|
|||
|
|
®
|
|||
|
|
³
|
|||
|
|
·
|
|||
|
|
½
|
|||
|
|
Â
|
|||
|
|
Ç
|
|||
|
|
Ë
|
|||
|
|
Ñ
|
|||
|
|
Ö
|
|||
|
|
Û
|
|||
|
|
ß
|
|||
|
|
å
|
|||
|
|
ê
|
|||
|
|
ï
|
|||
|
|
ó
|
|||
|
|
ô
|
|||
|
|
õ
|
|||
|
|
÷
|
|||
|
|
û
|
|||
|
|
ü
|
|||
|
|
‚
|
|||
|
|
ƒ
|
|||
|
|
„
|
|||
|
|
†
|
|||
|
|
Š
|
|||
|
|
‹
|
|||
|
|
Œ
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
“
|
|||
|
|
”
|
|||
|
|
™
|
|||
|
|
�
|
|||
|
|
¢
|
|||
|
|
¦
|
|||
|
|
«
|
|||
|
|
¯
|
|||
|
|
´
|
|||
|
|
¸
|
|||
|
|
½
|
|||
|
|
Á
|
|||
|
|
Æ
|
|||
|
|
Ê
|
|||
|
|
Ï
|
|||
|
|
Ó
|
|||
|
|
Ù
|
|||
|
|
Ü
|
|||
|
|
Ü
|
|||
|
|
Ü
|
|||
|
|
ß
|
|||
|
|
ß
|
|||
|
|
ì
|
|||
|
|
ì
|
|||
|
|
ì
|
|||
|
|
ð
|
|||
|
|
ó
|
|||
|
|
ó
|
|||
|
|
õ
|
|||
|
|
÷
|
|||
|
|
÷
|
|||
|
|
÷
|
|||
|
|
�
|
|||
|
|
„
|
|||
|
|
„
|
|||
|
|
†
|
|||
|
|
ˆ
|
|||
|
|
ˆ
|
|||
|
|
ˆ
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
‘
|
|||
|
|
”
|
|||
|
|
”
|
|||
|
|
–
|
|||
|
|
•8 œ§
|
|||
|
|
Â×îæù �®é Å
|
|||
|
|
Ø Ö ü
|
|||
|
|
ŒF¾2
|
|||
|
|
\›º §
|
|||
|
|
œ§ ± ± Ç& µØ ƒ ¶Ö ƒ Ÿ 1zî¨F› §
|
|||
|
|
™ëŸë Œ" g g ˜ kØ \ lÆ \ mÔ \ nþ \ l ÌŒæt 8™ëŸë Ø � � ¨ �Ä ‘Ó ê9œÒž”² œ§ ¿c Œ � ‘†$ ’ˆ “ ”£$ •ˆ A'YŠ¯y! 8™ëŸë ¿c Å
|
|||
|
|
Ø Ö ü
|
|||
|
|
ŒF¾2
|
|||
|
|
\›º 8™ëŸë ¿c A A ² EØ F§ GŒ N½ž–& 8™ëŸë ¿c ± ± Ç& µØ ƒ ¶Ö ƒ Ÿ 1zî¨F› 8™ëŸë é ¥ëÕê ÇL §
|
|||
|
|
¬
|
|||
|
|
¬
|
|||
|
|
°
|
|||
|
|
í ±
|
|||
|
|
Þ` ‚ ø �Ãx¶*Ó™ëŸë¤ ÇL §
|
|||
|
|
þï ÇL ¬
|
|||
|
|
¬
|
|||
|
|
°
|
|||
|
|
í ±
|
|||
|
|
Þ` ‚ ø �Ãx¶*ÓˆíŽí¤ ùM ƒ ƒ š+ ‡ù Ö …ä1dÿ·‘ §
|
|||
|
|
™ëŸë ŒM ƒ ƒ š+ ‡ù Ö …ä1dÿ·‘ 8™ëŸë ÃMðñ òPðñ Øðñ ¿cðñ ³ ðñ ùM © © ½- ù Ö 8ﲞÄÿ„ §
|
|||
|
|
™ëŸë ŒM © © ½- ù Ö 8ﲞÄÿ„ 8™ëŸë ÃM¬ó òP¬ó ¿c¬ó ³ ¬ó ùM Ì Ì Ð/ Ðù Ö /áU®"¯ §
|
|||
|
|
™ëŸë ŒM Ì Ì Ð/ Ðù Ö /áU®"¯ 8™ëŸë ÃMÝô òPÝô ¿cÝô ³ Ýô Ø ¡ ¡ �* ¤ù Ö p¸Ù3¦µ+ˆíŽí ùMËõ ŒMËõ ÃMËõ òPËõ ¿cËõ ³ Ëõ ùM ‹ ‹ °3 �ù Ö 2› Krb~ 8™ëŸë ŒMÊö ÃMÊö òPÊö ¿cÊö ùM ¨ ¨ ‹5 ¬ù Ö >·£;ñ› §
|
|||
|
|
™ëŸë ŒM ¨ ¨ ‹5 ¬ù Ö >·£;ñ› 8™ëŸë ÃMû÷ òPû÷ Øû÷ ¿cû÷ ³ û÷ Ù¢û÷ Ø Ò Ò Ã7 Õù Ö „{ º•!ïˆíŽí ùMƒù ŒMƒù ÃMƒù òPƒù ¿cƒù ³ ƒù ùM ö ö Ì9 úù Ö î¹ú‡�$! §
|
|||
|
|
™ëŸë ŒM ö ö Ì9 úù Ö î¹ú‡�$! 8™ëŸë ÃMÅú òPÅú ØÅú ¿cÅú ³ Åú ùM › › á; Ÿù Ö †¦"KPy §
|
|||
|
|
™ëŸë ŒM › › á; Ÿù Ö †¦"KPy 8™ëŸë ÃM�ü òP�ü ¿c�ü ³ �ü Ø ¼ ¼ Ü= ¿ù Ö ŸD¾Yw5LjíŽí ùMïü ŒMïü ÃMïü òPïü ¿cïü ³ ïü Œ" à à ç? æØ Ö ç¥@ Ö èŒ Ö é¹@ Ö 6õ •Â\¶ 8šœ§¤ ùMîý ŒMîý ÃMîý òPîý ¿cîý ùM — — ²C œß Ö �ëC Ö }GB×òç 8™ëŸë— òP›ÿ ¿c›ÿ Âßð ×›í ×÷í ×Éî ×›ï îßð î›í î÷í îÉî î›ï ÇL §
|
|||
|
|
œ œ Ù ŸÓ OÝ(L9U™ëŸë ÇL §
|
|||
|
|
ù€ ÇL�� ž BoxÁ ¡ˆˆ ¢‰ˆ l }.xÏ œ œ Ù ŸÓ OÝ(L9UˆíŽíçEçEèE GlobalÁ ¿±‡§í# ³ 8ù€ ³ 8ù€ ³ È� ØÈ� é �� žÖ€ ¡ˆˆ ¢‰ˆ l }.xÏù€¾‚ñ‚ ¿c‰‚ µß‰‚ œ œ Ù ŸÓ OÝ(L9UÙUãU µß‰‚
|
|||
|
|
¸„¾„ µß
|
|||
|
|
ˆíŽí‹„ µß‰‚Ñ„ Ÿ µßã„ Ÿ œ œ Ù ŸÓ OÝ(L9UÙUãU ™‰‚ í߉‚‰‚ º‰‚ še‰‚ Ù¢‰‚ ³"‰‚ Ù¢ßð�£�£ ¹ ƒ£¹ „£þ -'ºˆÉ¬g ³"ß𫆠٢‰‚«† ³"‰‚«† Ù¢ßð—£—£ » ™£¹ < =áï_å ³"ßð ‡ Ù¢‰‚ ‡ ³"‰‚ ‡ Ù¢ßðî¢î¢ï¢½ +¢ L;V ³"ßð‹ˆ Ù¢‰‚‹ˆ ³"‰‚‹ˆ Ù¢ßð½£½£ ¾ ¿£¹ À£þ Á£ exhaustedÁ 1¥œMu7·P ³"ßðîˆ Ù¢‰‚îˆ ³"‰‚îˆ Ù¢ß𫣫£ à £þ ôÉûT™gö ³"ßðü‰ Ù¢‰‚ü‰ ³"‰‚ü‰ Ù¢ßðУУ Ä Ò£þ …K~)+ÄÒž ³"ßðçŠ Ù¢‰‚çŠ ³"‰‚çŠ Ù¢ßðç£é£ ê£ IncludedÁ 룈 ì£ í£ ExcludedÁ ï£ð£ UnboundedÁ ’iΉ£i7| Ô‹ ³"ßðÒ‹ Ù¢‰‚Ò‹ ³"‰‚Ò‹ æßðˆíŽí ñ ¿c ò ò îZ ÷Ø Ø å¿f »|rû 8™ëŸë¿ð ¿c Œ Œ ƒ] ‘ Ø Ø D •…¸ÉÚ 8™ëŸë¿ð ¿c £ ¨ © †$ ª ˆ « ¬ £$ ˆ éö*(°TÓù 8™ëŸë¿ð ¿c ¾ ¾ ›` Ã ß Ø Ä Þ` Ø ¬Ò°öá( 8™ëŸë¿ð ¿c ã ã –c è Ø Ø é Þ` Ø †@“äQE´Š 8™ëŸë¿ð ù ßð Øßð ¿cßð Ù¢ ¬
|
|||
|
|
¬
|
|||
|
|
°
|
|||
|
|
í ±
|
|||
|
|
Þ` ‚ ø �Ãx¶*Ó™ëŸë×þ 8¢ ³"Ò�—‘ Ù¢ßð ³"ßð ÃLßðã„ é ¬
|
|||
|
|
¬
|
|||
|
|
°
|
|||
|
|
í ±
|
|||
|
|
Þ` ‚ ø �Ãx¶*ÓˆíŽíÖJÖJ RandomStateÁ ×J k0Áˆ ØJ k1Áˆ ‰ÌkqÇËŸ Ž… ÐLßðã„ ÐLþï §
|
|||
|
|
™ë §
|
|||
|
|
Ÿë ³ ßð µß ¬
|
|||
|
|
¬
|
|||
|
|
°
|
|||
|
|
í ±
|
|||
|
|
Þ` ‚ ø �Ãx¶*Óˆíõyÿy ¬
|
|||
|
|
¬
|
|||
|
|
°
|
|||
|
|
í ±
|
|||
|
|
Þ` ‚ ø �Ãx¶*Óˆí¾„Ál ™ßð ÇL §
|
|||
|
|
â â � åØ p„�þ2x¥ ñ ÇL â â � åØ p„�þ2x ¥¤ ùM ê ê š+ í ù É ¿Ì$ë{ÏOø §
|
|||
|
|
Œ• ŒM ê ê š+ í ù É ¿Ì$ë{ÏOø 8Œ• ÃM�– òP�– Ø�– ¿c�– ³ �– Ø ý ý �* ÿù É d 5¯éh[Ë• ùM’— ŒM’— ÃM’— òP’— ¿c’— ³ ’— ùM ›
|
|||
|
|
›
|
|||
|
|
°3 ž
|
|||
|
|
ù É ã€œ#bü 8Œ• ŒM�˜ ÃM�˜ òP�˜ ¿c�˜ ùM ±
|
|||
|
|
±
|
|||
|
|
’€ µ
|
|||
|
|
ù É ¶
|
|||
|
|
¹
|
|||
|
|
É hß2€vyÞ §
|
|||
|
|
Œ• ñ ŒM ±
|
|||
|
|
±
|
|||
|
|
’€ µ
|
|||
|
|
ù É ¶
|
|||
|
|
¹
|
|||
|
|
É hß2€vyÞ 8Œ• ñ òPÇ™ ØÇ™ ¿cÇ™ ùM Ó
|
|||
|
|
Ó
|
|||
|
|
š‚ ×
|
|||
|
|
ù É Ø
|
|||
|
|
¹
|
|||
|
|
É ½Í—U%Ln §
|
|||
|
|
Œ• ñ ŒM Ó
|
|||
|
|
Ó
|
|||
|
|
š‚ ×
|
|||
|
|
ù É Ø
|
|||
|
|
¹
|
|||
|
|
É ½Í—U%Ln 8Œ• ñ òP‡› ؇› ¿c‡› ùM õ
|
|||
|
|
õ
|
|||
|
|
¤„ ú
|
|||
|
|
ù É ñsÜØ)zr¼ §
|
|||
|
|
Œ•ú“Ál ŒM õ
|
|||
|
|
õ
|
|||
|
|
¤„ ú
|
|||
|
|
ù É ñsÜØ)zr¼ 8Œ•ú“´œ òPÁœ ØÁœ ¿cÁœ ùM ¢ ¢ ô ¦ù É ¤¶nØ{ibƒ §
|
|||
|
|
Œ• ñ ŒM ¢ ¢ ô ¦ù É ¤¶nØ{ibƒ 8Œ• ñ òPì� Øì� ¿cì� ùM É É ç? Îù É Œj@ð.Z 8Åþ¥¿ð ŒMÏž ÃMÏž òPÏž ùM ë ë ì¿‹ îˆ É ”iÑë$
|
|||
|
|
N š ¿cÏž ¿c¸Ÿ ùM ü ü ²C €ß É �ëC É ³:ͧ¹»Þ 8Œ•— òPŽ ¿cŽ �ž• ®ž• ÇL §
|
|||
|
|
Ç Ç Ù ÉÓ "Ý,ÿ}sú«Œ• ÇL�� žÖ€ ¡ˆˆ ¢‰ˆ l }.xÏ Ç Ç Ù ÉÓ "Ý,ÿ}sú«Ë•¾‚ ³ 8�¡ ³ É¡ ØÉ¡ é �� žÖ€ ¡ˆˆ ¢‰ˆ l }.xÏ�¡¾‚Ä¢ ¿cˆ¢ µßˆ¢ Ç Ç Ù ÉÓ "Ý,ÿ}sú«¦ µßˆ¢
|
|||
|
|
ú£ µß
|
|||
|
|
Ë•Í£ µßˆ¢ú£ Ÿ µßË• Ÿ Ç Ç Ù ÉÓ "Ý,ÿ}sú«¦ ™ˆ¢ í߈¢ˆ¢ ºˆ¢ šeˆ¢ Ù¢ˆ¢ Ù¢ž•«† Ù¢ˆ¢«† Ù¢ž• ‡ Ù¢ˆ¢ ‡ Ù¢ž•‹ˆ Ù¢ˆ¢‹ˆ Ù¢ž•îˆ Ù¢ˆ¢îˆ Ù¢ž•ü‰ Ù¢ˆ¢ü‰ Ù¢ž•çŠ Ù¢ˆ¢çŠ Ù¢ž•Ò‹ Ù¢ˆ¢Ò‹ Øž• ¿cž• Ù¢ž• ÃLž•Ë• é â â � åØ p„�þ2xË•¦’À¤ ÐLž•Ë• ÐLß” §
|
|||
|
|
Œ• ³ ž• µß â â � åØ p„�þ2xË•ÿy â â � åØ p„�þ2xË•Ál ™ž• öø 8 â â � åØ p„�þ2x†Ÿÿy 8 â â � åØ p„�þ2x†ŸÁ” –úÊ©‡ª ¶ûÊ©‡ª �ïÊ©‡ª Û Ô Ô ÕÇ¿ Öˆ È߯5ºîl± Øùª Š ùª ¿cùª Ðìùª µßùªùª Š à à И ã§ äŒ å» É% ê`äçˆíŽí ¿cï« Øï« Ø í í ôÀ î‚ dÅb74F Ðìج µßجج ™Ø¬ ¿cج Ø ø ù úáÁ ûˆ ü ýùÁ þ – ÿ¨Â ßø>Þ›ï¼ Ðì¿ µß¿¿ ™¿ ¿c¿ Äcج ¾ ج ¿c ‰ Š ‹„à Œ �¡Ã {˜x&ÒD Øê® Ðìê® µßê®ê® ™ê® Äcê® ¾ ê® ; Ñ ±�� ¬
|
|||
|
|
��¥ âo gò ঠ�� ƒ¥ ¡Á ¨Û Ò� öÅ ¼Œ�²
|
|||
|
|
¬
|
|||
|
|
þ ê € ýË
|
|||
|
|
±
|
|||
|
|
í
|
|||
|
|
Ó
|
|||
|
|
˜ õ
|
|||
|
|
Á ¢Š�æ âØ Ôì àï í€ ø� ‰¥ Œ© AÍ ±¡ ƒÄ ©ç ̃ ¡¤ ‹Å ¨î Ò“ ö´ ›Ø ¼‘ à° —” œø ò’ Œ ® £ Å ¾ ê ã ¸
|
|||
|
|
¬
|
|||
|
|
�
|
|||
|
|
ê •
|
|||
|
|
ý®
|
|||
|
|
›
|
|||
|
|
Ï
|
|||
|
|
±
|
|||
|
|
ñ
|
|||
|
|
Ó
|
|||
|
|
� õ
|
|||
|
|
Å ¢ô Éù ë‘ ü� Çë âÛ Ôé àö í‡ øŽ ‰ì
|
|||
|
|
ô
|
|||
|
|
ü ¬
|
|||
|
|
ì
|
|||
|
|
ó
|
|||
|
|
ú�Ý
|
|||
|
|
ä âù
|
|||
|
|
ÿ�Ž ƒµ ©Ø Ìõ ¡– ‹² ¨à Ò€ ö¥ ›Ê ¼ø ठ—ó ê ‹
|
|||
|
|
ý¤
|
|||
|
|
›
|
|||
|
|
½
|
|||
|
|
±
|
|||
|
|
ß
|
|||
|
|
Ó
|
|||
|
|
� õ
|
|||
|
|
¢Ö Éï ë‡ ü“ ƒº ©Ý Ìù ¡š ‹· ¨ä Ò… öª ›Î ¼€ à÷ ê Ž
|
|||
|
|
ý§
|
|||
|
|
›
|
|||
|
|
Ä
|
|||
|
|
±
|
|||
|
|
æ
|
|||
|
|
Ó
|
|||
|
|
Œ õ
|
|||
|
|
· ¢Ý É– ƒ½ ©à Ìü ¡� ‹º ¨ç Òˆ ö ›Ñ ¼† àù ê �
|
|||
|
|
ý©
|
|||
|
|
›
|
|||
|
|
â Éš ƒÁ ©ä Ì€ ¡¡ ‹¾ ¨ë ÒŒ ö± ›Õ ¼Œ ଠ—ü ê “
|
|||
|
|
ý¬
|
|||
|
|
›
|
|||
|
|
È
|
|||
|
|
±
|
|||
|
|
ê
|
|||
|
|
Ó
|
|||
|
|
” õ
|
|||
|
|
¾ ¢ç ÉŽ ü¥ ƒÈ ©ë ̇ ¡É ¨ò Ò— ö¸ ›Ü ¼€
|
|||
|
|
„
|
|||
|
|
ˆ�¶ ¬
|
|||
|
|
„
|
|||
|
|
ê ˜
|
|||
|
|
ý„
|
|||
|
|
‡�· âÍ ¨Î œè ¬
|
|||
|
|
ó œü ¬
|
|||
|
|
‡ œ� ¬
|
|||
|
|
› œ¤ ¬
|
|||
|
|
¯ œ¸ ¬
|
|||
|
|
à œÌ ¬
|
|||
|
|
× œà ¬
|
|||
|
|
ë œ‚ ¬
|
|||
|
|
� ¬
|
|||
|
|
» Ç• âš Çž ⣠ǧ ⬠ǰ ⵠǹ â¾ Ç âÇ ÇË âÐ Çš âË ¬
|
|||
|
|
Ú Œß ä Aé ±ï ¬
|
|||
|
|
ó Œö ù Aü ±˜ œŸ œ¦ œ¶» ¬
|
|||
|
|
“ ǘ Ç� ¢ Ç©» âÞ Ôò íƒ ø“ ‰¾ œÄ ¬
|
|||
|
|
¯ ÇÀ âô í… ø• ‰Á œ± ÇÅ œ´ ÇÉ œ· ÇÓ œî ¬
|
|||
|
|
ø œ‚ ¬
|
|||
|
|
Œ œ– ¬
|
|||
|
|
œª ¬
|
|||
|
|
´ œ¾ ¬
|
|||
|
|
È œÒ ¬
|
|||
|
|
Ü œæ ¬
|
|||
|
|
𠜉 ¬
|
|||
|
|
• ¬
|
|||
|
|
ì ¬
|
|||
|
|
ú ¬
|
|||
|
|
š ¬
|
|||
|
|
Ÿ ⧠¬
|
|||
|
|
® ¬
|
|||
|
|
« Ⱡ⤠⯠âÏ
|
|||
|
|
Õ
|
|||
|
|
Û
|
|||
|
|
á
|
|||
|
|
× ÔÚ Ôæ àÝ Ôñ í‚ ø’ ‰€ íƒ ‰‚ í… ‰é ¾Œ"(Ø ¿c(šÇL
|
|||
|
|
–ùM:ŒMšÃM…òPi³ “Ù¢"x Âî × îµß!™díß1ºše³" æw ù ÃLÐL � ®öø–ú¶û�ïÛŠ ÐìÄc ¾ ¬ê Të Í Ì‚
|
|||
|
|
¼‚
|
|||
|
|
Àï« , üê1 # 3 š üÆV ® ,â É ® „ 9Ð Í _Á tø
|
|||
|
|
dø
|
|||
|
|
Ñ + T�
|
|||
|
|
D�
|
|||
|
|
±Bï« - üÜV � ˆíŽí ± ¸ ü°ˆ ¯ Ðì $Í ËË HashTableÁ Î@ ]=½5K } ªª«Ì� ÿ~Ö”xüËf / ªBªB ö B bufÁ÷< ®B‘÷< 9)
|
|||
|
|
-ÜnL﫾‚ J Õ
|
|||
|
|
ü½3 ü¿1 üÀ <À 1 ‰‚ ï S ` " ( . ø £ üè� ‰‚ ,¤
|
|||
|
|
ï« <‡ ’Ç ¼ ºÆ » ¡Ç ¼ ½Ç Ä Ó. Y üÖ > üß 3 üå - ôæ <æ 0 ‰‚ ‘
|
|||
|
|
X f $ * 0 † “
|
|||
|
|
¥ ™
|
|||
|
|
š
|
|||
|
|
¤ üþœ ‰‚ L ¡Ç <¡ ÅÉ ÷ ÅÉ ö ÅÉ þ ¿È ÷ ¡Ç ø ÿÉ Ó? i
|
|||
|
|
¬¢ ³ «ˆíŽí ï« E R _ ŸÇ µ €
|
|||
|
|
‡ „¢
|
|||
|
|
£ˆíŽí � ± ¶ ½ « üõ
|
|||
|
|
H ’Ç D� ’Ç ý ŸÇ ý çÊ çÊ éÊ ´ çÊ ! M ï« C R « † çÊ n éÊ ` ~ ì <µ ˆíŽí éÊ 7 E S ÒÉ » z
|
|||
|
|
� ¤
|
|||
|
|
¤ˆíŽí ‘ § « ¼ Í Â Ã üëX ÅÉ d‰ ÅÉ ÅÉ ÒÉ €Î €Î $ éÊ º €Î 7 X ï« Y i ’ €Î … éÊ a • dÁ ¡Ç ”Á
|
|||
|
|
Î
|
|||
|
|
Úsï« < ,Î Ò Ù ¯ ü–C ,± ’Ç ,§ ŸÇ † 5 dØ ¡Ç ¼Ø
|
|||
|
|
Då
|
|||
|
|
Ûsï« < Tå î õ ° ü©L $É ’Ç ,¿ ŸÇ … 4 l« ¡Ç \� ! 3 D ,ž dÌ ,Ì
|
|||
|
|
$$Ò
|
|||
|
|
úˆíŽí 9 4Ò × ”Ç Û¼ ˆí Ží Ø â ü– o $÷ Û¼ ªÕ * ‹ · üÞ ü¹ *
|
|||
|
|
ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙªÕ „û ’Ç ,ñ ŸÇ Ï ½ Å Í Ô ï« ŽªÕ ~ °× Q ÎM· Ï Œ² ¡Ç \¤ % - ? P ,¥ |× ,×
|
|||
|
|
|
|||
|
|
|
|||
|
|
%<Ý
|
|||
|
|
ûˆíŽí
|
|||
|
|
: LÝ å
|
|||
|
|
¬Ò Û¼¬Õ Ží æ ð ü� v $… Û¼ òÙ * ™ ¸ üÙ À üÄ - ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙòÙ ¤þ ÅÉ Lð ÒÉ Û È ½Ç Ñ Ù á è ï« –òÙ … þÛ † Z ÎM¿ Ø l� ¡Ç T‚ ! 3 D $‡ \° $°
|
|||
|
|
$$µ òÔ / 4µ º Œ« Û¼ªÕ » Å üû m $Ú Û¼ ªÕ * î ¹ üÄ ª ü� )
|
|||
|
|
¯Ö „à ’Ç ,Ö ŸÇ u c k s z °× 1ªÕ ! °× " N ‹Z ‡ Œ’" ¡Ç T…" % - ? P $Š" t·" $·"
|
|||
|
|
|
|||
|
|
|
|||
|
|
%<¼" ºÙ
|
|||
|
|
0 L¼" Ä"
|
|||
|
|
¤²" Û¼òÙ Å" Ï" üþ!t $ä" Û¼ òÙ * ø" º ü»!½ ü¤", ôÚ ¤ß! ÅÉ LÑ! ÒÉ „ q ½Ç z ‚ Š ‘ þÛ <òÙ + þÛ , W ‹e � ä¨% d¨% ¡Ç ,¾% 5
|
|||
|
|
< Dµ%
|
|||
|
|
¶tï« M 8 |µ% Ã% ,—% ŸÇ 4ž% ŸÇ Ä% ¼Ï% ,à%
|
|||
|
|
|
|||
|
|
#
|
|||
|
|
*„Ï% ÃË
|
|||
|
|
0 F J å%
|
|||
|
|
Äè% 4ù%
|
|||
|
|
|
|||
|
|
#
|
|||
|
|
*„è%ÃË
|
|||
|
|
0 F J ÿ%
|
|||
|
|
üÎ%3 €& †& ‡& » üË$¼ ü’%u ’Ç’Ç tù$ ’Ç ,á$ ,è$ ŸÇ ~ ŸÇ o ŸÇŸÇ ŸÇ ú ’Ç w ’Ç € ŸÇ { ’Ç 3 ’Ç < ŸÇ 7 { Ö ÎM secondÁú Ø ü×( d×( ¡Ç ,ñ( 7
|
|||
|
|
> dä(
|
|||
|
|
·tï« N 8 œä( ö( ,Æ( ÒÉ 4Í( ÒÉ ÷( Ü‚) ,—)
|
|||
|
|
|
|||
|
|
$
|
|||
|
|
+¤‚) ÐÎ
|
|||
|
|
1 G K œ)
|
|||
|
|
äŸ) 4´)
|
|||
|
|
|
|||
|
|
$
|
|||
|
|
+¤Ÿ)ÐÎ
|
|||
|
|
1 G K º)
|
|||
|
|
ü�); ») Á) Â) ¼ üê'Ø üÁ(� ÅÉÅÉ ´ ( ÅÉ L„( ,�( ÒÉ ƒ ÒÉ t ÒÉÒÉ ÒÉ ÿ ÅÉ | ÅÉ … ÒÉ € ÅÉ 6 ÅÉ ? ÒÉ : { Ö ÎM ”èú Ô üŸ+$ dŸ+ ¡Ç ,½+ 6
|
|||
|
|
=„¬+
|
|||
|
|
ºtï« M 8 ¼¬+ Â+ w ¬‡+
|
|||
|
|
,�+ Û –è ŸÇ 4”+ Û –èŸÇ ü×+3 ¼Ø+
|
|||
|
|
,é+ #
|
|||
|
|
*„Ø+ ÃË 0 F J
|
|||
|
|
î+ Äñ+
|
|||
|
|
4‚, #
|
|||
|
|
*„ñ+ÃË 0 F J
|
|||
|
|
ˆ, Ç
|
|||
|
|
|
|||
|
|
‰,
|
|||
|
|
|
|||
|
|
üÒ+9 Û¼âç Š, ”, ü€+· ! $©, Û¼ âç + ½, ½ ü©*” üÄ+Q ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙâç ´ß* ’Ç ,Ç* ,Î* ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ–è ŸÇ ö ž ŸÇ — ŸÇ }âç c ’Ç c ’Ç l ŸÇ g ’Ç ’Ç ( ŸÇ # Ì ÖÐ ÎM ”èí d ü².( d². ¡Ç ,Ô. 7
|
|||
|
|
>¤¿.
|
|||
|
|
»tï« N 8 Ü¿. Ù. x ¬š.
|
|||
|
|
, . Û »í ÒÉ 4§. Û »íÒÉ üî.; Üï.
|
|||
|
|
,„/ $
|
|||
|
|
+¤ï. ÐÎ 1 G K
|
|||
|
|
‰/ äŒ/
|
|||
|
|
4¡/ $
|
|||
|
|
+¤Œ/ÐÎ 1 G K
|
|||
|
|
§/ Ë
|
|||
|
|
|
|||
|
|
¨/
|
|||
|
|
|
|||
|
|
üé.A Û¼‡í ©/ ³/ ü“.à ! $È/ Û¼ ‡í + Ü/ ¾ ü¬-° üÛ.Y ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ‡í ôê- ÅÉ LÎ- ,Ù- ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ»í
|
|||
|
|
ÒÉ
|
|||
|
|
ú ¢ ÒÉ › ÒÉ �‡í g ÅÉ g ÅÉ p ÒÉ k ÅÉ ! ÅÉ * ÒÉ % Ì ÖÐ ÎM ”èñ d l«1 ¡Ç ”–1 ! 3 D ,—1 $ž1 üÌ1& dÍ1
|
|||
|
|
,Í1
|
|||
|
|
$$Ó1 òÔ /
|
|||
|
|
4Ó1 Ø1 ´Û1
|
|||
|
|
$ì1 #
|
|||
|
|
*„Û1 ÃË 0
|
|||
|
|
F J
|
|||
|
|
ð1 µ
|
|||
|
|
ñ1
|
|||
|
|
üÇ1, Û¼ªÕ’Ç ò1
|
|||
|
|
ü1 ü�1� ! $‘2 Û¼ ΀ + ¥2 ¿ üÈ0Ý ü¹1D ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ΀ Ìë0 ’Ç ,á0 ŸÇ l Z b j q °× ( ŸÇ ΀ ªÕ °× ’Ç Í ’Ç Ö ŸÇ Ñ { ÎM~ restÁu Œ¦4 ¡Ç ”‘4 % - ? P ,’4 $™4 üË4-
|
|||
|
|
|Ì4 ,Ì4
|
|||
|
|
%<Ò4 ºÙ 0 LÒ4 Ú4 ÔÝ4
|
|||
|
|
$ò4 $
|
|||
|
|
+¤Ý4 ÐÎ 1 G K
|
|||
|
|
ö4 ¸
|
|||
|
|
|
|||
|
|
÷4
|
|||
|
|
üÆ43 Û¼òÙÅÉ
|
|||
|
|
ø4
|
|||
|
|
‚5 üŠ4› ! $—5 Û¼ ñ† + «5 À ü³3ø ü¸4K ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙñ† üÞ3! ÅÉ LÐ3 ÒÉ l ½Ç u } … Œ þÛ 7 ÒÉ &ñ† òÙ þÛ ÅÉ Ù ÅÉ â ÒÉ Ý „ ÎM� ¿‚€ l÷6 ¡Ç Œã6 ! 3 D $ä6 $ï6 ü˜7% \™7
|
|||
|
|
$™7
|
|||
|
|
$$ž7 òÔ /
|
|||
|
|
4ž7 £7 ´¦7
|
|||
|
|
$·7 #
|
|||
|
|
*„¦7 ÃË 0
|
|||
|
|
F J
|
|||
|
|
»7 µ
|
|||
|
|
¼7
|
|||
|
|
ü“7+ ۼ΀ ½7
|
|||
|
|
Ç7 üÜ6Ž ! $Ü7 Û¼ ΀ + ð7 Á ü–6Ú ü…7C Ú� ̸6 ’Ç ,®6 ŸÇ " ' ŸÇ Þ °× Î΀ ¾ ªÕ ¾ °× ¿ ’Ç ƒ ’Ç Œ ŸÇ ‡ { ¿‚5 ‹( Á Œî9 ¡Ç ŒÚ9 % - ? P $Û9 $æ9 ü“:,
|
|||
|
|
t”: $”:
|
|||
|
|
%<™: ºÙ 0 L™: ¡: Ô¤:
|
|||
|
|
$¹: $
|
|||
|
|
+¤¤: ÐÎ 1 G K
|
|||
|
|
½: ¸
|
|||
|
|
|
|||
|
|
¾:
|
|||
|
|
üŽ:2 Û¼ñ†
|
|||
|
|
¿:
|
|||
|
|
É: üÓ9™ ! $Þ: Û¼ ñ† + ò:  üý8õ ü€:J ý‡ ü§9! ÅÉ L™9 ÒÉ 5 " ½Ç + 3 ; B ÒÉ í þÛ Üñ† Ë òÙ Ë þÛ Ì ÅÉ � ÅÉ ˜ ÒÉ “ „ ¿‚D ‹6 Ë \¯'
|
|||
|
|
L¯'
|
|||
|
|
¯ˆíŽí 1 dÈ' ü’'M ¬
|
|||
|
|
ˆíŽí ñ Þ' å' ä' üÖ&� Ç
|
|||
|
|
ßð $ƒ' ñ dï& Ðì Ì ñ Ÿ Þ` N
|
|||
|
|
ü¯0 ü±. ì² <² 0 ˆ¢ Þ R _ " ( . ç Ì üÝŠ ˆ¢ ,–
|
|||
|
|
à à И ã§ äŒ å» É% ê`äçË• <ü ¹˜ ᗠȘ ™
|
|||
|
|
Ó2 ¤
|
|||
|
|
¬Ý î ÒË• ɘ A N [ Ƙ ð |
|
|||
|
|
ƒ „Ý
|
|||
|
|
ÌË• • ¥ © ñ ø Ò ü° H ¹˜ DÊ ¹˜ õ Ƙ õ ’š ý ’š ”š ï ’š L ɘ : I Ò … ’š e ”š ` u dá Ș ”á
|
|||
|
|
î
|
|||
|
|
Úsɘ < ,î ò ù Ô ü¶ C ,Ñ ¹˜ ,Ç Æ˜ † 5 dê
|
|||
|
|
Ș ¼ê
|
|||
|
|
|
|||
|
|
D÷
|
|||
|
|
|
|||
|
|
Ûsɘ < T÷
|
|||
|
|
€ ‡ Õ ü»
|
|||
|
|
L $Û
|
|||
|
|
¹˜ ,Ñ
|
|||
|
|
Ƙ … 4 l‘ Ș \ƒ ! 3 D ,„ T² Ë• „ Û¼ Ë• ¼ Æ üüm $Û Û¼ ö * ï Ù üÊ¥ üŸ(
|
|||
|
|
ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙö Tç ¹˜ ,Ý Æ˜ £ ‘ ™ ¡ ¨ ɘ bö R ö [ Q ÎM‹ Ï lÖ È˜ TÉ ! 3 D $Î L÷ Ë• |ò Û¼ö € Š üÂk $Ÿ Û¼ ö * ³ Ú ü‘¢ üä'
|
|||
|
|
ù¡ T ¹˜ ,£ Ƙ [ I Q Y ` ú¢ ö ö N ‹@ ‡ äã dã Ș ,ù 5
|
|||
|
|
< Dð
|
|||
|
|
¶tɘ M 8 |ð þ ,Ò Æ˜ 4٠Ƙ ÿ ¼Š ,›
|
|||
|
|
|
|||
|
|
#
|
|||
|
|
*„Š îš
|
|||
|
|
0 F J
|
|||
|
|
Ä£ 4´
|
|||
|
|
|
|||
|
|
#
|
|||
|
|
*„£îš
|
|||
|
|
0 F J º
|
|||
|
|
ü‰3 » Á Â Û ü†¼ üÍu ¹˜¹˜ t´ ¹˜ ,œ ,£ Ƙ ~ Ƙ o ƘƘ Ƙ ú ¹˜ w ¹˜ € Ƙ { ¹˜ 3 ¹˜ < Ƙ 7 { Ö ÎM ”èõ Ó üŸ$ dŸ Ș ,½ 6
|
|||
|
|
=„¬
|
|||
|
|
ºtɘ M 8 ¼¬  w ¬‡
|
|||
|
|
,� Û „« Ƙ 4” Û „«Æ˜ ü×3 ¼Ø
|
|||
|
|
,é #
|
|||
|
|
*„Ø îš 0 F J
|
|||
|
|
î Äñ
|
|||
|
|
4‚ #
|
|||
|
|
*„ñîš 0 F J
|
|||
|
|
ˆ Ç
|
|||
|
|
|
|||
|
|
‰
|
|||
|
|
|
|||
|
|
üÒ9 ۼЪ Š ” ü€· ! $© Û¼ Ъ + ½ Ü ü©” üÄQ ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙЪ ´ß ¹˜ ,Ç ,Πۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ„« Ƙ ö ž Ƙ — Ƙ }Ъ c ¹˜ c ¹˜ l Ƙ g ¹˜ ¹˜ ( Ƙ # Ì ÖÐ ÎM ”èí d lý Ș ”è ! 3 D ,é $ð üž $ TŸ
|
|||
|
|
Ë•
|
|||
|
|
´«
|
|||
|
|
$¼ #
|
|||
|
|
*„« îš 0
|
|||
|
|
F J
|
|||
|
|
À •
|
|||
|
|
Á
|
|||
|
|
ü™ * Û¼ö ¹˜ Â
|
|||
|
|
Ì üá Ž ! $á Û¼ ¸¶ + õ Ý ü Õ ü‹ B ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ¸¶ œÃ ¹˜ ,¹ Ƙ R @ H P W ú¢ Ƙ þ¸¶ î ö î ö ÷ ¹˜ Ó ¹˜ Ü Æ˜ × { ÎMd ¿‚X l² Ș Œž ! 3 D $Ÿ $ª üÓ # LÔ
|
|||
|
|
Ë•
|
|||
|
|
´ß
|
|||
|
|
$ð #
|
|||
|
|
*„ß îš 0
|
|||
|
|
F J
|
|||
|
|
ô •
|
|||
|
|
õ
|
|||
|
|
üÎ ) Û¼¸¶ ö
|
|||
|
|
€ ü— Œ ! $• Û¼ ¸¶ + © Þ ü× Ò üÀ A Ê· œù ¹˜ ,ï Ƙ ö þ
|
|||
|
|
Ƙ Ä ú¢ ´¸¶ ¤ ö ¤ ö ¹˜ ‰ ¹˜ ’ Ƙ � { ¿‚ ‹ Á ü•$# d«$
|
|||
|
|
# ¥$
|
|||
|
|
Ç
|
|||
|
|
Ë• Ñ• ; M ·$ üù#J â Ë•Ñ• Â$ É$ ü½#Œ ÷ ž• $ê# Ñ• dÖ# ¬
|
|||
|
|
¬
|
|||
|
|
°
|
|||
|
|
í ±
|
|||
|
|
Þ` ‚ ø �Ãx¶*ÓË• Ñ• þ Ñ• ý Þ`\ Ž LÝ. ˆí å. ì. ô üµ.7 ¬Õ Ð. °× ,Æ. ¬Õ d 6 \›/ Ží ¥/ ¬/ õ üñ.; ²Õ Ž/ °× ,„/ ²Õ d 6 |ã/ Ží ! ñ/ 7 ÷/ ø/ ö ü±/G ÷Ù 4Ò/ þÛ LÄ/ ÷Ù ‚ ÷Ù Š >
|
|||
|
|
LÓ1 ˆí \Þ1 Ží ÄÒ1 é1 ð1 ú ü§1I ªÕ D¿1 °× ,µ1 ¬Õ » ¬Õ à ²Õ ž ²Õ ¦ + N
|
|||
|
|
L¬2 ˆí |·2 Ží ! ä«2 Æ2 Í2 û üõ1X òÙ d”2 þÛ L†2 ¬Õ ½ ¬Õ Å ÷Ù ÷Ù ¨ + N
|
|||
|
|
lŠ3 ˆí ! |™3 Ží ! ü‰3 ¨3 ¯3 ü üÒ2] ˆí÷Ù „î2 þÛ Là2 ÝÉ È ÝÉ Ð ÷Ù © ÷Ù ± + V DŸ Œ ™ëŸë " ‘ / Œ � ‘†$ ’ˆ “ ”£$ •ˆ A'YŠ¯y! ™ëŸë ‰ Å
|
|||
|
|
Ø Ö ü
|
|||
|
|
ŒF¾2
|
|||
|
|
\›º ™ëŸë Õ Ü 4ú Œ ™ëŸë " ” / êÊ ; A A ² EØ F§ GŒ N½ž–& ™ëŸë ‡ Ž D”V £ ™ëŸë¿ð & © 3 £ ¨ © †$ ª ˆ « ¬ £$ ˆ éö*(°TÓù ™ëŸë¿ð ‘ ¾ ¾ ›` Ã ß Ø Ä Þ` Ø ¬Ò°öá( ™ëŸë¿ð Ý ä 4øV £ ™ëŸë¿ð & ¬ 3 ôÍ ? ã ã –c è Ø Ø é Þ` Ø †@“äQE´Š ™ëŸë¿ð ‹ ’ œýg
|
|||
|
|
ë ëŸ ì ) ¸Ÿ 5 ëŸ = D „Ý( Ô Õ % ùª 1 8 ? ƒ6 ø ú % ¿ 1 –H–H ôÀ —H‚ÿ 㤉n¸F d k êñ‚È ÔÕàí‰øí ¤,# À ç# Ð ¬½ ë í Dü ì ý ¬Ô í š!DÙ î Dß& ¬
|
|||
|
|
ç� Dý& â è
|
|||
|
|
EquivalentÁT›' éü ÕI ü K H [`IndexMap`] is a hash table where the iteration order of the key-valueÁ üX8 5 pairs is independent of the hash values of the keys.Á ‘ú ü•N K [`IndexSet`] is a corresponding hash set using the same implementation andÁ ää with similar properties.Á �ú ”… ### HighlightsÁ ˜ú üœO L [`IndexMap`] and [`IndexSet`] are drop-in compatible with the std `HashMap`Á üì< 9 and `HashSet`, but they also have some features of note:Á ©ú üB ? - The ordering semantics (see their documentation for details)Á üð@ = - Sorting methods and the [`.pop()`][IndexMap::pop] methods.Á ü±O L - The [`Equivalent`] trait, which offers more flexible equality definitionsÁ ü�2 / between borrowed and owned versions of keys.Á ü´M J - The [`MutableKeys`][map::MutableKeys] trait, which gives opt-in mutableÁ ü‚M J access to map keys, and [`MutableValues`][set::MutableValues] for sets.Á Ðú ¬Ô ### Feature FlagsÁ êú üîJ G To reduce the amount of compiled code in the crate by default, certainÁ ü¹O L features are gated behind [feature flags]. These allow you to opt in to (orÁ ü‰L I out of) functionality. Below is a list of the features available in thisÁ TÖ crate.Á áú üåO L * `std`: Enables features which require the Rust standard library. For moreÁ üµ 0 - information see the section on [`no_std`].Á üæ E B * `rayon`: Enables parallel iteration and other parallel methods.Á ü¬
|
|||
|
|
I F * `serde`: Adds implementations for [`Serialize`] and [`Deserialize`]Á üö
|
|||
|
|
G D to [`IndexMap`] and [`IndexSet`]. Alternative implementations forÁ ü¾ N K (de)serializing [`IndexMap`] as an ordered sequence are available in theÁ ü� [`map::serde_seq`] module.Á ü® N K * `arbitrary`: Adds implementations for the [`arbitrary::Arbitrary`] traitÁ üý ' $ to [`IndexMap`] and [`IndexSet`].Á ü¥
|
|||
|
|
P M * `quickcheck`: Adds implementations for the [`quickcheck::Arbitrary`] traitÁ üö
|
|||
|
|
'Çâ üžO L * `borsh` (**deprecated**): Adds implementations for [`BorshSerialize`] andÁ üîL I [`BorshDeserialize`] to [`IndexMap`] and [`IndexSet`]. Due to a cyclicÁ ü»L I dependency that arose between [`borsh`] and `indexmap`, `borsh v1.5.6`Á üˆM J added an `indexmap` feature that should be used instead of enabling theÁ œÖ feature here.Á êú üî9 6 _Note: only the `std` feature is enabled by default._Á ¨ú ü¬a ^ [feature flags]: https://doc.rust-lang.org/cargo/reference/manifest.html#the-features-sectionÁ üŽ, ) [`no_std`]: #no-standard-library-targetsÁ ü», ) [`Serialize`]: `::serde_core::Serialize`Á üè0 - [`Deserialize`]: `::serde_core::Deserialize`Á ü™1 . [`BorshSerialize`]: `::borsh::BorshSerialize`Á üË5 2 [`BorshDeserialize`]: `::borsh::BorshDeserialize`Á Ä� [`borsh`]: `::borsh`Á üš6 3 [`arbitrary::Arbitrary`]: `::arbitrary::Arbitrary`Á üÑ8 5 [`quickcheck::Arbitrary`]: `::quickcheck::Arbitrary`Á Šú ÌŽ ### Alternate HashersÁ ¨ú ü¬< 9 [`IndexMap`] and [`IndexSet`] have a default hasher typeÁ üé0 - [`S = RandomState`][std::hash::RandomState],Á üšI F just like the standard `HashMap` and `HashSet`, which is resistant toÁ üäP M HashDoS attacks but not the most performant. Type aliases can make it easierÁ ìµ to use alternate hashers:Á Óú <× ```Á äß use fnv::FnvBuildHasher;Á üü' $ use indexmap::{IndexMap, IndexSet};Á ¤ú ü¨< 9 type FnvIndexMap<K, V> = IndexMap<K, V, FnvBuildHasher>;Á üå6 3 type FnvIndexSet<T> = IndexSet<T, FnvBuildHasher>;Á œú ü 0 - let std: IndexSet<i32> = (0..100).collect();Á üÑ3 0 let fnv: FnvIndexSet<i32> = (0..100).collect();Á Ì… assert_eq!(std, fnv);Á <Ÿùî §ú ¤« ### Rust VersionÁ Àú üÄ9 6 This version of indexmap requires Rust 1.85 or later.Á þú ü‚K H The indexmap 2.x release series will use a carefully considered versionÁ üÎK H upgrade policy, where in a later 2.x version, we will raise the minimumÁ Ôš required Rust version.Á µ ú ü¹ " ## No Standard Library TargetsÁ Ü ú üà M J This crate supports being built without `std`, requiring `alloc` instead.Á ü® J G This is chosen by disabling the default "std" cargo feature, by addingÁ üù @ = `default-features = false` to your dependency specification.Á º ú ü¾ = : - Creating maps and sets using [`new`][IndexMap::new] andÁ üü N K [`with_capacity`][IndexMap::with_capacity] is unavailable without `std`.Á üË P M Use methods [`IndexMap::default`], [`with_hasher`][IndexMap::with_hasher],Á üœ O L [`with_capacity_and_hasher`][IndexMap::with_capacity_and_hasher] instead.Á üì D A A no-std compatible hasher will be needed as well, for exampleÁ ü±!! from the crate `twox-hash`.Á üÓ!O L - Macros [`indexmap!`] and [`indexset!`] are unavailable without `std`. UseÁ ü£"S P the macros [`indexmap_with_default!`] and [`indexset_with_default!`] instead.Á êñ‚È ÔÕàí‰øíT ¤U ÀT Ð S ë í R ì ý Q í š!P î O ¬
|
|||
|
|
ç� N â è�ÓD éóöù” #ð„Ú#ålí# Lñ# Lü# ,€$ \…†�’—ž ¢Á$ˆ ÷< zö Ž ªB {í ž ë | RangeBoundsÁ\² ¤# }
|
|||
|
|
hash_tableÁTÎ › ~«"tì ú И4ˆ à ��ÓT� ‚ éÇ¿Lœ Ô ƒÇ¿ Õ ƒôÀ|§ í „Å
|
|||
|
|
l Š²\¯ A ‹˜\Õ g ŒLÞ ,âAИ4 à �¨$ �
|
|||
|
|
íT — áD& ’ Ç¿L< Ô
|
|||
|
|
Ç¿ Õ
|
|||
|
|
á#,X Œ ÿ Ç&d_ ± €
|
|||
|
|
®D} ¿ß í ‘ ë , Ådzµ¥§—™„5 ‹TK jlXZœr IL‹ <ô— §
|
|||
|
|
œ § Íì™ë ÍìŸë £ Œ � ‘†$ ’ˆ “ ”£$ •ˆ A'YŠ¯y! §
|
|||
|
|
™ëŸë œ su oq ü¼d Ê §
|
|||
|
|
� � ¨ �Ä ‘Ó ê9œÒž”²™ëŸëùª™ë„ ™™ë �
|
|||
|
|
§
|
|||
|
|
™ëŸëØ Î §$ç Œ ø ü…" ü˜F C A view into an occupied entry in an [`IndexMap`][crate::IndexMap].Á üß% " It is part of the [`Entry`] enum.Á l� §
|
|||
|
|
œ § Œ„ ¢ �„ ¥ ™ë §
|
|||
|
|
¼® Ÿë §
|
|||
|
|
Õê ŒF¾2
|
|||
|
|
\›º ž IK NP L ® È…dÈ ,È lÚ 4Ú üì& §
|
|||
|
|
œ ! § " ! " Œ„ õ �„ ø Õê#&'()*+,-./012345678: ñ @B EG üÊÀ LØ È…ùªâÿÖ¿Ù¿ Ú¿« Û¿ˆ Ü¿ Ý¿Þ¿ˆ ‚†f|Â
|
|||
|
|
ÕêÈ… — $ $ Íìâÿ â ˜ “"âÿ ˜™ë Œø ˜ âÿœŒ˜" $…
|
|||
|
|
|
|||
|
|
# §
|
|||
|
|
™ëŸëâÿØ î §$� is_matchÁD¬ y{ ŒÇ
|
|||
|
|
# <closure_kind>Á % <closure_signature>Á % <upvars>Á % % # % ™ëŸëâÿ — — âÿ
|
|||
|
|
à à И ã§ äŒ å» É% ê`äç™ëŸë ü„
|
|||
|
|
3 L’
|
|||
|
|
ÕêÈ…
|
|||
|
|
& §
|
|||
|
|
™ëŸë$œ
|
|||
|
|
üÖ
|
|||
|
|
0 Tä
|
|||
|
|
™ ™Õê ™³Ž ï
|
|||
|
|
|
|||
|
|
' §
|
|||
|
|
™ëŸë$ð
|
|||
|
|
üº< tÈ š šÕê š³Ž ×
|
|||
|
|
( §
|
|||
|
|
™ëŸë$Ü ü®7 \¼ Õê §
|
|||
|
|
³Ž
|
|||
|
|
) §
|
|||
|
|
™ëŸë$È äÚ ü�* ' Return the index of the key-value pairÁ,á › ›Õê ç
|
|||
|
|
* §
|
|||
|
|
™ëŸë$è ¼Ú ü—3 0 Gets a reference to the entry's key in the map.Á Ï ú ü×] Z Note that this is not the key that was used to find the entry. There may be an observableÁ ü¹_ \ difference if the key type has any distinguishing features outside of `Hash` and `Eq`, likeÁ ü�8 5 extra fields or the memory address of an allocation.Á á œ œÕê œ™ë å
|
|||
|
|
+ §
|
|||
|
|
™ëŸë$æ ¼Ø üž5 2 Gets a reference to the entry's value in the map.Á ß � �Õê �Ÿë ã
|
|||
|
|
, §
|
|||
|
|
™ëŸë$ä üì# üž= : Gets a mutable reference to the entry's value in the map.Á à ú üèD A If you need a reference which may outlive the destruction of theÁ ü±6 3 [`Entry`] value, see [`into_mut`][Self::into_mut].Á<ó ž žÕê žŸë û
|
|||
|
|
- §
|
|||
|
|
™ëŸë$€ üÂ" üÆF C Converts into a mutable reference to the entry's value in the map,Á ü‘, ) with a lifetime bound to the map itself.ÁDÉ Õê §
|
|||
|
|
Ÿë
|
|||
|
|
. §
|
|||
|
|
™ëŸë$Ò üë' ü˜N K Sets the value of the entry to `value`, and returns the entry's old value.Á4ò Ÿ ŸÕêŸëŸë ù
|
|||
|
|
/ §
|
|||
|
|
™ëŸë$þ »,„ ă üÌV S Remove the key, value pair stored in the map for this entry, and return the value.Á § ú ü¯Y V **NOTE:** This is equivalent to [`.swap_remove()`][Self::swap_remove], replacing thisÁ ü� Y V entry's position with the last element, and it is deprecated in favor of calling thatÁ üë V S explicitly. If you need to preserve the relative order of the keys in the map, useÁ üÆ 4 1 [`.shift_remove()`][Self::shift_remove] instead.Á ]`remove` disrupts the map order -- use `swap_remove` or `shift_remove` for explicit behavior.Áü“ i üÿ 4Š Õ ) ÕêŸë
|
|||
|
|
0 §
|
|||
|
|
™ëŸë$‘ ìÉ" üÄ V ‹� Ÿ ú ü§ _ \ Like [`Vec::swap_remove`][alloc::vec::Vec::swap_remove], the pair is removed by swapping itÁ ü‹!8 5 with the last element of the map and popping it off.Á üÈ!G D **This perturbs the position of what used to be the last element!**Á ”" ú üœ"( % Computes in **O(1)** time (average).Á\Ð" ÕêŸë
|
|||
|
|
1 §
|
|||
|
|
™ëŸë$Ü" ô‘& ü—#V ‹� ò# ú üú#] Z Like [`Vec::remove`][alloc::vec::Vec::remove], the pair is removed by shifting all of theÁ üÜ$= : elements that follow it, preserving their relative order.Á üž%9 6 **This perturbs the index of all of those elements!**Á Ü% ú üä%( % Computes in **O(n)** time (average).Ád˜& ÕêŸë
|
|||
|
|
2 §
|
|||
|
|
™ëŸë$¥& ü¶+# üá&J G Remove and return the key, value pair stored in the map for this entryÁ °' ú ü¸'V S **NOTE:** This is equivalent to [`.swap_remove_entry()`][Self::swap_remove_entry],Á ü“([ X replacing this entry's position with the last element, and it is deprecated in favor ofÁ üó(_ \ calling that explicitly. If you need to preserve the relative order of the keys in the map,Á ü×)D A use [`.shift_remove_entry()`][Self::shift_remove_entry] instead.Á o`remove_entry` disrupts the map order -- use `swap_remove_entry` or `shift_remove_entry` for explicit behavior.Áü´*{ ü *‘ d
|
|||
|
|
,˜? LšA 8ªŒ 9 ÂŒ 9 ߌ 9 9 8 9 ™ëŸë üâB dåB Õê
|
|||
|
|
: §
|
|||
|
|
™ëŸë$òB ö¶øB üœDG §
|
|||
|
|
< œ = § > = > < Œ„ ¥D �„ ¨D Õê? ë ? ¡D ! $& üêD. $íD ¥ëÕê ; ;
|
|||
|
|
? §
|
|||
|
|
™ëŸë¹
|
|||
|
|
,òD LèF ?ªŒ @ ÂŒ @ ߌ @ @ ? @ ™ëŸë™¼®¼ü½H üÓGC @ A view into a vacant entry in an [`IndexMap`][crate::IndexMap].Á ü—H% À† \ÈH §
|
|||
|
|
B œ C § D D B C Œ„ ØH �„ ÛH ¬ˆ¼äH »ˆ A A ² EØ F§ GŒ N½ž–& §
|
|||
|
|
™ëŸë N½ž–& EFGÔH ƒ… ˆŠ � äH A A È…|�I $�I A A ùª4–I –I A A ™ëü¡I$ §
|
|||
|
|
I œ J § K K J I Œ„ ªI �„ I äÀLMNOPQRSVYZ ¦I ,. 13 ä�J üÌI< 9 Return the index where a key-value pair may be inserted.Á,”J ¡ ¡äÀ H šJ H
|
|||
|
|
L §
|
|||
|
|
™ëŸë$›J ¼›K üÖJ@ = Gets a reference to the key that was used to find the entry.Á ¢K ¢ ¢äÀ ¢™ë H ¦K H
|
|||
|
|
M §
|
|||
|
|
™ëŸë$§K üÒK* <àK £ £äÀ £™ë H èK H
|
|||
|
|
N §
|
|||
|
|
™ëŸë$íK ÔÞL ü L9 6 Takes ownership of the key, leaving the entry vacant.ÁDåL äÀ™ë H H
|
|||
|
|
O §
|
|||
|
|
™ëŸë$îL üÎN* ü—M] Z Inserts the entry's key and the given value into the map, and returns a mutable referenceÁ ŒùM to the value.Á �N ú ü—N2 / Computes in **O(1)** time (amortized average).Á4ÕN äÀŸë„œ H H
|
|||
|
|
P §
|
|||
|
|
™ëŸë$ÜN »,âN ü‹Q> üêO] Z Inserts the entry's key and the given value into the map, and returns an `OccupiedEntry`.Á ÌP ú üÔP2 ¨Èd’Q äÀŸëÕê H H
|
|||
|
|
Q §
|
|||
|
|
™ëŸë$ŸQ »,¥Q ü‘XT üÆTK H Inserts the entry's key and the given value into the map at its orderedÁ ü–UG D position among sorted keys, and returns the new index and a mutableÁ ÜâU reference to the value.Á ‚V ú üŠVG D If the existing keys are **not** already sorted, then the insertionÁ üÖVK H index is unspecified (like [`slice::binary_search`]), but the key-valueÁ ü¦W1 . pair is inserted at that position regardless.Á ÜW ú üäW( ܧl˜X äÀŸë „œ H H º™ë áX
|
|||
|
|
R §
|
|||
|
|
™ëŸë$¦X »,¬X üü]„ ü¨ZK ›Ë üøZH E position among keys sorted by `cmp`, and returns the new index and aÁ üÅ[# mutable reference to the value.Á í[ ú üõ[G ñÌ üÁ\K ÂÍ ü‘]1 —Î Ç] ú üÏ]( ܧ„ƒ^ äÀŸëâÿ„Ð H— T T H û‹ ”^ ¤ ¥ ¦ § “"âÿ ¤™ë ¥Ÿë ¦™ë §Ÿë üÞ^! ¤ ¥ ¦ § âÿœÓ˜" ¿ßÀßÁß LessÁ Âß ÃßÄß~ Åß ÆßÇß GreaterÁ Èß åºÝÈnûê7 D÷^
|
|||
|
|
S §
|
|||
|
|
™ëŸëâÿ$—^ »,�^ ‹ «^ 4ƒ` SªŒ U ÂŒ U ߌ U U S U ™ëŸëâÿ ™ë Ÿë üÓ âÿ€Ö†Öü»d‘ üÝ`K ›Ë üaL I position using a sort-key extraction function, and returns the new indexÁ üþa) & and a mutable reference to the value.Á ¬b ú ü´bG ñÌ ü€cK ÂÍ üÐc1 —Î †d ú üŽd( ܧ¤Âd äÀŸë—„Ð H“ W — X X W H Íì“ ×d Íì³Ø Úd ºíØ ©e ¨ © “"³Ø ¨™ë ©Ÿë ”¹e ¨ © ³Ø®Ù˜" íØ Êe
|
|||
|
|
V §
|
|||
|
|
™ëŸëíسØ$Ýd »,ãd sort_keyÁDñd ¶¸ ²´ ü�j> üÕgP M Inserts the entry's key and the given value into the map at the given index,Á üªhO L shifting others to the right, and returns a mutable reference to the value.Á þh ú ü†i- * ***Panics*** if `index` is out of bounds.Á ¸i ú üÀi( ܧ ²|íi dˆj € äÀ Ÿë„œ H H
|
|||
|
|
Y §
|
|||
|
|
™ëŸë$•j Ö,›j »,©j üÆmH ü»kL I Replaces the key at the given index with this entry's key, returning theÁ üŒl2 / old key and an `OccupiedEntry` for
|
|||
|
|
* —§
|
|||
|
|
Þ Þ — �ˆíŽíÖó™¼ §
|
|||
|
|
Öó §
|
|||
|
|
¡Ç ÍìˆíŽíÖó §
|
|||
|
|
œ w ³ �"žö ³ ””
|
|||
|
|
³ žöÊö˜" $¢
|
|||
|
|
–ö» ³¿ö- ³ãö — §
|
|||
|
|
œ§¢LÀ
|
|||
|
|
—ªŒ � ÂŒ � ߌ � � — �ˆíŽíÖó™¼ Öó ŸÇüû
|
|||
|
|
B\þ
|
|||
|
|
´ ´·Äùª ‘
|
|||
|
|
ž tableÁ,Š §$Ÿ Ö,° Lô ž ªŒ Ÿ ÂŒ Ÿ ߌ Ÿ Ÿ ž Ÿ™¼®¼ü�
|
|||
|
|
Md„
|
|||
|
|
µ µ·Äùª ˜
|
|||
|
|
|
|||
|
|
è÷,‘
|
|||
|
|
§$¦
|
|||
|
|
oldÁ ·
|
|||
|
|
æ Ã
|
|||
|
|
L… ªŒ ¡ ÂŒ ¡ ߌ ¡ ¡ ¡™¼®¼ü‚Mœ… ¶ · ¶·Ä ·¡Ç œ £ § ¤ £ ¤ ¨ ãá ™ óá œ
|
|||
|
|
¢ˆíŽíÄ<ŸÓ<¶)+ .0 î ¢ªŒ ¥ ÂŒ ¥ ߌ ¥ ¥ ¢ ¥ˆíŽíšñ üŒA œ § § ¨ ¨ § ãá ‘ óá ” ؈í ,¹ ØŽí ,ÇÐ쩪 Ù Ú © ª FH KM ¼Ô,× ¸ ¸Ðì Ðì ¦ Ý ¦
|
|||
|
|
©ˆíŽí$ÞüÆ&TÉ ¹ º ¹Ðì ºÐì ¦ Ô ¦
|
|||
|
|
ªˆíŽí$Ù¹
|
|||
|
|
,ß¬Ò œ ¬ § ¬ ãá × óá ÚÐ쮯°±²³´¶·¸¹º¼½¿ÀÁÂÃÄÅÆÇÉÌÍÎÏÑÓÕØÙÚÛÜÝßàáâãäåçè šœ Ÿ¡ üÆ!¤Ì « « ü°! Ä Ðì « « Ä•üÌ-lÚ Ðì « «
|
|||
|
|
°ˆíŽí¹ èüŠ1d˜ Ðì›Å « «
|
|||
|
|
±ˆíŽí$¥üì2Tú » »Ðì »¡Ç « … «
|
|||
|
|
²ˆíŽí$† üÐ >tÞ ¼ ¼Ðì ¼¡Ç « í «
|
|||
|
|
³ˆíŽí$ò ü¶ `dÄ ¾ ¾ÐìÑ «— µ µ Ô « ÍìÑ Ñ ½ –"Ñ ½¡Ç Üú ½ Ñ ß†˜"
|
|||
|
|
´ˆíŽíÑ $Ù ± ß bd ü÷ ! … ¿ ¿Ðì « ‰ «
|
|||
|
|
¶ˆíŽí$Š ü‘ &DŸ À ÀÐì « ¨ «
|
|||
|
|
·ˆíŽí$© ôˆ!,–! Á ÁÐì « œ! «
|
|||
|
|
¸ˆíŽí$¡!üð!-Dþ!  ÂÐì « ‡" «
|
|||
|
|
¹ˆíŽí$Œ"‘ ’"üÈ#t ²|´#,Ö#€ à ÃÐìÞâˆ>ˆ> °3 Œ>
|
|||
|
|
tail_startÁ÷< �> tail_lenÁ÷< Ž>ù÷< �>Á÷< …üò) «§ Ã﫾‚ «£ » » ß# « Üã Ü# í㔩$
|
|||
|
|
ºˆíŽíÞâ$ä#˜ã,ê#-/ üŽ)5 ²|ú(Lœ)€ Ä ÄÐì Ðì « ¦) «
|
|||
|
|
¼ˆíŽí$«) atÁ±)üŸ-‚ ²|‹-d-€ Å ÅÐìÞâÐìˆ?ˆ? �* ‹?®Ä÷< Œ? phantomÁ÷< �? capÁ÷< Ž?¤÷< �?µ ÷< �?þ÷< µqS·l·ï«¾‚ «£ ¾ ¾ ½- « Üã º- í㔎.
|
|||
|
|
½ˆíŽíÞâ$Â-˜ã,È--/ ü™2;„§2 Æ Ç ÆÐì ÇÐì « ¸2 «
|
|||
|
|
¿ˆíŽí$½2¹
|
|||
|
|
,Ã2üÕ43<ã4 È ÈÐì « ë4 «
|
|||
|
|
ÀˆíŽí$ð4
|
|||
|
|
additionalÁTö4üý79l‹8 É ÉÐì « ™8 «
|
|||
|
|
ÁˆíŽí$ž8Å�T¤8üþ9V\Œ: Ê ÊÐì Ö¿Ù¿ Ú¿« Û¿ˆ Ü¿ Ý¿Þ¿ˆ ‚†f|Â
|
|||
|
|
ج « ˜: «
|
|||
|
|
ˆíŽí$�:Å�T£:ü¨>Sœ«> Ë ËÐì õ’ « ¿> «
|
|||
|
|
ÈíŽí$Ä>Å�TÊ>ü‚D\Œ�D Ì ÌÐì õ’ « ¢D «
|
|||
|
|
ĈíŽí$§DÅ�TDü£G7L±G Í ÍÐì « »G «
|
|||
|
|
ňíŽí$ÀG min_capacityÁdÆGü‘I. ŸI Î ÎÐìۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙã„ « £I «
|
|||
|
|
ƈíŽí$¨IüŠL|d˜L Ï Ð ÏÐì ùª ÐÖó ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ «¢ È È ¨L « Ñô ¥L âôløL
|
|||
|
|
LjíŽíÖó$©L§$¯LŒ ÀL46 üÇNƒ„ÕN Ó ÓÐì ùªÑ µ˜ «— Ê Ê éN « ¾† æN Ò “"Ñ Òˆí Œ¸O Ò Ñ áš˜" $ÅO
|
|||
|
|
ɈíŽíÑ $êN§$ðNò‹D…Oln ŒâO ɪŒ Ë ÂŒ Ë ßŒ Ë Ë É ËˆíŽíÑ Ñ Ñ Ñ Ðì ü¶Q;T¹Q Ô ÔÐìùªˆíŽí « ÄQ «
|
|||
|
|
̈íŽí$ÉQ§$ÏQŒ àQ»,èQüŸTv\T Õ ÕÐìùªˆíŽí ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙŽí « ¹T « ™ˆí ’U
|
|||
|
|
͈íŽí$¾T§$ÄTŒ ÕT»,ÝTüâZ£dðZ Ö ÖÐìùªˆíŽí ú– « †[ « ìž‚\
|
|||
|
|
ΈíŽí$‹[§$™[Œ ²[»,Â[ü÷b�Œ…c × Ø ×Ðìùª ØÖó ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ ˆíŽí «¢ Ð Ð šc « Ñô —c âôlöc
|
|||
|
|
ψíŽíÖó$Ÿc§$¥cŒ ¶c46 ü«fŒ„¹f Ù Ú ÙÐìùª ÚÖó €¡ «¢ Ò Ò Íf « Ñô Êf âôl©g
|
|||
|
|
шíŽíÖó$Òf§$ØfŒ éf46 ü²k5lµk Û ÛÐì « Ãk «
|
|||
|
|
ÓˆíŽí$Èk¹,Îkþ ÜkDóv ÓªŒ Ô ÂŒ Ô ßŒ Ô Ô Ó ÔˆíŽí ü‡yl|•y Þ ÞÐìÑ «— Ö Ö ¨y « ¾† ¥y Ü Ý “"Ñ Üˆí ÝŽí ìÕy Ü Ý Ñ Ù¦˜" $îy
|
|||
|
|
ÕˆíŽíÑ $y keepÁ$·y~€ <§z ÕªŒ × ÂŒ × ßŒ × × Õ ×ˆíŽíÑ ï« Ñ üÉ{ ”Ì{ ß ßÐì « ß{ «
|
|||
|
|
؈íŽí$ä{üÔ| <â| à àÐì « ê| «
|
|||
|
|
ÙˆíŽí$ï|üî0|ñ á áÐì « �€ «
|
|||
|
|
ÚˆíŽí$†€Å�TŒ€üà„^lî„ â âÐìùªˆíŽí âï« « ü„ «
|
|||
|
|
ÛˆíŽí$�…§$‡…Œ ˜…», …ü¹ˆY ²|¥ˆ¤Çˆ€ ã ãÐì ùªˆíˆí « ܈ «
|
|||
|
|
܈íŽí$áˆÖ,爧$õˆŒ †‰üÏ�¡œÝ� ä äÐì ùªˆíŽí äï« « ú� «
|
|||
|
|
݈íŽí$ÿ�Ö,�Ž§$£ŽŒ ¼Ž»,ÌŽL†‘ ݪŒ Þ ÂŒ Þ ßŒ Þ Þ Ý ÞˆíŽíšñ ŸÇü÷•K”…– å åÐì ú– « ˜– «
|
|||
|
|
߈íŽí$�–Ö,£–üÈ™9œË™ æ æÐì ã„ « ß™ «
|
|||
|
|
àˆíŽí$ä™Ö,ê™üäœJŒòœ ç çÐì ú– « „
|
|||
|
|
, ã 8Œ ä & ç 8› $è *í , ð 8» ,ñ & ö 8› $÷ $ û ý *€ ƒ ½ , … 8 ,† '‹ 8Ð ¬� ¢ £ » , ¤ 8™ ¥ % ¦ , ¨ © ¸ , ª 8Œ « *¯ , ² 8» ,³ $ ¹ º % ¾ Ä é , Å 8™ Æ & Ç 8´ È % Ê , Ì Í æ , Î 8Œ Ï & Ò 8› $Ó *Ø , Û 8» ,Ü & á 8› $â $ ç
|
|||
|
|
è *ë î � ï Ž 0 8 ù 8 builderÁ <ý … '‡ 8í $‰ '� 8§ $� '“ 8 BuildHasherDefaultÁ ”• '§ © , ª 8™ « ¬ ' 8> <¯ ¶ · % ¸ 8 , 8 CAPÁ È & Ë 8¬ ,Í Ó Õ Ö Ù × Ø Ú 'Û 8‘ Ý à þ á â ý , ã ä ú å ù 8Ô Lç ð ñ ö , ò 8Œ ó % ÷ $ û
|
|||
|
|
ü % ÿ + ‰ Š œ 8« ,‹ � › 8
|
|||
|
|
unused_mutÁ T‘ 8 ú 8 þ 8Ø ‚ † , ˆ 8 ,‰ 'Ž 8 D� '˜ 8Ðh Äš ² ¿ 8€Ä ³ $ ¶ 8É <¸ % À , Ê Ë û 8Ø Ù Ü 8½ 4Ý ã ð , ä 8Œ å $ è , ê 8» ,ë % ñ
|
|||
|
|
ü 8Ø † % � ¬ï üì JÀ¸ ·
|
|||
|
|
ú t»
|
|||
|
|
ÿ¹ Ê
|
|||
|
|
ú <Î
|
|||
|
|
ùî ÜÖ
|
|||
|
|
use indexmap::indexmap;Á ò
|
|||
|
|
ú Äö
|
|||
|
|
let map = indexmap!{Á Œ� ×» Œ¡ ñ» 4³ ‹¼ äº š¼ ä× ¿¼ üô #å¼ ˜ ú Üœ �½ ü¸ .½ <ç ùî »À|› ¼• (|Ü ;| …
|
|||
|
|
¢ ‹
|
|||
|
|
©
|
|||
|
|
, Œ
|
|||
|
|
�
|
|||
|
|
§
|
|||
|
|
|
|||
|
|
, Ž
|
|||
|
|
8Œ �
|
|||
|
|
& ’
|
|||
|
|
8› $“
|
|||
|
|
*˜
|
|||
|
|
, ›
|
|||
|
|
8» ,œ
|
|||
|
|
& ¡
|
|||
|
|
8› $¢
|
|||
|
|
$ ¦
|
|||
|
|
¨
|
|||
|
|
*«
|
|||
|
|
®
|
|||
|
|
×
|
|||
|
|
, °
|
|||
|
|
8 ,±
|
|||
|
|
'¶
|
|||
|
|
8í D¸
|
|||
|
|
À
|
|||
|
|
Á
|
|||
|
|
Õ
|
|||
|
|
, Â
|
|||
|
|
Ã
|
|||
|
|
Ò
|
|||
|
|
, Ä
|
|||
|
|
8Œ Å
|
|||
|
|
*É
|
|||
|
|
, Ì
|
|||
|
|
8» ,Í
|
|||
|
|
$ Ó
|
|||
|
|
Ô
|
|||
|
|
% Ø
|
|||
|
|
Þ
|
|||
|
|
ü
|
|||
|
|
, ß
|
|||
|
|
à
|
|||
|
|
ù
|
|||
|
|
, á
|
|||
|
|
8Œ â
|
|||
|
|
& å
|
|||
|
|
8› $æ
|
|||
|
|
*ë
|
|||
|
|
, î
|
|||
|
|
8» ,ï
|
|||
|
|
& ô
|
|||
|
|
8› $õ
|
|||
|
|
$ ú
|
|||
|
|
|
|||
|
|
û
|
|||
|
|
*þ
|
|||
|
|
� Ÿ ‹ ™ 8 ,º 8€Ä À & à 8¬ ,Å Ë Í Î Ñ Ï Ð Ò 'Ó 8‘ Õ Ø ö Ù Ú õ , Û Ü ò Ý ñ 8Ô Lß è é î , ê 8Œ ë % ï $ ó
|
|||
|
|
ô % ÷ 8 … 8 ‰ 8Ø � ‘ , “ 8 ,” '™ 8 D› '£ 8ê l¥ ² ¶ 8€Ä ³ % · , Å Æ þ 8Ø Ø Û 8½ 4Ü â ï , ã 8Œ ä $ ç , é 8» ,ê % ð
|
|||
|
|
ÿ 8Ø � % üÇ" ü¥A > Create an [`IndexSet`][crate::IndexSet] from a list of valuesÁ üçW“¹ ¿ú tÃÿ¹ Òú <Öùî üÞ( % use indexmap::indexset_with_default;Á ¼‡áº Ÿú ü£% " let set = indexset_with_default!{Á ”ɼ» dÜ "a",Á dé "b",Á 4ö‹¼ üý assert!(set.contains("a"));Á ü� assert!(set.contains("b"));Á ü½ assert!(!set.contains("c"));Á Þú ìâ // "a" is the first valueÁ ü€. + assert_eq!(set.iter().next(), Some(&"a"));Á <¯ùî (|· 9‚ ê ý ð ˆ , ñ 8™ ò & ó 8´ ô % ö , ø ù † , ú 8» ,û & € 8› $� $ … ‡ *Š � ¿ , � 8 ,� '• 8ý ¬— ¬ ½ , ® 8™ ¯ % ° , ² ³ º , ´ 8» ,µ $ » ¼ % À Æ Þ , Ç 8™ È & É 8´ Ê % Ì , Î Ï Û , Ð 8» ,Ñ & Ö 8› $× $ Ü
|
|||
|
|
Ý *à ã ú ä ù 0 8 î 8É <ò ú 'ü 8í $þ '‚ 8§ $„ 'ˆ 8�à ”Š 'œ ž , Ÿ 8™ ¡ '¢ 8æ ¤ § ¨ % © 8 ,³ 8€Ä ¹ & ¼ 8¬ ,¾ Ä Æ Ç Ê È É Ë 'Ì 8‘ Î Ñ ñ Ò Ó ð , Ô Õ í Ö ì 8Ô LØ á â é , ã 8» ,ä % ê $ î
|
|||
|
|
ï % ò + ü ý � 8« ,þ ƒ Ž 8œÆ T„ 8 ë 8 ï 8Çz ó ÷ , ù 8 ,ú 'ÿ 8� D� '‰ 8Ðh Ä‹ £ ° 8€Ä ¤ $ § 8É <© % ± , » ¼ æ 8Çz Ê Í 8½ 4Î Ô Û , Õ 8» ,Ö % Ü
|
|||
|
|
ç 8Çz ñ % û ¬Ì ü×AÏÒ ™ú t�ÿ¹ ¬ú <°ùî ܸ use indexmap::indexset;Á Ôú ÄØ let set = indexset!{Á dñàÔ dþõÔ 4‹ ‹¼ ü’ ˜Õ ü² ÁÕ üÒ êÕ ó ú ì÷ ŸÖ ü• .ÆÖ <Ä ùî »À|†¼€ (|Ç ø‡ â Û! è ù , é ê ÷ , ë 8» ,ì & ñ 8› $ò $ ö ø *û þ Ÿ , € 8 ,� '† 8š! Dˆ � ‘ � , ’ “ š , ” 8» ,• $ › œ % ¦ · , § ¨ ´ , © 8» ,ª & ¯ 8› $° $ µ
|
|||
|
|
¶ *¹ ¼ Ø! Æ Ò! 8 ,÷ 8€Ä ý & € 8¬ ,‚ ˆ Š ‹ Ž Œ � � '� 8‘ ’ • µ – — ´ , ˜ ™ ± š ° 8Ô Lœ ¥ ¦ , § 8» ,¨ % ® $ ²
|
|||
|
|
³ % ¶ 8 Ä 8 È 8Çz Ì Ð , Ò 8 ,Ó 'Ø 8� DÚ 'â 8ê lä ñ õ 8€Ä ò % ö , „! …! ·! 8Çz —! š! 8½ 4›! ¡! ¨! , ¢! 8» ,£! % ©!
|
|||
|
|
¸! 8Çz Æ! % Ù! ìÎ"„Û" ì" ¤* ý# ‹$ , þ# 8 map_eltÁ <ÿ# & †$ 8› $‡$ *�$ �$ ¡* @ 8 š$ 8ó $�$ ¡$ «$ ¢$ 8 £$ 8 $§$ ($ 8¬ 4°$ ¶$ 8 $·$ '»$ 8› $½$ Á$ Ã$ ø$ 8 $Ñ$ Õ$ 8ù $Ö$ Ú$ 8ó $Û$
|
|||
|
|
á#,Ù Œ ÿ Ç&dà ± €
|
|||
|
|
Å
|
|||
|
|
l† ‚
|
|||
|
|
Š²\• A ƒ
|
|||
|
|
‹°3,¾ ‹ …
|
|||
|
|
²CLÅ — †
|
|||
|
|
�*DÐ ¡ ‡
|
|||
|
|
Ã7DÚ Ò ˆ
|
|||
|
|
Ü=Tä ¼ ‰
|
|||
|
|
š+$ð ƒ Š
|
|||
|
|
½-<ö © ‹
|
|||
|
|
Ð/Dÿ Ì Œ
|
|||
|
|
‹5$‰ ¨ �
|
|||
|
|
ç?4� à Ž
|
|||
|
|
Ì94› ö �
|
|||
|
|
á;L£ › �
|
|||
|
|
ÇG|È × ‘
|
|||
|
|
äE\ð Â ’
|
|||
|
|
ôYl™ æ “
|
|||
|
|
Ù,½ œ ”
|
|||
|
|
Ö€ – � ‚ •
|
|||
|
|
ö « ªB ‚ –
|
|||
|
|
®D¿ ¿ß ‚ —
|
|||
|
|
× Ó ` ‚ ˜
|
|||
|
|
\\é Åe ‚ š
|
|||
|
|
Ž$ö še ‚ ›
|
|||
|
|
Ž e ‚ ›
|
|||
|
|
í ‡ ë ‚ œ
|
|||
|
|
IndexÁ,œ Ù¢ ‚ ž
|
|||
|
|
IndexMutÁD£ ³" ‚ Ÿ
|
|||
|
|
èþ\ ¤# ‚
|
|||
|
|
°‘\ã ÖJ ‚ ¡
|
|||
|
|
¨$ƒ � ‚ ¢
|
|||
|
|
†",› ö ‚ ¤
|
|||
|
|
É"”¢ ü ‚ ¥
|
|||
|
|
И4Ã à ‚ §
|
|||
|
|
�ÓTË ‚ ¨
|
|||
|
|
ééÂœ× ‰ ‚ ©
|
|||
|
|
Ç¿Lì Ô ‚ ª
|
|||
|
|
Ç¿ Õ ‚ ª
|
|||
|
|
ôÀ|÷ í ‚ «
|
|||
|
|
L† ,Š‚Œ±Ð˜4 à ƒ „¨$& � ƒ †Å
|
|||
|
|
l, ƒ ‡ Š²\; A ƒ ˆ ‹× T ` ƒ Ší Y ë ƒ ‹l~doq_aLN$M<>,.ÄÕ ü`L I Entry for an existing key-value pair in an [`IndexMap`][crate::IndexMap]Á ü' $ or a vacant location to insert one.Á ,Þ §
|
|||
|
|
� œ Ž § � � � Ž Œ„ è �„ ë ¬ˆð� »ˆ÷�„ A'YŠ¯y!�‘“” ‘ ’ Õê„ ” • äÀ„ äeg jl b¡ üô& # Existing slot with equivalent key.Á —¡ Œ Œ
|
|||
|
|
‘ §
|
|||
|
|
™ëŸë¼¡¿¡ Õê„ Œ Œ Ü�¼¨ Œ Œ Õê%¡ üÆ/ , Vacant slot (no equivalent key in the map).Á c¡ Œ Œ
|
|||
|
|
” §
|
|||
|
|
™ëŸëˆ¡‹¡ äÀ„ Œ Œ ’�¬� Œ Œ äÀôœ §
|
|||
|
|
— œ ˜ § ™ — ˜ ™ Œ„ ¥ �„ ¨„š›œ�Ÿ¡¢¤ ¡.0 35 ä� üÁI F Return the index where the key-value pair exists or will be inserted.Á,– ò ò„ – œ –
|
|||
|
|
š §
|
|||
|
|
™ëŸë$�üà> üÀ\ Y Sets the value of the entry (after inserting if vacant), and returns an `OccupiedEntry`.Á ¡ú ü©2¨Èdç „ŸëÕê – –
|
|||
|
|
› §
|
|||
|
|
™ëŸë$ô»,úüú
|
|||
|
|
/ üÿV S Inserts the given default value in the entry if it is vacant and returns a mutableÁ üÚ \ Y reference to it. Otherwise a mutable reference to an already existent value is returned.Á »
|
|||
|
|
ú üÃ
|
|||
|
|
2¨ÈL� „Ÿë„œ – –
|
|||
|
|
œ §
|
|||
|
|
™ëŸë$‹ ><‘ üÎX üÉ ` ] Inserts the result of the `call` function in the entry if it is vacant and returns a mutableÁ ü®
|
|||
|
|
\‚” �ú ü—2¨ÈtÕ „âÿ„œ –— ž ž – û‹ ä –"âÿ l˜ âÿ ˜" Ÿë ¤
|
|||
|
|
� §
|
|||
|
|
™ëŸëâÿ$çÑ$íSU üù^ üÉZ W Inserts the result of the `call` function with a reference to the entry's key if it isÁ ü¨^ [ vacant, and returns a mutable reference to the new value. Otherwise a mutable reference toÁ ü‹* ' an already existent value is returned.Á ºú üÂ2¨È”€ „âÿ„œ –— – û‹ “ ó –"âÿ ó™ë |Ç ó âÿ�œ˜" Ÿë Õ
|
|||
|
|
Ÿ §
|
|||
|
|
™ëŸëâÿ$–Ñ$œkm ¼Ô üÇK H Gets a reference to the entry's key, either within the map if occupied,Á ü—8 5 or else the new key that was used to find the entry.Á Û ô ô„ ô™ë – ß –
|
|||
|
|
¡ §
|
|||
|
|
™ëŸë$àü³Q ü…) & Modifies the entry if it is occupied.ÁTº „âÿ„ –— £ £ – û‹ Å õ –"âÿ õŸë tõ õ âÿ‘ ˜"
|
|||
|
|
¢ §
|
|||
|
|
™ëŸëâÿ$̱ Òhj ü€ B ü�Z W Inserts a default-constructed value in the entry if it is vacant and returns a mutableÁ üà\‚” Áú üÉ2¨ÈT‡ „„œ – – ³ Ÿë <º
|
|||
|
|
¤ §
|
|||
|
|
™ëŸë$’ üé A 8 ö œ ¦ § § ¦ § ö Œ„ î �„ ý ¿c™ë Tñ ¿cŸë T€ ›í¨ Àc ¨ ;= @B ü± 8 ´ ÷ ø ù ÷›í ø c c ˆ ¢cµ
|
|||
|
|
` £c®Ä ` àB¤GS
|
|||
|
|
ùÖ¿Ù¿ Ú¿« Û¿ˆ Ü¿ Ý¿Þ¿ˆ ‚†f|Â
|
|||
|
|
ŸÈŸÈ È ErrorÁ O˜éBL ¥ ¸ ¥
|
|||
|
|
¨ 8™ëŸë$¹ ± ¿ ü¾ I 8 ú œ ª § « « ú ª Œ„ à �„ Ò ª£TÆ º£TÕ ÷í¬ Àc ¬ +- 02 üŽ!8 ‘! û ü ý û÷í ü c c ˆ ¢cµ
|
|||
|
|
` £c®Ä ` àB¤GS
|
|||
|
|
ýý¤ © •! ©
|
|||
|
|
¬ 8™ëŸë$–!± œ!üÞ"; 8 þ œ ® § ¯ ¯ þ ® Œ„ ã" �„ ò" ª£Tæ"Éî° Àc ° #% (* ü #8 £# ÿ € � ÿÉî € c c ˆ ¢cµ
|
|||
|
|
` £c®Ä ` àB¤GS
|
|||
|
|
�ý¤ §#
|
|||
|
|
° 8™ëŸë$¨#± ®#üå%! ü¤$X U A view into an occupied entry in an [`IndexMap`][crate::IndexMap] obtained by index.Á ý$ú ü�%c ` This `struct` is created from the [`get_index_entry`][crate::IndexMap::get_index_entry] method.Á dð% §
|
|||
|
|
² œ ³ § ´ ³ ´ ² Œ„ �& �„ „& ¬ˆ¼�& »ˆ¥ë Ÿ 1zî¨F› µ¶ý%<> AC F �&ƒ ± ± È…dŸ',Ÿ'ƒ ± ± ü°'% §
|
|||
|
|
¸ œ ¹ § º º ¸ ¹ Œ„ ¹' �„ ¼'¥ë»¼½¾¿ÀÁÂÃÄÅÆÇÈÉÊËÌ µ'LN QS üÜ'H ê' È… ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ¥ë · ·
|
|||
|
|
» §
|
|||
|
|
™ëŸëØ î'Ö,‡(äà) ü£)*“‘,ç) ‚ ‚¥ë · í) ·
|
|||
|
|
¼ §
|
|||
|
|
™ëŸë$î)ü�*3L«* ¥ëÈ… · ·
|
|||
|
|
½ §
|
|||
|
|
™ëŸë$µ*üï*%Tò* ƒ ƒ ƒ¥ë ƒ³Ž · ý* ·
|
|||
|
|
¾ §
|
|||
|
|
™ëŸë$þ*üÍ+1tÐ+ ƒ „ „¥ë „³Ž · ß+ ·
|
|||
|
|
¿ §
|
|||
|
|
™ëŸë$ä+ü¿,,\Â, ƒ ¥ëÒ‘ · ·
|
|||
|
|
À §
|
|||
|
|
™ëŸë$Î,¼ä- ü¬-3¨’ ë- … …¥ë …™ë · ï- ·
|
|||
|
|
Á §
|
|||
|
|
™ëŸë$ð-ü¨.*<¶. ‚ † †¥ë †™ë · ¾. ·
|
|||
|
|
 §
|
|||
|
|
™ëŸë$Ã.¼Á/ ü‡/5ï• È/ ‡ ‡¥ë ‡Ÿë · Ì/ ·
|
|||
|
|
à §
|
|||
|
|
™ëŸë$Í/üÚ1# ü‡0=›— É0ú üÑ0Dî— üš1; 8 `IndexedEntry` value, see [`into_mut`][Self::into_mut].Á<á1 ˆ ˆ¥ë ˆŸë · é1 ·
|
|||
|
|
Ä §
|
|||
|
|
™ëŸë$î1ü‡3' ü´2NÆ›4Ž3 ‰ ‰¥ëŸëŸë · •3 ·
|
|||
|
|
Å §
|
|||
|
|
™ëŸë$š3», 3üä4" üè3Fé™ ü³4,¹šDë4 ¥ë„œ · ·
|
|||
|
|
Æ §
|
|||
|
|
™ëŸë$ô4ü³8( üº5JÞ¨ ‰6ú ü‘6_¼¢ üõ68¥£ ü²7Gç£ þ7ú ü†8(ĤŒº8 ¥ëÚ® · ·
|
|||
|
|
Ç §
|
|||
|
|
™ëŸë$Ì8ü�<) ü¡9JÞ¨ ð9ú üø9]ߥ üÚ:=Ʀ üœ;9�§ Ú;ú üâ;(ܧ”–< ¥ëÚ® · ·
|
|||
|
|
È §
|
|||
|
|
™ëŸë$©<ì„@ üÿ<V‹� Ú=ú üâ=_¼¢ üÆ>8¥£ üƒ?Gç£ Ï?ú ü×?(Ĥ\‹@ ¥ëŸë · ·
|
|||
|
|
É §
|
|||
|
|
™ëŸë$—@ôÌC üÒ@V‹� Aú üµA]ߥ ü—B=Ʀ üÙB9�§ —Cú üŸC(ܧdÓC ¥ëŸë · ·
|
|||
|
|
Ê §
|
|||
|
|
™ëŸë$àCüðH" üœD2ر üÓD-”² …Eú ü�EQײ üãE8²³ Fú ü¨F_€´ üŒG_é´ ðGú üøG*Þµ §Hú ü¯H(ܧ ²|ÜHT÷H€ ¥ë · ·
|
|||
|
|
Ë §
|
|||
|
|
™ëŸë$‚Iö¶ˆIüÂL' üÍI-Ž· ÿIú ü‡JUÑ· üáJO°¸ µKú ü½K7•¹ ùKú ü�L(Ĥ ²|®LdÉL€ ¥ë · ·
|
|||
|
|
Ì §
|
|||
|
|
™ëŸë$ÖL¹
|
|||
|
|
,ÜLü§MH 8 Š œ Î § Ï Š Ï Î Œ„ ¬M �„ »M ª£T¯M º£T¾M›ïÐ Àc Ð +- 02 üöM8 ùM ‹ Œ � ‹›ï Œ c c ˆ ¢cµ
|
|||
|
|
` £c®Ä ` àB¤GS
|
|||
|
|
�ý¤ Í ýM Í
|
|||
|
|
Ð 8™ëŸë$þM± „NüîOG §
|
|||
|
|
Ò œ Ó § Ô Ò Ó Ô Œ„ ÷O �„ úO¥ëÕ ë Õ óO!# &( ü¼P/$¿P Õê¥ë Ñ Ñ
|
|||
|
|
Õ §
|
|||
|
|
™ëŸë¹
|
|||
|
|
,ÄPD‘ $•‚ƒ©Ì‹¨Òö›¼à—¡Ð˜4 à Ö Ø §
|
|||
|
|
Ç¿L Ô Ö Ù ª
|
|||
|
|
Ç¿ Õ Ö Ù ª
|
|||
|
|
D ¬
|
|||
|
|
Ö ÚÙ,) œ Ö Û ”
|
|||
|
|
¨$D � Ö Ý˜\J g Ö Þ ŒÁ$j ÷< Ö àö p ªB Ö á× € ` Ö â\\– Åe Ö äŽ$£ še Ö åŽ e Ö å
|
|||
|
|
FusedIteratorÁlº òP Ö æ MaybeUninitÁ\Ø ÑÛ Ö çó…,õ Ù¢ Ö éèþ\ü ¤# Ö êž,” ‰f Ö ë,¡¤Ž‘beTWd5EH7:T]) d LzT‰ôö̮ƴͬLé›�ˆŠ\Ž{üœ8 §
|
|||
|
|
í œ î § ï ¤ ð ð î ï í Œ„ ¥ �„ ¨ Íì¿ð «øïñòó ÈL ÉL ÊL ó ¡@B EG AC LÛ$à ì ì �“lûD€ ì ì ñü $L£ øïøï ÉL ì ì
|
|||
|
|
ó §
|
|||
|
|
™ëŸë¿ð$üä< §
|
|||
|
|
õ œ ö § ÷ ¤ ø ö õ ÷ ø Œ„ í �„ ð ‘Î óÍðùúû ÈL ÉL ÊL û é79 <> AC L§$¬ ô ô �“„œlËDÐ ô ô éòüó$Lö ÍðÍð ÉL ô ô
|
|||
|
|
û §
|
|||
|
|
™ëŸë¿ð$€ü»0 œ ý § þ ¤ ÿ þ ý ÿ ãá À óá à Íì ñ Æßð€�‚ ÈL ÉL ÊL ‚ :< ?A ;= Lò$÷ ü ü ã„lŠD� ü ü Ëõü¯$L² ßðßð ÉL ü ü
|
|||
|
|
‚ˆíŽí ñ$¼Ì¦ üŠ4 1 An iterator over the entries of an [`IndexMap`].Á ¿ú üÃ> ; This `struct` is created by the [`IndexMap::iter`] method.Á ü‚# See its documentation for more.Á $± §
|
|||
|
|
„ œ … § † … † „ Œ„ º �„ ½ ¬ˆ§e »ˆ ñ …ä1dÿ·‘ ‡¶;= @B üÆ#$ÆÖ ƒ ƒ ÄlÄl š+ Çlµ ™l Èl
|
|||
|
|
end_or_lenÁ™l Él _markerÁ™l ŒœjSž §
|
|||
|
|
³Žìî §
|
|||
|
|
‰ œ Š § ‹ Š ‰ ‹ Œ„ ÷ �„ úñŒ� ó !# ü’ 6 ‚ §
|
|||
|
|
²Ž ñ ˆ ˆ
|
|||
|
|
Œ §
|
|||
|
|
™ëŸëÓ<¤ üÓ
|
|||
|
|
) ü‘
|
|||
|
|
= : Returns a slice of the remaining entries in the iterator.ÁDÚ
|
|||
|
|
Ž Žñ ó€ ˆ ã
|
|||
|
|
ˆ
|
|||
|
|
� §
|
|||
|
|
™ëŸë$ä
|
|||
|
|
ü¸ * §
|
|||
|
|
� œ � § ‘ � ‘ � Œ„ Á �„ Ä ñ’†‡ˆ‰Š‹ úM ûM ÿM €N �N ƒN ÄN † ˆ ‰ ‡ ‹ Š ½ _a df Lé $î Ž Ž �“ü® 1 8 � œ ” § • • ” � Œ„ ³ �„ ¶ ðñ�Ž �M �M � Ž &( +- ü—
|
|||
|
|
/ 8 � œ — § ˜ ˜ — � Œ„ œ
|
|||
|
|
�„ Ÿ
|
|||
|
|
ðñ™ ÄM ™ " ´Í
|
|||
|
|
Ð
|
|||
|
|
‘ ‘ðñ – Ô
|
|||
|
|
–
|
|||
|
|
™ 8™ëŸë$Õ
|
|||
|
|
ü‡+ 8 ’ œ › § œ œ ’ › Œ„ Œ �„ �ðñ üî# 8 “ œ ž § Ÿ “ ž Ÿ Œ„ ó �„ öðñ Ù " ¼˜,› ” ”ðñ ðñ � ¡ �
|
|||
|
|
8™ëŸë$¢üù@ 8 • œ ¢ § £ • ¢ £ Œ„ þ �„ � ª£T� º£T�ðñ¤ Àc ¤ +- 02 üÀ8 à – — ˜ –ðñ — c c ˆ ¢cµ
|
|||
|
|
` £c®Ä ` àB¤GS
|
|||
|
|
˜ý¤ ¡ Ç ¡
|
|||
|
|
¤ 8™ëŸë$ȱ Îüº% 8 ™ œ ¦ § § ¦ § ™ Œ„ ¿ �„ Âðñ¨ ´ ¨ " ¤æ<é ðñ ¥ ¥
|
|||
|
|
¨ 8™ëŸëäÎ ü§; 8 A mutable iterator over the entries of an [`IndexMap`].Á ãú üçB ? This `struct` is created by the [`IndexMap::iter_mut`] method.Á üª#�Õ <Ù §
|
|||
|
|
ª œ « § ¬ ¬ ª « Œ„ å �„ è ¬ˆÚ,e »ˆ éò 8ﲞÄÿ„ á;= @B üñ&$ñÖ © © ÜlÜl ½- ßlµ ™l àl€×™l ál–×™l Ú½íDþïl% §
|
|||
|
|
³Žüœ §
|
|||
|
|
¯ œ ° § ± ° ¯ ± Œ„ ¥ �„ ¨éò²³´ ¡ ! $& üÃ: Ñ ‚ §
|
|||
|
|
²Žéò ® ®
|
|||
|
|
² §
|
|||
|
|
™ëŸëÓ<ÕüŒ& üÊ=¡ÙD“ š šéò šù€ ® œ ®
|
|||
|
|
³ §
|
|||
|
|
™ëŸë$�ü¢. üðE B Returns a mutable slice of the remaining entries in the iterator.Á ºú üÂ[ X To avoid creating `&mut` references that alias, this is forced to consume the iterator.ÁT© éò¶� ® ®
|
|||
|
|
´ §
|
|||
|
|
™ëŸë$´ü’- §
|
|||
|
|
¶ œ · § ¸ ¸ ¶ · Œ„ › �„ žéò¹��‘’“” úM ûM ÿM €N �N ƒN ÄN “ � ‘ ’ � ” —_a df LÆ$Ë µ µ ÀÑü’4 8 › œ » § ¼ » ¼ › Œ„ — �„ š¬ó–— �M �M — – &( +- ü�2 8 œ œ ¾ § ¿ ¿ œ ¾ Œ„ † �„ ‰¬óÀ ÄM À " ´º ½ � �¬ó ½ Á ½
|
|||
|
|
À 8™ëŸë$Âüô. 8 ž œ  § à à ž  Œ„ ù �„ ü¬ó ü§ C 8 Ÿ œ Å § Æ Ÿ Å Æ Œ„ ¬ �„ » ª£T¯ º£T¾ ¬óÇ Àc Ç +- 02 üñ 8 ô ¡ ¢ ¬ó ¡ c c ˆ ¢cµ
|
|||
|
|
` £c®Ä ` àB¤GS
|
|||
|
|
¢ý¤ Ä ø Ä
|
|||
|
|
Ç 8™ëŸë$ù ± ÿ ü¥ ( 8 £ œ É § Ê £ É Ê Œ„ ª �„ ¬óË ´ Ë " ¤Ô <× ¬ó È È
|
|||
|
|
Ë 8™ëŸëìø ü® ;¬å ê ú üî e b This `struct` is created by the [`MutableKeys::iter_mut2`][super::MutableKeys::iter_mut2] method.Á üÔ #�Õ Dƒ! §
|
|||
|
|
Í œ Î § Ï Ï Í Î Œ„ �! �„ “! ¬ˆŠ »ˆ‘šô /áU®"¯ ÐŒ!:< ?A üœ!&$œ!Ö Ì Ì üèüÇ!! §
|
|||
|
|
Ò œ Ó § Ô Ó Ò Ô Œ„ Ð! �„ Ó!šôÕÖ× Ì! ! $& üï!: ý! ‚ èêšô Ñ Ñ
|
|||
|
|
Õ §
|
|||
|
|
™ëŸëÓ<�"ü¸#& üö"=¡ÙD¿# ¤ ¤šô ¤ù€ Ñ È# Ñ
|
|||
|
|
Ö §
|
|||
|
|
™ëŸë$É#üÎ%. üœ$E¯ë æ$ú üî$[ŠìTÕ% šô¶� Ñ Ñ
|
|||
|
|
× §
|
|||
|
|
™ëŸë$à%ü¾&. §
|
|||
|
|
Ù œ Ú § Û Û Ù Ú Œ„ Ç& �„ Ê&šôܘ™š›œ� úM ûM ÿM €N �N ƒN ÄN œ š ˜ � › ™ Ã&_a df Ló&$ø& Ø Ø §
|
|||
|
|
™ë„œüÀ'5 8 ¥ œ Þ § ß ß Þ ¥ Œ„ Å' �„ È'ÝôŸ �M �M Ÿ &( +- ü(3 8 ¦ œ á § â á â ¦ Œ„ ²( �„ µ(Ýôã ÄM ã " ´ç( ê( § §Ýô à î( à
|
|||
|
|
ã 8™ëŸë$ï(ü¡)/ 8 ¨ œ å § æ æ ¨ å Œ„ ¦) �„ ©)Ýô üÕ)D 8 © œ è § é è © é Œ„ Ú) �„ é) ª£TÝ) º£Tì)Ýôê Àc ê +- 02 ü *8 £* ª « ¬ ªÝô « c c ˆ ¢cµ
|
|||
|
|
` £c®Ä ` àB¤GS
|
|||
|
|
¬ý¤ ç §* ç
|
|||
|
|
ê 8™ëŸë$¨*± ®*üÔ+) 8 œ ì § í ì í Œ„ Ù+ �„ Ü+Ýôî ´ î " ¤„,<‡, Ýô ë ë
|
|||
|
|
î 8™ëŸë̆/ œ ð § ñ ð ñ ãá ‹/ óá Ž/Ëõòóô ü¦/5 ´/ ‚ ›ÅËõ ï ï
|
|||
|
|
òˆíŽíÓ<¸/üë0& ü©0=¡ÙDò0 ® ®Ëõ ®‰‚ ï û0 ï
|
|||
|
|
óˆíŽí$ü0ü™22 üÏ1E¯ëd 2 ¯ ¯Ëõ ¯‰‚ ï 2 ï
|
|||
|
|
ôˆíŽí$²2ü�3& œ ö § ÷ ö ÷ ãá ”3 óá —3Ëõø©ª«¬® úM ûM ÿM €N �N ƒN ÄN © « ¬ ª ® Y[ ^` L¼3$Á3 õ õ ã„üþ31 œ ú § û û ú ãá ƒ4 óá †4Ëõ°± �M �M ° ± &( +- üì4/ œ ý § þ ý þ ãá ñ4 óá ô4Ëõÿ ÄM ÿ " ´¢5 ¥5 ° °Ëõ ü ©5 ü
|
|||
|
|
ÿˆíŽí$ª5üÜ5+ œ � § ‚ ‚ � ãá á5 óá ä5Ëõ üŒ6@ œ „ § … „ … ãá ‘6 óá 6 ¿cˆí T”6 ¿cŽí T£6Ëõ† Àc † ;= @B üÓ68 Ö6 ± ² ³ ±Ëõ ² c c ˆ ¢cµ
|
|||
|
|
` £c®Ä ` àB¤GS
|
|||
|
|
³ý¤ ƒ Ú6 ƒ
|
|||
|
|
†ˆíŽí$Û6± á6ü‡8% œ ˆ § ‰ ˆ ‰ ãá Œ8 óá �8ËõŠ ´ Š " ¤³8<¶8 Ëõ ‡ ‡
|
|||
|
|
ŠˆíŽíÔ»: ü–9< 9 A draining iterator over the entries of an [`IndexMap`].Á Ó9ú ü×9? < This `struct` is created by the [`IndexMap::drain`] method.Á ü—:#�Õ ,Æ: §
|
|||
|
|
Œ œ � § Ž Ž Œ � Œ„ Ð: �„ Ó: ¬ˆž »ˆ ‹ ‹ °3 �ù Ö 2› Krb~ §
|
|||
|
|
™ëŸë 2› Krb~ �Ì:su xz üÜ:"$Ü:Ö ‹ ‹ ˆ>ˆ> °3 Œ>�Š÷< �>¦Š÷< Ž>ù÷< �>Á÷< …üò) «§ §
|
|||
|
|
³Ž¾‚ôƒ; §
|
|||
|
|
‘ œ ’ § “ ’ “ ‘ Œ„ Œ; �„ �;Ä””• ˆ; !# ü¨;= ¶; ‚ ЕĔ � �
|
|||
|
|
” §
|
|||
|
|
™ëŸëù$º;üË<& ü‰<=¡ÙDÒ< ´ ´Ä” ´ù€ � Û< �
|
|||
|
|
• §
|
|||
|
|
™ëŸë$Ü<ü=' 8 µ œ — § ˜ — µ ˜ Œ„ ²= �„ µ=Êö™²³´µ¶· úM ûM ÿM €N �N ƒN ÄN ¶ ² ´ µ ³ · Y[ ^` LÛ=$à= – – Ú®ü�>2 8 ¶ œ › § œ › ¶ œ Œ„ ¢> �„ ¥>Êö¹º �M �M º ¹ &( +- üŒ?0 8 · œ ž § Ÿ · Ÿ ž Œ„ ‘? �„ ”?Êö ÄM " ´Ã? Æ? ¸ ¸Êö � Ê? �
|
|||
|
|
8™ëŸë$Ë?üý?, 8 ¹ œ ¢ § £ ¹ ¢ £ Œ„ ‚@ �„ …@Êö ü®@A 8 º œ ¥ § ¦ º ¥ ¦ Œ„ ³@ �„ Â@ ª£T¶@ º£TÅ@Êö§ Àc § +- 02 üö@8 ù@ » ¼ ½ »Êö ¼ c c ˆ ¢cµ
|
|||
|
|
` £c®Ä ` àB¤GS
|
|||
|
|
½ý¤ ¤ ý@ ¤
|
|||
|
|
§ 8™ëŸë$þ@± „AÌÃC üªB1 . An iterator over the keys of an [`IndexMap`].Á ÜBú üàB> ; This `struct` is created by the [`IndexMap::keys`] method.Á üŸC#�Õ $ÎC §
|
|||
|
|
© œ ª § « ª « © Œ„ ×C �„ ÚC ¬ˆ±% »ˆ¸%¸÷ >·£;ñ› ¬ÓC:< ?A üãC#$ãCÖ ¨ ¨ á×ì‹D §
|
|||
|
|
® œ ¯ § ° ® ¯ ° Œ„ ”D �„ —D¸÷± �D ü¯D6 ½D ‚ ØÙ¸÷
|
|||
|
|
± §
|
|||
|
|
™ëŸëÓ<ÁDü¬E* §
|
|||
|
|
³ œ ´ § µ ³ µ ´ Œ„ µE �„ ¸E¸÷¶»¼½¾¿À úM ûM ÿM €N �N ƒN ÄN ¿ ½ » ¾ ¼ À ±E_a df LÝE$âE ² ² �“üœF1 8 ¾ œ ¸ § ¹ ¹ ¸ ¾ Œ„ ¡F �„ ¤Fû÷Âà �M �M  à &( +- üˆG/ 8 ¿ œ » § ¼ ¼ » ¿ Œ„ �G �„ �Gû÷½ ÄM ½ " ´¾G ÁG À Àû÷ º ÅG º
|
|||
|
|
½ 8™ëŸë$ÆGüøG+ 8 Á œ ¿ § À À Á ¿ Œ„ ýG �„ €Hû÷ üßH# 8  œ  § à   à Œ„ äH �„ çHû÷Ä Ù Ä " ¼‰I,ŒI à Ãû÷ û÷ Á ’I Á
|
|||
|
|
Ä 8™ëŸë$“IüêI4 8 Ä œ Æ § Ç Ä Æ Ç Œ„ ïI �„ þI ª£TòIû÷È Àc È #% (* ü¥J8 ¨J Å Æ Ç Åû÷ Æ c c ˆ ¢cµ
|
|||
|
|
` £c®Ä ` àB¤GS
|
|||
|
|
Çý¤ Å ¬J Å
|
|||
|
|
È 8™ëŸë$J± ³JüŸK% 8 È œ Ê § Ë Ê Ë È Œ„ ¤K �„ §Kû÷Ì ´ Ì " ¤ËK<ÎK û÷ É É
|
|||
|
|
Ì 8™ëŸëü´Y* üŒL2 / Access [`IndexMap`] keys at indexed positions.Á ¿Lú üÃLH E While [`Index<usize> for IndexMap`][values] accesses a map's values,Á üŒMO L indexing through [`IndexMap::keys`] offers an alternative to access a map'sÁ ŒÜM keys instead.Á îMú üòM> ; [values]: IndexMap#impl-Index<usize>-for-IndexMap<K,+V,+S>Á ±Nú üµNL I Since `Keys` is also an iterator, consuming items from the iterator willÁ ü‚OG D offset the effective indices. Similarly, if `Keys` is obtained fromÁ üÊOL I [`Slice::keys`], indices will be interpreted relative to the position ofÁ |—P that slice.Á §Pú t«P # ExamplesÁ ºPú <¾Pùî ÜÆP use indexmap::IndexMap;Á âPú üæP" let mut map = IndexMap::new();Á ü‰QA > for word in "Lorem ipsum dolor sit amet".split_whitespace() {Á üËQ= : map.insert(word.to_lowercase(), word.to_uppercase());Á ,‰R }Á �Rú ü“R assert_eq!(map[0], "LOREM");Á ü´R' $ assert_eq!(map.keys()[0], "lorem");Á üÜR assert_eq!(map[1], "IPSUM");Á üýR' $ assert_eq!(map.keys()[1], "ipsum");Á ¥Sú ”©S map.reverse();Á ü¼S& # assert_eq!(map.keys()[0], "amet");Á üãS% " assert_eq!(map.keys()[1], "sit");Á ‰Tú ¤�T map.sort_keys();Á ü¢T&ä· üÉT' $ assert_eq!(map.keys()[1], "dolor");Á ñTú üõT6 3 // Advancing the iterator will offset the indexingÁ ô¬U let mut keys = map.keys();Á üËU assert_eq!(keys[0], "amet");Á üìU8 5 assert_eq!(keys.next().map(|s| &**s), Some("amet"));Á ü¥V! assert_eq!(keys[0], "dolor");Á üÇV! assert_eq!(keys[1], "ipsum");Á éVú üíV( % // Slices may have an offset as wellÁ Ô–W let slice = &map[2..];Á ü±W" assert_eq!(slice[0], "IPSUM");Á üÔW) & assert_eq!(slice.keys()[0], "ipsum");Á <þWùî †Xú œŠX ```should_panicÁ ÜžXþ³ ºXú ü¾X"¯´ ÌáX map.insert("foo", 1);Á üûX0 - println!("{:?}", map.keys()[10]); // panics!Á <¬Yùî 8 É œ Î § Ï Ï Î É Œ„ ¹Y �„ ¼Yû÷ÐÑ Û¢ Ü¢ Ñ $& )+ \åY4êY Í Í ™ëüõZ# üûY; 8 Returns a reference to the key at the supplied `index`.Á »Zú üÃZ-’Û,øZ€ Ê Êû÷ Ê™ë Í þZ Í
|
|||
|
|
Ñ 8™ëŸë$ÿZÖ,…[Ìò\ üÍ[8 5 An owning iterator over the keys of an [`IndexMap`].Á †\ú üŠ\C @ This `struct` is created by the [`IndexMap::into_keys`] method.Á üÎ\#�Õ Dý\ œ Ó § Ô Ô Ó ãá †] óá ‰]ƒù „{ º•!ï Õ&( +- üý^.$ý^Ö Ò Ò ˆ?ˆ? �* ‹?®Ä÷< Œ?«�÷< �?¾�÷< Ž?¤÷< �?µ ÷< �?þ÷< µqS·l· à à И ã§ äŒ å» É% ê`äçˆíÑÛÑÛ êÊ ÓÛ uninitÁÝ ÔÛ»Ý Íõƒ«%9Ží¾‚Ì°_ œ × § Ø Ø × ãá µ_ óá ¸_ƒùÙ üÐ_5 Þ_ ‚ ›Åƒù Ö Ö
|
|||
|
|
ÙˆíŽíÓ<â_ÔÌa ÙªŒ Ú ÂŒ Ú ßŒ Ú Ú Ù ÚˆíŽí ï«êÅ üÃc* œ Ü § Ý Ý Ü ãá Èc óá Òc Žþ,ËcƒùÞ Ù Þ #% (* ¼ôc,÷c Ë Ëƒù ƒù Û ýc Û
|
|||
|
|
ÞˆíŽí$þc¤ød ÞªŒ ß ÂŒ ß ßŒ ß ß Þ ßˆíŽí êÅ êÅ ü„g& œ á § â á â ãá ‰g óá ŒgƒùãÄÅÆÇÈÉ úM ûM ÿM €N �N ƒN ÄN È Æ Ä É Ç Å Y[ ^` L±g$¶g à
|
|||
|
|
` £c®Ä ` àB¤GS
|
|||
|
|
Ïý¤ î ²j î
|
|||
|
|
ñˆíŽí$³j± ¹jüâk% œ ó § ô ô ó ãá çk óá êkƒùõ ´ õ " ¤Žl<‘l ƒù ò ò
|
|||
|
|
õˆíŽíÜŽn üñl3 0 An iterator over the values of an [`IndexMap`].Á ¥mú ü©m@ = This `struct` is created by the [`IndexMap::values`] method.Á üêm#�Õ 4™n §
|
|||
|
|
÷ œ ø § ù ÷ ø ù Œ„ ¤n �„ §n ¬ˆk? »ˆr?‚ú î¹ú‡�$! ú n:< ?A ü°n#$°nÖ ö ö á×üØn §
|
|||
|
|
ü œ ý § þ þ ý ü Œ„ án �„ än‚úÿ Ýn üþn6 Œo ‚ ØÙ‚ú û û
|
|||
|
|
ÿ §
|
|||
|
|
™ëŸëÓ<�oüûo, §
|
|||
|
|
� œ ‚ § ƒ ƒ � ‚ Œ„ „p �„ ‡p‚ú„ÍÎÏÐÑÒ úM ûM ÿM €N �N ƒN ÄN Î Ï Í Ñ Ò Ð €p_a df L®p$³p € € ™“üïp3 8 Ð œ † § ‡ ‡ Ð † Œ„ ôp �„ ÷pÅúÔÕ �M �M Õ Ô &( +- üßq1 8 Ñ œ ‰ § Š Ñ ‰ Š Œ„ äq �„ çqÅú‹ ÄM ‹ " ´—r šr Ò ÒÅú ˆ žr ˆ
|
|||
|
|
‹ 8™ëŸë$ŸrüÑr- 8 Ó œ � § Ž Ó � Ž Œ„ Ör �„ ÙrÅú üºs% 8 Ô œ � § ‘ � ‘ Ô Œ„ ¿s �„ ÂsÅú’ Ù ’ " ¼æs,és Õ ÕÅú Åú � ïs �
|
|||
|
|
’ 8™ëŸë$ðsüÉt6 8 Ö œ ” § • • ” Ö Œ„ Ît �„ Ñt º£TÔtÅú– Àc – #% (* ü†u8 ‰u × Ø Ù ×Åú Ø c c ˆ ¢cµ
|
|||
|
|
` £c®Ä ` àB¤GS
|
|||
|
|
Ùý¤ “ �u “
|
|||
|
|
– 8™ëŸë$Žu± ”uü€v' 8 Ú œ ˜ § ™ Ú ˜ ™ Œ„ …v �„ ˆvÅúš ´ š " ¤®v<±v Åú — —
|
|||
|
|
š 8™ëŸëô—x üïv: 7 A mutable iterator over the values of an [`IndexMap`].Á ªwú ü®wD A This `struct` is created by the [`IndexMap::values_mut`] method.Á üów#�Õ L¢x §
|
|||
|
|
œ œ � § ž œ ž � Œ„ °x �„ ³x ¬ˆP> »ˆW>¾û †¦"KPy Ÿ¬x:< ?A ü¼x&$¼xÖ › › üèüçx" §
|
|||
|
|
¡ œ ¢ § £ £ ¡ ¢ Œ„ ðx �„ óx¾û¤ ìx ü�y: žy ‚ èê¾û
|
|||
|
|
¤ §
|
|||
|
|
™ëŸëÓ<¢yü•z/ §
|
|||
|
|
¦ œ § § ¨ ¦ § ¨ Œ„ žz �„ ¡z¾û©Ö×ØÙÚÛ úM ûM ÿM €N �N ƒN ÄN Ù × Ø Ö Ú Û šz_a df LËz$Ðz ¥ ¥ „œü�{6 8 Û œ « § ¬ Û ¬ « Œ„ •{ �„ ˜{�üÝÞ �M �M Þ Ý &( +- üƒ|4 8 Ü œ ® § ¯ Ü ¯ ® Œ„ ˆ| �„ ‹|�ü° ÄM ° " ´¾| Á| Ý Ý�ü Å|
|
|||
|
|
° 8™ëŸë$Æ|üø|0 8 Þ œ ² § ³ Þ ² ³ Œ„ ý| �„ €}�ü ü}9 8 ß œ µ § ¶ µ ¶ ß Œ„ ²} �„ µ} º£T¸}�ü· Àc · #% (* üí}8 ð} à á â à�ü á c c ˆ ¢cµ
|
|||
|
|
` £c®Ä ` àB¤GS
|
|||
|
|
âý¤ ´ ô} ´
|
|||
|
|
· 8™ëŸë$õ}± û}ü¦* 8 ã œ ¹ § º º ã ¹ Œ„ « �„ ®�ü» ´ » " ¤×<Ú �ü ¸ ¸
|
|||
|
|
» 8™ëŸëÜÚ� ü±€: 7 An owning iterator over the values of an [`IndexMap`].Á ì€ú üð€E B This `struct` is created by the [`IndexMap::into_values`] method.Á ü¶�#�Õ Tå� œ ½ § ¾ ¾ ½ ãá ð� óá ó�ïü ŸD¾Yw5Ç ¿(* ,. üãƒ.$ãƒÖ ¼ ¼ ˆ?ˆ? �* ‹?®Ä÷< Œ?«�÷< �?¾�÷< Ž?¤÷< �?µ ÷< �?þ÷< µqS·l· à à И ã§ äŒ å» É% ê`äçÑÛÑÛ êÊ ÓÛÉÅÝ ÔÛ»Ý Íõƒ«%9ˆíŽí¾‚Ü–„ œ Á §   Á ãá ›„ óá ž„ïüà ü¸„5 Æ„ ‚ ›Åïü À À
|
|||
|
|
ÈíŽíÓ<ʄ䲆 êŒ Ä ÂŒ Ä ßŒ Ä Ä Ã ÄˆíŽí ‹ÉËó ü«ˆ, œ Æ § Ç Æ Ç ãá °ˆ óá ³ˆ žþ,¶ˆïüÈ Ù È &( *, ¼Þˆ,ሠä äïü ïü Å çˆ Å
|
|||
|
|
ȈíŽí$舴≠ȪŒ É ÂŒ É ßŒ É É È ÉˆíŽí Ëó Ëó üò‹( œ Ë § Ì Ë Ì ãá ÷‹ óá ú‹ïüÍßàáâãä úM ûM ÿM €N �N ƒN ÄN ä â à á ß ã [] _a L¡Œ$¦Œ Ê Ê ŽíüÚŒ3 œ Ï § Ð Ï Ð ãá ߌ óá âŒïüæç �M �M æ ç (* ,. üÆ�1 œ Ò § Ó Ò Ó ãá Ë� óá Î�ïüÔ ÄM Ô !# ´þ� �Ž å åïü Ñ …Ž Ñ
|
|||
|
|
ÔˆíŽí$†Žü¸Ž- œ Ö § × Ö × ãá ½Ž óá ÀŽïü üêŽ6 œ Ù § Ú Ú Ù ãá ïŽ óá òŽ ž�TõŽïüÛ Àc Û &( *, ü§�8 ª� æ ç è æïü ç c c ˆ ¢cµ
|
|||
|
|
` £c®Ä ` àB¤GS
|
|||
|
|
èý¤ Ø ®� Ø
|
|||
|
|
ÛˆíŽí$¯�± µ�üà�' œ Ý § Þ Þ Ý ãá å� óá è�ïüß ´ ß !# ¤Ž‘<‘‘ ïü Ü Ü
|
|||
|
|
߈íŽíüù’! üñ‘' $ A splicing iterator for `IndexMap`.Á ™’ú ü�’7 4 This `struct` is created by [`IndexMap::splice()`].Á üÕ’#�Õ 4„“ §
|
|||
|
|
á š â œ ã § ä ¤ å á ã ä â å ÍìÅþ �“ ÍìËþ ’“ ÍìÑþ •“ Íì×þ ˜“ ùMÅþ ¼¨“ ÅþúM ËþÑþl±“ šeËþ $È“ ™Ëþ Ï“ Åe×þ \Ú“ Ëþ §
|
|||
|
|
ôí“ Ñþ §
|
|||
|
|
×þ §
|
|||
|
|
à à ç? æØ Ö ç¥@ Ö èŒ Ö é¹@ Ö 6õ •Â\¶ §
|
|||
|
|
ÅþËþÑþ×þ 6õ •Â\¶ æçèé ÷‹“PS MP JM GJ é í“Ö à à §
|
|||
|
|
¬
|
|||
|
|
¬
|
|||
|
|
°
|
|||
|
|
í ±
|
|||
|
|
Þ` ‚ ø �Ãx¶*ÓËþÑþ×þ„‘”$‘”Ö à à � � ¨ �Ä ‘Ó ê9œÒž”²ËþÑþü§”",§”Ö à à ˆ?ˆ? �* ‹?®Ä÷< Œ?«�÷< �?¾�÷< Ž?¤÷< �?µ ÷< �?þ÷< µqS·l· à à И ã§ äŒ å» É% ê`äçËþÑþ¾‚|Ï”dÏ”Ö à à Åþüã”w §
|
|||
|
|
ë š ì œ í § î ¤ ï ì î ï í ë Ï„l¥• ˆ„ ï” š„ ò” ¬„ õ” ¾„¼œ• öƒ ì” è„$¼• ù„Õ Š…\Εąð è”.0 _a ce gi üõ•€ ²|á• ƒ–€ ‚ ¦‡£ÅþÄ… ê£ ñ ñ ê Íì⌠‡– ¤#⌠”â–
|
|||
|
|
ð §
|
|||
|
|
ÅþËþÑþ×þâŒØ Š–˜ã,ª–¹@d´–TV ü¨˜| 8 é š ó œ ô § õ ¤ ö õ ó é ö ô Ï„lï˜ ˆ„ °˜ š„ ³˜ ¬„ ¶˜ ¾„¼æ˜ öƒ ˜ è„$†™ ù„�™ Š…\˜™îý÷ �" ÷ /1 `b df hj ”«™$®™ ê êîý ò ³™ ò
|
|||
|
|
÷ 8ÅþËþÑþ×þ$¸™ü¿¡€ 8 ë š ù œ ú § û ¤ ü ù ë ú ü û Ï„lŠ¢ ˆ„ Ç¡ š„ Ê¡ ¬„ Í¡ ¾„¼�¢ öƒ Ä¡ è„$¡¢ ù„¨¢ Š…\³¢îýýþÿ úM ûM ÿM þ ÿ AC rt vx z| LÆ¢$Ë¢ ø ø Ú„üߢ($⢠ì ìîýۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙîý úM ø ç¢ ø
|
|||
|
|
þ 8ÅþËþÑþ×þ$ì¢üÆ£-LÉ£ í íîý µ˜ ø Ó£ ø
|
|||
|
|
ÿ 8ÅþËþÑþ×þ$Ô£üž¤‹ 8 î š � œ ‚ § ƒ ¤ „ „ ‚ � î ƒ Ï„lô¤ ˆ„ ¦¤ š„ ©¤ ¬„ ¬¤ ¾„¼ë¤ öƒ £¤ è„$‹¥ ù„’¥ Š…\�¥îý… �M … /1 `b df hj ü°¥-L³¥ ï ïîý«“ € ½¥ €
|
|||
|
|
… 8ÅþËþÑþ×þ$Â¥üŸ¦‰ 8 ð š ‡ œ ˆ § ‰ ¤ Š Š ‡ ‰ ð ˆ Ï„ló¦ ˆ„ §¦ š„ ª¦ ¬„ ¦ ¾„¼ê¦ öƒ ¤¦ è„$Š§ ù„‘§ Š…\œ§îý‹ ÄM ‹ /1 `b df hj ´¯§ ²§ ñ ñîý † ¶§ †
|
|||
|
|
‹ 8ÅþËþÑþ×þ$·§ü꧅ 8 ò š � œ Ž § � ¤ � � � � ò Ž Ï„lº¨ ˆ„ ò§ š„ õ§ ¬„ ø§ ¾„¼±¨ öƒ ï§ è„$Ѩ ù„ب Š…\ã¨îý $& UW Y[ ]_ üõ¨¯ 8 ó š ’ œ “ § ” ¤ • • ó ” ’ “ Ï„lÏ© ˆ„ ý¨ š„ €© ¬„ ƒ© ¿cÅþ T¹© ¾„¼Æ© öƒ ú¨ ¿cËþ Tæ© è„$ó© ù„ú© ¿cÑþ T…ª Š…\˜ªîý– Àc – QS “• —™ ›� ü«ª8 ®ª ô õ ö ôîý õ c c ˆ ¢cµ
|
|||
|
|
` £c®Ä ` àB¤GS
|
|||
|
|
öý¤ ‘ ²ª ‘
|
|||
|
|
– 8ÅþËþÑþ×þ$³ª± ¹ªüà! üѬ* ' An extracting iterator for `IndexMap`.Á ü¬ú ü€; 8 This `struct` is created by [`IndexMap::extract_if()`].Á ü¼#�Õ Lë §
|
|||
|
|
˜ œ ™ § š — › ˜ š › ™ Œ„ ù �„ ü û‹ ÿ ¬ˆÅÞ »ˆÌÞ — — ²C œß Ö �ëC Ö }GB×òç §
|
|||
|
|
™ëŸëâÿ }GB×òç œ�õ�’ ”– ˜š 䈮,ˆ®Ö — — ‹å<ª®$ª®Ö — — âÿü¶®$ 8 ÷ œ Ÿ § — ¡ ¡ Ÿ ÷ Œ„ »® �„ ¾® û‹ Á®›ÿ¢ "$ &( üõ®§ ²|á® ƒ¯€ ‚ ú úÎ…£âÿ — — ²C œß Ö �ëC Ö }GB×òç ú™ëŸëâÿ ž£ £ £ �¯ ž Íìó¥ ‡¯ ¤#ó¥ ”ã¯ ø ù “"âÿ ø™ë ùŸë Ì‚° ø ù âÿª§˜" $—°
|
|||
|
|
¢ 8™ëŸëâÿó¥í$Š¯˜ã,¡¯ëC$«¯§© ü„±Y 8 ý œ ¥ § ¦ — § § ¥ ý ¦ û ü âÿ û™ë üŸë˜" $ر �„ Œ± û‹ �± û ü “"âÿ‹© Ìñ Œ„ ‰±›ÿ¨©« úM ûM ÿM © « &( df hj Lä±$é± ¤ ¤ Ú®üý±($€² þ þ›ÿۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ›ÿ úM ¤ …² ¤
|
|||
|
|
© 8™ëŸëâÿ$Š²DÓ² ©ªŒ ª ÂŒ ª ߌ ª ª © ª ™ëŸëâÿ ³Ž •Öüù³-Lü³ ÿ ÿ›ÿ ê” ¤ †´ ¤
|
|||
|
|
« 8™ëŸëâÿ$‡´üÜ´Y 8 ‚ œ § ® — ¯ ‚ ® ¯ € � âÿ €™ë �Ÿë˜" $±µ �„ ä´ û‹ ç´ € � “"âÿÓ® Ìœµ Œ„ á´›ÿ GI KM üºµ_ 8 ƒ œ ± § ² — ³ ² ƒ ³ ± Œ„ ¿µ �„ µ û‹ ŵ ª£Tûµ º£TŽ¶›ÿ´ Àc ´ 8: <> @B ü ¶8 £¶ „ … † „›ÿ … c c ˆ ¢cµ
|
|||
|
|
` £c®Ä ` àB¤GS
|
|||
|
|
†ý¤ ° §¶ °
|
|||
|
|
´ 8™ëŸëâÿ$¨¶± ®¶\› <Ÿ‚Â×î\\ Åe µ ·Ž$ še µ ¸Ž e µ ¸Ð˜47 à µ º §
|
|||
|
|
á#,? Œ µ » ÿ �ÓTF µ ¼ ¨
|
|||
|
|
é DR ¬
|
|||
|
|
µ ½Ç&d\ ± µ ¾ €
|
|||
|
|
Ð/Dj Ì µ ¿ Œ
|
|||
|
|
Å
|
|||
|
|
lt µ À ‚
|
|||
|
|
Š²\ƒ A µ Á ƒ
|
|||
|
|
‹Töø,*ÔÖÀ«”–„†pr\^EGì§ ü”/ , Opt-in mutable access to [`IndexMap`] keys.Á Äú üÈP M These methods expose `&mut K`, mutable references to the key as it is storedÁ |™ in the map.Á ü©G D You are allowed to modify the keys in the map **if the modificationÁ üñ2 / does not change the key's hash and equality**.Á ¤ú ü¨E B If keys are modified erroneously, you can no longer look them up.Á üîE B This is sound (memory safe) but a logical error hazard (just likeÁ ü´D A implementing `PartialEq`, `Eq`, or `Hash` incorrectly would be).Á ùú üý: 7 `use` this trait to enable its methods for `IndexMap`.Á ¸ú ü¼P M This trait is sealed and cannot be implemented for types outside this crate.Á \±   Îì ü§å  4¾  ²»* Æ» ²»6 Æ»*ÃÄÅÇÈÉÃÄÅÇÈÉ Í캻 à LË —¼ Í캻 Ä \Ù ¶¼ È Ç Å É DË Ð Â Â TÙ,Þ Â Â üݘ üê9 6 Return item index, mutable reference to key and valueÁ ¨ú ü°(Ĥlà ‡ ˆ ‡º» ˆ¢ ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ ‡Ÿ¼ ‡¾¼ ¢ Æ Æ ñ  Îìµ¾ î šeµ¾ $Ø µ¾Ÿ¼ ¬ß
|
|||
|
|
ź»µ¾$öŒ üCE ü¢
|
|||
|
|
Y üû: 7 Return mutable reference to key and value at an index.Á º ú ü 0 - Valid indices are `0 <= index < self.len()`.Á ÷ ú ôÿ Computes in **O(1)** time.Át¥
|
|||
|
|
‰ ‰º» ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ ‰Ÿ¼ ‰¾¼  ´
|
|||
|
|
Â
|
|||
|
|
Ǻ»$¹
|
|||
|
|
Ö,¿
|
|||
|
|
üÐ @ ü� J G Return an iterator over the key-value pairs of the map, in their orderÁLÓ Š Šº» Ì Ì Ð/ Ðù Ö /áU®"¯ ŠŸ¼¾¼ Â Ý Â
|
|||
|
|
Ⱥ»$â ü£g ü– H E Scan through each key-value pair in the map and keep those where theÁ üã " closure `keep` returns `true`.Á Š
|
|||
|
|
ú ü’
|
|||
|
|
H E The elements are visited in order, and remaining elements keep theirÁ Tß
|
|||
|
|
order.Á î
|
|||
|
|
ú üö
|
|||
|
|
(ܧ<¦ � �º»— — Ê Ê ±  ÍìÃÇ ® ‹ Œ “"ÃÇ ‹Ÿ¼ Œ¾¼ üÚ/ ‹ Œ ÃǕȘ" $…
|
|||
|
|
ɺ»ÃÇ$¶³¦$¼xz üðI üŽ/´ ¾ú üÂ- * See [`MutableKeys`] for more information.Á œ Ì § Í ¤ Î Ì Î Í ãá õ óá ø ŽÓ û Åe ñ \ßðÏÐÑÓÔÕ Ã Ä Å Ç È É Ó Ñ Õ Ô bd gi ln DÀ Å Ë Ë ˆíTÒ,× Ë Ë Žíüç~lê Ž � Žßð �œ‘ ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ Žˆí ŽŽí Ë¢ Ò Ò û Ë Î윑 ø šeœ‘ $Ð œ‘ˆí l×
|
|||
|
|
шíŽí ñœ‘$€Œ †KM üÄFtÇ � �ßð ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ �ˆí �Ží Ë Ö Ë
|
|||
|
|
ÓˆíŽí ñ$ÛÖ,áü×?LÚ ‘ ‘ßð Ì Ì Ð/ Ðù Ö /áU®"¯ ‘ßð Ãßð Ä Ë ä Ë
|
|||
|
|
ÔˆíŽí ñ$éüÑU<Ô ” ”ßðâÿ Ë— Ö Ö ß Ë û‹ Ü ’ “ “"âÿ ’ˆí “Ží ìˆ ’ “ âÿöј" $¡
|
|||
|
|
ÕˆíŽí ñâÿ$䳦$ê� üì! üß, ) Opt-in mutable access to [`Entry`] keys.Á Œú ü�Pò´ |á˵ üñGäµ ü¹2µ¶ ìú üðEý¶ ü¶EÌ· üüD›¸ Áú üÅ7 4 `use` this trait to enable its methods for `Entry`.Á ýú ü�PŹ |ö × × ²»üìö Æ»4‡ × ²»" Æ» ²». Æ»*ØÙØÙ Í캻 Ø L” äÕ Ù D” ™ × × ü¸ ( ü£ S P Gets a mutable reference to the entry's key, either within the map if occupied,Á üû 8ל<» • •º» •ìÕ × Ã ×
|
|||
|
|
Ùº»$È üÇ . üä ,øÑ ‘ ú ü• 1 . See [`MutableEntryKey`] for more information.Á 8 – œ Û § Ü – Ü Û Œ„ Ì �„ Ï ›íÝÞ Ø Ù Þ "$ ') Dü � Ú Ú ™ëüŽ '<‘ — —›í —›í Ø Ú ™ Ú
|
|||
|
|
Þ 8™ëŸë$ž ü§!6 ü¼ 4 1 Opt-in mutable access to [`OccupiedEntry`] keys.Á ñ ú üõ 1—× 8 ˜ œ à § á ˜ à á Œ„ ¬! �„ ¯!÷íâã Ø Ù ã "$ ') Dä! é! ß ß ™ëüö!'<ù! ™ ™÷í ™÷í Ø ß �" ß
|
|||
|
|
ã 8™ëŸë$†"ü¹#4 üÐ"2 / Opt-in mutable access to [`VacantEntry`] keys.Á ƒ#ú ü‡#1—× 8 š œ å § æ å æ š Œ„ ¾# �„ Á#Éîçè Ø Ù è "$ ') Dô# ù# ä ä ™ëü†$'<‰$ › ›Éî ›Éî Ø ä ‘$ ä
|
|||
|
|
è 8™ëŸë$–$üº%5 üÐ$3 0 Opt-in mutable access to [`IndexedEntry`] keys.Á „%ú üˆ%1—× 8 œ œ ê § ë ë ê œ Œ„ ¿% �„ Â%›ïìí Ø Ù í "$ ') Dö% û% é é ™ëüˆ&'<‹& � �›ï �›ï Ø é “& é
|
|||
|
|
í 8™ëŸë$˜&dÒ& 4Ø&µ î î ²»|Ò& î
|
|||
|
|
D ¬
|
|||
|
|
ÿ ‚�*D# ¡ ÿ ƒ ‡
|
|||
|
|
Ã7D- Ò ÿ „ ˆ
|
|||
|
|
Ü=T7 ¼ ÿ … ‰
|
|||
|
|
š+$C ƒ ÿ † Š
|
|||
|
|
½-<I © ÿ ‡ ‹
|
|||
|
|
‹5$R ¨ ÿ ˆ �
|
|||
|
|
Ì94X ö ÿ ‰ �
|
|||
|
|
á;L` › ÿ Š �
|
|||
|
|
éÂœy ‰ ÿ ‹ë"D þ ÿ �É"”ª ü ÿ ŽÖ€ Ò � ÿ �ö ç ªB ÿ �®Dû ¿ß ÿ ‘× � ` ÿ ’Ž$¥ še ÿ ”Ž e ÿ ”‘4« ¢e ÿ •
|
|||
|
|
$Ä Â ÿ —¾ù,Ê ç£ ÿ ˜ó…,Ñ Ù¢ ÿ ™Ž†DØ ³" ÿ šèþ\â ¤# ÿ ›,.1 üÿêíØÛÆÉ´·¢¥�“Ôr€\’svdgŒÄX|ÛJœð<L‰-T˜ "üþL¸ï ¾ßáÌ黧©´à üñD A A dynamically-sized slice of key-value pairs in an [`IndexMap`].Á ¶ú üºB ? This supports indexed operations much like a `[(K, V)]` slice,Á üý2 / but not any hashed operations on the map keys.Á °ú ü´H E Unlike `IndexMap`, `Slice` does consider the order for [`PartialEq`]Á üýM J and [`Eq`], and it also implements [`PartialOrd`], [`Ord`], and [`Hash`].Á ,ë œ � § ž � ž ãá ñ óá ô‰‚ OÝ(L9U Ÿ&( +- üý"<ˆ œ œ ¡Ç´Ë œ ¡ § ¢ ¢ ¡ ãá Ð óá Ó‰‚£¤¥¦ !# üèATü ¢ ¢¡Ç ¢‰‚ � ÃËÓ'£üþMt’ ‚ £ £¡Ç £‰‚ ª ÐÎÓY¤ü
|
|||
|
|
CT®
|
|||
|
|
‚ �� žÖ€ ¡ˆˆ ¢‰ˆ l }.xϡǾ‚È�
|
|||
|
|
¥ˆíŽíÓ<¹
|
|||
|
|
ü· 5Tº ÿ È��ô
|
|||
|
|
¦ˆíŽí$Å ´Å œ ¨ § © ¨ © ãá Ê óá Í ‰‚ª«¯°±²³µ·¸¹º»¼½¾¿ÀÁÂÃÄÅÆÇÈÉÊÌÐÕ×Ûàãç � „† üâ @dð È�›Å § §
|
|||
|
|
ªˆíŽí$ý üõ
|
|||
|
|
" ÜÕ
|
|||
|
|
Returns an empty slice.Á ‚ §
|
|||
|
|
‰‚ §§
|
|||
|
|
¬ ¬ §
|
|||
|
|
«ˆíŽí §
|
|||
|
|
†üë* üÃ# Returns an empty mutable slice.Á<ø §
|
|||
|
|
‰‚ §§
|
|||
|
|
® ® §
|
|||
|
|
ˆíŽí §
|
|||
|
|
€ü– üÉ: 7 Return the number of key-value pairs in the map slice.Á £ ¤ ¤‰‚ § § §
|
|||
|
|
¯ˆíŽí$¨ü©$ üß7 4 Returns true if the map slice contains no elements.ÁD¶ ¥ ¥‰‚ § ¿ §
|
|||
|
|
°ˆíŽí$Àüß9 üû" Get a key-value pair by index.Á ¢ú üª0ÿ¿Læ ¦ ¦‰‚ ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ ¦ˆí ¦Ží § ð §
|
|||
|
|
±ˆíŽí$ñÖ,÷üÞE üØD A Get a key-value pair by index, with mutable access to the value.Á ¡ú ü©0ÿ¿lå § §‰‚ ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ §ˆí §Ží § ó §
|
|||
|
|
²ˆíŽí$øÖ,þüñI üêE B Returns a slice of key-value pairs in the given range of indices.Á ´ú ü¼0ÿ¿Lø ¨ ¨‰‚ Þâۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ›‚ §£ ´ ´ ™ § Üã ‚ íã”…
|
|||
|
|
³ˆíŽíÞâ$š˜ã, -/ üÒU üÃM J Returns a mutable slice of key-value pairs in the given range of indices.Á •ú ü�0ÿ¿lÙ © ©‰‚Þâۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙí„ §£ ¶ ¶ þ § Üã ç íã”ê
|
|||
|
|
µˆíŽíÞâ$ƒ˜ã,‰-/ üÞ- ü¸! Get the first key-value pair.Á,ë ª ª‰‚ ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ ªˆí ªŽí § ñ §
|
|||
|
|
·ˆíŽí$òüÙ 9 ü‘ C @ Get the first key-value pair, with mutable access to the value.ÁLæ « «‰‚ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ «ˆí «Ží § ð §
|
|||
|
|
¸ˆíŽí$õ üÄ , üŸ Get the last key-value pair.Á$Ñ ¬ ¬‰‚ ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ ¬ˆí ¬Ží § Ö §
|
|||
|
|
¹ˆíŽí$× ü»!8 üô B ? Get the last key-value pair, with mutable access to the value.ÁDÈ! ‰‚ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ ˆí Ží § Ñ! §
|
|||
|
|
ºˆíŽí$Ö!üË$< üþ"+ ( Divides one slice into two at an index.Á ®#ú ü¶#" ***Panics*** if `index > len`.Á üÝ#U R For a non-panicking alternative see [`split_at_checked`][Self::split_at_checked].Á ²|·$DØ$€ ® ®‰‚ Š� Š� § á$ §
|
|||
|
|
»ˆíŽí$â$Ö~³üê'L ü�&3 0 Divides one mutable slice into two at an index.Á Å&ú üÍ&"â� üô&] Z For a non-panicking alternative see [`split_at_mut_checked`][Self::split_at_mut_checked].Á ²|Ö'd÷'€ ¯ ¯‰‚ ¾’ ¾’ § „( §
|
|||
|
|
¼ˆíŽí$‰(Ö#¶ü©*L üÈ)+¡� ø)ú ü€*$ ! Returns `None` if `index > len`.Á„¶* ° °‰‚ ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙõ“ õ“ § Ç* §
|
|||
|
|
½ˆíŽí$È*Ö‹¹ü¬-\
|
|||
|
|
` £c®Ä ` àB¤GS
|
|||
|
|
Ëý¤ ” Ås ”
|
|||
|
|
—ˆíŽí$Æs± Ìsü°tm œ ™ § š ÙU › ãU œ œ š › ™ ãá µt óá ¸t Í츄 »t Í쾄 ¿t µßˆí¸„ lùt µßŽí¾„ l�u‰‚� ·ß � hj mo ik eg ü¤u+§u Ì Í Ì‰‚ Í‹„ ˜ ªu ˜
|
|||
|
|
�ˆíŽí¸„¾„$«u¹
|
|||
|
|
,±uD‚v �ªŒ ž ÂŒ ž ߌ ž ž � žˆíŽí¸„¾„ ‘È à à И ã§ äŒ å» É% ê`ä縄¾„ üÖvj œ § ¡ ÙU ¢ ãU £ ¢ £ ¡ ãá Ûv óá Þv ½à áv Îà åv ßà lœw ôà l²w‰‚¤ ·ß ¤ <> AC FH KM üÇw(Êw Î Ï Î‰‚ ÏЄ Ÿ Íw Ÿ
|
|||
|
|
¤ˆíŽí¸„¾„$Îw¹
|
|||
|
|
,Ôw4™x ¤ªŒ ¥ ÂŒ ¥ ߌ ¥ ¥ ¤ ¥ˆíŽí¸„¾„ ‘È Ñ„ üÉxj œ § § ¨ ÙU © ãU ª © § ª ¨ ãá Îx óá Ñx ½à Ôx Îà Øx ßà l�y ôà l¥yâ„« ·ß « <> AC FH KM üºy+½y Ð Ñ Ðâ„ Ñ‹„ ¦ Ày ¦
|
|||
|
|
«ˆíŽí¸„¾„$Áy¹
|
|||
|
|
,Çy4�z «ªŒ ¬ ÂŒ ¬ ߌ ¬ ¬ « ¬ˆíŽí¸„¾„ ã„ ¿ã ü¿z} œ ® § ¯ ÙU ° ãU ± Ÿ ² ² ° ® ¯ ± ãá Äz óá Çz ½à Êz Îà Îz Ÿ tÒz ßà l˜{ ôà l®{‰‚´ ·ß ´ JL OQ TV Y[ X Øz üÃ{+Æ{ Ò Ó Ò‰‚ Óü„ É{
|
|||
|
|
´ˆíŽí¸„¾„ Ÿ$Ê{¹
|
|||
|
|
,Ð{ü¬|} œ · § ¸ Ÿ ¹ ÙU º ãU » º » ¹ · ¸ ãá ±| óá ´| ¢Ë t·| ÍìÅ… Ç| ÍìË… Ë| µßˆíÅ… l…} µßŽíË… l›}Ž…½ ·ß ½ pr uw z ½| qs mo ü°}+³} Ô Õ ÔŽ… Õ˜… ¶ ¶} ¶
|
|||
|
|
½ˆíŽí ŸÅ…Ë…$·}¹
|
|||
|
|
,½}ü–~% œ ¿ § À ¿ À ãá ›~ óá ¢~ ìžž~ ™Ží ¥~‰‚ (* -/ üÀ~= œ  § à  à ãá Å~ óá Ô~ ²» TÈ~ íߎíŽí T×~‰‚Ä ïß Ä 9; >@ ü„7\‡ Ö × Ö‰‚ ׉‚ ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙüÓ Á “ Á
|
|||
|
|
ĈíŽí$”¹
|
|||
|
|
,šüî( œ Æ § Ç Ç Æ ãá ó óá û ž¯ ö ºŽí þ‰‚È » È 35 8: ü�€' € Ø Ù Ø‰‚ Ù‰‚ üÓ Å ¤€ Å
|
|||
|
|
ȈíŽí$¥€¹
|
|||
|
|
,«€üï€+ œ Ê § Ë Ê Ë ãá ô€ óá ý€ šeˆí $÷€ šeŽí $€�‰‚Ì ›e Ì ?A CE ü¡�($¤� Ú Û Ú‰‚ Û™ É™ Í Í ´� É Íìšø ©� ¢ešø 4¬�
|
|||
|
|
̈íŽíšø $µ�º,»�8: üÞ‚' œ Ï § Ð Ð Ï ãá ã‚ óá 悉‚ÑÒ Û¢ Ü¢ Ò &( *, \Œƒ4‘ƒ Î Î Žíü¢ƒ#,¥ƒ€ Ü Ü‰‚ ÜŽí Î «ƒ Î
|
|||
|
|
ÒˆíŽí$¬ƒÖ,²ƒüôƒ* œ Ô § Õ Õ Ô ãá ùƒ óá üƒ‰‚Ö µ" Ö !# ü¥„/L¨„€ Ý Ý‰‚ ÝŽí Ó ²„ Ó
|
|||
|
|
ÖˆíŽí$·„Ö,½„¼ä†Tñ† ü† µŽ ‚‡ ‘‡ , ƒ‡ „‡ Ž‡ , …‡ 8˜ã ,†‡ & ‹‡ 8´ Œ‡ $ �‡
|
|||
|
|
�‡ *“‡ –‡ ³Ž , —‡ ˜‡ ±Ž T 8 $¢‡ ¦‡ 8œ §‡ $ ¨‡ 8§ ª‡ $ «‡ 8¤ ‡ ®‡ 8ó… ,°‡ µ‡ , ¶‡ 8˜ã ,·‡ ¼‡ 8
|
|||
|
|
¾‡ 8 D‡ ʇ 8œ ˇ $ ̇ 8§ · $ χ 8¤ ч Ò‡ Ô‡ �‰ 8! $⇠8° 4ç‡ î‡ 8Ù ,ð‡ õ‡ 8œ ö‡ $ ÷‡ 8§ ù‡ ú‡ % û‡ 8 Šˆ 8Ö ,�ˆ ’ˆ §ˆ “ˆ 8 $”ˆ $ ˜ˆ 8˜ã ,šˆ & Ÿˆ , ¡ˆ 8˜ã ,¢ˆ (©ˆ ¬ˆ 8 $ˆ '±ˆ 8° 4³ˆ ºˆ …‰ 8Ù ,̈ 'ш 8ÊK TÓˆ ݈ ÷ˆ Þˆ 8 $߈ ㈠8“ Täˆ îˆ ïˆ ðˆ öˆ 8˜ã ,ñˆ 8 $š‰ ž‰ 8œ Ÿ‰ $ ‰ 8§ ¢‰ $ £‰ 8¤ ¥‰ ¦‰ 8Ž† D¨‰ °‰ , ±‰ 8˜ã ,²‰ ·‰ 8
|
|||
|
|
¹‰ 8 D½‰ ʼn 8œ Ɖ $ lj 8§ ɉ $ ʉ 8¤ ̉ ͉ ω úŠ
|
|||
|
|
8 ݉ 8× Là‰ é‰ ‚Š ê‰ 8 ë‰ 8 $ï‰ $ ó‰ 8˜ã ,õ‰ & ú‰ , ü‰ 8˜ã ,ý‰ („Š ‡Š 8 ˆŠ 8 $ŒŠ '�Š 8° 4’Š ™Š ðŠ 8Ù ,«Š '°Š 8ÜK t²Š ÀŠ ⊠ÁŠ 8 Š 8 $ÆŠ ÊŠ 8¥ tËŠ ÙŠ ÚŠ ÛŠ አ8˜ã ,ÜŠ 8 $…‹ ‰‹ 8œ Š‹ $ ‹‹ 8§ �‹ Ž‹ 8ó… ,�‹ •‹ , –‹ 8˜ã ,—‹ œ‹ 8
|
|||
|
|
ž‹ 8Ù ,¢‹ §‹ 8œ ¨‹ $ ©‹ 8§ «‹ ¬‹ ®‹ ÛŒ 8! $¼‹ 8° 4Á‹ È‹ 8Ù ,Ê‹ Ï‹ 8œ Ћ $ Ñ‹ 8§ Ó‹ Ô‹ % Õ‹ 8 ä‹ 8Ö ,ç‹ ì‹ �Œ í‹ 8 $î‹ $ ò‹ 8˜ã ,ô‹ & ù‹ , û‹ 8˜ã ,ü‹ (ƒŒ †Œ 8 $‡Œ ŒŒ ÑŒ 8 $žŒ '¢Œ 8ÊK T¤Œ ®Œ ÃŒ ¯Œ 8 $°Œ ´Œ 8Ó <µŒ ¼Œ ÂŒ 8˜ã ,½Œ 8 $æŒ êŒ 8œ ëŒ $ ìŒ 8§ îŒ ïŒ 8Ž† DñŒ ùŒ , úŒ 8˜ã ,ûŒ €� 8
|
|||
|
|
‚� 8Ù ,†� ‹� 8œ Œ� $ �� 8§ �� �� ’� «Ž 8 � 8× L£� ¬� Å� � 8 ®� 8 $²� $ ¶� 8˜ã ,¸� & ½� , ¿� 8˜ã ,À� (Ç� Ê� 8 Ë� 8 $Ï� Ô� ¡Ž 8 $æ� 'ê� 8ÜK tì� ú� “Ž û� 8 ü� 8 $€Ž „Ž 8Ó <…Ž ŒŽ ’Ž 8˜ã ,�Ž
|
|||
|
|
²Ž¤´ ü 4 1 Opt-in access to the experimental raw entry API.Á 5 ú ü9b _ This module is designed to mimic the raw entry API of [`HashMap`][std::collections::hash_map],Á üœG D matching its unstable state as of Rust 1.75. See the tracking issueÁ üäR O [rust#56167](https://github.com/rust-lang/rust/issues/56167) for more details.Á · ú ü»b _ The trait [`RawEntryApiV1`] and the `_v1` suffix on its methods are meant to insulate this forÁ üža ^ the future, in case later breaking changes are needed. If the standard library stabilizes itsÁ ü€` ] `hash_raw_entry` feature (or some replacement), matching *inherent* methods will be added toÁ üá, ) `IndexMap` without such an opt-in trait.Á d¼ æòŒ £ ¾ ã ù ¨$› � Ø Ú ¢
|
|||
|
|
Å
|
|||
|
|
l¡ Ø Û ‚
|
|||
|
|
Š�ÓT½ Ø Ý éÇ¿LÉ Ô Ø ÞÇ¿ Õ Ø Þ DÔ ¬
|
|||
|
|
Ø ß ç× é ` Ø à\\ÿ Åe Ø âŽ$Œ še Ø ãŽ e Ø ã PhantomDataÁ\¥ • Ø äÕ–
|
|||
|
|
– Ø äí ¼ ë Ø å,“ 14 !,µ øúÑÓLã ÀTò ²´¡£Ì— uL¶ Püã( üÂ4 ��
|
|||
|
|
÷ ú üûM J See the [`raw_entry_v1`][self] module documentation for more information.Á lí æ œ ç § è ¤ é æ ç é è ²»üãÆ- ù º» 4… Œ„ û �„ þ ‘Î � æ ²»B ªš
|
|||
|
|
6 ²»N ªš
|
|||
|
|
Bêëêë ê ë OQ TV Y[ üÓ7 ü’? < Creates a raw immutable entry builder for the [`IndexMap`].Á Ö ú üÞE B Raw entries provide the lowest level of control for searching andÁ ü¨ I F manipulating a map. They must be manually initialized with a hash andÁ Üö then manually searched.Á –
|
|||
|
|
ú ´ž
|
|||
|
|
This is useful forÁ ´¹
|
|||
|
|
* Hash memoizationÁ üÔ
|
|||
|
|
H E * Using a search key that doesn't work with the [`Equivalent`] traitÁ ü¡ < 9 * Using custom comparison logic without newtype wrappersÁ â ú üê Q N Unless you are in such a situation, higher-level and more foolproof APIs likeÁ üÀ / , [`get`][IndexMap::get] should be preferred.Á ô ú üü G D Immutable raw entries have very limited use; you might instead wantÁ üÈ
|
|||
|
|
1 . [`raw_entry_mut_v1`][Self::raw_entry_mut_v1].Á þ
|
|||
|
|
ú t† γ ™ ú <¡ ùî ü use core::hash::BuildHasher;Á üÒ1 . use indexmap::map::{IndexMap, RawEntryApiV1};Á ˆ ú ü�" ¯´ ü·5 2 map.extend([("a", 100), ("b", 200), ("c", 300)]);Á ñ ú üù- * for k in ["a", "b", "c", "d", "e", "f"] {Á ü«, ) let hash = map.hasher().hash_one(k);Á üÜ$ ! let i = map.get_index_of(k);Á Ü… let v = map.get(k);Á ü¥& # let kv = map.get_key_value(k);Á üÐ" let ikv = map.get_full(k);Á ÷ ú üÿ2 / println!("Key: {} and value: {:?}", k, v);Á ¶ ú ü¾7 4 assert_eq!(map.raw_entry_v1().from_key(k), kv);Á üúH E assert_eq!(map.raw_entry_v1().from_hash(hash, |q| *q == k), kv);Á üÇL I assert_eq!(map.raw_entry_v1().from_key_hashed_nocheck(hash, k), kv);Á ü˜N K assert_eq!(map.raw_entry_v1().from_hash_full(hash, |q| *q == k), ikv);Á üëM J assert_eq!(map.raw_entry_v1().index_from_hash(hash, |q| *q == k), i);Á ,½ ìµ <Ç ùîdÖ Þ Þº» ò ò îZ ÷Ø Ø å¿f »|rû Þ™ëŸë¿ð æ ã æ
|
|||
|
|
꺻™ëŸë¿ð$ä üå4B ü�5 2 Creates a raw entry builder for the [`IndexMap`].Á Ê ú üÒE ˜›
|
|||
|
|
üœI ç›
|
|||
|
|
üêF C then manually searched. After this, insertions into a vacant entryÁ üµ. + still require an owned key to be provided.Á è ú üð9 6 Raw entries are useful for such exotic situations as:Á ® ú ´¶ ˆ�
|
|||
|
|
üÑM J * Deferring the creation of an owned key until it is known to be requiredÁ ü£H ¨�
|
|||
|
|
üð< ú�
|
|||
|
|
± ú ü¹M J Because raw entries provide much more low-level control, it's much easierÁ ü‹ N K to put the `IndexMap` into an inconsistent state which, while memory-safe,Á üÞ Q N will cause the map to produce seemingly random results. Higher-level and moreÁ ü´ U R foolproof APIs like [`entry`][IndexMap::entry] should be preferred when possible.Á Ž ú ü– F C Raw entries give mutable access to the keys. This must not be usedÁ üá P M to modify how the key would compare or hash, as the map will not re-evaluateÁ ü¶ H E where the key should go, meaning the keys may become "lost" if theirÁ üƒ L I location does not reflect their state. For instance, if you change a keyÁ üÔ K H so that the map now contains keys which compare equal, search may startÁ ü¤!R O acting erratically, with two keys randomly masking each other. ImplementationsÁ üû!P M are free to assume this doesn't happen (within the limits of memory-safety).Á Ð" ú tØ" γ ë" ú <ó" ùî üÿ" ª¡
|
|||
|
|
ü¤#1 Ô¡
|
|||
|
|
üÚ#1 . use indexmap::map::raw_entry_v1::RawEntryMut;Á �$ ú ü˜$" ¯´ ü¿$5 ©¢
|
|||
|
|
ù$ ú ü�%' $ // Existing key (insert and update)Á ü%0 - match map.raw_entry_mut_v1().from_key("a") {Á üâ%1 . RawEntryMut::Vacant(_) => unreachable!(),Á ü˜&, ) RawEntryMut::Occupied(mut view) => {Á üÉ&( % assert_eq!(view.index(), 0);Á üö&) & assert_eq!(view.get(), &100);Á ü¤'# let v = view.get_mut();Á üÌ'" let new_v = (*v) * 10;Á ¼ó' *v = new_v;Á ü�(0 - assert_eq!(view.insert(1111), 1000);Á LÄ( }Á ,Ò( ìµ Ü( ú üä( assert_eq!(map["a"], 1111);Á ìˆ) assert_eq!(map.len(), 3);Á ª) ú Ô²) // Existing key (take)Á üÑ)* ' let hash = map.hasher().hash_one("c");Á ü€*E B match map.raw_entry_mut_v1().from_key_hashed_nocheck(hash, "c") {Á üÊ*1 �¸
|
|||
|
|
ü€+( % RawEntryMut::Occupied(view) => {Á ü+( % assert_eq!(view.index(), 2);Á üÚ+> ; assert_eq!(view.shift_remove_entry(), ("c", 300));Á L�, •»
|
|||
|
|
,«, ìµ üµ,7 4 assert_eq!(map.raw_entry_v1().from_key("c"), None);Á ìñ, assert_eq!(map.len(), 2);Á “- ú ü›-* ' // Nonexistent key (insert and update)Á ”Ê- let key = "d";Á üá-* ' let hash = map.hasher().hash_one(key);Á ü�.A > match map.raw_entry_mut_v1().from_hash(hash, |q| *q == key) {Á üÖ.3 0 RawEntryMut::Occupied(_) => unreachable!(),Á üŽ/& # RawEntryMut::Vacant(view) => {Á ü¹/( ‚¾
|
|||
|
|
üæ/4 1 let (k, value) = view.insert("d", 4000);Á üŸ02 / assert_eq!((*k, *value), ("d", 4000));Á ÜÖ0 *value = 40000;Á Lö0 •»
|
|||
|
|
,„1 ìµ üŽ1 assert_eq!(map["d"], 40000);Á ì³1 é»
|
|||
|
|
Õ1 ú üÝ1A ŒÁ
|
|||
|
|
ü£21 �¸
|
|||
|
|
üÙ2( н
|
|||
|
|
ü†3( ‚¾
|
|||
|
|
ü³3? < assert_eq!(view.swap_remove_entry(), ("d", 40000));Á L÷3 •»
|
|||
|
|
,…4 ìµ ü�4# assert_eq!(map.get("d"), None);Á ì·4 Ö¿
|
|||
|
|
<Ù4 ùî„è4 ß ßº» Œ Œ ƒ] ‘ Ø Ø D •…¸ÉÚ ß™ëŸë¿ð æ ù4 æ
|
|||
|
|
뺻™ëŸë¿ð$þ4 ü«5: œ í § î ¤ ï í î ï ãá °5 óá ³5 ŽÓ ¶5 ßððñ ê ë ð ñ .0 35 8: üì56 dï5 à àßð ò ò îZ ÷Ø Ø å¿f »|rû àˆíŽí ñ ì ü5 ì
|
|||
|
|
ðˆíŽí ñ$ý5 üÖ6A „Ù6 á áßð Œ Œ ƒ] ‘ Ø Ø D •…¸ÉÚ áˆíŽí ñ ì ê6 ì
|
|||
|
|
ñˆíŽí ñ$ï6 ü»9' üÌ7V S A builder for computing where in an [`IndexMap`] a key-value pair would be stored.Á £8 ú ü§8V S This `struct` is created by the [`IndexMap::raw_entry_v1`] method, provided by theÁ üþ8< 9 [`RawEntryApiV1`] trait. See its documentation for more.Á |Æ9 §
|
|||
|
|
ó œ ô § õ ¤ ö õ ö ô ó Œ„ Ú9 �„ Ý9 ‘Î à9 ¬ˆÔé9 »ˆ ¿ð §
|
|||
|
|
ò ò îZ ÷Ø Ø å¿f »|rû §
|
|||
|
|
™ëŸë¿ð å¿f »|rû ÷Ö9 ‹� �’ •— š é9 Ø ò ò øïüˆ:9 8 â œ ù § ú ¤ û ú û ù â Œ„ �: �„ �: ‘Î “: �ü Àc ü #% (* -/ üÈ:8 Ë: ã ä å ã � ä c c ˆ ¢cµ
|
|||
|
|
` £c®Ä ` àB¤GS
|
|||
|
|
åý¤ ø Ï: ø
|
|||
|
|
ü 8™ëŸë¿ð$Ð: ± Ö: üÎ;. §
|
|||
|
|
þ œ ÿ § € ¤ � € � ÿ þ Œ„ ×; �„ Ú; ‘Î Ý; ¹Ï
|
|||
|
|
‚ „ † ˆ Š Ó; -/ 24 79 ü£<‡ ܃< Access an entry by key.ÁDª< æ¹Ï
|
|||
|
|
æ¢ Û¼Ý¼Þ¼© ß¼ à¼ÛἈ cSñŸ«‡zÙ�“ ý¢ ƒ ƒ Á< ý Îì°Õ
|
|||
|
|
³< Åe¿ð \ô< še°Õ
|
|||
|
|
$•= °Õ
|
|||
|
|
™ë lœ=
|
|||
|
|
‚ §
|
|||
|
|
™ëŸë¿ð°Õ
|
|||
|
|
$¶< Œ ¼< ac ü�>‚ üà=* ' Access an entry by a key and its hash.Á¼–> ç¹Ï
|
|||
|
|
ç°Õ
|
|||
|
|
¶Õ
|
|||
|
|
ý¢ … … Ç> ý £Ö
|
|||
|
|
®> ÔÖ
|
|||
|
|
lƒ?
|
|||
|
|
„ §
|
|||
|
|
™ëŸë¿ð°Õ
|
|||
|
|
$±> §$·> Œ Â> >@ üÇ@s ä¦@ Access an entry by hash.ÁLÎ@ ¹Ï
|
|||
|
|
³Ø¶Õ
|
|||
|
|
ý— ‡ ‡ ý øØ Ø@ è “"³Ø è™ë Œ¨A è ³Ø�Ú
|
|||
|
|
˜" $µA
|
|||
|
|
† §
|
|||
|
|
™ëŸë¿ð³Ø$Û@ §$á@ ò‹Dì@ vx üîB ü¸B1 . Access an entry by hash, including its index.ÁtõB ¹Ï
|
|||
|
|
³Øۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ �“™“ ý— ‰ ‰ ý øØ „C é “"³Ø é™ë ŒÛC é ³ØíÜ
|
|||
|
|
˜" $èC
|
|||
|
|
ˆ §
|
|||
|
|
™ëŸë¿ð³Ø$‡C §$�C ò‹D˜C vx üÌEp üžE) & Access the index of an entry by hash.Á|ÓE ¹Ï
|
|||
|
|
³Øµ˜ ý— ‹ ‹ ý øØ ãE ê “"³Ø ê™ë ŒªF ê ³ØöÞ
|
|||
|
|
˜" $·F
|
|||
|
|
Š §
|
|||
|
|
™ëŸë¿ð³Ø$æE §$ìE ò‹D÷E vx ü£I* ü°GV ²Ë
|
|||
|
|
‡H ú ü‹HZ W This `struct` is created by the [`IndexMap::raw_entry_mut_v1`] method, provided by theÁ üæH< þÌ
|
|||
|
|
”®I §
|
|||
|
|
� œ Ž § � ¤ � � Ž � � Œ„ ÅI �„ ÈI ‘Î ËI ¬ˆôÔI »ˆ Ï
|
|||
|
|
Œ Œ ƒ] ‘ Ø Ø D •…¸ÉÚ §
|
|||
|
|
™ëŸë¿ð D •…¸ÉÚ ‘ ÁI „† ‰‹ Ž� “ ÔI Ø Œ Œ Íðü÷I< 8 ë œ “ § ” ¤ • ë ” “ • Œ„ üI �„ ÿI ‘Î ‚J æ�– Àc – #% (* -/ üºJ8 ½J ì í î ìæ� í c c ˆ ¢cµ
|
|||
|
|
` £c®Ä ` àB¤GS
|
|||
|
|
îý¤ ’ ÁJ ’
|
|||
|
|
– 8™ëŸë¿ð$ÂJ ± ÈJ üÃK1 §
|
|||
|
|
˜ œ ™ § š ¤ › ™ › š ˜ Œ„ ÌK �„ ÏK ‘Î ÒK îá
|
|||
|
|
œ ž ¡ ÈK ') ,. 13 ü›L‰ ÜûK æÓ
|
|||
|
|
D¢L ïîá
|
|||
|
|
ï°Õ
|
|||
|
|
£ ¨ © †$ ª ˆ « ¬ £$ ˆ éö*(°TÓù §
|
|||
|
|
™ëŸë¿ð — ¢ � � ¹L — £Ö
|
|||
|
|
«L ´Ö
|
|||
|
|
\îL ÄÖ
|
|||
|
|
$�M ÔÖ
|
|||
|
|
l–M
|
|||
|
|
œ §
|
|||
|
|
™ëŸë¿ð°Õ
|
|||
|
|
$®L Œ ´L FH üÂN„ ü“N* ®Ö
|
|||
|
|
¼ÉN ðîá
|
|||
|
|
ð°Õ
|
|||
|
|
Ìç
|
|||
|
|
— ¢ Ÿ Ÿ úN — £Ö
|
|||
|
|
áN ÔÖ
|
|||
|
|
l¸O
|
|||
|
|
ž §
|
|||
|
|
™ëŸë¿ð°Õ
|
|||
|
|
$äN §$êN Œ õN >@ êO ž ªŒ ÂŒ ߌ ž ™ëŸë¿ð°Õ
|
|||
|
|
™ë °Õ
|
|||
|
|
ü±Pu ä�P ’Ø
|
|||
|
|
L¸P îá
|
|||
|
|
³ØÌç
|
|||
|
|
— — ¢ ¢ — øØ ÂP ñ “"³Ø ñ™ë Œ”Q ñ ³ØÛì
|
|||
|
|
˜" $¡Q
|
|||
|
|
¡ §
|
|||
|
|
™ëŸë¿ð³Ø$ÅP §$ËP ò‹DÖP vx üÁU! üìTD A Raw entry for an existing key-value pair or a vacant location toÁ |±U insert one.Á \ÊU §
|
|||
|
|
¤ œ ¥ § ¦ ¤ § ¤ ¦ § ¥ Œ„ ÚU �„ ÝU ‘Î àU ¬ˆ¶ »ˆ¶ Ï
|
|||
|
|
üƒi Ìç
|
|||
|
|
éö*(°TÓù ¨ © « ¬ © ª ¾ ¾ ›` Ã ß Ø Ä Þ` Ø ¬Ò°öá( §
|
|||
|
|
™ëŸë¿ðÌç
|
|||
|
|
¬ ã ã –c è Ø Ø é Þ` Ø †@“äQE´Š §
|
|||
|
|
™ëŸë¿ðÌç
|
|||
|
|
ÖU 9æ üéU& £Œ 9æ £ £
|
|||
|
|
© §
|
|||
|
|
™ëŸë¿ð9æ9æ Ùï
|
|||
|
|
Ìç
|
|||
|
|
£ £ ßñ
|
|||
|
|
ü�V £ £ Ùï
|
|||
|
|
+ç üÄV/ Ð� +ç £ £
|
|||
|
|
¬ §
|
|||
|
|
™ëŸë¿ð+ç+ç ¶ð
|
|||
|
|
Ìç
|
|||
|
|
£ £ ðò
|
|||
|
|
ôÿV £ £ ¶ð
|
|||
|
|
ü£WM 8 ò œ ¯ § ° ¤ ± ò ± ¯ ° Œ„ ¨W �„ ·W ‘Î ÆW ª£T«W º£TºW ¬Ž² Àc ² 35 8: =? ü÷W8 úW ó ô õ ó¬Ž ô c c ˆ ¢cµ
|
|||
|
|
` £c®Ä ` àB¤GS
|
|||
|
|
õý¤ ® þW ®
|
|||
|
|
² 8™ëŸë¿ð$ÿW ± …X üˆZ* §
|
|||
|
|
´ œ µ § ¶ ¤ · · µ ¶ ´ Œ„ ‘Z �„ ”Z ‘Î —Z Ìç
|
|||
|
|
¸ ¹ º ¼ �Z *, /1 46 ä”[ ü¹ZH E Return the index where the key-value pair exists or may be inserted.Á,›[ ö öÌç
|
|||
|
|
³ ¡[ ³
|
|||
|
|
¸ §
|
|||
|
|
™ëŸë¿ð$¢[ ü‡^… üÃ\\ Y Inserts the given default key and value in the entry if it is vacant and returns mutableÁ ü¤]^ [ references to them. Otherwise mutable references to an already existent pair are returned.ÁLŽ^ Ìç
|
|||
|
|
™ëŸëœÿ ³ ³ še™ë $ï^ ´Ö
|
|||
|
|
\€_
|
|||
|
|
¹ §
|
|||
|
|
™ëŸë¿ð$˜^ default_keyÁ\ž^
|
|||
|
|
default_valueÁl®^ ü‘b“ üË`^ [ Inserts the result of the `call` function in the entry if it is vacant and returns mutableÁ ü®a^ šù
|
|||
|
|
t˜b Ìç
|
|||
|
|
³Øœÿ ³ — » » ³ øØ §b –"³Ø ”èb ³Ø ˜" Ú®4ôb ³û
|
|||
|
|
$‡c ´Ö
|
|||
|
|
\˜c
|
|||
|
|
º §
|
|||
|
|
™ëŸë¿ð³Ø$ªb Ñ$°b gi üËeY ü�e) ‰žTÒe Ìç
|
|||
|
|
³ØÌç
|
|||
|
|
³ — ½ ½ ³ øØ Ýe ÷ ø –"³Ø ÷™ë øŸë ´�f ÷ ø ³ØÅÿ
|
|||
|
|
˜"
|
|||
|
|
¼ §
|
|||
|
|
™ëŸë¿ð³Ø$äe ± êe ƒ… üh+ üÇg9 6 A raw view into an occupied entry in an [`IndexMap`].Á ü�h+ ( It is part of the [`RawEntryMut`] enum.Á œ¸h §
|
|||
|
|
¿ œ À § Á ¤   À ¿ Á Œ„ Ðh �„ Óh ‘Î Öh ¬ˆ¶ »ˆ¶ Ï
|
|||
|
|
„ Ùï
|
|||
|
|
¬Ò°öá( Ã Ä Ìh MO RT WY ôßh ,ßh Ø ¾ ¾ Õêì dƒi Ø ¾ ¾ • • – Õ–
|
|||
|
|
Fu\»Ÿ §
|
|||
|
|
¿ð ü¨iU 8 ù œ Æ § Ç ¤ È ù Ç È Æ Œ„ i �„ ¼i ‘Î Ëi ª£T°i º£T¿i Œ�É Àc É 35 8: =? ü„j8 ‡j ú û ü úŒ� û c c ˆ ¢cµ
|
|||
|
|
` £c®Ä ` àB¤GS
|
|||
|
|
üý¤ Å ‹j Å
|
|||
|
|
É 8™ëŸë¿ð$Œj ± ’j üék2 §
|
|||
|
|
Ë œ Ì § Í ¤ Î Ë Í Î Ì Œ„ òk �„ õk ‘Î øk Ùï
|
|||
|
|
Ï Ð Ñ Ò Ó Ô Õ Ö × Ø Ù Ú Û Ü Ý Þ ß à á â îk Z\ _a df äßl ü¢l* “‘,æl ý ýÙï
|
|||
|
|
Ê ìl Ê
|
|||
|
|
Ï §
|
|||
|
|
™ëŸë¿ð$íl ¼ço ü¤m3 ¨’ Üm ú üäm] ñ’ üÆn_ Ø“ üªo8 Á” îo þ þÙï
|
|||
|
|
þ™ë Ê òo Ê
|
|||
|
|
Ð §
|
|||
|
|
™ëŸë¿ð$óo üðr# ü¥p; 8 Gets a mutable reference to the entry's key in the map.Á åp ú üíp] ñ’ üÏq_ Ø“ ü³r8 Á”<÷r ÿ ÿÙï
|
|||
|
|
ÿ™ë Ê ÿr Ê
|
|||
|
|
Ñ §
|
|||
|
|
™ëŸë¿ð$„s üÓv" üÎsD A Converts into a mutable reference to the entry's key in the map,Á ü—t, ¹š Èt ú üÐt] ñ’ ü²u_ Ø“ ü–v8 Á”DÚv Ùï
|
|||
|
|
žÿ Ê Ê
|
|||
|
|
Ò §
|
|||
|
|
™ëŸë¿ð$ãv ¼çw üw5 ï• îw € €Ùï
|
|||
|
|
€Ÿë Ê òw Ê
|
|||
|
|
Ó §
|
|||
|
|
™ëŸë¿ð$ów üùy# ü¥x= ›— çx ú üïxD î— ü¸y< 9 [`RawEntryMut`] value, see [`into_mut`][Self::into_mut].Á<€z � �Ùï
|
|||
|
|
�Ÿë Ê ˆz Ê
|
|||
|
|
Ô §
|
|||
|
|
™ëŸë¿ð$�z üÃ{" üÇzF é™ ü’{, ¹šDÊ{ Ùï
|
|||
|
|
„œ Ê Ê
|
|||
|
|
Õ §
|
|||
|
|
™ëŸë¿ð$Ó{ üÓ|' ü‘|= : Gets a reference to the entry's key and value in the map.ÁlÚ| ‚ ‚Ùï
|
|||
|
|
‚™ë ‚Ÿë Ê è| Ê
|
|||
|
|
Ö §
|
|||
|
|
™ëŸë¿ð$é| üñ}7 ü¯}= ‘‘ Œø} ƒ ƒÙï
|
|||
|
|
ƒ™ë ƒŸë Ê Š~ Ê
|
|||
|
|
× §
|
|||
|
|
™ëŸë¿ð$�~ üå9 üá~N K Converts into a mutable reference to the entry's key and value in the map,Á ü´, ¹š”ì Ùï
|
|||
|
|
œÿ Ê Ê
|
|||
|
|
Ø §
|
|||
|
|
™ëŸë¿ð$ÿ üœ�' üÔ€C @ Sets the value of the entry, and returns the entry's old value.Á4£� „ „Ùï
|
|||
|
|
ŸëŸë Ê ª� Ê
|
|||
|
|
Ù §
|
|||
|
|
™ëŸë¿ð$¯� »,µ� ü¶‚) üò�? < Sets the key of the entry, and returns the entry's old key.ÁT½‚ … …Ùï
|
|||
|
|
™ë™ë Ê È‚ Ê
|
|||
|
|
Ú §
|
|||
|
|
™ëŸë¿ð$Í‚ Œ Ó‚ Ä· ü—ƒV ‹� òƒ ú üúƒY ÷� üØ„Y Úž ü¶…V ½Ÿ ü‘†4 � Õ üÞ†i üʆ 4Õ‡ Õ , Ùï
|
|||
|
|
Ÿë Ê Ê
|
|||
|
|
Û §
|
|||
|
|
™ëŸë¿ð$܇ 씋 ü�ˆV ‹� êˆ ú üòˆ_ ¼¢ üÖ‰8 ¥£ ü“ŠG ç£ ßŠ ú üçŠ( Ĥ\›‹ Ùï
|
|||
|
|
Ÿë Ê Ê
|
|||
|
|
Ü §
|
|||
|
|
™ëŸë¿ð$§‹ ôÚŽ üà‹V ‹� »Œ ú üÃŒ] ߥ ü¥�= Ʀ üç�9 �§ ¥Ž ú üŽ( ܧdᎠÙï
|
|||
|
|
Ÿë Ê Ê
|
|||
|
|
Ý §
|
|||
|
|
™ëŸë¿ð$îŽ üý“# ü¨�J Þ¨ ÷� ú üÿ�V ¾© üÚ�[ žª üº‘_ ƒ« üž’D ì« ´¬üû’{ üç’‘ d„” ´¬- Ùï
|
|||
|
|
Ú® Ê Ê
|
|||
|
|
Þ §
|
|||
|
|
™ëŸë¿ð$‘” üÈ—( üÏ”J Þ¨ ž• ú ü¦•_ ¼¢ üŠ–8 ¥£ üÇ–G ç£ “— ú ü›—( ĤŒÏ— Ùï
|
|||
|
|
Ú® Ê Ê
|
|||
|
|
ß §
|
|||
|
|
™ëŸë¿ð$á— ü“›) ü¥˜J Þ¨ ô˜ ú üü˜] ߥ üÞ™= Ʀ ü š9 �§ Þš ú üæš( ܧ”š› Ùï
|
|||
|
|
Ú® Ê Ê
|
|||
|
|
à §
|
|||
|
|
™ëŸë¿ð$› ü§ " üò›2 ر ü©œ- ”² Ûœ ú üãœ2 / This is equivalent to [`IndexMap::move_index`]Á üš�8 ²³ ×� ú üß�_ €´ üÞ_ é´ §Ÿ ú ü¯Ÿ* Þµ ÞŸ ú üæŸ( ܧ ²|“ T® € Ùï
|
|||
|
|
Ê Ê
|
|||
|
|
á §
|
|||
|
|
™ëŸë¿ð$¹ ö¶¿ üΣ' üú - Ž· ¬¡ ú ü´¡4 1 This is equivalent to [`IndexMap::swap_indices`]Á üí¡O °¸ Á¢ ú üÉ¢7 •¹ …£ ú ü�£( Ĥ ²|º£ dÕ£ € Ùï
|
|||
|
|
Ê Ê
|
|||
|
|
â §
|
|||
|
|
™ëŸë¿ð$⣠¹
|
|||
|
|
,è£ üŒ¥) ü©¤6 3 A view into a vacant raw entry in an [`IndexMap`].Á üà¤+ Ž€ Œ—¥ §
|
|||
|
|
ä œ å § æ ¤ ç å ç æ ä Œ„ ¥ �„ °¥ ‘Î ³¥ ¬ˆ¼¼¥ »ˆ Ï
|
|||
|
|
œÙ¥ ¶ð
|
|||
|
|
†@“äQE´Š è é ©¥ RT VX Z\ ^ ¼¥ Ø ã ã È…jdÙ¥ Ø ã ã ؃ üñ¥; 8 † œ ë § ì ¤ í ì † ë í Œ„ ö¥ �„ ù¥ ‘Î ü¥ Þ�î Àc î &( *, .0 ü³¦8 ¶¦ ‡ ˆ ‰ ‡Þ� ˆ c c ˆ ¢cµ
|
|||
|
|
` £c®Ä ` àB¤GS
|
|||
|
|
‰ý¤ ê º¦ ê
|
|||
|
|
î 8™ëŸë¿ð$»¦ ± Á¦ ü»§0 §
|
|||
|
|
ð œ ñ § ò ¤ ó ò ð ñ ó Œ„ ħ �„ ǧ ‘Πʧ ¶ð
|
|||
|
|
ô õ ö ÷ ø À§ 13 57 9; 䳨 üò§< ½Â,º¨ Š Š¶ð
|
|||
|
|
ï À¨ ï
|
|||
|
|
ô §
|
|||
|
|
™ëŸë¿ð$Á¨ üÚ©r üô¨1 . Inserts the given key and value into the map,Á üª©+ ( and returns mutable references to them.Á4á© ¶ð
|
|||
|
|
™ëŸëœÿ ï ï ³û
|
|||
|
|
$¯ª ´Ö
|
|||
|
|
\˻
|
|||
|
|
õ §
|
|||
|
|
™ëŸë¿ð$è© Œ î© »,ö© ü¿¬Y ü«H E Inserts the given key and value into the map with the provided hash,Á ü�¬+ Ю ¬Æ¬ ¶ð
|
|||
|
|
™ëŸëœÿ ï ï
|
|||
|
|
ö §
|
|||
|
|
™ëŸë¿ð$ܬ §$⬠Œ í¬ »,õ¬ ü¥°† ü‹®D A Inserts the given key and value into the map at the given index,Á üÔ®I F shifting others to the right, and returns mutable references to them.Á ¢¯ ú üª¯- ’Û Ü¯ ú üä¯( ܧ ²|‘° d¬° € ¶ð
|
|||
|
|
™ëŸëœÿ ï ï ³û
|
|||
|
|
$Ž± ´Ö
|
|||
|
|
\ٱ
|
|||
|
|
÷ §
|
|||
|
|
™ëŸë¿ð$¹° Ö,¿° Œ Í° »,Õ° üÁ´œ ü®²G D Inserts the given key and value into the map with the provided hashÁ üú²? < at the given index, and returns mutable references to them.Á ¾³ ú üƳ- ’Û ø³ ú ü€´( ܧ ²|´ ÜÈ´ € ¶ð
|
|||
|
|
™ëŸëœÿ ï ï
|
|||
|
|
ø §
|
|||
|
|
™ëŸë¿ð$í´ Ö,û´ §$‘µ Œ ¤µ »,´µ dÛ¶ 4á¶ Ø ù ù ²»|Û¶ ù ²» ²» üì¶* œ û § ü ¤ ý ü û ý ãá ñ¶ óá ô¶ ŽÓ ÷¶ ßð ! #% \Ë ¦[ ª[ œ[ [d÷ –[ š[ ‰[ �[T¬ €[ „[ v[ z[ l[ p[ b[ f[ X[ \[ N[ R[ D[ H[ :[ >[ 0[ 4[ &[ *[ [ [ [ [ô¹ [Ôá [ü…! ùZ”° ïZŒˆ äZ|Ÿ ×Zœ´ ÊZLÍ ¼ZTÜ °Z ´Z £Z §ZL� †ZL� tZ xZ ^Z bZ PZ TZ´Ø FZ”õ 9Z\� ,Z 0Z Z #Z,» Z Z Z Z öY úY èY ìY ÄY ÈYüþ* üŠ P M A hash table where the iteration order of the key-value pairs is independentÁ üÛ # of the hash values of the keys.Á ÿ ú üƒ
|
|||
|
|
9 6 The interface is closely compatible with the standardÁ ü½
|
|||
|
|
+ ( [`HashMap`][std::collections::HashMap],Á üé
|
|||
|
|
% " but also has additional features.Á � ú \“ # OrderÁ Ÿ ú ü£ E B The key-value pairs have a consistent order that is determined byÁ üé J G the sequence of insertion and removal calls on the map. The order doesÁ ü´ 7 4 not depend on the keys or the hash function at all.Á ì ú üð 2 / All iterators traverse the map in *the order*.Á £
|
|||
|
|
ú ü§
|
|||
|
|
J G The insertion order is preserved, with **notable exceptions** like theÁ üò
|
|||
|
|
Q N [`.remove()`][Self::remove] or [`.swap_remove()`][Self::swap_remove] methods.Á üÄ4 1 Methods such as [`.sort_by()`][Self::sort_by] ofÁ üùA > course result in a new order, depending on the sorting order.Á »ú l¿
|
|||
|
|
# IndicesÁ Íú üÑK H The key-value pairs are indexed in a compact range without holes in theÁ ü�K H range `0..self.len()`. For example, the method `.get_full` looks up theÁ üéO L index for a key, and the method `.get_index` looks up the key-value pair byÁ T¹ index.Á Äú tÈγ ×ú <Ûùî Üãþ³ ÿú üƒ8 5 // count the frequency of each letter in a sentence.Á ü¼& # let mut letters = IndexMap::new();Á üã3 0 for ch in "a short treatise on fungi".chars() {Á ü—- * *letters.entry(ch).or_insert(0) += 1;Á ,Åìµ Ëú üÏ! assert_eq!(letters[&'s'], 2);Á üñ! assert_eq!(letters[&'t'], 3);Á ü“! assert_eq!(letters[&'u'], 1);Á üµ( % assert_eq!(letters.get(&'y'), None);Á <Þùî »À|ì¼æ D‰ œ
|
|||
|
|
§ ®
|
|||
|
|
¤ ¯
|
|||
|
|
|
|||
|
|
¯
|
|||
|
|
®
|
|||
|
|
ãá ’ óá • ŽÓ|˜ßð ø �Ãx¶*Ó °
|
|||
|
|
±
|
|||
|
|
02 57 : ˜ ¦’ ܯ$º ¬
|
|||
|
|
¬
|
|||
|
|
Ðì|ÐdЂ ¬
|
|||
|
|
¬
|
|||
|
|
ñüØY œ ³
|
|||
|
|
§ ´
|
|||
|
|
¤ µ
|
|||
|
|
´
|
|||
|
|
³
|
|||
|
|
µ
|
|||
|
|
ãá Ý óá à ŽÓ ã Žþ,� žþ,� Ø ñ ,«ßð¶
|
|||
|
|
·
|
|||
|
|
Ù Ú ·
|
|||
|
|
¶
|
|||
|
|
NP SU XZ ¼¸,» ‹ ‹ßð ßð ²
|
|||
|
|
Á ²
|
|||
|
|
|
|||
|
|
¶
|
|||
|
|
ˆíŽí ñ$ÂüÔ&T× Œ � Œßð �ßð ²
|
|||
|
|
â ²
|
|||
|
|
|
|||
|
|
·
|
|||
|
|
ˆíŽí ñ$ç¹
|
|||
|
|
,íüìZ œ ¹
|
|||
|
|
§ º
|
|||
|
|
¤ »
|
|||
|
|
¹
|
|||
|
|
»
|
|||
|
|
º
|
|||
|
|
ãá ñ óá ô ŽÓ ÷ Ž�T¨ ž�T»ßð¼
|
|||
|
|
Àc ¼
|
|||
|
|
35 8: =? üõ8 »
|
|||
|
|
test_debugÁ´×ÄÖüÍ# ø Ž � � Žßð � c c ˆ ¢cµ
|
|||
|
|
` £c®Ä ` àB¤GS
|
|||
|
|
�ý¤ ¸
|
|||
|
|
ü ¸
|
|||
|
|
|
|||
|
|
¼
|
|||
|
|
ˆíŽí ñ$ý± ƒÌ¶ »À|õ ¼ï œ ¾
|
|||
|
|
§ ¿
|
|||
|
|
¾
|
|||
|
|
¿
|
|||
|
|
ãá » óá ¾ å‘À
|
|||
|
|
Á
|
|||
|
|
¤“ üÖ * ' Create a new map. (Does not allocate.)Á š å‘ ½
|
|||
|
|
½
|
|||
|
|
|
|||
|
|
À
|
|||
|
|
ˆíŽíüù & üÔ E B Create a new map with capacity for `n` key-value pairs. (Does notÁ ìž allocate if `n` is zero.)Á À ú ôÈ Computes in **O(n)** time.Ál€! å‘ ½
|
|||
|
|
½
|
|||
|
|
|
|||
|
|
Á
|
|||
|
|
ˆíŽí¹ Ž!üå! œ Ã
|
|||
|
|
§ Ä
|
|||
|
|
¤ Å
|
|||
|
|
Ã
|
|||
|
|
Ä
|
|||
|
|
Å
|
|||
|
|
ãá ê! óá í! ŽÓ ð!ßðÆ
|
|||
|
|
Ç
|
|||
|
|
È
|
|||
|
|
É
|
|||
|
|
Ê
|
|||
|
|
Ë
|
|||
|
|
Í
|
|||
|
|
Î
|
|||
|
|
Ï
|
|||
|
|
Ð
|
|||
|
|
Ñ
|
|||
|
|
Ò
|
|||
|
|
Ó
|
|||
|
|
Ô
|
|||
|
|
Õ
|
|||
|
|
Ö
|
|||
|
|
×
|
|||
|
|
Ø
|
|||
|
|
Ù
|
|||
|
|
Ú
|
|||
|
|
Ü
|
|||
|
|
ß
|
|||
|
|
à
|
|||
|
|
á
|
|||
|
|
â
|
|||
|
|
ã
|
|||
|
|
ä
|
|||
|
|
å
|
|||
|
|
ln qs vx ü°#B ü‹"E÷Ó ìÕ"ÅÔ ÷"ú ôÿ"÷Ô Ä·# ñßð Â
|
|||
|
|
Â
|
|||
|
|
|
|||
|
|
Æ
|
|||
|
|
ˆíŽí ñ¹ Ð#Þ`dÚ#üÖ&1 üÌ%) & Create a new map with `hash_builder`.Á ú%ú ü‚&# This function is `const`, so itÁ üª&' $ can be called in `static` contexts.Á\ã& ñßð Â
|
|||
|
|
Â
|
|||
|
|
|
|||
|
|
Ç
|
|||
|
|
ˆíŽí ñÞ`êÊüù'5d‡( ßð›Å Â
|
|||
|
|
Â
|
|||
|
|
|
|||
|
|
È
|
|||
|
|
ˆíŽí ñ$”(üë(2Tù( ‘ ‘ßð ‘¡Ç Â
|
|||
|
|
„) Â
|
|||
|
|
|
|||
|
|
É
|
|||
|
|
ˆíŽí ñ$…)üØ)>tæ) ’ ’ßð ’¡Ç Â
|
|||
|
|
õ) Â
|
|||
|
|
|
|||
|
|
Ê
|
|||
|
|
ˆíŽí ñ$ú)üÇ*`dÕ* ” ”ßðâÿ Â
|
|||
|
|
— Ì
|
|||
|
|
Ì
|
|||
|
|
å* Â
|
|||
|
|
û‹ â* “ –"âÿ “¡Ç Ü‹+ “ âÿÖÞ ˜"
|
|||
|
|
Ë
|
|||
|
|
ˆíŽí ñâÿ$ê*± ð*fh üç- üÜ+H E Return the number of elements the map can hold without reallocating.Á ©,ú ü±,E B This number is a lower bound; the map might be able to hold more,Á üû,< 9 but is guaranteed to be able to hold at least this many.Á ¼-ú ôÄ-ÄÀDî- • •ßð Â
|
|||
|
|
÷- Â
|
|||
|
|
|
|||
|
|
Í
|
|||
|
|
ˆíŽí ñ$ø-Ôè. ü±.2 / Return a reference to the map's `BuildHasher`.Á4ï. – –ßð – ñ Â
|
|||
|
|
ö. Â
|
|||
|
|
|
|||
|
|
Î
|
|||
|
|
ˆíŽí ñ$÷.Ô�0 ü«/4 1 Return the number of key-value pairs in the map.Á ä/ú ôì/ÄÀ ¤0 — —ßð Â
|
|||
|
|
¨0 Â
|
|||
|
|
|
|||
|
|
Ï
|
|||
|
|
ˆíŽí ñ$©0ôÌ1 üÝ01 . Returns true if the map contains no elements.Á “1ú ô›1ÄÀDÓ1 ˜ ˜ßð Â
|
|||
|
|
Ü1 Â
|
|||
|
|
|
|||
|
|
Ð
|
|||
|
|
ˆíŽí ñ$Ý1üß2$ ü�2J®Â$æ2 ™ ™ßð ƒ ƒ š+ ‡ù Ö …ä1dÿ·‘ ™ˆíŽí Â
|
|||
|
|
ë2 Â
|
|||
|
|
|
|||
|
|
Ñ
|
|||
|
|
ˆíŽí ñ$ì2ü…4/ ü¶3J®ÂDŒ4 š šßð © © ½- ù Ö 8ﲞÄÿ„ šˆíŽí Â
|
|||
|
|
•4 Â
|
|||
|
|
|
|||
|
|
Ò
|
|||
|
|
ˆíŽí ñ$š4ü²5$ üî4? < Return an iterator over the keys of the map, in their orderÁ$¹5 › ›ßð ¨ ¨ ‹5 ¬ù Ö >·£;ñ› ›ˆíŽí Â
|
|||
|
|
¾5 Â
|
|||
|
|
|
|||
|
|
Ó
|
|||
|
|
ˆíŽí ñ$¿5üÔ6( ü‰6F C Return an owning iterator over the keys of the map, in their orderÁLÛ6 ßðƒù Â
|
|||
|
|
Â
|
|||
|
|
|
|||
|
|
Ô
|
|||
|
|
ˆíŽí ñ$å6üû7( üµ7A > Return an iterator over the values of the map, in their orderÁ4‚8 œ œßð ö ö Ì9 úù Ö î¹ú‡�$! œˆíŽí Â
|
|||
|
|
‰8 Â
|
|||
|
|
|
|||
|
|
Õ
|
|||
|
|
ˆíŽí ñ$Š8ü¼93 üØ8H E Return an iterator over mutable references to the values of the map,Á ”¥9 in their orderÁTÃ9 � �ßð › › á; Ÿù Ö †¦"KPy �ˆíŽí Â
|
|||
|
|
Î9 Â
|
|||
|
|
|
|||
|
|
Ö
|
|||
|
|
ˆíŽí ñ$Ó9üø:, ü«:H E Return an owning iterator over the values of the map, in their orderÁ\ÿ: ßðïü Â
|
|||
|
|
Â
|
|||
|
|
|
|||
|
|
×
|
|||
|
|
ˆíŽí ñ$‹;¼Ø< üß;I F Remove all key-value pairs in the map, while preserving its capacity.Á <ú ôµ<÷Ô ,ß< ž žßð Â
|
|||
|
|
å< Â
|
|||
|
|
|
|||
|
|
Ø
|
|||
|
|
ˆíŽí ñ$ê<üÁ>& ü˜=M J Shortens the map, keeping the first `len` elements and dropping the rest.Á ê=ú üò=J G If `len` is greater than the map's current length, this has no effect.ÁDÈ> Ÿ Ÿßð Â
|
|||
|
|
Ñ> Â
|
|||
|
|
|
|||
|
|
Ù
|
|||
|
|
ˆíŽí ñ$Ö>‘ Ü>üÏD` ü–?C @ Clears the `IndexMap` in the given index range, returning thoseÁ üÞ?( % key-value pairs as a drain iterator.Á ‹@ú ü“@E B The range may be any type that implements [`RangeBounds<usize>`],Á üÝ@J G including all of the `std::ops::Range*` types, or even a tuple pair ofÁ ü¬AL I `Bound` start and end values. To drain the map entirely, use `RangeFull`Á ÌýA like `map.drain(..)`.Á ›Bú ü£BH E This shifts down all entries following the drained range to fill theÁ üðB2 / gap, and keeps the allocated memory for reuse.Á §Cú ü¯CJ G ***Panics*** if the starting point is greater than the end point or ifÁ üþC8 5 the end point is greater than the length of the map.Á ²|»D,ÖD€ ß𣠋 ‹ °3 �ù Ö 2› Krb~ ˆíŽí Â
|
|||
|
|
£ Û
|
|||
|
|
Û
|
|||
|
|
ßD Â
|
|||
|
|
ÍìÆû ÜD ¤#Æû ”œE
|
|||
|
|
Ú
|
|||
|
|
ˆíŽí ñÆû $äD˜ã,êD<> ü¶Tž üìEZ W Creates an iterator which uses a closure to determine if an element should be removed,Á üËF( % for all elements in the given range.Á øFú ü€GQ N If the closure returns true, the element is removed from the map and yielded.Á üÖG[ X If the closure returns false, or panics, the element remains in the map and will not beÁ d¶H yielded.Á ÇHú üÏH[ X Note that `extract_if` lets you mutate every value in the filter closure, regardless ofÁ ü¯I, ) whether you choose to keep or remove it.Á àIú üèIEÃõ ü²JJ’ö ü�KJ G `Bound` start and end values. To check the entire map, use `RangeFull`Á üÐK) & like `map.extract_if(.., predicate)`.Á þKú ü†L^ [ If the returned `ExtractIf` is not exhausted, e.g. because it is dropped without iteratingÁ üéLR O or the iteration short-circuits, then the remaining elements will be retained.Á üÀMU R Use [`retain`] with a negated predicate if you do not need the returned iterator.Á šNú ü¢N [`retain`]: IndexMap::retainÁ ÇNú üÏNJ„ù üžO8Øù ÛOú tãOγ öOú üþOE B Splitting a map into even and odd keys, reusing the original map:Á ÈPú <ÐPùî ÜÜPþ³ üPú ü„QG D let mut map: IndexMap<i32, i32> = (0..8).map(|x| (x, x)).collect();Á üÐQY V let extracted: IndexMap<i32, i32> = map.extract_if(.., |k, _v| k % 2 == 0).collect();Á ®Rú ü¶R> ; let evens = extracted.keys().copied().collect::<Vec<_>>();Á üùR7 4 let odds = map.keys().copied().collect::<Vec<_>>();Á µSú ü½S( % assert_eq!(evens, vec![0, 2, 4, 6]);Á üêS' $ assert_eq!(odds, vec![1, 3, 5, 7]);Á <–Tùî ²|¢TT½T€ £ £ßðó¥âÿ — — ²C œß Ö �ëC Ö }GB×òç £ˆíŽíâÿ Â
|
|||
|
|
— Ý
|
|||
|
|
£ Þ
|
|||
|
|
Þ
|
|||
|
|
Ý
|
|||
|
|
ÎT Â
|
|||
|
|
û‹ ÈT ï¦ ËT ¡ ¢ “"âÿ ¡ˆí ¢Ží Ì›U ¡ ¢ âÿ³Œ ˜" $°U �§”ÁU
|
|||
|
|
Ü
|
|||
|
|
ˆíŽí ñâÿó¥$ÓT˜ã,ÙTëC$ãT›� ¢ üûXJ üšV6 3 Splits the collection into two at the given index.Á ÕVú üÝVF C Returns a newly allocated map containing the elements in the rangeÁ ü¨WI F `[at, len)`. After the call, the original map will be left containingÁ üöW@ = the elements `[0, at)` with its previous capacity unchanged.Á »Xú üÃX ***Panics*** if `at > len`.Á ²|çXL‚Y€ ¤ ¤ßð ßð Â
|
|||
|
|
ŒY Â
|
|||
|
|
ÍÍ ,¿Y
|
|||
|
|
ß
|
|||
|
|
ˆíŽí ñ$‘Y¾Œ—Yü»[, üÐZ; 8 Reserve capacity for `additional` more key-value pairs.Á �[ú ô˜[÷Ô <Â[ ¥ ¥ßð Â
|
|||
|
|
Ê[ Â
|
|||
|
|
|
|||
|
|
à
|
|||
|
|
ˆíŽí ñ$Ï[Å�TÕ[üƒ`2 üœ\T Q Reserve capacity for `additional` more key-value pairs, without over-allocating.Á õ\ú üý\Z W Unlike `reserve`, this does not deliberately over-allocate the entry capacity to avoidÁ üÜ]\ Y frequent re-allocations. However, the underlying data structures may still have internalÁ ü½^_ \ capacity requirements, and the allocator itself may give more space than requested, so thisÁ ü¡_2 / cannot be relied upon to be precisely minimal.Á Ø_ú ôà_÷Ô lŠ` ¦ ¦ßð Â
|
|||
|
|
˜` Â
|
|||
|
|
|
|||
|
|
á
|
|||
|
|
ˆíŽí ñ$�`Å�T£`üâaO üð`B ? Try to reserve capacity for `additional` more key-value pairs.Á ·aú ô¿a÷Ô \éa § §ßð õ’ Â
|
|||
|
|
õa Â
|
|||
|
|
|
|||
|
|
â
|
|||
|
|
ˆíŽí ñ$úaÅ�T€büÛfU üéb[ X Try to reserve capacity for `additional` more key-value pairs, without over-allocating.Á Écú üÑc^ [ Unlike `try_reserve`, this does not deliberately over-allocate the entry capacity to avoidÁ ü´d\Ü“ ü•e_” üùe2«• °fú ô¸f÷Ô Œâf ¨ ¨ßð õ’ Â
|
|||
|
|
ôf Â
|
|||
|
|
|
|||
|
|
ã
|
|||
|
|
ˆíŽí ñ$ùfÅ�TÿfüÕh üîg7 4 Shrink the capacity of the map as much as possible.Á ªhú ô²h÷Ô lÜh © ©ßð Â
|
|||
|
|
êh Â
|
|||
|
|
|
|||
|
|
ä
|
|||
|
|
ˆíŽí ñ$ïhüˆj0 ü¢i6 3 Shrink the capacity of the map with a lower limit.Á Ýiú ôåi÷Ô L�j ª ªßð Â
|
|||
|
|
™j Â
|
|||
|
|
|
|||
|
|
å
|
|||
|
|
ˆíŽí ñ$žj´•d¤jüïjK œ ç
|
|||
|
|
§ è
|
|||
|
|
¤ é
|
|||
|
|
ç
|
|||
|
|
è
|
|||
|
|
é
|
|||
|
|
ãá ôj óá ÷j ŽÓ új Œ÷ $œk 잣k ¦Ê\®kßðê
|
|||
|
|
ë
|
|||
|
|
ì
|
|||
|
|
í
|
|||
|
|
ð
|
|||
|
|
ó
|
|||
|
|
ô
|
|||
|
|
õ
|
|||
|
|
ö
|
|||
|
|
÷
|
|||
|
|
ú
|
|||
|
|
QS VX [] üíp7 üÁk' $ Insert a key-value pair in the map.Á íkú üõkG D If an equivalent key already exists in the map: the key remains andÁ üÁlI F retains in its place in the order, its corresponding value is updatedÁ ü�mC @ with `value`, and the older value is returned inside `Some(_)`.Á ×mú üßmF C If no equivalent key existed in the map: the new key-value pair isÁ üªn4 1 inserted, last in order, and `None` is returned.Á ãnú üën2¨È ¢oú üªoF C See also [`entry`][Self::entry] if you want to insert *or* modify,Á üõoI F or [`insert_full`][Self::insert_full] if you need to get the index ofÁ üÃp% " the corresponding key-value pair.Á4ôp « «ßðˆíŽíŽž æ
|
|||
|
|
ûp æ
|
|||
|
|
|
|||
|
|
ê
|
|||
|
|
ˆíŽí ñ$€qŒ †q»,Žqü´vE üÙq< 9 Insert a key-value pair in the map, and get their index.Á šrú ü¢rGÆ üîrI—¡ ü¼sL I with `value`, and the older value is returned inside `(index, Some(_))`.Á �tú ü•tFâ üàt= : inserted, last in order, and `(index, None)` is returned.Á ¢uú üªu2¨È áuú üéuF C See also [`entry`][Self::entry] if you want to insert *or* modify.Á\»v ¬ ¬ßðˆíŽíŠž æ
|
|||
|
|
Çv æ
|
|||
|
|
|
|||
|
|
ë
|
|||
|
|
ˆíŽí ñ$ÌvŒ Òv»,ÚvüÍ€a üÛwQ N Insert a key-value pair in the map at its ordered position among sorted keys.Á ±xú ü¹x3 0 This is equivalent to finding the position withÁ üñxJ G [`binary_search_keys`][Self::binary_search_keys], then either updatingÁ üÀyG D it or calling [`insert_before`][Self::insert_before] for a new key.Á Œzú ü”zE B If the sorted key is found in the map, its corresponding value isÁ üÞz@ = updated with `value`, and the older value is returned insideÁ ü£{H E `(index, Some(_))`. Otherwise, the new key-value pair is inserted atÁ üð{9 6 the sorted position, and `(index, None)` is returned.Á ®|ú ü¶|GñÌ ü‚}KÂÍ üÒ}= : pair is moved to or inserted at that position regardless.Á ”~ú üœ~F C Computes in **O(n)** time (average). Instead of repeating calls toÁ üç~N K `insert_sorted`, it may be faster to call batched [`insert`][Self::insert]Á üºL I or [`extend`][Self::extend] and only call [`sort_keys`][Self::sort_keys]Á ü‹€= : or [`sort_unstable_keys`][Self::sort_unstable_keys] once.ÁlÔ€ ßðˆíŽíŠž æ
|
|||
|
|
†æ
|
|||
|
|
ž¯ ª�
|
|||
|
|
ì
|
|||
|
|
ˆíŽí ñ$瀌 퀻,õ€üƇ‘ üô‚I F Insert a key-value pair in the map at its ordered position among keysÁ ¤Âƒ sorted by `cmp`.Á Ûƒú üãƒ3À« ü›„> ; [`binary_search_by`][Self::binary_search_by], then callingÁ üÞ„H E [`insert_before`][Self::insert_before] with the given key and value.Á «…ú ü³…GñÌ üÿ…KÂÍ üφ=„° ‘‡ú ü™‡(ܧ„͇ ² ²ßðˆíŽíâÿŠž æ
|
|||
|
|
— î
|
|||
|
|
î
|
|||
|
|
ᇠæ
|
|||
|
|
û‹ Þ‡ ® ¯ ° ± “"âÿ ®ˆí ¯Ží °ˆí ±Ží üµˆ! ® ¯ ° ± âÿ§¹ ˜" üÓDΈ
|
|||
|
|
í
|
|||
|
|
ˆíŽí ñâÿ$懌 쇻,ô‡‹ ‚ˆÆÈ 4“‰ í
|
|||
|
|
ªŒ ï
|
|||
|
|
ÂŒ ï
|
|||
|
|
ߌ ï
|
|||
|
|
ï
|
|||
|
|
í
|
|||
|
|
ï
|
|||
|
|
ˆíŽí ñâÿ§° •Ö¬Õ²ÕüâŽÅ üé‰> ; Insert a key-value pair in the map at its ordered positionÁ ü¬Š) & using a sort-key extraction function.Á ÚŠú üâŠ3À« üš‹S P [`binary_search_by_key`][Self::binary_search_by_key] with `sort_key(key)`, thenÁ üò‹P M calling [`insert_before`][Self::insert_before] with the given key and value.Á ÇŒú üÏŒGñÌ ü›�KÂÍ üë�=„° Žú üµŽ(ܧ¤éŽ µ µßðˆíŽí³ØŠž æ
|
|||
|
|
“ ñ
|
|||
|
|
— ò
|
|||
|
|
ò
|
|||
|
|
ñ
|
|||
|
|
�� æ
|
|||
|
|
åØ þŽ øØ �� ‰Ù „� ³ ´ “"³Ø ³ˆí ´Ží ””� ³ ´ ³Ø�À ˜" íØ ¥�
|
|||
|
|
ð
|
|||
|
|
ˆíŽí ñíسØ$’�Œ �»,°�›ÙDÆ�®° ²´ üµ¤Y üå‘Z W Insert a key-value pair in the map before the entry at the given index, or at the end.Á Ä’ú üÌ’GÆ ü˜“O L is moved to the new position in the map, its corresponding value is updatedÁ üì“V S with `value`, and the older value is returned inside `Some(_)`. The returned indexÁ üÇ”Q N will either be the given index or one less, depending on how the entry moved.Á ü�•K H (See [`shift_insert`](Self::shift_insert) for different behavior here.)Á í•ú üõ•Fâ üÀ–@ = inserted exactly at the given index, and `None` is returned.Á …—ú ü�—-’Û ü¿—2 / Valid indices are `0..=map.len()` (inclusive).Á ö—ú üþ—(ܧ «˜ú ü³˜F÷£ üþ˜T Q perhaps only using the index for new entries with [`VacantEntry::shift_insert`].Á ×™ú tߙγ ò™ú <ú™ùî ܆šþ³ ü¦šM J let mut map: IndexMap<char, ()> = ('a'..='z').map(|c| (c, ())).collect();Á øšú ü€›7 4 // The new key '*' goes exactly at the given index.Á ü¼›- * assert_eq!(map.get_index_of(&'*'), None);Á üî›; 8 assert_eq!(map.insert_before(10, '*', ()), (10, None));Á ü®œ1 . assert_eq!(map.get_index_of(&'*'), Some(10));Á äœú üìœZ W // Moving the key 'a' up will shift others down, so this moves *before* 10 to index 9.Á üË�> ; assert_eq!(map.insert_before(10, 'a', ()), (9, Some(())));Á üŽž0 - assert_eq!(map.get_index_of(&'a'), Some(9));Á üÞ1øÉ ùžú ü�ŸQ N // Moving the key 'z' down will shift others up, so this moves to exactly 10.Á üן? < assert_eq!(map.insert_before(10, 'z', ()), (10, Some(())));Á ü› 1 . assert_eq!(map.get_index_of(&'z'), Some(10));Á üÑ 1 . assert_eq!(map.get_index_of(&'*'), Some(11));Á ‡¡ú ü�¡= : // Moving or inserting before the endpoint is also valid.Á ôÑ¡ assert_eq!(map.len(), 27);Á üô¡F C assert_eq!(map.insert_before(map.len(), '*', ()), (26, Some(())));Á ü¿¢1 . assert_eq!(map.get_index_of(&'*'), Some(26));Á üõ¢B ? assert_eq!(map.insert_before(map.len(), '+', ()), (27, None));Á ü¼£1 . assert_eq!(map.get_index_of(&'+'), Some(27));Á ôò£ assert_eq!(map.len(), 28);Á <•¤ùî ²|¡¤l¼¤€ ¶ ¶ßð ˆíŽíŠž æ
|
|||
|
|
ʤ æ
|
|||
|
|
|
|||
|
|
ó
|
|||
|
|
ˆíŽí ñ$ϤÖ,Ù¤Œ 礻,ï¤ü�ÁK üˆ¬: 7 Insert a key-value pair in the map at the given index.Á Ǭú üϬGÆ ü›N K is moved to the given index in the map, its corresponding value is updatedÁ üîCê¡ ü¶®K H Note that existing entries **cannot** be moved to `index == map.len()`!Á ü†¯M J (See [`insert_before`](Self::insert_before) for different behavior here.)Á دú üà¯Fâ ü«°8 5 inserted at the given index, and `None` is returned.Á è°ú üð°-’Û ü¢±R O Valid indices are `0..map.len()` (exclusive) when moving an existing entry, orÁ üù±9 6 `0..=map.len()` (inclusive) when inserting a new key.Á ·²ú ü¿²(ܧ ì²ú üô²F÷£ ü¿³T°Æ ˜´ú t ´Î³ ³´ú <»´ùî ÜÇ´þ³ üç´MÓÇ ¹µú üÁµ7¸È üýµ-úÈ ü¯¶4 1 assert_eq!(map.shift_insert(10, '*', ()), None);Á üè¶1øÉ ž·ú ü¦·\ Y // Moving the key 'a' up to 10 will shift others down, including the '*' that was at 10.Á ü‡¸8 5 assert_eq!(map.shift_insert(10, 'a', ()), Some(()));Á üĸ1 . assert_eq!(map.get_index_of(&'a'), Some(10));Á üú¸0 - assert_eq!(map.get_index_of(&'*'), Some(9));Á ¯¹ú ü·¹Z W // Moving the key 'z' down to 9 will shift others up, including the '*' that was at 9.Á ü–º7 4 assert_eq!(map.shift_insert(9, 'z', ()), Some(()));Á üÒº0 - assert_eq!(map.get_index_of(&'z'), Some(9));Á ü‡»1øÉ ½»ú üÅ»X U // Existing keys can move to len-1 at most, but new keys can insert at the endpoint.Á ô¢¼¸Ï üżC @ assert_eq!(map.shift_insert(map.len() - 1, '*', ()), Some(()));Á ü�½1²Ð üý; 8 assert_eq!(map.shift_insert(map.len(), '+', ()), None);Á üƒ¾1»Ñ ô¹¾öÑ <ܾùî è¾ú œð¾¸½ ܈¿þ³ ü¨¿MÓÇ ú¿ú ü‚À; 8 // This is an invalid index for moving an existing key!Á üÂÀ) & map.shift_insert(map.len(), 'a', ());Á <ðÀùî ²|üÀd—Á€ · ·ßð ˆíŽíŽž æ
|
|||
|
|
¤Á æ
|
|||
|
|
|
|||
|
|
ô
|
|||
|
|
ˆíŽí ñ$©ÁÖ,¯ÁŒ ½Á»,ÅÁüŽÍN üÇÇH E Replaces the key at the given index. The new key does not need to beÁ ü”ÈL I equivalent to the one it is replacing, but it must be unique to the restÁ |åÈ of the map.Á ùÈú ü�ÉK H Returns `Ok(old_key)` if successful, or `Err((other_index, key))` if anÁ üÑÉG D equivalent key already exists at a different index. The map will beÁ ü�Ê unchanged in the error case.Á ÂÊú üÊÊI F Direct indexing can be used to change the corresponding value: simplyÁ ü˜ËF C `map[index] = value`, or `mem::replace(&mut map[index], value)` toÁ üãË# retrieve the old value as well.Á ‹Ìú ü“Ì-’Û ÅÌú üÍÌ(Ĥ ²|úÌl•Í€ ¸ ¸ßð ˆíÖ¿Ù¿ Ú¿« Û¿ˆ Ü¿ Ý¿Þ¿ˆ ‚†f|Â
|
|||
|
|
ˆí ˆí æ
|
|||
|
|
£Í æ
|
|||
|
|
|
|||
|
|
õ
|
|||
|
|
ˆíŽí ñ$¨ÍÖ,®ÍŒ ¼ÍüêÒ2 ü¼ÑK H Get the given key's corresponding entry in the map for insertion and/orÁ ÔŒÒ in-place manipulation.Á «Òú ü³Ò2¨È,ñÒ ¹ ¹ßðˆí Œ � ‘†$ ’ˆ “ ”£$ •ˆ A'YŠ¯y! ¹ˆíŽí æ
|
|||
|
|
÷Ò æ
|
|||
|
|
|
|||
|
|
ö
|
|||
|
|
ˆíŽí ñ$üÒŒ ‚Óüáß® üüÓL I Creates a splicing iterator that replaces the specified range in the mapÁ üÍÔK H with the given `replace_with` key-value iterator and yields the removedÁ ü�ÕI F items. `replace_with` does not need to be the same length as `range`.Á ëÕú üóÕI F The `range` is removed even if the iterator is not consumed until theÁ üÁÖL I end. It is unspecified how many elements are removed from the map if theÁ ì’× `Splice` value is leaked.Á ´×ú ü¼×H E The input iterator `replace_with` is only consumed when the `Splice`Á ü‰ØJ G value is dropped. If a key from the iterator matches an existing entryÁ üØØK H in the map (outside of `range`), then the value will be updated in thatÁ ü¨ÙG D position. Otherwise, the new key-value pair will be inserted in theÁ ¬ôÙ replaced `range`.Á ŽÚú ü–ÚJ„ù üåÚ8Øù ¢Ûú tªÛγ ½Ûú <ÅÛùî ÜÑÛþ³ ñÛú üùÛU R let mut map = IndexMap::from([(0, '_'), (1, 'a'), (2, 'b'), (3, 'c'), (4, 'd')]);Á üÓÜA > let new = [(5, 'E'), (4, 'D'), (3, 'C'), (2, 'B'), (1, 'A')];Á ü™Ý: 7 let removed: Vec<_> = map.splice(2..4, new).collect();Á ØÝú üàÝE B // 1 and 4 got new values, while 5, 3, and 2 were newly inserted.Á üªÞ^ [ assert!(map.into_iter().eq([(0, '_'), (1, 'A'), (5, 'E'), (3, 'C'), (2, 'B'), (4, 'D')]));Á ü�ß/ , assert_eq!(removed, &[(2, 'b'), (3, 'c')]);Á <Áßùî ²|Íß4è߀ º ºßðÆû š à à ç? æØ Ö ç¥@ Ö èŒ Ö é¹@ Ö 6õ •Â\¶ º¾û ÉLˆíŽí ñ æ
|
|||
|
|
£ ø
|
|||
|
|
š ù
|
|||
|
|
ø
|
|||
|
|
ù
|
|||
|
|
õß æ
|
|||
|
|
®ü ïß Íì¾û òß ¿ü ”Ôà ÇL¾û Üóà ¾û ÈL ã„l€á
|
|||
|
|
÷
|
|||
|
|
ˆíŽí ñÆû ¾û $úߘã,€à¹@dŠày{ tv üíè< üÜáN K Moves all key-value pairs from `other` into `self`, leaving `other` empty.Á ¯âú ü·âC @ This is equivalent to calling [`insert`][Self::insert] for eachÁ üÿâH E key-value pair from `other` in order, which means that for keys thatÁ üÌãL I already exist in `self`, their value is updated in the current position.Á �äú t¥äγ ¸äú <Àäùî ÜÌäþ³ ìäú üôä- * // Note: Key (3) is present in both maps.Á ü¦å? < let mut a = IndexMap::from([(3, "c"), (2, "b"), (1, "a")]);Á üêå? < let mut b = IndexMap::from([(3, "d"), (4, "e"), (5, "f")]);Á ü®æ$ ! let old_capacity = b.capacity();Á ×æú ¬ßæ a.append(&mut b);Á ùæú Ü�ç assert_eq!(a.len(), 5);Á Ü¡ç assert_eq!(b.len(), 0);Á üÁç+ ( assert_eq!(b.capacity(), old_capacity);Á ñçú üùç+ ( assert!(a.keys().eq(&[3, 2, 1, 4, 5]));Á ü©è3 0 assert_eq!(a[&3], "d"); // "c" was overwritten.Á <áèùî4ôè » ¼ »ßð ¼ ¬
|
|||
|
|
¬
|
|||
|
|
°
|
|||
|
|
í ±
|
|||
|
|
Þ` ‚ ø �Ãx¶*ÓˆíŽí´œ æ
|
|||
|
|
Ál û
|
|||
|
|
û
|
|||
|
|
ÿè æ
|
|||
|
|
Íì´œ ûè
|
|||
|
|
ú
|
|||
|
|
ˆíŽí ñ´œ$„é¹
|
|||
|
|
,Šé+- üÛé9 œ ý
|
|||
|
|
§ þ
|
|||
|
|
¤ ÿ
|
|||
|
|
þ
|
|||
|
|
ý
|
|||
|
|
ÿ
|
|||
|
|
ãá àé óá ãé ŽÓ æé ¦Ê\ˆêßð€ ‚ „ † ˆ Š Œ Ž � ’ š œ ž ¢ ¤ ¦ ¨ Z\ ^` bd ü›êA$©ê ½ ¾ ½ß𠾜‘ ùª ü
|
|||
|
|
¢ � � Àê ü
|
|||
|
|
�Í ®ê ®Í$ºê
|
|||
|
|
€ ˆíŽí ñœ‘$ÁêŒ Çê46 ü±ìb ü¹ë> ; Return `true` if an equivalent to `key` exists in the map.Á üëú ü„ì(Ĥd¸ì ¿ À ¿ßð Àœ‘ ü
|
|||
|
|
¢ ƒ ƒ Èì ü
|
|||
|
|
�Í Åì ®Í$þì ¾Íl…í
|
|||
|
|
‚ ˆíŽí ñœ‘$ÉìŒ Ïì=? üäî_ üÎíG D Return a reference to the stored value for `key`, if it is present,Á „šî
|
|||
|
|
else `None`.Á ¯îú ü·î(Ĥ ëî Á  Áßð Âœ‘ ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ ÁŽí ü
|
|||
|
|
¢ … … òî ü
|
|||
|
|
�Í ïî ®Í$®ï ¾Ílµï
|
|||
|
|
„ ˆíŽí ñœ‘$óîŒ ùî=? üªòo ü�ñH E Return references to the stored key-value pair for the lookup `key`,Á üÎñ" if it is present, else `None`.Á õñú üýñ(Ĥl±ò Ã Ä Ãßð Äœ‘ ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡z٠Èí ÃŽí ü
|
|||
|
|
¢ ‡ ‡ Âò ü
|
|||
|
|
�Í ¿ò ®Í$„ó ¾Íl‹ó
|
|||
|
|
† ˆíŽí ñœ‘$ÃòŒ Éò=? ü�öq üåôI F Return the index with references to the stored key-value pair for theÁ ü³õ0 - lookup `key`, if it is present, else `None`.Á èõú üðõ(ĤD¤ö Å Æ Åßð Æœ‘ ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡z٠ňí ÅŽí ü
|
|||
|
|
¢ ‰ ‰ °ö ü
|
|||
|
|
�Í ö ®Í$ùö ¾Íl€÷
|
|||
|
|
ˆ ˆíŽí ñœ‘$±öŒ ·ö=? üÚùk üÝøC @ Return the item index for `key`, if it is present, else `None`.Á ¥ùú üù(Ĥdáù Ç È Çßð Èœ‘ µ˜ ü
|
|||
|
|
¢ ‹ ‹ ñù ü
|
|||
|
|
�Í îù ®Í$°ú ¾Íl·ú
|
|||
|
|
Š ˆíŽí ñœ‘$òùŒ øù=? üïýk üÑü= : Return a mutable reference to the stored value for `key`,Á ü“ý"ý�
|
|||
|
|
ºýú üÂý(Ĥ<öý É Ê Éßð Êœ‘ ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ ÉŽí ü
|
|||
|
|
¢ � � �þ ü
|
|||
|
|
�Í þý ®Í$Åþ ¾ÍlÌþ
|
|||
|
|
Œ ˆíŽí ñœ‘$†þŒ Œþ=? üå�{ ü¤€J G Return a reference and mutable references to the stored key-value pairÁ üó€8 5 for the lookup `key`, if it is present, else `None`.Á °�ú ü¸�(ĤŒì� Ë Ì Ëßð Ìœ‘ ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡z٠ˈí ËŽí ü
|
|||
|
|
¢ � � �‚ ü
|
|||
|
|
�Í þ� ®Í$Ë‚ ¾ÍlÒ‚
|
|||
|
|
Ž ˆíŽí ñœ‘$†‚Œ Œ‚=? ü‡†} ü¸„I F Return the index with a reference and mutable reference to the storedÁ ü†…G D key-value pair for the lookup `key`, if it is present, else `None`.Á Ò…ú üÚ…(ĤdŽ† Í Î Íßð Îœ‘ ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡z٠͈í ÍŽí ü
|
|||
|
|
¢ ‘ ‘ ž† ü
|
|||
|
|
�Í ›† ®Í$ï† ¾Ílö†
|
|||
|
|
� ˆíŽí ñœ‘$£†Œ ©†=? ü³‹� ü߈# Return the values for `N` keys.Á ‡‰ú ü�‰* ' ***Panics*** if any key is duplicated.Á ¾‰ú tƉγ Ù‰ú <á‰ùî üí‰K H let mut map = indexmap::IndexMap::from([(1, 'a'), (3, 'b'), (2, 'c')]);Á ü½ŠQ N assert_eq!(map.get_disjoint_mut([&2, &1]), [Some(&mut 'c'), Some(&mut 'a')]);Á <“‹ùî ²|Ÿ‹„º‹€ Ï Ð Ïßð Ðœ‘ ŸÛ¼Ý¼Þ¼© ß¼ à¼ÛἈ cSñŸ«‡zÙ ÏŽí Ÿ ü
|
|||
|
|
¢ “ Ÿ ” “ ” Þ‹ ü
|
|||
|
|
�Í Ë‹ ˜ì t΋ ®Í$Œ ¾Íl´Œ
|
|||
|
|
’ ˆíŽí ñœ‘ Ÿ$㋾O$é‹LN P Ô‹ ,èŒ ’ ªŒ — ÂŒ — ߌ — — ’ — ˆíŽí ñœ‘ Ÿ œ‘ µ˜ ßð DÐ� ’ ªŒ ˜ ÂŒ ˜ ߌ ˜ ˜ ’ ˜ ˆíŽí ñœ‘ Ÿ ôÚۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ÷Ù $ä� ’ ªŒ ™ ÂŒ ™ ߌ ™ ™ ’ ™ ˆíŽí ñœ‘ Ÿ òÙ÷Ù ü¼•e ü†‘< 9 Remove the key-value pair equivalent to `key` and returnÁ tÇ‘ its value.Á Ú‘ú üâ‘\ Y **NOTE:** This is equivalent to [`.swap_remove(key)`][Self::swap_remove], replacing thisÁ üÃ’YÚž ü¡“V½Ÿ üü“7 4 [`.shift_remove(key)`][Self::shift_remove] instead.Á Õ üÌ”i ü¸”4Õ Õ , Ñ Ò Ñßð Òœ‘ Žž ü
|
|||
|
|
¢ › › Í• ü
|
|||
|
|
�Í Ê• ®Í$Œ– ¾Íl“–
|
|||
|
|
š ˆíŽí ñœ‘$Ò•Œ Ø•=? üŸ›p üÑ–= : Remove and return the key-value pair equivalent to `key`.Á “—ú ü›—Y V **NOTE:** This is equivalent to [`.swap_remove_entry(key)`][Self::swap_remove_entry],Á üù—[žª üÙ˜_ƒ« ü½™G D use [`.shift_remove_entry(key)`][Self::shift_remove_entry] instead.Á ´¬ü�š{ ü‰š‘d¦› ´¬- Ó Ô Óßð Ôœ‘ ú– ü
|
|||
|
|
¢ � � ¶› ü
|
|||
|
|
�Í ³› ®Í$ú› ¾Íl�œ
|
|||
|
|
œ ˆíŽí ñœ‘$»›Œ Á›=? üÛŸj üÅœ<�¬
|
|||
|
|
t†�Ǭ
|
|||
|
|
™�ú ü¡�J G Like [`Vec::swap_remove`], the pair is removed by swapping it with theÁ üð�? < last element of the map and popping it off. **This perturbsÁ ü´ž7 4 the position of what used to be the last element!**Á ðžú üøž) & Return `None` if `key` is not in map.Á ¦Ÿú ü®Ÿ(Ĥ\âŸ Õ Ö Õßð Öœ‘ Žž ü
|
|||
|
|
¢ Ÿ Ÿ ñŸ ü
|
|||
|
|
�Í îŸ ®Í$° ¾Íl·
|
|||
|
|
ž ˆíŽí ñœ‘$öŸŒ üŸ=? ü‰¤u ü…¡=‘°
|
|||
|
|
Ç¡ú üÏ¡J´
|
|||
|
|
üž¢?—µ
|
|||
|
|
üâ¢7áµ
|
|||
|
|
ž£ú ü¦£)°¶
|
|||
|
|
Ô£ú üÜ£(ĤŒ�¤ × Ø ×ßð Øœ‘ ú– ü
|
|||
|
|
¢ ¡ ¡ ¥¤ ü
|
|||
|
|
�Í ¢¤ ®Í$é¤ ¾Ílð¤
|
|||
|
|
ˆíŽí ñœ‘$ª¤Œ °¤=? ü¼©{ ü˜¦C @ Remove the key-value pair equivalent to `key` and return it andÁ ¬à¦ the index it had.Á ú¦ú ü‚§J´
|
|||
|
|
üѧ?—µ
|
|||
|
|
ü•¨7áµ
|
|||
|
|
Ѩú üÙ¨)°¶
|
|||
|
|
‡©ú ü�©(Ĥ„é Ù Ú Ùßð Úœ‘ €¡ ü
|
|||
|
|
¢ £ £ ש ü
|
|||
|
|
�Í Ô© ®Í$¢ª ¾Íl©ª
|
|||
|
|
¢ ˆíŽí ñœ‘$Ü©Œ â©=? ü±°k ü¡<�¬
|
|||
|
|
tâǬ
|
|||
|
|
õú üýD A Like [`Vec::remove`], the pair is removed by shifting all of theÁ üÆ®=Ʀ üˆ¯9�§ Ưú üί)°¶
|
|||
|
|
ü¯ú ü„°(ܧd¸° Û Ü Ûßð Üœ‘ Žž ü
|
|||
|
|
¢ ¥ ¥ È° ü
|
|||
|
|
�Í Å° ®Í$‡± ¾ÍlŽ±
|
|||
|
|
¤ ˆíŽí ñœ‘$Í°Œ Ó°=? üÛ´v üݱ=‘°
|
|||
|
|
Ÿ²ú ü§²DǾ
|
|||
|
|
üð²=Ʀ ü²³9�§ ð³ú üø³)°¶
|
|||
|
|
¦´ú ü®´(ܧ”â´ Ý Þ Ýßð Þœ‘ ú– ü
|
|||
|
|
¢ § § ø´ ü
|
|||
|
|
�Í õ´ ®Í$¼µ ¾Ílõ
|
|||
|
|
¦ ˆíŽí ñœ‘$ý´Œ ƒµ=? üŠº| üì¶Cÿº
|
|||
|
|
¬´·Ì»
|
|||
|
|
ηú üÖ·DǾ
|
|||
|
|
üŸ¸=Ʀ üá¸9�§ Ÿ¹ú ü§¹)°¶
|
|||
|
|
Õ¹ú üݹ(ܧŒ‘º ß à ßßð àœ‘ €¡ ü
|
|||
|
|
¢ © © ¦º ü
|
|||
|
|
�Í £º ®Í$ñº ¾Íløº
|
|||
|
|
¨ ˆíŽí ñœ‘$«ºŒ ±º=? üï½ œ « § ¬ ¤ ¬ « ãá ô½ óá ÷½ ŽÓ ú½ßð® ¯ ± ´ · » ¾ Ã Æ Ê Í Ò × Ø Û ß à ã ç é ê ë ì í î ï ð ô ö ø ù ú û ü ý þ ÿ € � �’ ”– ˜š üç¿' ü•¾" Remove the last key-value pairÁ ¼¾ú üľ7 4 This preserves the order of the remaining elements.Á €¿ú üˆ¿(Ĥ pop_lastÁTÿ î¿ á áßðú– ª ò¿ ª
|
|||
|
|
® ˆíŽí ñ$÷¿ü´ÆV ü´ÀK H Removes and returns the last key-value pair from a map if the predicateÁ ü„ÁI F returns `true`, or [`None`] if the predicate returns false or the mapÁ üÒÁ= : is empty (the predicate will not be called in that case).Á ”Âú üœÂ7ëÈ
|
|||
|
|
ØÂú üàÂ(Ĥ �Ãú t•Ãγ ¨Ãú <°Ãùî ܼÃþ³ ÜÃú üäÃ8 5 let init = [(1, 'a'), (2, 'b'), (3, 'c'), (4, 'd')];Á ü¡Ä' $ let mut map = IndexMap::from(init);Á üÍÄ< 9 let pred = |key: &i32, _value: &mut char| *key % 2 == 0;Á ŽÅú ü–Å1 . assert_eq!(map.pop_if(pred), Some((4, 'd')));Á üÌÅ+ ( assert_eq!(map.as_slice(), &init[..3]);Á üüÅ' $ assert_eq!(map.pop_if(pred), None);Á <¨Æùî4»Æ â âßðüoú– ª üo ° ° ÂÆ ª ÍìóÑ
|
|||
|
|
üØÆ ã ä –"óÑ
|
|||
|
|
ãˆí äŽí ÔÝÆ ã ä óÑ
|
|||
|
|
ÉÒ
|
|||
|
|
˜" $óÆ
|
|||
|
|
¯ ˆíŽí ñóÑ
|
|||
|
|
$ÇÆ predicateÁLÍÆ�� üÑÊX üÄÈH—Ä ü‘É"éÄ ¸Éú üÀÉH¡Å T�ÊòÅ œÊú ü¤Ê(ܧ4ØÊ ç çßðâÿ ª — ² ² âÊ ª û‹ ßÊ å æ “"âÿ åˆí æŽí Ì�Ë å æ âÿ«Õ
|
|||
|
|
˜" $¤Ë
|
|||
|
|
± ˆíŽí ñâÿ$çʳ¦$ñÊ„† \ÒË ± ªŒ ³ ÂŒ ³ ߌ ³ ³ ± ³ ˆíŽí ñâÿ ˆí Ží ʵ üÿÎ5 üöËG D Sort the map's key-value pairs by the default ordering of the keys.Á ÂÌú üÊÌO L This is a stable sort -- but equivalent keys should not normally coexist inÁ üžÍR O a map at all, so [`sort_unstable_keys`][Self::sort_unstable_keys] is preferredÁ üõÍI F because it is generally faster and doesn't allocate auxiliary memory.Á ÃÎú üËÎ/ , See [`sort_by`](Self::sort_by) for details.ÁL†Ï è èßð ª �Ï ª ž¯ °Ï
|
|||
|
|
´ ˆíŽí ñ$•ÏtÕÏ ´ ªŒ µ ÂŒ µ ߌ µ µ ´ µ ˆíŽí ñ ¡Ç \‚Ð ´ ªŒ ¶ ÂŒ ¶ ߌ ¶ ¶ ´ ¶ ˆíŽí ñ ‘È ï« üÓ üÔÓ` ü¾Ð@ = Sort the map's key-value pairs in place using the comparisonÁ œƒÑ function `cmp`.Á ›Ñú ü£ÑL I The comparison function receives two key and value pairs to compare (youÁ üôÑ? < can sort by keys or values or their combination as needed).Á ¸Òú üÀÒG D Computes in **O(n log n + c)** time and **O(n)** space where *n* isÁ üŒÓC @ the length of the map and *c* the capacity. The sort is stable.Á<ÛÓ í íßðâÿ ª — ¸ ¸ æÓ ª û‹ ãÓ é ê ë ì “"âÿ éˆí êŽí ëˆí ìŽí ü’Ô! é ê ë ì âÿ™â
|
|||
|
|
˜" üÓD«Ô
|
|||
|
|
· ˆíŽí ñâÿ$ëÓ‹ õÓ´¶ tÕÔ · ªŒ ¹ ÂŒ ¹ ߌ ¹ ¹ · ¹ ˆíŽí ñâÿ±Ü
|
|||
|
|
ʵ \‚Õ · ªŒ º ÂŒ º ߌ º º · º ˆíŽí ñâÿÝ
|
|||
|
|
ʵ üîÖo üÏÕI F Sort the key-value pairs of the map and return a by-value iterator ofÁ ü�Ö( % the key-value pairs with the result.Á ÊÖú ¼ÒÖ The sort is stable.ÁLõÖ
|
|||
|
|
iterable.Á €ãú üˆã4 1 `from_iter` uses the same logic as `extend`. SeeÁ üÁã2 / [`extend`][IndexMap::extend] for more details.ÁLûã šßð š š Ÿ Ÿ š ÍìÉô …ä ÇLÉô ܈ä ÉôÈL ã„l•ä
|
|||
|
|
ž ˆíŽí ñÉô iterableÁD¥äPR üÏæd »À|Žæ¼ˆæ œ ¡ § ¢ Ÿ £ ¢ ¡ £ ãá Ôæ óá ×æ ¢Ë tÚæ Œ÷ $©ç ìž°çå‘¥ ë ¥ 8: <> @ àæ ü¦é! tºçγ Íçú <Õçùî Üáçþ³ �èú ü‰è0 - let map1 = IndexMap::from([(1, 2), (3, 4)]);Á ü¾è7 4 let map2: IndexMap<_, _> = [(1, 2), (3, 4)].into();Á Üúè assert_eq!(map1, map2);Á <šéùî$©é Ž…å‘
|
|||
|
|
¥ ˆíŽí Ÿ arrÁ ®éüðé^ œ ¨ § © ¤ ª ª ¨ © ãá õé óá øé ŽÓ ûé Œ÷ $°ê ìž·ê ¦Ê\Âêßð« ÒL « AC EG IK ü´îA üÕê< 9 Extend the map with all key-value pairs in the iterable.Á –ëú üžëJ G This is equivalent to calling [`insert`][IndexMap::insert] for each ofÁ üíëA > them in order, which means that for keys that already existedÁ ü³ìG D in the map, their value is updated but it keeps the existing order.Á ÿìú ü‡íF C New keys are inserted in the order they appear in the sequence. IfÁ üÒíK H equivalents of a key occur more than once, the last corresponding valueÁ l¢î
|
|||
|
|
prevails.Á4·î § §ßðÉô § š ¬ ¬ Þî § òô ¾î „õÜÁî •õlÎî
|
|||
|
|
« ˆíŽí ñÉô$ãî¿ôDéî>@ lÜó « ªŒ ÂŒ ߌ « ˆíŽí ñÉô ã„ ßðü ô~ §
|
|||
|
|
¯ œ ° § ± ¤ ² ¯ ° ² ± Œ„ ©ô �„ ¬ô ‘Î ¯ô ³û
|
|||
|
|
$ìô §†óô ÿÛ $øô �Ü $…õ ´Ö
|
|||
|
|
\’õþï³ ÒL ³ ¥ôZ\ ^` bd ü¤öI ü¥õ<–ú æõú üîõ1 . See the first extend method for more details.Á4§ö ¨ ¨þï¾û ® š ´ ´ Öö ® òü ®ö �ý ü±ö# ¾û ÈL �“¬¾ö
|
|||
|
|
³ §
|
|||
|
|
™ëŸë¿ð¾û $Ûö¿ôDáöPR „�÷ ³ ªŒ µ ÂŒ µ ߌ µ µ ³ µ ™ëŸë¿ð¾û þÕÚ® üÇ÷A œ · § ¸ ¤ ¹ ¹ · ¸ ãá Ì÷ óá Ï÷ ŽÓ Ò÷ ïñ<€øß𺠴 º /1 35 79 ¤´ø ü�ø Return an empty [`IndexMap`]Á<·ø ßð ¶ ¶
|
|||
|
|
º ˆíŽí ñüŒù§ œ ¼ õy ½ ÿy ¾ ãU ¿ Ál À ¾ ¿ ½ À ¼
|
|||
|
|
ãá ‘ù Íìô“ ”ù Íìú“ ˜ù Îà œù ÍìÁ” ù Œ÷ $èù ìžïù µßô“¾„ lûù Åeú“ \’ú ÅeÁ” \§ú·“Á ·ß Á ž ™› ”– ˜š “• üºú1½ú © ª ©·“ ª€” » Àú »
|
|||
|
|
Á ˆíô“ú“¾„Á”$Áú¹
|
|||
|
|
,Çútßû Á ªŒ  Œ  ߌ   Á  ˆíô“ú“¾„Á” ¬Õ ô“ €” ‹ü Á ªŒ à Œ à ߌ à à Á à ˆíô“ú“¾„Á” ¾„ ðŒü§ü] œ Å § Æ ¤ Ç Å Æ Ç ãá ¬ü óá ¯ü ŽÓ ²ü ìžÛü Œ÷ $àü àñ íü ¦Ê\øüßð ?A CE GI \¥% ü - * A hash set implemented using [`IndexMap`]Á % É •²àâ’€T… ±
|
|||
|
|
Á°3,‘ ›
|
|||
|
|
²CL˜ ü Ú‚d£ Ó
|
|||
|
|
Ä�*D± ý Åš+$» ê Æç?4Á É Ç¤„œÉ õ
|
|||
|
|
Èô,Þ ¢ É¥Žlÿ � ÊÙ,£ Ç ËôÀ|¶ í È Ì°‘\ ÖJ È ÍÉ"”Ì ü È ÎÖ€ ò � È Ïö ‡ ªB È Ð®D› ¿ß È Ñ× ¯ ` È Ò\\Å Åe È ÔŽ$Ò še È ÕŽ e È Õ BitAndÁ4é öø È × BitOrÁ,ñ –ú È Ø BitXorÁ4ø ¶û È Ùó…,€ Ù¢ È Úèþ\‡ ¤# È Û SubÁ ” �ï È Ü�ÓT§ È Þ é D³ ¬
|
|||
|
|
È ß çD/ $3È ê ›
|
|||
|
|
±
|
|||
|
|
Ó
|
|||
|
|
õ
|
|||
|
|
¢ÉëìüýИ4
|
|||
|
|
à É Ë � D
|
|||
|
|
â É Ì Ù,
|
|||
|
|
Ç É Í Ë¨$9
|
|||
|
|
� É Ï ˜\?
|
|||
|
|
g É Ð ŒÁ$_
|
|||
|
|
÷< É Ò ö e
|
|||
|
|
ªB É Ó × u
|
|||
|
|
` É Ô \\‹
|
|||
|
|
Åe É Ö Ž$˜
|
|||
|
|
še É × Ž e É × ChainÁ,°
|
|||
|
|
ð¬ É Ù ÈÊl·
|
|||
|
|
òP É Ú èþ\Ö
|
|||
|
|
¤# É Û SliceIterÁLü
|
|||
|
|
Äl É Ü ,
|
|||
|
|
IL;>-0d*
|
|||
|
|
!TR
|
|||
|
|
Y
|
|||
|
|
ôöLo
|
|||
|
|
çT~
|
|||
|
|
ÙÛÈÊT£
|
|||
|
|
¢¤�‘´Ë
|
|||
|
|
�Œç
|
|||
|
|
iüˆ2
|
|||
|
|
§
|
|||
|
|
Þ ¥ ß ¤ à Þ à ß Í쌕 ‘
|
|||
|
|
ŽÓ ”
|
|||
|
|
Ù”á â ã ÈL ÉL ÊL ã �
|
|||
|
|
/1 46 LÁ
|
|||
|
|
$Æ
|
|||
|
|
Ý Ý «¨lØ
|
|||
|
|
DÝ
|
|||
|
|
Ý Ý Þ•üú$
|
|||
|
|
Lý
|
|||
|
|
Ù”Ù” ÉL Ý Ý
|
|||
|
|
ã §
|
|||
|
|
Œ• ñ$‡
|
|||
|
|
ü¾*
|
|||
|
|
¥ å ¤ æ å æ Ê€ Ã
|
|||
|
|
ÍìÑ• Æ
|
|||
|
|
ž•ç è é ÈL ÉL ÊL é 24 .0 Lï
|
|||
|
|
$ô
|
|||
|
|
ä ä Ë•l‚
|
|||
|
|
D‡
|
|||
|
|
ä ä ’—ü¤$
|
|||
|
|
L§
|
|||
|
|
ž•ž• ÉL ä ä
|
|||
|
|
é Ë•Ñ•$±
|
|||
|
|
´™
|
|||
|
|
üÿ2
|
|||
|
|
/ An iterator over the items of an [`IndexSet`].Á ²
|
|||
|
|
ú ü¶>
|
|||
|
|
; This `struct` is created by the [`IndexSet::iter`] method.Á üõ#
|
|||
|
|
�Õ $¤
|
|||
|
|
§
|
|||
|
|
ë ¥ ì ì ë ݘ
|
|||
|
|
Œ• §
|
|||
|
|
«Þ• ¿Ì$ë{ÏOø í ©
|
|||
|
|
35 ô¶
|
|||
|
|
$¶
|
|||
|
|
É ê ê ÄlÄl š+ Çlµ ™l Èl€×™l Él–×™l ŒœjSž §
|
|||
|
|
à à И ã§ äŒ å» É% ê`ä猕 ¼Ù
|
|||
|
|
§
|
|||
|
|
ï ¥ ð ï ð ݘ â
|
|||
|
|
Þ•ñ ò Þ
|
|||
|
|
ü÷3
|
|||
|
|
…
|
|||
|
|
È §
|
|||
|
|
¾Ÿ Þ• î î
|
|||
|
|
ñ §
|
|||
|
|
Œ•Ó<‰
|
|||
|
|
üµ&
|