1- public class LinkedListNode < T: Comparable > {
1+ open class LinkedListNode < T: Comparable > {
22 var value : T
33 var next : LinkedListNode ?
44 var previous : LinkedListNode ?
@@ -8,27 +8,27 @@ public class LinkedListNode<T: Comparable> {
88 }
99}
1010
11- public class BoundedPriorityQueue < T: Comparable > {
12- private typealias Node = LinkedListNode < T >
11+ open class BoundedPriorityQueue < T: Comparable > {
12+ fileprivate typealias Node = LinkedListNode < T >
1313
14- private ( set) public var count = 0
15- private var head : Node ?
16- private var tail : Node ?
17- private var maxElements : Int
14+ fileprivate ( set) open var count = 0
15+ fileprivate var head : Node ?
16+ fileprivate var tail : Node ?
17+ fileprivate var maxElements : Int
1818
1919 public init ( maxElements: Int ) {
2020 self . maxElements = maxElements
2121 }
2222
23- public var isEmpty : Bool {
23+ open var isEmpty : Bool {
2424 return count == 0
2525 }
2626
27- public func peek( ) -> T ? {
27+ open func peek( ) -> T ? {
2828 return head? . value
2929 }
3030
31- public func enqueue( value: T ) {
31+ open func enqueue( _ value: T ) {
3232 if let node = insert ( value, after: findInsertionPoint ( value) ) {
3333 // If the newly inserted node is the last one in the list, then update
3434 // the tail pointer.
@@ -44,7 +44,7 @@ public class BoundedPriorityQueue<T: Comparable> {
4444 }
4545 }
4646
47- private func insert( value: T , after: Node ? ) -> Node ? {
47+ fileprivate func insert( _ value: T , after: Node ? ) -> Node ? {
4848 if let previous = after {
4949
5050 // If the queue is full and we have to insert at the end of the list,
@@ -78,18 +78,18 @@ public class BoundedPriorityQueue<T: Comparable> {
7878
7979 /* Find the node after which to insert the new value. If this returns nil,
8080 the new value should be inserted at the head of the list. */
81- private func findInsertionPoint( value: T ) -> Node ? {
81+ fileprivate func findInsertionPoint( _ value: T ) -> Node ? {
8282 var node = head
8383 var prev : Node ? = nil
8484
85- while let current = node where value < current. value {
85+ while let current = node, value < current. value {
8686 prev = node
8787 node = current. next
8888 }
8989 return prev
9090 }
9191
92- private func removeLeastImportantElement( ) {
92+ fileprivate func removeLeastImportantElement( ) {
9393 if let last = tail {
9494 tail = last. previous
9595 tail? . next = nil
@@ -101,7 +101,7 @@ public class BoundedPriorityQueue<T: Comparable> {
101101 // this is much slower on large lists.
102102 }
103103
104- public func dequeue( ) -> T ? {
104+ open func dequeue( ) -> T ? {
105105 if let first = head {
106106 count -= 1
107107 if count == 0 {
0 commit comments