forked from Arthur-Milchior/anki
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtest_schedv2.py
1216 lines (1125 loc) · 32.5 KB
/
test_schedv2.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
# coding: utf-8
import copy
import time
from anki.consts import *
from anki.hooks import addHook
from anki.utils import intTime
from tests.shared import getEmptyCol
def test_clock():
d = getEmptyCol()
if (d.sched.dayCutoff - intTime()) < 10*60:
raise Exception("Unit tests will fail around the day rollover.")
def checkRevIvl(d, c, targetIvl):
min, max = d.sched._fuzzIvlRange(targetIvl)
return min <= c.ivl <= max
def test_basics():
d = getEmptyCol()
d.reset()
assert not d.sched.getCard()
def test_new():
d = getEmptyCol()
d.reset()
assert d.sched.newCount() == 0
# add a note
f = d.newNote()
f['Front'] = "one"; f['Back'] = "two"
d.addNote(f)
d.reset()
assert d.sched.newCount() == 1
# fetch it
c = d.sched.getCard()
assert c
assert c.queue == QUEUE_NEW
assert c.type == 0
# if we answer it, it should become a learn card
t = intTime()
d.sched.answerCard(c, 1)
assert c.queue == QUEUE_LRN
assert c.type == CARD_LRN
assert c.due >= t
# disabled for now, as the learn fudging makes this randomly fail
# # the default order should ensure siblings are not seen together, and
# # should show all cards
# m = d.models.current(); mm = d.models
# t = m.newTemplate("Reverse",
# "{{Back}}",
#= "{{Front}}")
# m.save()
# f = d.newNote()
# f['Front'] = u"2"; f['Back'] = u"2"
# d.addNote(f)
# f = d.newNote()
# f['Front'] = u"3"; f['Back'] = u"3"
# d.addNote(f)
# d.reset()
# qs = ("2", "3", "2", "3")
# for n in range(4):
# c = d.sched.getCard()
# assert qs[n] in c.q()
# d.sched.answerCard(c, 2)
def test_newLimits():
d = getEmptyCol()
# add some notes
g2 = d.decks.byName("Default::foo", create=True)
for i in range(30):
f = d.newNote()
f['Front'] = str(i)
if i > 4:
f.model()['did'] = g2.getId()
d.addNote(f)
# give the child deck a different configuration
c2 = d.decks.newConf("new conf")
g2.setConf(c2)
d.reset()
# both confs have defaulted to a limit of 20
assert d.sched.newCount() == 20
# first card we get comes from parent
c = d.sched.getCard()
assert c.did == 1
# limit the parent to 10 cards, meaning we get 10 in total
conf1 = d.decks.get(1).getConf()
conf1['new']['perDay'] = 10
d.reset()
assert d.sched.newCount() == 10
# if we limit child to 4, we should get 9
conf2 = g2.getConf()
conf2['new']['perDay'] = 4
d.reset()
assert d.sched.newCount() == 9
def test_newBoxes():
d = getEmptyCol()
f = d.newNote()
f['Front'] = "one"
d.addNote(f)
d.reset()
c = d.sched.getCard()
c.currentConf()['new']['delays'] = [1,2,3,4,5]
d.sched.answerCard(c, 2)
# should handle gracefully
c.currentConf()['new']['delays'] = [1]
d.sched.answerCard(c, 2)
def test_learn():
d = getEmptyCol()
# add a note
f = d.newNote()
f['Front'] = "one"; f['Back'] = "two"
f = d.addNote(f)
# set as a learn card and rebuild queues
d.db.execute("update cards set queue=0, type=0")
d.reset()
# sched.getCard should return it, since it's due in the past
c = d.sched.getCard()
assert c
c.currentConf()['new']['delays'] = [0.5, 3, 10]
# fail it
d.sched.answerCard(c, 1)
# it should have three reps left to graduation
assert c.left%1000 == 3
assert c.left//1000 == 3
# it should by due in 30 seconds
t = round(c.due - time.time())
assert t >= 25 and t <= 40
# pass it once
d.sched.answerCard(c, 3)
# it should by due in 3 minutes
dueIn = c.due - time.time()
assert 179 <= dueIn <= 180*1.25
assert c.left%1000 == 2
assert c.left//1000 == 2
# check log is accurate
log = d.db.first("select * from revlog order by id desc")
assert log[3] == 3
assert log[4] == -180
assert log[5] == -30
# pass again
d.sched.answerCard(c, 3)
# it should by due in 10 minutes
dueIn = c.due - time.time()
assert 599 <= dueIn <= 600*1.25
assert c.left%1000 == 1
assert c.left//1000 == 1
# the next pass should graduate the card
assert c.queue == QUEUE_LRN
assert c.type == CARD_LRN
d.sched.answerCard(c, 3)
assert c.queue == QUEUE_REV
assert c.type == CARD_DUE
# should be due tomorrow, with an interval of 1
assert c.due == d.sched.today+1
assert c.ivl == 1
# or normal removal
c.type = 0
c.queue = QUEUE_LRN
d.sched.answerCard(c, 4)
assert c.type == CARD_DUE
assert c.queue == QUEUE_REV
assert checkRevIvl(d, c, 4)
# revlog should have been updated each time
assert d.db.scalar("select count() from revlog where type = 0") == 5
def test_relearn():
d = getEmptyCol()
f = d.newNote()
f['Front'] = "one"
d.addNote(f)
c = f.cards()[0]
c.ivl = 100
c.due = d.sched.today
c.type = c.queue = QUEUE_REV
c.flush()
# fail the card
d.reset()
c = d.sched.getCard()
d.sched.answerCard(c, 1)
assert c.queue == QUEUE_LRN
assert c.type == CARD_RELRN
assert c.ivl == 1
# immediately graduate it
d.sched.answerCard(c, 4)
assert c.queue == QUEUE_REV and c.type == CARD_DUE
assert c.ivl == 2
assert c.due == d.sched.today + c.ivl
def test_relearn_no_steps():
d = getEmptyCol()
f = d.newNote()
f['Front'] = "one"
d.addNote(f)
c = f.cards()[0]
c.ivl = 100
c.due = d.sched.today
c.type = c.queue = QUEUE_REV
c.flush()
conf = d.decks.get(1).getConf()
conf['lapse']['delays'] = []
conf.save()
# fail the card
d.reset()
c = d.sched.getCard()
d.sched.answerCard(c, 1)
assert c.type == c.queue == QUEUE_REV
def test_learn_collapsed():
d = getEmptyCol()
# add 2 notes
f = d.newNote()
f['Front'] = "1"
f = d.addNote(f)
f = d.newNote()
f['Front'] = "2"
f = d.addNote(f)
# set as a learn card and rebuild queues
d.db.execute("update cards set queue=0, type=0")
d.reset()
# should get '1' first
c = d.sched.getCard()
assert c.q().endswith("1")
# pass it so it's due in 10 minutes
d.sched.answerCard(c, 3)
# get the other card
c = d.sched.getCard()
assert c.q().endswith("2")
# fail it so it's due in 1 minute
d.sched.answerCard(c, 1)
# we shouldn't get the same card again
c = d.sched.getCard()
assert not c.q().endswith("2")
def test_learn_day():
d = getEmptyCol()
# add a note
f = d.newNote()
f['Front'] = "one"
f = d.addNote(f)
d.sched.reset()
c = d.sched.getCard()
c.currentConf()['new']['delays'] = [1, 10, 1440, 2880]
# pass it
d.sched.answerCard(c, 3)
# two reps to graduate, 1 more today
assert c.left%1000 == 3
assert c.left//1000 == 1
assert d.sched.counts() == (0, 1, 0)
c = d.sched.getCard()
ni = d.sched.nextIvl
assert ni(c, 3) == 86400
# answering it will place it in queue 3
d.sched.answerCard(c, 3)
assert c.due == d.sched.today+1
assert c.queue == QUEUE_DAY_LRN
assert not d.sched.getCard()
# for testing, move it back a day
c.due -= 1
c.flush()
d.reset()
assert d.sched.counts() == (0, 1, 0)
c = d.sched.getCard()
# nextIvl should work
assert ni(c, 3) == 86400*2
# if we fail it, it should be back in the correct queue
d.sched.answerCard(c, 1)
assert c.queue == QUEUE_LRN
d.undo()
d.reset()
c = d.sched.getCard()
d.sched.answerCard(c, 3)
# simulate the passing of another two days
c.due -= 2
c.flush()
d.reset()
# the last pass should graduate it into a review card
assert ni(c, 3) == 86400
d.sched.answerCard(c, 3)
assert c.queue == c.type == CARD_DUE
# if the lapse step is tomorrow, failing it should handle the counts
# correctly
c.due = 0
c.flush()
d.reset()
assert d.sched.counts() == (0, 0, 1)
c.currentConf()['lapse']['delays'] = [1440]
c = d.sched.getCard()
d.sched.answerCard(c, 1)
assert c.queue == QUEUE_DAY_LRN
assert d.sched.counts() == (0, 0, 0)
def test_reviews():
d = getEmptyCol()
# add a note
f = d.newNote()
f['Front'] = "one"; f['Back'] = "two"
d.addNote(f)
# set the card up as a review card, due 8 days ago
c = f.cards()[0]
c.type = CARD_DUE
c.queue = QUEUE_REV
c.due = d.sched.today - 8
c.factor = STARTING_FACTOR
c.reps = 3
c.lapses = 1
c.ivl = 100
c.startTimer()
c.flush()
# save it for later use as well
cardcopy = copy.copy(c)
# try with an ease of 2
##################################################
c = copy.copy(cardcopy)
c.flush()
d.reset()
d.sched.answerCard(c, 2)
assert c.queue == QUEUE_REV
# the new interval should be (100) * 1.2 = 120
assert checkRevIvl(d, c, 120)
assert c.due == d.sched.today + c.ivl
# factor should have been decremented
assert c.factor == 2350
# check counters
assert c.lapses == 1
assert c.reps == 4
# ease 3
##################################################
c = copy.copy(cardcopy)
c.flush()
d.sched.answerCard(c, 3)
# the new interval should be (100 + 8/2) * 2.5 = 260
assert checkRevIvl(d, c, 260)
assert c.due == d.sched.today + c.ivl
# factor should have been left alone
assert c.factor == STARTING_FACTOR
# ease 4
##################################################
c = copy.copy(cardcopy)
c.flush()
d.sched.answerCard(c, 4)
# the new interval should be (100 + 8) * 2.5 * 1.3 = 351
assert checkRevIvl(d, c, 351)
assert c.due == d.sched.today + c.ivl
# factor should have been increased
assert c.factor == 2650
# leech handling
##################################################
c = copy.copy(cardcopy)
c.lapses = 7
c.flush()
# steup hook
hooked = []
def onLeech(card):
hooked.append(1)
addHook("leech", onLeech)
d.sched.answerCard(c, 1)
assert hooked
assert c.queue == QUEUE_SUSPENDED
c.load()
assert c.queue == QUEUE_SUSPENDED
def test_review_limits():
d = getEmptyCol()
parent = d.decks.byName("parent", create=True)
child = d.decks.byName("parent::child", create=True)
pconf = d.decks.newConf("parentConf")
cconf = d.decks.newConf("childConf")
pconf['rev']['perDay'] = 5
pconf.update()
parent.setConf(pconf.getId())
cconf['rev']['perDay'] = 10
cconf.update()
child.setConf(cconf.getId())
m = d.models.current()
m['did'] = child.getId()
m.save()
# add some cards
for i in range(20):
f = d.newNote()
f['Front'] = "one"; f['Back'] = "two"
d.addNote(f)
# make them reviews
c = f.cards()[0]
c.queue = c.type = CARD_DUE
c.due = 0
c.flush()
d.reset()
# (('Default', 1, 0, 0, 0, ()), ('parent', 1514457677462, 5, 0, 0, (('child', 1514457677463, 5, 0, 0, ()),)))
d.sched.deckDueTree()
assert parent.count['due']['rev'] == 5 # parent
assert child.count['due']['rev'] == 5 # child
# .counts() should match
child.select()
d.sched.reset()
assert d.sched.counts() == (0, 0, 5)
# answering a card in the child should decrement parent count
c = d.sched.getCard()
d.sched.answerCard(c, 3)
assert d.sched.counts() == (0, 0, 4)
d.sched.deckDueTree()
assert parent.count['due']['rev'] == 4
assert child.count['due']['rev'] == 4
# switch limits
parent.setConf(cconf.getId())
child.setConf(pconf.getId())
parent.select()
d.sched.reset()
# child limits do not affect the parent
d.sched.deckDueTree()
assert child.count['due']['rev'] == 4 # child
assert parent.count['due']['rev'] == 9 # parent
def test_button_spacing():
d = getEmptyCol()
f = d.newNote()
f['Front'] = "one"
d.addNote(f)
# 1 day ivl review card due now
c = f.cards()[0]
c.type = CARD_DUE
c.queue = QUEUE_REV
c.due = d.sched.today
c.reps = 1
c.ivl = 1
c.startTimer()
c.flush()
d.reset()
ni = d.sched.nextIvlStr
assert ni(c, 2) == "2 days"
assert ni(c, 3) == "3 days"
assert ni(c, 4) == "4 days"
# if hard factor is <= 1, then hard may not increase
conf = d.decks.get(1).getConf()
conf['rev']['hardFactor'] = 1
assert ni(c, 2) == "1 day"
def test_overdue_lapse():
# disabled in commit 3069729776990980f34c25be66410e947e9d51a2
return
d = getEmptyCol()
# add a note
f = d.newNote()
f['Front'] = "one"
d.addNote(f)
# simulate a review that was lapsed and is now due for its normal review
c = f.cards()[0]
c.type = CARD_DUE
c.queue = QUEUE_LRN
c.due = -1
c.odue = -1
c.factor = STARTING_FACTOR
c.left = 2002
c.ivl = 0
c.flush()
d.sched._clearOverdue = False
# checkpoint
d.save()
d.sched.reset()
assert d.sched.counts() == (0, 2, 0)
c = d.sched.getCard()
d.sched.answerCard(c, 3)
# it should be due tomorrow
assert c.due == d.sched.today + 1
# revert to before
d.rollback()
d.sched._clearOverdue = True
# with the default settings, the overdue card should be removed from the
# learning queue
d.sched.reset()
assert d.sched.counts() == (0, 0, 1)
def test_finished():
d = getEmptyCol()
# nothing due
assert "Congratulations" in d.sched.finishedMsg()
assert "limit" not in d.sched.finishedMsg()
f = d.newNote()
f['Front'] = "one"; f['Back'] = "two"
d.addNote(f)
# have a new card
assert "new cards available" in d.sched.finishedMsg()
# turn it into a review
d.reset()
c = f.cards()[0]
c.startTimer()
d.sched.answerCard(c, 3)
# nothing should be due tomorrow, as it's due in a week
assert "Congratulations" in d.sched.finishedMsg()
assert "limit" not in d.sched.finishedMsg()
def test_nextIvl():
d = getEmptyCol()
f = d.newNote()
f['Front'] = "one"; f['Back'] = "two"
d.addNote(f)
d.reset()
conf = d.decks.get(1).getConf()
conf['new']['delays'] = [0.5, 3, 10]
conf['lapse']['delays'] = [1, 5, 9]
c = d.sched.getCard()
# new cards
##################################################
ni = d.sched.nextIvl
assert ni(c, 1) == 30
assert ni(c, 2) == (30+180)//2
assert ni(c, 3) == 180
assert ni(c, 4) == 4*86400
d.sched.answerCard(c, 1)
# cards in learning
##################################################
assert ni(c, 1) == 30
assert ni(c, 2) == (30+180)//2
assert ni(c, 3) == 180
assert ni(c, 4) == 4*86400
d.sched.answerCard(c, 3)
assert ni(c, 1) == 30
assert ni(c, 2) == (180+600)//2
assert ni(c, 3) == 600
assert ni(c, 4) == 4*86400
d.sched.answerCard(c, 3)
# normal graduation is tomorrow
assert ni(c, 3) == 1*86400
assert ni(c, 4) == 4*86400
# lapsed cards
##################################################
c.type = CARD_DUE
c.ivl = 100
c.factor = STARTING_FACTOR
assert ni(c, 1) == 60
assert ni(c, 3) == 100*86400
assert ni(c, 4) == 101*86400
# review cards
##################################################
c.queue = QUEUE_REV
c.ivl = 100
c.factor = STARTING_FACTOR
# failing it should put it at 60s
assert ni(c, 1) == 60
# or 1 day if relearn is false
c.currentConf()['lapse']['delays']=[]
assert ni(c, 1) == 1*86400
# (* 100 1.2 86400)10368000.0
assert ni(c, 2) == 10368000
# (* 100 2.5 86400)21600000.0
assert ni(c, 3) == 21600000
# (* 100 2.5 1.3 86400)28080000.0
assert ni(c, 4) == 28080000
assert d.sched.nextIvlStr(c, 4) == "10.8 months"
def test_bury():
d = getEmptyCol()
f = d.newNote()
f['Front'] = "one"
d.addNote(f)
c = f.cards()[0]
f = d.newNote()
f['Front'] = "two"
d.addNote(f)
c2 = f.cards()[0]
# burying
d.sched.buryCards([c.id], manual=True)
c.load()
assert c.queue == QUEUE_USER_BURIED
d.sched.buryCards([c2.id], manual=False)
c2.load()
assert c2.queue == QUEUE_SCHED_BURIED
d.reset()
assert not d.sched.getCard()
d.sched.unburyCardsForDeck(type="manual")
c.load(); assert c.queue == QUEUE_NEW
c2.load(); assert c2.queue == QUEUE_SCHED_BURIED
d.sched.unburyCardsForDeck(type="siblings")
c2.load(); assert c2.queue == QUEUE_NEW
d.sched.buryCards([c.id, c2.id])
d.sched.unburyCardsForDeck(type="all")
d.reset()
assert d.sched.counts() == (2, 0, 0)
def test_suspend():
d = getEmptyCol()
f = d.newNote()
f['Front'] = "one"
d.addNote(f)
c = f.cards()[0]
# suspending
d.reset()
assert d.sched.getCard()
d.sched.suspendCards([c.id])
d.reset()
assert not d.sched.getCard()
# unsuspending
d.sched.unsuspendCards([c.id])
d.reset()
assert d.sched.getCard()
# should cope with rev cards being relearnt
c.due = 0; c.ivl = 100; c.type = CARD_DUE; c.queue = QUEUE_REV; c.flush()
d.reset()
c = d.sched.getCard()
d.sched.answerCard(c, 1)
assert c.due >= time.time()
due = c.due
assert c.queue == QUEUE_LRN
assert c.type == CARD_RELRN
d.sched.suspendCards([c.id])
d.sched.unsuspendCards([c.id])
c.load()
assert c.queue == QUEUE_LRN
assert c.type == CARD_RELRN
assert c.due == due
# should cope with cards in cram decks
c.due = 1
c.flush()
d.decks.newDyn("tmp")
d.decks.current().rebuildDyn()
c.load()
assert c.due != 1
assert c.did != 1
d.sched.suspendCards([c.id])
c.load()
assert c.due != 1
assert c.did != 1
assert c.odue == 1
def test_filt_reviewing_early_normal():
d = getEmptyCol()
f = d.newNote()
f['Front'] = "one"
d.addNote(f)
c = f.cards()[0]
c.ivl = 100
c.type = c.queue = QUEUE_REV
# due in 25 days, so it's been waiting 75 days
c.due = d.sched.today + 25
c.mod = 1
c.factor = STARTING_FACTOR
c.startTimer()
c.flush()
d.reset()
assert d.sched.counts() == (0,0,0)
# create a dynamic deck and refresh it
deck = d.decks.newDyn("Cram")
did = deck.getId()
deck.rebuildDyn()
d.reset()
# should appear as normal in the deck list
d.sched.deckDueTree()
assert d.decks.all(sort=True)[0].count['singleDue']['rev'] == 1
# and should appear in the counts
assert d.sched.counts() == (0,0,1)
# grab it and check estimates
c = d.sched.getCard()
assert d.sched.answerButtons(c) == 4
assert d.sched._lapseConf(c)['delays'][0] == 10
assert d.sched.nextIvl(c, 1) == 600
assert d.sched.nextIvl(c, 2) == int(75*1.2)*86400
assert d.sched.nextIvl(c, 3) == int(75*2.5)*86400
assert d.sched.nextIvl(c, 4) == int(75*2.5*1.15)*86400
# answer 'good'
d.sched.answerCard(c, 3)
checkRevIvl(d, c, 90)
assert c.due == d.sched.today + c.ivl
assert not c.odue
# should not be in learning
assert c.queue == QUEUE_REV
# should be logged as a cram rep
assert d.db.scalar(
"select type from revlog order by id desc limit 1") == 3
# due in 75 days, so it's been waiting 25 days
c.ivl = 100
c.due = d.sched.today + 75
c.flush()
deck.rebuildDyn()
d.reset()
c = d.sched.getCard()
assert d.sched.nextIvl(c, 2) == 60*86400
assert d.sched.nextIvl(c, 3) == 100*86400
assert d.sched.nextIvl(c, 4) == 114*86400
def test_filt_keep_lrn_state():
d = getEmptyCol()
f = d.newNote()
f['Front'] = "one"
d.addNote(f)
# fail the card outside filtered deck
c = d.sched.getCard()
c.currentConf()['new']['delays'] = [1, 10, 61]
d.decks.save()
d.sched.answerCard(c, 1)
assert c.type == CARD_LRN
assert c.queue == QUEUE_LRN
assert c.left == 3003
d.sched.answerCard(c, 3)
assert c.type == CARD_LRN
assert c.queue == QUEUE_LRN
# create a dynamic deck and refresh it
deck = d.decks.newDyn("Cram")
did = deck.getId()
deck.rebuildDyn()
d.reset()
# card should still be in learning state
c.load()
assert c.type == CARD_LRN
assert c.queue == QUEUE_LRN
assert c.left == 2002
# should be able to advance learning steps
d.sched.answerCard(c, 3)
# should be due at least an hour in the future
assert c.due - intTime() > 60*60
# emptying the deck preserves learning state
d.sched.emptyDyn(deck)
c.load()
assert c.type == CARD_LRN
assert c.queue == QUEUE_LRN
assert c.left == 1001
assert c.due - intTime() > 60*60
def test_preview():
# add cards
d = getEmptyCol()
f = d.newNote()
f['Front'] = "one"
d.addNote(f)
c = f.cards()[0]
orig = copy.copy(c)
f2 = d.newNote()
f2['Front'] = "two"
d.addNote(f2)
# cram deck
deck = d.decks.newDyn("Cram")
did = deck.getId()
cram = d.decks.get(did)
cram['resched'] = False
deck.rebuildDyn()
d.reset()
# grab the first card
c = d.sched.getCard()
assert d.sched.answerButtons(c) == 2
assert d.sched.nextIvl(c, 1) == 600
assert d.sched.nextIvl(c, 2) == 0
# failing it will push its due time back
due = c.due
d.sched.answerCard(c, 1)
assert c.due != due
# the other card should come next
c2 = d.sched.getCard()
assert c2.id != c.id
# passing it will remove it
d.sched.answerCard(c2, 2)
assert c2.queue == QUEUE_NEW
assert c2.reps == 0
assert c2.type == 0
# the other card should appear again
c = d.sched.getCard()
assert c.id == orig.id
# emptying the filtered deck should restore card
d.sched.emptyDyn(deck)
c.load()
assert c.queue == QUEUE_NEW
assert c.reps == 0
assert c.type == 0
def test_ordcycle():
d = getEmptyCol()
# add two more templates and set second active
m = d.models.current(); mm = d.models
t = m.newTemplate("Reverse",
"{{Back}}",
"{{Front}}")
t = m.newTemplate("f2",
"{{Front}}",
"{{Back}}")
m.save()
# create a new note; it should have 3 cards
f = d.newNote()
f['Front'] = "1"; f['Back'] = "1"
d.addNote(f)
assert d.cardCount() == 3
d.reset()
# ordinals should arrive in order
assert d.sched.getCard().ord == 0
assert d.sched.getCard().ord == 1
assert d.sched.getCard().ord == 2
def test_counts_idx():
d = getEmptyCol()
f = d.newNote()
f['Front'] = "one"; f['Back'] = "two"
d.addNote(f)
d.reset()
assert d.sched.counts() == (1, 0, 0)
c = d.sched.getCard()
# counter's been decremented but idx indicates 1
assert d.sched.counts() == (0, 0, 0)
assert d.sched.countIdx(c) == 0
# answer to move to learn queue
d.sched.answerCard(c, 1)
assert d.sched.counts() == (0, 1, 0)
# fetching again will decrement the count
c = d.sched.getCard()
assert d.sched.counts() == (0, 0, 0)
assert d.sched.countIdx(c) == 1
# answering should add it back again
d.sched.answerCard(c, 1)
assert d.sched.counts() == (0, 1, 0)
def test_repCounts():
d = getEmptyCol()
f = d.newNote()
f['Front'] = "one"
d.addNote(f)
d.reset()
# lrnReps should be accurate on pass/fail
assert d.sched.counts() == (1, 0, 0)
d.sched.answerCard(d.sched.getCard(), 1)
assert d.sched.counts() == (0, 1, 0)
d.sched.answerCard(d.sched.getCard(), 1)
assert d.sched.counts() == (0, 1, 0)
d.sched.answerCard(d.sched.getCard(), 3)
assert d.sched.counts() == (0, 1, 0)
d.sched.answerCard(d.sched.getCard(), 1)
assert d.sched.counts() == (0, 1, 0)
d.sched.answerCard(d.sched.getCard(), 3)
assert d.sched.counts() == (0, 1, 0)
d.sched.answerCard(d.sched.getCard(), 3)
assert d.sched.counts() == (0, 0, 0)
f = d.newNote()
f['Front'] = "two"
d.addNote(f)
d.reset()
# initial pass should be correct too
d.sched.answerCard(d.sched.getCard(), 3)
assert d.sched.counts() == (0, 1, 0)
d.sched.answerCard(d.sched.getCard(), 1)
assert d.sched.counts() == (0, 1, 0)
d.sched.answerCard(d.sched.getCard(), 4)
assert d.sched.counts() == (0, 0, 0)
# immediate graduate should work
f = d.newNote()
f['Front'] = "three"
d.addNote(f)
d.reset()
d.sched.answerCard(d.sched.getCard(), 4)
assert d.sched.counts() == (0, 0, 0)
# and failing a review should too
f = d.newNote()
f['Front'] = "three"
d.addNote(f)
c = f.cards()[0]
c.type = CARD_DUE
c.queue = QUEUE_REV
c.due = d.sched.today
c.flush()
d.reset()
assert d.sched.counts() == (0, 0, 1)
d.sched.answerCard(d.sched.getCard(), 1)
assert d.sched.counts() == (0, 1, 0)
def test_timing():
d = getEmptyCol()
# add a few review cards, due today
for i in range(5):
f = d.newNote()
f['Front'] = "num"+str(i)
d.addNote(f)
c = f.cards()[0]
c.type = CARD_DUE
c.queue = QUEUE_REV
c.due = 0
c.flush()
# fail the first one
d.reset()
c = d.sched.getCard()
d.sched.answerCard(c, 1)
# the next card should be another review
c2 = d.sched.getCard()
assert c2.queue == QUEUE_REV
# if the failed card becomes due, it should show first
c.due = time.time() - 1
c.flush()
d.reset()
c = d.sched.getCard()
assert c.queue == QUEUE_LRN
def test_collapse():
d = getEmptyCol()
# add a note
f = d.newNote()
f['Front'] = "one"
d.addNote(f)
d.reset()
# test collapsing
c = d.sched.getCard()
d.sched.answerCard(c, 1)
c = d.sched.getCard()
d.sched.answerCard(c, 4)
assert not d.sched.getCard()
def test_deckDue():
d = getEmptyCol()
# add a note with default deck
f = d.newNote()
f['Front'] = "one"
d.addNote(f)
# and one that's a child
f = d.newNote()
f['Front'] = "two"
default1 = f.model()['did'] = d.decks.id("Default::1")
d.addNote(f)
# make it a review card
c = f.cards()[0]
c.queue = QUEUE_REV
c.due = 0
c.flush()
# add one more with a new deck
f = d.newNote()
f['Front'] = "two"
foobar = f.model()['did'] = d.decks.id("foo::bar")
d.addNote(f)
# and one that's a sibling
f = d.newNote()
f['Front'] = "three"
foobaz = f.model()['did'] = d.decks.id("foo::baz")
d.addNote(f)
d.reset()
assert len(d.decks.all()) == 5
d.sched.deckDueTree()
cnts = d.decks.all(sort=True)
def l(deck):
return [deck.getPath(), deck.getId(), deck.count['singleDue']['rev'], deck.count['singleDue']['lrn'], deck.count['singleDue']['new']]
assert l(cnts[0]) == [["Default"], 1, 1, 0, 1]
assert l(cnts[1]) == [["Default", "1"], default1, 1, 0, 0]
assert l(cnts[2]) == [["foo"], d.decks.id("foo"), 0, 0, 0]
assert l(cnts[3]) == [["foo", "bar"], foobar, 0, 0, 1]
assert l(cnts[4]) == [["foo", "baz"], foobaz, 0, 0, 1]
d.sched.deckDueTree()
tree = d.decks.all(sort=True)
assert tree[0].getBaseName() == "Default"
# sum of child and parent
assert tree[0].getId() == 1
assert tree[0].count['due']['rev'] == 1
assert tree[0].count['due']['new'] == 1
# child count is just review
assert tree[0].getChildren()[0].getBaseName() == "1"
assert tree[0].getChildren()[0].getId() == default1
assert tree[0].getChildren()[0].count['due']['rev'] == 1
assert tree[0].getChildren()[0].count['due']['new'] == 0
# code should not fail if a card has an invalid deck
c.did = 12345; c.flush()
def test_deckTree():
d = getEmptyCol()
d.decks.id("new::b::c")
d.decks.id("new2")
# new should not appear twice in tree
names = d.decks.allNames()
names.remove("new")