⚡ Optimize IPTV program scanning using binary search - #193
Merged
ProdigyV21 merged 1 commit intoMay 14, 2026
Conversation
- Replaced O(N) linear scans in `buildNowNextFromXtreamListings` and `reDeriveCachedNowNext` with O(log N) binary searches. - Added backward-walking to capture overlapping programs that started before the cutoff time. - Implemented an early exit mechanism once the `epgUpcomingProgramLimit` is reached, preventing unnecessary iterations.
Himanth-reddy
added
gssoc-approved
level:advanced
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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
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.
Description
Replaced the full O(N) linear scan over sorted and allPrograms collections in IptvRepository.kt with an O(log N) binary search based on recentCutoff. Added logic to walk backward from the discovered index to capture programs that began before the cutoff but are still ongoing, followed by a forward iteration that breaks early once the upcoming list hits its limit.
Performance Improvements