mirror/FairEmail
1
0
Fork 0
mirror of https://github.com/M66B/FairEmail.git synced 2025-02-23 22:51:02 +00:00
Code Issues Releases Wiki Activity

Fixed getting prev/next sole message

Browse source
This commit is contained in:
M66B 2021-08-05 07:45:48 +02:00
parent 16cd616c8e
commit 1fa0736876
1 changed files with 11 additions and 7 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

18
app/src/main/java/eu/faircode/email/ViewModelMessages.java
View file

@ -294,6 +294,9 @@ public class ViewModelMessages extends ViewModel {
} }
} }
if (curState[1] == null) // first changed
curState[1] = new Pair<>(id, -1);
if (Objects.equals(lastState[0], curState[0]) && if (Objects.equals(lastState[0], curState[0]) &&
Objects.equals(lastState[1], curState[1]) && Objects.equals(lastState[1], curState[1]) &&
Objects.equals(lastState[2], curState[2])) { Objects.equals(lastState[2], curState[2])) {
@ -306,17 +309,18 @@ public class ViewModelMessages extends ViewModel {
" base=" + (curState[1] == null ? null : curState[1].first + "/" + curState[1].second) + " base=" + (curState[1] == null ? null : curState[1].first + "/" + curState[1].second) +
" next=" + (curState[2] == null ? null : curState[2].first + "/" + curState[2].second)); " next=" + (curState[2] == null ? null : curState[2].first + "/" + curState[2].second));
if (curState[1].second >= 0)
intf.onFound(curState[1].second, messages.size());
if (!(lastState[0] != null && curState[0] == null))
intf.onPrevious(curState[0] != null, curState[0] == null ? null : curState[0].first);
if (!(lastState[2] != null && curState[2] == null))
intf.onNext(curState[2] != null, curState[2] == null ? null : curState[2].first);
lastState[0] = curState[0]; lastState[0] = curState[0];
lastState[1] = curState[1]; lastState[1] = curState[1];
lastState[2] = curState[2]; lastState[2] = curState[2];
if (curState[1] != null) { if (curState[1].second >= 0 &&
intf.onFound(curState[1].second, messages.size());
intf.onPrevious(curState[0] != null, curState[0] == null ? null : curState[0].first);
intf.onNext(curState[2] != null, curState[2] == null ? null : curState[2].first);
}
if (curState[1] != null &&
(curState[0] == null || curState[0].first != null) && (curState[0] == null || curState[0].first != null) &&
(curState[2] == null || curState[2].first != null)) (curState[2] == null || curState[2].first != null))
return; return;