Structurefwcd.swift-utils 4.6.2Utils
Row
Matrix.swift:277struct Rowstruct Rowimport Utilsstruct Matrix<T> where T : ExpressibleByIntegerLiteral, T : Hashable, T : Absolutable, T : Addable, T : Divisible, T : Multipliable, T : Negatable, T : Subtractableinit(_ rows: [[T]]) init(columnVector values: [T]) init(repeating value: T, width: Int, height: Int) init(rowVector values: [T]) init(width: Int, height: Int, values: [T]) static func diagonal(_ diagonalValues: [T]) -> Matrix<T> static func identity(width: Int) -> Matrix<T> static func zero(width: Int, height: Int) -> Matrix<T> var asArray: [[T]] { get }var asNDArray: NDArray<T> { get }var columnVectors: [Vector<T>] { get }var columns: [[T]] { get }var description: String { get }var determinant: T? { get }Computes the determinant using Gaussian elimination in O(n^3).
var first: T? { get }The element in the upper left corner of the matrix.
var formattedDescription: String { get }let height: Intvar inverse: Matrix<T>? { get }Finds the inverse of this matrix.
var isSquare: Bool { get }var laplaceExpansionDeterminant: T? { get }Computes the determinant in O(n!).
var last: T? { get }The element in the lower right corner of the matrix.
var mainDiagonal: [T]? { get }var normalizedRowEcholonForm: Matrix<T>? { get }The row echolon form where all leading coefficients are 1.
var rowEcholonForm: Matrix<T>? { get }Computes a triangular matrix from this matrix through Gauss elimination.
var rowVectors: [Vector<T>] { get }var rows: [[T]] { get }var transpose: Matrix<T> { get }let width: Intsubscript(x: Int, y: Int) -> T { get set } subscript(column x: Int) -> Column { get } subscript(row y: Int) -> Row { get } static func * (lhs: Matrix<T>, rhs: Matrix<T>) -> Matrix<T> static func * (lhs: Matrix<T>, rhs: T) -> Matrix<T> static func * (lhs: T, rhs: Matrix<T>) -> Matrix<T> static func *= (lhs: inout Matrix<T>, rhs: Matrix<T>) static func *= (lhs: inout Matrix<T>, rhs: T) static func + (lhs: Matrix<T>, rhs: Matrix<T>) -> Matrix<T> static func += (lhs: inout Matrix<T>, rhs: Matrix<T>) static func - (lhs: Matrix<T>, rhs: Matrix<T>) -> Matrix<T> static func -= (lhs: inout Matrix<T>, rhs: Matrix<T>) static func / (lhs: Matrix<T>, rhs: T) -> Matrix<T> static func /= (lhs: inout Matrix<T>, rhs: T) mutating func add(row y1: Int, toRow y2: Int, scaledBy factor: T) func leadingCoefficient(_ y: Int) -> T func map<U>(_ f: (T) throws -> U) rethrows -> Matrix<U> where U : ExpressibleByIntegerLiteral, U : Hashable, U : Absolutable, U : Addable, U : Divisible, U : Multipliable, U : Negatable, U : Subtractable mutating func mapInPlace(_ f: (T) throws -> T) rethrows func minor(_ y: Int, _ x: Int) -> Matrix<T> func reshaped(width: Int, height: Int) -> Matrix<T> mutating func scale(row y: Int, by factor: T) func with(_ value: T, atY y: Int, x: Int) -> Matrix<T> func zip<U>(_ rhs: Matrix<T>, with f: (T, T) throws -> U) rethrows -> Matrix<U> where U : ExpressibleByIntegerLiteral, U : Hashable, U : Absolutable, U : Addable, U : Divisible, U : Multipliable, U : Negatable, U : Subtractable mutating func zipInPlace(_ rhs: Matrix<T>, with f: (T, T) throws -> T) rethrows struct Columnprotocol Sequence<Element>A type that provides sequential, iterated access to its elements.
let y: Intfunc makeIterator() -> Iterator struct Iteratorvar lazy: LazySequence<Self> { get }A sequence containing the same elements as this sequence, but on which some operations, such as map and filter, are implemented lazily.
var underestimatedCount: Int { get }A value less than or equal to the number of elements in the sequence, calculated nondestructively.
func allSatisfy(_ predicate: (Self.Element) throws -> Bool) rethrows -> Bool Returns a Boolean value indicating whether every element of a sequence satisfies a given predicate.
func asyncCompactMap<T>(_ transform: (Element) async throws -> T?) async rethrows -> [T] func asyncFilter(_ predicate: (Element) async throws -> Bool) async rethrows -> [Element] func asyncFlatMap<T, S>(_ transform: (Element) async throws -> S) async rethrows -> [T] where T == S.Element, S : Sequence func asyncMap<T>(_ transform: (Element) async throws -> T) async rethrows -> [T] func compactMap<ElementOfResult>(_ transform: (Self.Element) throws -> ElementOfResult?) rethrows -> [ElementOfResult] Returns an array containing the non-nil results of calling the given transformation with each element of this sequence.
func compare<Comparator>(_ lhs: Comparator.Compared, _ rhs: Comparator.Compared) -> ComparisonResult where Comparator : SortComparator, Comparator == Self.Element If lhs is ordered before rhs in the ordering described by the given sequence of SortComparators
func contains(_ element: Self.Element) -> Bool Returns a Boolean value indicating whether the sequence contains the given element.
func contains(where predicate: (Self.Element) throws -> Bool) rethrows -> Bool Returns a Boolean value indicating whether the sequence contains an element that satisfies the given predicate.
func count(forWhich predicate: (Element) throws -> Bool) rethrows -> Int func count<E>(where predicate: (Self.Element) throws(E) -> Bool) throws(E) -> Int where E : Error Returns the number of elements in the sequence that satisfy the given predicate.
func drop(while predicate: (Self.Element) throws -> Bool) rethrows -> DropWhileSequence<Self> Returns a sequence by skipping the initial, consecutive elements that satisfy the given predicate.
func dropFirst(_ k: Int = 1) -> DropFirstSequence<Self> Returns a sequence containing all but the given number of initial elements.
func dropLast(_ k: Int = 1) -> [Self.Element] Returns a sequence containing all but the given number of final elements.
func elementsEqual<OtherSequence>(_ other: OtherSequence) -> Bool where OtherSequence : Sequence, Self.Element == OtherSequence.Element Returns a Boolean value indicating whether this sequence and another sequence contain the same elements in the same order.
func elementsEqual<OtherSequence>(_ other: OtherSequence, by areEquivalent: (Self.Element, OtherSequence.Element) throws -> Bool) rethrows -> Bool where OtherSequence : Sequence Returns a Boolean value indicating whether this sequence and another sequence contain equivalent elements in the same order, using the given predicate as the equivalence test.
func enumerated() -> EnumeratedSequence<Self> Returns a sequence of pairs (n, x), where n represents a consecutive integer starting at zero and x represents an element of the sequence.
func filter(_ isIncluded: (Self.Element) throws -> Bool) rethrows -> [Self.Element] Returns an array containing, in order, the elements of the sequence that satisfy the given predicate.
func filter(_ predicate: Predicate<Self.Element>) throws -> [Self.Element] func first(where predicate: (Self.Element) throws -> Bool) rethrows -> Self.Element? Returns the first element of the sequence that satisfies the given predicate.
func flatMap<SegmentOfResult>(_ transform: (Self.Element) throws -> SegmentOfResult) rethrows -> [SegmentOfResult.Element] where SegmentOfResult : Sequence Returns an array containing the concatenated results of calling the given transformation with each element of this sequence.
func forEach(_ body: (Self.Element) throws -> Void) rethrows Calls the given closure on each element in the sequence in the same order as a for-in loop.
func formatted() -> String func formatted<S>(_ style: S) -> S.FormatOutput where Self == S.FormatInput, S : FormatStyle func groupingPreservingOrder<K>(by mapper: (Element) throws -> K) rethrows -> [(K, [Element])] where K : Hashable func joined() -> FlattenSequence<Self> Returns the elements of this sequence of sequences, concatenated.
func joined<Separator>(separator: Separator) -> JoinedSequence<Self> where Separator : Sequence, Separator.Element == Self.Element.Element Returns the concatenated elements of this sequence of sequences, inserting the given separator between each element.
func joined(separator: String = "") -> String Returns a new string by concatenating the elements of the sequence, adding the given separator between each element.
func lexicographicallyPrecedes<OtherSequence>(_ other: OtherSequence) -> Bool where OtherSequence : Sequence, Self.Element == OtherSequence.Element Returns a Boolean value indicating whether the sequence precedes another sequence in a lexicographical (dictionary) ordering, using the less-than operator (<) to compare elements.
func lexicographicallyPrecedes<OtherSequence>(_ other: OtherSequence, by areInIncreasingOrder: (Self.Element, Self.Element) throws -> Bool) rethrows -> Bool where OtherSequence : Sequence, Self.Element == OtherSequence.Element Returns a Boolean value indicating whether the sequence precedes another sequence in a lexicographical (dictionary) ordering, using the given predicate to compare elements.
func map<T, E>(_ transform: (Self.Element) throws(E) -> T) throws(E) -> [T] where E : Error Returns an array containing the results of mapping the given closure over the sequence’s elements.
@warn_unqualified_access func max() -> Self.Element? Returns the maximum element in the sequence.
@warn_unqualified_access func max(by areInIncreasingOrder: (Self.Element, Self.Element) throws -> Bool) rethrows -> Self.Element? Returns the maximum element in the sequence, using the given predicate as the comparison between elements.
@warn_unqualified_access func min() -> Self.Element? Returns the minimum element in the sequence.
@warn_unqualified_access func min(by areInIncreasingOrder: (Self.Element, Self.Element) throws -> Bool) rethrows -> Self.Element? Returns the minimum element in the sequence, using the given predicate as the comparison between elements.
func prefix(_ maxLength: Int) -> PrefixSequence<Self> Returns a sequence, up to the specified maximum length, containing the initial elements of the sequence.
func prefix(while predicate: (Self.Element) throws -> Bool) rethrows -> [Self.Element] Returns a sequence containing the initial, consecutive elements that satisfy the given predicate.
func reduce<Result>(_ initialResult: Result, _ nextPartialResult: (Result, Self.Element) throws -> Result) rethrows -> Result Returns the result of combining the elements of the sequence using the given closure.
func reduce<Result>(into initialResult: Result, _ updateAccumulatingResult: (inout Result, Self.Element) throws -> ()) rethrows -> Result Returns the result of combining the elements of the sequence using the given closure.
func reduce1(_ accumulator: (Element, Element) throws -> Element) rethrows -> Element? Reduce, but without an initial element
func reversed() -> [Self.Element] Returns an array containing the elements of this sequence in reverse order.
func scan<T>(_ initial: T, _ accumulator: (T, Element) throws -> T) rethrows -> [T] Similar to reduce, but returns a list of successive reduced values from the left
func scan1(_ accumulator: (Element, Element) throws -> Element) rethrows -> [Element] Similar to scan, but without an initial element
func sequenceMap<T>(_ transform: (Element) throws -> T?) rethrows -> [T]? Turns a list of optionals into an optional list, like Haskell’s ‘sequence’.
func shuffled() -> [Self.Element] Returns the elements of the sequence, shuffled.
func shuffled<T>(using generator: inout T) -> [Self.Element] where T : RandomNumberGenerator Returns the elements of the sequence, shuffled using the given generator as a source for randomness.
func sorted() -> [Self.Element] Returns the elements of the sequence, sorted.
func sorted(by areInIncreasingOrder: (Self.Element, Self.Element) throws -> Bool) rethrows -> [Self.Element] Returns the elements of the sequence, sorted using the given predicate as the comparison between elements.
func sorted<Comparator>(using comparator: Comparator) -> [Self.Element] where Comparator : SortComparator, Self.Element == Comparator.Compared Returns the elements of the sequence, sorted using the given comparator to compare elements.
func sorted<S, Comparator>(using comparators: S) -> [Self.Element] where S : Sequence, Comparator : SortComparator, Comparator == S.Element, Self.Element == Comparator.Compared Returns the elements of the sequence, sorted using the given array of SortComparators to compare elements.
func split(maxSplits: Int = Int.max, omittingEmptySubsequences: Bool = true, whereSeparator isSeparator: (Self.Element) throws -> Bool) rethrows -> [ArraySlice<Self.Element>] Returns the longest possible subsequences of the sequence, in order, that don’t contain elements satisfying the given predicate. Elements that are used to split the sequence are not returned as part of any subsequence.
func split(separator: Self.Element, maxSplits: Int = Int.max, omittingEmptySubsequences: Bool = true) -> [ArraySlice<Self.Element>] Returns the longest possible subsequences of the sequence, in order, around elements equal to the given element.
func starts<PossiblePrefix>(with possiblePrefix: PossiblePrefix) -> Bool where PossiblePrefix : Sequence, Self.Element == PossiblePrefix.Element Returns a Boolean value indicating whether the initial elements of the sequence are the same as the elements in another sequence.
func starts<PossiblePrefix>(with possiblePrefix: PossiblePrefix, by areEquivalent: (Self.Element, PossiblePrefix.Element) throws -> Bool) rethrows -> Bool where PossiblePrefix : Sequence Returns a Boolean value indicating whether the initial elements of the sequence are equivalent to the elements in another sequence, using the given predicate as the equivalence test.
func suffix(_ maxLength: Int) -> [Self.Element] Returns a subsequence, up to the given maximum length, containing the final elements of the sequence.
func withContiguousStorageIfAvailable<R>(_ body: (UnsafeBufferPointer<Self.Element>) throws -> R) rethrows -> R? func withoutDuplicates<T>(by mapper: (Element) throws -> T) rethrows -> [Element] where T : Hashable func flatMap<ElementOfResult>(_ transform: (Self.Element) throws -> ElementOfResult?) rethrows -> [ElementOfResult] func grouped<K>(by mapper: (Element) throws -> K) rethrows -> [(K, [Element])] where K : Hashable