@itwin/core-bentley 4.0.0-dev.8 → 4.0.0-dev.80

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 (211) hide show
  1. package/CHANGELOG.md +50 -1
  2. package/lib/cjs/AccessToken.d.ts +10 -10
  3. package/lib/cjs/AccessToken.d.ts.map +1 -1
  4. package/lib/cjs/AccessToken.js +9 -9
  5. package/lib/cjs/Assert.d.ts +25 -25
  6. package/lib/cjs/Assert.js +45 -45
  7. package/lib/cjs/Assert.js.map +1 -1
  8. package/lib/cjs/BeEvent.d.ts +81 -81
  9. package/lib/cjs/BeEvent.d.ts.map +1 -1
  10. package/lib/cjs/BeEvent.js +156 -156
  11. package/lib/cjs/BeSQLite.d.ts +172 -170
  12. package/lib/cjs/BeSQLite.d.ts.map +1 -1
  13. package/lib/cjs/BeSQLite.js +185 -183
  14. package/lib/cjs/BeSQLite.js.map +1 -1
  15. package/lib/cjs/BentleyError.d.ts +378 -378
  16. package/lib/cjs/BentleyError.d.ts.map +1 -1
  17. package/lib/cjs/BentleyError.js +703 -702
  18. package/lib/cjs/BentleyError.js.map +1 -1
  19. package/lib/cjs/BentleyLoggerCategory.d.ts +11 -11
  20. package/lib/cjs/BentleyLoggerCategory.js +19 -19
  21. package/lib/cjs/ByteStream.d.ts +110 -110
  22. package/lib/cjs/ByteStream.js +159 -159
  23. package/lib/cjs/ClassUtils.d.ts +14 -14
  24. package/lib/cjs/ClassUtils.js +27 -27
  25. package/lib/cjs/Compare.d.ts +47 -47
  26. package/lib/cjs/Compare.d.ts.map +1 -1
  27. package/lib/cjs/Compare.js +75 -75
  28. package/lib/cjs/CompressedId64Set.d.ts +134 -134
  29. package/lib/cjs/CompressedId64Set.d.ts.map +1 -1
  30. package/lib/cjs/CompressedId64Set.js +428 -428
  31. package/lib/cjs/CompressedId64Set.js.map +1 -1
  32. package/lib/cjs/Dictionary.d.ts +125 -125
  33. package/lib/cjs/Dictionary.js +203 -203
  34. package/lib/cjs/Disposable.d.ts +80 -80
  35. package/lib/cjs/Disposable.d.ts.map +1 -1
  36. package/lib/cjs/Disposable.js +120 -120
  37. package/lib/cjs/Id.d.ts +285 -285
  38. package/lib/cjs/Id.d.ts.map +1 -1
  39. package/lib/cjs/Id.js +643 -643
  40. package/lib/cjs/IndexMap.d.ts +65 -65
  41. package/lib/cjs/IndexMap.js +91 -91
  42. package/lib/cjs/JsonSchema.d.ts +77 -77
  43. package/lib/cjs/JsonSchema.d.ts.map +1 -1
  44. package/lib/cjs/JsonSchema.js +9 -9
  45. package/lib/cjs/JsonUtils.d.ts +78 -78
  46. package/lib/cjs/JsonUtils.js +151 -151
  47. package/lib/cjs/LRUMap.d.ts +129 -129
  48. package/lib/cjs/LRUMap.js +333 -333
  49. package/lib/cjs/LRUMap.js.map +1 -1
  50. package/lib/cjs/Logger.d.ts +143 -143
  51. package/lib/cjs/Logger.d.ts.map +1 -1
  52. package/lib/cjs/Logger.js +256 -258
  53. package/lib/cjs/Logger.js.map +1 -1
  54. package/lib/cjs/ObservableSet.d.ts +23 -23
  55. package/lib/cjs/ObservableSet.js +51 -51
  56. package/lib/cjs/OneAtATimeAction.d.ts +31 -31
  57. package/lib/cjs/OneAtATimeAction.js +94 -94
  58. package/lib/cjs/OneAtATimeAction.js.map +1 -1
  59. package/lib/cjs/OrderedId64Iterable.d.ts +74 -74
  60. package/lib/cjs/OrderedId64Iterable.d.ts.map +1 -1
  61. package/lib/cjs/OrderedId64Iterable.js +235 -235
  62. package/lib/cjs/OrderedSet.d.ts +40 -40
  63. package/lib/cjs/OrderedSet.js +64 -64
  64. package/lib/cjs/PriorityQueue.d.ts +70 -70
  65. package/lib/cjs/PriorityQueue.d.ts.map +1 -1
  66. package/lib/cjs/PriorityQueue.js +140 -140
  67. package/lib/cjs/ProcessDetector.d.ts +59 -59
  68. package/lib/cjs/ProcessDetector.js +71 -71
  69. package/lib/cjs/SortedArray.d.ts +236 -232
  70. package/lib/cjs/SortedArray.d.ts.map +1 -1
  71. package/lib/cjs/SortedArray.js +315 -303
  72. package/lib/cjs/SortedArray.js.map +1 -1
  73. package/lib/cjs/StatusCategory.d.ts +30 -30
  74. package/lib/cjs/StatusCategory.d.ts.map +1 -1
  75. package/lib/cjs/StatusCategory.js +460 -460
  76. package/lib/cjs/StatusCategory.js.map +1 -1
  77. package/lib/cjs/StringUtils.d.ts +22 -22
  78. package/lib/cjs/StringUtils.js +148 -148
  79. package/lib/cjs/Time.d.ts +122 -122
  80. package/lib/cjs/Time.js +152 -152
  81. package/lib/cjs/Time.js.map +1 -1
  82. package/lib/cjs/Tracing.d.ts +43 -40
  83. package/lib/cjs/Tracing.d.ts.map +1 -1
  84. package/lib/cjs/Tracing.js +134 -130
  85. package/lib/cjs/Tracing.js.map +1 -1
  86. package/lib/cjs/TupleKeyedMap.d.ts +36 -36
  87. package/lib/cjs/TupleKeyedMap.js +102 -102
  88. package/lib/cjs/TypedArrayBuilder.d.ts +155 -155
  89. package/lib/cjs/TypedArrayBuilder.d.ts.map +1 -1
  90. package/lib/cjs/TypedArrayBuilder.js +206 -208
  91. package/lib/cjs/TypedArrayBuilder.js.map +1 -1
  92. package/lib/cjs/UnexpectedErrors.d.ts +43 -43
  93. package/lib/cjs/UnexpectedErrors.d.ts.map +1 -1
  94. package/lib/cjs/UnexpectedErrors.js +68 -68
  95. package/lib/cjs/UnexpectedErrors.js.map +1 -1
  96. package/lib/cjs/UtilityTypes.d.ts +112 -96
  97. package/lib/cjs/UtilityTypes.d.ts.map +1 -1
  98. package/lib/cjs/UtilityTypes.js +40 -40
  99. package/lib/cjs/UtilityTypes.js.map +1 -1
  100. package/lib/cjs/YieldManager.d.ts +18 -18
  101. package/lib/cjs/YieldManager.js +34 -34
  102. package/lib/cjs/core-bentley.d.ts +74 -74
  103. package/lib/cjs/core-bentley.js +94 -90
  104. package/lib/cjs/core-bentley.js.map +1 -1
  105. package/lib/cjs/partitionArray.d.ts +21 -21
  106. package/lib/cjs/partitionArray.js +43 -43
  107. package/lib/esm/AccessToken.d.ts +10 -10
  108. package/lib/esm/AccessToken.d.ts.map +1 -1
  109. package/lib/esm/AccessToken.js +8 -8
  110. package/lib/esm/Assert.d.ts +25 -25
  111. package/lib/esm/Assert.js +41 -41
  112. package/lib/esm/Assert.js.map +1 -1
  113. package/lib/esm/BeEvent.d.ts +81 -81
  114. package/lib/esm/BeEvent.d.ts.map +1 -1
  115. package/lib/esm/BeEvent.js +150 -150
  116. package/lib/esm/BeSQLite.d.ts +172 -170
  117. package/lib/esm/BeSQLite.d.ts.map +1 -1
  118. package/lib/esm/BeSQLite.js +182 -180
  119. package/lib/esm/BeSQLite.js.map +1 -1
  120. package/lib/esm/BentleyError.d.ts +378 -378
  121. package/lib/esm/BentleyError.d.ts.map +1 -1
  122. package/lib/esm/BentleyError.js +699 -698
  123. package/lib/esm/BentleyError.js.map +1 -1
  124. package/lib/esm/BentleyLoggerCategory.d.ts +11 -11
  125. package/lib/esm/BentleyLoggerCategory.js +16 -16
  126. package/lib/esm/ByteStream.d.ts +110 -110
  127. package/lib/esm/ByteStream.js +155 -155
  128. package/lib/esm/ClassUtils.d.ts +14 -14
  129. package/lib/esm/ClassUtils.js +22 -22
  130. package/lib/esm/Compare.d.ts +47 -47
  131. package/lib/esm/Compare.d.ts.map +1 -1
  132. package/lib/esm/Compare.js +63 -63
  133. package/lib/esm/CompressedId64Set.d.ts +134 -134
  134. package/lib/esm/CompressedId64Set.d.ts.map +1 -1
  135. package/lib/esm/CompressedId64Set.js +423 -423
  136. package/lib/esm/CompressedId64Set.js.map +1 -1
  137. package/lib/esm/Dictionary.d.ts +125 -125
  138. package/lib/esm/Dictionary.js +199 -199
  139. package/lib/esm/Disposable.d.ts +80 -80
  140. package/lib/esm/Disposable.d.ts.map +1 -1
  141. package/lib/esm/Disposable.js +112 -112
  142. package/lib/esm/Id.d.ts +285 -285
  143. package/lib/esm/Id.d.ts.map +1 -1
  144. package/lib/esm/Id.js +639 -639
  145. package/lib/esm/IndexMap.d.ts +65 -65
  146. package/lib/esm/IndexMap.js +86 -86
  147. package/lib/esm/JsonSchema.d.ts +77 -77
  148. package/lib/esm/JsonSchema.d.ts.map +1 -1
  149. package/lib/esm/JsonSchema.js +8 -8
  150. package/lib/esm/JsonUtils.d.ts +78 -78
  151. package/lib/esm/JsonUtils.js +148 -148
  152. package/lib/esm/LRUMap.d.ts +129 -129
  153. package/lib/esm/LRUMap.js +326 -326
  154. package/lib/esm/LRUMap.js.map +1 -1
  155. package/lib/esm/Logger.d.ts +143 -143
  156. package/lib/esm/Logger.d.ts.map +1 -1
  157. package/lib/esm/Logger.js +253 -253
  158. package/lib/esm/Logger.js.map +1 -1
  159. package/lib/esm/ObservableSet.d.ts +23 -23
  160. package/lib/esm/ObservableSet.js +47 -47
  161. package/lib/esm/OneAtATimeAction.d.ts +31 -31
  162. package/lib/esm/OneAtATimeAction.js +89 -89
  163. package/lib/esm/OneAtATimeAction.js.map +1 -1
  164. package/lib/esm/OrderedId64Iterable.d.ts +74 -74
  165. package/lib/esm/OrderedId64Iterable.d.ts.map +1 -1
  166. package/lib/esm/OrderedId64Iterable.js +232 -232
  167. package/lib/esm/OrderedSet.d.ts +40 -40
  168. package/lib/esm/OrderedSet.js +59 -59
  169. package/lib/esm/PriorityQueue.d.ts +70 -70
  170. package/lib/esm/PriorityQueue.d.ts.map +1 -1
  171. package/lib/esm/PriorityQueue.js +136 -136
  172. package/lib/esm/ProcessDetector.d.ts +59 -59
  173. package/lib/esm/ProcessDetector.js +67 -67
  174. package/lib/esm/SortedArray.d.ts +236 -232
  175. package/lib/esm/SortedArray.d.ts.map +1 -1
  176. package/lib/esm/SortedArray.js +308 -296
  177. package/lib/esm/SortedArray.js.map +1 -1
  178. package/lib/esm/StatusCategory.d.ts +30 -30
  179. package/lib/esm/StatusCategory.d.ts.map +1 -1
  180. package/lib/esm/StatusCategory.js +455 -454
  181. package/lib/esm/StatusCategory.js.map +1 -1
  182. package/lib/esm/StringUtils.d.ts +22 -22
  183. package/lib/esm/StringUtils.js +142 -142
  184. package/lib/esm/Time.d.ts +122 -122
  185. package/lib/esm/Time.js +146 -146
  186. package/lib/esm/Time.js.map +1 -1
  187. package/lib/esm/Tracing.d.ts +43 -40
  188. package/lib/esm/Tracing.d.ts.map +1 -1
  189. package/lib/esm/Tracing.js +130 -126
  190. package/lib/esm/Tracing.js.map +1 -1
  191. package/lib/esm/TupleKeyedMap.d.ts +36 -36
  192. package/lib/esm/TupleKeyedMap.js +98 -98
  193. package/lib/esm/TypedArrayBuilder.d.ts +155 -155
  194. package/lib/esm/TypedArrayBuilder.d.ts.map +1 -1
  195. package/lib/esm/TypedArrayBuilder.js +198 -200
  196. package/lib/esm/TypedArrayBuilder.js.map +1 -1
  197. package/lib/esm/UnexpectedErrors.d.ts +43 -43
  198. package/lib/esm/UnexpectedErrors.d.ts.map +1 -1
  199. package/lib/esm/UnexpectedErrors.js +65 -64
  200. package/lib/esm/UnexpectedErrors.js.map +1 -1
  201. package/lib/esm/UtilityTypes.d.ts +112 -96
  202. package/lib/esm/UtilityTypes.d.ts.map +1 -1
  203. package/lib/esm/UtilityTypes.js +34 -34
  204. package/lib/esm/UtilityTypes.js.map +1 -1
  205. package/lib/esm/YieldManager.d.ts +18 -18
  206. package/lib/esm/YieldManager.js +30 -30
  207. package/lib/esm/core-bentley.d.ts +74 -74
  208. package/lib/esm/core-bentley.js +78 -78
  209. package/lib/esm/partitionArray.d.ts +21 -21
  210. package/lib/esm/partitionArray.js +39 -39
  211. package/package.json +9 -9
package/lib/cjs/Id.d.ts CHANGED
@@ -1,286 +1,286 @@
1
- /** @packageDocumentation
2
- * @module Ids
3
- */
4
- /** A string containing a well-formed string representation of an [Id64]($core-bentley).
5
- * See [Working with Ids]($docs/learning/common/Id64.md).
6
- * @public
7
- */
8
- export declare type Id64String = string;
9
- /** A string containing a well-formed string representation of a [Guid]($core-bentley).
10
- * @public
11
- */
12
- export declare type GuidString = string;
13
- /** A set of [[Id64String]]s.
14
- * @public
15
- */
16
- export declare type Id64Set = Set<Id64String>;
17
- /** An array of [[Id64String]]s.
18
- * @public
19
- */
20
- export declare type Id64Array = Id64String[];
21
- /** Used as an argument to a function that can accept one or more [[Id64String]]s.
22
- * @public
23
- */
24
- export declare type Id64Arg = Id64String | Id64Set | Id64Array;
25
- /**
26
- * The Id64 namespace provides facilities for working with 64-bit identifiers. These Ids are stored as 64-bit integers inside an [[IModelDb]], but must be represented
27
- * as strings in JavaScript because JavaScript does not intrinsically support 64-bit integers.
28
- *
29
- * The [[Id64String]] type alias is used to indicate function arguments, return types, and variables which are known to contain a well-formed representation of a 64-bit Id.
30
- *
31
- * See [Working with Ids]($docs/learning/common/Id64.md) for a detailed description and code examples.
32
- * @public
33
- */
34
- export declare namespace Id64 {
35
- /** Extract the "local" Id portion of an Id64String, contained in the lower 40 bits of the 64-bit value. */
36
- function getLocalId(id: Id64String): number;
37
- /** Extract the briefcase Id portion of an Id64String, contained in the upper 24 bits of the 64-bit value. */
38
- function getBriefcaseId(id: Id64String): number;
39
- /** Create an Id64String from its JSON representation.
40
- * @param prop The JSON representation of an Id.
41
- * @returns A well-formed Id string.
42
- * @note if the input is undefined, the result is "0", indicating an invalid Id.
43
- * @note if the input is not undefined, the result is the same as that of [[Id64.fromString]].
44
- */
45
- function fromJSON(prop?: string): Id64String;
46
- /** Given a string value, attempt to normalize it into a well-formed Id string.
47
- * If the input is already a well-formed Id string, it is returned unmodified.
48
- * Otherwise, the input is trimmed of leading and trailing whitespace, converted to lowercase, and an attempt is made to parse it as a 64-bit hexadecimal integer.
49
- * If parsing succeeds the normalized result is returned; otherwise the result is "0", indicating an invalid Id.
50
- *
51
- * For a description of "well-formed", see [Working with Ids]($docs/learning/common/Id64.md).
52
- */
53
- function fromString(val: string): Id64String;
54
- /** Produce an Id string from a local and briefcase Id.
55
- * @param localId The non-zero local Id as an unsigned 40-bit integer.
56
- * @param briefcaseId The briefcase Id as an unsigned 24-bit integer.
57
- * @returns an Id64String containing the hexadecimal string representation of the unsigned 64-bit integer which would result from the
58
- * operation `localId | (briefcaseId << 40)`, or an invalid Id "0" if the inputs are invalid.
59
- */
60
- function fromLocalAndBriefcaseIds(localId: number, briefcaseId: number): Id64String;
61
- /** Create an Id64String from a pair of unsigned 32-bit integers.
62
- * @param lowBytes The lower 4 bytes of the Id
63
- * @param highBytes The upper 4 bytes of the Id
64
- * @returns an Id64String containing the hexadecimal string representation of the unsigned 64-bit integer which would result from the
65
- * operation `lowBytes | (highBytes << 32)`.
66
- * @see [[Id64.fromUint32PairObject]] if you have a [[Id64.Uint32Pair]] object.
67
- */
68
- function fromUint32Pair(lowBytes: number, highBytes: number): Id64String;
69
- /** Create an Id64String from a [[Id64.Uint32Pair]].
70
- * @see [[Id64.fromUint32Pair]].
71
- */
72
- function fromUint32PairObject(pair: Uint32Pair): Id64String;
73
- /** Returns true if the inputs represent two halves of a valid 64-bit Id.
74
- * @see [[Id64.Uint32Pair]].
75
- */
76
- function isValidUint32Pair(lowBytes: number, highBytes: number): boolean;
77
- /** Represents an [[Id64]] as a pair of unsigned 32-bit integers. Because Javascript lacks efficient support for 64-bit integers,
78
- * this representation can be useful in performance-sensitive code like the render loop.
79
- * @see [[Id64.getUint32Pair]] to convert an [[Id64String]] to a Uint32Pair.
80
- * @see [[Id64.fromUint32Pair]] to convert a Uint32Pair to an [[Id64String]].
81
- * @see [[Id64.Uint32Set]] and [[Id64.Uint32Map]] for collections based on Uint32Pairs.
82
- */
83
- interface Uint32Pair {
84
- /** The lower 4 bytes of the 64-bit integer. */
85
- lower: number;
86
- /** The upper 4 bytes of the 64-bit integer. */
87
- upper: number;
88
- }
89
- /** Convert an Id64String to a 64-bit unsigned integer represented as a pair of unsigned 32-bit integers.
90
- * @param id The well-formed string representation of a 64-bit Id.
91
- * @param out Used as the return value if supplied; otherwise a new object is returned.
92
- * @returns An object containing the parsed lower and upper 32-bit integers comprising the 64-bit Id.
93
- */
94
- function getUint32Pair(id: Id64String, out?: Uint32Pair): Uint32Pair;
95
- /** Extract an unsigned 32-bit integer from the lower 4 bytes of an Id64String. */
96
- function getLowerUint32(id: Id64String): number;
97
- /** Extract an unsigned 32-bit integer from the upper 4 bytes of an Id64String. */
98
- function getUpperUint32(id: Id64String): number;
99
- /** Convert an [[Id64Arg]] into an [[Id64Set]].
100
- *
101
- * This method can be used by functions that accept an Id64Arg to conveniently process the value(s). For example:
102
- * ```ts
103
- * public addCategories(arg: Id64Arg) { Id64.toIdSet(arg).forEach((id) => this.categories.add(id)); }
104
- * ```
105
- *
106
- * Alternatively, to avoid allocating a new Id64Set, use [[Id64.iterable]].
107
- *
108
- * @param arg The Ids to convert to an Id64Set.
109
- * @param makeCopy If true, and the input is already an Id64Set, returns a deep copy of the input.
110
- * @returns An Id64Set containing the set of [[Id64String]]s represented by the Id64Arg.
111
- */
112
- function toIdSet(arg: Id64Arg, makeCopy?: boolean): Id64Set;
113
- /** Obtain iterator over the specified Ids.
114
- * @see [[Id64.iterable]].
115
- */
116
- function iterator(ids: Id64Arg): Iterator<Id64String>;
117
- /** Obtain an iterable over the specified Ids. Example usage:
118
- * ```ts
119
- * const ids = ["0x123", "0xfed"];
120
- * for (const id of Id64.iterable(ids))
121
- * console.log(id);
122
- * ```
123
- */
124
- function iterable(ids: Id64Arg): Iterable<Id64String>;
125
- /** Return the first [[Id64String]] of an [[Id64Arg]]. */
126
- function getFirst(arg: Id64Arg): Id64String;
127
- /** Return the number of [[Id64String]]s represented by an [[Id64Arg]]. */
128
- function sizeOf(arg: Id64Arg): number;
129
- /** Returns true if the [[Id64Arg]] contains the specified Id. */
130
- function has(arg: Id64Arg, id: Id64String): boolean;
131
- /** The string representation of an invalid Id. */
132
- const invalid = "0";
133
- /** Determine if the supplied id string represents a transient Id.
134
- * @param id A well-formed Id string.
135
- * @returns true if the Id represents a transient Id.
136
- * @note This method assumes the input is a well-formed Id string.
137
- * @see [[Id64.isTransientId64]]
138
- * @see [[TransientIdSequence]]
139
- */
140
- function isTransient(id: Id64String): boolean;
141
- /** Determine if the input is a well-formed [[Id64String]] and represents a transient Id.
142
- * @see [[Id64.isTransient]]
143
- * @see [[Id64.isId64]]
144
- * @see [[TransientIdSequence]]
145
- */
146
- function isTransientId64(id: string): boolean;
147
- /** Determine if the input is a well-formed [[Id64String]].
148
- *
149
- * For a description of "well-formed", see [Working with Ids]($docs/learning/common/Id64.md).
150
- * @see [[Id64.isValidId64]]
151
- */
152
- function isId64(id: string): boolean;
153
- /** Returns true if the input is not equal to the representation of an invalid Id.
154
- * @note This method assumes the input is a well-formed Id string.
155
- * @see [[Id64.isInvalid]]
156
- * @see [[Id64.isValidId64]]
157
- */
158
- function isValid(id: Id64String): boolean;
159
- /** Returns true if the input is a well-formed [[Id64String]] representing a valid Id.
160
- * @see [[Id64.isValid]]
161
- * @see [[Id64.isId64]]
162
- */
163
- function isValidId64(id: string): boolean;
164
- /** Returns true if the input is a well-formed [[Id64String]] representing an invalid Id.
165
- * @see [[Id64.isValid]]
166
- */
167
- function isInvalid(id: Id64String): boolean;
168
- /** A specialized replacement for Set<Id64String> optimized for performance-critical code which represents large sets of [[Id64]]s as pairs of
169
- * 32-bit integers.
170
- * The internal representation is a Map<number, Set<number>> where the Map key is the upper 4 bytes of the IDs and the Set elements are the lower 4 bytes of the IDs.
171
- * Because the upper 4 bytes store the 24-bit briefcase ID plus the upper 8 bits of the local ID, there will be a very small distribution of unique Map keys.
172
- * To further optimize this data type, the following assumptions are made regarding the { lower, upper } inputs, and no validation is performed to confirm them:
173
- * - The inputs are unsigned 32-bit integers;
174
- * - The inputs represent a valid Id64String (e.g., local ID is not zero).
175
- * @see [[Id64.Uint32Map]] for a similarly-optimized replacement for Map<Id64String, T>
176
- * @public
177
- */
178
- class Uint32Set {
179
- protected readonly _map: Map<number, Set<number>>;
180
- /** Construct a new Uint32Set.
181
- * @param ids If supplied, all of the specified Ids will be added to the new set.
182
- */
183
- constructor(ids?: Id64Arg);
184
- /** Remove all contents of this set. */
185
- clear(): void;
186
- /** Add an Id to the set. */
187
- addId(id: Id64String): void;
188
- /** Add any number of Ids to the set. */
189
- addIds(ids: Id64Arg): void;
190
- /** Returns true if the set contains the specified Id. */
191
- hasId(id: Id64String): boolean;
192
- /** Add an Id to the set. */
193
- add(low: number, high: number): void;
194
- /** Remove an Id from the set. */
195
- deleteId(id: Id64String): void;
196
- /** Remove any number of Ids from the set. */
197
- deleteIds(ids: Id64Arg): void;
198
- /** Remove an Id from the set. */
199
- delete(low: number, high: number): void;
200
- /** Returns true if the set contains the specified Id. */
201
- has(low: number, high: number): boolean;
202
- /** Returns true if the set contains the Id specified by `pair`. */
203
- hasPair(pair: Uint32Pair): boolean;
204
- /** Returns true if the set contains no Ids. */
205
- get isEmpty(): boolean;
206
- /** Returns the number of Ids contained in the set. */
207
- get size(): number;
208
- /** Populates and returns an array of all Ids contained in the set. */
209
- toId64Array(): Id64Array;
210
- /** Populates and returns a set of all Ids contained in the set. */
211
- toId64Set(): Id64Set;
212
- /** Execute a function against each Id in this set. */
213
- forEach(func: (lo: number, hi: number) => void): void;
214
- }
215
- /** A specialized replacement for Map<Id64String, T> optimized for performance-critical code.
216
- * @see [[Id64.Uint32Set]] for implementation details.
217
- * @public
218
- */
219
- class Uint32Map<T> {
220
- protected readonly _map: Map<number, Map<number, T>>;
221
- /** Remove all entries from the map. */
222
- clear(): void;
223
- /** Find an entry in the map by Id. */
224
- getById(id: Id64String): T | undefined;
225
- /** Set an entry in the map by Id. */
226
- setById(id: Id64String, value: T): void;
227
- /** Set an entry in the map by Id components. */
228
- set(low: number, high: number, value: T): void;
229
- /** Get an entry from the map by Id components. */
230
- get(low: number, high: number): T | undefined;
231
- /** Returns true if the map contains no entries. */
232
- get isEmpty(): boolean;
233
- /** Returns the number of entries in the map. */
234
- get size(): number;
235
- /** Execute a function against each entry in this map. */
236
- forEach(func: (lo: number, hi: number, value: T) => void): void;
237
- }
238
- }
239
- /**
240
- * Generates unique [[Id64String]] values in sequence, which are guaranteed not to conflict with Ids associated with persistent elements or models.
241
- * This is useful for associating stable, non-persistent identifiers with things like [Decorator]($frontend)s.
242
- * A TransientIdSequence can generate a maximum of (2^40)-2 unique Ids.
243
- * @public
244
- */
245
- export declare class TransientIdSequence {
246
- private _localId;
247
- /** Generate and return the next transient Id64String in the sequence.
248
- * @deprecated in 3.x. Use [[getNext]].
249
- */
250
- get next(): Id64String;
251
- /** Generate and return the next transient Id64String in the sequence. */
252
- getNext(): Id64String;
253
- /** Preview the transient Id64String that will be returned by the next call to [[getNext]].
254
- * This is primarily useful for tests.
255
- */
256
- peekNext(): Id64String;
257
- }
258
- /**
259
- * The Guid namespace provides facilities for working with GUID strings using the "8-4-4-4-12" pattern.
260
- *
261
- * The [[GuidString]] type alias is used to indicate function arguments, return types, and variables which are known to
262
- * be in the GUID format.
263
- * @public
264
- */
265
- export declare namespace Guid {
266
- /** Represents the empty Guid 00000000-0000-0000-0000-000000000000 */
267
- const empty: GuidString;
268
- /** Determine whether the input string is "guid-like". That is, it follows the 8-4-4-4-12 pattern. This does not enforce
269
- * that the string is actually in valid UUID format.
270
- */
271
- function isGuid(value: string): boolean;
272
- /** Determine whether the input string is a valid V4 Guid string */
273
- function isV4Guid(value: string): boolean;
274
- /** Create a new V4 Guid value */
275
- function createValue(): GuidString;
276
- /**
277
- * Normalize a Guid string if possible. Normalization consists of:
278
- * - Convert all characters to lower case
279
- * - Trim any leading or trailing whitespace
280
- * - Convert to the standard Guid format "8-4-4-4-12", repositioning the '-' characters as necessary, presuming there are exactly 32 hexadecimal digits.
281
- * @param value Input value that represents a Guid
282
- * @returns Normalized representation of the Guid string. If the normalization fails, return the *original* value unmodified (Note: it is *not* a valid Guid)
283
- */
284
- function normalize(value: GuidString): GuidString;
285
- }
1
+ /** @packageDocumentation
2
+ * @module Ids
3
+ */
4
+ /** A string containing a well-formed string representation of an [Id64]($core-bentley).
5
+ * See [Working with Ids]($docs/learning/common/Id64.md).
6
+ * @public
7
+ */
8
+ export type Id64String = string;
9
+ /** A string containing a well-formed string representation of a [Guid]($core-bentley).
10
+ * @public
11
+ */
12
+ export type GuidString = string;
13
+ /** A set of [[Id64String]]s.
14
+ * @public
15
+ */
16
+ export type Id64Set = Set<Id64String>;
17
+ /** An array of [[Id64String]]s.
18
+ * @public
19
+ */
20
+ export type Id64Array = Id64String[];
21
+ /** Used as an argument to a function that can accept one or more [[Id64String]]s.
22
+ * @public
23
+ */
24
+ export type Id64Arg = Id64String | Id64Set | Id64Array;
25
+ /**
26
+ * The Id64 namespace provides facilities for working with 64-bit identifiers. These Ids are stored as 64-bit integers inside an [[IModelDb]], but must be represented
27
+ * as strings in JavaScript because JavaScript does not intrinsically support 64-bit integers.
28
+ *
29
+ * The [[Id64String]] type alias is used to indicate function arguments, return types, and variables which are known to contain a well-formed representation of a 64-bit Id.
30
+ *
31
+ * See [Working with Ids]($docs/learning/common/Id64.md) for a detailed description and code examples.
32
+ * @public
33
+ */
34
+ export declare namespace Id64 {
35
+ /** Extract the "local" Id portion of an Id64String, contained in the lower 40 bits of the 64-bit value. */
36
+ function getLocalId(id: Id64String): number;
37
+ /** Extract the briefcase Id portion of an Id64String, contained in the upper 24 bits of the 64-bit value. */
38
+ function getBriefcaseId(id: Id64String): number;
39
+ /** Create an Id64String from its JSON representation.
40
+ * @param prop The JSON representation of an Id.
41
+ * @returns A well-formed Id string.
42
+ * @note if the input is undefined, the result is "0", indicating an invalid Id.
43
+ * @note if the input is not undefined, the result is the same as that of [[Id64.fromString]].
44
+ */
45
+ function fromJSON(prop?: string): Id64String;
46
+ /** Given a string value, attempt to normalize it into a well-formed Id string.
47
+ * If the input is already a well-formed Id string, it is returned unmodified.
48
+ * Otherwise, the input is trimmed of leading and trailing whitespace, converted to lowercase, and an attempt is made to parse it as a 64-bit hexadecimal integer.
49
+ * If parsing succeeds the normalized result is returned; otherwise the result is "0", indicating an invalid Id.
50
+ *
51
+ * For a description of "well-formed", see [Working with Ids]($docs/learning/common/Id64.md).
52
+ */
53
+ function fromString(val: string): Id64String;
54
+ /** Produce an Id string from a local and briefcase Id.
55
+ * @param localId The non-zero local Id as an unsigned 40-bit integer.
56
+ * @param briefcaseId The briefcase Id as an unsigned 24-bit integer.
57
+ * @returns an Id64String containing the hexadecimal string representation of the unsigned 64-bit integer which would result from the
58
+ * operation `localId | (briefcaseId << 40)`, or an invalid Id "0" if the inputs are invalid.
59
+ */
60
+ function fromLocalAndBriefcaseIds(localId: number, briefcaseId: number): Id64String;
61
+ /** Create an Id64String from a pair of unsigned 32-bit integers.
62
+ * @param lowBytes The lower 4 bytes of the Id
63
+ * @param highBytes The upper 4 bytes of the Id
64
+ * @returns an Id64String containing the hexadecimal string representation of the unsigned 64-bit integer which would result from the
65
+ * operation `lowBytes | (highBytes << 32)`.
66
+ * @see [[Id64.fromUint32PairObject]] if you have a [[Id64.Uint32Pair]] object.
67
+ */
68
+ function fromUint32Pair(lowBytes: number, highBytes: number): Id64String;
69
+ /** Create an Id64String from a [[Id64.Uint32Pair]].
70
+ * @see [[Id64.fromUint32Pair]].
71
+ */
72
+ function fromUint32PairObject(pair: Uint32Pair): Id64String;
73
+ /** Returns true if the inputs represent two halves of a valid 64-bit Id.
74
+ * @see [[Id64.Uint32Pair]].
75
+ */
76
+ function isValidUint32Pair(lowBytes: number, highBytes: number): boolean;
77
+ /** Represents an [[Id64]] as a pair of unsigned 32-bit integers. Because Javascript lacks efficient support for 64-bit integers,
78
+ * this representation can be useful in performance-sensitive code like the render loop.
79
+ * @see [[Id64.getUint32Pair]] to convert an [[Id64String]] to a Uint32Pair.
80
+ * @see [[Id64.fromUint32Pair]] to convert a Uint32Pair to an [[Id64String]].
81
+ * @see [[Id64.Uint32Set]] and [[Id64.Uint32Map]] for collections based on Uint32Pairs.
82
+ */
83
+ interface Uint32Pair {
84
+ /** The lower 4 bytes of the 64-bit integer. */
85
+ lower: number;
86
+ /** The upper 4 bytes of the 64-bit integer. */
87
+ upper: number;
88
+ }
89
+ /** Convert an Id64String to a 64-bit unsigned integer represented as a pair of unsigned 32-bit integers.
90
+ * @param id The well-formed string representation of a 64-bit Id.
91
+ * @param out Used as the return value if supplied; otherwise a new object is returned.
92
+ * @returns An object containing the parsed lower and upper 32-bit integers comprising the 64-bit Id.
93
+ */
94
+ function getUint32Pair(id: Id64String, out?: Uint32Pair): Uint32Pair;
95
+ /** Extract an unsigned 32-bit integer from the lower 4 bytes of an Id64String. */
96
+ function getLowerUint32(id: Id64String): number;
97
+ /** Extract an unsigned 32-bit integer from the upper 4 bytes of an Id64String. */
98
+ function getUpperUint32(id: Id64String): number;
99
+ /** Convert an [[Id64Arg]] into an [[Id64Set]].
100
+ *
101
+ * This method can be used by functions that accept an Id64Arg to conveniently process the value(s). For example:
102
+ * ```ts
103
+ * public addCategories(arg: Id64Arg) { Id64.toIdSet(arg).forEach((id) => this.categories.add(id)); }
104
+ * ```
105
+ *
106
+ * Alternatively, to avoid allocating a new Id64Set, use [[Id64.iterable]].
107
+ *
108
+ * @param arg The Ids to convert to an Id64Set.
109
+ * @param makeCopy If true, and the input is already an Id64Set, returns a deep copy of the input.
110
+ * @returns An Id64Set containing the set of [[Id64String]]s represented by the Id64Arg.
111
+ */
112
+ function toIdSet(arg: Id64Arg, makeCopy?: boolean): Id64Set;
113
+ /** Obtain iterator over the specified Ids.
114
+ * @see [[Id64.iterable]].
115
+ */
116
+ function iterator(ids: Id64Arg): Iterator<Id64String>;
117
+ /** Obtain an iterable over the specified Ids. Example usage:
118
+ * ```ts
119
+ * const ids = ["0x123", "0xfed"];
120
+ * for (const id of Id64.iterable(ids))
121
+ * console.log(id);
122
+ * ```
123
+ */
124
+ function iterable(ids: Id64Arg): Iterable<Id64String>;
125
+ /** Return the first [[Id64String]] of an [[Id64Arg]]. */
126
+ function getFirst(arg: Id64Arg): Id64String;
127
+ /** Return the number of [[Id64String]]s represented by an [[Id64Arg]]. */
128
+ function sizeOf(arg: Id64Arg): number;
129
+ /** Returns true if the [[Id64Arg]] contains the specified Id. */
130
+ function has(arg: Id64Arg, id: Id64String): boolean;
131
+ /** The string representation of an invalid Id. */
132
+ const invalid = "0";
133
+ /** Determine if the supplied id string represents a transient Id.
134
+ * @param id A well-formed Id string.
135
+ * @returns true if the Id represents a transient Id.
136
+ * @note This method assumes the input is a well-formed Id string.
137
+ * @see [[Id64.isTransientId64]]
138
+ * @see [[TransientIdSequence]]
139
+ */
140
+ function isTransient(id: Id64String): boolean;
141
+ /** Determine if the input is a well-formed [[Id64String]] and represents a transient Id.
142
+ * @see [[Id64.isTransient]]
143
+ * @see [[Id64.isId64]]
144
+ * @see [[TransientIdSequence]]
145
+ */
146
+ function isTransientId64(id: string): boolean;
147
+ /** Determine if the input is a well-formed [[Id64String]].
148
+ *
149
+ * For a description of "well-formed", see [Working with Ids]($docs/learning/common/Id64.md).
150
+ * @see [[Id64.isValidId64]]
151
+ */
152
+ function isId64(id: string): boolean;
153
+ /** Returns true if the input is not equal to the representation of an invalid Id.
154
+ * @note This method assumes the input is a well-formed Id string.
155
+ * @see [[Id64.isInvalid]]
156
+ * @see [[Id64.isValidId64]]
157
+ */
158
+ function isValid(id: Id64String): boolean;
159
+ /** Returns true if the input is a well-formed [[Id64String]] representing a valid Id.
160
+ * @see [[Id64.isValid]]
161
+ * @see [[Id64.isId64]]
162
+ */
163
+ function isValidId64(id: string): boolean;
164
+ /** Returns true if the input is a well-formed [[Id64String]] representing an invalid Id.
165
+ * @see [[Id64.isValid]]
166
+ */
167
+ function isInvalid(id: Id64String): boolean;
168
+ /** A specialized replacement for Set<Id64String> optimized for performance-critical code which represents large sets of [[Id64]]s as pairs of
169
+ * 32-bit integers.
170
+ * The internal representation is a Map<number, Set<number>> where the Map key is the upper 4 bytes of the IDs and the Set elements are the lower 4 bytes of the IDs.
171
+ * Because the upper 4 bytes store the 24-bit briefcase ID plus the upper 8 bits of the local ID, there will be a very small distribution of unique Map keys.
172
+ * To further optimize this data type, the following assumptions are made regarding the { lower, upper } inputs, and no validation is performed to confirm them:
173
+ * - The inputs are unsigned 32-bit integers;
174
+ * - The inputs represent a valid Id64String (e.g., local ID is not zero).
175
+ * @see [[Id64.Uint32Map]] for a similarly-optimized replacement for Map<Id64String, T>
176
+ * @public
177
+ */
178
+ class Uint32Set {
179
+ protected readonly _map: Map<number, Set<number>>;
180
+ /** Construct a new Uint32Set.
181
+ * @param ids If supplied, all of the specified Ids will be added to the new set.
182
+ */
183
+ constructor(ids?: Id64Arg);
184
+ /** Remove all contents of this set. */
185
+ clear(): void;
186
+ /** Add an Id to the set. */
187
+ addId(id: Id64String): void;
188
+ /** Add any number of Ids to the set. */
189
+ addIds(ids: Id64Arg): void;
190
+ /** Returns true if the set contains the specified Id. */
191
+ hasId(id: Id64String): boolean;
192
+ /** Add an Id to the set. */
193
+ add(low: number, high: number): void;
194
+ /** Remove an Id from the set. */
195
+ deleteId(id: Id64String): void;
196
+ /** Remove any number of Ids from the set. */
197
+ deleteIds(ids: Id64Arg): void;
198
+ /** Remove an Id from the set. */
199
+ delete(low: number, high: number): void;
200
+ /** Returns true if the set contains the specified Id. */
201
+ has(low: number, high: number): boolean;
202
+ /** Returns true if the set contains the Id specified by `pair`. */
203
+ hasPair(pair: Uint32Pair): boolean;
204
+ /** Returns true if the set contains no Ids. */
205
+ get isEmpty(): boolean;
206
+ /** Returns the number of Ids contained in the set. */
207
+ get size(): number;
208
+ /** Populates and returns an array of all Ids contained in the set. */
209
+ toId64Array(): Id64Array;
210
+ /** Populates and returns a set of all Ids contained in the set. */
211
+ toId64Set(): Id64Set;
212
+ /** Execute a function against each Id in this set. */
213
+ forEach(func: (lo: number, hi: number) => void): void;
214
+ }
215
+ /** A specialized replacement for Map<Id64String, T> optimized for performance-critical code.
216
+ * @see [[Id64.Uint32Set]] for implementation details.
217
+ * @public
218
+ */
219
+ class Uint32Map<T> {
220
+ protected readonly _map: Map<number, Map<number, T>>;
221
+ /** Remove all entries from the map. */
222
+ clear(): void;
223
+ /** Find an entry in the map by Id. */
224
+ getById(id: Id64String): T | undefined;
225
+ /** Set an entry in the map by Id. */
226
+ setById(id: Id64String, value: T): void;
227
+ /** Set an entry in the map by Id components. */
228
+ set(low: number, high: number, value: T): void;
229
+ /** Get an entry from the map by Id components. */
230
+ get(low: number, high: number): T | undefined;
231
+ /** Returns true if the map contains no entries. */
232
+ get isEmpty(): boolean;
233
+ /** Returns the number of entries in the map. */
234
+ get size(): number;
235
+ /** Execute a function against each entry in this map. */
236
+ forEach(func: (lo: number, hi: number, value: T) => void): void;
237
+ }
238
+ }
239
+ /**
240
+ * Generates unique [[Id64String]] values in sequence, which are guaranteed not to conflict with Ids associated with persistent elements or models.
241
+ * This is useful for associating stable, non-persistent identifiers with things like [Decorator]($frontend)s.
242
+ * A TransientIdSequence can generate a maximum of (2^40)-2 unique Ids.
243
+ * @public
244
+ */
245
+ export declare class TransientIdSequence {
246
+ private _localId;
247
+ /** Generate and return the next transient Id64String in the sequence.
248
+ * @deprecated in 3.x. Use [[getNext]].
249
+ */
250
+ get next(): Id64String;
251
+ /** Generate and return the next transient Id64String in the sequence. */
252
+ getNext(): Id64String;
253
+ /** Preview the transient Id64String that will be returned by the next call to [[getNext]].
254
+ * This is primarily useful for tests.
255
+ */
256
+ peekNext(): Id64String;
257
+ }
258
+ /**
259
+ * The Guid namespace provides facilities for working with GUID strings using the "8-4-4-4-12" pattern.
260
+ *
261
+ * The [[GuidString]] type alias is used to indicate function arguments, return types, and variables which are known to
262
+ * be in the GUID format.
263
+ * @public
264
+ */
265
+ export declare namespace Guid {
266
+ /** Represents the empty Guid 00000000-0000-0000-0000-000000000000 */
267
+ const empty: GuidString;
268
+ /** Determine whether the input string is "guid-like". That is, it follows the 8-4-4-4-12 pattern. This does not enforce
269
+ * that the string is actually in valid UUID format.
270
+ */
271
+ function isGuid(value: string): boolean;
272
+ /** Determine whether the input string is a valid V4 Guid string */
273
+ function isV4Guid(value: string): boolean;
274
+ /** Create a new V4 Guid value */
275
+ function createValue(): GuidString;
276
+ /**
277
+ * Normalize a Guid string if possible. Normalization consists of:
278
+ * - Convert all characters to lower case
279
+ * - Trim any leading or trailing whitespace
280
+ * - Convert to the standard Guid format "8-4-4-4-12", repositioning the '-' characters as necessary, presuming there are exactly 32 hexadecimal digits.
281
+ * @param value Input value that represents a Guid
282
+ * @returns Normalized representation of the Guid string. If the normalization fails, return the *original* value unmodified (Note: it is *not* a valid Guid)
283
+ */
284
+ function normalize(value: GuidString): GuidString;
285
+ }
286
286
  //# sourceMappingURL=Id.d.ts.map
@@ -1 +1 @@
1
- {"version":3,"file":"Id.d.ts","sourceRoot":"","sources":["../../src/Id.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH;;;GAGG;AACH,oBAAY,UAAU,GAAG,MAAM,CAAC;AAEhC;;GAEG;AACH,oBAAY,UAAU,GAAG,MAAM,CAAC;AAEhC;;GAEG;AACH,oBAAY,OAAO,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC;AAEtC;;GAEG;AACH,oBAAY,SAAS,GAAG,UAAU,EAAE,CAAC;AAErC;;GAEG;AACH,oBAAY,OAAO,GAAG,UAAU,GAAG,OAAO,GAAG,SAAS,CAAC;AAiCvD;;;;;;;;GAQG;AACH,yBAAiB,IAAI,CAAC;IACpB,2GAA2G;IAC3G,SAAgB,UAAU,CAAC,EAAE,EAAE,UAAU,GAAG,MAAM,CAOjD;IAED,6GAA6G;IAC7G,SAAgB,cAAc,CAAC,EAAE,EAAE,UAAU,GAAG,MAAM,CAMrD;IAED;;;;;OAKG;IACH,SAAgB,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,UAAU,CAElD;IAED;;;;;;OAMG;IACH,SAAgB,UAAU,CAAC,GAAG,EAAE,MAAM,GAAG,UAAU,CAyBlD;IAiBD;;;;;OAKG;IACH,SAAgB,wBAAwB,CAAC,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,UAAU,CAYzF;IA+CD;;;;;;OAMG;IACH,SAAgB,cAAc,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,UAAU,CA8B9E;IAED;;OAEG;IACH,SAAgB,oBAAoB,CAAC,IAAI,EAAE,UAAU,GAAG,UAAU,CAEjE;IAED;;OAEG;IACH,SAAgB,iBAAiB,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO,CAG9E;IAED;;;;;OAKG;IACH,UAAiB,UAAU;QACzB,+CAA+C;QAC/C,KAAK,EAAE,MAAM,CAAC;QACd,+CAA+C;QAC/C,KAAK,EAAE,MAAM,CAAC;KACf;IAED;;;;OAIG;IACH,SAAgB,aAAa,CAAC,EAAE,EAAE,UAAU,EAAE,GAAG,CAAC,EAAE,UAAU,GAAG,UAAU,CAO1E;IAED,kFAAkF;IAClF,SAAgB,cAAc,CAAC,EAAE,EAAE,UAAU,GAAG,MAAM,CAOrD;IAED,kFAAkF;IAClF,SAAgB,cAAc,CAAC,EAAE,EAAE,UAAU,GAAG,MAAM,CAMrD;IAED;;;;;;;;;;;;OAYG;IACH,SAAgB,OAAO,CAAC,GAAG,EAAE,OAAO,EAAE,QAAQ,GAAE,OAAe,GAAG,OAAO,CAexE;IAED;;OAEG;IACH,SAAiB,QAAQ,CAAC,GAAG,EAAE,OAAO,GAAG,QAAQ,CAAC,UAAU,CAAC,CAO5D;IAED;;;;;;OAMG;IACH,SAAgB,QAAQ,CAAC,GAAG,EAAE,OAAO,GAAG,QAAQ,CAAC,UAAU,CAAC,CAI3D;IAED,yDAAyD;IACzD,SAAgB,QAAQ,CAAC,GAAG,EAAE,OAAO,GAAG,UAAU,CAEjD;IAED,0EAA0E;IAC1E,SAAgB,MAAM,CAAC,GAAG,EAAE,OAAO,GAAG,MAAM,CAE3C;IAED,iEAAiE;IACjE,SAAgB,GAAG,CAAC,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,UAAU,GAAG,OAAO,CAOzD;IAED,kDAAkD;IAC3C,MAAM,OAAO,MAAM,CAAC;IAE3B;;;;;;OAMG;IACH,SAAgB,WAAW,CAAC,EAAE,EAAE,UAAU,GAAG,OAAO,CAGnD;IAED;;;;OAIG;IACH,SAAgB,eAAe,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAEnD;IAED;;;;OAIG;IACH,SAAgB,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAsC1C;IAED;;;;OAIG;IACH,SAAgB,OAAO,CAAC,EAAE,EAAE,UAAU,GAAG,OAAO,CAE/C;IAED;;;OAGG;IACH,SAAgB,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAE/C;IAED;;OAEG;IACH,SAAgB,SAAS,CAAC,EAAE,EAAE,UAAU,GAAG,OAAO,CAEjD;IAED;;;;;;;;;OASG;IACH,MAAa,SAAS;QACpB,SAAS,CAAC,QAAQ,CAAC,IAAI,2BAAkC;QAEzD;;WAEG;oBACgB,GAAG,CAAC,EAAE,OAAO;QAKhC,uCAAuC;QAChC,KAAK,IAAI,IAAI;QAIpB,4BAA4B;QACrB,KAAK,CAAC,EAAE,EAAE,UAAU,GAAG,IAAI;QAIlC,wCAAwC;QACjC,MAAM,CAAC,GAAG,EAAE,OAAO,GAAG,IAAI;QAKjC,yDAAyD;QAClD,KAAK,CAAC,EAAE,EAAE,UAAU,GAAG,OAAO;QAErC,4BAA4B;QACrB,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI;QAU3C,iCAAiC;QAC1B,QAAQ,CAAC,EAAE,EAAE,UAAU,GAAG,IAAI;QAIrC,6CAA6C;QACtC,SAAS,CAAC,GAAG,EAAE,OAAO,GAAG,IAAI;QAKpC,iCAAiC;QAC1B,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI;QAM9C,yDAAyD;QAClD,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO;QAK9C,mEAAmE;QAC5D,OAAO,CAAC,IAAI,EAAE,UAAU,GAAG,OAAO;QAIzC,+CAA+C;QAC/C,IAAW,OAAO,IAAI,OAAO,CAAiC;QAE9D,sDAAsD;QACtD,IAAW,IAAI,IAAI,MAAM,CAMxB;QAED,sEAAsE;QAC/D,WAAW,IAAI,SAAS;QAS/B,mEAAmE;QAC5D,SAAS,IAAI,OAAO;QAS3B,sDAAsD;QAC/C,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,KAAK,IAAI,GAAG,IAAI;KAK7D;IAED;;;OAGG;IACH,MAAa,SAAS,CAAC,CAAC;QACtB,SAAS,CAAC,QAAQ,CAAC,IAAI,8BAAqC;QAE5D,uCAAuC;QAChC,KAAK,IAAI,IAAI;QACpB,sCAAsC;QAC/B,OAAO,CAAC,EAAE,EAAE,UAAU,GAAG,CAAC,GAAG,SAAS;QAC7C,qCAAqC;QAC9B,OAAO,CAAC,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;QAE9C,gDAAgD;QACzC,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;QAUrD,kDAAkD;QAC3C,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;QAKpD,mDAAmD;QACnD,IAAW,OAAO,IAAI,OAAO,CAAiC;QAC9D,gDAAgD;QAChD,IAAW,IAAI,IAAI,MAAM,CAMxB;QAED,yDAAyD;QAClD,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,KAAK,IAAI,GAAG,IAAI;KAKvE;CACF;AAED;;;;;GAKG;AACH,qBAAa,mBAAmB;IAC9B,OAAO,CAAC,QAAQ,CAAa;IAE7B;;OAEG;IACH,IAAW,IAAI,IAAI,UAAU,CAE5B;IAED,yEAAyE;IAClE,OAAO,IAAI,UAAU;IAI5B;;OAEG;IACI,QAAQ,IAAI,UAAU;CAG9B;AAED;;;;;;GAMG;AACH,yBAAiB,IAAI,CAAC;IAGpB,qEAAqE;IAC9D,MAAM,KAAK,EAAE,UAAmD,CAAC;IAExE;;OAEG;IACH,SAAgB,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAE7C;IAED,mEAAmE;IACnE,SAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAE/C;IAED,iCAAiC;IACjC,SAAgB,WAAW,IAAI,UAAU,CAOxC;IAED;;;;;;;OAOG;IACH,SAAgB,SAAS,CAAC,KAAK,EAAE,UAAU,GAAG,UAAU,CAkBvD;CACF"}
1
+ {"version":3,"file":"Id.d.ts","sourceRoot":"","sources":["../../src/Id.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH;;;GAGG;AACH,MAAM,MAAM,UAAU,GAAG,MAAM,CAAC;AAEhC;;GAEG;AACH,MAAM,MAAM,UAAU,GAAG,MAAM,CAAC;AAEhC;;GAEG;AACH,MAAM,MAAM,OAAO,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC;AAEtC;;GAEG;AACH,MAAM,MAAM,SAAS,GAAG,UAAU,EAAE,CAAC;AAErC;;GAEG;AACH,MAAM,MAAM,OAAO,GAAG,UAAU,GAAG,OAAO,GAAG,SAAS,CAAC;AAiCvD;;;;;;;;GAQG;AACH,yBAAiB,IAAI,CAAC;IACpB,2GAA2G;IAC3G,SAAgB,UAAU,CAAC,EAAE,EAAE,UAAU,GAAG,MAAM,CAOjD;IAED,6GAA6G;IAC7G,SAAgB,cAAc,CAAC,EAAE,EAAE,UAAU,GAAG,MAAM,CAMrD;IAED;;;;;OAKG;IACH,SAAgB,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,UAAU,CAElD;IAED;;;;;;OAMG;IACH,SAAgB,UAAU,CAAC,GAAG,EAAE,MAAM,GAAG,UAAU,CAyBlD;IAiBD;;;;;OAKG;IACH,SAAgB,wBAAwB,CAAC,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,UAAU,CAYzF;IA+CD;;;;;;OAMG;IACH,SAAgB,cAAc,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,UAAU,CA8B9E;IAED;;OAEG;IACH,SAAgB,oBAAoB,CAAC,IAAI,EAAE,UAAU,GAAG,UAAU,CAEjE;IAED;;OAEG;IACH,SAAgB,iBAAiB,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO,CAG9E;IAED;;;;;OAKG;IACH,UAAiB,UAAU;QACzB,+CAA+C;QAC/C,KAAK,EAAE,MAAM,CAAC;QACd,+CAA+C;QAC/C,KAAK,EAAE,MAAM,CAAC;KACf;IAED;;;;OAIG;IACH,SAAgB,aAAa,CAAC,EAAE,EAAE,UAAU,EAAE,GAAG,CAAC,EAAE,UAAU,GAAG,UAAU,CAO1E;IAED,kFAAkF;IAClF,SAAgB,cAAc,CAAC,EAAE,EAAE,UAAU,GAAG,MAAM,CAOrD;IAED,kFAAkF;IAClF,SAAgB,cAAc,CAAC,EAAE,EAAE,UAAU,GAAG,MAAM,CAMrD;IAED;;;;;;;;;;;;OAYG;IACH,SAAgB,OAAO,CAAC,GAAG,EAAE,OAAO,EAAE,QAAQ,GAAE,OAAe,GAAG,OAAO,CAexE;IAED;;OAEG;IACH,SAAiB,QAAQ,CAAC,GAAG,EAAE,OAAO,GAAG,QAAQ,CAAC,UAAU,CAAC,CAO5D;IAED;;;;;;OAMG;IACH,SAAgB,QAAQ,CAAC,GAAG,EAAE,OAAO,GAAG,QAAQ,CAAC,UAAU,CAAC,CAI3D;IAED,yDAAyD;IACzD,SAAgB,QAAQ,CAAC,GAAG,EAAE,OAAO,GAAG,UAAU,CAEjD;IAED,0EAA0E;IAC1E,SAAgB,MAAM,CAAC,GAAG,EAAE,OAAO,GAAG,MAAM,CAE3C;IAED,iEAAiE;IACjE,SAAgB,GAAG,CAAC,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,UAAU,GAAG,OAAO,CAOzD;IAED,kDAAkD;IAC3C,MAAM,OAAO,MAAM,CAAC;IAE3B;;;;;;OAMG;IACH,SAAgB,WAAW,CAAC,EAAE,EAAE,UAAU,GAAG,OAAO,CAGnD;IAED;;;;OAIG;IACH,SAAgB,eAAe,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAEnD;IAED;;;;OAIG;IACH,SAAgB,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAsC1C;IAED;;;;OAIG;IACH,SAAgB,OAAO,CAAC,EAAE,EAAE,UAAU,GAAG,OAAO,CAE/C;IAED;;;OAGG;IACH,SAAgB,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAE/C;IAED;;OAEG;IACH,SAAgB,SAAS,CAAC,EAAE,EAAE,UAAU,GAAG,OAAO,CAEjD;IAED;;;;;;;;;OASG;IACH,MAAa,SAAS;QACpB,SAAS,CAAC,QAAQ,CAAC,IAAI,2BAAkC;QAEzD;;WAEG;oBACgB,GAAG,CAAC,EAAE,OAAO;QAKhC,uCAAuC;QAChC,KAAK,IAAI,IAAI;QAIpB,4BAA4B;QACrB,KAAK,CAAC,EAAE,EAAE,UAAU,GAAG,IAAI;QAIlC,wCAAwC;QACjC,MAAM,CAAC,GAAG,EAAE,OAAO,GAAG,IAAI;QAKjC,yDAAyD;QAClD,KAAK,CAAC,EAAE,EAAE,UAAU,GAAG,OAAO;QAErC,4BAA4B;QACrB,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI;QAU3C,iCAAiC;QAC1B,QAAQ,CAAC,EAAE,EAAE,UAAU,GAAG,IAAI;QAIrC,6CAA6C;QACtC,SAAS,CAAC,GAAG,EAAE,OAAO,GAAG,IAAI;QAKpC,iCAAiC;QAC1B,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI;QAM9C,yDAAyD;QAClD,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO;QAK9C,mEAAmE;QAC5D,OAAO,CAAC,IAAI,EAAE,UAAU,GAAG,OAAO;QAIzC,+CAA+C;QAC/C,IAAW,OAAO,IAAI,OAAO,CAAiC;QAE9D,sDAAsD;QACtD,IAAW,IAAI,IAAI,MAAM,CAMxB;QAED,sEAAsE;QAC/D,WAAW,IAAI,SAAS;QAS/B,mEAAmE;QAC5D,SAAS,IAAI,OAAO;QAS3B,sDAAsD;QAC/C,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,KAAK,IAAI,GAAG,IAAI;KAK7D;IAED;;;OAGG;IACH,MAAa,SAAS,CAAC,CAAC;QACtB,SAAS,CAAC,QAAQ,CAAC,IAAI,8BAAqC;QAE5D,uCAAuC;QAChC,KAAK,IAAI,IAAI;QACpB,sCAAsC;QAC/B,OAAO,CAAC,EAAE,EAAE,UAAU,GAAG,CAAC,GAAG,SAAS;QAC7C,qCAAqC;QAC9B,OAAO,CAAC,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;QAE9C,gDAAgD;QACzC,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;QAUrD,kDAAkD;QAC3C,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;QAKpD,mDAAmD;QACnD,IAAW,OAAO,IAAI,OAAO,CAAiC;QAC9D,gDAAgD;QAChD,IAAW,IAAI,IAAI,MAAM,CAMxB;QAED,yDAAyD;QAClD,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,KAAK,IAAI,GAAG,IAAI;KAKvE;CACF;AAED;;;;;GAKG;AACH,qBAAa,mBAAmB;IAC9B,OAAO,CAAC,QAAQ,CAAa;IAE7B;;OAEG;IACH,IAAW,IAAI,IAAI,UAAU,CAE5B;IAED,yEAAyE;IAClE,OAAO,IAAI,UAAU;IAI5B;;OAEG;IACI,QAAQ,IAAI,UAAU;CAG9B;AAED;;;;;;GAMG;AACH,yBAAiB,IAAI,CAAC;IAGpB,qEAAqE;IAC9D,MAAM,KAAK,EAAE,UAAmD,CAAC;IAExE;;OAEG;IACH,SAAgB,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAE7C;IAED,mEAAmE;IACnE,SAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAE/C;IAED,iCAAiC;IACjC,SAAgB,WAAW,IAAI,UAAU,CAOxC;IAED;;;;;;;OAOG;IACH,SAAgB,SAAS,CAAC,KAAK,EAAE,UAAU,GAAG,UAAU,CAkBvD;CACF"}