@opensumi/ide-utils 2.16.6

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.
Files changed (169) hide show
  1. package/lib/ansi.d.ts +5 -0
  2. package/lib/ansi.d.ts.map +1 -0
  3. package/lib/ansi.js +14 -0
  4. package/lib/ansi.js.map +1 -0
  5. package/lib/arrays.d.ts +49 -0
  6. package/lib/arrays.d.ts.map +1 -0
  7. package/lib/arrays.js +275 -0
  8. package/lib/arrays.js.map +1 -0
  9. package/lib/async.d.ts +185 -0
  10. package/lib/async.d.ts.map +1 -0
  11. package/lib/async.js +467 -0
  12. package/lib/async.js.map +1 -0
  13. package/lib/buffer.d.ts +35 -0
  14. package/lib/buffer.d.ts.map +1 -0
  15. package/lib/buffer.js +174 -0
  16. package/lib/buffer.js.map +1 -0
  17. package/lib/cache.d.ts +12 -0
  18. package/lib/cache.d.ts.map +1 -0
  19. package/lib/cache.js +37 -0
  20. package/lib/cache.js.map +1 -0
  21. package/lib/cancellation.d.ts +23 -0
  22. package/lib/cancellation.d.ts.map +1 -0
  23. package/lib/cancellation.js +120 -0
  24. package/lib/cancellation.js.map +1 -0
  25. package/lib/charCode.d.ts +406 -0
  26. package/lib/charCode.d.ts.map +1 -0
  27. package/lib/charCode.js +8 -0
  28. package/lib/charCode.js.map +1 -0
  29. package/lib/character-classifier.d.ts +25 -0
  30. package/lib/character-classifier.d.ts.map +1 -0
  31. package/lib/character-classifier.js +59 -0
  32. package/lib/character-classifier.js.map +1 -0
  33. package/lib/const/encoding.d.ts +10 -0
  34. package/lib/const/encoding.d.ts.map +1 -0
  35. package/lib/const/encoding.js +244 -0
  36. package/lib/const/encoding.js.map +1 -0
  37. package/lib/const/index.d.ts +2 -0
  38. package/lib/const/index.d.ts.map +1 -0
  39. package/lib/const/index.js +5 -0
  40. package/lib/const/index.js.map +1 -0
  41. package/lib/date.d.ts +2 -0
  42. package/lib/date.d.ts.map +1 -0
  43. package/lib/date.js +22 -0
  44. package/lib/date.js.map +1 -0
  45. package/lib/decorators.d.ts +11 -0
  46. package/lib/decorators.d.ts.map +1 -0
  47. package/lib/decorators.js +151 -0
  48. package/lib/decorators.js.map +1 -0
  49. package/lib/disposable.d.ts +88 -0
  50. package/lib/disposable.d.ts.map +1 -0
  51. package/lib/disposable.js +316 -0
  52. package/lib/disposable.js.map +1 -0
  53. package/lib/encoding.d.ts +34 -0
  54. package/lib/encoding.d.ts.map +1 -0
  55. package/lib/encoding.js +217 -0
  56. package/lib/encoding.js.map +1 -0
  57. package/lib/errors.d.ts +56 -0
  58. package/lib/errors.d.ts.map +1 -0
  59. package/lib/errors.js +148 -0
  60. package/lib/errors.js.map +1 -0
  61. package/lib/event.d.ts +268 -0
  62. package/lib/event.d.ts.map +1 -0
  63. package/lib/event.js +816 -0
  64. package/lib/event.js.map +1 -0
  65. package/lib/file-uri.d.ts +15 -0
  66. package/lib/file-uri.d.ts.map +1 -0
  67. package/lib/file-uri.js +46 -0
  68. package/lib/file-uri.js.map +1 -0
  69. package/lib/filters.d.ts +47 -0
  70. package/lib/filters.d.ts.map +1 -0
  71. package/lib/filters.js +698 -0
  72. package/lib/filters.js.map +1 -0
  73. package/lib/functional.d.ts +4 -0
  74. package/lib/functional.d.ts.map +1 -0
  75. package/lib/functional.js +45 -0
  76. package/lib/functional.js.map +1 -0
  77. package/lib/glob.d.ts +46 -0
  78. package/lib/glob.d.ts.map +1 -0
  79. package/lib/glob.js +561 -0
  80. package/lib/glob.js.map +1 -0
  81. package/lib/hash.d.ts +38 -0
  82. package/lib/hash.d.ts.map +1 -0
  83. package/lib/hash.js +294 -0
  84. package/lib/hash.js.map +1 -0
  85. package/lib/index.d.ts +41 -0
  86. package/lib/index.d.ts.map +1 -0
  87. package/lib/index.js +45 -0
  88. package/lib/index.js.map +1 -0
  89. package/lib/iterator.d.ts +17 -0
  90. package/lib/iterator.d.ts.map +1 -0
  91. package/lib/iterator.js +24 -0
  92. package/lib/iterator.js.map +1 -0
  93. package/lib/lifecycle.d.ts +17 -0
  94. package/lib/lifecycle.d.ts.map +1 -0
  95. package/lib/lifecycle.js +39 -0
  96. package/lib/lifecycle.js.map +1 -0
  97. package/lib/linked-list.d.ts +18 -0
  98. package/lib/linked-list.d.ts.map +1 -0
  99. package/lib/linked-list.js +138 -0
  100. package/lib/linked-list.js.map +1 -0
  101. package/lib/linked-text.d.ts +13 -0
  102. package/lib/linked-text.d.ts.map +1 -0
  103. package/lib/linked-text.js +50 -0
  104. package/lib/linked-text.js.map +1 -0
  105. package/lib/lru-map.d.ts +41 -0
  106. package/lib/lru-map.d.ts.map +1 -0
  107. package/lib/lru-map.js +120 -0
  108. package/lib/lru-map.js.map +1 -0
  109. package/lib/map.d.ts +124 -0
  110. package/lib/map.d.ts.map +1 -0
  111. package/lib/map.js +819 -0
  112. package/lib/map.js.map +1 -0
  113. package/lib/marshalling.d.ts +7 -0
  114. package/lib/marshalling.d.ts.map +1 -0
  115. package/lib/marshalling.js +59 -0
  116. package/lib/marshalling.js.map +1 -0
  117. package/lib/objects.d.ts +6 -0
  118. package/lib/objects.d.ts.map +1 -0
  119. package/lib/objects.js +103 -0
  120. package/lib/objects.js.map +1 -0
  121. package/lib/os.d.ts +40 -0
  122. package/lib/os.d.ts.map +1 -0
  123. package/lib/os.js +75 -0
  124. package/lib/os.js.map +1 -0
  125. package/lib/path.d.ts +101 -0
  126. package/lib/path.d.ts.map +1 -0
  127. package/lib/path.js +1747 -0
  128. package/lib/path.js.map +1 -0
  129. package/lib/platform.d.ts +48 -0
  130. package/lib/platform.d.ts.map +1 -0
  131. package/lib/platform.js +154 -0
  132. package/lib/platform.js.map +1 -0
  133. package/lib/process.d.ts +5 -0
  134. package/lib/process.d.ts.map +1 -0
  135. package/lib/process.js +23 -0
  136. package/lib/process.js.map +1 -0
  137. package/lib/progress.d.ts +56 -0
  138. package/lib/progress.d.ts.map +1 -0
  139. package/lib/progress.js +27 -0
  140. package/lib/progress.js.map +1 -0
  141. package/lib/promise-util.d.ts +10 -0
  142. package/lib/promise-util.d.ts.map +1 -0
  143. package/lib/promise-util.js +17 -0
  144. package/lib/promise-util.js.map +1 -0
  145. package/lib/sequence.d.ts +20 -0
  146. package/lib/sequence.d.ts.map +1 -0
  147. package/lib/sequence.js +17 -0
  148. package/lib/sequence.js.map +1 -0
  149. package/lib/strings.d.ts +181 -0
  150. package/lib/strings.d.ts.map +1 -0
  151. package/lib/strings.js +858 -0
  152. package/lib/strings.js.map +1 -0
  153. package/lib/types.d.ts +69 -0
  154. package/lib/types.d.ts.map +1 -0
  155. package/lib/types.js +201 -0
  156. package/lib/types.js.map +1 -0
  157. package/lib/uint.d.ts +32 -0
  158. package/lib/uint.d.ts.map +1 -0
  159. package/lib/uint.js +28 -0
  160. package/lib/uint.js.map +1 -0
  161. package/lib/uri.d.ts +94 -0
  162. package/lib/uri.d.ts.map +1 -0
  163. package/lib/uri.js +231 -0
  164. package/lib/uri.js.map +1 -0
  165. package/lib/uuid.d.ts +2 -0
  166. package/lib/uuid.d.ts.map +1 -0
  167. package/lib/uuid.js +10 -0
  168. package/lib/uuid.js.map +1 -0
  169. package/package.json +25 -0
@@ -0,0 +1,138 @@
1
+ "use strict";
2
+ Object.defineProperty(exports, "__esModule", { value: true });
3
+ exports.LinkedList = void 0;
4
+ const iterator_1 = require("./iterator");
5
+ class Node {
6
+ constructor(element) {
7
+ this.element = element;
8
+ this.next = Node.Undefined;
9
+ this.prev = Node.Undefined;
10
+ }
11
+ }
12
+ Node.Undefined = new Node(undefined);
13
+ class LinkedList {
14
+ constructor() {
15
+ this._first = Node.Undefined;
16
+ this._last = Node.Undefined;
17
+ this._size = 0;
18
+ }
19
+ get size() {
20
+ return this._size;
21
+ }
22
+ isEmpty() {
23
+ return this._first === Node.Undefined;
24
+ }
25
+ clear() {
26
+ this._first = Node.Undefined;
27
+ this._last = Node.Undefined;
28
+ this._size = 0;
29
+ }
30
+ unshift(element) {
31
+ return this._insert(element, false);
32
+ }
33
+ push(element) {
34
+ return this._insert(element, true);
35
+ }
36
+ _insert(element, atTheEnd) {
37
+ const newNode = new Node(element);
38
+ if (this._first === Node.Undefined) {
39
+ this._first = newNode;
40
+ this._last = newNode;
41
+ }
42
+ else if (atTheEnd) {
43
+ // push
44
+ const oldLast = this._last;
45
+ this._last = newNode;
46
+ newNode.prev = oldLast;
47
+ oldLast.next = newNode;
48
+ }
49
+ else {
50
+ // unshift
51
+ const oldFirst = this._first;
52
+ this._first = newNode;
53
+ newNode.next = oldFirst;
54
+ oldFirst.prev = newNode;
55
+ }
56
+ this._size += 1;
57
+ let didRemove = false;
58
+ return () => {
59
+ if (!didRemove) {
60
+ didRemove = true;
61
+ this._remove(newNode);
62
+ }
63
+ };
64
+ }
65
+ shift() {
66
+ if (this._first === Node.Undefined) {
67
+ return undefined;
68
+ }
69
+ else {
70
+ const res = this._first.element;
71
+ this._remove(this._first);
72
+ return res;
73
+ }
74
+ }
75
+ pop() {
76
+ if (this._last === Node.Undefined) {
77
+ return undefined;
78
+ }
79
+ else {
80
+ const res = this._last.element;
81
+ this._remove(this._last);
82
+ return res;
83
+ }
84
+ }
85
+ _remove(node) {
86
+ if (node.prev !== Node.Undefined && node.next !== Node.Undefined) {
87
+ // middle
88
+ const anchor = node.prev;
89
+ anchor.next = node.next;
90
+ node.next.prev = anchor;
91
+ }
92
+ else if (node.prev === Node.Undefined && node.next === Node.Undefined) {
93
+ // only node
94
+ this._first = Node.Undefined;
95
+ this._last = Node.Undefined;
96
+ }
97
+ else if (node.next === Node.Undefined) {
98
+ // last
99
+ this._last = this._last.prev;
100
+ this._last.next = Node.Undefined;
101
+ }
102
+ else if (node.prev === Node.Undefined) {
103
+ // first
104
+ this._first = this._first.next;
105
+ this._first.prev = Node.Undefined;
106
+ }
107
+ // done
108
+ this._size -= 1;
109
+ }
110
+ iterator() {
111
+ let element;
112
+ let node = this._first;
113
+ return {
114
+ next() {
115
+ if (node === Node.Undefined) {
116
+ return iterator_1.FIN;
117
+ }
118
+ if (!element) {
119
+ element = { done: false, value: node.element };
120
+ }
121
+ else {
122
+ element.value = node.element;
123
+ }
124
+ node = node.next;
125
+ return element;
126
+ },
127
+ };
128
+ }
129
+ toArray() {
130
+ const result = [];
131
+ for (let node = this._first; node !== Node.Undefined; node = node.next) {
132
+ result.push(node.element);
133
+ }
134
+ return result;
135
+ }
136
+ }
137
+ exports.LinkedList = LinkedList;
138
+ //# sourceMappingURL=linked-list.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"linked-list.js","sourceRoot":"","sources":["../src/linked-list.ts"],"names":[],"mappings":";;;AAAA,yCAA2D;AAE3D,MAAM,IAAI;IAOR,YAAY,OAAU;QACpB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC;QAC3B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC;IAC7B,CAAC;;AAVe,cAAS,GAAG,IAAI,IAAI,CAAM,SAAS,CAAC,CAAC;AAavD,MAAa,UAAU;IAAvB;QACU,WAAM,GAAY,IAAI,CAAC,SAAS,CAAC;QACjC,UAAK,GAAY,IAAI,CAAC,SAAS,CAAC;QAChC,UAAK,GAAG,CAAC,CAAC;IA4HpB,CAAC;IA1HC,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,SAAS,CAAC;IACxC,CAAC;IAED,KAAK;QACH,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC;QAC5B,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;IAED,OAAO,CAAC,OAAU;QAChB,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IACtC,CAAC;IAED,IAAI,CAAC,OAAU;QACb,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IACrC,CAAC;IAEO,OAAO,CAAC,OAAU,EAAE,QAAiB;QAC3C,MAAM,OAAO,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC;QAClC,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,SAAS,EAAE;YAClC,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC;YACtB,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC;SACtB;aAAM,IAAI,QAAQ,EAAE;YACnB,OAAO;YACP,MAAM,OAAO,GAAG,IAAI,CAAC,KAAM,CAAC;YAC5B,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC;YACrB,OAAO,CAAC,IAAI,GAAG,OAAO,CAAC;YACvB,OAAO,CAAC,IAAI,GAAG,OAAO,CAAC;SACxB;aAAM;YACL,UAAU;YACV,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC;YAC7B,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC;YACtB,OAAO,CAAC,IAAI,GAAG,QAAQ,CAAC;YACxB,QAAQ,CAAC,IAAI,GAAG,OAAO,CAAC;SACzB;QACD,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;QAEhB,IAAI,SAAS,GAAG,KAAK,CAAC;QACtB,OAAO,GAAG,EAAE;YACV,IAAI,CAAC,SAAS,EAAE;gBACd,SAAS,GAAG,IAAI,CAAC;gBACjB,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;aACvB;QACH,CAAC,CAAC;IACJ,CAAC;IAED,KAAK;QACH,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,SAAS,EAAE;YAClC,OAAO,SAAS,CAAC;SAClB;aAAM;YACL,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC;YAChC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC1B,OAAO,GAAG,CAAC;SACZ;IACH,CAAC;IAED,GAAG;QACD,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,SAAS,EAAE;YACjC,OAAO,SAAS,CAAC;SAClB;aAAM;YACL,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC;YAC/B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzB,OAAO,GAAG,CAAC;SACZ;IACH,CAAC;IAEO,OAAO,CAAC,IAAa;QAC3B,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,SAAS,EAAE;YAChE,SAAS;YACT,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC;YACzB,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACxB,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC;SACzB;aAAM,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,SAAS,EAAE;YACvE,YAAY;YACZ,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC;YAC7B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC;SAC7B;aAAM,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,SAAS,EAAE;YACvC,OAAO;YACP,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAM,CAAC,IAAK,CAAC;YAC/B,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC;SAClC;aAAM,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,SAAS,EAAE;YACvC,QAAQ;YACR,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAO,CAAC,IAAK,CAAC;YACjC,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC;SACnC;QAED,OAAO;QACP,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;IAClB,CAAC;IAED,QAAQ;QACN,IAAI,OAAkC,CAAC;QACvC,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;QACvB,OAAO;YACL,IAAI;gBACF,IAAI,IAAI,KAAK,IAAI,CAAC,SAAS,EAAE;oBAC3B,OAAO,cAAG,CAAC;iBACZ;gBAED,IAAI,CAAC,OAAO,EAAE;oBACZ,OAAO,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC;iBAChD;qBAAM;oBACL,OAAO,CAAC,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC;iBAC9B;gBACD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBACjB,OAAO,OAAO,CAAC;YACjB,CAAC;SACF,CAAC;IACJ,CAAC;IAED,OAAO;QACL,MAAM,MAAM,GAAQ,EAAE,CAAC;QACvB,KAAK,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,IAAI,KAAK,IAAI,CAAC,SAAS,EAAE,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE;YACtE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;SAC3B;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AA/HD,gCA+HC"}
@@ -0,0 +1,13 @@
1
+ export interface ILink {
2
+ readonly label: string;
3
+ readonly href: string;
4
+ readonly title?: string;
5
+ }
6
+ export declare type LinkedTextNode = string | ILink;
7
+ export declare class LinkedText {
8
+ readonly nodes: LinkedTextNode[];
9
+ constructor(nodes: LinkedTextNode[]);
10
+ toString(): string;
11
+ }
12
+ export declare function parseLinkedText(text: string): LinkedText;
13
+ //# sourceMappingURL=linked-text.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"linked-text.d.ts","sourceRoot":"","sources":["../src/linked-text.ts"],"names":[],"mappings":"AAQA,MAAM,WAAW,KAAK;IACpB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;CACzB;AAED,oBAAY,cAAc,GAAG,MAAM,GAAG,KAAK,CAAC;AAE5C,qBAAa,UAAU;IACT,QAAQ,CAAC,KAAK,EAAE,cAAc,EAAE;gBAAvB,KAAK,EAAE,cAAc,EAAE;IAG5C,QAAQ,IAAI,MAAM;CAGnB;AAID,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,UAAU,CA2BxD"}
@@ -0,0 +1,50 @@
1
+ "use strict";
2
+ /* ---------------------------------------------------------------------------------------------
3
+ * Copyright (c) Microsoft Corporation. All rights reserved.
4
+ * Licensed under the MIT License. See License.txt in the project root for license information.
5
+ *--------------------------------------------------------------------------------------------*/
6
+ // Some code copied and modified from https://github.com/microsoft/vscode/blob/1.44.0/src/vs/base/common/linkedText.ts
7
+ Object.defineProperty(exports, "__esModule", { value: true });
8
+ exports.parseLinkedText = exports.LinkedText = void 0;
9
+ const tslib_1 = require("tslib");
10
+ const decorators_1 = require("./decorators");
11
+ class LinkedText {
12
+ constructor(nodes) {
13
+ this.nodes = nodes;
14
+ }
15
+ toString() {
16
+ return this.nodes.map((node) => (typeof node === 'string' ? node : node.label)).join('');
17
+ }
18
+ }
19
+ (0, tslib_1.__decorate)([
20
+ decorators_1.memoize,
21
+ (0, tslib_1.__metadata)("design:type", Function),
22
+ (0, tslib_1.__metadata)("design:paramtypes", []),
23
+ (0, tslib_1.__metadata)("design:returntype", String)
24
+ ], LinkedText.prototype, "toString", null);
25
+ exports.LinkedText = LinkedText;
26
+ const LINK_REGEX = /\[([^\]]+)\]\(((?:https?:\/\/|command:)[^\)\s]+)(?: ("|')([^\3]+)(\3))?\)/gi;
27
+ function parseLinkedText(text) {
28
+ const result = [];
29
+ let index = 0;
30
+ let match;
31
+ while ((match = LINK_REGEX.exec(text))) {
32
+ if (match.index - index > 0) {
33
+ result.push(text.substring(index, match.index));
34
+ }
35
+ const [, label, href, , title] = match;
36
+ if (title) {
37
+ result.push({ label, href, title });
38
+ }
39
+ else {
40
+ result.push({ label, href });
41
+ }
42
+ index = match.index + match[0].length;
43
+ }
44
+ if (index < text.length) {
45
+ result.push(text.substring(index));
46
+ }
47
+ return new LinkedText(result);
48
+ }
49
+ exports.parseLinkedText = parseLinkedText;
50
+ //# sourceMappingURL=linked-text.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"linked-text.js","sourceRoot":"","sources":["../src/linked-text.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;AAChG,sHAAsH;;;;AAEtH,6CAAuC;AAUvC,MAAa,UAAU;IACrB,YAAqB,KAAuB;QAAvB,UAAK,GAAL,KAAK,CAAkB;IAAG,CAAC;IAGhD,QAAQ;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC3F,CAAC;CACF;AAHC;IADC,oBAAO;;;;0CAGP;AANH,gCAOC;AAED,MAAM,UAAU,GAAG,6EAA6E,CAAC;AAEjG,SAAgB,eAAe,CAAC,IAAY;IAC1C,MAAM,MAAM,GAAqB,EAAE,CAAC;IAEpC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAA6B,CAAC;IAElC,OAAO,CAAC,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE;QACtC,IAAI,KAAK,CAAC,KAAK,GAAG,KAAK,GAAG,CAAC,EAAE;YAC3B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;SACjD;QAED,MAAM,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,AAAD,EAAG,KAAK,CAAC,GAAG,KAAK,CAAC;QAEvC,IAAI,KAAK,EAAE;YACT,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;SACrC;aAAM;YACL,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;SAC9B;QAED,KAAK,GAAG,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;KACvC;IAED,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE;QACvB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;KACpC;IAED,OAAO,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;AAChC,CAAC;AA3BD,0CA2BC"}
@@ -0,0 +1,41 @@
1
+ import { Event } from './event';
2
+ export interface ILRULinkListNode<K> {
3
+ key: K | undefined;
4
+ next: ILRULinkListNode<K> | undefined;
5
+ prev: ILRULinkListNode<K> | undefined;
6
+ }
7
+ /**
8
+ * 自带LRU清理的Map
9
+ * 双向链表 + Map
10
+ */
11
+ export declare class LRUMap<K, V> extends Map<K, V> {
12
+ private hardLimit;
13
+ private softLimit;
14
+ private _onDidDelete;
15
+ readonly onDidDelete: Event<{
16
+ key: K;
17
+ value: V;
18
+ }>;
19
+ private head;
20
+ private tail;
21
+ private map;
22
+ constructor(hardLimit: number, softLimit: number);
23
+ private markRecentUsed;
24
+ get(key: K): V | undefined;
25
+ set(key: K, value: V): this;
26
+ putHead(node: ILRULinkListNode<K>): void;
27
+ protected deleteNodeFromList(node: ILRULinkListNode<K>): void;
28
+ delete(key: K): boolean;
29
+ shrink(): void;
30
+ }
31
+ /**
32
+ * 支持过期时间
33
+ */
34
+ export declare class StaleLRUMap<K, V> extends LRUMap<K, V> {
35
+ private maxAge;
36
+ constructor(hardLimit: number, softLimit: number, maxAge: number);
37
+ get(key: K): V | undefined;
38
+ set(key: K, value: V): this;
39
+ private _isStale;
40
+ }
41
+ //# sourceMappingURL=lru-map.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lru-map.d.ts","sourceRoot":"","sources":["../src/lru-map.ts"],"names":[],"mappings":"AAAA,OAAO,EAAW,KAAK,EAAE,MAAM,SAAS,CAAC;AAEzC,MAAM,WAAW,gBAAgB,CAAC,CAAC;IACjC,GAAG,EAAE,CAAC,GAAG,SAAS,CAAC;IACnB,IAAI,EAAE,gBAAgB,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;IACtC,IAAI,EAAE,gBAAgB,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;CACvC;AAED;;;GAGG;AACH,qBAAa,MAAM,CAAC,CAAC,EAAE,CAAC,CAAE,SAAQ,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAW7B,OAAO,CAAC,SAAS;IAAU,OAAO,CAAC,SAAS;IAVxD,OAAO,CAAC,YAAY,CAAuC;IAE3D,SAAgB,WAAW,EAAE,KAAK,CAAC;QAAE,GAAG,EAAE,CAAC,CAAC;QAAC,KAAK,EAAE,CAAC,CAAA;KAAE,CAAC,CAA2B;IAEnF,OAAO,CAAC,IAAI,CAA6E;IAEzF,OAAO,CAAC,IAAI,CAA6E;IAEzF,OAAO,CAAC,GAAG,CAA0C;gBAEjC,SAAS,EAAE,MAAM,EAAU,SAAS,EAAE,MAAM;IAShE,OAAO,CAAC,cAAc;IAOtB,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAQ1B,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IAS3B,OAAO,CAAC,IAAI,EAAE,gBAAgB,CAAC,CAAC,CAAC;IAWjC,SAAS,CAAC,kBAAkB,CAAC,IAAI,EAAE,gBAAgB,CAAC,CAAC,CAAC;IAStD,MAAM,CAAC,GAAG,EAAE,CAAC;IAab,MAAM;CAYP;AAGD;;GAEG;AACH,qBAAa,WAAW,CAAC,CAAC,EAAE,CAAC,CAAE,SAAQ,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;IACC,OAAO,CAAC,MAAM;gBAApD,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAU,MAAM,EAAE,MAAM;IAIxE,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAY1B,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IAK3B,OAAO,CAAC,QAAQ;CAGjB"}
package/lib/lru-map.js ADDED
@@ -0,0 +1,120 @@
1
+ "use strict";
2
+ Object.defineProperty(exports, "__esModule", { value: true });
3
+ exports.StaleLRUMap = exports.LRUMap = void 0;
4
+ const event_1 = require("./event");
5
+ /**
6
+ * 自带LRU清理的Map
7
+ * 双向链表 + Map
8
+ */
9
+ class LRUMap extends Map {
10
+ constructor(hardLimit, softLimit) {
11
+ super();
12
+ this.hardLimit = hardLimit;
13
+ this.softLimit = softLimit;
14
+ this._onDidDelete = new event_1.Emitter();
15
+ this.onDidDelete = this._onDidDelete.event;
16
+ this.head = { key: undefined, prev: undefined, next: undefined };
17
+ this.tail = { key: undefined, prev: undefined, next: undefined };
18
+ this.map = new Map();
19
+ if (hardLimit <= softLimit) {
20
+ throw new Error('hardLimit 必须比 softLimit大');
21
+ }
22
+ this.head.next = this.tail;
23
+ this.tail.prev = this.head;
24
+ }
25
+ markRecentUsed(key) {
26
+ if (!this.map.get(key)) {
27
+ this.map.set(key, { key, prev: undefined, next: undefined });
28
+ }
29
+ this.putHead(this.map.get(key));
30
+ }
31
+ get(key) {
32
+ const v = super.get(key);
33
+ if (v) {
34
+ this.markRecentUsed(key);
35
+ }
36
+ return v;
37
+ }
38
+ set(key, value) {
39
+ this.markRecentUsed(key);
40
+ super.set(key, value);
41
+ if (this.size > this.hardLimit) {
42
+ this.shrink();
43
+ }
44
+ return this;
45
+ }
46
+ putHead(node) {
47
+ this.deleteNodeFromList(node);
48
+ const lastHead = this.head.next;
49
+ this.head.next = node;
50
+ node.next = lastHead;
51
+ node.prev = undefined;
52
+ if (lastHead) {
53
+ lastHead.prev = node;
54
+ }
55
+ }
56
+ deleteNodeFromList(node) {
57
+ if (node.prev) {
58
+ node.prev.next = node.next;
59
+ }
60
+ if (node.next) {
61
+ node.next.prev = node.prev;
62
+ }
63
+ }
64
+ delete(key) {
65
+ const node = this.map.get(key);
66
+ if (node) {
67
+ this.deleteNodeFromList(node);
68
+ }
69
+ const value = super.get(key);
70
+ this._onDidDelete.fire({
71
+ key,
72
+ value: value,
73
+ });
74
+ return super.delete(key);
75
+ }
76
+ shrink() {
77
+ const toDelete = this.size - this.softLimit;
78
+ let toDeleteNode = this.tail;
79
+ for (let i = 0; i < toDelete; i++) {
80
+ toDeleteNode = this.tail.prev;
81
+ if (!toDeleteNode || toDeleteNode === this.head) {
82
+ break;
83
+ }
84
+ else {
85
+ this.delete(toDeleteNode.key);
86
+ }
87
+ }
88
+ }
89
+ }
90
+ exports.LRUMap = LRUMap;
91
+ const NOW = Symbol('now');
92
+ /**
93
+ * 支持过期时间
94
+ */
95
+ class StaleLRUMap extends LRUMap {
96
+ constructor(hardLimit, softLimit, maxAge) {
97
+ super(hardLimit, softLimit);
98
+ this.maxAge = maxAge;
99
+ }
100
+ get(key) {
101
+ const v = super.get(key);
102
+ if (v) {
103
+ if (!this._isStale(v)) {
104
+ return v;
105
+ }
106
+ // 过期则删除该条记录
107
+ this.delete(key);
108
+ }
109
+ return undefined;
110
+ }
111
+ set(key, value) {
112
+ value[NOW] = Date.now();
113
+ return super.set(key, value);
114
+ }
115
+ _isStale(value) {
116
+ return value[NOW] + this.maxAge <= Date.now();
117
+ }
118
+ }
119
+ exports.StaleLRUMap = StaleLRUMap;
120
+ //# sourceMappingURL=lru-map.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lru-map.js","sourceRoot":"","sources":["../src/lru-map.ts"],"names":[],"mappings":";;;AAAA,mCAAyC;AAQzC;;;GAGG;AACH,MAAa,MAAa,SAAQ,GAAS;IAWzC,YAAoB,SAAiB,EAAU,SAAiB;QAC9D,KAAK,EAAE,CAAC;QADU,cAAS,GAAT,SAAS,CAAQ;QAAU,cAAS,GAAT,SAAS,CAAQ;QAVxD,iBAAY,GAAG,IAAI,eAAO,EAAwB,CAAC;QAE3C,gBAAW,GAAgC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;QAE3E,SAAI,GAAwB,EAAE,GAAG,EAAE,SAAS,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;QAEjF,SAAI,GAAwB,EAAE,GAAG,EAAE,SAAS,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;QAEjF,QAAG,GAAgC,IAAI,GAAG,EAAE,CAAC;QAInD,IAAI,SAAS,IAAI,SAAS,EAAE;YAC1B,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC;SAC7C;QACD,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAC3B,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IAC7B,CAAC;IAEO,cAAc,CAAC,GAAM;QAC3B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;YACtB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC;SAC9D;QACD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,CAAC;IACnC,CAAC;IAED,GAAG,CAAC,GAAM;QACR,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,EAAE;YACL,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;SAC1B;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,GAAG,CAAC,GAAM,EAAE,KAAQ;QAClB,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;QACzB,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACtB,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,SAAS,EAAE;YAC9B,IAAI,CAAC,MAAM,EAAE,CAAC;SACf;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,CAAC,IAAyB;QAC/B,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;QAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;QAChC,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACtB,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC;QACrB,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;QACtB,IAAI,QAAQ,EAAE;YACZ,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC;SACtB;IACH,CAAC;IAES,kBAAkB,CAAC,IAAyB;QACpD,IAAI,IAAI,CAAC,IAAI,EAAE;YACb,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;SAC5B;QACD,IAAI,IAAI,CAAC,IAAI,EAAE;YACb,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;SAC5B;IACH,CAAC;IAED,MAAM,CAAC,GAAM;QACX,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,IAAI,EAAE;YACR,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;SAC/B;QACD,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC;YACrB,GAAG;YACH,KAAK,EAAE,KAAM;SACd,CAAC,CAAC;QACH,OAAO,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;IAED,MAAM;QACJ,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC;QAC5C,IAAI,YAAY,GAAwB,IAAI,CAAC,IAAI,CAAC;QAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE;YACjC,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,IAAK,CAAC;YAC/B,IAAI,CAAC,YAAY,IAAI,YAAY,KAAK,IAAI,CAAC,IAAI,EAAE;gBAC/C,MAAM;aACP;iBAAM;gBACL,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,GAAI,CAAC,CAAC;aAChC;SACF;IACH,CAAC;CACF;AAzFD,wBAyFC;AAED,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;AAC1B;;GAEG;AACH,MAAa,WAAkB,SAAQ,MAAY;IACjD,YAAY,SAAiB,EAAE,SAAiB,EAAU,MAAc;QACtE,KAAK,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QAD4B,WAAM,GAAN,MAAM,CAAQ;IAExE,CAAC;IAED,GAAG,CAAC,GAAM;QACR,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,EAAE;YACL,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE;gBACrB,OAAO,CAAC,CAAC;aACV;YACD,YAAY;YACZ,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;SAClB;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,GAAG,CAAC,GAAM,EAAE,KAAQ;QAClB,KAAK,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACxB,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAC/B,CAAC;IAEO,QAAQ,CAAC,KAAQ;QACvB,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;IAChD,CAAC;CACF;AAzBD,kCAyBC"}
package/lib/map.d.ts ADDED
@@ -0,0 +1,124 @@
1
+ import { URI as Uri } from 'vscode-uri';
2
+ import { Iterator } from './iterator';
3
+ export declare function values<V = any>(set: Set<V>): V[];
4
+ export declare function values<K = any, V = any>(map: Map<K, V>): V[];
5
+ export declare function keys<K, V>(map: Map<K, V>): K[];
6
+ export declare function getOrSet<K, V>(map: Map<K, V>, key: K, value: V): V;
7
+ export declare function mapToString<K, V>(map: Map<K, V>): string;
8
+ export declare function setToString<K>(set: Set<K>): string;
9
+ export declare function mapToSerializable<T = string>(map: Map<string, T>): [string, T][];
10
+ export declare function serializableToMap<T = string>(serializable: [string, T][]): Map<string, T>;
11
+ export interface IKeyIterator {
12
+ reset(key: string): this;
13
+ next(): this;
14
+ hasNext(): boolean;
15
+ cmp(a: string): number;
16
+ value(): string;
17
+ }
18
+ export declare class StringIterator implements IKeyIterator {
19
+ private _value;
20
+ private _pos;
21
+ reset(key: string): this;
22
+ next(): this;
23
+ hasNext(): boolean;
24
+ cmp(a: string): number;
25
+ value(): string;
26
+ }
27
+ export declare class PathIterator implements IKeyIterator {
28
+ private _value;
29
+ private _from;
30
+ private _to;
31
+ reset(key: string): this;
32
+ hasNext(): boolean;
33
+ next(): this;
34
+ cmp(a: string): number;
35
+ value(): string;
36
+ }
37
+ export declare class TernarySearchTree<E> {
38
+ static forPaths<E>(): TernarySearchTree<E>;
39
+ static forStrings<E>(): TernarySearchTree<E>;
40
+ private _iter;
41
+ private _root;
42
+ constructor(segments: IKeyIterator);
43
+ clear(): void;
44
+ set(key: string, element: E): E | undefined;
45
+ get(key: string): E | undefined;
46
+ delete(key: string): void;
47
+ findSubstr(key: string): E | undefined;
48
+ findSuperstr(key: string): Iterator<E> | undefined;
49
+ private _nodeIterator;
50
+ forEach(callback: (value: E, index: string) => any): void;
51
+ private _forEach;
52
+ }
53
+ export declare class ResourceMap<T> {
54
+ protected readonly map: Map<string, T>;
55
+ protected readonly ignoreCase?: boolean;
56
+ constructor();
57
+ set(resource: Uri, value: T): void;
58
+ get(resource: Uri): T | undefined;
59
+ has(resource: Uri): boolean;
60
+ get size(): number;
61
+ clear(): void;
62
+ delete(resource: Uri): boolean;
63
+ forEach(clb: (value: T) => void): void;
64
+ values(): T[];
65
+ private toKey;
66
+ keys(): Uri[];
67
+ clone(): ResourceMap<T>;
68
+ }
69
+ export declare const enum Touch {
70
+ None = 0,
71
+ AsOld = 1,
72
+ AsNew = 2
73
+ }
74
+ export declare class LinkedMap<K, V> {
75
+ private _map;
76
+ private _head;
77
+ private _tail;
78
+ private _size;
79
+ constructor();
80
+ clear(): void;
81
+ isEmpty(): boolean;
82
+ get size(): number;
83
+ has(key: K): boolean;
84
+ get(key: K, touch?: Touch): V | undefined;
85
+ set(key: K, value: V, touch?: Touch): void;
86
+ delete(key: K): boolean;
87
+ remove(key: K): V | undefined;
88
+ shift(): V | undefined;
89
+ forEach(callbackfn: (value: V, key: K, map: LinkedMap<K, V>) => void, thisArg?: any): void;
90
+ values(): V[];
91
+ keys(): K[];
92
+ protected trimOld(newSize: number): void;
93
+ private addItemFirst;
94
+ private addItemLast;
95
+ private removeItem;
96
+ private touch;
97
+ toJSON(): [K, V][];
98
+ fromJSON(data: [K, V][]): void;
99
+ }
100
+ export declare class LRUCache<K, V> extends LinkedMap<K, V> {
101
+ private _limit;
102
+ private _ratio;
103
+ constructor(limit: number, ratio?: number);
104
+ get limit(): number;
105
+ set limit(limit: number);
106
+ get ratio(): number;
107
+ set ratio(ratio: number);
108
+ get(key: K): V | undefined;
109
+ peek(key: K): V | undefined;
110
+ set(key: K, value: V): void;
111
+ private checkTrim;
112
+ }
113
+ export declare class SetMap<K, V> {
114
+ private map;
115
+ add(key: K, value: V): void;
116
+ delete(key: K, value: V): void;
117
+ forEach(key: K, fn: (value: V) => void): void;
118
+ }
119
+ export declare class CaseInsensitiveMap<K, V> extends Map<K, V> {
120
+ set(key: K, value: V): this;
121
+ get(key: K): V | undefined;
122
+ has(key: K): boolean;
123
+ }
124
+ //# sourceMappingURL=map.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"map.d.ts","sourceRoot":"","sources":["../src/map.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,IAAI,GAAG,EAAE,MAAM,YAAY,CAAC;AAGxC,OAAO,EAAE,QAAQ,EAAuB,MAAM,YAAY,CAAC;AAE3D,wBAAgB,MAAM,CAAC,CAAC,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;AAClD,wBAAgB,MAAM,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;AAO9D,wBAAgB,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAK9C;AAED,wBAAgB,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAQlE;AAED,wBAAgB,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAOxD;AAED,wBAAgB,WAAW,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,CAOlD;AAED,wBAAgB,iBAAiB,CAAC,CAAC,GAAG,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAQhF;AAED,wBAAgB,iBAAiB,CAAC,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAQzF;AAED,MAAM,WAAW,YAAY;IAC3B,KAAK,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,IAAI,IAAI,IAAI,CAAC;IAEb,OAAO,IAAI,OAAO,CAAC;IACnB,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IACvB,KAAK,IAAI,MAAM,CAAC;CACjB;AAED,qBAAa,cAAe,YAAW,YAAY;IACjD,OAAO,CAAC,MAAM,CAAM;IACpB,OAAO,CAAC,IAAI,CAAK;IAEjB,KAAK,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI;IAMxB,IAAI,IAAI,IAAI;IAKZ,OAAO,IAAI,OAAO;IAIlB,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAMtB,KAAK,IAAI,MAAM;CAGhB;AAED,qBAAa,YAAa,YAAW,YAAY;IAC/C,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,GAAG,CAAS;IAEpB,KAAK,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI;IAOxB,OAAO,IAAI,OAAO;IAIlB,IAAI,IAAI,IAAI;IAmBZ,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAuBtB,KAAK,IAAI,MAAM;CAGhB;AAeD,qBAAa,iBAAiB,CAAC,CAAC;IAC9B,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,iBAAiB,CAAC,CAAC,CAAC;IAI1C,MAAM,CAAC,UAAU,CAAC,CAAC,KAAK,iBAAiB,CAAC,CAAC,CAAC;IAI5C,OAAO,CAAC,KAAK,CAAe;IAC5B,OAAO,CAAC,KAAK,CAAuC;gBAExC,QAAQ,EAAE,YAAY;IAIlC,KAAK,IAAI,IAAI;IAIb,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IA4C3C,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;IAsB/B,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI;IA8CzB,UAAU,CAAC,GAAG,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;IAwBtC,YAAY,CAAC,GAAG,EAAE,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS;IA2BlD,OAAO,CAAC,aAAa;IAyBrB,OAAO,CAAC,QAAQ,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,GAAG;IAIlD,OAAO,CAAC,QAAQ;CAiBjB;AAED,qBAAa,WAAW,CAAC,CAAC;IACxB,SAAS,CAAC,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACvC,SAAS,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,OAAO,CAAC;;IAOxC,GAAG,CAAC,QAAQ,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IAIlC,GAAG,CAAC,QAAQ,EAAE,GAAG,GAAG,CAAC,GAAG,SAAS;IAIjC,GAAG,CAAC,QAAQ,EAAE,GAAG,GAAG,OAAO;IAI3B,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,KAAK,IAAI,IAAI;IAIb,MAAM,CAAC,QAAQ,EAAE,GAAG,GAAG,OAAO;IAI9B,OAAO,CAAC,GAAG,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,IAAI,GAAG,IAAI;IAItC,MAAM,IAAI,CAAC,EAAE;IAIb,OAAO,CAAC,KAAK;IASb,IAAI,IAAI,GAAG,EAAE;IAIb,KAAK,IAAI,WAAW,CAAC,CAAC,CAAC;CAOxB;AAWD,0BAAkB,KAAK;IACrB,IAAI,IAAI;IACR,KAAK,IAAI;IACT,KAAK,IAAI;CACV;AAED,qBAAa,SAAS,CAAC,CAAC,EAAE,CAAC;IACzB,OAAO,CAAC,IAAI,CAAqB;IACjC,OAAO,CAAC,KAAK,CAAyB;IACtC,OAAO,CAAC,KAAK,CAAyB;IACtC,OAAO,CAAC,KAAK,CAAS;;IAStB,KAAK,IAAI,IAAI;IAOb,OAAO,IAAI,OAAO;IAIlB,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAIpB,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,GAAE,KAAkB,GAAG,CAAC,GAAG,SAAS;IAWrD,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,GAAE,KAAkB,GAAG,IAAI;IA4BtD,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAIvB,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAW7B,KAAK,IAAI,CAAC,GAAG,SAAS;IActB,OAAO,CAAC,UAAU,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,EAAE,OAAO,CAAC,EAAE,GAAG,GAAG,IAAI;IAY1F,MAAM,IAAI,CAAC,EAAE;IAUb,IAAI,IAAI,CAAC,EAAE;IAkDX,SAAS,CAAC,OAAO,CAAC,OAAO,EAAE,MAAM;IAsBjC,OAAO,CAAC,YAAY;IAapB,OAAO,CAAC,WAAW;IAanB,OAAO,CAAC,UAAU;IAiClB,OAAO,CAAC,KAAK;IA2Db,MAAM,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;IAUlB,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,IAAI;CAO/B;AAED,qBAAa,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAE,SAAQ,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC;IACjD,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,MAAM,CAAS;gBAEX,KAAK,EAAE,MAAM,EAAE,KAAK,SAAI;IAMpC,IAAI,KAAK,IAAI,MAAM,CAElB;IAED,IAAI,KAAK,CAAC,KAAK,EAAE,MAAM,EAGtB;IAED,IAAI,KAAK,IAAI,MAAM,CAElB;IAED,IAAI,KAAK,CAAC,KAAK,EAAE,MAAM,EAGtB;IAED,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAI1B,IAAI,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAI3B,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IAK3B,OAAO,CAAC,SAAS;CAKlB;AAED,qBAAa,MAAM,CAAC,CAAC,EAAE,CAAC;IACtB,OAAO,CAAC,GAAG,CAAwB;IAEnC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IAW3B,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IAc9B,OAAO,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,IAAI,GAAG,IAAI;CAS9C;AAED,qBAAa,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAE,SAAQ,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IACrD,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IAO3B,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAQ1B,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;CAOrB"}