@aurigma/design-atoms-model
Version:
Design Atoms is a part of Customer's Canvas SDK which allows for manipulating individual design elements through your code.
183 lines • 7.46 kB
JavaScript
var __generator = (this && this.__generator) || function (thisArg, body) {
var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
function verb(n) { return function (v) { return step([n, v]); }; }
function step(op) {
if (f) throw new TypeError("Generator is already executing.");
while (_) try {
if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
if (y = 0, t) op = [op[0] & 2, t.value];
switch (op[0]) {
case 0: case 1: t = op; break;
case 4: _.label++; return { value: op[1], done: false };
case 5: _.label++; y = op[1]; op = [0]; continue;
case 7: op = _.ops.pop(); _.trys.pop(); continue;
default:
if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
if (t[2]) _.ops.pop();
_.trys.pop(); continue;
}
op = body.call(thisArg, _);
} catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
}
};
var __values = (this && this.__values) || function(o) {
var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
if (m) return m.call(o);
if (o && typeof o.length === "number") return {
next: function () {
if (o && i >= o.length) o = void 0;
return { value: o && o[i++], done: !o };
}
};
throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
};
/**
* Represents a dictionary which key supports comparison through equals() method
*/
var EquatableKeyDictionary = /** @class */ (function () {
function EquatableKeyDictionary(entries) {
this._dictionary = new Map(entries);
}
/**
* Indicates whether an element with the key equal to given {@link keyValue} exists or not.
*/
EquatableKeyDictionary.prototype.hasEqual = function (keyValue) {
var hasKey = this.tryGetKeyEqualTo(keyValue).hasKey;
return hasKey;
};
/**
* Tries to find a key in the dictionary that is equal to given {@link keyValue}.
*
* Returns:
*
* hasKey - indicates whether such a key was found in the dictionary;
*
* key - contains key that is equal to {@link keyValue} or null if such key was not found.
*/
EquatableKeyDictionary.prototype.tryGetKeyEqualTo = function (keyValue) {
var e_1, _a;
if (this.has(keyValue)) {
return {
hasKey: true,
key: keyValue
};
}
try {
for (var _b = __values(this.keys()), _c = _b.next(); !_c.done; _c = _b.next()) {
var key = _c.value;
if (key.equals(keyValue)) {
return {
hasKey: true,
key: key
};
}
}
}
catch (e_1_1) { e_1 = { error: e_1_1 }; }
finally {
try {
if (_c && !_c.done && (_a = _b.return)) _a.call(_b);
}
finally { if (e_1) throw e_1.error; }
}
return {
hasKey: false,
key: null
};
};
/**
* Tries to find a value in the dictionary corresponding to the key equal to given {@link keyValue}.
*
* Returns:
*
* hasValue - indicates whether the value with such key was found;
*
* value - contains value with the key equal to {@link keyValue} or null if such key was not found.
*/
EquatableKeyDictionary.prototype.tryGetValueOf = function (keyValue) {
var _a = this.tryGetKeyEqualTo(keyValue), hasKey = _a.hasKey, key = _a.key;
return {
hasValue: hasKey,
value: key != null
? this.get(key)
: null
};
};
EquatableKeyDictionary.prototype.clear = function () {
this._dictionary.clear();
};
EquatableKeyDictionary.prototype.delete = function (key) {
return this._dictionary.delete(key);
};
EquatableKeyDictionary.prototype.forEach = function (callbackfn, thisArg) {
this._dictionary.forEach(callbackfn, thisArg);
};
EquatableKeyDictionary.prototype.get = function (key) {
return this._dictionary.get(key);
};
EquatableKeyDictionary.prototype.has = function (key) {
return this._dictionary.has(key);
};
EquatableKeyDictionary.prototype.set = function (key, value) {
this._dictionary.set(key, value);
return this;
};
Object.defineProperty(EquatableKeyDictionary.prototype, "size", {
get: function () {
return this._dictionary.size;
},
enumerable: true,
configurable: true
});
EquatableKeyDictionary.prototype.entries = function () {
return this._dictionary.entries();
};
EquatableKeyDictionary.prototype.keys = function () {
return this._dictionary.keys();
};
EquatableKeyDictionary.prototype.values = function () {
return this._dictionary.values();
};
EquatableKeyDictionary.prototype[Symbol.iterator] = function () {
var _a, _b, item, e_2_1;
var e_2, _c;
return __generator(this, function (_d) {
switch (_d.label) {
case 0:
_d.trys.push([0, 5, 6, 7]);
_a = __values(this._dictionary), _b = _a.next();
_d.label = 1;
case 1:
if (!!_b.done) return [3 /*break*/, 4];
item = _b.value;
return [4 /*yield*/, item];
case 2:
_d.sent();
_d.label = 3;
case 3:
_b = _a.next();
return [3 /*break*/, 1];
case 4: return [3 /*break*/, 7];
case 5:
e_2_1 = _d.sent();
e_2 = { error: e_2_1 };
return [3 /*break*/, 7];
case 6:
try {
if (_b && !_b.done && (_c = _a.return)) _c.call(_a);
}
finally { if (e_2) throw e_2.error; }
return [7 /*endfinally*/];
case 7: return [2 /*return*/];
}
});
};
return EquatableKeyDictionary;
}());
export { EquatableKeyDictionary };
//# sourceMappingURL=EquatableKeyDictionary.js.map