Skip to content

Commit f865e4e

Browse files
committed
remove debug prints
1 parent ca48856 commit f865e4e

1 file changed

Lines changed: 0 additions & 12 deletions

File tree

Diff/DiffArray.swift

Lines changed: 0 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -355,11 +355,6 @@ private func walkReversePath<T: Equatable>(
355355
}
356356

357357
// yes this method is way too long. Pull requests welcome!
358-
private func debugPrint(kay: Kay, vectors1: [Int], vectors2: [Int]) {
359-
print("--- kIndex: \(kay.index), kstart: \(kay.start), kend: \(kay.end), ")
360-
print("--- vectors1: \(vectors1), vectors2: \(vectors2)")
361-
}
362-
363358
func diff_bisectOfArrays<T: Equatable>(arrayA inArrayA: [T], arrayB inArrayB: [T]) -> [Diff<T>] {
364359
let maxD = (inArrayA.count + inArrayB.count + 1) / 2
365360
let vOffset = maxD
@@ -394,33 +389,26 @@ func diff_bisectOfArrays<T: Equatable>(arrayA inArrayA: [T], arrayB inArrayB: [T
394389

395390
// Walk the front path one step.
396391
kay1.index = -currentD + kay1.start
397-
debugPrint(kay: kay1, vectors1: vectors1, vectors2: vectors2)
398-
399392
let frontDiffs = walkFrontPath(
400393
commonParameters: commonParameters,
401394
currentD: currentD,
402395
kay1: kay1,
403396
vectors1: &vectors1,
404397
vectors2: &vectors2)
405398

406-
debugPrint(kay: kay1, vectors1: vectors1, vectors2: vectors2)
407-
408399
if !frontDiffs.isEmpty {
409400
return frontDiffs
410401
}
411402

412403
// Walk the reverse path one step.
413404
kay2.index = -currentD + kay2.start
414-
debugPrint(kay: kay2, vectors1: vectors1, vectors2: vectors2)
415405
let reverseDiffs = walkReversePath(
416406
commonParameters: commonParameters,
417407
currentD: currentD,
418408
kay2: kay2,
419409
vectors1: &vectors1,
420410
vectors2: &vectors2)
421411

422-
debugPrint(kay: kay2, vectors1: vectors1, vectors2: vectors2)
423-
424412
if !reverseDiffs.isEmpty {
425413
return reverseDiffs
426414
}

0 commit comments

Comments
 (0)