@raikuxq/alg-ds 1.1.6 → 1.1.7
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/lib/algorithms/binary-search.d.ts +5 -0
- package/lib/algorithms/binary-search.js +27 -0
- package/lib/algorithms/factorial.d.ts +9 -0
- package/lib/algorithms/factorial.js +17 -0
- package/lib/algorithms/fibonacci.d.ts +9 -0
- package/lib/algorithms/fibonacci.js +17 -0
- package/lib/algorithms/memoize.d.ts +5 -0
- package/lib/algorithms/memoize.js +22 -0
- package/lib/algorithms/sorts/bubble-sort.d.ts +9 -0
- package/lib/algorithms/sorts/bubble-sort.js +23 -0
- package/lib/algorithms/sorts/insertion-sort.d.ts +9 -0
- package/lib/algorithms/sorts/insertion-sort.js +25 -0
- package/lib/algorithms/sorts/merge-sort.d.ts +9 -0
- package/lib/algorithms/sorts/merge-sort.js +61 -0
- package/lib/algorithms/sorts/quick-sort.d.ts +9 -0
- package/lib/algorithms/sorts/quick-sort.js +45 -0
- package/lib/algorithms/sorts/select-sort.d.ts +9 -0
- package/lib/algorithms/sorts/select-sort.js +20 -0
- package/lib/algorithms/transpose-matrix.d.ts +5 -0
- package/lib/algorithms/transpose-matrix.js +18 -0
- package/lib/constants.d.ts +2 -0
- package/lib/constants.js +6 -0
- package/lib/data-structures/BinaryTree/AbstractBinaryTree/AbstractBinaryNode.d.ts +15 -0
- package/lib/data-structures/BinaryTree/AbstractBinaryTree/AbstractBinaryNode.js +53 -0
- package/lib/data-structures/BinaryTree/AbstractBinaryTree/AbstractBinaryTree.d.ts +60 -0
- package/lib/data-structures/BinaryTree/AbstractBinaryTree/AbstractBinaryTree.js +36 -0
- package/lib/data-structures/BinaryTree/BinarySearchTree/BinarySearchNode.d.ts +13 -0
- package/lib/data-structures/BinaryTree/BinarySearchTree/BinarySearchNode.js +59 -0
- package/lib/data-structures/BinaryTree/BinarySearchTree/BinarySearchTree.d.ts +70 -0
- package/lib/data-structures/BinaryTree/BinarySearchTree/BinarySearchTree.js +271 -0
- package/lib/data-structures/BinaryTree/RandBinarySearchTree/RandBinarySearchNode.d.ts +16 -0
- package/lib/data-structures/BinaryTree/RandBinarySearchTree/RandBinarySearchNode.js +70 -0
- package/lib/data-structures/BinaryTree/RandBinarySearchTree/RandBinarySearchTree.d.ts +57 -0
- package/lib/data-structures/BinaryTree/RandBinarySearchTree/RandBinarySearchTree.js +235 -0
- package/lib/data-structures/Graph/AbstractGraph.d.ts +84 -0
- package/lib/data-structures/Graph/AbstractGraph.js +143 -0
- package/lib/data-structures/Graph/DirectedGraph.d.ts +24 -0
- package/lib/data-structures/Graph/DirectedGraph.js +86 -0
- package/lib/data-structures/Graph/GraphEdge.d.ts +16 -0
- package/lib/data-structures/Graph/GraphEdge.js +43 -0
- package/lib/data-structures/Graph/UndirectedGraph.d.ts +28 -0
- package/lib/data-structures/Graph/UndirectedGraph.js +103 -0
- package/lib/data-structures/Graph/demo/generateRandomGraph.d.ts +4 -0
- package/lib/data-structures/Graph/demo/generateRandomGraph.js +66 -0
- package/lib/data-structures/Graph/iterator/AbstractGraphIterator.d.ts +35 -0
- package/lib/data-structures/Graph/iterator/AbstractGraphIterator.js +90 -0
- package/lib/data-structures/Graph/iterator/GraphIteratorBFS.d.ts +28 -0
- package/lib/data-structures/Graph/iterator/GraphIteratorBFS.js +70 -0
- package/lib/data-structures/Graph/iterator/GraphIteratorDFS.d.ts +28 -0
- package/lib/data-structures/Graph/iterator/GraphIteratorDFS.js +70 -0
- package/lib/data-structures/Graph/iterator/GraphIteratorDijkstra.d.ts +32 -0
- package/lib/data-structures/Graph/iterator/GraphIteratorDijkstra.js +99 -0
- package/lib/data-structures/Graph/presenter/presenterAdjacencyLists.d.ts +19 -0
- package/lib/data-structures/Graph/presenter/presenterAdjacencyLists.js +28 -0
- package/lib/data-structures/Graph/presenter/presenterAdjacencyMatrix.d.ts +32 -0
- package/lib/data-structures/Graph/presenter/presenterAdjacencyMatrix.js +48 -0
- package/lib/data-structures/Graph/searching/hasPath.d.ts +9 -0
- package/lib/data-structures/Graph/searching/hasPath.js +30 -0
- package/lib/data-structures/Graph/searching/shortestPath.d.ts +9 -0
- package/lib/data-structures/Graph/searching/shortestPath.js +30 -0
- package/lib/data-structures/Graph/strategy/BFSIterationStrategy.d.ts +6 -0
- package/lib/data-structures/Graph/strategy/BFSIterationStrategy.js +13 -0
- package/lib/data-structures/Graph/strategy/DFSIterationStrategy.d.ts +6 -0
- package/lib/data-structures/Graph/strategy/DFSIterationStrategy.js +13 -0
- package/lib/data-structures/Graph/strategy/DijkstraIterationStrategy.d.ts +6 -0
- package/lib/data-structures/Graph/strategy/DijkstraIterationStrategy.js +13 -0
- package/lib/data-structures/Graph/transposing/transposeDirectedGraph.d.ts +2 -0
- package/lib/data-structures/Graph/transposing/transposeDirectedGraph.js +14 -0
- package/lib/data-structures/HashTable/HashTable.d.ts +73 -0
- package/lib/data-structures/HashTable/HashTable.js +171 -0
- package/lib/data-structures/HashTable/HashTableNode.d.ts +11 -0
- package/lib/data-structures/HashTable/HashTableNode.js +39 -0
- package/lib/data-structures/LinkedList/AbstractLinkedList/AbstractLinkedList.d.ts +125 -0
- package/lib/data-structures/LinkedList/AbstractLinkedList/AbstractLinkedList.js +241 -0
- package/lib/data-structures/LinkedList/AbstractLinkedList/AbstractLinkedNode.d.ts +20 -0
- package/lib/data-structures/LinkedList/AbstractLinkedList/AbstractLinkedNode.js +41 -0
- package/lib/data-structures/LinkedList/DoubleLinkedList/DoubleLinkedList.d.ts +48 -0
- package/lib/data-structures/LinkedList/DoubleLinkedList/DoubleLinkedList.js +151 -0
- package/lib/data-structures/LinkedList/DoubleLinkedList/DoubleLinkedNode.d.ts +25 -0
- package/lib/data-structures/LinkedList/DoubleLinkedList/DoubleLinkedNode.js +65 -0
- package/lib/data-structures/LinkedList/SingleLinkedList/SingleLinkedList.d.ts +52 -0
- package/lib/data-structures/LinkedList/SingleLinkedList/SingleLinkedList.js +138 -0
- package/lib/data-structures/LinkedList/SingleLinkedList/SingleLinkedNode.d.ts +7 -0
- package/lib/data-structures/LinkedList/SingleLinkedList/SingleLinkedNode.js +29 -0
- package/lib/data-structures/LoopedArray/LoopedArray.d.ts +83 -0
- package/lib/data-structures/LoopedArray/LoopedArray.js +169 -0
- package/lib/data-structures/Queue/Queue.d.ts +50 -0
- package/lib/data-structures/Queue/Queue.js +85 -0
- package/lib/data-structures/Stack/Stack.d.ts +50 -0
- package/lib/data-structures/Stack/Stack.js +85 -0
- package/lib/exceptions/IllegalCapacityException.d.ts +4 -0
- package/lib/exceptions/IllegalCapacityException.js +28 -0
- package/lib/exceptions/IndexOutOfBoundsException.d.ts +4 -0
- package/lib/exceptions/IndexOutOfBoundsException.js +28 -0
- package/lib/exceptions/IsAlreadyExistsException.d.ts +4 -0
- package/lib/exceptions/IsAlreadyExistsException.js +28 -0
- package/lib/exceptions/IsEmptyException.d.ts +4 -0
- package/lib/exceptions/IsEmptyException.js +28 -0
- package/lib/exceptions/IsFullException.d.ts +4 -0
- package/lib/exceptions/IsFullException.js +28 -0
- package/lib/exceptions/IsNotFoundException.d.ts +4 -0
- package/lib/exceptions/IsNotFoundException.js +28 -0
- package/lib/exceptions/base/IllegalArgumentException.d.ts +3 -0
- package/lib/exceptions/base/IllegalArgumentException.js +27 -0
- package/lib/exceptions/base/IllegalStateException.d.ts +3 -0
- package/lib/exceptions/base/IllegalStateException.js +27 -0
- package/lib/exports/algorithms.d.ts +16 -0
- package/lib/exports/algorithms.js +36 -0
- package/lib/exports/constants.d.ts +2 -0
- package/lib/exports/constants.js +7 -0
- package/lib/exports/data-structures.d.ts +11 -0
- package/lib/exports/data-structures.js +24 -0
- package/lib/exports/helpers.d.ts +6 -0
- package/lib/exports/helpers.js +14 -0
- package/lib/exports/sorts.d.ts +6 -0
- package/lib/exports/sorts.js +14 -0
- package/lib/exports/utils.d.ts +3 -0
- package/lib/exports/utils.js +14 -0
- package/lib/exports.d.ts +52 -0
- package/lib/exports.js +103 -0
- package/lib/helpers/createBinaryTree.d.ts +6 -0
- package/lib/helpers/createBinaryTree.js +22 -0
- package/lib/helpers/createGraph.d.ts +6 -0
- package/lib/helpers/createGraph.js +24 -0
- package/lib/helpers/createGraphFromMatrix.d.ts +7 -0
- package/lib/helpers/createGraphFromMatrix.js +42 -0
- package/lib/helpers/createLinkedList.d.ts +3 -0
- package/lib/helpers/createLinkedList.js +21 -0
- package/lib/index.d.ts +3 -0
- package/lib/index.js +6 -0
- package/lib/types/ArrayMatrix.d.ts +1 -0
- package/lib/types/ArrayMatrix.js +3 -0
- package/lib/types/EnumBinarySearchTreeType.d.ts +4 -0
- package/lib/types/EnumBinarySearchTreeType.js +9 -0
- package/lib/types/EnumGraphType.d.ts +4 -0
- package/lib/types/EnumGraphType.js +9 -0
- package/lib/types/EnumLinkedListType.d.ts +4 -0
- package/lib/types/EnumLinkedListType.js +9 -0
- package/lib/types/EnumRandomGenerationFormat.d.ts +4 -0
- package/lib/types/EnumRandomGenerationFormat.js +9 -0
- package/lib/types/EnumTreeTraversalType.d.ts +5 -0
- package/lib/types/EnumTreeTraversalType.js +10 -0
- package/lib/types/FnCompareTwo.d.ts +1 -0
- package/lib/types/FnCompareTwo.js +3 -0
- package/lib/types/FnToMemoize.d.ts +1 -0
- package/lib/types/FnToMemoize.js +3 -0
- package/lib/types/IArrayFacade.d.ts +4 -0
- package/lib/types/IArrayFacade.js +3 -0
- package/lib/types/IBiDirectIterable.d.ts +5 -0
- package/lib/types/IBiDirectIterable.js +3 -0
- package/lib/types/IBiDirectIterator.d.ts +11 -0
- package/lib/types/IBiDirectIterator.js +3 -0
- package/lib/types/IBinaryTree.d.ts +12 -0
- package/lib/types/IBinaryTree.js +3 -0
- package/lib/types/IConvertableToArray.d.ts +4 -0
- package/lib/types/IConvertableToArray.js +3 -0
- package/lib/types/IGraph.d.ts +14 -0
- package/lib/types/IGraph.js +3 -0
- package/lib/types/IGraphIterationStrategy.d.ts +5 -0
- package/lib/types/IGraphIterationStrategy.js +3 -0
- package/lib/types/IGraphIterator.d.ts +11 -0
- package/lib/types/IGraphIterator.js +3 -0
- package/lib/types/IIterable.d.ts +4 -0
- package/lib/types/IIterable.js +3 -0
- package/lib/types/IIterator.d.ts +14 -0
- package/lib/types/IIterator.js +3 -0
- package/lib/types/IKeyValueStorage.d.ts +8 -0
- package/lib/types/IKeyValueStorage.js +3 -0
- package/lib/types/ILinearStorage.d.ts +11 -0
- package/lib/types/ILinearStorage.js +3 -0
- package/lib/types/ILinearStorageRA.d.ts +13 -0
- package/lib/types/ILinearStorageRA.js +3 -0
- package/lib/types/ILinkedList.d.ts +4 -0
- package/lib/types/ILinkedList.js +3 -0
- package/lib/utils.d.ts +33 -0
- package/lib/utils.js +108 -0
- package/package.json +1 -1
|
@@ -0,0 +1,85 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
var DoubleLinkedList_1 = require("../LinkedList/DoubleLinkedList/DoubleLinkedList");
|
|
4
|
+
var IsEmptyException_1 = require("../../exceptions/IsEmptyException");
|
|
5
|
+
var IsFullException_1 = require("../../exceptions/IsFullException");
|
|
6
|
+
/**
|
|
7
|
+
* FIFO data structure
|
|
8
|
+
*/
|
|
9
|
+
var Queue = /** @class */ (function () {
|
|
10
|
+
/**
|
|
11
|
+
* Create a queue instance
|
|
12
|
+
*/
|
|
13
|
+
function Queue(capacity) {
|
|
14
|
+
this._list = new DoubleLinkedList_1.default(capacity);
|
|
15
|
+
}
|
|
16
|
+
/**
|
|
17
|
+
* Get first element in queue (without deleting)
|
|
18
|
+
* @throws when list is empty
|
|
19
|
+
*/
|
|
20
|
+
Queue.prototype.peek = function () {
|
|
21
|
+
if (this.isEmpty()) {
|
|
22
|
+
throw new IsEmptyException_1.default("Cannot peek when list is empty");
|
|
23
|
+
}
|
|
24
|
+
return this._list.peek();
|
|
25
|
+
};
|
|
26
|
+
/**
|
|
27
|
+
* Add element to queue
|
|
28
|
+
* @throws when list is full
|
|
29
|
+
*/
|
|
30
|
+
Queue.prototype.push = function (item) {
|
|
31
|
+
if (this._list.isFull()) {
|
|
32
|
+
throw new IsFullException_1.default("Cannot push when queue is full");
|
|
33
|
+
}
|
|
34
|
+
this._list.unshift(item);
|
|
35
|
+
};
|
|
36
|
+
/**
|
|
37
|
+
* Delete first element in queue
|
|
38
|
+
* @throws when list is empty
|
|
39
|
+
*/
|
|
40
|
+
Queue.prototype.pop = function () {
|
|
41
|
+
if (this.isEmpty()) {
|
|
42
|
+
throw new IsEmptyException_1.default("Cannot pop when list is empty");
|
|
43
|
+
}
|
|
44
|
+
return this._list.pop();
|
|
45
|
+
};
|
|
46
|
+
/**
|
|
47
|
+
* Check if element exists in list
|
|
48
|
+
*/
|
|
49
|
+
Queue.prototype.has = function (item) {
|
|
50
|
+
return this._list.has(item);
|
|
51
|
+
};
|
|
52
|
+
/**
|
|
53
|
+
* Is queue empty
|
|
54
|
+
*/
|
|
55
|
+
Queue.prototype.isEmpty = function () {
|
|
56
|
+
return this._list.isEmpty();
|
|
57
|
+
};
|
|
58
|
+
/**
|
|
59
|
+
* Is stack full
|
|
60
|
+
*/
|
|
61
|
+
Queue.prototype.isFull = function () {
|
|
62
|
+
return this._list.isFull();
|
|
63
|
+
};
|
|
64
|
+
/**
|
|
65
|
+
* Remove all elements in queue
|
|
66
|
+
*/
|
|
67
|
+
Queue.prototype.clear = function () {
|
|
68
|
+
this._list.clear();
|
|
69
|
+
};
|
|
70
|
+
/**
|
|
71
|
+
* Queue length
|
|
72
|
+
*/
|
|
73
|
+
Queue.prototype.length = function () {
|
|
74
|
+
return this._list.length();
|
|
75
|
+
};
|
|
76
|
+
/**
|
|
77
|
+
* Reverse queue
|
|
78
|
+
*/
|
|
79
|
+
Queue.prototype.reverse = function () {
|
|
80
|
+
this._list.reverse();
|
|
81
|
+
};
|
|
82
|
+
return Queue;
|
|
83
|
+
}());
|
|
84
|
+
exports.default = Queue;
|
|
85
|
+
//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiUXVldWUuanMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi8uLi9zcmMvZGF0YS1zdHJ1Y3R1cmVzL1F1ZXVlL1F1ZXVlLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiI7O0FBQUEsb0ZBQStFO0FBRy9FLHNFQUFpRTtBQUNqRSxvRUFBK0Q7QUFFL0Q7O0dBRUc7QUFDSDtJQUdFOztPQUVHO0lBQ0gsZUFBbUIsUUFBaUI7UUFDbEMsSUFBSSxDQUFDLEtBQUssR0FBRyxJQUFJLDBCQUFnQixDQUFJLFFBQVEsQ0FBQyxDQUFDO0lBQ2pELENBQUM7SUFFRDs7O09BR0c7SUFDSSxvQkFBSSxHQUFYO1FBQ0UsSUFBSSxJQUFJLENBQUMsT0FBTyxFQUFFLEVBQUU7WUFDbEIsTUFBTSxJQUFJLDBCQUFnQixDQUFDLGdDQUFnQyxDQUFDLENBQUM7U0FDOUQ7UUFDRCxPQUFPLElBQUksQ0FBQyxLQUFLLENBQUMsSUFBSSxFQUFFLENBQUM7SUFDM0IsQ0FBQztJQUVEOzs7T0FHRztJQUNJLG9CQUFJLEdBQVgsVUFBWSxJQUFPO1FBQ2pCLElBQUksSUFBSSxDQUFDLEtBQUssQ0FBQyxNQUFNLEVBQUUsRUFBRTtZQUN2QixNQUFNLElBQUkseUJBQWUsQ0FBQyxnQ0FBZ0MsQ0FBQyxDQUFDO1NBQzdEO1FBQ0QsSUFBSSxDQUFDLEtBQUssQ0FBQyxPQUFPLENBQUMsSUFBSSxDQUFDLENBQUM7SUFDM0IsQ0FBQztJQUVEOzs7T0FHRztJQUNJLG1CQUFHLEdBQVY7UUFDRSxJQUFJLElBQUksQ0FBQyxPQUFPLEVBQUUsRUFBRTtZQUNsQixNQUFNLElBQUksMEJBQWdCLENBQUMsK0JBQStCLENBQUMsQ0FBQztTQUM3RDtRQUNELE9BQU8sSUFBSSxDQUFDLEtBQUssQ0FBQyxHQUFHLEVBQUUsQ0FBQztJQUMxQixDQUFDO0lBRUQ7O09BRUc7SUFDSSxtQkFBRyxHQUFWLFVBQVcsSUFBTztRQUNoQixPQUFPLElBQUksQ0FBQyxLQUFLLENBQUMsR0FBRyxDQUFDLElBQUksQ0FBQyxDQUFDO0lBQzlCLENBQUM7SUFFRDs7T0FFRztJQUNJLHVCQUFPLEdBQWQ7UUFDRSxPQUFPLElBQUksQ0FBQyxLQUFLLENBQUMsT0FBTyxFQUFFLENBQUM7SUFDOUIsQ0FBQztJQUVEOztPQUVHO0lBQ0ksc0JBQU0sR0FBYjtRQUNFLE9BQU8sSUFBSSxDQUFDLEtBQUssQ0FBQyxNQUFNLEVBQUUsQ0FBQztJQUM3QixDQUFDO0lBRUQ7O09BRUc7SUFDSSxxQkFBSyxHQUFaO1FBQ0UsSUFBSSxDQUFDLEtBQUssQ0FBQyxLQUFLLEVBQUUsQ0FBQztJQUNyQixDQUFDO0lBRUQ7O09BRUc7SUFDSSxzQkFBTSxHQUFiO1FBQ0UsT0FBTyxJQUFJLENBQUMsS0FBSyxDQUFDLE1BQU0sRUFBRSxDQUFDO0lBQzdCLENBQUM7SUFFRDs7T0FFRztJQUNJLHVCQUFPLEdBQWQ7UUFDRSxJQUFJLENBQUMsS0FBSyxDQUFDLE9BQU8sRUFBRSxDQUFDO0lBQ3ZCLENBQUM7SUFDSCxZQUFDO0FBQUQsQ0FBQyxBQXBGRCxJQW9GQyJ9
|
|
@@ -0,0 +1,50 @@
|
|
|
1
|
+
import ILinearStorage from "../../types/ILinearStorage";
|
|
2
|
+
/**
|
|
3
|
+
* LIFO data structure
|
|
4
|
+
*/
|
|
5
|
+
export default class Stack<T> implements ILinearStorage<T> {
|
|
6
|
+
private readonly _list;
|
|
7
|
+
/**
|
|
8
|
+
* Create a stack instance
|
|
9
|
+
*/
|
|
10
|
+
constructor(capacity?: number);
|
|
11
|
+
/**
|
|
12
|
+
* Get stack top element
|
|
13
|
+
* @throws when list is empty
|
|
14
|
+
*/
|
|
15
|
+
peek(): T;
|
|
16
|
+
/**
|
|
17
|
+
* Add element to stack head
|
|
18
|
+
* @throws when list is full
|
|
19
|
+
*/
|
|
20
|
+
push(item: T): void;
|
|
21
|
+
/**
|
|
22
|
+
* Remove element from stack head
|
|
23
|
+
* @throws when list is empty
|
|
24
|
+
*/
|
|
25
|
+
pop(): T;
|
|
26
|
+
/**
|
|
27
|
+
* Check if element exists in list
|
|
28
|
+
*/
|
|
29
|
+
has(item: T): boolean;
|
|
30
|
+
/**
|
|
31
|
+
* Is stack empty
|
|
32
|
+
*/
|
|
33
|
+
isEmpty(): boolean;
|
|
34
|
+
/**
|
|
35
|
+
* Is stack full
|
|
36
|
+
*/
|
|
37
|
+
isFull(): boolean;
|
|
38
|
+
/**
|
|
39
|
+
* Remove all elements in stack
|
|
40
|
+
*/
|
|
41
|
+
clear(): void;
|
|
42
|
+
/**
|
|
43
|
+
* Queue length
|
|
44
|
+
*/
|
|
45
|
+
length(): number;
|
|
46
|
+
/**
|
|
47
|
+
* Reverse stack
|
|
48
|
+
*/
|
|
49
|
+
reverse(): void;
|
|
50
|
+
}
|
|
@@ -0,0 +1,85 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
var DoubleLinkedList_1 = require("../LinkedList/DoubleLinkedList/DoubleLinkedList");
|
|
4
|
+
var IsEmptyException_1 = require("../../exceptions/IsEmptyException");
|
|
5
|
+
var IsFullException_1 = require("../../exceptions/IsFullException");
|
|
6
|
+
/**
|
|
7
|
+
* LIFO data structure
|
|
8
|
+
*/
|
|
9
|
+
var Stack = /** @class */ (function () {
|
|
10
|
+
/**
|
|
11
|
+
* Create a stack instance
|
|
12
|
+
*/
|
|
13
|
+
function Stack(capacity) {
|
|
14
|
+
this._list = new DoubleLinkedList_1.default(capacity);
|
|
15
|
+
}
|
|
16
|
+
/**
|
|
17
|
+
* Get stack top element
|
|
18
|
+
* @throws when list is empty
|
|
19
|
+
*/
|
|
20
|
+
Stack.prototype.peek = function () {
|
|
21
|
+
if (this.isEmpty()) {
|
|
22
|
+
throw new IsEmptyException_1.default("Cannot peek when list is empty");
|
|
23
|
+
}
|
|
24
|
+
return this._list.peek();
|
|
25
|
+
};
|
|
26
|
+
/**
|
|
27
|
+
* Add element to stack head
|
|
28
|
+
* @throws when list is full
|
|
29
|
+
*/
|
|
30
|
+
Stack.prototype.push = function (item) {
|
|
31
|
+
if (this.isFull()) {
|
|
32
|
+
throw new IsFullException_1.default("Stack is full");
|
|
33
|
+
}
|
|
34
|
+
this._list.push(item);
|
|
35
|
+
};
|
|
36
|
+
/**
|
|
37
|
+
* Remove element from stack head
|
|
38
|
+
* @throws when list is empty
|
|
39
|
+
*/
|
|
40
|
+
Stack.prototype.pop = function () {
|
|
41
|
+
if (this.isEmpty()) {
|
|
42
|
+
throw new IsEmptyException_1.default("Cannot pop when stack is empty");
|
|
43
|
+
}
|
|
44
|
+
return this._list.pop();
|
|
45
|
+
};
|
|
46
|
+
/**
|
|
47
|
+
* Check if element exists in list
|
|
48
|
+
*/
|
|
49
|
+
Stack.prototype.has = function (item) {
|
|
50
|
+
return this._list.has(item);
|
|
51
|
+
};
|
|
52
|
+
/**
|
|
53
|
+
* Is stack empty
|
|
54
|
+
*/
|
|
55
|
+
Stack.prototype.isEmpty = function () {
|
|
56
|
+
return this._list.isEmpty();
|
|
57
|
+
};
|
|
58
|
+
/**
|
|
59
|
+
* Is stack full
|
|
60
|
+
*/
|
|
61
|
+
Stack.prototype.isFull = function () {
|
|
62
|
+
return this._list.isFull();
|
|
63
|
+
};
|
|
64
|
+
/**
|
|
65
|
+
* Remove all elements in stack
|
|
66
|
+
*/
|
|
67
|
+
Stack.prototype.clear = function () {
|
|
68
|
+
this._list.clear();
|
|
69
|
+
};
|
|
70
|
+
/**
|
|
71
|
+
* Queue length
|
|
72
|
+
*/
|
|
73
|
+
Stack.prototype.length = function () {
|
|
74
|
+
return this._list.length();
|
|
75
|
+
};
|
|
76
|
+
/**
|
|
77
|
+
* Reverse stack
|
|
78
|
+
*/
|
|
79
|
+
Stack.prototype.reverse = function () {
|
|
80
|
+
this._list.reverse();
|
|
81
|
+
};
|
|
82
|
+
return Stack;
|
|
83
|
+
}());
|
|
84
|
+
exports.default = Stack;
|
|
85
|
+
//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiU3RhY2suanMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi8uLi9zcmMvZGF0YS1zdHJ1Y3R1cmVzL1N0YWNrL1N0YWNrLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiI7O0FBQUEsb0ZBQStFO0FBRy9FLHNFQUFpRTtBQUNqRSxvRUFBK0Q7QUFFL0Q7O0dBRUc7QUFDSDtJQUdFOztPQUVHO0lBQ0gsZUFBbUIsUUFBaUI7UUFDbEMsSUFBSSxDQUFDLEtBQUssR0FBRyxJQUFJLDBCQUFnQixDQUFDLFFBQVEsQ0FBQyxDQUFDO0lBQzlDLENBQUM7SUFFRDs7O09BR0c7SUFDSSxvQkFBSSxHQUFYO1FBQ0UsSUFBSSxJQUFJLENBQUMsT0FBTyxFQUFFLEVBQUU7WUFDbEIsTUFBTSxJQUFJLDBCQUFnQixDQUFDLGdDQUFnQyxDQUFDLENBQUM7U0FDOUQ7UUFDRCxPQUFPLElBQUksQ0FBQyxLQUFLLENBQUMsSUFBSSxFQUFFLENBQUM7SUFDM0IsQ0FBQztJQUVEOzs7T0FHRztJQUNJLG9CQUFJLEdBQVgsVUFBWSxJQUFPO1FBQ2pCLElBQUksSUFBSSxDQUFDLE1BQU0sRUFBRSxFQUFFO1lBQ2pCLE1BQU0sSUFBSSx5QkFBZSxDQUFDLGVBQWUsQ0FBQyxDQUFDO1NBQzVDO1FBQ0QsSUFBSSxDQUFDLEtBQUssQ0FBQyxJQUFJLENBQUMsSUFBSSxDQUFDLENBQUM7SUFDeEIsQ0FBQztJQUVEOzs7T0FHRztJQUNJLG1CQUFHLEdBQVY7UUFDRSxJQUFJLElBQUksQ0FBQyxPQUFPLEVBQUUsRUFBRTtZQUNsQixNQUFNLElBQUksMEJBQWdCLENBQUMsZ0NBQWdDLENBQUMsQ0FBQztTQUM5RDtRQUNELE9BQU8sSUFBSSxDQUFDLEtBQUssQ0FBQyxHQUFHLEVBQUUsQ0FBQztJQUMxQixDQUFDO0lBRUQ7O09BRUc7SUFDSSxtQkFBRyxHQUFWLFVBQVcsSUFBTztRQUNoQixPQUFPLElBQUksQ0FBQyxLQUFLLENBQUMsR0FBRyxDQUFDLElBQUksQ0FBQyxDQUFDO0lBQzlCLENBQUM7SUFFRDs7T0FFRztJQUNJLHVCQUFPLEdBQWQ7UUFDRSxPQUFPLElBQUksQ0FBQyxLQUFLLENBQUMsT0FBTyxFQUFFLENBQUM7SUFDOUIsQ0FBQztJQUVEOztPQUVHO0lBQ0ksc0JBQU0sR0FBYjtRQUNFLE9BQU8sSUFBSSxDQUFDLEtBQUssQ0FBQyxNQUFNLEVBQUUsQ0FBQztJQUM3QixDQUFDO0lBRUQ7O09BRUc7SUFDSSxxQkFBSyxHQUFaO1FBQ0UsSUFBSSxDQUFDLEtBQUssQ0FBQyxLQUFLLEVBQUUsQ0FBQztJQUNyQixDQUFDO0lBRUQ7O09BRUc7SUFDSSxzQkFBTSxHQUFiO1FBQ0UsT0FBTyxJQUFJLENBQUMsS0FBSyxDQUFDLE1BQU0sRUFBRSxDQUFDO0lBQzdCLENBQUM7SUFFRDs7T0FFRztJQUNJLHVCQUFPLEdBQWQ7UUFDRSxJQUFJLENBQUMsS0FBSyxDQUFDLE9BQU8sRUFBRSxDQUFDO0lBQ3ZCLENBQUM7SUFDSCxZQUFDO0FBQUQsQ0FBQyxBQXBGRCxJQW9GQyJ9
|
|
@@ -0,0 +1,28 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
var __extends = (this && this.__extends) || (function () {
|
|
3
|
+
var extendStatics = function (d, b) {
|
|
4
|
+
extendStatics = Object.setPrototypeOf ||
|
|
5
|
+
({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
|
|
6
|
+
function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
|
|
7
|
+
return extendStatics(d, b);
|
|
8
|
+
};
|
|
9
|
+
return function (d, b) {
|
|
10
|
+
extendStatics(d, b);
|
|
11
|
+
function __() { this.constructor = d; }
|
|
12
|
+
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
|
|
13
|
+
};
|
|
14
|
+
})();
|
|
15
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
16
|
+
var IllegalArgumentException_1 = require("./base/IllegalArgumentException");
|
|
17
|
+
var IllegalCapacityException = /** @class */ (function (_super) {
|
|
18
|
+
__extends(IllegalCapacityException, _super);
|
|
19
|
+
function IllegalCapacityException(message) {
|
|
20
|
+
var _this = _super.call(this, message) || this;
|
|
21
|
+
_this.name = _this.constructor.name;
|
|
22
|
+
Object.setPrototypeOf(_this, IllegalCapacityException.prototype);
|
|
23
|
+
return _this;
|
|
24
|
+
}
|
|
25
|
+
return IllegalCapacityException;
|
|
26
|
+
}(IllegalArgumentException_1.default));
|
|
27
|
+
exports.default = IllegalCapacityException;
|
|
28
|
+
//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiSWxsZWdhbENhcGFjaXR5RXhjZXB0aW9uLmpzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vc3JjL2V4Y2VwdGlvbnMvSWxsZWdhbENhcGFjaXR5RXhjZXB0aW9uLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiI7Ozs7Ozs7Ozs7Ozs7OztBQUFBLDRFQUF1RTtBQUV2RTtJQUFzRCw0Q0FBd0I7SUFDNUUsa0NBQVksT0FBZTtRQUEzQixZQUNFLGtCQUFNLE9BQU8sQ0FBQyxTQUdmO1FBRkMsS0FBSSxDQUFDLElBQUksR0FBRyxLQUFJLENBQUMsV0FBVyxDQUFDLElBQUksQ0FBQztRQUNsQyxNQUFNLENBQUMsY0FBYyxDQUFDLEtBQUksRUFBRSx3QkFBd0IsQ0FBQyxTQUFTLENBQUMsQ0FBQzs7SUFDbEUsQ0FBQztJQUNILCtCQUFDO0FBQUQsQ0FBQyxBQU5ELENBQXNELGtDQUF3QixHQU03RSJ9
|
|
@@ -0,0 +1,28 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
var __extends = (this && this.__extends) || (function () {
|
|
3
|
+
var extendStatics = function (d, b) {
|
|
4
|
+
extendStatics = Object.setPrototypeOf ||
|
|
5
|
+
({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
|
|
6
|
+
function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
|
|
7
|
+
return extendStatics(d, b);
|
|
8
|
+
};
|
|
9
|
+
return function (d, b) {
|
|
10
|
+
extendStatics(d, b);
|
|
11
|
+
function __() { this.constructor = d; }
|
|
12
|
+
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
|
|
13
|
+
};
|
|
14
|
+
})();
|
|
15
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
16
|
+
var IllegalArgumentException_1 = require("./base/IllegalArgumentException");
|
|
17
|
+
var IndexOutOfBoundsException = /** @class */ (function (_super) {
|
|
18
|
+
__extends(IndexOutOfBoundsException, _super);
|
|
19
|
+
function IndexOutOfBoundsException(message) {
|
|
20
|
+
var _this = _super.call(this, message) || this;
|
|
21
|
+
_this.name = _this.constructor.name;
|
|
22
|
+
Object.setPrototypeOf(_this, IndexOutOfBoundsException.prototype);
|
|
23
|
+
return _this;
|
|
24
|
+
}
|
|
25
|
+
return IndexOutOfBoundsException;
|
|
26
|
+
}(IllegalArgumentException_1.default));
|
|
27
|
+
exports.default = IndexOutOfBoundsException;
|
|
28
|
+
//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiSW5kZXhPdXRPZkJvdW5kc0V4Y2VwdGlvbi5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9leGNlcHRpb25zL0luZGV4T3V0T2ZCb3VuZHNFeGNlcHRpb24udHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7Ozs7Ozs7Ozs7Ozs7O0FBQUEsNEVBQXVFO0FBRXZFO0lBQXVELDZDQUF3QjtJQUM3RSxtQ0FBWSxPQUFlO1FBQTNCLFlBQ0Usa0JBQU0sT0FBTyxDQUFDLFNBR2Y7UUFGQyxLQUFJLENBQUMsSUFBSSxHQUFHLEtBQUksQ0FBQyxXQUFXLENBQUMsSUFBSSxDQUFDO1FBQ2xDLE1BQU0sQ0FBQyxjQUFjLENBQUMsS0FBSSxFQUFFLHlCQUF5QixDQUFDLFNBQVMsQ0FBQyxDQUFDOztJQUNuRSxDQUFDO0lBQ0gsZ0NBQUM7QUFBRCxDQUFDLEFBTkQsQ0FBdUQsa0NBQXdCLEdBTTlFIn0=
|
|
@@ -0,0 +1,28 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
var __extends = (this && this.__extends) || (function () {
|
|
3
|
+
var extendStatics = function (d, b) {
|
|
4
|
+
extendStatics = Object.setPrototypeOf ||
|
|
5
|
+
({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
|
|
6
|
+
function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
|
|
7
|
+
return extendStatics(d, b);
|
|
8
|
+
};
|
|
9
|
+
return function (d, b) {
|
|
10
|
+
extendStatics(d, b);
|
|
11
|
+
function __() { this.constructor = d; }
|
|
12
|
+
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
|
|
13
|
+
};
|
|
14
|
+
})();
|
|
15
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
16
|
+
var IllegalStateException_1 = require("./base/IllegalStateException");
|
|
17
|
+
var IsAlreadyExistsException = /** @class */ (function (_super) {
|
|
18
|
+
__extends(IsAlreadyExistsException, _super);
|
|
19
|
+
function IsAlreadyExistsException(message) {
|
|
20
|
+
var _this = _super.call(this, message) || this;
|
|
21
|
+
_this.name = _this.constructor.name;
|
|
22
|
+
Object.setPrototypeOf(_this, IsAlreadyExistsException.prototype);
|
|
23
|
+
return _this;
|
|
24
|
+
}
|
|
25
|
+
return IsAlreadyExistsException;
|
|
26
|
+
}(IllegalStateException_1.default));
|
|
27
|
+
exports.default = IsAlreadyExistsException;
|
|
28
|
+
//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiSXNBbHJlYWR5RXhpc3RzRXhjZXB0aW9uLmpzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vc3JjL2V4Y2VwdGlvbnMvSXNBbHJlYWR5RXhpc3RzRXhjZXB0aW9uLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiI7Ozs7Ozs7Ozs7Ozs7OztBQUFBLHNFQUFpRTtBQUVqRTtJQUFzRCw0Q0FBcUI7SUFDekUsa0NBQVksT0FBZTtRQUEzQixZQUNFLGtCQUFNLE9BQU8sQ0FBQyxTQUdmO1FBRkMsS0FBSSxDQUFDLElBQUksR0FBRyxLQUFJLENBQUMsV0FBVyxDQUFDLElBQUksQ0FBQztRQUNsQyxNQUFNLENBQUMsY0FBYyxDQUFDLEtBQUksRUFBRSx3QkFBd0IsQ0FBQyxTQUFTLENBQUMsQ0FBQzs7SUFDbEUsQ0FBQztJQUNILCtCQUFDO0FBQUQsQ0FBQyxBQU5ELENBQXNELCtCQUFxQixHQU0xRSJ9
|
|
@@ -0,0 +1,28 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
var __extends = (this && this.__extends) || (function () {
|
|
3
|
+
var extendStatics = function (d, b) {
|
|
4
|
+
extendStatics = Object.setPrototypeOf ||
|
|
5
|
+
({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
|
|
6
|
+
function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
|
|
7
|
+
return extendStatics(d, b);
|
|
8
|
+
};
|
|
9
|
+
return function (d, b) {
|
|
10
|
+
extendStatics(d, b);
|
|
11
|
+
function __() { this.constructor = d; }
|
|
12
|
+
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
|
|
13
|
+
};
|
|
14
|
+
})();
|
|
15
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
16
|
+
var IllegalStateException_1 = require("./base/IllegalStateException");
|
|
17
|
+
var IsEmptyException = /** @class */ (function (_super) {
|
|
18
|
+
__extends(IsEmptyException, _super);
|
|
19
|
+
function IsEmptyException(message) {
|
|
20
|
+
var _this = _super.call(this, message) || this;
|
|
21
|
+
_this.name = _this.constructor.name;
|
|
22
|
+
Object.setPrototypeOf(_this, IsEmptyException.prototype);
|
|
23
|
+
return _this;
|
|
24
|
+
}
|
|
25
|
+
return IsEmptyException;
|
|
26
|
+
}(IllegalStateException_1.default));
|
|
27
|
+
exports.default = IsEmptyException;
|
|
28
|
+
//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiSXNFbXB0eUV4Y2VwdGlvbi5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9leGNlcHRpb25zL0lzRW1wdHlFeGNlcHRpb24udHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7Ozs7Ozs7Ozs7Ozs7O0FBQUEsc0VBQWlFO0FBRWpFO0lBQThDLG9DQUFxQjtJQUNqRSwwQkFBWSxPQUFlO1FBQTNCLFlBQ0Usa0JBQU0sT0FBTyxDQUFDLFNBR2Y7UUFGQyxLQUFJLENBQUMsSUFBSSxHQUFHLEtBQUksQ0FBQyxXQUFXLENBQUMsSUFBSSxDQUFDO1FBQ2xDLE1BQU0sQ0FBQyxjQUFjLENBQUMsS0FBSSxFQUFFLGdCQUFnQixDQUFDLFNBQVMsQ0FBQyxDQUFDOztJQUMxRCxDQUFDO0lBQ0gsdUJBQUM7QUFBRCxDQUFDLEFBTkQsQ0FBOEMsK0JBQXFCLEdBTWxFIn0=
|
|
@@ -0,0 +1,28 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
var __extends = (this && this.__extends) || (function () {
|
|
3
|
+
var extendStatics = function (d, b) {
|
|
4
|
+
extendStatics = Object.setPrototypeOf ||
|
|
5
|
+
({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
|
|
6
|
+
function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
|
|
7
|
+
return extendStatics(d, b);
|
|
8
|
+
};
|
|
9
|
+
return function (d, b) {
|
|
10
|
+
extendStatics(d, b);
|
|
11
|
+
function __() { this.constructor = d; }
|
|
12
|
+
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
|
|
13
|
+
};
|
|
14
|
+
})();
|
|
15
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
16
|
+
var IllegalStateException_1 = require("./base/IllegalStateException");
|
|
17
|
+
var IsFullException = /** @class */ (function (_super) {
|
|
18
|
+
__extends(IsFullException, _super);
|
|
19
|
+
function IsFullException(message) {
|
|
20
|
+
var _this = _super.call(this, message) || this;
|
|
21
|
+
_this.name = _this.constructor.name;
|
|
22
|
+
Object.setPrototypeOf(_this, IsFullException.prototype);
|
|
23
|
+
return _this;
|
|
24
|
+
}
|
|
25
|
+
return IsFullException;
|
|
26
|
+
}(IllegalStateException_1.default));
|
|
27
|
+
exports.default = IsFullException;
|
|
28
|
+
//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiSXNGdWxsRXhjZXB0aW9uLmpzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vc3JjL2V4Y2VwdGlvbnMvSXNGdWxsRXhjZXB0aW9uLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiI7Ozs7Ozs7Ozs7Ozs7OztBQUFBLHNFQUFpRTtBQUVqRTtJQUE2QyxtQ0FBcUI7SUFDaEUseUJBQVksT0FBZTtRQUEzQixZQUNFLGtCQUFNLE9BQU8sQ0FBQyxTQUdmO1FBRkMsS0FBSSxDQUFDLElBQUksR0FBRyxLQUFJLENBQUMsV0FBVyxDQUFDLElBQUksQ0FBQztRQUNsQyxNQUFNLENBQUMsY0FBYyxDQUFDLEtBQUksRUFBRSxlQUFlLENBQUMsU0FBUyxDQUFDLENBQUM7O0lBQ3pELENBQUM7SUFDSCxzQkFBQztBQUFELENBQUMsQUFORCxDQUE2QywrQkFBcUIsR0FNakUifQ==
|
|
@@ -0,0 +1,28 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
var __extends = (this && this.__extends) || (function () {
|
|
3
|
+
var extendStatics = function (d, b) {
|
|
4
|
+
extendStatics = Object.setPrototypeOf ||
|
|
5
|
+
({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
|
|
6
|
+
function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
|
|
7
|
+
return extendStatics(d, b);
|
|
8
|
+
};
|
|
9
|
+
return function (d, b) {
|
|
10
|
+
extendStatics(d, b);
|
|
11
|
+
function __() { this.constructor = d; }
|
|
12
|
+
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
|
|
13
|
+
};
|
|
14
|
+
})();
|
|
15
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
16
|
+
var IllegalStateException_1 = require("./base/IllegalStateException");
|
|
17
|
+
var IsNotFoundException = /** @class */ (function (_super) {
|
|
18
|
+
__extends(IsNotFoundException, _super);
|
|
19
|
+
function IsNotFoundException(message) {
|
|
20
|
+
var _this = _super.call(this, message) || this;
|
|
21
|
+
_this.name = _this.constructor.name;
|
|
22
|
+
Object.setPrototypeOf(_this, IsNotFoundException.prototype);
|
|
23
|
+
return _this;
|
|
24
|
+
}
|
|
25
|
+
return IsNotFoundException;
|
|
26
|
+
}(IllegalStateException_1.default));
|
|
27
|
+
exports.default = IsNotFoundException;
|
|
28
|
+
//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiSXNOb3RGb3VuZEV4Y2VwdGlvbi5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9leGNlcHRpb25zL0lzTm90Rm91bmRFeGNlcHRpb24udHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7Ozs7Ozs7Ozs7Ozs7O0FBQUEsc0VBQWlFO0FBRWpFO0lBQWlELHVDQUFxQjtJQUNwRSw2QkFBWSxPQUFlO1FBQTNCLFlBQ0Usa0JBQU0sT0FBTyxDQUFDLFNBR2Y7UUFGQyxLQUFJLENBQUMsSUFBSSxHQUFHLEtBQUksQ0FBQyxXQUFXLENBQUMsSUFBSSxDQUFDO1FBQ2xDLE1BQU0sQ0FBQyxjQUFjLENBQUMsS0FBSSxFQUFFLG1CQUFtQixDQUFDLFNBQVMsQ0FBQyxDQUFDOztJQUM3RCxDQUFDO0lBQ0gsMEJBQUM7QUFBRCxDQUFDLEFBTkQsQ0FBaUQsK0JBQXFCLEdBTXJFIn0=
|
|
@@ -0,0 +1,27 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
var __extends = (this && this.__extends) || (function () {
|
|
3
|
+
var extendStatics = function (d, b) {
|
|
4
|
+
extendStatics = Object.setPrototypeOf ||
|
|
5
|
+
({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
|
|
6
|
+
function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
|
|
7
|
+
return extendStatics(d, b);
|
|
8
|
+
};
|
|
9
|
+
return function (d, b) {
|
|
10
|
+
extendStatics(d, b);
|
|
11
|
+
function __() { this.constructor = d; }
|
|
12
|
+
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
|
|
13
|
+
};
|
|
14
|
+
})();
|
|
15
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
16
|
+
var IllegalArgumentException = /** @class */ (function (_super) {
|
|
17
|
+
__extends(IllegalArgumentException, _super);
|
|
18
|
+
function IllegalArgumentException(message) {
|
|
19
|
+
var _this = _super.call(this, message) || this;
|
|
20
|
+
_this.name = _this.constructor.name;
|
|
21
|
+
Object.setPrototypeOf(_this, IllegalArgumentException.prototype);
|
|
22
|
+
return _this;
|
|
23
|
+
}
|
|
24
|
+
return IllegalArgumentException;
|
|
25
|
+
}(Error));
|
|
26
|
+
exports.default = IllegalArgumentException;
|
|
27
|
+
//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiSWxsZWdhbEFyZ3VtZW50RXhjZXB0aW9uLmpzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vLi4vc3JjL2V4Y2VwdGlvbnMvYmFzZS9JbGxlZ2FsQXJndW1lbnRFeGNlcHRpb24udHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7Ozs7Ozs7Ozs7Ozs7O0FBQUE7SUFBc0QsNENBQUs7SUFDekQsa0NBQVksT0FBZTtRQUEzQixZQUNFLGtCQUFNLE9BQU8sQ0FBQyxTQUdmO1FBRkMsS0FBSSxDQUFDLElBQUksR0FBRyxLQUFJLENBQUMsV0FBVyxDQUFDLElBQUksQ0FBQztRQUNsQyxNQUFNLENBQUMsY0FBYyxDQUFDLEtBQUksRUFBRSx3QkFBd0IsQ0FBQyxTQUFTLENBQUMsQ0FBQzs7SUFDbEUsQ0FBQztJQUNILCtCQUFDO0FBQUQsQ0FBQyxBQU5ELENBQXNELEtBQUssR0FNMUQifQ==
|
|
@@ -0,0 +1,27 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
var __extends = (this && this.__extends) || (function () {
|
|
3
|
+
var extendStatics = function (d, b) {
|
|
4
|
+
extendStatics = Object.setPrototypeOf ||
|
|
5
|
+
({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
|
|
6
|
+
function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
|
|
7
|
+
return extendStatics(d, b);
|
|
8
|
+
};
|
|
9
|
+
return function (d, b) {
|
|
10
|
+
extendStatics(d, b);
|
|
11
|
+
function __() { this.constructor = d; }
|
|
12
|
+
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
|
|
13
|
+
};
|
|
14
|
+
})();
|
|
15
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
16
|
+
var IllegalStateException = /** @class */ (function (_super) {
|
|
17
|
+
__extends(IllegalStateException, _super);
|
|
18
|
+
function IllegalStateException(message) {
|
|
19
|
+
var _this = _super.call(this, message) || this;
|
|
20
|
+
_this.name = _this.constructor.name;
|
|
21
|
+
Object.setPrototypeOf(_this, IllegalStateException.prototype);
|
|
22
|
+
return _this;
|
|
23
|
+
}
|
|
24
|
+
return IllegalStateException;
|
|
25
|
+
}(Error));
|
|
26
|
+
exports.default = IllegalStateException;
|
|
27
|
+
//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiSWxsZWdhbFN0YXRlRXhjZXB0aW9uLmpzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vLi4vc3JjL2V4Y2VwdGlvbnMvYmFzZS9JbGxlZ2FsU3RhdGVFeGNlcHRpb24udHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7Ozs7Ozs7Ozs7Ozs7O0FBQUE7SUFBbUQseUNBQUs7SUFDdEQsK0JBQVksT0FBZTtRQUEzQixZQUNFLGtCQUFNLE9BQU8sQ0FBQyxTQUdmO1FBRkMsS0FBSSxDQUFDLElBQUksR0FBRyxLQUFJLENBQUMsV0FBVyxDQUFDLElBQUksQ0FBQztRQUNsQyxNQUFNLENBQUMsY0FBYyxDQUFDLEtBQUksRUFBRSxxQkFBcUIsQ0FBQyxTQUFTLENBQUMsQ0FBQzs7SUFDL0QsQ0FBQztJQUNILDRCQUFDO0FBQUQsQ0FBQyxBQU5ELENBQW1ELEtBQUssR0FNdkQifQ==
|
|
@@ -0,0 +1,16 @@
|
|
|
1
|
+
import { factorial, memoizedFactorial } from "../algorithms/factorial";
|
|
2
|
+
import { fibonacci, memoizedFibonacci } from "../algorithms/fibonacci";
|
|
3
|
+
import { binarySearch } from "../algorithms/binary-search";
|
|
4
|
+
import { transposeMatrix } from "../algorithms/transpose-matrix";
|
|
5
|
+
import { transposeDirectedGraph } from "../data-structures/Graph/transposing/transposeDirectedGraph";
|
|
6
|
+
import BFSIterationStrategy from "../data-structures/Graph/strategy/BFSIterationStrategy";
|
|
7
|
+
import DFSIterationStrategy from "../data-structures/Graph/strategy/DFSIterationStrategy";
|
|
8
|
+
import DijkstraIterationStrategy from "../data-structures/Graph/strategy/DijkstraIterationStrategy";
|
|
9
|
+
import GraphIteratorBFS from "../data-structures/Graph/iterator/GraphIteratorBFS";
|
|
10
|
+
import GraphIteratorDFS from "../data-structures/Graph/iterator/GraphIteratorDFS";
|
|
11
|
+
import GraphIteratorDijkstra from "../data-structures/Graph/iterator/GraphIteratorDijkstra";
|
|
12
|
+
import { hasPath } from "../data-structures/Graph/searching/hasPath";
|
|
13
|
+
import { shortestPath } from "../data-structures/Graph/searching/shortestPath";
|
|
14
|
+
import { presenterAdjacencyMatrix } from "../data-structures/Graph/presenter/presenterAdjacencyMatrix";
|
|
15
|
+
import { presenterAdjacencyLists } from "../data-structures/Graph/presenter/presenterAdjacencyLists";
|
|
16
|
+
export { binarySearch, factorial, memoizedFactorial, memoizedFibonacci, fibonacci, transposeMatrix, GraphIteratorDFS, presenterAdjacencyLists, presenterAdjacencyMatrix, hasPath, shortestPath, DijkstraIterationStrategy, DFSIterationStrategy, BFSIterationStrategy, GraphIteratorBFS, GraphIteratorDijkstra, transposeDirectedGraph, };
|
|
@@ -0,0 +1,36 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
exports.transposeDirectedGraph = exports.GraphIteratorDijkstra = exports.GraphIteratorBFS = exports.BFSIterationStrategy = exports.DFSIterationStrategy = exports.DijkstraIterationStrategy = exports.shortestPath = exports.hasPath = exports.presenterAdjacencyMatrix = exports.presenterAdjacencyLists = exports.GraphIteratorDFS = exports.transposeMatrix = exports.fibonacci = exports.memoizedFibonacci = exports.memoizedFactorial = exports.factorial = exports.binarySearch = void 0;
|
|
4
|
+
var factorial_1 = require("../algorithms/factorial");
|
|
5
|
+
Object.defineProperty(exports, "factorial", { enumerable: true, get: function () { return factorial_1.factorial; } });
|
|
6
|
+
Object.defineProperty(exports, "memoizedFactorial", { enumerable: true, get: function () { return factorial_1.memoizedFactorial; } });
|
|
7
|
+
var fibonacci_1 = require("../algorithms/fibonacci");
|
|
8
|
+
Object.defineProperty(exports, "fibonacci", { enumerable: true, get: function () { return fibonacci_1.fibonacci; } });
|
|
9
|
+
Object.defineProperty(exports, "memoizedFibonacci", { enumerable: true, get: function () { return fibonacci_1.memoizedFibonacci; } });
|
|
10
|
+
var binary_search_1 = require("../algorithms/binary-search");
|
|
11
|
+
Object.defineProperty(exports, "binarySearch", { enumerable: true, get: function () { return binary_search_1.binarySearch; } });
|
|
12
|
+
var transpose_matrix_1 = require("../algorithms/transpose-matrix");
|
|
13
|
+
Object.defineProperty(exports, "transposeMatrix", { enumerable: true, get: function () { return transpose_matrix_1.transposeMatrix; } });
|
|
14
|
+
var transposeDirectedGraph_1 = require("../data-structures/Graph/transposing/transposeDirectedGraph");
|
|
15
|
+
Object.defineProperty(exports, "transposeDirectedGraph", { enumerable: true, get: function () { return transposeDirectedGraph_1.transposeDirectedGraph; } });
|
|
16
|
+
var BFSIterationStrategy_1 = require("../data-structures/Graph/strategy/BFSIterationStrategy");
|
|
17
|
+
exports.BFSIterationStrategy = BFSIterationStrategy_1.default;
|
|
18
|
+
var DFSIterationStrategy_1 = require("../data-structures/Graph/strategy/DFSIterationStrategy");
|
|
19
|
+
exports.DFSIterationStrategy = DFSIterationStrategy_1.default;
|
|
20
|
+
var DijkstraIterationStrategy_1 = require("../data-structures/Graph/strategy/DijkstraIterationStrategy");
|
|
21
|
+
exports.DijkstraIterationStrategy = DijkstraIterationStrategy_1.default;
|
|
22
|
+
var GraphIteratorBFS_1 = require("../data-structures/Graph/iterator/GraphIteratorBFS");
|
|
23
|
+
exports.GraphIteratorBFS = GraphIteratorBFS_1.default;
|
|
24
|
+
var GraphIteratorDFS_1 = require("../data-structures/Graph/iterator/GraphIteratorDFS");
|
|
25
|
+
exports.GraphIteratorDFS = GraphIteratorDFS_1.default;
|
|
26
|
+
var GraphIteratorDijkstra_1 = require("../data-structures/Graph/iterator/GraphIteratorDijkstra");
|
|
27
|
+
exports.GraphIteratorDijkstra = GraphIteratorDijkstra_1.default;
|
|
28
|
+
var hasPath_1 = require("../data-structures/Graph/searching/hasPath");
|
|
29
|
+
Object.defineProperty(exports, "hasPath", { enumerable: true, get: function () { return hasPath_1.hasPath; } });
|
|
30
|
+
var shortestPath_1 = require("../data-structures/Graph/searching/shortestPath");
|
|
31
|
+
Object.defineProperty(exports, "shortestPath", { enumerable: true, get: function () { return shortestPath_1.shortestPath; } });
|
|
32
|
+
var presenterAdjacencyMatrix_1 = require("../data-structures/Graph/presenter/presenterAdjacencyMatrix");
|
|
33
|
+
Object.defineProperty(exports, "presenterAdjacencyMatrix", { enumerable: true, get: function () { return presenterAdjacencyMatrix_1.presenterAdjacencyMatrix; } });
|
|
34
|
+
var presenterAdjacencyLists_1 = require("../data-structures/Graph/presenter/presenterAdjacencyLists");
|
|
35
|
+
Object.defineProperty(exports, "presenterAdjacencyLists", { enumerable: true, get: function () { return presenterAdjacencyLists_1.presenterAdjacencyLists; } });
|
|
36
|
+
//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiYWxnb3JpdGhtcy5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9leHBvcnRzL2FsZ29yaXRobXMudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7O0FBQUEscURBQXVFO0FBa0JyRSwwRkFsQk8scUJBQVMsT0FrQlA7QUFDVCxrR0FuQmtCLDZCQUFpQixPQW1CbEI7QUFsQm5CLHFEQUF1RTtBQW9CckUsMEZBcEJPLHFCQUFTLE9Bb0JQO0FBRFQsa0dBbkJrQiw2QkFBaUIsT0FtQmxCO0FBbEJuQiw2REFBMkQ7QUFlekQsNkZBZk8sNEJBQVksT0FlUDtBQWRkLG1FQUFpRTtBQW1CL0QsZ0dBbkJPLGtDQUFlLE9BbUJQO0FBbEJqQixzR0FBcUc7QUE2Qm5HLHVHQTdCTywrQ0FBc0IsT0E2QlA7QUE1QnhCLCtGQUEwRjtBQXlCeEYsK0JBekJLLDhCQUFvQixDQXlCTDtBQXhCdEIsK0ZBQTBGO0FBdUJ4RiwrQkF2QkssOEJBQW9CLENBdUJMO0FBdEJ0Qix5R0FBb0c7QUFxQmxHLG9DQXJCSyxtQ0FBeUIsQ0FxQkw7QUFwQjNCLHVGQUFrRjtBQXVCaEYsMkJBdkJLLDBCQUFnQixDQXVCTDtBQXRCbEIsdUZBQWtGO0FBY2hGLDJCQWRLLDBCQUFnQixDQWNMO0FBYmxCLGlHQUE0RjtBQXNCMUYsZ0NBdEJLLCtCQUFxQixDQXNCTDtBQXJCdkIsc0VBQXFFO0FBZW5FLHdGQWZPLGlCQUFPLE9BZVA7QUFkVCxnRkFBK0U7QUFlN0UsNkZBZk8sMkJBQVksT0FlUDtBQWRkLHdHQUF1RztBQVlyRyx5R0FaTyxtREFBd0IsT0FZUDtBQVgxQixzR0FBcUc7QUFVbkcsd0dBVk8saURBQXVCLE9BVVAifQ==
|
|
@@ -0,0 +1,7 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
exports.EDGE_EXISTS_STATE = exports.EDGE_NOT_EXISTS_STATE = void 0;
|
|
4
|
+
var constants_1 = require("../constants");
|
|
5
|
+
Object.defineProperty(exports, "EDGE_EXISTS_STATE", { enumerable: true, get: function () { return constants_1.EDGE_EXISTS_STATE; } });
|
|
6
|
+
Object.defineProperty(exports, "EDGE_NOT_EXISTS_STATE", { enumerable: true, get: function () { return constants_1.EDGE_NOT_EXISTS_STATE; } });
|
|
7
|
+
//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiY29uc3RhbnRzLmpzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vc3JjL2V4cG9ydHMvY29uc3RhbnRzLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiI7OztBQUFBLDBDQUF3RTtBQUV4QyxrR0FGdkIsNkJBQWlCLE9BRXVCO0FBQXhDLHNHQUZtQixpQ0FBcUIsT0FFbkIifQ==
|
|
@@ -0,0 +1,11 @@
|
|
|
1
|
+
import Queue from "../data-structures/Queue/Queue";
|
|
2
|
+
import Stack from "../data-structures/Stack/Stack";
|
|
3
|
+
import UndirectedGraph from "../data-structures/Graph/UndirectedGraph";
|
|
4
|
+
import DirectedGraph from "../data-structures/Graph/DirectedGraph";
|
|
5
|
+
import BinarySearchTree from "../data-structures/BinaryTree/BinarySearchTree/BinarySearchTree";
|
|
6
|
+
import RandBinarySearchTree from "../data-structures/BinaryTree/RandBinarySearchTree/RandBinarySearchTree";
|
|
7
|
+
import DoubleLinkedList from "../data-structures/LinkedList/DoubleLinkedList/DoubleLinkedList";
|
|
8
|
+
import SingleLinkedList from "../data-structures/LinkedList/SingleLinkedList/SingleLinkedList";
|
|
9
|
+
import LoopedArray from "../data-structures/LoopedArray/LoopedArray";
|
|
10
|
+
import HashTable from "../data-structures/HashTable/HashTable";
|
|
11
|
+
export { Stack, Queue, SingleLinkedList, DoubleLinkedList, RandBinarySearchTree, BinarySearchTree, DirectedGraph, UndirectedGraph, LoopedArray, HashTable, };
|
|
@@ -0,0 +1,24 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
exports.HashTable = exports.LoopedArray = exports.UndirectedGraph = exports.DirectedGraph = exports.BinarySearchTree = exports.RandBinarySearchTree = exports.DoubleLinkedList = exports.SingleLinkedList = exports.Queue = exports.Stack = void 0;
|
|
4
|
+
var Queue_1 = require("../data-structures/Queue/Queue");
|
|
5
|
+
exports.Queue = Queue_1.default;
|
|
6
|
+
var Stack_1 = require("../data-structures/Stack/Stack");
|
|
7
|
+
exports.Stack = Stack_1.default;
|
|
8
|
+
var UndirectedGraph_1 = require("../data-structures/Graph/UndirectedGraph");
|
|
9
|
+
exports.UndirectedGraph = UndirectedGraph_1.default;
|
|
10
|
+
var DirectedGraph_1 = require("../data-structures/Graph/DirectedGraph");
|
|
11
|
+
exports.DirectedGraph = DirectedGraph_1.default;
|
|
12
|
+
var BinarySearchTree_1 = require("../data-structures/BinaryTree/BinarySearchTree/BinarySearchTree");
|
|
13
|
+
exports.BinarySearchTree = BinarySearchTree_1.default;
|
|
14
|
+
var RandBinarySearchTree_1 = require("../data-structures/BinaryTree/RandBinarySearchTree/RandBinarySearchTree");
|
|
15
|
+
exports.RandBinarySearchTree = RandBinarySearchTree_1.default;
|
|
16
|
+
var DoubleLinkedList_1 = require("../data-structures/LinkedList/DoubleLinkedList/DoubleLinkedList");
|
|
17
|
+
exports.DoubleLinkedList = DoubleLinkedList_1.default;
|
|
18
|
+
var SingleLinkedList_1 = require("../data-structures/LinkedList/SingleLinkedList/SingleLinkedList");
|
|
19
|
+
exports.SingleLinkedList = SingleLinkedList_1.default;
|
|
20
|
+
var LoopedArray_1 = require("../data-structures/LoopedArray/LoopedArray");
|
|
21
|
+
exports.LoopedArray = LoopedArray_1.default;
|
|
22
|
+
var HashTable_1 = require("../data-structures/HashTable/HashTable");
|
|
23
|
+
exports.HashTable = HashTable_1.default;
|
|
24
|
+
//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiZGF0YS1zdHJ1Y3R1cmVzLmpzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vc3JjL2V4cG9ydHMvZGF0YS1zdHJ1Y3R1cmVzLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiI7OztBQUFBLHdEQUFtRDtBQWFqRCxnQkFiSyxlQUFLLENBYUw7QUFaUCx3REFBbUQ7QUFXakQsZ0JBWEssZUFBSyxDQVdMO0FBVlAsNEVBQXVFO0FBaUJyRSwwQkFqQksseUJBQWUsQ0FpQkw7QUFoQmpCLHdFQUFtRTtBQWVqRSx3QkFmSyx1QkFBYSxDQWVMO0FBZGYsb0dBQStGO0FBYTdGLDJCQWJLLDBCQUFnQixDQWFMO0FBWmxCLGdIQUEyRztBQVd6RywrQkFYSyw4QkFBb0IsQ0FXTDtBQVZ0QixvR0FBK0Y7QUFTN0YsMkJBVEssMEJBQWdCLENBU0w7QUFSbEIsb0dBQStGO0FBTzdGLDJCQVBLLDBCQUFnQixDQU9MO0FBTmxCLDBFQUFxRTtBQVluRSxzQkFaSyxxQkFBVyxDQVlMO0FBWGIsb0VBQStEO0FBWTdELG9CQVpLLG1CQUFTLENBWUwifQ==
|
|
@@ -0,0 +1,6 @@
|
|
|
1
|
+
import { generateRandomGraph } from "../data-structures/Graph/demo/generateRandomGraph";
|
|
2
|
+
import { createLinkedList } from "../helpers/createLinkedList";
|
|
3
|
+
import { createBinaryTree } from "../helpers/createBinaryTree";
|
|
4
|
+
import { createGraph } from "../helpers/createGraph";
|
|
5
|
+
import { createGraphFromMatrix } from "../helpers/createGraphFromMatrix";
|
|
6
|
+
export { createGraph, createGraphFromMatrix, createBinaryTree, createLinkedList, generateRandomGraph, };
|