|
| 1 | +import Foundation |
| 2 | + |
| 3 | +class OrderComparator: SortComparator { |
| 4 | + let field: String |
| 5 | + var order: SortOrder |
| 6 | + |
| 7 | + init(order: Order) { |
| 8 | + field = order.field |
| 9 | + if order.direction == Direction.asc { |
| 10 | + self.order = SortOrder.forward |
| 11 | + } else { |
| 12 | + self.order = SortOrder.reverse |
| 13 | + } |
| 14 | + } |
| 15 | + |
| 16 | + func hash(into hasher: inout Hasher) { |
| 17 | + hasher.combine(field) |
| 18 | + hasher.combine(order) |
| 19 | + } |
| 20 | + |
| 21 | + static func == (lhs: OrderComparator, rhs: OrderComparator) -> Bool { |
| 22 | + return lhs.field == rhs.field |
| 23 | + } |
| 24 | + |
| 25 | + func compare(_ lhs: Event, _ rhs: Event) -> ComparisonResult { |
| 26 | + let maybeLeftV = try? Object.valueForKeyPath(lhs, field) |
| 27 | + let maybeRightV = try? Object.valueForKeyPath(rhs, field) |
| 28 | + |
| 29 | + switch (maybeLeftV, maybeRightV) { |
| 30 | + case let (.some(leftV), .some(rightV)): |
| 31 | + if let leftValue = leftV as? Int, let rightValue = rightV as? Int { |
| 32 | + return IntComparator(order: order).compare(leftValue, rightValue) |
| 33 | + } else if let leftValue = leftV as? String, let rightValue = rightV as? String { |
| 34 | + return StringComparator(order: order).compare(leftValue, rightValue) |
| 35 | + } else if let leftValue = leftV as? Date, let rightValue = rightV as? Date { |
| 36 | + return DateComparator(order: order).compare(leftValue, rightValue) |
| 37 | + } else { |
| 38 | + // not future proof |
| 39 | + // we might silently sort on new non-existing types |
| 40 | + return .orderedSame |
| 41 | + } |
| 42 | + default: |
| 43 | + // not future proof |
| 44 | + // we might silently sort on new non-existing types |
| 45 | + return .orderedSame |
| 46 | + } |
| 47 | + } |
| 48 | +} |
| 49 | + |
| 50 | +class IntComparator: SortComparator, Hashable { |
| 51 | + var order: SortOrder |
| 52 | + |
| 53 | + init(order: SortOrder) { |
| 54 | + self.order = order |
| 55 | + } |
| 56 | + |
| 57 | + func hash(into hasher: inout Hasher) { |
| 58 | + hasher.combine(order) |
| 59 | + } |
| 60 | + |
| 61 | + static func == (lhs: IntComparator, rhs: IntComparator) -> Bool { |
| 62 | + return lhs.order == rhs.order |
| 63 | + } |
| 64 | + |
| 65 | + func compare(_ lhs: Int, _ rhs: Int) -> ComparisonResult { |
| 66 | + let result: ComparisonResult |
| 67 | + if lhs < rhs { |
| 68 | + result = .orderedAscending |
| 69 | + } else if lhs > rhs { |
| 70 | + result = .orderedDescending |
| 71 | + } else { |
| 72 | + result = .orderedSame |
| 73 | + } |
| 74 | + return order == .forward ? result : result.reversed |
| 75 | + } |
| 76 | +} |
| 77 | + |
| 78 | +class StringComparator: SortComparator, Hashable { |
| 79 | + var order: SortOrder |
| 80 | + |
| 81 | + init(order: SortOrder) { |
| 82 | + self.order = order |
| 83 | + } |
| 84 | + |
| 85 | + func hash(into hasher: inout Hasher) { |
| 86 | + hasher.combine(order) |
| 87 | + } |
| 88 | + |
| 89 | + static func == (lhs: StringComparator, rhs: StringComparator) -> Bool { |
| 90 | + return lhs.order == rhs.order |
| 91 | + } |
| 92 | + |
| 93 | + func compare(_ lhs: String, _ rhs: String) -> ComparisonResult { |
| 94 | + let result: ComparisonResult |
| 95 | + if lhs < rhs { |
| 96 | + result = .orderedAscending |
| 97 | + } else if lhs > rhs { |
| 98 | + result = .orderedDescending |
| 99 | + } else { |
| 100 | + result = .orderedSame |
| 101 | + } |
| 102 | + return order == .forward ? result : result.reversed |
| 103 | + } |
| 104 | +} |
| 105 | + |
| 106 | +class DateComparator: SortComparator, Hashable { |
| 107 | + var order: SortOrder |
| 108 | + |
| 109 | + init(order: SortOrder) { |
| 110 | + self.order = order |
| 111 | + } |
| 112 | + |
| 113 | + func hash(into hasher: inout Hasher) { |
| 114 | + hasher.combine(order) |
| 115 | + } |
| 116 | + |
| 117 | + static func == (lhs: DateComparator, rhs: DateComparator) -> Bool { |
| 118 | + return lhs.order == rhs.order |
| 119 | + } |
| 120 | + |
| 121 | + func compare(_ lhs: Date, _ rhs: Date) -> ComparisonResult { |
| 122 | + let result: ComparisonResult |
| 123 | + if lhs < rhs { |
| 124 | + result = .orderedAscending |
| 125 | + } else if lhs > rhs { |
| 126 | + result = .orderedDescending |
| 127 | + } else { |
| 128 | + result = .orderedSame |
| 129 | + } |
| 130 | + return order == .forward ? result : result.reversed |
| 131 | + } |
| 132 | +} |
| 133 | + |
| 134 | +extension ComparisonResult { |
| 135 | + var reversed: ComparisonResult { |
| 136 | + switch self { |
| 137 | + case .orderedAscending: return .orderedDescending |
| 138 | + case .orderedSame: return .orderedSame |
| 139 | + case .orderedDescending: return .orderedAscending |
| 140 | + } |
| 141 | + } |
| 142 | +} |
0 commit comments