forked from michiamling/SpreadsheetView
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathReuseQueue.swift
62 lines (51 loc) · 1.47 KB
/
ReuseQueue.swift
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
//
// ReuseQueue.swift
// SpreadsheetView
//
// Created by Kishikawa Katsumi on 4/16/17.
// Copyright © 2017 Kishikawa Katsumi. All rights reserved.
//
import Foundation
final class ReuseQueue<Reusable> where Reusable: NSObject {
var reusableObjects = Set<Reusable>()
func enqueue(_ reusableObject: Reusable) {
reusableObjects.insert(reusableObject)
}
func dequeue() -> Reusable? {
if let _ = reusableObjects.first {
return reusableObjects.removeFirst()
}
return nil
}
func dequeueOrCreate() -> Reusable {
if let _ = reusableObjects.first {
return reusableObjects.removeFirst()
}
return Reusable()
}
}
final class ReusableCollection<Reusable>: Sequence where Reusable: NSObject {
var pairs = [Address: Reusable]()
var addresses = Set<Address>()
func contains(_ member: Address) -> Bool {
return addresses.contains(member)
}
@discardableResult
func insert(_ newMember: Address) -> (inserted: Bool, memberAfterInsert: Address) {
return addresses.insert(newMember)
}
func subtract(_ other: Set<Address>) {
addresses.subtract(other)
}
subscript(key: Address) -> Reusable? {
get {
return pairs[key]
}
set(newValue) {
pairs[key] = newValue
}
}
func makeIterator() -> AnyIterator<Reusable> {
return AnyIterator(pairs.values.makeIterator())
}
}