spotify / Mobius.swift

@@ -99,7 +99,7 @@
Loading
99 99
100 100
    private func accept(_ input: Input) {
101 101
        // The construct of consumerSet is there to release the lock asap.
102 -
        // We dont know what goes on in the overriden `handle` function...
102 +
        // We don’t know what goes on in the overridden `handle` function...
103 103
        var consumerSet: Bool = false
104 104
        lock.lock()
105 105
        consumerSet = consumer != nil

@@ -25,7 +25,7 @@
Loading
25 25
    private var disposables: [Disposable]
26 26
    private let lock = DispatchQueue(label: "Mobius.CompositeDisposable")
27 27
28 -
    /// Initialises a `CompositeDisposable`.
28 +
    /// Initializes a `CompositeDisposable`.
29 29
    ///
30 30
    /// - Parameter disposables: an array of disposables.
31 31
    init(disposables: [Disposable]) {

@@ -22,7 +22,7 @@
Loading
22 22
/// Utility to catch invalid concurrent access to non-thread-safe code.
23 23
///
24 24
/// Like a mutex, `ConcurrentAccessDetector` guards a critical region. However, instead of blocking if two threads
25 -
/// attemt to enter the critical region at once, it crashes in debug builds. In release builds, it has no effect (and
25 +
/// attempt to enter the critical region at once, it crashes in debug builds. In release builds, it has no effect (and
26 26
/// also no overhead, as long as it’s only used within one module).
27 27
///
28 28
/// Copies of a `ConcurrentAccessDetector` share the same underlying mutex, and hence their critical region is the union

@@ -82,7 +82,7 @@
Loading
82 82
                           ┃ loopQueue ┃
83 83
                           ┗━━━━━━━━━━━┛
84 84
85 -
         In order to construct this bottom-up and fulfil definitive initialization requirements, state and loopQueue are
85 +
         In order to construct this bottom-up and fulfill definitive initialization requirements, state and loopQueue are
86 86
         duplicated in local variables.
87 87
         */
88 88

@@ -19,7 +19,7 @@
Loading
19 19
20 20
import Foundation
21 21
22 -
/// Like a work queue, but agressively avoids doing things sequentially.
22 +
/// Like a work queue, but aggressively avoids doing things sequentially.
23 23
///
24 24
/// We don’t want to commit to any sequencing guarantees in Mobius loops. Since we’re cognizant of Hyrum’s Law, we don’t
25 25
/// want to provide _unguaranteed_ sequencing either, so this implementation currently randomizes execution order. We

@@ -148,7 +148,7 @@
Loading
148 148
        consumeEvent(event)
149 149
    }
150 150
151 -
    // MARK: - Implemenation details
151 +
    // MARK: - Implementation details
152 152
153 153
    /// Apply a `Next`:
154 154
    ///
Files Coverage
MobiusCore/Source 95.27%
MobiusExtras/Source 70.83%
MobiusNimble/Source 100.00%
MobiusTest/Source 98.91%
MobiusThrowableAssertion/Source/MobiusThrowableAssertion.m 100.00%
Project Totals (43 files) 94.37%
1
codecov:
2
  strict_yaml_branch: master
3

4
coverage:
5
  ignore:
6
  - "*/Test/**"
Sunburst
The inner-most circle is the entire project, moving away from the center are folders then, finally, a single file. The size and color of each slice is representing the number of statements and the coverage, respectively.
Icicle
The top section represents the entire project. Proceeding with folders and finally individual files. The size and color of each slice is representing the number of statements and the coverage, respectively.
Grid
Each block represents a single file in the project. The size and color of each block is represented by the number of statements and the coverage, respectively.
Loading