card in review queue in priority order

[GoogleCodeExporter]

Can we have the card order in the review queue sorted by "relative urgency". It 
was discussed in the following link. I thought that's very good idea.

https://groups.google.com/forum/#!topic/anki-users/lct17xgNjGw

What is the feature you want?

How important is it to you?
I have very irregular schedule. Some days, can have decent amount of time to 
study hundreds of cards. Some days, minimal times. With priority listing of the 
cards, I think it will be more efficient for space repetition in the days when 
there is no way for me to finish my review queue.

Thanls

Do you think other people also want this feature and why?

Original issue reported on code.google.com by Dawnlily...@gmail.com on 17 Sep 2013 at 11:58

[GoogleCodeExporter]

I think it is a good idea to have, especially in Quiz mode.
My question is how to define the relative urgency? Is it user defined or based 
on the history of the card easiness?

Original comment by mrlhwlib...@gmail.com on 18 Sep 2013 at 12:01

[GoogleCodeExporter]

It's discussed in that link. Check from aug31 and later. I think that algorithm 
makes very good sense

Original comment by Dawnlily...@gmail.com on 18 Sep 2013 at 12:59

[GoogleCodeExporter]

I think we can put the idea in this issue instead of referring to the 
discussion.

The idea seems to be the priority is negative related to the previous interval 
of the card. It is a little simplified but reasonable. It doesn't take account 
the easiness of the card and also didn't handle the overdue case. But it would 
be a nice start.

Original comment by mrlhwlib...@gmail.com on 18 Sep 2013 at 1:08

[GoogleCodeExporter]

I think we can implement this way
1. start with calculatio of overdue actor"  (I call this way instead of 
urgency), reversely sort the card
2. for each certain range of overdue factor which you can define(or same 
overdue factor value) ,  sort the card with the most difficult first. 

This way also effectively randomize the review card, which I think is good 
thing. 

Can you implement it soon. 

Original comment by Dawnlily...@gmail.com on 18 Sep 2013 at 1:47

[GoogleCodeExporter]

Many thanks 

Original comment by Dawnlily...@gmail.com on 18 Sep 2013 at 2:07

[GoogleCodeExporter]

Since AnyMemo 10.3 is going to be released soon and considering this could be a 
major change in queuing algorithm and requires extensive testing, I wouldn't 
make it into AnyMemo 10.3. But I would like to try out the idea as soon as I 
can.

Original comment by mrlhwlib...@gmail.com on 18 Sep 2013 at 2:44

• Changed state: Accepted

[GoogleCodeExporter]

Could you review the detail if you can?

Implementation detail:
Method:
    public List<Card> getCardForReview(Category filterCategory, int maxReviewCacheOrdinal, int limit);

Original:
cardQb.orderBy("ordinal", true);

New:
cardQb.orderBy("-interval, easiness, ordinal", true);

Original comment by mrlhwlib...@gmail.com on 18 Sep 2013 at 2:46

[GoogleCodeExporter]

You mean review the coding details? Sorry, I don't know how to read it:-( 

Original comment by Dawnlily...@gmail.com on 18 Sep 2013 at 2:58

[GoogleCodeExporter]

Original comment by mrlhwlib...@gmail.com on 28 Sep 2013 at 6:26

[GoogleCodeExporter]

Implemented in AnyMemo's nightly build. Will be available for the version after 
AnyMemo 10.3 (Should be 10.4 or 11, currently called 10.3.991).

Original comment by mrlhwlib...@gmail.com on 21 Oct 2013 at 4:22

• Changed state: Fixed