140 lines
5.1 KiB
JavaScript
140 lines
5.1 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.TreeMap = void 0;
|
|
//================================================================
|
|
/**
|
|
* @packageDocumentation
|
|
* @module std
|
|
*/
|
|
//================================================================
|
|
var UniqueTreeMap_1 = require("../internal/container/associative/UniqueTreeMap");
|
|
var ITreeContainer_1 = require("../internal/container/associative/ITreeContainer");
|
|
var MapElementList_1 = require("../internal/container/associative/MapElementList");
|
|
var UniqueMapTree_1 = require("../internal/tree/UniqueMapTree");
|
|
/**
|
|
* Unique-key Map based on Tree.
|
|
*
|
|
* @author Jeongho Nam - https://github.com/samchon
|
|
*/
|
|
var TreeMap = /** @class */ (function (_super) {
|
|
__extends(TreeMap, _super);
|
|
function TreeMap() {
|
|
var args = [];
|
|
for (var _i = 0; _i < arguments.length; _i++) {
|
|
args[_i] = arguments[_i];
|
|
}
|
|
var _this =
|
|
// INITIALIZATION
|
|
_super.call(this, function (thisArg) { return new MapElementList_1.MapElementList(thisArg); }) || this;
|
|
// OVERLOADINGS
|
|
ITreeContainer_1.ITreeContainer.construct.apply(ITreeContainer_1.ITreeContainer, __spreadArray([_this,
|
|
TreeMap,
|
|
function (comp) {
|
|
_this.tree_ = new UniqueMapTree_1.UniqueMapTree(_this, comp);
|
|
}], __read(args), false));
|
|
return _this;
|
|
}
|
|
/**
|
|
* @inheritDoc
|
|
*/
|
|
TreeMap.prototype.clear = function () {
|
|
_super.prototype.clear.call(this);
|
|
this.tree_.clear();
|
|
};
|
|
/**
|
|
* @inheritDoc
|
|
*/
|
|
TreeMap.prototype.swap = function (obj) {
|
|
var _a, _b;
|
|
// SWAP CONTENTS
|
|
_a = __read([obj.data_, this.data_], 2), this.data_ = _a[0], obj.data_ = _a[1];
|
|
MapElementList_1.MapElementList._Swap_associative(this.data_, obj.data_);
|
|
// SWAP RB-TREE
|
|
UniqueMapTree_1.UniqueMapTree._Swap_source(this.tree_, obj.tree_);
|
|
_b = __read([obj.tree_, this.tree_], 2), this.tree_ = _b[0], obj.tree_ = _b[1];
|
|
};
|
|
/* ---------------------------------------------------------
|
|
ACCESSORS
|
|
--------------------------------------------------------- */
|
|
/**
|
|
* @inheritDoc
|
|
*/
|
|
TreeMap.prototype.key_comp = function () {
|
|
return this.tree_.key_comp();
|
|
};
|
|
/**
|
|
* @inheritDoc
|
|
*/
|
|
TreeMap.prototype.lower_bound = function (key) {
|
|
return this.tree_.lower_bound(key);
|
|
};
|
|
/**
|
|
* @inheritDoc
|
|
*/
|
|
TreeMap.prototype.upper_bound = function (key) {
|
|
return this.tree_.upper_bound(key);
|
|
};
|
|
/* ---------------------------------------------------------
|
|
POST-PROCESS
|
|
--------------------------------------------------------- */
|
|
TreeMap.prototype._Handle_insert = function (first, last) {
|
|
for (; !first.equals(last); first = first.next())
|
|
this.tree_.insert(first);
|
|
};
|
|
TreeMap.prototype._Handle_erase = function (first, last) {
|
|
for (; !first.equals(last); first = first.next())
|
|
this.tree_.erase(first);
|
|
};
|
|
return TreeMap;
|
|
}(UniqueTreeMap_1.UniqueTreeMap));
|
|
exports.TreeMap = TreeMap;
|
|
/**
|
|
*
|
|
*/
|
|
(function (TreeMap) {
|
|
// BODY
|
|
TreeMap.Iterator = MapElementList_1.MapElementList.Iterator;
|
|
TreeMap.ReverseIterator = MapElementList_1.MapElementList.ReverseIterator;
|
|
})(TreeMap = exports.TreeMap || (exports.TreeMap = {}));
|
|
exports.TreeMap = TreeMap;
|
|
//# sourceMappingURL=TreeMap.js.map
|