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

Merge pull request #1187 from glessard/increments

Browse Source 
silence some warnings in validation-test/stdlib/Algorithm.swift
This commit is contained in:
Dmitri Gribenko
2016-02-03 10:37:06 -08:00
parent 00bde09962 a4a338beb1
commit 0327fc3077
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -205,20 +205,20 @@ Algorithm.test("sorted/complexity") {
// Check performance of sort on array of repeating values
var comparisons_100 = 0
ary = [Int](count: 100, repeatedValue: 0)
ary.sortInPlace { comparisons_100++; return $0 < $1 }
ary.sortInPlace { comparisons_100 += 1; return $0 < $1 }
var comparisons_1000 = 0
ary = [Int](count: 1000, repeatedValue: 0)
ary.sortInPlace { comparisons_1000++; return $0 < $1 }
ary.sortInPlace { comparisons_1000 += 1; return $0 < $1 }
expectTrue(comparisons_1000/comparisons_100 < 20)
// Try to construct 'bad' case for quicksort, on which the algorithm
// goes quadratic.
comparisons_100 = 0
ary = makeQSortKiller(100)
ary.sortInPlace { comparisons_100++; return $0 < $1 }
ary.sortInPlace { comparisons_100 += 1; return $0 < $1 }
comparisons_1000 = 0
ary = makeQSortKiller(1000)
ary.sortInPlace { comparisons_1000++; return $0 < $1 }
ary.sortInPlace { comparisons_1000 += 1; return $0 < $1 }
expectTrue(comparisons_1000/comparisons_100 < 20)
}