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

init(count: Int, repeatedValue: Element) => init(repeating:count:)

Browse Source 
Affected types: _ArrayType, Array, ArraySlice, ContiguousArray, Repeat,
String (initializers from Character and UnicodeScalar)
This commit is contained in:
Dmitri Gribenko
2015-11-04 11:26:37 -08:00
committed by Max Moiseev
parent d72b5ab575
commit df17ddbc9b
33 changed files with 102 additions and 94 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -136,8 +136,8 @@ func makeQSortKiller(len: Int) -> [Int] {
return keys[x]! > keys[y]!
}
var ary = [Int](count: len, repeatedValue:0)
var ret = [Int](count: len, repeatedValue:0)
var ary = [Int](repeating: 0, count: len)
var ret = [Int](repeating: 0, count: len)
for i in 0..<len { ary[i] = i }
ary = ary.sort(Compare)
for i in 0..<len {
@@ -151,10 +151,10 @@ Algorithm.test("sorted/complexity") {
// Check performance of sort on array of repeating values
var comparisons_100 = 0
ary = [Int](count: 100, repeatedValue: 0)
ary = [Int](repeating: 0, count: 100)
ary.sortInPlace { comparisons_100++; return $0 < $1 }
var comparisons_1000 = 0
ary = [Int](count: 1000, repeatedValue: 0)
ary = [Int](repeating: 0, count: 1000)
ary.sortInPlace { comparisons_1000++; return $0 < $1 }
expectTrue(comparisons_1000/comparisons_100 < 20)