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

Recur into indexed terms of equal length.

Browse Source
This commit is contained in:
Rob Rix 2015-10-09 20:24:39 -04:00
parent 962e3fda24
commit d0ee908d54
1 changed files with 3 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
prototype/Doubt/Algorithm.swift
View File

@ -90,6 +90,9 @@ public enum Algorithm<A, B> {
if Term.equals(equals)(a, b) { return f(Diff(b)).evaluate(equals, recur: recur) }
switch (a.out, b.out) {
case let (.Indexed(a), .Indexed(b)) where a.count == b.count:
return f(.Indexed(zip(a, b).map(recur))).evaluate(equals, recur: recur)
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)