github/semantic
1
1
Fork 0
mirror of https://github.com/github/semantic.git synced 2024-12-01 09:15:01 +03:00
Code Issues Projects Releases Wiki Activity

defaultM is an Int.

Browse Source
This commit is contained in:
Rob Rix 2017-10-24 12:23:07 -04:00
parent f9d5846ccd
commit 0ba1b354ad
1 changed files with 3 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
src/RWS.hs
View File

@ -102,9 +102,10 @@ mostSimilarMatching isEligible tree key = listToMaybe (sortOn approximateEditDis
where candidates = filter (uncurry isEligible) (snd <$> KdMap.kNearest tree defaultL (rhead (extract key)))
approximateEditDistance = editDistanceUpTo defaultM key . snd
defaultD, defaultL, defaultP, defaultQ, defaultMoveBound :: Int
defaultD, defaultL, defaultM, defaultP, defaultQ, defaultMoveBound :: Int
defaultD = 15
defaultL = 2
defaultM = 10
defaultP = 2
defaultQ = 3
defaultMoveBound = 0
@ -181,13 +182,9 @@ equalTerms canCompare = go
where go a b = canCompareTerms canCompare a b && liftEq go (termOut (unTerm a)) (termOut (unTerm b))
-- | How many nodes to consider for our constant-time approximation to tree edit distance.
defaultM :: Integer
defaultM = 10
-- | Return an edit distance as the sum of it's term sizes, given an cutoff and a syntax of terms 'f a'.
-- | Computes a constant-time approximation to the edit distance of a diff. This is done by comparing at most _m_ nodes, & assuming the rest are zero-cost.
editDistanceUpTo :: (GAlign syntax, Foldable syntax, Functor syntax) => Integer -> Term syntax ann1 -> Term syntax ann2 -> Int
editDistanceUpTo :: (GAlign syntax, Foldable syntax, Functor syntax) => Int -> Term syntax ann1 -> Term syntax ann2 -> Int
editDistanceUpTo m a b = diffCost m (approximateDiff a b)
where diffCost = flip . cata $ \ diff m -> case diff of
_ | m <= 0 -> 0