You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
102 lines
0 B
102 lines
0 B
![]()
1 year ago
|
//
|
||
|
// LTStringDiffResult.swift
|
||
|
//
|
||
|
// The MIT License (MIT)
|
||
|
// Copyright (c) 2017 Lex Tang,
|
||
|
//
|
||
|
// Permission is hereby granted, free of charge, to any person obtaining a
|
||
|
// copy of this software and associated documentation files
|
||
|
// (the “Software”), to deal in the Software without restriction,
|
||
|
// including without limitation the rights to use, copy, modify, merge,
|
||
|
// publish, distribute, sublicense, and/or sell copies of the Software,
|
||
|
// and to permit persons to whom the Software is furnished to do so,
|
||
|
// subject to the following conditions:
|
||
|
//
|
||
|
// The above copyright notice and this permission notice shall be included
|
||
|
// in all copies or substantial portions of the Software.
|
||
|
//
|
||
|
// THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
||
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
||
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
|
||
|
// IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
|
||
|
// CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
|
||
|
// TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||
|
// SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||
|
//
|
||
|
|
||
|
import Foundation
|
||
|
|
||
|
public typealias LTStringDiffResult = ([LTCharacterDiffResult], skipDrawingResults: [Bool])
|
||
|
|
||
|
public extension String {
|
||
|
|
||
|
func diffWith(_ anotherString: String?) -> LTStringDiffResult {
|
||
|
|
||
|
guard let anotherString = anotherString else {
|
||
|
let diffResults: [LTCharacterDiffResult] =
|
||
|
Array(repeating: .delete, count: self.count)
|
||
|
let skipDrawingResults: [Bool] = Array(repeating: false, count: self.count)
|
||
|
return (diffResults, skipDrawingResults)
|
||
|
}
|
||
|
|
||
|
let newChars = anotherString.enumerated()
|
||
|
let lhsLength = self.count
|
||
|
let rhsLength = anotherString.count
|
||
|
var skipIndexes = [Int]()
|
||
|
let leftChars = Array(self)
|
||
|
|
||
|
let maxLength = max(lhsLength, rhsLength)
|
||
|
var diffResults: [LTCharacterDiffResult] = Array(repeating: .add, count: maxLength)
|
||
|
var skipDrawingResults: [Bool] = Array(repeating: false, count: maxLength)
|
||
|
|
||
|
for i in 0..<maxLength {
|
||
|
// If new string is longer than the original one
|
||
|
if i > lhsLength - 1 {
|
||
|
continue
|
||
|
}
|
||
|
|
||
|
let leftChar = leftChars[i]
|
||
|
|
||
|
// Search left character in the new string
|
||
|
var foundCharacterInRhs = false
|
||
|
for (j, newChar) in newChars {
|
||
|
if skipIndexes.contains(j) || leftChar != newChar {
|
||
|
continue
|
||
|
}
|
||
|
|
||
|
skipIndexes.append(j)
|
||
|
foundCharacterInRhs = true
|
||
|
if i == j {
|
||
|
// Character not changed
|
||
|
diffResults[i] = .same
|
||
|
} else {
|
||
|
// foundCharacterInRhs and move
|
||
|
let offset = j - i
|
||
|
|
||
|
if i <= rhsLength - 1 {
|
||
|
// Move to a new index and add a new character to new original place
|
||
|
diffResults[i] = .moveAndAdd(offset: offset)
|
||
|
} else {
|
||
|
diffResults[i] = .move(offset: offset)
|
||
|
}
|
||
|
|
||
|
skipDrawingResults[j] = true
|
||
|
}
|
||
|
break
|
||
|
}
|
||
|
|
||
|
if !foundCharacterInRhs {
|
||
|
if i < rhsLength - 1 {
|
||
|
diffResults[i] = .replace
|
||
|
} else {
|
||
|
diffResults[i] = .delete
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
|
||
|
return (diffResults, skipDrawingResults)
|
||
|
|
||
|
}
|
||
|
|
||
|
}
|