Skip to content

Commit 9015440

Browse files
WikiRikWikiRik
authored
meta: pin devDeps and update to latest minor version (#1)
* meta: pin devDeps and build package * meta: update deps to latest minor version
1 parent 520b06b commit 9015440

File tree

4 files changed

+688
-987
lines changed

4 files changed

+688
-987
lines changed

‎build/toposort.js‎

Lines changed: 60 additions & 95 deletions
Original file line numberDiff line numberDiff line change
@@ -1,51 +1,47 @@
11
/****
22
* The MIT License (MIT)
3-
*
3+
*
44
* Copyright (c) 2015 Gustavo Henke and Aaron Trent
5-
*
5+
*
66
* Permission is hereby granted, free of charge, to any person obtaining a copy
77
* of this software and associated documentation files (the "Software"), to deal
88
* in the Software without restriction, including without limitation the rights
99
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
1010
* copies of the Software, and to permit persons to whom the Software is
1111
* furnished to do so, subject to the following conditions:
12-
*
12+
*
1313
* The above copyright notice and this permission notice shall be included in all
1414
* copies or substantial portions of the Software.
15-
*
15+
*
1616
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
1717
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
1818
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
1919
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
2020
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
2121
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
2222
* SOFTWARE.
23-
*
23+
*
2424
****/
25-
(function( global, factory ) {
26-
if( typeof define === "function" && define.amd ) {
27-
define( "Toposort", ["exports", "module"], factory );
28-
} else if( typeof exports !== "undefined" && typeof module !== "undefined" ) {
29-
factory( exports, module );
25+
(function (global, factory) {
26+
if (typeof define === "function" && define.amd) {
27+
define("Toposort", ["exports", "module"], factory);
28+
} else if (typeof exports !== "undefined" && typeof module !== "undefined") {
29+
factory(exports, module);
3030
} else {
3131
var mod = {
3232
exports: {}
3333
};
34-
factory( mod.exports, mod );
34+
factory(mod.exports, mod);
3535
global.Toposort = mod.exports;
3636
}
37-
})( this, function( exports, module ) {
37+
})(this, function (exports, module) {
3838
"use strict";
3939

40-
function _classCallCheck( instance, Constructor ) {
41-
if( !(instance instanceof Constructor) ) {
42-
throw new TypeError( "Cannot call a class as a function" );
43-
}
44-
}
40+
function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
4541

46-
var Toposort = (function() {
42+
var Toposort = (function () {
4743
function Toposort() {
48-
_classCallCheck( this, Toposort );
44+
_classCallCheck(this, Toposort);
4945

5046
this.edges = [];
5147
this.Toposort = Toposort;
@@ -60,42 +56,36 @@
6056
* @returns {Toposort} The Toposort instance
6157
*/
6258

63-
Toposort.prototype.add = function add( item, deps ) {
64-
if( typeof item !== "string" || !item ) {
65-
throw new TypeError( "Dependent name must be given as a not empty string" );
59+
Toposort.prototype.add = function add(item, deps) {
60+
if (typeof item !== "string" || !item) {
61+
throw new TypeError("Dependent name must be given as a not empty string");
6662
}
6763

68-
deps = Array.isArray( deps ) ? deps : [deps];
64+
deps = Array.isArray(deps) ? deps : [deps];
6965

70-
if( deps.length > 0 ) {
71-
for( var _iterator = deps, _isArray = Array.isArray( _iterator ), _i = 0, _iterator = _isArray ?
72-
_iterator :
73-
_iterator[Symbol.iterator](); ; ) {
66+
if (deps.length > 0) {
67+
for (var _iterator = deps, _isArray = Array.isArray(_iterator), _i = 0, _iterator = _isArray ? _iterator : _iterator[Symbol.iterator]();;) {
7468
var _ref;
7569

76-
if( _isArray ) {
77-
if( _i >= _iterator.length ) {
78-
break;
79-
}
70+
if (_isArray) {
71+
if (_i >= _iterator.length) break;
8072
_ref = _iterator[_i++];
8173
} else {
8274
_i = _iterator.next();
83-
if( _i.done ) {
84-
break;
85-
}
75+
if (_i.done) break;
8676
_ref = _i.value;
8777
}
8878

8979
var dep = _ref;
9080

91-
if( typeof dep !== "string" || !dep ) {
92-
throw new TypeError( "Dependency name must be given as a not empty string" );
81+
if (typeof dep !== "string" || !dep) {
82+
throw new TypeError("Dependency name must be given as a not empty string");
9383
}
9484

95-
this.edges.push( [item, dep] );
85+
this.edges.push([item, dep]);
9686
}
9787
} else {
98-
this.edges.push( [item] );
88+
this.edges.push([item]);
9989
}
10090

10191
return this;
@@ -114,48 +104,36 @@
114104
var nodes = [];
115105

116106
//accumulate unique nodes into a large list
117-
for( var _iterator2 = this.edges, _isArray2 = Array.isArray( _iterator2 ), _i2 = 0, _iterator2 = _isArray2 ?
118-
_iterator2 :
119-
_iterator2[Symbol.iterator](); ; ) {
107+
for (var _iterator2 = this.edges, _isArray2 = Array.isArray(_iterator2), _i2 = 0, _iterator2 = _isArray2 ? _iterator2 : _iterator2[Symbol.iterator]();;) {
120108
var _ref2;
121109

122-
if( _isArray2 ) {
123-
if( _i2 >= _iterator2.length ) {
124-
break;
125-
}
110+
if (_isArray2) {
111+
if (_i2 >= _iterator2.length) break;
126112
_ref2 = _iterator2[_i2++];
127113
} else {
128114
_i2 = _iterator2.next();
129-
if( _i2.done ) {
130-
break;
131-
}
115+
if (_i2.done) break;
132116
_ref2 = _i2.value;
133117
}
134118

135119
var edge = _ref2;
136120

137-
for( var _iterator3 = edge, _isArray3 = Array.isArray( _iterator3 ), _i3 = 0, _iterator3 = _isArray3 ?
138-
_iterator3 :
139-
_iterator3[Symbol.iterator](); ; ) {
121+
for (var _iterator3 = edge, _isArray3 = Array.isArray(_iterator3), _i3 = 0, _iterator3 = _isArray3 ? _iterator3 : _iterator3[Symbol.iterator]();;) {
140122
var _ref3;
141123

142-
if( _isArray3 ) {
143-
if( _i3 >= _iterator3.length ) {
144-
break;
145-
}
124+
if (_isArray3) {
125+
if (_i3 >= _iterator3.length) break;
146126
_ref3 = _iterator3[_i3++];
147127
} else {
148128
_i3 = _iterator3.next();
149-
if( _i3.done ) {
150-
break;
151-
}
129+
if (_i3.done) break;
152130
_ref3 = _i3.value;
153131
}
154132

155133
var node = _ref3;
156134

157-
if( nodes.indexOf( node ) === -1 ) {
158-
nodes.push( node );
135+
if (nodes.indexOf(node) === -1) {
136+
nodes.push(node);
159137
}
160138
}
161139
}
@@ -164,52 +142,45 @@
164142
var place = nodes.length;
165143

166144
//initialize the sorted array with the same length as the unique nodes array
167-
var sorted = new Array( nodes.length );
145+
var sorted = new Array(nodes.length);
168146

169147
//define a visitor function that recursively traverses dependencies.
170-
var visit = function visit( node, predecessors ) {
148+
var visit = function visit(node, predecessors) {
171149
//check if a node is dependent of itself
172-
if( predecessors.length !== 0 && predecessors.indexOf( node ) !== -1 ) {
173-
throw new Error( "Cyclic dependency found. " + node + " is dependent of itself.\nDependency chain: "
174-
+ predecessors.join( " -> " ) + " => " + node );
150+
if (predecessors.length !== 0 && predecessors.indexOf(node) !== -1) {
151+
throw new Error("Cyclic dependency found. " + node + " is dependent of itself.\nDependency chain: " + predecessors.join(" -> ") + " => " + node);
175152
}
176153

177-
var index = nodes.indexOf( node );
154+
var index = nodes.indexOf(node);
178155

179156
//if the node still exists, traverse its dependencies
180-
if( index !== -1 ) {
157+
if (index !== -1) {
181158
var copy = false;
182159

183160
//mark the node as false to exclude it from future iterations
184161
nodes[index] = false;
185162

186163
//loop through all edges and follow dependencies of the current node
187-
for( var _iterator4 = _this.edges, _isArray4 = Array.isArray( _iterator4 ), _i4 = 0, _iterator4 = _isArray4 ?
188-
_iterator4 :
189-
_iterator4[Symbol.iterator](); ; ) {
164+
for (var _iterator4 = _this.edges, _isArray4 = Array.isArray(_iterator4), _i4 = 0, _iterator4 = _isArray4 ? _iterator4 : _iterator4[Symbol.iterator]();;) {
190165
var _ref4;
191166

192-
if( _isArray4 ) {
193-
if( _i4 >= _iterator4.length ) {
194-
break;
195-
}
167+
if (_isArray4) {
168+
if (_i4 >= _iterator4.length) break;
196169
_ref4 = _iterator4[_i4++];
197170
} else {
198171
_i4 = _iterator4.next();
199-
if( _i4.done ) {
200-
break;
201-
}
172+
if (_i4.done) break;
202173
_ref4 = _i4.value;
203174
}
204175

205176
var edge = _ref4;
206177

207-
if( edge[0] === node ) {
178+
if (edge[0] === node) {
208179
//lazily create a copy of predecessors with the current node concatenated onto it
209-
copy = copy || predecessors.concat( [node] );
180+
copy = copy || predecessors.concat([node]);
210181

211182
//recurse to node dependencies
212-
visit( edge[1], copy );
183+
visit(edge[1], copy);
213184
}
214185
}
215186

@@ -218,38 +189,32 @@
218189
}
219190
};
220191

221-
for( var i = 0; i < nodes.length; i++ ) {
192+
for (var i = 0; i < nodes.length; i++) {
222193
var node = nodes[i];
223194

224195
//ignore nodes that have been excluded
225-
if( node !== false ) {
196+
if (node !== false) {
226197
//mark the node as false to exclude it from future iterations
227198
nodes[i] = false;
228199

229200
//loop through all edges and follow dependencies of the current node
230-
for( var _iterator5 = this.edges, _isArray5 = Array.isArray( _iterator5 ), _i5 = 0, _iterator5 = _isArray5 ?
231-
_iterator5 :
232-
_iterator5[Symbol.iterator](); ; ) {
201+
for (var _iterator5 = this.edges, _isArray5 = Array.isArray(_iterator5), _i5 = 0, _iterator5 = _isArray5 ? _iterator5 : _iterator5[Symbol.iterator]();;) {
233202
var _ref5;
234203

235-
if( _isArray5 ) {
236-
if( _i5 >= _iterator5.length ) {
237-
break;
238-
}
204+
if (_isArray5) {
205+
if (_i5 >= _iterator5.length) break;
239206
_ref5 = _iterator5[_i5++];
240207
} else {
241208
_i5 = _iterator5.next();
242-
if( _i5.done ) {
243-
break;
244-
}
209+
if (_i5.done) break;
245210
_ref5 = _i5.value;
246211
}
247212

248213
var edge = _ref5;
249214

250-
if( edge[0] === node ) {
215+
if (edge[0] === node) {
251216
//recurse to node dependencies
252-
visit( edge[1], [node] );
217+
visit(edge[1], [node]);
253218
}
254219
}
255220

@@ -278,4 +243,4 @@
278243
})();
279244

280245
module.exports = Toposort;
281-
} );
246+
});

‎build/toposort.min.js‎

Lines changed: 1 addition & 1 deletion
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

0 commit comments

Comments
 (0)