PNG  IHDR pHYs   OiCCPPhotoshop ICC profilexڝSgTS=BKKoR RB&*! J!QEEȠQ, !{kּ> H3Q5 B.@ $pd!s#~<<+"x M0B\t8K@zB@F&S`cbP-`'{[! eDh;VEX0fK9-0IWfH  0Q){`##xFW<+*x<$9E[-qWW.(I+6aa@.y24x6_-"bbϫp@t~,/;m%h^ uf@Wp~<5j>{-]cK'Xto(hw?G%fIq^D$.Tʳ?D*A, `6B$BB dr`)B(Ͱ*`/@4Qhp.U=pa( Aa!ڈbX#!H$ ɈQ"K5H1RT UH=r9\F;2G1Q= C7F dt1r=6Ыhڏ>C03l0.B8, c˱" VcϱwE 6wB aAHXLXNH $4 7 Q'"K&b21XH,#/{C7$C2'ITFnR#,4H#dk9, +ȅ3![ b@qS(RjJ4e2AURݨT5ZBRQ4u9̓IKhhitݕNWGw Ljg(gwLӋT071oUX**| J&*/Tު UUT^S}FU3S ԖUPSSg;goT?~YYLOCQ_ cx,!k u5&|v*=9C3J3WRf?qtN (~))4L1e\kXHQG6EYAJ'\'GgSSݧ M=:.kDwn^Loy}/TmG X $ <5qo</QC]@Caaᄑ.ȽJtq]zۯ6iܟ4)Y3sCQ? 0k߬~OCOg#/c/Wװwa>>r><72Y_7ȷOo_C#dz%gA[z|!?:eAAA!h쐭!ΑiP~aa~ 'W?pX15wCsDDDޛg1O9-J5*>.j<74?.fYXXIlK9.*6nl {/]py.,:@LN8A*%w% yg"/6шC\*NH*Mz쑼5y$3,幄'L Lݛ:v m2=:1qB!Mggfvˬen/kY- BTZ(*geWf͉9+̳ې7ᒶKW-X潬j9(xoʿܔĹdff-[n ڴ VE/(ۻCɾUUMfeI?m]Nmq#׹=TR+Gw- 6 U#pDy  :v{vg/jBFS[b[O>zG499?rCd&ˮ/~јѡ򗓿m|x31^VwwO| (hSЧc3- cHRMz%u0`:o_F@8N ' p @8N@8}' p '#@8N@8N pQ9p!i~}|6-ӪG` VP.@*j>[ K^<֐Z]@8N'KQ<Q(`s" 'hgpKB`R@Dqj '  'P$a ( `D$Na L?u80e J,K˷NI'0eݷ(NI'؀ 2ipIIKp`:O'`ʤxB8Ѥx Ѥx $ $P6 :vRNb 'p,>NB 'P]-->P T+*^h& p '‰a ‰ (ĵt#u33;Nt̵'ޯ; [3W ~]0KH1q@8]O2]3*̧7# *p>us p _6]/}-4|t'|Smx= DoʾM×M_8!)6lq':l7!|4} '\ne t!=hnLn (~Dn\+‰_4k)0e@OhZ`F `.m1} 'vp{F`ON7Srx 'D˸nV`><;yMx!IS钦OM)Ե٥x 'DSD6bS8!" ODz#R >S8!7ّxEh0m$MIPHi$IvS8IN$I p$O8I,sk&I)$IN$Hi$I^Ah.p$MIN$IR8I·N "IF9Ah0m$MIN$IR8IN$I 3jIU;kO$ɳN$+ q.x* tEXtComment

Viewing File: /opt/go/pkg/mod/github.com/prometheus/alertmanager@v0.28.0/ui/app/src/Utils/Match.elm

module Utils.Match exposing (consecutiveChars, jaroWinkler)

import Char
import Utils.List exposing (zip)


{-|

    Adapted from https://blog.art-of-coding.eu/comparing-strings-with-metrics-in-haskell/

-}
jaro : String -> String -> Float
jaro s1 s2 =
    if s1 == s2 then
        1.0

    else
        let
            l1 =
                String.length s1

            l2 =
                String.length s2

            z2 =
                zip (List.range 1 l2) (String.toList s2)
                    |> List.map (Tuple.mapSecond Char.toCode)

            searchLength =
                -- A character must be within searchLength spaces of the
                -- character we are matching against in order to be considered
                -- a match.
                -- (//) is integer division, which removes the need to floor
                -- the result.
                (max l1 l2 // 2) - 1

            m =
                zip (List.range 1 l1) (String.toList s1)
                    |> List.map (Tuple.mapSecond Char.toCode)
                    |> List.concatMap (charMatch searchLength z2)

            ml =
                List.length m

            t =
                m
                    |> List.map (transposition z2 >> toFloat >> (*) 0.5)
                    |> List.sum

            ml1 =
                toFloat ml / toFloat l1

            ml2 =
                toFloat ml / toFloat l2

            mtm =
                (toFloat ml - t) / toFloat ml
        in
        if ml == 0 then
            0

        else
            (1 / 3) * (ml1 + ml2 + mtm)


winkler : String -> String -> Float -> Float
winkler s1 s2 jaro_ =
    if s1 == "" || s2 == "" then
        0.0

    else if s1 == s2 then
        1.0

    else
        let
            l =
                consecutiveChars s1 s2
                    |> String.length
                    |> toFloat

            p =
                0.25
        in
        jaro_ + ((l * p) * (1.0 - jaro_))


jaroWinkler : String -> String -> Float
jaroWinkler s1 s2 =
    if s1 == "" || s2 == "" then
        0.0

    else if s1 == s2 then
        1.0

    else
        jaro s1 s2
            |> winkler s1 s2


consecutiveChars : String -> String -> String
consecutiveChars s1 s2 =
    if s1 == "" || s2 == "" then
        ""

    else if s1 == s2 then
        s1

    else
        cp (String.toList s1) (String.toList s2) []
            |> String.fromList


cp : List Char -> List Char -> List Char -> List Char
cp l1 l2 acc =
    case ( l1, l2 ) of
        ( x :: xs, y :: ys ) ->
            if x == y then
                cp xs ys (acc ++ [ x ])

            else if List.length acc > 0 then
                -- If we have already found matches, we bail. We only want
                -- consecutive matches.
                acc

            else
                -- Go through every character in l1 until it matches the first
                -- character in l2, and then start counting from there.
                cp l1 ys acc

        _ ->
            acc


charMatch : Int -> List ( Int, Int ) -> ( Int, Int ) -> List ( Int, Int )
charMatch matchRange list ( p, q ) =
    list
        |> List.drop (p - matchRange - 1)
        |> List.take (p + matchRange)
        |> List.filter (Tuple.second >> (==) q)


transposition : List ( Int, Int ) -> ( Int, Int ) -> Int
transposition list ( p, q ) =
    list
        |> List.filter
            (\( x, y ) ->
                p /= x && q == y
            )
        |> List.length
Back to Directory=ceiIENDB`