aboutsummaryrefslogtreecommitdiffhomepage
path: root/src/client/utils/shuffle.test.ts
diff options
context:
space:
mode:
authornsfisis <nsfisis@gmail.com>2026-01-03 00:33:56 +0900
committernsfisis <nsfisis@gmail.com>2026-01-03 00:43:17 +0900
commit0d56a04d770c2df492ecf59c941e8d90578b0b60 (patch)
treeea62a0096ef03128be2c4f329eaa2d8592019d32 /src/client/utils/shuffle.test.ts
parent66bfde575d973fea9fb26139af421ab5b18c5bea (diff)
downloadkioku-0d56a04d770c2df492ecf59c941e8d90578b0b60.tar.gz
kioku-0d56a04d770c2df492ecf59c941e8d90578b0b60.tar.zst
kioku-0d56a04d770c2df492ecf59c941e8d90578b0b60.zip
feat(study): shuffle cards when starting study session
Cards are now randomized using Fisher-Yates algorithm to improve learning by preventing users from memorizing card order. 🤖 Generated with [Claude Code](https://claude.com/claude-code) Co-Authored-By: Claude Opus 4.5 <noreply@anthropic.com>
Diffstat (limited to 'src/client/utils/shuffle.test.ts')
-rw-r--r--src/client/utils/shuffle.test.ts54
1 files changed, 54 insertions, 0 deletions
diff --git a/src/client/utils/shuffle.test.ts b/src/client/utils/shuffle.test.ts
new file mode 100644
index 0000000..687aec4
--- /dev/null
+++ b/src/client/utils/shuffle.test.ts
@@ -0,0 +1,54 @@
+import { describe, expect, it } from "vitest";
+import { shuffle } from "./shuffle";
+
+describe("shuffle", () => {
+ it("returns an array of the same length", () => {
+ const input = [1, 2, 3, 4, 5];
+ const result = shuffle(input);
+ expect(result).toHaveLength(input.length);
+ });
+
+ it("contains all original elements", () => {
+ const input = [1, 2, 3, 4, 5];
+ const result = shuffle(input);
+ expect(result.sort()).toEqual(input.sort());
+ });
+
+ it("does not mutate the original array", () => {
+ const input = [1, 2, 3, 4, 5];
+ const original = [...input];
+ shuffle(input);
+ expect(input).toEqual(original);
+ });
+
+ it("returns empty array for empty input", () => {
+ expect(shuffle([])).toEqual([]);
+ });
+
+ it("returns single element array unchanged", () => {
+ expect(shuffle([1])).toEqual([1]);
+ });
+
+ it("works with objects", () => {
+ const input = [{ id: 1 }, { id: 2 }, { id: 3 }];
+ const result = shuffle(input);
+ expect(result).toHaveLength(3);
+ expect(result.map((x) => x.id).sort()).toEqual([1, 2, 3]);
+ });
+
+ it("actually shuffles (statistical test)", () => {
+ const input = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
+ let sameOrderCount = 0;
+ const iterations = 100;
+
+ for (let i = 0; i < iterations; i++) {
+ const result = shuffle(input);
+ if (JSON.stringify(result) === JSON.stringify(input)) {
+ sameOrderCount++;
+ }
+ }
+
+ // Should very rarely keep original order (probability ~1/3628800)
+ expect(sameOrderCount).toBeLessThan(iterations * 0.1);
+ });
+});