From ac6d15648093cf7666ae4e984b1df361c8513db2 Mon Sep 17 00:00:00 2001 From: SiriusStarr <2049163+SiriusStarr@users.noreply.github.com> Date: Wed, 30 Aug 2023 12:15:43 -0700 Subject: [PATCH] =?UTF-8?q?=F0=9F=94=96=20Cut=20`v2.1.0`=20release?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- README.md | 8 ++++---- elm.json | 2 +- 2 files changed, 5 insertions(+), 5 deletions(-) diff --git a/README.md b/README.md index 45bdd66..7072740 100644 --- a/README.md +++ b/README.md @@ -15,7 +15,7 @@ SM-2 scheduling algorithm. If you're **not sure which to use**, the algorithm provided by **`SMTwoAnki`** (which reproduces the scheduling behavior of the popular F/OSS flashcard software Anki) is **most likely the "best" option.** -### Leitner ([`SpacedRepetition.Leitner`](https://package.elm-lang.org/packages/SiriusStarr/elm-spaced-repetition/2.0.1/SpacedRepetition-Leitner)) +### Leitner ([`SpacedRepetition.Leitner`](https://package.elm-lang.org/packages/SiriusStarr/elm-spaced-repetition/2.1.0/SpacedRepetition-Leitner/)) The Leitner system was proposed by Sebastian Leitner in the early 1970s and was originally intended for use with physical (paper) flashcards. For the basics @@ -26,7 +26,7 @@ In general, the Leitner system is much more simple than the other options provided (given that it was meant to be workable by hand) and should generally be considered deprecated in favor of the more advanced SM-2 based algorithms. -### SM-2 ([`SpacedRepetition.SMTwo`](https://package.elm-lang.org/packages/SiriusStarr/elm-spaced-repetition/2.0.1/SpacedRepetition-SMTwo)) +### SM-2 ([`SpacedRepetition.SMTwo`](https://package.elm-lang.org/packages/SiriusStarr/elm-spaced-repetition/2.1.0/SpacedRepetition-SMTwo/)) The SM-2 algorithm was one of the earliest computerized implementations of a spaced repetition algorithm (created in 1988 by Piotr Wozniak) and has been @@ -44,7 +44,7 @@ The SM-2 algorithm is robust, if more rudimentary than Anki's variant. Still, it may be useful for those desiring a simple system without settings that can still adapt to individual card difficulties (unlike the Leitner system). -### SM2+ ([`SpaceRepetition.SMTwoPlus`](https://package.elm-lang.org/packages/SiriusStarr/elm-spaced-repetition/2.0.1/SpacedRepetition-SMTwoPlus)) +### SM2+ ([`SpaceRepetition.SMTwoPlus`](https://package.elm-lang.org/packages/SiriusStarr/elm-spaced-repetition/2.1.0/SpacedRepetition-SMTwoPlus/)) The SM2+ algorithm was proposed by "BlueRaja" as an improvement of the SM-2 algorithm. For details about the SM2+ algorithm and its purported advantages @@ -57,7 +57,7 @@ presented in its reference implementation and its superiority to the SM-2 algorithm is dubious at best. Nevertheless, it is implemented here as it is popular and often-cited online. -### Anki ([`SpaceRepetition.SMTwoAnki`](https://package.elm-lang.org/packages/SiriusStarr/elm-spaced-repetition/2.0.1/SpacedRepetition-SMTwoAnki)) +### Anki ([`SpaceRepetition.SMTwoAnki`](https://package.elm-lang.org/packages/SiriusStarr/elm-spaced-repetition/2.1.0/SpacedRepetition-SMTwoAnki/)) The algorithm used by the popular F/OSS program Anki, this algorithm is a heavily-modified version of the SM-2 algorithm. For details about Anki's diff --git a/elm.json b/elm.json index f48564f..f3abf81 100644 --- a/elm.json +++ b/elm.json @@ -3,7 +3,7 @@ "name": "SiriusStarr/elm-spaced-repetition", "summary": "Create spaced repetition software using several different popular algorithms.", "license": "GPL-3.0", - "version": "2.0.1", + "version": "2.1.0", "exposed-modules": [ "SpacedRepetition.Leitner", "SpacedRepetition.SMTwo",