@barchart/common-js/dist/cjs/collections/specialized/SortedTree.js

Library of common JavaScript utilities

var __create = Object.create;
var __defProp = Object.defineProperty;
var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
var __getOwnPropNames = Object.getOwnPropertyNames;
var __getProtoOf = Object.getPrototypeOf;
var __hasOwnProp = Object.prototype.hasOwnProperty;
var __export = (target, all) => {
  for (var name in all)
    __defProp(target, name, { get: all[name], enumerable: true });
};
var __copyProps = (to, from, except, desc) => {
  if (from && typeof from === "object" || typeof from === "function") {
    for (let key of __getOwnPropNames(from))
      if (!__hasOwnProp.call(to, key) && key !== except)
        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
  }
  return to;
};
var __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__getProtoOf(mod)) : {}, __copyProps(
  // If the importer is in node compatibility mode or this is not an ESM
  // file that has been converted to a CommonJS file using a Babel-
  // compatible transform (i.e. "__esModule" has not been set), then set
  // "default" to the CommonJS "module.exports" for node compatibility.
  isNodeMode || !mod || !mod.__esModule ? __defProp(target, "default", { value: mod, enumerable: true }) : target,
  mod
));
var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
var SortedTree_exports = {};
__export(SortedTree_exports, {
  default: () => SortedTree
});
module.exports = __toCommonJS(SortedTree_exports);
var array = __toESM(require("./../../lang/array.js"));
var assert = __toESM(require("./../../lang/assert.js"));
var import_Tree = __toESM(require("./../Tree.js"));
class SortedTree extends import_Tree.default {
  /**
   * @param {*} value - The value of the node.
   * @param {Tree=} parent - The parent node. If not supplied, this will be the root node.
   * @param {(a: any, b: any) => number=} comparator - The comparator function used to sort nodes.
   */
  constructor(value, parent, comparator) {
    super(value, parent);
    if (parent) {
      assert.argumentIsOptional(comparator, "comparator", Function);
    } else {
      assert.argumentIsRequired(comparator, "comparator", Function);
    }
    this._comparator = comparator || null;
  }
  /**
   * Adds a child node to the current node, inserting it at the correct position,
   * and returns a reference to the child node.
   *
   * @public
   * @param {*} value - The value of the child.
   * @returns {Tree}
   */
  addChild(value) {
    const child = new SortedTree(value, this);
    const comparatorNode = this.findParent((value2, node) => node instanceof SortedTree && node._comparator !== null, true);
    if (!(comparatorNode instanceof SortedTree) || comparatorNode._comparator === null) {
      throw new Error("Unable to find a comparator for the sorted tree.");
    }
    array.insert(this._children, child, comparatorNode._comparator);
    return child;
  }
  /**
   * Returns a string representation.
   *
   * @public
   * @returns {string}
   */
  toString() {
    return "[SortedTree]";
  }
}

{
	const cjsExports = module.exports;
	const cjsDefaultExport = cjsExports && cjsExports.__esModule ? cjsExports.default : cjsExports;

	if (cjsDefaultExport && (typeof cjsDefaultExport === 'function' || typeof cjsDefaultExport === 'object')) {
		Object.keys(cjsExports).forEach((key) => {
			if (key !== 'default' && key !== '__esModule') {
				cjsDefaultExport[key] = cjsExports[key];
			}
		});
	}

	module.exports = cjsDefaultExport;
}