mirror of
https://github.com/mihonapp/mihon.git
synced 2024-10-31 21:20:59 -04:00
97 lines
3.4 KiB
Kotlin
97 lines
3.4 KiB
Kotlin
package eu.kanade.tachiyomi.util
|
|
|
|
import eu.kanade.tachiyomi.data.database.DatabaseHelper
|
|
import eu.kanade.tachiyomi.data.database.models.Chapter
|
|
import eu.kanade.tachiyomi.data.database.models.Manga
|
|
import eu.kanade.tachiyomi.source.Source
|
|
import eu.kanade.tachiyomi.source.model.SChapter
|
|
import eu.kanade.tachiyomi.source.online.HttpSource
|
|
import java.util.*
|
|
|
|
/**
|
|
* Helper method for syncing the list of chapters from the source with the ones from the database.
|
|
*
|
|
* @param db the database.
|
|
* @param rawSourceChapters a list of chapters from the source.
|
|
* @param manga the manga of the chapters.
|
|
* @param source the source of the chapters.
|
|
* @return a pair of new insertions and deletions.
|
|
*/
|
|
fun syncChaptersWithSource(db: DatabaseHelper,
|
|
rawSourceChapters: List<SChapter>,
|
|
manga: Manga,
|
|
source: Source) : Pair<List<Chapter>, List<Chapter>> {
|
|
|
|
if (rawSourceChapters.isEmpty()) {
|
|
throw Exception("No chapters found")
|
|
}
|
|
|
|
// Chapters from db.
|
|
val dbChapters = db.getChapters(manga).executeAsBlocking()
|
|
|
|
val sourceChapters = rawSourceChapters.mapIndexed { i, sChapter ->
|
|
Chapter.create().apply {
|
|
copyFrom(sChapter)
|
|
manga_id = manga.id
|
|
source_order = i
|
|
}
|
|
}
|
|
|
|
// Chapters from the source not in db.
|
|
val toAdd = sourceChapters.filterNot { it in dbChapters }
|
|
|
|
// Recognize number for new chapters.
|
|
toAdd.forEach {
|
|
if (source is HttpSource) {
|
|
source.prepareNewChapter(it, manga)
|
|
}
|
|
ChapterRecognition.parseChapterNumber(it, manga)
|
|
}
|
|
|
|
// Chapters from the db not in the source.
|
|
val toDelete = dbChapters.filterNot { it in sourceChapters }
|
|
|
|
// Return if there's nothing to add or delete, avoiding unnecessary db transactions.
|
|
if (toAdd.isEmpty() && toDelete.isEmpty()) {
|
|
return Pair(emptyList(), emptyList())
|
|
}
|
|
|
|
val readded = mutableListOf<Chapter>()
|
|
|
|
db.inTransaction {
|
|
val deletedChapterNumbers = TreeSet<Float>()
|
|
val deletedReadChapterNumbers = TreeSet<Float>()
|
|
if (!toDelete.isEmpty()) {
|
|
for (c in toDelete) {
|
|
if (c.read) {
|
|
deletedReadChapterNumbers.add(c.chapter_number)
|
|
}
|
|
deletedChapterNumbers.add(c.chapter_number)
|
|
}
|
|
db.deleteChapters(toDelete).executeAsBlocking()
|
|
}
|
|
|
|
if (!toAdd.isEmpty()) {
|
|
// Set the date fetch for new items in reverse order to allow another sorting method.
|
|
// Sources MUST return the chapters from most to less recent, which is common.
|
|
var now = Date().time
|
|
|
|
for (i in toAdd.indices.reversed()) {
|
|
val c = toAdd[i]
|
|
c.date_fetch = now++
|
|
// Try to mark already read chapters as read when the source deletes them
|
|
if (c.isRecognizedNumber && c.chapter_number in deletedReadChapterNumbers) {
|
|
c.read = true
|
|
}
|
|
if (c.isRecognizedNumber && c.chapter_number in deletedChapterNumbers) {
|
|
readded.add(c)
|
|
}
|
|
}
|
|
db.insertChapters(toAdd).executeAsBlocking()
|
|
}
|
|
|
|
// Fix order in source.
|
|
db.fixChaptersSourceOrder(sourceChapters).executeAsBlocking()
|
|
}
|
|
return Pair(toAdd.subtract(readded).toList(), toDelete.subtract(readded).toList())
|
|
}
|