github/semantic
1
1
Fork 0
mirror of https://github.com/github/semantic.git synced 2024-12-26 08:25:19 +03:00
Code Issues Projects Releases Wiki Activity

Use the patch constructors in recursive evaluation.

Browse Source
This commit is contained in:
Rob Rix 2015-10-15 11:21:23 -04:00
parent d74e4fb231
commit 0b916807a2
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
prototype/Doubt/Algorithm.swift
View File

@ -50,7 +50,7 @@ public enum Algorithm<Term: TermType, B> {
: recur($0, $1)
}
let recurOrReplace = {
recur($0, $1) ?? .Pure(.Replace($0, $1))
recur($0, $1) ?? .Replace($0, $1)
}
switch self {
case let .Pure(b):
@ -71,7 +71,7 @@ public enum Algorithm<Term: TermType, B> {
default:
// This must not call `recur` with `a` and `b`, as that would infinite loop if actually recursive.
return f(Diff.Pure(.Replace(a, b))).evaluate(equals, recur: recur)
return f(.Replace(a, b)).evaluate(equals, recur: recur)
}
case let .Roll(.ByKey(a, b, f)):