github/semantic
1
1
Fork 0
mirror of https://github.com/github/semantic.git synced 2025-01-04 13:34:31 +03:00
Code Issues Projects Releases Wiki Activity

Abbreviate the selection of the best outgoing edge.

Browse Source
This commit is contained in:
Rob Rix 2015-10-13 17:53:04 -04:00
parent 6cbe0a18d3
commit 10122d62da
1 changed files with 2 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
prototype/Doubt/SES.swift
View File

@ -57,18 +57,8 @@ public func SES<A>(a: [Fix<A>], _ b: [Fix<A>], equals: (A, A) -> Bool, recur: (F
let down = (down, Diff.Pure(Patch.Insert(b[j])), costOfStream(down))
let diagonal = recur(a[i], b[j]).map { (diagonal, $0, costOfStream(diagonal)) }
// nominate the best edge to continue along
if let diagonal = diagonal {
let (best, diff, _) = min(
diagonal,
right,
down) { $0.2 < $1.2 }
return cons(diff, rest: best)
} else {
let (best, diff, _) = min(
right,
down) { $0.2 < $1.2 }
return cons(diff, rest: best)
}
let (best, diff, _) = diagonal.map { min($0, right, down) { $0.2 < $1.2 } } ?? min(right, down) { $0.2 < $1.2 }
return cons(diff, rest: best)
}
// right extent of the edit graph; can only move down