push_screen_rust/target/x86_64-pc-windows-gnu/release/deps/libequivalent-a1f4d634e2122c1b.rlib

!<arch>
/               0           0     0     0       8         `
//                                              70        `
equivalent-a1f4d634e2122c1b.equivalent.73cd0b7fc5ff127b-cgu.0.rcgu.o/
lib.rmeta/      0           0     0     644     8064      `
d<EFBFBD>j.rmeta.<rust
<EFBFBD>Brustc 1.91.1 (ed61e7d7e 2025-11-07) (Rev1, Built by MSYS2 project)<29><02>0<>#`a<><61>i<EFBFBD>+<2B>F<EFBFBD>T8<-0a5677bcdbf6ca93<39><02>1<>-<2D>3<EFBFBD><33>%<25>:<3A><>R<>-0a51333fad0e7ace<63><01><02>
Equivalent<EFBFBD>K<>
equivalent<EFBFBD>Q<><01><01>
Comparable<EFBFBD><01>compare<72><01><01><01>88888888<01><01><01><01>d<>4<>
<01><01><01><1C>D<><01><>!l<>
<01><01><01>$<24>S-<04><01><>W$<24><06>,<2C><06><1C><00><0F>key<65>"Q<00><0F><00><0F>d<>4<><01><1C>D<><01><>D<>
<01><01>$<24>F)<04><01><>S<01><><01><><01><>Less<73><01><><01><><01><><02><01><><01><><01><>Greater<65><01><><00>#8<>Ҝ<EFBFBD><D29C>D<><00>,<2C><00><1C><00><0F><01><0F><00><00><0F><02>g4<67><01><02>D<><01><><04><00><00>LI [`Equivalent`] and [`Comparable`] are traits for key comparison in maps.<2E>M<02><00>QMJ These may be used in the implementation of maps where the lookup type `Q`<60><00><>2/ may be different than the stored key type `K`.<2E><1C><02><00><>LI * `Q: Equivalent<K>` checks for equality, similar to the `HashMap<K, V>`<60><00><>'$   constraint `K: Borrow<Q>, Q: Eq`.<2E><00><>MJ * `Q: Comparable<K>` checks the ordering, similar to the `BTreeMap<K, V>`<60><00><>(%   constraint `K: Borrow<Q>, Q: Ord`.<2E><1C><02><00><>OL These traits are not used by the maps in the standard library, but they may<61><00><>JG add more flexibility in third-party map implementations, especially in<69><00><>KH situations where a strict `K: Borrow<Q>` relationship is not available.<2E><1C><02>t<> # Examples<65><1C><02><<3C> ```<60><00><> use equivalent::*;<3B><00><> use std::cmp::Ordering;<3B><1C><02><00><>(% pub struct Pair<A, B>(pub A, pub B);<3B><1C><02><00><>RO impl<'a, A: ?Sized, B: ?Sized, C, D> Equivalent<(C, D)> for Pair<&'a A, &'a B><3E>L<> where<72>̍     A: Equivalent<C>,<2C>̧     B: Equivalent<D>,<2C>,<2C> {<7B><00><>41     fn equivalent(&self, key: &(C, D)) -> bool {<7B><00><>B?         self.0.equivalent(&key.0) && self.1.equivalent(&key.1)<29>L<>     }<7D>,<2C> }<7D><1C><02><00><>RO impl<'a, A: ?Sized, B: ?Sized, C, D> Comparable<(C, D)> for Pair<&'a A, &'a B><3E>L<>	<01>̰	     A: Comparable<C>,<2C><00><>	     B: Comparable<D>,<2C>,<2C>	<01><00><>	52     fn compare(&self, key: &(C, D)) -> Ordering {<7B><00><>
*'         match self.0.compare(&key.0) {<7B><00><>
:7             Ordering::Equal => self.1.compare(&key.1),<2C><00><>'$             not_equal => not_equal,<2C>l<>
         }<7D>L<><01>,<2C><01><1C><02>|<7C> fn main() {<7B><00><>=:     let key = (String::from("foo"), String::from("bar"));<3B><00><>$!     let q1 = Pair("foo", "bar");<3B><00><>$!     let q2 = Pair("boo", "bar");<3B><00><>$!     let q3 = Pair("foo", "baz");<3B><1C>
<02><00><>
%"     assert!(q1.equivalent(&key));<3B><00><>
&#     assert!(!q2.equivalent(&key));<3B><00><>
&#     assert!(!q3.equivalent(&key));<3B><1C><02><00><>63     assert_eq!(q1.compare(&key), Ordering::Equal);<3B><00><>52     assert_eq!(q2.compare(&key), Ordering::Less);<3B><00><>85     assert_eq!(q3.compare(&key), Ordering::Greater);<3B>,<2C><01><<3C><01><02><13>g<13><01><02><13><01><><04><><13><03><><13><03><><00><> Key equivalence trait.<2E><1C><02><00><>LI This trait allows hash table lookup to be customized. It has one blanket<65><00><>NK implementation that uses the regular solution with `Borrow` and `Eq`, just<73><00><>NK like `HashMap` does, so that you can pass `&str` to lookup into a map with<74><00><> `String` keys and so on.<2E><1C><02>t<> # Contract<63><1C><02><00><>>; The implementor **must** hash like `K`, if it is hashable.<2E>T<><01><01><><00><><12><01><><01><0C><00><>&<00><>>; Compare self to `key` and return `true` if they are equal.<2E>T<EFBFBD><13> <14><0C>
<01> <01>$<24><01><1C><00><>Q<01>	<01>
	
<01><><01><0C><00> <0C><01><01><14><01><01><01>L<><00>79=?<00><>%T<><15><16><0C>
<01><01>$<24><01>3<02><>.<00><> Key ordering trait.<2E><1C><02><00><>MJ This trait allows ordered map lookup to be customized. It has one blanket<65><00><>OL implementation that uses the regular solution with `Borrow` and `Ord`, just<73><00><>OL like `BTreeMap` does, so that you can pass `&str` to lookup into a map with<74><00><><01>T<><01>

<00> <20><><17><01> <01>l<><00> <0C><00>&<00>&"$&<00><>'<00><>41 Compare self to `key` and return their ordering.<2E><<3C><17> <18><00><0C>
<01> <01>$<24><01><1C><00><>R<01><01><00>"<0C><00> <0C><01><01><1C><00>"L<><00>,.24<00><>&<<3C><19><1A><00><0C>
<01><01>$<24><01>[><13><0C><13>_<13><0C><13><13><0C><13>G<13><0C><13><01><01><01><01><01><01>{<12><><0B>s<EFBFBD><73>K8v<38><76>IN<49>,N<07>1iG<69>x<EFBFBD>eO<65><1C>"؞0<D89E><30><EFBFBD>4yS[<5B><>	<09><><EFBFBD><EFBFBD><11>,<08>F<0B><><EFBFBD>a<EFBFBD><61><EFBFBD>G<>]e><3E><1C><><EFBFBD>S<EFBFBD>OB<4F><42>A<EFBFBD><41><EFBFBD><EFBFBD><EFBFBD><EFBFBD>[<5B><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>nX<6E>zˍ<7A><CB8D>,<2C>3}͡<>e<EFBFBD><65><EFBFBD>r<EFBFBD><72>}<7D><>XP<>mY<6D><59>]<5D><1D>u><3E><><7F><7F><<3C>C<>e<><65>O<EFBFBD><0B>O<EFBFBD>."J̰<04>4<EFBFBD>wd<77><64>E<EFBFBD>ҋMN<4D><4E><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>b<0C><><EFBFBD>Tzmn9<6E>><3E>r<EFBFBD>?<3F>z<EFBFBD><7A><EFBFBD>+<2B><><00><00>B
<01><<00>

<00>x<00>c<13>/@
<00><00><00>?
]%<11>iB<14>w
{
}
<0A>
<0A>
<0A><0F>s<10><10><10>^<13>*<14><14><14><14><14><14><14><14>y
<00>
<0A>
Y<0F><00><10><10><10>	V/<14><14><14><14><14><14><14><14>}<0F>V<10><10><10>B<11><13><13>'t^<0F>Jz<10><10>6<11><13><13>!hZ<10>F<00>x&jC(lEZ3r<00><00><00><10>)<00>vt<00>u<00>dP<00><00><00><00>=
Wx<00><00><13><00><00><00><00><00><00><00><00><00><00><00>'+29@FLRX^dj<00><00><00><00><03><00><00><13><13><13><13><02>{<12><><0B>s<EFBFBD><73>m<>i<><02>ws{<1A><1A><1A><1A>ODHT  <02><>iG<69>x<EFBFBD>eO<65><00>z<EFBFBD><7A><EFBFBD>+<2B><><08>F<0B><><EFBFBD>a	<09><><EFBFBD><EFBFBD><11>,<00><><EFBFBD>G<>]eN<>,N<07>1C<>e<><65>O<00><7F><7F><<3C>><3E><1C><><EFBFBD>S	<00>3}͡<>e<00><><EFBFBD><EFBFBD><EFBFBD>[<5B><00>OB<4F><42>A<EFBFBD>
<00>zˍ<7A><CB8D>,
<00>XP<>mY<6D><00>]<5D><1D>u><3E><00><>4yS[<5B><>̰<04>4<EFBFBD>wd<><64>E<EFBFBD>ҋM<00><>K8v<38><76>I<00><0B>O<EFBFBD>."J<1C>"؞0<D89E>N<><4E><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>b<0C><><EFBFBD>Tzmn9<6E>><3E>r<EFBFBD>?<00><><EFBFBD>r<EFBFBD><72>}<7D><00><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>nX{<12><><0B>sop<6F><70><EFBFBD>02'<27>q)2\@vZW;&$%IV6<1F>G,9op<6F><70><EFBFBD>02'<27>q)2\@^C:\Users\dxzq\.cargo\registry\src\index.crates.io-1949cf8c6b5b557f\equivalent-1.0.2\src\lib.rs<72> s<>+^<5E><12>FS<46><53>>~<7E><00>qMN3M(N)PKL)S
5C
S
6+;(
>%%%&''769MOO?"C+/,*NPP19,/-%<00>E$<24><1B>
<EFBFBD>~ֽ<><D6BD>g~<7E><00>x86_64-pc-windows-gnu<6E>'<27>;<3B><>`<60>_<EFBFBD><5F><EFBFBD>MX<4D><58><EFBFBD><01>-a1f4d634e2122c1b<31>{<12><><0B>s<02>:R<02>$<00>&<00>

''
9'0&66&&&9&& $&&&9
 6&9w<01>rust-end-file@feat.00<00><>/0              0           0     0     644     1980      `
BC<EFBFBD><EFBFBD>5b0$JY<4A><59>]<5D><><EFBFBD>Q<>L!<00>!"<07>#<23>A<EFBFBD>I29<32><01>%<04>b<EFBFBD>EB<>BD28K
2"<22>H<EFBFBD>d!C<><43>G2B$q<>$)@<40><>K2d<32><08> #B<><42>B*(*<2A>Q\ #<23>@<40><19><07>"<22><>$2b,9Ȑ#<23><12>:dDG<44>"CF<00> 	"f<10>B<EFBFBD><42>RB<52><42><EFBFBD>q<EFBFBD>PH
	&B<>B"&<08><><EFBFBD>90*|<7C>;<3B>;<3B><>6<EFBFBD><36>qh<71>{Hw <20>w<EFBFBD><77>yh<79>sp<73>z<EFBFBD><7A>
<EFBFBD><EFBFBD><06><><07><><06> wz0r<>s mrpq<>s z0r<><06> w z`t<>v@m<>v@z`t<><06>r<>zr<>m`xzr<>m<>x<>q`z0r<>v@m0q x<><11><>0<0C><>z<EFBFBD>f<><66>t<EFBFBD>m6&<26><>7<EFBFBD><37>f6<66>d7qk|<7C><>`<04><>d<>2<1E>L<><4C>	&G<>C<> <20><00><00>3<08><1C><>f=<3D>C8<43>ÌB<C38C>yxs<>q<0C><0F><0E><>3B<1E><>Ρf0=<3D>C8<43><38><1B>=<3D>C=<3D>=<3D>x<EFBFBD>tp{yH<79>ppzpvx<76>p <20><19><0E><><0E>0n0<0F><><0E>P3<10><1D>!<1C>!<1D>af0<66>;<3B><>;<3B>C9<43><<3C><><<3C>;<3B><>v`{h7h<37>rh7<><37>p<EFBFBD><70>p`v(v<>vx<76>w<EFBFBD><77>_<08>q<18>r<EFBFBD><72>y<EFBFBD><79>,<2C><><0E><><0E><><0E>0bȡ<1C><>̡<1C><><1C>a<1C>!ā<1D>a֐C9<43>C9<43>C9<43>C9<43><39>8<EFBFBD>C8<43>;<3B><>/<2F><><<3C><>;<3B>;<3B><><0C>i<EFBFBD>pX<70>rp<72>thx`<60>t<18>t<EFBFBD><74><19>S<0F><0F>P<0E><><0E>@<0F> <0E>P3 (<1D><><1E>A<1E>!܁<1E><><1C><><1D>fQ8<51>C:<3A><>;<3B>P$v`{h7`<60>wxx<>QL<51><4C><0F>P3j<1E>a<1C>!<1D><>~<1E><><1C>!<1D>aT<><54>8<EFBFBD><38>;<3B>C=<3D>C9<43><39><<3C>C;<3B><>;<3B>Ì<EFBFBD>
<EFBFBD>y<EFBFBD><EFBFBD>w<18>tz(r<><72>\<5C><0E><><0E>P<0E>0#<23><>A<1E><><17><><1D>fH;<3B><>=<3D><><1B><>8<EFBFBD>C9<43><39><<3C><>9<EFBFBD><39>;<3B><<3C>H<EFBFBD>qv`q<08>qX<71><19><><0E>`<0F><><06> <0F>0<0F> <0F>Pn<0E>0<0E>0<0F><><06><><0E>P<0E>0#<23><>a<1D><><17>!<1D>!<1D>!<1D>!<1D>!f <20>;<3B>C=<3D>9<><39>9<EFBFBD>X<EFBFBD>ppwxzzH<7A>wp<77><19><><0E>0<0F><><0E>@<0F><><0F>0<EFBFBD>s<>w<18>_<EFBFBD><5F>pp<70>t<EFBFBD><74>tЇr<D087><72><EFBFBD>A9<41><39>8<EFBFBD>C=<3D>C9<43>@Ġʡ<1D>A<1E><>f$c0<0E><><0E>0<0F>@<0F>0C!<21>usH<73>_<EFBFBD><5F>|<7C><>r<EFBFBD><72><EFBFBD><<3C><><<3C><>8<EFBFBD>C:<3A><>;<3B>Ì<EFBFBD>H!Ba<1E>!<1D><>R<>fLg0<0E> <0F><><06>P<0F>0<0F>@<0E><><06> <0F><><0E>0<EFBFBD>@<40>vhy<08>R<1A><>;<3B>;<3B>C8̃<1B>9<><39><<3C><<3C><>8<EFBFBD>y .<00>H C<>	dd<64><64> <20><>2FFF<13>B<EFBFBD><42><EFBFBD><EFBFBD><EFBFBD>9B<39><42><EFBFBD>@<40><00>*PIC Levelrustc version 1.91.1 (ed61e7d7e 2025-11-07) (Rev1, Built by MSYS2 project)#0<>3C@<40>2<12><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>\<5C><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>\<5C><><EFBFBD><EFBFBD><EFBFBD>F	<09>T<EFBFBD><54><EFBFBD><EFBFBD>\<5C><><EFBFBD><EFBFBD><EFBFBD>F	
<00>-
r(<28>w<EFBFBD>zXp<58>C=<3D><>8<EFBFBD>C9<43>Â<EFBFBD>ơ
<0A>A<1E><><1D>!<1D>!<1D><>4<>`<0E>P<0F> <0F>@<0F> <0F>P<0E><><EFBFBD><EFBFBD>y(<28>p`vx<76>qz(rXp<58><70>8<EFBFBD>;<3B><>=<3D><>k<1C>!<1C><><1C> <1C>a<1C> <1C><><1E>aС<1C>a<1D>a<EFBFBD><0F> <0F>P<0F><><0B>usH<73><05>8<EFBFBD><38>;<3B>C9<43><39>9<EFBFBD><39>;<3B>C9<43>=<3D>;<00><07><<3C><>;<3B>;<3B>=<3D><><<3C>C8<43><38><00> <00><04>Pq 2"<00><>3<EFBFBD><33>:`<60>&<26>8<EFBFBD>E$<24>7<EFBFBD><37><EFBFBD><EFBFBD>͘<EFBFBD>e<03><>/LXXX/D!eX]<03><>21.1.5 9d6fa8947717509929b0a1e24a2234495514302bx86_64-pc-windows-gnuequivalent.73cd0b7fc5ff127b-cgu.0