Created
September 13, 2016 20:01
-
-
Save anonymous/67d83fb2f286cf84539b58be96a971d3 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import Foundation | |
protocol Sortable: Comparable { | |
var number: Int {get} | |
static func < (lhs:Self, rhs: Self) -> Bool | |
static func == (lhs:Self, rhs: Self) -> Bool | |
} | |
struct BasicSortable: Sortable { | |
let number: Int | |
static func < (lhs:BasicSortable, rhs: BasicSortable) -> Bool { | |
return lhs.number < rhs.number | |
} | |
static func == (lhs:BasicSortable, rhs: BasicSortable) -> Bool { | |
return lhs.number == rhs.number | |
} | |
} | |
protocol Sorter { | |
associatedtype Item: Sortable | |
func sort(items: [Item]) -> [Item] | |
} | |
struct AscendingSorter<T:Sortable>: Sorter { | |
typealias Item = T | |
func sort(items: [T]) -> [T] { | |
return items.sorted() | |
} | |
} | |
struct DescendingSorter<T:Sortable>: Sorter { | |
typealias Item = T | |
func sort(items: [T]) -> [T] { | |
return items.sorted{$0 > $1} | |
} | |
} | |
struct DataHandler<T: Sortable> { | |
let items: [T] | |
let sortedItems: [T] | |
init <S: Sorter>(unsortedItems: [T], sorter: S) where S.Item == T { | |
items = unsortedItems | |
sortedItems = sorter.sort(items: unsortedItems) | |
} | |
} | |
let array = [ | |
BasicSortable(number: 1), | |
BasicSortable(number: 8), | |
BasicSortable(number: 13), | |
BasicSortable(number: 3), | |
BasicSortable(number: 4), | |
BasicSortable(number: 14), | |
BasicSortable(number: 5), | |
BasicSortable(number: 12), | |
BasicSortable(number: 3), | |
] | |
let handler = DataHandler(unsortedItems: array, sorter: DescendingSorter()) | |
handler.sortedItems |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment