averello/swift-mirror
1
0
Fork 0
mirror of https://github.com/apple/swift.git synced 2025-12-14 20:36:38 +01:00
Code Issues Packages Projects Releases Wiki Activity

[test] Sorting 2**21 arrays is probably not necessary

Browse Source 
Addresses: <rdar://problem/44152615>
This commit is contained in:
Maxim Moiseev
2018-09-10 15:40:31 -07:00
parent 2032969ee2
commit 6fb3373322
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
validation-test/stdlib/Algorithm.swift
View File

@@ -284,7 +284,7 @@ Algorithm.test("heapSort") {
} // addOne end.
// Test binary number size.
let numberLength = 21
let numberLength = 11
var binaryNumber = [Int](repeating: 0, count: numberLength)
// We are testing sort on all permutations off 0-1s of size `numberLength`