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

Cache the costs for the rest of the graph at each vertex.

Browse Source
This commit is contained in:
Rob Rix 2015-10-06 13:33:38 -04:00
parent 6c8ce1bcb2
commit e178745c56
1 changed files with 4 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
prototype/Doubt/Algorithm.swift
View File

@ -191,14 +191,15 @@ public func SES<A>(a: [Fix<A>], _ b: [Fix<A>], equals: (A, A) -> Bool, recur: (F
let diff = recur(a[i], b[j])
if let right = right, down = down, diagonal = diagonal {
let costs = (right: costOfStream(right), down: costOfStream(down), diagonal: costOfStream(diagonal))
// nominate the best edge to continue along
let best: Memo<Stream<(Diff, Int)>>
if costOfStream(diagonal) < costOfStream(down) {
best = costOfStream(diagonal) < costOfStream(right)
if costs.diagonal < costs.down {
best = costs.diagonal < costs.right
? diagonal
: right
} else {
best = costOfStream(down) < costOfStream(right)
best = costs.down < costs.right
? down
: right
}