您可以通过首先由值进行排序键控数组索引数组他们的索引,然后生成基于这些分类指数新的阵列,利用这样做PermutationGenerator
:
let myArr = ["b", "a", "c"]
let myArr2 = ["letter b", "letter a", "letter c"]
let myArr3 = ["b is the second letter", "a is the first letter", "c is the third letter"]
func sortByKeyArray(keyArray: [String], valuesArrays: [[String]]) -> [[String]] {
precondition(reduce(valuesArrays, true) { $0.0 && ($0.1.count == keyArray.count)},
"Arrays all need to be the same length")
let permutation = sorted(indices(keyArray)) {
keyArray[$0] < keyArray[$1]
}
return valuesArrays.map {
Array(PermutationGenerator(elements: $0, indices: permutation))
}
}
sortByKeyArray(myArr, [myArr2, myArr3])
// returns [["letter a", "letter b", "letter c"], ["a is the first letter", "b is the second letter", "c is the third letter"]]
如果你想使这个通用的任何类型的集合(但仍然返回一个数组,在相同的风格为标准库收集交易算法):
func sortByKeyingCollection<C: CollectionType, D: SequenceType
where D.Generator.Element == C,
C.Index: RandomAccessIndexType,
C.Generator.Element: Comparable>
(key: C, values: D) -> [[C.Generator.Element]] {
let permutation = sorted(indices(key)) {
key[$0] < key[$1]
}
return map(values) {
Array(PermutationGenerator(elements: $0, indices: permutation))
}
}
和版本这需要一个自定义的比较:
func sortByKeyingCollection<C: CollectionType, D: SequenceType where D.Generator.Element == C, C.Index: RandomAccessIndexType>(key: C, values: D, isOrderedBefore: (C.Generator.Element,C.Generator.Element)->Bool) -> [[C.Generator.Element]] {
let permutation = sorted(indices(key)) {
isOrderedBefore(key[$0],key[$1])
}
return map(values) {
Array(PermutationGenerator(elements: $0, indices: permutation))
}
}
sortByKeyingCollection(myArr, [myArr2, myArr3], >)
sortByKeyingCollection(myArr, [myArr2, myArr3], lexicographicalCompare)
sortByKeyingCollection(myArr, [myArr2, myArr3]) { dropFirst($0) < dropFirst($1) }
非常感谢你:) – 2015-04-03 13:29:09
你可以编辑它为Swift 2.1与Int例如1,2,3? – 2016-02-23 18:33:29