sd

Very efficient flash cards app using Go and SQLite

  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10
  11. 11
  12. 12
  13. 13
  14. 14
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20
  21. 21
  22. 22
  23. 23
  24. 24
  25. 25
  26. 26
  27. 27
  28. 28
  29. 29
  30. 30
  31. 31
  32. 32
  33. 33
  34. 34
  35. 35
  36. 36
  37. 37
  38. 38
  39. 39
  40. 40
  41. 41
  42. 42
  43. 43
  44. 44
  45. 45
  46. 46
  47. 47
  48. 48
  49. 49
  50. 50
  51. 51
  52. 52
  53. 53
  54. 54
  55. 55
  56. 56
  57. 57
  58. 58
  59. 59
  60. 60
  61. 61
  62. 62
  63. 63
  64. 64
  65. 65
  66. 66
  67. 67
  68. 68
  69. 69
  70. 70
  71. 71
  72. 72
  73. 73
  74. 74
  75. 75
  76. 76
  77. 77
  78. 78
  79. 79
  80. 80
  81. 81
  82. 82
  83. 83
  84. 84
  85. 85
  86. 86
  87. 87
  88. 88
  89. 89
  90. 90
  91. 91
  92. 92
  93. 93
  94. 94
  95. 95
  96. 96
  97. 97
  98. 98
  99. 99
  100. 100
  101. 101
  102. 102
  103. 103
  104. 104
  105. 105
  106. 106
  107. 107
  108. 108
  109. 109
  110. 110
  111. 111
  112. 112
  113. 113
package main

import (
	"database/sql"
	"flag"
	"fmt"
	"math/rand"
	"os"
	"os/exec"

	_ "modernc.org/sqlite"
)

var file = flag.String("f", "cards", "cards file")

var sum = 0
var seg = []int{}

func build(a *sql.Rows, l int, r int, n int) {
	if l == r {
		a.Next()
		a.Scan(&seg[n])
		sum += seg[n]
		return
	}
	m := (l + r) >> 1
	build(a, l, m, n<<1)
	build(a, m+1, r, n<<1|1)
	seg[n] = seg[n<<1] + seg[n<<1|1]
}

func update(x int, v int, l int, r int, n int) {
	if l == r {
		seg[n] = v
		return
	}
	m := (l + r) >> 1
	if x <= m {
		update(x, v, l, m, n<<1)
	} else {
		update(x, v, m+1, r, n<<1|1)
	}
	seg[n] = seg[n<<1] + seg[n<<1|1]
}

func query(v int, l int, r int, n int) (int, int) {
	if l == r {
		return seg[n], l
	}
	m := (l + r) >> 1
	if seg[n<<1] < v {
		return query(v, l, m, n<<1)
	} else {
		return query(v-seg[n<<1], m+1, r, n<<1|1)
	}
}

func main() {
	flag.Parse()

	db, err := sql.Open("sqlite", *file)
	if err != nil {
		panic(err)
	}

	// Get number of cards
	var N int
	_ = db.QueryRow("SELECT COUNT(*) FROM cards").Scan(&N)
	seg = make([]int, 4*N)

	// Build segment tree
	rows, err := db.Query("SELECT weight FROM cards")
	if err != nil {
		panic(err)
	}
	build(rows, 0, N-1, 1)

	// https://stackoverflow.com/questions/14094190/function-similar-to-getchar
	// disable input buffering
	exec.Command("stty", "-F", "/dev/tty", "cbreak", "min", "1").Run()
	// do not display entered characters on the screen
	exec.Command("stty", "-F", "/dev/tty", "-echo").Run()
	// restore the echoing state when exiting
	defer exec.Command("stty", "-F", "/dev/tty", "echo").Run()

	for {
		// Choose a random card
		x := rand.Intn(sum)
		fmt.Println(x)
		w, i := query(x, 0, N-1, 1)
		fmt.Println(w)
		fmt.Println(i)

		var key, val string
		db.QueryRow("SELECT * FROM cards WHERE idx=?", i).Scan(&i, &w, &key, &val)
		fmt.Println(key)
		fmt.Println(val)

		var b []byte = make([]byte, 1)
		os.Stdin.Read(b)
		if b[0] == byte('y') {
			w >>= 1
			sum -= w
		} else if b[0] == byte('n') {
			sum += w
			w <<= 1
		} else {
			os.Exit(0)
		}
		update(i, w, 0, N-1, 1)
		db.Query("UPDATE cards SET weight=? WHERE idx=?", w, i)
	}
}