From fed0d91d30df699d6f288b037ab68f7e9f0fa03d Mon Sep 17 00:00:00 2001
From: Rob Rix <rob.rix@github.com>
Date: Thu, 15 Oct 2015 11:19:14 -0400
Subject: [PATCH] Use the patch constructors in SES.

---
 prototype/Doubt/SES.swift | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/prototype/Doubt/SES.swift b/prototype/Doubt/SES.swift
index 93404de5a..b7c03cf85 100644
--- a/prototype/Doubt/SES.swift
+++ b/prototype/Doubt/SES.swift
@@ -4,8 +4,8 @@
 public func SES<Term, A>(a: [Term], _ b: [Term], recur: (Term, Term) -> Free<A, Patch<Term>>?) -> [Free<A, Patch<Term>>] {
 	typealias Diff = Free<A, Patch<Term>>
 
-	if a.isEmpty { return b.map { Diff.Pure(Patch.Insert($0)) } }
-	if b.isEmpty { return a.map { Diff.Pure(Patch.Delete($0)) } }
+	if a.isEmpty { return b.map { .Insert($0) } }
+	if b.isEmpty { return a.map { .Delete($0) } }
 
 	func cost(diff: Diff) -> Int {
 		return diff.map(const(1)).iterate { syntax in
@@ -46,8 +46,8 @@ public func SES<Term, A>(a: [Term], _ b: [Term], recur: (Term, Term) -> Free<A,
 		let diagonal = matrix[i + 1, j + 1]
 
 		if let right = right, down = down, diagonal = diagonal {
-			let right = (right, Diff.Pure(Patch.Delete(a[i])), costOfStream(right))
-			let down = (down, Diff.Pure(Patch.Insert(b[j])), costOfStream(down))
+			let right = (right, Diff.Delete(a[i]), costOfStream(right))
+			let down = (down, Diff.Insert(b[j]), costOfStream(down))
 			let diagonal = recur(a[i], b[j]).map { (diagonal, $0, costOfStream(diagonal)) }
 			// nominate the best edge to continue along, not considering diagonal if `recur` returned `nil`.
 			let (best, diff, _) = diagonal