a/SD

Archived

Very efficient flash cards app using Go and SQLite

This repository has been archived on 2024-01-02. You can view files and clone it, but cannot push or open issues or pull requests.

Go to file

Anthony Wang a6f1a57e0a Seed RNG if not debugging		2022-03-29 07:46:37 -05:00
examples	Run gofumpt on everything	2022-03-28 21:20:38 -05:00
.gitignore	Use allowlist template for Go .gitignore	2022-03-27 17:35:29 -05:00
go.mod	Build segtree from sqlite file	2022-03-28 10:20:00 -05:00
go.sum	Build segtree from sqlite file	2022-03-28 10:20:00 -05:00
LICENSE	Initial commit	2022-03-27 17:18:36 -05:00
README.md	Change billions to millions because sqlite slow :(	2022-03-29 07:44:43 -05:00
sd.go	Seed RNG if not debugging	2022-03-29 07:46:37 -05:00
segmenttree.go	Move segment tree to separate file	2022-03-28 19:00:55 -05:00

README.md

SD

Very efficient flash cards app using Go and SQLite

Usage

Flash cards are stored in the cards table of a SQLite database. There are four columns: idx INTEGER PRIMARY KEY, weight INTEGER, key STRING, val STRING. The idx is a unique index for each card, starting at 0. The weight is how often the card should come up. The key and value are the front and reverse sides of the card. You can use the sqlite3 CLI to create a card deck.

Now build this project with go build and run ./sd to enjoy a fast flash cards experience!

If you're wondering where the name came from, I named this app after a common type of flash card. 😀

Performance

SD is designed to be extremely efficient in order to support a very large number of flash cards and should be able to handle millions of cards with ease. If N is the number of cards, initializing the program requires O(N) time and O(N) memory. Selecting a random card and adjusting its weight based on if the user got it correct requires O(log N) time. Internally SD uses segment trees to achieve this time complexity.

A C port for maximal speed and minimal executable size is planned but will probably never happen.