mirror of
https://github.com/ankitects/anki.git
synced 2025-09-19 06:22:22 -04:00
b3ee91a9d5
- skip updating buried cards on startup; it's expensive and we'll do that on deck close in the future - add an index for groupId. Initial profiling indicates that groupId-based selective study is considerably faster in certain scenarios The 50k element deck I'm testing with now opens and builds the queue in 40ms on a cold cache, of which 34ms is the initial deck startup and 6ms the queue build. Adding back the undo log and backups will of course increase this, but this is a big improvement for checking due times in the deck browser.
35 lines
730 B
Python
35 lines
730 B
Python
# -*- coding: utf-8 -*-
|
|
# Copyright: Damien Elmes <anki@ichi2.net>
|
|
# License: GNU GPL, version 3 or later; http://www.gnu.org/copyleft/gpl.html
|
|
|
|
MATURE_THRESHOLD = 21
|
|
|
|
# whether new cards should be mixed with reviews, or shown first or last
|
|
NEW_CARDS_DISTRIBUTE = 0
|
|
NEW_CARDS_LAST = 1
|
|
NEW_CARDS_FIRST = 2
|
|
|
|
# new card insertion order
|
|
NEW_CARDS_RANDOM = 0
|
|
NEW_CARDS_DUE = 1
|
|
|
|
# sort order for day's new cards
|
|
NEW_TODAY_ORDINAL = 0
|
|
NEW_TODAY_DUE = 1
|
|
|
|
# review card sort order
|
|
REV_CARDS_OLD_FIRST = 0
|
|
REV_CARDS_NEW_FIRST = 1
|
|
REV_CARDS_RANDOM = 2
|
|
|
|
# searching
|
|
SEARCH_TAG = 0
|
|
SEARCH_TYPE = 1
|
|
SEARCH_PHRASE = 2
|
|
SEARCH_FID = 3
|
|
SEARCH_CARD = 4
|
|
SEARCH_DISTINCT = 5
|
|
SEARCH_FIELD = 6
|
|
SEARCH_FIELD_EXISTS = 7
|
|
SEARCH_QA = 8
|
|
SEARCH_PHRASE_WB = 9
|