rust? rustc 1.48.0std؝-6bf3f16f340782cacoreƞ-3375e4f89d420e7acompiler_builtins-f74b197469e67088rustc_std_workspace_core扪ڹ8-5e0675f526ef5c6ballocץޯČ-1ebf406bd4ea5769libcɄ-dfbef8c525de0186unwindܽ݇!-bd645b20c6c7b56dcfg_ifшC-b9e1e523c0c29a77 hashbrownǰ-c6632ca171f954ddrustc_std_workspace_allocW-b5bfd0198c7b740drustc_demangleة-3ac2d0878c297d42 addr2lineƄ-12740563628e601fgimlin-0ac82a1e1820dd21object»-af517d7f13e7c960 miniz_oxide֕㵤 -a2ba33c985785afeadler˯-3f6e9f8f4afbea6d panic_unwindի-13f3099d50c21bc6׮\onIBa@3ϙ-<:~std!֯R -NZUHGAG,^M 3hn$oe| LHc,5b]U`Z^TlwaCZ HammingResultQ|ձohammingBҲy*jQ?jaro_ҁ҇*EQ  jaro_winklerX"BT;. (.qu劺R levenshteinJV,`8normalized_levenshteinuxO:n osa_distanceAtwա#4damerau_levenshteinn*normalized_damerau_levenshteinaDpgٔ ZMC StrSimErrorV !dZ.CYDifferentLengthArgs5gӴit:'Le)Ʀ!/)^K2;ԎW31.#E` #equdũe`kD^pfmtAs1G3?jNPm䬠HCɄ,>XnҤ$R)60_rxx_'^ݥ *X_IU^W&#j&iU۳y}Z 3stdcharA< maxV Vmin[ [HashMapw4e`3 This library implements string similarity metrics.6  4ab 1K Calculates the number of positions in the two strings where the charactersN@ differ. Returns an error if the strings have different lengths.C ``` use strsim::hamming;& match hamming("hamming", "hammers") {)- Ok(distance) => assert_eq!(3, distance),0$ Err(why) => panic!("{:?}", why)' } ```    a b   $G Calculates the Jaro similarity between two strings. The returned valueJ: is between 0.0 and 1.0 (higher value means more similar).= ``` use strsim::jaro;J assert!((0.392 - jaro("Friedrich Nietzsche", "Jean-Paul Sartre")).abs() <M 0.001);  ```   $         $   $ a_charb_char$ ab ,B Like Jaro but gives a boost to strings that have a common prefix.E ``` use strsim::jaro_winkler;G assert!((0.911 - jaro_winkler("cheeseburger", "cheese fries")).abs() <J 0.001); ```  ab -J Calculates the minimum number of insertions, deletions, and substitutionsM. required to change one string into the other.1 ``` use strsim::levenshtein;1 assert_eq!(3, levenshtein("kitten", "sitting"));4 ``` (a(b( (6K Calculates a normalized score of the Levenshtein algorithm between 0.0 and#N; 1.0 (inclusive), where 1.0 means the strings are the same.$>% ```%$ use strsim::normalized_levenshtein;%'%R assert!((normalized_levenshtein("kitten", "sitting") - 0.57142).abs() < 0.00001);%UA assert!((normalized_levenshtein("", "") - 1.0).abs() < 0.00001);&D? assert!(normalized_levenshtein("", "second").abs() < 0.00001);&B> assert!(normalized_levenshtein("first", "").abs() < 0.00001);'AM assert!((normalized_levenshtein("string", "string") - 1.0).abs() < 0.00001);'P ```( (+ a+b+ +.L Like Levenshtein but allows for adjacent transpositions. Each substring can*O only be edited once.** ```* use strsim::osa_distance;*+* assert_eq!(3, osa_distance("ab", "bca"));+- ```+ +9a:b: 95I Like optimal string alignment, but substrings can be edited an unlimited7L4 number of times, and the triangle inequality holds.878 ```8! use strsim::damerau_levenshtein;8$91 assert_eq!(2, damerau_levenshtein("ab", "bca"));94 ```9 :LaMbM L>M Calculates a normalized score of the Damerau–Levenshtein algorithm betweenGPC 0.0 and 1.0 (inclusive), where 1.0 means the strings are the same.HFH ```H, use strsim::normalized_damerau_levenshtein;I/Ic assert!((normalized_damerau_levenshtein("levenshtein", "löwenbräu") - 0.27272).abs() < 0.00001);IfI assert!((normalized_damerau_levenshtein("", "") - 1.0).abs() < 0.00001);JLG assert!(normalized_damerau_levenshtein("", "flower").abs() < 0.00001);JJE assert!(normalized_damerau_levenshtein("tree", "").abs() < 0.00001);KH] assert!((normalized_damerau_levenshtein("sunglasses", "sunglasses") - 1.0).abs() < 0.00001);K` ```L M 0   automatically_derived    allow     unused_qualifications   self other   inline             2 self other  automatically_derived allow  unused_qualifications3selff 1 29 j j 09ZuF%; l k 2";\wH'< m l 3#<]zK*"S Apo  A r q  8 (AP/(A O u q v)FbtS y zx]   +]   +Hd# h 1Pl) R +?Sg>_*>Ui /CWy.Ow.EYqD#DD )#E#E E#E#EEEE#EE# EE EEE 66777DDDD%    G4GGGG GGGGHG* $#$ G   bI G G  G   GI  J I I G I  I G   I I GH  IG  G  J  GEE)% H $ K G4G'L#LJLH$H#H I IK  MHLK H#I I I G   H   I G  I H    G I I  G I  I  G  H    G H G HG G G  G   H    H G I G I    H G I G I H G  I   G H  G   G G  H I G  I  G IH I I I H G  I   I G G G G G G G G   G G   G B7GGGGG44V544V&&&)E)DD*LK)E))DL)LH)L)LK)K)KLL)E# EEFFF)D L"D#EDDHHIHHHHHHHHHHIHHHHHIH >G>>?>>G>>>G>G>>6GG====H==H=7G77666H66Y6H66,@G \,,),, G, G3,\,\, G\,,.]\.]\. /G].]//]\/]\\LG \\/ I\\LG \\ ]J\]\E\\] G\ #H###$$$HM#H####%L%D$#H##########H###H#######$$HLLG^LG^_HLLHLLLLLHLHLLLLLHLLLLLHLLHLLLLLHLLLLLLLHLLLHLLLLLHLLHLLL(U(L( A(L(D( I( I(D$$%%%H%$$$$H--\--]--]-]--    $$H$4V4V6GG00^\0^\0G]0\0]0]\0I]0]\0\\0\0]\0\0]\00^\0I]0]\0]]0^\0\0 I6G66H66666HLHLLL$H$$$%D%L%LLL$$$H@G\%D%L$$H$H$%L%D MM JJEEE JJ MMڃG I JJ MM$D$L I L IG"D MM JJ G G G K   G G Gqq GHKK G VI aI ZI \I _I XI ]I YI JI oI I IK IK IKK IKH H J G zI lI I mI I kI sI I Gqq I Gqr I tI IK IK IKM I IK pI yI I xI I Icratecorecrate coreDebugxCcore_intrinsics3prelude_import PartialEq 7?core_intrinsicsstructural_match  derive0j:::v:::>;::R/home/seth/.cargo/registry/src/github.com-1ecc6299db9ec823/strsim-0.8.0/src/lib.rserɒ(d eN75OD*1(4C (<.? K>N'##M%@44 "/("):# 3G & '+#  22?FK/$3")K# N& N250##$$8/3=,#G  O?(VECBQ9&YP.1##))LHH%%$ /#3=?GH5@CL" 84M8%5822$$=&$,!,!:"7.2<:9I2=:9A )$QG0gMKIaA&a   :1  .:1  .:1  "1:1  "*$O  @;1  & + / / LL D #) !8 !8 &B (C 5C #/ $; %7 G "QQ #LL +1 .J 0K =K $O #N &H )CL , B "9 'B &77 #BD+ #3 $2 -Z 4I .G /F 4[ - ; $4 %4 2 #: &: '88 ,= 5= '; ,E $BD, 09 *; (9 %4 $B +; ,; $9 *A -A .?? 3D