sup

supermemo2

Implement the supermemo 2 algorithm.

Showing:

Popularity

Downloads/wk

0

GitHub Stars

71

Maintenance

Last Commit

5mos ago

Contributors

2

Package

Dependencies

0

Size (min+gzip)

0.3KB

License

MIT

Type Definitions

Tree-Shakeable

No?

Categories

Readme

Implement the SuperMemo 2 algorithm.

Check this article for detail: https://www.supermemo.com/english/ol/sm2.htm

Usage

import supermemo2 from 'supermemo2'

let quality // A number between 0 and 5 that indicate the quality of review. 0 is the worse while 5 is the best.
let lastSchedule // The duration of last review space.
let lastFactor // The factor that was used to caculate last schedule.
let ret = supermemo2(quality, lastSchedule, lastFactor)

The output will be:

{
    schedule: Number, // The next review space.
    factor: Number, // The factor that should be use in the next round of caculation.
    isRepeatAgain: Boolean // If is true, should review the item again until the quality is not less than 4.
}

Rate & Review

Great Documentation0
Easy to Use0
Performant0
Highly Customizable0
Bleeding Edge0
Responsive Maintainers0
Poor Documentation0
Hard to Use0
Slow0
Buggy0
Abandoned0
Unwelcoming Community0
100
No reviews found
Be the first to rate

Alternatives

No alternatives found

Tutorials

No tutorials found
Add a tutorial