ProfessionalUwU/tachiyomi
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Try to mark readded chapters as read. #119

Browse Source
This commit is contained in:
inorichi 2016-02-05 22:08:54 +01:00
parent 6435eeb251
commit 34c5f0b7ba
1 changed files with 17 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
app/src/main/java/eu/kanade/tachiyomi/data/database/DatabaseHelper.java
View File

@ -19,6 +19,7 @@ import com.pushtorefresh.storio.sqlite.queries.RawQuery;
import java.util.Date; import java.util.Date;
import java.util.List; import java.util.List;
import java.util.TreeSet;
import eu.kanade.tachiyomi.data.database.models.Category; import eu.kanade.tachiyomi.data.database.models.Category;
import eu.kanade.tachiyomi.data.database.models.CategorySQLiteTypeMapping; import eu.kanade.tachiyomi.data.database.models.CategorySQLiteTypeMapping;
@ -259,21 +260,32 @@ public class DatabaseHelper {
int deleted = 0; int deleted = 0;
db.internal().beginTransaction(); db.internal().beginTransaction();
try { try {
TreeSet<Float> deletedReadChapterNumbers = new TreeSet<>();
if (!toDelete.isEmpty()) {
for (Chapter c : toDelete) {
if (c.read) {
deletedReadChapterNumbers.add(c.chapter_number);
}
}
deleted = deleteChapters(toDelete).executeAsBlocking().results().size();
}
if (!toAdd.isEmpty()) { if (!toAdd.isEmpty()) {
// Set the date fetch for new items in reverse order to allow another sorting method. // 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. // Sources MUST return the chapters from most to less recent, which is common.
long now = new Date().getTime(); long now = new Date().getTime();
for (int i = toAdd.size() - 1; i >= 0; i--) { for (int i = toAdd.size() - 1; i >= 0; i--) {
toAdd.get(i).date_fetch = now++; Chapter c = toAdd.get(i);
c.date_fetch = now++;
// Try to mark already read chapters as read when the source deletes them
if (c.chapter_number != -1 && deletedReadChapterNumbers.contains(c.chapter_number)) {
c.read = true;
}
} }
added = insertChapters(toAdd).executeAsBlocking().numberOfInserts(); added = insertChapters(toAdd).executeAsBlocking().numberOfInserts();
} }
if (!toDelete.isEmpty()) {
deleted = deleteChapters(toDelete).executeAsBlocking().results().size();
}
db.internal().setTransactionSuccessful(); db.internal().setTransactionSuccessful();
} finally { } finally {
db.internal().endTransaction(); db.internal().endTransaction();