Skip to content

⚡ Optimize IPTV program scanning using binary search #193

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.

Sign up for GitHub

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
ProdigyV21 merged 1 commit into from
May 14, 2026
Merged

⚡ Optimize IPTV program scanning using binary search #193

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
67 changes: 51 additions & 16 deletions app/src/main/kotlin/com/arflix/tv/data/repository/IptvRepository.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1237,14 +1237,31 @@ class IptvRepository @Inject constructor(
val upcoming = java.util.ArrayList<IptvProgram>(epgUpcomingProgramLimit)
val recent = java.util.ArrayList<IptvProgram>()

for (i in 0 until allPrograms.size) {
val p = allPrograms[i]
when {
p.endUtcMillis <= nowMs && p.endUtcMillis > recentCutoff -> recent.add(p)
p.isLive(nowMs) -> now = p
p.startUtcMillis > nowMs && next == null -> next = p
p.startUtcMillis > nowMs && later == null -> later = p
p.startUtcMillis > nowMs && upcoming.size < epgUpcomingProgramLimit -> upcoming.add(p)
if (allPrograms.isNotEmpty()) {
var startIndex = allPrograms.binarySearch { it.startUtcMillis.compareTo(recentCutoff) }
if (startIndex < 0) {
startIndex = -(startIndex + 1)
}

// Walk backward to include programs starting before recentCutoff but ending after
while (startIndex > 0 && allPrograms[startIndex - 1].endUtcMillis > recentCutoff) {
startIndex--
}

for (i in startIndex until allPrograms.size) {
val p = allPrograms[i]
when {
p.endUtcMillis <= nowMs && p.endUtcMillis > recentCutoff -> recent.add(p)
p.isLive(nowMs) -> now = p
p.startUtcMillis > nowMs && next == null -> next = p
p.startUtcMillis > nowMs && later == null -> later = p
p.startUtcMillis > nowMs -> {
upcoming.add(p)
if (upcoming.size >= epgUpcomingProgramLimit) {
break // We have enough upcoming programs
}
}
}
}
}

Expand Down Expand Up @@ -4154,21 +4171,39 @@ class IptvRepository @Inject constructor(
val upcoming = mutableListOf<IptvProgram>()
val recent = mutableListOf<IptvProgram>()

for (p in sorted) {
when {
p.endUtcMillis <= nowMs && p.endUtcMillis > recentCutoff -> recent.add(p)
p.isLive(nowMs) -> now = p
p.startUtcMillis > nowMs && next == null -> next = p
p.startUtcMillis > nowMs && later == null -> later = p
p.startUtcMillis > nowMs -> upcoming.add(p)
if (sorted.isNotEmpty()) {
var startIndex = sorted.binarySearch { it.startUtcMillis.compareTo(recentCutoff) }
if (startIndex < 0) {
startIndex = -(startIndex + 1)
}

// Walk backward to include programs starting before recentCutoff but ending after
while (startIndex > 0 && sorted[startIndex - 1].endUtcMillis > recentCutoff) {
startIndex--
}

for (i in startIndex until sorted.size) {
val p = sorted[i]
when {
p.endUtcMillis <= nowMs && p.endUtcMillis > recentCutoff -> recent.add(p)
p.isLive(nowMs) -> now = p
p.startUtcMillis > nowMs && next == null -> next = p
p.startUtcMillis > nowMs && later == null -> later = p
p.startUtcMillis > nowMs -> {
upcoming.add(p)
if (upcoming.size >= epgUpcomingProgramLimit) {
break // We have enough upcoming programs
}
}
}
}
}

result[channelId] = IptvNowNext(
now = now,
next = next,
later = later,
upcoming = upcoming.take(epgUpcomingProgramLimit),
upcoming = upcoming,
recent = recent
)
}
Expand Down
Loading