File: PriorityQueue.swift

package info (click to toggle)
swiftlang 6.0.3-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 2,519,992 kB
  • sloc: cpp: 9,107,863; ansic: 2,040,022; asm: 1,135,751; python: 296,500; objc: 82,456; f90: 60,502; lisp: 34,951; pascal: 19,946; sh: 18,133; perl: 7,482; ml: 4,937; javascript: 4,117; makefile: 3,840; awk: 3,535; xml: 914; fortran: 619; cs: 573; ruby: 573
file content (94 lines) | stat: -rw-r--r-- 2,256 bytes parent folder | download
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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
//===----------------------------------------------------------------------===//
//
// This source file is part of the SwiftNIO open source project
//
// Copyright (c) 2017-2020 Apple Inc. and the SwiftNIO project authors
// Licensed under Apache License v2.0
//
// See LICENSE.txt for license information
// See CONTRIBUTORS.txt for the list of SwiftNIO project authors
//
// SPDX-License-Identifier: Apache-2.0
//
//===----------------------------------------------------------------------===//

@usableFromInline
internal struct PriorityQueue<Element: Comparable> {
    @usableFromInline
    internal var _heap: Heap<Element>

    internal init() {
        self._heap = Heap()
    }

    @inlinable
    internal mutating func remove(_ key: Element) {
        self._heap.remove(value: key)
    }

    @inlinable
    internal mutating func push(_ key: Element) {
        self._heap.append(key)
    }

    @inlinable
    internal func peek() -> Element? {
        return self._heap.storage.first
    }

    @inlinable
    internal var isEmpty: Bool {
        return self._heap.storage.isEmpty
    }

    @inlinable
    @discardableResult
    internal mutating func pop() -> Element? {
        return self._heap.removeRoot()
    }

    @inlinable
    internal mutating func clear() {
        self._heap = Heap()
    }
}

extension PriorityQueue: Equatable {
    @usableFromInline
    internal static func ==(lhs: PriorityQueue, rhs: PriorityQueue) -> Bool {
        return lhs.count == rhs.count && lhs.elementsEqual(rhs)
    }
}

extension PriorityQueue: Sequence {
    @usableFromInline
    struct Iterator: IteratorProtocol {

        private var queue: PriorityQueue<Element>
        fileprivate init(queue: PriorityQueue<Element>) {
            self.queue = queue
        }

        public mutating func next() -> Element? {
            return self.queue.pop()
        }
    }

    @usableFromInline
    func makeIterator() -> Iterator {
        return Iterator(queue: self)
    }
}

extension PriorityQueue {
    var count: Int {
        return self._heap.count
    }
}

extension PriorityQueue: CustomStringConvertible {
    @usableFromInline
    var description: String {
        return "PriorityQueue(count: \(self.count)): \(Array(self))"
    }
}