diff --git a/app/BlackJack.ts b/app/BlackJack.ts new file mode 100644 index 00000000..75aa5a1b --- /dev/null +++ b/app/BlackJack.ts @@ -0,0 +1,62 @@ +import Collections = require('typescript-collections'); +class BlackJack extends CardGame implements Gamble { + private balance: number; + private player: Player; + private playingDeck = new Deck(); + private playerHand: Collections.LinkedList; + private dealerHand: Collections.LinkedList; + private playerHandSum: number; + private dealerHandSum: number; + private prompts = new BlackJackPrompts(); + + run() { + let stillRunning = this.prompts.welcomePrompt; + while (stillRunning => true) { + + } + } + + buildDealerHand() { + this.dealerHand.add(this.playingDeck.pullCardFromDeck()); + this.dealerHand.add(this.playingDeck.pullCardFromDeck()); + } + + buildHand() { + //add two cards to hand initially + this.playerHand.add(this.playingDeck.pullCardFromDeck()); + this.playerHand.add(this.playingDeck.pullCardFromDeck()); + } + calculateEarnings(wages: number, winnings: number): number { + throw new Error("Method not implemented."); + } + + hit() { + if (this.sumDealerCards() <= 18) { + this.dealerHand.add(this.playingDeck.pullCardFromDeck()); + } + this.playerHand.add(this.playingDeck.pullCardFromDeck()); + } + + sumDealerCards() { + let sumCount = 0; + for (let i = 0; i < this.dealerHand.size(); i++) { + sumCount = this.dealerHand.elementAtIndex(i).valueOfRank(); + } + return sumCount; + } + + sumPlayerCards() { + let sumCount = 0; + for (let i = 0; i < this.playerHand.size(); i++) { + sumCount = this.playerHand.elementAtIndex(i).valueOfRank(); + } + return sumCount; + } + + checkBust(person: String) { + switch (person) { + case "player": if (this.sumPlayerCards() > 21) { return true; } else { return false; } + case "dealer": if (this.sumDealerCards() > 21) { return true; } else { return false; } + } + } +} \ No newline at end of file diff --git a/app/BlackJackPrompts.ts b/app/BlackJackPrompts.ts new file mode 100644 index 00000000..ebb8acbb --- /dev/null +++ b/app/BlackJackPrompts.ts @@ -0,0 +1,6 @@ +class BlackJackPrompts{ + + welcomePrompt():boolean{ + return false; + } +} \ No newline at end of file diff --git a/app/Card.ts b/app/Card.ts new file mode 100644 index 00000000..57a4dee2 --- /dev/null +++ b/app/Card.ts @@ -0,0 +1,50 @@ +class Card{ + private rank: String; + private suit: String; + + constructor(rank: String, suit: String){ + this.rank = rank; + this.suit = suit; + } + + getRank(){ + return this.rank; + } + + getSuit(){ + return this.suit; + } + + getIntValue(){ + return this.rank.valueOf; + } + + setSuit(suit: String){ + this.suit = suit; + } + + toString(){ + let output = (this.rank.toString + "of" + this.suit.toString); + return output; + } + + valueOfRank(): number{ + switch(this.rank){ + case "ACE": return 1; + case "TWO": return 2; + case "THREE": return 3; + case "FOUR": return 4; + case "FIVE": return 5; + case "SIX": return 6; + case "SEVEN": return 7; + case "EIGHT": return 8; + case "NINE": return 9; + case "TEN": return 10; + case "JACK": return 11; + case "QUEEN": return 12; + case "KING": return 13; + default: return null; + } + } + +} \ No newline at end of file diff --git a/app/CardGame.ts b/app/CardGame.ts new file mode 100644 index 00000000..c29b56f1 --- /dev/null +++ b/app/CardGame.ts @@ -0,0 +1,5 @@ +abstract class CardGame{ + protected deck = Deck; + + abstract buildHand(); +} \ No newline at end of file diff --git a/app/Deck.ts b/app/Deck.ts new file mode 100644 index 00000000..49809e41 --- /dev/null +++ b/app/Deck.ts @@ -0,0 +1,43 @@ +class Deck{ + private fullDeck: Card[]; + private deckInPlay: Card[]; + + constructor(){ + this.fullDeck = new Card[52]; + this.buildDeck(); + this.deckInPlay = this.fullDeck; + } + + buildDeck(){ + let rank = ["ACE", "TWO", "THREE", "FOUR", "FIVE", "SIX", + "SEVEN", "EIGHT", "NINE", "TEN", + "JACK", "QUEEN", "KING"]; + let suit = ["HEARTS", "CLUBS", "SPADES", "DIAMONDS"]; + let counter = 0; + for(let i = 0; i < 13; i++){ + for(let j = 0; j < 4; j++){ + this.fullDeck[counter] = new Card(rank[i], suit[j]); + counter++; + } + } + } + + pullCardFromDeck():Card{ + let indexOfCard = Math.floor((Math.random() * this.deckInPlay.length) + 1); + let cardToBePulled = this.deckInPlay[indexOfCard]; + let bufferdeck = new Card[this.deckInPlay.length-1]; + let counterForDeckInPlay = 0; + for(let i = 0; i < bufferdeck.length; i++){ + if(i == indexOfCard){ + counterForDeckInPlay++; + } else{ + bufferdeck[i] = this.deckInPlay[counterForDeckInPlay]; + counterForDeckInPlay++; + } + } + this.deckInPlay = bufferdeck; + return cardToBePulled; + } + + +} diff --git a/app/Gamble.ts b/app/Gamble.ts new file mode 100644 index 00000000..10109d12 --- /dev/null +++ b/app/Gamble.ts @@ -0,0 +1,3 @@ +interface Gamble{ + calculateEarnings(wages: number, winnings: number): number; +} \ No newline at end of file diff --git a/app/GameEngine.ts b/app/GameEngine.ts new file mode 100644 index 00000000..88cdad61 --- /dev/null +++ b/app/GameEngine.ts @@ -0,0 +1,11 @@ +abstract class GameEngine implements GameEngineInterface { + getGame(): GameType { + throw new Error("Method not implemented."); + } + evaluateTurn(player: GameTypePlayer): void { + throw new Error("Method not implemented."); + } + run(): void { + throw new Error("Method not implemented."); + } +} \ No newline at end of file diff --git a/app/GameEngineInterface.ts b/app/GameEngineInterface.ts new file mode 100644 index 00000000..dcd940b6 --- /dev/null +++ b/app/GameEngineInterface.ts @@ -0,0 +1,5 @@ +interface GameEngineInterface>{ + getGame(): E; + evaluateTurn(player: T): void; + run(): void; +} \ No newline at end of file diff --git a/app/GameInterface.ts b/app/GameInterface.ts new file mode 100644 index 00000000..f3edd7ca --- /dev/null +++ b/app/GameInterface.ts @@ -0,0 +1,9 @@ +interface GameInterface { + + getPlayers(): T[]; + getPlayer(playerId: number): T; + addPlayer(player: T): void; + removePlayer(player: T): void; + contains(player: T): boolean; + +} \ No newline at end of file diff --git a/app/GameType.ts b/app/GameType.ts new file mode 100644 index 00000000..fbea332c --- /dev/null +++ b/app/GameType.ts @@ -0,0 +1,3 @@ +interface GameType extends GameInterface{ + +} \ No newline at end of file diff --git a/app/GameTypePlayer.ts b/app/GameTypePlayer.ts new file mode 100644 index 00000000..79af8da1 --- /dev/null +++ b/app/GameTypePlayer.ts @@ -0,0 +1,3 @@ +interface GameTypePlayer extends PlayerInterface{ + +} \ No newline at end of file diff --git a/app/IOHandler.ts b/app/IOHandler.ts new file mode 100644 index 00000000..ef48f3a4 --- /dev/null +++ b/app/IOHandler.ts @@ -0,0 +1,4 @@ +//will handle all input and output for the whole system +class IOHandler{ + +} \ No newline at end of file diff --git a/app/Player.ts b/app/Player.ts new file mode 100644 index 00000000..c34eeb60 --- /dev/null +++ b/app/Player.ts @@ -0,0 +1,21 @@ +class Player implements PlayerInterface { + id: number; + name: string; + profile: Profile; + constructor(id: number, name: string, balance: number){ + this.name = name; + this.id = id; + this.profile = new Profile(this.id, this.name, balance); + } + + + getProfile(): Profile { + return this.profile; + } + getName(): String { + return this.name; + } + getId(): number { + return this.id; + } +} \ No newline at end of file diff --git a/app/PlayerInterface.ts b/app/PlayerInterface.ts new file mode 100644 index 00000000..fe498ac5 --- /dev/null +++ b/app/PlayerInterface.ts @@ -0,0 +1,9 @@ +interface PlayerInterface { + id: number; + name: string; + profile: Profile; + + getProfile(): Profile; + getName(): String; + getId(): number; +} \ No newline at end of file diff --git a/app/Profile.ts b/app/Profile.ts new file mode 100644 index 00000000..e3c6bd1c --- /dev/null +++ b/app/Profile.ts @@ -0,0 +1,22 @@ +class Profile{ +id: number = 0; +name: string = ""; +balance: number = 0; + constructor(id: number, name: string, balance: number){ + this.id = id; + this.name = name; + this.balance = balance; + } + + getProfileId(){ + return this.id; + } + + getUserName(){ + return this.name; + } + + getBalance(){ + return this.balance; + } +} \ No newline at end of file diff --git a/app/app.ts b/app/app.ts new file mode 100644 index 00000000..24647cc7 --- /dev/null +++ b/app/app.ts @@ -0,0 +1,3 @@ +class app{ + +} \ No newline at end of file diff --git a/app/settings.json b/app/settings.json new file mode 100644 index 00000000..97c24170 --- /dev/null +++ b/app/settings.json @@ -0,0 +1,3 @@ +{ + "code-runner.defaultLanguage": "javascript" +} \ No newline at end of file diff --git a/node_modules/typescript-collections/.npmignore b/node_modules/typescript-collections/.npmignore new file mode 100644 index 00000000..f57f69e2 --- /dev/null +++ b/node_modules/typescript-collections/.npmignore @@ -0,0 +1,22 @@ +.settings/ +.vscode/ +coverage/ +dist/test/ +examples/ +node_modules/ +src/ +temp/ +typings/ + +.gitattributes +.gitignore +.editorconfig +browserify-karma.js +browserify-umd.js +DEVELOPING.md +karma.conf.js +minify-umd.js +tsconfig.json +tsd.json +tslint.json +*.tgz \ No newline at end of file diff --git a/node_modules/typescript-collections/LICENSE b/node_modules/typescript-collections/LICENSE new file mode 100644 index 00000000..45c8201e --- /dev/null +++ b/node_modules/typescript-collections/LICENSE @@ -0,0 +1,21 @@ +The MIT License + +Copyright (c) 2010-2017 Tomasz Ciborski + +Permission is hereby granted, free of charge, to any person obtaining a copy +of this software and associated documentation files (the "Software"), to deal +in the Software without restriction, including without limitation the rights +to use, copy, modify, merge, publish, distribute, sublicense, and/or sell +copies of the Software, and to permit persons to whom the Software is +furnished to do so, subject to the following conditions: + +The above copyright notice and this permission notice shall be included in +all copies or substantial portions of the Software. + +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE +AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER +LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, +OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN +THE SOFTWARE. diff --git a/node_modules/typescript-collections/README.md b/node_modules/typescript-collections/README.md new file mode 100644 index 00000000..4b3738c2 --- /dev/null +++ b/node_modules/typescript-collections/README.md @@ -0,0 +1,227 @@ +[TypeScript Collections](https://github.com/basarat/typescript-collections/) +==================== + +It is a complete, fully tested data structure library written in TypeScript. + +This project uses TypeScript Generics so you need TS 0.9 and above. + +[This projects supports UMD (Universal Module Definition)](https://github.com/umdjs/umd) + +[![NPM](https://nodei.co/npm-dl/typescript-collections.png?height=3)](https://nodei.co/npm/typescript-collections/) + +Included data structures +--------------------- + +- Linked List +- Dictionary - [Example](#a-sample-on-dictionary) +- Multi Dictionary +- Linked Dictionary +- Default Dictionary - [Info](#default-dictionary) +- Binary Search Tree +- Binary Search Tree for Key-Value pairs +- Stack +- Queue +- Set - [Example](#example) +- Bag +- Binary Heap +- Priority Queue + +It also includes several functions for manipulating arrays. + +Usage +-------------------- + +`npm install typescript-collections --save` + +ES6 `import ... from` + +```typescript +import * as Collections from 'typescript-collections'; +``` + +or TypeScript `import ... require` + +```typescript +import Collections = require('typescript-collections'); +``` + +or JavaScript `var ... require` + +```js +var Collections = require('typescript-collections'); +``` + +![](https://zippy.gfycat.com/SeriousPointlessCob.gif) + +Visual Studio or other TypeScript IDE, will provide you with complete Intellisense (autocomplete) for your types. +The compiler will ensure that the collections contain the correct elements. + +A sample Visual Studio project is in the demo folder. + +Also available on NuGet : +Thanks to + +Example +-------------------- + +```typescript +import * as Collections from 'typescript-collections'; + +var mySet = new Collections.Set(); +mySet.add(123); +mySet.add(123); // Duplicates not allowed in a set +// The following will give error due to wrong type: +// mySet.add("asdf"); // Can only add numbers since that is the type argument. + +var myQueue = new Collections.Queue(); +myQueue.enqueue(1); +myQueue.enqueue(2); + +console.log(myQueue.dequeue()); // prints 1 +console.log(myQueue.dequeue()); // prints 2 +``` + +Typings resolution +------------------- + +Remember to set `"moduleResolution": "node"`, so TypeScript compiler can resolve typings in the `node_modules/typescript-collections` directory. + +In browser usage +------------------- + +You should include `umd.js` or `umd.min.js` from `dist/lib/` directory. + +```html + +``` + +A note on Equality +------------------- + +Equality is important for hashing (e.g. dictionary / sets). Javascript only allows strings to be keys for the base dictionary {}. +This is why the implementation for these data structures uses the item's toString() method. + +makeString utility function (aka. JSON.stringify) +------------------- + +A simple function is provided for you when you need a quick toString that uses all properties. E.g: + +```typescript +import * as Collections from 'typescript-collections'; + +class Car { + constructor(public company: string, public type: string, public year: number) { + } + toString() { + // Short hand. Adds each own property + return Collections.util.makeString(this); + } +} + +console.log(new Car("BMW", "A", 2016).toString()); +``` + +Output: + +```text +{company:BMW,type:A,year:2016} +``` + +A Sample on Dictionary +--------------------- + +```typescript +import * as Collections from 'typescript-collections'; + +class Person { + constructor(public name: string, public yearOfBirth: number,public city?:string) { + } + toString() { + return this.name + "-" + this.yearOfBirth; // City is not a part of the key. + } +} + +class Car { + constructor(public company: string, public type: string, public year: number) { + } + toString() { + // Short hand. Adds each own property + return Collections.util.makeString(this); + } +} +var dict = new Collections.Dictionary(); +dict.setValue(new Person("john", 1970,"melbourne"), new Car("honda", "city", 2002)); +dict.setValue(new Person("gavin", 1984), new Car("ferrari", "F50", 2006)); +console.log("Orig"); +console.log(dict); + +// Changes the same john, since city is not part of key +dict.setValue(new Person("john", 1970, "sydney"), new Car("honda", "accord", 2006)); +// Add a new john +dict.setValue(new Person("john", 1971), new Car("nissan", "micra", 2010)); +console.log("Updated"); +console.log(dict); + +// Showing getting / setting a single car: +console.log("Single Item"); +var person = new Person("john", 1970); +console.log("-Person:"); +console.log(person); + +var car = dict.getValue(person); +console.log("-Car:"); +console.log(car.toString()); +``` + +Output: + +```text +Orig +{ + john-1970 : {company:honda,type:city,year:2002} + gavin-1984 : {company:ferrari,type:F50,year:2006} +} +Updated +{ + john-1970 : {company:honda,type:accord,year:2006} + gavin-1984 : {company:ferrari,type:F50,year:2006} + john-1971 : {company:nissan,type:micra,year:2010} +} +Single Item +-Person: +john-1970 +-Car: +{company:honda,type:accord,year:2006} +``` + +Default Dictionary +--------------------- + +Also known as `Factory Dictionary` [[ref.](https://github.com/basarat/typescript-collections/pull/47)] + +If a key doesn't exist, the Default Dictionary automatically creates it with `setDefault(defaultValue)`. + +Default Dictionary is a @michaelneu contribution which copies Python's [defaultDict](https://docs.python.org/2/library/collections.html#collections.defaultdict). + +Development and contributions +-------------------- + +Compile, test and check coverage +`npm run all` + +Supported platforms +-------------------- + +- Every desktop and mobile browser (including IE6) +- Node.js + +```text +If it supports JavaScript, it probably supports this library. +``` + +Contact +-------------------- + +bas AT basarat.com + +Project is based on the excellent original javascript version called [buckets](https://github.com/mauriciosantos/buckets) diff --git a/node_modules/typescript-collections/dist/lib/BSTree.d.ts b/node_modules/typescript-collections/dist/lib/BSTree.d.ts new file mode 100644 index 00000000..75e6f562 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/BSTree.d.ts @@ -0,0 +1,18 @@ +import BSTreeKV from './BSTreeKV'; +/** + * Special-case of the binary search tree in which the search key is equal to the element type. + * This definition is suitable when the element type can not be split between what defines its order + * and what does not (eg. primitive types as opposed to indexed records). + * + * The table below shows some use-case examples for both interfaces: + * + * element type | most suitable interface + * ------------------------------------|---------------------------- + * number | BSTree + * string | BSTree + * { order: number, data: string } | BSTreeKV<{order: number}, {order: number, data: string}> + * + * @see BSTreeKV + */ +export default class BSTree extends BSTreeKV { +} diff --git a/node_modules/typescript-collections/dist/lib/BSTree.js b/node_modules/typescript-collections/dist/lib/BSTree.js new file mode 100644 index 00000000..fd2cc871 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/BSTree.js @@ -0,0 +1,37 @@ +"use strict"; +var __extends = (this && this.__extends) || (function () { + var extendStatics = Object.setPrototypeOf || + ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) || + function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; }; + return function (d, b) { + extendStatics(d, b); + function __() { this.constructor = d; } + d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __()); + }; +})(); +Object.defineProperty(exports, "__esModule", { value: true }); +var BSTreeKV_1 = require("./BSTreeKV"); +/** + * Special-case of the binary search tree in which the search key is equal to the element type. + * This definition is suitable when the element type can not be split between what defines its order + * and what does not (eg. primitive types as opposed to indexed records). + * + * The table below shows some use-case examples for both interfaces: + * + * element type | most suitable interface + * ------------------------------------|---------------------------- + * number | BSTree + * string | BSTree + * { order: number, data: string } | BSTreeKV<{order: number}, {order: number, data: string}> + * + * @see BSTreeKV + */ +var BSTree = /** @class */ (function (_super) { + __extends(BSTree, _super); + function BSTree() { + return _super !== null && _super.apply(this, arguments) || this; + } + return BSTree; +}(BSTreeKV_1.default)); +exports.default = BSTree; +//# sourceMappingURL=BSTree.js.map \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/BSTree.js.map b/node_modules/typescript-collections/dist/lib/BSTree.js.map new file mode 100644 index 00000000..d3fa84d8 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/BSTree.js.map @@ -0,0 +1 @@ +{"version":3,"file":"BSTree.js","sourceRoot":"","sources":["../../src/lib/BSTree.ts"],"names":[],"mappings":";;;;;;;;;;;;AAAA,uCAAkC;AAElC;;;;;;;;;;;;;;GAcG;AACH;IAAuC,0BAAc;IAArD;;IACA,CAAC;IAAD,aAAC;AAAD,CAAC,AADD,CAAuC,kBAAQ,GAC9C"} \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/BSTreeKV.d.ts b/node_modules/typescript-collections/dist/lib/BSTreeKV.d.ts new file mode 100644 index 00000000..4be2d2b3 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/BSTreeKV.d.ts @@ -0,0 +1,193 @@ +import * as util from './util'; +/** + * General binary search tree implementation. + * + * This interface allows one to search elements using a subset of their attributes (thus the + * tree can be used as an index for complex objects). + * The attributes required to define an ordering in the tree must be defined in the type K. + * Any additional attribute must be defined in the type V. + * + * @see BSTree + */ +export default class BSTreeKV { + private root; + private compare; + private nElements; + /** + * Creates an empty binary search tree. + * @class

A binary search tree is a binary tree in which each + * internal node stores an element such that the elements stored in the + * left subtree are less than it and the elements + * stored in the right subtree are greater.

+ *

Formally, a binary search tree is a node-based binary tree data structure which + * has the following properties:

+ *
    + *
  • The left subtree of a node contains only nodes with elements less + * than the node's element
    • + *
  • The right subtree of a node contains only nodes with elements greater + * than the node's element
    • + *
  • Both the left and right subtrees must also be binary search trees.
    • + *
+ *

If the inserted elements are custom objects a compare function must + * be provided at construction time, otherwise the <=, === and >= operators are + * used to compare elements. Example:

+ * 
+     * function compare(a, b) {
+     *  if (a is less than b by some ordering criterion) {
+     *     return -1;
+     *  } if (a is greater than b by the ordering criterion) {
+     *     return 1;
+     *  }
+     *  // a must be equal to b
+     *  return 0;
+     * }
+     *
+ * @constructor + * @param {function(Object,Object):number=} compareFunction optional + * function used to compare two elements. Must return a negative integer, + * zero, or a positive integer as the first argument is less than, equal to, + * or greater than the second. + */ + constructor(compareFunction?: util.ICompareFunction); + /** + * Adds the specified element to this tree if it is not already present. + * @param {Object} element the element to insert. + * @return {boolean} true if this tree did not already contain the specified element. + */ + add(element: V): boolean; + /** + * Removes all of the elements from this tree. + */ + clear(): void; + /** + * Returns true if this tree contains no elements. + * @return {boolean} true if this tree contains no elements. + */ + isEmpty(): boolean; + /** + * Returns the number of elements in this tree. + * @return {number} the number of elements in this tree. + */ + size(): number; + /** + * Returns true if this tree contains the specified element. + * @param {Object} element element to search for. + * @return {boolean} true if this tree contains the specified element, + * false otherwise. + */ + contains(element: K): boolean; + /** + * Looks for the value with the provided search key. + * @param {Object} element The key to look for + * @return {Object} The value found or undefined if it was not found. + */ + search(element: K): V | undefined; + /** + * Removes the specified element from this tree if it is present. + * @return {boolean} true if this tree contained the specified element. + */ + remove(element: K): boolean; + /** + * Executes the provided function once for each element present in this tree in + * in-order. + * @param {function(Object):*} callback function to execute, it is invoked with one + * argument: the element value, to break the iteration you can optionally return false. + */ + inorderTraversal(callback: util.ILoopFunction): void; + /** + * Executes the provided function once for each element present in this tree in pre-order. + * @param {function(Object):*} callback function to execute, it is invoked with one + * argument: the element value, to break the iteration you can optionally return false. + */ + preorderTraversal(callback: util.ILoopFunction): void; + /** + * Executes the provided function once for each element present in this tree in post-order. + * @param {function(Object):*} callback function to execute, it is invoked with one + * argument: the element value, to break the iteration you can optionally return false. + */ + postorderTraversal(callback: util.ILoopFunction): void; + /** + * Executes the provided function once for each element present in this tree in + * level-order. + * @param {function(Object):*} callback function to execute, it is invoked with one + * argument: the element value, to break the iteration you can optionally return false. + */ + levelTraversal(callback: util.ILoopFunction): void; + /** + * Returns the minimum element of this tree. + * @return {*} the minimum element of this tree or undefined if this tree is + * is empty. + */ + minimum(): V | undefined; + /** + * Returns the maximum element of this tree. + * @return {*} the maximum element of this tree or undefined if this tree is + * is empty. + */ + maximum(): V | undefined; + /** + * Executes the provided function once for each element present in this tree in inorder. + * Equivalent to inorderTraversal. + * @param {function(Object):*} callback function to execute, it is + * invoked with one argument: the element value, to break the iteration you can + * optionally return false. + */ + forEach(callback: util.ILoopFunction): void; + /** + * Returns an array containing all of the elements in this tree in in-order. + * @return {Array} an array containing all of the elements in this tree in in-order. + */ + toArray(): V[]; + /** + * Returns the height of this tree. + * @return {number} the height of this tree or -1 if is empty. + */ + height(): number; + /** + * @private + */ + private searchNode(node, element); + /** + * @private + */ + private transplant(n1, n2); + /** + * @private + */ + private removeNode(node); + /** + * @private + */ + private inorderTraversalAux(node, callback, signal); + /** + * @private + */ + private levelTraversalAux(node, callback); + /** + * @private + */ + private preorderTraversalAux(node, callback, signal); + /** + * @private + */ + private postorderTraversalAux(node, callback, signal); + /** + * @private + */ + private minimumAux(node); + private minimumAux(node); + /** + * @private + */ + private maximumAux(node); + private maximumAux(node); + /** + * @private + */ + private heightAux(node); + private insertNode(node); + /** + * @private + */ + private createNode(element); +} diff --git a/node_modules/typescript-collections/dist/lib/BSTreeKV.js b/node_modules/typescript-collections/dist/lib/BSTreeKV.js new file mode 100644 index 00000000..bab2e8c5 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/BSTreeKV.js @@ -0,0 +1,416 @@ +"use strict"; +Object.defineProperty(exports, "__esModule", { value: true }); +var util = require("./util"); +var Queue_1 = require("./Queue"); +/** + * General binary search tree implementation. + * + * This interface allows one to search elements using a subset of their attributes (thus the + * tree can be used as an index for complex objects). + * The attributes required to define an ordering in the tree must be defined in the type K. + * Any additional attribute must be defined in the type V. + * + * @see BSTree + */ +var BSTreeKV = /** @class */ (function () { + /** + * Creates an empty binary search tree. + * @class

A binary search tree is a binary tree in which each + * internal node stores an element such that the elements stored in the + * left subtree are less than it and the elements + * stored in the right subtree are greater.

+ *

Formally, a binary search tree is a node-based binary tree data structure which + * has the following properties:

+ *
    + *
  • The left subtree of a node contains only nodes with elements less + * than the node's element
    • + *
  • The right subtree of a node contains only nodes with elements greater + * than the node's element
    • + *
  • Both the left and right subtrees must also be binary search trees.
    • + *
+ *

If the inserted elements are custom objects a compare function must + * be provided at construction time, otherwise the <=, === and >= operators are + * used to compare elements. Example:

+ * 
+     * function compare(a, b) {
+     *  if (a is less than b by some ordering criterion) {
+     *     return -1;
+     *  } if (a is greater than b by the ordering criterion) {
+     *     return 1;
+     *  }
+     *  // a must be equal to b
+     *  return 0;
+     * }
+     *
+ * @constructor + * @param {function(Object,Object):number=} compareFunction optional + * function used to compare two elements. Must return a negative integer, + * zero, or a positive integer as the first argument is less than, equal to, + * or greater than the second. + */ + function BSTreeKV(compareFunction) { + this.root = null; + this.compare = compareFunction || util.defaultCompare; + this.nElements = 0; + } + /** + * Adds the specified element to this tree if it is not already present. + * @param {Object} element the element to insert. + * @return {boolean} true if this tree did not already contain the specified element. + */ + BSTreeKV.prototype.add = function (element) { + if (util.isUndefined(element)) { + return false; + } + if (this.insertNode(this.createNode(element)) !== null) { + this.nElements++; + return true; + } + return false; + }; + /** + * Removes all of the elements from this tree. + */ + BSTreeKV.prototype.clear = function () { + this.root = null; + this.nElements = 0; + }; + /** + * Returns true if this tree contains no elements. + * @return {boolean} true if this tree contains no elements. + */ + BSTreeKV.prototype.isEmpty = function () { + return this.nElements === 0; + }; + /** + * Returns the number of elements in this tree. + * @return {number} the number of elements in this tree. + */ + BSTreeKV.prototype.size = function () { + return this.nElements; + }; + /** + * Returns true if this tree contains the specified element. + * @param {Object} element element to search for. + * @return {boolean} true if this tree contains the specified element, + * false otherwise. + */ + BSTreeKV.prototype.contains = function (element) { + if (util.isUndefined(element)) { + return false; + } + return this.searchNode(this.root, element) !== null; + }; + /** + * Looks for the value with the provided search key. + * @param {Object} element The key to look for + * @return {Object} The value found or undefined if it was not found. + */ + BSTreeKV.prototype.search = function (element) { + var ret = this.searchNode(this.root, element); + if (ret === null) { + return undefined; + } + return ret.element; + }; + /** + * Removes the specified element from this tree if it is present. + * @return {boolean} true if this tree contained the specified element. + */ + BSTreeKV.prototype.remove = function (element) { + var node = this.searchNode(this.root, element); + if (node === null) { + return false; + } + this.removeNode(node); + this.nElements--; + return true; + }; + /** + * Executes the provided function once for each element present in this tree in + * in-order. + * @param {function(Object):*} callback function to execute, it is invoked with one + * argument: the element value, to break the iteration you can optionally return false. + */ + BSTreeKV.prototype.inorderTraversal = function (callback) { + this.inorderTraversalAux(this.root, callback, { + stop: false + }); + }; + /** + * Executes the provided function once for each element present in this tree in pre-order. + * @param {function(Object):*} callback function to execute, it is invoked with one + * argument: the element value, to break the iteration you can optionally return false. + */ + BSTreeKV.prototype.preorderTraversal = function (callback) { + this.preorderTraversalAux(this.root, callback, { + stop: false + }); + }; + /** + * Executes the provided function once for each element present in this tree in post-order. + * @param {function(Object):*} callback function to execute, it is invoked with one + * argument: the element value, to break the iteration you can optionally return false. + */ + BSTreeKV.prototype.postorderTraversal = function (callback) { + this.postorderTraversalAux(this.root, callback, { + stop: false + }); + }; + /** + * Executes the provided function once for each element present in this tree in + * level-order. + * @param {function(Object):*} callback function to execute, it is invoked with one + * argument: the element value, to break the iteration you can optionally return false. + */ + BSTreeKV.prototype.levelTraversal = function (callback) { + this.levelTraversalAux(this.root, callback); + }; + /** + * Returns the minimum element of this tree. + * @return {*} the minimum element of this tree or undefined if this tree is + * is empty. + */ + BSTreeKV.prototype.minimum = function () { + if (this.isEmpty() || this.root === null) { + return undefined; + } + return this.minimumAux(this.root).element; + }; + /** + * Returns the maximum element of this tree. + * @return {*} the maximum element of this tree or undefined if this tree is + * is empty. + */ + BSTreeKV.prototype.maximum = function () { + if (this.isEmpty() || this.root === null) { + return undefined; + } + return this.maximumAux(this.root).element; + }; + /** + * Executes the provided function once for each element present in this tree in inorder. + * Equivalent to inorderTraversal. + * @param {function(Object):*} callback function to execute, it is + * invoked with one argument: the element value, to break the iteration you can + * optionally return false. + */ + BSTreeKV.prototype.forEach = function (callback) { + this.inorderTraversal(callback); + }; + /** + * Returns an array containing all of the elements in this tree in in-order. + * @return {Array} an array containing all of the elements in this tree in in-order. + */ + BSTreeKV.prototype.toArray = function () { + var array = []; + this.inorderTraversal(function (element) { + array.push(element); + return true; + }); + return array; + }; + /** + * Returns the height of this tree. + * @return {number} the height of this tree or -1 if is empty. + */ + BSTreeKV.prototype.height = function () { + return this.heightAux(this.root); + }; + /** + * @private + */ + BSTreeKV.prototype.searchNode = function (node, element) { + var cmp = 1; + while (node !== null && cmp !== 0) { + cmp = this.compare(element, node.element); + if (cmp < 0) { + node = node.leftCh; + } + else if (cmp > 0) { + node = node.rightCh; + } + } + return node; + }; + /** + * @private + */ + BSTreeKV.prototype.transplant = function (n1, n2) { + if (n1.parent === null) { + this.root = n2; + } + else if (n1 === n1.parent.leftCh) { + n1.parent.leftCh = n2; + } + else { + n1.parent.rightCh = n2; + } + if (n2 !== null) { + n2.parent = n1.parent; + } + }; + /** + * @private + */ + BSTreeKV.prototype.removeNode = function (node) { + if (node.leftCh === null) { + this.transplant(node, node.rightCh); + } + else if (node.rightCh === null) { + this.transplant(node, node.leftCh); + } + else { + var y = this.minimumAux(node.rightCh); + if (y.parent !== node) { + this.transplant(y, y.rightCh); + y.rightCh = node.rightCh; + y.rightCh.parent = y; + } + this.transplant(node, y); + y.leftCh = node.leftCh; + y.leftCh.parent = y; + } + }; + /** + * @private + */ + BSTreeKV.prototype.inorderTraversalAux = function (node, callback, signal) { + if (node === null || signal.stop) { + return; + } + this.inorderTraversalAux(node.leftCh, callback, signal); + if (signal.stop) { + return; + } + signal.stop = callback(node.element) === false; + if (signal.stop) { + return; + } + this.inorderTraversalAux(node.rightCh, callback, signal); + }; + /** + * @private + */ + BSTreeKV.prototype.levelTraversalAux = function (node, callback) { + var queue = new Queue_1.default(); + if (node !== null) { + queue.enqueue(node); + } + node = queue.dequeue() || null; + while (node != null) { + if (callback(node.element) === false) { + return; + } + if (node.leftCh !== null) { + queue.enqueue(node.leftCh); + } + if (node.rightCh !== null) { + queue.enqueue(node.rightCh); + } + node = queue.dequeue() || null; + } + }; + /** + * @private + */ + BSTreeKV.prototype.preorderTraversalAux = function (node, callback, signal) { + if (node === null || signal.stop) { + return; + } + signal.stop = callback(node.element) === false; + if (signal.stop) { + return; + } + this.preorderTraversalAux(node.leftCh, callback, signal); + if (signal.stop) { + return; + } + this.preorderTraversalAux(node.rightCh, callback, signal); + }; + /** + * @private + */ + BSTreeKV.prototype.postorderTraversalAux = function (node, callback, signal) { + if (node === null || signal.stop) { + return; + } + this.postorderTraversalAux(node.leftCh, callback, signal); + if (signal.stop) { + return; + } + this.postorderTraversalAux(node.rightCh, callback, signal); + if (signal.stop) { + return; + } + signal.stop = callback(node.element) === false; + }; + BSTreeKV.prototype.minimumAux = function (node) { + while (node != null && node.leftCh !== null) { + node = node.leftCh; + } + return node; + }; + BSTreeKV.prototype.maximumAux = function (node) { + while (node != null && node.rightCh !== null) { + node = node.rightCh; + } + return node; + }; + /** + * @private + */ + BSTreeKV.prototype.heightAux = function (node) { + if (node === null) { + return -1; + } + return Math.max(this.heightAux(node.leftCh), this.heightAux(node.rightCh)) + 1; + }; + /* + * @private + */ + BSTreeKV.prototype.insertNode = function (node) { + var parent = null; + var position = this.root; + while (position !== null) { + var cmp = this.compare(node.element, position.element); + if (cmp === 0) { + return null; + } + else if (cmp < 0) { + parent = position; + position = position.leftCh; + } + else { + parent = position; + position = position.rightCh; + } + } + node.parent = parent; + if (parent === null) { + // tree is empty + this.root = node; + } + else if (this.compare(node.element, parent.element) < 0) { + parent.leftCh = node; + } + else { + parent.rightCh = node; + } + return node; + }; + /** + * @private + */ + BSTreeKV.prototype.createNode = function (element) { + return { + element: element, + leftCh: null, + rightCh: null, + parent: null + }; + }; + return BSTreeKV; +}()); +exports.default = BSTreeKV; +//# sourceMappingURL=BSTreeKV.js.map \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/BSTreeKV.js.map b/node_modules/typescript-collections/dist/lib/BSTreeKV.js.map new file mode 100644 index 00000000..efc30d23 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/BSTreeKV.js.map @@ -0,0 +1 @@ +{"version":3,"file":"BSTreeKV.js","sourceRoot":"","sources":["../../src/lib/BSTreeKV.ts"],"names":[],"mappings":";;AAAA,6BAA+B;AAC/B,iCAA4B;AAS5B;;;;;;;;;GASG;AACH;IAKI;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAkCG;IACH,kBAAY,eAA0C;QAClD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,OAAO,GAAG,eAAe,IAAI,IAAI,CAAC,cAAc,CAAC;QACtD,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACvB,CAAC;IAED;;;;OAIG;IACH,sBAAG,GAAH,UAAI,OAAU;QACV,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;QAED,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;YACrD,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,MAAM,CAAC,IAAI,CAAC;QAChB,CAAC;QACD,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,wBAAK,GAAL;QACI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACvB,CAAC;IAED;;;OAGG;IACH,0BAAO,GAAP;QACI,MAAM,CAAC,IAAI,CAAC,SAAS,KAAK,CAAC,CAAC;IAChC,CAAC;IAED;;;OAGG;IACH,uBAAI,GAAJ;QACI,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC;IAC1B,CAAC;IAED;;;;;OAKG;IACH,2BAAQ,GAAR,UAAS,OAAU;QACf,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,KAAK,IAAI,CAAC;IACxD,CAAC;IAED;;;;OAIG;IACH,yBAAM,GAAN,UAAO,OAAU;QACb,IAAM,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAChD,EAAE,CAAC,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC;YACf,MAAM,CAAC,SAAS,CAAC;QACrB,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC;IACvB,CAAC;IAED;;;OAGG;IACH,yBAAM,GAAN,UAAO,OAAU;QACb,IAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACjD,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;QACD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACtB,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,MAAM,CAAC,IAAI,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACH,mCAAgB,GAAhB,UAAiB,QAA+B;QAC5C,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,EAAE;YAC1C,IAAI,EAAE,KAAK;SACd,CAAC,CAAC;IACP,CAAC;IAED;;;;OAIG;IACH,oCAAiB,GAAjB,UAAkB,QAA+B;QAC7C,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,EAAE;YAC3C,IAAI,EAAE,KAAK;SACd,CAAC,CAAC;IACP,CAAC;IAED;;;;OAIG;IACH,qCAAkB,GAAlB,UAAmB,QAA+B;QAC9C,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,EAAE;YAC5C,IAAI,EAAE,KAAK;SACd,CAAC,CAAC;IACP,CAAC;IAED;;;;;OAKG;IACH,iCAAc,GAAd,UAAe,QAA+B;QAC1C,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAChD,CAAC;IAED;;;;OAIG;IACH,0BAAO,GAAP;QACI,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,SAAS,CAAC;QACrB,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC;IAC9C,CAAC;IAED;;;;OAIG;IACH,0BAAO,GAAP;QACI,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,SAAS,CAAC;QACrB,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC;IAC9C,CAAC;IAED;;;;;;OAMG;IACH,0BAAO,GAAP,UAAQ,QAA+B;QACnC,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;IACpC,CAAC;IAED;;;OAGG;IACH,0BAAO,GAAP;QACI,IAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,UAAS,OAAU;YACrC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC;QAChB,CAAC,CAAC,CAAC;QACH,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,yBAAM,GAAN;QACI,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC;IAED;;MAEE;IACM,6BAAU,GAAlB,UAAmB,IAA0B,EAAE,OAAU;QACrD,IAAI,GAAG,GAAW,CAAC,CAAC;QACpB,OAAO,IAAI,KAAK,IAAI,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;YAChC,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;YAC1C,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;gBACV,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;YACvB,CAAC;YAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;gBACjB,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC;YACxB,CAAC;QACL,CAAC;QACD,MAAM,CAAC,IAAI,CAAC;IAChB,CAAC;IAED;;MAEE;IACM,6BAAU,GAAlB,UAAmB,EAAiB,EAAE,EAAwB;QAC1D,EAAE,CAAC,CAAC,EAAE,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC;YACrB,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;QACnB,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;YACjC,EAAE,CAAC,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;QAC1B,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,EAAE,CAAC,MAAM,CAAC,OAAO,GAAG,EAAE,CAAC;QAC3B,CAAC;QACD,EAAE,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC;YACd,EAAE,CAAC,MAAM,GAAG,EAAE,CAAC,MAAM,CAAC;QAC1B,CAAC;IACL,CAAC;IAED;;MAEE;IACM,6BAAU,GAAlB,UAAmB,IAAmB;QAClC,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC;YACvB,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QACxC,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC;YAC/B,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACvC,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,IAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACxC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC;gBACpB,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;gBAC9B,CAAC,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;gBACzB,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;YACzB,CAAC;YACD,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACzB,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;YACvB,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QACxB,CAAC;IACL,CAAC;IAED;;MAEE;IACM,sCAAmB,GAA3B,UAA4B,IAA0B,EAAE,QAA+B,EAAE,MAA0B;QAC/G,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC;QACX,CAAC;QACD,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QACxD,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YACd,MAAM,CAAC;QACX,CAAC;QACD,MAAM,CAAC,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,CAAC;QAC/C,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YACd,MAAM,CAAC;QACX,CAAC;QACD,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;IAC7D,CAAC;IAED;;MAEE;IACM,oCAAiB,GAAzB,UAA0B,IAA0B,EAAE,QAA+B;QACjF,IAAM,KAAK,GAAG,IAAI,eAAK,EAAiB,CAAC;QACzC,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC;YAChB,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;QACD,IAAI,GAAG,KAAK,CAAC,OAAO,EAAE,IAAI,IAAI,CAAC;QAC/B,OAAO,IAAI,IAAI,IAAI,EAAE,CAAC;YAClB,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC;gBACnC,MAAM,CAAC;YACX,CAAC;YACD,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC;gBACvB,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC/B,CAAC;YACD,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC;gBACxB,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAChC,CAAC;YACD,IAAI,GAAG,KAAK,CAAC,OAAO,EAAE,IAAI,IAAI,CAAC;QACnC,CAAC;IACL,CAAC;IAED;;MAEE;IACM,uCAAoB,GAA5B,UAA6B,IAA0B,EAAE,QAA+B,EAAE,MAA0B;QAChH,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC;QACX,CAAC;QACD,MAAM,CAAC,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,CAAC;QAC/C,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YACd,MAAM,CAAC;QACX,CAAC;QACD,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QACzD,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YACd,MAAM,CAAC;QACX,CAAC;QACD,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;IAC9D,CAAC;IACD;;MAEE;IACM,wCAAqB,GAA7B,UAA8B,IAA0B,EAAE,QAA+B,EAAE,MAA0B;QACjH,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC;QACX,CAAC;QACD,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QAC1D,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YACd,MAAM,CAAC;QACX,CAAC;QACD,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QAC3D,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YACd,MAAM,CAAC;QACX,CAAC;QACD,MAAM,CAAC,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,CAAC;IACnD,CAAC;IAOO,6BAAU,GAAlB,UAAmB,IAA0B;QACzC,OAAO,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;YAC1C,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;QACvB,CAAC;QACD,MAAM,CAAC,IAAI,CAAC;IAChB,CAAC;IAOO,6BAAU,GAAlB,UAAmB,IAA0B;QACzC,OAAO,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI,EAAE,CAAC;YAC3C,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC;QACxB,CAAC;QACD,MAAM,CAAC,IAAI,CAAC;IAChB,CAAC;IAED;;QAEI;IACI,4BAAS,GAAjB,UAAkB,IAA0B;QACxC,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,CAAC,CAAC,CAAC;QACd,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC;IACnF,CAAC;IAED;;MAEE;IACM,6BAAU,GAAlB,UAAmB,IAAmB;QAElC,IAAI,MAAM,GAAQ,IAAI,CAAC;QACvB,IAAI,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC;QACzB,OAAO,QAAQ,KAAK,IAAI,EAAE,CAAC;YACvB,IAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,OAAO,CAAC,CAAC;YACzD,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBACZ,MAAM,CAAC,IAAI,CAAC;YAChB,CAAC;YAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;gBACjB,MAAM,GAAG,QAAQ,CAAC;gBAClB,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC;YAC/B,CAAC;YAAC,IAAI,CAAC,CAAC;gBACJ,MAAM,GAAG,QAAQ,CAAC;gBAClB,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC;YAChC,CAAC;QACL,CAAC;QACD,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,EAAE,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC;YAClB,gBAAgB;YAChB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACrB,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACxD,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC;QACzB,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,MAAM,CAAC,OAAO,GAAG,IAAI,CAAC;QAC1B,CAAC;QACD,MAAM,CAAC,IAAI,CAAC;IAChB,CAAC;IAED;;MAEE;IACM,6BAAU,GAAlB,UAAmB,OAAU;QACzB,MAAM,CAAC;YACH,OAAO,EAAE,OAAO;YAChB,MAAM,EAAE,IAAI;YACZ,OAAO,EAAE,IAAI;YACb,MAAM,EAAE,IAAI;SACf,CAAC;IACN,CAAC;IAEL,eAAC;AAAD,CAAC,AAjbD,IAibC"} \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/Bag.d.ts b/node_modules/typescript-collections/dist/lib/Bag.d.ts new file mode 100644 index 00000000..9229dcee --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/Bag.d.ts @@ -0,0 +1,91 @@ +import * as util from './util'; +import Set from './Set'; +export default class Bag { + private toStrF; + private dictionary; + private nElements; + /** + * Creates an empty bag. + * @class

A bag is a special kind of set in which members are + * allowed to appear more than once.

+ *

If the inserted elements are custom objects a function + * which converts elements to unique strings must be provided. Example:

+ * + * 
+     * function petToString(pet) {
+     *  return pet.name;
+     * }
+     *
+ * + * @constructor + * @param {function(Object):string=} toStrFunction optional function used + * to convert elements to strings. If the elements aren't strings or if toString() + * is not appropriate, a custom function which receives an object and returns a + * unique string must be provided. + */ + constructor(toStrFunction?: (item: T) => string); + /** + * Adds nCopies of the specified object to this bag. + * @param {Object} element element to add. + * @param {number=} nCopies the number of copies to add, if this argument is + * undefined 1 copy is added. + * @return {boolean} true unless element is undefined. + */ + add(element: T, nCopies?: number): boolean; + /** + * Counts the number of copies of the specified object in this bag. + * @param {Object} element the object to search for.. + * @return {number} the number of copies of the object, 0 if not found + */ + count(element: T): number; + /** + * Returns true if this bag contains the specified element. + * @param {Object} element element to search for. + * @return {boolean} true if this bag contains the specified element, + * false otherwise. + */ + contains(element: T): boolean; + /** + * Removes nCopies of the specified object to this bag. + * If the number of copies to remove is greater than the actual number + * of copies in the Bag, all copies are removed. + * @param {Object} element element to remove. + * @param {number=} nCopies the number of copies to remove, if this argument is + * undefined 1 copy is removed. + * @return {boolean} true if at least 1 element was removed. + */ + remove(element: T, nCopies?: number): boolean; + /** + * Returns an array containing all of the elements in this big in arbitrary order, + * including multiple copies. + * @return {Array} an array containing all of the elements in this bag. + */ + toArray(): T[]; + /** + * Returns a set of unique elements in this bag. + * @return {collections.Set} a set of unique elements in this bag. + */ + toSet(): Set; + /** + * Executes the provided function once for each element + * present in this bag, including multiple copies. + * @param {function(Object):*} callback function to execute, it is + * invoked with one argument: the element. To break the iteration you can + * optionally return false. + */ + forEach(callback: util.ILoopFunction): void; + /** + * Returns the number of elements in this bag. + * @return {number} the number of elements in this bag. + */ + size(): number; + /** + * Returns true if this bag contains no elements. + * @return {boolean} true if this bag contains no elements. + */ + isEmpty(): boolean; + /** + * Removes all of the elements from this bag. + */ + clear(): void; +} diff --git a/node_modules/typescript-collections/dist/lib/Bag.js b/node_modules/typescript-collections/dist/lib/Bag.js new file mode 100644 index 00000000..d66b2793 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/Bag.js @@ -0,0 +1,185 @@ +"use strict"; +Object.defineProperty(exports, "__esModule", { value: true }); +var util = require("./util"); +var Dictionary_1 = require("./Dictionary"); +var Set_1 = require("./Set"); +var Bag = /** @class */ (function () { + /** + * Creates an empty bag. + * @class

A bag is a special kind of set in which members are + * allowed to appear more than once.

+ *

If the inserted elements are custom objects a function + * which converts elements to unique strings must be provided. Example:

+ * + * 
+     * function petToString(pet) {
+     *  return pet.name;
+     * }
+     *
+ * + * @constructor + * @param {function(Object):string=} toStrFunction optional function used + * to convert elements to strings. If the elements aren't strings or if toString() + * is not appropriate, a custom function which receives an object and returns a + * unique string must be provided. + */ + function Bag(toStrFunction) { + this.toStrF = toStrFunction || util.defaultToString; + this.dictionary = new Dictionary_1.default(this.toStrF); + this.nElements = 0; + } + /** + * Adds nCopies of the specified object to this bag. + * @param {Object} element element to add. + * @param {number=} nCopies the number of copies to add, if this argument is + * undefined 1 copy is added. + * @return {boolean} true unless element is undefined. + */ + Bag.prototype.add = function (element, nCopies) { + if (nCopies === void 0) { nCopies = 1; } + if (util.isUndefined(element) || nCopies <= 0) { + return false; + } + if (!this.contains(element)) { + var node = { + value: element, + copies: nCopies + }; + this.dictionary.setValue(element, node); + } + else { + this.dictionary.getValue(element).copies += nCopies; + } + this.nElements += nCopies; + return true; + }; + /** + * Counts the number of copies of the specified object in this bag. + * @param {Object} element the object to search for.. + * @return {number} the number of copies of the object, 0 if not found + */ + Bag.prototype.count = function (element) { + if (!this.contains(element)) { + return 0; + } + else { + return this.dictionary.getValue(element).copies; + } + }; + /** + * Returns true if this bag contains the specified element. + * @param {Object} element element to search for. + * @return {boolean} true if this bag contains the specified element, + * false otherwise. + */ + Bag.prototype.contains = function (element) { + return this.dictionary.containsKey(element); + }; + /** + * Removes nCopies of the specified object to this bag. + * If the number of copies to remove is greater than the actual number + * of copies in the Bag, all copies are removed. + * @param {Object} element element to remove. + * @param {number=} nCopies the number of copies to remove, if this argument is + * undefined 1 copy is removed. + * @return {boolean} true if at least 1 element was removed. + */ + Bag.prototype.remove = function (element, nCopies) { + if (nCopies === void 0) { nCopies = 1; } + if (util.isUndefined(element) || nCopies <= 0) { + return false; + } + if (!this.contains(element)) { + return false; + } + else { + var node = this.dictionary.getValue(element); + if (nCopies > node.copies) { + this.nElements -= node.copies; + } + else { + this.nElements -= nCopies; + } + node.copies -= nCopies; + if (node.copies <= 0) { + this.dictionary.remove(element); + } + return true; + } + }; + /** + * Returns an array containing all of the elements in this big in arbitrary order, + * including multiple copies. + * @return {Array} an array containing all of the elements in this bag. + */ + Bag.prototype.toArray = function () { + var a = []; + var values = this.dictionary.values(); + for (var _i = 0, values_1 = values; _i < values_1.length; _i++) { + var node = values_1[_i]; + var element = node.value; + var copies = node.copies; + for (var j = 0; j < copies; j++) { + a.push(element); + } + } + return a; + }; + /** + * Returns a set of unique elements in this bag. + * @return {collections.Set} a set of unique elements in this bag. + */ + Bag.prototype.toSet = function () { + var toret = new Set_1.default(this.toStrF); + var elements = this.dictionary.values(); + for (var _i = 0, elements_1 = elements; _i < elements_1.length; _i++) { + var ele = elements_1[_i]; + var value = ele.value; + toret.add(value); + } + return toret; + }; + /** + * Executes the provided function once for each element + * present in this bag, including multiple copies. + * @param {function(Object):*} callback function to execute, it is + * invoked with one argument: the element. To break the iteration you can + * optionally return false. + */ + Bag.prototype.forEach = function (callback) { + this.dictionary.forEach(function (k, v) { + var value = v.value; + var copies = v.copies; + for (var i = 0; i < copies; i++) { + if (callback(value) === false) { + return false; + } + } + return true; + }); + }; + /** + * Returns the number of elements in this bag. + * @return {number} the number of elements in this bag. + */ + Bag.prototype.size = function () { + return this.nElements; + }; + /** + * Returns true if this bag contains no elements. + * @return {boolean} true if this bag contains no elements. + */ + Bag.prototype.isEmpty = function () { + return this.nElements === 0; + }; + /** + * Removes all of the elements from this bag. + */ + Bag.prototype.clear = function () { + this.nElements = 0; + this.dictionary.clear(); + }; + return Bag; +}()); // End of bag +exports.default = Bag; +//# sourceMappingURL=Bag.js.map \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/Bag.js.map b/node_modules/typescript-collections/dist/lib/Bag.js.map new file mode 100644 index 00000000..8fb255d7 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/Bag.js.map @@ -0,0 +1 @@ +{"version":3,"file":"Bag.js","sourceRoot":"","sources":["../../src/lib/Bag.ts"],"names":[],"mappings":";;AAAA,6BAA+B;AAC/B,2CAAsC;AACtC,6BAAwB;AAExB;IAMI;;;;;;;;;;;;;;;;;;OAkBG;IACH,aAAY,aAAmC;QAC3C,IAAI,CAAC,MAAM,GAAG,aAAa,IAAI,IAAI,CAAC,eAAe,CAAC;QACpD,IAAI,CAAC,UAAU,GAAG,IAAI,oBAAU,CAAS,IAAI,CAAC,MAAM,CAAC,CAAC;QACtD,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACvB,CAAC;IAGD;;;;;;MAME;IACF,iBAAG,GAAH,UAAI,OAAU,EAAE,OAAmB;QAAnB,wBAAA,EAAA,WAAmB;QAE/B,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,IAAI,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;QAED,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAM,IAAI,GAAG;gBACT,KAAK,EAAE,OAAO;gBACd,MAAM,EAAE,OAAO;aAClB,CAAC;YACF,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAC5C,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,MAAM,IAAI,OAAO,CAAC;QACxD,CAAC;QACD,IAAI,CAAC,SAAS,IAAI,OAAO,CAAC;QAC1B,MAAM,CAAC,IAAI,CAAC;IAChB,CAAC;IAED;;;;MAIE;IACF,mBAAK,GAAL,UAAM,OAAU;QAEZ,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,CAAC,CAAC,CAAC;QACb,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;QACpD,CAAC;IACL,CAAC;IAED;;;;;OAKG;IACH,sBAAQ,GAAR,UAAS,OAAU;QACf,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;IAChD,CAAC;IAED;;;;;;;;MAQE;IACF,oBAAM,GAAN,UAAO,OAAU,EAAE,OAAmB;QAAnB,wBAAA,EAAA,WAAmB;QAElC,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,IAAI,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;QAED,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,IAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;YAC/C,EAAE,CAAC,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;gBACxB,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC;YAClC,CAAC;YAAC,IAAI,CAAC,CAAC;gBACJ,IAAI,CAAC,SAAS,IAAI,OAAO,CAAC;YAC9B,CAAC;YACD,IAAI,CAAC,MAAM,IAAI,OAAO,CAAC;YACvB,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC;gBACnB,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACpC,CAAC;YACD,MAAM,CAAC,IAAI,CAAC;QAChB,CAAC;IACL,CAAC;IAED;;;;OAIG;IACH,qBAAO,GAAP;QACI,IAAM,CAAC,GAAa,EAAE,CAAC;QACvB,IAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;QACxC,GAAG,CAAC,CAAe,UAAM,EAAN,iBAAM,EAAN,oBAAM,EAAN,IAAM;YAApB,IAAM,IAAI,eAAA;YACX,IAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC;YAC3B,IAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;YAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACpB,CAAC;SACJ;QACD,MAAM,CAAC,CAAC,CAAC;IACb,CAAC;IAED;;;OAGG;IACH,mBAAK,GAAL;QACI,IAAM,KAAK,GAAG,IAAI,aAAG,CAAI,IAAI,CAAC,MAAM,CAAC,CAAC;QACtC,IAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;QAC1C,GAAG,CAAC,CAAc,UAAQ,EAAR,qBAAQ,EAAR,sBAAQ,EAAR,IAAQ;YAArB,IAAM,GAAG,iBAAA;YACV,IAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;YACxB,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;SACpB;QACD,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IAED;;;;;;OAMG;IACH,qBAAO,GAAP,UAAQ,QAA+B;QACnC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,UAAS,CAAC,EAAE,CAAC;YACjC,IAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;YACtB,IAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;YACxB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,EAAE,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC;oBAC5B,MAAM,CAAC,KAAK,CAAC;gBACjB,CAAC;YACL,CAAC;YACD,MAAM,CAAC,IAAI,CAAC;QAChB,CAAC,CAAC,CAAC;IACP,CAAC;IACD;;;OAGG;IACH,kBAAI,GAAJ;QACI,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACH,qBAAO,GAAP;QACI,MAAM,CAAC,IAAI,CAAC,SAAS,KAAK,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,mBAAK,GAAL;QACI,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACnB,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;IAC5B,CAAC;IAEL,UAAC;AAAD,CAAC,AA7LD,IA6LC,CAAA,aAAa"} \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/Dictionary.d.ts b/node_modules/typescript-collections/dist/lib/Dictionary.d.ts new file mode 100644 index 00000000..10e9144e --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/Dictionary.d.ts @@ -0,0 +1,114 @@ +export interface IDictionaryPair { + key: K; + value: V; +} +export default class Dictionary { + /** + * Object holding the key-value pairs. + * @type {Object} + * @private + */ + protected table: { + [key: string]: IDictionaryPair; + }; + /** + * Number of elements in the list. + * @type {number} + * @private + */ + protected nElements: number; + /** + * Function used to convert keys to strings. + * @type {function(Object):string} + * @protected + */ + protected toStr: (key: K) => string; + /** + * Creates an empty dictionary. + * @class

Dictionaries map keys to values; each key can map to at most one value. + * This implementation accepts any kind of objects as keys.

+ * + *

If the keys are custom objects a function which converts keys to unique + * strings must be provided. Example:

+ * 
+     * function petToString(pet) {
+     *  return pet.name;
+     * }
+     *
+ * @constructor + * @param {function(Object):string=} toStrFunction optional function used + * to convert keys to strings. If the keys aren't strings or if toString() + * is not appropriate, a custom function which receives a key and returns a + * unique string must be provided. + */ + constructor(toStrFunction?: (key: K) => string); + /** + * Returns the value to which this dictionary maps the specified key. + * Returns undefined if this dictionary contains no mapping for this key. + * @param {Object} key key whose associated value is to be returned. + * @return {*} the value to which this dictionary maps the specified key or + * undefined if the map contains no mapping for this key. + */ + getValue(key: K): V | undefined; + /** + * Associates the specified value with the specified key in this dictionary. + * If the dictionary previously contained a mapping for this key, the old + * value is replaced by the specified value. + * @param {Object} key key with which the specified value is to be + * associated. + * @param {Object} value value to be associated with the specified key. + * @return {*} previous value associated with the specified key, or undefined if + * there was no mapping for the key or if the key/value are undefined. + */ + setValue(key: K, value: V): V | undefined; + /** + * Removes the mapping for this key from this dictionary if it is present. + * @param {Object} key key whose mapping is to be removed from the + * dictionary. + * @return {*} previous value associated with specified key, or undefined if + * there was no mapping for key. + */ + remove(key: K): V | undefined; + /** + * Returns an array containing all of the keys in this dictionary. + * @return {Array} an array containing all of the keys in this dictionary. + */ + keys(): K[]; + /** + * Returns an array containing all of the values in this dictionary. + * @return {Array} an array containing all of the values in this dictionary. + */ + values(): V[]; + /** + * Executes the provided function once for each key-value pair + * present in this dictionary. + * @param {function(Object,Object):*} callback function to execute, it is + * invoked with two arguments: key and value. To break the iteration you can + * optionally return false. + */ + forEach(callback: (key: K, value: V) => any): void; + /** + * Returns true if this dictionary contains a mapping for the specified key. + * @param {Object} key key whose presence in this dictionary is to be + * tested. + * @return {boolean} true if this dictionary contains a mapping for the + * specified key. + */ + containsKey(key: K): boolean; + /** + * Removes all mappings from this dictionary. + * @this {collections.Dictionary} + */ + clear(): void; + /** + * Returns the number of keys in this dictionary. + * @return {number} the number of key-value mappings in this dictionary. + */ + size(): number; + /** + * Returns true if this dictionary contains no mappings. + * @return {boolean} true if this dictionary contains no mappings. + */ + isEmpty(): boolean; + toString(): string; +} diff --git a/node_modules/typescript-collections/dist/lib/Dictionary.js b/node_modules/typescript-collections/dist/lib/Dictionary.js new file mode 100644 index 00000000..9e4af987 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/Dictionary.js @@ -0,0 +1,177 @@ +"use strict"; +Object.defineProperty(exports, "__esModule", { value: true }); +var util = require("./util"); +var Dictionary = /** @class */ (function () { + /** + * Creates an empty dictionary. + * @class

Dictionaries map keys to values; each key can map to at most one value. + * This implementation accepts any kind of objects as keys.

+ * + *

If the keys are custom objects a function which converts keys to unique + * strings must be provided. Example:

+ * 
+     * function petToString(pet) {
+     *  return pet.name;
+     * }
+     *
+ * @constructor + * @param {function(Object):string=} toStrFunction optional function used + * to convert keys to strings. If the keys aren't strings or if toString() + * is not appropriate, a custom function which receives a key and returns a + * unique string must be provided. + */ + function Dictionary(toStrFunction) { + this.table = {}; + this.nElements = 0; + this.toStr = toStrFunction || util.defaultToString; + } + /** + * Returns the value to which this dictionary maps the specified key. + * Returns undefined if this dictionary contains no mapping for this key. + * @param {Object} key key whose associated value is to be returned. + * @return {*} the value to which this dictionary maps the specified key or + * undefined if the map contains no mapping for this key. + */ + Dictionary.prototype.getValue = function (key) { + var pair = this.table['$' + this.toStr(key)]; + if (util.isUndefined(pair)) { + return undefined; + } + return pair.value; + }; + /** + * Associates the specified value with the specified key in this dictionary. + * If the dictionary previously contained a mapping for this key, the old + * value is replaced by the specified value. + * @param {Object} key key with which the specified value is to be + * associated. + * @param {Object} value value to be associated with the specified key. + * @return {*} previous value associated with the specified key, or undefined if + * there was no mapping for the key or if the key/value are undefined. + */ + Dictionary.prototype.setValue = function (key, value) { + if (util.isUndefined(key) || util.isUndefined(value)) { + return undefined; + } + var ret; + var k = '$' + this.toStr(key); + var previousElement = this.table[k]; + if (util.isUndefined(previousElement)) { + this.nElements++; + ret = undefined; + } + else { + ret = previousElement.value; + } + this.table[k] = { + key: key, + value: value + }; + return ret; + }; + /** + * Removes the mapping for this key from this dictionary if it is present. + * @param {Object} key key whose mapping is to be removed from the + * dictionary. + * @return {*} previous value associated with specified key, or undefined if + * there was no mapping for key. + */ + Dictionary.prototype.remove = function (key) { + var k = '$' + this.toStr(key); + var previousElement = this.table[k]; + if (!util.isUndefined(previousElement)) { + delete this.table[k]; + this.nElements--; + return previousElement.value; + } + return undefined; + }; + /** + * Returns an array containing all of the keys in this dictionary. + * @return {Array} an array containing all of the keys in this dictionary. + */ + Dictionary.prototype.keys = function () { + var array = []; + for (var name_1 in this.table) { + if (util.has(this.table, name_1)) { + var pair = this.table[name_1]; + array.push(pair.key); + } + } + return array; + }; + /** + * Returns an array containing all of the values in this dictionary. + * @return {Array} an array containing all of the values in this dictionary. + */ + Dictionary.prototype.values = function () { + var array = []; + for (var name_2 in this.table) { + if (util.has(this.table, name_2)) { + var pair = this.table[name_2]; + array.push(pair.value); + } + } + return array; + }; + /** + * Executes the provided function once for each key-value pair + * present in this dictionary. + * @param {function(Object,Object):*} callback function to execute, it is + * invoked with two arguments: key and value. To break the iteration you can + * optionally return false. + */ + Dictionary.prototype.forEach = function (callback) { + for (var name_3 in this.table) { + if (util.has(this.table, name_3)) { + var pair = this.table[name_3]; + var ret = callback(pair.key, pair.value); + if (ret === false) { + return; + } + } + } + }; + /** + * Returns true if this dictionary contains a mapping for the specified key. + * @param {Object} key key whose presence in this dictionary is to be + * tested. + * @return {boolean} true if this dictionary contains a mapping for the + * specified key. + */ + Dictionary.prototype.containsKey = function (key) { + return !util.isUndefined(this.getValue(key)); + }; + /** + * Removes all mappings from this dictionary. + * @this {collections.Dictionary} + */ + Dictionary.prototype.clear = function () { + this.table = {}; + this.nElements = 0; + }; + /** + * Returns the number of keys in this dictionary. + * @return {number} the number of key-value mappings in this dictionary. + */ + Dictionary.prototype.size = function () { + return this.nElements; + }; + /** + * Returns true if this dictionary contains no mappings. + * @return {boolean} true if this dictionary contains no mappings. + */ + Dictionary.prototype.isEmpty = function () { + return this.nElements <= 0; + }; + Dictionary.prototype.toString = function () { + var toret = '{'; + this.forEach(function (k, v) { + toret += "\n\t" + k + " : " + v; + }); + return toret + '\n}'; + }; + return Dictionary; +}()); // End of dictionary +exports.default = Dictionary; +//# sourceMappingURL=Dictionary.js.map \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/Dictionary.js.map b/node_modules/typescript-collections/dist/lib/Dictionary.js.map new file mode 100644 index 00000000..900fa90d --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/Dictionary.js.map @@ -0,0 +1 @@ +{"version":3,"file":"Dictionary.js","sourceRoot":"","sources":["../../src/lib/Dictionary.ts"],"names":[],"mappings":";;AAAA,6BAA+B;AAS/B;IAyBI;;;;;;;;;;;;;;;;;OAiBG;IACH,oBAAY,aAAkC;QAC1C,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QAChB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,aAAa,IAAI,IAAI,CAAC,eAAe,CAAC;IACvD,CAAC;IAGD;;;;;;OAMG;IACH,6BAAQ,GAAR,UAAS,GAAM;QACX,IAAM,IAAI,GAA0B,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;QACtE,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACzB,MAAM,CAAC,SAAS,CAAC;QACrB,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;IACtB,CAAC;IAGD;;;;;;;;;OASG;IACH,6BAAQ,GAAR,UAAS,GAAM,EAAE,KAAQ;QAErB,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACnD,MAAM,CAAC,SAAS,CAAC;QACrB,CAAC;QAED,IAAI,GAAkB,CAAC;QACvB,IAAM,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAChC,IAAM,eAAe,GAA0B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7D,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;YACpC,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,GAAG,GAAG,SAAS,CAAC;QACpB,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,GAAG,GAAG,eAAe,CAAC,KAAK,CAAC;QAChC,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG;YACZ,GAAG,EAAE,GAAG;YACR,KAAK,EAAE,KAAK;SACf,CAAC;QACF,MAAM,CAAC,GAAG,CAAC;IACf,CAAC;IAED;;;;;;OAMG;IACH,2BAAM,GAAN,UAAO,GAAM;QACT,IAAM,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAChC,IAAM,eAAe,GAA0B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7D,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;YACrC,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACrB,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,MAAM,CAAC,eAAe,CAAC,KAAK,CAAC;QACjC,CAAC;QACD,MAAM,CAAC,SAAS,CAAC;IACrB,CAAC;IAED;;;OAGG;IACH,yBAAI,GAAJ;QACI,IAAM,KAAK,GAAQ,EAAE,CAAC;QACtB,GAAG,CAAC,CAAC,IAAM,MAAI,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC5B,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,MAAI,CAAC,CAAC,CAAC,CAAC;gBAC7B,IAAM,IAAI,GAA0B,IAAI,CAAC,KAAK,CAAC,MAAI,CAAC,CAAC;gBACrD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACzB,CAAC;QACL,CAAC;QACD,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,2BAAM,GAAN;QACI,IAAM,KAAK,GAAQ,EAAE,CAAC;QACtB,GAAG,CAAC,CAAC,IAAM,MAAI,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC5B,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,MAAI,CAAC,CAAC,CAAC,CAAC;gBAC7B,IAAM,IAAI,GAA0B,IAAI,CAAC,KAAK,CAAC,MAAI,CAAC,CAAC;gBACrD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3B,CAAC;QACL,CAAC;QACD,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IAED;;;;;;MAME;IACF,4BAAO,GAAP,UAAQ,QAAmC;QACvC,GAAG,CAAC,CAAC,IAAM,MAAI,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC5B,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,MAAI,CAAC,CAAC,CAAC,CAAC;gBAC7B,IAAM,IAAI,GAA0B,IAAI,CAAC,KAAK,CAAC,MAAI,CAAC,CAAC;gBACrD,IAAM,GAAG,GAAG,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC3C,EAAE,CAAC,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC;oBAChB,MAAM,CAAC;gBACX,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED;;;;;;OAMG;IACH,gCAAW,GAAX,UAAY,GAAM;QACd,MAAM,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;IACjD,CAAC;IAED;;;MAGE;IACF,0BAAK,GAAL;QACI,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QAChB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACvB,CAAC;IAED;;;OAGG;IACH,yBAAI,GAAJ;QACI,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACH,4BAAO,GAAP;QACI,MAAM,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,CAAC;IAC/B,CAAC;IAED,6BAAQ,GAAR;QACI,IAAI,KAAK,GAAG,GAAG,CAAC;QAChB,IAAI,CAAC,OAAO,CAAC,UAAC,CAAC,EAAE,CAAC;YACd,KAAK,IAAI,SAAO,CAAC,WAAM,CAAG,CAAC;QAC/B,CAAC,CAAC,CAAC;QACH,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC;IACzB,CAAC;IACL,iBAAC;AAAD,CAAC,AAhND,IAgNC,CAAC,oBAAoB"} \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/FactoryDictionary.d.ts b/node_modules/typescript-collections/dist/lib/FactoryDictionary.d.ts new file mode 100644 index 00000000..9ddeac20 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/FactoryDictionary.d.ts @@ -0,0 +1,58 @@ +import Dictionary from './Dictionary'; +export default class FactoryDictionary extends Dictionary { + /** + * Factory to create default values. + * @type {function(Object):string} + * @protected + */ + protected defaultFactoryFunction: () => V; + /** + * Creates an empty dictionary. + * @class

Dictionaries map keys to values; each key can map to at most one value. + * This implementation accepts any kind of objects as keys.

+ * + *

The default factory function should return a new object of the provided + * type. Example:

+ * 
+     * function petFactory() {
+     *  return new Pet();
+     * }
+     *
+ * + *

If the keys are custom objects a function which converts keys to unique + * strings must be provided. Example:

+ * 
+     * function petToString(pet) {
+     *  return pet.name;
+     * }
+     *
+ * @constructor + * @param {function():V=} defaultFactoryFunction function used to create a + * default object. + * @param {function(Object):string=} toStrFunction optional function used + * to convert keys to strings. If the keys aren't strings or if toString() + * is not appropriate, a custom function which receives a key and returns a + * unique string must be provided. + */ + constructor(defaultFactoryFunction: () => V, toStrFunction?: (key: K) => string); + /** + * Associates the specified default value with the specified key in this dictionary, + * if it didn't contain the key yet. If the key existed, the existing value will be used. + * @param {Object} key key with which the specified value is to be + * associated. + * @param {Object} defaultValue default value to be associated with the specified key. + * @return {*} previous value associated with the specified key, or the default value, + * if the key didn't exist yet. + */ + setDefault(key: K, defaultValue: V): V; + /** + * Returns the value to which this dictionary maps the specified key. + * Returns a default value created by the factory passed in the constructor, + * if this dictionary contains no mapping for this key. The missing key will + * automatically be added to the dictionary. + * @param {Object} key key whose associated value is to be returned. + * @return {*} the value to which this dictionary maps the specified key or + * a default value if the map contains no mapping for this key. + */ + getValue(key: K): V; +} diff --git a/node_modules/typescript-collections/dist/lib/FactoryDictionary.js b/node_modules/typescript-collections/dist/lib/FactoryDictionary.js new file mode 100644 index 00000000..89d8d614 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/FactoryDictionary.js @@ -0,0 +1,82 @@ +"use strict"; +var __extends = (this && this.__extends) || (function () { + var extendStatics = Object.setPrototypeOf || + ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) || + function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; }; + return function (d, b) { + extendStatics(d, b); + function __() { this.constructor = d; } + d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __()); + }; +})(); +Object.defineProperty(exports, "__esModule", { value: true }); +var Dictionary_1 = require("./Dictionary"); +var util = require("./util"); +var FactoryDictionary = /** @class */ (function (_super) { + __extends(FactoryDictionary, _super); + /** + * Creates an empty dictionary. + * @class

Dictionaries map keys to values; each key can map to at most one value. + * This implementation accepts any kind of objects as keys.

+ * + *

The default factory function should return a new object of the provided + * type. Example:

+ * 
+     * function petFactory() {
+     *  return new Pet();
+     * }
+     *
+ * + *

If the keys are custom objects a function which converts keys to unique + * strings must be provided. Example:

+ * 
+     * function petToString(pet) {
+     *  return pet.name;
+     * }
+     *
+ * @constructor + * @param {function():V=} defaultFactoryFunction function used to create a + * default object. + * @param {function(Object):string=} toStrFunction optional function used + * to convert keys to strings. If the keys aren't strings or if toString() + * is not appropriate, a custom function which receives a key and returns a + * unique string must be provided. + */ + function FactoryDictionary(defaultFactoryFunction, toStrFunction) { + var _this = _super.call(this, toStrFunction) || this; + _this.defaultFactoryFunction = defaultFactoryFunction; + return _this; + } + /** + * Associates the specified default value with the specified key in this dictionary, + * if it didn't contain the key yet. If the key existed, the existing value will be used. + * @param {Object} key key with which the specified value is to be + * associated. + * @param {Object} defaultValue default value to be associated with the specified key. + * @return {*} previous value associated with the specified key, or the default value, + * if the key didn't exist yet. + */ + FactoryDictionary.prototype.setDefault = function (key, defaultValue) { + var currentValue = _super.prototype.getValue.call(this, key); + if (util.isUndefined(currentValue)) { + this.setValue(key, defaultValue); + return defaultValue; + } + return currentValue; + }; + /** + * Returns the value to which this dictionary maps the specified key. + * Returns a default value created by the factory passed in the constructor, + * if this dictionary contains no mapping for this key. The missing key will + * automatically be added to the dictionary. + * @param {Object} key key whose associated value is to be returned. + * @return {*} the value to which this dictionary maps the specified key or + * a default value if the map contains no mapping for this key. + */ + FactoryDictionary.prototype.getValue = function (key) { + return this.setDefault(key, this.defaultFactoryFunction()); + }; + return FactoryDictionary; +}(Dictionary_1.default)); +exports.default = FactoryDictionary; +//# sourceMappingURL=FactoryDictionary.js.map \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/FactoryDictionary.js.map b/node_modules/typescript-collections/dist/lib/FactoryDictionary.js.map new file mode 100644 index 00000000..6589760f --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/FactoryDictionary.js.map @@ -0,0 +1 @@ +{"version":3,"file":"FactoryDictionary.js","sourceRoot":"","sources":["../../src/lib/FactoryDictionary.ts"],"names":[],"mappings":";;;;;;;;;;;;AAAA,2CAAsC;AACtC,6BAA+B;AAE/B;IAAqD,qCAAgB;IASjE;;;;;;;;;;;;;;;;;;;;;;;;;;;OA2BG;IACH,2BAAY,sBAA+B,EAAE,aAAkC;QAA/E,YACI,kBAAM,aAAa,CAAC,SAGvB;QADG,KAAI,CAAC,sBAAsB,GAAG,sBAAsB,CAAC;;IACzD,CAAC;IAGD;;;;;;;;OAQG;IACH,sCAAU,GAAV,UAAW,GAAM,EAAE,YAAe;QAC9B,IAAM,YAAY,GAAkB,iBAAM,QAAQ,YAAC,GAAG,CAAC,CAAC;QAExD,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACjC,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;YAEjC,MAAM,CAAC,YAAY,CAAC;QACxB,CAAC;QAED,MAAM,CAAC,YAAY,CAAC;IACxB,CAAC;IAED;;;;;;;;OAQG;IACH,oCAAQ,GAAR,UAAS,GAAM;QACX,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,sBAAsB,EAAE,CAAC,CAAC;IAC/D,CAAC;IACL,wBAAC;AAAD,CAAC,AA7ED,CAAqD,oBAAU,GA6E9D"} \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/Heap.d.ts b/node_modules/typescript-collections/dist/lib/Heap.d.ts new file mode 100644 index 00000000..7ca7a51b --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/Heap.d.ts @@ -0,0 +1,151 @@ +import * as collections from './util'; +export default class Heap { + /** + * Array used to store the elements of the heap. + * @type {Array.} + * @private + */ + private data; + /** + * Function used to compare elements. + * @type {function(Object,Object):number} + * @private + */ + private compare; + /** + * Creates an empty Heap. + * @class + *

A heap is a binary tree, where the nodes maintain the heap property: + * each node is smaller than each of its children and therefore a MinHeap + * This implementation uses an array to store elements.

+ *

If the inserted elements are custom objects a compare function must be provided, + * at construction time, otherwise the <=, === and >= operators are + * used to compare elements. Example:

+ * + * 
+     * function compare(a, b) {
+     *  if (a is less than b by some ordering criterion) {
+     *     return -1;
+     *  } if (a is greater than b by the ordering criterion) {
+     *     return 1;
+     *  }
+     *  // a must be equal to b
+     *  return 0;
+     * }
+     *
+ * + *

If a Max-Heap is wanted (greater elements on top) you can a provide a + * reverse compare function to accomplish that behavior. Example:

+ * + * 
+     * function reverseCompare(a, b) {
+     *  if (a is less than b by some ordering criterion) {
+     *     return 1;
+     *  } if (a is greater than b by the ordering criterion) {
+     *     return -1;
+     *  }
+     *  // a must be equal to b
+     *  return 0;
+     * }
+     *
+ * + * @constructor + * @param {function(Object,Object):number=} compareFunction optional + * function used to compare two elements. Must return a negative integer, + * zero, or a positive integer as the first argument is less than, equal to, + * or greater than the second. + */ + constructor(compareFunction?: collections.ICompareFunction); + /** + * Returns the index of the left child of the node at the given index. + * @param {number} nodeIndex The index of the node to get the left child + * for. + * @return {number} The index of the left child. + * @private + */ + private leftChildIndex(nodeIndex); + /** + * Returns the index of the right child of the node at the given index. + * @param {number} nodeIndex The index of the node to get the right child + * for. + * @return {number} The index of the right child. + * @private + */ + private rightChildIndex(nodeIndex); + /** + * Returns the index of the parent of the node at the given index. + * @param {number} nodeIndex The index of the node to get the parent for. + * @return {number} The index of the parent. + * @private + */ + private parentIndex(nodeIndex); + /** + * Returns the index of the smaller child node (if it exists). + * @param {number} leftChild left child index. + * @param {number} rightChild right child index. + * @return {number} the index with the minimum value or -1 if it doesn't + * exists. + * @private + */ + private minIndex(leftChild, rightChild); + /** + * Moves the node at the given index up to its proper place in the heap. + * @param {number} index The index of the node to move up. + * @private + */ + private siftUp(index); + /** + * Moves the node at the given index down to its proper place in the heap. + * @param {number} nodeIndex The index of the node to move down. + * @private + */ + private siftDown(nodeIndex); + /** + * Retrieves but does not remove the root element of this heap. + * @return {*} The value at the root of the heap. Returns undefined if the + * heap is empty. + */ + peek(): T | undefined; + /** + * Adds the given element into the heap. + * @param {*} element the element. + * @return true if the element was added or fals if it is undefined. + */ + add(element: T): boolean; + /** + * Retrieves and removes the root element of this heap. + * @return {*} The value removed from the root of the heap. Returns + * undefined if the heap is empty. + */ + removeRoot(): T | undefined; + /** + * Returns true if this heap contains the specified element. + * @param {Object} element element to search for. + * @return {boolean} true if this Heap contains the specified element, false + * otherwise. + */ + contains(element: T): boolean; + /** + * Returns the number of elements in this heap. + * @return {number} the number of elements in this heap. + */ + size(): number; + /** + * Checks if this heap is empty. + * @return {boolean} true if and only if this heap contains no items; false + * otherwise. + */ + isEmpty(): boolean; + /** + * Removes all of the elements from this heap. + */ + clear(): void; + /** + * Executes the provided function once for each element present in this heap in + * no particular order. + * @param {function(Object):*} callback function to execute, it is + * invoked with one argument: the element value, to break the iteration you can + * optionally return false. + */ + forEach(callback: collections.ILoopFunction): void; +} diff --git a/node_modules/typescript-collections/dist/lib/Heap.js b/node_modules/typescript-collections/dist/lib/Heap.js new file mode 100644 index 00000000..539f9fb7 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/Heap.js @@ -0,0 +1,227 @@ +"use strict"; +Object.defineProperty(exports, "__esModule", { value: true }); +var collections = require("./util"); +var arrays = require("./arrays"); +var Heap = /** @class */ (function () { + /** + * Creates an empty Heap. + * @class + *

A heap is a binary tree, where the nodes maintain the heap property: + * each node is smaller than each of its children and therefore a MinHeap + * This implementation uses an array to store elements.

+ *

If the inserted elements are custom objects a compare function must be provided, + * at construction time, otherwise the <=, === and >= operators are + * used to compare elements. Example:

+ * + * 
+     * function compare(a, b) {
+     *  if (a is less than b by some ordering criterion) {
+     *     return -1;
+     *  } if (a is greater than b by the ordering criterion) {
+     *     return 1;
+     *  }
+     *  // a must be equal to b
+     *  return 0;
+     * }
+     *
+ * + *

If a Max-Heap is wanted (greater elements on top) you can a provide a + * reverse compare function to accomplish that behavior. Example:

+ * + * 
+     * function reverseCompare(a, b) {
+     *  if (a is less than b by some ordering criterion) {
+     *     return 1;
+     *  } if (a is greater than b by the ordering criterion) {
+     *     return -1;
+     *  }
+     *  // a must be equal to b
+     *  return 0;
+     * }
+     *
+ * + * @constructor + * @param {function(Object,Object):number=} compareFunction optional + * function used to compare two elements. Must return a negative integer, + * zero, or a positive integer as the first argument is less than, equal to, + * or greater than the second. + */ + function Heap(compareFunction) { + /** + * Array used to store the elements of the heap. + * @type {Array.} + * @private + */ + this.data = []; + this.compare = compareFunction || collections.defaultCompare; + } + /** + * Returns the index of the left child of the node at the given index. + * @param {number} nodeIndex The index of the node to get the left child + * for. + * @return {number} The index of the left child. + * @private + */ + Heap.prototype.leftChildIndex = function (nodeIndex) { + return (2 * nodeIndex) + 1; + }; + /** + * Returns the index of the right child of the node at the given index. + * @param {number} nodeIndex The index of the node to get the right child + * for. + * @return {number} The index of the right child. + * @private + */ + Heap.prototype.rightChildIndex = function (nodeIndex) { + return (2 * nodeIndex) + 2; + }; + /** + * Returns the index of the parent of the node at the given index. + * @param {number} nodeIndex The index of the node to get the parent for. + * @return {number} The index of the parent. + * @private + */ + Heap.prototype.parentIndex = function (nodeIndex) { + return Math.floor((nodeIndex - 1) / 2); + }; + /** + * Returns the index of the smaller child node (if it exists). + * @param {number} leftChild left child index. + * @param {number} rightChild right child index. + * @return {number} the index with the minimum value or -1 if it doesn't + * exists. + * @private + */ + Heap.prototype.minIndex = function (leftChild, rightChild) { + if (rightChild >= this.data.length) { + if (leftChild >= this.data.length) { + return -1; + } + else { + return leftChild; + } + } + else { + if (this.compare(this.data[leftChild], this.data[rightChild]) <= 0) { + return leftChild; + } + else { + return rightChild; + } + } + }; + /** + * Moves the node at the given index up to its proper place in the heap. + * @param {number} index The index of the node to move up. + * @private + */ + Heap.prototype.siftUp = function (index) { + var parent = this.parentIndex(index); + while (index > 0 && this.compare(this.data[parent], this.data[index]) > 0) { + arrays.swap(this.data, parent, index); + index = parent; + parent = this.parentIndex(index); + } + }; + /** + * Moves the node at the given index down to its proper place in the heap. + * @param {number} nodeIndex The index of the node to move down. + * @private + */ + Heap.prototype.siftDown = function (nodeIndex) { + //smaller child index + var min = this.minIndex(this.leftChildIndex(nodeIndex), this.rightChildIndex(nodeIndex)); + while (min >= 0 && this.compare(this.data[nodeIndex], this.data[min]) > 0) { + arrays.swap(this.data, min, nodeIndex); + nodeIndex = min; + min = this.minIndex(this.leftChildIndex(nodeIndex), this.rightChildIndex(nodeIndex)); + } + }; + /** + * Retrieves but does not remove the root element of this heap. + * @return {*} The value at the root of the heap. Returns undefined if the + * heap is empty. + */ + Heap.prototype.peek = function () { + if (this.data.length > 0) { + return this.data[0]; + } + else { + return undefined; + } + }; + /** + * Adds the given element into the heap. + * @param {*} element the element. + * @return true if the element was added or fals if it is undefined. + */ + Heap.prototype.add = function (element) { + if (collections.isUndefined(element)) { + return false; + } + this.data.push(element); + this.siftUp(this.data.length - 1); + return true; + }; + /** + * Retrieves and removes the root element of this heap. + * @return {*} The value removed from the root of the heap. Returns + * undefined if the heap is empty. + */ + Heap.prototype.removeRoot = function () { + if (this.data.length > 0) { + var obj = this.data[0]; + this.data[0] = this.data[this.data.length - 1]; + this.data.splice(this.data.length - 1, 1); + if (this.data.length > 0) { + this.siftDown(0); + } + return obj; + } + return undefined; + }; + /** + * Returns true if this heap contains the specified element. + * @param {Object} element element to search for. + * @return {boolean} true if this Heap contains the specified element, false + * otherwise. + */ + Heap.prototype.contains = function (element) { + var equF = collections.compareToEquals(this.compare); + return arrays.contains(this.data, element, equF); + }; + /** + * Returns the number of elements in this heap. + * @return {number} the number of elements in this heap. + */ + Heap.prototype.size = function () { + return this.data.length; + }; + /** + * Checks if this heap is empty. + * @return {boolean} true if and only if this heap contains no items; false + * otherwise. + */ + Heap.prototype.isEmpty = function () { + return this.data.length <= 0; + }; + /** + * Removes all of the elements from this heap. + */ + Heap.prototype.clear = function () { + this.data.length = 0; + }; + /** + * Executes the provided function once for each element present in this heap in + * no particular order. + * @param {function(Object):*} callback function to execute, it is + * invoked with one argument: the element value, to break the iteration you can + * optionally return false. + */ + Heap.prototype.forEach = function (callback) { + arrays.forEach(this.data, callback); + }; + return Heap; +}()); +exports.default = Heap; +//# sourceMappingURL=Heap.js.map \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/Heap.js.map b/node_modules/typescript-collections/dist/lib/Heap.js.map new file mode 100644 index 00000000..b12395d0 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/Heap.js.map @@ -0,0 +1 @@ +{"version":3,"file":"Heap.js","sourceRoot":"","sources":["../../src/lib/Heap.ts"],"names":[],"mappings":";;AAAA,oCAAsC;AACtC,iCAAmC;AAEnC;IAaI;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA0CG;IACH,cAAY,eAAiD;QAvD7D;;;;WAIG;QACK,SAAI,GAAQ,EAAE,CAAC;QAmDnB,IAAI,CAAC,OAAO,GAAG,eAAe,IAAI,WAAW,CAAC,cAAc,CAAC;IACjE,CAAC;IAED;;;;;;OAMG;IACK,6BAAc,GAAtB,UAAuB,SAAiB;QACpC,MAAM,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC;IACD;;;;;;OAMG;IACK,8BAAe,GAAvB,UAAwB,SAAiB;QACrC,MAAM,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC;IACD;;;;;OAKG;IACK,0BAAW,GAAnB,UAAoB,SAAiB;QACjC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC3C,CAAC;IACD;;;;;;;OAOG;IACK,uBAAQ,GAAhB,UAAiB,SAAiB,EAAE,UAAkB;QAElD,EAAE,CAAC,CAAC,UAAU,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;YACjC,EAAE,CAAC,CAAC,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;gBAChC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,CAAC;YAAC,IAAI,CAAC,CAAC;gBACJ,MAAM,CAAC,SAAS,CAAC;YACrB,CAAC;QACL,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACjE,MAAM,CAAC,SAAS,CAAC;YACrB,CAAC;YAAC,IAAI,CAAC,CAAC;gBACJ,MAAM,CAAC,UAAU,CAAC;YACtB,CAAC;QACL,CAAC;IACL,CAAC;IACD;;;;OAIG;IACK,qBAAM,GAAd,UAAe,KAAa;QAExB,IAAI,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QACrC,OAAO,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;YACxE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;YACtC,KAAK,GAAG,MAAM,CAAC;YACf,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QACrC,CAAC;IACL,CAAC;IACD;;;;OAIG;IACK,uBAAQ,GAAhB,UAAiB,SAAiB;QAE9B,qBAAqB;QACrB,IAAI,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,EAClD,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC,CAAC;QAErC,OAAO,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,EAChD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;YACvC,SAAS,GAAG,GAAG,CAAC;YAChB,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,EAC9C,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC,CAAC;QACzC,CAAC;IACL,CAAC;IACD;;;;OAIG;IACH,mBAAI,GAAJ;QAEI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,MAAM,CAAC,SAAS,CAAC;QACrB,CAAC;IACL,CAAC;IACD;;;;OAIG;IACH,kBAAG,GAAH,UAAI,OAAU;QACV,EAAE,CAAC,CAAC,WAAW,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACxB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAClC,MAAM,CAAC,IAAI,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACH,yBAAU,GAAV;QAEI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;YACvB,IAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC/C,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;gBACvB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACrB,CAAC;YACD,MAAM,CAAC,GAAG,CAAC;QACf,CAAC;QACD,MAAM,CAAC,SAAS,CAAC;IACrB,CAAC;IACD;;;;;OAKG;IACH,uBAAQ,GAAR,UAAS,OAAU;QACf,IAAM,IAAI,GAAG,WAAW,CAAC,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACvD,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;IACrD,CAAC;IACD;;;OAGG;IACH,mBAAI,GAAJ;QACI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IAC5B,CAAC;IACD;;;;OAIG;IACH,sBAAO,GAAP;QACI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;IACjC,CAAC;IACD;;OAEG;IACH,oBAAK,GAAL;QACI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IACzB,CAAC;IAED;;;;;;OAMG;IACH,sBAAO,GAAP,UAAQ,QAAsC;QAC1C,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IACxC,CAAC;IACL,WAAC;AAAD,CAAC,AAzOD,IAyOC"} \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/LinkedDictionary.d.ts b/node_modules/typescript-collections/dist/lib/LinkedDictionary.d.ts new file mode 100644 index 00000000..799e2349 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/LinkedDictionary.d.ts @@ -0,0 +1,81 @@ +import { default as Dictionary } from './Dictionary'; +export default class LinkedDictionary extends Dictionary { + private head; + private tail; + constructor(toStrFunction?: (key: K) => string); + /** + * Inserts the new node to the 'tail' of the list, updating the + * neighbors, and moving 'this.tail' (the End of List indicator) that + * to the end. + */ + private appendToTail(entry); + /** + * Retrieves a linked dictionary from the table internally + */ + private getLinkedDictionaryPair(key); + /** + * Returns the value to which this dictionary maps the specified key. + * Returns undefined if this dictionary contains no mapping for this key. + * @param {Object} key key whose associated value is to be returned. + * @return {*} the value to which this dictionary maps the specified key or + * undefined if the map contains no mapping for this key. + */ + getValue(key: K): V | undefined; + /** + * Removes the mapping for this key from this dictionary if it is present. + * Also, if a value is present for this key, the entry is removed from the + * insertion ordering. + * @param {Object} key key whose mapping is to be removed from the + * dictionary. + * @return {*} previous value associated with specified key, or undefined if + * there was no mapping for key. + */ + remove(key: K): V | undefined; + /** + * Removes all mappings from this LinkedDictionary. + * @this {collections.LinkedDictionary} + */ + clear(): void; + /** + * Internal function used when updating an existing KeyValue pair. + * It places the new value indexed by key into the table, but maintains + * its place in the linked ordering. + */ + private replace(oldPair, newPair); + /** + * Associates the specified value with the specified key in this dictionary. + * If the dictionary previously contained a mapping for this key, the old + * value is replaced by the specified value. + * Updating of a key that already exists maintains its place in the + * insertion order into the map. + * @param {Object} key key with which the specified value is to be + * associated. + * @param {Object} value value to be associated with the specified key. + * @return {*} previous value associated with the specified key, or undefined if + * there was no mapping for the key or if the key/value are undefined. + */ + setValue(key: K, value: V): V | undefined; + /** + * Returns an array containing all of the keys in this LinkedDictionary, ordered + * by insertion order. + * @return {Array} an array containing all of the keys in this LinkedDictionary, + * ordered by insertion order. + */ + keys(): K[]; + /** + * Returns an array containing all of the values in this LinkedDictionary, ordered by + * insertion order. + * @return {Array} an array containing all of the values in this LinkedDictionary, + * ordered by insertion order. + */ + values(): V[]; + /** + * Executes the provided function once for each key-value pair + * present in this LinkedDictionary. It is done in the order of insertion + * into the LinkedDictionary + * @param {function(Object,Object):*} callback function to execute, it is + * invoked with two arguments: key and value. To break the iteration you can + * optionally return false. + */ + forEach(callback: (key: K, value: V) => any): void; +} diff --git a/node_modules/typescript-collections/dist/lib/LinkedDictionary.js b/node_modules/typescript-collections/dist/lib/LinkedDictionary.js new file mode 100644 index 00000000..ddcb6a28 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/LinkedDictionary.js @@ -0,0 +1,242 @@ +"use strict"; +var __extends = (this && this.__extends) || (function () { + var extendStatics = Object.setPrototypeOf || + ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) || + function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; }; + return function (d, b) { + extendStatics(d, b); + function __() { this.constructor = d; } + d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __()); + }; +})(); +Object.defineProperty(exports, "__esModule", { value: true }); +var Dictionary_1 = require("./Dictionary"); +var util = require("./util"); +/** + * This class is used by the LinkedDictionary Internally + * Has to be a class, not an interface, because it needs to have + * the 'unlink' function defined. + */ +var LinkedDictionaryPair = /** @class */ (function () { + function LinkedDictionaryPair(key, value) { + this.key = key; + this.value = value; + } + LinkedDictionaryPair.prototype.unlink = function () { + this.prev.next = this.next; + this.next.prev = this.prev; + }; + return LinkedDictionaryPair; +}()); +/** + * The head and tail elements of the list have null key and value properties but they + * usually link to normal nodes. + */ +var HeadOrTailLinkedDictionaryPair = /** @class */ (function () { + function HeadOrTailLinkedDictionaryPair() { + this.key = null; + this.value = null; + } + HeadOrTailLinkedDictionaryPair.prototype.unlink = function () { + this.prev.next = this.next; + this.next.prev = this.prev; + }; + return HeadOrTailLinkedDictionaryPair; +}()); +function isHeadOrTailLinkedDictionaryPair(p) { + return p.next === null; +} +var LinkedDictionary = /** @class */ (function (_super) { + __extends(LinkedDictionary, _super); + function LinkedDictionary(toStrFunction) { + var _this = _super.call(this, toStrFunction) || this; + _this.head = new HeadOrTailLinkedDictionaryPair(); + _this.tail = new HeadOrTailLinkedDictionaryPair(); + _this.head.next = _this.tail; + _this.tail.prev = _this.head; + return _this; + } + /** + * Inserts the new node to the 'tail' of the list, updating the + * neighbors, and moving 'this.tail' (the End of List indicator) that + * to the end. + */ + LinkedDictionary.prototype.appendToTail = function (entry) { + var lastNode = this.tail.prev; + lastNode.next = entry; + entry.prev = lastNode; + entry.next = this.tail; + this.tail.prev = entry; + }; + /** + * Retrieves a linked dictionary from the table internally + */ + LinkedDictionary.prototype.getLinkedDictionaryPair = function (key) { + if (util.isUndefined(key)) { + return undefined; + } + var k = '$' + this.toStr(key); + var pair = (this.table[k]); + return pair; + }; + /** + * Returns the value to which this dictionary maps the specified key. + * Returns undefined if this dictionary contains no mapping for this key. + * @param {Object} key key whose associated value is to be returned. + * @return {*} the value to which this dictionary maps the specified key or + * undefined if the map contains no mapping for this key. + */ + LinkedDictionary.prototype.getValue = function (key) { + var pair = this.getLinkedDictionaryPair(key); + if (!util.isUndefined(pair)) { + return pair.value; + } + return undefined; + }; + /** + * Removes the mapping for this key from this dictionary if it is present. + * Also, if a value is present for this key, the entry is removed from the + * insertion ordering. + * @param {Object} key key whose mapping is to be removed from the + * dictionary. + * @return {*} previous value associated with specified key, or undefined if + * there was no mapping for key. + */ + LinkedDictionary.prototype.remove = function (key) { + var pair = this.getLinkedDictionaryPair(key); + if (!util.isUndefined(pair)) { + _super.prototype.remove.call(this, key); // This will remove it from the table + pair.unlink(); // This will unlink it from the chain + return pair.value; + } + return undefined; + }; + /** + * Removes all mappings from this LinkedDictionary. + * @this {collections.LinkedDictionary} + */ + LinkedDictionary.prototype.clear = function () { + _super.prototype.clear.call(this); + this.head.next = this.tail; + this.tail.prev = this.head; + }; + /** + * Internal function used when updating an existing KeyValue pair. + * It places the new value indexed by key into the table, but maintains + * its place in the linked ordering. + */ + LinkedDictionary.prototype.replace = function (oldPair, newPair) { + var k = '$' + this.toStr(newPair.key); + // set the new Pair's links to existingPair's links + newPair.next = oldPair.next; + newPair.prev = oldPair.prev; + // Delete Existing Pair from the table, unlink it from chain. + // As a result, the nElements gets decremented by this operation + this.remove(oldPair.key); + // Link new Pair in place of where oldPair was, + // by pointing the old pair's neighbors to it. + newPair.prev.next = newPair; + newPair.next.prev = newPair; + this.table[k] = newPair; + // To make up for the fact that the number of elements was decremented, + // We need to increase it by one. + ++this.nElements; + }; + /** + * Associates the specified value with the specified key in this dictionary. + * If the dictionary previously contained a mapping for this key, the old + * value is replaced by the specified value. + * Updating of a key that already exists maintains its place in the + * insertion order into the map. + * @param {Object} key key with which the specified value is to be + * associated. + * @param {Object} value value to be associated with the specified key. + * @return {*} previous value associated with the specified key, or undefined if + * there was no mapping for the key or if the key/value are undefined. + */ + LinkedDictionary.prototype.setValue = function (key, value) { + if (util.isUndefined(key) || util.isUndefined(value)) { + return undefined; + } + var existingPair = this.getLinkedDictionaryPair(key); + var newPair = new LinkedDictionaryPair(key, value); + var k = '$' + this.toStr(key); + // If there is already an element for that key, we + // keep it's place in the LinkedList + if (!util.isUndefined(existingPair)) { + this.replace(existingPair, newPair); + return existingPair.value; + } + else { + this.appendToTail(newPair); + this.table[k] = newPair; + ++this.nElements; + return undefined; + } + }; + /** + * Returns an array containing all of the keys in this LinkedDictionary, ordered + * by insertion order. + * @return {Array} an array containing all of the keys in this LinkedDictionary, + * ordered by insertion order. + */ + LinkedDictionary.prototype.keys = function () { + var array = []; + this.forEach(function (key, value) { + array.push(key); + }); + return array; + }; + /** + * Returns an array containing all of the values in this LinkedDictionary, ordered by + * insertion order. + * @return {Array} an array containing all of the values in this LinkedDictionary, + * ordered by insertion order. + */ + LinkedDictionary.prototype.values = function () { + var array = []; + this.forEach(function (key, value) { + array.push(value); + }); + return array; + }; + /** + * Executes the provided function once for each key-value pair + * present in this LinkedDictionary. It is done in the order of insertion + * into the LinkedDictionary + * @param {function(Object,Object):*} callback function to execute, it is + * invoked with two arguments: key and value. To break the iteration you can + * optionally return false. + */ + LinkedDictionary.prototype.forEach = function (callback) { + var crawlNode = this.head.next; + while (!isHeadOrTailLinkedDictionaryPair(crawlNode)) { + var ret = callback(crawlNode.key, crawlNode.value); + if (ret === false) { + return; + } + crawlNode = crawlNode.next; + } + }; + return LinkedDictionary; +}(Dictionary_1.default)); // End of LinkedDictionary +exports.default = LinkedDictionary; +// /** +// * Returns true if this dictionary is equal to the given dictionary. +// * Two dictionaries are equal if they contain the same mappings. +// * @param {collections.Dictionary} other the other dictionary. +// * @param {function(Object,Object):boolean=} valuesEqualFunction optional +// * function used to check if two values are equal. +// * @return {boolean} true if this dictionary is equal to the given dictionary. +// */ +// collections.Dictionary.prototype.equals = function(other,valuesEqualFunction) { +// const eqF = valuesEqualFunction || collections.defaultEquals; +// if(!(other instanceof collections.Dictionary)){ +// return false; +// } +// if(this.size() !== other.size()){ +// return false; +// } +// return this.equalsAux(this.firstNode,other.firstNode,eqF); +// } +//# sourceMappingURL=LinkedDictionary.js.map \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/LinkedDictionary.js.map b/node_modules/typescript-collections/dist/lib/LinkedDictionary.js.map new file mode 100644 index 00000000..33826c05 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/LinkedDictionary.js.map @@ -0,0 +1 @@ +{"version":3,"file":"LinkedDictionary.js","sourceRoot":"","sources":["../../src/lib/LinkedDictionary.ts"],"names":[],"mappings":";;;;;;;;;;;;AAAA,2CAAoE;AAEpE,6BAA+B;AAE/B;;;;GAIG;AACH;IAII,8BAAmB,GAAM,EAAS,KAAQ;QAAvB,QAAG,GAAH,GAAG,CAAG;QAAS,UAAK,GAAL,KAAK,CAAG;IAAI,CAAC;IAE/C,qCAAM,GAAN;QACI,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAC3B,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IAC/B,CAAC;IACL,2BAAC;AAAD,CAAC,AAVD,IAUC;AAED;;;GAGG;AACH;IAAA;QAGI,QAAG,GAAS,IAAI,CAAC;QACjB,UAAK,GAAS,IAAI,CAAC;IAMvB,CAAC;IAJG,+CAAM,GAAN;QACI,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAC3B,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IAC/B,CAAC;IACL,qCAAC;AAAD,CAAC,AAVD,IAUC;AAED,0CAAgD,CAAoE;IAEhH,MAAM,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC;AAC3B,CAAC;AAED;IAAoD,oCAAgB;IAIhE,0BAAY,aAAkC;QAA9C,YACI,kBAAM,aAAa,CAAC,SAKvB;QAJG,KAAI,CAAC,IAAI,GAAG,IAAI,8BAA8B,EAAE,CAAC;QACjD,KAAI,CAAC,IAAI,GAAG,IAAI,8BAA8B,EAAE,CAAC;QACjD,KAAI,CAAC,IAAI,CAAC,IAAI,GAAG,KAAI,CAAC,IAAI,CAAC;QAC3B,KAAI,CAAC,IAAI,CAAC,IAAI,GAAG,KAAI,CAAC,IAAI,CAAC;;IAC/B,CAAC;IAED;;;;OAIG;IACK,uCAAY,GAApB,UAAqB,KAAiC;QAClD,IAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;QAChC,QAAQ,CAAC,IAAI,GAAG,KAAK,CAAC;QACtB,KAAK,CAAC,IAAI,GAAG,QAAQ,CAAC;QACtB,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;IAC3B,CAAC;IAED;;OAEG;IACK,kDAAuB,GAA/B,UAAgC,GAAM;QAClC,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACxB,MAAM,CAAC,SAAS,CAAC;QACrB,CAAC;QACD,IAAM,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAChC,IAAM,IAAI,GAA+B,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACzD,MAAM,CAAC,IAAI,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACH,mCAAQ,GAAR,UAAS,GAAM;QACX,IAAM,IAAI,GAAG,IAAI,CAAC,uBAAuB,CAAC,GAAG,CAAC,CAAC;QAC/C,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;QACtB,CAAC;QACD,MAAM,CAAC,SAAS,CAAC;IACrB,CAAC;IAED;;;;;;;;OAQG;IACH,iCAAM,GAAN,UAAO,GAAM;QACT,IAAM,IAAI,GAAG,IAAI,CAAC,uBAAuB,CAAC,GAAG,CAAC,CAAC;QAC/C,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC1B,iBAAM,MAAM,YAAC,GAAG,CAAC,CAAC,CAAC,qCAAqC;YACxD,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,qCAAqC;YACpD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;QACtB,CAAC;QACD,MAAM,CAAC,SAAS,CAAC;IACrB,CAAC;IAED;;;MAGE;IACF,gCAAK,GAAL;QACI,iBAAM,KAAK,WAAE,CAAC;QACd,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAC3B,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IAC/B,CAAC;IAED;;;;OAIG;IACK,kCAAO,GAAf,UAAgB,OAAmC,EAAE,OAAmC;QACpF,IAAM,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAExC,mDAAmD;QACnD,OAAO,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;QAC5B,OAAO,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;QAE5B,6DAA6D;QAC7D,gEAAgE;QAChE,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAEzB,+CAA+C;QAC/C,8CAA8C;QAC9C,OAAO,CAAC,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;QAC5B,OAAO,CAAC,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;QAE5B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;QAExB,uEAAuE;QACvE,iCAAiC;QACjC,EAAE,IAAI,CAAC,SAAS,CAAC;IAErB,CAAC;IAED;;;;;;;;;;;OAWG;IACH,mCAAQ,GAAR,UAAS,GAAM,EAAE,KAAQ;QAErB,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACnD,MAAM,CAAC,SAAS,CAAC;QACrB,CAAC;QAED,IAAM,YAAY,GAAG,IAAI,CAAC,uBAAuB,CAAC,GAAG,CAAC,CAAC;QACvD,IAAM,OAAO,GAAG,IAAI,oBAAoB,CAAO,GAAG,EAAE,KAAK,CAAC,CAAC;QAE3D,IAAM,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAEhC,kDAAkD;QAClD,oCAAoC;QACpC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAClC,IAAI,CAAC,OAAO,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;YAEpC,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC;QAC9B,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;YAC3B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;YACxB,EAAE,IAAI,CAAC,SAAS,CAAC;YAEjB,MAAM,CAAC,SAAS,CAAC;QACrB,CAAC;IAEL,CAAC;IAED;;;;;OAKG;IACH,+BAAI,GAAJ;QACI,IAAM,KAAK,GAAQ,EAAE,CAAC;QACtB,IAAI,CAAC,OAAO,CAAC,UAAC,GAAG,EAAE,KAAK;YACpB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB,CAAC,CAAC,CAAC;QACH,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IAED;;;;;OAKG;IACH,iCAAM,GAAN;QACI,IAAM,KAAK,GAAQ,EAAE,CAAC;QACtB,IAAI,CAAC,OAAO,CAAC,UAAC,GAAG,EAAE,KAAK;YACpB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtB,CAAC,CAAC,CAAC;QACH,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IAED;;;;;;;MAOE;IACF,kCAAO,GAAP,UAAQ,QAAmC;QACvC,IAAI,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;QAC/B,OAAO,CAAC,gCAAgC,CAAC,SAAS,CAAC,EAAE,CAAC;YAClD,IAAM,GAAG,GAAG,QAAQ,CAAC,SAAS,CAAC,GAAG,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC;YACrD,EAAE,CAAC,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC;gBAChB,MAAM,CAAC;YACX,CAAC;YACD,SAAS,GAAG,SAAS,CAAC,IAAI,CAAC;QAC/B,CAAC;IACL,CAAC;IAEL,uBAAC;AAAD,CAAC,AApMD,CAAoD,oBAAU,GAoM7D,CAAC,0BAA0B;;AAC5B,MAAM;AACN,uEAAuE;AACvE,mEAAmE;AACnE,iEAAiE;AACjE,4EAA4E;AAC5E,qDAAqD;AACrD,iFAAiF;AACjF,MAAM;AACN,kFAAkF;AAClF,iEAAiE;AACjE,mDAAmD;AACnD,kBAAkB;AAClB,KAAK;AACL,qCAAqC;AACrC,kBAAkB;AAClB,KAAK;AACL,8DAA8D;AAC9D,IAAI"} \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/LinkedList.d.ts b/node_modules/typescript-collections/dist/lib/LinkedList.d.ts new file mode 100644 index 00000000..f7ff8f40 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/LinkedList.d.ts @@ -0,0 +1,179 @@ +import * as util from './util'; +export interface ILinkedListNode { + element: T; + next: ILinkedListNode | null; +} +export default class LinkedList { + /** + * First node in the list + * @type {Object} + * @private + */ + firstNode: ILinkedListNode | null; + /** + * Last node in the list + * @type {Object} + * @private + */ + private lastNode; + /** + * Number of elements in the list + * @type {number} + * @private + */ + private nElements; + /** + * Creates an empty Linked List. + * @class A linked list is a data structure consisting of a group of nodes + * which together represent a sequence. + * @constructor + */ + constructor(); + /** + * Adds an element to this list. + * @param {Object} item element to be added. + * @param {number=} index optional index to add the element. If no index is specified + * the element is added to the end of this list. + * @return {boolean} true if the element was added or false if the index is invalid + * or if the element is undefined. + */ + add(item: T, index?: number): boolean; + /** + * Returns the first element in this list. + * @return {*} the first element of the list or undefined if the list is + * empty. + */ + first(): T | undefined; + /** + * Returns the last element in this list. + * @return {*} the last element in the list or undefined if the list is + * empty. + */ + last(): T | undefined; + /** + * Returns the element at the specified position in this list. + * @param {number} index desired index. + * @return {*} the element at the given index or undefined if the index is + * out of bounds. + */ + elementAtIndex(index: number): T | undefined; + /** + * Returns the index in this list of the first occurrence of the + * specified element, or -1 if the List does not contain this element. + *

If the elements inside this list are + * not comparable with the === operator a custom equals function should be + * provided to perform searches, the function must receive two arguments and + * return true if they are equal, false otherwise. Example:

+ * + * 
+     * const petsAreEqualByName = function(pet1, pet2) {
+     *  return pet1.name === pet2.name;
+     * }
+     *
+ * @param {Object} item element to search for. + * @param {function(Object,Object):boolean=} equalsFunction Optional + * function used to check if two elements are equal. + * @return {number} the index in this list of the first occurrence + * of the specified element, or -1 if this list does not contain the + * element. + */ + indexOf(item: T, equalsFunction?: util.IEqualsFunction): number; + /** + * Returns true if this list contains the specified element. + *

If the elements inside the list are + * not comparable with the === operator a custom equals function should be + * provided to perform searches, the function must receive two arguments and + * return true if they are equal, false otherwise. Example:

+ * + * 
+       * const petsAreEqualByName = function(pet1, pet2) {
+       *  return pet1.name === pet2.name;
+       * }
+       *
+ * @param {Object} item element to search for. + * @param {function(Object,Object):boolean=} equalsFunction Optional + * function used to check if two elements are equal. + * @return {boolean} true if this list contains the specified element, false + * otherwise. + */ + contains(item: T, equalsFunction?: util.IEqualsFunction): boolean; + /** + * Removes the first occurrence of the specified element in this list. + *

If the elements inside the list are + * not comparable with the === operator a custom equals function should be + * provided to perform searches, the function must receive two arguments and + * return true if they are equal, false otherwise. Example:

+ * + * 
+     * const petsAreEqualByName = function(pet1, pet2) {
+     *  return pet1.name === pet2.name;
+     * }
+     *
+ * @param {Object} item element to be removed from this list, if present. + * @return {boolean} true if the list contained the specified element. + */ + remove(item: T, equalsFunction?: util.IEqualsFunction): boolean; + /** + * Removes all of the elements from this list. + */ + clear(): void; + /** + * Returns true if this list is equal to the given list. + * Two lists are equal if they have the same elements in the same order. + * @param {LinkedList} other the other list. + * @param {function(Object,Object):boolean=} equalsFunction optional + * function used to check if two elements are equal. If the elements in the lists + * are custom objects you should provide a function, otherwise + * the === operator is used to check equality between elements. + * @return {boolean} true if this list is equal to the given list. + */ + equals(other: any, equalsFunction?: util.IEqualsFunction): boolean; + /** + * @private + */ + private equalsAux(n1, n2, eqF); + /** + * Removes the element at the specified position in this list. + * @param {number} index given index. + * @return {*} removed element or undefined if the index is out of bounds. + */ + removeElementAtIndex(index: number): T | undefined; + /** + * Executes the provided function once for each element present in this list in order. + * @param {function(Object):*} callback function to execute, it is + * invoked with one argument: the element value, to break the iteration you can + * optionally return false. + */ + forEach(callback: util.ILoopFunction): void; + /** + * Reverses the order of the elements in this linked list (makes the last + * element first, and the first element last). + */ + reverse(): void; + /** + * Returns an array containing all of the elements in this list in proper + * sequence. + * @return {Array.<*>} an array containing all of the elements in this list, + * in proper sequence. + */ + toArray(): T[]; + /** + * Returns the number of elements in this list. + * @return {number} the number of elements in this list. + */ + size(): number; + /** + * Returns true if this list contains no elements. + * @return {boolean} true if this list contains no elements. + */ + isEmpty(): boolean; + toString(): string; + /** + * @private + */ + private nodeAtIndex(index); + /** + * @private + */ + private createNode(item); +} diff --git a/node_modules/typescript-collections/dist/lib/LinkedList.js b/node_modules/typescript-collections/dist/lib/LinkedList.js new file mode 100644 index 00000000..fe0a08e1 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/LinkedList.js @@ -0,0 +1,381 @@ +"use strict"; +Object.defineProperty(exports, "__esModule", { value: true }); +var util = require("./util"); +var arrays = require("./arrays"); +var LinkedList = /** @class */ (function () { + /** + * Creates an empty Linked List. + * @class A linked list is a data structure consisting of a group of nodes + * which together represent a sequence. + * @constructor + */ + function LinkedList() { + /** + * First node in the list + * @type {Object} + * @private + */ + this.firstNode = null; + /** + * Last node in the list + * @type {Object} + * @private + */ + this.lastNode = null; + /** + * Number of elements in the list + * @type {number} + * @private + */ + this.nElements = 0; + } + /** + * Adds an element to this list. + * @param {Object} item element to be added. + * @param {number=} index optional index to add the element. If no index is specified + * the element is added to the end of this list. + * @return {boolean} true if the element was added or false if the index is invalid + * or if the element is undefined. + */ + LinkedList.prototype.add = function (item, index) { + if (util.isUndefined(index)) { + index = this.nElements; + } + if (index < 0 || index > this.nElements || util.isUndefined(item)) { + return false; + } + var newNode = this.createNode(item); + if (this.nElements === 0 || this.lastNode === null) { + // First node in the list. + this.firstNode = newNode; + this.lastNode = newNode; + } + else if (index === this.nElements) { + // Insert at the end. + this.lastNode.next = newNode; + this.lastNode = newNode; + } + else if (index === 0) { + // Change first node. + newNode.next = this.firstNode; + this.firstNode = newNode; + } + else { + var prev = this.nodeAtIndex(index - 1); + if (prev == null) { + return false; + } + newNode.next = prev.next; + prev.next = newNode; + } + this.nElements++; + return true; + }; + /** + * Returns the first element in this list. + * @return {*} the first element of the list or undefined if the list is + * empty. + */ + LinkedList.prototype.first = function () { + if (this.firstNode !== null) { + return this.firstNode.element; + } + return undefined; + }; + /** + * Returns the last element in this list. + * @return {*} the last element in the list or undefined if the list is + * empty. + */ + LinkedList.prototype.last = function () { + if (this.lastNode !== null) { + return this.lastNode.element; + } + return undefined; + }; + /** + * Returns the element at the specified position in this list. + * @param {number} index desired index. + * @return {*} the element at the given index or undefined if the index is + * out of bounds. + */ + LinkedList.prototype.elementAtIndex = function (index) { + var node = this.nodeAtIndex(index); + if (node === null) { + return undefined; + } + return node.element; + }; + /** + * Returns the index in this list of the first occurrence of the + * specified element, or -1 if the List does not contain this element. + *

If the elements inside this list are + * not comparable with the === operator a custom equals function should be + * provided to perform searches, the function must receive two arguments and + * return true if they are equal, false otherwise. Example:

+ * + * 
+     * const petsAreEqualByName = function(pet1, pet2) {
+     *  return pet1.name === pet2.name;
+     * }
+     *
+ * @param {Object} item element to search for. + * @param {function(Object,Object):boolean=} equalsFunction Optional + * function used to check if two elements are equal. + * @return {number} the index in this list of the first occurrence + * of the specified element, or -1 if this list does not contain the + * element. + */ + LinkedList.prototype.indexOf = function (item, equalsFunction) { + var equalsF = equalsFunction || util.defaultEquals; + if (util.isUndefined(item)) { + return -1; + } + var currentNode = this.firstNode; + var index = 0; + while (currentNode !== null) { + if (equalsF(currentNode.element, item)) { + return index; + } + index++; + currentNode = currentNode.next; + } + return -1; + }; + /** + * Returns true if this list contains the specified element. + *

If the elements inside the list are + * not comparable with the === operator a custom equals function should be + * provided to perform searches, the function must receive two arguments and + * return true if they are equal, false otherwise. Example:

+ * + * 
+       * const petsAreEqualByName = function(pet1, pet2) {
+       *  return pet1.name === pet2.name;
+       * }
+       *
+ * @param {Object} item element to search for. + * @param {function(Object,Object):boolean=} equalsFunction Optional + * function used to check if two elements are equal. + * @return {boolean} true if this list contains the specified element, false + * otherwise. + */ + LinkedList.prototype.contains = function (item, equalsFunction) { + return (this.indexOf(item, equalsFunction) >= 0); + }; + /** + * Removes the first occurrence of the specified element in this list. + *

If the elements inside the list are + * not comparable with the === operator a custom equals function should be + * provided to perform searches, the function must receive two arguments and + * return true if they are equal, false otherwise. Example:

+ * + * 
+     * const petsAreEqualByName = function(pet1, pet2) {
+     *  return pet1.name === pet2.name;
+     * }
+     *
+ * @param {Object} item element to be removed from this list, if present. + * @return {boolean} true if the list contained the specified element. + */ + LinkedList.prototype.remove = function (item, equalsFunction) { + var equalsF = equalsFunction || util.defaultEquals; + if (this.nElements < 1 || util.isUndefined(item)) { + return false; + } + var previous = null; + var currentNode = this.firstNode; + while (currentNode !== null) { + if (equalsF(currentNode.element, item)) { + if (previous == null) { + this.firstNode = currentNode.next; + if (currentNode === this.lastNode) { + this.lastNode = null; + } + } + else if (currentNode === this.lastNode) { + this.lastNode = previous; + previous.next = currentNode.next; + currentNode.next = null; + } + else { + previous.next = currentNode.next; + currentNode.next = null; + } + this.nElements--; + return true; + } + previous = currentNode; + currentNode = currentNode.next; + } + return false; + }; + /** + * Removes all of the elements from this list. + */ + LinkedList.prototype.clear = function () { + this.firstNode = null; + this.lastNode = null; + this.nElements = 0; + }; + /** + * Returns true if this list is equal to the given list. + * Two lists are equal if they have the same elements in the same order. + * @param {LinkedList} other the other list. + * @param {function(Object,Object):boolean=} equalsFunction optional + * function used to check if two elements are equal. If the elements in the lists + * are custom objects you should provide a function, otherwise + * the === operator is used to check equality between elements. + * @return {boolean} true if this list is equal to the given list. + */ + LinkedList.prototype.equals = function (other, equalsFunction) { + var eqF = equalsFunction || util.defaultEquals; + if (!(other instanceof LinkedList)) { + return false; + } + if (this.size() !== other.size()) { + return false; + } + return this.equalsAux(this.firstNode, other.firstNode, eqF); + }; + /** + * @private + */ + LinkedList.prototype.equalsAux = function (n1, n2, eqF) { + while (n1 !== null && n2 !== null) { + if (!eqF(n1.element, n2.element)) { + return false; + } + n1 = n1.next; + n2 = n2.next; + } + return true; + }; + /** + * Removes the element at the specified position in this list. + * @param {number} index given index. + * @return {*} removed element or undefined if the index is out of bounds. + */ + LinkedList.prototype.removeElementAtIndex = function (index) { + if (index < 0 || index >= this.nElements || this.firstNode === null || this.lastNode === null) { + return undefined; + } + var element; + if (this.nElements === 1) { + //First node in the list. + element = this.firstNode.element; + this.firstNode = null; + this.lastNode = null; + } + else { + var previous = this.nodeAtIndex(index - 1); + if (previous === null) { + element = this.firstNode.element; + this.firstNode = this.firstNode.next; + } + else if (previous.next === this.lastNode) { + element = this.lastNode.element; + this.lastNode = previous; + } + if (previous !== null && previous.next !== null) { + element = previous.next.element; + previous.next = previous.next.next; + } + } + this.nElements--; + return element; + }; + /** + * Executes the provided function once for each element present in this list in order. + * @param {function(Object):*} callback function to execute, it is + * invoked with one argument: the element value, to break the iteration you can + * optionally return false. + */ + LinkedList.prototype.forEach = function (callback) { + var currentNode = this.firstNode; + while (currentNode !== null) { + if (callback(currentNode.element) === false) { + break; + } + currentNode = currentNode.next; + } + }; + /** + * Reverses the order of the elements in this linked list (makes the last + * element first, and the first element last). + */ + LinkedList.prototype.reverse = function () { + var previous = null; + var current = this.firstNode; + var temp = null; + while (current !== null) { + temp = current.next; + current.next = previous; + previous = current; + current = temp; + } + temp = this.firstNode; + this.firstNode = this.lastNode; + this.lastNode = temp; + }; + /** + * Returns an array containing all of the elements in this list in proper + * sequence. + * @return {Array.<*>} an array containing all of the elements in this list, + * in proper sequence. + */ + LinkedList.prototype.toArray = function () { + var array = []; + var currentNode = this.firstNode; + while (currentNode !== null) { + array.push(currentNode.element); + currentNode = currentNode.next; + } + return array; + }; + /** + * Returns the number of elements in this list. + * @return {number} the number of elements in this list. + */ + LinkedList.prototype.size = function () { + return this.nElements; + }; + /** + * Returns true if this list contains no elements. + * @return {boolean} true if this list contains no elements. + */ + LinkedList.prototype.isEmpty = function () { + return this.nElements <= 0; + }; + LinkedList.prototype.toString = function () { + return arrays.toString(this.toArray()); + }; + /** + * @private + */ + LinkedList.prototype.nodeAtIndex = function (index) { + if (index < 0 || index >= this.nElements) { + return null; + } + if (index === (this.nElements - 1)) { + return this.lastNode; + } + var node = this.firstNode; + for (var i = 0; i < index && node != null; i++) { + node = node.next; + } + return node; + }; + /** + * @private + */ + LinkedList.prototype.createNode = function (item) { + return { + element: item, + next: null + }; + }; + return LinkedList; +}()); // End of linked list +exports.default = LinkedList; +//# sourceMappingURL=LinkedList.js.map \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/LinkedList.js.map b/node_modules/typescript-collections/dist/lib/LinkedList.js.map new file mode 100644 index 00000000..eaf5244d --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/LinkedList.js.map @@ -0,0 +1 @@ +{"version":3,"file":"LinkedList.js","sourceRoot":"","sources":["../../src/lib/LinkedList.ts"],"names":[],"mappings":";;AAAA,6BAA+B;AAC/B,iCAAmC;AAQnC;IAsBI;;;;;MAKE;IACF;QA1BA;;;;UAIE;QACK,cAAS,GAA8B,IAAI,CAAC;QACnD;;;;UAIE;QACM,aAAQ,GAA8B,IAAI,CAAC;QAEnD;;;;UAIE;QACM,cAAS,GAAG,CAAC,CAAC;IAQN,CAAC;IAEjB;;;;;;;MAOE;IACF,wBAAG,GAAH,UAAI,IAAO,EAAE,KAAc;QACvB,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC1B,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC;QAC3B,CAAC;QACD,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChE,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;QACD,IAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACtC,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC;YACjD,0BAA0B;YAC1B,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC;YACzB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QAC5B,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;YAClC,qBAAqB;YACrB,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,OAAO,CAAC;YAC7B,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QAC5B,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC;YACrB,qBAAqB;YACrB,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC;YAC9B,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC;QAC7B,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,IAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YACzC,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC;gBACf,MAAM,CAAC,KAAK,CAAC;YACjB,CAAC;YACD,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACzB,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;QACxB,CAAC;QACD,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,MAAM,CAAC,IAAI,CAAC;IAChB,CAAC;IAED;;;;MAIE;IACF,0BAAK,GAAL;QAEI,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,KAAK,IAAI,CAAC,CAAC,CAAC;YAC1B,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;QAClC,CAAC;QACD,MAAM,CAAC,SAAS,CAAC;IACrB,CAAC;IAED;;;;MAIE;IACF,yBAAI,GAAJ;QAEI,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC;YACzB,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC;QACjC,CAAC;QACD,MAAM,CAAC,SAAS,CAAC;IACrB,CAAC;IAED;;;;;OAKG;IACH,mCAAc,GAAd,UAAe,KAAa;QAExB,IAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QACrC,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,SAAS,CAAC;QACrB,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC;IACxB,CAAC;IAED;;;;;;;;;;;;;;;;;;;OAmBG;IACH,4BAAO,GAAP,UAAQ,IAAO,EAAE,cAAwC;QAErD,IAAM,OAAO,GAAG,cAAc,IAAI,IAAI,CAAC,aAAa,CAAC;QACrD,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACzB,MAAM,CAAC,CAAC,CAAC,CAAC;QACd,CAAC;QACD,IAAI,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC;QACjC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,OAAO,WAAW,KAAK,IAAI,EAAE,CAAC;YAC1B,EAAE,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;gBACrC,MAAM,CAAC,KAAK,CAAC;YACjB,CAAC;YACD,KAAK,EAAE,CAAC;YACR,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC;QACnC,CAAC;QACD,MAAM,CAAC,CAAC,CAAC,CAAC;IACd,CAAC;IAGD;;;;;;;;;;;;;;;;;SAiBK;IACL,6BAAQ,GAAR,UAAS,IAAO,EAAE,cAAwC;QACtD,MAAM,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC;IACrD,CAAC;IAED;;;;;;;;;;;;;;OAcG;IACH,2BAAM,GAAN,UAAO,IAAO,EAAE,cAAwC;QACpD,IAAM,OAAO,GAAG,cAAc,IAAI,IAAI,CAAC,aAAa,CAAC;QACrD,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC/C,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;QACD,IAAI,QAAQ,GAA8B,IAAI,CAAC;QAC/C,IAAI,WAAW,GAA8B,IAAI,CAAC,SAAS,CAAC;QAE5D,OAAO,WAAW,KAAK,IAAI,EAAE,CAAC;YAC1B,EAAE,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;gBAErC,EAAE,CAAC,CAAC,QAAQ,IAAI,IAAI,CAAC,CAAC,CAAC;oBACnB,IAAI,CAAC,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC;oBAClC,EAAE,CAAC,CAAC,WAAW,KAAK,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;wBAChC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;oBACzB,CAAC;gBACL,CAAC;gBAAC,IAAI,CAAC,EAAE,CAAC,CAAC,WAAW,KAAK,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;oBACvC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;oBACzB,QAAQ,CAAC,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC;oBACjC,WAAW,CAAC,IAAI,GAAG,IAAI,CAAC;gBAC5B,CAAC;gBAAC,IAAI,CAAC,CAAC;oBACJ,QAAQ,CAAC,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC;oBACjC,WAAW,CAAC,IAAI,GAAG,IAAI,CAAC;gBAC5B,CAAC;gBACD,IAAI,CAAC,SAAS,EAAE,CAAC;gBACjB,MAAM,CAAC,IAAI,CAAC;YAChB,CAAC;YACD,QAAQ,GAAG,WAAW,CAAC;YACvB,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC;QACnC,CAAC;QACD,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,0BAAK,GAAL;QACI,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;QACtB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACvB,CAAC;IAED;;;;;;;;;OASG;IACH,2BAAM,GAAN,UAAO,KAAU,EAAE,cAAwC;QACvD,IAAM,GAAG,GAAG,cAAc,IAAI,IAAI,CAAC,aAAa,CAAC;QACjD,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,YAAY,UAAU,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;QACD,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;IAChE,CAAC;IAED;;MAEE;IACM,8BAAS,GAAjB,UAAkB,EAA6B,EAAE,EAA6B,EAAE,GAA4B;QACxG,OAAO,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;YAChC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBAC/B,MAAM,CAAC,KAAK,CAAC;YACjB,CAAC;YACD,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC;YACb,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC;QACjB,CAAC;QACD,MAAM,CAAC,IAAI,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACH,yCAAoB,GAApB,UAAqB,KAAa;QAC9B,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,KAAK,IAAI,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC;YAC5F,MAAM,CAAC,SAAS,CAAC;QACrB,CAAC;QACD,IAAI,OAAsB,CAAC;QAC3B,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC;YACvB,yBAAyB;YACzB,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;YACjC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;YACtB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACzB,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,IAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YAC7C,EAAE,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC;gBACpB,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;gBACjC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;YACzC,CAAC;YAAC,IAAI,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,KAAK,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;gBACzC,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC;gBAChC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;YAC7B,CAAC;YACD,EAAE,CAAC,CAAC,QAAQ,KAAK,IAAI,IAAI,QAAQ,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC;gBAC9C,OAAO,GAAG,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC;gBAChC,QAAQ,CAAC,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;YACvC,CAAC;QACL,CAAC;QACD,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,MAAM,CAAC,OAAO,CAAC;IACnB,CAAC;IAED;;;;;OAKG;IACH,4BAAO,GAAP,UAAQ,QAA+B;QACnC,IAAI,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC;QACjC,OAAO,WAAW,KAAK,IAAI,EAAE,CAAC;YAC1B,EAAE,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,OAAO,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC;gBAC1C,KAAK,CAAC;YACV,CAAC;YACD,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC;QACnC,CAAC;IACL,CAAC;IAED;;;OAGG;IACH,4BAAO,GAAP;QACI,IAAI,QAAQ,GAA8B,IAAI,CAAC;QAC/C,IAAI,OAAO,GAA8B,IAAI,CAAC,SAAS,CAAC;QACxD,IAAI,IAAI,GAA8B,IAAI,CAAC;QAC3C,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;YACtB,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;YACpB,OAAO,CAAC,IAAI,GAAG,QAAQ,CAAC;YACxB,QAAQ,GAAG,OAAO,CAAC;YACnB,OAAO,GAAG,IAAI,CAAC;QACnB,CAAC;QACD,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC;QACtB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC/B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;IACzB,CAAC;IAED;;;;;OAKG;IACH,4BAAO,GAAP;QACI,IAAM,KAAK,GAAQ,EAAE,CAAC;QACtB,IAAI,WAAW,GAA8B,IAAI,CAAC,SAAS,CAAC;QAC5D,OAAO,WAAW,KAAK,IAAI,EAAE,CAAC;YAC1B,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;YAChC,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC;QACnC,CAAC;QACD,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,yBAAI,GAAJ;QACI,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACH,4BAAO,GAAP;QACI,MAAM,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,CAAC;IAC/B,CAAC;IAED,6BAAQ,GAAR;QACI,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;IAC3C,CAAC;IAED;;OAEG;IACK,gCAAW,GAAnB,UAAoB,KAAa;QAE7B,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,IAAI,CAAC;QAChB,CAAC;QACD,EAAE,CAAC,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC;QACzB,CAAC;QACD,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC;QAC1B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACrB,CAAC;QACD,MAAM,CAAC,IAAI,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,+BAAU,GAAlB,UAAmB,IAAO;QACtB,MAAM,CAAC;YACH,OAAO,EAAE,IAAI;YACb,IAAI,EAAE,IAAI;SACb,CAAC;IACN,CAAC;IACL,iBAAC;AAAD,CAAC,AA3YD,IA2YC,CAAC,qBAAqB"} \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/MultiDictionary.d.ts b/node_modules/typescript-collections/dist/lib/MultiDictionary.d.ts new file mode 100644 index 00000000..93f8bb6c --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/MultiDictionary.d.ts @@ -0,0 +1,104 @@ +import * as util from './util'; +export default class MultiDictionary { + private dict; + private equalsF; + private allowDuplicate; + /** + * Creates an empty multi dictionary. + * @class

A multi dictionary is a special kind of dictionary that holds + * multiple values against each key. Setting a value into the dictionary will + * add the value to an array at that key. Getting a key will return an array, + * holding all the values set to that key. + * You can configure to allow duplicates in the values. + * This implementation accepts any kind of objects as keys.

+ * + *

If the keys are custom objects a function which converts keys to strings must be + * provided. Example:

+ * + * 
+     * function petToString(pet) {
+       *  return pet.name;
+       * }
+     *
+ *

If the values are custom objects a function to check equality between values + * must be provided. Example:

+ * + * 
+     * function petsAreEqualByAge(pet1,pet2) {
+       *  return pet1.age===pet2.age;
+       * }
+     *
+ * @constructor + * @param {function(Object):string=} toStrFunction optional function + * to convert keys to strings. If the keys aren't strings or if toString() + * is not appropriate, a custom function which receives a key and returns a + * unique string must be provided. + * @param {function(Object,Object):boolean=} valuesEqualsFunction optional + * function to check if two values are equal. + * + * @param allowDuplicateValues + */ + constructor(toStrFunction?: (key: K) => string, valuesEqualsFunction?: util.IEqualsFunction, allowDuplicateValues?: boolean); + /** + * Returns an array holding the values to which this dictionary maps + * the specified key. + * Returns an empty array if this dictionary contains no mappings for this key. + * @param {Object} key key whose associated values are to be returned. + * @return {Array} an array holding the values to which this dictionary maps + * the specified key. + */ + getValue(key: K): V[]; + /** + * Adds the value to the array associated with the specified key, if + * it is not already present. + * @param {Object} key key with which the specified value is to be + * associated. + * @param {Object} value the value to add to the array at the key + * @return {boolean} true if the value was not already associated with that key. + */ + setValue(key: K, value: V): boolean; + /** + * Removes the specified values from the array of values associated with the + * specified key. If a value isn't given, all values associated with the specified + * key are removed. + * @param {Object} key key whose mapping is to be removed from the + * dictionary. + * @param {Object=} value optional argument to specify the value to remove + * from the array associated with the specified key. + * @return {*} true if the dictionary changed, false if the key doesn't exist or + * if the specified value isn't associated with the specified key. + */ + remove(key: K, value?: V): boolean; + /** + * Returns an array containing all of the keys in this dictionary. + * @return {Array} an array containing all of the keys in this dictionary. + */ + keys(): K[]; + /** + * Returns an array containing all of the values in this dictionary. + * @return {Array} an array containing all of the values in this dictionary. + */ + values(): V[]; + /** + * Returns true if this dictionary at least one value associatted the specified key. + * @param {Object} key key whose presence in this dictionary is to be + * tested. + * @return {boolean} true if this dictionary at least one value associatted + * the specified key. + */ + containsKey(key: K): boolean; + /** + * Removes all mappings from this dictionary. + */ + clear(): void; + /** + * Returns the number of keys in this dictionary. + * @return {number} the number of key-value mappings in this dictionary. + */ + size(): number; + /** + * Returns true if this dictionary contains no mappings. + * @return {boolean} true if this dictionary contains no mappings. + */ + isEmpty(): boolean; +} diff --git a/node_modules/typescript-collections/dist/lib/MultiDictionary.js b/node_modules/typescript-collections/dist/lib/MultiDictionary.js new file mode 100644 index 00000000..04dcc4fe --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/MultiDictionary.js @@ -0,0 +1,169 @@ +"use strict"; +Object.defineProperty(exports, "__esModule", { value: true }); +var util = require("./util"); +var Dictionary_1 = require("./Dictionary"); +var arrays = require("./arrays"); +var MultiDictionary = /** @class */ (function () { + /** + * Creates an empty multi dictionary. + * @class

A multi dictionary is a special kind of dictionary that holds + * multiple values against each key. Setting a value into the dictionary will + * add the value to an array at that key. Getting a key will return an array, + * holding all the values set to that key. + * You can configure to allow duplicates in the values. + * This implementation accepts any kind of objects as keys.

+ * + *

If the keys are custom objects a function which converts keys to strings must be + * provided. Example:

+ * + * 
+     * function petToString(pet) {
+       *  return pet.name;
+       * }
+     *
+ *

If the values are custom objects a function to check equality between values + * must be provided. Example:

+ * + * 
+     * function petsAreEqualByAge(pet1,pet2) {
+       *  return pet1.age===pet2.age;
+       * }
+     *
+ * @constructor + * @param {function(Object):string=} toStrFunction optional function + * to convert keys to strings. If the keys aren't strings or if toString() + * is not appropriate, a custom function which receives a key and returns a + * unique string must be provided. + * @param {function(Object,Object):boolean=} valuesEqualsFunction optional + * function to check if two values are equal. + * + * @param allowDuplicateValues + */ + function MultiDictionary(toStrFunction, valuesEqualsFunction, allowDuplicateValues) { + if (allowDuplicateValues === void 0) { allowDuplicateValues = false; } + this.dict = new Dictionary_1.default(toStrFunction); + this.equalsF = valuesEqualsFunction || util.defaultEquals; + this.allowDuplicate = allowDuplicateValues; + } + /** + * Returns an array holding the values to which this dictionary maps + * the specified key. + * Returns an empty array if this dictionary contains no mappings for this key. + * @param {Object} key key whose associated values are to be returned. + * @return {Array} an array holding the values to which this dictionary maps + * the specified key. + */ + MultiDictionary.prototype.getValue = function (key) { + var values = this.dict.getValue(key); + if (util.isUndefined(values)) { + return []; + } + return arrays.copy(values); + }; + /** + * Adds the value to the array associated with the specified key, if + * it is not already present. + * @param {Object} key key with which the specified value is to be + * associated. + * @param {Object} value the value to add to the array at the key + * @return {boolean} true if the value was not already associated with that key. + */ + MultiDictionary.prototype.setValue = function (key, value) { + if (util.isUndefined(key) || util.isUndefined(value)) { + return false; + } + var array = this.dict.getValue(key); + if (util.isUndefined(array)) { + this.dict.setValue(key, [value]); + return true; + } + if (!this.allowDuplicate) { + if (arrays.contains(array, value, this.equalsF)) { + return false; + } + } + array.push(value); + return true; + }; + /** + * Removes the specified values from the array of values associated with the + * specified key. If a value isn't given, all values associated with the specified + * key are removed. + * @param {Object} key key whose mapping is to be removed from the + * dictionary. + * @param {Object=} value optional argument to specify the value to remove + * from the array associated with the specified key. + * @return {*} true if the dictionary changed, false if the key doesn't exist or + * if the specified value isn't associated with the specified key. + */ + MultiDictionary.prototype.remove = function (key, value) { + if (util.isUndefined(value)) { + var v = this.dict.remove(key); + return !util.isUndefined(v); + } + var array = this.dict.getValue(key); + if (!util.isUndefined(array) && arrays.remove(array, value, this.equalsF)) { + if (array.length === 0) { + this.dict.remove(key); + } + return true; + } + return false; + }; + /** + * Returns an array containing all of the keys in this dictionary. + * @return {Array} an array containing all of the keys in this dictionary. + */ + MultiDictionary.prototype.keys = function () { + return this.dict.keys(); + }; + /** + * Returns an array containing all of the values in this dictionary. + * @return {Array} an array containing all of the values in this dictionary. + */ + MultiDictionary.prototype.values = function () { + var values = this.dict.values(); + var array = []; + for (var _i = 0, values_1 = values; _i < values_1.length; _i++) { + var v = values_1[_i]; + for (var _a = 0, v_1 = v; _a < v_1.length; _a++) { + var w = v_1[_a]; + array.push(w); + } + } + return array; + }; + /** + * Returns true if this dictionary at least one value associatted the specified key. + * @param {Object} key key whose presence in this dictionary is to be + * tested. + * @return {boolean} true if this dictionary at least one value associatted + * the specified key. + */ + MultiDictionary.prototype.containsKey = function (key) { + return this.dict.containsKey(key); + }; + /** + * Removes all mappings from this dictionary. + */ + MultiDictionary.prototype.clear = function () { + this.dict.clear(); + }; + /** + * Returns the number of keys in this dictionary. + * @return {number} the number of key-value mappings in this dictionary. + */ + MultiDictionary.prototype.size = function () { + return this.dict.size(); + }; + /** + * Returns true if this dictionary contains no mappings. + * @return {boolean} true if this dictionary contains no mappings. + */ + MultiDictionary.prototype.isEmpty = function () { + return this.dict.isEmpty(); + }; + return MultiDictionary; +}()); // end of multi dictionary +exports.default = MultiDictionary; +//# sourceMappingURL=MultiDictionary.js.map \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/MultiDictionary.js.map b/node_modules/typescript-collections/dist/lib/MultiDictionary.js.map new file mode 100644 index 00000000..f003b172 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/MultiDictionary.js.map @@ -0,0 +1 @@ +{"version":3,"file":"MultiDictionary.js","sourceRoot":"","sources":["../../src/lib/MultiDictionary.ts"],"names":[],"mappings":";;AAAA,6BAA+B;AAC/B,2CAAsC;AACtC,iCAAmC;AAEnC;IAUI;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAkCG;IACH,yBAAY,aAAkC,EAAE,oBAA8C,EAAE,oBAA4B;QAA5B,qCAAA,EAAA,4BAA4B;QACxH,IAAI,CAAC,IAAI,GAAG,IAAI,oBAAU,CAAc,aAAa,CAAC,CAAC;QACvD,IAAI,CAAC,OAAO,GAAG,oBAAoB,IAAI,IAAI,CAAC,aAAa,CAAC;QAC1D,IAAI,CAAC,cAAc,GAAG,oBAAoB,CAAC;IAC/C,CAAC;IACD;;;;;;;MAOE;IACF,kCAAQ,GAAR,UAAS,GAAM;QACX,IAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QACvC,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,EAAE,CAAC;QACd,CAAC;QACD,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC/B,CAAC;IAED;;;;;;;OAOG;IACH,kCAAQ,GAAR,UAAS,GAAM,EAAE,KAAQ;QAErB,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACnD,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;QACD,IAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QACtC,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,IAAI,CAAC;QAChB,CAAC;QACD,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC;YACvB,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBAC9C,MAAM,CAAC,KAAK,CAAC;YACjB,CAAC;QACL,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClB,MAAM,CAAC,IAAI,CAAC;IAChB,CAAC;IAED;;;;;;;;;;OAUG;IACH,gCAAM,GAAN,UAAO,GAAM,EAAE,KAAS;QACpB,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAChC,MAAM,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QAChC,CAAC;QACD,IAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QACtC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACxE,EAAE,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;gBACrB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAC1B,CAAC;YACD,MAAM,CAAC,IAAI,CAAC;QAChB,CAAC;QACD,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,8BAAI,GAAJ;QACI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAC5B,CAAC;IAED;;;OAGG;IACH,gCAAM,GAAN;QACI,IAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;QAClC,IAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,GAAG,CAAC,CAAY,UAAM,EAAN,iBAAM,EAAN,oBAAM,EAAN,IAAM;YAAjB,IAAM,CAAC,eAAA;YACR,GAAG,CAAC,CAAY,UAAC,EAAD,OAAC,EAAD,eAAC,EAAD,IAAC;gBAAZ,IAAM,CAAC,UAAA;gBACR,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;aACjB;SACJ;QACD,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IAED;;;;;;OAMG;IACH,qCAAW,GAAX,UAAY,GAAM;QACd,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IACtC,CAAC;IAED;;OAEG;IACH,+BAAK,GAAL;QACI,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;IAED;;;OAGG;IACH,8BAAI,GAAJ;QACI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAC5B,CAAC;IAED;;;OAGG;IACH,iCAAO,GAAP;QACI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;IAC/B,CAAC;IACL,sBAAC;AAAD,CAAC,AA/KD,IA+KC,CAAA,0BAA0B"} \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/MultiRootTree.d.ts b/node_modules/typescript-collections/dist/lib/MultiRootTree.d.ts new file mode 100644 index 00000000..0896ec6c --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/MultiRootTree.d.ts @@ -0,0 +1,61 @@ +export interface FlatTreeNode { + id: string; + level: number; + hasParent: boolean; + childrenCount: number; +} +export default class MultiRootTree { + rootIds: Array; + nodes: { + [id: string]: Array; + }; + constructor(rootIds?: Array, nodes?: { + [id: string]: Array; + }); + initRootIds(): void; + initNodes(): void; + createEmptyNodeIfNotExist(nodeKey: string): void; + getRootIds(): string[]; + getNodes(): { + [id: string]: string[]; + }; + getObject(): { + rootIds: string[]; + nodes: { + [id: string]: string[]; + }; + }; + toObject(): { + rootIds: string[]; + nodes: { + [id: string]: string[]; + }; + }; + flatten(): Array; + moveIdBeforeId(moveId: string, beforeId: string): void; + moveIdAfterId(moveId: string, afterId: string): void; + moveIdIntoId(moveId: string, insideId: string, atStart?: boolean): void; + swapRootIdWithRootId(rootId: string, withRootId: string): void; + swapRootPositionWithRootPosition(swapRootPosition: number, withRootPosition: number): void; + deleteId(id: string): void; + insertIdBeforeId(beforeId: string, insertId: string): void; + insertIdAfterId(belowId: string, insertId: string): void; + insertIdIntoId(insideId: string, insertId: string): void; + insertIdIntoRoot(id: string, position?: number): void; + insertIdIntoNode(nodeKey: string, id: string, position?: number): void; + private moveId(moveId, beforeId, direction); + private swapArrayElements(arr, indexA, indexB); + private rootDeleteId(id); + private nodeAndSubNodesDelete(nodeKey); + private nodeRefrencesDelete(id); + private nodeDelete(nodeKey); + private findRootId(id); + private findNodeId(nodeKey, id); + private findNode(nodeKey); + private nodeInsertAtStart(nodeKey, id); + private nodeInsertAtEnd(nodeKey, id); + private rootDelete(index); + private nodeDeleteAtIndex(nodeKey, index); + private rootInsertAtStart(id); + private rootInsertAtEnd(id); +} diff --git a/node_modules/typescript-collections/dist/lib/MultiRootTree.js b/node_modules/typescript-collections/dist/lib/MultiRootTree.js new file mode 100644 index 00000000..64952476 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/MultiRootTree.js @@ -0,0 +1,418 @@ +"use strict"; +Object.defineProperty(exports, "__esModule", { value: true }); +var Direction; +(function (Direction) { + Direction[Direction["BEFORE"] = 0] = "BEFORE"; + Direction[Direction["AFTER"] = 1] = "AFTER"; + Direction[Direction["INSIDE_AT_END"] = 2] = "INSIDE_AT_END"; + Direction[Direction["INSIDE_AT_START"] = 3] = "INSIDE_AT_START"; +})(Direction || (Direction = {})); +var MultiRootTree = /** @class */ (function () { + function MultiRootTree(rootIds, nodes) { + if (rootIds === void 0) { rootIds = []; } + if (nodes === void 0) { nodes = {}; } + this.rootIds = rootIds; + this.nodes = nodes; + this.initRootIds(); + this.initNodes(); + } + MultiRootTree.prototype.initRootIds = function () { + for (var _i = 0, _a = this.rootIds; _i < _a.length; _i++) { + var rootId = _a[_i]; + this.createEmptyNodeIfNotExist(rootId); + } + }; + MultiRootTree.prototype.initNodes = function () { + for (var nodeKey in this.nodes) { + if (this.nodes.hasOwnProperty(nodeKey)) { + for (var _i = 0, _a = this.nodes[nodeKey]; _i < _a.length; _i++) { + var nodeListItem = _a[_i]; + this.createEmptyNodeIfNotExist(nodeListItem); + } + } + } + }; + MultiRootTree.prototype.createEmptyNodeIfNotExist = function (nodeKey) { + if (!this.nodes[nodeKey]) { + this.nodes[nodeKey] = []; + } + }; + MultiRootTree.prototype.getRootIds = function () { + var clone = this.rootIds.slice(); + return clone; + }; + MultiRootTree.prototype.getNodes = function () { + var clone = {}; + for (var nodeKey in this.nodes) { + if (this.nodes.hasOwnProperty(nodeKey)) { + clone[nodeKey] = this.nodes[nodeKey].slice(); + } + } + return clone; + }; + MultiRootTree.prototype.getObject = function () { + return { + rootIds: this.getRootIds(), + nodes: this.getNodes(), + }; + }; + MultiRootTree.prototype.toObject = function () { + return this.getObject(); + }; + MultiRootTree.prototype.flatten = function () { + var _this = this; + var extraPropsObject = []; + for (var i = 0; i < this.rootIds.length; i++) { + var rootId = this.rootIds[i]; + extraPropsObject.push({ + id: rootId, + level: 0, + hasParent: false, + childrenCount: 0, + }); + traverse(rootId, this.nodes, extraPropsObject, 0); + } + for (var _i = 0, extraPropsObject_1 = extraPropsObject; _i < extraPropsObject_1.length; _i++) { + var o = extraPropsObject_1[_i]; + o.childrenCount = countChildren(o.id); + } + return extraPropsObject; + function countChildren(id) { + if (!_this.nodes[id]) { + return 0; + } + else { + var childrenCount = _this.nodes[id].length; + return childrenCount; + } + } + function traverse(startId, nodes, returnArray, level) { + if (level === void 0) { level = 0; } + if (!startId || !nodes || !returnArray || !nodes[startId]) { + return; + } + level++; + var idsList = nodes[startId]; + for (var i = 0; i < idsList.length; i++) { + var id = idsList[i]; + returnArray.push({ id: id, level: level, hasParent: true }); + traverse(id, nodes, returnArray, level); + } + level--; + } + }; + MultiRootTree.prototype.moveIdBeforeId = function (moveId, beforeId) { + return this.moveId(moveId, beforeId, Direction.BEFORE); + }; + MultiRootTree.prototype.moveIdAfterId = function (moveId, afterId) { + return this.moveId(moveId, afterId, Direction.AFTER); + }; + MultiRootTree.prototype.moveIdIntoId = function (moveId, insideId, atStart) { + if (atStart === void 0) { atStart = true; } + if (atStart) { + return this.moveId(moveId, insideId, Direction.INSIDE_AT_START); + } + else { + return this.moveId(moveId, insideId, Direction.INSIDE_AT_END); + } + }; + MultiRootTree.prototype.swapRootIdWithRootId = function (rootId, withRootId) { + var leftIndex = this.findRootId(rootId); + var rightIndex = this.findRootId(withRootId); + this.swapRootPositionWithRootPosition(leftIndex, rightIndex); + }; + MultiRootTree.prototype.swapRootPositionWithRootPosition = function (swapRootPosition, withRootPosition) { + var temp = this.rootIds[withRootPosition]; + this.rootIds[withRootPosition] = this.rootIds[swapRootPosition]; + this.rootIds[swapRootPosition] = temp; + }; + MultiRootTree.prototype.deleteId = function (id) { + this.rootDeleteId(id); + this.nodeAndSubNodesDelete(id); + this.nodeRefrencesDelete(id); + }; + MultiRootTree.prototype.insertIdBeforeId = function (beforeId, insertId) { + var foundRootIdIndex = this.findRootId(beforeId); + if (foundRootIdIndex > -1) { + this.insertIdIntoRoot(insertId, foundRootIdIndex); + } + for (var nodeKey in this.nodes) { + if (this.nodes.hasOwnProperty(nodeKey)) { + var foundNodeIdIndex = this.findNodeId(nodeKey, beforeId); + if (foundNodeIdIndex > -1) { + this.insertIdIntoNode(nodeKey, insertId, foundNodeIdIndex); + } + } + } + }; + MultiRootTree.prototype.insertIdAfterId = function (belowId, insertId) { + var foundRootIdIndex = this.findRootId(belowId); + if (foundRootIdIndex > -1) { + this.insertIdIntoRoot(insertId, foundRootIdIndex + 1); + } + for (var nodeKey in this.nodes) { + if (this.nodes.hasOwnProperty(nodeKey)) { + var foundNodeIdIndex = this.findNodeId(nodeKey, belowId); + if (foundNodeIdIndex > -1) { + this.insertIdIntoNode(nodeKey, insertId, foundNodeIdIndex + 1); + } + } + } + }; + MultiRootTree.prototype.insertIdIntoId = function (insideId, insertId) { + this.nodeInsertAtEnd(insideId, insertId); + this.nodes[insertId] = []; + }; + MultiRootTree.prototype.insertIdIntoRoot = function (id, position) { + if (position === undefined) { + this.rootInsertAtEnd(id); + } + else { + if (position < 0) { + var length_1 = this.rootIds.length; + this.rootIds.splice((position + length_1 + 1), 0, id); + } + else { + this.rootIds.splice(position, 0, id); + } + } + this.nodes[id] = this.nodes[id] || []; + }; + MultiRootTree.prototype.insertIdIntoNode = function (nodeKey, id, position) { + this.nodes[nodeKey] = this.nodes[nodeKey] || []; + this.nodes[id] = this.nodes[id] || []; + if (position === undefined) { + this.nodeInsertAtEnd(nodeKey, id); + } + else { + if (position < 0) { + var length_2 = this.nodes[nodeKey].length; + this.nodes[nodeKey].splice((position + length_2 + 1), 0, id); + } + else { + this.nodes[nodeKey].splice(position, 0, id); + } + } + }; + MultiRootTree.prototype.moveId = function (moveId, beforeId, direction) { + var sourceId = moveId; + var sourceRootIndex = this.findRootId(sourceId); + var sourceNodeKey; + var sourceNodeIdIndex; + if (this.nodes[beforeId]) { + sourceNodeKey = beforeId; + } + for (var nodeKey in this.nodes) { + if (this.nodes.hasOwnProperty(nodeKey)) { + sourceNodeIdIndex = this.findNodeId(nodeKey, beforeId); + break; + } + } + // got all + var targetId = beforeId; + var targetRootIndex = this.findRootId(targetId); + var targetNodeKey; + var targetNodeIdIndex; + if (this.nodes[beforeId]) { + targetNodeKey = beforeId; + } + for (var nodeKey in this.nodes) { + if (this.nodes.hasOwnProperty(nodeKey)) { + targetNodeIdIndex = this.findNodeId(nodeKey, beforeId); + break; + } + } + // got all + if (sourceRootIndex > -1) { + if (targetRootIndex > -1) { + // moving root to root + // console.log(`Moving ROOT to ROOT`); + // console.log(`RootIds:`); + // console.log(this.rootIds); + // console.log(`TargetIndex=${targetRootIndex}, SourceIndex=${sourceRootIndex}`); + // console.log(`TargetId=${targetId}, SourceId=${sourceId}`); + this.rootDelete(sourceRootIndex); // indexes change now + if (targetRootIndex > sourceRootIndex) { + targetRootIndex--; + } + else { + } + switch (direction) { + case Direction.BEFORE: + this.insertIdIntoRoot(sourceId, targetRootIndex); + break; + case Direction.AFTER: + this.insertIdIntoRoot(sourceId, targetRootIndex + 1); + break; + case Direction.INSIDE_AT_START: + this.nodeInsertAtStart(targetId, sourceId); + break; + case Direction.INSIDE_AT_END: + this.nodeInsertAtEnd(targetId, sourceId); + break; + } + } + else { + // moving root (source) ABOVE node (target) + // will remove one entry from roots + this.rootDelete(sourceRootIndex); + for (var nodeKey in this.nodes) { + if (this.nodes.hasOwnProperty(nodeKey)) { + var index = this.findNodeId(nodeKey, targetId); + if (index > -1) { + switch (direction) { + case Direction.BEFORE: + this.insertIdIntoNode(nodeKey, sourceId, index); + break; + case Direction.AFTER: + this.insertIdIntoNode(nodeKey, sourceId, index + 1); + break; + case Direction.INSIDE_AT_START: + this.nodeInsertAtStart(targetId, sourceId); + break; + case Direction.INSIDE_AT_END: + this.nodeInsertAtEnd(targetId, sourceId); + break; + } + break; + } + } + } + } + } + else { + if (targetRootIndex > -1) { + // moving node (source) ABOVE root (target) + // delete source id from each node + for (var nodeKey in this.nodes) { + if (this.nodes.hasOwnProperty(nodeKey)) { + var index = this.findNodeId(nodeKey, sourceId); + if (index > -1) { + // this.nodeInsertId(nodeKey, sourceId, index); + this.nodeDeleteAtIndex(nodeKey, index); + break; + } + } + } + switch (direction) { + case Direction.BEFORE: + this.insertIdIntoRoot(sourceId, targetRootIndex); + break; + case Direction.AFTER: + this.insertIdIntoRoot(sourceId, targetRootIndex + 1); + break; + case Direction.INSIDE_AT_START: + this.nodeInsertAtStart(targetId, sourceId); + break; + case Direction.INSIDE_AT_END: + this.nodeInsertAtEnd(targetId, sourceId); + break; + } + } + else { + // moving node (source) ABOVE node (target) + // delete source id from each node + for (var nodeKey in this.nodes) { + if (this.nodes.hasOwnProperty(nodeKey)) { + var index = this.findNodeId(nodeKey, sourceId); + if (index > -1) { + this.nodeDeleteAtIndex(nodeKey, index); + break; + } + } + } + for (var nodeKey in this.nodes) { + if (this.nodes.hasOwnProperty(nodeKey)) { + var index = this.findNodeId(nodeKey, targetId); + if (index > -1) { + switch (direction) { + case Direction.BEFORE: + this.insertIdIntoNode(nodeKey, sourceId, index); + break; + case Direction.AFTER: + this.insertIdIntoNode(nodeKey, sourceId, index + 1); + break; + case Direction.INSIDE_AT_START: + this.nodeInsertAtStart(targetId, sourceId); + break; + case Direction.INSIDE_AT_END: + this.nodeInsertAtEnd(targetId, sourceId); + break; + } + break; + } + } + } + } + } + }; + MultiRootTree.prototype.swapArrayElements = function (arr, indexA, indexB) { + var temp = arr[indexA]; + arr[indexA] = arr[indexB]; + arr[indexB] = temp; + return arr; + }; + MultiRootTree.prototype.rootDeleteId = function (id) { + var index = this.findRootId(id); + if (index > -1) { + this.rootDelete(index); + } + }; + MultiRootTree.prototype.nodeAndSubNodesDelete = function (nodeKey) { + var toDeleteLater = []; + for (var i = 0; i < this.nodes[nodeKey].length; i++) { + var id = this.nodes[nodeKey][i]; + this.nodeAndSubNodesDelete(id); + toDeleteLater.push(nodeKey); + } + this.nodeDelete(nodeKey); + for (var i = 0; i < toDeleteLater.length; i++) { + this.nodeDelete(toDeleteLater[i]); + } + }; + MultiRootTree.prototype.nodeRefrencesDelete = function (id) { + for (var nodeKey in this.nodes) { + if (this.nodes.hasOwnProperty(nodeKey)) { + for (var i = 0; i < this.nodes[nodeKey].length; i++) { + var targetId = this.nodes[nodeKey][i]; + if (targetId === id) { + this.nodeDeleteAtIndex(nodeKey, i); + } + } + } + } + }; + MultiRootTree.prototype.nodeDelete = function (nodeKey) { + delete this.nodes[nodeKey]; + }; + MultiRootTree.prototype.findRootId = function (id) { + return this.rootIds.indexOf(id); + }; + MultiRootTree.prototype.findNodeId = function (nodeKey, id) { + return this.nodes[nodeKey].indexOf(id); + }; + MultiRootTree.prototype.findNode = function (nodeKey) { + return this.nodes[nodeKey]; + }; + MultiRootTree.prototype.nodeInsertAtStart = function (nodeKey, id) { + this.nodes[nodeKey].unshift(id); + }; + MultiRootTree.prototype.nodeInsertAtEnd = function (nodeKey, id) { + this.nodes[nodeKey].push(id); + }; + MultiRootTree.prototype.rootDelete = function (index) { + this.rootIds.splice(index, 1); + }; + MultiRootTree.prototype.nodeDeleteAtIndex = function (nodeKey, index) { + this.nodes[nodeKey].splice(index, 1); + }; + MultiRootTree.prototype.rootInsertAtStart = function (id) { + this.rootIds.unshift(id); + }; + MultiRootTree.prototype.rootInsertAtEnd = function (id) { + this.rootIds.push(id); + }; + return MultiRootTree; +}()); +exports.default = MultiRootTree; +//# sourceMappingURL=MultiRootTree.js.map \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/MultiRootTree.js.map b/node_modules/typescript-collections/dist/lib/MultiRootTree.js.map new file mode 100644 index 00000000..14f70344 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/MultiRootTree.js.map @@ -0,0 +1 @@ +{"version":3,"file":"MultiRootTree.js","sourceRoot":"","sources":["../../src/lib/MultiRootTree.ts"],"names":[],"mappings":";;AACA,IAAK,SAKJ;AALD,WAAK,SAAS;IACV,6CAAM,CAAA;IACN,2CAAK,CAAA;IACL,2DAAa,CAAA;IACb,+DAAe,CAAA;AACnB,CAAC,EALI,SAAS,KAAT,SAAS,QAKb;AASD;IAKI,uBAAY,OAA2B,EAAE,KAA2C;QAAxE,wBAAA,EAAA,YAA2B;QAAE,sBAAA,EAAA,UAA2C;QAChF,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QAEnB,IAAI,CAAC,WAAW,EAAE,CAAC;QACnB,IAAI,CAAC,SAAS,EAAE,CAAC;IACrB,CAAC;IAED,mCAAW,GAAX;QACI,GAAG,CAAC,CAAe,UAAY,EAAZ,KAAA,IAAI,CAAC,OAAO,EAAZ,cAAY,EAAZ,IAAY;YAA1B,IAAI,MAAM,SAAA;YACX,IAAI,CAAC,yBAAyB,CAAC,MAAM,CAAC,CAAC;SAC1C;IACL,CAAC;IAED,iCAAS,GAAT;QACI,GAAG,CAAC,CAAC,IAAI,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC7B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACrC,GAAG,CAAC,CAAqB,UAAmB,EAAnB,KAAA,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAnB,cAAmB,EAAnB,IAAmB;oBAAvC,IAAI,YAAY,SAAA;oBACjB,IAAI,CAAC,yBAAyB,CAAC,YAAY,CAAC,CAAC;iBAChD;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED,iDAAyB,GAAzB,UAA0B,OAAe;QACrC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACvB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;QAC7B,CAAC;IACL,CAAC;IAGD,kCAAU,GAAV;QACI,IAAI,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACjC,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IAED,gCAAQ,GAAR;QACI,IAAI,KAAK,GAAoC,EAAE,CAAC;QAChD,GAAG,CAAC,CAAC,IAAI,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC7B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACrC,KAAK,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,CAAC;YACjD,CAAC;QACL,CAAC;QAED,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IAED,iCAAS,GAAT;QACI,MAAM,CAAC;YACH,OAAO,EAAE,IAAI,CAAC,UAAU,EAAE;YAC1B,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE;SACzB,CAAC;IACN,CAAC;IAED,gCAAQ,GAAR;QACI,MAAM,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;IAC5B,CAAC;IAED,+BAAO,GAAP;QACI,IAAM,KAAK,GAAG,IAAI,CAAC;QACnB,IAAI,gBAAgB,GAAwB,EAAE,CAAC;QAE/C,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,IAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC/B,gBAAgB,CAAC,IAAI,CAAC;gBAClB,EAAE,EAAE,MAAM;gBACV,KAAK,EAAE,CAAC;gBACR,SAAS,EAAE,KAAK;gBAChB,aAAa,EAAE,CAAC;aACnB,CAAC,CAAC;YAEH,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,EAAE,gBAAgB,EAAE,CAAC,CAAC,CAAC;QACtD,CAAC;QAED,GAAG,CAAC,CAAU,UAAgB,EAAhB,qCAAgB,EAAhB,8BAAgB,EAAhB,IAAgB;YAAzB,IAAI,CAAC,yBAAA;YACN,CAAC,CAAC,aAAa,GAAG,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;SACzC;QAED,MAAM,CAAC,gBAAgB,CAAC;QAExB,uBAAuB,EAAU;YAC7B,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACnB,MAAM,CAAC,CAAC,CAAC;YACb,CAAC;YAAC,IAAI,CAAC,CAAC;gBACJ,IAAM,aAAa,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC;gBAC7C,MAAM,CAAC,aAAa,CAAC;YACzB,CAAC;QACL,CAAC;QAED,kBAAkB,OAAe,EAAE,KAAsC,EAAE,WAAuB,EAAE,KAAS;YAAT,sBAAA,EAAA,SAAS;YACzG,EAAE,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,KAAK,IAAI,CAAC,WAAW,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACxD,MAAM,CAAC;YACX,CAAC;YAED,KAAK,EAAE,CAAC;YAER,IAAI,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC;YAC7B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,IAAI,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;gBACpB,WAAW,CAAC,IAAI,CAAC,EAAE,EAAE,IAAA,EAAE,KAAK,OAAA,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;gBACjD,QAAQ,CAAC,EAAE,EAAE,KAAK,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC;YAC5C,CAAC;YAED,KAAK,EAAE,CAAC;QACZ,CAAC;IACL,CAAC;IAED,sCAAc,GAAd,UAAe,MAAc,EAAE,QAAgB;QAC3C,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;IAC3D,CAAC;IAED,qCAAa,GAAb,UAAc,MAAc,EAAE,OAAe;QACzC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC;IACzD,CAAC;IAED,oCAAY,GAAZ,UAAa,MAAc,EAAE,QAAgB,EAAE,OAAc;QAAd,wBAAA,EAAA,cAAc;QACzD,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YACV,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,EAAE,SAAS,CAAC,eAAe,CAAC,CAAC;QACpE,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,EAAE,SAAS,CAAC,aAAa,CAAC,CAAC;QAClE,CAAC;IACL,CAAC;IAED,4CAAoB,GAApB,UAAqB,MAAc,EAAE,UAAkB;QACnD,IAAI,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QACxC,IAAI,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;QAC7C,IAAI,CAAC,gCAAgC,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;IACjE,CAAC;IAED,wDAAgC,GAAhC,UAAiC,gBAAwB,EAAE,gBAAwB;QAC/E,IAAI,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;QAC1C,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;QAChE,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,GAAG,IAAI,CAAC;IAC1C,CAAC;IAGD,gCAAQ,GAAR,UAAS,EAAU;QACf,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;QACtB,IAAI,CAAC,qBAAqB,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC;IACjC,CAAC;IAED,wCAAgB,GAAhB,UAAiB,QAAgB,EAAE,QAAgB;QAC/C,IAAI,gBAAgB,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QACjD,EAAE,CAAC,CAAC,gBAAgB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,gBAAgB,CAAC,CAAC;QACtD,CAAC;QAED,GAAG,CAAC,CAAC,IAAI,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC7B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACrC,IAAI,gBAAgB,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;gBAC1D,EAAE,CAAC,CAAC,gBAAgB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;oBACxB,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,QAAQ,EAAE,gBAAgB,CAAC,CAAC;gBAC/D,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED,uCAAe,GAAf,UAAgB,OAAe,EAAE,QAAgB;QAC7C,IAAI,gBAAgB,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QAChD,EAAE,CAAC,CAAC,gBAAgB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,gBAAgB,GAAG,CAAC,CAAC,CAAC;QAC1D,CAAC;QAED,GAAG,CAAC,CAAC,IAAI,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC7B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACrC,IAAI,gBAAgB,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;gBACzD,EAAE,CAAC,CAAC,gBAAgB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;oBACxB,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,QAAQ,EAAE,gBAAgB,GAAG,CAAC,CAAC,CAAC;gBACnE,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED,sCAAc,GAAd,UAAe,QAAgB,EAAE,QAAgB;QAC7C,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACzC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;IAC9B,CAAC;IAED,wCAAgB,GAAhB,UAAiB,EAAU,EAAE,QAAiB;QAC1C,EAAE,CAAC,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC;YACzB,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;QAC7B,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,EAAE,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC;gBACf,IAAM,QAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;gBACnC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,QAAQ,GAAG,QAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YACxD,CAAC;YAAC,IAAI,CAAC,CAAC;gBACJ,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YACzC,CAAC;QACL,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;IAC1C,CAAC;IAED,wCAAgB,GAAhB,UAAiB,OAAe,EAAE,EAAU,EAAE,QAAiB;QAC3D,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;QAChD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QACtC,EAAE,CAAC,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC;YACzB,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACtC,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,EAAE,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC;gBACf,IAAM,QAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;gBAC1C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,QAAQ,GAAG,QAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YAC/D,CAAC;YAAC,IAAI,CAAC,CAAC;gBACJ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YAChD,CAAC;QACL,CAAC;IACL,CAAC;IAEO,8BAAM,GAAd,UAAe,MAAc,EAAE,QAAgB,EAAE,SAAoB;QAEjE,IAAI,QAAQ,GAAG,MAAM,CAAC;QACtB,IAAM,eAAe,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QAClD,IAAI,aAAqB,CAAC;QAC1B,IAAI,iBAAyB,CAAC;QAE9B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACvB,aAAa,GAAG,QAAQ,CAAC;QAC7B,CAAC;QAED,GAAG,CAAC,CAAC,IAAI,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC7B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACrC,iBAAiB,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;gBACvD,KAAK,CAAC;YACV,CAAC;QACL,CAAC;QAED,UAAU;QAEV,IAAI,QAAQ,GAAG,QAAQ,CAAC;QACxB,IAAI,eAAe,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QAChD,IAAI,aAAqB,CAAC;QAC1B,IAAI,iBAAyB,CAAC;QAE9B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACvB,aAAa,GAAG,QAAQ,CAAC;QAC7B,CAAC;QAED,GAAG,CAAC,CAAC,IAAI,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC7B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACrC,iBAAiB,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;gBACvD,KAAK,CAAC;YACV,CAAC;QACL,CAAC;QAED,UAAU;QAEV,EAAE,CAAC,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACvB,EAAE,CAAC,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACvB,sBAAsB;gBACtB,sCAAsC;gBACtC,2BAA2B;gBAC3B,6BAA6B;gBAC7B,iFAAiF;gBACjF,6DAA6D;gBAE7D,IAAI,CAAC,UAAU,CAAC,eAAe,CAAC,CAAC,CAAC,qBAAqB;gBAEvD,EAAE,CAAC,CAAC,eAAe,GAAG,eAAe,CAAC,CAAC,CAAC;oBACpC,eAAe,EAAE,CAAC;gBACtB,CAAC;gBAAC,IAAI,CAAC,CAAC;gBAER,CAAC;gBAED,MAAM,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;oBAChB,KAAK,SAAS,CAAC,MAAM;wBACjB,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAC;wBACjD,KAAK,CAAC;oBACV,KAAK,SAAS,CAAC,KAAK;wBAChB,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,eAAe,GAAG,CAAC,CAAC,CAAC;wBACrD,KAAK,CAAC;oBACV,KAAK,SAAS,CAAC,eAAe;wBAC1B,IAAI,CAAC,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;wBAC3C,KAAK,CAAC;oBACV,KAAK,SAAS,CAAC,aAAa;wBACxB,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;wBACzC,KAAK,CAAC;gBACd,CAAC;YACL,CAAC;YAAC,IAAI,CAAC,CAAC;gBACJ,2CAA2C;gBAE3C,mCAAmC;gBACnC,IAAI,CAAC,UAAU,CAAC,eAAe,CAAC,CAAC;gBAEjC,GAAG,CAAC,CAAC,IAAI,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;oBAC7B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBACrC,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;wBAC/C,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;4BACb,MAAM,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;gCAChB,KAAK,SAAS,CAAC,MAAM;oCACjB,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;oCAChD,KAAK,CAAC;gCACV,KAAK,SAAS,CAAC,KAAK;oCAChB,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,QAAQ,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;oCACpD,KAAK,CAAC;gCACV,KAAK,SAAS,CAAC,eAAe;oCAC1B,IAAI,CAAC,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;oCAC3C,KAAK,CAAC;gCACV,KAAK,SAAS,CAAC,aAAa;oCACxB,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;oCACzC,KAAK,CAAC;4BACd,CAAC;4BACD,KAAK,CAAC;wBACV,CAAC;oBACL,CAAC;gBACL,CAAC;YACL,CAAC;QACL,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,EAAE,CAAC,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACvB,2CAA2C;gBAE3C,kCAAkC;gBAClC,GAAG,CAAC,CAAC,IAAI,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;oBAC7B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBACrC,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;wBAC/C,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;4BACb,+CAA+C;4BAC/C,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;4BACvC,KAAK,CAAC;wBACV,CAAC;oBACL,CAAC;gBACL,CAAC;gBAED,MAAM,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;oBAChB,KAAK,SAAS,CAAC,MAAM;wBACjB,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAC;wBACjD,KAAK,CAAC;oBACV,KAAK,SAAS,CAAC,KAAK;wBAChB,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,eAAe,GAAG,CAAC,CAAC,CAAC;wBACrD,KAAK,CAAC;oBACV,KAAK,SAAS,CAAC,eAAe;wBAC1B,IAAI,CAAC,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;wBAC3C,KAAK,CAAC;oBACV,KAAK,SAAS,CAAC,aAAa;wBACxB,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;wBACzC,KAAK,CAAC;gBACd,CAAC;YAEL,CAAC;YAAC,IAAI,CAAC,CAAC;gBACJ,2CAA2C;gBAE3C,kCAAkC;gBAClC,GAAG,CAAC,CAAC,IAAI,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;oBAC7B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBACrC,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;wBAC/C,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;4BACb,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;4BACvC,KAAK,CAAC;wBACV,CAAC;oBACL,CAAC;gBACL,CAAC;gBAED,GAAG,CAAC,CAAC,IAAI,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;oBAC7B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBACrC,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;wBAC/C,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;4BACb,MAAM,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;gCAChB,KAAK,SAAS,CAAC,MAAM;oCACjB,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;oCAChD,KAAK,CAAC;gCACV,KAAK,SAAS,CAAC,KAAK;oCAChB,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,QAAQ,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;oCACpD,KAAK,CAAC;gCACV,KAAK,SAAS,CAAC,eAAe;oCAC1B,IAAI,CAAC,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;oCAC3C,KAAK,CAAC;gCACV,KAAK,SAAS,CAAC,aAAa;oCACxB,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;oCACzC,KAAK,CAAC;4BACd,CAAC;4BACD,KAAK,CAAC;wBACV,CAAC;oBACL,CAAC;gBACL,CAAC;YAEL,CAAC;QACL,CAAC;IACL,CAAC;IAEO,yCAAiB,GAAzB,UAA0B,GAAe,EAAE,MAAc,EAAE,MAAc;QACrE,IAAI,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;QACvB,GAAG,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;QAC1B,GAAG,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;QACnB,MAAM,CAAC,GAAG,CAAC;IACf,CAAC;IAEO,oCAAY,GAApB,UAAqB,EAAU;QAC3B,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QAChC,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACb,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QAC3B,CAAC;IACL,CAAC;IAEO,6CAAqB,GAA7B,UAA8B,OAAe;QACzC,IAAI,aAAa,GAAkB,EAAE,CAAC;QACtC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClD,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,CAAC,qBAAqB,CAAC,EAAE,CAAC,CAAC;YAC/B,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAChC,CAAC;QAED,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACzB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,IAAI,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC;IACL,CAAC;IAEO,2CAAmB,GAA3B,UAA4B,EAAU;QAClC,GAAG,CAAC,CAAC,IAAI,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC7B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACrC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAClD,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;oBACtC,EAAE,CAAC,CAAC,QAAQ,KAAK,EAAE,CAAC,CAAC,CAAC;wBAClB,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;oBACvC,CAAC;gBACL,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAEO,kCAAU,GAAlB,UAAmB,OAAe;QAC9B,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC/B,CAAC;IAGO,kCAAU,GAAlB,UAAmB,EAAU;QACzB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACpC,CAAC;IAEO,kCAAU,GAAlB,UAAmB,OAAe,EAAE,EAAU;QAC1C,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAC3C,CAAC;IAEO,gCAAQ,GAAhB,UAAiB,OAAe;QAC5B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC/B,CAAC;IAGO,yCAAiB,GAAzB,UAA0B,OAAe,EAAE,EAAU;QACjD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACpC,CAAC;IAEO,uCAAe,GAAvB,UAAwB,OAAe,EAAE,EAAU;QAC/C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjC,CAAC;IAEO,kCAAU,GAAlB,UAAmB,KAAa;QAC5B,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAClC,CAAC;IAEO,yCAAiB,GAAzB,UAA0B,OAAe,EAAE,KAAa;QACpD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACzC,CAAC;IAEO,yCAAiB,GAAzB,UAA0B,EAAU;QAChC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAC7B,CAAC;IAEO,uCAAe,GAAvB,UAAwB,EAAU;QAC9B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC1B,CAAC;IACL,oBAAC;AAAD,CAAC,AAldD,IAkdC"} \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/PriorityQueue.d.ts b/node_modules/typescript-collections/dist/lib/PriorityQueue.d.ts new file mode 100644 index 00000000..81c2f1e5 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/PriorityQueue.d.ts @@ -0,0 +1,82 @@ +import * as util from './util'; +export default class PriorityQueue { + private heap; + /** + * Creates an empty priority queue. + * @class

In a priority queue each element is associated with a "priority", + * elements are dequeued in highest-priority-first order (the elements with the + * highest priority are dequeued first). Priority Queues are implemented as heaps. + * If the inserted elements are custom objects a compare function must be provided, + * otherwise the <=, === and >= operators are used to compare object priority.

+ * 
+     * function compare(a, b) {
+     *  if (a is less than b by some ordering criterion) {
+     *     return -1;
+     *  } if (a is greater than b by the ordering criterion) {
+     *     return 1;
+     *  }
+     *  // a must be equal to b
+     *  return 0;
+     * }
+     *
+ * @constructor + * @param {function(Object,Object):number=} compareFunction optional + * function used to compare two element priorities. Must return a negative integer, + * zero, or a positive integer as the first argument is less than, equal to, + * or greater than the second. + */ + constructor(compareFunction?: util.ICompareFunction); + /** + * Inserts the specified element into this priority queue. + * @param {Object} element the element to insert. + * @return {boolean} true if the element was inserted, or false if it is undefined. + */ + enqueue(element: T): boolean; + /** + * Inserts the specified element into this priority queue. + * @param {Object} element the element to insert. + * @return {boolean} true if the element was inserted, or false if it is undefined. + */ + add(element: T): boolean; + /** + * Retrieves and removes the highest priority element of this queue. + * @return {*} the the highest priority element of this queue, + * or undefined if this queue is empty. + */ + dequeue(): T | undefined; + /** + * Retrieves, but does not remove, the highest priority element of this queue. + * @return {*} the highest priority element of this queue, or undefined if this queue is empty. + */ + peek(): T | undefined; + /** + * Returns true if this priority queue contains the specified element. + * @param {Object} element element to search for. + * @return {boolean} true if this priority queue contains the specified element, + * false otherwise. + */ + contains(element: T): boolean; + /** + * Checks if this priority queue is empty. + * @return {boolean} true if and only if this priority queue contains no items; false + * otherwise. + */ + isEmpty(): boolean; + /** + * Returns the number of elements in this priority queue. + * @return {number} the number of elements in this priority queue. + */ + size(): number; + /** + * Removes all of the elements from this priority queue. + */ + clear(): void; + /** + * Executes the provided function once for each element present in this queue in + * no particular order. + * @param {function(Object):*} callback function to execute, it is + * invoked with one argument: the element value, to break the iteration you can + * optionally return false. + */ + forEach(callback: util.ILoopFunction): void; +} diff --git a/node_modules/typescript-collections/dist/lib/PriorityQueue.js b/node_modules/typescript-collections/dist/lib/PriorityQueue.js new file mode 100644 index 00000000..9831c081 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/PriorityQueue.js @@ -0,0 +1,112 @@ +"use strict"; +Object.defineProperty(exports, "__esModule", { value: true }); +var util = require("./util"); +var Heap_1 = require("./Heap"); +var PriorityQueue = /** @class */ (function () { + /** + * Creates an empty priority queue. + * @class

In a priority queue each element is associated with a "priority", + * elements are dequeued in highest-priority-first order (the elements with the + * highest priority are dequeued first). Priority Queues are implemented as heaps. + * If the inserted elements are custom objects a compare function must be provided, + * otherwise the <=, === and >= operators are used to compare object priority.

+ * 
+     * function compare(a, b) {
+     *  if (a is less than b by some ordering criterion) {
+     *     return -1;
+     *  } if (a is greater than b by the ordering criterion) {
+     *     return 1;
+     *  }
+     *  // a must be equal to b
+     *  return 0;
+     * }
+     *
+ * @constructor + * @param {function(Object,Object):number=} compareFunction optional + * function used to compare two element priorities. Must return a negative integer, + * zero, or a positive integer as the first argument is less than, equal to, + * or greater than the second. + */ + function PriorityQueue(compareFunction) { + this.heap = new Heap_1.default(util.reverseCompareFunction(compareFunction)); + } + /** + * Inserts the specified element into this priority queue. + * @param {Object} element the element to insert. + * @return {boolean} true if the element was inserted, or false if it is undefined. + */ + PriorityQueue.prototype.enqueue = function (element) { + return this.heap.add(element); + }; + /** + * Inserts the specified element into this priority queue. + * @param {Object} element the element to insert. + * @return {boolean} true if the element was inserted, or false if it is undefined. + */ + PriorityQueue.prototype.add = function (element) { + return this.heap.add(element); + }; + /** + * Retrieves and removes the highest priority element of this queue. + * @return {*} the the highest priority element of this queue, + * or undefined if this queue is empty. + */ + PriorityQueue.prototype.dequeue = function () { + if (this.heap.size() !== 0) { + var el = this.heap.peek(); + this.heap.removeRoot(); + return el; + } + return undefined; + }; + /** + * Retrieves, but does not remove, the highest priority element of this queue. + * @return {*} the highest priority element of this queue, or undefined if this queue is empty. + */ + PriorityQueue.prototype.peek = function () { + return this.heap.peek(); + }; + /** + * Returns true if this priority queue contains the specified element. + * @param {Object} element element to search for. + * @return {boolean} true if this priority queue contains the specified element, + * false otherwise. + */ + PriorityQueue.prototype.contains = function (element) { + return this.heap.contains(element); + }; + /** + * Checks if this priority queue is empty. + * @return {boolean} true if and only if this priority queue contains no items; false + * otherwise. + */ + PriorityQueue.prototype.isEmpty = function () { + return this.heap.isEmpty(); + }; + /** + * Returns the number of elements in this priority queue. + * @return {number} the number of elements in this priority queue. + */ + PriorityQueue.prototype.size = function () { + return this.heap.size(); + }; + /** + * Removes all of the elements from this priority queue. + */ + PriorityQueue.prototype.clear = function () { + this.heap.clear(); + }; + /** + * Executes the provided function once for each element present in this queue in + * no particular order. + * @param {function(Object):*} callback function to execute, it is + * invoked with one argument: the element value, to break the iteration you can + * optionally return false. + */ + PriorityQueue.prototype.forEach = function (callback) { + this.heap.forEach(callback); + }; + return PriorityQueue; +}()); // end of priority queue +exports.default = PriorityQueue; +//# sourceMappingURL=PriorityQueue.js.map \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/PriorityQueue.js.map b/node_modules/typescript-collections/dist/lib/PriorityQueue.js.map new file mode 100644 index 00000000..77ca4cb2 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/PriorityQueue.js.map @@ -0,0 +1 @@ +{"version":3,"file":"PriorityQueue.js","sourceRoot":"","sources":["../../src/lib/PriorityQueue.ts"],"names":[],"mappings":";;AAAA,6BAA+B;AAC/B,+BAA0B;AAE1B;IAGI;;;;;;;;;;;;;;;;;;;;;;;OAuBG;IACH,uBAAY,eAA0C;QAClD,IAAI,CAAC,IAAI,GAAG,IAAI,cAAI,CAAI,IAAI,CAAC,sBAAsB,CAAC,eAAe,CAAC,CAAC,CAAC;IAC1E,CAAC;IAED;;;;OAIG;IACH,+BAAO,GAAP,UAAQ,OAAU;QACd,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAClC,CAAC;IAED;;;;OAIG;IACH,2BAAG,GAAH,UAAI,OAAU;QACV,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAClC,CAAC;IAED;;;;OAIG;IACH,+BAAO,GAAP;QACI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;YACzB,IAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YAC5B,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YACvB,MAAM,CAAC,EAAE,CAAC;QACd,CAAC;QACD,MAAM,CAAC,SAAS,CAAC;IACrB,CAAC;IAED;;;OAGG;IACH,4BAAI,GAAJ;QACI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAC5B,CAAC;IAED;;;;;OAKG;IACH,gCAAQ,GAAR,UAAS,OAAU;QACf,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;IACvC,CAAC;IAED;;;;OAIG;IACH,+BAAO,GAAP;QACI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;IAC/B,CAAC;IAED;;;OAGG;IACH,4BAAI,GAAJ;QACI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,6BAAK,GAAL;QACI,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;IAED;;;;;;OAMG;IACH,+BAAO,GAAP,UAAQ,QAA+B;QACnC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IAChC,CAAC;IAEL,oBAAC;AAAD,CAAC,AApHD,IAoHC,CAAC,wBAAwB"} \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/Queue.d.ts b/node_modules/typescript-collections/dist/lib/Queue.d.ts new file mode 100644 index 00000000..10551d3d --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/Queue.d.ts @@ -0,0 +1,81 @@ +import * as util from './util'; +export default class Queue { + /** + * List containing the elements. + * @type collections.LinkedList + * @private + */ + private list; + /** + * Creates an empty queue. + * @class A queue is a First-In-First-Out (FIFO) data structure, the first + * element added to the queue will be the first one to be removed. This + * implementation uses a linked list as a container. + * @constructor + */ + constructor(); + /** + * Inserts the specified element into the end of this queue. + * @param {Object} elem the element to insert. + * @return {boolean} true if the element was inserted, or false if it is undefined. + */ + enqueue(elem: T): boolean; + /** + * Inserts the specified element into the end of this queue. + * @param {Object} elem the element to insert. + * @return {boolean} true if the element was inserted, or false if it is undefined. + */ + add(elem: T): boolean; + /** + * Retrieves and removes the head of this queue. + * @return {*} the head of this queue, or undefined if this queue is empty. + */ + dequeue(): T | undefined; + /** + * Retrieves, but does not remove, the head of this queue. + * @return {*} the head of this queue, or undefined if this queue is empty. + */ + peek(): T | undefined; + /** + * Returns the number of elements in this queue. + * @return {number} the number of elements in this queue. + */ + size(): number; + /** + * Returns true if this queue contains the specified element. + *

If the elements inside this stack are + * not comparable with the === operator, a custom equals function should be + * provided to perform searches, the function must receive two arguments and + * return true if they are equal, false otherwise. Example:

+ * + * 
+     * const petsAreEqualByName (pet1, pet2) {
+     *  return pet1.name === pet2.name;
+     * }
+     *
+ * @param {Object} elem element to search for. + * @param {function(Object,Object):boolean=} equalsFunction optional + * function to check if two elements are equal. + * @return {boolean} true if this queue contains the specified element, + * false otherwise. + */ + contains(elem: T, equalsFunction?: util.IEqualsFunction): boolean; + /** + * Checks if this queue is empty. + * @return {boolean} true if and only if this queue contains no items; false + * otherwise. + */ + isEmpty(): boolean; + /** + * Removes all of the elements from this queue. + */ + clear(): void; + /** + * Executes the provided function once for each element present in this queue in + * FIFO order. + * @param {function(Object):*} callback function to execute, it is + * invoked with one argument: the element value, to break the iteration you can + * optionally return false. + */ + forEach(callback: util.ILoopFunction): void; +} diff --git a/node_modules/typescript-collections/dist/lib/Queue.js b/node_modules/typescript-collections/dist/lib/Queue.js new file mode 100644 index 00000000..5d914712 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/Queue.js @@ -0,0 +1,108 @@ +"use strict"; +Object.defineProperty(exports, "__esModule", { value: true }); +var LinkedList_1 = require("./LinkedList"); +var Queue = /** @class */ (function () { + /** + * Creates an empty queue. + * @class A queue is a First-In-First-Out (FIFO) data structure, the first + * element added to the queue will be the first one to be removed. This + * implementation uses a linked list as a container. + * @constructor + */ + function Queue() { + this.list = new LinkedList_1.default(); + } + /** + * Inserts the specified element into the end of this queue. + * @param {Object} elem the element to insert. + * @return {boolean} true if the element was inserted, or false if it is undefined. + */ + Queue.prototype.enqueue = function (elem) { + return this.list.add(elem); + }; + /** + * Inserts the specified element into the end of this queue. + * @param {Object} elem the element to insert. + * @return {boolean} true if the element was inserted, or false if it is undefined. + */ + Queue.prototype.add = function (elem) { + return this.list.add(elem); + }; + /** + * Retrieves and removes the head of this queue. + * @return {*} the head of this queue, or undefined if this queue is empty. + */ + Queue.prototype.dequeue = function () { + if (this.list.size() !== 0) { + var el = this.list.first(); + this.list.removeElementAtIndex(0); + return el; + } + return undefined; + }; + /** + * Retrieves, but does not remove, the head of this queue. + * @return {*} the head of this queue, or undefined if this queue is empty. + */ + Queue.prototype.peek = function () { + if (this.list.size() !== 0) { + return this.list.first(); + } + return undefined; + }; + /** + * Returns the number of elements in this queue. + * @return {number} the number of elements in this queue. + */ + Queue.prototype.size = function () { + return this.list.size(); + }; + /** + * Returns true if this queue contains the specified element. + *

If the elements inside this stack are + * not comparable with the === operator, a custom equals function should be + * provided to perform searches, the function must receive two arguments and + * return true if they are equal, false otherwise. Example:

+ * + * 
+     * const petsAreEqualByName (pet1, pet2) {
+     *  return pet1.name === pet2.name;
+     * }
+     *
+ * @param {Object} elem element to search for. + * @param {function(Object,Object):boolean=} equalsFunction optional + * function to check if two elements are equal. + * @return {boolean} true if this queue contains the specified element, + * false otherwise. + */ + Queue.prototype.contains = function (elem, equalsFunction) { + return this.list.contains(elem, equalsFunction); + }; + /** + * Checks if this queue is empty. + * @return {boolean} true if and only if this queue contains no items; false + * otherwise. + */ + Queue.prototype.isEmpty = function () { + return this.list.size() <= 0; + }; + /** + * Removes all of the elements from this queue. + */ + Queue.prototype.clear = function () { + this.list.clear(); + }; + /** + * Executes the provided function once for each element present in this queue in + * FIFO order. + * @param {function(Object):*} callback function to execute, it is + * invoked with one argument: the element value, to break the iteration you can + * optionally return false. + */ + Queue.prototype.forEach = function (callback) { + this.list.forEach(callback); + }; + return Queue; +}()); // End of queue +exports.default = Queue; +//# sourceMappingURL=Queue.js.map \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/Queue.js.map b/node_modules/typescript-collections/dist/lib/Queue.js.map new file mode 100644 index 00000000..ac7ccf97 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/Queue.js.map @@ -0,0 +1 @@ +{"version":3,"file":"Queue.js","sourceRoot":"","sources":["../../src/lib/Queue.ts"],"names":[],"mappings":";;AACA,2CAAsC;AAGtC;IASI;;;;;;OAMG;IACH;QACI,IAAI,CAAC,IAAI,GAAG,IAAI,oBAAU,EAAK,CAAC;IACpC,CAAC;IAGD;;;;OAIG;IACH,uBAAO,GAAP,UAAQ,IAAO;QACX,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC;IACD;;;;OAIG;IACH,mBAAG,GAAH,UAAI,IAAO;QACP,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC;IACD;;;OAGG;IACH,uBAAO,GAAP;QACI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;YACzB,IAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YAC7B,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;YAClC,MAAM,CAAC,EAAE,CAAC;QACd,CAAC;QACD,MAAM,CAAC,SAAS,CAAC;IACrB,CAAC;IACD;;;OAGG;IACH,oBAAI,GAAJ;QAEI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;YACzB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;QAC7B,CAAC;QACD,MAAM,CAAC,SAAS,CAAC;IACrB,CAAC;IAED;;;OAGG;IACH,oBAAI,GAAJ;QACI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAC5B,CAAC;IAED;;;;;;;;;;;;;;;;;OAiBG;IACH,wBAAQ,GAAR,UAAS,IAAO,EAAE,cAAwC;QACtD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;IACpD,CAAC;IAED;;;;OAIG;IACH,uBAAO,GAAP;QACI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACjC,CAAC;IAED;;OAEG;IACH,qBAAK,GAAL;QACI,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;IAED;;;;;;OAMG;IACH,uBAAO,GAAP,UAAQ,QAA+B;QACnC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IAChC,CAAC;IAEL,YAAC;AAAD,CAAC,AAtHD,IAsHC,CAAC,eAAe"} \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/Set.d.ts b/node_modules/typescript-collections/dist/lib/Set.d.ts new file mode 100644 index 00000000..26acbacf --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/Set.d.ts @@ -0,0 +1,99 @@ +import * as util from './util'; +import Dictionary from './Dictionary'; +export default class Set { + /** + * Dictionary key and value holds the elements in the set. + * @type {Object} + * @protected + */ + protected dictionary: Dictionary; + /** + * Creates an empty set. + * @class

A set is a data structure that contains no duplicate items.

+ *

If the inserted elements are custom objects a function + * which converts elements to strings must be provided. Example:

+ * + * 
+     * function petToString(pet) {
+     *  return pet.name;
+     * }
+     *
+ * + * @constructor + * @param {function(Object):string=} toStringFunction optional function used + * to convert elements to strings. If the elements aren't strings or if toString() + * is not appropriate, a custom function which receives an object and returns a + * unique string must be provided. + */ + constructor(toStringFunction?: (item: T) => string); + /** + * Returns true if this set contains the specified element. + * @param {Object} element element to search for. + * @return {boolean} true if this set contains the specified element, + * false otherwise. + */ + contains(element: T): boolean; + /** + * Adds the specified element to this set if it is not already present. + * @param {Object} element the element to insert. + * @return {boolean} true if this set did not already contain the specified element. + */ + add(element: T): boolean; + /** + * Performs an intersecion between this and another set. + * Removes all values that are not present this set and the given set. + * @param {collections.Set} otherSet other set. + */ + intersection(otherSet: Set): void; + /** + * Performs a union between this and another set. + * Adds all values from the given set to this set. + * @param {collections.Set} otherSet other set. + */ + union(otherSet: Set): void; + /** + * Performs a difference between this and another set. + * Removes from this set all the values that are present in the given set. + * @param {collections.Set} otherSet other set. + */ + difference(otherSet: Set): void; + /** + * Checks whether the given set contains all the elements in this set. + * @param {collections.Set} otherSet other set. + * @return {boolean} true if this set is a subset of the given set. + */ + isSubsetOf(otherSet: Set): boolean; + /** + * Removes the specified element from this set if it is present. + * @return {boolean} true if this set contained the specified element. + */ + remove(element: T): boolean; + /** + * Executes the provided function once for each element + * present in this set. + * @param {function(Object):*} callback function to execute, it is + * invoked with one arguments: the element. To break the iteration you can + * optionally return false. + */ + forEach(callback: util.ILoopFunction): void; + /** + * Returns an array containing all of the elements in this set in arbitrary order. + * @return {Array} an array containing all of the elements in this set. + */ + toArray(): T[]; + /** + * Returns true if this set contains no elements. + * @return {boolean} true if this set contains no elements. + */ + isEmpty(): boolean; + /** + * Returns the number of elements in this set. + * @return {number} the number of elements in this set. + */ + size(): number; + /** + * Removes all of the elements from this set. + */ + clear(): void; + toString(): string; +} diff --git a/node_modules/typescript-collections/dist/lib/Set.js b/node_modules/typescript-collections/dist/lib/Set.js new file mode 100644 index 00000000..8ad8e5df --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/Set.js @@ -0,0 +1,169 @@ +"use strict"; +Object.defineProperty(exports, "__esModule", { value: true }); +var util = require("./util"); +var arrays = require("./arrays"); +var Dictionary_1 = require("./Dictionary"); +var Set = /** @class */ (function () { + /** + * Creates an empty set. + * @class

A set is a data structure that contains no duplicate items.

+ *

If the inserted elements are custom objects a function + * which converts elements to strings must be provided. Example:

+ * + * 
+     * function petToString(pet) {
+     *  return pet.name;
+     * }
+     *
+ * + * @constructor + * @param {function(Object):string=} toStringFunction optional function used + * to convert elements to strings. If the elements aren't strings or if toString() + * is not appropriate, a custom function which receives an object and returns a + * unique string must be provided. + */ + function Set(toStringFunction) { + this.dictionary = new Dictionary_1.default(toStringFunction); + } + /** + * Returns true if this set contains the specified element. + * @param {Object} element element to search for. + * @return {boolean} true if this set contains the specified element, + * false otherwise. + */ + Set.prototype.contains = function (element) { + return this.dictionary.containsKey(element); + }; + /** + * Adds the specified element to this set if it is not already present. + * @param {Object} element the element to insert. + * @return {boolean} true if this set did not already contain the specified element. + */ + Set.prototype.add = function (element) { + if (this.contains(element) || util.isUndefined(element)) { + return false; + } + else { + this.dictionary.setValue(element, element); + return true; + } + }; + /** + * Performs an intersecion between this and another set. + * Removes all values that are not present this set and the given set. + * @param {collections.Set} otherSet other set. + */ + Set.prototype.intersection = function (otherSet) { + var set = this; + this.forEach(function (element) { + if (!otherSet.contains(element)) { + set.remove(element); + } + return true; + }); + }; + /** + * Performs a union between this and another set. + * Adds all values from the given set to this set. + * @param {collections.Set} otherSet other set. + */ + Set.prototype.union = function (otherSet) { + var set = this; + otherSet.forEach(function (element) { + set.add(element); + return true; + }); + }; + /** + * Performs a difference between this and another set. + * Removes from this set all the values that are present in the given set. + * @param {collections.Set} otherSet other set. + */ + Set.prototype.difference = function (otherSet) { + var set = this; + otherSet.forEach(function (element) { + set.remove(element); + return true; + }); + }; + /** + * Checks whether the given set contains all the elements in this set. + * @param {collections.Set} otherSet other set. + * @return {boolean} true if this set is a subset of the given set. + */ + Set.prototype.isSubsetOf = function (otherSet) { + if (this.size() > otherSet.size()) { + return false; + } + var isSub = true; + this.forEach(function (element) { + if (!otherSet.contains(element)) { + isSub = false; + return false; + } + return true; + }); + return isSub; + }; + /** + * Removes the specified element from this set if it is present. + * @return {boolean} true if this set contained the specified element. + */ + Set.prototype.remove = function (element) { + if (!this.contains(element)) { + return false; + } + else { + this.dictionary.remove(element); + return true; + } + }; + /** + * Executes the provided function once for each element + * present in this set. + * @param {function(Object):*} callback function to execute, it is + * invoked with one arguments: the element. To break the iteration you can + * optionally return false. + */ + Set.prototype.forEach = function (callback) { + this.dictionary.forEach(function (k, v) { + return callback(v); + }); + }; + /** + * Returns an array containing all of the elements in this set in arbitrary order. + * @return {Array} an array containing all of the elements in this set. + */ + Set.prototype.toArray = function () { + return this.dictionary.values(); + }; + /** + * Returns true if this set contains no elements. + * @return {boolean} true if this set contains no elements. + */ + Set.prototype.isEmpty = function () { + return this.dictionary.isEmpty(); + }; + /** + * Returns the number of elements in this set. + * @return {number} the number of elements in this set. + */ + Set.prototype.size = function () { + return this.dictionary.size(); + }; + /** + * Removes all of the elements from this set. + */ + Set.prototype.clear = function () { + this.dictionary.clear(); + }; + /* + * Provides a string representation for display + */ + Set.prototype.toString = function () { + return arrays.toString(this.toArray()); + }; + return Set; +}()); // end of Set +exports.default = Set; +//# sourceMappingURL=Set.js.map \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/Set.js.map b/node_modules/typescript-collections/dist/lib/Set.js.map new file mode 100644 index 00000000..80fe06ee --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/Set.js.map @@ -0,0 +1 @@ +{"version":3,"file":"Set.js","sourceRoot":"","sources":["../../src/lib/Set.ts"],"names":[],"mappings":";;AAAA,6BAA+B;AAE/B,iCAAmC;AAEnC,2CAAsC;AAEtC;IASI;;;;;;;;;;;;;;;;;OAiBG;IACH,aAAY,gBAAsC;QAC9C,IAAI,CAAC,UAAU,GAAG,IAAI,oBAAU,CAAS,gBAAgB,CAAC,CAAC;IAC/D,CAAC;IAID;;;;;OAKG;IACH,sBAAQ,GAAR,UAAS,OAAU;QACf,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;IAChD,CAAC;IAED;;;;OAIG;IACH,iBAAG,GAAH,UAAI,OAAU;QACV,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAC3C,MAAM,CAAC,IAAI,CAAC;QAChB,CAAC;IACL,CAAC;IAED;;;;OAIG;IACH,0BAAY,GAAZ,UAAa,QAAgB;QACzB,IAAM,GAAG,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,OAAO,CAAC,UAAS,OAAU;YAC5B,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBAC9B,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACxB,CAAC;YACD,MAAM,CAAC,IAAI,CAAC;QAChB,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;;OAIG;IACH,mBAAK,GAAL,UAAM,QAAgB;QAClB,IAAM,GAAG,GAAG,IAAI,CAAC;QACjB,QAAQ,CAAC,OAAO,CAAC,UAAS,OAAU;YAChC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACjB,MAAM,CAAC,IAAI,CAAC;QAChB,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;;OAIG;IACH,wBAAU,GAAV,UAAW,QAAgB;QACvB,IAAM,GAAG,GAAG,IAAI,CAAC;QACjB,QAAQ,CAAC,OAAO,CAAC,UAAS,OAAU;YAChC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC;QAChB,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;;OAIG;IACH,wBAAU,GAAV,UAAW,QAAgB;QAEvB,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAChC,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;QAED,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,OAAO,CAAC,UAAS,OAAO;YACzB,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBAC9B,KAAK,GAAG,KAAK,CAAC;gBACd,MAAM,CAAC,KAAK,CAAC;YACjB,CAAC;YACD,MAAM,CAAC,IAAI,CAAC;QAChB,CAAC,CAAC,CAAC;QACH,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,oBAAM,GAAN,UAAO,OAAU;QACb,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAChC,MAAM,CAAC,IAAI,CAAC;QAChB,CAAC;IACL,CAAC;IAED;;;;;;OAMG;IACH,qBAAO,GAAP,UAAQ,QAA+B;QACnC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,UAAS,CAAC,EAAE,CAAC;YACjC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;OAGG;IACH,qBAAO,GAAP;QACI,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;IACpC,CAAC;IAED;;;OAGG;IACH,qBAAO,GAAP;QACI,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC;IACrC,CAAC;IAED;;;OAGG;IACH,kBAAI,GAAJ;QACI,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC;IAClC,CAAC;IAED;;OAEG;IACH,mBAAK,GAAL;QACI,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;IAC5B,CAAC;IAED;;MAEE;IACF,sBAAQ,GAAR;QACI,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;IAC3C,CAAC;IACL,UAAC;AAAD,CAAC,AAvLD,IAuLC,CAAA,aAAa"} \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/Stack.d.ts b/node_modules/typescript-collections/dist/lib/Stack.d.ts new file mode 100644 index 00000000..6bb2746f --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/Stack.d.ts @@ -0,0 +1,84 @@ +import * as util from './util'; +export default class Stack { + /** + * List containing the elements. + * @type collections.LinkedList + * @private + */ + private list; + /** + * Creates an empty Stack. + * @class A Stack is a Last-In-First-Out (LIFO) data structure, the last + * element added to the stack will be the first one to be removed. This + * implementation uses a linked list as a container. + * @constructor + */ + constructor(); + /** + * Pushes an item onto the top of this stack. + * @param {Object} elem the element to be pushed onto this stack. + * @return {boolean} true if the element was pushed or false if it is undefined. + */ + push(elem: T): boolean; + /** + * Pushes an item onto the top of this stack. + * @param {Object} elem the element to be pushed onto this stack. + * @return {boolean} true if the element was pushed or false if it is undefined. + */ + add(elem: T): boolean; + /** + * Removes the object at the top of this stack and returns that object. + * @return {*} the object at the top of this stack or undefined if the + * stack is empty. + */ + pop(): T | undefined; + /** + * Looks at the object at the top of this stack without removing it from the + * stack. + * @return {*} the object at the top of this stack or undefined if the + * stack is empty. + */ + peek(): T | undefined; + /** + * Returns the number of elements in this stack. + * @return {number} the number of elements in this stack. + */ + size(): number; + /** + * Returns true if this stack contains the specified element. + *

If the elements inside this stack are + * not comparable with the === operator, a custom equals function should be + * provided to perform searches, the function must receive two arguments and + * return true if they are equal, false otherwise. Example:

+ * + * 
+     * const petsAreEqualByName (pet1, pet2) {
+     *  return pet1.name === pet2.name;
+     * }
+     *
+ * @param {Object} elem element to search for. + * @param {function(Object,Object):boolean=} equalsFunction optional + * function to check if two elements are equal. + * @return {boolean} true if this stack contains the specified element, + * false otherwise. + */ + contains(elem: T, equalsFunction?: util.IEqualsFunction): boolean; + /** + * Checks if this stack is empty. + * @return {boolean} true if and only if this stack contains no items; false + * otherwise. + */ + isEmpty(): boolean; + /** + * Removes all of the elements from this stack. + */ + clear(): void; + /** + * Executes the provided function once for each element present in this stack in + * LIFO order. + * @param {function(Object):*} callback function to execute, it is + * invoked with one argument: the element value, to break the iteration you can + * optionally return false. + */ + forEach(callback: util.ILoopFunction): void; +} diff --git a/node_modules/typescript-collections/dist/lib/Stack.js b/node_modules/typescript-collections/dist/lib/Stack.js new file mode 100644 index 00000000..c79f38e3 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/Stack.js @@ -0,0 +1,103 @@ +"use strict"; +Object.defineProperty(exports, "__esModule", { value: true }); +var LinkedList_1 = require("./LinkedList"); +var Stack = /** @class */ (function () { + /** + * Creates an empty Stack. + * @class A Stack is a Last-In-First-Out (LIFO) data structure, the last + * element added to the stack will be the first one to be removed. This + * implementation uses a linked list as a container. + * @constructor + */ + function Stack() { + this.list = new LinkedList_1.default(); + } + /** + * Pushes an item onto the top of this stack. + * @param {Object} elem the element to be pushed onto this stack. + * @return {boolean} true if the element was pushed or false if it is undefined. + */ + Stack.prototype.push = function (elem) { + return this.list.add(elem, 0); + }; + /** + * Pushes an item onto the top of this stack. + * @param {Object} elem the element to be pushed onto this stack. + * @return {boolean} true if the element was pushed or false if it is undefined. + */ + Stack.prototype.add = function (elem) { + return this.list.add(elem, 0); + }; + /** + * Removes the object at the top of this stack and returns that object. + * @return {*} the object at the top of this stack or undefined if the + * stack is empty. + */ + Stack.prototype.pop = function () { + return this.list.removeElementAtIndex(0); + }; + /** + * Looks at the object at the top of this stack without removing it from the + * stack. + * @return {*} the object at the top of this stack or undefined if the + * stack is empty. + */ + Stack.prototype.peek = function () { + return this.list.first(); + }; + /** + * Returns the number of elements in this stack. + * @return {number} the number of elements in this stack. + */ + Stack.prototype.size = function () { + return this.list.size(); + }; + /** + * Returns true if this stack contains the specified element. + *

If the elements inside this stack are + * not comparable with the === operator, a custom equals function should be + * provided to perform searches, the function must receive two arguments and + * return true if they are equal, false otherwise. Example:

+ * + * 
+     * const petsAreEqualByName (pet1, pet2) {
+     *  return pet1.name === pet2.name;
+     * }
+     *
+ * @param {Object} elem element to search for. + * @param {function(Object,Object):boolean=} equalsFunction optional + * function to check if two elements are equal. + * @return {boolean} true if this stack contains the specified element, + * false otherwise. + */ + Stack.prototype.contains = function (elem, equalsFunction) { + return this.list.contains(elem, equalsFunction); + }; + /** + * Checks if this stack is empty. + * @return {boolean} true if and only if this stack contains no items; false + * otherwise. + */ + Stack.prototype.isEmpty = function () { + return this.list.isEmpty(); + }; + /** + * Removes all of the elements from this stack. + */ + Stack.prototype.clear = function () { + this.list.clear(); + }; + /** + * Executes the provided function once for each element present in this stack in + * LIFO order. + * @param {function(Object):*} callback function to execute, it is + * invoked with one argument: the element value, to break the iteration you can + * optionally return false. + */ + Stack.prototype.forEach = function (callback) { + this.list.forEach(callback); + }; + return Stack; +}()); // End of stack +exports.default = Stack; +//# sourceMappingURL=Stack.js.map \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/Stack.js.map b/node_modules/typescript-collections/dist/lib/Stack.js.map new file mode 100644 index 00000000..62702eb4 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/Stack.js.map @@ -0,0 +1 @@ +{"version":3,"file":"Stack.js","sourceRoot":"","sources":["../../src/lib/Stack.ts"],"names":[],"mappings":";;AAAA,2CAAsC;AAGtC;IAOI;;;;;;OAMG;IACH;QACI,IAAI,CAAC,IAAI,GAAG,IAAI,oBAAU,EAAK,CAAC;IACpC,CAAC;IAED;;;;OAIG;IACH,oBAAI,GAAJ,UAAK,IAAO;QACR,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAClC,CAAC;IACD;;;;OAIG;IACH,mBAAG,GAAH,UAAI,IAAO;QACP,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAClC,CAAC;IACD;;;;OAIG;IACH,mBAAG,GAAH;QACI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC;IACD;;;;;OAKG;IACH,oBAAI,GAAJ;QACI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;IAC7B,CAAC;IACD;;;OAGG;IACH,oBAAI,GAAJ;QACI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAC5B,CAAC;IAED;;;;;;;;;;;;;;;;;OAiBG;IACH,wBAAQ,GAAR,UAAS,IAAO,EAAE,cAAwC;QACtD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;IACpD,CAAC;IACD;;;;OAIG;IACH,uBAAO,GAAP;QACI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;IAC/B,CAAC;IACD;;OAEG;IACH,qBAAK,GAAL;QACI,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;IAED;;;;;;OAMG;IACH,uBAAO,GAAP,UAAQ,QAA+B;QACnC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IAChC,CAAC;IACL,YAAC;AAAD,CAAC,AAzGD,IAyGC,CAAC,eAAe"} \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/arrays.d.ts b/node_modules/typescript-collections/dist/lib/arrays.d.ts new file mode 100644 index 00000000..5c402ee7 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/arrays.d.ts @@ -0,0 +1,88 @@ +import * as util from './util'; +/** + * Returns the position of the first occurrence of the specified item + * within the specified array.4 + * @param {*} array the array in which to search the element. + * @param {Object} item the element to search. + * @param {function(Object,Object):boolean=} equalsFunction optional function used to + * check equality between 2 elements. + * @return {number} the position of the first occurrence of the specified element + * within the specified array, or -1 if not found. + */ +export declare function indexOf(array: T[], item: T, equalsFunction?: util.IEqualsFunction): number; +/** + * Returns the position of the last occurrence of the specified element + * within the specified array. + * @param {*} array the array in which to search the element. + * @param {Object} item the element to search. + * @param {function(Object,Object):boolean=} equalsFunction optional function used to + * check equality between 2 elements. + * @return {number} the position of the last occurrence of the specified element + * within the specified array or -1 if not found. + */ +export declare function lastIndexOf(array: T[], item: T, equalsFunction?: util.IEqualsFunction): number; +/** + * Returns true if the specified array contains the specified element. + * @param {*} array the array in which to search the element. + * @param {Object} item the element to search. + * @param {function(Object,Object):boolean=} equalsFunction optional function to + * check equality between 2 elements. + * @return {boolean} true if the specified array contains the specified element. + */ +export declare function contains(array: T[], item: T, equalsFunction?: util.IEqualsFunction): boolean; +/** + * Removes the first ocurrence of the specified element from the specified array. + * @param {*} array the array in which to search element. + * @param {Object} item the element to search. + * @param {function(Object,Object):boolean=} equalsFunction optional function to + * check equality between 2 elements. + * @return {boolean} true if the array changed after this call. + */ +export declare function remove(array: T[], item: T, equalsFunction?: util.IEqualsFunction): boolean; +/** + * Returns the number of elements in the specified array equal + * to the specified object. + * @param {Array} array the array in which to determine the frequency of the element. + * @param {Object} item the element whose frequency is to be determined. + * @param {function(Object,Object):boolean=} equalsFunction optional function used to + * check equality between 2 elements. + * @return {number} the number of elements in the specified array + * equal to the specified object. + */ +export declare function frequency(array: T[], item: T, equalsFunction?: util.IEqualsFunction): number; +/** + * Returns true if the two specified arrays are equal to one another. + * Two arrays are considered equal if both arrays contain the same number + * of elements, and all corresponding pairs of elements in the two + * arrays are equal and are in the same order. + * @param {Array} array1 one array to be tested for equality. + * @param {Array} array2 the other array to be tested for equality. + * @param {function(Object,Object):boolean=} equalsFunction optional function used to + * check equality between elemements in the arrays. + * @return {boolean} true if the two arrays are equal + */ +export declare function equals(array1: T[], array2: T[], equalsFunction?: util.IEqualsFunction): boolean; +/** + * Returns shallow a copy of the specified array. + * @param {*} array the array to copy. + * @return {Array} a copy of the specified array + */ +export declare function copy(array: T[]): T[]; +/** + * Swaps the elements at the specified positions in the specified array. + * @param {Array} array The array in which to swap elements. + * @param {number} i the index of one element to be swapped. + * @param {number} j the index of the other element to be swapped. + * @return {boolean} true if the array is defined and the indexes are valid. + */ +export declare function swap(array: T[], i: number, j: number): boolean; +export declare function toString(array: T[]): string; +/** + * Executes the provided function once for each element present in this array + * starting from index 0 to length - 1. + * @param {Array} array The array in which to iterate. + * @param {function(Object):*} callback function to execute, it is + * invoked with one argument: the element value, to break the iteration you can + * optionally return false. + */ +export declare function forEach(array: T[], callback: util.ILoopFunction): void; diff --git a/node_modules/typescript-collections/dist/lib/arrays.js b/node_modules/typescript-collections/dist/lib/arrays.js new file mode 100644 index 00000000..119d4a05 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/arrays.js @@ -0,0 +1,169 @@ +"use strict"; +Object.defineProperty(exports, "__esModule", { value: true }); +var util = require("./util"); +/** + * Returns the position of the first occurrence of the specified item + * within the specified array.4 + * @param {*} array the array in which to search the element. + * @param {Object} item the element to search. + * @param {function(Object,Object):boolean=} equalsFunction optional function used to + * check equality between 2 elements. + * @return {number} the position of the first occurrence of the specified element + * within the specified array, or -1 if not found. + */ +function indexOf(array, item, equalsFunction) { + var equals = equalsFunction || util.defaultEquals; + var length = array.length; + for (var i = 0; i < length; i++) { + if (equals(array[i], item)) { + return i; + } + } + return -1; +} +exports.indexOf = indexOf; +/** + * Returns the position of the last occurrence of the specified element + * within the specified array. + * @param {*} array the array in which to search the element. + * @param {Object} item the element to search. + * @param {function(Object,Object):boolean=} equalsFunction optional function used to + * check equality between 2 elements. + * @return {number} the position of the last occurrence of the specified element + * within the specified array or -1 if not found. + */ +function lastIndexOf(array, item, equalsFunction) { + var equals = equalsFunction || util.defaultEquals; + var length = array.length; + for (var i = length - 1; i >= 0; i--) { + if (equals(array[i], item)) { + return i; + } + } + return -1; +} +exports.lastIndexOf = lastIndexOf; +/** + * Returns true if the specified array contains the specified element. + * @param {*} array the array in which to search the element. + * @param {Object} item the element to search. + * @param {function(Object,Object):boolean=} equalsFunction optional function to + * check equality between 2 elements. + * @return {boolean} true if the specified array contains the specified element. + */ +function contains(array, item, equalsFunction) { + return indexOf(array, item, equalsFunction) >= 0; +} +exports.contains = contains; +/** + * Removes the first ocurrence of the specified element from the specified array. + * @param {*} array the array in which to search element. + * @param {Object} item the element to search. + * @param {function(Object,Object):boolean=} equalsFunction optional function to + * check equality between 2 elements. + * @return {boolean} true if the array changed after this call. + */ +function remove(array, item, equalsFunction) { + var index = indexOf(array, item, equalsFunction); + if (index < 0) { + return false; + } + array.splice(index, 1); + return true; +} +exports.remove = remove; +/** + * Returns the number of elements in the specified array equal + * to the specified object. + * @param {Array} array the array in which to determine the frequency of the element. + * @param {Object} item the element whose frequency is to be determined. + * @param {function(Object,Object):boolean=} equalsFunction optional function used to + * check equality between 2 elements. + * @return {number} the number of elements in the specified array + * equal to the specified object. + */ +function frequency(array, item, equalsFunction) { + var equals = equalsFunction || util.defaultEquals; + var length = array.length; + var freq = 0; + for (var i = 0; i < length; i++) { + if (equals(array[i], item)) { + freq++; + } + } + return freq; +} +exports.frequency = frequency; +/** + * Returns true if the two specified arrays are equal to one another. + * Two arrays are considered equal if both arrays contain the same number + * of elements, and all corresponding pairs of elements in the two + * arrays are equal and are in the same order. + * @param {Array} array1 one array to be tested for equality. + * @param {Array} array2 the other array to be tested for equality. + * @param {function(Object,Object):boolean=} equalsFunction optional function used to + * check equality between elemements in the arrays. + * @return {boolean} true if the two arrays are equal + */ +function equals(array1, array2, equalsFunction) { + var equals = equalsFunction || util.defaultEquals; + if (array1.length !== array2.length) { + return false; + } + var length = array1.length; + for (var i = 0; i < length; i++) { + if (!equals(array1[i], array2[i])) { + return false; + } + } + return true; +} +exports.equals = equals; +/** + * Returns shallow a copy of the specified array. + * @param {*} array the array to copy. + * @return {Array} a copy of the specified array + */ +function copy(array) { + return array.concat(); +} +exports.copy = copy; +/** + * Swaps the elements at the specified positions in the specified array. + * @param {Array} array The array in which to swap elements. + * @param {number} i the index of one element to be swapped. + * @param {number} j the index of the other element to be swapped. + * @return {boolean} true if the array is defined and the indexes are valid. + */ +function swap(array, i, j) { + if (i < 0 || i >= array.length || j < 0 || j >= array.length) { + return false; + } + var temp = array[i]; + array[i] = array[j]; + array[j] = temp; + return true; +} +exports.swap = swap; +function toString(array) { + return '[' + array.toString() + ']'; +} +exports.toString = toString; +/** + * Executes the provided function once for each element present in this array + * starting from index 0 to length - 1. + * @param {Array} array The array in which to iterate. + * @param {function(Object):*} callback function to execute, it is + * invoked with one argument: the element value, to break the iteration you can + * optionally return false. + */ +function forEach(array, callback) { + for (var _i = 0, array_1 = array; _i < array_1.length; _i++) { + var ele = array_1[_i]; + if (callback(ele) === false) { + return; + } + } +} +exports.forEach = forEach; +//# sourceMappingURL=arrays.js.map \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/arrays.js.map b/node_modules/typescript-collections/dist/lib/arrays.js.map new file mode 100644 index 00000000..debf3a90 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/arrays.js.map @@ -0,0 +1 @@ +{"version":3,"file":"arrays.js","sourceRoot":"","sources":["../../src/lib/arrays.ts"],"names":[],"mappings":";;AAAA,6BAA+B;AAE/B;;;;;;;;;GASG;AACH,iBAA2B,KAAU,EAAE,IAAO,EAAE,cAAwC;IACpF,IAAM,MAAM,GAAG,cAAc,IAAI,IAAI,CAAC,aAAa,CAAC;IACpD,IAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC5B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YACzB,MAAM,CAAC,CAAC,CAAC;QACb,CAAC;IACL,CAAC;IACD,MAAM,CAAC,CAAC,CAAC,CAAC;AACd,CAAC;AATD,0BASC;AAED;;;;;;;;;GASG;AACH,qBAA+B,KAAU,EAAE,IAAO,EAAE,cAAwC;IACxF,IAAM,MAAM,GAAG,cAAc,IAAI,IAAI,CAAC,aAAa,CAAC;IACpD,IAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC5B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YACzB,MAAM,CAAC,CAAC,CAAC;QACb,CAAC;IACL,CAAC;IACD,MAAM,CAAC,CAAC,CAAC,CAAC;AACd,CAAC;AATD,kCASC;AAED;;;;;;;GAOG;AACH,kBAA4B,KAAU,EAAE,IAAO,EAAE,cAAwC;IACrF,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,EAAE,cAAc,CAAC,IAAI,CAAC,CAAC;AACrD,CAAC;AAFD,4BAEC;AAGD;;;;;;;GAOG;AACH,gBAA0B,KAAU,EAAE,IAAO,EAAE,cAAwC;IACnF,IAAM,KAAK,GAAG,OAAO,CAAC,KAAK,EAAE,IAAI,EAAE,cAAc,CAAC,CAAC;IACnD,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IACD,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACvB,MAAM,CAAC,IAAI,CAAC;AAChB,CAAC;AAPD,wBAOC;AAED;;;;;;;;;GASG;AACH,mBAA6B,KAAU,EAAE,IAAO,EAAE,cAAwC;IACtF,IAAM,MAAM,GAAG,cAAc,IAAI,IAAI,CAAC,aAAa,CAAC;IACpD,IAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC5B,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,EAAE,CAAC;QACX,CAAC;IACL,CAAC;IACD,MAAM,CAAC,IAAI,CAAC;AAChB,CAAC;AAVD,8BAUC;AAED;;;;;;;;;;GAUG;AACH,gBAA0B,MAAW,EAAE,MAAW,EAAE,cAAwC;IACxF,IAAM,MAAM,GAAG,cAAc,IAAI,IAAI,CAAC,aAAa,CAAC;IAEpD,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;QAClC,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IACD,IAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;IAC7B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAChC,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;IACL,CAAC;IACD,MAAM,CAAC,IAAI,CAAC;AAChB,CAAC;AAbD,wBAaC;AAED;;;;GAIG;AACH,cAAwB,KAAU;IAC9B,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;AAC1B,CAAC;AAFD,oBAEC;AAED;;;;;;GAMG;AACH,cAAwB,KAAU,EAAE,CAAS,EAAE,CAAS;IACpD,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;QAC3D,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IACD,IAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACtB,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACpB,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IAChB,MAAM,CAAC,IAAI,CAAC;AAChB,CAAC;AARD,oBAQC;AAED,kBAA4B,KAAU;IAClC,MAAM,CAAC,GAAG,GAAG,KAAK,CAAC,QAAQ,EAAE,GAAG,GAAG,CAAC;AACxC,CAAC;AAFD,4BAEC;AAED;;;;;;;GAOG;AACH,iBAA2B,KAAU,EAAE,QAA+B;IAClE,GAAG,CAAC,CAAc,UAAK,EAAL,eAAK,EAAL,mBAAK,EAAL,IAAK;QAAlB,IAAM,GAAG,cAAA;QACV,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC;YAC1B,MAAM,CAAC;QACX,CAAC;KACJ;AACL,CAAC;AAND,0BAMC"} \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/index.d.ts b/node_modules/typescript-collections/dist/lib/index.d.ts new file mode 100644 index 00000000..f28ae6df --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/index.d.ts @@ -0,0 +1,19 @@ +import * as _arrays from './arrays'; +export declare var arrays: typeof _arrays; +export { default as Bag } from './Bag'; +export { default as BSTree } from './BSTree'; +export { default as BSTreeKV } from './BSTreeKV'; +export { default as Dictionary } from './Dictionary'; +export { default as Heap } from './Heap'; +export { default as LinkedDictionary } from './LinkedDictionary'; +export { default as LinkedList } from './LinkedList'; +export { default as MultiDictionary } from './MultiDictionary'; +export { default as FactoryDictionary } from './FactoryDictionary'; +export { default as DefaultDictionary } from './FactoryDictionary'; +export { default as Queue } from './Queue'; +export { default as PriorityQueue } from './PriorityQueue'; +export { default as Set } from './Set'; +export { default as Stack } from './Stack'; +export { default as MultiRootTree } from './MultiRootTree'; +import * as _util from './util'; +export declare var util: typeof _util; diff --git a/node_modules/typescript-collections/dist/lib/index.js b/node_modules/typescript-collections/dist/lib/index.js new file mode 100644 index 00000000..54a9e249 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/index.js @@ -0,0 +1,43 @@ +"use strict"; +Object.defineProperty(exports, "__esModule", { value: true }); +// Copyright 2013 Basarat Ali Syed. All Rights Reserved. +// +// Licensed under MIT open source license http://opensource.org/licenses/MIT +// +// Orginal javascript code was by Mauricio Santos +// +var _arrays = require("./arrays"); +exports.arrays = _arrays; +var Bag_1 = require("./Bag"); +exports.Bag = Bag_1.default; +var BSTree_1 = require("./BSTree"); +exports.BSTree = BSTree_1.default; +var BSTreeKV_1 = require("./BSTreeKV"); +exports.BSTreeKV = BSTreeKV_1.default; +var Dictionary_1 = require("./Dictionary"); +exports.Dictionary = Dictionary_1.default; +var Heap_1 = require("./Heap"); +exports.Heap = Heap_1.default; +var LinkedDictionary_1 = require("./LinkedDictionary"); +exports.LinkedDictionary = LinkedDictionary_1.default; +var LinkedList_1 = require("./LinkedList"); +exports.LinkedList = LinkedList_1.default; +var MultiDictionary_1 = require("./MultiDictionary"); +exports.MultiDictionary = MultiDictionary_1.default; +var FactoryDictionary_1 = require("./FactoryDictionary"); +exports.FactoryDictionary = FactoryDictionary_1.default; +var FactoryDictionary_2 = require("./FactoryDictionary"); +exports.DefaultDictionary = FactoryDictionary_2.default; +var Queue_1 = require("./Queue"); +exports.Queue = Queue_1.default; +var PriorityQueue_1 = require("./PriorityQueue"); +exports.PriorityQueue = PriorityQueue_1.default; +var Set_1 = require("./Set"); +exports.Set = Set_1.default; +var Stack_1 = require("./Stack"); +exports.Stack = Stack_1.default; +var MultiRootTree_1 = require("./MultiRootTree"); +exports.MultiRootTree = MultiRootTree_1.default; +var _util = require("./util"); +exports.util = _util; +//# sourceMappingURL=index.js.map \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/index.js.map b/node_modules/typescript-collections/dist/lib/index.js.map new file mode 100644 index 00000000..67ee5164 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/index.js.map @@ -0,0 +1 @@ +{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/lib/index.ts"],"names":[],"mappings":";;AAAA,wDAAwD;AACxD,EAAE;AACF,4EAA4E;AAC5E,EAAE;AACF,iDAAiD;AACjD,EAAE;AACF,kCAAoC;AACzB,QAAA,MAAM,GAAG,OAAO,CAAC;AAC5B,6BAAqC;AAA7B,oBAAA,OAAO,CAAO;AACtB,mCAA2C;AAAnC,0BAAA,OAAO,CAAU;AACzB,uCAA+C;AAAvC,8BAAA,OAAO,CAAY;AAC3B,2CAAmD;AAA3C,kCAAA,OAAO,CAAc;AAC7B,+BAAuC;AAA/B,sBAAA,OAAO,CAAQ;AACvB,uDAA+D;AAAvD,8CAAA,OAAO,CAAoB;AACnC,2CAAmD;AAA3C,kCAAA,OAAO,CAAc;AAC7B,qDAA6D;AAArD,4CAAA,OAAO,CAAmB;AAClC,yDAAiE;AAAzD,gDAAA,OAAO,CAAqB;AACpC,yDAAiE;AAAzD,gDAAA,OAAO,CAAqB;AACpC,iCAAyC;AAAjC,wBAAA,OAAO,CAAS;AACxB,iDAAyD;AAAjD,wCAAA,OAAO,CAAiB;AAChC,6BAAqC;AAA7B,oBAAA,OAAO,CAAO;AACtB,iCAAyC;AAAjC,wBAAA,OAAO,CAAS;AACxB,iDAAyD;AAAjD,wCAAA,OAAO,CAAiB;AAChC,8BAAgC;AACrB,QAAA,IAAI,GAAG,KAAK,CAAC"} \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/umd.js b/node_modules/typescript-collections/dist/lib/umd.js new file mode 100644 index 00000000..dd5bbdbd --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/umd.js @@ -0,0 +1,3220 @@ +(function(f) { + if (typeof exports === "object" && typeof module !== "undefined") { + module.exports = f() + } else if (typeof define === "function" && define.amd) { + define([], f) + } else { + var g; + if (typeof window !== "undefined") { + g = window + } else if (typeof global !== "undefined") { + g = global + } else if (typeof self !== "undefined") { + g = self + } else { + g = this + } + g.listComponent = f() + } +})(function() { + var define, module, exports; +require=(function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o + * string | BSTree + * { order: number, data: string } | BSTreeKV<{order: number}, {order: number, data: string}> + * + * @see BSTreeKV + */ +var BSTree = /** @class */ (function (_super) { + __extends(BSTree, _super); + function BSTree() { + return _super !== null && _super.apply(this, arguments) || this; + } + return BSTree; +}(BSTreeKV_1.default)); +exports.default = BSTree; + +},{"./BSTreeKV":2}],2:[function(require,module,exports){ +"use strict"; +Object.defineProperty(exports, "__esModule", { value: true }); +var util = require("./util"); +var Queue_1 = require("./Queue"); +/** + * General binary search tree implementation. + * + * This interface allows one to search elements using a subset of their attributes (thus the + * tree can be used as an index for complex objects). + * The attributes required to define an ordering in the tree must be defined in the type K. + * Any additional attribute must be defined in the type V. + * + * @see BSTree + */ +var BSTreeKV = /** @class */ (function () { + /** + * Creates an empty binary search tree. + * @class

A binary search tree is a binary tree in which each + * internal node stores an element such that the elements stored in the + * left subtree are less than it and the elements + * stored in the right subtree are greater.

+ *

Formally, a binary search tree is a node-based binary tree data structure which + * has the following properties:

+ *
    + *
  • The left subtree of a node contains only nodes with elements less + * than the node's element
    • + *
  • The right subtree of a node contains only nodes with elements greater + * than the node's element
    • + *
  • Both the left and right subtrees must also be binary search trees.
    • + *
+ *

If the inserted elements are custom objects a compare function must + * be provided at construction time, otherwise the <=, === and >= operators are + * used to compare elements. Example:

+ * 
+     * function compare(a, b) {
+     *  if (a is less than b by some ordering criterion) {
+     *     return -1;
+     *  } if (a is greater than b by the ordering criterion) {
+     *     return 1;
+     *  }
+     *  // a must be equal to b
+     *  return 0;
+     * }
+     *
+ * @constructor + * @param {function(Object,Object):number=} compareFunction optional + * function used to compare two elements. Must return a negative integer, + * zero, or a positive integer as the first argument is less than, equal to, + * or greater than the second. + */ + function BSTreeKV(compareFunction) { + this.root = null; + this.compare = compareFunction || util.defaultCompare; + this.nElements = 0; + } + /** + * Adds the specified element to this tree if it is not already present. + * @param {Object} element the element to insert. + * @return {boolean} true if this tree did not already contain the specified element. + */ + BSTreeKV.prototype.add = function (element) { + if (util.isUndefined(element)) { + return false; + } + if (this.insertNode(this.createNode(element)) !== null) { + this.nElements++; + return true; + } + return false; + }; + /** + * Removes all of the elements from this tree. + */ + BSTreeKV.prototype.clear = function () { + this.root = null; + this.nElements = 0; + }; + /** + * Returns true if this tree contains no elements. + * @return {boolean} true if this tree contains no elements. + */ + BSTreeKV.prototype.isEmpty = function () { + return this.nElements === 0; + }; + /** + * Returns the number of elements in this tree. + * @return {number} the number of elements in this tree. + */ + BSTreeKV.prototype.size = function () { + return this.nElements; + }; + /** + * Returns true if this tree contains the specified element. + * @param {Object} element element to search for. + * @return {boolean} true if this tree contains the specified element, + * false otherwise. + */ + BSTreeKV.prototype.contains = function (element) { + if (util.isUndefined(element)) { + return false; + } + return this.searchNode(this.root, element) !== null; + }; + /** + * Looks for the value with the provided search key. + * @param {Object} element The key to look for + * @return {Object} The value found or undefined if it was not found. + */ + BSTreeKV.prototype.search = function (element) { + var ret = this.searchNode(this.root, element); + if (ret === null) { + return undefined; + } + return ret.element; + }; + /** + * Removes the specified element from this tree if it is present. + * @return {boolean} true if this tree contained the specified element. + */ + BSTreeKV.prototype.remove = function (element) { + var node = this.searchNode(this.root, element); + if (node === null) { + return false; + } + this.removeNode(node); + this.nElements--; + return true; + }; + /** + * Executes the provided function once for each element present in this tree in + * in-order. + * @param {function(Object):*} callback function to execute, it is invoked with one + * argument: the element value, to break the iteration you can optionally return false. + */ + BSTreeKV.prototype.inorderTraversal = function (callback) { + this.inorderTraversalAux(this.root, callback, { + stop: false + }); + }; + /** + * Executes the provided function once for each element present in this tree in pre-order. + * @param {function(Object):*} callback function to execute, it is invoked with one + * argument: the element value, to break the iteration you can optionally return false. + */ + BSTreeKV.prototype.preorderTraversal = function (callback) { + this.preorderTraversalAux(this.root, callback, { + stop: false + }); + }; + /** + * Executes the provided function once for each element present in this tree in post-order. + * @param {function(Object):*} callback function to execute, it is invoked with one + * argument: the element value, to break the iteration you can optionally return false. + */ + BSTreeKV.prototype.postorderTraversal = function (callback) { + this.postorderTraversalAux(this.root, callback, { + stop: false + }); + }; + /** + * Executes the provided function once for each element present in this tree in + * level-order. + * @param {function(Object):*} callback function to execute, it is invoked with one + * argument: the element value, to break the iteration you can optionally return false. + */ + BSTreeKV.prototype.levelTraversal = function (callback) { + this.levelTraversalAux(this.root, callback); + }; + /** + * Returns the minimum element of this tree. + * @return {*} the minimum element of this tree or undefined if this tree is + * is empty. + */ + BSTreeKV.prototype.minimum = function () { + if (this.isEmpty() || this.root === null) { + return undefined; + } + return this.minimumAux(this.root).element; + }; + /** + * Returns the maximum element of this tree. + * @return {*} the maximum element of this tree or undefined if this tree is + * is empty. + */ + BSTreeKV.prototype.maximum = function () { + if (this.isEmpty() || this.root === null) { + return undefined; + } + return this.maximumAux(this.root).element; + }; + /** + * Executes the provided function once for each element present in this tree in inorder. + * Equivalent to inorderTraversal. + * @param {function(Object):*} callback function to execute, it is + * invoked with one argument: the element value, to break the iteration you can + * optionally return false. + */ + BSTreeKV.prototype.forEach = function (callback) { + this.inorderTraversal(callback); + }; + /** + * Returns an array containing all of the elements in this tree in in-order. + * @return {Array} an array containing all of the elements in this tree in in-order. + */ + BSTreeKV.prototype.toArray = function () { + var array = []; + this.inorderTraversal(function (element) { + array.push(element); + return true; + }); + return array; + }; + /** + * Returns the height of this tree. + * @return {number} the height of this tree or -1 if is empty. + */ + BSTreeKV.prototype.height = function () { + return this.heightAux(this.root); + }; + /** + * @private + */ + BSTreeKV.prototype.searchNode = function (node, element) { + var cmp = 1; + while (node !== null && cmp !== 0) { + cmp = this.compare(element, node.element); + if (cmp < 0) { + node = node.leftCh; + } + else if (cmp > 0) { + node = node.rightCh; + } + } + return node; + }; + /** + * @private + */ + BSTreeKV.prototype.transplant = function (n1, n2) { + if (n1.parent === null) { + this.root = n2; + } + else if (n1 === n1.parent.leftCh) { + n1.parent.leftCh = n2; + } + else { + n1.parent.rightCh = n2; + } + if (n2 !== null) { + n2.parent = n1.parent; + } + }; + /** + * @private + */ + BSTreeKV.prototype.removeNode = function (node) { + if (node.leftCh === null) { + this.transplant(node, node.rightCh); + } + else if (node.rightCh === null) { + this.transplant(node, node.leftCh); + } + else { + var y = this.minimumAux(node.rightCh); + if (y.parent !== node) { + this.transplant(y, y.rightCh); + y.rightCh = node.rightCh; + y.rightCh.parent = y; + } + this.transplant(node, y); + y.leftCh = node.leftCh; + y.leftCh.parent = y; + } + }; + /** + * @private + */ + BSTreeKV.prototype.inorderTraversalAux = function (node, callback, signal) { + if (node === null || signal.stop) { + return; + } + this.inorderTraversalAux(node.leftCh, callback, signal); + if (signal.stop) { + return; + } + signal.stop = callback(node.element) === false; + if (signal.stop) { + return; + } + this.inorderTraversalAux(node.rightCh, callback, signal); + }; + /** + * @private + */ + BSTreeKV.prototype.levelTraversalAux = function (node, callback) { + var queue = new Queue_1.default(); + if (node !== null) { + queue.enqueue(node); + } + node = queue.dequeue() || null; + while (node != null) { + if (callback(node.element) === false) { + return; + } + if (node.leftCh !== null) { + queue.enqueue(node.leftCh); + } + if (node.rightCh !== null) { + queue.enqueue(node.rightCh); + } + node = queue.dequeue() || null; + } + }; + /** + * @private + */ + BSTreeKV.prototype.preorderTraversalAux = function (node, callback, signal) { + if (node === null || signal.stop) { + return; + } + signal.stop = callback(node.element) === false; + if (signal.stop) { + return; + } + this.preorderTraversalAux(node.leftCh, callback, signal); + if (signal.stop) { + return; + } + this.preorderTraversalAux(node.rightCh, callback, signal); + }; + /** + * @private + */ + BSTreeKV.prototype.postorderTraversalAux = function (node, callback, signal) { + if (node === null || signal.stop) { + return; + } + this.postorderTraversalAux(node.leftCh, callback, signal); + if (signal.stop) { + return; + } + this.postorderTraversalAux(node.rightCh, callback, signal); + if (signal.stop) { + return; + } + signal.stop = callback(node.element) === false; + }; + BSTreeKV.prototype.minimumAux = function (node) { + while (node != null && node.leftCh !== null) { + node = node.leftCh; + } + return node; + }; + BSTreeKV.prototype.maximumAux = function (node) { + while (node != null && node.rightCh !== null) { + node = node.rightCh; + } + return node; + }; + /** + * @private + */ + BSTreeKV.prototype.heightAux = function (node) { + if (node === null) { + return -1; + } + return Math.max(this.heightAux(node.leftCh), this.heightAux(node.rightCh)) + 1; + }; + /* + * @private + */ + BSTreeKV.prototype.insertNode = function (node) { + var parent = null; + var position = this.root; + while (position !== null) { + var cmp = this.compare(node.element, position.element); + if (cmp === 0) { + return null; + } + else if (cmp < 0) { + parent = position; + position = position.leftCh; + } + else { + parent = position; + position = position.rightCh; + } + } + node.parent = parent; + if (parent === null) { + // tree is empty + this.root = node; + } + else if (this.compare(node.element, parent.element) < 0) { + parent.leftCh = node; + } + else { + parent.rightCh = node; + } + return node; + }; + /** + * @private + */ + BSTreeKV.prototype.createNode = function (element) { + return { + element: element, + leftCh: null, + rightCh: null, + parent: null + }; + }; + return BSTreeKV; +}()); +exports.default = BSTreeKV; + +},{"./Queue":12,"./util":16}],3:[function(require,module,exports){ +"use strict"; +Object.defineProperty(exports, "__esModule", { value: true }); +var util = require("./util"); +var Dictionary_1 = require("./Dictionary"); +var Set_1 = require("./Set"); +var Bag = /** @class */ (function () { + /** + * Creates an empty bag. + * @class

A bag is a special kind of set in which members are + * allowed to appear more than once.

+ *

If the inserted elements are custom objects a function + * which converts elements to unique strings must be provided. Example:

+ * + * 
+     * function petToString(pet) {
+     *  return pet.name;
+     * }
+     *
+ * + * @constructor + * @param {function(Object):string=} toStrFunction optional function used + * to convert elements to strings. If the elements aren't strings or if toString() + * is not appropriate, a custom function which receives an object and returns a + * unique string must be provided. + */ + function Bag(toStrFunction) { + this.toStrF = toStrFunction || util.defaultToString; + this.dictionary = new Dictionary_1.default(this.toStrF); + this.nElements = 0; + } + /** + * Adds nCopies of the specified object to this bag. + * @param {Object} element element to add. + * @param {number=} nCopies the number of copies to add, if this argument is + * undefined 1 copy is added. + * @return {boolean} true unless element is undefined. + */ + Bag.prototype.add = function (element, nCopies) { + if (nCopies === void 0) { nCopies = 1; } + if (util.isUndefined(element) || nCopies <= 0) { + return false; + } + if (!this.contains(element)) { + var node = { + value: element, + copies: nCopies + }; + this.dictionary.setValue(element, node); + } + else { + this.dictionary.getValue(element).copies += nCopies; + } + this.nElements += nCopies; + return true; + }; + /** + * Counts the number of copies of the specified object in this bag. + * @param {Object} element the object to search for.. + * @return {number} the number of copies of the object, 0 if not found + */ + Bag.prototype.count = function (element) { + if (!this.contains(element)) { + return 0; + } + else { + return this.dictionary.getValue(element).copies; + } + }; + /** + * Returns true if this bag contains the specified element. + * @param {Object} element element to search for. + * @return {boolean} true if this bag contains the specified element, + * false otherwise. + */ + Bag.prototype.contains = function (element) { + return this.dictionary.containsKey(element); + }; + /** + * Removes nCopies of the specified object to this bag. + * If the number of copies to remove is greater than the actual number + * of copies in the Bag, all copies are removed. + * @param {Object} element element to remove. + * @param {number=} nCopies the number of copies to remove, if this argument is + * undefined 1 copy is removed. + * @return {boolean} true if at least 1 element was removed. + */ + Bag.prototype.remove = function (element, nCopies) { + if (nCopies === void 0) { nCopies = 1; } + if (util.isUndefined(element) || nCopies <= 0) { + return false; + } + if (!this.contains(element)) { + return false; + } + else { + var node = this.dictionary.getValue(element); + if (nCopies > node.copies) { + this.nElements -= node.copies; + } + else { + this.nElements -= nCopies; + } + node.copies -= nCopies; + if (node.copies <= 0) { + this.dictionary.remove(element); + } + return true; + } + }; + /** + * Returns an array containing all of the elements in this big in arbitrary order, + * including multiple copies. + * @return {Array} an array containing all of the elements in this bag. + */ + Bag.prototype.toArray = function () { + var a = []; + var values = this.dictionary.values(); + for (var _i = 0, values_1 = values; _i < values_1.length; _i++) { + var node = values_1[_i]; + var element = node.value; + var copies = node.copies; + for (var j = 0; j < copies; j++) { + a.push(element); + } + } + return a; + }; + /** + * Returns a set of unique elements in this bag. + * @return {collections.Set} a set of unique elements in this bag. + */ + Bag.prototype.toSet = function () { + var toret = new Set_1.default(this.toStrF); + var elements = this.dictionary.values(); + for (var _i = 0, elements_1 = elements; _i < elements_1.length; _i++) { + var ele = elements_1[_i]; + var value = ele.value; + toret.add(value); + } + return toret; + }; + /** + * Executes the provided function once for each element + * present in this bag, including multiple copies. + * @param {function(Object):*} callback function to execute, it is + * invoked with one argument: the element. To break the iteration you can + * optionally return false. + */ + Bag.prototype.forEach = function (callback) { + this.dictionary.forEach(function (k, v) { + var value = v.value; + var copies = v.copies; + for (var i = 0; i < copies; i++) { + if (callback(value) === false) { + return false; + } + } + return true; + }); + }; + /** + * Returns the number of elements in this bag. + * @return {number} the number of elements in this bag. + */ + Bag.prototype.size = function () { + return this.nElements; + }; + /** + * Returns true if this bag contains no elements. + * @return {boolean} true if this bag contains no elements. + */ + Bag.prototype.isEmpty = function () { + return this.nElements === 0; + }; + /** + * Removes all of the elements from this bag. + */ + Bag.prototype.clear = function () { + this.nElements = 0; + this.dictionary.clear(); + }; + return Bag; +}()); // End of bag +exports.default = Bag; + +},{"./Dictionary":4,"./Set":13,"./util":16}],4:[function(require,module,exports){ +"use strict"; +Object.defineProperty(exports, "__esModule", { value: true }); +var util = require("./util"); +var Dictionary = /** @class */ (function () { + /** + * Creates an empty dictionary. + * @class

Dictionaries map keys to values; each key can map to at most one value. + * This implementation accepts any kind of objects as keys.

+ * + *

If the keys are custom objects a function which converts keys to unique + * strings must be provided. Example:

+ * 
+     * function petToString(pet) {
+     *  return pet.name;
+     * }
+     *
+ * @constructor + * @param {function(Object):string=} toStrFunction optional function used + * to convert keys to strings. If the keys aren't strings or if toString() + * is not appropriate, a custom function which receives a key and returns a + * unique string must be provided. + */ + function Dictionary(toStrFunction) { + this.table = {}; + this.nElements = 0; + this.toStr = toStrFunction || util.defaultToString; + } + /** + * Returns the value to which this dictionary maps the specified key. + * Returns undefined if this dictionary contains no mapping for this key. + * @param {Object} key key whose associated value is to be returned. + * @return {*} the value to which this dictionary maps the specified key or + * undefined if the map contains no mapping for this key. + */ + Dictionary.prototype.getValue = function (key) { + var pair = this.table['$' + this.toStr(key)]; + if (util.isUndefined(pair)) { + return undefined; + } + return pair.value; + }; + /** + * Associates the specified value with the specified key in this dictionary. + * If the dictionary previously contained a mapping for this key, the old + * value is replaced by the specified value. + * @param {Object} key key with which the specified value is to be + * associated. + * @param {Object} value value to be associated with the specified key. + * @return {*} previous value associated with the specified key, or undefined if + * there was no mapping for the key or if the key/value are undefined. + */ + Dictionary.prototype.setValue = function (key, value) { + if (util.isUndefined(key) || util.isUndefined(value)) { + return undefined; + } + var ret; + var k = '$' + this.toStr(key); + var previousElement = this.table[k]; + if (util.isUndefined(previousElement)) { + this.nElements++; + ret = undefined; + } + else { + ret = previousElement.value; + } + this.table[k] = { + key: key, + value: value + }; + return ret; + }; + /** + * Removes the mapping for this key from this dictionary if it is present. + * @param {Object} key key whose mapping is to be removed from the + * dictionary. + * @return {*} previous value associated with specified key, or undefined if + * there was no mapping for key. + */ + Dictionary.prototype.remove = function (key) { + var k = '$' + this.toStr(key); + var previousElement = this.table[k]; + if (!util.isUndefined(previousElement)) { + delete this.table[k]; + this.nElements--; + return previousElement.value; + } + return undefined; + }; + /** + * Returns an array containing all of the keys in this dictionary. + * @return {Array} an array containing all of the keys in this dictionary. + */ + Dictionary.prototype.keys = function () { + var array = []; + for (var name_1 in this.table) { + if (util.has(this.table, name_1)) { + var pair = this.table[name_1]; + array.push(pair.key); + } + } + return array; + }; + /** + * Returns an array containing all of the values in this dictionary. + * @return {Array} an array containing all of the values in this dictionary. + */ + Dictionary.prototype.values = function () { + var array = []; + for (var name_2 in this.table) { + if (util.has(this.table, name_2)) { + var pair = this.table[name_2]; + array.push(pair.value); + } + } + return array; + }; + /** + * Executes the provided function once for each key-value pair + * present in this dictionary. + * @param {function(Object,Object):*} callback function to execute, it is + * invoked with two arguments: key and value. To break the iteration you can + * optionally return false. + */ + Dictionary.prototype.forEach = function (callback) { + for (var name_3 in this.table) { + if (util.has(this.table, name_3)) { + var pair = this.table[name_3]; + var ret = callback(pair.key, pair.value); + if (ret === false) { + return; + } + } + } + }; + /** + * Returns true if this dictionary contains a mapping for the specified key. + * @param {Object} key key whose presence in this dictionary is to be + * tested. + * @return {boolean} true if this dictionary contains a mapping for the + * specified key. + */ + Dictionary.prototype.containsKey = function (key) { + return !util.isUndefined(this.getValue(key)); + }; + /** + * Removes all mappings from this dictionary. + * @this {collections.Dictionary} + */ + Dictionary.prototype.clear = function () { + this.table = {}; + this.nElements = 0; + }; + /** + * Returns the number of keys in this dictionary. + * @return {number} the number of key-value mappings in this dictionary. + */ + Dictionary.prototype.size = function () { + return this.nElements; + }; + /** + * Returns true if this dictionary contains no mappings. + * @return {boolean} true if this dictionary contains no mappings. + */ + Dictionary.prototype.isEmpty = function () { + return this.nElements <= 0; + }; + Dictionary.prototype.toString = function () { + var toret = '{'; + this.forEach(function (k, v) { + toret += "\n\t" + k + " : " + v; + }); + return toret + '\n}'; + }; + return Dictionary; +}()); // End of dictionary +exports.default = Dictionary; + +},{"./util":16}],5:[function(require,module,exports){ +"use strict"; +var __extends = (this && this.__extends) || (function () { + var extendStatics = Object.setPrototypeOf || + ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) || + function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; }; + return function (d, b) { + extendStatics(d, b); + function __() { this.constructor = d; } + d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __()); + }; +})(); +Object.defineProperty(exports, "__esModule", { value: true }); +var Dictionary_1 = require("./Dictionary"); +var util = require("./util"); +var FactoryDictionary = /** @class */ (function (_super) { + __extends(FactoryDictionary, _super); + /** + * Creates an empty dictionary. + * @class

Dictionaries map keys to values; each key can map to at most one value. + * This implementation accepts any kind of objects as keys.

+ * + *

The default factory function should return a new object of the provided + * type. Example:

+ * 
+     * function petFactory() {
+     *  return new Pet();
+     * }
+     *
+ * + *

If the keys are custom objects a function which converts keys to unique + * strings must be provided. Example:

+ * 
+     * function petToString(pet) {
+     *  return pet.name;
+     * }
+     *
+ * @constructor + * @param {function():V=} defaultFactoryFunction function used to create a + * default object. + * @param {function(Object):string=} toStrFunction optional function used + * to convert keys to strings. If the keys aren't strings or if toString() + * is not appropriate, a custom function which receives a key and returns a + * unique string must be provided. + */ + function FactoryDictionary(defaultFactoryFunction, toStrFunction) { + var _this = _super.call(this, toStrFunction) || this; + _this.defaultFactoryFunction = defaultFactoryFunction; + return _this; + } + /** + * Associates the specified default value with the specified key in this dictionary, + * if it didn't contain the key yet. If the key existed, the existing value will be used. + * @param {Object} key key with which the specified value is to be + * associated. + * @param {Object} defaultValue default value to be associated with the specified key. + * @return {*} previous value associated with the specified key, or the default value, + * if the key didn't exist yet. + */ + FactoryDictionary.prototype.setDefault = function (key, defaultValue) { + var currentValue = _super.prototype.getValue.call(this, key); + if (util.isUndefined(currentValue)) { + this.setValue(key, defaultValue); + return defaultValue; + } + return currentValue; + }; + /** + * Returns the value to which this dictionary maps the specified key. + * Returns a default value created by the factory passed in the constructor, + * if this dictionary contains no mapping for this key. The missing key will + * automatically be added to the dictionary. + * @param {Object} key key whose associated value is to be returned. + * @return {*} the value to which this dictionary maps the specified key or + * a default value if the map contains no mapping for this key. + */ + FactoryDictionary.prototype.getValue = function (key) { + return this.setDefault(key, this.defaultFactoryFunction()); + }; + return FactoryDictionary; +}(Dictionary_1.default)); +exports.default = FactoryDictionary; + +},{"./Dictionary":4,"./util":16}],6:[function(require,module,exports){ +"use strict"; +Object.defineProperty(exports, "__esModule", { value: true }); +var collections = require("./util"); +var arrays = require("./arrays"); +var Heap = /** @class */ (function () { + /** + * Creates an empty Heap. + * @class + *

A heap is a binary tree, where the nodes maintain the heap property: + * each node is smaller than each of its children and therefore a MinHeap + * This implementation uses an array to store elements.

+ *

If the inserted elements are custom objects a compare function must be provided, + * at construction time, otherwise the <=, === and >= operators are + * used to compare elements. Example:

+ * + * 
+     * function compare(a, b) {
+     *  if (a is less than b by some ordering criterion) {
+     *     return -1;
+     *  } if (a is greater than b by the ordering criterion) {
+     *     return 1;
+     *  }
+     *  // a must be equal to b
+     *  return 0;
+     * }
+     *
+ * + *

If a Max-Heap is wanted (greater elements on top) you can a provide a + * reverse compare function to accomplish that behavior. Example:

+ * + * 
+     * function reverseCompare(a, b) {
+     *  if (a is less than b by some ordering criterion) {
+     *     return 1;
+     *  } if (a is greater than b by the ordering criterion) {
+     *     return -1;
+     *  }
+     *  // a must be equal to b
+     *  return 0;
+     * }
+     *
+ * + * @constructor + * @param {function(Object,Object):number=} compareFunction optional + * function used to compare two elements. Must return a negative integer, + * zero, or a positive integer as the first argument is less than, equal to, + * or greater than the second. + */ + function Heap(compareFunction) { + /** + * Array used to store the elements of the heap. + * @type {Array.} + * @private + */ + this.data = []; + this.compare = compareFunction || collections.defaultCompare; + } + /** + * Returns the index of the left child of the node at the given index. + * @param {number} nodeIndex The index of the node to get the left child + * for. + * @return {number} The index of the left child. + * @private + */ + Heap.prototype.leftChildIndex = function (nodeIndex) { + return (2 * nodeIndex) + 1; + }; + /** + * Returns the index of the right child of the node at the given index. + * @param {number} nodeIndex The index of the node to get the right child + * for. + * @return {number} The index of the right child. + * @private + */ + Heap.prototype.rightChildIndex = function (nodeIndex) { + return (2 * nodeIndex) + 2; + }; + /** + * Returns the index of the parent of the node at the given index. + * @param {number} nodeIndex The index of the node to get the parent for. + * @return {number} The index of the parent. + * @private + */ + Heap.prototype.parentIndex = function (nodeIndex) { + return Math.floor((nodeIndex - 1) / 2); + }; + /** + * Returns the index of the smaller child node (if it exists). + * @param {number} leftChild left child index. + * @param {number} rightChild right child index. + * @return {number} the index with the minimum value or -1 if it doesn't + * exists. + * @private + */ + Heap.prototype.minIndex = function (leftChild, rightChild) { + if (rightChild >= this.data.length) { + if (leftChild >= this.data.length) { + return -1; + } + else { + return leftChild; + } + } + else { + if (this.compare(this.data[leftChild], this.data[rightChild]) <= 0) { + return leftChild; + } + else { + return rightChild; + } + } + }; + /** + * Moves the node at the given index up to its proper place in the heap. + * @param {number} index The index of the node to move up. + * @private + */ + Heap.prototype.siftUp = function (index) { + var parent = this.parentIndex(index); + while (index > 0 && this.compare(this.data[parent], this.data[index]) > 0) { + arrays.swap(this.data, parent, index); + index = parent; + parent = this.parentIndex(index); + } + }; + /** + * Moves the node at the given index down to its proper place in the heap. + * @param {number} nodeIndex The index of the node to move down. + * @private + */ + Heap.prototype.siftDown = function (nodeIndex) { + //smaller child index + var min = this.minIndex(this.leftChildIndex(nodeIndex), this.rightChildIndex(nodeIndex)); + while (min >= 0 && this.compare(this.data[nodeIndex], this.data[min]) > 0) { + arrays.swap(this.data, min, nodeIndex); + nodeIndex = min; + min = this.minIndex(this.leftChildIndex(nodeIndex), this.rightChildIndex(nodeIndex)); + } + }; + /** + * Retrieves but does not remove the root element of this heap. + * @return {*} The value at the root of the heap. Returns undefined if the + * heap is empty. + */ + Heap.prototype.peek = function () { + if (this.data.length > 0) { + return this.data[0]; + } + else { + return undefined; + } + }; + /** + * Adds the given element into the heap. + * @param {*} element the element. + * @return true if the element was added or fals if it is undefined. + */ + Heap.prototype.add = function (element) { + if (collections.isUndefined(element)) { + return false; + } + this.data.push(element); + this.siftUp(this.data.length - 1); + return true; + }; + /** + * Retrieves and removes the root element of this heap. + * @return {*} The value removed from the root of the heap. Returns + * undefined if the heap is empty. + */ + Heap.prototype.removeRoot = function () { + if (this.data.length > 0) { + var obj = this.data[0]; + this.data[0] = this.data[this.data.length - 1]; + this.data.splice(this.data.length - 1, 1); + if (this.data.length > 0) { + this.siftDown(0); + } + return obj; + } + return undefined; + }; + /** + * Returns true if this heap contains the specified element. + * @param {Object} element element to search for. + * @return {boolean} true if this Heap contains the specified element, false + * otherwise. + */ + Heap.prototype.contains = function (element) { + var equF = collections.compareToEquals(this.compare); + return arrays.contains(this.data, element, equF); + }; + /** + * Returns the number of elements in this heap. + * @return {number} the number of elements in this heap. + */ + Heap.prototype.size = function () { + return this.data.length; + }; + /** + * Checks if this heap is empty. + * @return {boolean} true if and only if this heap contains no items; false + * otherwise. + */ + Heap.prototype.isEmpty = function () { + return this.data.length <= 0; + }; + /** + * Removes all of the elements from this heap. + */ + Heap.prototype.clear = function () { + this.data.length = 0; + }; + /** + * Executes the provided function once for each element present in this heap in + * no particular order. + * @param {function(Object):*} callback function to execute, it is + * invoked with one argument: the element value, to break the iteration you can + * optionally return false. + */ + Heap.prototype.forEach = function (callback) { + arrays.forEach(this.data, callback); + }; + return Heap; +}()); +exports.default = Heap; + +},{"./arrays":15,"./util":16}],7:[function(require,module,exports){ +"use strict"; +var __extends = (this && this.__extends) || (function () { + var extendStatics = Object.setPrototypeOf || + ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) || + function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; }; + return function (d, b) { + extendStatics(d, b); + function __() { this.constructor = d; } + d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __()); + }; +})(); +Object.defineProperty(exports, "__esModule", { value: true }); +var Dictionary_1 = require("./Dictionary"); +var util = require("./util"); +/** + * This class is used by the LinkedDictionary Internally + * Has to be a class, not an interface, because it needs to have + * the 'unlink' function defined. + */ +var LinkedDictionaryPair = /** @class */ (function () { + function LinkedDictionaryPair(key, value) { + this.key = key; + this.value = value; + } + LinkedDictionaryPair.prototype.unlink = function () { + this.prev.next = this.next; + this.next.prev = this.prev; + }; + return LinkedDictionaryPair; +}()); +/** + * The head and tail elements of the list have null key and value properties but they + * usually link to normal nodes. + */ +var HeadOrTailLinkedDictionaryPair = /** @class */ (function () { + function HeadOrTailLinkedDictionaryPair() { + this.key = null; + this.value = null; + } + HeadOrTailLinkedDictionaryPair.prototype.unlink = function () { + this.prev.next = this.next; + this.next.prev = this.prev; + }; + return HeadOrTailLinkedDictionaryPair; +}()); +function isHeadOrTailLinkedDictionaryPair(p) { + return p.next === null; +} +var LinkedDictionary = /** @class */ (function (_super) { + __extends(LinkedDictionary, _super); + function LinkedDictionary(toStrFunction) { + var _this = _super.call(this, toStrFunction) || this; + _this.head = new HeadOrTailLinkedDictionaryPair(); + _this.tail = new HeadOrTailLinkedDictionaryPair(); + _this.head.next = _this.tail; + _this.tail.prev = _this.head; + return _this; + } + /** + * Inserts the new node to the 'tail' of the list, updating the + * neighbors, and moving 'this.tail' (the End of List indicator) that + * to the end. + */ + LinkedDictionary.prototype.appendToTail = function (entry) { + var lastNode = this.tail.prev; + lastNode.next = entry; + entry.prev = lastNode; + entry.next = this.tail; + this.tail.prev = entry; + }; + /** + * Retrieves a linked dictionary from the table internally + */ + LinkedDictionary.prototype.getLinkedDictionaryPair = function (key) { + if (util.isUndefined(key)) { + return undefined; + } + var k = '$' + this.toStr(key); + var pair = (this.table[k]); + return pair; + }; + /** + * Returns the value to which this dictionary maps the specified key. + * Returns undefined if this dictionary contains no mapping for this key. + * @param {Object} key key whose associated value is to be returned. + * @return {*} the value to which this dictionary maps the specified key or + * undefined if the map contains no mapping for this key. + */ + LinkedDictionary.prototype.getValue = function (key) { + var pair = this.getLinkedDictionaryPair(key); + if (!util.isUndefined(pair)) { + return pair.value; + } + return undefined; + }; + /** + * Removes the mapping for this key from this dictionary if it is present. + * Also, if a value is present for this key, the entry is removed from the + * insertion ordering. + * @param {Object} key key whose mapping is to be removed from the + * dictionary. + * @return {*} previous value associated with specified key, or undefined if + * there was no mapping for key. + */ + LinkedDictionary.prototype.remove = function (key) { + var pair = this.getLinkedDictionaryPair(key); + if (!util.isUndefined(pair)) { + _super.prototype.remove.call(this, key); // This will remove it from the table + pair.unlink(); // This will unlink it from the chain + return pair.value; + } + return undefined; + }; + /** + * Removes all mappings from this LinkedDictionary. + * @this {collections.LinkedDictionary} + */ + LinkedDictionary.prototype.clear = function () { + _super.prototype.clear.call(this); + this.head.next = this.tail; + this.tail.prev = this.head; + }; + /** + * Internal function used when updating an existing KeyValue pair. + * It places the new value indexed by key into the table, but maintains + * its place in the linked ordering. + */ + LinkedDictionary.prototype.replace = function (oldPair, newPair) { + var k = '$' + this.toStr(newPair.key); + // set the new Pair's links to existingPair's links + newPair.next = oldPair.next; + newPair.prev = oldPair.prev; + // Delete Existing Pair from the table, unlink it from chain. + // As a result, the nElements gets decremented by this operation + this.remove(oldPair.key); + // Link new Pair in place of where oldPair was, + // by pointing the old pair's neighbors to it. + newPair.prev.next = newPair; + newPair.next.prev = newPair; + this.table[k] = newPair; + // To make up for the fact that the number of elements was decremented, + // We need to increase it by one. + ++this.nElements; + }; + /** + * Associates the specified value with the specified key in this dictionary. + * If the dictionary previously contained a mapping for this key, the old + * value is replaced by the specified value. + * Updating of a key that already exists maintains its place in the + * insertion order into the map. + * @param {Object} key key with which the specified value is to be + * associated. + * @param {Object} value value to be associated with the specified key. + * @return {*} previous value associated with the specified key, or undefined if + * there was no mapping for the key or if the key/value are undefined. + */ + LinkedDictionary.prototype.setValue = function (key, value) { + if (util.isUndefined(key) || util.isUndefined(value)) { + return undefined; + } + var existingPair = this.getLinkedDictionaryPair(key); + var newPair = new LinkedDictionaryPair(key, value); + var k = '$' + this.toStr(key); + // If there is already an element for that key, we + // keep it's place in the LinkedList + if (!util.isUndefined(existingPair)) { + this.replace(existingPair, newPair); + return existingPair.value; + } + else { + this.appendToTail(newPair); + this.table[k] = newPair; + ++this.nElements; + return undefined; + } + }; + /** + * Returns an array containing all of the keys in this LinkedDictionary, ordered + * by insertion order. + * @return {Array} an array containing all of the keys in this LinkedDictionary, + * ordered by insertion order. + */ + LinkedDictionary.prototype.keys = function () { + var array = []; + this.forEach(function (key, value) { + array.push(key); + }); + return array; + }; + /** + * Returns an array containing all of the values in this LinkedDictionary, ordered by + * insertion order. + * @return {Array} an array containing all of the values in this LinkedDictionary, + * ordered by insertion order. + */ + LinkedDictionary.prototype.values = function () { + var array = []; + this.forEach(function (key, value) { + array.push(value); + }); + return array; + }; + /** + * Executes the provided function once for each key-value pair + * present in this LinkedDictionary. It is done in the order of insertion + * into the LinkedDictionary + * @param {function(Object,Object):*} callback function to execute, it is + * invoked with two arguments: key and value. To break the iteration you can + * optionally return false. + */ + LinkedDictionary.prototype.forEach = function (callback) { + var crawlNode = this.head.next; + while (!isHeadOrTailLinkedDictionaryPair(crawlNode)) { + var ret = callback(crawlNode.key, crawlNode.value); + if (ret === false) { + return; + } + crawlNode = crawlNode.next; + } + }; + return LinkedDictionary; +}(Dictionary_1.default)); // End of LinkedDictionary +exports.default = LinkedDictionary; +// /** +// * Returns true if this dictionary is equal to the given dictionary. +// * Two dictionaries are equal if they contain the same mappings. +// * @param {collections.Dictionary} other the other dictionary. +// * @param {function(Object,Object):boolean=} valuesEqualFunction optional +// * function used to check if two values are equal. +// * @return {boolean} true if this dictionary is equal to the given dictionary. +// */ +// collections.Dictionary.prototype.equals = function(other,valuesEqualFunction) { +// const eqF = valuesEqualFunction || collections.defaultEquals; +// if(!(other instanceof collections.Dictionary)){ +// return false; +// } +// if(this.size() !== other.size()){ +// return false; +// } +// return this.equalsAux(this.firstNode,other.firstNode,eqF); +// } + +},{"./Dictionary":4,"./util":16}],8:[function(require,module,exports){ +"use strict"; +Object.defineProperty(exports, "__esModule", { value: true }); +var util = require("./util"); +var arrays = require("./arrays"); +var LinkedList = /** @class */ (function () { + /** + * Creates an empty Linked List. + * @class A linked list is a data structure consisting of a group of nodes + * which together represent a sequence. + * @constructor + */ + function LinkedList() { + /** + * First node in the list + * @type {Object} + * @private + */ + this.firstNode = null; + /** + * Last node in the list + * @type {Object} + * @private + */ + this.lastNode = null; + /** + * Number of elements in the list + * @type {number} + * @private + */ + this.nElements = 0; + } + /** + * Adds an element to this list. + * @param {Object} item element to be added. + * @param {number=} index optional index to add the element. If no index is specified + * the element is added to the end of this list. + * @return {boolean} true if the element was added or false if the index is invalid + * or if the element is undefined. + */ + LinkedList.prototype.add = function (item, index) { + if (util.isUndefined(index)) { + index = this.nElements; + } + if (index < 0 || index > this.nElements || util.isUndefined(item)) { + return false; + } + var newNode = this.createNode(item); + if (this.nElements === 0 || this.lastNode === null) { + // First node in the list. + this.firstNode = newNode; + this.lastNode = newNode; + } + else if (index === this.nElements) { + // Insert at the end. + this.lastNode.next = newNode; + this.lastNode = newNode; + } + else if (index === 0) { + // Change first node. + newNode.next = this.firstNode; + this.firstNode = newNode; + } + else { + var prev = this.nodeAtIndex(index - 1); + if (prev == null) { + return false; + } + newNode.next = prev.next; + prev.next = newNode; + } + this.nElements++; + return true; + }; + /** + * Returns the first element in this list. + * @return {*} the first element of the list or undefined if the list is + * empty. + */ + LinkedList.prototype.first = function () { + if (this.firstNode !== null) { + return this.firstNode.element; + } + return undefined; + }; + /** + * Returns the last element in this list. + * @return {*} the last element in the list or undefined if the list is + * empty. + */ + LinkedList.prototype.last = function () { + if (this.lastNode !== null) { + return this.lastNode.element; + } + return undefined; + }; + /** + * Returns the element at the specified position in this list. + * @param {number} index desired index. + * @return {*} the element at the given index or undefined if the index is + * out of bounds. + */ + LinkedList.prototype.elementAtIndex = function (index) { + var node = this.nodeAtIndex(index); + if (node === null) { + return undefined; + } + return node.element; + }; + /** + * Returns the index in this list of the first occurrence of the + * specified element, or -1 if the List does not contain this element. + *

If the elements inside this list are + * not comparable with the === operator a custom equals function should be + * provided to perform searches, the function must receive two arguments and + * return true if they are equal, false otherwise. Example:

+ * + * 
+     * const petsAreEqualByName = function(pet1, pet2) {
+     *  return pet1.name === pet2.name;
+     * }
+     *
+ * @param {Object} item element to search for. + * @param {function(Object,Object):boolean=} equalsFunction Optional + * function used to check if two elements are equal. + * @return {number} the index in this list of the first occurrence + * of the specified element, or -1 if this list does not contain the + * element. + */ + LinkedList.prototype.indexOf = function (item, equalsFunction) { + var equalsF = equalsFunction || util.defaultEquals; + if (util.isUndefined(item)) { + return -1; + } + var currentNode = this.firstNode; + var index = 0; + while (currentNode !== null) { + if (equalsF(currentNode.element, item)) { + return index; + } + index++; + currentNode = currentNode.next; + } + return -1; + }; + /** + * Returns true if this list contains the specified element. + *

If the elements inside the list are + * not comparable with the === operator a custom equals function should be + * provided to perform searches, the function must receive two arguments and + * return true if they are equal, false otherwise. Example:

+ * + * 
+       * const petsAreEqualByName = function(pet1, pet2) {
+       *  return pet1.name === pet2.name;
+       * }
+       *
+ * @param {Object} item element to search for. + * @param {function(Object,Object):boolean=} equalsFunction Optional + * function used to check if two elements are equal. + * @return {boolean} true if this list contains the specified element, false + * otherwise. + */ + LinkedList.prototype.contains = function (item, equalsFunction) { + return (this.indexOf(item, equalsFunction) >= 0); + }; + /** + * Removes the first occurrence of the specified element in this list. + *

If the elements inside the list are + * not comparable with the === operator a custom equals function should be + * provided to perform searches, the function must receive two arguments and + * return true if they are equal, false otherwise. Example:

+ * + * 
+     * const petsAreEqualByName = function(pet1, pet2) {
+     *  return pet1.name === pet2.name;
+     * }
+     *
+ * @param {Object} item element to be removed from this list, if present. + * @return {boolean} true if the list contained the specified element. + */ + LinkedList.prototype.remove = function (item, equalsFunction) { + var equalsF = equalsFunction || util.defaultEquals; + if (this.nElements < 1 || util.isUndefined(item)) { + return false; + } + var previous = null; + var currentNode = this.firstNode; + while (currentNode !== null) { + if (equalsF(currentNode.element, item)) { + if (previous == null) { + this.firstNode = currentNode.next; + if (currentNode === this.lastNode) { + this.lastNode = null; + } + } + else if (currentNode === this.lastNode) { + this.lastNode = previous; + previous.next = currentNode.next; + currentNode.next = null; + } + else { + previous.next = currentNode.next; + currentNode.next = null; + } + this.nElements--; + return true; + } + previous = currentNode; + currentNode = currentNode.next; + } + return false; + }; + /** + * Removes all of the elements from this list. + */ + LinkedList.prototype.clear = function () { + this.firstNode = null; + this.lastNode = null; + this.nElements = 0; + }; + /** + * Returns true if this list is equal to the given list. + * Two lists are equal if they have the same elements in the same order. + * @param {LinkedList} other the other list. + * @param {function(Object,Object):boolean=} equalsFunction optional + * function used to check if two elements are equal. If the elements in the lists + * are custom objects you should provide a function, otherwise + * the === operator is used to check equality between elements. + * @return {boolean} true if this list is equal to the given list. + */ + LinkedList.prototype.equals = function (other, equalsFunction) { + var eqF = equalsFunction || util.defaultEquals; + if (!(other instanceof LinkedList)) { + return false; + } + if (this.size() !== other.size()) { + return false; + } + return this.equalsAux(this.firstNode, other.firstNode, eqF); + }; + /** + * @private + */ + LinkedList.prototype.equalsAux = function (n1, n2, eqF) { + while (n1 !== null && n2 !== null) { + if (!eqF(n1.element, n2.element)) { + return false; + } + n1 = n1.next; + n2 = n2.next; + } + return true; + }; + /** + * Removes the element at the specified position in this list. + * @param {number} index given index. + * @return {*} removed element or undefined if the index is out of bounds. + */ + LinkedList.prototype.removeElementAtIndex = function (index) { + if (index < 0 || index >= this.nElements || this.firstNode === null || this.lastNode === null) { + return undefined; + } + var element; + if (this.nElements === 1) { + //First node in the list. + element = this.firstNode.element; + this.firstNode = null; + this.lastNode = null; + } + else { + var previous = this.nodeAtIndex(index - 1); + if (previous === null) { + element = this.firstNode.element; + this.firstNode = this.firstNode.next; + } + else if (previous.next === this.lastNode) { + element = this.lastNode.element; + this.lastNode = previous; + } + if (previous !== null && previous.next !== null) { + element = previous.next.element; + previous.next = previous.next.next; + } + } + this.nElements--; + return element; + }; + /** + * Executes the provided function once for each element present in this list in order. + * @param {function(Object):*} callback function to execute, it is + * invoked with one argument: the element value, to break the iteration you can + * optionally return false. + */ + LinkedList.prototype.forEach = function (callback) { + var currentNode = this.firstNode; + while (currentNode !== null) { + if (callback(currentNode.element) === false) { + break; + } + currentNode = currentNode.next; + } + }; + /** + * Reverses the order of the elements in this linked list (makes the last + * element first, and the first element last). + */ + LinkedList.prototype.reverse = function () { + var previous = null; + var current = this.firstNode; + var temp = null; + while (current !== null) { + temp = current.next; + current.next = previous; + previous = current; + current = temp; + } + temp = this.firstNode; + this.firstNode = this.lastNode; + this.lastNode = temp; + }; + /** + * Returns an array containing all of the elements in this list in proper + * sequence. + * @return {Array.<*>} an array containing all of the elements in this list, + * in proper sequence. + */ + LinkedList.prototype.toArray = function () { + var array = []; + var currentNode = this.firstNode; + while (currentNode !== null) { + array.push(currentNode.element); + currentNode = currentNode.next; + } + return array; + }; + /** + * Returns the number of elements in this list. + * @return {number} the number of elements in this list. + */ + LinkedList.prototype.size = function () { + return this.nElements; + }; + /** + * Returns true if this list contains no elements. + * @return {boolean} true if this list contains no elements. + */ + LinkedList.prototype.isEmpty = function () { + return this.nElements <= 0; + }; + LinkedList.prototype.toString = function () { + return arrays.toString(this.toArray()); + }; + /** + * @private + */ + LinkedList.prototype.nodeAtIndex = function (index) { + if (index < 0 || index >= this.nElements) { + return null; + } + if (index === (this.nElements - 1)) { + return this.lastNode; + } + var node = this.firstNode; + for (var i = 0; i < index && node != null; i++) { + node = node.next; + } + return node; + }; + /** + * @private + */ + LinkedList.prototype.createNode = function (item) { + return { + element: item, + next: null + }; + }; + return LinkedList; +}()); // End of linked list +exports.default = LinkedList; + +},{"./arrays":15,"./util":16}],9:[function(require,module,exports){ +"use strict"; +Object.defineProperty(exports, "__esModule", { value: true }); +var util = require("./util"); +var Dictionary_1 = require("./Dictionary"); +var arrays = require("./arrays"); +var MultiDictionary = /** @class */ (function () { + /** + * Creates an empty multi dictionary. + * @class

A multi dictionary is a special kind of dictionary that holds + * multiple values against each key. Setting a value into the dictionary will + * add the value to an array at that key. Getting a key will return an array, + * holding all the values set to that key. + * You can configure to allow duplicates in the values. + * This implementation accepts any kind of objects as keys.

+ * + *

If the keys are custom objects a function which converts keys to strings must be + * provided. Example:

+ * + * 
+     * function petToString(pet) {
+       *  return pet.name;
+       * }
+     *
+ *

If the values are custom objects a function to check equality between values + * must be provided. Example:

+ * + * 
+     * function petsAreEqualByAge(pet1,pet2) {
+       *  return pet1.age===pet2.age;
+       * }
+     *
+ * @constructor + * @param {function(Object):string=} toStrFunction optional function + * to convert keys to strings. If the keys aren't strings or if toString() + * is not appropriate, a custom function which receives a key and returns a + * unique string must be provided. + * @param {function(Object,Object):boolean=} valuesEqualsFunction optional + * function to check if two values are equal. + * + * @param allowDuplicateValues + */ + function MultiDictionary(toStrFunction, valuesEqualsFunction, allowDuplicateValues) { + if (allowDuplicateValues === void 0) { allowDuplicateValues = false; } + this.dict = new Dictionary_1.default(toStrFunction); + this.equalsF = valuesEqualsFunction || util.defaultEquals; + this.allowDuplicate = allowDuplicateValues; + } + /** + * Returns an array holding the values to which this dictionary maps + * the specified key. + * Returns an empty array if this dictionary contains no mappings for this key. + * @param {Object} key key whose associated values are to be returned. + * @return {Array} an array holding the values to which this dictionary maps + * the specified key. + */ + MultiDictionary.prototype.getValue = function (key) { + var values = this.dict.getValue(key); + if (util.isUndefined(values)) { + return []; + } + return arrays.copy(values); + }; + /** + * Adds the value to the array associated with the specified key, if + * it is not already present. + * @param {Object} key key with which the specified value is to be + * associated. + * @param {Object} value the value to add to the array at the key + * @return {boolean} true if the value was not already associated with that key. + */ + MultiDictionary.prototype.setValue = function (key, value) { + if (util.isUndefined(key) || util.isUndefined(value)) { + return false; + } + var array = this.dict.getValue(key); + if (util.isUndefined(array)) { + this.dict.setValue(key, [value]); + return true; + } + if (!this.allowDuplicate) { + if (arrays.contains(array, value, this.equalsF)) { + return false; + } + } + array.push(value); + return true; + }; + /** + * Removes the specified values from the array of values associated with the + * specified key. If a value isn't given, all values associated with the specified + * key are removed. + * @param {Object} key key whose mapping is to be removed from the + * dictionary. + * @param {Object=} value optional argument to specify the value to remove + * from the array associated with the specified key. + * @return {*} true if the dictionary changed, false if the key doesn't exist or + * if the specified value isn't associated with the specified key. + */ + MultiDictionary.prototype.remove = function (key, value) { + if (util.isUndefined(value)) { + var v = this.dict.remove(key); + return !util.isUndefined(v); + } + var array = this.dict.getValue(key); + if (!util.isUndefined(array) && arrays.remove(array, value, this.equalsF)) { + if (array.length === 0) { + this.dict.remove(key); + } + return true; + } + return false; + }; + /** + * Returns an array containing all of the keys in this dictionary. + * @return {Array} an array containing all of the keys in this dictionary. + */ + MultiDictionary.prototype.keys = function () { + return this.dict.keys(); + }; + /** + * Returns an array containing all of the values in this dictionary. + * @return {Array} an array containing all of the values in this dictionary. + */ + MultiDictionary.prototype.values = function () { + var values = this.dict.values(); + var array = []; + for (var _i = 0, values_1 = values; _i < values_1.length; _i++) { + var v = values_1[_i]; + for (var _a = 0, v_1 = v; _a < v_1.length; _a++) { + var w = v_1[_a]; + array.push(w); + } + } + return array; + }; + /** + * Returns true if this dictionary at least one value associatted the specified key. + * @param {Object} key key whose presence in this dictionary is to be + * tested. + * @return {boolean} true if this dictionary at least one value associatted + * the specified key. + */ + MultiDictionary.prototype.containsKey = function (key) { + return this.dict.containsKey(key); + }; + /** + * Removes all mappings from this dictionary. + */ + MultiDictionary.prototype.clear = function () { + this.dict.clear(); + }; + /** + * Returns the number of keys in this dictionary. + * @return {number} the number of key-value mappings in this dictionary. + */ + MultiDictionary.prototype.size = function () { + return this.dict.size(); + }; + /** + * Returns true if this dictionary contains no mappings. + * @return {boolean} true if this dictionary contains no mappings. + */ + MultiDictionary.prototype.isEmpty = function () { + return this.dict.isEmpty(); + }; + return MultiDictionary; +}()); // end of multi dictionary +exports.default = MultiDictionary; + +},{"./Dictionary":4,"./arrays":15,"./util":16}],10:[function(require,module,exports){ +"use strict"; +Object.defineProperty(exports, "__esModule", { value: true }); +var Direction; +(function (Direction) { + Direction[Direction["BEFORE"] = 0] = "BEFORE"; + Direction[Direction["AFTER"] = 1] = "AFTER"; + Direction[Direction["INSIDE_AT_END"] = 2] = "INSIDE_AT_END"; + Direction[Direction["INSIDE_AT_START"] = 3] = "INSIDE_AT_START"; +})(Direction || (Direction = {})); +var MultiRootTree = /** @class */ (function () { + function MultiRootTree(rootIds, nodes) { + if (rootIds === void 0) { rootIds = []; } + if (nodes === void 0) { nodes = {}; } + this.rootIds = rootIds; + this.nodes = nodes; + this.initRootIds(); + this.initNodes(); + } + MultiRootTree.prototype.initRootIds = function () { + for (var _i = 0, _a = this.rootIds; _i < _a.length; _i++) { + var rootId = _a[_i]; + this.createEmptyNodeIfNotExist(rootId); + } + }; + MultiRootTree.prototype.initNodes = function () { + for (var nodeKey in this.nodes) { + if (this.nodes.hasOwnProperty(nodeKey)) { + for (var _i = 0, _a = this.nodes[nodeKey]; _i < _a.length; _i++) { + var nodeListItem = _a[_i]; + this.createEmptyNodeIfNotExist(nodeListItem); + } + } + } + }; + MultiRootTree.prototype.createEmptyNodeIfNotExist = function (nodeKey) { + if (!this.nodes[nodeKey]) { + this.nodes[nodeKey] = []; + } + }; + MultiRootTree.prototype.getRootIds = function () { + var clone = this.rootIds.slice(); + return clone; + }; + MultiRootTree.prototype.getNodes = function () { + var clone = {}; + for (var nodeKey in this.nodes) { + if (this.nodes.hasOwnProperty(nodeKey)) { + clone[nodeKey] = this.nodes[nodeKey].slice(); + } + } + return clone; + }; + MultiRootTree.prototype.getObject = function () { + return { + rootIds: this.getRootIds(), + nodes: this.getNodes(), + }; + }; + MultiRootTree.prototype.toObject = function () { + return this.getObject(); + }; + MultiRootTree.prototype.flatten = function () { + var _this = this; + var extraPropsObject = []; + for (var i = 0; i < this.rootIds.length; i++) { + var rootId = this.rootIds[i]; + extraPropsObject.push({ + id: rootId, + level: 0, + hasParent: false, + childrenCount: 0, + }); + traverse(rootId, this.nodes, extraPropsObject, 0); + } + for (var _i = 0, extraPropsObject_1 = extraPropsObject; _i < extraPropsObject_1.length; _i++) { + var o = extraPropsObject_1[_i]; + o.childrenCount = countChildren(o.id); + } + return extraPropsObject; + function countChildren(id) { + if (!_this.nodes[id]) { + return 0; + } + else { + var childrenCount = _this.nodes[id].length; + return childrenCount; + } + } + function traverse(startId, nodes, returnArray, level) { + if (level === void 0) { level = 0; } + if (!startId || !nodes || !returnArray || !nodes[startId]) { + return; + } + level++; + var idsList = nodes[startId]; + for (var i = 0; i < idsList.length; i++) { + var id = idsList[i]; + returnArray.push({ id: id, level: level, hasParent: true }); + traverse(id, nodes, returnArray, level); + } + level--; + } + }; + MultiRootTree.prototype.moveIdBeforeId = function (moveId, beforeId) { + return this.moveId(moveId, beforeId, Direction.BEFORE); + }; + MultiRootTree.prototype.moveIdAfterId = function (moveId, afterId) { + return this.moveId(moveId, afterId, Direction.AFTER); + }; + MultiRootTree.prototype.moveIdIntoId = function (moveId, insideId, atStart) { + if (atStart === void 0) { atStart = true; } + if (atStart) { + return this.moveId(moveId, insideId, Direction.INSIDE_AT_START); + } + else { + return this.moveId(moveId, insideId, Direction.INSIDE_AT_END); + } + }; + MultiRootTree.prototype.swapRootIdWithRootId = function (rootId, withRootId) { + var leftIndex = this.findRootId(rootId); + var rightIndex = this.findRootId(withRootId); + this.swapRootPositionWithRootPosition(leftIndex, rightIndex); + }; + MultiRootTree.prototype.swapRootPositionWithRootPosition = function (swapRootPosition, withRootPosition) { + var temp = this.rootIds[withRootPosition]; + this.rootIds[withRootPosition] = this.rootIds[swapRootPosition]; + this.rootIds[swapRootPosition] = temp; + }; + MultiRootTree.prototype.deleteId = function (id) { + this.rootDeleteId(id); + this.nodeAndSubNodesDelete(id); + this.nodeRefrencesDelete(id); + }; + MultiRootTree.prototype.insertIdBeforeId = function (beforeId, insertId) { + var foundRootIdIndex = this.findRootId(beforeId); + if (foundRootIdIndex > -1) { + this.insertIdIntoRoot(insertId, foundRootIdIndex); + } + for (var nodeKey in this.nodes) { + if (this.nodes.hasOwnProperty(nodeKey)) { + var foundNodeIdIndex = this.findNodeId(nodeKey, beforeId); + if (foundNodeIdIndex > -1) { + this.insertIdIntoNode(nodeKey, insertId, foundNodeIdIndex); + } + } + } + }; + MultiRootTree.prototype.insertIdAfterId = function (belowId, insertId) { + var foundRootIdIndex = this.findRootId(belowId); + if (foundRootIdIndex > -1) { + this.insertIdIntoRoot(insertId, foundRootIdIndex + 1); + } + for (var nodeKey in this.nodes) { + if (this.nodes.hasOwnProperty(nodeKey)) { + var foundNodeIdIndex = this.findNodeId(nodeKey, belowId); + if (foundNodeIdIndex > -1) { + this.insertIdIntoNode(nodeKey, insertId, foundNodeIdIndex + 1); + } + } + } + }; + MultiRootTree.prototype.insertIdIntoId = function (insideId, insertId) { + this.nodeInsertAtEnd(insideId, insertId); + this.nodes[insertId] = []; + }; + MultiRootTree.prototype.insertIdIntoRoot = function (id, position) { + if (position === undefined) { + this.rootInsertAtEnd(id); + } + else { + if (position < 0) { + var length_1 = this.rootIds.length; + this.rootIds.splice((position + length_1 + 1), 0, id); + } + else { + this.rootIds.splice(position, 0, id); + } + } + this.nodes[id] = this.nodes[id] || []; + }; + MultiRootTree.prototype.insertIdIntoNode = function (nodeKey, id, position) { + this.nodes[nodeKey] = this.nodes[nodeKey] || []; + this.nodes[id] = this.nodes[id] || []; + if (position === undefined) { + this.nodeInsertAtEnd(nodeKey, id); + } + else { + if (position < 0) { + var length_2 = this.nodes[nodeKey].length; + this.nodes[nodeKey].splice((position + length_2 + 1), 0, id); + } + else { + this.nodes[nodeKey].splice(position, 0, id); + } + } + }; + MultiRootTree.prototype.moveId = function (moveId, beforeId, direction) { + var sourceId = moveId; + var sourceRootIndex = this.findRootId(sourceId); + var sourceNodeKey; + var sourceNodeIdIndex; + if (this.nodes[beforeId]) { + sourceNodeKey = beforeId; + } + for (var nodeKey in this.nodes) { + if (this.nodes.hasOwnProperty(nodeKey)) { + sourceNodeIdIndex = this.findNodeId(nodeKey, beforeId); + break; + } + } + // got all + var targetId = beforeId; + var targetRootIndex = this.findRootId(targetId); + var targetNodeKey; + var targetNodeIdIndex; + if (this.nodes[beforeId]) { + targetNodeKey = beforeId; + } + for (var nodeKey in this.nodes) { + if (this.nodes.hasOwnProperty(nodeKey)) { + targetNodeIdIndex = this.findNodeId(nodeKey, beforeId); + break; + } + } + // got all + if (sourceRootIndex > -1) { + if (targetRootIndex > -1) { + // moving root to root + // console.log(`Moving ROOT to ROOT`); + // console.log(`RootIds:`); + // console.log(this.rootIds); + // console.log(`TargetIndex=${targetRootIndex}, SourceIndex=${sourceRootIndex}`); + // console.log(`TargetId=${targetId}, SourceId=${sourceId}`); + this.rootDelete(sourceRootIndex); // indexes change now + if (targetRootIndex > sourceRootIndex) { + targetRootIndex--; + } + else { + } + switch (direction) { + case Direction.BEFORE: + this.insertIdIntoRoot(sourceId, targetRootIndex); + break; + case Direction.AFTER: + this.insertIdIntoRoot(sourceId, targetRootIndex + 1); + break; + case Direction.INSIDE_AT_START: + this.nodeInsertAtStart(targetId, sourceId); + break; + case Direction.INSIDE_AT_END: + this.nodeInsertAtEnd(targetId, sourceId); + break; + } + } + else { + // moving root (source) ABOVE node (target) + // will remove one entry from roots + this.rootDelete(sourceRootIndex); + for (var nodeKey in this.nodes) { + if (this.nodes.hasOwnProperty(nodeKey)) { + var index = this.findNodeId(nodeKey, targetId); + if (index > -1) { + switch (direction) { + case Direction.BEFORE: + this.insertIdIntoNode(nodeKey, sourceId, index); + break; + case Direction.AFTER: + this.insertIdIntoNode(nodeKey, sourceId, index + 1); + break; + case Direction.INSIDE_AT_START: + this.nodeInsertAtStart(targetId, sourceId); + break; + case Direction.INSIDE_AT_END: + this.nodeInsertAtEnd(targetId, sourceId); + break; + } + break; + } + } + } + } + } + else { + if (targetRootIndex > -1) { + // moving node (source) ABOVE root (target) + // delete source id from each node + for (var nodeKey in this.nodes) { + if (this.nodes.hasOwnProperty(nodeKey)) { + var index = this.findNodeId(nodeKey, sourceId); + if (index > -1) { + // this.nodeInsertId(nodeKey, sourceId, index); + this.nodeDeleteAtIndex(nodeKey, index); + break; + } + } + } + switch (direction) { + case Direction.BEFORE: + this.insertIdIntoRoot(sourceId, targetRootIndex); + break; + case Direction.AFTER: + this.insertIdIntoRoot(sourceId, targetRootIndex + 1); + break; + case Direction.INSIDE_AT_START: + this.nodeInsertAtStart(targetId, sourceId); + break; + case Direction.INSIDE_AT_END: + this.nodeInsertAtEnd(targetId, sourceId); + break; + } + } + else { + // moving node (source) ABOVE node (target) + // delete source id from each node + for (var nodeKey in this.nodes) { + if (this.nodes.hasOwnProperty(nodeKey)) { + var index = this.findNodeId(nodeKey, sourceId); + if (index > -1) { + this.nodeDeleteAtIndex(nodeKey, index); + break; + } + } + } + for (var nodeKey in this.nodes) { + if (this.nodes.hasOwnProperty(nodeKey)) { + var index = this.findNodeId(nodeKey, targetId); + if (index > -1) { + switch (direction) { + case Direction.BEFORE: + this.insertIdIntoNode(nodeKey, sourceId, index); + break; + case Direction.AFTER: + this.insertIdIntoNode(nodeKey, sourceId, index + 1); + break; + case Direction.INSIDE_AT_START: + this.nodeInsertAtStart(targetId, sourceId); + break; + case Direction.INSIDE_AT_END: + this.nodeInsertAtEnd(targetId, sourceId); + break; + } + break; + } + } + } + } + } + }; + MultiRootTree.prototype.swapArrayElements = function (arr, indexA, indexB) { + var temp = arr[indexA]; + arr[indexA] = arr[indexB]; + arr[indexB] = temp; + return arr; + }; + MultiRootTree.prototype.rootDeleteId = function (id) { + var index = this.findRootId(id); + if (index > -1) { + this.rootDelete(index); + } + }; + MultiRootTree.prototype.nodeAndSubNodesDelete = function (nodeKey) { + var toDeleteLater = []; + for (var i = 0; i < this.nodes[nodeKey].length; i++) { + var id = this.nodes[nodeKey][i]; + this.nodeAndSubNodesDelete(id); + toDeleteLater.push(nodeKey); + } + this.nodeDelete(nodeKey); + for (var i = 0; i < toDeleteLater.length; i++) { + this.nodeDelete(toDeleteLater[i]); + } + }; + MultiRootTree.prototype.nodeRefrencesDelete = function (id) { + for (var nodeKey in this.nodes) { + if (this.nodes.hasOwnProperty(nodeKey)) { + for (var i = 0; i < this.nodes[nodeKey].length; i++) { + var targetId = this.nodes[nodeKey][i]; + if (targetId === id) { + this.nodeDeleteAtIndex(nodeKey, i); + } + } + } + } + }; + MultiRootTree.prototype.nodeDelete = function (nodeKey) { + delete this.nodes[nodeKey]; + }; + MultiRootTree.prototype.findRootId = function (id) { + return this.rootIds.indexOf(id); + }; + MultiRootTree.prototype.findNodeId = function (nodeKey, id) { + return this.nodes[nodeKey].indexOf(id); + }; + MultiRootTree.prototype.findNode = function (nodeKey) { + return this.nodes[nodeKey]; + }; + MultiRootTree.prototype.nodeInsertAtStart = function (nodeKey, id) { + this.nodes[nodeKey].unshift(id); + }; + MultiRootTree.prototype.nodeInsertAtEnd = function (nodeKey, id) { + this.nodes[nodeKey].push(id); + }; + MultiRootTree.prototype.rootDelete = function (index) { + this.rootIds.splice(index, 1); + }; + MultiRootTree.prototype.nodeDeleteAtIndex = function (nodeKey, index) { + this.nodes[nodeKey].splice(index, 1); + }; + MultiRootTree.prototype.rootInsertAtStart = function (id) { + this.rootIds.unshift(id); + }; + MultiRootTree.prototype.rootInsertAtEnd = function (id) { + this.rootIds.push(id); + }; + return MultiRootTree; +}()); +exports.default = MultiRootTree; + +},{}],11:[function(require,module,exports){ +"use strict"; +Object.defineProperty(exports, "__esModule", { value: true }); +var util = require("./util"); +var Heap_1 = require("./Heap"); +var PriorityQueue = /** @class */ (function () { + /** + * Creates an empty priority queue. + * @class

In a priority queue each element is associated with a "priority", + * elements are dequeued in highest-priority-first order (the elements with the + * highest priority are dequeued first). Priority Queues are implemented as heaps. + * If the inserted elements are custom objects a compare function must be provided, + * otherwise the <=, === and >= operators are used to compare object priority.

+ * 
+     * function compare(a, b) {
+     *  if (a is less than b by some ordering criterion) {
+     *     return -1;
+     *  } if (a is greater than b by the ordering criterion) {
+     *     return 1;
+     *  }
+     *  // a must be equal to b
+     *  return 0;
+     * }
+     *
+ * @constructor + * @param {function(Object,Object):number=} compareFunction optional + * function used to compare two element priorities. Must return a negative integer, + * zero, or a positive integer as the first argument is less than, equal to, + * or greater than the second. + */ + function PriorityQueue(compareFunction) { + this.heap = new Heap_1.default(util.reverseCompareFunction(compareFunction)); + } + /** + * Inserts the specified element into this priority queue. + * @param {Object} element the element to insert. + * @return {boolean} true if the element was inserted, or false if it is undefined. + */ + PriorityQueue.prototype.enqueue = function (element) { + return this.heap.add(element); + }; + /** + * Inserts the specified element into this priority queue. + * @param {Object} element the element to insert. + * @return {boolean} true if the element was inserted, or false if it is undefined. + */ + PriorityQueue.prototype.add = function (element) { + return this.heap.add(element); + }; + /** + * Retrieves and removes the highest priority element of this queue. + * @return {*} the the highest priority element of this queue, + * or undefined if this queue is empty. + */ + PriorityQueue.prototype.dequeue = function () { + if (this.heap.size() !== 0) { + var el = this.heap.peek(); + this.heap.removeRoot(); + return el; + } + return undefined; + }; + /** + * Retrieves, but does not remove, the highest priority element of this queue. + * @return {*} the highest priority element of this queue, or undefined if this queue is empty. + */ + PriorityQueue.prototype.peek = function () { + return this.heap.peek(); + }; + /** + * Returns true if this priority queue contains the specified element. + * @param {Object} element element to search for. + * @return {boolean} true if this priority queue contains the specified element, + * false otherwise. + */ + PriorityQueue.prototype.contains = function (element) { + return this.heap.contains(element); + }; + /** + * Checks if this priority queue is empty. + * @return {boolean} true if and only if this priority queue contains no items; false + * otherwise. + */ + PriorityQueue.prototype.isEmpty = function () { + return this.heap.isEmpty(); + }; + /** + * Returns the number of elements in this priority queue. + * @return {number} the number of elements in this priority queue. + */ + PriorityQueue.prototype.size = function () { + return this.heap.size(); + }; + /** + * Removes all of the elements from this priority queue. + */ + PriorityQueue.prototype.clear = function () { + this.heap.clear(); + }; + /** + * Executes the provided function once for each element present in this queue in + * no particular order. + * @param {function(Object):*} callback function to execute, it is + * invoked with one argument: the element value, to break the iteration you can + * optionally return false. + */ + PriorityQueue.prototype.forEach = function (callback) { + this.heap.forEach(callback); + }; + return PriorityQueue; +}()); // end of priority queue +exports.default = PriorityQueue; + +},{"./Heap":6,"./util":16}],12:[function(require,module,exports){ +"use strict"; +Object.defineProperty(exports, "__esModule", { value: true }); +var LinkedList_1 = require("./LinkedList"); +var Queue = /** @class */ (function () { + /** + * Creates an empty queue. + * @class A queue is a First-In-First-Out (FIFO) data structure, the first + * element added to the queue will be the first one to be removed. This + * implementation uses a linked list as a container. + * @constructor + */ + function Queue() { + this.list = new LinkedList_1.default(); + } + /** + * Inserts the specified element into the end of this queue. + * @param {Object} elem the element to insert. + * @return {boolean} true if the element was inserted, or false if it is undefined. + */ + Queue.prototype.enqueue = function (elem) { + return this.list.add(elem); + }; + /** + * Inserts the specified element into the end of this queue. + * @param {Object} elem the element to insert. + * @return {boolean} true if the element was inserted, or false if it is undefined. + */ + Queue.prototype.add = function (elem) { + return this.list.add(elem); + }; + /** + * Retrieves and removes the head of this queue. + * @return {*} the head of this queue, or undefined if this queue is empty. + */ + Queue.prototype.dequeue = function () { + if (this.list.size() !== 0) { + var el = this.list.first(); + this.list.removeElementAtIndex(0); + return el; + } + return undefined; + }; + /** + * Retrieves, but does not remove, the head of this queue. + * @return {*} the head of this queue, or undefined if this queue is empty. + */ + Queue.prototype.peek = function () { + if (this.list.size() !== 0) { + return this.list.first(); + } + return undefined; + }; + /** + * Returns the number of elements in this queue. + * @return {number} the number of elements in this queue. + */ + Queue.prototype.size = function () { + return this.list.size(); + }; + /** + * Returns true if this queue contains the specified element. + *

If the elements inside this stack are + * not comparable with the === operator, a custom equals function should be + * provided to perform searches, the function must receive two arguments and + * return true if they are equal, false otherwise. Example:

+ * + * 
+     * const petsAreEqualByName (pet1, pet2) {
+     *  return pet1.name === pet2.name;
+     * }
+     *
+ * @param {Object} elem element to search for. + * @param {function(Object,Object):boolean=} equalsFunction optional + * function to check if two elements are equal. + * @return {boolean} true if this queue contains the specified element, + * false otherwise. + */ + Queue.prototype.contains = function (elem, equalsFunction) { + return this.list.contains(elem, equalsFunction); + }; + /** + * Checks if this queue is empty. + * @return {boolean} true if and only if this queue contains no items; false + * otherwise. + */ + Queue.prototype.isEmpty = function () { + return this.list.size() <= 0; + }; + /** + * Removes all of the elements from this queue. + */ + Queue.prototype.clear = function () { + this.list.clear(); + }; + /** + * Executes the provided function once for each element present in this queue in + * FIFO order. + * @param {function(Object):*} callback function to execute, it is + * invoked with one argument: the element value, to break the iteration you can + * optionally return false. + */ + Queue.prototype.forEach = function (callback) { + this.list.forEach(callback); + }; + return Queue; +}()); // End of queue +exports.default = Queue; + +},{"./LinkedList":8}],13:[function(require,module,exports){ +"use strict"; +Object.defineProperty(exports, "__esModule", { value: true }); +var util = require("./util"); +var arrays = require("./arrays"); +var Dictionary_1 = require("./Dictionary"); +var Set = /** @class */ (function () { + /** + * Creates an empty set. + * @class

A set is a data structure that contains no duplicate items.

+ *

If the inserted elements are custom objects a function + * which converts elements to strings must be provided. Example:

+ * + * 
+     * function petToString(pet) {
+     *  return pet.name;
+     * }
+     *
+ * + * @constructor + * @param {function(Object):string=} toStringFunction optional function used + * to convert elements to strings. If the elements aren't strings or if toString() + * is not appropriate, a custom function which receives an object and returns a + * unique string must be provided. + */ + function Set(toStringFunction) { + this.dictionary = new Dictionary_1.default(toStringFunction); + } + /** + * Returns true if this set contains the specified element. + * @param {Object} element element to search for. + * @return {boolean} true if this set contains the specified element, + * false otherwise. + */ + Set.prototype.contains = function (element) { + return this.dictionary.containsKey(element); + }; + /** + * Adds the specified element to this set if it is not already present. + * @param {Object} element the element to insert. + * @return {boolean} true if this set did not already contain the specified element. + */ + Set.prototype.add = function (element) { + if (this.contains(element) || util.isUndefined(element)) { + return false; + } + else { + this.dictionary.setValue(element, element); + return true; + } + }; + /** + * Performs an intersecion between this and another set. + * Removes all values that are not present this set and the given set. + * @param {collections.Set} otherSet other set. + */ + Set.prototype.intersection = function (otherSet) { + var set = this; + this.forEach(function (element) { + if (!otherSet.contains(element)) { + set.remove(element); + } + return true; + }); + }; + /** + * Performs a union between this and another set. + * Adds all values from the given set to this set. + * @param {collections.Set} otherSet other set. + */ + Set.prototype.union = function (otherSet) { + var set = this; + otherSet.forEach(function (element) { + set.add(element); + return true; + }); + }; + /** + * Performs a difference between this and another set. + * Removes from this set all the values that are present in the given set. + * @param {collections.Set} otherSet other set. + */ + Set.prototype.difference = function (otherSet) { + var set = this; + otherSet.forEach(function (element) { + set.remove(element); + return true; + }); + }; + /** + * Checks whether the given set contains all the elements in this set. + * @param {collections.Set} otherSet other set. + * @return {boolean} true if this set is a subset of the given set. + */ + Set.prototype.isSubsetOf = function (otherSet) { + if (this.size() > otherSet.size()) { + return false; + } + var isSub = true; + this.forEach(function (element) { + if (!otherSet.contains(element)) { + isSub = false; + return false; + } + return true; + }); + return isSub; + }; + /** + * Removes the specified element from this set if it is present. + * @return {boolean} true if this set contained the specified element. + */ + Set.prototype.remove = function (element) { + if (!this.contains(element)) { + return false; + } + else { + this.dictionary.remove(element); + return true; + } + }; + /** + * Executes the provided function once for each element + * present in this set. + * @param {function(Object):*} callback function to execute, it is + * invoked with one arguments: the element. To break the iteration you can + * optionally return false. + */ + Set.prototype.forEach = function (callback) { + this.dictionary.forEach(function (k, v) { + return callback(v); + }); + }; + /** + * Returns an array containing all of the elements in this set in arbitrary order. + * @return {Array} an array containing all of the elements in this set. + */ + Set.prototype.toArray = function () { + return this.dictionary.values(); + }; + /** + * Returns true if this set contains no elements. + * @return {boolean} true if this set contains no elements. + */ + Set.prototype.isEmpty = function () { + return this.dictionary.isEmpty(); + }; + /** + * Returns the number of elements in this set. + * @return {number} the number of elements in this set. + */ + Set.prototype.size = function () { + return this.dictionary.size(); + }; + /** + * Removes all of the elements from this set. + */ + Set.prototype.clear = function () { + this.dictionary.clear(); + }; + /* + * Provides a string representation for display + */ + Set.prototype.toString = function () { + return arrays.toString(this.toArray()); + }; + return Set; +}()); // end of Set +exports.default = Set; + +},{"./Dictionary":4,"./arrays":15,"./util":16}],14:[function(require,module,exports){ +"use strict"; +Object.defineProperty(exports, "__esModule", { value: true }); +var LinkedList_1 = require("./LinkedList"); +var Stack = /** @class */ (function () { + /** + * Creates an empty Stack. + * @class A Stack is a Last-In-First-Out (LIFO) data structure, the last + * element added to the stack will be the first one to be removed. This + * implementation uses a linked list as a container. + * @constructor + */ + function Stack() { + this.list = new LinkedList_1.default(); + } + /** + * Pushes an item onto the top of this stack. + * @param {Object} elem the element to be pushed onto this stack. + * @return {boolean} true if the element was pushed or false if it is undefined. + */ + Stack.prototype.push = function (elem) { + return this.list.add(elem, 0); + }; + /** + * Pushes an item onto the top of this stack. + * @param {Object} elem the element to be pushed onto this stack. + * @return {boolean} true if the element was pushed or false if it is undefined. + */ + Stack.prototype.add = function (elem) { + return this.list.add(elem, 0); + }; + /** + * Removes the object at the top of this stack and returns that object. + * @return {*} the object at the top of this stack or undefined if the + * stack is empty. + */ + Stack.prototype.pop = function () { + return this.list.removeElementAtIndex(0); + }; + /** + * Looks at the object at the top of this stack without removing it from the + * stack. + * @return {*} the object at the top of this stack or undefined if the + * stack is empty. + */ + Stack.prototype.peek = function () { + return this.list.first(); + }; + /** + * Returns the number of elements in this stack. + * @return {number} the number of elements in this stack. + */ + Stack.prototype.size = function () { + return this.list.size(); + }; + /** + * Returns true if this stack contains the specified element. + *

If the elements inside this stack are + * not comparable with the === operator, a custom equals function should be + * provided to perform searches, the function must receive two arguments and + * return true if they are equal, false otherwise. Example:

+ * + * 
+     * const petsAreEqualByName (pet1, pet2) {
+     *  return pet1.name === pet2.name;
+     * }
+     *
+ * @param {Object} elem element to search for. + * @param {function(Object,Object):boolean=} equalsFunction optional + * function to check if two elements are equal. + * @return {boolean} true if this stack contains the specified element, + * false otherwise. + */ + Stack.prototype.contains = function (elem, equalsFunction) { + return this.list.contains(elem, equalsFunction); + }; + /** + * Checks if this stack is empty. + * @return {boolean} true if and only if this stack contains no items; false + * otherwise. + */ + Stack.prototype.isEmpty = function () { + return this.list.isEmpty(); + }; + /** + * Removes all of the elements from this stack. + */ + Stack.prototype.clear = function () { + this.list.clear(); + }; + /** + * Executes the provided function once for each element present in this stack in + * LIFO order. + * @param {function(Object):*} callback function to execute, it is + * invoked with one argument: the element value, to break the iteration you can + * optionally return false. + */ + Stack.prototype.forEach = function (callback) { + this.list.forEach(callback); + }; + return Stack; +}()); // End of stack +exports.default = Stack; + +},{"./LinkedList":8}],15:[function(require,module,exports){ +"use strict"; +Object.defineProperty(exports, "__esModule", { value: true }); +var util = require("./util"); +/** + * Returns the position of the first occurrence of the specified item + * within the specified array.4 + * @param {*} array the array in which to search the element. + * @param {Object} item the element to search. + * @param {function(Object,Object):boolean=} equalsFunction optional function used to + * check equality between 2 elements. + * @return {number} the position of the first occurrence of the specified element + * within the specified array, or -1 if not found. + */ +function indexOf(array, item, equalsFunction) { + var equals = equalsFunction || util.defaultEquals; + var length = array.length; + for (var i = 0; i < length; i++) { + if (equals(array[i], item)) { + return i; + } + } + return -1; +} +exports.indexOf = indexOf; +/** + * Returns the position of the last occurrence of the specified element + * within the specified array. + * @param {*} array the array in which to search the element. + * @param {Object} item the element to search. + * @param {function(Object,Object):boolean=} equalsFunction optional function used to + * check equality between 2 elements. + * @return {number} the position of the last occurrence of the specified element + * within the specified array or -1 if not found. + */ +function lastIndexOf(array, item, equalsFunction) { + var equals = equalsFunction || util.defaultEquals; + var length = array.length; + for (var i = length - 1; i >= 0; i--) { + if (equals(array[i], item)) { + return i; + } + } + return -1; +} +exports.lastIndexOf = lastIndexOf; +/** + * Returns true if the specified array contains the specified element. + * @param {*} array the array in which to search the element. + * @param {Object} item the element to search. + * @param {function(Object,Object):boolean=} equalsFunction optional function to + * check equality between 2 elements. + * @return {boolean} true if the specified array contains the specified element. + */ +function contains(array, item, equalsFunction) { + return indexOf(array, item, equalsFunction) >= 0; +} +exports.contains = contains; +/** + * Removes the first ocurrence of the specified element from the specified array. + * @param {*} array the array in which to search element. + * @param {Object} item the element to search. + * @param {function(Object,Object):boolean=} equalsFunction optional function to + * check equality between 2 elements. + * @return {boolean} true if the array changed after this call. + */ +function remove(array, item, equalsFunction) { + var index = indexOf(array, item, equalsFunction); + if (index < 0) { + return false; + } + array.splice(index, 1); + return true; +} +exports.remove = remove; +/** + * Returns the number of elements in the specified array equal + * to the specified object. + * @param {Array} array the array in which to determine the frequency of the element. + * @param {Object} item the element whose frequency is to be determined. + * @param {function(Object,Object):boolean=} equalsFunction optional function used to + * check equality between 2 elements. + * @return {number} the number of elements in the specified array + * equal to the specified object. + */ +function frequency(array, item, equalsFunction) { + var equals = equalsFunction || util.defaultEquals; + var length = array.length; + var freq = 0; + for (var i = 0; i < length; i++) { + if (equals(array[i], item)) { + freq++; + } + } + return freq; +} +exports.frequency = frequency; +/** + * Returns true if the two specified arrays are equal to one another. + * Two arrays are considered equal if both arrays contain the same number + * of elements, and all corresponding pairs of elements in the two + * arrays are equal and are in the same order. + * @param {Array} array1 one array to be tested for equality. + * @param {Array} array2 the other array to be tested for equality. + * @param {function(Object,Object):boolean=} equalsFunction optional function used to + * check equality between elemements in the arrays. + * @return {boolean} true if the two arrays are equal + */ +function equals(array1, array2, equalsFunction) { + var equals = equalsFunction || util.defaultEquals; + if (array1.length !== array2.length) { + return false; + } + var length = array1.length; + for (var i = 0; i < length; i++) { + if (!equals(array1[i], array2[i])) { + return false; + } + } + return true; +} +exports.equals = equals; +/** + * Returns shallow a copy of the specified array. + * @param {*} array the array to copy. + * @return {Array} a copy of the specified array + */ +function copy(array) { + return array.concat(); +} +exports.copy = copy; +/** + * Swaps the elements at the specified positions in the specified array. + * @param {Array} array The array in which to swap elements. + * @param {number} i the index of one element to be swapped. + * @param {number} j the index of the other element to be swapped. + * @return {boolean} true if the array is defined and the indexes are valid. + */ +function swap(array, i, j) { + if (i < 0 || i >= array.length || j < 0 || j >= array.length) { + return false; + } + var temp = array[i]; + array[i] = array[j]; + array[j] = temp; + return true; +} +exports.swap = swap; +function toString(array) { + return '[' + array.toString() + ']'; +} +exports.toString = toString; +/** + * Executes the provided function once for each element present in this array + * starting from index 0 to length - 1. + * @param {Array} array The array in which to iterate. + * @param {function(Object):*} callback function to execute, it is + * invoked with one argument: the element value, to break the iteration you can + * optionally return false. + */ +function forEach(array, callback) { + for (var _i = 0, array_1 = array; _i < array_1.length; _i++) { + var ele = array_1[_i]; + if (callback(ele) === false) { + return; + } + } +} +exports.forEach = forEach; + +},{"./util":16}],16:[function(require,module,exports){ +"use strict"; +Object.defineProperty(exports, "__esModule", { value: true }); +var _hasOwnProperty = Object.prototype.hasOwnProperty; +exports.has = function (obj, prop) { + return _hasOwnProperty.call(obj, prop); +}; +/** + * Default function to compare element order. + * @function + */ +function defaultCompare(a, b) { + if (a < b) { + return -1; + } + else if (a === b) { + return 0; + } + else { + return 1; + } +} +exports.defaultCompare = defaultCompare; +/** + * Default function to test equality. + * @function + */ +function defaultEquals(a, b) { + return a === b; +} +exports.defaultEquals = defaultEquals; +/** + * Default function to convert an object to a string. + * @function + */ +function defaultToString(item) { + if (item === null) { + return 'COLLECTION_NULL'; + } + else if (isUndefined(item)) { + return 'COLLECTION_UNDEFINED'; + } + else if (isString(item)) { + return '$s' + item; + } + else { + return '$o' + item.toString(); + } +} +exports.defaultToString = defaultToString; +/** +* Joins all the properies of the object using the provided join string +*/ +function makeString(item, join) { + if (join === void 0) { join = ','; } + if (item === null) { + return 'COLLECTION_NULL'; + } + else if (isUndefined(item)) { + return 'COLLECTION_UNDEFINED'; + } + else if (isString(item)) { + return item.toString(); + } + else { + var toret = '{'; + var first = true; + for (var prop in item) { + if (exports.has(item, prop)) { + if (first) { + first = false; + } + else { + toret = toret + join; + } + toret = toret + prop + ':' + item[prop]; + } + } + return toret + '}'; + } +} +exports.makeString = makeString; +/** + * Checks if the given argument is a function. + * @function + */ +function isFunction(func) { + return (typeof func) === 'function'; +} +exports.isFunction = isFunction; +/** + * Checks if the given argument is undefined. + * @function + */ +function isUndefined(obj) { + return (typeof obj) === 'undefined'; +} +exports.isUndefined = isUndefined; +/** + * Checks if the given argument is a string. + * @function + */ +function isString(obj) { + return Object.prototype.toString.call(obj) === '[object String]'; +} +exports.isString = isString; +/** + * Reverses a compare function. + * @function + */ +function reverseCompareFunction(compareFunction) { + if (isUndefined(compareFunction) || !isFunction(compareFunction)) { + return function (a, b) { + if (a < b) { + return 1; + } + else if (a === b) { + return 0; + } + else { + return -1; + } + }; + } + else { + return function (d, v) { + return compareFunction(d, v) * -1; + }; + } +} +exports.reverseCompareFunction = reverseCompareFunction; +/** + * Returns an equal function given a compare function. + * @function + */ +function compareToEquals(compareFunction) { + return function (a, b) { + return compareFunction(a, b) === 0; + }; +} +exports.compareToEquals = compareToEquals; + +},{}],"typescript-collections":[function(require,module,exports){ +"use strict"; +Object.defineProperty(exports, "__esModule", { value: true }); +// Copyright 2013 Basarat Ali Syed. All Rights Reserved. +// +// Licensed under MIT open source license http://opensource.org/licenses/MIT +// +// Orginal javascript code was by Mauricio Santos +// +var _arrays = require("./arrays"); +exports.arrays = _arrays; +var Bag_1 = require("./Bag"); +exports.Bag = Bag_1.default; +var BSTree_1 = require("./BSTree"); +exports.BSTree = BSTree_1.default; +var BSTreeKV_1 = require("./BSTreeKV"); +exports.BSTreeKV = BSTreeKV_1.default; +var Dictionary_1 = require("./Dictionary"); +exports.Dictionary = Dictionary_1.default; +var Heap_1 = require("./Heap"); +exports.Heap = Heap_1.default; +var LinkedDictionary_1 = require("./LinkedDictionary"); +exports.LinkedDictionary = LinkedDictionary_1.default; +var LinkedList_1 = require("./LinkedList"); +exports.LinkedList = LinkedList_1.default; +var MultiDictionary_1 = require("./MultiDictionary"); +exports.MultiDictionary = MultiDictionary_1.default; +var FactoryDictionary_1 = require("./FactoryDictionary"); +exports.FactoryDictionary = FactoryDictionary_1.default; +var FactoryDictionary_2 = require("./FactoryDictionary"); +exports.DefaultDictionary = FactoryDictionary_2.default; +var Queue_1 = require("./Queue"); +exports.Queue = Queue_1.default; +var PriorityQueue_1 = require("./PriorityQueue"); +exports.PriorityQueue = PriorityQueue_1.default; +var Set_1 = require("./Set"); +exports.Set = Set_1.default; +var Stack_1 = require("./Stack"); +exports.Stack = Stack_1.default; +var MultiRootTree_1 = require("./MultiRootTree"); +exports.MultiRootTree = MultiRootTree_1.default; +var _util = require("./util"); +exports.util = _util; + +},{"./BSTree":1,"./BSTreeKV":2,"./Bag":3,"./Dictionary":4,"./FactoryDictionary":5,"./Heap":6,"./LinkedDictionary":7,"./LinkedList":8,"./MultiDictionary":9,"./MultiRootTree":10,"./PriorityQueue":11,"./Queue":12,"./Set":13,"./Stack":14,"./arrays":15,"./util":16}]},{},[]) +//# sourceMappingURL=data:application/json;charset=utf-8;base64,{"version":3,"sources":["node_modules/browser-pack/_prelude.js","dist/lib/BSTree.js","dist/lib/BSTreeKV.js","dist/lib/Bag.js","dist/lib/Dictionary.js","dist/lib/FactoryDictionary.js","dist/lib/Heap.js","dist/lib/LinkedDictionary.js","dist/lib/LinkedList.js","dist/lib/MultiDictionary.js","dist/lib/MultiRootTree.js","dist/lib/PriorityQueue.js","dist/lib/Queue.js","dist/lib/Set.js","dist/lib/Stack.js","dist/lib/arrays.js","dist/lib/util.js","dist/lib/index.js"],"names":[],"mappings":"AAAA;ACAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACpCA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC/ZA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACxLA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AChLA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACjFA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AClOA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACjPA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC5XA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACxKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACjaA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC/GA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC3GA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACxKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACtGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACxKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC5IA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA","file":"generated.js","sourceRoot":"","sourcesContent":["(function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require==\"function\"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error(\"Cannot find module '\"+o+\"'\");throw f.code=\"MODULE_NOT_FOUND\",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require==\"function\"&&require;for(var o=0;o<r.length;o++)s(r[o]);return s})","\"use strict\";\nvar __extends = (this && this.__extends) || (function () {\n    var extendStatics = Object.setPrototypeOf ||\n        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n        function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\n    return function (d, b) {\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar BSTreeKV_1 = require(\"./BSTreeKV\");\n/**\n * Special-case of the binary search tree in which the search key is equal to the element type.\n * This definition is suitable when the element type can not be split between what defines its order\n * and what does not (eg. primitive types as opposed to indexed records).\n *\n * The table below shows some use-case examples for both interfaces:\n *\n *           element type              |  most suitable interface\n * ------------------------------------|----------------------------\n *    number                           |  BSTree<number>\n *    string                           |  BSTree<string>\n * { order: number, data: string }     |  BSTreeKV<{order: number}, {order: number, data: string}>\n *\n * @see BSTreeKV\n */\nvar BSTree = /** @class */ (function (_super) {\n    __extends(BSTree, _super);\n    function BSTree() {\n        return _super !== null && _super.apply(this, arguments) || this;\n    }\n    return BSTree;\n}(BSTreeKV_1.default));\nexports.default = BSTree;\n//# sourceMappingURL=BSTree.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util = require(\"./util\");\nvar Queue_1 = require(\"./Queue\");\n/**\n * General binary search tree implementation.\n *\n * This interface allows one to search elements using a subset of their attributes (thus the\n * tree can be used as an index for complex objects).\n * The attributes required to define an ordering in the tree must be defined in the type K.\n * Any additional attribute must be defined in the type V.\n *\n * @see BSTree\n */\nvar BSTreeKV = /** @class */ (function () {\n    /**\n     * Creates an empty binary search tree.\n     * @class <p>A binary search tree is a binary tree in which each\n     * internal node stores an element such that the elements stored in the\n     * left subtree are less than it and the elements\n     * stored in the right subtree are greater.</p>\n     * <p>Formally, a binary search tree is a node-based binary tree data structure which\n     * has the following properties:</p>\n     * <ul>\n     * <li>The left subtree of a node contains only nodes with elements less\n     * than the node's element</li>\n     * <li>The right subtree of a node contains only nodes with elements greater\n     * than the node's element</li>\n     * <li>Both the left and right subtrees must also be binary search trees.</li>\n     * </ul>\n     * <p>If the inserted elements are custom objects a compare function must\n     * be provided at construction time, otherwise the <=, === and >= operators are\n     * used to compare elements. Example:</p>\n     * <pre>\n     * function compare(a, b) {\n     *  if (a is less than b by some ordering criterion) {\n     *     return -1;\n     *  } if (a is greater than b by the ordering criterion) {\n     *     return 1;\n     *  }\n     *  // a must be equal to b\n     *  return 0;\n     * }\n     * </pre>\n     * @constructor\n     * @param {function(Object,Object):number=} compareFunction optional\n     * function used to compare two elements. Must return a negative integer,\n     * zero, or a positive integer as the first argument is less than, equal to,\n     * or greater than the second.\n     */\n    function BSTreeKV(compareFunction) {\n        this.root = null;\n        this.compare = compareFunction || util.defaultCompare;\n        this.nElements = 0;\n    }\n    /**\n     * Adds the specified element to this tree if it is not already present.\n     * @param {Object} element the element to insert.\n     * @return {boolean} true if this tree did not already contain the specified element.\n     */\n    BSTreeKV.prototype.add = function (element) {\n        if (util.isUndefined(element)) {\n            return false;\n        }\n        if (this.insertNode(this.createNode(element)) !== null) {\n            this.nElements++;\n            return true;\n        }\n        return false;\n    };\n    /**\n     * Removes all of the elements from this tree.\n     */\n    BSTreeKV.prototype.clear = function () {\n        this.root = null;\n        this.nElements = 0;\n    };\n    /**\n     * Returns true if this tree contains no elements.\n     * @return {boolean} true if this tree contains no elements.\n     */\n    BSTreeKV.prototype.isEmpty = function () {\n        return this.nElements === 0;\n    };\n    /**\n     * Returns the number of elements in this tree.\n     * @return {number} the number of elements in this tree.\n     */\n    BSTreeKV.prototype.size = function () {\n        return this.nElements;\n    };\n    /**\n     * Returns true if this tree contains the specified element.\n     * @param {Object} element element to search for.\n     * @return {boolean} true if this tree contains the specified element,\n     * false otherwise.\n     */\n    BSTreeKV.prototype.contains = function (element) {\n        if (util.isUndefined(element)) {\n            return false;\n        }\n        return this.searchNode(this.root, element) !== null;\n    };\n    /**\n     * Looks for the value with the provided search key.\n     * @param {Object} element The key to look for\n     * @return {Object} The value found or undefined if it was not found.\n     */\n    BSTreeKV.prototype.search = function (element) {\n        var ret = this.searchNode(this.root, element);\n        if (ret === null) {\n            return undefined;\n        }\n        return ret.element;\n    };\n    /**\n     * Removes the specified element from this tree if it is present.\n     * @return {boolean} true if this tree contained the specified element.\n     */\n    BSTreeKV.prototype.remove = function (element) {\n        var node = this.searchNode(this.root, element);\n        if (node === null) {\n            return false;\n        }\n        this.removeNode(node);\n        this.nElements--;\n        return true;\n    };\n    /**\n     * Executes the provided function once for each element present in this tree in\n     * in-order.\n     * @param {function(Object):*} callback function to execute, it is invoked with one\n     * argument: the element value, to break the iteration you can optionally return false.\n     */\n    BSTreeKV.prototype.inorderTraversal = function (callback) {\n        this.inorderTraversalAux(this.root, callback, {\n            stop: false\n        });\n    };\n    /**\n     * Executes the provided function once for each element present in this tree in pre-order.\n     * @param {function(Object):*} callback function to execute, it is invoked with one\n     * argument: the element value, to break the iteration you can optionally return false.\n     */\n    BSTreeKV.prototype.preorderTraversal = function (callback) {\n        this.preorderTraversalAux(this.root, callback, {\n            stop: false\n        });\n    };\n    /**\n     * Executes the provided function once for each element present in this tree in post-order.\n     * @param {function(Object):*} callback function to execute, it is invoked with one\n     * argument: the element value, to break the iteration you can optionally return false.\n     */\n    BSTreeKV.prototype.postorderTraversal = function (callback) {\n        this.postorderTraversalAux(this.root, callback, {\n            stop: false\n        });\n    };\n    /**\n     * Executes the provided function once for each element present in this tree in\n     * level-order.\n     * @param {function(Object):*} callback function to execute, it is invoked with one\n     * argument: the element value, to break the iteration you can optionally return false.\n     */\n    BSTreeKV.prototype.levelTraversal = function (callback) {\n        this.levelTraversalAux(this.root, callback);\n    };\n    /**\n     * Returns the minimum element of this tree.\n     * @return {*} the minimum element of this tree or undefined if this tree is\n     * is empty.\n     */\n    BSTreeKV.prototype.minimum = function () {\n        if (this.isEmpty() || this.root === null) {\n            return undefined;\n        }\n        return this.minimumAux(this.root).element;\n    };\n    /**\n     * Returns the maximum element of this tree.\n     * @return {*} the maximum element of this tree or undefined if this tree is\n     * is empty.\n     */\n    BSTreeKV.prototype.maximum = function () {\n        if (this.isEmpty() || this.root === null) {\n            return undefined;\n        }\n        return this.maximumAux(this.root).element;\n    };\n    /**\n     * Executes the provided function once for each element present in this tree in inorder.\n     * Equivalent to inorderTraversal.\n     * @param {function(Object):*} callback function to execute, it is\n     * invoked with one argument: the element value, to break the iteration you can\n     * optionally return false.\n     */\n    BSTreeKV.prototype.forEach = function (callback) {\n        this.inorderTraversal(callback);\n    };\n    /**\n     * Returns an array containing all of the elements in this tree in in-order.\n     * @return {Array} an array containing all of the elements in this tree in in-order.\n     */\n    BSTreeKV.prototype.toArray = function () {\n        var array = [];\n        this.inorderTraversal(function (element) {\n            array.push(element);\n            return true;\n        });\n        return array;\n    };\n    /**\n     * Returns the height of this tree.\n     * @return {number} the height of this tree or -1 if is empty.\n     */\n    BSTreeKV.prototype.height = function () {\n        return this.heightAux(this.root);\n    };\n    /**\n    * @private\n    */\n    BSTreeKV.prototype.searchNode = function (node, element) {\n        var cmp = 1;\n        while (node !== null && cmp !== 0) {\n            cmp = this.compare(element, node.element);\n            if (cmp < 0) {\n                node = node.leftCh;\n            }\n            else if (cmp > 0) {\n                node = node.rightCh;\n            }\n        }\n        return node;\n    };\n    /**\n    * @private\n    */\n    BSTreeKV.prototype.transplant = function (n1, n2) {\n        if (n1.parent === null) {\n            this.root = n2;\n        }\n        else if (n1 === n1.parent.leftCh) {\n            n1.parent.leftCh = n2;\n        }\n        else {\n            n1.parent.rightCh = n2;\n        }\n        if (n2 !== null) {\n            n2.parent = n1.parent;\n        }\n    };\n    /**\n    * @private\n    */\n    BSTreeKV.prototype.removeNode = function (node) {\n        if (node.leftCh === null) {\n            this.transplant(node, node.rightCh);\n        }\n        else if (node.rightCh === null) {\n            this.transplant(node, node.leftCh);\n        }\n        else {\n            var y = this.minimumAux(node.rightCh);\n            if (y.parent !== node) {\n                this.transplant(y, y.rightCh);\n                y.rightCh = node.rightCh;\n                y.rightCh.parent = y;\n            }\n            this.transplant(node, y);\n            y.leftCh = node.leftCh;\n            y.leftCh.parent = y;\n        }\n    };\n    /**\n    * @private\n    */\n    BSTreeKV.prototype.inorderTraversalAux = function (node, callback, signal) {\n        if (node === null || signal.stop) {\n            return;\n        }\n        this.inorderTraversalAux(node.leftCh, callback, signal);\n        if (signal.stop) {\n            return;\n        }\n        signal.stop = callback(node.element) === false;\n        if (signal.stop) {\n            return;\n        }\n        this.inorderTraversalAux(node.rightCh, callback, signal);\n    };\n    /**\n    * @private\n    */\n    BSTreeKV.prototype.levelTraversalAux = function (node, callback) {\n        var queue = new Queue_1.default();\n        if (node !== null) {\n            queue.enqueue(node);\n        }\n        node = queue.dequeue() || null;\n        while (node != null) {\n            if (callback(node.element) === false) {\n                return;\n            }\n            if (node.leftCh !== null) {\n                queue.enqueue(node.leftCh);\n            }\n            if (node.rightCh !== null) {\n                queue.enqueue(node.rightCh);\n            }\n            node = queue.dequeue() || null;\n        }\n    };\n    /**\n    * @private\n    */\n    BSTreeKV.prototype.preorderTraversalAux = function (node, callback, signal) {\n        if (node === null || signal.stop) {\n            return;\n        }\n        signal.stop = callback(node.element) === false;\n        if (signal.stop) {\n            return;\n        }\n        this.preorderTraversalAux(node.leftCh, callback, signal);\n        if (signal.stop) {\n            return;\n        }\n        this.preorderTraversalAux(node.rightCh, callback, signal);\n    };\n    /**\n    * @private\n    */\n    BSTreeKV.prototype.postorderTraversalAux = function (node, callback, signal) {\n        if (node === null || signal.stop) {\n            return;\n        }\n        this.postorderTraversalAux(node.leftCh, callback, signal);\n        if (signal.stop) {\n            return;\n        }\n        this.postorderTraversalAux(node.rightCh, callback, signal);\n        if (signal.stop) {\n            return;\n        }\n        signal.stop = callback(node.element) === false;\n    };\n    BSTreeKV.prototype.minimumAux = function (node) {\n        while (node != null && node.leftCh !== null) {\n            node = node.leftCh;\n        }\n        return node;\n    };\n    BSTreeKV.prototype.maximumAux = function (node) {\n        while (node != null && node.rightCh !== null) {\n            node = node.rightCh;\n        }\n        return node;\n    };\n    /**\n      * @private\n      */\n    BSTreeKV.prototype.heightAux = function (node) {\n        if (node === null) {\n            return -1;\n        }\n        return Math.max(this.heightAux(node.leftCh), this.heightAux(node.rightCh)) + 1;\n    };\n    /*\n    * @private\n    */\n    BSTreeKV.prototype.insertNode = function (node) {\n        var parent = null;\n        var position = this.root;\n        while (position !== null) {\n            var cmp = this.compare(node.element, position.element);\n            if (cmp === 0) {\n                return null;\n            }\n            else if (cmp < 0) {\n                parent = position;\n                position = position.leftCh;\n            }\n            else {\n                parent = position;\n                position = position.rightCh;\n            }\n        }\n        node.parent = parent;\n        if (parent === null) {\n            // tree is empty\n            this.root = node;\n        }\n        else if (this.compare(node.element, parent.element) < 0) {\n            parent.leftCh = node;\n        }\n        else {\n            parent.rightCh = node;\n        }\n        return node;\n    };\n    /**\n    * @private\n    */\n    BSTreeKV.prototype.createNode = function (element) {\n        return {\n            element: element,\n            leftCh: null,\n            rightCh: null,\n            parent: null\n        };\n    };\n    return BSTreeKV;\n}());\nexports.default = BSTreeKV;\n//# sourceMappingURL=BSTreeKV.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util = require(\"./util\");\nvar Dictionary_1 = require(\"./Dictionary\");\nvar Set_1 = require(\"./Set\");\nvar Bag = /** @class */ (function () {\n    /**\n     * Creates an empty bag.\n     * @class <p>A bag is a special kind of set in which members are\n     * allowed to appear more than once.</p>\n     * <p>If the inserted elements are custom objects a function\n     * which converts elements to unique strings must be provided. Example:</p>\n     *\n     * <pre>\n     * function petToString(pet) {\n     *  return pet.name;\n     * }\n     * </pre>\n     *\n     * @constructor\n     * @param {function(Object):string=} toStrFunction optional function used\n     * to convert elements to strings. If the elements aren't strings or if toString()\n     * is not appropriate, a custom function which receives an object and returns a\n     * unique string must be provided.\n     */\n    function Bag(toStrFunction) {\n        this.toStrF = toStrFunction || util.defaultToString;\n        this.dictionary = new Dictionary_1.default(this.toStrF);\n        this.nElements = 0;\n    }\n    /**\n    * Adds nCopies of the specified object to this bag.\n    * @param {Object} element element to add.\n    * @param {number=} nCopies the number of copies to add, if this argument is\n    * undefined 1 copy is added.\n    * @return {boolean} true unless element is undefined.\n    */\n    Bag.prototype.add = function (element, nCopies) {\n        if (nCopies === void 0) { nCopies = 1; }\n        if (util.isUndefined(element) || nCopies <= 0) {\n            return false;\n        }\n        if (!this.contains(element)) {\n            var node = {\n                value: element,\n                copies: nCopies\n            };\n            this.dictionary.setValue(element, node);\n        }\n        else {\n            this.dictionary.getValue(element).copies += nCopies;\n        }\n        this.nElements += nCopies;\n        return true;\n    };\n    /**\n    * Counts the number of copies of the specified object in this bag.\n    * @param {Object} element the object to search for..\n    * @return {number} the number of copies of the object, 0 if not found\n    */\n    Bag.prototype.count = function (element) {\n        if (!this.contains(element)) {\n            return 0;\n        }\n        else {\n            return this.dictionary.getValue(element).copies;\n        }\n    };\n    /**\n     * Returns true if this bag contains the specified element.\n     * @param {Object} element element to search for.\n     * @return {boolean} true if this bag contains the specified element,\n     * false otherwise.\n     */\n    Bag.prototype.contains = function (element) {\n        return this.dictionary.containsKey(element);\n    };\n    /**\n    * Removes nCopies of the specified object to this bag.\n    * If the number of copies to remove is greater than the actual number\n    * of copies in the Bag, all copies are removed.\n    * @param {Object} element element to remove.\n    * @param {number=} nCopies the number of copies to remove, if this argument is\n    * undefined 1 copy is removed.\n    * @return {boolean} true if at least 1 element was removed.\n    */\n    Bag.prototype.remove = function (element, nCopies) {\n        if (nCopies === void 0) { nCopies = 1; }\n        if (util.isUndefined(element) || nCopies <= 0) {\n            return false;\n        }\n        if (!this.contains(element)) {\n            return false;\n        }\n        else {\n            var node = this.dictionary.getValue(element);\n            if (nCopies > node.copies) {\n                this.nElements -= node.copies;\n            }\n            else {\n                this.nElements -= nCopies;\n            }\n            node.copies -= nCopies;\n            if (node.copies <= 0) {\n                this.dictionary.remove(element);\n            }\n            return true;\n        }\n    };\n    /**\n     * Returns an array containing all of the elements in this big in arbitrary order,\n     * including multiple copies.\n     * @return {Array} an array containing all of the elements in this bag.\n     */\n    Bag.prototype.toArray = function () {\n        var a = [];\n        var values = this.dictionary.values();\n        for (var _i = 0, values_1 = values; _i < values_1.length; _i++) {\n            var node = values_1[_i];\n            var element = node.value;\n            var copies = node.copies;\n            for (var j = 0; j < copies; j++) {\n                a.push(element);\n            }\n        }\n        return a;\n    };\n    /**\n     * Returns a set of unique elements in this bag.\n     * @return {collections.Set<T>} a set of unique elements in this bag.\n     */\n    Bag.prototype.toSet = function () {\n        var toret = new Set_1.default(this.toStrF);\n        var elements = this.dictionary.values();\n        for (var _i = 0, elements_1 = elements; _i < elements_1.length; _i++) {\n            var ele = elements_1[_i];\n            var value = ele.value;\n            toret.add(value);\n        }\n        return toret;\n    };\n    /**\n     * Executes the provided function once for each element\n     * present in this bag, including multiple copies.\n     * @param {function(Object):*} callback function to execute, it is\n     * invoked with one argument: the element. To break the iteration you can\n     * optionally return false.\n     */\n    Bag.prototype.forEach = function (callback) {\n        this.dictionary.forEach(function (k, v) {\n            var value = v.value;\n            var copies = v.copies;\n            for (var i = 0; i < copies; i++) {\n                if (callback(value) === false) {\n                    return false;\n                }\n            }\n            return true;\n        });\n    };\n    /**\n     * Returns the number of elements in this bag.\n     * @return {number} the number of elements in this bag.\n     */\n    Bag.prototype.size = function () {\n        return this.nElements;\n    };\n    /**\n     * Returns true if this bag contains no elements.\n     * @return {boolean} true if this bag contains no elements.\n     */\n    Bag.prototype.isEmpty = function () {\n        return this.nElements === 0;\n    };\n    /**\n     * Removes all of the elements from this bag.\n     */\n    Bag.prototype.clear = function () {\n        this.nElements = 0;\n        this.dictionary.clear();\n    };\n    return Bag;\n}()); // End of bag\nexports.default = Bag;\n//# sourceMappingURL=Bag.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util = require(\"./util\");\nvar Dictionary = /** @class */ (function () {\n    /**\n     * Creates an empty dictionary.\n     * @class <p>Dictionaries map keys to values; each key can map to at most one value.\n     * This implementation accepts any kind of objects as keys.</p>\n     *\n     * <p>If the keys are custom objects a function which converts keys to unique\n     * strings must be provided. Example:</p>\n     * <pre>\n     * function petToString(pet) {\n     *  return pet.name;\n     * }\n     * </pre>\n     * @constructor\n     * @param {function(Object):string=} toStrFunction optional function used\n     * to convert keys to strings. If the keys aren't strings or if toString()\n     * is not appropriate, a custom function which receives a key and returns a\n     * unique string must be provided.\n     */\n    function Dictionary(toStrFunction) {\n        this.table = {};\n        this.nElements = 0;\n        this.toStr = toStrFunction || util.defaultToString;\n    }\n    /**\n     * Returns the value to which this dictionary maps the specified key.\n     * Returns undefined if this dictionary contains no mapping for this key.\n     * @param {Object} key key whose associated value is to be returned.\n     * @return {*} the value to which this dictionary maps the specified key or\n     * undefined if the map contains no mapping for this key.\n     */\n    Dictionary.prototype.getValue = function (key) {\n        var pair = this.table['$' + this.toStr(key)];\n        if (util.isUndefined(pair)) {\n            return undefined;\n        }\n        return pair.value;\n    };\n    /**\n     * Associates the specified value with the specified key in this dictionary.\n     * If the dictionary previously contained a mapping for this key, the old\n     * value is replaced by the specified value.\n     * @param {Object} key key with which the specified value is to be\n     * associated.\n     * @param {Object} value value to be associated with the specified key.\n     * @return {*} previous value associated with the specified key, or undefined if\n     * there was no mapping for the key or if the key/value are undefined.\n     */\n    Dictionary.prototype.setValue = function (key, value) {\n        if (util.isUndefined(key) || util.isUndefined(value)) {\n            return undefined;\n        }\n        var ret;\n        var k = '$' + this.toStr(key);\n        var previousElement = this.table[k];\n        if (util.isUndefined(previousElement)) {\n            this.nElements++;\n            ret = undefined;\n        }\n        else {\n            ret = previousElement.value;\n        }\n        this.table[k] = {\n            key: key,\n            value: value\n        };\n        return ret;\n    };\n    /**\n     * Removes the mapping for this key from this dictionary if it is present.\n     * @param {Object} key key whose mapping is to be removed from the\n     * dictionary.\n     * @return {*} previous value associated with specified key, or undefined if\n     * there was no mapping for key.\n     */\n    Dictionary.prototype.remove = function (key) {\n        var k = '$' + this.toStr(key);\n        var previousElement = this.table[k];\n        if (!util.isUndefined(previousElement)) {\n            delete this.table[k];\n            this.nElements--;\n            return previousElement.value;\n        }\n        return undefined;\n    };\n    /**\n     * Returns an array containing all of the keys in this dictionary.\n     * @return {Array} an array containing all of the keys in this dictionary.\n     */\n    Dictionary.prototype.keys = function () {\n        var array = [];\n        for (var name_1 in this.table) {\n            if (util.has(this.table, name_1)) {\n                var pair = this.table[name_1];\n                array.push(pair.key);\n            }\n        }\n        return array;\n    };\n    /**\n     * Returns an array containing all of the values in this dictionary.\n     * @return {Array} an array containing all of the values in this dictionary.\n     */\n    Dictionary.prototype.values = function () {\n        var array = [];\n        for (var name_2 in this.table) {\n            if (util.has(this.table, name_2)) {\n                var pair = this.table[name_2];\n                array.push(pair.value);\n            }\n        }\n        return array;\n    };\n    /**\n    * Executes the provided function once for each key-value pair\n    * present in this dictionary.\n    * @param {function(Object,Object):*} callback function to execute, it is\n    * invoked with two arguments: key and value. To break the iteration you can\n    * optionally return false.\n    */\n    Dictionary.prototype.forEach = function (callback) {\n        for (var name_3 in this.table) {\n            if (util.has(this.table, name_3)) {\n                var pair = this.table[name_3];\n                var ret = callback(pair.key, pair.value);\n                if (ret === false) {\n                    return;\n                }\n            }\n        }\n    };\n    /**\n     * Returns true if this dictionary contains a mapping for the specified key.\n     * @param {Object} key key whose presence in this dictionary is to be\n     * tested.\n     * @return {boolean} true if this dictionary contains a mapping for the\n     * specified key.\n     */\n    Dictionary.prototype.containsKey = function (key) {\n        return !util.isUndefined(this.getValue(key));\n    };\n    /**\n    * Removes all mappings from this dictionary.\n    * @this {collections.Dictionary}\n    */\n    Dictionary.prototype.clear = function () {\n        this.table = {};\n        this.nElements = 0;\n    };\n    /**\n     * Returns the number of keys in this dictionary.\n     * @return {number} the number of key-value mappings in this dictionary.\n     */\n    Dictionary.prototype.size = function () {\n        return this.nElements;\n    };\n    /**\n     * Returns true if this dictionary contains no mappings.\n     * @return {boolean} true if this dictionary contains no mappings.\n     */\n    Dictionary.prototype.isEmpty = function () {\n        return this.nElements <= 0;\n    };\n    Dictionary.prototype.toString = function () {\n        var toret = '{';\n        this.forEach(function (k, v) {\n            toret += \"\\n\\t\" + k + \" : \" + v;\n        });\n        return toret + '\\n}';\n    };\n    return Dictionary;\n}()); // End of dictionary\nexports.default = Dictionary;\n//# sourceMappingURL=Dictionary.js.map","\"use strict\";\nvar __extends = (this && this.__extends) || (function () {\n    var extendStatics = Object.setPrototypeOf ||\n        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n        function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\n    return function (d, b) {\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar Dictionary_1 = require(\"./Dictionary\");\nvar util = require(\"./util\");\nvar FactoryDictionary = /** @class */ (function (_super) {\n    __extends(FactoryDictionary, _super);\n    /**\n     * Creates an empty dictionary.\n     * @class <p>Dictionaries map keys to values; each key can map to at most one value.\n     * This implementation accepts any kind of objects as keys.</p>\n     *\n     * <p>The default factory function should return a new object of the provided\n     * type. Example:</p>\n     * <pre>\n     * function petFactory() {\n     *  return new Pet();\n     * }\n     * </pre>\n     *\n     * <p>If the keys are custom objects a function which converts keys to unique\n     * strings must be provided. Example:</p>\n     * <pre>\n     * function petToString(pet) {\n     *  return pet.name;\n     * }\n     * </pre>\n     * @constructor\n     * @param {function():V=} defaultFactoryFunction function used to create a\n     * default object.\n     * @param {function(Object):string=} toStrFunction optional function used\n     * to convert keys to strings. If the keys aren't strings or if toString()\n     * is not appropriate, a custom function which receives a key and returns a\n     * unique string must be provided.\n     */\n    function FactoryDictionary(defaultFactoryFunction, toStrFunction) {\n        var _this = _super.call(this, toStrFunction) || this;\n        _this.defaultFactoryFunction = defaultFactoryFunction;\n        return _this;\n    }\n    /**\n     * Associates the specified default value with the specified key in this dictionary,\n     * if it didn't contain the key yet. If the key existed, the existing value will be used.\n     * @param {Object} key key with which the specified value is to be\n     * associated.\n     * @param {Object} defaultValue default value to be associated with the specified key.\n     * @return {*} previous value associated with the specified key, or the default value,\n     * if the key didn't exist yet.\n     */\n    FactoryDictionary.prototype.setDefault = function (key, defaultValue) {\n        var currentValue = _super.prototype.getValue.call(this, key);\n        if (util.isUndefined(currentValue)) {\n            this.setValue(key, defaultValue);\n            return defaultValue;\n        }\n        return currentValue;\n    };\n    /**\n     * Returns the value to which this dictionary maps the specified key.\n     * Returns a default value created by the factory passed in the constructor,\n     * if this dictionary contains no mapping for this key. The missing key will\n     * automatically be added to the dictionary.\n     * @param {Object} key key whose associated value is to be returned.\n     * @return {*} the value to which this dictionary maps the specified key or\n     * a default value if the map contains no mapping for this key.\n     */\n    FactoryDictionary.prototype.getValue = function (key) {\n        return this.setDefault(key, this.defaultFactoryFunction());\n    };\n    return FactoryDictionary;\n}(Dictionary_1.default));\nexports.default = FactoryDictionary;\n//# sourceMappingURL=FactoryDictionary.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar collections = require(\"./util\");\nvar arrays = require(\"./arrays\");\nvar Heap = /** @class */ (function () {\n    /**\n     * Creates an empty Heap.\n     * @class\n     * <p>A heap is a binary tree, where the nodes maintain the heap property:\n     * each node is smaller than each of its children and therefore a MinHeap\n     * This implementation uses an array to store elements.</p>\n     * <p>If the inserted elements are custom objects a compare function must be provided,\n     *  at construction time, otherwise the <=, === and >= operators are\n     * used to compare elements. Example:</p>\n     *\n     * <pre>\n     * function compare(a, b) {\n     *  if (a is less than b by some ordering criterion) {\n     *     return -1;\n     *  } if (a is greater than b by the ordering criterion) {\n     *     return 1;\n     *  }\n     *  // a must be equal to b\n     *  return 0;\n     * }\n     * </pre>\n     *\n     * <p>If a Max-Heap is wanted (greater elements on top) you can a provide a\n     * reverse compare function to accomplish that behavior. Example:</p>\n     *\n     * <pre>\n     * function reverseCompare(a, b) {\n     *  if (a is less than b by some ordering criterion) {\n     *     return 1;\n     *  } if (a is greater than b by the ordering criterion) {\n     *     return -1;\n     *  }\n     *  // a must be equal to b\n     *  return 0;\n     * }\n     * </pre>\n     *\n     * @constructor\n     * @param {function(Object,Object):number=} compareFunction optional\n     * function used to compare two elements. Must return a negative integer,\n     * zero, or a positive integer as the first argument is less than, equal to,\n     * or greater than the second.\n     */\n    function Heap(compareFunction) {\n        /**\n         * Array used to store the elements of the heap.\n         * @type {Array.<Object>}\n         * @private\n         */\n        this.data = [];\n        this.compare = compareFunction || collections.defaultCompare;\n    }\n    /**\n     * Returns the index of the left child of the node at the given index.\n     * @param {number} nodeIndex The index of the node to get the left child\n     * for.\n     * @return {number} The index of the left child.\n     * @private\n     */\n    Heap.prototype.leftChildIndex = function (nodeIndex) {\n        return (2 * nodeIndex) + 1;\n    };\n    /**\n     * Returns the index of the right child of the node at the given index.\n     * @param {number} nodeIndex The index of the node to get the right child\n     * for.\n     * @return {number} The index of the right child.\n     * @private\n     */\n    Heap.prototype.rightChildIndex = function (nodeIndex) {\n        return (2 * nodeIndex) + 2;\n    };\n    /**\n     * Returns the index of the parent of the node at the given index.\n     * @param {number} nodeIndex The index of the node to get the parent for.\n     * @return {number} The index of the parent.\n     * @private\n     */\n    Heap.prototype.parentIndex = function (nodeIndex) {\n        return Math.floor((nodeIndex - 1) / 2);\n    };\n    /**\n     * Returns the index of the smaller child node (if it exists).\n     * @param {number} leftChild left child index.\n     * @param {number} rightChild right child index.\n     * @return {number} the index with the minimum value or -1 if it doesn't\n     * exists.\n     * @private\n     */\n    Heap.prototype.minIndex = function (leftChild, rightChild) {\n        if (rightChild >= this.data.length) {\n            if (leftChild >= this.data.length) {\n                return -1;\n            }\n            else {\n                return leftChild;\n            }\n        }\n        else {\n            if (this.compare(this.data[leftChild], this.data[rightChild]) <= 0) {\n                return leftChild;\n            }\n            else {\n                return rightChild;\n            }\n        }\n    };\n    /**\n     * Moves the node at the given index up to its proper place in the heap.\n     * @param {number} index The index of the node to move up.\n     * @private\n     */\n    Heap.prototype.siftUp = function (index) {\n        var parent = this.parentIndex(index);\n        while (index > 0 && this.compare(this.data[parent], this.data[index]) > 0) {\n            arrays.swap(this.data, parent, index);\n            index = parent;\n            parent = this.parentIndex(index);\n        }\n    };\n    /**\n     * Moves the node at the given index down to its proper place in the heap.\n     * @param {number} nodeIndex The index of the node to move down.\n     * @private\n     */\n    Heap.prototype.siftDown = function (nodeIndex) {\n        //smaller child index\n        var min = this.minIndex(this.leftChildIndex(nodeIndex), this.rightChildIndex(nodeIndex));\n        while (min >= 0 && this.compare(this.data[nodeIndex], this.data[min]) > 0) {\n            arrays.swap(this.data, min, nodeIndex);\n            nodeIndex = min;\n            min = this.minIndex(this.leftChildIndex(nodeIndex), this.rightChildIndex(nodeIndex));\n        }\n    };\n    /**\n     * Retrieves but does not remove the root element of this heap.\n     * @return {*} The value at the root of the heap. Returns undefined if the\n     * heap is empty.\n     */\n    Heap.prototype.peek = function () {\n        if (this.data.length > 0) {\n            return this.data[0];\n        }\n        else {\n            return undefined;\n        }\n    };\n    /**\n     * Adds the given element into the heap.\n     * @param {*} element the element.\n     * @return true if the element was added or fals if it is undefined.\n     */\n    Heap.prototype.add = function (element) {\n        if (collections.isUndefined(element)) {\n            return false;\n        }\n        this.data.push(element);\n        this.siftUp(this.data.length - 1);\n        return true;\n    };\n    /**\n     * Retrieves and removes the root element of this heap.\n     * @return {*} The value removed from the root of the heap. Returns\n     * undefined if the heap is empty.\n     */\n    Heap.prototype.removeRoot = function () {\n        if (this.data.length > 0) {\n            var obj = this.data[0];\n            this.data[0] = this.data[this.data.length - 1];\n            this.data.splice(this.data.length - 1, 1);\n            if (this.data.length > 0) {\n                this.siftDown(0);\n            }\n            return obj;\n        }\n        return undefined;\n    };\n    /**\n     * Returns true if this heap contains the specified element.\n     * @param {Object} element element to search for.\n     * @return {boolean} true if this Heap contains the specified element, false\n     * otherwise.\n     */\n    Heap.prototype.contains = function (element) {\n        var equF = collections.compareToEquals(this.compare);\n        return arrays.contains(this.data, element, equF);\n    };\n    /**\n     * Returns the number of elements in this heap.\n     * @return {number} the number of elements in this heap.\n     */\n    Heap.prototype.size = function () {\n        return this.data.length;\n    };\n    /**\n     * Checks if this heap is empty.\n     * @return {boolean} true if and only if this heap contains no items; false\n     * otherwise.\n     */\n    Heap.prototype.isEmpty = function () {\n        return this.data.length <= 0;\n    };\n    /**\n     * Removes all of the elements from this heap.\n     */\n    Heap.prototype.clear = function () {\n        this.data.length = 0;\n    };\n    /**\n     * Executes the provided function once for each element present in this heap in\n     * no particular order.\n     * @param {function(Object):*} callback function to execute, it is\n     * invoked with one argument: the element value, to break the iteration you can\n     * optionally return false.\n     */\n    Heap.prototype.forEach = function (callback) {\n        arrays.forEach(this.data, callback);\n    };\n    return Heap;\n}());\nexports.default = Heap;\n//# sourceMappingURL=Heap.js.map","\"use strict\";\nvar __extends = (this && this.__extends) || (function () {\n    var extendStatics = Object.setPrototypeOf ||\n        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n        function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\n    return function (d, b) {\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar Dictionary_1 = require(\"./Dictionary\");\nvar util = require(\"./util\");\n/**\n * This class is used by the LinkedDictionary Internally\n * Has to be a class, not an interface, because it needs to have\n * the 'unlink' function defined.\n */\nvar LinkedDictionaryPair = /** @class */ (function () {\n    function LinkedDictionaryPair(key, value) {\n        this.key = key;\n        this.value = value;\n    }\n    LinkedDictionaryPair.prototype.unlink = function () {\n        this.prev.next = this.next;\n        this.next.prev = this.prev;\n    };\n    return LinkedDictionaryPair;\n}());\n/**\n * The head and tail elements of the list have null key and value properties but they\n * usually link to normal nodes.\n */\nvar HeadOrTailLinkedDictionaryPair = /** @class */ (function () {\n    function HeadOrTailLinkedDictionaryPair() {\n        this.key = null;\n        this.value = null;\n    }\n    HeadOrTailLinkedDictionaryPair.prototype.unlink = function () {\n        this.prev.next = this.next;\n        this.next.prev = this.prev;\n    };\n    return HeadOrTailLinkedDictionaryPair;\n}());\nfunction isHeadOrTailLinkedDictionaryPair(p) {\n    return p.next === null;\n}\nvar LinkedDictionary = /** @class */ (function (_super) {\n    __extends(LinkedDictionary, _super);\n    function LinkedDictionary(toStrFunction) {\n        var _this = _super.call(this, toStrFunction) || this;\n        _this.head = new HeadOrTailLinkedDictionaryPair();\n        _this.tail = new HeadOrTailLinkedDictionaryPair();\n        _this.head.next = _this.tail;\n        _this.tail.prev = _this.head;\n        return _this;\n    }\n    /**\n     * Inserts the new node to the 'tail' of the list, updating the\n     * neighbors, and moving 'this.tail' (the End of List indicator) that\n     * to the end.\n     */\n    LinkedDictionary.prototype.appendToTail = function (entry) {\n        var lastNode = this.tail.prev;\n        lastNode.next = entry;\n        entry.prev = lastNode;\n        entry.next = this.tail;\n        this.tail.prev = entry;\n    };\n    /**\n     * Retrieves a linked dictionary from the table internally\n     */\n    LinkedDictionary.prototype.getLinkedDictionaryPair = function (key) {\n        if (util.isUndefined(key)) {\n            return undefined;\n        }\n        var k = '$' + this.toStr(key);\n        var pair = (this.table[k]);\n        return pair;\n    };\n    /**\n     * Returns the value to which this dictionary maps the specified key.\n     * Returns undefined if this dictionary contains no mapping for this key.\n     * @param {Object} key key whose associated value is to be returned.\n     * @return {*} the value to which this dictionary maps the specified key or\n     * undefined if the map contains no mapping for this key.\n     */\n    LinkedDictionary.prototype.getValue = function (key) {\n        var pair = this.getLinkedDictionaryPair(key);\n        if (!util.isUndefined(pair)) {\n            return pair.value;\n        }\n        return undefined;\n    };\n    /**\n     * Removes the mapping for this key from this dictionary if it is present.\n     * Also, if a value is present for this key, the entry is removed from the\n     * insertion ordering.\n     * @param {Object} key key whose mapping is to be removed from the\n     * dictionary.\n     * @return {*} previous value associated with specified key, or undefined if\n     * there was no mapping for key.\n     */\n    LinkedDictionary.prototype.remove = function (key) {\n        var pair = this.getLinkedDictionaryPair(key);\n        if (!util.isUndefined(pair)) {\n            _super.prototype.remove.call(this, key); // This will remove it from the table\n            pair.unlink(); // This will unlink it from the chain\n            return pair.value;\n        }\n        return undefined;\n    };\n    /**\n    * Removes all mappings from this LinkedDictionary.\n    * @this {collections.LinkedDictionary}\n    */\n    LinkedDictionary.prototype.clear = function () {\n        _super.prototype.clear.call(this);\n        this.head.next = this.tail;\n        this.tail.prev = this.head;\n    };\n    /**\n     * Internal function used when updating an existing KeyValue pair.\n     * It places the new value indexed by key into the table, but maintains\n     * its place in the linked ordering.\n     */\n    LinkedDictionary.prototype.replace = function (oldPair, newPair) {\n        var k = '$' + this.toStr(newPair.key);\n        // set the new Pair's links to existingPair's links\n        newPair.next = oldPair.next;\n        newPair.prev = oldPair.prev;\n        // Delete Existing Pair from the table, unlink it from chain.\n        // As a result, the nElements gets decremented by this operation\n        this.remove(oldPair.key);\n        // Link new Pair in place of where oldPair was,\n        // by pointing the old pair's neighbors to it.\n        newPair.prev.next = newPair;\n        newPair.next.prev = newPair;\n        this.table[k] = newPair;\n        // To make up for the fact that the number of elements was decremented,\n        // We need to increase it by one.\n        ++this.nElements;\n    };\n    /**\n     * Associates the specified value with the specified key in this dictionary.\n     * If the dictionary previously contained a mapping for this key, the old\n     * value is replaced by the specified value.\n     * Updating of a key that already exists maintains its place in the\n     * insertion order into the map.\n     * @param {Object} key key with which the specified value is to be\n     * associated.\n     * @param {Object} value value to be associated with the specified key.\n     * @return {*} previous value associated with the specified key, or undefined if\n     * there was no mapping for the key or if the key/value are undefined.\n     */\n    LinkedDictionary.prototype.setValue = function (key, value) {\n        if (util.isUndefined(key) || util.isUndefined(value)) {\n            return undefined;\n        }\n        var existingPair = this.getLinkedDictionaryPair(key);\n        var newPair = new LinkedDictionaryPair(key, value);\n        var k = '$' + this.toStr(key);\n        // If there is already an element for that key, we\n        // keep it's place in the LinkedList\n        if (!util.isUndefined(existingPair)) {\n            this.replace(existingPair, newPair);\n            return existingPair.value;\n        }\n        else {\n            this.appendToTail(newPair);\n            this.table[k] = newPair;\n            ++this.nElements;\n            return undefined;\n        }\n    };\n    /**\n     * Returns an array containing all of the keys in this LinkedDictionary, ordered\n     * by insertion order.\n     * @return {Array} an array containing all of the keys in this LinkedDictionary,\n     * ordered by insertion order.\n     */\n    LinkedDictionary.prototype.keys = function () {\n        var array = [];\n        this.forEach(function (key, value) {\n            array.push(key);\n        });\n        return array;\n    };\n    /**\n     * Returns an array containing all of the values in this LinkedDictionary, ordered by\n     * insertion order.\n     * @return {Array} an array containing all of the values in this LinkedDictionary,\n     * ordered by insertion order.\n     */\n    LinkedDictionary.prototype.values = function () {\n        var array = [];\n        this.forEach(function (key, value) {\n            array.push(value);\n        });\n        return array;\n    };\n    /**\n    * Executes the provided function once for each key-value pair\n    * present in this LinkedDictionary. It is done in the order of insertion\n    * into the LinkedDictionary\n    * @param {function(Object,Object):*} callback function to execute, it is\n    * invoked with two arguments: key and value. To break the iteration you can\n    * optionally return false.\n    */\n    LinkedDictionary.prototype.forEach = function (callback) {\n        var crawlNode = this.head.next;\n        while (!isHeadOrTailLinkedDictionaryPair(crawlNode)) {\n            var ret = callback(crawlNode.key, crawlNode.value);\n            if (ret === false) {\n                return;\n            }\n            crawlNode = crawlNode.next;\n        }\n    };\n    return LinkedDictionary;\n}(Dictionary_1.default)); // End of LinkedDictionary\nexports.default = LinkedDictionary;\n// /**\n//  * Returns true if this dictionary is equal to the given dictionary.\n//  * Two dictionaries are equal if they contain the same mappings.\n//  * @param {collections.Dictionary} other the other dictionary.\n//  * @param {function(Object,Object):boolean=} valuesEqualFunction optional\n//  * function used to check if two values are equal.\n//  * @return {boolean} true if this dictionary is equal to the given dictionary.\n//  */\n// collections.Dictionary.prototype.equals = function(other,valuesEqualFunction) {\n// \tconst eqF = valuesEqualFunction || collections.defaultEquals;\n// \tif(!(other instanceof collections.Dictionary)){\n// \t\treturn false;\n// \t}\n// \tif(this.size() !== other.size()){\n// \t\treturn false;\n// \t}\n// \treturn this.equalsAux(this.firstNode,other.firstNode,eqF);\n// }\n//# sourceMappingURL=LinkedDictionary.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util = require(\"./util\");\nvar arrays = require(\"./arrays\");\nvar LinkedList = /** @class */ (function () {\n    /**\n    * Creates an empty Linked List.\n    * @class A linked list is a data structure consisting of a group of nodes\n    * which together represent a sequence.\n    * @constructor\n    */\n    function LinkedList() {\n        /**\n        * First node in the list\n        * @type {Object}\n        * @private\n        */\n        this.firstNode = null;\n        /**\n        * Last node in the list\n        * @type {Object}\n        * @private\n        */\n        this.lastNode = null;\n        /**\n        * Number of elements in the list\n        * @type {number}\n        * @private\n        */\n        this.nElements = 0;\n    }\n    /**\n    * Adds an element to this list.\n    * @param {Object} item element to be added.\n    * @param {number=} index optional index to add the element. If no index is specified\n    * the element is added to the end of this list.\n    * @return {boolean} true if the element was added or false if the index is invalid\n    * or if the element is undefined.\n    */\n    LinkedList.prototype.add = function (item, index) {\n        if (util.isUndefined(index)) {\n            index = this.nElements;\n        }\n        if (index < 0 || index > this.nElements || util.isUndefined(item)) {\n            return false;\n        }\n        var newNode = this.createNode(item);\n        if (this.nElements === 0 || this.lastNode === null) {\n            // First node in the list.\n            this.firstNode = newNode;\n            this.lastNode = newNode;\n        }\n        else if (index === this.nElements) {\n            // Insert at the end.\n            this.lastNode.next = newNode;\n            this.lastNode = newNode;\n        }\n        else if (index === 0) {\n            // Change first node.\n            newNode.next = this.firstNode;\n            this.firstNode = newNode;\n        }\n        else {\n            var prev = this.nodeAtIndex(index - 1);\n            if (prev == null) {\n                return false;\n            }\n            newNode.next = prev.next;\n            prev.next = newNode;\n        }\n        this.nElements++;\n        return true;\n    };\n    /**\n    * Returns the first element in this list.\n    * @return {*} the first element of the list or undefined if the list is\n    * empty.\n    */\n    LinkedList.prototype.first = function () {\n        if (this.firstNode !== null) {\n            return this.firstNode.element;\n        }\n        return undefined;\n    };\n    /**\n    * Returns the last element in this list.\n    * @return {*} the last element in the list or undefined if the list is\n    * empty.\n    */\n    LinkedList.prototype.last = function () {\n        if (this.lastNode !== null) {\n            return this.lastNode.element;\n        }\n        return undefined;\n    };\n    /**\n     * Returns the element at the specified position in this list.\n     * @param {number} index desired index.\n     * @return {*} the element at the given index or undefined if the index is\n     * out of bounds.\n     */\n    LinkedList.prototype.elementAtIndex = function (index) {\n        var node = this.nodeAtIndex(index);\n        if (node === null) {\n            return undefined;\n        }\n        return node.element;\n    };\n    /**\n     * Returns the index in this list of the first occurrence of the\n     * specified element, or -1 if the List does not contain this element.\n     * <p>If the elements inside this list are\n     * not comparable with the === operator a custom equals function should be\n     * provided to perform searches, the function must receive two arguments and\n     * return true if they are equal, false otherwise. Example:</p>\n     *\n     * <pre>\n     * const petsAreEqualByName = function(pet1, pet2) {\n     *  return pet1.name === pet2.name;\n     * }\n     * </pre>\n     * @param {Object} item element to search for.\n     * @param {function(Object,Object):boolean=} equalsFunction Optional\n     * function used to check if two elements are equal.\n     * @return {number} the index in this list of the first occurrence\n     * of the specified element, or -1 if this list does not contain the\n     * element.\n     */\n    LinkedList.prototype.indexOf = function (item, equalsFunction) {\n        var equalsF = equalsFunction || util.defaultEquals;\n        if (util.isUndefined(item)) {\n            return -1;\n        }\n        var currentNode = this.firstNode;\n        var index = 0;\n        while (currentNode !== null) {\n            if (equalsF(currentNode.element, item)) {\n                return index;\n            }\n            index++;\n            currentNode = currentNode.next;\n        }\n        return -1;\n    };\n    /**\n       * Returns true if this list contains the specified element.\n       * <p>If the elements inside the list are\n       * not comparable with the === operator a custom equals function should be\n       * provided to perform searches, the function must receive two arguments and\n       * return true if they are equal, false otherwise. Example:</p>\n       *\n       * <pre>\n       * const petsAreEqualByName = function(pet1, pet2) {\n       *  return pet1.name === pet2.name;\n       * }\n       * </pre>\n       * @param {Object} item element to search for.\n       * @param {function(Object,Object):boolean=} equalsFunction Optional\n       * function used to check if two elements are equal.\n       * @return {boolean} true if this list contains the specified element, false\n       * otherwise.\n       */\n    LinkedList.prototype.contains = function (item, equalsFunction) {\n        return (this.indexOf(item, equalsFunction) >= 0);\n    };\n    /**\n     * Removes the first occurrence of the specified element in this list.\n     * <p>If the elements inside the list are\n     * not comparable with the === operator a custom equals function should be\n     * provided to perform searches, the function must receive two arguments and\n     * return true if they are equal, false otherwise. Example:</p>\n     *\n     * <pre>\n     * const petsAreEqualByName = function(pet1, pet2) {\n     *  return pet1.name === pet2.name;\n     * }\n     * </pre>\n     * @param {Object} item element to be removed from this list, if present.\n     * @return {boolean} true if the list contained the specified element.\n     */\n    LinkedList.prototype.remove = function (item, equalsFunction) {\n        var equalsF = equalsFunction || util.defaultEquals;\n        if (this.nElements < 1 || util.isUndefined(item)) {\n            return false;\n        }\n        var previous = null;\n        var currentNode = this.firstNode;\n        while (currentNode !== null) {\n            if (equalsF(currentNode.element, item)) {\n                if (previous == null) {\n                    this.firstNode = currentNode.next;\n                    if (currentNode === this.lastNode) {\n                        this.lastNode = null;\n                    }\n                }\n                else if (currentNode === this.lastNode) {\n                    this.lastNode = previous;\n                    previous.next = currentNode.next;\n                    currentNode.next = null;\n                }\n                else {\n                    previous.next = currentNode.next;\n                    currentNode.next = null;\n                }\n                this.nElements--;\n                return true;\n            }\n            previous = currentNode;\n            currentNode = currentNode.next;\n        }\n        return false;\n    };\n    /**\n     * Removes all of the elements from this list.\n     */\n    LinkedList.prototype.clear = function () {\n        this.firstNode = null;\n        this.lastNode = null;\n        this.nElements = 0;\n    };\n    /**\n     * Returns true if this list is equal to the given list.\n     * Two lists are equal if they have the same elements in the same order.\n     * @param {LinkedList} other the other list.\n     * @param {function(Object,Object):boolean=} equalsFunction optional\n     * function used to check if two elements are equal. If the elements in the lists\n     * are custom objects you should provide a function, otherwise\n     * the === operator is used to check equality between elements.\n     * @return {boolean} true if this list is equal to the given list.\n     */\n    LinkedList.prototype.equals = function (other, equalsFunction) {\n        var eqF = equalsFunction || util.defaultEquals;\n        if (!(other instanceof LinkedList)) {\n            return false;\n        }\n        if (this.size() !== other.size()) {\n            return false;\n        }\n        return this.equalsAux(this.firstNode, other.firstNode, eqF);\n    };\n    /**\n    * @private\n    */\n    LinkedList.prototype.equalsAux = function (n1, n2, eqF) {\n        while (n1 !== null && n2 !== null) {\n            if (!eqF(n1.element, n2.element)) {\n                return false;\n            }\n            n1 = n1.next;\n            n2 = n2.next;\n        }\n        return true;\n    };\n    /**\n     * Removes the element at the specified position in this list.\n     * @param {number} index given index.\n     * @return {*} removed element or undefined if the index is out of bounds.\n     */\n    LinkedList.prototype.removeElementAtIndex = function (index) {\n        if (index < 0 || index >= this.nElements || this.firstNode === null || this.lastNode === null) {\n            return undefined;\n        }\n        var element;\n        if (this.nElements === 1) {\n            //First node in the list.\n            element = this.firstNode.element;\n            this.firstNode = null;\n            this.lastNode = null;\n        }\n        else {\n            var previous = this.nodeAtIndex(index - 1);\n            if (previous === null) {\n                element = this.firstNode.element;\n                this.firstNode = this.firstNode.next;\n            }\n            else if (previous.next === this.lastNode) {\n                element = this.lastNode.element;\n                this.lastNode = previous;\n            }\n            if (previous !== null && previous.next !== null) {\n                element = previous.next.element;\n                previous.next = previous.next.next;\n            }\n        }\n        this.nElements--;\n        return element;\n    };\n    /**\n     * Executes the provided function once for each element present in this list in order.\n     * @param {function(Object):*} callback function to execute, it is\n     * invoked with one argument: the element value, to break the iteration you can\n     * optionally return false.\n     */\n    LinkedList.prototype.forEach = function (callback) {\n        var currentNode = this.firstNode;\n        while (currentNode !== null) {\n            if (callback(currentNode.element) === false) {\n                break;\n            }\n            currentNode = currentNode.next;\n        }\n    };\n    /**\n     * Reverses the order of the elements in this linked list (makes the last\n     * element first, and the first element last).\n     */\n    LinkedList.prototype.reverse = function () {\n        var previous = null;\n        var current = this.firstNode;\n        var temp = null;\n        while (current !== null) {\n            temp = current.next;\n            current.next = previous;\n            previous = current;\n            current = temp;\n        }\n        temp = this.firstNode;\n        this.firstNode = this.lastNode;\n        this.lastNode = temp;\n    };\n    /**\n     * Returns an array containing all of the elements in this list in proper\n     * sequence.\n     * @return {Array.<*>} an array containing all of the elements in this list,\n     * in proper sequence.\n     */\n    LinkedList.prototype.toArray = function () {\n        var array = [];\n        var currentNode = this.firstNode;\n        while (currentNode !== null) {\n            array.push(currentNode.element);\n            currentNode = currentNode.next;\n        }\n        return array;\n    };\n    /**\n     * Returns the number of elements in this list.\n     * @return {number} the number of elements in this list.\n     */\n    LinkedList.prototype.size = function () {\n        return this.nElements;\n    };\n    /**\n     * Returns true if this list contains no elements.\n     * @return {boolean} true if this list contains no elements.\n     */\n    LinkedList.prototype.isEmpty = function () {\n        return this.nElements <= 0;\n    };\n    LinkedList.prototype.toString = function () {\n        return arrays.toString(this.toArray());\n    };\n    /**\n     * @private\n     */\n    LinkedList.prototype.nodeAtIndex = function (index) {\n        if (index < 0 || index >= this.nElements) {\n            return null;\n        }\n        if (index === (this.nElements - 1)) {\n            return this.lastNode;\n        }\n        var node = this.firstNode;\n        for (var i = 0; i < index && node != null; i++) {\n            node = node.next;\n        }\n        return node;\n    };\n    /**\n     * @private\n     */\n    LinkedList.prototype.createNode = function (item) {\n        return {\n            element: item,\n            next: null\n        };\n    };\n    return LinkedList;\n}()); // End of linked list\nexports.default = LinkedList;\n//# sourceMappingURL=LinkedList.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util = require(\"./util\");\nvar Dictionary_1 = require(\"./Dictionary\");\nvar arrays = require(\"./arrays\");\nvar MultiDictionary = /** @class */ (function () {\n    /**\n     * Creates an empty multi dictionary.\n     * @class <p>A multi dictionary is a special kind of dictionary that holds\n     * multiple values against each key. Setting a value into the dictionary will\n     * add the value to an array at that key. Getting a key will return an array,\n     * holding all the values set to that key.\n     * You can configure to allow duplicates in the values.\n     * This implementation accepts any kind of objects as keys.</p>\n     *\n     * <p>If the keys are custom objects a function which converts keys to strings must be\n     * provided. Example:</p>\n     *\n     * <pre>\n     * function petToString(pet) {\n       *  return pet.name;\n       * }\n     * </pre>\n     * <p>If the values are custom objects a function to check equality between values\n     * must be provided. Example:</p>\n     *\n     * <pre>\n     * function petsAreEqualByAge(pet1,pet2) {\n       *  return pet1.age===pet2.age;\n       * }\n     * </pre>\n     * @constructor\n     * @param {function(Object):string=} toStrFunction optional function\n     * to convert keys to strings. If the keys aren't strings or if toString()\n     * is not appropriate, a custom function which receives a key and returns a\n     * unique string must be provided.\n     * @param {function(Object,Object):boolean=} valuesEqualsFunction optional\n     * function to check if two values are equal.\n     *\n     * @param allowDuplicateValues\n     */\n    function MultiDictionary(toStrFunction, valuesEqualsFunction, allowDuplicateValues) {\n        if (allowDuplicateValues === void 0) { allowDuplicateValues = false; }\n        this.dict = new Dictionary_1.default(toStrFunction);\n        this.equalsF = valuesEqualsFunction || util.defaultEquals;\n        this.allowDuplicate = allowDuplicateValues;\n    }\n    /**\n    * Returns an array holding the values to which this dictionary maps\n    * the specified key.\n    * Returns an empty array if this dictionary contains no mappings for this key.\n    * @param {Object} key key whose associated values are to be returned.\n    * @return {Array} an array holding the values to which this dictionary maps\n    * the specified key.\n    */\n    MultiDictionary.prototype.getValue = function (key) {\n        var values = this.dict.getValue(key);\n        if (util.isUndefined(values)) {\n            return [];\n        }\n        return arrays.copy(values);\n    };\n    /**\n     * Adds the value to the array associated with the specified key, if\n     * it is not already present.\n     * @param {Object} key key with which the specified value is to be\n     * associated.\n     * @param {Object} value the value to add to the array at the key\n     * @return {boolean} true if the value was not already associated with that key.\n     */\n    MultiDictionary.prototype.setValue = function (key, value) {\n        if (util.isUndefined(key) || util.isUndefined(value)) {\n            return false;\n        }\n        var array = this.dict.getValue(key);\n        if (util.isUndefined(array)) {\n            this.dict.setValue(key, [value]);\n            return true;\n        }\n        if (!this.allowDuplicate) {\n            if (arrays.contains(array, value, this.equalsF)) {\n                return false;\n            }\n        }\n        array.push(value);\n        return true;\n    };\n    /**\n     * Removes the specified values from the array of values associated with the\n     * specified key. If a value isn't given, all values associated with the specified\n     * key are removed.\n     * @param {Object} key key whose mapping is to be removed from the\n     * dictionary.\n     * @param {Object=} value optional argument to specify the value to remove\n     * from the array associated with the specified key.\n     * @return {*} true if the dictionary changed, false if the key doesn't exist or\n     * if the specified value isn't associated with the specified key.\n     */\n    MultiDictionary.prototype.remove = function (key, value) {\n        if (util.isUndefined(value)) {\n            var v = this.dict.remove(key);\n            return !util.isUndefined(v);\n        }\n        var array = this.dict.getValue(key);\n        if (!util.isUndefined(array) && arrays.remove(array, value, this.equalsF)) {\n            if (array.length === 0) {\n                this.dict.remove(key);\n            }\n            return true;\n        }\n        return false;\n    };\n    /**\n     * Returns an array containing all of the keys in this dictionary.\n     * @return {Array} an array containing all of the keys in this dictionary.\n     */\n    MultiDictionary.prototype.keys = function () {\n        return this.dict.keys();\n    };\n    /**\n     * Returns an array containing all of the values in this dictionary.\n     * @return {Array} an array containing all of the values in this dictionary.\n     */\n    MultiDictionary.prototype.values = function () {\n        var values = this.dict.values();\n        var array = [];\n        for (var _i = 0, values_1 = values; _i < values_1.length; _i++) {\n            var v = values_1[_i];\n            for (var _a = 0, v_1 = v; _a < v_1.length; _a++) {\n                var w = v_1[_a];\n                array.push(w);\n            }\n        }\n        return array;\n    };\n    /**\n     * Returns true if this dictionary at least one value associatted the specified key.\n     * @param {Object} key key whose presence in this dictionary is to be\n     * tested.\n     * @return {boolean} true if this dictionary at least one value associatted\n     * the specified key.\n     */\n    MultiDictionary.prototype.containsKey = function (key) {\n        return this.dict.containsKey(key);\n    };\n    /**\n     * Removes all mappings from this dictionary.\n     */\n    MultiDictionary.prototype.clear = function () {\n        this.dict.clear();\n    };\n    /**\n     * Returns the number of keys in this dictionary.\n     * @return {number} the number of key-value mappings in this dictionary.\n     */\n    MultiDictionary.prototype.size = function () {\n        return this.dict.size();\n    };\n    /**\n     * Returns true if this dictionary contains no mappings.\n     * @return {boolean} true if this dictionary contains no mappings.\n     */\n    MultiDictionary.prototype.isEmpty = function () {\n        return this.dict.isEmpty();\n    };\n    return MultiDictionary;\n}()); // end of multi dictionary\nexports.default = MultiDictionary;\n//# sourceMappingURL=MultiDictionary.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar Direction;\n(function (Direction) {\n    Direction[Direction[\"BEFORE\"] = 0] = \"BEFORE\";\n    Direction[Direction[\"AFTER\"] = 1] = \"AFTER\";\n    Direction[Direction[\"INSIDE_AT_END\"] = 2] = \"INSIDE_AT_END\";\n    Direction[Direction[\"INSIDE_AT_START\"] = 3] = \"INSIDE_AT_START\";\n})(Direction || (Direction = {}));\nvar MultiRootTree = /** @class */ (function () {\n    function MultiRootTree(rootIds, nodes) {\n        if (rootIds === void 0) { rootIds = []; }\n        if (nodes === void 0) { nodes = {}; }\n        this.rootIds = rootIds;\n        this.nodes = nodes;\n        this.initRootIds();\n        this.initNodes();\n    }\n    MultiRootTree.prototype.initRootIds = function () {\n        for (var _i = 0, _a = this.rootIds; _i < _a.length; _i++) {\n            var rootId = _a[_i];\n            this.createEmptyNodeIfNotExist(rootId);\n        }\n    };\n    MultiRootTree.prototype.initNodes = function () {\n        for (var nodeKey in this.nodes) {\n            if (this.nodes.hasOwnProperty(nodeKey)) {\n                for (var _i = 0, _a = this.nodes[nodeKey]; _i < _a.length; _i++) {\n                    var nodeListItem = _a[_i];\n                    this.createEmptyNodeIfNotExist(nodeListItem);\n                }\n            }\n        }\n    };\n    MultiRootTree.prototype.createEmptyNodeIfNotExist = function (nodeKey) {\n        if (!this.nodes[nodeKey]) {\n            this.nodes[nodeKey] = [];\n        }\n    };\n    MultiRootTree.prototype.getRootIds = function () {\n        var clone = this.rootIds.slice();\n        return clone;\n    };\n    MultiRootTree.prototype.getNodes = function () {\n        var clone = {};\n        for (var nodeKey in this.nodes) {\n            if (this.nodes.hasOwnProperty(nodeKey)) {\n                clone[nodeKey] = this.nodes[nodeKey].slice();\n            }\n        }\n        return clone;\n    };\n    MultiRootTree.prototype.getObject = function () {\n        return {\n            rootIds: this.getRootIds(),\n            nodes: this.getNodes(),\n        };\n    };\n    MultiRootTree.prototype.toObject = function () {\n        return this.getObject();\n    };\n    MultiRootTree.prototype.flatten = function () {\n        var _this = this;\n        var extraPropsObject = [];\n        for (var i = 0; i < this.rootIds.length; i++) {\n            var rootId = this.rootIds[i];\n            extraPropsObject.push({\n                id: rootId,\n                level: 0,\n                hasParent: false,\n                childrenCount: 0,\n            });\n            traverse(rootId, this.nodes, extraPropsObject, 0);\n        }\n        for (var _i = 0, extraPropsObject_1 = extraPropsObject; _i < extraPropsObject_1.length; _i++) {\n            var o = extraPropsObject_1[_i];\n            o.childrenCount = countChildren(o.id);\n        }\n        return extraPropsObject;\n        function countChildren(id) {\n            if (!_this.nodes[id]) {\n                return 0;\n            }\n            else {\n                var childrenCount = _this.nodes[id].length;\n                return childrenCount;\n            }\n        }\n        function traverse(startId, nodes, returnArray, level) {\n            if (level === void 0) { level = 0; }\n            if (!startId || !nodes || !returnArray || !nodes[startId]) {\n                return;\n            }\n            level++;\n            var idsList = nodes[startId];\n            for (var i = 0; i < idsList.length; i++) {\n                var id = idsList[i];\n                returnArray.push({ id: id, level: level, hasParent: true });\n                traverse(id, nodes, returnArray, level);\n            }\n            level--;\n        }\n    };\n    MultiRootTree.prototype.moveIdBeforeId = function (moveId, beforeId) {\n        return this.moveId(moveId, beforeId, Direction.BEFORE);\n    };\n    MultiRootTree.prototype.moveIdAfterId = function (moveId, afterId) {\n        return this.moveId(moveId, afterId, Direction.AFTER);\n    };\n    MultiRootTree.prototype.moveIdIntoId = function (moveId, insideId, atStart) {\n        if (atStart === void 0) { atStart = true; }\n        if (atStart) {\n            return this.moveId(moveId, insideId, Direction.INSIDE_AT_START);\n        }\n        else {\n            return this.moveId(moveId, insideId, Direction.INSIDE_AT_END);\n        }\n    };\n    MultiRootTree.prototype.swapRootIdWithRootId = function (rootId, withRootId) {\n        var leftIndex = this.findRootId(rootId);\n        var rightIndex = this.findRootId(withRootId);\n        this.swapRootPositionWithRootPosition(leftIndex, rightIndex);\n    };\n    MultiRootTree.prototype.swapRootPositionWithRootPosition = function (swapRootPosition, withRootPosition) {\n        var temp = this.rootIds[withRootPosition];\n        this.rootIds[withRootPosition] = this.rootIds[swapRootPosition];\n        this.rootIds[swapRootPosition] = temp;\n    };\n    MultiRootTree.prototype.deleteId = function (id) {\n        this.rootDeleteId(id);\n        this.nodeAndSubNodesDelete(id);\n        this.nodeRefrencesDelete(id);\n    };\n    MultiRootTree.prototype.insertIdBeforeId = function (beforeId, insertId) {\n        var foundRootIdIndex = this.findRootId(beforeId);\n        if (foundRootIdIndex > -1) {\n            this.insertIdIntoRoot(insertId, foundRootIdIndex);\n        }\n        for (var nodeKey in this.nodes) {\n            if (this.nodes.hasOwnProperty(nodeKey)) {\n                var foundNodeIdIndex = this.findNodeId(nodeKey, beforeId);\n                if (foundNodeIdIndex > -1) {\n                    this.insertIdIntoNode(nodeKey, insertId, foundNodeIdIndex);\n                }\n            }\n        }\n    };\n    MultiRootTree.prototype.insertIdAfterId = function (belowId, insertId) {\n        var foundRootIdIndex = this.findRootId(belowId);\n        if (foundRootIdIndex > -1) {\n            this.insertIdIntoRoot(insertId, foundRootIdIndex + 1);\n        }\n        for (var nodeKey in this.nodes) {\n            if (this.nodes.hasOwnProperty(nodeKey)) {\n                var foundNodeIdIndex = this.findNodeId(nodeKey, belowId);\n                if (foundNodeIdIndex > -1) {\n                    this.insertIdIntoNode(nodeKey, insertId, foundNodeIdIndex + 1);\n                }\n            }\n        }\n    };\n    MultiRootTree.prototype.insertIdIntoId = function (insideId, insertId) {\n        this.nodeInsertAtEnd(insideId, insertId);\n        this.nodes[insertId] = [];\n    };\n    MultiRootTree.prototype.insertIdIntoRoot = function (id, position) {\n        if (position === undefined) {\n            this.rootInsertAtEnd(id);\n        }\n        else {\n            if (position < 0) {\n                var length_1 = this.rootIds.length;\n                this.rootIds.splice((position + length_1 + 1), 0, id);\n            }\n            else {\n                this.rootIds.splice(position, 0, id);\n            }\n        }\n        this.nodes[id] = this.nodes[id] || [];\n    };\n    MultiRootTree.prototype.insertIdIntoNode = function (nodeKey, id, position) {\n        this.nodes[nodeKey] = this.nodes[nodeKey] || [];\n        this.nodes[id] = this.nodes[id] || [];\n        if (position === undefined) {\n            this.nodeInsertAtEnd(nodeKey, id);\n        }\n        else {\n            if (position < 0) {\n                var length_2 = this.nodes[nodeKey].length;\n                this.nodes[nodeKey].splice((position + length_2 + 1), 0, id);\n            }\n            else {\n                this.nodes[nodeKey].splice(position, 0, id);\n            }\n        }\n    };\n    MultiRootTree.prototype.moveId = function (moveId, beforeId, direction) {\n        var sourceId = moveId;\n        var sourceRootIndex = this.findRootId(sourceId);\n        var sourceNodeKey;\n        var sourceNodeIdIndex;\n        if (this.nodes[beforeId]) {\n            sourceNodeKey = beforeId;\n        }\n        for (var nodeKey in this.nodes) {\n            if (this.nodes.hasOwnProperty(nodeKey)) {\n                sourceNodeIdIndex = this.findNodeId(nodeKey, beforeId);\n                break;\n            }\n        }\n        // got all\n        var targetId = beforeId;\n        var targetRootIndex = this.findRootId(targetId);\n        var targetNodeKey;\n        var targetNodeIdIndex;\n        if (this.nodes[beforeId]) {\n            targetNodeKey = beforeId;\n        }\n        for (var nodeKey in this.nodes) {\n            if (this.nodes.hasOwnProperty(nodeKey)) {\n                targetNodeIdIndex = this.findNodeId(nodeKey, beforeId);\n                break;\n            }\n        }\n        // got all\n        if (sourceRootIndex > -1) {\n            if (targetRootIndex > -1) {\n                // moving root to root\n                // console.log(`Moving ROOT to ROOT`);\n                // console.log(`RootIds:`);\n                // console.log(this.rootIds);\n                // console.log(`TargetIndex=${targetRootIndex}, SourceIndex=${sourceRootIndex}`);\n                // console.log(`TargetId=${targetId}, SourceId=${sourceId}`);\n                this.rootDelete(sourceRootIndex); // indexes change now\n                if (targetRootIndex > sourceRootIndex) {\n                    targetRootIndex--;\n                }\n                else {\n                }\n                switch (direction) {\n                    case Direction.BEFORE:\n                        this.insertIdIntoRoot(sourceId, targetRootIndex);\n                        break;\n                    case Direction.AFTER:\n                        this.insertIdIntoRoot(sourceId, targetRootIndex + 1);\n                        break;\n                    case Direction.INSIDE_AT_START:\n                        this.nodeInsertAtStart(targetId, sourceId);\n                        break;\n                    case Direction.INSIDE_AT_END:\n                        this.nodeInsertAtEnd(targetId, sourceId);\n                        break;\n                }\n            }\n            else {\n                // moving root (source) ABOVE node (target)\n                // will remove one entry from roots\n                this.rootDelete(sourceRootIndex);\n                for (var nodeKey in this.nodes) {\n                    if (this.nodes.hasOwnProperty(nodeKey)) {\n                        var index = this.findNodeId(nodeKey, targetId);\n                        if (index > -1) {\n                            switch (direction) {\n                                case Direction.BEFORE:\n                                    this.insertIdIntoNode(nodeKey, sourceId, index);\n                                    break;\n                                case Direction.AFTER:\n                                    this.insertIdIntoNode(nodeKey, sourceId, index + 1);\n                                    break;\n                                case Direction.INSIDE_AT_START:\n                                    this.nodeInsertAtStart(targetId, sourceId);\n                                    break;\n                                case Direction.INSIDE_AT_END:\n                                    this.nodeInsertAtEnd(targetId, sourceId);\n                                    break;\n                            }\n                            break;\n                        }\n                    }\n                }\n            }\n        }\n        else {\n            if (targetRootIndex > -1) {\n                // moving node (source) ABOVE root (target)\n                // delete source id from each node\n                for (var nodeKey in this.nodes) {\n                    if (this.nodes.hasOwnProperty(nodeKey)) {\n                        var index = this.findNodeId(nodeKey, sourceId);\n                        if (index > -1) {\n                            // this.nodeInsertId(nodeKey, sourceId, index);\n                            this.nodeDeleteAtIndex(nodeKey, index);\n                            break;\n                        }\n                    }\n                }\n                switch (direction) {\n                    case Direction.BEFORE:\n                        this.insertIdIntoRoot(sourceId, targetRootIndex);\n                        break;\n                    case Direction.AFTER:\n                        this.insertIdIntoRoot(sourceId, targetRootIndex + 1);\n                        break;\n                    case Direction.INSIDE_AT_START:\n                        this.nodeInsertAtStart(targetId, sourceId);\n                        break;\n                    case Direction.INSIDE_AT_END:\n                        this.nodeInsertAtEnd(targetId, sourceId);\n                        break;\n                }\n            }\n            else {\n                // moving node (source) ABOVE node (target)\n                // delete source id from each node\n                for (var nodeKey in this.nodes) {\n                    if (this.nodes.hasOwnProperty(nodeKey)) {\n                        var index = this.findNodeId(nodeKey, sourceId);\n                        if (index > -1) {\n                            this.nodeDeleteAtIndex(nodeKey, index);\n                            break;\n                        }\n                    }\n                }\n                for (var nodeKey in this.nodes) {\n                    if (this.nodes.hasOwnProperty(nodeKey)) {\n                        var index = this.findNodeId(nodeKey, targetId);\n                        if (index > -1) {\n                            switch (direction) {\n                                case Direction.BEFORE:\n                                    this.insertIdIntoNode(nodeKey, sourceId, index);\n                                    break;\n                                case Direction.AFTER:\n                                    this.insertIdIntoNode(nodeKey, sourceId, index + 1);\n                                    break;\n                                case Direction.INSIDE_AT_START:\n                                    this.nodeInsertAtStart(targetId, sourceId);\n                                    break;\n                                case Direction.INSIDE_AT_END:\n                                    this.nodeInsertAtEnd(targetId, sourceId);\n                                    break;\n                            }\n                            break;\n                        }\n                    }\n                }\n            }\n        }\n    };\n    MultiRootTree.prototype.swapArrayElements = function (arr, indexA, indexB) {\n        var temp = arr[indexA];\n        arr[indexA] = arr[indexB];\n        arr[indexB] = temp;\n        return arr;\n    };\n    MultiRootTree.prototype.rootDeleteId = function (id) {\n        var index = this.findRootId(id);\n        if (index > -1) {\n            this.rootDelete(index);\n        }\n    };\n    MultiRootTree.prototype.nodeAndSubNodesDelete = function (nodeKey) {\n        var toDeleteLater = [];\n        for (var i = 0; i < this.nodes[nodeKey].length; i++) {\n            var id = this.nodes[nodeKey][i];\n            this.nodeAndSubNodesDelete(id);\n            toDeleteLater.push(nodeKey);\n        }\n        this.nodeDelete(nodeKey);\n        for (var i = 0; i < toDeleteLater.length; i++) {\n            this.nodeDelete(toDeleteLater[i]);\n        }\n    };\n    MultiRootTree.prototype.nodeRefrencesDelete = function (id) {\n        for (var nodeKey in this.nodes) {\n            if (this.nodes.hasOwnProperty(nodeKey)) {\n                for (var i = 0; i < this.nodes[nodeKey].length; i++) {\n                    var targetId = this.nodes[nodeKey][i];\n                    if (targetId === id) {\n                        this.nodeDeleteAtIndex(nodeKey, i);\n                    }\n                }\n            }\n        }\n    };\n    MultiRootTree.prototype.nodeDelete = function (nodeKey) {\n        delete this.nodes[nodeKey];\n    };\n    MultiRootTree.prototype.findRootId = function (id) {\n        return this.rootIds.indexOf(id);\n    };\n    MultiRootTree.prototype.findNodeId = function (nodeKey, id) {\n        return this.nodes[nodeKey].indexOf(id);\n    };\n    MultiRootTree.prototype.findNode = function (nodeKey) {\n        return this.nodes[nodeKey];\n    };\n    MultiRootTree.prototype.nodeInsertAtStart = function (nodeKey, id) {\n        this.nodes[nodeKey].unshift(id);\n    };\n    MultiRootTree.prototype.nodeInsertAtEnd = function (nodeKey, id) {\n        this.nodes[nodeKey].push(id);\n    };\n    MultiRootTree.prototype.rootDelete = function (index) {\n        this.rootIds.splice(index, 1);\n    };\n    MultiRootTree.prototype.nodeDeleteAtIndex = function (nodeKey, index) {\n        this.nodes[nodeKey].splice(index, 1);\n    };\n    MultiRootTree.prototype.rootInsertAtStart = function (id) {\n        this.rootIds.unshift(id);\n    };\n    MultiRootTree.prototype.rootInsertAtEnd = function (id) {\n        this.rootIds.push(id);\n    };\n    return MultiRootTree;\n}());\nexports.default = MultiRootTree;\n//# sourceMappingURL=MultiRootTree.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util = require(\"./util\");\nvar Heap_1 = require(\"./Heap\");\nvar PriorityQueue = /** @class */ (function () {\n    /**\n     * Creates an empty priority queue.\n     * @class <p>In a priority queue each element is associated with a \"priority\",\n     * elements are dequeued in highest-priority-first order (the elements with the\n     * highest priority are dequeued first). Priority Queues are implemented as heaps.\n     * If the inserted elements are custom objects a compare function must be provided,\n     * otherwise the <=, === and >= operators are used to compare object priority.</p>\n     * <pre>\n     * function compare(a, b) {\n     *  if (a is less than b by some ordering criterion) {\n     *     return -1;\n     *  } if (a is greater than b by the ordering criterion) {\n     *     return 1;\n     *  }\n     *  // a must be equal to b\n     *  return 0;\n     * }\n     * </pre>\n     * @constructor\n     * @param {function(Object,Object):number=} compareFunction optional\n     * function used to compare two element priorities. Must return a negative integer,\n     * zero, or a positive integer as the first argument is less than, equal to,\n     * or greater than the second.\n     */\n    function PriorityQueue(compareFunction) {\n        this.heap = new Heap_1.default(util.reverseCompareFunction(compareFunction));\n    }\n    /**\n     * Inserts the specified element into this priority queue.\n     * @param {Object} element the element to insert.\n     * @return {boolean} true if the element was inserted, or false if it is undefined.\n     */\n    PriorityQueue.prototype.enqueue = function (element) {\n        return this.heap.add(element);\n    };\n    /**\n     * Inserts the specified element into this priority queue.\n     * @param {Object} element the element to insert.\n     * @return {boolean} true if the element was inserted, or false if it is undefined.\n     */\n    PriorityQueue.prototype.add = function (element) {\n        return this.heap.add(element);\n    };\n    /**\n     * Retrieves and removes the highest priority element of this queue.\n     * @return {*} the the highest priority element of this queue,\n     *  or undefined if this queue is empty.\n     */\n    PriorityQueue.prototype.dequeue = function () {\n        if (this.heap.size() !== 0) {\n            var el = this.heap.peek();\n            this.heap.removeRoot();\n            return el;\n        }\n        return undefined;\n    };\n    /**\n     * Retrieves, but does not remove, the highest priority element of this queue.\n     * @return {*} the highest priority element of this queue, or undefined if this queue is empty.\n     */\n    PriorityQueue.prototype.peek = function () {\n        return this.heap.peek();\n    };\n    /**\n     * Returns true if this priority queue contains the specified element.\n     * @param {Object} element element to search for.\n     * @return {boolean} true if this priority queue contains the specified element,\n     * false otherwise.\n     */\n    PriorityQueue.prototype.contains = function (element) {\n        return this.heap.contains(element);\n    };\n    /**\n     * Checks if this priority queue is empty.\n     * @return {boolean} true if and only if this priority queue contains no items; false\n     * otherwise.\n     */\n    PriorityQueue.prototype.isEmpty = function () {\n        return this.heap.isEmpty();\n    };\n    /**\n     * Returns the number of elements in this priority queue.\n     * @return {number} the number of elements in this priority queue.\n     */\n    PriorityQueue.prototype.size = function () {\n        return this.heap.size();\n    };\n    /**\n     * Removes all of the elements from this priority queue.\n     */\n    PriorityQueue.prototype.clear = function () {\n        this.heap.clear();\n    };\n    /**\n     * Executes the provided function once for each element present in this queue in\n     * no particular order.\n     * @param {function(Object):*} callback function to execute, it is\n     * invoked with one argument: the element value, to break the iteration you can\n     * optionally return false.\n     */\n    PriorityQueue.prototype.forEach = function (callback) {\n        this.heap.forEach(callback);\n    };\n    return PriorityQueue;\n}()); // end of priority queue\nexports.default = PriorityQueue;\n//# sourceMappingURL=PriorityQueue.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar LinkedList_1 = require(\"./LinkedList\");\nvar Queue = /** @class */ (function () {\n    /**\n     * Creates an empty queue.\n     * @class A queue is a First-In-First-Out (FIFO) data structure, the first\n     * element added to the queue will be the first one to be removed. This\n     * implementation uses a linked list as a container.\n     * @constructor\n     */\n    function Queue() {\n        this.list = new LinkedList_1.default();\n    }\n    /**\n     * Inserts the specified element into the end of this queue.\n     * @param {Object} elem the element to insert.\n     * @return {boolean} true if the element was inserted, or false if it is undefined.\n     */\n    Queue.prototype.enqueue = function (elem) {\n        return this.list.add(elem);\n    };\n    /**\n     * Inserts the specified element into the end of this queue.\n     * @param {Object} elem the element to insert.\n     * @return {boolean} true if the element was inserted, or false if it is undefined.\n     */\n    Queue.prototype.add = function (elem) {\n        return this.list.add(elem);\n    };\n    /**\n     * Retrieves and removes the head of this queue.\n     * @return {*} the head of this queue, or undefined if this queue is empty.\n     */\n    Queue.prototype.dequeue = function () {\n        if (this.list.size() !== 0) {\n            var el = this.list.first();\n            this.list.removeElementAtIndex(0);\n            return el;\n        }\n        return undefined;\n    };\n    /**\n     * Retrieves, but does not remove, the head of this queue.\n     * @return {*} the head of this queue, or undefined if this queue is empty.\n     */\n    Queue.prototype.peek = function () {\n        if (this.list.size() !== 0) {\n            return this.list.first();\n        }\n        return undefined;\n    };\n    /**\n     * Returns the number of elements in this queue.\n     * @return {number} the number of elements in this queue.\n     */\n    Queue.prototype.size = function () {\n        return this.list.size();\n    };\n    /**\n     * Returns true if this queue contains the specified element.\n     * <p>If the elements inside this stack are\n     * not comparable with the === operator, a custom equals function should be\n     * provided to perform searches, the function must receive two arguments and\n     * return true if they are equal, false otherwise. Example:</p>\n     *\n     * <pre>\n     * const petsAreEqualByName (pet1, pet2) {\n     *  return pet1.name === pet2.name;\n     * }\n     * </pre>\n     * @param {Object} elem element to search for.\n     * @param {function(Object,Object):boolean=} equalsFunction optional\n     * function to check if two elements are equal.\n     * @return {boolean} true if this queue contains the specified element,\n     * false otherwise.\n     */\n    Queue.prototype.contains = function (elem, equalsFunction) {\n        return this.list.contains(elem, equalsFunction);\n    };\n    /**\n     * Checks if this queue is empty.\n     * @return {boolean} true if and only if this queue contains no items; false\n     * otherwise.\n     */\n    Queue.prototype.isEmpty = function () {\n        return this.list.size() <= 0;\n    };\n    /**\n     * Removes all of the elements from this queue.\n     */\n    Queue.prototype.clear = function () {\n        this.list.clear();\n    };\n    /**\n     * Executes the provided function once for each element present in this queue in\n     * FIFO order.\n     * @param {function(Object):*} callback function to execute, it is\n     * invoked with one argument: the element value, to break the iteration you can\n     * optionally return false.\n     */\n    Queue.prototype.forEach = function (callback) {\n        this.list.forEach(callback);\n    };\n    return Queue;\n}()); // End of queue\nexports.default = Queue;\n//# sourceMappingURL=Queue.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util = require(\"./util\");\nvar arrays = require(\"./arrays\");\nvar Dictionary_1 = require(\"./Dictionary\");\nvar Set = /** @class */ (function () {\n    /**\n     * Creates an empty set.\n     * @class <p>A set is a data structure that contains no duplicate items.</p>\n     * <p>If the inserted elements are custom objects a function\n     * which converts elements to strings must be provided. Example:</p>\n     *\n     * <pre>\n     * function petToString(pet) {\n     *  return pet.name;\n     * }\n     * </pre>\n     *\n     * @constructor\n     * @param {function(Object):string=} toStringFunction optional function used\n     * to convert elements to strings. If the elements aren't strings or if toString()\n     * is not appropriate, a custom function which receives an object and returns a\n     * unique string must be provided.\n     */\n    function Set(toStringFunction) {\n        this.dictionary = new Dictionary_1.default(toStringFunction);\n    }\n    /**\n     * Returns true if this set contains the specified element.\n     * @param {Object} element element to search for.\n     * @return {boolean} true if this set contains the specified element,\n     * false otherwise.\n     */\n    Set.prototype.contains = function (element) {\n        return this.dictionary.containsKey(element);\n    };\n    /**\n     * Adds the specified element to this set if it is not already present.\n     * @param {Object} element the element to insert.\n     * @return {boolean} true if this set did not already contain the specified element.\n     */\n    Set.prototype.add = function (element) {\n        if (this.contains(element) || util.isUndefined(element)) {\n            return false;\n        }\n        else {\n            this.dictionary.setValue(element, element);\n            return true;\n        }\n    };\n    /**\n     * Performs an intersecion between this and another set.\n     * Removes all values that are not present this set and the given set.\n     * @param {collections.Set} otherSet other set.\n     */\n    Set.prototype.intersection = function (otherSet) {\n        var set = this;\n        this.forEach(function (element) {\n            if (!otherSet.contains(element)) {\n                set.remove(element);\n            }\n            return true;\n        });\n    };\n    /**\n     * Performs a union between this and another set.\n     * Adds all values from the given set to this set.\n     * @param {collections.Set} otherSet other set.\n     */\n    Set.prototype.union = function (otherSet) {\n        var set = this;\n        otherSet.forEach(function (element) {\n            set.add(element);\n            return true;\n        });\n    };\n    /**\n     * Performs a difference between this and another set.\n     * Removes from this set all the values that are present in the given set.\n     * @param {collections.Set} otherSet other set.\n     */\n    Set.prototype.difference = function (otherSet) {\n        var set = this;\n        otherSet.forEach(function (element) {\n            set.remove(element);\n            return true;\n        });\n    };\n    /**\n     * Checks whether the given set contains all the elements in this set.\n     * @param {collections.Set} otherSet other set.\n     * @return {boolean} true if this set is a subset of the given set.\n     */\n    Set.prototype.isSubsetOf = function (otherSet) {\n        if (this.size() > otherSet.size()) {\n            return false;\n        }\n        var isSub = true;\n        this.forEach(function (element) {\n            if (!otherSet.contains(element)) {\n                isSub = false;\n                return false;\n            }\n            return true;\n        });\n        return isSub;\n    };\n    /**\n     * Removes the specified element from this set if it is present.\n     * @return {boolean} true if this set contained the specified element.\n     */\n    Set.prototype.remove = function (element) {\n        if (!this.contains(element)) {\n            return false;\n        }\n        else {\n            this.dictionary.remove(element);\n            return true;\n        }\n    };\n    /**\n     * Executes the provided function once for each element\n     * present in this set.\n     * @param {function(Object):*} callback function to execute, it is\n     * invoked with one arguments: the element. To break the iteration you can\n     * optionally return false.\n     */\n    Set.prototype.forEach = function (callback) {\n        this.dictionary.forEach(function (k, v) {\n            return callback(v);\n        });\n    };\n    /**\n     * Returns an array containing all of the elements in this set in arbitrary order.\n     * @return {Array} an array containing all of the elements in this set.\n     */\n    Set.prototype.toArray = function () {\n        return this.dictionary.values();\n    };\n    /**\n     * Returns true if this set contains no elements.\n     * @return {boolean} true if this set contains no elements.\n     */\n    Set.prototype.isEmpty = function () {\n        return this.dictionary.isEmpty();\n    };\n    /**\n     * Returns the number of elements in this set.\n     * @return {number} the number of elements in this set.\n     */\n    Set.prototype.size = function () {\n        return this.dictionary.size();\n    };\n    /**\n     * Removes all of the elements from this set.\n     */\n    Set.prototype.clear = function () {\n        this.dictionary.clear();\n    };\n    /*\n    * Provides a string representation for display\n    */\n    Set.prototype.toString = function () {\n        return arrays.toString(this.toArray());\n    };\n    return Set;\n}()); // end of Set\nexports.default = Set;\n//# sourceMappingURL=Set.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar LinkedList_1 = require(\"./LinkedList\");\nvar Stack = /** @class */ (function () {\n    /**\n     * Creates an empty Stack.\n     * @class A Stack is a Last-In-First-Out (LIFO) data structure, the last\n     * element added to the stack will be the first one to be removed. This\n     * implementation uses a linked list as a container.\n     * @constructor\n     */\n    function Stack() {\n        this.list = new LinkedList_1.default();\n    }\n    /**\n     * Pushes an item onto the top of this stack.\n     * @param {Object} elem the element to be pushed onto this stack.\n     * @return {boolean} true if the element was pushed or false if it is undefined.\n     */\n    Stack.prototype.push = function (elem) {\n        return this.list.add(elem, 0);\n    };\n    /**\n     * Pushes an item onto the top of this stack.\n     * @param {Object} elem the element to be pushed onto this stack.\n     * @return {boolean} true if the element was pushed or false if it is undefined.\n     */\n    Stack.prototype.add = function (elem) {\n        return this.list.add(elem, 0);\n    };\n    /**\n     * Removes the object at the top of this stack and returns that object.\n     * @return {*} the object at the top of this stack or undefined if the\n     * stack is empty.\n     */\n    Stack.prototype.pop = function () {\n        return this.list.removeElementAtIndex(0);\n    };\n    /**\n     * Looks at the object at the top of this stack without removing it from the\n     * stack.\n     * @return {*} the object at the top of this stack or undefined if the\n     * stack is empty.\n     */\n    Stack.prototype.peek = function () {\n        return this.list.first();\n    };\n    /**\n     * Returns the number of elements in this stack.\n     * @return {number} the number of elements in this stack.\n     */\n    Stack.prototype.size = function () {\n        return this.list.size();\n    };\n    /**\n     * Returns true if this stack contains the specified element.\n     * <p>If the elements inside this stack are\n     * not comparable with the === operator, a custom equals function should be\n     * provided to perform searches, the function must receive two arguments and\n     * return true if they are equal, false otherwise. Example:</p>\n     *\n     * <pre>\n     * const petsAreEqualByName (pet1, pet2) {\n     *  return pet1.name === pet2.name;\n     * }\n     * </pre>\n     * @param {Object} elem element to search for.\n     * @param {function(Object,Object):boolean=} equalsFunction optional\n     * function to check if two elements are equal.\n     * @return {boolean} true if this stack contains the specified element,\n     * false otherwise.\n     */\n    Stack.prototype.contains = function (elem, equalsFunction) {\n        return this.list.contains(elem, equalsFunction);\n    };\n    /**\n     * Checks if this stack is empty.\n     * @return {boolean} true if and only if this stack contains no items; false\n     * otherwise.\n     */\n    Stack.prototype.isEmpty = function () {\n        return this.list.isEmpty();\n    };\n    /**\n     * Removes all of the elements from this stack.\n     */\n    Stack.prototype.clear = function () {\n        this.list.clear();\n    };\n    /**\n     * Executes the provided function once for each element present in this stack in\n     * LIFO order.\n     * @param {function(Object):*} callback function to execute, it is\n     * invoked with one argument: the element value, to break the iteration you can\n     * optionally return false.\n     */\n    Stack.prototype.forEach = function (callback) {\n        this.list.forEach(callback);\n    };\n    return Stack;\n}()); // End of stack\nexports.default = Stack;\n//# sourceMappingURL=Stack.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util = require(\"./util\");\n/**\n * Returns the position of the first occurrence of the specified item\n * within the specified array.4\n * @param {*} array the array in which to search the element.\n * @param {Object} item the element to search.\n * @param {function(Object,Object):boolean=} equalsFunction optional function used to\n * check equality between 2 elements.\n * @return {number} the position of the first occurrence of the specified element\n * within the specified array, or -1 if not found.\n */\nfunction indexOf(array, item, equalsFunction) {\n    var equals = equalsFunction || util.defaultEquals;\n    var length = array.length;\n    for (var i = 0; i < length; i++) {\n        if (equals(array[i], item)) {\n            return i;\n        }\n    }\n    return -1;\n}\nexports.indexOf = indexOf;\n/**\n * Returns the position of the last occurrence of the specified element\n * within the specified array.\n * @param {*} array the array in which to search the element.\n * @param {Object} item the element to search.\n * @param {function(Object,Object):boolean=} equalsFunction optional function used to\n * check equality between 2 elements.\n * @return {number} the position of the last occurrence of the specified element\n * within the specified array or -1 if not found.\n */\nfunction lastIndexOf(array, item, equalsFunction) {\n    var equals = equalsFunction || util.defaultEquals;\n    var length = array.length;\n    for (var i = length - 1; i >= 0; i--) {\n        if (equals(array[i], item)) {\n            return i;\n        }\n    }\n    return -1;\n}\nexports.lastIndexOf = lastIndexOf;\n/**\n * Returns true if the specified array contains the specified element.\n * @param {*} array the array in which to search the element.\n * @param {Object} item the element to search.\n * @param {function(Object,Object):boolean=} equalsFunction optional function to\n * check equality between 2 elements.\n * @return {boolean} true if the specified array contains the specified element.\n */\nfunction contains(array, item, equalsFunction) {\n    return indexOf(array, item, equalsFunction) >= 0;\n}\nexports.contains = contains;\n/**\n * Removes the first ocurrence of the specified element from the specified array.\n * @param {*} array the array in which to search element.\n * @param {Object} item the element to search.\n * @param {function(Object,Object):boolean=} equalsFunction optional function to\n * check equality between 2 elements.\n * @return {boolean} true if the array changed after this call.\n */\nfunction remove(array, item, equalsFunction) {\n    var index = indexOf(array, item, equalsFunction);\n    if (index < 0) {\n        return false;\n    }\n    array.splice(index, 1);\n    return true;\n}\nexports.remove = remove;\n/**\n * Returns the number of elements in the specified array equal\n * to the specified object.\n * @param {Array} array the array in which to determine the frequency of the element.\n * @param {Object} item the element whose frequency is to be determined.\n * @param {function(Object,Object):boolean=} equalsFunction optional function used to\n * check equality between 2 elements.\n * @return {number} the number of elements in the specified array\n * equal to the specified object.\n */\nfunction frequency(array, item, equalsFunction) {\n    var equals = equalsFunction || util.defaultEquals;\n    var length = array.length;\n    var freq = 0;\n    for (var i = 0; i < length; i++) {\n        if (equals(array[i], item)) {\n            freq++;\n        }\n    }\n    return freq;\n}\nexports.frequency = frequency;\n/**\n * Returns true if the two specified arrays are equal to one another.\n * Two arrays are considered equal if both arrays contain the same number\n * of elements, and all corresponding pairs of elements in the two\n * arrays are equal and are in the same order.\n * @param {Array} array1 one array to be tested for equality.\n * @param {Array} array2 the other array to be tested for equality.\n * @param {function(Object,Object):boolean=} equalsFunction optional function used to\n * check equality between elemements in the arrays.\n * @return {boolean} true if the two arrays are equal\n */\nfunction equals(array1, array2, equalsFunction) {\n    var equals = equalsFunction || util.defaultEquals;\n    if (array1.length !== array2.length) {\n        return false;\n    }\n    var length = array1.length;\n    for (var i = 0; i < length; i++) {\n        if (!equals(array1[i], array2[i])) {\n            return false;\n        }\n    }\n    return true;\n}\nexports.equals = equals;\n/**\n * Returns shallow a copy of the specified array.\n * @param {*} array the array to copy.\n * @return {Array} a copy of the specified array\n */\nfunction copy(array) {\n    return array.concat();\n}\nexports.copy = copy;\n/**\n * Swaps the elements at the specified positions in the specified array.\n * @param {Array} array The array in which to swap elements.\n * @param {number} i the index of one element to be swapped.\n * @param {number} j the index of the other element to be swapped.\n * @return {boolean} true if the array is defined and the indexes are valid.\n */\nfunction swap(array, i, j) {\n    if (i < 0 || i >= array.length || j < 0 || j >= array.length) {\n        return false;\n    }\n    var temp = array[i];\n    array[i] = array[j];\n    array[j] = temp;\n    return true;\n}\nexports.swap = swap;\nfunction toString(array) {\n    return '[' + array.toString() + ']';\n}\nexports.toString = toString;\n/**\n * Executes the provided function once for each element present in this array\n * starting from index 0 to length - 1.\n * @param {Array} array The array in which to iterate.\n * @param {function(Object):*} callback function to execute, it is\n * invoked with one argument: the element value, to break the iteration you can\n * optionally return false.\n */\nfunction forEach(array, callback) {\n    for (var _i = 0, array_1 = array; _i < array_1.length; _i++) {\n        var ele = array_1[_i];\n        if (callback(ele) === false) {\n            return;\n        }\n    }\n}\nexports.forEach = forEach;\n//# sourceMappingURL=arrays.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar _hasOwnProperty = Object.prototype.hasOwnProperty;\nexports.has = function (obj, prop) {\n    return _hasOwnProperty.call(obj, prop);\n};\n/**\n * Default function to compare element order.\n * @function\n */\nfunction defaultCompare(a, b) {\n    if (a < b) {\n        return -1;\n    }\n    else if (a === b) {\n        return 0;\n    }\n    else {\n        return 1;\n    }\n}\nexports.defaultCompare = defaultCompare;\n/**\n * Default function to test equality.\n * @function\n */\nfunction defaultEquals(a, b) {\n    return a === b;\n}\nexports.defaultEquals = defaultEquals;\n/**\n * Default function to convert an object to a string.\n * @function\n */\nfunction defaultToString(item) {\n    if (item === null) {\n        return 'COLLECTION_NULL';\n    }\n    else if (isUndefined(item)) {\n        return 'COLLECTION_UNDEFINED';\n    }\n    else if (isString(item)) {\n        return '$s' + item;\n    }\n    else {\n        return '$o' + item.toString();\n    }\n}\nexports.defaultToString = defaultToString;\n/**\n* Joins all the properies of the object using the provided join string\n*/\nfunction makeString(item, join) {\n    if (join === void 0) { join = ','; }\n    if (item === null) {\n        return 'COLLECTION_NULL';\n    }\n    else if (isUndefined(item)) {\n        return 'COLLECTION_UNDEFINED';\n    }\n    else if (isString(item)) {\n        return item.toString();\n    }\n    else {\n        var toret = '{';\n        var first = true;\n        for (var prop in item) {\n            if (exports.has(item, prop)) {\n                if (first) {\n                    first = false;\n                }\n                else {\n                    toret = toret + join;\n                }\n                toret = toret + prop + ':' + item[prop];\n            }\n        }\n        return toret + '}';\n    }\n}\nexports.makeString = makeString;\n/**\n * Checks if the given argument is a function.\n * @function\n */\nfunction isFunction(func) {\n    return (typeof func) === 'function';\n}\nexports.isFunction = isFunction;\n/**\n * Checks if the given argument is undefined.\n * @function\n */\nfunction isUndefined(obj) {\n    return (typeof obj) === 'undefined';\n}\nexports.isUndefined = isUndefined;\n/**\n * Checks if the given argument is a string.\n * @function\n */\nfunction isString(obj) {\n    return Object.prototype.toString.call(obj) === '[object String]';\n}\nexports.isString = isString;\n/**\n * Reverses a compare function.\n * @function\n */\nfunction reverseCompareFunction(compareFunction) {\n    if (isUndefined(compareFunction) || !isFunction(compareFunction)) {\n        return function (a, b) {\n            if (a < b) {\n                return 1;\n            }\n            else if (a === b) {\n                return 0;\n            }\n            else {\n                return -1;\n            }\n        };\n    }\n    else {\n        return function (d, v) {\n            return compareFunction(d, v) * -1;\n        };\n    }\n}\nexports.reverseCompareFunction = reverseCompareFunction;\n/**\n * Returns an equal function given a compare function.\n * @function\n */\nfunction compareToEquals(compareFunction) {\n    return function (a, b) {\n        return compareFunction(a, b) === 0;\n    };\n}\nexports.compareToEquals = compareToEquals;\n//# sourceMappingURL=util.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\n// Copyright 2013 Basarat Ali Syed. All Rights Reserved.\n//\n// Licensed under MIT open source license http://opensource.org/licenses/MIT\n//\n// Orginal javascript code was by Mauricio Santos\n//\nvar _arrays = require(\"./arrays\");\nexports.arrays = _arrays;\nvar Bag_1 = require(\"./Bag\");\nexports.Bag = Bag_1.default;\nvar BSTree_1 = require(\"./BSTree\");\nexports.BSTree = BSTree_1.default;\nvar BSTreeKV_1 = require(\"./BSTreeKV\");\nexports.BSTreeKV = BSTreeKV_1.default;\nvar Dictionary_1 = require(\"./Dictionary\");\nexports.Dictionary = Dictionary_1.default;\nvar Heap_1 = require(\"./Heap\");\nexports.Heap = Heap_1.default;\nvar LinkedDictionary_1 = require(\"./LinkedDictionary\");\nexports.LinkedDictionary = LinkedDictionary_1.default;\nvar LinkedList_1 = require(\"./LinkedList\");\nexports.LinkedList = LinkedList_1.default;\nvar MultiDictionary_1 = require(\"./MultiDictionary\");\nexports.MultiDictionary = MultiDictionary_1.default;\nvar FactoryDictionary_1 = require(\"./FactoryDictionary\");\nexports.FactoryDictionary = FactoryDictionary_1.default;\nvar FactoryDictionary_2 = require(\"./FactoryDictionary\");\nexports.DefaultDictionary = FactoryDictionary_2.default;\nvar Queue_1 = require(\"./Queue\");\nexports.Queue = Queue_1.default;\nvar PriorityQueue_1 = require(\"./PriorityQueue\");\nexports.PriorityQueue = PriorityQueue_1.default;\nvar Set_1 = require(\"./Set\");\nexports.Set = Set_1.default;\nvar Stack_1 = require(\"./Stack\");\nexports.Stack = Stack_1.default;\nvar MultiRootTree_1 = require(\"./MultiRootTree\");\nexports.MultiRootTree = MultiRootTree_1.default;\nvar _util = require(\"./util\");\nexports.util = _util;\n//# sourceMappingURL=index.js.map"]} +return require('typescript-collections'); +}); \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/umd.min.js b/node_modules/typescript-collections/dist/lib/umd.min.js new file mode 100644 index 00000000..8214c8a3 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/umd.min.js @@ -0,0 +1 @@ +!function(t){if("object"==typeof exports&&"undefined"!=typeof module)module.exports=t();else if("function"==typeof define&&define.amd)define([],t);else{("undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof self?self:this).listComponent=t()}}(function(){return require=function t(e,n,i){function r(s,u){if(!n[s]){if(!e[s]){var a="function"==typeof require&&require;if(!u&&a)return a(s,!0);if(o)return o(s,!0);var h=new Error("Cannot find module '"+s+"'");throw h.code="MODULE_NOT_FOUND",h}var l=n[s]={exports:{}};e[s][0].call(l.exports,function(t){var n=e[s][1][t];return r(n||t)},l,l.exports,t,e,n,i)}return n[s].exports}for(var o="function"==typeof require&&require,s=0;s0&&(t=t.rightCh);return t},t.prototype.transplant=function(t,e){null===t.parent?this.root=e:t===t.parent.leftCh?t.parent.leftCh=e:t.parent.rightCh=e,null!==e&&(e.parent=t.parent)},t.prototype.removeNode=function(t){if(null===t.leftCh)this.transplant(t,t.rightCh);else if(null===t.rightCh)this.transplant(t,t.leftCh);else{var e=this.minimumAux(t.rightCh);e.parent!==t&&(this.transplant(e,e.rightCh),e.rightCh=t.rightCh,e.rightCh.parent=e),this.transplant(t,e),e.leftCh=t.leftCh,e.leftCh.parent=e}},t.prototype.inorderTraversalAux=function(t,e,n){null===t||n.stop||(this.inorderTraversalAux(t.leftCh,e,n),n.stop||(n.stop=!1===e(t.element),n.stop||this.inorderTraversalAux(t.rightCh,e,n)))},t.prototype.levelTraversalAux=function(t,e){var n=new r.default;for(null!==t&&n.enqueue(t),t=n.dequeue()||null;null!=t;){if(!1===e(t.element))return;null!==t.leftCh&&n.enqueue(t.leftCh),null!==t.rightCh&&n.enqueue(t.rightCh),t=n.dequeue()||null}},t.prototype.preorderTraversalAux=function(t,e,n){null===t||n.stop||(n.stop=!1===e(t.element),n.stop||(this.preorderTraversalAux(t.leftCh,e,n),n.stop||this.preorderTraversalAux(t.rightCh,e,n)))},t.prototype.postorderTraversalAux=function(t,e,n){null===t||n.stop||(this.postorderTraversalAux(t.leftCh,e,n),n.stop||(this.postorderTraversalAux(t.rightCh,e,n),n.stop||(n.stop=!1===e(t.element))))},t.prototype.minimumAux=function(t){for(;null!=t&&null!==t.leftCh;)t=t.leftCh;return t},t.prototype.maximumAux=function(t){for(;null!=t&&null!==t.rightCh;)t=t.rightCh;return t},t.prototype.heightAux=function(t){return null===t?-1:Math.max(this.heightAux(t.leftCh),this.heightAux(t.rightCh))+1},t.prototype.insertNode=function(t){for(var e=null,n=this.root;null!==n;){var i=this.compare(t.element,n.element);if(0===i)return null;i<0?(e=n,n=n.leftCh):(e=n,n=n.rightCh)}return t.parent=e,null===e?this.root=t:this.compare(t.element,e.element)<0?e.leftCh=t:e.rightCh=t,t},t.prototype.createNode=function(t){return{element:t,leftCh:null,rightCh:null,parent:null}},t}();n.default=o},{"./Queue":12,"./util":16}],3:[function(t,e,n){"use strict";Object.defineProperty(n,"__esModule",{value:!0});var i=t("./util"),r=t("./Dictionary"),o=t("./Set"),s=function(){function t(t){this.toStrF=t||i.defaultToString,this.dictionary=new r.default(this.toStrF),this.nElements=0}return t.prototype.add=function(t,e){if(void 0===e&&(e=1),i.isUndefined(t)||e<=0)return!1;if(this.contains(t))this.dictionary.getValue(t).copies+=e;else{var n={value:t,copies:e};this.dictionary.setValue(t,n)}return this.nElements+=e,!0},t.prototype.count=function(t){return this.contains(t)?this.dictionary.getValue(t).copies:0},t.prototype.contains=function(t){return this.dictionary.containsKey(t)},t.prototype.remove=function(t,e){if(void 0===e&&(e=1),i.isUndefined(t)||e<=0)return!1;if(this.contains(t)){var n=this.dictionary.getValue(t);return e>n.copies?this.nElements-=n.copies:this.nElements-=e,n.copies-=e,n.copies<=0&&this.dictionary.remove(t),!0}return!1},t.prototype.toArray=function(){for(var t=[],e=0,n=this.dictionary.values();e=this.data.length?t>=this.data.length?-1:t:this.compare(this.data[t],this.data[e])<=0?t:e},t.prototype.siftUp=function(t){for(var e=this.parentIndex(t);t>0&&this.compare(this.data[e],this.data[t])>0;)r.swap(this.data,e,t),t=e,e=this.parentIndex(t)},t.prototype.siftDown=function(t){for(var e=this.minIndex(this.leftChildIndex(t),this.rightChildIndex(t));e>=0&&this.compare(this.data[t],this.data[e])>0;)r.swap(this.data,e,t),t=e,e=this.minIndex(this.leftChildIndex(t),this.rightChildIndex(t))},t.prototype.peek=function(){return this.data.length>0?this.data[0]:void 0},t.prototype.add=function(t){return!i.isUndefined(t)&&(this.data.push(t),this.siftUp(this.data.length-1),!0)},t.prototype.removeRoot=function(){if(this.data.length>0){var t=this.data[0];return this.data[0]=this.data[this.data.length-1],this.data.splice(this.data.length-1,1),this.data.length>0&&this.siftDown(0),t}},t.prototype.contains=function(t){var e=i.compareToEquals(this.compare);return r.contains(this.data,t,e)},t.prototype.size=function(){return this.data.length},t.prototype.isEmpty=function(){return this.data.length<=0},t.prototype.clear=function(){this.data.length=0},t.prototype.forEach=function(t){r.forEach(this.data,t)},t}();n.default=o},{"./arrays":15,"./util":16}],7:[function(t,e,n){"use strict";var i,r=this&&this.__extends||(i=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)e.hasOwnProperty(n)&&(t[n]=e[n])},function(t,e){function n(){this.constructor=t}i(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)});Object.defineProperty(n,"__esModule",{value:!0});var o=t("./Dictionary"),s=t("./util"),u=function(){function t(t,e){this.key=t,this.value=e}return t.prototype.unlink=function(){this.prev.next=this.next,this.next.prev=this.prev},t}(),a=function(){function t(){this.key=null,this.value=null}return t.prototype.unlink=function(){this.prev.next=this.next,this.next.prev=this.prev},t}();var h=function(t){function e(e){var n=t.call(this,e)||this;return n.head=new a,n.tail=new a,n.head.next=n.tail,n.tail.prev=n.head,n}return r(e,t),e.prototype.appendToTail=function(t){var e=this.tail.prev;e.next=t,t.prev=e,t.next=this.tail,this.tail.prev=t},e.prototype.getLinkedDictionaryPair=function(t){if(!s.isUndefined(t)){var e="$"+this.toStr(t);return this.table[e]}},e.prototype.getValue=function(t){var e=this.getLinkedDictionaryPair(t);if(!s.isUndefined(e))return e.value},e.prototype.remove=function(e){var n=this.getLinkedDictionaryPair(e);if(!s.isUndefined(n))return t.prototype.remove.call(this,e),n.unlink(),n.value},e.prototype.clear=function(){t.prototype.clear.call(this),this.head.next=this.tail,this.tail.prev=this.head},e.prototype.replace=function(t,e){var n="$"+this.toStr(e.key);e.next=t.next,e.prev=t.prev,this.remove(t.key),e.prev.next=e,e.next.prev=e,this.table[n]=e,++this.nElements},e.prototype.setValue=function(t,e){if(!s.isUndefined(t)&&!s.isUndefined(e)){var n=this.getLinkedDictionaryPair(t),i=new u(t,e),r="$"+this.toStr(t);return s.isUndefined(n)?(this.appendToTail(i),this.table[r]=i,void++this.nElements):(this.replace(n,i),n.value)}},e.prototype.keys=function(){var t=[];return this.forEach(function(e,n){t.push(e)}),t},e.prototype.values=function(){var t=[];return this.forEach(function(e,n){t.push(n)}),t},e.prototype.forEach=function(t){for(var e=this.head.next;null!==e.next;){if(!1===t(e.key,e.value))return;e=e.next}},e}(o.default);n.default=h},{"./Dictionary":4,"./util":16}],8:[function(t,e,n){"use strict";Object.defineProperty(n,"__esModule",{value:!0});var i=t("./util"),r=t("./arrays"),o=function(){function t(){this.firstNode=null,this.lastNode=null,this.nElements=0}return t.prototype.add=function(t,e){if(i.isUndefined(e)&&(e=this.nElements),e<0||e>this.nElements||i.isUndefined(t))return!1;var n=this.createNode(t);if(0===this.nElements||null===this.lastNode)this.firstNode=n,this.lastNode=n;else if(e===this.nElements)this.lastNode.next=n,this.lastNode=n;else if(0===e)n.next=this.firstNode,this.firstNode=n;else{var r=this.nodeAtIndex(e-1);if(null==r)return!1;n.next=r.next,r.next=n}return this.nElements++,!0},t.prototype.first=function(){if(null!==this.firstNode)return this.firstNode.element},t.prototype.last=function(){if(null!==this.lastNode)return this.lastNode.element},t.prototype.elementAtIndex=function(t){var e=this.nodeAtIndex(t);if(null!==e)return e.element},t.prototype.indexOf=function(t,e){var n=e||i.defaultEquals;if(i.isUndefined(t))return-1;for(var r=this.firstNode,o=0;null!==r;){if(n(r.element,t))return o;o++,r=r.next}return-1},t.prototype.contains=function(t,e){return this.indexOf(t,e)>=0},t.prototype.remove=function(t,e){var n=e||i.defaultEquals;if(this.nElements<1||i.isUndefined(t))return!1;for(var r=null,o=this.firstNode;null!==o;){if(n(o.element,t))return null==r?(this.firstNode=o.next,o===this.lastNode&&(this.lastNode=null)):o===this.lastNode?(this.lastNode=r,r.next=o.next,o.next=null):(r.next=o.next,o.next=null),this.nElements--,!0;r=o,o=o.next}return!1},t.prototype.clear=function(){this.firstNode=null,this.lastNode=null,this.nElements=0},t.prototype.equals=function(e,n){var r=n||i.defaultEquals;return e instanceof t&&(this.size()===e.size()&&this.equalsAux(this.firstNode,e.firstNode,r))},t.prototype.equalsAux=function(t,e,n){for(;null!==t&&null!==e;){if(!n(t.element,e.element))return!1;t=t.next,e=e.next}return!0},t.prototype.removeElementAtIndex=function(t){if(!(t<0||t>=this.nElements||null===this.firstNode||null===this.lastNode)){var e;if(1===this.nElements)e=this.firstNode.element,this.firstNode=null,this.lastNode=null;else{var n=this.nodeAtIndex(t-1);null===n?(e=this.firstNode.element,this.firstNode=this.firstNode.next):n.next===this.lastNode&&(e=this.lastNode.element,this.lastNode=n),null!==n&&null!==n.next&&(e=n.next.element,n.next=n.next.next)}return this.nElements--,e}},t.prototype.forEach=function(t){for(var e=this.firstNode;null!==e&&!1!==t(e.element);)e=e.next},t.prototype.reverse=function(){for(var t=null,e=this.firstNode,n=null;null!==e;)n=e.next,e.next=t,t=e,e=n;n=this.firstNode,this.firstNode=this.lastNode,this.lastNode=n},t.prototype.toArray=function(){for(var t=[],e=this.firstNode;null!==e;)t.push(e.element),e=e.next;return t},t.prototype.size=function(){return this.nElements},t.prototype.isEmpty=function(){return this.nElements<=0},t.prototype.toString=function(){return r.toString(this.toArray())},t.prototype.nodeAtIndex=function(t){if(t<0||t>=this.nElements)return null;if(t===this.nElements-1)return this.lastNode;for(var e=this.firstNode,n=0;n-1&&this.insertIdIntoRoot(e,n),this.nodes)if(this.nodes.hasOwnProperty(i)){var r=this.findNodeId(i,t);r>-1&&this.insertIdIntoNode(i,e,r)}},t.prototype.insertIdAfterId=function(t,e){var n=this.findRootId(t);for(var i in n>-1&&this.insertIdIntoRoot(e,n+1),this.nodes)if(this.nodes.hasOwnProperty(i)){var r=this.findNodeId(i,t);r>-1&&this.insertIdIntoNode(i,e,r+1)}},t.prototype.insertIdIntoId=function(t,e){this.nodeInsertAtEnd(t,e),this.nodes[e]=[]},t.prototype.insertIdIntoRoot=function(t,e){if(void 0===e)this.rootInsertAtEnd(t);else if(e<0){var n=this.rootIds.length;this.rootIds.splice(e+n+1,0,t)}else this.rootIds.splice(e,0,t);this.nodes[t]=this.nodes[t]||[]},t.prototype.insertIdIntoNode=function(t,e,n){if(this.nodes[t]=this.nodes[t]||[],this.nodes[e]=this.nodes[e]||[],void 0===n)this.nodeInsertAtEnd(t,e);else if(n<0){var i=this.nodes[t].length;this.nodes[t].splice(n+i+1,0,e)}else this.nodes[t].splice(n,0,e)},t.prototype.moveId=function(t,e,n){var r=t,o=this.findRootId(r);for(var s in this.nodes[e]&&e,this.nodes)if(this.nodes.hasOwnProperty(s)){this.findNodeId(s,e);break}var u=e,a=this.findRootId(u);for(var s in this.nodes[e]&&e,this.nodes)if(this.nodes.hasOwnProperty(s)){this.findNodeId(s,e);break}if(o>-1)if(a>-1)switch(this.rootDelete(o),a>o&&a--,n){case i.BEFORE:this.insertIdIntoRoot(r,a);break;case i.AFTER:this.insertIdIntoRoot(r,a+1);break;case i.INSIDE_AT_START:this.nodeInsertAtStart(u,r);break;case i.INSIDE_AT_END:this.nodeInsertAtEnd(u,r)}else for(var s in this.rootDelete(o),this.nodes){if(this.nodes.hasOwnProperty(s))if((h=this.findNodeId(s,u))>-1){switch(n){case i.BEFORE:this.insertIdIntoNode(s,r,h);break;case i.AFTER:this.insertIdIntoNode(s,r,h+1);break;case i.INSIDE_AT_START:this.nodeInsertAtStart(u,r);break;case i.INSIDE_AT_END:this.nodeInsertAtEnd(u,r)}break}}else if(a>-1){for(var s in this.nodes){if(this.nodes.hasOwnProperty(s))if((h=this.findNodeId(s,r))>-1){this.nodeDeleteAtIndex(s,h);break}}switch(n){case i.BEFORE:this.insertIdIntoRoot(r,a);break;case i.AFTER:this.insertIdIntoRoot(r,a+1);break;case i.INSIDE_AT_START:this.nodeInsertAtStart(u,r);break;case i.INSIDE_AT_END:this.nodeInsertAtEnd(u,r)}}else{for(var s in this.nodes){if(this.nodes.hasOwnProperty(s))if((h=this.findNodeId(s,r))>-1){this.nodeDeleteAtIndex(s,h);break}}for(var s in this.nodes){var h;if(this.nodes.hasOwnProperty(s))if((h=this.findNodeId(s,u))>-1){switch(n){case i.BEFORE:this.insertIdIntoNode(s,r,h);break;case i.AFTER:this.insertIdIntoNode(s,r,h+1);break;case i.INSIDE_AT_START:this.nodeInsertAtStart(u,r);break;case i.INSIDE_AT_END:this.nodeInsertAtEnd(u,r)}break}}}},t.prototype.swapArrayElements=function(t,e,n){var i=t[e];return t[e]=t[n],t[n]=i,t},t.prototype.rootDeleteId=function(t){var e=this.findRootId(t);e>-1&&this.rootDelete(e)},t.prototype.nodeAndSubNodesDelete=function(t){for(var e=[],n=0;nt.size())return!1;var e=!0;return this.forEach(function(n){return!!t.contains(n)||(e=!1,!1)}),e},t.prototype.remove=function(t){return!!this.contains(t)&&(this.dictionary.remove(t),!0)},t.prototype.forEach=function(t){this.dictionary.forEach(function(e,n){return t(n)})},t.prototype.toArray=function(){return this.dictionary.values()},t.prototype.isEmpty=function(){return this.dictionary.isEmpty()},t.prototype.size=function(){return this.dictionary.size()},t.prototype.clear=function(){this.dictionary.clear()},t.prototype.toString=function(){return r.toString(this.toArray())},t}();n.default=s},{"./Dictionary":4,"./arrays":15,"./util":16}],14:[function(t,e,n){"use strict";Object.defineProperty(n,"__esModule",{value:!0});var i=t("./LinkedList"),r=function(){function t(){this.list=new i.default}return t.prototype.push=function(t){return this.list.add(t,0)},t.prototype.add=function(t){return this.list.add(t,0)},t.prototype.pop=function(){return this.list.removeElementAtIndex(0)},t.prototype.peek=function(){return this.list.first()},t.prototype.size=function(){return this.list.size()},t.prototype.contains=function(t,e){return this.list.contains(t,e)},t.prototype.isEmpty=function(){return this.list.isEmpty()},t.prototype.clear=function(){this.list.clear()},t.prototype.forEach=function(t){this.list.forEach(t)},t}();n.default=r},{"./LinkedList":8}],15:[function(t,e,n){"use strict";Object.defineProperty(n,"__esModule",{value:!0});var i=t("./util");function r(t,e,n){for(var r=n||i.defaultEquals,o=t.length,s=0;s=0;o--)if(r(t[o],e))return o;return-1},n.contains=function(t,e,n){return r(t,e,n)>=0},n.remove=function(t,e,n){var i=r(t,e,n);return!(i<0||(t.splice(i,1),0))},n.frequency=function(t,e,n){for(var r=n||i.defaultEquals,o=t.length,s=0,u=0;u=t.length||n<0||n>=t.length)return!1;var i=t[e];return t[e]=t[n],t[n]=i,!0},n.toString=function(t){return"["+t.toString()+"]"},n.forEach=function(t,e){for(var n=0,i=t;n any; +/** +* Function signature for comparing +* <0 means a is smaller +* = 0 means they are equal +* >0 means a is larger +*/ +export interface ICompareFunction { + (a: T, b: T): number; +} +/** +* Function signature for checking equality +*/ +export interface IEqualsFunction { + (a: T, b: T): boolean; +} +/** +* Function signature for Iterations. Return false to break from loop +*/ +export interface ILoopFunction { + (a: T): boolean | void; +} +/** + * Default function to compare element order. + * @function + */ +export declare function defaultCompare(a: T, b: T): number; +/** + * Default function to test equality. + * @function + */ +export declare function defaultEquals(a: T, b: T): boolean; +/** + * Default function to convert an object to a string. + * @function + */ +export declare function defaultToString(item: any): string; +/** +* Joins all the properies of the object using the provided join string +*/ +export declare function makeString(item: T, join?: string): string; +/** + * Checks if the given argument is a function. + * @function + */ +export declare function isFunction(func: any): boolean; +/** + * Checks if the given argument is undefined. + * @function + */ +export declare function isUndefined(obj: any): obj is undefined; +/** + * Checks if the given argument is a string. + * @function + */ +export declare function isString(obj: any): boolean; +/** + * Reverses a compare function. + * @function + */ +export declare function reverseCompareFunction(compareFunction?: ICompareFunction): ICompareFunction; +/** + * Returns an equal function given a compare function. + * @function + */ +export declare function compareToEquals(compareFunction: ICompareFunction): IEqualsFunction; diff --git a/node_modules/typescript-collections/dist/lib/util.js b/node_modules/typescript-collections/dist/lib/util.js new file mode 100644 index 00000000..ecbaa098 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/util.js @@ -0,0 +1,141 @@ +"use strict"; +Object.defineProperty(exports, "__esModule", { value: true }); +var _hasOwnProperty = Object.prototype.hasOwnProperty; +exports.has = function (obj, prop) { + return _hasOwnProperty.call(obj, prop); +}; +/** + * Default function to compare element order. + * @function + */ +function defaultCompare(a, b) { + if (a < b) { + return -1; + } + else if (a === b) { + return 0; + } + else { + return 1; + } +} +exports.defaultCompare = defaultCompare; +/** + * Default function to test equality. + * @function + */ +function defaultEquals(a, b) { + return a === b; +} +exports.defaultEquals = defaultEquals; +/** + * Default function to convert an object to a string. + * @function + */ +function defaultToString(item) { + if (item === null) { + return 'COLLECTION_NULL'; + } + else if (isUndefined(item)) { + return 'COLLECTION_UNDEFINED'; + } + else if (isString(item)) { + return '$s' + item; + } + else { + return '$o' + item.toString(); + } +} +exports.defaultToString = defaultToString; +/** +* Joins all the properies of the object using the provided join string +*/ +function makeString(item, join) { + if (join === void 0) { join = ','; } + if (item === null) { + return 'COLLECTION_NULL'; + } + else if (isUndefined(item)) { + return 'COLLECTION_UNDEFINED'; + } + else if (isString(item)) { + return item.toString(); + } + else { + var toret = '{'; + var first = true; + for (var prop in item) { + if (exports.has(item, prop)) { + if (first) { + first = false; + } + else { + toret = toret + join; + } + toret = toret + prop + ':' + item[prop]; + } + } + return toret + '}'; + } +} +exports.makeString = makeString; +/** + * Checks if the given argument is a function. + * @function + */ +function isFunction(func) { + return (typeof func) === 'function'; +} +exports.isFunction = isFunction; +/** + * Checks if the given argument is undefined. + * @function + */ +function isUndefined(obj) { + return (typeof obj) === 'undefined'; +} +exports.isUndefined = isUndefined; +/** + * Checks if the given argument is a string. + * @function + */ +function isString(obj) { + return Object.prototype.toString.call(obj) === '[object String]'; +} +exports.isString = isString; +/** + * Reverses a compare function. + * @function + */ +function reverseCompareFunction(compareFunction) { + if (isUndefined(compareFunction) || !isFunction(compareFunction)) { + return function (a, b) { + if (a < b) { + return 1; + } + else if (a === b) { + return 0; + } + else { + return -1; + } + }; + } + else { + return function (d, v) { + return compareFunction(d, v) * -1; + }; + } +} +exports.reverseCompareFunction = reverseCompareFunction; +/** + * Returns an equal function given a compare function. + * @function + */ +function compareToEquals(compareFunction) { + return function (a, b) { + return compareFunction(a, b) === 0; + }; +} +exports.compareToEquals = compareToEquals; +//# sourceMappingURL=util.js.map \ No newline at end of file diff --git a/node_modules/typescript-collections/dist/lib/util.js.map b/node_modules/typescript-collections/dist/lib/util.js.map new file mode 100644 index 00000000..a02b7b52 --- /dev/null +++ b/node_modules/typescript-collections/dist/lib/util.js.map @@ -0,0 +1 @@ +{"version":3,"file":"util.js","sourceRoot":"","sources":["../../src/lib/util.ts"],"names":[],"mappings":";;AAAA,IAAM,eAAe,GAAG,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC;AAC3C,QAAA,GAAG,GAAG,UAAS,GAAQ,EAAE,IAAS;IAC3C,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;AAC3C,CAAC,CAAC;AA0BF;;;GAGG;AACH,wBAAkC,CAAI,EAAE,CAAI;IACxC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACR,MAAM,CAAC,CAAC,CAAC,CAAC;IACd,CAAC;IAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,CAAC,CAAC;IACb,CAAC;IAAC,IAAI,CAAC,CAAC;QACJ,MAAM,CAAC,CAAC,CAAC;IACb,CAAC;AACL,CAAC;AARD,wCAQC;AAED;;;GAGG;AACH,uBAAiC,CAAI,EAAE,CAAI;IACvC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC;AACnB,CAAC;AAFD,sCAEC;AAED;;;GAGG;AACH,yBAAgC,IAAS;IACrC,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC;QAChB,MAAM,CAAC,iBAAiB,CAAC;IAC7B,CAAC;IAAC,IAAI,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,CAAC,sBAAsB,CAAC;IAClC,CAAC;IAAC,IAAI,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC;IACvB,CAAC;IAAC,IAAI,CAAC,CAAC;QACJ,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;IAClC,CAAC;AACL,CAAC;AAVD,0CAUC;AAED;;EAEE;AACF,oBAA8B,IAAO,EAAE,IAAkB;IAAlB,qBAAA,EAAA,UAAkB;IACrD,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC;QAChB,MAAM,CAAC,iBAAiB,CAAC;IAC7B,CAAC;IAAC,IAAI,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,CAAC,sBAAsB,CAAC;IAClC,CAAC;IAAC,IAAI,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;IAC3B,CAAC;IAAC,IAAI,CAAC,CAAC;QACJ,IAAI,KAAK,GAAG,GAAG,CAAC;QAChB,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,GAAG,CAAC,CAAC,IAAM,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC;YACtB,EAAE,CAAC,CAAC,WAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;gBAClB,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;oBACR,KAAK,GAAG,KAAK,CAAC;gBAClB,CAAC;gBAAC,IAAI,CAAC,CAAC;oBACJ,KAAK,GAAG,KAAK,GAAG,IAAI,CAAC;gBACzB,CAAC;gBACD,KAAK,GAAG,KAAK,GAAG,IAAI,GAAG,GAAG,GAAS,IAAK,CAAC,IAAI,CAAC,CAAC;YACnD,CAAC;QACL,CAAC;QACD,MAAM,CAAC,KAAK,GAAG,GAAG,CAAC;IACvB,CAAC;AACL,CAAC;AAtBD,gCAsBC;AAED;;;GAGG;AACH,oBAA2B,IAAS;IAChC,MAAM,CAAC,CAAC,OAAO,IAAI,CAAC,KAAK,UAAU,CAAC;AACxC,CAAC;AAFD,gCAEC;AAED;;;GAGG;AACH,qBAA4B,GAAQ;IAChC,MAAM,CAAC,CAAC,OAAO,GAAG,CAAC,KAAK,WAAW,CAAC;AACxC,CAAC;AAFD,kCAEC;AAED;;;GAGG;AACH,kBAAyB,GAAQ;IAC7B,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,iBAAiB,CAAC;AACrE,CAAC;AAFD,4BAEC;AAED;;;GAGG;AACH,gCAA0C,eAAqC;IAC3E,EAAE,CAAC,CAAC,WAAW,CAAC,eAAe,CAAC,IAAI,CAAC,UAAU,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC/D,MAAM,CAAC,UAAS,CAAC,EAAE,CAAC;YAChB,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACR,MAAM,CAAC,CAAC,CAAC;YACb,CAAC;YAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACjB,MAAM,CAAC,CAAC,CAAC;YACb,CAAC;YAAC,IAAI,CAAC,CAAC;gBACJ,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,CAAC;QACL,CAAC,CAAC;IACN,CAAC;IAAC,IAAI,CAAC,CAAC;QACJ,MAAM,CAAC,UAAS,CAAI,EAAE,CAAI;YACtB,MAAM,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,CAAC,CAAC;IACN,CAAC;AACL,CAAC;AAhBD,wDAgBC;AAED;;;GAGG;AACH,yBAAmC,eAAoC;IACnE,MAAM,CAAC,UAAS,CAAI,EAAE,CAAI;QACtB,MAAM,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IACvC,CAAC,CAAC;AACN,CAAC;AAJD,0CAIC"} \ No newline at end of file diff --git a/node_modules/typescript-collections/package.json b/node_modules/typescript-collections/package.json new file mode 100644 index 00000000..d7fa3de9 --- /dev/null +++ b/node_modules/typescript-collections/package.json @@ -0,0 +1,123 @@ +{ + "_from": "typescript-collections", + "_id": "typescript-collections@1.3.2", + "_inBundle": false, + "_integrity": "sha512-Frfvtwym0VebbueXWEJlVkGiWjKEFStsRwusuzjh8lX8OEJ9ZbFqpYLNfPvZcxw/+nqW0cRNBeBq6SVoTjymcQ==", + "_location": "/typescript-collections", + "_phantomChildren": {}, + "_requested": { + "type": "tag", + "registry": true, + "raw": "typescript-collections", + "name": "typescript-collections", + "escapedName": "typescript-collections", + "rawSpec": "", + "saveSpec": null, + "fetchSpec": "latest" + }, + "_requiredBy": [ + "#USER", + "/" + ], + "_resolved": "https://registry.npmjs.org/typescript-collections/-/typescript-collections-1.3.2.tgz", + "_shasum": "b2476373d2976eb3dc8be931292a20a30d23677d", + "_spec": "typescript-collections", + "_where": "/Users/frankierodriguez/Dev/CR-MacroLabs-TypeScript-Casino", + "author": { + "name": "Basarat Ali Syed", + "email": "bas@basarat.com", + "url": "http://basarat.com" + }, + "browser": "./dist/lib/index.js", + "bugs": { + "url": "https://github.com/basarat/typescript-collections/issues" + }, + "bundleDependencies": false, + "contributors": [ + { + "name": "Tomasz Ciborski", + "email": "episage", + "url": "http://ciborski.com" + } + ], + "deprecated": false, + "description": "A complete, fully tested data structure library written in TypeScript.", + "devDependencies": { + "@types/chai": "^4.0.4", + "@types/mocha": "^2.2.32", + "@types/node": "^8.0.28", + "@types/power-assert": "^1.4.29", + "@types/source-map-support": "^0.4.0", + "browserify": "^14.4.0", + "browserify-umdify": "^1.0.3", + "chai": "^4.1.2", + "glob": "^7.0.6", + "istanbul": "^0.4.5", + "jasmine": "^2.5.1", + "karma": "^1.3.0", + "karma-chrome-launcher": "^2.0.0", + "karma-firefox-launcher": "^1.0.0", + "karma-mocha": "^1.1.1", + "karma-mocha-reporter": "^2.1.0", + "mkdirp": "^0.5.1", + "mocha": "^3.5.3", + "power-assert": "^1.4.4", + "rimraf": "^2.5.4", + "source-map-support": "^0.4.2", + "tslint": "^5.7.0", + "typescript": "^2.5.2", + "uglify-js": "^3.3.9", + "util": "^0.10.3" + }, + "homepage": "https://github.com/basarat/typescript-collections", + "jsnext:main": "./dist/lib/index.js", + "keywords": [ + "typescript", + "generics", + "data", + "structures", + "collections", + "linked", + "list", + "dictionary", + "default", + "dictionary", + "multi", + "dictionary", + "binary", + "search", + "tree", + "key", + "value", + "stack", + "queue", + "set", + "bag", + "binary", + "heap", + "priority", + "queue", + "array" + ], + "license": "MIT", + "main": "./dist/lib/umd.js", + "name": "typescript-collections", + "repository": { + "type": "git", + "url": "git+https://github.com/basarat/typescript-collections.git" + }, + "scripts": { + "all": "npm run build && npm run test && npm run cover", + "build": "npm run clean && npm run lint && npm run tsc && npm run umd && npm run minify", + "clean": "rimraf ./dist", + "cover": "istanbul cover ./node_modules/mocha/bin/_mocha -- ./dist/test/*.js", + "lint": "tslint -c ./tslint.json ./src/**/*.ts", + "minify": "node minify-umd.js", + "publish_to_npm": "npm publish", + "test": "mocha ./dist/test/*Test.js", + "tsc": "tsc", + "umd": "node browserify-umd.js" + }, + "typings": "./dist/lib/index.d.ts", + "version": "1.3.2" +} diff --git a/package-lock.json b/package-lock.json new file mode 100644 index 00000000..67bf3ac3 --- /dev/null +++ b/package-lock.json @@ -0,0 +1,11 @@ +{ + "requires": true, + "lockfileVersion": 1, + "dependencies": { + "typescript-collections": { + "version": "1.3.2", + "resolved": "https://registry.npmjs.org/typescript-collections/-/typescript-collections-1.3.2.tgz", + "integrity": "sha512-Frfvtwym0VebbueXWEJlVkGiWjKEFStsRwusuzjh8lX8OEJ9ZbFqpYLNfPvZcxw/+nqW0cRNBeBq6SVoTjymcQ==" + } + } +} diff --git a/tsconfig.json b/tsconfig.json new file mode 100644 index 00000000..104297f3 --- /dev/null +++ b/tsconfig.json @@ -0,0 +1,64 @@ +{ + "compilerOptions": { + /* Basic Options */ + "target": "es5", /* Specify ECMAScript target version: 'ES3' (default), 'ES5', 'ES2015', 'ES2016', 'ES2017','ES2018' or 'ESNEXT'. */ + "module": "commonjs", /* Specify module code generation: 'none', 'commonjs', 'amd', 'system', 'umd', 'es2015', or 'ESNext'. */ + // "lib": [], /* Specify library files to be included in the compilation. */ + // "allowJs": true, /* Allow javascript files to be compiled. */ + // "checkJs": true, /* Report errors in .js files. */ + // "jsx": "preserve", /* Specify JSX code generation: 'preserve', 'react-native', or 'react'. */ + // "declaration": true, /* Generates corresponding '.d.ts' file. */ + // "sourceMap": true, /* Generates corresponding '.map' file. */ + // "outFile": "./", /* Concatenate and emit output to single file. */ + // "outDir": "./", /* Redirect output structure to the directory. */ + // "rootDir": "./", /* Specify the root directory of input files. Use to control the output directory structure with --outDir. */ + // "removeComments": true, /* Do not emit comments to output. */ + // "noEmit": true, /* Do not emit outputs. */ + // "importHelpers": true, /* Import emit helpers from 'tslib'. */ + // "downlevelIteration": true, /* Provide full support for iterables in 'for-of', spread, and destructuring when targeting 'ES5' or 'ES3'. */ + // "isolatedModules": true, /* Transpile each file as a separate module (similar to 'ts.transpileModule'). */ + + /* Strict Type-Checking Options */ + "strict": true, /* Enable all strict type-checking options. */ + //"noImplicitAny": false, /* Raise error on expressions and declarations with an implied 'any' type. */ + // "strictNullChecks": true, /* Enable strict null checks. */ + // "strictFunctionTypes": true, /* Enable strict checking of function types. */ + // "strictPropertyInitialization": true, /* Enable strict checking of property initialization in classes. */ + // "noImplicitThis": true, /* Raise error on 'this' expressions with an implied 'any' type. */ + // "alwaysStrict": true, /* Parse in strict mode and emit "use strict" for each source file. */ + + /* Additional Checks */ + // "noUnusedLocals": true, /* Report errors on unused locals. */ + // "noUnusedParameters": true, /* Report errors on unused parameters. */ + // "noImplicitReturns": true, /* Report error when not all code paths in function return a value. */ + // "noFallthroughCasesInSwitch": true, /* Report errors for fallthrough cases in switch statement. */ + + /* Module Resolution Options */ + // "moduleResolution": "node", /* Specify module resolution strategy: 'node' (Node.js) or 'classic' (TypeScript pre-1.6). */ + // "baseUrl": "./", /* Base directory to resolve non-absolute module names. */ + // "paths": {}, /* A series of entries which re-map imports to lookup locations relative to the 'baseUrl'. */ + // "rootDirs": [], /* List of root folders whose combined content represents the structure of the project at runtime. */ + //"typeRoots": ["/app"], /* List of folders to include type definitions from. */ + // "types": [], /* Type declaration files to be included in compilation. */ + // "allowSyntheticDefaultImports": true, /* Allow default imports from modules with no default export. This does not affect code emit, just typechecking. */ + "esModuleInterop": true , /* Enables emit interoperability between CommonJS and ES Modules via creation of namespace objects for all imports. Implies 'allowSyntheticDefaultImports'. */ + // "preserveSymlinks": true, /* Do not resolve the real path of symlinks. */ + "watch": true, + /* Source Map Options */ + "sourceRoot": "./app", /* Specify the location where debugger should locate TypeScript files instead of source locations. */ + // "mapRoot": "./", /* Specify the location where debugger should locate map files instead of generated locations. */ + // "inlineSourceMap": true, /* Emit a single file with source maps instead of having a separate file. */ + // "inlineSources": true, /* Emit the source alongside the sourcemaps within a single file; requires '--inlineSourceMap' or '--sourceMap' to be set. */ + + /* Experimental Options */ + // "experimentalDecorators": true, /* Enables experimental support for ES7 decorators. */ + // "emitDecoratorMetadata": true, /* Enables experimental support for emitting type metadata for decorators. */ + "outDir": "js" + }, + "files": [ + "app.ts", "Profile.ts", "BlackJack.ts", "Card.ts", + "CardGame.ts", "Deck.ts", "Gamble.ts", "GameEngine.ts", + "GameEngineInterface.ts", "GameInterface.ts", "GameType.ts", "GameTypePlayer.ts", + "Player.ts", "PlayerInterface.ts", + ] +} \ No newline at end of file