@hpcc-js/util 2.42.0 → 2.46.1

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 (75) hide show
  1. package/LICENSE +43 -43
  2. package/dist/index.js +2281 -2281
  3. package/dist/index.js.map +1 -1
  4. package/dist/index.min.js +1 -1
  5. package/dist/index.min.js.map +1 -1
  6. package/lib-es6/__package__.js +3 -3
  7. package/lib-es6/__package__.js.map +1 -1
  8. package/lib-es6/array.js +84 -84
  9. package/lib-es6/cache.js +60 -60
  10. package/lib-es6/debounce.js +85 -85
  11. package/lib-es6/dictionary.js +61 -61
  12. package/lib-es6/dispatch.js +101 -101
  13. package/lib-es6/esp.js +32 -32
  14. package/lib-es6/graph.js +348 -348
  15. package/lib-es6/graph2.js +603 -603
  16. package/lib-es6/hashSum.js +49 -49
  17. package/lib-es6/immutable.js +54 -54
  18. package/lib-es6/index.js +21 -21
  19. package/lib-es6/logging.js +177 -177
  20. package/lib-es6/math.js +90 -90
  21. package/lib-es6/object.js +121 -121
  22. package/lib-es6/observer.js +79 -79
  23. package/lib-es6/platform.js +17 -17
  24. package/lib-es6/saxParser.js +125 -125
  25. package/lib-es6/stack.js +41 -41
  26. package/lib-es6/stateful.js +170 -170
  27. package/lib-es6/string.js +22 -22
  28. package/lib-es6/url.js +32 -32
  29. package/package.json +7 -21
  30. package/src/__package__.ts +2 -2
  31. package/src/array.ts +98 -98
  32. package/src/cache.ts +65 -65
  33. package/src/debounce.ts +88 -88
  34. package/src/dictionary.ts +69 -69
  35. package/src/dispatch.ts +119 -119
  36. package/src/esp.ts +32 -32
  37. package/src/graph.ts +353 -353
  38. package/src/graph2.ts +661 -661
  39. package/src/hashSum.ts +55 -55
  40. package/src/immutable.ts +57 -57
  41. package/src/index.ts +21 -21
  42. package/src/logging.ts +211 -211
  43. package/src/math.ts +92 -92
  44. package/src/object.ts +117 -117
  45. package/src/observer.ts +91 -91
  46. package/src/platform.ts +20 -20
  47. package/src/saxParser.ts +135 -135
  48. package/src/stack.ts +41 -41
  49. package/src/stateful.ts +178 -178
  50. package/src/string.ts +21 -21
  51. package/src/url.ts +27 -27
  52. package/types/__package__.d.ts +3 -3
  53. package/types/__package__.d.ts.map +1 -1
  54. package/types/array.d.ts +13 -13
  55. package/types/cache.d.ts +20 -20
  56. package/types/debounce.d.ts +12 -12
  57. package/types/dictionary.d.ts +20 -20
  58. package/types/dispatch.d.ts +26 -26
  59. package/types/esp.d.ts +1 -1
  60. package/types/graph.d.ts +73 -73
  61. package/types/graph2.d.ts +111 -111
  62. package/types/hashSum.d.ts +1 -1
  63. package/types/immutable.d.ts +2 -2
  64. package/types/index.d.ts +21 -21
  65. package/types/logging.d.ts +57 -57
  66. package/types/math.d.ts +70 -70
  67. package/types/object.d.ts +48 -48
  68. package/types/observer.d.ts +18 -18
  69. package/types/platform.d.ts +5 -5
  70. package/types/saxParser.d.ts +28 -28
  71. package/types/stack.d.ts +28 -28
  72. package/types/stateful.d.ts +33 -33
  73. package/types/string.d.ts +2 -2
  74. package/types/url.d.ts +2 -2
  75. package/types-3.4/__package__.d.ts +2 -2
@@ -1,4 +1,4 @@
1
- export var PKG_NAME = "@hpcc-js/util";
2
- export var PKG_VERSION = "2.42.0";
3
- export var BUILD_VERSION = "2.97.0";
1
+ export var PKG_NAME = "@hpcc-js/util";
2
+ export var PKG_VERSION = "2.46.1";
3
+ export var BUILD_VERSION = "2.102.1";
4
4
  //# sourceMappingURL=__package__.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"__package__.js","sourceRoot":"","sources":["../src/__package__.ts"],"names":[],"mappings":"AAAA,MAAM,CAAC,IAAM,QAAQ,GAAG,eAAe,CAAC;AACxC,MAAM,CAAC,IAAM,WAAW,GAAG,QAAQ,CAAC;AACpC,MAAM,CAAC,IAAM,aAAa,GAAG,QAAQ,CAAC"}
1
+ {"version":3,"file":"__package__.js","sourceRoot":"","sources":["../src/__package__.ts"],"names":[],"mappings":"AAAA,MAAM,CAAC,IAAM,QAAQ,GAAG,eAAe,CAAC;AACxC,MAAM,CAAC,IAAM,WAAW,GAAG,QAAQ,CAAC;AACpC,MAAM,CAAC,IAAM,aAAa,GAAG,SAAS,CAAC"}
package/lib-es6/array.js CHANGED
@@ -1,85 +1,85 @@
1
- import { __spreadArray } from "tslib";
2
- // Based on: https://tc39.github.io/ecma262/#sec-array.prototype.find
3
- export function find(o, predicate) {
4
- // 1. Let O be ? ToObject(this value).
5
- if (o == null) {
6
- throw new TypeError('"o" is null or not defined');
7
- }
8
- // 2. Let len be ? ToLength(? Get(O, "length")).
9
- var len = o.length >>> 0;
10
- // 3. If IsCallable(predicate) is false, throw a TypeError exception.
11
- if (typeof predicate !== "function") {
12
- throw new TypeError("predicate must be a function");
13
- }
14
- // 4. If thisArg was supplied, let T be thisArg; else let T be undefined.
15
- var thisArg = arguments[1];
16
- // 5. Let k be 0.
17
- var k = 0;
18
- // 6. Repeat, while k < len
19
- while (k < len) {
20
- // a. Let Pk be ! ToString(k).
21
- // b. Let kValue be ? Get(O, Pk).
22
- // c. Let testResult be ToBoolean(? Call(predicate, T, « kValue, k, O »)).
23
- // d. If testResult is true, return kValue.
24
- var kValue = o[k];
25
- if (predicate.call(thisArg, kValue, k, o)) {
26
- return kValue;
27
- }
28
- // e. Increase k by 1.
29
- k++;
30
- }
31
- // 7. Return undefined.
32
- return undefined;
33
- }
34
- export function compare(before, after) {
35
- var retVal = {
36
- update: [],
37
- exit: [],
38
- enter: __spreadArray([], after, true)
39
- };
40
- for (var _i = 0, before_1 = before; _i < before_1.length; _i++) {
41
- var row = before_1[_i];
42
- var otherIdx = retVal.enter.indexOf(row);
43
- if (otherIdx >= 0) {
44
- retVal.update.push(row);
45
- retVal.enter.splice(otherIdx, 1);
46
- }
47
- else {
48
- retVal.exit.push(row);
49
- }
50
- }
51
- return retVal;
52
- }
53
- export function compare2(before, after, idFunc, updateFunc) {
54
- if (updateFunc === void 0) { updateFunc = function (before, after) { return after; }; }
55
- var retVal = {
56
- update: [],
57
- exit: [],
58
- enter: []
59
- };
60
- if (before === after) {
61
- retVal.update = before;
62
- return retVal;
63
- }
64
- var unknownMap = {};
65
- after.forEach(function (item) {
66
- unknownMap[idFunc(item)] = item;
67
- });
68
- for (var _i = 0, before_2 = before; _i < before_2.length; _i++) {
69
- var row = before_2[_i];
70
- var id = idFunc(row);
71
- var item = unknownMap[id];
72
- if (item !== undefined) {
73
- delete unknownMap[id];
74
- retVal.update.push(updateFunc(row, item));
75
- }
76
- else {
77
- retVal.exit.push(row);
78
- }
79
- }
80
- for (var key in unknownMap) {
81
- retVal.enter.push(unknownMap[key]);
82
- }
83
- return retVal;
84
- }
1
+ import { __spreadArray } from "tslib";
2
+ // Based on: https://tc39.github.io/ecma262/#sec-array.prototype.find
3
+ export function find(o, predicate) {
4
+ // 1. Let O be ? ToObject(this value).
5
+ if (o == null) {
6
+ throw new TypeError('"o" is null or not defined');
7
+ }
8
+ // 2. Let len be ? ToLength(? Get(O, "length")).
9
+ var len = o.length >>> 0;
10
+ // 3. If IsCallable(predicate) is false, throw a TypeError exception.
11
+ if (typeof predicate !== "function") {
12
+ throw new TypeError("predicate must be a function");
13
+ }
14
+ // 4. If thisArg was supplied, let T be thisArg; else let T be undefined.
15
+ var thisArg = arguments[1];
16
+ // 5. Let k be 0.
17
+ var k = 0;
18
+ // 6. Repeat, while k < len
19
+ while (k < len) {
20
+ // a. Let Pk be ! ToString(k).
21
+ // b. Let kValue be ? Get(O, Pk).
22
+ // c. Let testResult be ToBoolean(? Call(predicate, T, « kValue, k, O »)).
23
+ // d. If testResult is true, return kValue.
24
+ var kValue = o[k];
25
+ if (predicate.call(thisArg, kValue, k, o)) {
26
+ return kValue;
27
+ }
28
+ // e. Increase k by 1.
29
+ k++;
30
+ }
31
+ // 7. Return undefined.
32
+ return undefined;
33
+ }
34
+ export function compare(before, after) {
35
+ var retVal = {
36
+ update: [],
37
+ exit: [],
38
+ enter: __spreadArray([], after, true)
39
+ };
40
+ for (var _i = 0, before_1 = before; _i < before_1.length; _i++) {
41
+ var row = before_1[_i];
42
+ var otherIdx = retVal.enter.indexOf(row);
43
+ if (otherIdx >= 0) {
44
+ retVal.update.push(row);
45
+ retVal.enter.splice(otherIdx, 1);
46
+ }
47
+ else {
48
+ retVal.exit.push(row);
49
+ }
50
+ }
51
+ return retVal;
52
+ }
53
+ export function compare2(before, after, idFunc, updateFunc) {
54
+ if (updateFunc === void 0) { updateFunc = function (before, after) { return after; }; }
55
+ var retVal = {
56
+ update: [],
57
+ exit: [],
58
+ enter: []
59
+ };
60
+ if (before === after) {
61
+ retVal.update = before;
62
+ return retVal;
63
+ }
64
+ var unknownMap = {};
65
+ after.forEach(function (item) {
66
+ unknownMap[idFunc(item)] = item;
67
+ });
68
+ for (var _i = 0, before_2 = before; _i < before_2.length; _i++) {
69
+ var row = before_2[_i];
70
+ var id = idFunc(row);
71
+ var item = unknownMap[id];
72
+ if (item !== undefined) {
73
+ delete unknownMap[id];
74
+ retVal.update.push(updateFunc(row, item));
75
+ }
76
+ else {
77
+ retVal.exit.push(row);
78
+ }
79
+ }
80
+ for (var key in unknownMap) {
81
+ retVal.enter.push(unknownMap[key]);
82
+ }
83
+ return retVal;
84
+ }
85
85
  //# sourceMappingURL=array.js.map
package/lib-es6/cache.js CHANGED
@@ -1,61 +1,61 @@
1
- import { __assign } from "tslib";
2
- import { hashSum } from "./hashSum";
3
- var Cache = /** @class */ (function () {
4
- function Cache(calcID) {
5
- this._cache = {};
6
- this._calcID = calcID;
7
- }
8
- Cache.hash = function () {
9
- var args = [];
10
- for (var _i = 0; _i < arguments.length; _i++) {
11
- args[_i] = arguments[_i];
12
- }
13
- return hashSum(__assign({}, args));
14
- };
15
- Cache.prototype.has = function (espObj) {
16
- return this._calcID(espObj) in this._cache;
17
- };
18
- Cache.prototype.set = function (obj) {
19
- this._cache[this._calcID(obj)] = obj;
20
- return obj;
21
- };
22
- Cache.prototype.get = function (espObj, factory) {
23
- var retVal = this._cache[this._calcID(espObj)];
24
- if (!retVal) {
25
- return factory ? this.set(factory()) : null;
26
- }
27
- return retVal;
28
- };
29
- return Cache;
30
- }());
31
- export { Cache };
32
- var AsyncCache = /** @class */ (function () {
33
- function AsyncCache(calcID) {
34
- this._cache = {};
35
- this._calcID = calcID;
36
- }
37
- AsyncCache.hash = function () {
38
- var args = [];
39
- for (var _i = 0; _i < arguments.length; _i++) {
40
- args[_i] = arguments[_i];
41
- }
42
- return hashSum(__assign({}, args));
43
- };
44
- AsyncCache.prototype.has = function (espObj) {
45
- return this._calcID(espObj) in this._cache;
46
- };
47
- AsyncCache.prototype.set = function (espObj, obj) {
48
- this._cache[this._calcID(espObj)] = obj;
49
- return obj;
50
- };
51
- AsyncCache.prototype.get = function (espObj, factory) {
52
- var retVal = this._cache[this._calcID(espObj)];
53
- if (!retVal) {
54
- return factory ? this.set(espObj, factory()) : Promise.resolve(null);
55
- }
56
- return retVal;
57
- };
58
- return AsyncCache;
59
- }());
60
- export { AsyncCache };
1
+ import { __assign } from "tslib";
2
+ import { hashSum } from "./hashSum";
3
+ var Cache = /** @class */ (function () {
4
+ function Cache(calcID) {
5
+ this._cache = {};
6
+ this._calcID = calcID;
7
+ }
8
+ Cache.hash = function () {
9
+ var args = [];
10
+ for (var _i = 0; _i < arguments.length; _i++) {
11
+ args[_i] = arguments[_i];
12
+ }
13
+ return hashSum(__assign({}, args));
14
+ };
15
+ Cache.prototype.has = function (espObj) {
16
+ return this._calcID(espObj) in this._cache;
17
+ };
18
+ Cache.prototype.set = function (obj) {
19
+ this._cache[this._calcID(obj)] = obj;
20
+ return obj;
21
+ };
22
+ Cache.prototype.get = function (espObj, factory) {
23
+ var retVal = this._cache[this._calcID(espObj)];
24
+ if (!retVal) {
25
+ return factory ? this.set(factory()) : null;
26
+ }
27
+ return retVal;
28
+ };
29
+ return Cache;
30
+ }());
31
+ export { Cache };
32
+ var AsyncCache = /** @class */ (function () {
33
+ function AsyncCache(calcID) {
34
+ this._cache = {};
35
+ this._calcID = calcID;
36
+ }
37
+ AsyncCache.hash = function () {
38
+ var args = [];
39
+ for (var _i = 0; _i < arguments.length; _i++) {
40
+ args[_i] = arguments[_i];
41
+ }
42
+ return hashSum(__assign({}, args));
43
+ };
44
+ AsyncCache.prototype.has = function (espObj) {
45
+ return this._calcID(espObj) in this._cache;
46
+ };
47
+ AsyncCache.prototype.set = function (espObj, obj) {
48
+ this._cache[this._calcID(espObj)] = obj;
49
+ return obj;
50
+ };
51
+ AsyncCache.prototype.get = function (espObj, factory) {
52
+ var retVal = this._cache[this._calcID(espObj)];
53
+ if (!retVal) {
54
+ return factory ? this.set(espObj, factory()) : Promise.resolve(null);
55
+ }
56
+ return retVal;
57
+ };
58
+ return AsyncCache;
59
+ }());
60
+ export { AsyncCache };
61
61
  //# sourceMappingURL=cache.js.map
@@ -1,86 +1,86 @@
1
- import { hashSum } from "./hashSum";
2
- export function debounce(fn, timeout) {
3
- var promises = {};
4
- return function () {
5
- var params = [];
6
- for (var _i = 0; _i < arguments.length; _i++) {
7
- params[_i] = arguments[_i];
8
- }
9
- var hash = hashSum(params);
10
- if (!promises[hash]) {
11
- promises[hash] = {
12
- clockStart: Date.now(),
13
- promise: fn.apply(void 0, params).then(function (response) {
14
- if (timeout === undefined) {
15
- promises[hash] = null;
16
- }
17
- else {
18
- setTimeout(function () {
19
- promises[hash] = null;
20
- }, Math.max(timeout - (Date.now() - promises[hash].clockStart), 0));
21
- }
22
- return response;
23
- }).catch(function (e) {
24
- promises[hash] = null;
25
- throw e;
26
- })
27
- };
28
- }
29
- return promises[hash].promise;
30
- };
31
- }
32
- export function promiseTimeout(ms, promise) {
33
- var id;
34
- var timeout = new Promise(function (resolve, reject) {
35
- id = setTimeout(function () {
36
- clearTimeout(id);
37
- reject("Timed out in " + ms + "ms.");
38
- }, ms);
39
- });
40
- return Promise.race([
41
- promise,
42
- timeout
43
- ]).then(function (response) {
44
- clearTimeout(id);
45
- return response;
46
- }).catch(function (e) {
47
- clearTimeout(id);
48
- throw e;
49
- });
50
- }
51
- var AsyncOrderedQueue = /** @class */ (function () {
52
- function AsyncOrderedQueue() {
53
- this._q = [];
54
- }
55
- AsyncOrderedQueue.prototype.isTop = function (p) {
56
- return this._q[0] === p;
57
- };
58
- AsyncOrderedQueue.prototype.push = function (p) {
59
- var _this = this;
60
- var retVal = p.then(function (response) {
61
- if (_this.isTop(retVal)) {
62
- _this._q.shift();
63
- return response;
64
- }
65
- return new Promise(function (resolve, reject) {
66
- var intervalHandler = setInterval(function () {
67
- if (_this.isTop(retVal)) {
68
- clearInterval(intervalHandler);
69
- _this._q.shift();
70
- resolve(response);
71
- }
72
- }, 20);
73
- });
74
- });
75
- this._q.push(retVal);
76
- return retVal;
77
- };
78
- return AsyncOrderedQueue;
79
- }());
80
- export { AsyncOrderedQueue };
81
- export function sleep(ms) {
82
- return new Promise(function (resolve) {
83
- setTimeout(function () { return resolve(); }, ms);
84
- });
85
- }
1
+ import { hashSum } from "./hashSum";
2
+ export function debounce(fn, timeout) {
3
+ var promises = {};
4
+ return function () {
5
+ var params = [];
6
+ for (var _i = 0; _i < arguments.length; _i++) {
7
+ params[_i] = arguments[_i];
8
+ }
9
+ var hash = hashSum(params);
10
+ if (!promises[hash]) {
11
+ promises[hash] = {
12
+ clockStart: Date.now(),
13
+ promise: fn.apply(void 0, params).then(function (response) {
14
+ if (timeout === undefined) {
15
+ promises[hash] = null;
16
+ }
17
+ else {
18
+ setTimeout(function () {
19
+ promises[hash] = null;
20
+ }, Math.max(timeout - (Date.now() - promises[hash].clockStart), 0));
21
+ }
22
+ return response;
23
+ }).catch(function (e) {
24
+ promises[hash] = null;
25
+ throw e;
26
+ })
27
+ };
28
+ }
29
+ return promises[hash].promise;
30
+ };
31
+ }
32
+ export function promiseTimeout(ms, promise) {
33
+ var id;
34
+ var timeout = new Promise(function (resolve, reject) {
35
+ id = setTimeout(function () {
36
+ clearTimeout(id);
37
+ reject("Timed out in " + ms + "ms.");
38
+ }, ms);
39
+ });
40
+ return Promise.race([
41
+ promise,
42
+ timeout
43
+ ]).then(function (response) {
44
+ clearTimeout(id);
45
+ return response;
46
+ }).catch(function (e) {
47
+ clearTimeout(id);
48
+ throw e;
49
+ });
50
+ }
51
+ var AsyncOrderedQueue = /** @class */ (function () {
52
+ function AsyncOrderedQueue() {
53
+ this._q = [];
54
+ }
55
+ AsyncOrderedQueue.prototype.isTop = function (p) {
56
+ return this._q[0] === p;
57
+ };
58
+ AsyncOrderedQueue.prototype.push = function (p) {
59
+ var _this = this;
60
+ var retVal = p.then(function (response) {
61
+ if (_this.isTop(retVal)) {
62
+ _this._q.shift();
63
+ return response;
64
+ }
65
+ return new Promise(function (resolve, reject) {
66
+ var intervalHandler = setInterval(function () {
67
+ if (_this.isTop(retVal)) {
68
+ clearInterval(intervalHandler);
69
+ _this._q.shift();
70
+ resolve(response);
71
+ }
72
+ }, 20);
73
+ });
74
+ });
75
+ this._q.push(retVal);
76
+ return retVal;
77
+ };
78
+ return AsyncOrderedQueue;
79
+ }());
80
+ export { AsyncOrderedQueue };
81
+ export function sleep(ms) {
82
+ return new Promise(function (resolve) {
83
+ setTimeout(function () { return resolve(); }, ms);
84
+ });
85
+ }
86
86
  //# sourceMappingURL=debounce.js.map
@@ -1,62 +1,62 @@
1
- import { __extends } from "tslib";
2
- var Dictionary = /** @class */ (function () {
3
- function Dictionary(attrs) {
4
- this.store = {};
5
- if (attrs) {
6
- for (var key in attrs) {
7
- this.set(key, attrs[key]);
8
- }
9
- }
10
- }
11
- Dictionary.prototype.set = function (key, value) {
12
- var retVal = this.store[key];
13
- this.store[key] = value;
14
- return retVal;
15
- };
16
- Dictionary.prototype.get = function (key) {
17
- return this.store[key];
18
- };
19
- Dictionary.prototype.has = function (key) {
20
- return this.store[key] !== undefined;
21
- };
22
- Dictionary.prototype.remove = function (key) {
23
- delete this.store[key];
24
- };
25
- Dictionary.prototype.keys = function () {
26
- var retVal = [];
27
- for (var key in this.store) {
28
- retVal.push(key);
29
- }
30
- return retVal;
31
- };
32
- Dictionary.prototype.values = function () {
33
- var retVal = [];
34
- for (var key in this.store) {
35
- retVal.push(this.store[key]);
36
- }
37
- return retVal;
38
- };
39
- return Dictionary;
40
- }());
41
- export { Dictionary };
42
- var DictionaryNoCase = /** @class */ (function (_super) {
43
- __extends(DictionaryNoCase, _super);
44
- function DictionaryNoCase(attrs) {
45
- return _super.call(this, attrs) || this;
46
- }
47
- DictionaryNoCase.prototype.set = function (key, value) {
48
- return _super.prototype.set.call(this, key.toLowerCase(), value);
49
- };
50
- DictionaryNoCase.prototype.get = function (key) {
51
- return _super.prototype.get.call(this, key.toLowerCase());
52
- };
53
- DictionaryNoCase.prototype.has = function (key) {
54
- return _super.prototype.has.call(this, key.toLowerCase());
55
- };
56
- DictionaryNoCase.prototype.remove = function (key) {
57
- return _super.prototype.remove.call(this, key.toLowerCase());
58
- };
59
- return DictionaryNoCase;
60
- }(Dictionary));
61
- export { DictionaryNoCase };
1
+ import { __extends } from "tslib";
2
+ var Dictionary = /** @class */ (function () {
3
+ function Dictionary(attrs) {
4
+ this.store = {};
5
+ if (attrs) {
6
+ for (var key in attrs) {
7
+ this.set(key, attrs[key]);
8
+ }
9
+ }
10
+ }
11
+ Dictionary.prototype.set = function (key, value) {
12
+ var retVal = this.store[key];
13
+ this.store[key] = value;
14
+ return retVal;
15
+ };
16
+ Dictionary.prototype.get = function (key) {
17
+ return this.store[key];
18
+ };
19
+ Dictionary.prototype.has = function (key) {
20
+ return this.store[key] !== undefined;
21
+ };
22
+ Dictionary.prototype.remove = function (key) {
23
+ delete this.store[key];
24
+ };
25
+ Dictionary.prototype.keys = function () {
26
+ var retVal = [];
27
+ for (var key in this.store) {
28
+ retVal.push(key);
29
+ }
30
+ return retVal;
31
+ };
32
+ Dictionary.prototype.values = function () {
33
+ var retVal = [];
34
+ for (var key in this.store) {
35
+ retVal.push(this.store[key]);
36
+ }
37
+ return retVal;
38
+ };
39
+ return Dictionary;
40
+ }());
41
+ export { Dictionary };
42
+ var DictionaryNoCase = /** @class */ (function (_super) {
43
+ __extends(DictionaryNoCase, _super);
44
+ function DictionaryNoCase(attrs) {
45
+ return _super.call(this, attrs) || this;
46
+ }
47
+ DictionaryNoCase.prototype.set = function (key, value) {
48
+ return _super.prototype.set.call(this, key.toLowerCase(), value);
49
+ };
50
+ DictionaryNoCase.prototype.get = function (key) {
51
+ return _super.prototype.get.call(this, key.toLowerCase());
52
+ };
53
+ DictionaryNoCase.prototype.has = function (key) {
54
+ return _super.prototype.has.call(this, key.toLowerCase());
55
+ };
56
+ DictionaryNoCase.prototype.remove = function (key) {
57
+ return _super.prototype.remove.call(this, key.toLowerCase());
58
+ };
59
+ return DictionaryNoCase;
60
+ }(Dictionary));
61
+ export { DictionaryNoCase };
62
62
  //# sourceMappingURL=dictionary.js.map