mirror of
https://github.com/mihonapp/mihon.git
synced 2025-11-14 13:08:56 +01:00
Database support for ordering chapters like the source
This commit is contained in:
@@ -0,0 +1,83 @@
|
||||
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.data.source.base.Source
|
||||
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 sourceChapters 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,
|
||||
sourceChapters: List<Chapter>,
|
||||
manga: Manga,
|
||||
source: Source) : Pair<Int, Int> {
|
||||
|
||||
// Chapters from db.
|
||||
val dbChapters = db.getChapters(manga).executeAsBlocking()
|
||||
|
||||
// Fix manga id and order in source.
|
||||
sourceChapters.forEachIndexed { i, chapter ->
|
||||
chapter.manga_id = manga.id
|
||||
chapter.source_order = i
|
||||
}
|
||||
|
||||
// Chapters from the source not in db.
|
||||
val toAdd = sourceChapters.filterNot { it in dbChapters }
|
||||
|
||||
// Recognize number for new chapters.
|
||||
toAdd.forEach {
|
||||
source.parseChapterNumber(it)
|
||||
ChapterRecognition.parseChapterNumber(it, manga)
|
||||
}
|
||||
|
||||
// Chapters from the db not in the source.
|
||||
val toDelete = dbChapters.filterNot { it in sourceChapters }
|
||||
|
||||
// Amount of chapters added and deleted.
|
||||
var added = 0
|
||||
var deleted = 0
|
||||
|
||||
// Amount of chapters readded (different url but the same chapter number).
|
||||
var readded = 0
|
||||
|
||||
db.inTransaction {
|
||||
val deletedReadChapterNumbers = TreeSet<Float>()
|
||||
if (!toDelete.isEmpty()) {
|
||||
for (c in toDelete) {
|
||||
if (c.read) {
|
||||
deletedReadChapterNumbers.add(c.chapter_number)
|
||||
}
|
||||
}
|
||||
deleted = db.deleteChapters(toDelete).executeAsBlocking().results().size
|
||||
}
|
||||
|
||||
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.chapter_number != -1f && c.chapter_number in deletedReadChapterNumbers) {
|
||||
c.read = true
|
||||
readded++
|
||||
}
|
||||
}
|
||||
added = db.insertChapters(toAdd).executeAsBlocking().numberOfInserts()
|
||||
}
|
||||
|
||||
// Fix order in source.
|
||||
db.fixChaptersSourceOrder(sourceChapters).executeAsBlocking()
|
||||
}
|
||||
return Pair(added - readded, deleted - readded)
|
||||
}
|
||||
Reference in New Issue
Block a user