! / 0 0 0 0 102 ` 80_RNvXs0_CshBcWi0bn7s2_4slabNtB5_19GetDisjointMutErrorNtNtCsgxBkk5gSRhY_4core3fmt7Display3fmt// 58 ` slab-a4a8269ffb724f29.slab.ccffedcfc7866a60-cgu.0.rcgu.o/ lib.rmeta/ 0 0 0 644 144408 ` ELF>2@@GNUrust 0#rustc 1.98.1 (48a229cea 2026-09-01)RL.SAwjL-df1bddb45adbe94bm6GÂn62-64f5f36fb09276941 Xr*-1ad4f876c768bda9<%Z>64V`-2d2ab9fb0fe1def5G g{(3iF-06449a08aaab5e30rustc_std_workspace_core{`"Ei%G-cb0d4d77988d81b5")pE͗E-3ec41d3a5a80a4a4 miniz_oxide8bž LƨJ-e44eaef1807e5fc0adler29lyA6P/D$UB-dca52f01a59c33e7 hashbrownX {e-143c77bb957d9940rustc_std_workspace_alloc _z%-145a318e0772276c std_detectK(0*8D?-f99feda5ce9e492arustc_demangle%jerV-cfd0ab54bb33760ecfg_if}λ՞Co-360da4ba13154744 addr2linecY\G--09755979c57b7e64gimliQ`Dy-9a1fede77fbbf2f0objectF λv.z-7ff85ea729a864ffmemchr]1<=UO-0e3477fb2664a277 jlToKG-549498e8b2e4d924,!|!!serde,""builderBuilder  slab vacant_list_broken first_vacant_index with_capacitypairbuild     Slab  entries   %%%))>,IntoIter// /Iter3'a33 388IterMut; ;; ;Drain@ @@inner@EE E EcapacityEreserveE reserve_exactE shrink_to_fitErecreate_vacant_listEcompactNN CleanupGuardP PPP decrementNUUEclearEEis_emptyEEEgetEget_mutEget2_mutEget_disjoint_mut`` ` ` E get_uncheckedEget_unchecked_mutEget2_unchecked_mutEkey_ofEinsertE vacant_keyE vacant_entryE insert_atE try_removeEremoveEcontainsEretainpEdrainssswwzzz z          key  size_hint next_back      !GetDisjointMutError IndexVacant IndexOutOfBounds OverlappingIndices "#$%& VacantEntry ' EntryVacant Occupied (8'8(8(88888888-8-8-888888:88I8J8K8L8M8N8N8U8W8X8Y8Z8[8\8]8^8_8`8e8f8g8h8h8i8j8k8l8m8n8o8p8p8r8v8y8888888888888888888888888888888888888888888888   " #$ {tgиggٕXw 33 6 7=08!>w|#'#PP ST cjX8!#"PP     " #$ {t!P  #P"gg// 1 2W96g!g;; > ?l2>8!g@@ C Du_=8!Q$P$Q$T$Q33 6 7=0 !P!Q!T!Q;; > ?l2> !P$Q$T$Q%P%Q%T%% 83)  /3;@,.UPs w z    /3;@/3;@/3;@/3;@g,g##PPQPQT HD$$ ř"  ,     i1<$"DřǙșəʙ˙G*R{9 " _*D$' &('0tdCCCbuf=C=!FFFGlobal ě + C!.,Ĕ d -, -" 1,  $l " ")  ","V" ",'  &   d-, #-"1+ &$ & T&\g v,!< W"0 L- d-.) ,Đd-.), ř"2,d -  .), ĸ L "d -  .),  "d -   &$  M!.M >̇ d "-, ' $ # $ )$ 7"e#5! l %" ") %","V"%"Z  & 'Sl^ ( +L", #0"e - !;4"!2[ ! -$P ,p";6,";L"x;"$ "#;@;<!;b<!;XcMRW| + ./o2+!3r.'..c.77!ML D "d -  .(,  d -  .(,  "    $ ܶ M *  ,   ,"d-.(,d-2'  "%+ D`` [*`( 2 "L  D` `C *`(C-$    & < +$ D "C"%;A";;{;;P"E"$;:<<; "b  iE..A..2C<Cd'-',( -/<(D("L("'s  (''$' ,'-;""~'LHd)-|)-)(T) -D5ܠ)T)")"\)")"*((;);L(I4(;<;""~7sourceAlJ\*L* G*+*0$*LT( *%,4C *LTC iq C= g *ÜĜŜƜǜȜ_w;ĤĤŤError :ML W ggg cg-cثq1ȡC;M( *%, ?G Zb u *O;H * *<AGROYO`;g;nw  __self_discr __arg1_discr + *;O((5  C5 C #* gP5 C "'  3 T got5 N ٕXw!>OFCNC@TH TSCT  "-W5WTWTlUd9 Enumerate<< 0{?ipp p op end_or_lenop_markero2Ы>w|#'!9,9 X<9D9"8V 3!9:8~33 6 7=0!$8 [,8X X"$~Z(;#<! 2:(<" ; $;!;;W" :__self_0]1d\D "T?D? C!?Z   @" ?"@G?$?-_ _  "" @G-4HH C!DH%Hl   I" H"IHG"|;"i;^;*;< additionalneed_addu d.g9$]|]D]d%T]D]"] +"](d^ -^^. ) ,^D^ "^    , "^,   , "d^-^$l_ C!.4 D___K]^p;];L]"T]t""I";"D^"?"};"j;_;+;<hhc d.m( dl-ll.),ldl-l "-- '$l w!T4lNl m;6 dl -lm C!. 3 ,m m dn -nn. ) ,nn     ܍ppA$p pds-sls C!.3 |ssi Lll+;i;Li"Tl;]řǙșəʙ˙G*R{9 ;]  !i;;l;(řǙșəʙ˙G*R{9 !<6";;;r<; len_before)t.{pIpOquv.XAsdu-uu.),ut"du-uv.),vDv"u +"v v   v"$ dx-x "-. 'Dx w!UTxx#Lx Qpp p opWopXohEC8G! \xx)x SW<< 0{?iz  ,xMx)  PRevFœrMNz   V[ Mx v Q{   x"<",x}<4yx dx"Ly"yly"y y"$ '"K"zz z"$ zMtuy;t;Lt";"u"{;"h;]"1{{&zz t<#{řǙșəʙ˙G*R{9 }4 {?;"<i;FF;");"-remaining_vacant2entry .7.y0y6zz~{| ,L; :)91M;  P$  "ɍ ύ-;--ύ.<*,t.;."ύ)/; /-q = *,'  ӏ  "+H  !+ "+L:   !0;0-& p:(t3 w!"u2 (e +1;17 +ȑ ڑ"& (" (N"L,ɒTϒ ے2;2-ے.<(,tɒ;  # ""C(LS,: # Ӗ9 " #5;%5-t&2%I&)$&!3;3-,:   /$7z8(䊔,Δ4;!4-"ls!> (| ޗ:  = =$#+"$9&$" 9 ' ϗ"& '("(9$"&x'" :̏"t6;(6" 7;7"(8;*8-"ls*>)*|,; ,\ PP ST cjX,v+*[ ; %;-:*` < <! +#"(9(%: K:'%;)N  <>;χ;LL‡ߓ "" ;A "u<;؏;|Htt;";;;^  "; ";N<!z;<-!j<<U"8;";<;Eߓr; ;( ;0 ;8 ; ;H ;P ;X ;` ;h ;p ;x 3c;;rekey occupied_until  ].6 q p  .wH2g7sz! sٓ|#*1ߓ8!ߓKtT" ":TM ">"yT""LыTы ۋ M!2ۋW ; PP ST cjX!L;g;T T'T.T5>d֛-֛, C!.6<d" "l" "Xj;˛;L;<=Dܞ"Y3",̞I,ž /D"l "ȡZ<$I,"m5d-p)"$ w!Q4L Qpp p opWopXo2Ы!\DѨ"a 3[ק33 6 7=0\I,W<< 0{?iTt;"tpd-y*"DʯyLTʯ#Lկz^\կD"h ;\;; > ?l2>t;Lzz<="3yJyPzd-p)"LDN$״ ř^ ; Y ; L ř^ ô]' řǙșəʙ˙G*R{9 ^T޳I,ȳ"ϳtt;;;ԝ^;;Z]Qp'.d-̝y*"< w!"UdV$ ř < [\߹ < L ř ո^Ź4 řǙșəʙ˙G*R{9 t;L"řǙșəʙ˙G*R{9 <</;Ϲ;Ź'h<><F=y}d\ CC!d - y + d- y+ [d x! $ 4  4  < 4 "TԔ< 4$l "dN$ 44<4$ l<4 " T 44 $ ř `M!<!"<"d#<#d$<$d  ř  _%řǙșəʙ˙G*R{9 ;L"$"$S44Tod<:v-!<@~;5;;;(;(e8 <s<{<< Qkey1Ykey2aentry1\entry2cslice1 slice2 val19val2 Cyy!:$$  "\$ w"A4L Qpp p opWopXo2Ы"\P  PW<< 0{?iafP  Q       "W"7 W 7$Q " , "r 1z"~t ^d-T C!.6dPS  PT &+S GV[ Qm uz D8W8|  ' ,  !d-.,,$" # T  /d $%$%\$$9#4L#@"\T ">!"&!T > (&M R(^'fk )'w )  *'" 9'W +9 ,+ ,6\ 6.5 l% - * - !  !\+/D :/ ; ; :"! <*!"9"K = ;<Z >=f"z >!";", 2.t  <* 44 1 % 1 !ܳ , 42,3d  5!  ?/ @ ?" A@" B A CB C # ./% 0.+ 0`  +2!  DÜĜŜƜǜȜ_w(;L$1     ! a řǙșəʙ˙G*R{9    ;O ""řǙșəʙ˙G*R{9 WM Y;(" !\<"\;x MaybeUninituninitW췜<6 n 1\e ;" "~ Z<p; ;W W W " "  "  " "* 1 8 ? -keys4h      prev_key  entries_ptr5 entries_len:resres_ptr< &. * + 2  E L   a h .2    _ = D Fd- p*#l w!"U &D``C*`(C,<e^I,";t&;D;Ľ>ApszCd-# y+# w!"V$*D``C*`(C,\f#4;L"< )<H;?Byv}C1]9]] A]WI]WI] Q] ]    !] ] ř Argumentstemplateccg@# ]] ] ["" !]Q]Y] Ed-T.dl$Ll$LT$% $" &)!"8"J' %&Y('e"y (!"% D``C*`(C,Į< d<d<d T./ ." 0/,">1 0JT21b 2 )* )"+*"$, +1<-,K - Z  "!!","?" !O#"\"q #|!" K \<m[ g]]x3;L"$"$WWWWWW""~NeMatchvX]!]rřǙșəʙ˙G*R{9 )<$$<<9< <;;2<~<<<"""""""l"t{ AFKleft_val right_val  ptr1ptr2xQM+C7|$"d-4 C!.5D""d \DԂĂ !  (  "$  5  d -. , ,   !`!`C31C *h",I,^|"\ "D !; "\" "9;W~present_element element_ptrbase_ptr byte_offset7\.CL"ĖL l$€i~J",;L; eрLʅ"مj;",I, /L"ɋK kٕXw;L"ql֌ )1<" "d "-"""d-.,,d -    '$7 j 8Ԧ<ڍ  "&  ("΍" "d-p)#M DP ܌ $D`$`C$*`(C- ;k $Ύ ;""   d-,2* $ % ŏ S[fu׏gw ֏Sla";ˌ;L"Č; "<;Z;< !;tt';E;;Ժ"s!D<<;z;'  .)7pC{2o!J! d-̘y*"<MdN\ ,<,ܔǔ L "Ć  3 !, A -2  9 'D`'`C'*`(C,Ƙ Θ  l" ș"+ "-"X""|ۙ"  T$ řǙșəʙ˙G*R{9  4   $ ř% /Ó^ n /m=ܗܶL;LՓ"<;W<K;*!!"8;;h]{ RybiCFڕ<T m$|l  C*4 Wk:nڞd ;L"C%(Ud-p)"LDN(|])(}] ;Y!(}] uo(|`] $ТI,"t8t@;^;;;dJMpd-.,,U " "X  P}J"[`Xש|  Qؠ    ۩ "d-2*  $ ܫ|  $   LǪ  ժ<ժ  * #"D9 B$  t4 n$  L ݫ@ p6=%;;L,ؠؠ)"X;vؠ, ؠ#;"]$<><];Էݘg keep FR .8Ҡ١2PD"d" "lƲ" Ҳ"d-, C!. QU_ :YLݲV @rޱ@@ C Du_=d;L"<>> > tail_start=>tail_len=>=>=KRgq!.r<old_lendŴ-Ŵp)"ҴLִDҴNܿ+`+`Cl C ) ; g  ; v ^I,"tUt];{;;;;Y\pCbdĶ-Ķy*"<ѶMٶdѶN.`.`Cl C ) < hL < Ϸy* 4;L"Zc<;;%<<\_yChd-ĄL P-1\$L Q?? ?-=?phantom=?cap=?=? =?=_O !.\D"j /Թ~$\θ$ŸW<< 0{?iܵJܵ-"kֵ\$ [!$4ɺ=[\ߺ #$ֺ 2~|D \!$TʼD;; > ?l2>!tT$ eD L PD\  DL QP6\"7 3'  D @Z  P?$) ZND  SX Q j  sx     #", #<Ĝ$ - , Z < |, ? <   Uev  7a$D+\"",F cřǙșəʙ˙G*R{9 #  ;"r;K;e+ iterable   ܻo+п+kr |L g-\-|L g\.\$ [$4$< e"^]-4 e] D4   Cd g ; 3  ,  CL"TA, d _N ,  C|Dd$ TTq, C  4 d S DN\I,O O eeDebugMapede de has_fieldsdehas_keyded8U$CL dd DebugStructddd ddd19NCCTWCPTW"P zC mWTdWT{NT  Cd7/\  CL " TG,YH]4LD N\ $,O"+CKCTWMPsWT) 4 Cd7/\  CL " TC,YHY4LD N\[,O(CHCTWMP~pWT&L Cd7/\  CL " TF,YH\4LD N\ ,O#,CLCTWNQuWT+ < C̦d7/"4VDmN\ @@ C Du_=!,OC.1L TD""L l! D6ė T CCC-=C=Y.#  "#D"=< wY"6n ) 1D`1`C1*`(C , Y n L!* !LV$!; "=řǙșəʙ˙G*R{9   Y U";;%TT,5`) t{CD"3",V, /ͷ[  P ͷ6&+[GV[ Qmuz"!", !,      l " "+  "-" X" "  D t ř#  14 ]"94 ] W4 ] A4 ]WI4 ]WI4 ]Q4 ]4 ] 4 !] 4] ř4]]4 ]!4]Q4]Y4]R=$ ř#N Y  $U4 ]4 ] $LřǙșəʙ˙G*R{9  ;"!h;C7;&#VWWWZWN"I"@!4 ]1  v#*x   "zDW"RD"D"t ř" X,",n"!F dͷćL Pͷ5\- ",!,  l " "+  "-" X" "  D  t ř#  17 ] "97 ] W7 ]  A7 ] WI7 ] WI7 ]Q7 ]7 ]7 !] 7] ř7]]7 ]!7]Q7]Y7]R=$ ř#N Y  U7 ]7 ]LSt;+"! ;;#SjW1W$WW""!7 ]|slioa  "W3"RBD"/",, 0 X]  P X4%*]FUZ Qlty" Y", 4   ,  !l " "+  "-"W" "D  t ř" !  1: ]"9: ] !W: ] A: ]WI: ]WI: ]Q: ]: ] : !] :] ř:]]: ]!:]Q:]Y:]R=$ řQ \U: ]: ]řǙșəʙ˙G*R{9  [LřǙșəʙ˙G*R{9 - 9; ";h];K{WWWWsD"n"e!: ]5U>  v FM  "oW"RD"D"t ř" X[,",m"!E dXL PX3\, ",4 ,!l " "+  "-"W" "D t ř  1= ] "9= ]  !W= ]   A= ] WI= ] WI= ]Q= ]= ]= !] =] ř=]]= ]!=]Q=]Y=]R=$ řQ \U= ]= ]L-M;";;>WWWW""!= ]lPSLia6  "W"RD"/",[, / W<< 0{?ipp p opWopXohEC8GY_  P &+_GV[ Qmuz"", ڕ4   L  !l " "+  "-"W" "D  t ř"  1@ ]"9@ ] !W@ ] A@ ]WI@ ]WI@ ]Q@ ]@ ] @ !] @] ř@]]@ ]!@]Q@]Y@]R=$ ř֗Q \U@ ]@ ]řǙșəʙ˙G*R{9 ֗ LrřǙșəʙ˙G*R{9 ڕ, 8;";h];J֗|WWWWtE"o"f!@ ]6S>  v EL  "pW"RD"D"t ř"Խ X,",n"!F dL P5\- ڕ",ڕ4ԛ L!l " "+  "-"W" "D t ř֗  1C ] "9C ]  !WC ]   AC ] WIC ] WIC ]QC ]C ]C !] C] řC]]C ]!C]QC]YC]R=$ ř֗Q \UC ]C ]ߛL/P;";;֗>WWWW""!C ]lQSLia8  "W"RD"/",, 0|>> >=>=>=>=KRgqY.xa  P &+aGV[ Qmuz,Y,    !l " "+  "-" X" "   < ř!  1F ]"9F ] !WF ] AF ] WIF ] WIF ]QF ]F ] F !] F] řF]]F ]!F]QF]YF]R=$ ř!P [  NF ]F ]řǙșəʙ˙G*R{9 ! L,řǙșəʙ˙G*R{9 Y ;Y;n!b;Q!WWWWS"}"t!F ]D / j!5  "lW"RD"D"t ř"ԓ X,",n"!F TL P5\-\ ,Y,  !l" "+ "-" X""  < ř!  1I ] "9I ]  !WI ]   AI ] WII ] WII ] QI ]I ]I !] I] řI]]I ]!I] QI]YI]R=$ ř!P [  NI ]I ]L@;Y;!;!IW#WWW""!I ]|OW P]S!~  "W"R(D"/",, 04< *!5"<CD< *!5<C /3;@!,"$"="C$"8d#P FusedIteratorl#T\##c # #!,#i2/ Pre-allocated storage for a uniform data type.PM `Slab` provides pre-allocated storage for a single data type. If many valuesEB of a single type are being allocated, it can be more efficient toNK pre-allocate the necessary storage. Since the size of the type is uniform,FC memory fragmentation can be avoided. Storing, clearing, and lookup! operations become very cheap.OL While `Slab` may look like other Rust collections, it is not intended to beOL used as a general purpose collection. The primary difference between `Slab`DA and `Vec` is that `Slab` returns the key when storing the value.KH It is important to note that keys may be reused. In other words, once aMJ value associated with a given key is removed from a slab, that key may be+( returned from future calls to `insert`.   # Performance notes  LI Methods that remove values and return them, such as [`Slab::remove`] and LI [`Slab::try_remove`], might copy the removed values to the stack even if LI their return values are unused. For types that don't have drop glue, the ,) compiler can usually elide these copies. t # Examples   Basic storing and retrieval. <  ```  # use slab::*;  let mut slab = Slab::new();  %" let hello = slab.insert("hello"); %" let world = slab.insert("world");  %" assert_eq!(slab[hello], "hello"); %" assert_eq!(slab[world], "world");   slab[world] = "earth"; %" assert_eq!(slab[world], "earth");<OL Sometimes it is useful to be able to associate the key with the value beingOL inserted in the slab. This can be done with the `vacant_entry` API as such:< let hello = {(% let entry = slab.vacant_entry(); let key = entry.key();%" entry.insert((key, "hello"));\ key4 };%" assert_eq!(hello, slab[hello].0);'$ assert_eq!("hello", slab[hello].1);<LI It is generally a good idea to specify the desired capacity of a slab atHE creation time. Note that `Slab` will grow the internal capacity whenQN attempting to insert a new value once the existing capacity has been reached. To avoid this, add a check.<-* let mut slab = Slab::with_capacity(1024); // ... use the slab&# if slab.len() == slab.capacity() { panic!("slab full");, }30 slab.insert("the slab is not at capacity yet");< # Capacity and reallocationJG The capacity of a slab is the amount of space allocated for any futureMJ values that will be inserted in the slab. This is not to be confused withIF the *length* of the slab, which specifies the number of actual valuesNK currently being inserted. If a slab's length is equal to its capacity, theFC next value inserted into the slab will require growing the slab by reallocating.LI For example, a slab with capacity 10 and length 0 would be an empty slabOL with space for 10 more stored values. Storing 10 or fewer elements into theNK slab will not change its capacity or cause reallocation to occur. However,LI if the slab length is increased to 11 (due to another `insert`), it willPM have to reallocate, which can be slow. For this reason, it is recommended toPM use [`Slab::with_capacity`] whenever possible to specify how many values the slab is expected to store. # ImplementationIF `Slab` is backed by a `Vec` of slots. Each slot is either occupied orLI vacant. `Slab` maintains a stack of vacant slots using a linked list. ToKH find a vacant slot, the stack is popped. When a slot is released, it isԷ pushed onto the stack.PM If there are no more available slots in the stack, then `Vec::reserve(1)` is %" called and a new slot is created.  ;8 [`Slab::with_capacity`]: struct.Slab.html#with_capacityvt "| /3;@=C8PTc  !i!́"\"<" ,  $ ,#%E>?:-/:6<:;;W<< 0{?ipp p opWopXohEC8G YT::;;";:" A draining iterator for `Slab`,; ABAB ;@@ C Du_= !u_=CD;fh;,;@@>> >=>=>=>=KRgq Y.T;;@@"|<FF <GHIJKLMNXYZ[\]^_`efghijklmnoprCEԑ?<" Construct a new, empty `Slab`.<t>><>>>&# let slab: Slab = Slab::new();; Construct a new, empty `Slab` with the specified capacity.@@FC The returned slab will be able to store exactly `capacity` withoutAA> reallocating. If `capacity` is 0, the slab will not allocate.ABLI It is important to note that this function does not specify the *length*BJG of the returned slab, but only the capacity. For an explanation of theC=: difference between length and capacity, see [Capacity andC85 reallocation](index.html#capacity-and-reallocation).DtDD = Slab::with_capacity(10);J$! assert_eq!(slab.capacity(), 10);= 11);= 3 && slab.capacity() < 10);= 2 && slab.capacity() < 10);<:7 The value is not moved when the closure returns `Err`:<,) let mut slab = Slab::with_capacity(100);Ѕ let b = slab.insert('b');/, slab.compact(|&mut value, from, to| false);41 assert_eq!(slab.iter().next(), Some((b, &'b')));<< ;BEOO E # ""##$ N$,Ƈhjd QRQR PP ST cjX !cjXSTWjln$PP#|LPP܉$8VV "W#W$ ";BU U W8!$! Clear the slab of all values.tә<ۙªš,ޚ slab.clear();솛 assert!(slab.is_empty());<, ;BE E X$ƛԷ'$ Return the number of stored values.Мt؜<ªڝ, assert_eq!(3, slab.len());< "BE žE Y$Þ<9 Return `true` if there are no values stored in the slab.t̟<ԟ웠Š slab.insert(1);ݠ assert!(!slab.is_empty());<D BE E Z$ק!Ρ%" Return an iterator over the slab.IF This function should generally be **avoided** as it is not efficient.΢DA Iterators must iterate over every slot in the slab even if it isEB vacant. As such, a slab with a capacity of 1 million but only one63 stored value must still iterate the million slots.t<ˤª,¥̥ԥ# let mut iterator = slab.iter();/, assert_eq!(iterator.next(), Some((0, &0)));/, assert_eq!(iterator.next(), Some((1, &1)));/, assert_eq!(iterator.next(), Some((2, &2)));&# assert_eq!(iterator.next(), None);<˧$ާ 33 6 7=0BE E$,85 Return an iterator that allows modifying each value.ID̪E6ѫt٫<ì let key1 = slab.insert(0); let key2 = slab.insert(1);'$ for (key, val) in slab.iter_mut() {Ľ if key == key1 {ڭ *val += 2;L }, assert_eq!(slab[key1], 2); assert_eq!(slab[key2], 1);<ۮD ;; > ?l2>BE E \$+B? Return a reference to the value associated with the given key.ٰC@ If the given key is not associated with a value, then `None` isl returned.tñֱ<ޱ# let key = slab.insert("hello");Ͳղ.+ assert_eq!(slab.get(key), Some(&"hello"));$! assert_eq!(slab.get(123), None);<ij "řǙșəʙ˙G*R{9  BE ȳE ]$ɳ Wո7JG Return a mutable reference to the value associated with the given key.ɵClt<ƶҶ#*' *slab.get_mut(key).unwrap() = "world";# assert_eq!(slab[key], "world");(% assert_eq!(slab.get_mut(123), None);<ɸ<ܸ "řǙșəʙ˙G*R{9  BE E ^$iYPGD Return two mutable references to the values associated with the two given keys simultaneously.LI If any one of the given keys is not associated with a value, then `None` is returned.LI This function can be used to get two mutable references out of one slab,ݼLI so that you can manipulate both of them at the same time, eg. swap them.dǽϽ?< This function will panic if `key1` and `key2` are the same.t<¾پ use std::mem; let key1 = slab.insert(1); let key2 = slab.insert(2);>; let (value1, value2) = slab.get2_mut(key1, key2).unwrap(); mem::swap(value1, value2);<D ""řǙșəʙ˙G*R{9  BE E _$__74 Returns mutable references to many indices at once.EB Returns [`GetDisjointMutError`] if the indices are out of bounds,ܐ overlapping, or vacant. ÜĜŜƜǜȜ_w BEaa E"t `$k" "4IF Return a reference to the value associated with the given key without performing bounds checking.2/ For a safe alternative see [`get`](Slab::get).+( This function should be used with care.d # Safety" The key must be within bounds.t< let key = slab.insert(2);d unsafe {0- assert_eq!(slab.get_unchecked(key), &2);,<l " E E e$xq@IF Return a mutable reference to the value associated with the given key'$ without performing bounds checking.:7 For a safe alternative see [`get_mut`](Slab::get_mut).+d"t<d.+ let val = slab.get_unchecked_mut(key); *val = 13;, assert_eq!(slab[key], 13);< " E E f$sYGKH given keys simultaneously without performing bounds checking and safety condition checking.<9 For a safe alternative see [`get2_mut`](Slab::get2_mut).+d&# - Both keys must be within bounds.-* - The condition `key1 != key2` must hold.t<JG let (value1, value2) = unsafe { slab.get2_unchecked_mut(key1, key2) };< "" E E g$yyy2+( Get the key for an element in the slab.=: The reference must point to an element owned by the slab.'$ Otherwise this function will panic.GD This is a constant-time operation because the key can be calculated/, from the reference with pointer arithmetic.dJG This function will panic if the reference does not point to an element of the slab.t</, let key = slab.insert(String::from("foo")); let value = &slab[key];(% assert_eq!(slab.key_of(value), key);<KH Values are not compared, so passing a reference to a different location܆ will result in a panic: ```should_panic let key = slab.insert(0); let bad = &0;(% slab.key_of(bad); // this will panic unreachable!();<|4  "BE E h$~)DA Insert a value in the slab, returning key assigned to the value.TQ The returned key can later be used to retrieve or remove the value using indexedHE lookup and `remove`. Additional capacity is allocated if needed. SeeFC [Capacity and reallocation](index.html#capacity-and-reallocation).dGD Panics if the new storage in the vector exceeds `isize::MAX` bytes.t<## assert_eq!(slab[key], "hello");<4 "BE E i$?!Ȁ-* Returns the key of the next vacant entry.IF This function returns the key of the vacant entry which will be usedЁ1. for the next insertion. This is equivalent toGD `slab.vacant_entry().key()`, but it doesn't require mutable access.҂tڂ<%" assert_eq!(slab.vacant_key(), 0); slab.insert(0);%" assert_eq!(slab.vacant_key(), 1);Є%<T "BE E j$4߅HE Return a handle to a vacant entry allowing for further manipulation.HE This function is useful when creating values that must contain theirKH slab key. The returned `VacantEntry` reserves a slot in the slab and isч%" able to query the associated key.t<(Ӊۉ%\4%Ҋ'<d ٕXwBE E k$+L ";BE Eр$Ó5ݏ<9 Tries to remove the value associated with the given key,+( returning the value if the key existed.ΐ֐EB The key is then released and may be associated with future stored\ values.tˑ<ӑߑ%̒Ԓ63 assert_eq!(slab.try_remove(hello), Some("hello"));# assert!(!slab.contains(hello));<Tʓ "BE ՓE$ړڞ)>; Remove and return the value associated with the given key.E\ԛٚd30 Panics if `key` is not associated with a value.tŜ؜<%ٝ,) assert_eq!(slab.remove(hello), "hello");#<|ƞ4 "BE E$P*ğ>; Return `true` if a value is associated with the given key.t<͠%" assert!(slab.contains(hello));ʡҡ slab.remove(hello);#<D "BE E o$X85 Retain only the elements specified by the predicate.HE In other words, remove all elements `e` such that `f(usize, &mut e)`FC returns false. This method operates in place and preserves the key(% associated with the retained values.tʥ<ҥޥ䡦 let k1 = slab.insert(0);¦ let k2 = slab.insert(1); let k3 = slab.insert(2);30 slab.retain(|key, val| key == k1 || *val == 1);ħ̧ assert!(slab.contains(k1)); assert!(slab.contains(k2));  assert!(!slab.contains(k3)); assert_eq!(2, slab.len());<4 ;BEqq EϾ #" 䫩#$é p$ dfޱ'JG Return a draining iterator that removes all elements from the slab and첬 yields the removed items.ԬܬEB Note: Elements are removed even if the iterator is only partially$! consumed or not consumed at all.ϭt׭< let _ = slab.insert(0); let _ = slab.insert(1);܁ let _ = slab.insert(2);, {%" let mut drain = slab.drain();ݯ*' assert_eq!(Some(0), drain.next());*' assert_eq!(Some(1), drain.next());ð*' assert_eq!(Some(2), drain.next());'$ assert_eq!(None, drain.next());,찱<ұ, @@ C Du_=BE E r$%tt ³uvv\4ss!|, " Bs s v$sõ(xx ȵy#y-|L " Bw w y$lӷ {{ ط|}~PPP~L$zz#lDzz$!L$Bzz ~Fع(  #PPPݹ(*L$"  !lD&ɺ!L̺#&B  !8,  #PPP(*L$»"  !lD&$L#&B  !,μ63 Create a slab from an iterator of key-value pairs._\ If the iterator produces duplicate keys, the previous value is replaced with the later one.LI The keys does not need to be sorted beforehand, and this function always takes O(n) time.˾OL Note that the returned slab will use space proportional to the largest key,,) so don't use `Slab` with untrusted keys.ȿt̿ۿ<߿.+ let vec = vec![(2,'a'), (6,'b'), (7,'c')];74 let slab = vec.into_iter().collect::>(); assert_eq!(slab.len(), 3);" assert!(slab.capacity() >= 8); assert_eq!(slab[2], 'a');<%" With duplicate and unsorted keys:<;8 let vec = vec![(20,'a'), (10,'b'), (11,'c'), (10,'d')];7 assert_eq!(slab[10], 'd');< PZLB PP#  ?A7 gTg#%:  ggg cg-cثq1ȡNB  $Q; T$g: $ ggg cg-cثq1ȡNB  $k;8 g!T!g#%: ! ggg cg-cثq1ȡNB  8!$>8 T$g: $ ggg cg-cثq1ȡNB  8!$#8 %g: % ggg cg-cثq1ȡNB  8!$5   (LI Insert a value in the entry, returning a mutable reference to the value.HE To get the key associated with the value, use `key` prior to callingl `insert`.t<(%\4%'<4 !B  !ʯ.+ Return the key associated with this entry.B? A value stored in this entry will be associated with this key.t<(%\4%'<  "B   !$  $QQQ%'L$#($ $řǙșəʙ˙G*R{9 Q$B  $-L $B  $+ $P-L $B  $) $Q $"B  $% $ $  &QQQ,.L$κ($ &řǙșəʙ˙G*R{9 Q&B   !$-L &B   !$+8 !P-L !řǙșəʙ˙G*R{9 Q!B  8!$)8 !Q !"B  8!$%8 ! '  &QQQ,.L$($ &řǙșəʙ˙G*R{9 Q&B   !$-L &B   !$.8 $P-L $řǙșəʙ˙G*R{9 Q$B  8!$,8 $Q $"B  8!$(8 $ !8 %QQQ%'L$!($ %řǙșəʙ˙G*R{9 Q%B  8!$-L %B  8!$,8 %P-L %B  8!$*8 %Q %"B  8!$&8 % ++:7 The error type returned by [`Slab::get_disjoint_mut`].+и\,+63 An index provided was not associated with a value.FY[,,52 An index provided was out-of-bounds for the slab.EXZ-,*' Two indices provided were overlapping.:MO%g%%  ggg cg-cثq1ȡNB * %%''' B * '((((  B * ( (z) z)z)z)z) ;B * z)51+( A handle to a vacant entry in a `Slab`.11KH `VacantEntry` allows constructing values with the key that they will be2 assigned to.2t22<223333(334%\44444%4'<5\5  55 ٕXw5-/2$5#T55")! 5 g))  ggg cg-cثq1ȡNB5  !))l<,< <!>w|#'"!B!BBDڠߠ "!B,<" !B <-"Q<!kn-- !!B; -jZ݈Z~Z )ZZ Z%ZZZZZwZ .Z.ZrZxZ)Z8ZZZ+zZuZqZlZUlZ ZeZZcZ8bZ`Z_Z[ZXZVZNTZPZyNZKZHZEZAZ Z;>Z;Z8Zy8Z26Z*4Z2Z Z"/Z*Z/*Z)Z Z ZZZ ZZZZ ZZZZ ZZZZ ZZZZQZZ!ZZdZZtZZZZjZ ZZZZ|ZZZ$Z ZZ% ZZ ZZE3 Slab::get_mutSlab::get2_mutCapacity and reallocationmodule documentation Slab::removeSlab::try_remove index.html Slab::getSlab::get_disjoint_mutSlab::with_capacitystruct.Slab.htmlCapacity andreallocation ֌ߍЍ  ֌ߍЍ PT  ####!!!PQPPQ(internal error: entered unreachable code(OverlappingIndicesIndexOutOfBounds IndexVacant VacantEntry slabkeyassertion failed: key1 != key21The reference points to a value outside this slab1 invalid key SlablencapIntoIter remaining IterIterMutDrainʑǓғ`j7⭇+dk46_\~nR+MRQmXX`.opIucs*Y 2A۝5'W-hW\{e!<vvhǬ/#ˆC'%EuG.G= ;htC<,gHS)s%MO=skpe({8 O r'{%FJ[,_jRYRْC_8@[IKPHV }ҝBMʊ:$vO -ŞٔMKnyYu<\߻3NIC*#CW1@n9{9lFLR2yn5aݼDmg[ _A/ lZPLlFhQ/>Pʫ 쮀iBmR{]Kp N+Ks_m-"S7jjA)hu{tB2^"BU p.Lq,ƇO:jJ Ær 'Mcn5vLi<4WBWO1"^?oH3ĭ@^ Gm6L&uLVg/c C iMW kTyp6t E_/s9r،NE/:ı8e2䩽|`_碤\z:UzJ[o0yƔLQ!κqw]ERMdG%Kjl h\ q+50,! ^\'XhG"ӻ۬SbWu|^$iV4s*bp4_ vrXnTO%TnE? E?gh&iϺ+㿘;һb~::# p.6mUM?~x܃g0<2OemmM@ؓ 9烬Jn _,<m'\iu%1e!P! @&!O> ء`4e$􄘶:(j{UD02IWڴׄmt?Yzxu j%W#G.Aׁ-+cyЪ$T +dta7*ygAcߖ>0c@8YK(rjٻ}5Ļve$ 8:3 vޟ+,//̏E+}mx!7=1% y&8|v3 x*~^מÝq ʽU%ysMK^8۞)'Q[h`dUmr!l<$,d= [4{-{aoJ )4[semJhsh0y\G#5V1t/z߈PQf% ?^' (Jh`B"orOud*m.z?Fh2%e%N$+Ts+̣wTEݞK̜^\X /l5~ ho ]#?lf7Bnf:}2*\S/1*]"{a {JT V.̧.ඈ6,KBoUJŘ[k5wĪK& ) JqZ=k/؎ۍpA~%Zmw+ǑA! y 5/8P2UCי(xV ]h6t}*dP&1$BH`ii6(9HAE (a_HК~A1ɒ;hw1#~d,X8GaSɋI!づ]<z9`RAz,3cI=:SIt%1&pjD\a ̺"^7A({}@)~rVm4\_?K~;L:j>1v Z1ۦϵ'GwIcwNhm/bl=qd2i$26JJE?Y`AΤÚkdXЬ0 %P@zvmuTr~ߴEWiޭmH9;+ J?U8r.=r\:iT2|n?nSK%>_z6|âwqv4b(o&op#Ks)Y2(vUkb}UT:O/E7&FOf5o !W%%ڥ#%55\w4_uy}؉-}!P>_BpWpl }%`MR4??%Ddn\^VnfoY99:; kCYpc+DWMf~68BBZ T  ))U 1 {  B" #$(+ .X04X69;$>CF?I LtLNPeRGVZZZtZZ&[[[[\X\\\\D]]]]6^b:ccEddIeefff|gghhjl>mZmn^nnn?ooo:pWpqiqqfrrsYssstt?uu;vvv@w\w xlxxykyyzz{{|/|||I}[}y}}}k~q, W rz0tx9({_ 6Z [[\u]zbncrdefghmn!oopqrEss uvvwxMyyzzz ||W}i}}X9                                            ***   )) F\t{/Qj:PF.F7 :Fp\   "Z#$@(+r-/358;>mCUFIK&LuNPRUY_ZZG[[\/\\\]]]^bcdefgjlCmsmnnXo?pppqqrsstXuTvEwuw#xxyXzz{_{{{{F|}}1~ u1cӂn3@Vk^'?S;Hbz$1'4*0=>VO zCP + i v  ="#$(+.R04I6R69;>CF9ILnLNP_R4VAVZHZUZnZZ[ [[[[[\R\\\\\\>]]]]]]0^bb'c4czcc?d~ddCeee`fffvggghhhhjl,m9mTmmXnnnn-o:oooo!p(p5pQpqcqqq`rrrsFsSssssstt,u9uu)v6vvvv.w;wVwxfxxxyYyfyyy zzz{p{{{|,|||F}X}v}}}g~\bo)I ETǃ̓Ӄك߃ #)/5;AIOW]ciou{ń˄ф݄ׄ !)17?GOU]ems{ÅɅхׅ݅ #+15CYpc+=Mf"&6)8.2B*B{ ".XzEW k { !A#$'(+Y-/3h5K68l;u>SCmZmnnn/o?oo&p*p:pWpqqqrrHssssst.u?u+v;vv0w@w\w xxx[ykyyTzzz]{r{{{/||y}~`dq.LHWăʃЃփ܃ &,28>FLTZ`flrx~„Ȅ΄Ԅڄ&.4<DLRZbjpxƅ΅ԅڅ  (.6=Pf~B !9Y:lxE[t.D1v:POPoG amM~ & R s  *"#$(}+-80z468;>C}F&IKQLNPERU>VY)ZRZhZZZ[y[[[[ \A\|\\\\&]h]]]]^mbbb1cQcc#d\dd'elee?fffUgggbhhhjlm6mMmmCnunnno7ooooo2pIppHqqqFrrrr8sPs}ssslttu6uuv3v|vvvw8wOwwLxxxx@ycyyyz_zz{i{{{||||6}S}e}}}W~/lʀԁ&<w%Q7H^v61F.Yl?Sl(<+j4H1H\? UaG`  3 m  "s#$(p+-+0m468;>CpFIKDLNP8RU8VYZLZ`ZZZ[l[[[[\9\Z\\\\]F]]]]^Xbbb+cxnxxxy]yyyzYzz{`{{{{|||(}M}_}}}I~ fw 3nނKTjF %=r>v|"_xHzTbTyM eq& * ]  ."#$(+-<0~4,6P69;>CF*IKULNPIRVY4ZlZZ[}[[[\E\\\\*]s]]]^xbclc(dpd,eeDffZggghhjl mRmmHnnnooopNppMqqKrrrCsssqttuuvvvwTwwQxxyKyyyazz{n{{{ ||||;}U}g}}}\~AۀށA~7}Q/8 ;Gq^ "[#$A(+s-/358;>nCVFIK(LvNPRUYZH[0\]^bcdefgjltmnnYoqp qqrstYuUvvw$xxyYz{{{G|}}2~ eo~S9 <Hr "\#$B(+t-/358;>oCWFIK)LwNP RUYZI[1\]^bcdefgjlumnnZosp"qqrst[uWvxw&xxyG|}}2~fւpg<# &2\ !F#$,(+^-/3m58q;z>XCAFHyKLaNoP R}UYZ2[\\]bcdefgjl_mnnDo\p qqrstDu@vawxxpyzt{{2|||}~OZ3 fw`jt~.8BLV`j=Y?G03<Ou @VTZ[[\]b3ccdefgh8mn9oo4pqrRss8u5vv:wxey zn(S [#Q$%+/Y0!11457:}AMOP1QQSHUW?ZaLpqs|؇R֛a\BEܰB·ɼ0 h'fp/%'(d))-/M Y#O$%%-/11437:{AMOP/QQSFUW=ZaJpqs|퀴ևPԛ_Z@Cڰ@a.8%d-~K'(b))+ / Z#P$%%-X0 11447:|AMOP0QQSGUW>ZaKpqs|ׇQ՛`[AD۰Ab/9&e .L'(c))+ /K|IEO lx1 5"#$(+-C0496 9;>CF1IKXLNPPR#VZZ[L\8]*^c0d4eQfggthjlmPnnop[qXrsttuvw^xyy|@}}a~DW(ZU1 ZZ[X\D]Vb:cEdIeff|ghl^nnooiqfrsYstuvvlxyyRzz[{{||K}]}},(1 pzP$czC#'+/=DOh $+26=CGNRahov !0>Rf (7NUY]au!.5AELSZ^elpw~    # ' / 7 ; C K O W _ c k s {    ( 0 4 < D H P T \ d l t |  " 5 : R W q v z    ' 7 < D H P X ^ d j p w ~     # ) / 5 ; A G M S Y _ e k q w } $+29@GNU\cjqx+4#~zzzS v{y` 8Z>Z [[[[\\\{]]]|bpctdefghhmmmn#o pppqrsss"uvww wxOy"||k}}߀;=&~#e DZ[[\]bucydefgh#mn(oopqrEss'u$vv%wxTyy'||W}q}}@-KNT"DG+,M-P/@(!C)*F1#35$L7&9;'R= HZZ$crate::panic::panic_2015,`panic_internals[Z`jl7 -$crate::assert_eq2[] ]`jG1P;]`j̄h-dLy$crate::panic::unreachable_2015pն`[Z`juooH Z`jCϾ5KL*O_core_intrinsics`j̲שZ`jkZi;[]L`j-he,;}Vderive_clone_copy_internals`j&6amZ`j&mHˆ\matchesߢ:{] `j̕5p&D[]<`j<7 ;[Z`jZ&Z`j))[Z`j̿ć Z`jP\%p[Z`jnT]Q15+`j:|7(Z`jZ6fe,*5`j+&5[]`j_G-zq,5} fmt_helpers_for_derivegg`j}X~!NZ`jXVS>[]`j\ pG[Z`j?4hUZ`j#-cE p[Z`jKl'OG[]\`j{LLp% [Z`j̳iT1~/xZ`jAձKZZ `jZ`*p/[Z`jV?\Z`j̛ *&9`ǰט\Z`j-.Pb _N%]generic_assert_internals`j $kq,*gg`ja,7 8[]Q`j% `.~*ei_derive_eq_internals`j̫Y` Z`jaZم%pv[Z`j[]уA[]/`jηG$crate::assert_ne c]]`j`q\?ZZ`j́9n p"N[Z`j~P%1     debug_assert_eq[]`jR&L_tŚ]`jD^ot4`jOtܸ`jZIt`jwY'w ]`j-^t`j̷[!=Z`j7Wk ;`js`j@~B`j 1XhEt`j̡1F(K`j%VELdebug_assert_neb]`j[%ՏIt`jn%/a`j􉊒vt`ǰ! V`j6;xC&}`jNuU+#kt{`jjڤ,VvS'_+wf[rg~k3;Z?^GbOjsn{zWc/o7CK#;qd 2A|L 5 sN}k/rIv! b?=~X t$%OR>[ ac{% T 1"l-dn?FH/vb +m9<f4ODHT a+dtKs)O<vv$<@ؓ{P! :3 vޟ= [4O $G= ;hKjl h\`xV ]:ı8e2WJ{-)I 9`"0G:R&^?oHJl; @m4\_)<$,dN$6L&M 3 xä]<z2^"B??nSEE7&FOfT%-}!P>[l }%`MR]+Ts+̣W-hW\ [o0[hsh0cn5vLF/l5f7BC_8@UT:O/SR;@tC<K%>_Ft?Yz%FJ6JJ7MKny&%MZ'j,M% Oud[IKP LR2y-;ETDIVZePʫ5 ÆrD~vE% ?^'iV4s*h#vrZ+k5YvK~+qd5-"S;yƔ\_碤\YЪҐY`AΤÚ9-Sc8HFHއnc`(j{UUvO:jJCUwTEݞK`.t/z߈ iMQඈ6dP&15' uLVN.8pvi z:UzJZ/bl=4:r]Kp 8K^8I뾯$ GmLi<4WG}ҝBM"RYIC),ƇBbpih2%e%$T +A!7⭇RْDhPN'CxBHj>1v.Ь0 %;kb}RJn }<m 'MEW kTR% y>  6!I# t;hLQ!κ]"or(a_H,ypS\'Xhc]#?l5o UmmMz@&!Omr!lPf! ʊ:$v#^$gxu j%W#U%ysM7A({}'N+K9 q+5aׁ-+cyG.A/8x܃g0xGu.vyW,ORAz,3cIء`4en5a. p.6mu@n9{9+=skqZ=k/ E?gh&nM?~w2A۝ К~A4??%^Dmg/TnE?mHAE O <2Oey=:SI!nTO%lJ?U8rBQmXXGѽYOŘ %ZmQ[僪qw]ERM^_~Iucs* h`dUIcw2nf:}VWMgmڄ'\iu%17jjA<rjٻ_\~nR_BpWp\LqA@)~rV(_/s9rU[seC'%EuG.x!7pe({8Wu|f {،NE/VCPA/ 1#ֶP3+dk46Yu<'WO1"I*~^מå*#CW1*~ hK_QZ3ZGQ=1(vUQr'{)hu{=//̏E+"{aE?861АwJt"+,2*\S/1۞)'i6(9%1#!W%V)s%MO 4%ڥ#WY2PHV !@.ajMR?*1ɒz6>|âLhǬTmDjAWLlF4iϺ+o>іoJ )4wo s F>#~dSɋ Z/}mT V.̧.U p.@`j,gHS,1ۦϵ'0~:qyCי(mJH9;@%55XXiOUJŘ[uy}Z&8|vgAcߖɕe!,X8GatB>{e![,_j/#ˆ 9|a7*];X O@4T]OOi|Ys$u/2Va! 3?L)I.QV&?iNuK=sn< 2 tD~ /#N@Ge4Lj 6#=/q^?" NN7cVL 49o`x7x#[@/\J~pe.1Y/Ev*rMA _'bO,j6U9 n\)xEiM#f**%k WLy]h R6+&,JgCdfE] < U; $ n6VviE}3zt_b_9lL6A& ;>BC)8g+A2I{HWNkdua|P(t{P==r0Ben`'CL@Z5AAT[ Q`+?_hpk@#2A6efS^WDT-l;d`0|YgA];X O@4T]Q/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/slab-0.4.12/src/lib.rsF/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/slab-0.4.12Q/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/slab-0.4.12/src/lib.rs !BfԙO^v  # On3QFOG"PPELN,MMM-! &&&&&PP )& &(MIR .'4 KNJOGMPOMQQJMLQ&<  5"25'7H'+ .2!';;:/,?FRY "2,L )& &( <759 + <<#%'JN + !! CKFQOB= 0M#6 4 73 M 7) & LOQQPLO4? $( 36 E(LQRPQ OK<? $ ( 96 E.WM'SXRQ 0 ? L 0 ? &JCKG-B ?".JLD)POEO1 &L6)(;B# KJ*F:#'+ _WROOIIME 0".8 ? ? 1""49 / 0U%# /!$?(2 ' $*:4APQD_)FR\E-821MB% *,+& $ " , $ # !A $"# %*NIJ; $ (444+ (6 =NIJ; $##, ## 3: GH $(3) 2&5 OH $(/(- >*B L#QQQD $##C### WD(+D+( !::% <J -4E93*%I 5.<73:$CF:R,_Q< Q')N$70' $"5 ;1-! N,?0' $"3 # G51! LPA0+2 $##O### `&-"")Z! 0B,L4O $4 - P $"- 9@7A>AP@@GNU8slab-a4a8269ffb724f29.slab.ccffedcfc7866a60-cgu.0.rcgu.orust-end-file.note.gnu.property.rmeta-link.shstrtab.strtab.symtab@ `H2* :/0 0 0 0 644 5856 ` ELF>@@H8Ht$H|$(Ht$0HD$HtHD$Ht0 HHD$HD$ ,HHD$HD$ HHD$HD$ HT$H|$Ht$ $H8an index is vacantan index is out of boundsthere were overlapping indices%9Im (.@n: ; I?: ; I 4: ; I $>  2  3 I8 4   I8 /I I8 2  2 I3 I3 I!I" 7 $ > CW¼(¡0®      B BB k  /J   =,clang LLVM (rustc version 1.98.1 (48a229cea 2026-09-01))/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/slab-0.4.12/src/lib.rs/@/slab.ccffedcfc7866a60-cgu.0/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/slab-0.4.12slabu8IndexVacantIndexOutOfBoundsOverlappingIndicesGetDisjointMutError{impl#2}_RNvXs0_CshBcWi0bn7s2_4slabNtB5_19GetDisjointMutErrorNtNtCsgxBkk5gSRhY_4core3fmt7Display3fmtfmtcoreresultOk()TErrorE__0ErrResult<(), core::fmt::Error>self&slab::GetDisjointMutErrorfoptionsflagsu32widthu16precisionFormattingOptionsbufpointerdyn core::fmt::Writevtableusize__ARRAY_SIZE_TYPE__&[usize; 6]&mut dyn core::fmt::WriteFormatter&mut core::fmt::Formattermsgdata_ptrlength&strrustc version 1.98.1 (48a229cea 2026-09-01)zRx D@mB@^y" srclib.rs  /~JX1/6gPJ8/~JX g .  )6Md    9  + 4 (; A G N <Sa Ee s  {            ! * / > C K S  _ Al /t   %     !  E b M  i o  ' 2   /.debug_abbrev.text.comment.rela.text._RNvXs0_CshBcWi0bn7s2_4slabNtB5_19GetDisjointMutErrorNtNtCsgxBkk5gSRhY_4core3fmt7Display3fmt_RNvXsi_NtCsgxBkk5gSRhY_4core3fmteNtB5_7Display3fmt.rela.debug_aranges.debug_str.rela.debug_info.note.GNU-stack.rela.debug_line.rela.eh_frame.strtab.symtab.rodata..Lanon.d08e22104cfea75d905f3e92bd702a61.2.rodata..Lanon.d08e22104cfea75d905f3e92bd702a61.1slab.ccffedcfc7866a60-cgu.0.rodata..Lanon.d08e22104cfea75d905f3e92bd702a61.0@#@@ `\*(CG@ X 0@`0 00-p8 @}@"