-
Notifications
You must be signed in to change notification settings - Fork 31
Expand file tree
/
Copy pathunique.test.js
More file actions
55 lines (47 loc) · 1.46 KB
/
unique.test.js
File metadata and controls
55 lines (47 loc) · 1.46 KB
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
// FIXME: npm test /src/utils/unique.test.js
// 어떤 것을 해볼까요?
const unique = (arr, callback, isSorted) => {
const result = arr.reduce((acc, v) => {
return acc.includes(v) ? acc : [...acc, v];
}, []);
return result;
};
describe("unique 테스트", () => {
describe("non-lazy", () => {
it("case: 1, Normal", () => {
const [firstArray, secondArray] = [
[2, 1, 2],
[1, 2, 1],
];
const firstUniqueArray = unique(firstArray);
const secondUniqueArray = unique(secondArray);
expect(firstUniqueArray).toEqual([2, 1]);
expect(secondUniqueArray).toEqual([1, 2]);
});
it("case: 2, Advanced", () => {
const [firstArray, secondArray, thirdArray] = [
[1, 2, 3],
[1, 1, 2, 2, 3],
[1, 2, 3, 3, 3, 3, 3],
];
const firstUniqueArray = unique(firstArray, undefined, true);
const secondUniqueArray = unique(secondArray, undefined, true);
const thirdUniqueArray = unique(thirdArray, undefined, true);
expect(firstUniqueArray).toEqual([1, 2, 3]);
expect(secondUniqueArray).toEqual([1, 2, 3]);
expect(thirdUniqueArray).toEqual([1, 2, 3]);
});
it("case: 3, Advanced", () => {
const objects = [
{ x: 1, y: 2 },
{ x: 2, y: 1 },
{ x: 1, y: 2 },
];
const uniqueObjects = unique(objects);
expect(uniqueObjects).toEqual([
{ x: 1, y: 2 },
{ x: 2, y: 1 },
]);
});
});
});