1 | 'use strict';
|
2 |
|
3 |
|
4 |
|
5 |
|
6 |
|
7 |
|
8 |
|
9 |
|
10 |
|
11 |
|
12 |
|
13 |
|
14 |
|
15 | const path = require('path');
|
16 | const fs = require('fs');
|
17 | const isArraySorted = require('is-array-sorted');
|
18 | const Runner = require('../lib/runner');
|
19 |
|
20 | const arrayHas = parts => part => parts.indexOf(part) !== -1;
|
21 |
|
22 | const base = fs.readFileSync(path.join(__dirname, 'base.d.ts'), 'utf8');
|
23 |
|
24 |
|
25 | const allParts = Object.keys(new Runner({}).chain).filter(name => name !== 'test');
|
26 |
|
27 |
|
28 |
|
29 | const output = base + generatePrefixed([]);
|
30 |
|
31 | fs.writeFileSync(path.join(__dirname, 'generated.d.ts'), output);
|
32 |
|
33 |
|
34 |
|
35 | function generatePrefixed(prefix) {
|
36 | let output = '';
|
37 | let children = '';
|
38 |
|
39 | for (const part of allParts) {
|
40 | const parts = prefix.concat([part]);
|
41 |
|
42 | if (prefix.indexOf(part) !== -1 || !verify(parts, true)) {
|
43 |
|
44 | continue;
|
45 | }
|
46 |
|
47 |
|
48 | if (!isArraySorted(parts)) {
|
49 | if (exists(parts)) {
|
50 | parts.sort();
|
51 |
|
52 | let chain;
|
53 | if (hasChildren(parts)) {
|
54 | chain = parts.join('_') + '<T>';
|
55 | } else {
|
56 |
|
57 |
|
58 | const last = parts.pop();
|
59 | const joined = parts.join('_');
|
60 | chain = `${joined}<T>['${last}']`;
|
61 | }
|
62 |
|
63 | output += `\t${part}: Register_${chain};\n`;
|
64 | }
|
65 |
|
66 | continue;
|
67 | }
|
68 |
|
69 |
|
70 |
|
71 |
|
72 | if (verify(parts, false)) {
|
73 | if (arrayHas(parts)('todo')) {
|
74 |
|
75 | output += `\t${part}: (name: string) => void;\n`;
|
76 | } else {
|
77 | if (arrayHas(parts)('cb')) {
|
78 | output += `\t${part}: CallbackRegisterBase<T>`;
|
79 | } else {
|
80 | output += `\t${part}: RegisterBase<T>`;
|
81 | }
|
82 |
|
83 | if (hasChildren(parts)) {
|
84 |
|
85 | const joined = parts.join('_');
|
86 | output += ` & Register_${joined}<T>`;
|
87 | }
|
88 |
|
89 | output += ';\n';
|
90 | }
|
91 | }
|
92 |
|
93 | children += generatePrefixed(parts);
|
94 | }
|
95 |
|
96 | if (output === '') {
|
97 | return children;
|
98 | }
|
99 |
|
100 | const typeBody = `{\n${output}}\n${children}`;
|
101 |
|
102 | if (prefix.length === 0) {
|
103 |
|
104 | return `export interface Register<T> extends RegisterBase<T> ${typeBody}`;
|
105 | }
|
106 | const namespace = ['Register'].concat(prefix).join('_');
|
107 | return `interface ${namespace}<T> ${typeBody}`;
|
108 | }
|
109 |
|
110 |
|
111 |
|
112 |
|
113 |
|
114 | function verify(parts, asPrefix) {
|
115 | const has = arrayHas(parts);
|
116 |
|
117 | if (has('only') + has('skip') + has('todo') > 1) {
|
118 | return false;
|
119 | }
|
120 |
|
121 | const beforeAfterCount = has('before') + has('beforeEach') + has('after') + has('afterEach');
|
122 |
|
123 | if (beforeAfterCount > 1) {
|
124 | return false;
|
125 | }
|
126 |
|
127 | if (beforeAfterCount === 1) {
|
128 | if (has('only')) {
|
129 | return false;
|
130 | }
|
131 | }
|
132 |
|
133 | if (has('always')) {
|
134 |
|
135 |
|
136 | if (has('after') || has('afterEach')) {
|
137 | return true;
|
138 | }
|
139 |
|
140 | if (!verify(parts.concat(['after']), false) && !verify(parts.concat(['afterEach']), false)) {
|
141 |
|
142 |
|
143 | return false;
|
144 | }
|
145 |
|
146 |
|
147 | return asPrefix;
|
148 | }
|
149 |
|
150 | return true;
|
151 | }
|
152 |
|
153 |
|
154 | function hasChildren(parts) {
|
155 |
|
156 | const validChildren = allParts
|
157 | .filter(newPart => parts.indexOf(newPart) === -1)
|
158 | .map(newPart => parts.concat([newPart]))
|
159 | .filter(longer => verify(longer, false));
|
160 |
|
161 | return validChildren.length > 0;
|
162 | }
|
163 |
|
164 |
|
165 | function exists(parts) {
|
166 | if (verify(parts, false)) {
|
167 |
|
168 | return true;
|
169 | }
|
170 |
|
171 | if (!verify(parts, true)) {
|
172 |
|
173 | return false;
|
174 | }
|
175 |
|
176 |
|
177 | for (const prefix of allParts) {
|
178 | if (parts.indexOf(prefix) === -1 && exists(parts.concat([prefix]))) {
|
179 | return true;
|
180 | }
|
181 | }
|
182 |
|
183 | return false;
|
184 | }
|