Caching toots (#809)
* Initial timeline cache implementation * Fix build/DI errors for caching * Rename timeline entities tables. Add migration. Add DB scheme file. * Fix uniqueness problem, change offline strategy, improve mapping * Try to merge in new statuses, fix bottom loading, fix saving spans. * Fix reblogs IDs, fix inserting elements from top * Send one more request to get latest timeline statuses * Give Timeline placeholders string id. Rewrite Either in Kotlin * Initial placeholder implementation for caching * Fix crash on removing overlap statuses * Migrate counters to long * Remove unused counters. Add minimal TimelineDAOTest * Fix bug with placeholder ID * Update cache in response to events. Refactor TimelineCases * Fix crash, reduce number of placeholders * Fix crash, fix filtering, improve placeholder handling * Fix migration, add 8-9 migration test * Fix initial timeline update, remove more placeholders * Add cleanup for old statuses * Fix cleanup * Delete ExampleInstrumentedTest * Improve timeline UX regarding caching * Fix typos * Fix initial timeline update * Cleanup/fix initial timeline update * Workaround for weird behavior of first post on initial tl update. * Change counter types back to int * Clear timeline cache on logout * Fix loading when timeline is completely empty * Fix androidx migration issues * Fix tests * Apply caching feedback * Save account emojis to cache * Fix warnings and bugs
This commit is contained in:
parent
75158a3aa0
commit
3ab78a19bc
29 changed files with 1950 additions and 497 deletions
|
@ -1,125 +0,0 @@
|
|||
/* Copyright 2017 Andrew Dawson
|
||||
*
|
||||
* This file is a part of Tusky.
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify it under the terms of the
|
||||
* GNU General Public License as published by the Free Software Foundation; either version 3 of the
|
||||
* License, or (at your option) any later version.
|
||||
*
|
||||
* Tusky is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even
|
||||
* the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General
|
||||
* Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License along with Tusky; if not,
|
||||
* see <http://www.gnu.org/licenses>. */
|
||||
package com.keylesspalace.tusky.util;
|
||||
|
||||
import androidx.annotation.NonNull;
|
||||
import androidx.annotation.Nullable;
|
||||
|
||||
/**
|
||||
* Created by charlag on 05/11/17.
|
||||
*
|
||||
* Class to represent sum type/tagged union/variant/ADT e.t.c.
|
||||
* It is either Left or Right.
|
||||
*/
|
||||
public final class Either<L, R> {
|
||||
|
||||
/**
|
||||
* Constructs Left instance of either
|
||||
* @param left Object to be considered Left
|
||||
* @param <L> Left type
|
||||
* @param <R> Right type
|
||||
* @return new instance of Either which contains left.
|
||||
*/
|
||||
public static <L, R> Either<L, R> left(L left) {
|
||||
return new Either<>(left, false);
|
||||
}
|
||||
|
||||
/**
|
||||
* Constructs Right instance of either
|
||||
* @param right Object to be considered Right
|
||||
* @param <L> Left type
|
||||
* @param <R> Right type
|
||||
* @return new instance of Either which contains right.
|
||||
*/
|
||||
public static <L, R> Either<L, R> right(R right) {
|
||||
return new Either<>(right, true);
|
||||
}
|
||||
|
||||
private final Object value;
|
||||
// we need it because of the types erasure
|
||||
private boolean isRight;
|
||||
|
||||
private Either(Object value, boolean isRight) {
|
||||
this.value = value;
|
||||
this.isRight = isRight;
|
||||
}
|
||||
|
||||
public boolean isRight() {
|
||||
return isRight;
|
||||
}
|
||||
|
||||
/**
|
||||
* Try to get contained object as a Left or throw an exception.
|
||||
* @throws AssertionError If contained value is Right
|
||||
* @return contained value as Right
|
||||
*/
|
||||
public @NonNull L getAsLeft() {
|
||||
if (isRight) {
|
||||
throw new AssertionError("Tried to get the Either as Left while it is Right");
|
||||
}
|
||||
//noinspection unchecked
|
||||
return (L) value;
|
||||
}
|
||||
|
||||
/**
|
||||
* Try to get contained object as a Right or throw an exception.
|
||||
* @throws AssertionError If contained value is Left
|
||||
* @return contained value as Right
|
||||
*/
|
||||
public @NonNull R getAsRight() {
|
||||
if (!isRight) {
|
||||
throw new AssertionError("Tried to get the Either as Right while it is Left");
|
||||
}
|
||||
//noinspection unchecked
|
||||
return (R) value;
|
||||
}
|
||||
|
||||
/**
|
||||
* Same as {@link #getAsLeft()} but returns {@code null} is the value if Right instead of
|
||||
* throwing an exception.
|
||||
* @return contained value as Left or null
|
||||
*/
|
||||
public @Nullable L getAsLeftOrNull() {
|
||||
if (isRight) {
|
||||
return null;
|
||||
}
|
||||
//noinspection unchecked
|
||||
return (L) value;
|
||||
}
|
||||
|
||||
/**
|
||||
* Same as {@link #getAsRight()} but returns {@code null} is the value if Left instead of
|
||||
* throwing an exception.
|
||||
* @return contained value as Right or null
|
||||
*/
|
||||
public @Nullable R getAsRightOrNull() {
|
||||
if (!isRight) {
|
||||
return null;
|
||||
}
|
||||
//noinspection unchecked
|
||||
return (R) value;
|
||||
}
|
||||
|
||||
@Override
|
||||
public boolean equals(Object obj) {
|
||||
if (this == obj) return true;
|
||||
if (obj == null) return false;
|
||||
if (!(obj instanceof Either)) return false;
|
||||
Either that = (Either) obj;
|
||||
return this.isRight == that.isRight &&
|
||||
(this.value == that.value ||
|
||||
this.value != null && this.value.equals(that.value));
|
||||
}
|
||||
}
|
37
app/src/main/java/com/keylesspalace/tusky/util/Either.kt
Normal file
37
app/src/main/java/com/keylesspalace/tusky/util/Either.kt
Normal file
|
@ -0,0 +1,37 @@
|
|||
/* Copyright 2017 Andrew Dawson
|
||||
*
|
||||
* This file is a part of Tusky.
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify it under the terms of the
|
||||
* GNU General Public License as published by the Free Software Foundation; either version 3 of the
|
||||
* License, or (at your option) any later version.
|
||||
*
|
||||
* Tusky is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even
|
||||
* the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General
|
||||
* Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License along with Tusky; if not,
|
||||
* see <http://www.gnu.org/licenses>. */
|
||||
|
||||
package com.keylesspalace.tusky.util
|
||||
|
||||
/**
|
||||
* Created by charlag on 05/11/17.
|
||||
*
|
||||
* Class to represent sum type/tagged union/variant/ADT e.t.c.
|
||||
* It is either Left or Right.
|
||||
*/
|
||||
sealed class Either<out L, out R> {
|
||||
data class Left<out L, out R>(val value: L) : Either<L, R>()
|
||||
data class Right<out L, out R>(val value: R) : Either<L, R>()
|
||||
|
||||
fun isRight() = this is Right
|
||||
|
||||
fun asLeftOrNull() = (this as? Left<L, R>)?.value
|
||||
|
||||
fun asRightOrNull() = (this as? Right<L, R>)?.value
|
||||
|
||||
fun asLeft(): L = (this as Left<L, R>).value
|
||||
|
||||
fun asRight(): R = (this as Right<L, R>).value
|
||||
}
|
|
@ -18,16 +18,21 @@ package com.keylesspalace.tusky.util;
|
|||
import androidx.annotation.Nullable;
|
||||
|
||||
import java.util.ArrayList;
|
||||
import java.util.Iterator;
|
||||
import java.util.LinkedHashSet;
|
||||
import java.util.List;
|
||||
|
||||
public class ListUtils {
|
||||
/** @return true if list is null or else return list.isEmpty() */
|
||||
/**
|
||||
* @return true if list is null or else return list.isEmpty()
|
||||
*/
|
||||
public static boolean isEmpty(@Nullable List list) {
|
||||
return list == null || list.isEmpty();
|
||||
}
|
||||
|
||||
/** @return a new ArrayList containing the elements without duplicates in the same order */
|
||||
/**
|
||||
* @return a new ArrayList containing the elements without duplicates in the same order
|
||||
*/
|
||||
public static <T> ArrayList<T> removeDuplicates(List<T> list) {
|
||||
LinkedHashSet<T> set = new LinkedHashSet<>(list);
|
||||
return new ArrayList<>(set);
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue