func split()

in Sources/TSCBasic/DeltaAlgorithm.swift [47:66]

• 20 lines of code
• 5 McCabe index (conditional complexity)

    func split(_ set: Set<Change>) -> [Set<Change>] {
        var lhs = Set<Change>()
        var rhs = Set<Change>()
        let n = set.count / 2
        for (idx, element) in set.enumerated() {
            if idx < n {
                lhs.insert(element)
            } else {
                rhs.insert(element)
            }
        }
        var result = [Set<Change>]()
        if !lhs.isEmpty {
            result.append(lhs)
        }
        if !rhs.isEmpty {
            result.append(rhs)
        }
        return result
    }