-
Notifications
You must be signed in to change notification settings - Fork 0
fix: Make Session Replay stable for offline or intermittent network #67
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Merged
+234
−118
Merged
Changes from 7 commits
Commits
Show all changes
9 commits
Select commit
Hold shift + click to select a range
347b603
feat: make BatchWorker stable to network fails
abelonogov-ld cb3e57c
clean code
abelonogov-ld c7081e5
address review comments
abelonogov-ld c208530
Merge branch 'main' into andrey/offline-stability
abelonogov-ld 4903390
BatchWorker without MultiExporter
abelonogov-ld c47ff1b
fix probable crash
abelonogov-ld f509f7d
switch stg
abelonogov-ld 16306ed
use struct as result
abelonogov-ld 0f6420b
Merge branch 'main' into andrey/offline-stability
abelonogov-ld File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or 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 hidden or 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 hidden or 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 hidden or 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 hidden or 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 hidden or 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 |
|---|---|---|
| @@ -1,12 +1,19 @@ | ||
| import Foundation | ||
| import Common | ||
|
|
||
| public protocol EventExporting { | ||
| public protocol EventExporting: Sendable { | ||
| func export(items: [EventQueueItem]) async throws | ||
| } | ||
|
|
||
| public final class NoOpExporter: EventExporting { | ||
| public func export(items: [EventQueueItem]) async throws {} | ||
| public func export(items: [EventQueueItem]) async throws { return } | ||
|
|
||
| public init() {} | ||
| } | ||
|
|
||
| extension EventExporting { | ||
| var typeId: ObjectIdentifier { | ||
| let type = type(of: Self.self) | ||
| return ObjectIdentifier(type) | ||
| } | ||
| } |
This file contains hidden or 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 |
|---|---|---|
|
|
@@ -4,10 +4,17 @@ import Common | |
| public struct EventQueueItem { | ||
| public var payload: EventQueueItemPayload | ||
| public var cost: Int | ||
| public var exporterTypeId: ObjectIdentifier | ||
|
|
||
| public init(payload: EventQueueItemPayload) { | ||
| let type = type(of: payload.exporterClass) | ||
| self.init(payload: payload, exporterTypeId: ObjectIdentifier(type)) | ||
| } | ||
|
|
||
| public init(payload: EventQueueItemPayload, exporterTypeId: ObjectIdentifier) { | ||
| self.payload = payload | ||
| self.cost = payload.cost() | ||
| self.exporterTypeId = exporterTypeId | ||
| } | ||
|
|
||
| public var timestamp: TimeInterval { | ||
|
|
@@ -21,7 +28,7 @@ public protocol EventQueuing: Actor { | |
|
|
||
| // TODO: make it optimal | ||
| public actor EventQueue: EventQueuing { | ||
| private var storage = [EventQueueItem]() | ||
| private var storage = [ObjectIdentifier: [EventQueueItem]]() | ||
| private var lastEventTime: TimeInterval = 0 | ||
| private let limitSize: Int | ||
| private var currentSize = 0 | ||
|
|
@@ -43,32 +50,61 @@ public actor EventQueue: EventQueuing { | |
| return | ||
| } | ||
|
|
||
| storage.append(item) | ||
| storage[item.exporterTypeId, default: []].append(item) | ||
| lastEventTime = item.timestamp | ||
| currentSize += item.cost | ||
| } | ||
|
|
||
| func earliest(cost: Int, limit: Int, except: Set<ObjectIdentifier>) -> (id: ObjectIdentifier, items: [EventQueueItem], cost: Int)? { | ||
| var earlistEvent: (id: ObjectIdentifier, items: [EventQueueItem], firstTimestamp: TimeInterval)? | ||
| for (id, items) in storage where except.contains(id) == false { | ||
| guard let firstItem = items.first else { | ||
| continue | ||
| } | ||
| if let earlistEventUnwrapped = earlistEvent, firstItem.timestamp >= earlistEventUnwrapped.firstTimestamp { | ||
| continue | ||
| } | ||
|
|
||
| earlistEvent = (id, items, firstItem.timestamp) | ||
| } | ||
|
|
||
| guard let earlistEvent else { return nil } | ||
|
|
||
| guard let (items, cost) = first(cost: cost, limit: limit, items: earlistEvent.items) else { | ||
| return nil | ||
| } | ||
|
|
||
| return (id: earlistEvent.id, items: items, cost: cost) | ||
| } | ||
|
|
||
| private func first(cost: Int, limit: Int, items: [EventQueueItem]) -> (items: [EventQueueItem], cost: Int)? { | ||
|
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. same suggestion, so you can reuse the object here There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Here is private method |
||
| var sumCost = 0 | ||
| var resultItems = [EventQueueItem]() | ||
| for (i, item) in items.enumerated() { | ||
| resultItems.append(item) | ||
| sumCost += item.cost | ||
|
|
||
| if i > limit || sumCost > cost { | ||
| break | ||
| } | ||
| } | ||
|
|
||
| func dequeue(cost: Int, limit: Int) -> [EventQueueItem] { | ||
| guard !storage.isEmpty else { | ||
| return [] | ||
| return (items: resultItems, sumCost) | ||
| } | ||
|
|
||
| func removeFirst(id: ObjectIdentifier, count: Int) { | ||
| guard var items = storage[id], count > 0 else { | ||
| return | ||
| } | ||
|
|
||
| var result = [EventQueueItem]() | ||
| var sumCost = 0 | ||
| for (i, item) in storage.enumerated() { | ||
| result.append(item) | ||
|
|
||
| sumCost += item.cost | ||
|
|
||
| if i >= limit || sumCost > cost { | ||
| currentSize -= item.cost | ||
| storage.removeFirst(i + 1) | ||
| return result | ||
| } | ||
| let removeCount = min(count, items.count) | ||
| var removedCost = 0 | ||
| for i in 0..<removeCount { | ||
| removedCost += items[i].cost | ||
| } | ||
| currentSize -= removedCost | ||
|
|
||
| storage.removeAll() | ||
| currentSize = 0 | ||
| return result | ||
| items.removeFirst(removeCount) | ||
| storage[id] = items.isEmpty ? nil : items | ||
| } | ||
| } | ||
This file contains hidden or 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 was deleted.
Oops, something went wrong.
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Suggest to use an object instead a tuple