Instance Propertyfwcd.swift-utils 4.6.2Utils->Swift
isAlphabetic
StringProtocol+Extensions.swift:96var isAlphabetic: Bool { get }var isAlphabetic: Bool { get }import Swiftimport Utilsprotocol StringProtocol : BidirectionalCollection, Comparable, ExpressibleByStringInterpolation, Hashable, LosslessStringConvertible, TextOutputStream, TextOutputStreamable where Self.Element == Character, Self.Index == String.Index, Self.StringInterpolation == DefaultStringInterpolation, Self.SubSequence : StringProtocolA type that can represent a string as a collection of characters.
@frozen struct BoolA value type whose instances are either true or false.
var asciiOnly: String? { get }var camelHumps: [String] { get }var camelHumpsWithUnderscores: [String] { get }var markdownEscaped: String { get }var nilIfEmpty: Self? { get }var withFirstUppercased: String { get }func applyAsTemplate(to args: [String]) -> String Applies this string as a ‘template’ containing % placeholders to a list of arguments
func editDistance<S>(to rhs: S, caseSensitive: Bool = true, allowInsertionAndDeletion: Bool = true, allowSubstitution: Bool = true) -> Int where S : StringProtocol func lcsDistance<S>(to rhs: S, caseSensitive: Bool = true) -> Int where S : StringProtocol The Longest Common Subsequence (LCS) string distance, i.e. the minimal number of insertions and deletions to transform this string to the given string.
func levenshteinDistance<S>(to rhs: S, caseSensitive: Bool = true) -> Int where S : StringProtocol The Levenshtein string distance, i.e. the minimal number of insertions, deletions and substitutions to transform this string to the given string.
func pluralized(with value: Int) -> String func split(by length: Int) -> [String] func splitPreservingQuotes(by separator: Character, omitQuotes: Bool = false, omitBackslashes: Bool = false) -> [String] func truncated(to length: Int, appending trailing: String = "") -> String