Skip to content

Commit f93d706

Browse files
❌ test: Write failing tests for API.
1 parent 1a909aa commit f93d706

File tree

3 files changed

+34
-2
lines changed

3 files changed

+34
-2
lines changed

package.json

+1
Original file line numberDiff line numberDiff line change
@@ -54,6 +54,7 @@
5454
},
5555
"dependencies": {},
5656
"devDependencies": {
57+
"@aureooms/js-compare": "^1.4.8",
5758
"@babel/cli": "7.13.10",
5859
"@babel/core": "7.13.10",
5960
"@babel/preset-env": "7.13.10",

test/src/api.js

+28-2
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,31 @@
11
import test from 'ava';
22

3-
test('API', (t) => {
4-
t.fail();
3+
import {increasing, decreasing} from '@aureooms/js-compare';
4+
import {sorted} from '../../src/index.js';
5+
6+
// https://en.wikipedia.org/wiki/Topological_sorting
7+
const wikipediaGraph = [
8+
[3, 8],
9+
[3, 10],
10+
[5, 11],
11+
[7, 11],
12+
[7, 8],
13+
[8, 9],
14+
[11, 2],
15+
[11, 9],
16+
[11, 10],
17+
];
18+
19+
test('smallest-numbered available vertex first', (t) => {
20+
const expected = [3, 5, 7, 8, 11, 2, 9, 10];
21+
const edges = wikipediaGraph.slice();
22+
const result = [...sorted(edges, increasing)];
23+
t.deepEqual(result, expected);
24+
});
25+
26+
test('largest-numbered available vertex first', (t) => {
27+
const expected = [7, 5, 11, 3, 10, 8, 9, 2];
28+
const edges = wikipediaGraph.slice();
29+
const result = [...sorted(edges, decreasing)];
30+
t.deepEqual(result, expected);
531
});

yarn.lock

+5
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,11 @@
22
# yarn lockfile v1
33

44

5+
"@aureooms/js-compare@^1.4.8":
6+
version "1.4.8"
7+
resolved "https://registry.yarnpkg.com/@aureooms/js-compare/-/js-compare-1.4.8.tgz#c6bff1091f4a2e211f449299572d9f195146fc59"
8+
integrity sha512-Z26PU6OmuhS7ZJsELTKImmipF7J+KCOyN70wBhhVIhmqUhXY6C3JpJHAev6wNBkC4ThlQt3zO6p/OmBFIq76Qg==
9+
510
611
version "7.13.10"
712
resolved "https://registry.yarnpkg.com/@babel/cli/-/cli-7.13.10.tgz#3a9254cbe806639c8ca4ebd49ebe54b4267b88c9"

0 commit comments

Comments
 (0)