deployable-awscdk-app-ts 0.1.206 → 0.1.208

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (68) hide show
  1. package/.jsii +43 -22
  2. package/.projenrc.ts +3 -0
  3. package/API.md +16 -0
  4. package/lib/index.d.ts +1 -0
  5. package/lib/index.js +18 -2
  6. package/lib/types.d.ts +8 -0
  7. package/lib/types.js +1 -1
  8. package/node_modules/semver/LICENSE +15 -0
  9. package/node_modules/semver/README.md +637 -0
  10. package/node_modules/semver/bin/semver.js +197 -0
  11. package/node_modules/semver/classes/comparator.js +141 -0
  12. package/node_modules/semver/classes/index.js +5 -0
  13. package/node_modules/semver/classes/range.js +539 -0
  14. package/node_modules/semver/classes/semver.js +302 -0
  15. package/node_modules/semver/functions/clean.js +6 -0
  16. package/node_modules/semver/functions/cmp.js +52 -0
  17. package/node_modules/semver/functions/coerce.js +52 -0
  18. package/node_modules/semver/functions/compare-build.js +7 -0
  19. package/node_modules/semver/functions/compare-loose.js +3 -0
  20. package/node_modules/semver/functions/compare.js +5 -0
  21. package/node_modules/semver/functions/diff.js +65 -0
  22. package/node_modules/semver/functions/eq.js +3 -0
  23. package/node_modules/semver/functions/gt.js +3 -0
  24. package/node_modules/semver/functions/gte.js +3 -0
  25. package/node_modules/semver/functions/inc.js +19 -0
  26. package/node_modules/semver/functions/lt.js +3 -0
  27. package/node_modules/semver/functions/lte.js +3 -0
  28. package/node_modules/semver/functions/major.js +3 -0
  29. package/node_modules/semver/functions/minor.js +3 -0
  30. package/node_modules/semver/functions/neq.js +3 -0
  31. package/node_modules/semver/functions/parse.js +16 -0
  32. package/node_modules/semver/functions/patch.js +3 -0
  33. package/node_modules/semver/functions/prerelease.js +6 -0
  34. package/node_modules/semver/functions/rcompare.js +3 -0
  35. package/node_modules/semver/functions/rsort.js +3 -0
  36. package/node_modules/semver/functions/satisfies.js +10 -0
  37. package/node_modules/semver/functions/sort.js +3 -0
  38. package/node_modules/semver/functions/valid.js +6 -0
  39. package/node_modules/semver/index.js +89 -0
  40. package/node_modules/semver/internal/constants.js +35 -0
  41. package/node_modules/semver/internal/debug.js +9 -0
  42. package/node_modules/semver/internal/identifiers.js +23 -0
  43. package/node_modules/semver/internal/parse-options.js +15 -0
  44. package/node_modules/semver/internal/re.js +212 -0
  45. package/node_modules/semver/node_modules/lru-cache/LICENSE +15 -0
  46. package/node_modules/semver/node_modules/lru-cache/README.md +166 -0
  47. package/node_modules/semver/node_modules/lru-cache/index.js +334 -0
  48. package/node_modules/semver/node_modules/lru-cache/package.json +34 -0
  49. package/node_modules/semver/node_modules/yallist/LICENSE +15 -0
  50. package/node_modules/semver/node_modules/yallist/README.md +204 -0
  51. package/node_modules/semver/node_modules/yallist/iterator.js +8 -0
  52. package/node_modules/semver/node_modules/yallist/package.json +29 -0
  53. package/node_modules/semver/node_modules/yallist/yallist.js +426 -0
  54. package/node_modules/semver/package.json +87 -0
  55. package/node_modules/semver/preload.js +2 -0
  56. package/node_modules/semver/range.bnf +16 -0
  57. package/node_modules/semver/ranges/gtr.js +4 -0
  58. package/node_modules/semver/ranges/intersects.js +7 -0
  59. package/node_modules/semver/ranges/ltr.js +4 -0
  60. package/node_modules/semver/ranges/max-satisfying.js +25 -0
  61. package/node_modules/semver/ranges/min-satisfying.js +24 -0
  62. package/node_modules/semver/ranges/min-version.js +61 -0
  63. package/node_modules/semver/ranges/outside.js +80 -0
  64. package/node_modules/semver/ranges/simplify.js +47 -0
  65. package/node_modules/semver/ranges/subset.js +247 -0
  66. package/node_modules/semver/ranges/to-comparators.js +8 -0
  67. package/node_modules/semver/ranges/valid.js +11 -0
  68. package/package.json +7 -3
@@ -0,0 +1,426 @@
1
+ 'use strict'
2
+ module.exports = Yallist
3
+
4
+ Yallist.Node = Node
5
+ Yallist.create = Yallist
6
+
7
+ function Yallist (list) {
8
+ var self = this
9
+ if (!(self instanceof Yallist)) {
10
+ self = new Yallist()
11
+ }
12
+
13
+ self.tail = null
14
+ self.head = null
15
+ self.length = 0
16
+
17
+ if (list && typeof list.forEach === 'function') {
18
+ list.forEach(function (item) {
19
+ self.push(item)
20
+ })
21
+ } else if (arguments.length > 0) {
22
+ for (var i = 0, l = arguments.length; i < l; i++) {
23
+ self.push(arguments[i])
24
+ }
25
+ }
26
+
27
+ return self
28
+ }
29
+
30
+ Yallist.prototype.removeNode = function (node) {
31
+ if (node.list !== this) {
32
+ throw new Error('removing node which does not belong to this list')
33
+ }
34
+
35
+ var next = node.next
36
+ var prev = node.prev
37
+
38
+ if (next) {
39
+ next.prev = prev
40
+ }
41
+
42
+ if (prev) {
43
+ prev.next = next
44
+ }
45
+
46
+ if (node === this.head) {
47
+ this.head = next
48
+ }
49
+ if (node === this.tail) {
50
+ this.tail = prev
51
+ }
52
+
53
+ node.list.length--
54
+ node.next = null
55
+ node.prev = null
56
+ node.list = null
57
+
58
+ return next
59
+ }
60
+
61
+ Yallist.prototype.unshiftNode = function (node) {
62
+ if (node === this.head) {
63
+ return
64
+ }
65
+
66
+ if (node.list) {
67
+ node.list.removeNode(node)
68
+ }
69
+
70
+ var head = this.head
71
+ node.list = this
72
+ node.next = head
73
+ if (head) {
74
+ head.prev = node
75
+ }
76
+
77
+ this.head = node
78
+ if (!this.tail) {
79
+ this.tail = node
80
+ }
81
+ this.length++
82
+ }
83
+
84
+ Yallist.prototype.pushNode = function (node) {
85
+ if (node === this.tail) {
86
+ return
87
+ }
88
+
89
+ if (node.list) {
90
+ node.list.removeNode(node)
91
+ }
92
+
93
+ var tail = this.tail
94
+ node.list = this
95
+ node.prev = tail
96
+ if (tail) {
97
+ tail.next = node
98
+ }
99
+
100
+ this.tail = node
101
+ if (!this.head) {
102
+ this.head = node
103
+ }
104
+ this.length++
105
+ }
106
+
107
+ Yallist.prototype.push = function () {
108
+ for (var i = 0, l = arguments.length; i < l; i++) {
109
+ push(this, arguments[i])
110
+ }
111
+ return this.length
112
+ }
113
+
114
+ Yallist.prototype.unshift = function () {
115
+ for (var i = 0, l = arguments.length; i < l; i++) {
116
+ unshift(this, arguments[i])
117
+ }
118
+ return this.length
119
+ }
120
+
121
+ Yallist.prototype.pop = function () {
122
+ if (!this.tail) {
123
+ return undefined
124
+ }
125
+
126
+ var res = this.tail.value
127
+ this.tail = this.tail.prev
128
+ if (this.tail) {
129
+ this.tail.next = null
130
+ } else {
131
+ this.head = null
132
+ }
133
+ this.length--
134
+ return res
135
+ }
136
+
137
+ Yallist.prototype.shift = function () {
138
+ if (!this.head) {
139
+ return undefined
140
+ }
141
+
142
+ var res = this.head.value
143
+ this.head = this.head.next
144
+ if (this.head) {
145
+ this.head.prev = null
146
+ } else {
147
+ this.tail = null
148
+ }
149
+ this.length--
150
+ return res
151
+ }
152
+
153
+ Yallist.prototype.forEach = function (fn, thisp) {
154
+ thisp = thisp || this
155
+ for (var walker = this.head, i = 0; walker !== null; i++) {
156
+ fn.call(thisp, walker.value, i, this)
157
+ walker = walker.next
158
+ }
159
+ }
160
+
161
+ Yallist.prototype.forEachReverse = function (fn, thisp) {
162
+ thisp = thisp || this
163
+ for (var walker = this.tail, i = this.length - 1; walker !== null; i--) {
164
+ fn.call(thisp, walker.value, i, this)
165
+ walker = walker.prev
166
+ }
167
+ }
168
+
169
+ Yallist.prototype.get = function (n) {
170
+ for (var i = 0, walker = this.head; walker !== null && i < n; i++) {
171
+ // abort out of the list early if we hit a cycle
172
+ walker = walker.next
173
+ }
174
+ if (i === n && walker !== null) {
175
+ return walker.value
176
+ }
177
+ }
178
+
179
+ Yallist.prototype.getReverse = function (n) {
180
+ for (var i = 0, walker = this.tail; walker !== null && i < n; i++) {
181
+ // abort out of the list early if we hit a cycle
182
+ walker = walker.prev
183
+ }
184
+ if (i === n && walker !== null) {
185
+ return walker.value
186
+ }
187
+ }
188
+
189
+ Yallist.prototype.map = function (fn, thisp) {
190
+ thisp = thisp || this
191
+ var res = new Yallist()
192
+ for (var walker = this.head; walker !== null;) {
193
+ res.push(fn.call(thisp, walker.value, this))
194
+ walker = walker.next
195
+ }
196
+ return res
197
+ }
198
+
199
+ Yallist.prototype.mapReverse = function (fn, thisp) {
200
+ thisp = thisp || this
201
+ var res = new Yallist()
202
+ for (var walker = this.tail; walker !== null;) {
203
+ res.push(fn.call(thisp, walker.value, this))
204
+ walker = walker.prev
205
+ }
206
+ return res
207
+ }
208
+
209
+ Yallist.prototype.reduce = function (fn, initial) {
210
+ var acc
211
+ var walker = this.head
212
+ if (arguments.length > 1) {
213
+ acc = initial
214
+ } else if (this.head) {
215
+ walker = this.head.next
216
+ acc = this.head.value
217
+ } else {
218
+ throw new TypeError('Reduce of empty list with no initial value')
219
+ }
220
+
221
+ for (var i = 0; walker !== null; i++) {
222
+ acc = fn(acc, walker.value, i)
223
+ walker = walker.next
224
+ }
225
+
226
+ return acc
227
+ }
228
+
229
+ Yallist.prototype.reduceReverse = function (fn, initial) {
230
+ var acc
231
+ var walker = this.tail
232
+ if (arguments.length > 1) {
233
+ acc = initial
234
+ } else if (this.tail) {
235
+ walker = this.tail.prev
236
+ acc = this.tail.value
237
+ } else {
238
+ throw new TypeError('Reduce of empty list with no initial value')
239
+ }
240
+
241
+ for (var i = this.length - 1; walker !== null; i--) {
242
+ acc = fn(acc, walker.value, i)
243
+ walker = walker.prev
244
+ }
245
+
246
+ return acc
247
+ }
248
+
249
+ Yallist.prototype.toArray = function () {
250
+ var arr = new Array(this.length)
251
+ for (var i = 0, walker = this.head; walker !== null; i++) {
252
+ arr[i] = walker.value
253
+ walker = walker.next
254
+ }
255
+ return arr
256
+ }
257
+
258
+ Yallist.prototype.toArrayReverse = function () {
259
+ var arr = new Array(this.length)
260
+ for (var i = 0, walker = this.tail; walker !== null; i++) {
261
+ arr[i] = walker.value
262
+ walker = walker.prev
263
+ }
264
+ return arr
265
+ }
266
+
267
+ Yallist.prototype.slice = function (from, to) {
268
+ to = to || this.length
269
+ if (to < 0) {
270
+ to += this.length
271
+ }
272
+ from = from || 0
273
+ if (from < 0) {
274
+ from += this.length
275
+ }
276
+ var ret = new Yallist()
277
+ if (to < from || to < 0) {
278
+ return ret
279
+ }
280
+ if (from < 0) {
281
+ from = 0
282
+ }
283
+ if (to > this.length) {
284
+ to = this.length
285
+ }
286
+ for (var i = 0, walker = this.head; walker !== null && i < from; i++) {
287
+ walker = walker.next
288
+ }
289
+ for (; walker !== null && i < to; i++, walker = walker.next) {
290
+ ret.push(walker.value)
291
+ }
292
+ return ret
293
+ }
294
+
295
+ Yallist.prototype.sliceReverse = function (from, to) {
296
+ to = to || this.length
297
+ if (to < 0) {
298
+ to += this.length
299
+ }
300
+ from = from || 0
301
+ if (from < 0) {
302
+ from += this.length
303
+ }
304
+ var ret = new Yallist()
305
+ if (to < from || to < 0) {
306
+ return ret
307
+ }
308
+ if (from < 0) {
309
+ from = 0
310
+ }
311
+ if (to > this.length) {
312
+ to = this.length
313
+ }
314
+ for (var i = this.length, walker = this.tail; walker !== null && i > to; i--) {
315
+ walker = walker.prev
316
+ }
317
+ for (; walker !== null && i > from; i--, walker = walker.prev) {
318
+ ret.push(walker.value)
319
+ }
320
+ return ret
321
+ }
322
+
323
+ Yallist.prototype.splice = function (start, deleteCount, ...nodes) {
324
+ if (start > this.length) {
325
+ start = this.length - 1
326
+ }
327
+ if (start < 0) {
328
+ start = this.length + start;
329
+ }
330
+
331
+ for (var i = 0, walker = this.head; walker !== null && i < start; i++) {
332
+ walker = walker.next
333
+ }
334
+
335
+ var ret = []
336
+ for (var i = 0; walker && i < deleteCount; i++) {
337
+ ret.push(walker.value)
338
+ walker = this.removeNode(walker)
339
+ }
340
+ if (walker === null) {
341
+ walker = this.tail
342
+ }
343
+
344
+ if (walker !== this.head && walker !== this.tail) {
345
+ walker = walker.prev
346
+ }
347
+
348
+ for (var i = 0; i < nodes.length; i++) {
349
+ walker = insert(this, walker, nodes[i])
350
+ }
351
+ return ret;
352
+ }
353
+
354
+ Yallist.prototype.reverse = function () {
355
+ var head = this.head
356
+ var tail = this.tail
357
+ for (var walker = head; walker !== null; walker = walker.prev) {
358
+ var p = walker.prev
359
+ walker.prev = walker.next
360
+ walker.next = p
361
+ }
362
+ this.head = tail
363
+ this.tail = head
364
+ return this
365
+ }
366
+
367
+ function insert (self, node, value) {
368
+ var inserted = node === self.head ?
369
+ new Node(value, null, node, self) :
370
+ new Node(value, node, node.next, self)
371
+
372
+ if (inserted.next === null) {
373
+ self.tail = inserted
374
+ }
375
+ if (inserted.prev === null) {
376
+ self.head = inserted
377
+ }
378
+
379
+ self.length++
380
+
381
+ return inserted
382
+ }
383
+
384
+ function push (self, item) {
385
+ self.tail = new Node(item, self.tail, null, self)
386
+ if (!self.head) {
387
+ self.head = self.tail
388
+ }
389
+ self.length++
390
+ }
391
+
392
+ function unshift (self, item) {
393
+ self.head = new Node(item, null, self.head, self)
394
+ if (!self.tail) {
395
+ self.tail = self.head
396
+ }
397
+ self.length++
398
+ }
399
+
400
+ function Node (value, prev, next, list) {
401
+ if (!(this instanceof Node)) {
402
+ return new Node(value, prev, next, list)
403
+ }
404
+
405
+ this.list = list
406
+ this.value = value
407
+
408
+ if (prev) {
409
+ prev.next = this
410
+ this.prev = prev
411
+ } else {
412
+ this.prev = null
413
+ }
414
+
415
+ if (next) {
416
+ next.prev = this
417
+ this.next = next
418
+ } else {
419
+ this.next = null
420
+ }
421
+ }
422
+
423
+ try {
424
+ // add if support for Symbol.iterator is present
425
+ require('./iterator.js')(Yallist)
426
+ } catch (er) {}
@@ -0,0 +1,87 @@
1
+ {
2
+ "name": "semver",
3
+ "version": "7.5.4",
4
+ "description": "The semantic version parser used by npm.",
5
+ "main": "index.js",
6
+ "scripts": {
7
+ "test": "tap",
8
+ "snap": "tap",
9
+ "lint": "eslint \"**/*.js\"",
10
+ "postlint": "template-oss-check",
11
+ "lintfix": "npm run lint -- --fix",
12
+ "posttest": "npm run lint",
13
+ "template-oss-apply": "template-oss-apply --force"
14
+ },
15
+ "devDependencies": {
16
+ "@npmcli/eslint-config": "^4.0.0",
17
+ "@npmcli/template-oss": "4.17.0",
18
+ "tap": "^16.0.0"
19
+ },
20
+ "license": "ISC",
21
+ "repository": {
22
+ "type": "git",
23
+ "url": "https://github.com/npm/node-semver.git"
24
+ },
25
+ "bin": {
26
+ "semver": "bin/semver.js"
27
+ },
28
+ "files": [
29
+ "bin/",
30
+ "lib/",
31
+ "classes/",
32
+ "functions/",
33
+ "internal/",
34
+ "ranges/",
35
+ "index.js",
36
+ "preload.js",
37
+ "range.bnf"
38
+ ],
39
+ "tap": {
40
+ "timeout": 30,
41
+ "coverage-map": "map.js",
42
+ "nyc-arg": [
43
+ "--exclude",
44
+ "tap-snapshots/**"
45
+ ]
46
+ },
47
+ "engines": {
48
+ "node": ">=10"
49
+ },
50
+ "dependencies": {
51
+ "lru-cache": "^6.0.0"
52
+ },
53
+ "author": "GitHub Inc.",
54
+ "templateOSS": {
55
+ "//@npmcli/template-oss": "This file is partially managed by @npmcli/template-oss. Edits may be overwritten.",
56
+ "version": "4.17.0",
57
+ "engines": ">=10",
58
+ "ciVersions": [
59
+ "10.0.0",
60
+ "10.x",
61
+ "12.x",
62
+ "14.x",
63
+ "16.x",
64
+ "18.x"
65
+ ],
66
+ "npmSpec": "8",
67
+ "distPaths": [
68
+ "classes/",
69
+ "functions/",
70
+ "internal/",
71
+ "ranges/",
72
+ "index.js",
73
+ "preload.js",
74
+ "range.bnf"
75
+ ],
76
+ "allowPaths": [
77
+ "/classes/",
78
+ "/functions/",
79
+ "/internal/",
80
+ "/ranges/",
81
+ "/index.js",
82
+ "/preload.js",
83
+ "/range.bnf"
84
+ ],
85
+ "publish": "true"
86
+ }
87
+ }
@@ -0,0 +1,2 @@
1
+ // XXX remove in v8 or beyond
2
+ module.exports = require('./index.js')
@@ -0,0 +1,16 @@
1
+ range-set ::= range ( logical-or range ) *
2
+ logical-or ::= ( ' ' ) * '||' ( ' ' ) *
3
+ range ::= hyphen | simple ( ' ' simple ) * | ''
4
+ hyphen ::= partial ' - ' partial
5
+ simple ::= primitive | partial | tilde | caret
6
+ primitive ::= ( '<' | '>' | '>=' | '<=' | '=' ) partial
7
+ partial ::= xr ( '.' xr ( '.' xr qualifier ? )? )?
8
+ xr ::= 'x' | 'X' | '*' | nr
9
+ nr ::= '0' | [1-9] ( [0-9] ) *
10
+ tilde ::= '~' partial
11
+ caret ::= '^' partial
12
+ qualifier ::= ( '-' pre )? ( '+' build )?
13
+ pre ::= parts
14
+ build ::= parts
15
+ parts ::= part ( '.' part ) *
16
+ part ::= nr | [-0-9A-Za-z]+
@@ -0,0 +1,4 @@
1
+ // Determine if version is greater than all the versions possible in the range.
2
+ const outside = require('./outside')
3
+ const gtr = (version, range, options) => outside(version, range, '>', options)
4
+ module.exports = gtr
@@ -0,0 +1,7 @@
1
+ const Range = require('../classes/range')
2
+ const intersects = (r1, r2, options) => {
3
+ r1 = new Range(r1, options)
4
+ r2 = new Range(r2, options)
5
+ return r1.intersects(r2, options)
6
+ }
7
+ module.exports = intersects
@@ -0,0 +1,4 @@
1
+ const outside = require('./outside')
2
+ // Determine if version is less than all the versions possible in the range
3
+ const ltr = (version, range, options) => outside(version, range, '<', options)
4
+ module.exports = ltr
@@ -0,0 +1,25 @@
1
+ const SemVer = require('../classes/semver')
2
+ const Range = require('../classes/range')
3
+
4
+ const maxSatisfying = (versions, range, options) => {
5
+ let max = null
6
+ let maxSV = null
7
+ let rangeObj = null
8
+ try {
9
+ rangeObj = new Range(range, options)
10
+ } catch (er) {
11
+ return null
12
+ }
13
+ versions.forEach((v) => {
14
+ if (rangeObj.test(v)) {
15
+ // satisfies(v, range, options)
16
+ if (!max || maxSV.compare(v) === -1) {
17
+ // compare(max, v, true)
18
+ max = v
19
+ maxSV = new SemVer(max, options)
20
+ }
21
+ }
22
+ })
23
+ return max
24
+ }
25
+ module.exports = maxSatisfying
@@ -0,0 +1,24 @@
1
+ const SemVer = require('../classes/semver')
2
+ const Range = require('../classes/range')
3
+ const minSatisfying = (versions, range, options) => {
4
+ let min = null
5
+ let minSV = null
6
+ let rangeObj = null
7
+ try {
8
+ rangeObj = new Range(range, options)
9
+ } catch (er) {
10
+ return null
11
+ }
12
+ versions.forEach((v) => {
13
+ if (rangeObj.test(v)) {
14
+ // satisfies(v, range, options)
15
+ if (!min || minSV.compare(v) === 1) {
16
+ // compare(min, v, true)
17
+ min = v
18
+ minSV = new SemVer(min, options)
19
+ }
20
+ }
21
+ })
22
+ return min
23
+ }
24
+ module.exports = minSatisfying
@@ -0,0 +1,61 @@
1
+ const SemVer = require('../classes/semver')
2
+ const Range = require('../classes/range')
3
+ const gt = require('../functions/gt')
4
+
5
+ const minVersion = (range, loose) => {
6
+ range = new Range(range, loose)
7
+
8
+ let minver = new SemVer('0.0.0')
9
+ if (range.test(minver)) {
10
+ return minver
11
+ }
12
+
13
+ minver = new SemVer('0.0.0-0')
14
+ if (range.test(minver)) {
15
+ return minver
16
+ }
17
+
18
+ minver = null
19
+ for (let i = 0; i < range.set.length; ++i) {
20
+ const comparators = range.set[i]
21
+
22
+ let setMin = null
23
+ comparators.forEach((comparator) => {
24
+ // Clone to avoid manipulating the comparator's semver object.
25
+ const compver = new SemVer(comparator.semver.version)
26
+ switch (comparator.operator) {
27
+ case '>':
28
+ if (compver.prerelease.length === 0) {
29
+ compver.patch++
30
+ } else {
31
+ compver.prerelease.push(0)
32
+ }
33
+ compver.raw = compver.format()
34
+ /* fallthrough */
35
+ case '':
36
+ case '>=':
37
+ if (!setMin || gt(compver, setMin)) {
38
+ setMin = compver
39
+ }
40
+ break
41
+ case '<':
42
+ case '<=':
43
+ /* Ignore maximum versions */
44
+ break
45
+ /* istanbul ignore next */
46
+ default:
47
+ throw new Error(`Unexpected operation: ${comparator.operator}`)
48
+ }
49
+ })
50
+ if (setMin && (!minver || gt(minver, setMin))) {
51
+ minver = setMin
52
+ }
53
+ }
54
+
55
+ if (minver && range.test(minver)) {
56
+ return minver
57
+ }
58
+
59
+ return null
60
+ }
61
+ module.exports = minVersion