@blackglory/structures 0.10.0 → 0.10.1
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/README.md +18 -1
- package/dist/es2015/index.min.mjs +2 -2
- package/dist/es2015/index.min.mjs.map +1 -1
- package/dist/es2015/index.mjs +198 -3
- package/dist/es2015/index.mjs.map +1 -1
- package/dist/es2015/index.umd.js +198 -2
- package/dist/es2015/index.umd.js.map +1 -1
- package/dist/es2015/index.umd.min.js +2 -2
- package/dist/es2015/index.umd.min.js.map +1 -1
- package/dist/es2018/index.min.mjs +2 -2
- package/dist/es2018/index.min.mjs.map +1 -1
- package/dist/es2018/index.mjs +198 -3
- package/dist/es2018/index.mjs.map +1 -1
- package/dist/es2018/index.umd.js +198 -2
- package/dist/es2018/index.umd.js.map +1 -1
- package/dist/es2018/index.umd.min.js +2 -2
- package/dist/es2018/index.umd.min.js.map +1 -1
- package/lib/es2015/index.d.ts +1 -0
- package/lib/es2015/index.js +1 -0
- package/lib/es2015/index.js.map +1 -1
- package/lib/es2015/sorted-set.d.ts +10 -0
- package/lib/es2015/sorted-set.js +32 -0
- package/lib/es2015/sorted-set.js.map +1 -0
- package/lib/es2015/sparse-set.d.ts +1 -0
- package/lib/es2015/sparse-set.js +8 -2
- package/lib/es2015/sparse-set.js.map +1 -1
- package/lib/es2015/utils/skip-list.d.ts +24 -0
- package/lib/es2015/utils/skip-list.js +155 -0
- package/lib/es2015/utils/skip-list.js.map +1 -0
- package/lib/es2018/index.d.ts +1 -0
- package/lib/es2018/index.js +1 -0
- package/lib/es2018/index.js.map +1 -1
- package/lib/es2018/sorted-set.d.ts +10 -0
- package/lib/es2018/sorted-set.js +32 -0
- package/lib/es2018/sorted-set.js.map +1 -0
- package/lib/es2018/sparse-set.d.ts +1 -0
- package/lib/es2018/sparse-set.js +8 -2
- package/lib/es2018/sparse-set.js.map +1 -1
- package/lib/es2018/utils/skip-list.d.ts +24 -0
- package/lib/es2018/utils/skip-list.js +155 -0
- package/lib/es2018/utils/skip-list.js.map +1 -0
- package/package.json +1 -1
package/lib/es2015/index.d.ts
CHANGED
package/lib/es2015/index.js
CHANGED
|
@@ -33,4 +33,5 @@ __exportStar(require("./typed-sparse-map"), exports);
|
|
|
33
33
|
__exportStar(require("./typed-sparse-set"), exports);
|
|
34
34
|
var dynamic_typed_array_1 = require("./dynamic-typed-array");
|
|
35
35
|
Object.defineProperty(exports, "DynamicTypedArray", { enumerable: true, get: function () { return dynamic_typed_array_1.DynamicTypedArray; } });
|
|
36
|
+
__exportStar(require("./sorted-set"), exports);
|
|
36
37
|
//# sourceMappingURL=index.js.map
|
package/lib/es2015/index.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;AAAA,wCAAqB;AACrB,yCAAsB;AACtB,4CAAyB;AACzB,6CAA0B;AAC1B,6CAA0B;AAC1B,0CAAuB;AACvB,4CAAyB;AACzB,kDAA+B;AAC/B,6CAA0B;AAC1B,6CAA0B;AAC1B,yDAAsC;AACtC,oEAAiD;AACjD,+CAA4B;AAC5B,+CAA4B;AAC5B,qDAAkC;AAClC,qDAAkC;AAClC,6DAAyD;AAAhD,wHAAA,iBAAiB,OAAA"}
|
|
1
|
+
{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;AAAA,wCAAqB;AACrB,yCAAsB;AACtB,4CAAyB;AACzB,6CAA0B;AAC1B,6CAA0B;AAC1B,0CAAuB;AACvB,4CAAyB;AACzB,kDAA+B;AAC/B,6CAA0B;AAC1B,6CAA0B;AAC1B,yDAAsC;AACtC,oEAAiD;AACjD,+CAA4B;AAC5B,+CAA4B;AAC5B,qDAAkC;AAClC,qDAAkC;AAClC,6DAAyD;AAAhD,wHAAA,iBAAiB,OAAA;AAC1B,+CAA4B"}
|
|
@@ -0,0 +1,10 @@
|
|
|
1
|
+
export declare class SortedSet<T> implements Iterable<T> {
|
|
2
|
+
private skipList;
|
|
3
|
+
get [Symbol.toStringTag](): string;
|
|
4
|
+
[Symbol.iterator](): IterableIterator<T>;
|
|
5
|
+
constructor(compare: (a: T, b: T) => number);
|
|
6
|
+
values(): Iterable<T>;
|
|
7
|
+
has(value: T): boolean;
|
|
8
|
+
add(value: T): void;
|
|
9
|
+
delete(value: T): void;
|
|
10
|
+
}
|
|
@@ -0,0 +1,32 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
exports.SortedSet = void 0;
|
|
4
|
+
const skip_list_1 = require("./utils/skip-list");
|
|
5
|
+
const iterable_operator_1 = require("iterable-operator");
|
|
6
|
+
class SortedSet {
|
|
7
|
+
constructor(compare) {
|
|
8
|
+
this.skipList = new skip_list_1.SkipList(compare);
|
|
9
|
+
}
|
|
10
|
+
get [Symbol.toStringTag]() {
|
|
11
|
+
return this.constructor.name;
|
|
12
|
+
}
|
|
13
|
+
*[Symbol.iterator]() {
|
|
14
|
+
for (const value of this.values()) {
|
|
15
|
+
yield value;
|
|
16
|
+
}
|
|
17
|
+
}
|
|
18
|
+
values() {
|
|
19
|
+
return (0, iterable_operator_1.map)(this.skipList.elements(), node => node.value);
|
|
20
|
+
}
|
|
21
|
+
has(value) {
|
|
22
|
+
return this.skipList.has(value);
|
|
23
|
+
}
|
|
24
|
+
add(value) {
|
|
25
|
+
this.skipList.add(value);
|
|
26
|
+
}
|
|
27
|
+
delete(value) {
|
|
28
|
+
this.skipList.delete(value);
|
|
29
|
+
}
|
|
30
|
+
}
|
|
31
|
+
exports.SortedSet = SortedSet;
|
|
32
|
+
//# sourceMappingURL=sorted-set.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"sorted-set.js","sourceRoot":"","sources":["../../src/sorted-set.ts"],"names":[],"mappings":";;;AAAA,gDAA2C;AAC3C,yDAAuC;AAEvC,MAAa,SAAS;IAapB,YAAY,OAA+B;QACzC,IAAI,CAAC,QAAQ,GAAG,IAAI,oBAAQ,CAAC,OAAO,CAAC,CAAA;IACvC,CAAC;IAZD,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAA;IAC9B,CAAC;IAED,CAAE,CAAC,MAAM,CAAC,QAAQ,CAAC;QACjB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE;YACjC,MAAM,KAAK,CAAA;SACZ;IACH,CAAC;IAMD,MAAM;QACJ,OAAO,IAAA,uBAAG,EAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,KAAM,CAAC,CAAA;IAC3D,CAAC;IAED,GAAG,CAAC,KAAQ;QACV,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;IACjC,CAAC;IAED,GAAG,CAAC,KAAQ;QACV,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;IAC1B,CAAC;IAED,MAAM,CAAC,KAAQ;QACb,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;IAC7B,CAAC;CACF;AAhCD,8BAgCC"}
|
|
@@ -3,6 +3,7 @@ export declare class SparseSet implements Iterable<number> {
|
|
|
3
3
|
private valueToIndex;
|
|
4
4
|
get [Symbol.toStringTag](): string;
|
|
5
5
|
[Symbol.iterator](): IterableIterator<number>;
|
|
6
|
+
constructor(array?: number[]);
|
|
6
7
|
values(): Iterable<number>;
|
|
7
8
|
has(value: number): boolean;
|
|
8
9
|
add(value: number): void;
|
package/lib/es2015/sparse-set.js
CHANGED
|
@@ -2,9 +2,15 @@
|
|
|
2
2
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
3
|
exports.SparseSet = void 0;
|
|
4
4
|
class SparseSet {
|
|
5
|
-
constructor() {
|
|
5
|
+
constructor(array = []) {
|
|
6
6
|
this.indexToValue = [];
|
|
7
|
-
|
|
7
|
+
const valueToIndex = [];
|
|
8
|
+
if (array.length > 0) {
|
|
9
|
+
for (const [index, value] of array.entries()) {
|
|
10
|
+
valueToIndex[value] = index;
|
|
11
|
+
}
|
|
12
|
+
}
|
|
13
|
+
this.valueToIndex = valueToIndex;
|
|
8
14
|
}
|
|
9
15
|
get [Symbol.toStringTag]() {
|
|
10
16
|
return this.constructor.name;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"sparse-set.js","sourceRoot":"","sources":["../../src/sparse-set.ts"],"names":[],"mappings":";;;AAAA,MAAa,SAAS;
|
|
1
|
+
{"version":3,"file":"sparse-set.js","sourceRoot":"","sources":["../../src/sparse-set.ts"],"names":[],"mappings":";;;AAAA,MAAa,SAAS;IAYpB,YAAY,QAAkB,EAAE;QAXxB,iBAAY,GAAa,EAAE,CAAA;QAYjC,MAAM,YAAY,GAA8B,EAAE,CAAA;QAClD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;YACpB,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE;gBAC5C,YAAY,CAAC,KAAK,CAAC,GAAG,KAAK,CAAA;aAC5B;SACF;QAED,IAAI,CAAC,YAAY,GAAG,YAAY,CAAA;IAClC,CAAC;IAjBD,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAA;IAC9B,CAAC;IAED,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAA;IAC7C,CAAC;IAaD,MAAM;QACJ,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAA;IAC7C,CAAC;IAED,GAAG,CAAC,KAAa;QAEf,OAAO,KAAK,IAAI,IAAI,CAAC,YAAY,CAAA;IACnC,CAAC;IAED,GAAG,CAAC,KAAa;QACf,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;YACpB,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAA;YACtC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YAC7B,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,KAAK,CAAA;SACjC;IACH,CAAC;IAED,MAAM,CAAC,KAAa;QAClB,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;YACnB,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,EAAG,CAAA;YAC1C,IAAI,KAAK,KAAK,SAAS,EAAE;gBACvB,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAA;aAChC;iBAAM;gBACL,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAE,CAAA;gBACvC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,SAAS,CAAA;gBACpC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,GAAG,KAAK,CAAA;gBAEpC,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAA;aAChC;SACF;IACH,CAAC;CACF;AAtDD,8BAsDC"}
|
|
@@ -0,0 +1,24 @@
|
|
|
1
|
+
export declare class SkipListNode<T> {
|
|
2
|
+
value: T | null;
|
|
3
|
+
previous: SkipListNode<T> | null;
|
|
4
|
+
next: SkipListNode<T> | null;
|
|
5
|
+
up: SkipListNode<T> | null;
|
|
6
|
+
down: SkipListNode<T> | null;
|
|
7
|
+
constructor(value: T | null);
|
|
8
|
+
}
|
|
9
|
+
export declare class SkipList<T> {
|
|
10
|
+
private compare;
|
|
11
|
+
private head;
|
|
12
|
+
private tail;
|
|
13
|
+
private height;
|
|
14
|
+
private _size;
|
|
15
|
+
get size(): number;
|
|
16
|
+
constructor(compare: (a: T, b: T) => number);
|
|
17
|
+
elements(): IterableIterator<SkipListNode<T>>;
|
|
18
|
+
dumpList(): Array<Array<T | null | undefined>>;
|
|
19
|
+
delete(value: T): void;
|
|
20
|
+
has(value: T): boolean;
|
|
21
|
+
findNode(value: T): SkipListNode<T> | null;
|
|
22
|
+
add(value: T): void;
|
|
23
|
+
private findPreviousNode;
|
|
24
|
+
}
|
|
@@ -0,0 +1,155 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
exports.SkipList = exports.SkipListNode = void 0;
|
|
4
|
+
const types_1 = require("@blackglory/types");
|
|
5
|
+
class SkipListNode {
|
|
6
|
+
constructor(value) {
|
|
7
|
+
this.value = value;
|
|
8
|
+
this.previous = null;
|
|
9
|
+
this.next = null;
|
|
10
|
+
this.up = null;
|
|
11
|
+
this.down = null;
|
|
12
|
+
}
|
|
13
|
+
}
|
|
14
|
+
exports.SkipListNode = SkipListNode;
|
|
15
|
+
class SkipList {
|
|
16
|
+
constructor(compare) {
|
|
17
|
+
this.compare = compare;
|
|
18
|
+
this.head = new SkipListNode(null);
|
|
19
|
+
this.tail = new SkipListNode(null);
|
|
20
|
+
this.height = 0;
|
|
21
|
+
this._size = 0;
|
|
22
|
+
this.head.next = this.tail;
|
|
23
|
+
this.tail.previous = this.head;
|
|
24
|
+
}
|
|
25
|
+
get size() {
|
|
26
|
+
return this._size;
|
|
27
|
+
}
|
|
28
|
+
*elements() {
|
|
29
|
+
let currentNode = this.head;
|
|
30
|
+
while (currentNode.down) {
|
|
31
|
+
currentNode = currentNode.down;
|
|
32
|
+
}
|
|
33
|
+
while (currentNode.next && (0, types_1.isntNull)(currentNode.next.value)) {
|
|
34
|
+
currentNode = currentNode.next;
|
|
35
|
+
yield currentNode;
|
|
36
|
+
}
|
|
37
|
+
}
|
|
38
|
+
dumpList() {
|
|
39
|
+
const result = [];
|
|
40
|
+
let head = this.head;
|
|
41
|
+
do {
|
|
42
|
+
result.push([]);
|
|
43
|
+
let currentNode = head;
|
|
44
|
+
do {
|
|
45
|
+
result[result.length - 1].push(currentNode.value);
|
|
46
|
+
currentNode = currentNode.next;
|
|
47
|
+
} while (currentNode);
|
|
48
|
+
} while (head = head.down);
|
|
49
|
+
return result;
|
|
50
|
+
}
|
|
51
|
+
delete(value) {
|
|
52
|
+
let currentNode = this.findNode(value);
|
|
53
|
+
while (currentNode) {
|
|
54
|
+
currentNode.previous.next = currentNode.next;
|
|
55
|
+
currentNode.next.previous = currentNode.previous;
|
|
56
|
+
currentNode = currentNode.down;
|
|
57
|
+
}
|
|
58
|
+
this._size--;
|
|
59
|
+
}
|
|
60
|
+
has(value) {
|
|
61
|
+
return (0, types_1.isntNull)(this.findNode(value));
|
|
62
|
+
}
|
|
63
|
+
findNode(value) {
|
|
64
|
+
let currentNode = this.head;
|
|
65
|
+
while (true) {
|
|
66
|
+
while (currentNode.next && (0, types_1.isntNull)(currentNode.next.value)) {
|
|
67
|
+
const result = this.compare(currentNode.next.value, value);
|
|
68
|
+
if (result === 0) {
|
|
69
|
+
return currentNode.next;
|
|
70
|
+
}
|
|
71
|
+
else if (result < 0) {
|
|
72
|
+
currentNode = currentNode.next;
|
|
73
|
+
}
|
|
74
|
+
else {
|
|
75
|
+
break;
|
|
76
|
+
}
|
|
77
|
+
}
|
|
78
|
+
if (currentNode.down) {
|
|
79
|
+
currentNode = currentNode.down;
|
|
80
|
+
}
|
|
81
|
+
else {
|
|
82
|
+
return null;
|
|
83
|
+
}
|
|
84
|
+
}
|
|
85
|
+
}
|
|
86
|
+
add(value) {
|
|
87
|
+
let previousNode = this.findPreviousNode(value);
|
|
88
|
+
if (previousNode.next &&
|
|
89
|
+
(0, types_1.isntNull)(previousNode.next.value) &&
|
|
90
|
+
this.compare(previousNode.next.value, value) === 0) {
|
|
91
|
+
return;
|
|
92
|
+
}
|
|
93
|
+
let newNode = new SkipListNode(value);
|
|
94
|
+
if (previousNode.next) {
|
|
95
|
+
newNode.next = previousNode.next;
|
|
96
|
+
previousNode.next.previous = newNode;
|
|
97
|
+
}
|
|
98
|
+
previousNode.next = newNode;
|
|
99
|
+
newNode.previous = previousNode;
|
|
100
|
+
let level = 0;
|
|
101
|
+
while (Math.random() < 0.5) {
|
|
102
|
+
if (level === this.height) {
|
|
103
|
+
const newHead = new SkipListNode(null);
|
|
104
|
+
const newTail = new SkipListNode(null);
|
|
105
|
+
newHead.next = newTail;
|
|
106
|
+
newHead.down = this.head;
|
|
107
|
+
newTail.previous = newHead;
|
|
108
|
+
newTail.down = this.tail;
|
|
109
|
+
this.head.up = newHead;
|
|
110
|
+
this.tail.up = newTail;
|
|
111
|
+
this.head = newHead;
|
|
112
|
+
this.tail = newTail;
|
|
113
|
+
this.height++;
|
|
114
|
+
}
|
|
115
|
+
while (!previousNode.up) {
|
|
116
|
+
previousNode = previousNode.previous;
|
|
117
|
+
}
|
|
118
|
+
previousNode = previousNode.up;
|
|
119
|
+
const upperNewNode = new SkipListNode(value);
|
|
120
|
+
if (previousNode.next) {
|
|
121
|
+
upperNewNode.next = previousNode.next;
|
|
122
|
+
previousNode.next.previous = upperNewNode;
|
|
123
|
+
}
|
|
124
|
+
previousNode.next = upperNewNode;
|
|
125
|
+
upperNewNode.previous = previousNode;
|
|
126
|
+
upperNewNode.down = newNode;
|
|
127
|
+
newNode.up = upperNewNode;
|
|
128
|
+
newNode = upperNewNode;
|
|
129
|
+
level++;
|
|
130
|
+
}
|
|
131
|
+
this._size++;
|
|
132
|
+
}
|
|
133
|
+
findPreviousNode(value) {
|
|
134
|
+
let currentNode = this.head;
|
|
135
|
+
while (true) {
|
|
136
|
+
while (currentNode.next && (0, types_1.isntNull)(currentNode.next.value)) {
|
|
137
|
+
const result = this.compare(currentNode.next.value, value);
|
|
138
|
+
if (result >= 0) {
|
|
139
|
+
break;
|
|
140
|
+
}
|
|
141
|
+
else {
|
|
142
|
+
currentNode = currentNode.next;
|
|
143
|
+
}
|
|
144
|
+
}
|
|
145
|
+
if (currentNode.down) {
|
|
146
|
+
currentNode = currentNode.down;
|
|
147
|
+
}
|
|
148
|
+
else {
|
|
149
|
+
return currentNode;
|
|
150
|
+
}
|
|
151
|
+
}
|
|
152
|
+
}
|
|
153
|
+
}
|
|
154
|
+
exports.SkipList = SkipList;
|
|
155
|
+
//# sourceMappingURL=skip-list.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"skip-list.js","sourceRoot":"","sources":["../../../src/utils/skip-list.ts"],"names":[],"mappings":";;;AAAA,6CAA4C;AAE5C,MAAa,YAAY;IAMvB,YAAmB,KAAe;QAAf,UAAK,GAAL,KAAK,CAAU;QALlC,aAAQ,GAA2B,IAAI,CAAA;QACvC,SAAI,GAA2B,IAAI,CAAA;QACnC,OAAE,GAA2B,IAAI,CAAA;QACjC,SAAI,GAA2B,IAAI,CAAA;IAEE,CAAC;CACvC;AAPD,oCAOC;AAED,MAAa,QAAQ;IAcnB,YAAoB,OAA+B;QAA/B,YAAO,GAAP,OAAO,CAAwB;QAZ3C,SAAI,GAAoB,IAAI,YAAY,CAAI,IAAI,CAAC,CAAA;QAEjD,SAAI,GAAoB,IAAI,YAAY,CAAI,IAAI,CAAC,CAAA;QAEjD,WAAM,GAAW,CAAC,CAAA;QAClB,UAAK,GAAW,CAAC,CAAA;QAQvB,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QAC1B,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAA;IAChC,CAAC;IAPD,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAA;IACnB,CAAC;IAOD,CAAE,QAAQ;QACR,IAAI,WAAW,GAAoB,IAAI,CAAC,IAAI,CAAA;QAE5C,OAAO,WAAW,CAAC,IAAI,EAAE;YACvB,WAAW,GAAG,WAAW,CAAC,IAAI,CAAA;SAC/B;QAED,OAAO,WAAW,CAAC,IAAI,IAAI,IAAA,gBAAQ,EAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;YAC3D,WAAW,GAAG,WAAW,CAAC,IAAI,CAAA;YAC9B,MAAM,WAAW,CAAA;SAClB;IACH,CAAC;IAED,QAAQ;QACN,MAAM,MAAM,GAAuC,EAAE,CAAA;QACrD,IAAI,IAAI,GAA2B,IAAI,CAAC,IAAI,CAAA;QAE5C,GAAG;YACD,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YACf,IAAI,WAAW,GAA2B,IAAI,CAAA;YAC9C,GAAG;gBACD,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAA;gBACjD,WAAW,GAAG,WAAW,CAAC,IAAI,CAAA;aAC/B,QAAQ,WAAW,EAAC;SACtB,QAAQ,IAAI,GAAG,IAAI,CAAC,IAAI,EAAC;QAE1B,OAAO,MAAM,CAAA;IACf,CAAC;IAED,MAAM,CAAC,KAAQ;QACb,IAAI,WAAW,GAA2B,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAA;QAE9D,OAAO,WAAW,EAAE;YAElB,WAAW,CAAC,QAAS,CAAC,IAAI,GAAG,WAAW,CAAC,IAAI,CAAA;YAG7C,WAAW,CAAC,IAAK,CAAC,QAAQ,GAAG,WAAW,CAAC,QAAQ,CAAA;YAEjD,WAAW,GAAG,WAAW,CAAC,IAAI,CAAA;SAC/B;QAED,IAAI,CAAC,KAAK,EAAE,CAAA;IACd,CAAC;IAED,GAAG,CAAC,KAAQ;QACV,OAAO,IAAA,gBAAQ,EAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAA;IACvC,CAAC;IAED,QAAQ,CAAC,KAAQ;QACf,IAAI,WAAW,GAAoB,IAAI,CAAC,IAAI,CAAA;QAE5C,OAAO,IAAI,EAAE;YACX,OAAO,WAAW,CAAC,IAAI,IAAI,IAAA,gBAAQ,EAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;gBAC3D,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;gBAC1D,IAAI,MAAM,KAAK,CAAC,EAAE;oBAChB,OAAO,WAAW,CAAC,IAAI,CAAA;iBACxB;qBAAM,IAAI,MAAM,GAAG,CAAC,EAAE;oBACrB,WAAW,GAAG,WAAW,CAAC,IAAI,CAAA;iBAC/B;qBAAM;oBACL,MAAK;iBACN;aACF;YAED,IAAI,WAAW,CAAC,IAAI,EAAE;gBACpB,WAAW,GAAG,WAAW,CAAC,IAAI,CAAA;aAC/B;iBAAM;gBACL,OAAO,IAAI,CAAA;aACZ;SACF;IACH,CAAC;IAED,GAAG,CAAC,KAAQ;QACV,IAAI,YAAY,GAAoB,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAA;QAGhE,IACE,YAAY,CAAC,IAAI;YACjB,IAAA,gBAAQ,EAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC;YACjC,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,EAClD;YACA,OAAM;SACP;QAED,IAAI,OAAO,GAAoB,IAAI,YAAY,CAAC,KAAK,CAAC,CAAA;QAEtD,IAAI,YAAY,CAAC,IAAI,EAAE;YACrB,OAAO,CAAC,IAAI,GAAG,YAAY,CAAC,IAAI,CAAA;YAChC,YAAY,CAAC,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAA;SACrC;QACD,YAAY,CAAC,IAAI,GAAG,OAAO,CAAA;QAC3B,OAAO,CAAC,QAAQ,GAAG,YAAY,CAAA;QAI/B,IAAI,KAAK,GAAG,CAAC,CAAA;QACb,OAAO,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,EAAE;YAE1B,IAAI,KAAK,KAAK,IAAI,CAAC,MAAM,EAAE;gBACzB,MAAM,OAAO,GAAoB,IAAI,YAAY,CAAI,IAAI,CAAC,CAAA;gBAC1D,MAAM,OAAO,GAAoB,IAAI,YAAY,CAAI,IAAI,CAAC,CAAA;gBAE1D,OAAO,CAAC,IAAI,GAAG,OAAO,CAAA;gBACtB,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;gBAExB,OAAO,CAAC,QAAQ,GAAG,OAAO,CAAA;gBAC1B,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;gBAExB,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,OAAO,CAAA;gBACtB,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,OAAO,CAAA;gBAEtB,IAAI,CAAC,IAAI,GAAG,OAAO,CAAA;gBACnB,IAAI,CAAC,IAAI,GAAG,OAAO,CAAA;gBAEnB,IAAI,CAAC,MAAM,EAAE,CAAA;aACd;YAGD,OAAO,CAAC,YAAY,CAAC,EAAE,EAAE;gBAEvB,YAAY,GAAG,YAAY,CAAC,QAAS,CAAA;aACtC;YAED,YAAY,GAAG,YAAY,CAAC,EAAG,CAAA;YAG/B,MAAM,YAAY,GAAoB,IAAI,YAAY,CAAI,KAAK,CAAC,CAAA;YAChE,IAAI,YAAY,CAAC,IAAI,EAAE;gBACrB,YAAY,CAAC,IAAI,GAAG,YAAY,CAAC,IAAI,CAAA;gBACrC,YAAY,CAAC,IAAI,CAAC,QAAQ,GAAG,YAAY,CAAA;aAC1C;YACD,YAAY,CAAC,IAAI,GAAG,YAAY,CAAA;YAChC,YAAY,CAAC,QAAQ,GAAG,YAAY,CAAA;YAEpC,YAAY,CAAC,IAAI,GAAG,OAAO,CAAA;YAC3B,OAAO,CAAC,EAAE,GAAG,YAAY,CAAA;YACzB,OAAO,GAAG,YAAY,CAAA;YAEtB,KAAK,EAAE,CAAA;SACR;QAED,IAAI,CAAC,KAAK,EAAE,CAAA;IACd,CAAC;IAEO,gBAAgB,CAAC,KAAQ;QAC/B,IAAI,WAAW,GAAoB,IAAI,CAAC,IAAI,CAAA;QAE5C,OAAO,IAAI,EAAE;YACX,OAAO,WAAW,CAAC,IAAI,IAAI,IAAA,gBAAQ,EAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;gBAC3D,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;gBAC1D,IAAI,MAAM,IAAI,CAAC,EAAE;oBACf,MAAK;iBACN;qBAAM;oBACL,WAAW,GAAG,WAAW,CAAC,IAAI,CAAA;iBAC/B;aACF;YAED,IAAI,WAAW,CAAC,IAAI,EAAE;gBACpB,WAAW,GAAG,WAAW,CAAC,IAAI,CAAA;aAC/B;iBAAM;gBACL,OAAO,WAAW,CAAA;aACnB;SACF;IACH,CAAC;CACF;AAvLD,4BAuLC"}
|
package/lib/es2018/index.d.ts
CHANGED
package/lib/es2018/index.js
CHANGED
|
@@ -33,4 +33,5 @@ __exportStar(require("./typed-sparse-map"), exports);
|
|
|
33
33
|
__exportStar(require("./typed-sparse-set"), exports);
|
|
34
34
|
var dynamic_typed_array_1 = require("./dynamic-typed-array");
|
|
35
35
|
Object.defineProperty(exports, "DynamicTypedArray", { enumerable: true, get: function () { return dynamic_typed_array_1.DynamicTypedArray; } });
|
|
36
|
+
__exportStar(require("./sorted-set"), exports);
|
|
36
37
|
//# sourceMappingURL=index.js.map
|
package/lib/es2018/index.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;AAAA,wCAAqB;AACrB,yCAAsB;AACtB,4CAAyB;AACzB,6CAA0B;AAC1B,6CAA0B;AAC1B,0CAAuB;AACvB,4CAAyB;AACzB,kDAA+B;AAC/B,6CAA0B;AAC1B,6CAA0B;AAC1B,yDAAsC;AACtC,oEAAiD;AACjD,+CAA4B;AAC5B,+CAA4B;AAC5B,qDAAkC;AAClC,qDAAkC;AAClC,6DAAyD;AAAhD,wHAAA,iBAAiB,OAAA"}
|
|
1
|
+
{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;AAAA,wCAAqB;AACrB,yCAAsB;AACtB,4CAAyB;AACzB,6CAA0B;AAC1B,6CAA0B;AAC1B,0CAAuB;AACvB,4CAAyB;AACzB,kDAA+B;AAC/B,6CAA0B;AAC1B,6CAA0B;AAC1B,yDAAsC;AACtC,oEAAiD;AACjD,+CAA4B;AAC5B,+CAA4B;AAC5B,qDAAkC;AAClC,qDAAkC;AAClC,6DAAyD;AAAhD,wHAAA,iBAAiB,OAAA;AAC1B,+CAA4B"}
|
|
@@ -0,0 +1,10 @@
|
|
|
1
|
+
export declare class SortedSet<T> implements Iterable<T> {
|
|
2
|
+
private skipList;
|
|
3
|
+
get [Symbol.toStringTag](): string;
|
|
4
|
+
[Symbol.iterator](): IterableIterator<T>;
|
|
5
|
+
constructor(compare: (a: T, b: T) => number);
|
|
6
|
+
values(): Iterable<T>;
|
|
7
|
+
has(value: T): boolean;
|
|
8
|
+
add(value: T): void;
|
|
9
|
+
delete(value: T): void;
|
|
10
|
+
}
|
|
@@ -0,0 +1,32 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
exports.SortedSet = void 0;
|
|
4
|
+
const skip_list_1 = require("./utils/skip-list");
|
|
5
|
+
const iterable_operator_1 = require("iterable-operator");
|
|
6
|
+
class SortedSet {
|
|
7
|
+
constructor(compare) {
|
|
8
|
+
this.skipList = new skip_list_1.SkipList(compare);
|
|
9
|
+
}
|
|
10
|
+
get [Symbol.toStringTag]() {
|
|
11
|
+
return this.constructor.name;
|
|
12
|
+
}
|
|
13
|
+
*[Symbol.iterator]() {
|
|
14
|
+
for (const value of this.values()) {
|
|
15
|
+
yield value;
|
|
16
|
+
}
|
|
17
|
+
}
|
|
18
|
+
values() {
|
|
19
|
+
return (0, iterable_operator_1.map)(this.skipList.elements(), node => node.value);
|
|
20
|
+
}
|
|
21
|
+
has(value) {
|
|
22
|
+
return this.skipList.has(value);
|
|
23
|
+
}
|
|
24
|
+
add(value) {
|
|
25
|
+
this.skipList.add(value);
|
|
26
|
+
}
|
|
27
|
+
delete(value) {
|
|
28
|
+
this.skipList.delete(value);
|
|
29
|
+
}
|
|
30
|
+
}
|
|
31
|
+
exports.SortedSet = SortedSet;
|
|
32
|
+
//# sourceMappingURL=sorted-set.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"sorted-set.js","sourceRoot":"","sources":["../../src/sorted-set.ts"],"names":[],"mappings":";;;AAAA,gDAA2C;AAC3C,yDAAuC;AAEvC,MAAa,SAAS;IAapB,YAAY,OAA+B;QACzC,IAAI,CAAC,QAAQ,GAAG,IAAI,oBAAQ,CAAC,OAAO,CAAC,CAAA;IACvC,CAAC;IAZD,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAA;IAC9B,CAAC;IAED,CAAE,CAAC,MAAM,CAAC,QAAQ,CAAC;QACjB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE;YACjC,MAAM,KAAK,CAAA;SACZ;IACH,CAAC;IAMD,MAAM;QACJ,OAAO,IAAA,uBAAG,EAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,KAAM,CAAC,CAAA;IAC3D,CAAC;IAED,GAAG,CAAC,KAAQ;QACV,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;IACjC,CAAC;IAED,GAAG,CAAC,KAAQ;QACV,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;IAC1B,CAAC;IAED,MAAM,CAAC,KAAQ;QACb,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;IAC7B,CAAC;CACF;AAhCD,8BAgCC"}
|
|
@@ -3,6 +3,7 @@ export declare class SparseSet implements Iterable<number> {
|
|
|
3
3
|
private valueToIndex;
|
|
4
4
|
get [Symbol.toStringTag](): string;
|
|
5
5
|
[Symbol.iterator](): IterableIterator<number>;
|
|
6
|
+
constructor(array?: number[]);
|
|
6
7
|
values(): Iterable<number>;
|
|
7
8
|
has(value: number): boolean;
|
|
8
9
|
add(value: number): void;
|
package/lib/es2018/sparse-set.js
CHANGED
|
@@ -2,9 +2,15 @@
|
|
|
2
2
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
3
|
exports.SparseSet = void 0;
|
|
4
4
|
class SparseSet {
|
|
5
|
-
constructor() {
|
|
5
|
+
constructor(array = []) {
|
|
6
6
|
this.indexToValue = [];
|
|
7
|
-
|
|
7
|
+
const valueToIndex = [];
|
|
8
|
+
if (array.length > 0) {
|
|
9
|
+
for (const [index, value] of array.entries()) {
|
|
10
|
+
valueToIndex[value] = index;
|
|
11
|
+
}
|
|
12
|
+
}
|
|
13
|
+
this.valueToIndex = valueToIndex;
|
|
8
14
|
}
|
|
9
15
|
get [Symbol.toStringTag]() {
|
|
10
16
|
return this.constructor.name;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"sparse-set.js","sourceRoot":"","sources":["../../src/sparse-set.ts"],"names":[],"mappings":";;;AAAA,MAAa,SAAS;
|
|
1
|
+
{"version":3,"file":"sparse-set.js","sourceRoot":"","sources":["../../src/sparse-set.ts"],"names":[],"mappings":";;;AAAA,MAAa,SAAS;IAYpB,YAAY,QAAkB,EAAE;QAXxB,iBAAY,GAAa,EAAE,CAAA;QAYjC,MAAM,YAAY,GAA8B,EAAE,CAAA;QAClD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;YACpB,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE;gBAC5C,YAAY,CAAC,KAAK,CAAC,GAAG,KAAK,CAAA;aAC5B;SACF;QAED,IAAI,CAAC,YAAY,GAAG,YAAY,CAAA;IAClC,CAAC;IAjBD,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAA;IAC9B,CAAC;IAED,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAA;IAC7C,CAAC;IAaD,MAAM;QACJ,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAA;IAC7C,CAAC;IAED,GAAG,CAAC,KAAa;QAEf,OAAO,KAAK,IAAI,IAAI,CAAC,YAAY,CAAA;IACnC,CAAC;IAED,GAAG,CAAC,KAAa;QACf,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;YACpB,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAA;YACtC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YAC7B,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,KAAK,CAAA;SACjC;IACH,CAAC;IAED,MAAM,CAAC,KAAa;QAClB,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;YACnB,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,EAAG,CAAA;YAC1C,IAAI,KAAK,KAAK,SAAS,EAAE;gBACvB,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAA;aAChC;iBAAM;gBACL,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAE,CAAA;gBACvC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,SAAS,CAAA;gBACpC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,GAAG,KAAK,CAAA;gBAEpC,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAA;aAChC;SACF;IACH,CAAC;CACF;AAtDD,8BAsDC"}
|
|
@@ -0,0 +1,24 @@
|
|
|
1
|
+
export declare class SkipListNode<T> {
|
|
2
|
+
value: T | null;
|
|
3
|
+
previous: SkipListNode<T> | null;
|
|
4
|
+
next: SkipListNode<T> | null;
|
|
5
|
+
up: SkipListNode<T> | null;
|
|
6
|
+
down: SkipListNode<T> | null;
|
|
7
|
+
constructor(value: T | null);
|
|
8
|
+
}
|
|
9
|
+
export declare class SkipList<T> {
|
|
10
|
+
private compare;
|
|
11
|
+
private head;
|
|
12
|
+
private tail;
|
|
13
|
+
private height;
|
|
14
|
+
private _size;
|
|
15
|
+
get size(): number;
|
|
16
|
+
constructor(compare: (a: T, b: T) => number);
|
|
17
|
+
elements(): IterableIterator<SkipListNode<T>>;
|
|
18
|
+
dumpList(): Array<Array<T | null | undefined>>;
|
|
19
|
+
delete(value: T): void;
|
|
20
|
+
has(value: T): boolean;
|
|
21
|
+
findNode(value: T): SkipListNode<T> | null;
|
|
22
|
+
add(value: T): void;
|
|
23
|
+
private findPreviousNode;
|
|
24
|
+
}
|
|
@@ -0,0 +1,155 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
exports.SkipList = exports.SkipListNode = void 0;
|
|
4
|
+
const types_1 = require("@blackglory/types");
|
|
5
|
+
class SkipListNode {
|
|
6
|
+
constructor(value) {
|
|
7
|
+
this.value = value;
|
|
8
|
+
this.previous = null;
|
|
9
|
+
this.next = null;
|
|
10
|
+
this.up = null;
|
|
11
|
+
this.down = null;
|
|
12
|
+
}
|
|
13
|
+
}
|
|
14
|
+
exports.SkipListNode = SkipListNode;
|
|
15
|
+
class SkipList {
|
|
16
|
+
constructor(compare) {
|
|
17
|
+
this.compare = compare;
|
|
18
|
+
this.head = new SkipListNode(null);
|
|
19
|
+
this.tail = new SkipListNode(null);
|
|
20
|
+
this.height = 0;
|
|
21
|
+
this._size = 0;
|
|
22
|
+
this.head.next = this.tail;
|
|
23
|
+
this.tail.previous = this.head;
|
|
24
|
+
}
|
|
25
|
+
get size() {
|
|
26
|
+
return this._size;
|
|
27
|
+
}
|
|
28
|
+
*elements() {
|
|
29
|
+
let currentNode = this.head;
|
|
30
|
+
while (currentNode.down) {
|
|
31
|
+
currentNode = currentNode.down;
|
|
32
|
+
}
|
|
33
|
+
while (currentNode.next && (0, types_1.isntNull)(currentNode.next.value)) {
|
|
34
|
+
currentNode = currentNode.next;
|
|
35
|
+
yield currentNode;
|
|
36
|
+
}
|
|
37
|
+
}
|
|
38
|
+
dumpList() {
|
|
39
|
+
const result = [];
|
|
40
|
+
let head = this.head;
|
|
41
|
+
do {
|
|
42
|
+
result.push([]);
|
|
43
|
+
let currentNode = head;
|
|
44
|
+
do {
|
|
45
|
+
result[result.length - 1].push(currentNode.value);
|
|
46
|
+
currentNode = currentNode.next;
|
|
47
|
+
} while (currentNode);
|
|
48
|
+
} while (head = head.down);
|
|
49
|
+
return result;
|
|
50
|
+
}
|
|
51
|
+
delete(value) {
|
|
52
|
+
let currentNode = this.findNode(value);
|
|
53
|
+
while (currentNode) {
|
|
54
|
+
currentNode.previous.next = currentNode.next;
|
|
55
|
+
currentNode.next.previous = currentNode.previous;
|
|
56
|
+
currentNode = currentNode.down;
|
|
57
|
+
}
|
|
58
|
+
this._size--;
|
|
59
|
+
}
|
|
60
|
+
has(value) {
|
|
61
|
+
return (0, types_1.isntNull)(this.findNode(value));
|
|
62
|
+
}
|
|
63
|
+
findNode(value) {
|
|
64
|
+
let currentNode = this.head;
|
|
65
|
+
while (true) {
|
|
66
|
+
while (currentNode.next && (0, types_1.isntNull)(currentNode.next.value)) {
|
|
67
|
+
const result = this.compare(currentNode.next.value, value);
|
|
68
|
+
if (result === 0) {
|
|
69
|
+
return currentNode.next;
|
|
70
|
+
}
|
|
71
|
+
else if (result < 0) {
|
|
72
|
+
currentNode = currentNode.next;
|
|
73
|
+
}
|
|
74
|
+
else {
|
|
75
|
+
break;
|
|
76
|
+
}
|
|
77
|
+
}
|
|
78
|
+
if (currentNode.down) {
|
|
79
|
+
currentNode = currentNode.down;
|
|
80
|
+
}
|
|
81
|
+
else {
|
|
82
|
+
return null;
|
|
83
|
+
}
|
|
84
|
+
}
|
|
85
|
+
}
|
|
86
|
+
add(value) {
|
|
87
|
+
let previousNode = this.findPreviousNode(value);
|
|
88
|
+
if (previousNode.next &&
|
|
89
|
+
(0, types_1.isntNull)(previousNode.next.value) &&
|
|
90
|
+
this.compare(previousNode.next.value, value) === 0) {
|
|
91
|
+
return;
|
|
92
|
+
}
|
|
93
|
+
let newNode = new SkipListNode(value);
|
|
94
|
+
if (previousNode.next) {
|
|
95
|
+
newNode.next = previousNode.next;
|
|
96
|
+
previousNode.next.previous = newNode;
|
|
97
|
+
}
|
|
98
|
+
previousNode.next = newNode;
|
|
99
|
+
newNode.previous = previousNode;
|
|
100
|
+
let level = 0;
|
|
101
|
+
while (Math.random() < 0.5) {
|
|
102
|
+
if (level === this.height) {
|
|
103
|
+
const newHead = new SkipListNode(null);
|
|
104
|
+
const newTail = new SkipListNode(null);
|
|
105
|
+
newHead.next = newTail;
|
|
106
|
+
newHead.down = this.head;
|
|
107
|
+
newTail.previous = newHead;
|
|
108
|
+
newTail.down = this.tail;
|
|
109
|
+
this.head.up = newHead;
|
|
110
|
+
this.tail.up = newTail;
|
|
111
|
+
this.head = newHead;
|
|
112
|
+
this.tail = newTail;
|
|
113
|
+
this.height++;
|
|
114
|
+
}
|
|
115
|
+
while (!previousNode.up) {
|
|
116
|
+
previousNode = previousNode.previous;
|
|
117
|
+
}
|
|
118
|
+
previousNode = previousNode.up;
|
|
119
|
+
const upperNewNode = new SkipListNode(value);
|
|
120
|
+
if (previousNode.next) {
|
|
121
|
+
upperNewNode.next = previousNode.next;
|
|
122
|
+
previousNode.next.previous = upperNewNode;
|
|
123
|
+
}
|
|
124
|
+
previousNode.next = upperNewNode;
|
|
125
|
+
upperNewNode.previous = previousNode;
|
|
126
|
+
upperNewNode.down = newNode;
|
|
127
|
+
newNode.up = upperNewNode;
|
|
128
|
+
newNode = upperNewNode;
|
|
129
|
+
level++;
|
|
130
|
+
}
|
|
131
|
+
this._size++;
|
|
132
|
+
}
|
|
133
|
+
findPreviousNode(value) {
|
|
134
|
+
let currentNode = this.head;
|
|
135
|
+
while (true) {
|
|
136
|
+
while (currentNode.next && (0, types_1.isntNull)(currentNode.next.value)) {
|
|
137
|
+
const result = this.compare(currentNode.next.value, value);
|
|
138
|
+
if (result >= 0) {
|
|
139
|
+
break;
|
|
140
|
+
}
|
|
141
|
+
else {
|
|
142
|
+
currentNode = currentNode.next;
|
|
143
|
+
}
|
|
144
|
+
}
|
|
145
|
+
if (currentNode.down) {
|
|
146
|
+
currentNode = currentNode.down;
|
|
147
|
+
}
|
|
148
|
+
else {
|
|
149
|
+
return currentNode;
|
|
150
|
+
}
|
|
151
|
+
}
|
|
152
|
+
}
|
|
153
|
+
}
|
|
154
|
+
exports.SkipList = SkipList;
|
|
155
|
+
//# sourceMappingURL=skip-list.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"skip-list.js","sourceRoot":"","sources":["../../../src/utils/skip-list.ts"],"names":[],"mappings":";;;AAAA,6CAA4C;AAE5C,MAAa,YAAY;IAMvB,YAAmB,KAAe;QAAf,UAAK,GAAL,KAAK,CAAU;QALlC,aAAQ,GAA2B,IAAI,CAAA;QACvC,SAAI,GAA2B,IAAI,CAAA;QACnC,OAAE,GAA2B,IAAI,CAAA;QACjC,SAAI,GAA2B,IAAI,CAAA;IAEE,CAAC;CACvC;AAPD,oCAOC;AAED,MAAa,QAAQ;IAcnB,YAAoB,OAA+B;QAA/B,YAAO,GAAP,OAAO,CAAwB;QAZ3C,SAAI,GAAoB,IAAI,YAAY,CAAI,IAAI,CAAC,CAAA;QAEjD,SAAI,GAAoB,IAAI,YAAY,CAAI,IAAI,CAAC,CAAA;QAEjD,WAAM,GAAW,CAAC,CAAA;QAClB,UAAK,GAAW,CAAC,CAAA;QAQvB,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QAC1B,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAA;IAChC,CAAC;IAPD,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAA;IACnB,CAAC;IAOD,CAAE,QAAQ;QACR,IAAI,WAAW,GAAoB,IAAI,CAAC,IAAI,CAAA;QAE5C,OAAO,WAAW,CAAC,IAAI,EAAE;YACvB,WAAW,GAAG,WAAW,CAAC,IAAI,CAAA;SAC/B;QAED,OAAO,WAAW,CAAC,IAAI,IAAI,IAAA,gBAAQ,EAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;YAC3D,WAAW,GAAG,WAAW,CAAC,IAAI,CAAA;YAC9B,MAAM,WAAW,CAAA;SAClB;IACH,CAAC;IAED,QAAQ;QACN,MAAM,MAAM,GAAuC,EAAE,CAAA;QACrD,IAAI,IAAI,GAA2B,IAAI,CAAC,IAAI,CAAA;QAE5C,GAAG;YACD,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YACf,IAAI,WAAW,GAA2B,IAAI,CAAA;YAC9C,GAAG;gBACD,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAA;gBACjD,WAAW,GAAG,WAAW,CAAC,IAAI,CAAA;aAC/B,QAAQ,WAAW,EAAC;SACtB,QAAQ,IAAI,GAAG,IAAI,CAAC,IAAI,EAAC;QAE1B,OAAO,MAAM,CAAA;IACf,CAAC;IAED,MAAM,CAAC,KAAQ;QACb,IAAI,WAAW,GAA2B,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAA;QAE9D,OAAO,WAAW,EAAE;YAElB,WAAW,CAAC,QAAS,CAAC,IAAI,GAAG,WAAW,CAAC,IAAI,CAAA;YAG7C,WAAW,CAAC,IAAK,CAAC,QAAQ,GAAG,WAAW,CAAC,QAAQ,CAAA;YAEjD,WAAW,GAAG,WAAW,CAAC,IAAI,CAAA;SAC/B;QAED,IAAI,CAAC,KAAK,EAAE,CAAA;IACd,CAAC;IAED,GAAG,CAAC,KAAQ;QACV,OAAO,IAAA,gBAAQ,EAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAA;IACvC,CAAC;IAED,QAAQ,CAAC,KAAQ;QACf,IAAI,WAAW,GAAoB,IAAI,CAAC,IAAI,CAAA;QAE5C,OAAO,IAAI,EAAE;YACX,OAAO,WAAW,CAAC,IAAI,IAAI,IAAA,gBAAQ,EAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;gBAC3D,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;gBAC1D,IAAI,MAAM,KAAK,CAAC,EAAE;oBAChB,OAAO,WAAW,CAAC,IAAI,CAAA;iBACxB;qBAAM,IAAI,MAAM,GAAG,CAAC,EAAE;oBACrB,WAAW,GAAG,WAAW,CAAC,IAAI,CAAA;iBAC/B;qBAAM;oBACL,MAAK;iBACN;aACF;YAED,IAAI,WAAW,CAAC,IAAI,EAAE;gBACpB,WAAW,GAAG,WAAW,CAAC,IAAI,CAAA;aAC/B;iBAAM;gBACL,OAAO,IAAI,CAAA;aACZ;SACF;IACH,CAAC;IAED,GAAG,CAAC,KAAQ;QACV,IAAI,YAAY,GAAoB,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAA;QAGhE,IACE,YAAY,CAAC,IAAI;YACjB,IAAA,gBAAQ,EAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC;YACjC,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,EAClD;YACA,OAAM;SACP;QAED,IAAI,OAAO,GAAoB,IAAI,YAAY,CAAC,KAAK,CAAC,CAAA;QAEtD,IAAI,YAAY,CAAC,IAAI,EAAE;YACrB,OAAO,CAAC,IAAI,GAAG,YAAY,CAAC,IAAI,CAAA;YAChC,YAAY,CAAC,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAA;SACrC;QACD,YAAY,CAAC,IAAI,GAAG,OAAO,CAAA;QAC3B,OAAO,CAAC,QAAQ,GAAG,YAAY,CAAA;QAI/B,IAAI,KAAK,GAAG,CAAC,CAAA;QACb,OAAO,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,EAAE;YAE1B,IAAI,KAAK,KAAK,IAAI,CAAC,MAAM,EAAE;gBACzB,MAAM,OAAO,GAAoB,IAAI,YAAY,CAAI,IAAI,CAAC,CAAA;gBAC1D,MAAM,OAAO,GAAoB,IAAI,YAAY,CAAI,IAAI,CAAC,CAAA;gBAE1D,OAAO,CAAC,IAAI,GAAG,OAAO,CAAA;gBACtB,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;gBAExB,OAAO,CAAC,QAAQ,GAAG,OAAO,CAAA;gBAC1B,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;gBAExB,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,OAAO,CAAA;gBACtB,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,OAAO,CAAA;gBAEtB,IAAI,CAAC,IAAI,GAAG,OAAO,CAAA;gBACnB,IAAI,CAAC,IAAI,GAAG,OAAO,CAAA;gBAEnB,IAAI,CAAC,MAAM,EAAE,CAAA;aACd;YAGD,OAAO,CAAC,YAAY,CAAC,EAAE,EAAE;gBAEvB,YAAY,GAAG,YAAY,CAAC,QAAS,CAAA;aACtC;YAED,YAAY,GAAG,YAAY,CAAC,EAAG,CAAA;YAG/B,MAAM,YAAY,GAAoB,IAAI,YAAY,CAAI,KAAK,CAAC,CAAA;YAChE,IAAI,YAAY,CAAC,IAAI,EAAE;gBACrB,YAAY,CAAC,IAAI,GAAG,YAAY,CAAC,IAAI,CAAA;gBACrC,YAAY,CAAC,IAAI,CAAC,QAAQ,GAAG,YAAY,CAAA;aAC1C;YACD,YAAY,CAAC,IAAI,GAAG,YAAY,CAAA;YAChC,YAAY,CAAC,QAAQ,GAAG,YAAY,CAAA;YAEpC,YAAY,CAAC,IAAI,GAAG,OAAO,CAAA;YAC3B,OAAO,CAAC,EAAE,GAAG,YAAY,CAAA;YACzB,OAAO,GAAG,YAAY,CAAA;YAEtB,KAAK,EAAE,CAAA;SACR;QAED,IAAI,CAAC,KAAK,EAAE,CAAA;IACd,CAAC;IAEO,gBAAgB,CAAC,KAAQ;QAC/B,IAAI,WAAW,GAAoB,IAAI,CAAC,IAAI,CAAA;QAE5C,OAAO,IAAI,EAAE;YACX,OAAO,WAAW,CAAC,IAAI,IAAI,IAAA,gBAAQ,EAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;gBAC3D,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;gBAC1D,IAAI,MAAM,IAAI,CAAC,EAAE;oBACf,MAAK;iBACN;qBAAM;oBACL,WAAW,GAAG,WAAW,CAAC,IAAI,CAAA;iBAC/B;aACF;YAED,IAAI,WAAW,CAAC,IAAI,EAAE;gBACpB,WAAW,GAAG,WAAW,CAAC,IAAI,CAAA;aAC/B;iBAAM;gBACL,OAAO,WAAW,CAAA;aACnB;SACF;IACH,CAAC;CACF;AAvLD,4BAuLC"}
|