132 lines
4.9 KiB
JavaScript
132 lines
4.9 KiB
JavaScript
"use strict";
|
|
var __extends = (this && this.__extends) || (function () {
|
|
var extendStatics = function (d, b) {
|
|
extendStatics = Object.setPrototypeOf ||
|
|
({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
|
|
function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
|
|
return extendStatics(d, b);
|
|
};
|
|
return function (d, b) {
|
|
if (typeof b !== "function" && b !== null)
|
|
throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
|
|
extendStatics(d, b);
|
|
function __() { this.constructor = d; }
|
|
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
|
|
};
|
|
})();
|
|
var __read = (this && this.__read) || function (o, n) {
|
|
var m = typeof Symbol === "function" && o[Symbol.iterator];
|
|
if (!m) return o;
|
|
var i = m.call(o), r, ar = [], e;
|
|
try {
|
|
while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
|
|
}
|
|
catch (error) { e = { error: error }; }
|
|
finally {
|
|
try {
|
|
if (r && !r.done && (m = i["return"])) m.call(i);
|
|
}
|
|
finally { if (e) throw e.error; }
|
|
}
|
|
return ar;
|
|
};
|
|
var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
|
|
if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
|
|
if (ar || !(i in from)) {
|
|
if (!ar) ar = Array.prototype.slice.call(from, 0, i);
|
|
ar[i] = from[i];
|
|
}
|
|
}
|
|
return to.concat(ar || Array.prototype.slice.call(from));
|
|
};
|
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
exports.UniqueSet = void 0;
|
|
//================================================================
|
|
/**
|
|
* @packageDocumentation
|
|
* @module std.base
|
|
*/
|
|
//================================================================
|
|
var SetContainer_1 = require("./SetContainer");
|
|
var ErrorGenerator_1 = require("../../internal/exception/ErrorGenerator");
|
|
/**
|
|
* Basic set container blocking duplicated key.
|
|
*
|
|
* @template Key Key type
|
|
* @template Source Derived type extending this {@link UniqueSet}
|
|
* @template IteratorT Iterator type
|
|
* @template ReverseT Reverse iterator type
|
|
*
|
|
* @author Jeongho Nam - https://github.com/samchon
|
|
*/
|
|
var UniqueSet = /** @class */ (function (_super) {
|
|
__extends(UniqueSet, _super);
|
|
function UniqueSet() {
|
|
return _super !== null && _super.apply(this, arguments) || this;
|
|
}
|
|
/* ---------------------------------------------------------
|
|
ACCESSOR
|
|
--------------------------------------------------------- */
|
|
/**
|
|
* @inheritDoc
|
|
*/
|
|
UniqueSet.prototype.count = function (key) {
|
|
return this.find(key).equals(this.end()) ? 0 : 1;
|
|
};
|
|
UniqueSet.prototype.insert = function () {
|
|
var args = [];
|
|
for (var _i = 0; _i < arguments.length; _i++) {
|
|
args[_i] = arguments[_i];
|
|
}
|
|
return _super.prototype.insert.apply(this, __spreadArray([], __read(args), false));
|
|
};
|
|
UniqueSet.prototype._Insert_by_range = function (first, last) {
|
|
for (; !first.equals(last); first = first.next())
|
|
this._Insert_by_key(first.value);
|
|
};
|
|
UniqueSet.prototype.extract = function (param) {
|
|
if (param instanceof this.end().constructor)
|
|
return this._Extract_by_iterator(param);
|
|
else
|
|
return this._Extract_by_val(param);
|
|
};
|
|
UniqueSet.prototype._Extract_by_val = function (key) {
|
|
var it = this.find(key);
|
|
if (it.equals(this.end()) === true)
|
|
throw ErrorGenerator_1.ErrorGenerator.key_nout_found(this, "extract", key);
|
|
this._Erase_by_range(it);
|
|
return key;
|
|
};
|
|
UniqueSet.prototype._Extract_by_iterator = function (it) {
|
|
if (it.equals(this.end()) === true || this.has(it.value) === false)
|
|
return this.end();
|
|
this._Erase_by_range(it);
|
|
return it;
|
|
};
|
|
UniqueSet.prototype._Erase_by_val = function (key) {
|
|
var it = this.find(key);
|
|
if (it.equals(this.end()) === true)
|
|
return 0;
|
|
this._Erase_by_range(it);
|
|
return 1;
|
|
};
|
|
/* ---------------------------------------------------------
|
|
UTILITY
|
|
--------------------------------------------------------- */
|
|
/**
|
|
* @inheritDoc
|
|
*/
|
|
UniqueSet.prototype.merge = function (source) {
|
|
for (var it = source.begin(); !it.equals(source.end());) {
|
|
if (this.has(it.value) === false) {
|
|
this.insert(it.value);
|
|
it = source.erase(it);
|
|
}
|
|
else
|
|
it = it.next();
|
|
}
|
|
};
|
|
return UniqueSet;
|
|
}(SetContainer_1.SetContainer));
|
|
exports.UniqueSet = UniqueSet;
|
|
//# sourceMappingURL=UniqueSet.js.map
|