deno.land / x / solid_signals@solid-signals@1.3.7 / src / signals / composable / createSet / createSet.test.ts

createSet.test.ts
نووسراو ببینە
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
import { createRoot } from "solid-js";import { suite } from "uvu";import * as assert from "uvu/assert";import createHistory from "../createHistory";import createSet from "./createSet";
const test = suite("createSet");
test("Creates set signal", () => { createRoot((dispose) => { const [set, setSet] = createSet();
assert.equal(set(), new Set());
dispose(); });});
test("Creates set signal with initial value", () => { createRoot((dispose) => { { const [set, setSet] = createSet(new Set([0]));
assert.equal(set(), new Set([0])); } { const [set, setSet] = createSet([0]);
assert.equal(set(), new Set([0])); }
dispose(); });});
test("Preserve Solid setter", () => { createRoot((dispose) => { const [set, setSet] = createSet();
setSet(new Set());
assert.equal(set(), new Set());
dispose(); });});
test("add: Inserts a new element with a specified value if not already present", () => { createRoot((dispose) => { const [set, setSet] = createSet<number>();
const res = setSet.add(0); assert.equal(set(), new Set([0])); // Returns new set assert.equal(res, set());
setSet.add(1); assert.equal(set(), new Set([0, 1]));
setSet.add(0); assert.equal(set(), new Set([0, 1]));
dispose(); });});
test("delete: Removes entry from set by key", () => { createRoot((dispose) => { const [set, setSet] = createSet([0, 1]);
// Returns key presence assert.is(setSet.delete(0), true); assert.equal(set(), new Set([1]));
assert.is(setSet.delete(0), false);
assert.is(setSet.delete(-1), false);
assert.is(setSet.delete(1), true); assert.equal(set(), new Set());
dispose(); });});
test("clear: removes all entries from set", () => { createRoot((dispose) => { { const [set, setSet] = createSet();
setSet.clear(); assert.equal(set(), new Set()); } { const [set, setSet] = createSet([1]);
setSet.clear(); assert.equal(set(), new Set()); } { const [set, setSet] = createSet([0, 1]);
setSet.clear(); assert.equal(set(), new Set()); }
dispose(); });});
test("Extends other signals (createHistory)", () => { createRoot((dispose) => { const [set, setSet] = createSet.wrap(createHistory(new Set<number>()));
setSet.add(0); setSet.add(1); setSet.add(2); assert.equal(set(), new Set([0, 1, 2])); assert.equal(set.history(), [ new Set(), new Set([0]), new Set([0, 1]), new Set([0, 1, 2]), ]); assert.equal(set.history.forward(), []);
assert.is(setSet.history.back(), true); assert.equal(set(), new Set([0, 1])); assert.equal(set.history(), [new Set(), new Set([0]), new Set([0, 1])]); assert.equal(set.history.forward(), [new Set([0, 1, 2])]);
assert.is(setSet.history.back(), true); assert.is(setSet.history.back(), true); assert.equal(set(), new Set()); assert.equal(set.history(), [new Set()]); assert.equal(set.history.forward(), [ new Set([0]), new Set([0, 1]), new Set([0, 1, 2]), ]);
assert.is(setSet.history.back(), false);
assert.is(setSet.history.forward(), true); assert.equal(set(), new Set([0])); assert.equal(set.history(), [new Set(), new Set([0])]); assert.equal(set.history.forward(), [new Set([0, 1]), new Set([0, 1, 2])]);
assert.is(setSet.history.forward(), true); assert.is(setSet.history.forward(), true); assert.equal(set(), new Set([0, 1, 2])); assert.equal(set.history(), [ new Set(), new Set([0]), new Set([0, 1]), new Set([0, 1, 2]), ]); assert.equal(set.history.forward(), []);
assert.is(setSet.history.forward(), false);
dispose(); });});
test.run();
solid_signals

Version Info

Tagged at
2 years ago