use of com.ichi2.libanki.sched.Counts in project Anki-Android by ankidroid.
the class SchedV2Test method test_deckFlowV2.
@Test
public void test_deckFlowV2() throws Exception {
Collection col = getColV2();
// add a note with default deck
Note note = col.newNote();
note.setItem("Front", "one");
col.addNote(note);
// and one that's a child
note = col.newNote();
note.setItem("Front", "two");
long default1 = addDeck("Default::2");
note.model().put("did", default1);
col.addNote(note);
// and another that's higher up
note = col.newNote();
note.setItem("Front", "three");
default1 = addDeck("Default::1");
note.model().put("did", default1);
col.addNote(note);
// should get top level one first, then ::1, then ::2
col.reset();
assertEquals(new Counts(3, 0, 0), col.getSched().counts());
for (String i : new String[] { "one", "three", "two" }) {
Card c = getCard();
assertEquals(i, c.note().getItem("Front"));
col.getSched().answerCard(c, BUTTON_THREE);
}
}
use of com.ichi2.libanki.sched.Counts in project Anki-Android by ankidroid.
the class SchedV2Test method test_filt_reviewing_early_normal.
@Test
public void test_filt_reviewing_early_normal() throws Exception {
Collection col = getColV2();
Note note = col.newNote();
note.setItem("Front", "one");
col.addNote(note);
Card c = note.cards().get(0);
c.setIvl(100);
c.setQueue(QUEUE_TYPE_REV);
c.setType(CARD_TYPE_REV);
// due in 25 days, so it's been waiting 75 days
c.setDue(col.getSched().getToday() + 25);
c.setMod(1);
c.setFactor(STARTING_FACTOR);
c.startTimer();
c.flush();
col.reset();
assertEquals(new Counts(0, 0, 0), col.getSched().counts());
// create a dynamic deck and refresh it
long did = addDynamicDeck("Cram");
col.getSched().rebuildDyn(did);
col.reset();
// should appear as normal in the deck list
/* todo sort
assertEquals(1, sorted(col.getSched().deckDueTree().getChildren())[0].review_count);
*/
// and should appear in the counts
assertEquals(new Counts(0, 0, 1), col.getSched().counts());
// grab it and check estimates
c = getCard();
assertEquals(4, col.getSched().answerButtons(c));
assertEquals(600, col.getSched().nextIvl(c, BUTTON_ONE));
assertEquals(Math.round(75 * 1.2) * SECONDS_PER_DAY, col.getSched().nextIvl(c, BUTTON_TWO));
assertThat(col.getSched().nextIvl(c, BUTTON_THREE), is((long) (75 * 2.5) * SECONDS_PER_DAY));
assertThat(col.getSched().nextIvl(c, BUTTON_FOUR), is((long) (75 * 2.5 * 1.15) * SECONDS_PER_DAY));
// answer 'good'
col.getSched().answerCard(c, BUTTON_THREE);
checkRevIvl(col, c, 90);
assertEquals(col.getSched().getToday() + c.getIvl(), c.getDue());
assertEquals(0L, c.getODue());
// should not be in learning
assertEquals(QUEUE_TYPE_REV, c.getQueue());
// should be logged as a cram rep
assertEquals(3, col.getDb().queryLongScalar("select type from revlog order by id desc limit 1"));
// due in 75 days, so it's been waiting 25 days
c.setIvl(100);
c.setDue(col.getSched().getToday() + 75);
c.flush();
col.getSched().rebuildDyn(did);
col.reset();
c = getCard();
assertEquals(60 * SECONDS_PER_DAY, col.getSched().nextIvl(c, BUTTON_TWO));
assertEquals(100 * SECONDS_PER_DAY, col.getSched().nextIvl(c, BUTTON_THREE));
assertEquals(114 * SECONDS_PER_DAY, col.getSched().nextIvl(c, BUTTON_FOUR));
}
use of com.ichi2.libanki.sched.Counts in project Anki-Android by ankidroid.
the class SchedTest method test_deckFlowV1.
@Test
public void test_deckFlowV1() throws Exception {
Collection col = getColV1();
// add a note with default deck
Note note = col.newNote();
note.setItem("Front", "one");
col.addNote(note);
// and one that's a child
note = col.newNote();
note.setItem("Front", "two");
JSONObject default1 = note.model().put("did", addDeck("Default::2"));
col.addNote(note);
// and another that's higher up
note = col.newNote();
note.setItem("Front", "three");
default1 = note.model().put("did", addDeck("Default::1"));
col.addNote(note);
// should get top level one first, then ::1, then ::2
col.reset();
assertEquals(new Counts(3, 0, 0), col.getSched().counts());
for (String i : new String[] { "one", "three", "two" }) {
Card c = getCard();
assertEquals(c.note().getItem("Front"), i);
col.getSched().answerCard(c, BUTTON_TWO);
}
}
use of com.ichi2.libanki.sched.Counts in project Anki-Android by ankidroid.
the class SchedTest method test_forgetV1.
@Test
public void test_forgetV1() throws Exception {
Collection col = getColV1();
Note note = col.newNote();
note.setItem("Front", "one");
col.addNote(note);
Card c = note.cards().get(0);
c.setQueue(QUEUE_TYPE_REV);
c.setType(CARD_TYPE_REV);
c.setIvl(100);
c.setDue(0);
c.flush();
col.reset();
assertEquals(new Counts(0, 0, 1), col.getSched().counts());
col.getSched().forgetCards(Collections.singletonList(c.getId()));
col.reset();
assertEquals(new Counts(1, 0, 0), col.getSched().counts());
}
use of com.ichi2.libanki.sched.Counts in project Anki-Android by ankidroid.
the class SchedTest method test_cram.
@Test
public void test_cram() throws Exception {
Collection col = getColV1();
Note note = col.newNote();
note.setItem("Front", "one");
col.addNote(note);
Card c = note.cards().get(0);
c.setIvl(100);
c.setQueue(QUEUE_TYPE_REV);
c.setType(CARD_TYPE_REV);
// due in 25 days, so it's been waiting 75 days
c.setDue(col.getSched().getToday() + 25);
c.setMod(1);
c.setFactor(STARTING_FACTOR);
c.startTimer();
c.flush();
col.reset();
assertEquals(new Counts(0, 0, 0), col.getSched().counts());
Card cardcopy = c.clone();
// create a dynamic deck and refresh it
long did = addDynamicDeck("Cram");
col.getSched().rebuildDyn(did);
col.reset();
// should appear as new in the deck list
// todo: which sort
// and should appear in the counts
assertEquals(new Counts(1, 0, 0), col.getSched().counts());
// grab it and check estimates
c = getCard();
assertEquals(2, col.getSched().answerButtons(c));
assertEquals(600, col.getSched().nextIvl(c, BUTTON_ONE));
assertEquals(138 * 60 * 60 * 24, col.getSched().nextIvl(c, BUTTON_TWO));
Deck cram = col.getDecks().get(did);
cram.put("delays", new JSONArray(new double[] { 1, 10 }));
col.getDecks().save(cram);
assertEquals(3, col.getSched().answerButtons(c));
assertEquals(60, col.getSched().nextIvl(c, BUTTON_ONE));
assertEquals(600, col.getSched().nextIvl(c, BUTTON_TWO));
assertEquals(138 * 60 * 60 * 24, col.getSched().nextIvl(c, BUTTON_THREE));
col.getSched().answerCard(c, BUTTON_TWO);
// elapsed time was 75 days
// factor = 2.5+1.2/2 = 1.85
// int(75*1.85) = 138
assertEquals(138, c.getIvl());
assertEquals(138, c.getODue());
assertEquals(QUEUE_TYPE_LRN, c.getQueue());
// should be logged as a cram rep
assertEquals(3, col.getDb().queryLongScalar("select type from revlog order by id desc limit 1"));
// check ivls again
assertEquals(60, col.getSched().nextIvl(c, BUTTON_ONE));
assertEquals(138 * 60 * 60 * 24, col.getSched().nextIvl(c, BUTTON_TWO));
assertEquals(138 * 60 * 60 * 24, col.getSched().nextIvl(c, BUTTON_THREE));
// when it graduates, due is updated
c = getCard();
col.getSched().answerCard(c, BUTTON_TWO);
assertEquals(138, c.getIvl());
assertEquals(138, c.getDue());
assertEquals(QUEUE_TYPE_REV, c.getQueue());
// and it will have moved back to the previous deck
assertEquals(1, c.getDid());
// cram the deck again
col.getSched().rebuildDyn(did);
col.reset();
c = getCard();
// check ivls again - passing should be idempotent
assertEquals(60, col.getSched().nextIvl(c, BUTTON_ONE));
assertEquals(600, col.getSched().nextIvl(c, BUTTON_TWO));
assertEquals(138 * 60 * 60 * 24, col.getSched().nextIvl(c, BUTTON_THREE));
col.getSched().answerCard(c, BUTTON_TWO);
assertEquals(138, c.getIvl());
assertEquals(138, c.getODue());
// fail
col.getSched().answerCard(c, BUTTON_ONE);
assertEquals(60, col.getSched().nextIvl(c, BUTTON_ONE));
assertEquals(600, col.getSched().nextIvl(c, BUTTON_TWO));
assertEquals(SECONDS_PER_DAY, col.getSched().nextIvl(c, BUTTON_THREE));
// delete the deck, returning the card mid-study
col.getDecks().rem(col.getDecks().selected());
assertEquals(1, col.getSched().deckDueTree().size());
c.load();
assertEquals(1, c.getIvl());
assertEquals(col.getSched().getToday() + 1, c.getDue());
// make it due
col.reset();
assertEquals(new Counts(0, 0, 0), col.getSched().counts());
c.setDue(-5);
c.setIvl(100);
c.flush();
col.reset();
assertEquals(new Counts(0, 0, 1), col.getSched().counts());
// cram again
did = addDynamicDeck("Cram");
col.getSched().rebuildDyn(did);
col.reset();
assertEquals(new Counts(0, 0, 1), col.getSched().counts());
c.load();
assertEquals(4, col.getSched().answerButtons(c));
// add a sibling so we can test minSpace, etc
Card c2 = c.clone();
c2.setId(0);
c2.setOrd(1);
c2.setDue(325);
c2.flush();
// should be able to answer it
c = getCard();
col.getSched().answerCard(c, BUTTON_FOUR);
// it should have been moved back to the original deck
assertEquals(1, c.getDid());
}
Aggregations