From 5f4c8c6be2c5c0cabc85c5da8c145117148a71e3 Mon Sep 17 00:00:00 2001 From: Damien Elmes Date: Fri, 10 Jun 2022 16:48:04 +1000 Subject: [PATCH] Don't store collection reference in DeckTreeNode Pass it in to processChildren() instead, which is cleaner, and will work better with the move to a backend method. Speed up deck list by rendering it with the backend This delegates to the backend to render the deck tree, instead of calculating it in Java. On @Arthur-Milchior's large collection with the daily limits turned up, the speed difference in an x86_64 sim is dramatic: 2.4s with the old Java code, and 70ms with the new Rust code. - Make deckDueList() private; switch callers to use deckDueTree() The backend only provides a deckDueTree(), and switching the calls to deckDueList() now will make migration easier in the future. Squashed from #11599 --- .../anki/provider/CardContentProvider.kt | 48 ++++++++++------ .../libanki/sched/AbstractDeckTreeNode.kt | 3 +- .../com/ichi2/libanki/sched/AbstractSched.kt | 15 ++--- .../com/ichi2/libanki/sched/BackendSched.kt | 55 +++++++++++++++++++ .../ichi2/libanki/sched/DeckDueTreeNode.kt | 6 +- .../com/ichi2/libanki/sched/DeckTreeNode.kt | 8 +-- .../java/com/ichi2/libanki/sched/Sched.java | 4 +- .../java/com/ichi2/libanki/sched/SchedV2.java | 39 +++++++------ .../java/com/ichi2/libanki/sync/Syncer.java | 2 +- .../libanki/sched/AbstractSchedTest.java | 2 +- .../com/ichi2/libanki/sched/SchedV2Test.java | 38 +++++++------ 11 files changed, 149 insertions(+), 71 deletions(-) create mode 100644 AnkiDroid/src/main/java/com/ichi2/libanki/sched/BackendSched.kt diff --git a/AnkiDroid/src/main/java/com/ichi2/anki/provider/CardContentProvider.kt b/AnkiDroid/src/main/java/com/ichi2/anki/provider/CardContentProvider.kt index c2acecabd3fa..5d7bb6aeba43 100644 --- a/AnkiDroid/src/main/java/com/ichi2/anki/provider/CardContentProvider.kt +++ b/AnkiDroid/src/main/java/com/ichi2/anki/provider/CardContentProvider.kt @@ -37,6 +37,7 @@ import com.ichi2.libanki.backend.exception.DeckRenameException import com.ichi2.libanki.exception.EmptyMediaException import com.ichi2.libanki.sched.AbstractSched import com.ichi2.libanki.sched.DeckDueTreeNode +import com.ichi2.libanki.sched.TreeNode import com.ichi2.libanki.utils.TimeManager import com.ichi2.utils.FileUtil.internalizeUri import com.ichi2.utils.JSONArray @@ -375,28 +376,44 @@ class CardContentProvider : ContentProvider() { rv } DECKS -> { - val allDecks = col.sched.deckDueList() val columns = projection ?: FlashCardsContract.Deck.DEFAULT_PROJECTION - val rv = MatrixCursor(columns, allDecks.size) - for (deck: DeckDueTreeNode? in allDecks) { - val id = deck!!.did - val name = deck.fullDeckName - addDeckToCursor(id, name, getDeckCountsFromDueTreeNode(deck), rv, col, columns) + val allDecks = col.sched.deckDueTree() + val rv = MatrixCursor(columns, 1) + fun forEach(nodeList: List>, fn: (DeckDueTreeNode) -> Unit) { + for (node in nodeList) { + fn(node.value) + forEach(node.children, fn) + } + } + forEach(allDecks) { + addDeckToCursor( + it.did, + it.fullDeckName, + getDeckCountsFromDueTreeNode(it), + rv, + col, + columns + ) } rv } DECKS_ID -> { - /* Direct access deck */ val columns = projection ?: FlashCardsContract.Deck.DEFAULT_PROJECTION val rv = MatrixCursor(columns, 1) - val allDecks = col.sched.deckDueList() - val deckId = uri.pathSegments[1].toLong() - for (deck: DeckDueTreeNode? in allDecks) { - if (deck!!.did == deckId) { - addDeckToCursor(deckId, deck.fullDeckName, getDeckCountsFromDueTreeNode(deck), rv, col, columns) - return rv + val allDecks = col.sched.deckDueTree() + val desiredDeckId = uri.pathSegments[1].toLong() + fun find(nodeList: List>, id: Long): DeckDueTreeNode? { + for (node in nodeList) { + if (node.value.did == id) { + return node.value + } + return find(node.children, id) } + return null + } + find(allDecks, desiredDeckId)?.let { + addDeckToCursor(it.did, it.fullDeckName, getDeckCountsFromDueTreeNode(it), rv, col, columns) } rv } @@ -413,10 +430,9 @@ class CardContentProvider : ContentProvider() { } } - private fun getDeckCountsFromDueTreeNode(deck: DeckDueTreeNode?): JSONArray { - @KotlinCleanup("use a scope function") + private fun getDeckCountsFromDueTreeNode(deck: DeckDueTreeNode): JSONArray { val deckCounts = JSONArray() - deckCounts.put(deck!!.lrnCount) + deckCounts.put(deck.lrnCount) deckCounts.put(deck.revCount) deckCounts.put(deck.newCount) return deckCounts diff --git a/AnkiDroid/src/main/java/com/ichi2/libanki/sched/AbstractDeckTreeNode.kt b/AnkiDroid/src/main/java/com/ichi2/libanki/sched/AbstractDeckTreeNode.kt index a448ce44080a..3237e7fe1da9 100644 --- a/AnkiDroid/src/main/java/com/ichi2/libanki/sched/AbstractDeckTreeNode.kt +++ b/AnkiDroid/src/main/java/com/ichi2/libanki/sched/AbstractDeckTreeNode.kt @@ -32,7 +32,6 @@ import java.util.* * [processChildren] should be called if the children of this node are modified. */ abstract class AbstractDeckTreeNode( - val col: Collection, /** * @return The full deck name, e.g. "A::B::C" */ @@ -68,7 +67,7 @@ abstract class AbstractDeckTreeNode( ) } - abstract fun processChildren(children: List, addRev: Boolean) + abstract fun processChildren(col: Collection, children: List, addRev: Boolean) override fun toString(): String { val buf = StringBuffer() diff --git a/AnkiDroid/src/main/java/com/ichi2/libanki/sched/AbstractSched.kt b/AnkiDroid/src/main/java/com/ichi2/libanki/sched/AbstractSched.kt index 3d038b665a6c..654fb8a17844 100644 --- a/AnkiDroid/src/main/java/com/ichi2/libanki/sched/AbstractSched.kt +++ b/AnkiDroid/src/main/java/com/ichi2/libanki/sched/AbstractSched.kt @@ -175,26 +175,23 @@ abstract class AbstractSched(val col: Collection) { */ abstract fun extendLimits(newc: Int, rev: Int) - /** - * @return [deckname, did, rev, lrn, new] - */ - abstract fun deckDueList(): List - /** * @param cancelListener A task that is potentially cancelled - * @return the due tree. null if task is cancelled + * @return the due tree. null only if task is cancelled */ abstract fun deckDueTree(cancelListener: CancelListener?): List>? /** - * @return the due tree. null if task is cancelled. + * @return the due tree. Never null. */ - abstract fun deckDueTree(): List> + fun deckDueTree(): List> { + return deckDueTree(null)!! + } /** * @return The tree of decks, without numbers */ - abstract fun quickDeckDueTree(): List> + abstract fun quickDeckDueTree(): List> /** New count for a single deck. * @param did The deck to consider (descendants and ancestors are ignored) diff --git a/AnkiDroid/src/main/java/com/ichi2/libanki/sched/BackendSched.kt b/AnkiDroid/src/main/java/com/ichi2/libanki/sched/BackendSched.kt new file mode 100644 index 000000000000..50aecd2d65a9 --- /dev/null +++ b/AnkiDroid/src/main/java/com/ichi2/libanki/sched/BackendSched.kt @@ -0,0 +1,55 @@ +/*************************************************************************************** + * Copyright (c) 2012 Ankitects Pty Ltd * + * * + * 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. * + * * + * This program 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 * + * this program. If not, see . * + ****************************************************************************************/ + +package com.ichi2.libanki.sched + +import anki.decks.DeckTreeNode +import com.ichi2.libanki.CollectionV16 +import com.ichi2.libanki.utils.TimeManager + +// The desktop code stores these routines in sched/base.py, and all schedulers inherit them. +// The presence of AbstractSched is going to complicate the introduction of the v3 scheduler, +// so for now these are stored in a separate file. + +fun CollectionV16.deckTree(includeCounts: Boolean): DeckTreeNode { + return backend.deckTree(if (includeCounts) TimeManager.time.intTime() else 0) +} + +/** + * Mutate the backend reply into a format expected by legacy code. This is less efficient, + * and AnkiDroid may wish to use .deckTree() in the future instead. + */ +fun CollectionV16.deckTreeLegacy(includeCounts: Boolean): List> { + fun toLegacyNode(node: anki.decks.DeckTreeNode, parentName: String): TreeNode { + val thisName = if (parentName.isEmpty()) { + node.name + } else { + "$parentName::${node.name}" + } + val treeNode = TreeNode( + DeckDueTreeNode( + thisName, + node.deckId, + node.reviewCount, + node.learnCount, + node.newCount, + ) + ) + treeNode.children.addAll(node.childrenList.asSequence().map { toLegacyNode(it, thisName) }) + return treeNode + } + return toLegacyNode(deckTree(includeCounts), "").children +} diff --git a/AnkiDroid/src/main/java/com/ichi2/libanki/sched/DeckDueTreeNode.kt b/AnkiDroid/src/main/java/com/ichi2/libanki/sched/DeckDueTreeNode.kt index ac519b58b071..7e3de4f9b7b6 100644 --- a/AnkiDroid/src/main/java/com/ichi2/libanki/sched/DeckDueTreeNode.kt +++ b/AnkiDroid/src/main/java/com/ichi2/libanki/sched/DeckDueTreeNode.kt @@ -18,6 +18,7 @@ package com.ichi2.libanki.sched import com.ichi2.libanki.Collection import com.ichi2.libanki.Decks import com.ichi2.utils.KotlinCleanup +import net.ankiweb.rsdroid.RustCleanup import java.util.* import kotlin.math.max import kotlin.math.min @@ -34,7 +35,8 @@ import kotlin.math.min */ @KotlinCleanup("maybe possible to remove gettres for revCount/lrnCount") @KotlinCleanup("rename name -> fullDeckName") -class DeckDueTreeNode(col: Collection, name: String, did: Long, override var revCount: Int, override var lrnCount: Int, override var newCount: Int) : AbstractDeckTreeNode(col, name, did) { +@RustCleanup("after migration, consider dropping this and using backend tree structure directly") +class DeckDueTreeNode(name: String, did: Long, override var revCount: Int, override var lrnCount: Int, override var newCount: Int) : AbstractDeckTreeNode(name, did) { override fun toString(): String { return String.format( Locale.US, "%s, %d, %d, %d, %d", @@ -50,7 +52,7 @@ class DeckDueTreeNode(col: Collection, name: String, did: Long, override var rev newCount = max(0, min(newCount, limit)) } - override fun processChildren(children: List, addRev: Boolean) { + override fun processChildren(col: Collection, children: List, addRev: Boolean) { // tally up children counts for (ch in children) { lrnCount += ch.lrnCount diff --git a/AnkiDroid/src/main/java/com/ichi2/libanki/sched/DeckTreeNode.kt b/AnkiDroid/src/main/java/com/ichi2/libanki/sched/DeckTreeNode.kt index ef4f6275e607..82194c2cbbc8 100644 --- a/AnkiDroid/src/main/java/com/ichi2/libanki/sched/DeckTreeNode.kt +++ b/AnkiDroid/src/main/java/com/ichi2/libanki/sched/DeckTreeNode.kt @@ -16,11 +16,11 @@ package com.ichi2.libanki.sched import com.ichi2.libanki.Collection -import com.ichi2.utils.KotlinCleanup +import net.ankiweb.rsdroid.RustCleanup -@KotlinCleanup("confusing nullability for col, verify real nullability after code related to scheduling is fully migrated to kotlin") -class DeckTreeNode(col: Collection, name: String, did: Long) : AbstractDeckTreeNode(col, name, did) { - override fun processChildren(children: List, addRev: Boolean) { +@RustCleanup("processChildren() can be removed after migrating to backend implementation") +class DeckTreeNode(name: String, did: Long) : AbstractDeckTreeNode(name, did) { + override fun processChildren(col: Collection, children: List, addRev: Boolean) { // intentionally blank } } diff --git a/AnkiDroid/src/main/java/com/ichi2/libanki/sched/Sched.java b/AnkiDroid/src/main/java/com/ichi2/libanki/sched/Sched.java index 2716d5983a34..c4f0abea3f36 100644 --- a/AnkiDroid/src/main/java/com/ichi2/libanki/sched/Sched.java +++ b/AnkiDroid/src/main/java/com/ichi2/libanki/sched/Sched.java @@ -213,7 +213,7 @@ private void unburyCardsForDeck(@NonNull List allDecks) { * Returns [deckname, did, rev, lrn, new] */ @Override - public @Nullable List deckDueList(@Nullable CancelListener cancelListener) { + protected @Nullable List deckDueList(@Nullable CancelListener cancelListener) { _checkDay(); getCol().getDecks().checkIntegrity(); List allDecksSorted = getCol().getDecks().allSorted(); @@ -242,7 +242,7 @@ private void unburyCardsForDeck(@NonNull List allDecks) { // reviews int rev = _revForDeck(deck.getLong("id"), rlim); // save to list - deckNodes.add(new DeckDueTreeNode(getCol(), deck.getString("name"), deck.getLong("id"), rev, lrn, _new)); + deckNodes.add(new DeckDueTreeNode(deck.getString("name"), deck.getLong("id"), rev, lrn, _new)); // add deck as a parent lims.put(Decks.normalizeName(deck.getString("name")), new Integer[]{nlim, rlim}); } diff --git a/AnkiDroid/src/main/java/com/ichi2/libanki/sched/SchedV2.java b/AnkiDroid/src/main/java/com/ichi2/libanki/sched/SchedV2.java index e6ce0cc517c4..0c1e369b814f 100644 --- a/AnkiDroid/src/main/java/com/ichi2/libanki/sched/SchedV2.java +++ b/AnkiDroid/src/main/java/com/ichi2/libanki/sched/SchedV2.java @@ -31,6 +31,7 @@ import android.text.style.StyleSpan; import android.util.Pair; +import com.ichi2.anki.AnkiDroidApp; import com.ichi2.anki.R; import com.ichi2.async.CancelListener; import com.ichi2.async.CollectionTask; @@ -57,6 +58,7 @@ import com.ichi2.utils.JSONObject; import com.ichi2.utils.SyncStatus; +import net.ankiweb.rsdroid.BackendFactory; import net.ankiweb.rsdroid.RustCleanup; import net.ankiweb.rsdroid.RustV1Cleanup; @@ -523,14 +525,14 @@ protected int _walkingCount(@NonNull LimitMethod limFn, @NonNull CountMethod cnt * * Return nulls when deck task is cancelled. */ - public @NonNull List deckDueList() { + private @NonNull List deckDueList() { return deckDueList(null); } // Overridden /** * Return sorted list of all decks.*/ - public @Nullable List deckDueList(@Nullable CancelListener collectionTask) { + protected @Nullable List deckDueList(@Nullable CancelListener collectionTask) { _checkDay(); getCol().getDecks().checkIntegrity(); List allDecksSorted = getCol().getDecks().allSorted(); @@ -561,7 +563,7 @@ protected int _walkingCount(@NonNull LimitMethod limFn, @NonNull CountMethod cnt int rlim = _deckRevLimitSingle(deck, plim, false); int rev = _revForDeck(deck.getLong("id"), rlim, childMap); // save to list - deckNodes.add(new DeckDueTreeNode(getCol(), deck.getString("name"), deck.getLong("id"), rev, lrn, _new)); + deckNodes.add(new DeckDueTreeNode(deck.getString("name"), deck.getLong("id"), rev, lrn, _new)); // add deck as a parent lims.put(Decks.normalizeName(deck.getString("name")), new Integer[]{nlim, rlim}); } @@ -574,13 +576,15 @@ protected int _walkingCount(@NonNull LimitMethod limFn, @NonNull CountMethod cnt requires multiple database access by deck. Ignoring this number lead to the creation of a tree more quickly.*/ @Override - public @NonNull List> quickDeckDueTree() { - // Similar to deckDueTree, ignoring the numbers - + public @NonNull + List> quickDeckDueTree() { + if (!BackendFactory.getDefaultLegacySchema()) { + return BackendSchedKt.deckTreeLegacy(getCol().getNewBackend(), false); + } // Similar to deckDueList ArrayList allDecksSorted = new ArrayList<>(); for (JSONObject deck : getCol().getDecks().allSorted()) { - DeckTreeNode g = new DeckTreeNode(getCol(), deck.getString("name"), deck.getLong("id")); + DeckTreeNode g = new DeckTreeNode(deck.getString("name"), deck.getLong("id")); allDecksSorted.add(g); } // End of the similar part. @@ -588,18 +592,19 @@ protected int _walkingCount(@NonNull LimitMethod limFn, @NonNull CountMethod cnt return _groupChildren(allDecksSorted, false); } - - public @NonNull List> deckDueTree() { - return deckDueTree(null); - } - @Nullable + @RustCleanup("enable for v2 once backend is updated to 2.1.41+") + @RustCleanup("once both v1 and v2 are using backend, cancelListener can be removed") public List> deckDueTree(@Nullable CancelListener cancelListener) { - List allDecksSorted = deckDueList(cancelListener); - if (allDecksSorted == null) { - return null; + if (!BackendFactory.getDefaultLegacySchema()) { + return BackendSchedKt.deckTreeLegacy(getCol().getNewBackend(), true); + } else { + List allDecksSorted = deckDueList(cancelListener); + if (allDecksSorted == null) { + return null; + } + return _groupChildren(allDecksSorted, true); } - return _groupChildren(allDecksSorted, true); } /** @@ -666,7 +671,7 @@ public List> deckDueTree(@Nullable CancelListener canc TreeNode toAdd = new TreeNode<>(child); toAdd.getChildren().addAll(childrenNode); List childValues = childrenNode.stream().map(TreeNode::getValue).collect(Collectors.toList()); - child.processChildren(childValues, "std".equals(getName())); + child.processChildren(getCol(), childValues, "std".equals(getName())); sortedChildren.add(toAdd); } diff --git a/AnkiDroid/src/main/java/com/ichi2/libanki/sync/Syncer.java b/AnkiDroid/src/main/java/com/ichi2/libanki/sync/Syncer.java index fc5f3969e40b..c066ba7f0995 100644 --- a/AnkiDroid/src/main/java/com/ichi2/libanki/sync/Syncer.java +++ b/AnkiDroid/src/main/java/com/ichi2/libanki/sync/Syncer.java @@ -449,7 +449,7 @@ public JSONObject sanityCheck() { mCol.getModels().save(); } // check for missing parent decks - mCol.getSched().deckDueList(); + mCol.getSched().quickDeckDueTree(); // return summary of deck JSONArray check = new JSONArray(); JSONArray counts = new JSONArray(); diff --git a/AnkiDroid/src/test/java/com/ichi2/libanki/sched/AbstractSchedTest.java b/AnkiDroid/src/test/java/com/ichi2/libanki/sched/AbstractSchedTest.java index b1b1430963c0..ae8f788ac2ad 100644 --- a/AnkiDroid/src/test/java/com/ichi2/libanki/sched/AbstractSchedTest.java +++ b/AnkiDroid/src/test/java/com/ichi2/libanki/sched/AbstractSchedTest.java @@ -204,7 +204,7 @@ public void deckDueTreeInconsistentDecksPasses() { addDeckWithExactName(child); getCol().getDecks().checkIntegrity(); - assertDoesNotThrow(() -> getCol().getSched().deckDueList()); + assertDoesNotThrow(() -> getCol().getSched().deckDueTree()); } diff --git a/AnkiDroid/src/test/java/com/ichi2/libanki/sched/SchedV2Test.java b/AnkiDroid/src/test/java/com/ichi2/libanki/sched/SchedV2Test.java index 75d40748bdb2..1a1c2d483af8 100644 --- a/AnkiDroid/src/test/java/com/ichi2/libanki/sched/SchedV2Test.java +++ b/AnkiDroid/src/test/java/com/ichi2/libanki/sched/SchedV2Test.java @@ -112,16 +112,16 @@ protected static List> expectedTree(Collection col, bo // These matched the previous Java data // These may want to be changed back List> expected = new ArrayList<>(); - DeckDueTreeNode caz = new DeckDueTreeNode(col, "cmxieunwoogyxsctnjmv::abcdefgh::ZYXW", 1596783600480L, 0, 0, 0); - DeckDueTreeNode ca = new DeckDueTreeNode(col, "cmxieunwoogyxsctnjmv::abcdefgh", 1596783600460L, 0, 0, 0); - DeckDueTreeNode ci = new DeckDueTreeNode(col, "cmxieunwoogyxsctnjmv::INSBGDS", 1596783600500L, 0, 0, 0); - DeckDueTreeNode c = new DeckDueTreeNode(col, "cmxieunwoogyxsctnjmv", 1596783600440L, 0, 0, 0); - DeckDueTreeNode defaul = new DeckDueTreeNode(col, "Default", 1, 0, 0, 0); - DeckDueTreeNode s = new DeckDueTreeNode(col, "scxipjiyozczaaczoawo", 1596783600420L, 0, 0, 0); - DeckDueTreeNode f = new DeckDueTreeNode(col, "blank::foobar", 1596783600540L, 0, 0, 0); - DeckDueTreeNode b = new DeckDueTreeNode(col, "blank", 1596783600520L, 0, 0, 0); - DeckDueTreeNode aBlank = new DeckDueTreeNode(col, "A::blank", 1596783600580L, 0, 0, 0); - DeckDueTreeNode a = new DeckDueTreeNode(col, "A", 1596783600560L, 0, 0, 0); + DeckDueTreeNode caz = new DeckDueTreeNode("cmxieunwoogyxsctnjmv::abcdefgh::ZYXW", 1596783600480L, 0, 0, 0); + DeckDueTreeNode ca = new DeckDueTreeNode("cmxieunwoogyxsctnjmv::abcdefgh", 1596783600460L, 0, 0, 0); + DeckDueTreeNode ci = new DeckDueTreeNode("cmxieunwoogyxsctnjmv::INSBGDS", 1596783600500L, 0, 0, 0); + DeckDueTreeNode c = new DeckDueTreeNode("cmxieunwoogyxsctnjmv", 1596783600440L, 0, 0, 0); + DeckDueTreeNode defaul = new DeckDueTreeNode("Default", 1, 0, 0, 0); + DeckDueTreeNode s = new DeckDueTreeNode("scxipjiyozczaaczoawo", 1596783600420L, 0, 0, 0); + DeckDueTreeNode f = new DeckDueTreeNode("blank::foobar", 1596783600540L, 0, 0, 0); + DeckDueTreeNode b = new DeckDueTreeNode("blank", 1596783600520L, 0, 0, 0); + DeckDueTreeNode aBlank = new DeckDueTreeNode("A::blank", 1596783600580L, 0, 0, 0); + DeckDueTreeNode a = new DeckDueTreeNode("A", 1596783600560L, 0, 0, 0); TreeNode cazNode = new TreeNode<>(caz); @@ -135,7 +135,7 @@ protected static List> expectedTree(Collection col, bo // add "caz" to "ca" caNode.getChildren().add(cazNode); - caNode.getValue().processChildren(Collections.singletonList(cazNode.getValue()), addRev); + caNode.getValue().processChildren(col, Collections.singletonList(cazNode.getValue()), addRev); // add "ca" and "ci" to "c" cNode.getChildren().add(caNode); @@ -143,15 +143,15 @@ protected static List> expectedTree(Collection col, bo ArrayList cChildren = new ArrayList<>(); cChildren.add(caNode.getValue()); cChildren.add(ciNode.getValue()); - cNode.getValue().processChildren(cChildren, addRev); + cNode.getValue().processChildren(col, cChildren, addRev); // add "f" to "b" bNode.getChildren().add(fNode); - bNode.getValue().processChildren(Collections.singletonList(fNode.getValue()), addRev); + bNode.getValue().processChildren(col, Collections.singletonList(fNode.getValue()), addRev); // add "A::" to "A" aNode.getChildren().add(aBlankNode); - aNode.getValue().processChildren(Collections.singletonList(aBlankNode.getValue()), addRev); + aNode.getValue().processChildren(col, Collections.singletonList(aBlankNode.getValue()), addRev); expected.add(aNode); expected.add(bNode); @@ -822,8 +822,12 @@ public void test_review_limits() throws Exception { c.flush(); } - // position 0 is default deck. Different from upstream - TreeNode tree = col.getSched().deckDueTree().get(1); + int parentIndex = 0; + if (BackendFactory.getDefaultLegacySchema()) { + // position 0 is default deck. Different from upstream + parentIndex = 1; + } + TreeNode tree = col.getSched().deckDueTree().get(parentIndex); // (('parent', 1514457677462, 5, 0, 0, (('child', 1514457677463, 5, 0, 0, ()),))) assertEquals("parent", tree.getValue().getFullDeckName()); assertEquals(5, tree.getValue().getRevCount()); // paren, tree.review_count)t @@ -839,7 +843,7 @@ public void test_review_limits() throws Exception { col.getSched().answerCard(c, BUTTON_THREE); assertEquals(new Counts(0, 0, 9), col.getSched().counts()); - tree = col.getSched().deckDueTree().get(1); + tree = col.getSched().deckDueTree().get(parentIndex); assertEquals(4, tree.getValue().getRevCount()); assertEquals(9, tree.getChildren().get(0).getValue().getRevCount()); }