File: SynchronizedQueue.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 (77 lines) | stat: -rw-r--r-- 2,329 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
/*
 This source file is part of the Swift.org open source project

 Copyright (c) 2014 - 2017 Apple Inc. and the Swift project authors
 Licensed under Apache License v2.0 with Runtime Library Exception

 See http://swift.org/LICENSE.txt for license information
 See http://swift.org/CONTRIBUTORS.txt for Swift project authors
*/

/// This class can be used as a shared queue between multiple threads providing
/// thread safe APIs.
public final class SynchronizedQueue<Element> {
    
    /// Linked list node.
    private final class Node {
        var value: Element
        var next: Node?
        init(_ value: Element) {
            self.value = value
        }
    }
    
    /// Head node of the queue.
    private var head: Node? = nil
    
    /// Tail node of the queue.
    private weak var tail: Node? = nil

    /// Condition variable to block the thread trying dequeue and queue is empty.
    private var notEmptyCondition: Condition

    /// Create a default instance of queue.
    public init() {
        notEmptyCondition = Condition()
    }

    /// Safely enqueue an element to end of the queue and signals a thread blocked on dequeue.
    ///
    /// - Parameters:
    ///     - element: The element to be enqueued.
    public func enqueue(_ element: Element) {
        notEmptyCondition.whileLocked {
            let node = Node(element)
            if head == nil {
                head = node
            } else {
                tail?.next = node
            }
            // Update the tail node.
            tail = node
            
            // Signal a thread blocked on dequeue.
            notEmptyCondition.signal()
        }
    }

    /// Dequeue an element from front of the queue. Blocks the calling thread until an element is available.
    ///
    /// - Returns: First element in the queue.
    public func dequeue() -> Element {
        return notEmptyCondition.whileLocked {
            // Wait until we have an element available in the queue.
            while head == nil {
                notEmptyCondition.wait()
            }
            
            // There are elements in the queue, `head` is not nil.
            let element = head!.value
            
            // Remove the first node.
            head = head!.next
            
            return element
        }
    }
}