Compare commits

..
2 Commits
18 changed files with 623 additions and 922 deletions

No files matched your search

+2 -40
View File
@@ -8,26 +8,7 @@ This project follows semantic versioning.
## [Unreleased]
### Additions
- Bidirectional collections have a new `ends(with:)` method that matches
the behavior of the standard library's `starts(with:)` method. ([#224])
<!-- *No new changes.* -->
## [1.2.1] - 2025-02-10
### Changes
- The package now has a minimum Swift version of Swift 5.7. ([#240])
- Adds a project for building with Xcode. ([#246])
### Fixes
- Fix for Swift 6 language mode errors. ([#230])
- Minor improvements to documentation and performance. ([#220], [#222], [#223], [#225], [#227], [#228])
The 1.2.1 release includes contributions from [b1ackturtle], [CheATSlark], [dabrahams], [glessard], [j-f1], [marcosgriselli], [mrs1669], [natecook1000], [rex4539], and [schlagelk]. Thank you!
*No new changes.*
## [1.2.0] - 2023-11-14
@@ -357,8 +338,7 @@ This changelog's format is based on [Keep a Changelog](https://keepachangelog.co
<!-- Link references for releases -->
[Unreleased]: https://github.com/apple/swift-algorithms/compare/1.2.1...HEAD
[1.2.0]: https://github.com/apple/swift-algorithms/compare/1.2.0...1.2.1
[Unreleased]: https://github.com/apple/swift-algorithms/compare/1.2.0...HEAD
[1.2.0]: https://github.com/apple/swift-algorithms/compare/1.1.0...1.2.0
[1.1.0]: https://github.com/apple/swift-algorithms/compare/1.0.0...1.1.0
[1.0.0]: https://github.com/apple/swift-algorithms/compare/0.2.1...1.0.0
@@ -405,50 +385,33 @@ This changelog's format is based on [Keep a Changelog](https://keepachangelog.co
[#202]: https://github.com/apple/swift-algorithms/pull/202
[#210]: https://github.com/apple/swift-algorithms/pull/210
[#211]: https://github.com/apple/swift-algorithms/pull/211
[#224]: https://github.com/apple/swift-algorithms/pull/224
[#220]: https://github.com/apple/swift-algorithms/pull/220
[#222]: https://github.com/apple/swift-algorithms/pull/222
[#223]: https://github.com/apple/swift-algorithms/pull/223
[#225]: https://github.com/apple/swift-algorithms/pull/225
[#227]: https://github.com/apple/swift-algorithms/pull/227
[#228]: https://github.com/apple/swift-algorithms/pull/228
[#230]: https://github.com/apple/swift-algorithms/pull/230
[#240]: https://github.com/apple/swift-algorithms/pull/240
[#246]: https://github.com/apple/swift-algorithms/pull/246
<!-- Link references for contributors -->
[amomchilov]: https://github.com/apple/swift-algorithms/commits?author=amomchilov
[AustinConlon]: https://github.com/apple/swift-algorithms/commits?author=AustinConlon
[b1ackturtle]: https://github.com/apple/swift-algorithms/commits?author=b1ackturtle
[benrimmington]: https://github.com/apple/swift-algorithms/commits?author=benrimmington
[bjhomer]: https://github.com/apple/swift-algorithms/commits?author=bjhomer
[CheATSlark]: https://github.com/apple/swift-algorithms/commits?author=CheATSlark
[CTMacUser]: https://github.com/apple/swift-algorithms/commits?author=CTMacUser
[dabrahams]: https://github.com/apple/swift-algorithms/commits?author=dabrahams
[danielctull]: https://github.com/apple/swift-algorithms/commits?author=danielctull
[dhruvshah8]: https://github.com/apple/swift-algorithms/commits?author=dhruvshah8
[dickoff]: https://github.com/apple/swift-algorithms/commits?author=dickoff
[egorzhdan]: https://github.com/apple/swift-algorithms/commits?author=egorzhdan
[fedeci]: https://github.com/apple/swift-algorithms/commits?author=fedeci
[glessard]: https://github.com/apple/swift-algorithms/commits?author=glessard
[gwynne]: https://github.com/apple/swift-algorithms/commits?author=gwynne
[hashemi]: https://github.com/apple/swift-algorithms/commits?author=hashemi
[iainsmith]: https://github.com/apple/swift-algorithms/commits?author=iainsmith
[IanKeen]: https://github.com/apple/swift-algorithms/commits?author=IanKeen
[iSame7]: https://github.com/apple/swift-algorithms/commits?author=iSame7
[j-f1]: https://github.com/apple/swift-algorithms/commits?author=j-f1
[karwa]: https://github.com/apple/swift-algorithms/commits?author=karwa
[kylemacomber]: https://github.com/apple/swift-algorithms/commits?author=kylemacomber
[LemonSpike]: https://github.com/apple/swift-algorithms/commits?author=LemonSpike
[LucianoPAlmeida]: https://github.com/apple/swift-algorithms/commits?author=LucianoPAlmeida
[marcosgriselli]: https://github.com/apple/swift-algorithms/commits?author=marcosgriselli
[markuswntr]: https://github.com/apple/swift-algorithms/commits?author=markuswntr
[mattyoung]: https://github.com/apple/swift-algorithms/commits?author=mattyoung
[mdznr]: https://github.com/apple/swift-algorithms/commits?author=mdznr
[michiboo]: https://github.com/apple/swift-algorithms/commits?author=michiboo
[mpangburn]: https://github.com/apple/swift-algorithms/commits?author=mpangburn
[mrs1669]: https://github.com/apple/swift-algorithms/commits?author=mrs1669
[natecook1000]: https://github.com/apple/swift-algorithms/commits?author=natecook1000
[nordicio]: https://github.com/apple/swift-algorithms/commits?author=nordicio
[ole]: https://github.com/apple/swift-algorithms/commits?author=ole
@@ -456,7 +419,6 @@ This changelog's format is based on [Keep a Changelog](https://keepachangelog.co
[pmtao]: https://github.com/apple/swift-algorithms/commits?author=pmtao
[Qata]: https://github.com/apple/swift-algorithms/commits?author=Qata
[rakaramos]: https://github.com/apple/swift-algorithms/commits?author=rakaramos
[rex4539]: https://github.com/apple/swift-algorithms/commits?author=rex4539
[rockbruno]: https://github.com/apple/swift-algorithms/commits?author=rockbruno
[Roshankumar350]: https://github.com/apple/swift-algorithms/commits?author=Roshankumar350
[schlagelk]: https://github.com/apple/swift-algorithms/commits?author=schlagelk
+6 -1
View File
@@ -27,7 +27,12 @@ let package = Package(
name: "Algorithms",
dependencies: [
.product(name: "RealModule", package: "swift-numerics"),
]),
],
swiftSettings: [
.define("INSERTION_TEMP"),
// .define("INSERTION_MAX_32"),
]
),
.testTarget(
name: "SwiftAlgorithmsTests",
dependencies: ["Algorithms"]),
+539
View File
@@ -0,0 +1,539 @@
extension Int {
@inlinable
internal var _log2: Int {
Self.bitWidth - leadingZeroBitCount
}
}
@inlinable internal var _partialInsertionSortSwapLimit: Int { 8 }
@inlinable internal var _insertionSortMaxCount: Int {
#if INSERTION_MAX_32
32
#else
20
#endif
}
@inlinable internal var _medianOfMediansMinCount: Int { 200 }
extension MutableCollection where Self: BidirectionalCollection {
@inlinable
internal mutating func _partialInsertionSort(
within range: Range<Index>,
by areInIncreasingOrder: (Element, Element) throws -> Bool
) rethrows -> Bool {
if range.isEmpty {
return true
}
var sortedEnd = index(after: range.lowerBound)
var swaps = 0
// Continue sorting until the sorted elements cover the whole sequence.
while sortedEnd != range.upperBound {
var i = sortedEnd
// Look backwards for `self[i]`'s position in the sorted sequence,
// moving each element forward to make room.
repeat {
let j = index(before: i)
// If `self[i]` doesn't belong before `self[j]`, we've found
// its position.
if try !areInIncreasingOrder(self[i], self[j]) {
break
}
swapAt(i, j)
i = j
// Quit if we've completed more than the swap limit.
swaps += 1
if swaps > _partialInsertionSortSwapLimit { return false }
} while i != range.lowerBound
formIndex(after: &sortedEnd)
}
return true
}
/// Sorts `self[range]` according to `areInIncreasingOrder`. Stable.
///
/// - Precondition: `sortedEnd != range.lowerBound`
/// - Precondition: `elements[..<sortedEnd]` are already in order.
@inlinable
public
mutating func _insertionSort(
within range: Range<Index>,
by areInIncreasingOrder: (Element, Element) throws -> Bool
) rethrows {
if range.isEmpty {
return
}
var sortedEnd = index(after: range.lowerBound)
// Continue sorting until the sorted elements cover the whole sequence.
while sortedEnd != range.upperBound {
var i = sortedEnd
#if INSERTION_TEMP
let temp = self[i]
#endif
// Look backwards for `self[i]`'s position in the sorted sequence,
// moving each element forward to make room.
repeat {
let j = index(before: i)
// If `self[i]` doesn't belong before `self[j]`, we've found
// its position.
#if INSERTION_TEMP
if try !areInIncreasingOrder(temp, self[j]) {
break
}
self[j] = self[i]
#else
if try !areInIncreasingOrder(self[i], self[j]) {
break
}
swapAt(i, j)
#endif
i = j
} while i != range.lowerBound
#if INSERTION_TEMP
self[i] = temp
#endif
formIndex(after: &sortedEnd)
}
}
@inlinable
internal mutating func _sort2(
_ a: Index, _ b: Index,
by areInIncreasingOrder: (Element, Element) throws -> Bool
) rethrows {
if try areInIncreasingOrder(self[b], self[a]) {
swapAt(a, b)
}
}
@inlinable
internal mutating func _sort3a(
_ a: Index, _ b: Index, _ c: Index,
by areInIncreasingOrder: (Element, Element) throws -> Bool
) rethrows {
try _sort2(a, b, by: areInIncreasingOrder)
try _sort2(b, c, by: areInIncreasingOrder)
try _sort2(a, b, by: areInIncreasingOrder)
}
/// Sorts the elements at `elements[a]`, `elements[b]`, and `elements[c]` to
/// match the relative order of `a`, `b`, and `c`.
@inlinable
internal mutating func _sort3(
_ a: Index, _ b: Index, _ c: Index,
by areInIncreasingOrder: (Element, Element) throws -> Bool
) rethrows {
// There are thirteen possible permutations for the original ordering of
// the elements at indices `a`, `b`, and `c`. The comments in the code below
// show the relative ordering of the three elements using a three-digit
// number as shorthand for the position and comparative relationship of
// each element. For example, "312" indicates that the element at `a` is the
// largest of the three, the element at `b` is the smallest, and the element
// at `c` is the median. This hypothetical input array has a 312 ordering for
// `a`, `b`, and `c`:
//
// [ 7, 4, 3, 9, 2, 0, 3, 7, 6, 5 ]
// ^ ^ ^
// a b c
//
// - If each of the three elements is distinct, they could be ordered as any
// of the permutations of 1, 2, and 3: 123, 132, 213, 231, 312, or 321.
// - If two elements are equivalent and one is distinct, they could be
// ordered as any permutation of 1, 1, and 2 or 1, 2, and 2: 112, 121, 211,
// 122, 212, or 221.
// - If all three elements are equivalent, they are already in order: 111.
switch try (areInIncreasingOrder(self[b], self[a]),
areInIncreasingOrder(self[c], self[b])) {
case (false, false):
// 0 swaps: 123, 112, 122, 111
break
case (true, true):
// 1 swap: 321
// swap(a, c): 312->123
swapAt(a, c)
case (true, false):
// 1 swap: 213, 212 --- 2 swaps: 312, 211
// swap(a, b): 213->123, 212->122, 312->132, 211->121
swapAt(a, b)
if try areInIncreasingOrder(self[c], self[b]) {
// 132 (started as 312), 121 (started as 211)
// swap(b, c): 132->123, 121->112
swapAt(b, c)
}
case (false, true):
// 1 swap: 132, 121 --- 2 swaps: 231, 221
// swap(b, c): 132->123, 121->112, 231->213, 221->212
swapAt(b, c)
if try areInIncreasingOrder(self[b], self[a]) {
// 213 (started as 231), 212 (started as 221)
// swap(a, b): 213->123, 212->122
swapAt(a, b)
}
}
}
}
extension MutableCollection where Self: RandomAccessCollection {
@inlinable
internal mutating func _siftDown(
_ idx: Index,
within range: Range<Index>,
by areInIncreasingOrder: (Element, Element) throws -> Bool
) rethrows {
var idx = idx
var countToIndex = distance(from: range.lowerBound, to: idx)
var countFromIndex = distance(from: idx, to: range.upperBound)
// Check if left child is within bounds. If not, stop iterating, because
// there are no children of the given node in the heap.
while countToIndex + 1 < countFromIndex {
let left = index(idx, offsetBy: countToIndex + 1)
var largest = idx
if try areInIncreasingOrder(self[largest], self[left]) {
largest = left
}
// Check if right child is also within bounds before trying to examine it.
if countToIndex + 2 < countFromIndex {
let right = index(after: left)
if try areInIncreasingOrder(self[largest], self[right]) {
largest = right
}
}
// If a child is bigger than the current node, swap them and continue
// sifting down.
if largest != idx {
swapAt(idx, largest)
idx = largest
countToIndex = distance(from: range.lowerBound, to: idx)
countFromIndex = distance(from: idx, to: range.upperBound)
} else {
break
}
}
}
@inlinable
internal mutating func _heapify(
within range: Range<Index>,
by areInIncreasingOrder: (Element, Element) throws -> Bool
) rethrows {
// Here we build a heap starting from the lowest nodes and moving to the
// root. On every step we sift down the current node to obey the max-heap
// property:
// parent >= max(leftChild, rightChild)
//
// We skip the rightmost half of the array, because these nodes don't have
// any children.
let root = range.lowerBound
let half = distance(from: range.lowerBound, to: range.upperBound) / 2
var node = index(root, offsetBy: half)
while node != root {
formIndex(before: &node)
try _siftDown(node, within: range, by: areInIncreasingOrder)
}
}
@inlinable
internal mutating func _heapSort(
within range: Range<Index>,
by areInIncreasingOrder: (Element, Element) throws -> Bool
) rethrows {
var hi = range.upperBound
let lo = range.lowerBound
try _heapify(within: range, by: areInIncreasingOrder)
formIndex(before: &hi)
while hi != lo {
swapAt(lo, hi)
try _siftDown(lo, within: lo..<hi, by: areInIncreasingOrder)
formIndex(before: &hi)
}
}
}
extension MutableCollection where Self: BidirectionalCollection {
@inlinable
public // testing
mutating func _partitionLeft(
subrange: Range<Index>,
by areInIncreasingOrder: (Element, Element) throws -> Bool
) rethrows -> Index {
assert(distance(from: subrange.lowerBound, to: subrange.upperBound) >= 2)
var (low, high) = (subrange.lowerBound, subrange.upperBound)
let pivot = self[subrange.lowerBound]
// Search from end for last element equal to or less than pivot.
repeat {
formIndex(before: &high)
// Don't need a separate `high > low` check, since self[low] == pivot,
// which is a terminating condition based on comparison above.
} while try areInIncreasingOrder(pivot, self[high])
// Search from beginning for first element greater than pivot.
if high == index(before: subrange.upperBound) {
while low < high {
formIndex(after: &low)
guard try !areInIncreasingOrder(pivot, self[low]) else {
break
}
}
} else {
repeat {
formIndex(after: &low)
} while try !areInIncreasingOrder(pivot, self[low])
}
// Swap remaining elements as needed.
while low < high {
swapAt(low, high)
repeat {
formIndex(before: &high)
} while try areInIncreasingOrder(pivot, self[high])
repeat {
formIndex(after: &low)
} while try !areInIncreasingOrder(pivot, self[low])
}
// Move pivot to end of lower partition and return its position.
swapAt(subrange.lowerBound, high)
return high
}
@inlinable
public // testing
mutating func _partitionRight(
subrange: Range<Index>,
by areInIncreasingOrder: (Element, Element) throws -> Bool
) rethrows -> (Index, alreadyPartitioned: Bool) {
assert(distance(from: subrange.lowerBound, to: subrange.upperBound) >= 2)
var (low, high) = (subrange.lowerBound, subrange.upperBound)
let pivot = self[subrange.lowerBound]
// Search from start for first element greater than or equal to pivot.
repeat {
formIndex(after: &low)
} while try areInIncreasingOrder(self[low], pivot)
// Search from end for last element less than pivot.
if low == index(after: subrange.lowerBound) {
while low < high {
formIndex(before: &high)
guard try !areInIncreasingOrder(self[high], pivot) else {
break
}
}
} else {
repeat {
formIndex(before: &high)
} while try !areInIncreasingOrder(self[high], pivot)
}
let noSwapsRequired = low >= high
// Swap remaining elements as needed.
while low < high {
swapAt(low, high)
repeat {
formIndex(after: &low)
} while try areInIncreasingOrder(self[low], pivot)
repeat {
formIndex(before: &high)
} while try !areInIncreasingOrder(self[high], pivot)
}
// Move pivot to start of upper partition and return its position.
let result = index(before: low)
swapAt(subrange.lowerBound, result)
return (result, noSwapsRequired)
}
}
extension MutableCollection where Self: RandomAccessCollection {
@inlinable
public // testing
mutating func _preparePivot(
subrange: Range<Index>,
count: Int,
by areInIncreasingOrder: (Element, Element) throws -> Bool
) rethrows {
let low = subrange.lowerBound
let high = index(before: subrange.upperBound)
let mid = index(low, offsetBy: count / 2)
if count > _medianOfMediansMinCount {
// Sort three "letter groups" of elements:
// [A1, B1, C1, ..., A2, B2, C2, ..., C3, B3, A3]
let low2 = index(after: low)
let high2 = index(before: high)
let midLo = index(before: mid)
let midHi = index(after: mid)
try _sort3(low, midLo, high, by: areInIncreasingOrder)
try _sort3(low2, mid, high2, by: areInIncreasingOrder)
try _sort3(
index(after: low2), midHi, index(before: high2),
by: areInIncreasingOrder)
// After sorting, each lettered group of elements is sorted, so the
// middle three elements are the three medians. Sort those three.
try _sort3(midLo, mid, midHi, by: areInIncreasingOrder)
// The median of medians is the pivot; move it to the front.
swapAt(low, mid)
} else {
// Note the order of index parameters; the smallest element will be at `mid`,
// the middle element at `low`, and the largest element at `high`:
try _sort3(mid, low, high, by: areInIncreasingOrder)
}
}
@inlinable
internal mutating func _shuffleElements(subrange: Range<Index>, count: Int) {
guard count > _insertionSortMaxCount else { return }
var low = subrange.lowerBound
var lowQuarter = index(low, offsetBy: count / 4)
var high = index(before: subrange.upperBound)
var highQuarter = index(high, offsetBy: -count / 4)
swapAt(low, lowQuarter)
swapAt(high, highQuarter)
if count > _insertionSortMaxCount {
for _ in 0..<2 {
formIndex(after: &low)
formIndex(before: &lowQuarter)
formIndex(before: &high)
formIndex(after: &highQuarter)
swapAt(low, lowQuarter)
swapAt(high, highQuarter)
}
}
}
@inlinable
internal mutating func _pdqSortImpl(
subrange: Range<Index>,
count: Int,
isLeftmost: Bool,
remainingBadPartitions: Int,
by areInIncreasingOrder: (Element, Element) throws -> Bool
) rethrows {
guard count > _insertionSortMaxCount else {
try _insertionSort(within: subrange, by: areInIncreasingOrder)
return
}
try _preparePivot(subrange: subrange, count: count, by: areInIncreasingOrder)
if !isLeftmost {
let predecessor = index(before: subrange.lowerBound)
if try !areInIncreasingOrder(self[predecessor], self[subrange.lowerBound]) {
let newLow = try _partitionLeft(subrange: subrange, by: areInIncreasingOrder)
try _pdqSortImpl(
subrange: newLow..<subrange.upperBound,
count: distance(from: newLow, to: subrange.upperBound),
isLeftmost: false,
remainingBadPartitions: remainingBadPartitions,
by: areInIncreasingOrder)
return
}
}
let (pivot, alreadyPartitioned) = try _partitionRight(
subrange: subrange, by: areInIncreasingOrder)
let startOfUpper = index(after: pivot)
let lowerCount = distance(from: subrange.lowerBound, to: pivot)
let upperCount = count - lowerCount - 1
let minPartitionSize = count / 8
let isBadPartition = lowerCount < minPartitionSize || upperCount < minPartitionSize
var remainingBadPartitions = remainingBadPartitions
if isBadPartition {
// If we've had too many bad partitions, fall back to heap sort.
remainingBadPartitions -= 1
guard remainingBadPartitions > 0 else {
try _heapSort(within: subrange, by: areInIncreasingOrder)
return
}
// Try shuffling elements within the partition to decrease chance of poor
// pivot selection.
_shuffleElements(subrange: subrange.lowerBound..<pivot, count: lowerCount)
_shuffleElements(subrange: startOfUpper..<subrange.upperBound, count: upperCount)
} else {
// If there were no swaps required, use insertion sort to scan for already
// sorted partitions, including some minor fix-ups.
if alreadyPartitioned {
if try _partialInsertionSort(within: subrange.lowerBound..<pivot, by: areInIncreasingOrder)
&& _partialInsertionSort(within: startOfUpper..<subrange.upperBound, by: areInIncreasingOrder) {
return
}
}
}
try _pdqSortImpl(
subrange: subrange.lowerBound..<pivot,
count: lowerCount,
isLeftmost: isLeftmost,
remainingBadPartitions: remainingBadPartitions,
by: areInIncreasingOrder)
try _pdqSortImpl(
subrange: startOfUpper..<subrange.upperBound,
count: upperCount,
isLeftmost: false,
remainingBadPartitions: remainingBadPartitions,
by: areInIncreasingOrder)
}
@inlinable
public mutating func sortUnstable(
subrange: Range<Index>,
by areInIncreasingOrder: (Element, Element) throws -> Bool
) rethrows {
let count = distance(from: subrange.lowerBound, to: subrange.upperBound)
try _pdqSortImpl(
subrange: subrange,
count: count,
isLeftmost: true,
remainingBadPartitions: count._log2,
by: areInIncreasingOrder)
}
@inlinable
public mutating func sortUnstable(
by areInIncreasingOrder: (Element, Element) throws -> Bool
) rethrows {
try sortUnstable(subrange: startIndex..<endIndex, by: areInIncreasingOrder)
}
}
extension MutableCollection where Self: RandomAccessCollection, Element: Comparable {
@inlinable
public mutating func sortUnstable(subrange: Range<Index>) {
sortUnstable(subrange: subrange, by: <)
}
@inlinable
public mutating func sortUnstable() {
sortUnstable(by: <)
}
}
+1 -22
View File
@@ -10,28 +10,7 @@
//===----------------------------------------------------------------------===//
// For log(_:) and root(_:_:)
#if ALGORITHMS_DARWIN_ONLY
internal import Darwin
extension Double {
@_transparent
internal static func root(_ x: Double, _ n: Int) -> Double {
guard x >= 0 || n % 2 != 0 else { return .nan }
if n == 3 { return cbrt(x) }
return Double(signOf: x, magnitudeOf: pow(x.magnitude, 1/Double(n)))
}
@_transparent
internal static func log(_ x: Double) -> Double {
Darwin.log(x)
}
@_transparent
internal static func log(onePlus x: Double) -> Double {
Darwin.log1p(x)
}
}
#elseif swift(>=5.11)
#if swift(>=5.11)
internal import RealModule
#elseif swift(>=5.10)
import RealModule
@@ -13,7 +13,7 @@ import XCTest
import Algorithms
final class GroupedTests: XCTestCase {
private final class SampleError: Error {}
private class SampleError: Error {}
// Based on https://github.com/apple/swift/blob/4d1d8a9de5ebc132a17aee9fc267461facf89bf8/validation-test/stdlib/Dictionary.swift#L1974-L1988
+1 -1
View File
@@ -13,7 +13,7 @@ import XCTest
import Algorithms
final class KeyedTests: XCTestCase {
private final class SampleError: Error {}
private class SampleError: Error {}
func testUniqueKeys() {
let d = ["Apple", "Banana", "Cherry"].keyed(by: { $0.first! })
@@ -0,0 +1,68 @@
//===----------------------------------------------------------------------===//
//
// This source file is part of the Swift Algorithms open source project
//
// Copyright (c) 2020 Apple Inc. and the Swift project authors
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See https://swift.org/LICENSE.txt for license information
//
//===----------------------------------------------------------------------===//
import XCTest
import Algorithms
final class PDQSortTests: XCTestCase {
func testPartitionLeft() {
for _ in 1...1000 {
var a = (0...20).map { _ in Int.random(in: 1...5) }
a._preparePivot(subrange: a.indices, count: a.indices.count, by: <)
let pivot = a._partitionLeft(subrange: a.indices, by: <)
for x in a[..<pivot] {
XCTAssertLessThanOrEqual(x, a[pivot])
}
for x in a[(pivot + 1)...] {
XCTAssertGreaterThan(x, a[pivot])
}
}
}
func testPartitionRight() {
for _ in 1...1000 {
var a = (0...20).map { _ in Int.random(in: 1...5) }
a._preparePivot(subrange: a.indices, count: a.indices.count, by: <)
let (pivot, _) = a._partitionRight(subrange: a.indices, by: <)
for x in a[..<pivot] {
XCTAssertLessThan(x, a[pivot])
}
for x in a[(pivot + 1)...] {
XCTAssertGreaterThanOrEqual(x, a[pivot])
}
}
}
func testSort() {
var empty: [Int] = []
empty.sortUnstable()
var inOrder = Array(1...1000)
inOrder.sortUnstable()
XCTAssert(inOrder.isSorted())
var reversed = Array((1...1000).reversed())
reversed.sortUnstable()
XCTAssert(reversed.isSorted())
for _ in 1...1000 {
var a = (0...Int.random(in: 100...1000)).map { _ in Int.random(in: 1...50) }
a.sortUnstable()
XCTAssert(a.isSorted())
}
}
func testSpecialCase() {
var a = (1...10).shuffled() + [20] + (31...40).shuffled()
a.sortUnstable()
XCTAssert(a.isSorted())
}
}
@@ -16,7 +16,7 @@ func validateRandomSamples<S: Sequence>(
_ samples: [Int: Int],
elements: S,
expectedValue: Int,
file: StaticString = (#file), line: UInt = #line
file: StaticString = #file, line: UInt = #line
) where S.Element == Int {
let expectedRange = ((expectedValue / 3) * 2) ... ((expectedValue / 3) * 4)
XCTAssertEqualSequences(samples.keys.sorted(), elements,
@@ -78,7 +78,7 @@ func XCTAssertEqualSequences<S1: Sequence, S2: Sequence>(
_ expression1: @autoclosure () throws -> S1,
_ expression2: @autoclosure () throws -> S2,
_ message: @autoclosure () -> String = "",
file: StaticString = (#file), line: UInt = #line
file: StaticString = #file, line: UInt = #line
) rethrows where S1.Element: Equatable, S1.Element == S2.Element {
try XCTAssertEqualSequences(expression1(), expression2(), by: ==,
message(), file: file, line: line)
@@ -88,7 +88,7 @@ func XCTAssertEqualSequences<S1: Sequence, S2: Sequence>(
func XCTAssertUnorderedEqualSequences<S1: Sequence, S2: Sequence>(
_ expression1: @autoclosure () throws -> S1,
_ expression2: @autoclosure () throws -> S2,
file: StaticString = (#file), line: UInt = #line
file: StaticString = #file, line: UInt = #line
) rethrows where S1.Element: Equatable, S1.Element == S2.Element {
var s1 = Array(try expression1())
var missing: [S1.Element] = []
@@ -116,7 +116,7 @@ func XCTAssertEqualSequences<S1: Sequence, S2: Sequence>(
_ expression2: @autoclosure () throws -> S2,
by areEquivalent: (S1.Element, S1.Element) -> Bool,
_ message: @autoclosure () -> String = "",
file: StaticString = (#file), line: UInt = #line
file: StaticString = #file, line: UInt = #line
) rethrows where S1.Element == S2.Element {
func fail(_ reason: String) {
@@ -153,7 +153,7 @@ func XCTAssertEqualCollections<C1: Collection, C2: Collection>(
_ expression1: @autoclosure () throws -> C1,
_ expression2: @autoclosure () throws -> C2,
_ message: @autoclosure () -> String = "",
file: StaticString = (#file), line: UInt = #line
file: StaticString = #file, line: UInt = #line
) rethrows where C1.Element: Equatable, C1.Element == C2.Element {
let c1 = try expression1()
let c2 = try expression2()
-39
View File
@@ -1,39 +0,0 @@
//===----------------------------------------------------------------------===//
//
// This source file is part of the Swift Algorithms open source project
//
// Copyright (c) 2023 Apple Inc. and the Swift project authors
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See https://swift.org/LICENSE.txt for license information
//
//===----------------------------------------------------------------------===//
PRODUCT_NAME = Algorithms
PRODUCT_BUNDLE_IDENTIFIER = org.swift.Algorithms
SUPPORTED_PLATFORMS = macosx iphoneos iphonesimulator watchos watchsimulator appletvos appletvsimulator
ARCHS = $(ARCHS_STANDARD)
MACOSX_DEPLOYMENT_TARGET = 12.0
IPHONEOS_DEPLOYMENT_TARGET = 15.0
WATCHOS_DEPLOYMENT_TARGET = 8.0
TVOS_DEPLOYMENT_TARGET = 15.0
MARKETING_VERSION = 1.2
CURRENT_PROJECT_VERSION = 1
VERSIONING_SYSTEM = apple-generic
VERSION_INFO_PREFIX =
DYLIB_COMPATIBILITY_VERSION = $(CURRENT_PROJECT_VERSION)
DYLIB_CURRENT_VERSION = $(CURRENT_PROJECT_VERSION)
INSTALL_PATH = $(LOCAL_LIBRARY_DIR)/Frameworks
SKIP_INSTALL = YES
DYLIB_INSTALL_NAME_BASE = @rpath
LD_RUNPATH_SEARCH_PATHS = $(inherited) @executable_path/../Frameworks @loader_path/Frameworks
ENABLE_TESTABILITY = NO
ENABLE_TESTABILITY[config=Debug] = YES
GENERATE_INFOPLIST_FILE = YES
-566
View File
@@ -1,566 +0,0 @@
// !$*UTF8*$!
{
archiveVersion = 1;
classes = {
};
objectVersion = 60;
objects = {
/* Begin PBXBuildFile section */
4347CECC2CE1D54900CD2979 /* Suffix.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CEA52CE1D54900CD2979 /* Suffix.swift */; };
4347CECD2CE1D54900CD2979 /* Chunked.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CE8F2CE1D54900CD2979 /* Chunked.swift */; };
4347CECE2CE1D54900CD2979 /* Keyed.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CE9B2CE1D54900CD2979 /* Keyed.swift */; };
4347CECF2CE1D54900CD2979 /* Stride.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CEA42CE1D54900CD2979 /* Stride.swift */; };
4347CED02CE1D54900CD2979 /* Windows.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CEA82CE1D54900CD2979 /* Windows.swift */; };
4347CED32CE1D54900CD2979 /* Partition.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CE9D2CE1D54900CD2979 /* Partition.swift */; };
4347CED52CE1D54900CD2979 /* FirstNonNil.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CE952CE1D54900CD2979 /* FirstNonNil.swift */; };
4347CED62CE1D54900CD2979 /* Rotate.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CEA22CE1D54900CD2979 /* Rotate.swift */; };
4347CEDF2CE1D54900CD2979 /* Split.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CEA32CE1D54900CD2979 /* Split.swift */; };
4347CEE02CE1D54900CD2979 /* Chain.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CE8E2CE1D54900CD2979 /* Chain.swift */; };
4347CEE12CE1D54900CD2979 /* Trim.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CEA62CE1D54900CD2979 /* Trim.swift */; };
4347CEE22CE1D54900CD2979 /* Product.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CE9F2CE1D54900CD2979 /* Product.swift */; };
4347CEE42CE1D54900CD2979 /* Indexed.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CE982CE1D54900CD2979 /* Indexed.swift */; };
4347CEE52CE1D54900CD2979 /* Documentation.docc in Sources */ = {isa = PBXBuildFile; fileRef = 4347CE932CE1D54900CD2979 /* Documentation.docc */; };
4347CEE82CE1D54900CD2979 /* Combinations.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CE902CE1D54900CD2979 /* Combinations.swift */; };
4347CEE92CE1D54900CD2979 /* MinMax.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CE9C2CE1D54900CD2979 /* MinMax.swift */; };
4347CEEA2CE1D54900CD2979 /* Joined.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CE9A2CE1D54900CD2979 /* Joined.swift */; };
4347CEEB2CE1D54900CD2979 /* Grouped.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CE972CE1D54900CD2979 /* Grouped.swift */; };
4347CEED2CE1D54900CD2979 /* AdjacentPairs.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CE8D2CE1D54900CD2979 /* AdjacentPairs.swift */; };
4347CEEE2CE1D54900CD2979 /* Permutations.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CE9E2CE1D54900CD2979 /* Permutations.swift */; };
4347CEF02CE1D54900CD2979 /* FlattenCollection.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CE962CE1D54900CD2979 /* FlattenCollection.swift */; };
4347CEF32CE1D54900CD2979 /* Reductions.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CEA12CE1D54900CD2979 /* Reductions.swift */; };
4347CEF42CE1D54900CD2979 /* Intersperse.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CE992CE1D54900CD2979 /* Intersperse.swift */; };
4347CEF52CE1D54900CD2979 /* RandomSample.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CEA02CE1D54900CD2979 /* RandomSample.swift */; };
4347CEFB2CE1D54900CD2979 /* Unique.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CEA72CE1D54900CD2979 /* Unique.swift */; };
4347CEFD2CE1D54900CD2979 /* EitherSequence.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CE942CE1D54900CD2979 /* EitherSequence.swift */; };
4347CEFE2CE1D54900CD2979 /* Cycle.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CE922CE1D54900CD2979 /* Cycle.swift */; };
4347CEFF2CE1D54900CD2979 /* Compacted.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CE912CE1D54900CD2979 /* Compacted.swift */; };
4347CF262CE1D56C00CD2979 /* IndexedTests.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CF112CE1D56C00CD2979 /* IndexedTests.swift */; };
4347CF272CE1D56C00CD2979 /* RotateTests.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CF1B2CE1D56C00CD2979 /* RotateTests.swift */; };
4347CF282CE1D56C00CD2979 /* RandomSampleTests.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CF192CE1D56C00CD2979 /* RandomSampleTests.swift */; };
4347CF292CE1D56C00CD2979 /* StrideTests.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CF1D2CE1D56C00CD2979 /* StrideTests.swift */; };
4347CF2A2CE1D56C00CD2979 /* IntersperseTests.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CF122CE1D56C00CD2979 /* IntersperseTests.swift */; };
4347CF2B2CE1D56C00CD2979 /* CombinationsTests.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CF0C2CE1D56C00CD2979 /* CombinationsTests.swift */; };
4347CF2C2CE1D56C00CD2979 /* SplitTests.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CF1C2CE1D56C00CD2979 /* SplitTests.swift */; };
4347CF2D2CE1D56C00CD2979 /* ReductionsTests.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CF1A2CE1D56C00CD2979 /* ReductionsTests.swift */; };
4347CF2E2CE1D56C00CD2979 /* TrimTests.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CF202CE1D56C00CD2979 /* TrimTests.swift */; };
4347CF2F2CE1D56C00CD2979 /* FirstNonNilTests.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CF0F2CE1D56C00CD2979 /* FirstNonNilTests.swift */; };
4347CF302CE1D56C00CD2979 /* SuffixTests.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CF1E2CE1D56C00CD2979 /* SuffixTests.swift */; };
4347CF312CE1D56C00CD2979 /* KeyedTests.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CF142CE1D56C00CD2979 /* KeyedTests.swift */; };
4347CF322CE1D56C00CD2979 /* UniqueTests.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CF222CE1D56C00CD2979 /* UniqueTests.swift */; };
4347CF332CE1D56C00CD2979 /* PermutationsTests.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CF172CE1D56C00CD2979 /* PermutationsTests.swift */; };
4347CF342CE1D56C00CD2979 /* CompactedTests.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CF0D2CE1D56C00CD2979 /* CompactedTests.swift */; };
4347CF352CE1D56C00CD2979 /* UniquePermutationsTests.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CF212CE1D56C00CD2979 /* UniquePermutationsTests.swift */; };
4347CF362CE1D56C00CD2979 /* GroupedTests.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CF102CE1D56C00CD2979 /* GroupedTests.swift */; };
4347CF372CE1D56C00CD2979 /* MinMaxTests.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CF152CE1D56C00CD2979 /* MinMaxTests.swift */; };
4347CF382CE1D56C00CD2979 /* ProductTests.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CF182CE1D56C00CD2979 /* ProductTests.swift */; };
4347CF392CE1D56C00CD2979 /* ChainTests.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CF0A2CE1D56C00CD2979 /* ChainTests.swift */; };
4347CF3A2CE1D56C00CD2979 /* ChunkedTests.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CF0B2CE1D56C00CD2979 /* ChunkedTests.swift */; };
4347CF3B2CE1D56C00CD2979 /* PartitionTests.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CF162CE1D56C00CD2979 /* PartitionTests.swift */; };
4347CF3C2CE1D56C00CD2979 /* CycleTests.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CF0E2CE1D56C00CD2979 /* CycleTests.swift */; };
4347CF3D2CE1D56C00CD2979 /* AdjacentPairsTests.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CF092CE1D56C00CD2979 /* AdjacentPairsTests.swift */; };
4347CF3E2CE1D56C00CD2979 /* TestUtilities.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CF1F2CE1D56C00CD2979 /* TestUtilities.swift */; };
4347CF3F2CE1D56C00CD2979 /* WindowsTests.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CF232CE1D56C00CD2979 /* WindowsTests.swift */; };
4347CF402CE1D56C00CD2979 /* JoinedTests.swift in Sources */ = {isa = PBXBuildFile; fileRef = 4347CF132CE1D56C00CD2979 /* JoinedTests.swift */; };
7D489E4829CE969D00499B21 /* Algorithms.framework in Frameworks */ = {isa = PBXBuildFile; fileRef = 7D489E3F29CE969D00499B21 /* Algorithms.framework */; };
/* End PBXBuildFile section */
/* Begin PBXContainerItemProxy section */
7D489E4929CE969D00499B21 /* PBXContainerItemProxy */ = {
isa = PBXContainerItemProxy;
containerPortal = 7D489E3629CE969D00499B21 /* Project object */;
proxyType = 1;
remoteGlobalIDString = 7D489E3E29CE969D00499B21;
remoteInfo = Algorithms;
};
/* End PBXContainerItemProxy section */
/* Begin PBXFileReference section */
4347CE862CE1D54900CD2979 /* CHANGELOG.md */ = {isa = PBXFileReference; lastKnownFileType = net.daringfireball.markdown; name = CHANGELOG.md; path = ../CHANGELOG.md; sourceTree = SOURCE_ROOT; };
4347CE872CE1D54900CD2979 /* CODE_OF_CONDUCT.md */ = {isa = PBXFileReference; lastKnownFileType = net.daringfireball.markdown; name = CODE_OF_CONDUCT.md; path = ../CODE_OF_CONDUCT.md; sourceTree = SOURCE_ROOT; };
4347CE882CE1D54900CD2979 /* CONTRIBUTING.md */ = {isa = PBXFileReference; lastKnownFileType = net.daringfireball.markdown; name = CONTRIBUTING.md; path = ../CONTRIBUTING.md; sourceTree = SOURCE_ROOT; };
4347CE892CE1D54900CD2979 /* LICENSE.txt */ = {isa = PBXFileReference; lastKnownFileType = text; name = LICENSE.txt; path = ../LICENSE.txt; sourceTree = SOURCE_ROOT; };
4347CE8A2CE1D54900CD2979 /* Package.resolved */ = {isa = PBXFileReference; lastKnownFileType = text; name = Package.resolved; path = ../Package.resolved; sourceTree = SOURCE_ROOT; };
4347CE8B2CE1D54900CD2979 /* Package.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; name = Package.swift; path = ../Package.swift; sourceTree = SOURCE_ROOT; };
4347CE8C2CE1D54900CD2979 /* README.md */ = {isa = PBXFileReference; lastKnownFileType = net.daringfireball.markdown; name = README.md; path = ../README.md; sourceTree = SOURCE_ROOT; };
4347CE8D2CE1D54900CD2979 /* AdjacentPairs.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = AdjacentPairs.swift; sourceTree = "<group>"; };
4347CE8E2CE1D54900CD2979 /* Chain.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = Chain.swift; sourceTree = "<group>"; };
4347CE8F2CE1D54900CD2979 /* Chunked.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = Chunked.swift; sourceTree = "<group>"; };
4347CE902CE1D54900CD2979 /* Combinations.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = Combinations.swift; sourceTree = "<group>"; };
4347CE912CE1D54900CD2979 /* Compacted.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = Compacted.swift; sourceTree = "<group>"; };
4347CE922CE1D54900CD2979 /* Cycle.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = Cycle.swift; sourceTree = "<group>"; };
4347CE932CE1D54900CD2979 /* Documentation.docc */ = {isa = PBXFileReference; lastKnownFileType = folder.documentationcatalog; path = Documentation.docc; sourceTree = "<group>"; };
4347CE942CE1D54900CD2979 /* EitherSequence.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = EitherSequence.swift; sourceTree = "<group>"; };
4347CE952CE1D54900CD2979 /* FirstNonNil.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = FirstNonNil.swift; sourceTree = "<group>"; };
4347CE962CE1D54900CD2979 /* FlattenCollection.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = FlattenCollection.swift; sourceTree = "<group>"; };
4347CE972CE1D54900CD2979 /* Grouped.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = Grouped.swift; sourceTree = "<group>"; };
4347CE982CE1D54900CD2979 /* Indexed.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = Indexed.swift; sourceTree = "<group>"; };
4347CE992CE1D54900CD2979 /* Intersperse.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = Intersperse.swift; sourceTree = "<group>"; };
4347CE9A2CE1D54900CD2979 /* Joined.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = Joined.swift; sourceTree = "<group>"; };
4347CE9B2CE1D54900CD2979 /* Keyed.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = Keyed.swift; sourceTree = "<group>"; };
4347CE9C2CE1D54900CD2979 /* MinMax.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = MinMax.swift; sourceTree = "<group>"; };
4347CE9D2CE1D54900CD2979 /* Partition.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = Partition.swift; sourceTree = "<group>"; };
4347CE9E2CE1D54900CD2979 /* Permutations.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = Permutations.swift; sourceTree = "<group>"; };
4347CE9F2CE1D54900CD2979 /* Product.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = Product.swift; sourceTree = "<group>"; };
4347CEA02CE1D54900CD2979 /* RandomSample.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = RandomSample.swift; sourceTree = "<group>"; };
4347CEA12CE1D54900CD2979 /* Reductions.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = Reductions.swift; sourceTree = "<group>"; };
4347CEA22CE1D54900CD2979 /* Rotate.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = Rotate.swift; sourceTree = "<group>"; };
4347CEA32CE1D54900CD2979 /* Split.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = Split.swift; sourceTree = "<group>"; };
4347CEA42CE1D54900CD2979 /* Stride.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = Stride.swift; sourceTree = "<group>"; };
4347CEA52CE1D54900CD2979 /* Suffix.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = Suffix.swift; sourceTree = "<group>"; };
4347CEA62CE1D54900CD2979 /* Trim.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = Trim.swift; sourceTree = "<group>"; };
4347CEA72CE1D54900CD2979 /* Unique.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = Unique.swift; sourceTree = "<group>"; };
4347CEA82CE1D54900CD2979 /* Windows.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = Windows.swift; sourceTree = "<group>"; };
4347CEC82CE1D54900CD2979 /* swift-algorithms.xcworkspace */ = {isa = PBXFileReference; lastKnownFileType = wrapper.workspace; path = "swift-algorithms.xcworkspace"; sourceTree = "<group>"; };
4347CF092CE1D56C00CD2979 /* AdjacentPairsTests.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = AdjacentPairsTests.swift; sourceTree = "<group>"; };
4347CF0A2CE1D56C00CD2979 /* ChainTests.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = ChainTests.swift; sourceTree = "<group>"; };
4347CF0B2CE1D56C00CD2979 /* ChunkedTests.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = ChunkedTests.swift; sourceTree = "<group>"; };
4347CF0C2CE1D56C00CD2979 /* CombinationsTests.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = CombinationsTests.swift; sourceTree = "<group>"; };
4347CF0D2CE1D56C00CD2979 /* CompactedTests.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = CompactedTests.swift; sourceTree = "<group>"; };
4347CF0E2CE1D56C00CD2979 /* CycleTests.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = CycleTests.swift; sourceTree = "<group>"; };
4347CF0F2CE1D56C00CD2979 /* FirstNonNilTests.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = FirstNonNilTests.swift; sourceTree = "<group>"; };
4347CF102CE1D56C00CD2979 /* GroupedTests.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = GroupedTests.swift; sourceTree = "<group>"; };
4347CF112CE1D56C00CD2979 /* IndexedTests.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = IndexedTests.swift; sourceTree = "<group>"; };
4347CF122CE1D56C00CD2979 /* IntersperseTests.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = IntersperseTests.swift; sourceTree = "<group>"; };
4347CF132CE1D56C00CD2979 /* JoinedTests.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = JoinedTests.swift; sourceTree = "<group>"; };
4347CF142CE1D56C00CD2979 /* KeyedTests.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = KeyedTests.swift; sourceTree = "<group>"; };
4347CF152CE1D56C00CD2979 /* MinMaxTests.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = MinMaxTests.swift; sourceTree = "<group>"; };
4347CF162CE1D56C00CD2979 /* PartitionTests.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = PartitionTests.swift; sourceTree = "<group>"; };
4347CF172CE1D56C00CD2979 /* PermutationsTests.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = PermutationsTests.swift; sourceTree = "<group>"; };
4347CF182CE1D56C00CD2979 /* ProductTests.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = ProductTests.swift; sourceTree = "<group>"; };
4347CF192CE1D56C00CD2979 /* RandomSampleTests.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = RandomSampleTests.swift; sourceTree = "<group>"; };
4347CF1A2CE1D56C00CD2979 /* ReductionsTests.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = ReductionsTests.swift; sourceTree = "<group>"; };
4347CF1B2CE1D56C00CD2979 /* RotateTests.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = RotateTests.swift; sourceTree = "<group>"; };
4347CF1C2CE1D56C00CD2979 /* SplitTests.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = SplitTests.swift; sourceTree = "<group>"; };
4347CF1D2CE1D56C00CD2979 /* StrideTests.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = StrideTests.swift; sourceTree = "<group>"; };
4347CF1E2CE1D56C00CD2979 /* SuffixTests.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = SuffixTests.swift; sourceTree = "<group>"; };
4347CF1F2CE1D56C00CD2979 /* TestUtilities.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = TestUtilities.swift; sourceTree = "<group>"; };
4347CF202CE1D56C00CD2979 /* TrimTests.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = TrimTests.swift; sourceTree = "<group>"; };
4347CF212CE1D56C00CD2979 /* UniquePermutationsTests.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = UniquePermutationsTests.swift; sourceTree = "<group>"; };
4347CF222CE1D56C00CD2979 /* UniqueTests.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = UniqueTests.swift; sourceTree = "<group>"; };
4347CF232CE1D56C00CD2979 /* WindowsTests.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = WindowsTests.swift; sourceTree = "<group>"; };
7D489E3F29CE969D00499B21 /* Algorithms.framework */ = {isa = PBXFileReference; explicitFileType = wrapper.framework; includeInIndex = 0; path = Algorithms.framework; sourceTree = BUILT_PRODUCTS_DIR; };
7D489E4729CE969D00499B21 /* AlgorithmsTests.xctest */ = {isa = PBXFileReference; explicitFileType = wrapper.cfbundle; includeInIndex = 0; path = AlgorithmsTests.xctest; sourceTree = BUILT_PRODUCTS_DIR; };
7D489ED629CE96DA00499B21 /* README.md */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = net.daringfireball.markdown; path = README.md; sourceTree = "<group>"; };
7D489F6F29CE986A00499B21 /* Shared.xcconfig */ = {isa = PBXFileReference; lastKnownFileType = text.xcconfig; path = Shared.xcconfig; sourceTree = "<group>"; };
7D489F7029CE986A00499B21 /* Algorithms.xcconfig */ = {isa = PBXFileReference; lastKnownFileType = text.xcconfig; path = Algorithms.xcconfig; sourceTree = "<group>"; };
7D489F7129CE986A00499B21 /* AlgorithmsTests.xcconfig */ = {isa = PBXFileReference; lastKnownFileType = text.xcconfig; path = AlgorithmsTests.xcconfig; sourceTree = "<group>"; };
BB63DC6A29D782010054E9C2 /* Algorithms.xctestplan */ = {isa = PBXFileReference; lastKnownFileType = text; path = Algorithms.xctestplan; sourceTree = "<group>"; };
/* End PBXFileReference section */
/* Begin PBXFrameworksBuildPhase section */
7D489E3C29CE969D00499B21 /* Frameworks */ = {
isa = PBXFrameworksBuildPhase;
buildActionMask = 2147483647;
files = (
);
runOnlyForDeploymentPostprocessing = 0;
};
7D489E4429CE969D00499B21 /* Frameworks */ = {
isa = PBXFrameworksBuildPhase;
buildActionMask = 2147483647;
files = (
7D489E4829CE969D00499B21 /* Algorithms.framework in Frameworks */,
);
runOnlyForDeploymentPostprocessing = 0;
};
/* End PBXFrameworksBuildPhase section */
/* Begin PBXGroup section */
4347CEA92CE1D54900CD2979 /* Algorithms */ = {
isa = PBXGroup;
children = (
4347CE8D2CE1D54900CD2979 /* AdjacentPairs.swift */,
4347CE8E2CE1D54900CD2979 /* Chain.swift */,
4347CE8F2CE1D54900CD2979 /* Chunked.swift */,
4347CE902CE1D54900CD2979 /* Combinations.swift */,
4347CE912CE1D54900CD2979 /* Compacted.swift */,
4347CE922CE1D54900CD2979 /* Cycle.swift */,
4347CE932CE1D54900CD2979 /* Documentation.docc */,
4347CE942CE1D54900CD2979 /* EitherSequence.swift */,
4347CE952CE1D54900CD2979 /* FirstNonNil.swift */,
4347CE962CE1D54900CD2979 /* FlattenCollection.swift */,
4347CE972CE1D54900CD2979 /* Grouped.swift */,
4347CE982CE1D54900CD2979 /* Indexed.swift */,
4347CE992CE1D54900CD2979 /* Intersperse.swift */,
4347CE9A2CE1D54900CD2979 /* Joined.swift */,
4347CE9B2CE1D54900CD2979 /* Keyed.swift */,
4347CE9C2CE1D54900CD2979 /* MinMax.swift */,
4347CE9D2CE1D54900CD2979 /* Partition.swift */,
4347CE9E2CE1D54900CD2979 /* Permutations.swift */,
4347CE9F2CE1D54900CD2979 /* Product.swift */,
4347CEA02CE1D54900CD2979 /* RandomSample.swift */,
4347CEA12CE1D54900CD2979 /* Reductions.swift */,
4347CEA22CE1D54900CD2979 /* Rotate.swift */,
4347CEA32CE1D54900CD2979 /* Split.swift */,
4347CEA42CE1D54900CD2979 /* Stride.swift */,
4347CEA52CE1D54900CD2979 /* Suffix.swift */,
4347CEA62CE1D54900CD2979 /* Trim.swift */,
4347CEA72CE1D54900CD2979 /* Unique.swift */,
4347CEA82CE1D54900CD2979 /* Windows.swift */,
);
path = Algorithms;
sourceTree = "<group>";
};
4347CEAA2CE1D54900CD2979 /* Sources */ = {
isa = PBXGroup;
children = (
4347CEA92CE1D54900CD2979 /* Algorithms */,
);
name = Sources;
path = ../Sources;
sourceTree = SOURCE_ROOT;
};
4347CEC92CE1D54900CD2979 /* Tools */ = {
isa = PBXGroup;
children = (
4347CEC82CE1D54900CD2979 /* swift-algorithms.xcworkspace */,
);
name = Tools;
path = ../Tools;
sourceTree = SOURCE_ROOT;
};
4347CF242CE1D56C00CD2979 /* SwiftAlgorithmsTests */ = {
isa = PBXGroup;
children = (
4347CF092CE1D56C00CD2979 /* AdjacentPairsTests.swift */,
4347CF0A2CE1D56C00CD2979 /* ChainTests.swift */,
4347CF0B2CE1D56C00CD2979 /* ChunkedTests.swift */,
4347CF0C2CE1D56C00CD2979 /* CombinationsTests.swift */,
4347CF0D2CE1D56C00CD2979 /* CompactedTests.swift */,
4347CF0E2CE1D56C00CD2979 /* CycleTests.swift */,
4347CF0F2CE1D56C00CD2979 /* FirstNonNilTests.swift */,
4347CF102CE1D56C00CD2979 /* GroupedTests.swift */,
4347CF112CE1D56C00CD2979 /* IndexedTests.swift */,
4347CF122CE1D56C00CD2979 /* IntersperseTests.swift */,
4347CF132CE1D56C00CD2979 /* JoinedTests.swift */,
4347CF142CE1D56C00CD2979 /* KeyedTests.swift */,
4347CF152CE1D56C00CD2979 /* MinMaxTests.swift */,
4347CF162CE1D56C00CD2979 /* PartitionTests.swift */,
4347CF172CE1D56C00CD2979 /* PermutationsTests.swift */,
4347CF182CE1D56C00CD2979 /* ProductTests.swift */,
4347CF192CE1D56C00CD2979 /* RandomSampleTests.swift */,
4347CF1A2CE1D56C00CD2979 /* ReductionsTests.swift */,
4347CF1B2CE1D56C00CD2979 /* RotateTests.swift */,
4347CF1C2CE1D56C00CD2979 /* SplitTests.swift */,
4347CF1D2CE1D56C00CD2979 /* StrideTests.swift */,
4347CF1E2CE1D56C00CD2979 /* SuffixTests.swift */,
4347CF1F2CE1D56C00CD2979 /* TestUtilities.swift */,
4347CF202CE1D56C00CD2979 /* TrimTests.swift */,
4347CF212CE1D56C00CD2979 /* UniquePermutationsTests.swift */,
4347CF222CE1D56C00CD2979 /* UniqueTests.swift */,
4347CF232CE1D56C00CD2979 /* WindowsTests.swift */,
);
path = SwiftAlgorithmsTests;
sourceTree = "<group>";
};
4347CF252CE1D56C00CD2979 /* Tests */ = {
isa = PBXGroup;
children = (
4347CF242CE1D56C00CD2979 /* SwiftAlgorithmsTests */,
);
name = Tests;
path = ../Tests;
sourceTree = SOURCE_ROOT;
};
7D489E3529CE969D00499B21 = {
isa = PBXGroup;
children = (
4347CE862CE1D54900CD2979 /* CHANGELOG.md */,
4347CE872CE1D54900CD2979 /* CODE_OF_CONDUCT.md */,
4347CE882CE1D54900CD2979 /* CONTRIBUTING.md */,
4347CE892CE1D54900CD2979 /* LICENSE.txt */,
4347CE8A2CE1D54900CD2979 /* Package.resolved */,
4347CE8B2CE1D54900CD2979 /* Package.swift */,
4347CE8C2CE1D54900CD2979 /* README.md */,
4347CEAA2CE1D54900CD2979 /* Sources */,
4347CF252CE1D56C00CD2979 /* Tests */,
4347CEC92CE1D54900CD2979 /* Tools */,
7D489ED229CE96DA00499B21 /* Xcode */,
7D489E4029CE969D00499B21 /* Products */,
);
sourceTree = "<group>";
tabWidth = 8;
};
7D489E4029CE969D00499B21 /* Products */ = {
isa = PBXGroup;
children = (
7D489E3F29CE969D00499B21 /* Algorithms.framework */,
7D489E4729CE969D00499B21 /* AlgorithmsTests.xctest */,
);
name = Products;
sourceTree = "<group>";
};
7D489ED229CE96DA00499B21 /* Xcode */ = {
isa = PBXGroup;
children = (
BB63DC6A29D782010054E9C2 /* Algorithms.xctestplan */,
7D489F6F29CE986A00499B21 /* Shared.xcconfig */,
7D489F7029CE986A00499B21 /* Algorithms.xcconfig */,
7D489F7129CE986A00499B21 /* AlgorithmsTests.xcconfig */,
7D489ED629CE96DA00499B21 /* README.md */,
);
name = Xcode;
sourceTree = "<group>";
};
/* End PBXGroup section */
/* Begin PBXHeadersBuildPhase section */
7D489E3A29CE969D00499B21 /* Headers */ = {
isa = PBXHeadersBuildPhase;
buildActionMask = 2147483647;
files = (
);
runOnlyForDeploymentPostprocessing = 0;
};
/* End PBXHeadersBuildPhase section */
/* Begin PBXNativeTarget section */
7D489E3E29CE969D00499B21 /* Algorithms */ = {
isa = PBXNativeTarget;
buildConfigurationList = 7D489E5129CE969D00499B21 /* Build configuration list for PBXNativeTarget "Algorithms" */;
buildPhases = (
7D489E3A29CE969D00499B21 /* Headers */,
7D489E3B29CE969D00499B21 /* Sources */,
7D489E3C29CE969D00499B21 /* Frameworks */,
7D489E3D29CE969D00499B21 /* Resources */,
);
buildRules = (
);
dependencies = (
);
name = Algorithms;
productName = Algorithms;
productReference = 7D489E3F29CE969D00499B21 /* Algorithms.framework */;
productType = "com.apple.product-type.framework";
};
7D489E4629CE969D00499B21 /* AlgorithmsTests */ = {
isa = PBXNativeTarget;
buildConfigurationList = 7D489E5429CE969D00499B21 /* Build configuration list for PBXNativeTarget "AlgorithmsTests" */;
buildPhases = (
7D489E4329CE969D00499B21 /* Sources */,
7D489E4429CE969D00499B21 /* Frameworks */,
7D489E4529CE969D00499B21 /* Resources */,
);
buildRules = (
);
dependencies = (
7D489E4A29CE969D00499B21 /* PBXTargetDependency */,
);
name = AlgorithmsTests;
productName = AlgorithmsTests;
productReference = 7D489E4729CE969D00499B21 /* AlgorithmsTests.xctest */;
productType = "com.apple.product-type.bundle.unit-test";
};
/* End PBXNativeTarget section */
/* Begin PBXProject section */
7D489E3629CE969D00499B21 /* Project object */ = {
isa = PBXProject;
attributes = {
BuildIndependentTargetsInParallel = 1;
LastSwiftUpdateCheck = 1420;
LastUpgradeCheck = 1500;
TargetAttributes = {
7D489E3E29CE969D00499B21 = {
CreatedOnToolsVersion = 14.2;
LastSwiftMigration = 1420;
};
7D489E4629CE969D00499B21 = {
CreatedOnToolsVersion = 14.2;
};
};
};
buildConfigurationList = 7D489E3929CE969D00499B21 /* Build configuration list for PBXProject "Algorithms" */;
compatibilityVersion = "Xcode 15.0";
developmentRegion = en;
hasScannedForEncodings = 0;
knownRegions = (
en,
Base,
);
mainGroup = 7D489E3529CE969D00499B21;
productRefGroup = 7D489E4029CE969D00499B21 /* Products */;
projectDirPath = "";
projectRoot = "";
targets = (
7D489E3E29CE969D00499B21 /* Algorithms */,
7D489E4629CE969D00499B21 /* AlgorithmsTests */,
);
};
/* End PBXProject section */
/* Begin PBXResourcesBuildPhase section */
7D489E3D29CE969D00499B21 /* Resources */ = {
isa = PBXResourcesBuildPhase;
buildActionMask = 2147483647;
files = (
);
runOnlyForDeploymentPostprocessing = 0;
};
7D489E4529CE969D00499B21 /* Resources */ = {
isa = PBXResourcesBuildPhase;
buildActionMask = 2147483647;
files = (
);
runOnlyForDeploymentPostprocessing = 0;
};
/* End PBXResourcesBuildPhase section */
/* Begin PBXSourcesBuildPhase section */
7D489E3B29CE969D00499B21 /* Sources */ = {
isa = PBXSourcesBuildPhase;
buildActionMask = 2147483647;
files = (
4347CECC2CE1D54900CD2979 /* Suffix.swift in Sources */,
4347CECD2CE1D54900CD2979 /* Chunked.swift in Sources */,
4347CECE2CE1D54900CD2979 /* Keyed.swift in Sources */,
4347CECF2CE1D54900CD2979 /* Stride.swift in Sources */,
4347CED02CE1D54900CD2979 /* Windows.swift in Sources */,
4347CED32CE1D54900CD2979 /* Partition.swift in Sources */,
4347CED52CE1D54900CD2979 /* FirstNonNil.swift in Sources */,
4347CED62CE1D54900CD2979 /* Rotate.swift in Sources */,
4347CEDF2CE1D54900CD2979 /* Split.swift in Sources */,
4347CEE02CE1D54900CD2979 /* Chain.swift in Sources */,
4347CEE12CE1D54900CD2979 /* Trim.swift in Sources */,
4347CEE22CE1D54900CD2979 /* Product.swift in Sources */,
4347CEE42CE1D54900CD2979 /* Indexed.swift in Sources */,
4347CEE52CE1D54900CD2979 /* Documentation.docc in Sources */,
4347CEE82CE1D54900CD2979 /* Combinations.swift in Sources */,
4347CEE92CE1D54900CD2979 /* MinMax.swift in Sources */,
4347CEEA2CE1D54900CD2979 /* Joined.swift in Sources */,
4347CEEB2CE1D54900CD2979 /* Grouped.swift in Sources */,
4347CEED2CE1D54900CD2979 /* AdjacentPairs.swift in Sources */,
4347CEEE2CE1D54900CD2979 /* Permutations.swift in Sources */,
4347CEF02CE1D54900CD2979 /* FlattenCollection.swift in Sources */,
4347CEF32CE1D54900CD2979 /* Reductions.swift in Sources */,
4347CEF42CE1D54900CD2979 /* Intersperse.swift in Sources */,
4347CEF52CE1D54900CD2979 /* RandomSample.swift in Sources */,
4347CEFB2CE1D54900CD2979 /* Unique.swift in Sources */,
4347CEFD2CE1D54900CD2979 /* EitherSequence.swift in Sources */,
4347CEFE2CE1D54900CD2979 /* Cycle.swift in Sources */,
4347CEFF2CE1D54900CD2979 /* Compacted.swift in Sources */,
);
runOnlyForDeploymentPostprocessing = 0;
};
7D489E4329CE969D00499B21 /* Sources */ = {
isa = PBXSourcesBuildPhase;
buildActionMask = 2147483647;
files = (
4347CF262CE1D56C00CD2979 /* IndexedTests.swift in Sources */,
4347CF272CE1D56C00CD2979 /* RotateTests.swift in Sources */,
4347CF282CE1D56C00CD2979 /* RandomSampleTests.swift in Sources */,
4347CF292CE1D56C00CD2979 /* StrideTests.swift in Sources */,
4347CF2A2CE1D56C00CD2979 /* IntersperseTests.swift in Sources */,
4347CF2B2CE1D56C00CD2979 /* CombinationsTests.swift in Sources */,
4347CF2C2CE1D56C00CD2979 /* SplitTests.swift in Sources */,
4347CF2D2CE1D56C00CD2979 /* ReductionsTests.swift in Sources */,
4347CF2E2CE1D56C00CD2979 /* TrimTests.swift in Sources */,
4347CF2F2CE1D56C00CD2979 /* FirstNonNilTests.swift in Sources */,
4347CF302CE1D56C00CD2979 /* SuffixTests.swift in Sources */,
4347CF312CE1D56C00CD2979 /* KeyedTests.swift in Sources */,
4347CF322CE1D56C00CD2979 /* UniqueTests.swift in Sources */,
4347CF332CE1D56C00CD2979 /* PermutationsTests.swift in Sources */,
4347CF342CE1D56C00CD2979 /* CompactedTests.swift in Sources */,
4347CF352CE1D56C00CD2979 /* UniquePermutationsTests.swift in Sources */,
4347CF362CE1D56C00CD2979 /* GroupedTests.swift in Sources */,
4347CF372CE1D56C00CD2979 /* MinMaxTests.swift in Sources */,
4347CF382CE1D56C00CD2979 /* ProductTests.swift in Sources */,
4347CF392CE1D56C00CD2979 /* ChainTests.swift in Sources */,
4347CF3A2CE1D56C00CD2979 /* ChunkedTests.swift in Sources */,
4347CF3B2CE1D56C00CD2979 /* PartitionTests.swift in Sources */,
4347CF3C2CE1D56C00CD2979 /* CycleTests.swift in Sources */,
4347CF3D2CE1D56C00CD2979 /* AdjacentPairsTests.swift in Sources */,
4347CF3E2CE1D56C00CD2979 /* TestUtilities.swift in Sources */,
4347CF3F2CE1D56C00CD2979 /* WindowsTests.swift in Sources */,
4347CF402CE1D56C00CD2979 /* JoinedTests.swift in Sources */,
);
runOnlyForDeploymentPostprocessing = 0;
};
/* End PBXSourcesBuildPhase section */
/* Begin PBXTargetDependency section */
7D489E4A29CE969D00499B21 /* PBXTargetDependency */ = {
isa = PBXTargetDependency;
target = 7D489E3E29CE969D00499B21 /* Algorithms */;
targetProxy = 7D489E4929CE969D00499B21 /* PBXContainerItemProxy */;
};
/* End PBXTargetDependency section */
/* Begin XCBuildConfiguration section */
7D489E4F29CE969D00499B21 /* Debug */ = {
isa = XCBuildConfiguration;
baseConfigurationReference = 7D489F6F29CE986A00499B21 /* Shared.xcconfig */;
buildSettings = {
};
name = Debug;
};
7D489E5029CE969D00499B21 /* Release */ = {
isa = XCBuildConfiguration;
baseConfigurationReference = 7D489F6F29CE986A00499B21 /* Shared.xcconfig */;
buildSettings = {
};
name = Release;
};
7D489E5229CE969D00499B21 /* Debug */ = {
isa = XCBuildConfiguration;
baseConfigurationReference = 7D489F7029CE986A00499B21 /* Algorithms.xcconfig */;
buildSettings = {
};
name = Debug;
};
7D489E5329CE969D00499B21 /* Release */ = {
isa = XCBuildConfiguration;
baseConfigurationReference = 7D489F7029CE986A00499B21 /* Algorithms.xcconfig */;
buildSettings = {
};
name = Release;
};
7D489E5529CE969D00499B21 /* Debug */ = {
isa = XCBuildConfiguration;
baseConfigurationReference = 7D489F7129CE986A00499B21 /* AlgorithmsTests.xcconfig */;
buildSettings = {
};
name = Debug;
};
7D489E5629CE969D00499B21 /* Release */ = {
isa = XCBuildConfiguration;
baseConfigurationReference = 7D489F7129CE986A00499B21 /* AlgorithmsTests.xcconfig */;
buildSettings = {
};
name = Release;
};
/* End XCBuildConfiguration section */
/* Begin XCConfigurationList section */
7D489E3929CE969D00499B21 /* Build configuration list for PBXProject "Algorithms" */ = {
isa = XCConfigurationList;
buildConfigurations = (
7D489E4F29CE969D00499B21 /* Debug */,
7D489E5029CE969D00499B21 /* Release */,
);
defaultConfigurationIsVisible = 0;
defaultConfigurationName = Release;
};
7D489E5129CE969D00499B21 /* Build configuration list for PBXNativeTarget "Algorithms" */ = {
isa = XCConfigurationList;
buildConfigurations = (
7D489E5229CE969D00499B21 /* Debug */,
7D489E5329CE969D00499B21 /* Release */,
);
defaultConfigurationIsVisible = 0;
defaultConfigurationName = Release;
};
7D489E5429CE969D00499B21 /* Build configuration list for PBXNativeTarget "AlgorithmsTests" */ = {
isa = XCConfigurationList;
buildConfigurations = (
7D489E5529CE969D00499B21 /* Debug */,
7D489E5629CE969D00499B21 /* Release */,
);
defaultConfigurationIsVisible = 0;
defaultConfigurationName = Release;
};
/* End XCConfigurationList section */
};
rootObject = 7D489E3629CE969D00499B21 /* Project object */;
}
@@ -1,7 +0,0 @@
<?xml version="1.0" encoding="UTF-8"?>
<Workspace
version = "1.0">
<FileRef
location = "self:">
</FileRef>
</Workspace>
@@ -1,8 +0,0 @@
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
<plist version="1.0">
<dict>
<key>IDEDidComputeMac32BitWarning</key>
<true/>
</dict>
</plist>
@@ -1,84 +0,0 @@
<?xml version="1.0" encoding="UTF-8"?>
<Scheme
LastUpgradeVersion = "1500"
version = "1.7">
<BuildAction
parallelizeBuildables = "YES"
buildImplicitDependencies = "YES">
<BuildActionEntries>
<BuildActionEntry
buildForTesting = "YES"
buildForRunning = "YES"
buildForProfiling = "YES"
buildForArchiving = "YES"
buildForAnalyzing = "YES">
<BuildableReference
BuildableIdentifier = "primary"
BlueprintIdentifier = "7D489E3E29CE969D00499B21"
BuildableName = "Algorithms.framework"
BlueprintName = "Algorithms"
ReferencedContainer = "container:Algorithms.xcodeproj">
</BuildableReference>
</BuildActionEntry>
</BuildActionEntries>
</BuildAction>
<TestAction
buildConfiguration = "Debug"
selectedDebuggerIdentifier = "Xcode.DebuggerFoundation.Debugger.LLDB"
selectedLauncherIdentifier = "Xcode.DebuggerFoundation.Launcher.LLDB"
shouldUseLaunchSchemeArgsEnv = "YES">
<TestPlans>
<TestPlanReference
reference = "container:Algorithms.xctestplan"
default = "YES">
</TestPlanReference>
</TestPlans>
<Testables>
<TestableReference
skipped = "NO"
parallelizable = "YES">
<BuildableReference
BuildableIdentifier = "primary"
BlueprintIdentifier = "7D489E4629CE969D00499B21"
BuildableName = "AlgorithmsTests.xctest"
BlueprintName = "AlgorithmsTests"
ReferencedContainer = "container:Algorithms.xcodeproj">
</BuildableReference>
</TestableReference>
</Testables>
</TestAction>
<LaunchAction
buildConfiguration = "Debug"
selectedDebuggerIdentifier = "Xcode.DebuggerFoundation.Debugger.LLDB"
selectedLauncherIdentifier = "Xcode.DebuggerFoundation.Launcher.LLDB"
launchStyle = "0"
useCustomWorkingDirectory = "NO"
ignoresPersistentStateOnLaunch = "NO"
debugDocumentVersioning = "YES"
debugServiceExtension = "internal"
allowLocationSimulation = "YES">
</LaunchAction>
<ProfileAction
buildConfiguration = "Release"
shouldUseLaunchSchemeArgsEnv = "YES"
savedToolIdentifier = ""
useCustomWorkingDirectory = "NO"
debugDocumentVersioning = "YES">
<MacroExpansion>
<BuildableReference
BuildableIdentifier = "primary"
BlueprintIdentifier = "7D489E3E29CE969D00499B21"
BuildableName = "Algorithms.framework"
BlueprintName = "Algorithms"
ReferencedContainer = "container:Algorithms.xcodeproj">
</BuildableReference>
</MacroExpansion>
</ProfileAction>
<AnalyzeAction
buildConfiguration = "Debug">
</AnalyzeAction>
<ArchiveAction
buildConfiguration = "Release"
revealArchiveInOrganizer = "YES">
</ArchiveAction>
</Scheme>
-32
View File
@@ -1,32 +0,0 @@
{
"configurations" : [
{
"id" : "CF37E70B-D810-4CF2-AB41-571BAFF72572",
"name" : "Default",
"options" : {
}
},
{
"id" : "33436295-E24E-439B-9B8E-4602E0A6C8BB",
"name" : "TSan",
"options" : {
"threadSanitizerEnabled" : true
}
}
],
"defaultOptions" : {
"codeCoverage" : false
},
"testTargets" : [
{
"parallelizable" : true,
"target" : {
"containerPath" : "container:Algorithms.xcodeproj",
"identifier" : "7D489E4629CE969D00499B21",
"name" : "AlgorithmsTests"
}
}
],
"version" : 1
}
-23
View File
@@ -1,23 +0,0 @@
//===----------------------------------------------------------------------===//
//
// This source file is part of the Swift Algorithms open source project
//
// Copyright (c) 2023 Apple Inc. and the Swift project authors
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See https://swift.org/LICENSE.txt for license information
//
//===----------------------------------------------------------------------===//
PRODUCT_NAME = AlgorithmsTests
PRODUCT_BUNDLE_IDENTIFIER = org.swift.AlgorithmsTests
SUPPORTED_PLATFORMS = macosx iphoneos iphonesimulator watchos watchsimulator appletvos appletvsimulator
ARCHS = $(ARCHS_STANDARD)
CURRENT_PROJECT_VERSION = 1
MARKETING_VERSION = 1.0
GENERATE_INFOPLIST_FILE = YES
ENABLE_TESTABILITY = NO
-5
View File
@@ -1,5 +0,0 @@
# Xcode build files
The project file here can be used to build a variant of this package with Xcode, producing a single framework bundle. Build settings are entirely configured via the provided xcconfig files.
Beware! The contents of this directory are not source stable. They are provided as is, with no compatibility promises across package releases. Future versions of this package can arbitrarily change these files or remove them, without any advance notice. (This can include patch releases.)
-88
View File
@@ -1,88 +0,0 @@
//===----------------------------------------------------------------------===//
//
// This source file is part of the Swift Algorithms open source project
//
// Copyright (c) 2023 Apple Inc. and the Swift project authors
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See https://swift.org/LICENSE.txt for license information
//
//===----------------------------------------------------------------------===//
SDKROOT = macosx
CODE_SIGN_STYLE = Automatic
CODE_SIGN_IDENTITY = -
CODE_SIGN_IDENTITY[sdk=iphoneos*] = "iOS Developer"
CODE_SIGN_IDENTITY[sdk=watchos*] = "iOS Developer"
CODE_SIGN_IDENTITY[sdk=appletvos*] = "iOS Developer"
SWIFT_VERSION = 5.5
ONLY_ACTIVE_ARCH[config=Debug] = YES
SWIFT_ACTIVE_COMPILATION_CONDITIONS = $(inherited) ALGORITHMS_DARWIN_ONLY
SWIFT_COMPILATION_MODE[config=Release] = wholemodule
SWIFT_COMPILATION_MODE[config=Debug] = singlefile
SWIFT_OPTIMIZATION_LEVEL[config=Release] = -O
SWIFT_OPTIMIZATION_LEVEL[config=Debug] = -Onone
SWIFT_EMIT_LOC_STRINGS = NO
SWIFT_INSTALL_OBJC_HEADER = NO
COPY_PHASE_STRIP = NO
DEBUG_INFORMATION_FORMAT[config=Release] = dwarf-with-dsym
DEBUG_INFORMATION_FORMAT[config=Debug] = dwarf
ALWAYS_SEARCH_USER_PATHS = NO
ENABLE_TESTABILITY = NO
ENABLE_USER_SCRIPT_SANDBOXING = YES
DEAD_CODE_STRIPPING = YES
GCC_DYNAMIC_NO_PIC = NO
GCC_NO_COMMON_BLOCKS = YES
GCC_OPTIMIZATION_LEVEL[config=Debug] = 0
GCC_C_LANGUAGE_STANDARD = gnu11
CLANG_CXX_LANGUAGE_STANDARD = gnu++20
CLANG_ENABLE_MODULES = YES
CLANG_ENABLE_OBJC_ARC = YES
CLANG_ENABLE_OBJC_WEAK = YES
ENABLE_NS_ASSERTIONS[config=Release] = NO
ENABLE_STRICT_OBJC_MSGSEND = YES
GCC_PREPROCESSOR_DEFINITIONS[config=Release] = DEBUG=1 $(inherited)
CLANG_WARN_BLOCK_CAPTURE_AUTORELEASING = YES
CLANG_WARN_BOOL_CONVERSION = YES
CLANG_WARN_COMMA = YES
CLANG_WARN_CONSTANT_CONVERSION = YES
CLANG_WARN_DOCUMENTATION_COMMENTS = YES
CLANG_WARN_EMPTY_BODY = YES
CLANG_WARN_ENUM_CONVERSION = YES
CLANG_WARN_INFINITE_RECURSION = YES
CLANG_WARN_INT_CONVERSION = YES
CLANG_WARN_NON_LITERAL_NULL_CONVERSION = YES
CLANG_WARN_QUOTED_INCLUDE_IN_FRAMEWORK_HEADER = YES
CLANG_WARN_STRICT_PROTOTYPES = YES
CLANG_WARN_UNGUARDED_AVAILABILITY = YES_AGGRESSIVE
CLANG_WARN_UNREACHABLE_CODE = YES
GCC_WARN_64_TO_32_BIT_CONVERSION = YES
GCC_WARN_ABOUT_RETURN_TYPE = YES_ERROR
GCC_WARN_UNINITIALIZED_AUTOS = YES_AGGRESSIVE
GCC_WARN_UNUSED_FUNCTION = YES
GCC_WARN_UNUSED_VARIABLE = YES
CLANG_WARN_RANGE_LOOP_ANALYSIS = YES
CLANG_WARN_SUSPICIOUS_MOVE = YES
CLANG_WARN_DEPRECATED_OBJC_IMPLEMENTATIONS = YES
CLANG_WARN_DIRECT_OBJC_ISA_USAGE = YES_ERROR
CLANG_WARN_OBJC_LITERAL_CONVERSION = YES
CLANG_WARN_OBJC_ROOT_CLASS = YES_ERROR
CLANG_WARN__DUPLICATE_METHOD_MATCH = YES
GCC_WARN_UNDECLARED_SELECTOR = YES
CLANG_WARN_OBJC_IMPLICIT_RETAIN_SELF = YES
CLANG_ANALYZER_NONNULL = YES
CLANG_ANALYZER_NUMBER_OBJECT_CONVERSION = YES_AGGRESSIVE