@itwin/core-bentley 3.5.0-dev.5 → 3.5.0-dev.7

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (217) hide show
  1. package/lib/cjs/AccessToken.d.ts +8 -8
  2. package/lib/cjs/AccessToken.js +9 -9
  3. package/lib/cjs/AccessToken.js.map +1 -1
  4. package/lib/cjs/Assert.d.ts +25 -25
  5. package/lib/cjs/Assert.js +45 -45
  6. package/lib/cjs/Assert.js.map +1 -1
  7. package/lib/cjs/AsyncMutex.d.ts +26 -26
  8. package/lib/cjs/AsyncMutex.js +43 -43
  9. package/lib/cjs/AsyncMutex.js.map +1 -1
  10. package/lib/cjs/BeEvent.d.ts +81 -81
  11. package/lib/cjs/BeEvent.js +156 -156
  12. package/lib/cjs/BeEvent.js.map +1 -1
  13. package/lib/cjs/BeSQLite.d.ts +170 -170
  14. package/lib/cjs/BeSQLite.js +183 -183
  15. package/lib/cjs/BeSQLite.js.map +1 -1
  16. package/lib/cjs/BentleyError.d.ts +376 -376
  17. package/lib/cjs/BentleyError.js +699 -699
  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/BentleyLoggerCategory.js.map +1 -1
  22. package/lib/cjs/ByteStream.d.ts +92 -92
  23. package/lib/cjs/ByteStream.js +133 -133
  24. package/lib/cjs/ByteStream.js.map +1 -1
  25. package/lib/cjs/ClassUtils.d.ts +14 -14
  26. package/lib/cjs/ClassUtils.js +27 -27
  27. package/lib/cjs/ClassUtils.js.map +1 -1
  28. package/lib/cjs/Compare.d.ts +47 -47
  29. package/lib/cjs/Compare.js +75 -75
  30. package/lib/cjs/Compare.js.map +1 -1
  31. package/lib/cjs/CompressedId64Set.d.ts +134 -134
  32. package/lib/cjs/CompressedId64Set.js +428 -428
  33. package/lib/cjs/CompressedId64Set.js.map +1 -1
  34. package/lib/cjs/Dictionary.d.ts +125 -125
  35. package/lib/cjs/Dictionary.js +203 -203
  36. package/lib/cjs/Dictionary.js.map +1 -1
  37. package/lib/cjs/Disposable.d.ts +80 -80
  38. package/lib/cjs/Disposable.js +120 -120
  39. package/lib/cjs/Disposable.js.map +1 -1
  40. package/lib/cjs/Id.d.ts +277 -277
  41. package/lib/cjs/Id.js +629 -629
  42. package/lib/cjs/Id.js.map +1 -1
  43. package/lib/cjs/IndexMap.d.ts +65 -65
  44. package/lib/cjs/IndexMap.js +91 -91
  45. package/lib/cjs/IndexMap.js.map +1 -1
  46. package/lib/cjs/JsonSchema.d.ts +77 -77
  47. package/lib/cjs/JsonSchema.js +9 -9
  48. package/lib/cjs/JsonSchema.js.map +1 -1
  49. package/lib/cjs/JsonUtils.d.ts +78 -78
  50. package/lib/cjs/JsonUtils.js +151 -151
  51. package/lib/cjs/JsonUtils.js.map +1 -1
  52. package/lib/cjs/LRUMap.d.ts +129 -129
  53. package/lib/cjs/LRUMap.js +333 -333
  54. package/lib/cjs/LRUMap.js.map +1 -1
  55. package/lib/cjs/Logger.d.ts +141 -141
  56. package/lib/cjs/Logger.js +254 -254
  57. package/lib/cjs/Logger.js.map +1 -1
  58. package/lib/cjs/ObservableSet.d.ts +23 -23
  59. package/lib/cjs/ObservableSet.js +51 -51
  60. package/lib/cjs/ObservableSet.js.map +1 -1
  61. package/lib/cjs/OneAtATimeAction.d.ts +31 -31
  62. package/lib/cjs/OneAtATimeAction.js +94 -94
  63. package/lib/cjs/OneAtATimeAction.js.map +1 -1
  64. package/lib/cjs/OrderedId64Iterable.d.ts +74 -74
  65. package/lib/cjs/OrderedId64Iterable.js +235 -235
  66. package/lib/cjs/OrderedId64Iterable.js.map +1 -1
  67. package/lib/cjs/OrderedSet.d.ts +40 -40
  68. package/lib/cjs/OrderedSet.js +64 -64
  69. package/lib/cjs/OrderedSet.js.map +1 -1
  70. package/lib/cjs/PriorityQueue.d.ts +70 -70
  71. package/lib/cjs/PriorityQueue.js +140 -140
  72. package/lib/cjs/PriorityQueue.js.map +1 -1
  73. package/lib/cjs/ProcessDetector.d.ts +59 -59
  74. package/lib/cjs/ProcessDetector.js +71 -71
  75. package/lib/cjs/ProcessDetector.js.map +1 -1
  76. package/lib/cjs/SortedArray.d.ts +232 -232
  77. package/lib/cjs/SortedArray.js +303 -303
  78. package/lib/cjs/SortedArray.js.map +1 -1
  79. package/lib/cjs/StatusCategory.d.ts +30 -30
  80. package/lib/cjs/StatusCategory.js +460 -460
  81. package/lib/cjs/StatusCategory.js.map +1 -1
  82. package/lib/cjs/StringUtils.d.ts +22 -22
  83. package/lib/cjs/StringUtils.js +148 -148
  84. package/lib/cjs/StringUtils.js.map +1 -1
  85. package/lib/cjs/Time.d.ts +122 -122
  86. package/lib/cjs/Time.js +152 -152
  87. package/lib/cjs/Time.js.map +1 -1
  88. package/lib/cjs/Tracing.d.ts +40 -40
  89. package/lib/cjs/Tracing.js +130 -130
  90. package/lib/cjs/Tracing.js.map +1 -1
  91. package/lib/cjs/TypedArrayBuilder.d.ts +97 -97
  92. package/lib/cjs/TypedArrayBuilder.js +134 -134
  93. package/lib/cjs/TypedArrayBuilder.js.map +1 -1
  94. package/lib/cjs/UnexpectedErrors.d.ts +43 -43
  95. package/lib/cjs/UnexpectedErrors.js +68 -68
  96. package/lib/cjs/UnexpectedErrors.js.map +1 -1
  97. package/lib/cjs/UtilityTypes.d.ts +86 -86
  98. package/lib/cjs/UtilityTypes.js +26 -26
  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/YieldManager.js.map +1 -1
  103. package/lib/cjs/core-bentley.d.ts +74 -74
  104. package/lib/cjs/core-bentley.js +90 -90
  105. package/lib/cjs/core-bentley.js.map +1 -1
  106. package/lib/cjs/partitionArray.d.ts +21 -21
  107. package/lib/cjs/partitionArray.js +43 -43
  108. package/lib/cjs/partitionArray.js.map +1 -1
  109. package/lib/esm/AccessToken.d.ts +8 -8
  110. package/lib/esm/AccessToken.js +8 -8
  111. package/lib/esm/AccessToken.js.map +1 -1
  112. package/lib/esm/Assert.d.ts +25 -25
  113. package/lib/esm/Assert.js +41 -41
  114. package/lib/esm/Assert.js.map +1 -1
  115. package/lib/esm/AsyncMutex.d.ts +26 -26
  116. package/lib/esm/AsyncMutex.js +39 -39
  117. package/lib/esm/AsyncMutex.js.map +1 -1
  118. package/lib/esm/BeEvent.d.ts +81 -81
  119. package/lib/esm/BeEvent.js +150 -150
  120. package/lib/esm/BeEvent.js.map +1 -1
  121. package/lib/esm/BeSQLite.d.ts +170 -170
  122. package/lib/esm/BeSQLite.js +180 -180
  123. package/lib/esm/BeSQLite.js.map +1 -1
  124. package/lib/esm/BentleyError.d.ts +376 -376
  125. package/lib/esm/BentleyError.js +695 -695
  126. package/lib/esm/BentleyError.js.map +1 -1
  127. package/lib/esm/BentleyLoggerCategory.d.ts +11 -11
  128. package/lib/esm/BentleyLoggerCategory.js +16 -16
  129. package/lib/esm/BentleyLoggerCategory.js.map +1 -1
  130. package/lib/esm/ByteStream.d.ts +92 -92
  131. package/lib/esm/ByteStream.js +129 -129
  132. package/lib/esm/ByteStream.js.map +1 -1
  133. package/lib/esm/ClassUtils.d.ts +14 -14
  134. package/lib/esm/ClassUtils.js +22 -22
  135. package/lib/esm/ClassUtils.js.map +1 -1
  136. package/lib/esm/Compare.d.ts +47 -47
  137. package/lib/esm/Compare.js +63 -63
  138. package/lib/esm/Compare.js.map +1 -1
  139. package/lib/esm/CompressedId64Set.d.ts +134 -134
  140. package/lib/esm/CompressedId64Set.js +423 -423
  141. package/lib/esm/CompressedId64Set.js.map +1 -1
  142. package/lib/esm/Dictionary.d.ts +125 -125
  143. package/lib/esm/Dictionary.js +199 -199
  144. package/lib/esm/Dictionary.js.map +1 -1
  145. package/lib/esm/Disposable.d.ts +80 -80
  146. package/lib/esm/Disposable.js +112 -112
  147. package/lib/esm/Disposable.js.map +1 -1
  148. package/lib/esm/Id.d.ts +277 -277
  149. package/lib/esm/Id.js +625 -625
  150. package/lib/esm/Id.js.map +1 -1
  151. package/lib/esm/IndexMap.d.ts +65 -65
  152. package/lib/esm/IndexMap.js +86 -86
  153. package/lib/esm/IndexMap.js.map +1 -1
  154. package/lib/esm/JsonSchema.d.ts +77 -77
  155. package/lib/esm/JsonSchema.js +8 -8
  156. package/lib/esm/JsonSchema.js.map +1 -1
  157. package/lib/esm/JsonUtils.d.ts +78 -78
  158. package/lib/esm/JsonUtils.js +148 -148
  159. package/lib/esm/JsonUtils.js.map +1 -1
  160. package/lib/esm/LRUMap.d.ts +129 -129
  161. package/lib/esm/LRUMap.js +326 -326
  162. package/lib/esm/LRUMap.js.map +1 -1
  163. package/lib/esm/Logger.d.ts +141 -141
  164. package/lib/esm/Logger.js +249 -249
  165. package/lib/esm/Logger.js.map +1 -1
  166. package/lib/esm/ObservableSet.d.ts +23 -23
  167. package/lib/esm/ObservableSet.js +47 -47
  168. package/lib/esm/ObservableSet.js.map +1 -1
  169. package/lib/esm/OneAtATimeAction.d.ts +31 -31
  170. package/lib/esm/OneAtATimeAction.js +89 -89
  171. package/lib/esm/OneAtATimeAction.js.map +1 -1
  172. package/lib/esm/OrderedId64Iterable.d.ts +74 -74
  173. package/lib/esm/OrderedId64Iterable.js +232 -232
  174. package/lib/esm/OrderedId64Iterable.js.map +1 -1
  175. package/lib/esm/OrderedSet.d.ts +40 -40
  176. package/lib/esm/OrderedSet.js +59 -59
  177. package/lib/esm/OrderedSet.js.map +1 -1
  178. package/lib/esm/PriorityQueue.d.ts +70 -70
  179. package/lib/esm/PriorityQueue.js +136 -136
  180. package/lib/esm/PriorityQueue.js.map +1 -1
  181. package/lib/esm/ProcessDetector.d.ts +59 -59
  182. package/lib/esm/ProcessDetector.js +67 -67
  183. package/lib/esm/ProcessDetector.js.map +1 -1
  184. package/lib/esm/SortedArray.d.ts +232 -232
  185. package/lib/esm/SortedArray.js +296 -296
  186. package/lib/esm/SortedArray.js.map +1 -1
  187. package/lib/esm/StatusCategory.d.ts +30 -30
  188. package/lib/esm/StatusCategory.js +454 -454
  189. package/lib/esm/StatusCategory.js.map +1 -1
  190. package/lib/esm/StringUtils.d.ts +22 -22
  191. package/lib/esm/StringUtils.js +142 -142
  192. package/lib/esm/StringUtils.js.map +1 -1
  193. package/lib/esm/Time.d.ts +122 -122
  194. package/lib/esm/Time.js +146 -146
  195. package/lib/esm/Time.js.map +1 -1
  196. package/lib/esm/Tracing.d.ts +40 -40
  197. package/lib/esm/Tracing.js +126 -126
  198. package/lib/esm/Tracing.js.map +1 -1
  199. package/lib/esm/TypedArrayBuilder.d.ts +97 -97
  200. package/lib/esm/TypedArrayBuilder.js +127 -127
  201. package/lib/esm/TypedArrayBuilder.js.map +1 -1
  202. package/lib/esm/UnexpectedErrors.d.ts +43 -43
  203. package/lib/esm/UnexpectedErrors.js +64 -64
  204. package/lib/esm/UnexpectedErrors.js.map +1 -1
  205. package/lib/esm/UtilityTypes.d.ts +86 -86
  206. package/lib/esm/UtilityTypes.js +21 -21
  207. package/lib/esm/UtilityTypes.js.map +1 -1
  208. package/lib/esm/YieldManager.d.ts +18 -18
  209. package/lib/esm/YieldManager.js +30 -30
  210. package/lib/esm/YieldManager.js.map +1 -1
  211. package/lib/esm/core-bentley.d.ts +74 -74
  212. package/lib/esm/core-bentley.js +78 -78
  213. package/lib/esm/core-bentley.js.map +1 -1
  214. package/lib/esm/partitionArray.d.ts +21 -21
  215. package/lib/esm/partitionArray.js +39 -39
  216. package/lib/esm/partitionArray.js.map +1 -1
  217. package/package.json +3 -3
@@ -1,79 +1,79 @@
1
- /*---------------------------------------------------------------------------------------------
2
- * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
3
- * See LICENSE.md in the project root for license terms and full copyright notice.
4
- *--------------------------------------------------------------------------------------------*/
5
- export * from "./AccessToken";
6
- export * from "./Assert";
7
- export * from "./AsyncMutex";
8
- export * from "./BeEvent";
9
- export * from "./BentleyError";
10
- export * from "./BentleyLoggerCategory";
11
- export * from "./StatusCategory";
12
- export * from "./BeSQLite";
13
- export * from "./ByteStream";
14
- export * from "./ClassUtils";
15
- export * from "./Compare";
16
- export * from "./CompressedId64Set";
17
- export * from "./Dictionary";
18
- export * from "./Disposable";
19
- export * from "./Id";
20
- export * from "./IndexMap";
21
- export * from "./JsonSchema";
22
- export * from "./JsonUtils";
23
- export * from "./Logger";
24
- export * from "./LRUMap";
25
- export * from "./ObservableSet";
26
- export * from "./OneAtATimeAction";
27
- export * from "./OrderedId64Iterable";
28
- export * from "./OrderedSet";
29
- export * from "./partitionArray";
30
- export * from "./PriorityQueue";
31
- export * from "./ProcessDetector";
32
- export * from "./SortedArray";
33
- export * from "./StringUtils";
34
- export * from "./Time";
35
- export * from "./Tracing";
36
- export * from "./TypedArrayBuilder";
37
- export * from "./UnexpectedErrors";
38
- export * from "./UtilityTypes";
39
- export * from "./YieldManager";
40
- /** @docs-package-description
41
- * The core-bentley package contains classes to solve problems that are common for both client and server use cases.
42
- */
43
- /**
44
- * @docs-group-description BeSQLite
45
- * Classes for working with SQLite databases. SQLite underlies IModelDb and ECDb - see [Executing ECSQL]($docs/learning/ECSQL.md)
46
- */
47
- /**
48
- * @docs-group-description Errors
49
- * Classes for working with errors.
50
- */
51
- /**
52
- * @docs-group-description Events
53
- * Classes for raising and handling events.
54
- */
55
- /**
56
- * @docs-group-description Ids
57
- * Classes for working with unique identifiers.
58
- */
59
- /**
60
- * @docs-group-description Logging
61
- * Classes for configuring and logging diagnostic messages - see [Learning about Logging]($docs/learning/common/Logging.md)
62
- */
63
- /**
64
- * @docs-group-description Collections
65
- * Specialized, customizable collection classes like priority queues.
66
- */
67
- /**
68
- * @docs-group-description Json
69
- * utilities for dealing with Json strings and files.
70
- */
71
- /**
72
- * @docs-group-description Utils
73
- * Miscellaneous utility classes.
74
- */
75
- /**
76
- * @docs-group-description ProcessDetector
77
- * Functions for determining the type of the current JavaScript process.
78
- */
1
+ /*---------------------------------------------------------------------------------------------
2
+ * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
3
+ * See LICENSE.md in the project root for license terms and full copyright notice.
4
+ *--------------------------------------------------------------------------------------------*/
5
+ export * from "./AccessToken";
6
+ export * from "./Assert";
7
+ export * from "./AsyncMutex";
8
+ export * from "./BeEvent";
9
+ export * from "./BentleyError";
10
+ export * from "./BentleyLoggerCategory";
11
+ export * from "./StatusCategory";
12
+ export * from "./BeSQLite";
13
+ export * from "./ByteStream";
14
+ export * from "./ClassUtils";
15
+ export * from "./Compare";
16
+ export * from "./CompressedId64Set";
17
+ export * from "./Dictionary";
18
+ export * from "./Disposable";
19
+ export * from "./Id";
20
+ export * from "./IndexMap";
21
+ export * from "./JsonSchema";
22
+ export * from "./JsonUtils";
23
+ export * from "./Logger";
24
+ export * from "./LRUMap";
25
+ export * from "./ObservableSet";
26
+ export * from "./OneAtATimeAction";
27
+ export * from "./OrderedId64Iterable";
28
+ export * from "./OrderedSet";
29
+ export * from "./partitionArray";
30
+ export * from "./PriorityQueue";
31
+ export * from "./ProcessDetector";
32
+ export * from "./SortedArray";
33
+ export * from "./StringUtils";
34
+ export * from "./Time";
35
+ export * from "./Tracing";
36
+ export * from "./TypedArrayBuilder";
37
+ export * from "./UnexpectedErrors";
38
+ export * from "./UtilityTypes";
39
+ export * from "./YieldManager";
40
+ /** @docs-package-description
41
+ * The core-bentley package contains classes to solve problems that are common for both client and server use cases.
42
+ */
43
+ /**
44
+ * @docs-group-description BeSQLite
45
+ * Classes for working with SQLite databases. SQLite underlies IModelDb and ECDb - see [Executing ECSQL]($docs/learning/ECSQL.md)
46
+ */
47
+ /**
48
+ * @docs-group-description Errors
49
+ * Classes for working with errors.
50
+ */
51
+ /**
52
+ * @docs-group-description Events
53
+ * Classes for raising and handling events.
54
+ */
55
+ /**
56
+ * @docs-group-description Ids
57
+ * Classes for working with unique identifiers.
58
+ */
59
+ /**
60
+ * @docs-group-description Logging
61
+ * Classes for configuring and logging diagnostic messages - see [Learning about Logging]($docs/learning/common/Logging.md)
62
+ */
63
+ /**
64
+ * @docs-group-description Collections
65
+ * Specialized, customizable collection classes like priority queues.
66
+ */
67
+ /**
68
+ * @docs-group-description Json
69
+ * utilities for dealing with Json strings and files.
70
+ */
71
+ /**
72
+ * @docs-group-description Utils
73
+ * Miscellaneous utility classes.
74
+ */
75
+ /**
76
+ * @docs-group-description ProcessDetector
77
+ * Functions for determining the type of the current JavaScript process.
78
+ */
79
79
  //# sourceMappingURL=core-bentley.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"core-bentley.js","sourceRoot":"","sources":["../../src/core-bentley.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F,cAAc,eAAe,CAAC;AAC9B,cAAc,UAAU,CAAC;AACzB,cAAc,cAAc,CAAC;AAC7B,cAAc,WAAW,CAAC;AAC1B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,yBAAyB,CAAC;AACxC,cAAc,kBAAkB,CAAC;AACjC,cAAc,YAAY,CAAC;AAC3B,cAAc,cAAc,CAAC;AAC7B,cAAc,cAAc,CAAC;AAC7B,cAAc,WAAW,CAAC;AAC1B,cAAc,qBAAqB,CAAC;AACpC,cAAc,cAAc,CAAC;AAC7B,cAAc,cAAc,CAAC;AAC7B,cAAc,MAAM,CAAC;AACrB,cAAc,YAAY,CAAC;AAC3B,cAAc,cAAc,CAAC;AAC7B,cAAc,aAAa,CAAC;AAC5B,cAAc,UAAU,CAAC;AACzB,cAAc,UAAU,CAAC;AACzB,cAAc,iBAAiB,CAAC;AAChC,cAAc,oBAAoB,CAAC;AACnC,cAAc,uBAAuB,CAAC;AACtC,cAAc,cAAc,CAAC;AAC7B,cAAc,kBAAkB,CAAC;AACjC,cAAc,iBAAiB,CAAC;AAChC,cAAc,mBAAmB,CAAC;AAClC,cAAc,eAAe,CAAC;AAC9B,cAAc,eAAe,CAAC;AAC9B,cAAc,QAAQ,CAAC;AACvB,cAAc,WAAW,CAAC;AAC1B,cAAc,qBAAqB,CAAC;AACpC,cAAc,oBAAoB,CAAC;AACnC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,gBAAgB,CAAC;AAE/B;;GAEG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\nexport * from \"./AccessToken\";\nexport * from \"./Assert\";\nexport * from \"./AsyncMutex\";\nexport * from \"./BeEvent\";\nexport * from \"./BentleyError\";\nexport * from \"./BentleyLoggerCategory\";\nexport * from \"./StatusCategory\";\nexport * from \"./BeSQLite\";\nexport * from \"./ByteStream\";\nexport * from \"./ClassUtils\";\nexport * from \"./Compare\";\nexport * from \"./CompressedId64Set\";\nexport * from \"./Dictionary\";\nexport * from \"./Disposable\";\nexport * from \"./Id\";\nexport * from \"./IndexMap\";\nexport * from \"./JsonSchema\";\nexport * from \"./JsonUtils\";\nexport * from \"./Logger\";\nexport * from \"./LRUMap\";\nexport * from \"./ObservableSet\";\nexport * from \"./OneAtATimeAction\";\nexport * from \"./OrderedId64Iterable\";\nexport * from \"./OrderedSet\";\nexport * from \"./partitionArray\";\nexport * from \"./PriorityQueue\";\nexport * from \"./ProcessDetector\";\nexport * from \"./SortedArray\";\nexport * from \"./StringUtils\";\nexport * from \"./Time\";\nexport * from \"./Tracing\";\nexport * from \"./TypedArrayBuilder\";\nexport * from \"./UnexpectedErrors\";\nexport * from \"./UtilityTypes\";\nexport * from \"./YieldManager\";\n\n/** @docs-package-description\n * The core-bentley package contains classes to solve problems that are common for both client and server use cases.\n */\n/**\n * @docs-group-description BeSQLite\n * Classes for working with SQLite databases. SQLite underlies IModelDb and ECDb - see [Executing ECSQL]($docs/learning/ECSQL.md)\n */\n/**\n * @docs-group-description Errors\n * Classes for working with errors.\n */\n/**\n * @docs-group-description Events\n * Classes for raising and handling events.\n */\n/**\n * @docs-group-description Ids\n * Classes for working with unique identifiers.\n */\n/**\n * @docs-group-description Logging\n * Classes for configuring and logging diagnostic messages - see [Learning about Logging]($docs/learning/common/Logging.md)\n */\n/**\n * @docs-group-description Collections\n * Specialized, customizable collection classes like priority queues.\n */\n/**\n * @docs-group-description Json\n * utilities for dealing with Json strings and files.\n */\n/**\n * @docs-group-description Utils\n * Miscellaneous utility classes.\n */\n/**\n * @docs-group-description ProcessDetector\n * Functions for determining the type of the current JavaScript process.\n */\n"]}
1
+ {"version":3,"file":"core-bentley.js","sourceRoot":"","sources":["../../src/core-bentley.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F,cAAc,eAAe,CAAC;AAC9B,cAAc,UAAU,CAAC;AACzB,cAAc,cAAc,CAAC;AAC7B,cAAc,WAAW,CAAC;AAC1B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,yBAAyB,CAAC;AACxC,cAAc,kBAAkB,CAAC;AACjC,cAAc,YAAY,CAAC;AAC3B,cAAc,cAAc,CAAC;AAC7B,cAAc,cAAc,CAAC;AAC7B,cAAc,WAAW,CAAC;AAC1B,cAAc,qBAAqB,CAAC;AACpC,cAAc,cAAc,CAAC;AAC7B,cAAc,cAAc,CAAC;AAC7B,cAAc,MAAM,CAAC;AACrB,cAAc,YAAY,CAAC;AAC3B,cAAc,cAAc,CAAC;AAC7B,cAAc,aAAa,CAAC;AAC5B,cAAc,UAAU,CAAC;AACzB,cAAc,UAAU,CAAC;AACzB,cAAc,iBAAiB,CAAC;AAChC,cAAc,oBAAoB,CAAC;AACnC,cAAc,uBAAuB,CAAC;AACtC,cAAc,cAAc,CAAC;AAC7B,cAAc,kBAAkB,CAAC;AACjC,cAAc,iBAAiB,CAAC;AAChC,cAAc,mBAAmB,CAAC;AAClC,cAAc,eAAe,CAAC;AAC9B,cAAc,eAAe,CAAC;AAC9B,cAAc,QAAQ,CAAC;AACvB,cAAc,WAAW,CAAC;AAC1B,cAAc,qBAAqB,CAAC;AACpC,cAAc,oBAAoB,CAAC;AACnC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,gBAAgB,CAAC;AAE/B;;GAEG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\nexport * from \"./AccessToken\";\r\nexport * from \"./Assert\";\r\nexport * from \"./AsyncMutex\";\r\nexport * from \"./BeEvent\";\r\nexport * from \"./BentleyError\";\r\nexport * from \"./BentleyLoggerCategory\";\r\nexport * from \"./StatusCategory\";\r\nexport * from \"./BeSQLite\";\r\nexport * from \"./ByteStream\";\r\nexport * from \"./ClassUtils\";\r\nexport * from \"./Compare\";\r\nexport * from \"./CompressedId64Set\";\r\nexport * from \"./Dictionary\";\r\nexport * from \"./Disposable\";\r\nexport * from \"./Id\";\r\nexport * from \"./IndexMap\";\r\nexport * from \"./JsonSchema\";\r\nexport * from \"./JsonUtils\";\r\nexport * from \"./Logger\";\r\nexport * from \"./LRUMap\";\r\nexport * from \"./ObservableSet\";\r\nexport * from \"./OneAtATimeAction\";\r\nexport * from \"./OrderedId64Iterable\";\r\nexport * from \"./OrderedSet\";\r\nexport * from \"./partitionArray\";\r\nexport * from \"./PriorityQueue\";\r\nexport * from \"./ProcessDetector\";\r\nexport * from \"./SortedArray\";\r\nexport * from \"./StringUtils\";\r\nexport * from \"./Time\";\r\nexport * from \"./Tracing\";\r\nexport * from \"./TypedArrayBuilder\";\r\nexport * from \"./UnexpectedErrors\";\r\nexport * from \"./UtilityTypes\";\r\nexport * from \"./YieldManager\";\r\n\r\n/** @docs-package-description\r\n * The core-bentley package contains classes to solve problems that are common for both client and server use cases.\r\n */\r\n/**\r\n * @docs-group-description BeSQLite\r\n * Classes for working with SQLite databases. SQLite underlies IModelDb and ECDb - see [Executing ECSQL]($docs/learning/ECSQL.md)\r\n */\r\n/**\r\n * @docs-group-description Errors\r\n * Classes for working with errors.\r\n */\r\n/**\r\n * @docs-group-description Events\r\n * Classes for raising and handling events.\r\n */\r\n/**\r\n * @docs-group-description Ids\r\n * Classes for working with unique identifiers.\r\n */\r\n/**\r\n * @docs-group-description Logging\r\n * Classes for configuring and logging diagnostic messages - see [Learning about Logging]($docs/learning/common/Logging.md)\r\n */\r\n/**\r\n * @docs-group-description Collections\r\n * Specialized, customizable collection classes like priority queues.\r\n */\r\n/**\r\n * @docs-group-description Json\r\n * utilities for dealing with Json strings and files.\r\n */\r\n/**\r\n * @docs-group-description Utils\r\n * Miscellaneous utility classes.\r\n */\r\n/**\r\n * @docs-group-description ProcessDetector\r\n * Functions for determining the type of the current JavaScript process.\r\n */\r\n"]}
@@ -1,22 +1,22 @@
1
- /** @packageDocumentation
2
- * @module Collections
3
- */
4
- /** Partitions an array in-place according to some criterion, such that elements that fulfill the criterion are grouped in the lower
5
- * portion of the array, and those that fail to fulfill the criterion are grouped in the upper portion of the array.
6
- * @param array The array to be partitioned.
7
- * @param criterion A function invoked for each element of the array, returning whether the element fulfills the criterion.
8
- * @returns The index of the upper partition, i.e., of the first element that fails the criterion. If all elements fulfill the criterion, this is the length of the array.
9
- * @note The relative ordering of elements within each partition is unspecified.
10
- * Example:
11
- * ```ts
12
- * function isEven(n: number) { return 0 === n % 2; }
13
- * const list = [ 1, 2, 3, 4, 5 ];
14
- * const firstOddIndex = partitionArray(list, isEven); // firstOddIndex = 2
15
- * // 2 and 4 now appear before 1, 3, and 5 in the list; their ordering is otherwise unspecified.
16
- * for (let i = 0; i < list.length; i++)
17
- * assert(isEven(list[i]) === i < firstOddIndex);
18
- * ```
19
- * @public
20
- */
21
- export declare function partitionArray<T>(array: T[], criterion: (element: T) => boolean): number;
1
+ /** @packageDocumentation
2
+ * @module Collections
3
+ */
4
+ /** Partitions an array in-place according to some criterion, such that elements that fulfill the criterion are grouped in the lower
5
+ * portion of the array, and those that fail to fulfill the criterion are grouped in the upper portion of the array.
6
+ * @param array The array to be partitioned.
7
+ * @param criterion A function invoked for each element of the array, returning whether the element fulfills the criterion.
8
+ * @returns The index of the upper partition, i.e., of the first element that fails the criterion. If all elements fulfill the criterion, this is the length of the array.
9
+ * @note The relative ordering of elements within each partition is unspecified.
10
+ * Example:
11
+ * ```ts
12
+ * function isEven(n: number) { return 0 === n % 2; }
13
+ * const list = [ 1, 2, 3, 4, 5 ];
14
+ * const firstOddIndex = partitionArray(list, isEven); // firstOddIndex = 2
15
+ * // 2 and 4 now appear before 1, 3, and 5 in the list; their ordering is otherwise unspecified.
16
+ * for (let i = 0; i < list.length; i++)
17
+ * assert(isEven(list[i]) === i < firstOddIndex);
18
+ * ```
19
+ * @public
20
+ */
21
+ export declare function partitionArray<T>(array: T[], criterion: (element: T) => boolean): number;
22
22
  //# sourceMappingURL=partitionArray.d.ts.map
@@ -1,40 +1,40 @@
1
- /*---------------------------------------------------------------------------------------------
2
- * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
3
- * See LICENSE.md in the project root for license terms and full copyright notice.
4
- *--------------------------------------------------------------------------------------------*/
5
- /** @packageDocumentation
6
- * @module Collections
7
- */
8
- /** Partitions an array in-place according to some criterion, such that elements that fulfill the criterion are grouped in the lower
9
- * portion of the array, and those that fail to fulfill the criterion are grouped in the upper portion of the array.
10
- * @param array The array to be partitioned.
11
- * @param criterion A function invoked for each element of the array, returning whether the element fulfills the criterion.
12
- * @returns The index of the upper partition, i.e., of the first element that fails the criterion. If all elements fulfill the criterion, this is the length of the array.
13
- * @note The relative ordering of elements within each partition is unspecified.
14
- * Example:
15
- * ```ts
16
- * function isEven(n: number) { return 0 === n % 2; }
17
- * const list = [ 1, 2, 3, 4, 5 ];
18
- * const firstOddIndex = partitionArray(list, isEven); // firstOddIndex = 2
19
- * // 2 and 4 now appear before 1, 3, and 5 in the list; their ordering is otherwise unspecified.
20
- * for (let i = 0; i < list.length; i++)
21
- * assert(isEven(list[i]) === i < firstOddIndex);
22
- * ```
23
- * @public
24
- */
25
- export function partitionArray(array, criterion) {
26
- let index = 0;
27
- let partition = array.length;
28
- while (index < partition) {
29
- const elem = array[index];
30
- if (criterion(elem)) {
31
- ++index;
32
- }
33
- else {
34
- array[index] = array[--partition];
35
- array[partition] = elem;
36
- }
37
- }
38
- return partition;
39
- }
1
+ /*---------------------------------------------------------------------------------------------
2
+ * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
3
+ * See LICENSE.md in the project root for license terms and full copyright notice.
4
+ *--------------------------------------------------------------------------------------------*/
5
+ /** @packageDocumentation
6
+ * @module Collections
7
+ */
8
+ /** Partitions an array in-place according to some criterion, such that elements that fulfill the criterion are grouped in the lower
9
+ * portion of the array, and those that fail to fulfill the criterion are grouped in the upper portion of the array.
10
+ * @param array The array to be partitioned.
11
+ * @param criterion A function invoked for each element of the array, returning whether the element fulfills the criterion.
12
+ * @returns The index of the upper partition, i.e., of the first element that fails the criterion. If all elements fulfill the criterion, this is the length of the array.
13
+ * @note The relative ordering of elements within each partition is unspecified.
14
+ * Example:
15
+ * ```ts
16
+ * function isEven(n: number) { return 0 === n % 2; }
17
+ * const list = [ 1, 2, 3, 4, 5 ];
18
+ * const firstOddIndex = partitionArray(list, isEven); // firstOddIndex = 2
19
+ * // 2 and 4 now appear before 1, 3, and 5 in the list; their ordering is otherwise unspecified.
20
+ * for (let i = 0; i < list.length; i++)
21
+ * assert(isEven(list[i]) === i < firstOddIndex);
22
+ * ```
23
+ * @public
24
+ */
25
+ export function partitionArray(array, criterion) {
26
+ let index = 0;
27
+ let partition = array.length;
28
+ while (index < partition) {
29
+ const elem = array[index];
30
+ if (criterion(elem)) {
31
+ ++index;
32
+ }
33
+ else {
34
+ array[index] = array[--partition];
35
+ array[partition] = elem;
36
+ }
37
+ }
38
+ return partition;
39
+ }
40
40
  //# sourceMappingURL=partitionArray.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"partitionArray.js","sourceRoot":"","sources":["../../src/partitionArray.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,cAAc,CAAI,KAAU,EAAE,SAAkC;IAC9E,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC;IAC7B,OAAO,KAAK,GAAG,SAAS,EAAE;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC1B,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE;YACnB,EAAE,KAAK,CAAC;SACT;aAAM;YACL,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,EAAE,SAAS,CAAC,CAAC;YAClC,KAAK,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC;SACzB;KACF;IAED,OAAO,SAAS,CAAC;AACnB,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Collections\n */\n\n/** Partitions an array in-place according to some criterion, such that elements that fulfill the criterion are grouped in the lower\n * portion of the array, and those that fail to fulfill the criterion are grouped in the upper portion of the array.\n * @param array The array to be partitioned.\n * @param criterion A function invoked for each element of the array, returning whether the element fulfills the criterion.\n * @returns The index of the upper partition, i.e., of the first element that fails the criterion. If all elements fulfill the criterion, this is the length of the array.\n * @note The relative ordering of elements within each partition is unspecified.\n * Example:\n * ```ts\n * function isEven(n: number) { return 0 === n % 2; }\n * const list = [ 1, 2, 3, 4, 5 ];\n * const firstOddIndex = partitionArray(list, isEven); // firstOddIndex = 2\n * // 2 and 4 now appear before 1, 3, and 5 in the list; their ordering is otherwise unspecified.\n * for (let i = 0; i < list.length; i++)\n * assert(isEven(list[i]) === i < firstOddIndex);\n * ```\n * @public\n */\nexport function partitionArray<T>(array: T[], criterion: (element: T) => boolean): number {\n let index = 0;\n let partition = array.length;\n while (index < partition) {\n const elem = array[index];\n if (criterion(elem)) {\n ++index;\n } else {\n array[index] = array[--partition];\n array[partition] = elem;\n }\n }\n\n return partition;\n}\n"]}
1
+ {"version":3,"file":"partitionArray.js","sourceRoot":"","sources":["../../src/partitionArray.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,cAAc,CAAI,KAAU,EAAE,SAAkC;IAC9E,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC;IAC7B,OAAO,KAAK,GAAG,SAAS,EAAE;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC1B,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE;YACnB,EAAE,KAAK,CAAC;SACT;aAAM;YACL,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,EAAE,SAAS,CAAC,CAAC;YAClC,KAAK,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC;SACzB;KACF;IAED,OAAO,SAAS,CAAC;AACnB,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Collections\r\n */\r\n\r\n/** Partitions an array in-place according to some criterion, such that elements that fulfill the criterion are grouped in the lower\r\n * portion of the array, and those that fail to fulfill the criterion are grouped in the upper portion of the array.\r\n * @param array The array to be partitioned.\r\n * @param criterion A function invoked for each element of the array, returning whether the element fulfills the criterion.\r\n * @returns The index of the upper partition, i.e., of the first element that fails the criterion. If all elements fulfill the criterion, this is the length of the array.\r\n * @note The relative ordering of elements within each partition is unspecified.\r\n * Example:\r\n * ```ts\r\n * function isEven(n: number) { return 0 === n % 2; }\r\n * const list = [ 1, 2, 3, 4, 5 ];\r\n * const firstOddIndex = partitionArray(list, isEven); // firstOddIndex = 2\r\n * // 2 and 4 now appear before 1, 3, and 5 in the list; their ordering is otherwise unspecified.\r\n * for (let i = 0; i < list.length; i++)\r\n * assert(isEven(list[i]) === i < firstOddIndex);\r\n * ```\r\n * @public\r\n */\r\nexport function partitionArray<T>(array: T[], criterion: (element: T) => boolean): number {\r\n let index = 0;\r\n let partition = array.length;\r\n while (index < partition) {\r\n const elem = array[index];\r\n if (criterion(elem)) {\r\n ++index;\r\n } else {\r\n array[index] = array[--partition];\r\n array[partition] = elem;\r\n }\r\n }\r\n\r\n return partition;\r\n}\r\n"]}
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@itwin/core-bentley",
3
- "version": "3.5.0-dev.5",
3
+ "version": "3.5.0-dev.7",
4
4
  "description": "Bentley JavaScript core components",
5
5
  "main": "lib/cjs/core-bentley.js",
6
6
  "module": "lib/esm/core-bentley.js",
@@ -21,8 +21,8 @@
21
21
  "url": "http://www.bentley.com"
22
22
  },
23
23
  "devDependencies": {
24
- "@itwin/build-tools": "3.5.0-dev.5",
25
- "@itwin/eslint-plugin": "3.5.0-dev.5",
24
+ "@itwin/build-tools": "3.5.0-dev.7",
25
+ "@itwin/eslint-plugin": "3.5.0-dev.7",
26
26
  "@opentelemetry/api": "1.0.4",
27
27
  "@types/chai": "4.3.1",
28
28
  "@types/chai-as-promised": "^7",