mirror of
https://github.com/github/semantic.git
synced 2024-12-22 14:21:31 +03:00
Stub in the computation of the furthest d-path along k.
This commit is contained in:
parent
faa7096368
commit
8907ebbf8a
@ -33,7 +33,8 @@ decompose myers = case myers of
|
|||||||
|
|
||||||
MiddleSnake as bs -> do
|
MiddleSnake as bs -> do
|
||||||
for 0 ((m + n) `ceilDiv` 2) 1 $ \ d ->
|
for 0 ((m + n) `ceilDiv` 2) 1 $ \ d ->
|
||||||
for (negate d) d 2 $ \ _k ->
|
for (negate d) d 2 $ \ k -> do
|
||||||
|
Endpoint x y <- findDPath Forward (EditDistance d) (Diagonal k)
|
||||||
return ()
|
return ()
|
||||||
return (Snake (Endpoint 0 0) (Endpoint 0 0), EditDistance 0)
|
return (Snake (Endpoint 0 0) (Endpoint 0 0), EditDistance 0)
|
||||||
where ceilDiv = (uncurry (+) .) . divMod
|
where ceilDiv = (uncurry (+) .) . divMod
|
||||||
|
Loading…
Reference in New Issue
Block a user