mirror of
https://github.com/nicklockwood/SwiftFormat.git
synced 2026-05-17 10:30:35 +00:00
417 lines
16 KiB
Swift
417 lines
16 KiB
Swift
//
|
|
// Formatter.swift
|
|
// SwiftFormat
|
|
//
|
|
// Version 0.41.0
|
|
//
|
|
// Created by Nick Lockwood on 12/08/2016.
|
|
// Copyright 2016 Nick Lockwood
|
|
//
|
|
// Distributed under the permissive MIT license
|
|
// Get the latest version from here:
|
|
//
|
|
// https://github.com/nicklockwood/SwiftFormat
|
|
//
|
|
// 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
|
|
|
|
/// This is a utility class used for manipulating a tokenized source file.
|
|
/// It doesn't actually contain any logic for formatting, but provides
|
|
/// utility methods for enumerating and adding/removing/replacing tokens.
|
|
/// The primary advantage it provides over operating on the token array
|
|
/// directly is that it allows mutation during enumeration, and
|
|
/// transparently handles changes that affect the current token index.
|
|
public class Formatter: NSObject {
|
|
private var enumerationIndex = -1
|
|
private var disabledCount = 0
|
|
private var disabledNext = 0
|
|
private var wasNextDirective = false
|
|
|
|
// Current rule, used for handling comment directives
|
|
var currentRule: String? {
|
|
didSet {
|
|
disabledCount = 0
|
|
disabledNext = 0
|
|
}
|
|
}
|
|
|
|
// Is current rule enabled
|
|
var isEnabled: Bool { return disabledCount + disabledNext <= 0 }
|
|
|
|
// Process a comment token (which may contain directives)
|
|
func processCommentBody(_ comment: String) {
|
|
let prefix = "swiftformat:"
|
|
guard let rule = currentRule, comment.hasPrefix(prefix),
|
|
let directive = ["disable", "enable"].first(where: { comment.hasPrefix("\(prefix)\($0)") }),
|
|
comment.range(of: "\\b(\(rule)|all)\\b", options: .regularExpression) != nil else {
|
|
return
|
|
}
|
|
wasNextDirective = comment.hasPrefix("\(prefix)\(directive):next")
|
|
switch directive {
|
|
case "disable":
|
|
if wasNextDirective {
|
|
disabledNext = 1
|
|
} else {
|
|
disabledCount += 1
|
|
}
|
|
case "enable":
|
|
if wasNextDirective {
|
|
disabledNext = -1
|
|
} else {
|
|
disabledCount -= 1
|
|
}
|
|
default:
|
|
preconditionFailure()
|
|
}
|
|
}
|
|
|
|
/// Process a linebreak (used to cancel disable/enable:next directive)
|
|
func processLinebreak() {
|
|
if wasNextDirective {
|
|
wasNextDirective = false
|
|
} else if disabledNext != 0 {
|
|
disabledNext = 0
|
|
}
|
|
}
|
|
|
|
/// The options that the formatter was initialized with
|
|
public let options: FormatOptions
|
|
|
|
/// The token array managed by the formatter (read-only)
|
|
public private(set) var tokens: [Token]
|
|
|
|
/// Create a new formatter instance from a token array
|
|
public init(_ tokens: [Token], options: FormatOptions = FormatOptions()) {
|
|
self.tokens = tokens
|
|
self.options = options
|
|
}
|
|
|
|
// MARK: access and mutation
|
|
|
|
/// Returns the token at the specified index, or nil if index is invalid
|
|
public func token(at index: Int) -> Token? {
|
|
guard index >= 0, index < tokens.count else { return nil }
|
|
return tokens[index]
|
|
}
|
|
|
|
/// Replaces the token at the specified index with one or more new tokens
|
|
public func replaceToken(at index: Int, with tokens: Token...) {
|
|
if tokens.isEmpty {
|
|
removeToken(at: index)
|
|
} else {
|
|
self.tokens[index] = tokens[0]
|
|
for (i, token) in tokens.dropFirst().enumerated() {
|
|
insertToken(token, at: index + i + 1)
|
|
}
|
|
}
|
|
}
|
|
|
|
/// Replaces the tokens in the specified range with new tokens
|
|
public func replaceTokens(inRange range: Range<Int>, with tokens: [Token]) {
|
|
let max = min(range.count, tokens.count)
|
|
for i in 0 ..< max {
|
|
self.tokens[range.lowerBound + i] = tokens[i]
|
|
}
|
|
if range.count > max {
|
|
for _ in max ..< range.count {
|
|
removeToken(at: range.lowerBound + max)
|
|
}
|
|
} else {
|
|
for i in max ..< tokens.count {
|
|
insertToken(tokens[i], at: range.lowerBound + i)
|
|
}
|
|
}
|
|
}
|
|
|
|
/// Replaces the tokens in the specified closed range with new tokens
|
|
public func replaceTokens(inRange range: ClosedRange<Int>, with tokens: [Token]) {
|
|
replaceTokens(inRange: range.lowerBound ..< range.upperBound + 1, with: tokens)
|
|
}
|
|
|
|
/// Removes the token at the specified index
|
|
public func removeToken(at index: Int) {
|
|
tokens.remove(at: index)
|
|
if enumerationIndex >= index {
|
|
enumerationIndex -= 1
|
|
}
|
|
}
|
|
|
|
/// Removes the tokens in the specified range
|
|
public func removeTokens(inRange range: Range<Int>) {
|
|
replaceTokens(inRange: range, with: [])
|
|
}
|
|
|
|
/// Removes the tokens in the specified closed range
|
|
public func removeTokens(inRange range: ClosedRange<Int>) {
|
|
replaceTokens(inRange: range, with: [])
|
|
}
|
|
|
|
/// Removes the last token
|
|
public func removeLastToken() {
|
|
tokens.removeLast()
|
|
}
|
|
|
|
/// Inserts an array of tokens at the specified index
|
|
public func insertTokens(_ tokens: [Token], at index: Int) {
|
|
for token in tokens.reversed() {
|
|
self.tokens.insert(token, at: index)
|
|
}
|
|
if enumerationIndex >= index {
|
|
enumerationIndex += tokens.count
|
|
}
|
|
}
|
|
|
|
/// Inserts a single token at the specified index
|
|
public func insertToken(_ token: Token, at index: Int) {
|
|
insertTokens([token], at: index)
|
|
}
|
|
|
|
// MARK: enumeration
|
|
|
|
/// Loops through each token in the array. It is safe to mutate the token
|
|
/// array inside the body block, but note that the index and token arguments
|
|
/// may not reflect the current token any more after a mutation
|
|
public func forEachToken(_ body: (Int, Token) -> Void) {
|
|
assert(enumerationIndex == -1, "forEachToken does not support re-entrancy")
|
|
enumerationIndex = 0
|
|
while enumerationIndex < tokens.count {
|
|
let token = tokens[enumerationIndex]
|
|
switch token {
|
|
case let .commentBody(comment):
|
|
processCommentBody(comment)
|
|
case .linebreak:
|
|
processLinebreak()
|
|
default:
|
|
break
|
|
}
|
|
if isEnabled {
|
|
body(enumerationIndex, token) // May mutate enumerationIndex
|
|
}
|
|
enumerationIndex += 1
|
|
}
|
|
enumerationIndex = -1
|
|
}
|
|
|
|
/// As above, but only loops through tokens that match the specified filter block
|
|
public func forEachToken(where matching: (Token) -> Bool, _ body: (Int, Token) -> Void) {
|
|
forEachToken { index, token in
|
|
if matching(token) {
|
|
body(index, token)
|
|
}
|
|
}
|
|
}
|
|
|
|
/// As above, but only loops through tokens with the specified type and string
|
|
public func forEach(_ token: Token, _ body: (Int, Token) -> Void) {
|
|
forEachToken(where: { $0 == token }, body)
|
|
}
|
|
|
|
/// As above, but only loops through tokens with the specified type and string
|
|
public func forEach(_ type: TokenType, _ body: (Int, Token) -> Void) {
|
|
forEachToken(where: { $0.is(type) }, body)
|
|
}
|
|
|
|
// MARK: utilities
|
|
|
|
/// Returns the index of the next token in the specified range that matches the block
|
|
public func index(in range: CountableRange<Int>, where matches: (Token) -> Bool) -> Int? {
|
|
let range = range.clamped(to: 0 ..< tokens.count)
|
|
var scopeStack: [Token] = []
|
|
for i in range {
|
|
let token = tokens[i]
|
|
// TODO: find a better way to deal with this special case
|
|
if token == .endOfScope("#endif") {
|
|
while let scope = scopeStack.last, scope != .startOfScope("#if") {
|
|
scopeStack.removeLast()
|
|
}
|
|
}
|
|
if let scope = scopeStack.last, token.isEndOfScope(scope) {
|
|
scopeStack.removeLast()
|
|
if case .linebreak = token, scopeStack.isEmpty, matches(token) {
|
|
return i
|
|
}
|
|
} else if token == .endOfScope("case") || token == .endOfScope("default"),
|
|
scopeStack.last == .startOfScope("#if") {
|
|
continue
|
|
} else if scopeStack.isEmpty, matches(token) {
|
|
return i
|
|
} else if token.isEndOfScope {
|
|
return nil
|
|
} else if case .startOfScope = token {
|
|
scopeStack.append(token)
|
|
}
|
|
}
|
|
return nil
|
|
}
|
|
|
|
/// Returns the index of the next token at the current scope that matches the block
|
|
public func index(after index: Int, where matches: (Token) -> Bool) -> Int? {
|
|
guard index < tokens.count else { return nil }
|
|
return self.index(in: index + 1 ..< tokens.count, where: matches)
|
|
}
|
|
|
|
/// Returns the index of the next matching token in the specified range
|
|
public func index(of token: Token, in range: CountableRange<Int>) -> Int? {
|
|
return index(in: range, where: { $0 == token })
|
|
}
|
|
|
|
/// Returns the index of the next matching token at the current scope
|
|
public func index(of token: Token, after index: Int) -> Int? {
|
|
return self.index(after: index, where: { $0 == token })
|
|
}
|
|
|
|
/// Returns the index of the next token in the specified range of the specified type
|
|
public func index(of type: TokenType, in range: CountableRange<Int>, if matches: (Token) -> Bool = { _ in true }) -> Int? {
|
|
return index(in: range, where: { $0.is(type) }).flatMap { matches(tokens[$0]) ? $0 : nil }
|
|
}
|
|
|
|
/// Returns the index of the next token at the current scope of the specified type
|
|
public func index(of type: TokenType, after index: Int, if matches: (Token) -> Bool = { _ in true }) -> Int? {
|
|
return self.index(after: index, where: { $0.is(type) }).flatMap { matches(tokens[$0]) ? $0 : nil }
|
|
}
|
|
|
|
/// Returns the next token at the current scope that matches the block
|
|
public func nextToken(after index: Int, where matches: (Token) -> Bool = { _ in true }) -> Token? {
|
|
return self.index(after: index, where: matches).map { tokens[$0] }
|
|
}
|
|
|
|
/// Returns the next token at the current scope of the specified type
|
|
public func next(_ type: TokenType, after index: Int, if matches: (Token) -> Bool = { _ in true }) -> Token? {
|
|
return self.index(of: type, after: index, if: matches).map { tokens[$0] }
|
|
}
|
|
|
|
/// Returns the next token in the specified range of the specified type
|
|
public func next(_ type: TokenType, in range: CountableRange<Int>, if matches: (Token) -> Bool = { _ in true }) -> Token? {
|
|
return index(of: type, in: range, if: matches).map { tokens[$0] }
|
|
}
|
|
|
|
/// Returns the index of the last token in the specified range that matches the block
|
|
public func lastIndex(in range: CountableRange<Int>, where matches: (Token) -> Bool) -> Int? {
|
|
let range = range.clamped(to: 0 ..< tokens.count)
|
|
var linebreakEncountered = false
|
|
var scopeStack: [Token] = []
|
|
for i in range.reversed() {
|
|
let token = tokens[i]
|
|
if case .startOfScope = token {
|
|
if let scope = scopeStack.last, scope.isEndOfScope(token) {
|
|
scopeStack.removeLast()
|
|
} else if token.string == "//", linebreakEncountered {
|
|
linebreakEncountered = false
|
|
} else if matches(token) {
|
|
return i
|
|
} else if token.string == "//", self.token(at: range.upperBound)?.isLinebreak == true {
|
|
continue
|
|
} else {
|
|
return nil
|
|
}
|
|
} else if scopeStack.isEmpty, matches(token) {
|
|
return i
|
|
} else if case .linebreak = token {
|
|
linebreakEncountered = true
|
|
} else if case .endOfScope = token {
|
|
scopeStack.append(token)
|
|
}
|
|
}
|
|
return nil
|
|
}
|
|
|
|
/// Returns the index of the previous token at the current scope that matches the block
|
|
public func index(before index: Int, where matches: (Token) -> Bool) -> Int? {
|
|
guard index > 0 else { return nil }
|
|
return lastIndex(in: 0 ..< index, where: matches)
|
|
}
|
|
|
|
/// Returns the index of the last matching token in the specified range
|
|
public func lastIndex(of token: Token, in range: CountableRange<Int>) -> Int? {
|
|
return lastIndex(in: range, where: { $0 == token })
|
|
}
|
|
|
|
/// Returns the index of the previous matching token at the current scope
|
|
public func index(of token: Token, before index: Int) -> Int? {
|
|
return self.index(before: index, where: { $0 == token })
|
|
}
|
|
|
|
/// Returns the index of the last token in the specified range of the specified type
|
|
public func lastIndex(of type: TokenType, in range: CountableRange<Int>, if matches: (Token) -> Bool = { _ in true }) -> Int? {
|
|
return lastIndex(in: range, where: { $0.is(type) }).flatMap { matches(tokens[$0]) ? $0 : nil }
|
|
}
|
|
|
|
/// Returns the index of the previous token at the current scope of the specified type
|
|
public func index(of type: TokenType, before index: Int, if matches: (Token) -> Bool = { _ in true }) -> Int? {
|
|
return self.index(before: index, where: { $0.is(type) }).flatMap { matches(tokens[$0]) ? $0 : nil }
|
|
}
|
|
|
|
/// Returns the previous token at the current scope that matches the block
|
|
public func lastToken(before index: Int, where matches: (Token) -> Bool) -> Token? {
|
|
return self.index(before: index, where: matches).map { tokens[$0] }
|
|
}
|
|
|
|
/// Returns the previous token at the current scope of the specified type
|
|
public func last(_ type: TokenType, before index: Int, if matches: (Token) -> Bool = { _ in true }) -> Token? {
|
|
return self.index(of: type, before: index, if: matches).map { tokens[$0] }
|
|
}
|
|
|
|
/// Returns the previous token in the specified range of the specified type
|
|
public func last(_ type: TokenType, in range: CountableRange<Int>, if matches: (Token) -> Bool = { _ in true }) -> Token? {
|
|
return lastIndex(of: type, in: range, if: matches).map { tokens[$0] }
|
|
}
|
|
|
|
/// Returns the starting token for the containing scope at the specified index
|
|
public func currentScope(at index: Int) -> Token? {
|
|
return last(.startOfScope, before: index)
|
|
}
|
|
|
|
/// Returns the index of the ending token for the current scope
|
|
// TODO: should this return the closing `}` for `switch { ...` instead of nested `case`?
|
|
public func endOfScope(at index: Int) -> Int? {
|
|
let startIndex: Int
|
|
guard var startToken = token(at: index) else { return nil }
|
|
if case .startOfScope = startToken {
|
|
startIndex = index
|
|
} else if let index = self.index(of: .startOfScope, before: index) {
|
|
startToken = tokens[index]
|
|
startIndex = index
|
|
} else {
|
|
return nil
|
|
}
|
|
return self.index(after: startIndex, where: {
|
|
$0.isEndOfScope(startToken)
|
|
})
|
|
}
|
|
|
|
/// Either modifies or removes the existing space token at the specified
|
|
/// index, or inserts a new one if there is not already a space token present.
|
|
/// Returns the number of tokens inserted or removed
|
|
@discardableResult func insertSpace(_ space: String, at index: Int) -> Int {
|
|
if token(at: index)?.isSpace == true {
|
|
if space.isEmpty {
|
|
removeToken(at: index)
|
|
return -1 // Removed 1 token
|
|
}
|
|
replaceToken(at: index, with: .space(space))
|
|
} else if !space.isEmpty {
|
|
insertToken(.space(space), at: index)
|
|
return 1 // Inserted 1 token
|
|
}
|
|
return 0 // Inserted 0 tokens
|
|
}
|
|
}
|