-
-
Notifications
You must be signed in to change notification settings - Fork 189
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
feat: bidirectional provider support and subscriptions for websockets (…
- Loading branch information
1 parent
a668020
commit 6a6394b
Showing
11 changed files
with
677 additions
and
21 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,170 @@ | ||
| import Foundation | ||
| #if canImport(Dispatch) | ||
| import Dispatch | ||
| #endif | ||
|
|
||
| public final class SynchronizedArray<Element>: Sequence { | ||
|
|
||
| private var internalArray: [Element] = [] | ||
| private let accessQueue = DispatchQueue(label: "SynchronizedArrayAccess", attributes: .concurrent) | ||
|
|
||
| public var array: [Element] { | ||
| get { | ||
| var arrayCopy: [Element]? | ||
|
|
||
| accessQueue.sync { | ||
| arrayCopy = self.internalArray | ||
| } | ||
|
|
||
| return arrayCopy! | ||
| } | ||
|
|
||
| set { | ||
| let arrayCopy = newValue | ||
|
|
||
| accessQueue.async(flags: .barrier) { | ||
| self.internalArray = arrayCopy | ||
| } | ||
| } | ||
| } | ||
|
|
||
| public init() { | ||
| } | ||
|
|
||
| public init(array: [Element]) { | ||
| self.internalArray = array | ||
| } | ||
|
|
||
| public func append(_ newElement: Element) { | ||
| self.accessQueue.async(flags: .barrier) { | ||
| self.internalArray.append(newElement) | ||
| } | ||
| } | ||
|
|
||
| public func remove(atIndex index: Int) { | ||
| self.accessQueue.async(flags: .barrier) { | ||
| self.internalArray.remove(at: index) | ||
| } | ||
| } | ||
|
|
||
| // MARK: - In Place stuff | ||
| public func filterInPlace(_ isIncluded: (Element) throws -> Bool) throws { | ||
| var thrownError: Error? = nil | ||
|
|
||
| accessQueue.sync(flags: .barrier) { | ||
| do { | ||
| try self.internalArray = self.internalArray.filter(isIncluded) | ||
| } catch { | ||
| thrownError = error | ||
| } | ||
| } | ||
|
|
||
| if let error = thrownError { | ||
| throw error | ||
| } | ||
| } | ||
|
|
||
| public func filterInPlace(_ isIncluded: @escaping (Element) -> Bool) { | ||
| accessQueue.async(flags: .barrier) { | ||
| self.internalArray = self.internalArray.filter(isIncluded) | ||
| } | ||
| } | ||
|
|
||
| // MARK: - Accessors | ||
| public var count: Int { | ||
| var count = 0 | ||
|
|
||
| self.accessQueue.sync { | ||
| count = self.internalArray.count | ||
| } | ||
|
|
||
| return count | ||
| } | ||
|
|
||
| public var isEmpty: Bool { | ||
| var e: Bool! | ||
|
|
||
| self.accessQueue.sync { | ||
| e = self.internalArray.isEmpty | ||
| } | ||
|
|
||
| return e | ||
| } | ||
|
|
||
| public func first() -> Element? { | ||
| var element: Element? | ||
|
|
||
| self.accessQueue.sync { | ||
| if !self.internalArray.isEmpty { | ||
| element = self.internalArray[0] | ||
| } | ||
| } | ||
|
|
||
| return element | ||
| } | ||
|
|
||
| public func popLast() -> Element? { | ||
| var element: Element? | ||
|
|
||
| accessQueue.sync(flags: .barrier) { | ||
| element = self.internalArray.popLast() | ||
| } | ||
|
|
||
| return element | ||
| } | ||
|
|
||
| public func removeFirst() -> Element? { | ||
| var element: Element? | ||
|
|
||
| accessQueue.sync(flags: .barrier) { | ||
| if self.internalArray.count > 0 { | ||
| element = self.internalArray.removeFirst() | ||
| } else { | ||
| element = nil | ||
| } | ||
| } | ||
|
|
||
| return element | ||
| } | ||
|
|
||
| public func map<T>(_ transform: (Element) throws -> T) rethrows -> [T] { | ||
| // Get array copy | ||
| let arrayCopy = array | ||
|
|
||
| return try arrayCopy.map(transform) | ||
| } | ||
|
|
||
| public func filter(_ isIncluded: (Element) throws -> Bool) rethrows -> [Element] { | ||
| // Get array copy | ||
| let arrayCopy = array | ||
|
|
||
| return try arrayCopy.filter(isIncluded) | ||
| } | ||
|
|
||
| public subscript(index: Int) -> Element { | ||
| set { | ||
| self.accessQueue.async(flags: .barrier) { | ||
| self.internalArray[index] = newValue | ||
| } | ||
| } | ||
| get { | ||
| var element: Element! | ||
|
|
||
| self.accessQueue.sync { | ||
| element = self.internalArray[index] | ||
| } | ||
|
|
||
| return element | ||
| } | ||
| } | ||
|
|
||
| public func makeIterator() -> Array<Element>.Iterator { | ||
| var iterator: Array<Element>.Iterator! | ||
|
|
||
| accessQueue.sync { | ||
| iterator = self.internalArray.makeIterator() | ||
| } | ||
|
|
||
| return iterator | ||
| } | ||
| } |
Oops, something went wrong.