use of com.ichi2.anki.CardBrowser.Column.CARD in project AnkiChinaAndroid by ankichinateam.
the class SchedV2Test method test_collapseV2.
@Test
public void test_collapseV2() throws Exception {
Collection col = getColV2();
// add a note
Note note = col.newNote();
note.setItem("Front", "one");
col.addNote(note);
col.reset();
// test collapsing
Card c = col.getSched().getCard();
col.getSched().answerCard(c, 1);
c = col.getSched().getCard();
col.getSched().answerCard(c, 4);
assertNull(col.getSched().getCard());
}
use of com.ichi2.anki.CardBrowser.Column.CARD in project AnkiChinaAndroid by ankichinateam.
the class SchedV2Test method test_review_limits.
@Test
public void test_review_limits() throws Exception {
Collection col = getColV2();
Deck parent = col.getDecks().get(col.getDecks().id("parent"));
Deck child = col.getDecks().get(col.getDecks().id("parent::child"));
DeckConfig pconf = col.getDecks().getConf(col.getDecks().confId("parentConf"));
DeckConfig cconf = col.getDecks().getConf(col.getDecks().confId("childConf"));
pconf.getJSONObject("rev").put("perDay", 5);
col.getDecks().updateConf(pconf);
col.getDecks().setConf(parent, pconf.getLong("id"));
cconf.getJSONObject("rev").put("perDay", 10);
col.getDecks().updateConf(cconf);
col.getDecks().setConf(child, cconf.getLong("id"));
Model m = col.getModels().current();
m.put("did", child.getLong("id"));
col.getModels().save(m, false);
// add some cards
for (int i = 0; i < 20; i++) {
Note note = col.newNote();
note.setItem("Front", "one");
note.setItem("Back", "two");
col.addNote(note);
// make them reviews
Card c = note.cards().get(0);
c.setQueue(CARD_TYPE_REV);
c.setType(QUEUE_TYPE_REV);
c.setDue(0);
c.flush();
}
// position 0 is default deck. Different from upstream
DeckDueTreeNode tree = col.getSched().deckDueTree().get(1);
// (('parent', 1514457677462, 5, 0, 0, (('child', 1514457677463, 5, 0, 0, ()),)))
assertEquals("parent", tree.getFullDeckName());
// paren, tree.review_count)t
assertEquals(5, tree.getRevCount());
assertEquals(5, tree.getChildren().get(0).getRevCount());
// .counts() should match
col.getDecks().select(child.getLong("id"));
col.reset();
assertArrayEquals(new int[] { 0, 0, 5 }, col.getSched().counts());
// answering a card in the child should decrement parent count
Card c = col.getSched().getCard();
col.getSched().answerCard(c, 3);
assertArrayEquals(new int[] { 0, 0, 4 }, col.getSched().counts());
tree = col.getSched().deckDueTree().get(1);
assertEquals(4, tree.getRevCount());
assertEquals(4, tree.getChildren().get(0).getRevCount());
}
use of com.ichi2.anki.CardBrowser.Column.CARD in project AnkiChinaAndroid by ankichinateam.
the class SchedV2Test method test_negativeDueFilter.
// cards with a due date earlier than the collection should retain
// their due date when removed
@Test
public void test_negativeDueFilter() throws Exception {
Collection col = getColV2();
// card due prior to collection date
Note note = col.newNote();
note.setItem("Front", "one");
note.setItem("Back", "two");
col.addNote(note);
Card c = note.cards().get(0);
c.setDue(-5);
c.setQueue(QUEUE_TYPE_REV);
c.setIvl(5);
c.flush();
// into and out of filtered deck
long did = col.getDecks().newDyn("Cram");
col.getSched().rebuildDyn(did);
col.getSched().emptyDyn(did);
col.reset();
c.load();
assertEquals(-5, c.getDue());
}
use of com.ichi2.anki.CardBrowser.Column.CARD in project AnkiChinaAndroid by ankichinateam.
the class SchedV2Test method test_learnV2.
@Test
public void test_learnV2() throws Exception {
Collection col = getColV2();
// add a note
Note note = col.newNote();
note.setItem("Front", "one");
note.setItem("Back", "two");
col.addNote(note);
// set as a learn card and rebuild queues
col.getDb().execute("update cards set queue=0, type=0");
col.reset();
// sched.getCard should return it, since it's due in the past
Card c = col.getSched().getCard();
assertNotNull(c);
DeckConfig conf = col.getSched()._cardConf(c);
conf.getJSONObject("new").put("delays", new JSONArray(new double[] { 0.5, 3, 10 }));
col.getDecks().save(conf);
// fail it
col.getSched().answerCard(c, 1);
// it should have three reps left to graduation
assertEquals(3, c.getLeft() % 1000);
assertEquals(3, c.getLeft() / 1000);
// it should be due in 30 seconds
long t = Math.round(c.getDue() - col.getTime().intTime());
assertThat(t, is(greaterThanOrEqualTo(25L)));
assertThat(t, is(lessThanOrEqualTo(40L)));
// pass it once
col.getSched().answerCard(c, 3);
// it should be due in 3 minutes
long dueIn = c.getDue() - col.getTime().intTime();
assertThat(dueIn, is(greaterThanOrEqualTo(178L)));
assertThat(dueIn, is(lessThanOrEqualTo((long) (180 * 1.25))));
assertEquals(2, c.getLeft() % 1000);
assertEquals(2, c.getLeft() / 1000);
// check log is accurate
Cursor log = col.getDb().getDatabase().query("select * from revlog order by id desc");
assertTrue(log.moveToFirst());
assertEquals(3, log.getInt(3));
assertEquals(-180, log.getInt(4));
assertEquals(-30, log.getInt(5));
// pass again
col.getSched().answerCard(c, 3);
// it should be due in 10 minutes
dueIn = c.getDue() - col.getTime().intTime();
assertThat(dueIn, is(greaterThanOrEqualTo(599L)));
assertThat(dueIn, is(lessThanOrEqualTo((long) (600 * 1.25))));
assertEquals(1, c.getLeft() % 1000);
assertEquals(1, c.getLeft() / 1000);
// the next pass should graduate the card
assertEquals(QUEUE_TYPE_LRN, c.getQueue());
assertEquals(CARD_TYPE_LRN, c.getType());
col.getSched().answerCard(c, 3);
assertEquals(QUEUE_TYPE_REV, c.getQueue());
assertEquals(CARD_TYPE_REV, c.getType());
// should be due tomorrow, with an interval of 1
assertEquals(col.getSched().getToday() + 1, c.getDue());
assertEquals(1, c.getIvl());
// or normal removal
c.setType(CARD_TYPE_NEW);
c.setQueue(QUEUE_TYPE_LRN);
col.getSched().answerCard(c, 4);
assertEquals(CARD_TYPE_REV, c.getType());
assertEquals(QUEUE_TYPE_REV, c.getQueue());
assertTrue(checkRevIvl(col, c, 4));
// revlog should have been updated each time
assertEquals(5, col.getDb().queryScalar("select count() from revlog where type = 0"));
}
use of com.ichi2.anki.CardBrowser.Column.CARD in project AnkiChinaAndroid by ankichinateam.
the class SchedV2Test method test_preview.
@Test
public void test_preview() throws Exception {
// add cards
Collection col = getColV2();
Note note = col.newNote();
note.setItem("Front", "one");
col.addNote(note);
Card c = note.cards().get(0);
Card orig = c.clone();
Note note2 = col.newNote();
note2.setItem("Front", "two");
col.addNote(note2);
// cram deck
long did = col.getDecks().newDyn("Cram");
Deck cram = col.getDecks().get(did);
cram.put("resched", false);
col.getDecks().save(cram);
col.getSched().rebuildDyn(did);
col.reset();
// grab the first card
c = col.getSched().getCard();
assertEquals(2, col.getSched().answerButtons(c));
assertEquals(600, col.getSched().nextIvl(c, 1));
assertEquals(0, col.getSched().nextIvl(c, 2));
// failing it will push its due time back
long due = c.getDue();
col.getSched().answerCard(c, 1);
assertNotEquals(c.getDue(), due);
// the other card should come next
Card c2 = col.getSched().getCard();
assertNotEquals(c2.getId(), c.getId());
// passing it will remove it
col.getSched().answerCard(c2, 2);
assertEquals(QUEUE_TYPE_NEW, c2.getQueue());
assertEquals(0, c2.getReps());
assertEquals(CARD_TYPE_NEW, c2.getType());
// the other card should appear again
c = col.getSched().getCard();
assertEquals(orig.getId(), c.getId());
// emptying the filtered deck should restore card
col.getSched().emptyDyn(did);
c.load();
assertEquals(QUEUE_TYPE_NEW, c.getQueue());
assertEquals(0, c.getReps());
assertEquals(CARD_TYPE_NEW, c.getType());
}
Aggregations