@fossa-app/bridge 0.1.10 → 0.1.12

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/dist/Models/ApiModels/EnvelopeModels.d.ts +5 -5
  2. package/dist/Models/ApiModels/EnvelopeModels.js +16 -16
  3. package/dist/Models/ApiModels/EnvelopeModels.js.map +1 -1
  4. package/dist/Models/ApiModels/PayloadModels.d.ts +5 -5
  5. package/dist/Models/ApiModels/PayloadModels.js +127 -97
  6. package/dist/Models/ApiModels/PayloadModels.js.map +1 -1
  7. package/dist/Models/ApiModels/SharedModels.d.ts +3 -3
  8. package/dist/Models/ApiModels/SharedModels.js +35 -30
  9. package/dist/Models/ApiModels/SharedModels.js.map +1 -1
  10. package/dist/Services/Clients/BranchClient.d.ts +2 -2
  11. package/dist/Services/Clients/BranchClient.js +26 -37
  12. package/dist/Services/Clients/BranchClient.js.map +1 -1
  13. package/dist/Services/Clients/CompanyClient.d.ts +1 -1
  14. package/dist/Services/Clients/CompanyClient.js +17 -26
  15. package/dist/Services/Clients/CompanyClient.js.map +1 -1
  16. package/dist/Services/Clients/CompanyLicenseClient.d.ts +1 -1
  17. package/dist/Services/Clients/CompanyLicenseClient.js +13 -20
  18. package/dist/Services/Clients/CompanyLicenseClient.js.map +1 -1
  19. package/dist/Services/Clients/CompanySettingsClient.d.ts +1 -1
  20. package/dist/Services/Clients/CompanySettingsClient.js +17 -26
  21. package/dist/Services/Clients/CompanySettingsClient.js.map +1 -1
  22. package/dist/Services/Clients/DepartmentClient.d.ts +2 -2
  23. package/dist/Services/Clients/DepartmentClient.js +26 -37
  24. package/dist/Services/Clients/DepartmentClient.js.map +1 -1
  25. package/dist/Services/Clients/EmployeeClient.d.ts +2 -2
  26. package/dist/Services/Clients/EmployeeClient.js +30 -43
  27. package/dist/Services/Clients/EmployeeClient.js.map +1 -1
  28. package/dist/Services/Clients/IBranchClient.d.ts +1 -1
  29. package/dist/Services/Clients/IBranchClient.js +1 -2
  30. package/dist/Services/Clients/ICompanyClient.js +1 -2
  31. package/dist/Services/Clients/ICompanyLicenseClient.js +1 -2
  32. package/dist/Services/Clients/ICompanySettingsClient.js +1 -2
  33. package/dist/Services/Clients/IDepartmentClient.d.ts +1 -1
  34. package/dist/Services/Clients/IDepartmentClient.js +1 -2
  35. package/dist/Services/Clients/IEmployeeClient.d.ts +1 -1
  36. package/dist/Services/Clients/IEmployeeClient.js +1 -2
  37. package/dist/Services/Clients/IIdentityClient.js +1 -2
  38. package/dist/Services/Clients/ISystemLicenseClient.js +1 -2
  39. package/dist/Services/Clients/IdentityClient.d.ts +1 -1
  40. package/dist/Services/Clients/IdentityClient.js +11 -17
  41. package/dist/Services/Clients/IdentityClient.js.map +1 -1
  42. package/dist/Services/Clients/SystemLicenseClient.d.ts +1 -1
  43. package/dist/Services/Clients/SystemLicenseClient.js +11 -17
  44. package/dist/Services/Clients/SystemLicenseClient.js.map +1 -1
  45. package/dist/Services/Endpoints.js +10 -13
  46. package/dist/Services/Endpoints.js.map +1 -1
  47. package/dist/Services/IHttpTransport.d.ts +4 -4
  48. package/dist/Services/IHttpTransport.js +1 -2
  49. package/dist/Services/UrlHelpers.d.ts +6 -6
  50. package/dist/Services/UrlHelpers.js +44 -62
  51. package/dist/Services/UrlHelpers.js.map +1 -1
  52. package/package.json +7 -2
  53. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Array.d.ts +0 -125
  54. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Array.js +0 -1371
  55. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Array.js.map +0 -1
  56. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Async.d.ts +0 -27
  57. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Async.js +0 -172
  58. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Async.js.map +0 -1
  59. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/AsyncBuilder.d.ts +0 -59
  60. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/AsyncBuilder.js +0 -194
  61. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/AsyncBuilder.js.map +0 -1
  62. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/BigInt.d.ts +0 -129
  63. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/BigInt.js +0 -428
  64. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/BigInt.js.map +0 -1
  65. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/BitConverter.d.ts +0 -27
  66. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/BitConverter.js +0 -165
  67. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/BitConverter.js.map +0 -1
  68. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Boolean.d.ts +0 -3
  69. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Boolean.js +0 -27
  70. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Boolean.js.map +0 -1
  71. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Char.d.ts +0 -66
  72. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Char.js +0 -271
  73. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Char.js.map +0 -1
  74. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Choice.d.ts +0 -121
  75. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Choice.js +0 -231
  76. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Choice.js.map +0 -1
  77. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/CollectionUtil.d.ts +0 -8
  78. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/CollectionUtil.js +0 -192
  79. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/CollectionUtil.js.map +0 -1
  80. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/ConditionalWeakTable.d.ts +0 -9
  81. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/ConditionalWeakTable.js +0 -26
  82. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/ConditionalWeakTable.js.map +0 -1
  83. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Date.d.ts +0 -70
  84. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Date.js +0 -812
  85. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Date.js.map +0 -1
  86. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/DateOffset.d.ts +0 -65
  87. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/DateOffset.js +0 -345
  88. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/DateOffset.js.map +0 -1
  89. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/DateOnly.d.ts +0 -18
  90. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/DateOnly.js +0 -143
  91. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/DateOnly.js.map +0 -1
  92. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Decimal.d.ts +0 -63
  93. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Decimal.js +0 -322
  94. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Decimal.js.map +0 -1
  95. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Double.d.ts +0 -11
  96. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Double.js +0 -60
  97. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Double.js.map +0 -1
  98. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Encoding.d.ts +0 -12
  99. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Encoding.js +0 -178
  100. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Encoding.js.map +0 -1
  101. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Event.d.ts +0 -31
  102. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Event.js +0 -109
  103. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Event.js.map +0 -1
  104. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/FSharp.Collections.d.ts +0 -7
  105. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/FSharp.Collections.js +0 -53
  106. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/FSharp.Collections.js.map +0 -1
  107. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/FSharp.Core.CompilerServices.d.ts +0 -12
  108. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/FSharp.Core.CompilerServices.js +0 -38
  109. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/FSharp.Core.CompilerServices.js.map +0 -1
  110. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/FSharp.Core.d.ts +0 -30
  111. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/FSharp.Core.js +0 -185
  112. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/FSharp.Core.js.map +0 -1
  113. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Global.d.ts +0 -45
  114. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Global.js +0 -33
  115. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Global.js.map +0 -1
  116. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Guid.d.ts +0 -10
  117. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Guid.js +0 -152
  118. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Guid.js.map +0 -1
  119. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Int32.d.ts +0 -29
  120. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Int32.js +0 -148
  121. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Int32.js.map +0 -1
  122. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/List.d.ts +0 -143
  123. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/List.js +0 -1404
  124. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/List.js.map +0 -1
  125. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Long.d.ts +0 -3
  126. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Long.js +0 -52
  127. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Long.js.map +0 -1
  128. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/MailboxProcessor.d.ts +0 -25
  129. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/MailboxProcessor.js +0 -104
  130. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/MailboxProcessor.js.map +0 -1
  131. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Map.d.ts +0 -178
  132. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Map.js +0 -1525
  133. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Map.js.map +0 -1
  134. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/MapUtil.d.ts +0 -12
  135. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/MapUtil.js +0 -141
  136. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/MapUtil.js.map +0 -1
  137. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/MutableMap.d.ts +0 -52
  138. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/MutableMap.js +0 -355
  139. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/MutableMap.js.map +0 -1
  140. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/MutableSet.d.ts +0 -39
  141. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/MutableSet.js +0 -246
  142. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/MutableSet.js.map +0 -1
  143. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Native.d.ts +0 -3
  144. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Native.js +0 -18
  145. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Native.js.map +0 -1
  146. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Numeric.d.ts +0 -20
  147. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Numeric.js +0 -87
  148. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Numeric.js.map +0 -1
  149. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Observable.d.ts +0 -32
  150. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Observable.js +0 -128
  151. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Observable.js.map +0 -1
  152. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Option.d.ts +0 -29
  153. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Option.js +0 -127
  154. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Option.js.map +0 -1
  155. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Random.d.ts +0 -38
  156. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Random.js +0 -186
  157. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Random.js.map +0 -1
  158. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Range.d.ts +0 -12
  159. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Range.js +0 -56
  160. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Range.js.map +0 -1
  161. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Reflection.d.ts +0 -119
  162. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Reflection.js +0 -529
  163. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Reflection.js.map +0 -1
  164. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/RegExp.d.ts +0 -10
  165. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/RegExp.js +0 -144
  166. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/RegExp.js.map +0 -1
  167. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Result.d.ts +0 -38
  168. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Result.js +0 -191
  169. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Result.js.map +0 -1
  170. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Seq.d.ts +0 -164
  171. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Seq.js +0 -1501
  172. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Seq.js.map +0 -1
  173. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Seq2.d.ts +0 -18
  174. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Seq2.js +0 -129
  175. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Seq2.js.map +0 -1
  176. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Set.d.ts +0 -190
  177. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Set.js +0 -1931
  178. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Set.js.map +0 -1
  179. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/String.d.ts +0 -59
  180. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/String.js +0 -677
  181. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/String.js.map +0 -1
  182. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/System.Collections.Generic.d.ts +0 -85
  183. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/System.Collections.Generic.js +0 -390
  184. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/System.Collections.Generic.js.map +0 -1
  185. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/System.Text.d.ts +0 -40
  186. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/System.Text.js +0 -204
  187. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/System.Text.js.map +0 -1
  188. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/System.d.ts +0 -121
  189. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/System.js +0 -367
  190. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/System.js.map +0 -1
  191. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/TimeOnly.d.ts +0 -15
  192. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/TimeOnly.js +0 -138
  193. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/TimeOnly.js.map +0 -1
  194. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/TimeSpan.d.ts +0 -35
  195. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/TimeSpan.js +0 -210
  196. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/TimeSpan.js.map +0 -1
  197. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Timer.d.ts +0 -19
  198. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Timer.js +0 -72
  199. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Timer.js.map +0 -1
  200. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Types.d.ts +0 -51
  201. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Types.js +0 -205
  202. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Types.js.map +0 -1
  203. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Unicode.13.0.0.d.ts +0 -2
  204. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Unicode.13.0.0.js +0 -8
  205. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Unicode.13.0.0.js.map +0 -1
  206. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Uri.d.ts +0 -32
  207. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Uri.js +0 -170
  208. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Uri.js.map +0 -1
  209. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Util.d.ts +0 -243
  210. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Util.js +0 -903
  211. package/dist/fable_modules/fable-library-ts.5.0.0-rc.1/Util.js.map +0 -1
@@ -1,1525 +0,0 @@
1
- "use strict";
2
- Object.defineProperty(exports, "__esModule", { value: true });
3
- exports.FSharpMap = exports.MapTreeModule_MapIterator$2 = exports.MapTreeNode$2 = exports.MapTreeLeaf$2 = void 0;
4
- exports.MapTreeLeaf$2_$reflection = MapTreeLeaf$2_$reflection;
5
- exports.MapTreeLeaf$2_$ctor_5BDDA1 = MapTreeLeaf$2_$ctor_5BDDA1;
6
- exports.MapTreeLeaf$2__get_Key = MapTreeLeaf$2__get_Key;
7
- exports.MapTreeLeaf$2__get_Value = MapTreeLeaf$2__get_Value;
8
- exports.MapTreeNode$2_$reflection = MapTreeNode$2_$reflection;
9
- exports.MapTreeNode$2_$ctor_Z39DE9543 = MapTreeNode$2_$ctor_Z39DE9543;
10
- exports.MapTreeNode$2__get_Left = MapTreeNode$2__get_Left;
11
- exports.MapTreeNode$2__get_Right = MapTreeNode$2__get_Right;
12
- exports.MapTreeNode$2__get_Height = MapTreeNode$2__get_Height;
13
- exports.MapTreeModule_empty = MapTreeModule_empty;
14
- exports.MapTreeModule_sizeAux = MapTreeModule_sizeAux;
15
- exports.MapTreeModule_size = MapTreeModule_size;
16
- exports.MapTreeModule_mk = MapTreeModule_mk;
17
- exports.MapTreeModule_rebalance = MapTreeModule_rebalance;
18
- exports.MapTreeModule_add = MapTreeModule_add;
19
- exports.MapTreeModule_tryFind = MapTreeModule_tryFind;
20
- exports.MapTreeModule_find = MapTreeModule_find;
21
- exports.MapTreeModule_partition1 = MapTreeModule_partition1;
22
- exports.MapTreeModule_partitionAux = MapTreeModule_partitionAux;
23
- exports.MapTreeModule_partition = MapTreeModule_partition;
24
- exports.MapTreeModule_filter1 = MapTreeModule_filter1;
25
- exports.MapTreeModule_filterAux = MapTreeModule_filterAux;
26
- exports.MapTreeModule_filter = MapTreeModule_filter;
27
- exports.MapTreeModule_spliceOutSuccessor = MapTreeModule_spliceOutSuccessor;
28
- exports.MapTreeModule_remove = MapTreeModule_remove;
29
- exports.MapTreeModule_change = MapTreeModule_change;
30
- exports.MapTreeModule_mem = MapTreeModule_mem;
31
- exports.MapTreeModule_iterOpt = MapTreeModule_iterOpt;
32
- exports.MapTreeModule_iter = MapTreeModule_iter;
33
- exports.MapTreeModule_tryPickOpt = MapTreeModule_tryPickOpt;
34
- exports.MapTreeModule_tryPick = MapTreeModule_tryPick;
35
- exports.MapTreeModule_existsOpt = MapTreeModule_existsOpt;
36
- exports.MapTreeModule_exists = MapTreeModule_exists;
37
- exports.MapTreeModule_forallOpt = MapTreeModule_forallOpt;
38
- exports.MapTreeModule_forall = MapTreeModule_forall;
39
- exports.MapTreeModule_map = MapTreeModule_map;
40
- exports.MapTreeModule_mapiOpt = MapTreeModule_mapiOpt;
41
- exports.MapTreeModule_mapi = MapTreeModule_mapi;
42
- exports.MapTreeModule_foldBackOpt = MapTreeModule_foldBackOpt;
43
- exports.MapTreeModule_foldBack = MapTreeModule_foldBack;
44
- exports.MapTreeModule_foldOpt = MapTreeModule_foldOpt;
45
- exports.MapTreeModule_fold = MapTreeModule_fold;
46
- exports.MapTreeModule_foldSectionOpt = MapTreeModule_foldSectionOpt;
47
- exports.MapTreeModule_foldSection = MapTreeModule_foldSection;
48
- exports.MapTreeModule_toList = MapTreeModule_toList;
49
- exports.MapTreeModule_copyToArray = MapTreeModule_copyToArray;
50
- exports.MapTreeModule_toArray = MapTreeModule_toArray;
51
- exports.MapTreeModule_ofList = MapTreeModule_ofList;
52
- exports.MapTreeModule_mkFromEnumerator = MapTreeModule_mkFromEnumerator;
53
- exports.MapTreeModule_ofArray = MapTreeModule_ofArray;
54
- exports.MapTreeModule_ofSeq = MapTreeModule_ofSeq;
55
- exports.MapTreeModule_MapIterator$2_$reflection = MapTreeModule_MapIterator$2_$reflection;
56
- exports.MapTreeModule_collapseLHS = MapTreeModule_collapseLHS;
57
- exports.MapTreeModule_mkIterator = MapTreeModule_mkIterator;
58
- exports.MapTreeModule_notStarted = MapTreeModule_notStarted;
59
- exports.MapTreeModule_alreadyFinished = MapTreeModule_alreadyFinished;
60
- exports.MapTreeModule_current = MapTreeModule_current;
61
- exports.MapTreeModule_moveNext = MapTreeModule_moveNext;
62
- exports.MapTreeModule_mkIEnumerator = MapTreeModule_mkIEnumerator;
63
- exports.MapTreeModule_toSeq = MapTreeModule_toSeq;
64
- exports.MapTreeModule_leftmost = MapTreeModule_leftmost;
65
- exports.MapTreeModule_rightmost = MapTreeModule_rightmost;
66
- exports.FSharpMap_$reflection = FSharpMap_$reflection;
67
- exports.FSharpMap_$ctor = FSharpMap_$ctor;
68
- exports.FSharpMap_Empty = FSharpMap_Empty;
69
- exports.FSharpMap__get_Comparer = FSharpMap__get_Comparer;
70
- exports.FSharpMap__get_Tree = FSharpMap__get_Tree;
71
- exports.FSharpMap__Add = FSharpMap__Add;
72
- exports.FSharpMap__Change = FSharpMap__Change;
73
- exports.FSharpMap__get_IsEmpty = FSharpMap__get_IsEmpty;
74
- exports.FSharpMap__get_Item = FSharpMap__get_Item;
75
- exports.FSharpMap__TryPick = FSharpMap__TryPick;
76
- exports.FSharpMap__Exists = FSharpMap__Exists;
77
- exports.FSharpMap__Filter = FSharpMap__Filter;
78
- exports.FSharpMap__ForAll = FSharpMap__ForAll;
79
- exports.FSharpMap__Fold = FSharpMap__Fold;
80
- exports.FSharpMap__FoldSection = FSharpMap__FoldSection;
81
- exports.FSharpMap__Iterate = FSharpMap__Iterate;
82
- exports.FSharpMap__MapRange = FSharpMap__MapRange;
83
- exports.FSharpMap__Map = FSharpMap__Map;
84
- exports.FSharpMap__Partition = FSharpMap__Partition;
85
- exports.FSharpMap__get_Count = FSharpMap__get_Count;
86
- exports.FSharpMap__ContainsKey = FSharpMap__ContainsKey;
87
- exports.FSharpMap__Remove = FSharpMap__Remove;
88
- exports.FSharpMap__TryGetValue = FSharpMap__TryGetValue;
89
- exports.FSharpMap__get_Keys = FSharpMap__get_Keys;
90
- exports.FSharpMap__get_Values = FSharpMap__get_Values;
91
- exports.FSharpMap__get_MinKeyValue = FSharpMap__get_MinKeyValue;
92
- exports.FSharpMap__get_MaxKeyValue = FSharpMap__get_MaxKeyValue;
93
- exports.FSharpMap__TryFind = FSharpMap__TryFind;
94
- exports.FSharpMap__ToList = FSharpMap__ToList;
95
- exports.FSharpMap__ToArray = FSharpMap__ToArray;
96
- exports.FSharpMap__ComputeHashCode = FSharpMap__ComputeHashCode;
97
- exports.isEmpty = isEmpty;
98
- exports.add = add;
99
- exports.change = change;
100
- exports.find = find;
101
- exports.tryFind = tryFind;
102
- exports.remove = remove;
103
- exports.containsKey = containsKey;
104
- exports.iterate = iterate;
105
- exports.tryPick = tryPick;
106
- exports.pick = pick;
107
- exports.exists = exists;
108
- exports.filter = filter;
109
- exports.partition = partition;
110
- exports.forAll = forAll;
111
- exports.map = map;
112
- exports.fold = fold;
113
- exports.foldBack = foldBack;
114
- exports.toSeq = toSeq;
115
- exports.findKey = findKey;
116
- exports.tryFindKey = tryFindKey;
117
- exports.ofList = ofList;
118
- exports.ofSeq = ofSeq;
119
- exports.ofArray = ofArray;
120
- exports.toList = toList;
121
- exports.toArray = toArray;
122
- exports.keys = keys;
123
- exports.values = values;
124
- exports.minKeyValue = minKeyValue;
125
- exports.maxKeyValue = maxKeyValue;
126
- exports.empty = empty;
127
- exports.count = count;
128
- const Reflection_ts_1 = require("./Reflection.js");
129
- const Option_ts_1 = require("./Option.js");
130
- const Util_ts_1 = require("./Util.js");
131
- const System_Collections_Generic_ts_1 = require("./System.Collections.Generic.js");
132
- const List_ts_1 = require("./List.js");
133
- const Array_ts_1 = require("./Array.js");
134
- const Types_ts_1 = require("./Types.js");
135
- const Seq_ts_1 = require("./Seq.js");
136
- const String_ts_1 = require("./String.js");
137
- const System_ts_1 = require("./System.js");
138
- class MapTreeLeaf$2 {
139
- constructor(k, v) {
140
- this.k = k;
141
- this.v = v;
142
- }
143
- }
144
- exports.MapTreeLeaf$2 = MapTreeLeaf$2;
145
- function MapTreeLeaf$2_$reflection(gen0, gen1) {
146
- return (0, Reflection_ts_1.class_type)("Map.MapTreeLeaf`2", [gen0, gen1], MapTreeLeaf$2);
147
- }
148
- function MapTreeLeaf$2_$ctor_5BDDA1(k, v) {
149
- return new MapTreeLeaf$2(k, v);
150
- }
151
- function MapTreeLeaf$2__get_Key(_) {
152
- return _.k;
153
- }
154
- function MapTreeLeaf$2__get_Value(_) {
155
- return _.v;
156
- }
157
- class MapTreeNode$2 extends MapTreeLeaf$2 {
158
- constructor(k, v, left, right, h) {
159
- super(k, v);
160
- this.left = left;
161
- this.right = right;
162
- this.h = (h | 0);
163
- }
164
- }
165
- exports.MapTreeNode$2 = MapTreeNode$2;
166
- function MapTreeNode$2_$reflection(gen0, gen1) {
167
- return (0, Reflection_ts_1.class_type)("Map.MapTreeNode`2", [gen0, gen1], MapTreeNode$2, MapTreeLeaf$2_$reflection(gen0, gen1));
168
- }
169
- function MapTreeNode$2_$ctor_Z39DE9543(k, v, left, right, h) {
170
- return new MapTreeNode$2(k, v, left, right, h);
171
- }
172
- function MapTreeNode$2__get_Left(_) {
173
- return _.left;
174
- }
175
- function MapTreeNode$2__get_Right(_) {
176
- return _.right;
177
- }
178
- function MapTreeNode$2__get_Height(_) {
179
- return _.h | 0;
180
- }
181
- function MapTreeModule_empty() {
182
- return undefined;
183
- }
184
- function MapTreeModule_sizeAux(acc_mut, m_mut) {
185
- MapTreeModule_sizeAux: while (true) {
186
- const acc = acc_mut, m = m_mut;
187
- if (m != null) {
188
- const m2 = (0, Option_ts_1.value)(m);
189
- if (m2 instanceof MapTreeNode$2) {
190
- const mn = m2;
191
- acc_mut = MapTreeModule_sizeAux(acc + 1, MapTreeNode$2__get_Left(mn));
192
- m_mut = MapTreeNode$2__get_Right(mn);
193
- continue MapTreeModule_sizeAux;
194
- }
195
- else {
196
- return (acc + 1) | 0;
197
- }
198
- }
199
- else {
200
- return acc | 0;
201
- }
202
- break;
203
- }
204
- }
205
- function MapTreeModule_size(x) {
206
- return MapTreeModule_sizeAux(0, x) | 0;
207
- }
208
- function MapTreeModule_mk(l, k, v, r) {
209
- let mn = undefined, mn_1 = undefined;
210
- let hl;
211
- const m = l;
212
- if (m != null) {
213
- const m2 = (0, Option_ts_1.value)(m);
214
- hl = ((m2 instanceof MapTreeNode$2) ? ((mn = m2, MapTreeNode$2__get_Height(mn))) : 1);
215
- }
216
- else {
217
- hl = 0;
218
- }
219
- let hr;
220
- const m_1 = r;
221
- if (m_1 != null) {
222
- const m2_1 = (0, Option_ts_1.value)(m_1);
223
- hr = ((m2_1 instanceof MapTreeNode$2) ? ((mn_1 = m2_1, MapTreeNode$2__get_Height(mn_1))) : 1);
224
- }
225
- else {
226
- hr = 0;
227
- }
228
- const m_2 = ((hl < hr) ? hr : hl) | 0;
229
- if (m_2 === 0) {
230
- return MapTreeLeaf$2_$ctor_5BDDA1(k, v);
231
- }
232
- else {
233
- return MapTreeNode$2_$ctor_Z39DE9543(k, v, l, r, m_2 + 1);
234
- }
235
- }
236
- function MapTreeModule_rebalance(t1, k, v, t2) {
237
- let mn = undefined, mn_1 = undefined, m_2 = undefined, m2_2 = undefined, mn_2 = undefined, m_3 = undefined, m2_3 = undefined, mn_3 = undefined;
238
- let t1h;
239
- const m = t1;
240
- if (m != null) {
241
- const m2 = (0, Option_ts_1.value)(m);
242
- t1h = ((m2 instanceof MapTreeNode$2) ? ((mn = m2, MapTreeNode$2__get_Height(mn))) : 1);
243
- }
244
- else {
245
- t1h = 0;
246
- }
247
- let t2h;
248
- const m_1 = t2;
249
- if (m_1 != null) {
250
- const m2_1 = (0, Option_ts_1.value)(m_1);
251
- t2h = ((m2_1 instanceof MapTreeNode$2) ? ((mn_1 = m2_1, MapTreeNode$2__get_Height(mn_1))) : 1);
252
- }
253
- else {
254
- t2h = 0;
255
- }
256
- if (t2h > (t1h + 2)) {
257
- const matchValue = (0, Option_ts_1.value)(t2);
258
- if (matchValue instanceof MapTreeNode$2) {
259
- const t2$0027 = matchValue;
260
- if (((m_2 = MapTreeNode$2__get_Left(t2$0027), (m_2 != null) ? ((m2_2 = (0, Option_ts_1.value)(m_2), (m2_2 instanceof MapTreeNode$2) ? ((mn_2 = m2_2, MapTreeNode$2__get_Height(mn_2))) : 1)) : 0)) > (t1h + 1)) {
261
- const matchValue_1 = (0, Option_ts_1.value)(MapTreeNode$2__get_Left(t2$0027));
262
- if (matchValue_1 instanceof MapTreeNode$2) {
263
- const t2l = matchValue_1;
264
- return MapTreeModule_mk(MapTreeModule_mk(t1, k, v, MapTreeNode$2__get_Left(t2l)), MapTreeLeaf$2__get_Key(t2l), MapTreeLeaf$2__get_Value(t2l), MapTreeModule_mk(MapTreeNode$2__get_Right(t2l), MapTreeLeaf$2__get_Key(t2$0027), MapTreeLeaf$2__get_Value(t2$0027), MapTreeNode$2__get_Right(t2$0027)));
265
- }
266
- else {
267
- throw new Util_ts_1.Exception("internal error: Map.rebalance");
268
- }
269
- }
270
- else {
271
- return MapTreeModule_mk(MapTreeModule_mk(t1, k, v, MapTreeNode$2__get_Left(t2$0027)), MapTreeLeaf$2__get_Key(t2$0027), MapTreeLeaf$2__get_Value(t2$0027), MapTreeNode$2__get_Right(t2$0027));
272
- }
273
- }
274
- else {
275
- throw new Util_ts_1.Exception("internal error: Map.rebalance");
276
- }
277
- }
278
- else if (t1h > (t2h + 2)) {
279
- const matchValue_2 = (0, Option_ts_1.value)(t1);
280
- if (matchValue_2 instanceof MapTreeNode$2) {
281
- const t1$0027 = matchValue_2;
282
- if (((m_3 = MapTreeNode$2__get_Right(t1$0027), (m_3 != null) ? ((m2_3 = (0, Option_ts_1.value)(m_3), (m2_3 instanceof MapTreeNode$2) ? ((mn_3 = m2_3, MapTreeNode$2__get_Height(mn_3))) : 1)) : 0)) > (t2h + 1)) {
283
- const matchValue_3 = (0, Option_ts_1.value)(MapTreeNode$2__get_Right(t1$0027));
284
- if (matchValue_3 instanceof MapTreeNode$2) {
285
- const t1r = matchValue_3;
286
- return MapTreeModule_mk(MapTreeModule_mk(MapTreeNode$2__get_Left(t1$0027), MapTreeLeaf$2__get_Key(t1$0027), MapTreeLeaf$2__get_Value(t1$0027), MapTreeNode$2__get_Left(t1r)), MapTreeLeaf$2__get_Key(t1r), MapTreeLeaf$2__get_Value(t1r), MapTreeModule_mk(MapTreeNode$2__get_Right(t1r), k, v, t2));
287
- }
288
- else {
289
- throw new Util_ts_1.Exception("internal error: Map.rebalance");
290
- }
291
- }
292
- else {
293
- return MapTreeModule_mk(MapTreeNode$2__get_Left(t1$0027), MapTreeLeaf$2__get_Key(t1$0027), MapTreeLeaf$2__get_Value(t1$0027), MapTreeModule_mk(MapTreeNode$2__get_Right(t1$0027), k, v, t2));
294
- }
295
- }
296
- else {
297
- throw new Util_ts_1.Exception("internal error: Map.rebalance");
298
- }
299
- }
300
- else {
301
- return MapTreeModule_mk(t1, k, v, t2);
302
- }
303
- }
304
- function MapTreeModule_add(comparer, k, v, m) {
305
- if (m != null) {
306
- const m2 = (0, Option_ts_1.value)(m);
307
- const c = comparer.Compare(k, MapTreeLeaf$2__get_Key(m2)) | 0;
308
- if (m2 instanceof MapTreeNode$2) {
309
- const mn = m2;
310
- if (c < 0) {
311
- return MapTreeModule_rebalance(MapTreeModule_add(comparer, k, v, MapTreeNode$2__get_Left(mn)), MapTreeLeaf$2__get_Key(mn), MapTreeLeaf$2__get_Value(mn), MapTreeNode$2__get_Right(mn));
312
- }
313
- else if (c === 0) {
314
- return MapTreeNode$2_$ctor_Z39DE9543(k, v, MapTreeNode$2__get_Left(mn), MapTreeNode$2__get_Right(mn), MapTreeNode$2__get_Height(mn));
315
- }
316
- else {
317
- return MapTreeModule_rebalance(MapTreeNode$2__get_Left(mn), MapTreeLeaf$2__get_Key(mn), MapTreeLeaf$2__get_Value(mn), MapTreeModule_add(comparer, k, v, MapTreeNode$2__get_Right(mn)));
318
- }
319
- }
320
- else if (c < 0) {
321
- return MapTreeNode$2_$ctor_Z39DE9543(k, v, MapTreeModule_empty(), m, 2);
322
- }
323
- else if (c === 0) {
324
- return MapTreeLeaf$2_$ctor_5BDDA1(k, v);
325
- }
326
- else {
327
- return MapTreeNode$2_$ctor_Z39DE9543(k, v, m, MapTreeModule_empty(), 2);
328
- }
329
- }
330
- else {
331
- return MapTreeLeaf$2_$ctor_5BDDA1(k, v);
332
- }
333
- }
334
- function MapTreeModule_tryFind(comparer_mut, k_mut, m_mut) {
335
- MapTreeModule_tryFind: while (true) {
336
- const comparer = comparer_mut, k = k_mut, m = m_mut;
337
- if (m != null) {
338
- const m2 = (0, Option_ts_1.value)(m);
339
- const c = comparer.Compare(k, MapTreeLeaf$2__get_Key(m2)) | 0;
340
- if (c === 0) {
341
- return (0, Option_ts_1.some)(MapTreeLeaf$2__get_Value(m2));
342
- }
343
- else if (m2 instanceof MapTreeNode$2) {
344
- const mn = m2;
345
- comparer_mut = comparer;
346
- k_mut = k;
347
- m_mut = ((c < 0) ? MapTreeNode$2__get_Left(mn) : MapTreeNode$2__get_Right(mn));
348
- continue MapTreeModule_tryFind;
349
- }
350
- else {
351
- return undefined;
352
- }
353
- }
354
- else {
355
- return undefined;
356
- }
357
- break;
358
- }
359
- }
360
- function MapTreeModule_find(comparer, k, m) {
361
- const matchValue = MapTreeModule_tryFind(comparer, k, m);
362
- if (matchValue == null) {
363
- throw (0, System_Collections_Generic_ts_1.KeyNotFoundException_$ctor)();
364
- }
365
- else {
366
- return (0, Option_ts_1.value)(matchValue);
367
- }
368
- }
369
- function MapTreeModule_partition1(comparer, f, k, v, acc1, acc2) {
370
- if (f(k, v)) {
371
- return [MapTreeModule_add(comparer, k, v, acc1), acc2];
372
- }
373
- else {
374
- return [acc1, MapTreeModule_add(comparer, k, v, acc2)];
375
- }
376
- }
377
- function MapTreeModule_partitionAux(comparer_mut, f_mut, m_mut, acc__mut, acc__1_mut) {
378
- MapTreeModule_partitionAux: while (true) {
379
- const comparer = comparer_mut, f = f_mut, m = m_mut, acc_ = acc__mut, acc__1 = acc__1_mut;
380
- const acc = [acc_, acc__1];
381
- if (m != null) {
382
- const m2 = (0, Option_ts_1.value)(m);
383
- if (m2 instanceof MapTreeNode$2) {
384
- const mn = m2;
385
- const acc_1 = MapTreeModule_partitionAux(comparer, f, MapTreeNode$2__get_Right(mn), acc[0], acc[1]);
386
- const acc_4 = MapTreeModule_partition1(comparer, f, MapTreeLeaf$2__get_Key(mn), MapTreeLeaf$2__get_Value(mn), acc_1[0], acc_1[1]);
387
- comparer_mut = comparer;
388
- f_mut = f;
389
- m_mut = MapTreeNode$2__get_Left(mn);
390
- acc__mut = acc_4[0];
391
- acc__1_mut = acc_4[1];
392
- continue MapTreeModule_partitionAux;
393
- }
394
- else {
395
- return MapTreeModule_partition1(comparer, f, MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2), acc[0], acc[1]);
396
- }
397
- }
398
- else {
399
- return acc;
400
- }
401
- break;
402
- }
403
- }
404
- function MapTreeModule_partition(comparer, f, m) {
405
- return MapTreeModule_partitionAux(comparer, f, m, MapTreeModule_empty(), MapTreeModule_empty());
406
- }
407
- function MapTreeModule_filter1(comparer, f, k, v, acc) {
408
- if (f(k, v)) {
409
- return MapTreeModule_add(comparer, k, v, acc);
410
- }
411
- else {
412
- return acc;
413
- }
414
- }
415
- function MapTreeModule_filterAux(comparer_mut, f_mut, m_mut, acc_mut) {
416
- MapTreeModule_filterAux: while (true) {
417
- const comparer = comparer_mut, f = f_mut, m = m_mut, acc = acc_mut;
418
- if (m != null) {
419
- const m2 = (0, Option_ts_1.value)(m);
420
- if (m2 instanceof MapTreeNode$2) {
421
- const mn = m2;
422
- const acc_1 = MapTreeModule_filterAux(comparer, f, MapTreeNode$2__get_Left(mn), acc);
423
- const acc_2 = MapTreeModule_filter1(comparer, f, MapTreeLeaf$2__get_Key(mn), MapTreeLeaf$2__get_Value(mn), acc_1);
424
- comparer_mut = comparer;
425
- f_mut = f;
426
- m_mut = MapTreeNode$2__get_Right(mn);
427
- acc_mut = acc_2;
428
- continue MapTreeModule_filterAux;
429
- }
430
- else {
431
- return MapTreeModule_filter1(comparer, f, MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2), acc);
432
- }
433
- }
434
- else {
435
- return acc;
436
- }
437
- break;
438
- }
439
- }
440
- function MapTreeModule_filter(comparer, f, m) {
441
- return MapTreeModule_filterAux(comparer, f, m, MapTreeModule_empty());
442
- }
443
- function MapTreeModule_spliceOutSuccessor(m) {
444
- if (m != null) {
445
- const m2 = (0, Option_ts_1.value)(m);
446
- if (m2 instanceof MapTreeNode$2) {
447
- const mn = m2;
448
- if (MapTreeNode$2__get_Left(mn) == null) {
449
- return [MapTreeLeaf$2__get_Key(mn), MapTreeLeaf$2__get_Value(mn), MapTreeNode$2__get_Right(mn)];
450
- }
451
- else {
452
- const patternInput = MapTreeModule_spliceOutSuccessor(MapTreeNode$2__get_Left(mn));
453
- return [patternInput[0], patternInput[1], MapTreeModule_mk(patternInput[2], MapTreeLeaf$2__get_Key(mn), MapTreeLeaf$2__get_Value(mn), MapTreeNode$2__get_Right(mn))];
454
- }
455
- }
456
- else {
457
- return [MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2), MapTreeModule_empty()];
458
- }
459
- }
460
- else {
461
- throw new Util_ts_1.Exception("internal error: Map.spliceOutSuccessor");
462
- }
463
- }
464
- function MapTreeModule_remove(comparer, k, m) {
465
- if (m != null) {
466
- const m2 = (0, Option_ts_1.value)(m);
467
- const c = comparer.Compare(k, MapTreeLeaf$2__get_Key(m2)) | 0;
468
- if (m2 instanceof MapTreeNode$2) {
469
- const mn = m2;
470
- if (c < 0) {
471
- return MapTreeModule_rebalance(MapTreeModule_remove(comparer, k, MapTreeNode$2__get_Left(mn)), MapTreeLeaf$2__get_Key(mn), MapTreeLeaf$2__get_Value(mn), MapTreeNode$2__get_Right(mn));
472
- }
473
- else if (c === 0) {
474
- if (MapTreeNode$2__get_Left(mn) == null) {
475
- return MapTreeNode$2__get_Right(mn);
476
- }
477
- else if (MapTreeNode$2__get_Right(mn) == null) {
478
- return MapTreeNode$2__get_Left(mn);
479
- }
480
- else {
481
- const patternInput = MapTreeModule_spliceOutSuccessor(MapTreeNode$2__get_Right(mn));
482
- return MapTreeModule_mk(MapTreeNode$2__get_Left(mn), patternInput[0], patternInput[1], patternInput[2]);
483
- }
484
- }
485
- else {
486
- return MapTreeModule_rebalance(MapTreeNode$2__get_Left(mn), MapTreeLeaf$2__get_Key(mn), MapTreeLeaf$2__get_Value(mn), MapTreeModule_remove(comparer, k, MapTreeNode$2__get_Right(mn)));
487
- }
488
- }
489
- else if (c === 0) {
490
- return MapTreeModule_empty();
491
- }
492
- else {
493
- return m;
494
- }
495
- }
496
- else {
497
- return MapTreeModule_empty();
498
- }
499
- }
500
- function MapTreeModule_change(comparer, k, u, m) {
501
- if (m != null) {
502
- const m2 = (0, Option_ts_1.value)(m);
503
- if (m2 instanceof MapTreeNode$2) {
504
- const mn = m2;
505
- const c = comparer.Compare(k, MapTreeLeaf$2__get_Key(mn)) | 0;
506
- if (c < 0) {
507
- return MapTreeModule_rebalance(MapTreeModule_change(comparer, k, u, MapTreeNode$2__get_Left(mn)), MapTreeLeaf$2__get_Key(mn), MapTreeLeaf$2__get_Value(mn), MapTreeNode$2__get_Right(mn));
508
- }
509
- else if (c === 0) {
510
- const matchValue_1 = u((0, Option_ts_1.some)(MapTreeLeaf$2__get_Value(mn)));
511
- if (matchValue_1 != null) {
512
- return MapTreeNode$2_$ctor_Z39DE9543(k, (0, Option_ts_1.value)(matchValue_1), MapTreeNode$2__get_Left(mn), MapTreeNode$2__get_Right(mn), MapTreeNode$2__get_Height(mn));
513
- }
514
- else if (MapTreeNode$2__get_Left(mn) == null) {
515
- return MapTreeNode$2__get_Right(mn);
516
- }
517
- else if (MapTreeNode$2__get_Right(mn) == null) {
518
- return MapTreeNode$2__get_Left(mn);
519
- }
520
- else {
521
- const patternInput = MapTreeModule_spliceOutSuccessor(MapTreeNode$2__get_Right(mn));
522
- return MapTreeModule_mk(MapTreeNode$2__get_Left(mn), patternInput[0], patternInput[1], patternInput[2]);
523
- }
524
- }
525
- else {
526
- return MapTreeModule_rebalance(MapTreeNode$2__get_Left(mn), MapTreeLeaf$2__get_Key(mn), MapTreeLeaf$2__get_Value(mn), MapTreeModule_change(comparer, k, u, MapTreeNode$2__get_Right(mn)));
527
- }
528
- }
529
- else {
530
- const c_1 = comparer.Compare(k, MapTreeLeaf$2__get_Key(m2)) | 0;
531
- if (c_1 < 0) {
532
- const matchValue_2 = u(undefined);
533
- if (matchValue_2 != null) {
534
- return MapTreeNode$2_$ctor_Z39DE9543(k, (0, Option_ts_1.value)(matchValue_2), MapTreeModule_empty(), m, 2);
535
- }
536
- else {
537
- return m;
538
- }
539
- }
540
- else if (c_1 === 0) {
541
- const matchValue_3 = u((0, Option_ts_1.some)(MapTreeLeaf$2__get_Value(m2)));
542
- if (matchValue_3 != null) {
543
- return MapTreeLeaf$2_$ctor_5BDDA1(k, (0, Option_ts_1.value)(matchValue_3));
544
- }
545
- else {
546
- return MapTreeModule_empty();
547
- }
548
- }
549
- else {
550
- const matchValue_4 = u(undefined);
551
- if (matchValue_4 != null) {
552
- return MapTreeNode$2_$ctor_Z39DE9543(k, (0, Option_ts_1.value)(matchValue_4), m, MapTreeModule_empty(), 2);
553
- }
554
- else {
555
- return m;
556
- }
557
- }
558
- }
559
- }
560
- else {
561
- const matchValue = u(undefined);
562
- if (matchValue != null) {
563
- return MapTreeLeaf$2_$ctor_5BDDA1(k, (0, Option_ts_1.value)(matchValue));
564
- }
565
- else {
566
- return m;
567
- }
568
- }
569
- }
570
- function MapTreeModule_mem(comparer_mut, k_mut, m_mut) {
571
- MapTreeModule_mem: while (true) {
572
- const comparer = comparer_mut, k = k_mut, m = m_mut;
573
- if (m != null) {
574
- const m2 = (0, Option_ts_1.value)(m);
575
- const c = comparer.Compare(k, MapTreeLeaf$2__get_Key(m2)) | 0;
576
- if (m2 instanceof MapTreeNode$2) {
577
- const mn = m2;
578
- if (c < 0) {
579
- comparer_mut = comparer;
580
- k_mut = k;
581
- m_mut = MapTreeNode$2__get_Left(mn);
582
- continue MapTreeModule_mem;
583
- }
584
- else if (c === 0) {
585
- return true;
586
- }
587
- else {
588
- comparer_mut = comparer;
589
- k_mut = k;
590
- m_mut = MapTreeNode$2__get_Right(mn);
591
- continue MapTreeModule_mem;
592
- }
593
- }
594
- else {
595
- return c === 0;
596
- }
597
- }
598
- else {
599
- return false;
600
- }
601
- break;
602
- }
603
- }
604
- function MapTreeModule_iterOpt(f_mut, m_mut) {
605
- MapTreeModule_iterOpt: while (true) {
606
- const f = f_mut, m = m_mut;
607
- if (m != null) {
608
- const m2 = (0, Option_ts_1.value)(m);
609
- if (m2 instanceof MapTreeNode$2) {
610
- const mn = m2;
611
- MapTreeModule_iterOpt(f, MapTreeNode$2__get_Left(mn));
612
- f(MapTreeLeaf$2__get_Key(mn), MapTreeLeaf$2__get_Value(mn));
613
- f_mut = f;
614
- m_mut = MapTreeNode$2__get_Right(mn);
615
- continue MapTreeModule_iterOpt;
616
- }
617
- else {
618
- f(MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2));
619
- }
620
- }
621
- break;
622
- }
623
- }
624
- function MapTreeModule_iter(f, m) {
625
- MapTreeModule_iterOpt(f, m);
626
- }
627
- function MapTreeModule_tryPickOpt(f_mut, m_mut) {
628
- MapTreeModule_tryPickOpt: while (true) {
629
- const f = f_mut, m = m_mut;
630
- if (m != null) {
631
- const m2 = (0, Option_ts_1.value)(m);
632
- if (m2 instanceof MapTreeNode$2) {
633
- const mn = m2;
634
- const matchValue = MapTreeModule_tryPickOpt(f, MapTreeNode$2__get_Left(mn));
635
- if (matchValue == null) {
636
- const matchValue_1 = f(MapTreeLeaf$2__get_Key(mn), MapTreeLeaf$2__get_Value(mn));
637
- if (matchValue_1 == null) {
638
- f_mut = f;
639
- m_mut = MapTreeNode$2__get_Right(mn);
640
- continue MapTreeModule_tryPickOpt;
641
- }
642
- else {
643
- return matchValue_1;
644
- }
645
- }
646
- else {
647
- return matchValue;
648
- }
649
- }
650
- else {
651
- return f(MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2));
652
- }
653
- }
654
- else {
655
- return undefined;
656
- }
657
- break;
658
- }
659
- }
660
- function MapTreeModule_tryPick(f, m) {
661
- return MapTreeModule_tryPickOpt(f, m);
662
- }
663
- function MapTreeModule_existsOpt(f_mut, m_mut) {
664
- MapTreeModule_existsOpt: while (true) {
665
- const f = f_mut, m = m_mut;
666
- if (m != null) {
667
- const m2 = (0, Option_ts_1.value)(m);
668
- if (m2 instanceof MapTreeNode$2) {
669
- const mn = m2;
670
- if (MapTreeModule_existsOpt(f, MapTreeNode$2__get_Left(mn)) ? true : f(MapTreeLeaf$2__get_Key(mn), MapTreeLeaf$2__get_Value(mn))) {
671
- return true;
672
- }
673
- else {
674
- f_mut = f;
675
- m_mut = MapTreeNode$2__get_Right(mn);
676
- continue MapTreeModule_existsOpt;
677
- }
678
- }
679
- else {
680
- return f(MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2));
681
- }
682
- }
683
- else {
684
- return false;
685
- }
686
- break;
687
- }
688
- }
689
- function MapTreeModule_exists(f, m) {
690
- return MapTreeModule_existsOpt(f, m);
691
- }
692
- function MapTreeModule_forallOpt(f_mut, m_mut) {
693
- MapTreeModule_forallOpt: while (true) {
694
- const f = f_mut, m = m_mut;
695
- if (m != null) {
696
- const m2 = (0, Option_ts_1.value)(m);
697
- if (m2 instanceof MapTreeNode$2) {
698
- const mn = m2;
699
- if (MapTreeModule_forallOpt(f, MapTreeNode$2__get_Left(mn)) && f(MapTreeLeaf$2__get_Key(mn), MapTreeLeaf$2__get_Value(mn))) {
700
- f_mut = f;
701
- m_mut = MapTreeNode$2__get_Right(mn);
702
- continue MapTreeModule_forallOpt;
703
- }
704
- else {
705
- return false;
706
- }
707
- }
708
- else {
709
- return f(MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2));
710
- }
711
- }
712
- else {
713
- return true;
714
- }
715
- break;
716
- }
717
- }
718
- function MapTreeModule_forall(f, m) {
719
- return MapTreeModule_forallOpt(f, m);
720
- }
721
- function MapTreeModule_map(f, m) {
722
- if (m != null) {
723
- const m2 = (0, Option_ts_1.value)(m);
724
- if (m2 instanceof MapTreeNode$2) {
725
- const mn = m2;
726
- const l2 = MapTreeModule_map(f, MapTreeNode$2__get_Left(mn));
727
- const v2 = f(MapTreeLeaf$2__get_Value(mn));
728
- const r2 = MapTreeModule_map(f, MapTreeNode$2__get_Right(mn));
729
- return MapTreeNode$2_$ctor_Z39DE9543(MapTreeLeaf$2__get_Key(mn), v2, l2, r2, MapTreeNode$2__get_Height(mn));
730
- }
731
- else {
732
- return MapTreeLeaf$2_$ctor_5BDDA1(MapTreeLeaf$2__get_Key(m2), f(MapTreeLeaf$2__get_Value(m2)));
733
- }
734
- }
735
- else {
736
- return MapTreeModule_empty();
737
- }
738
- }
739
- function MapTreeModule_mapiOpt(f, m) {
740
- if (m != null) {
741
- const m2 = (0, Option_ts_1.value)(m);
742
- if (m2 instanceof MapTreeNode$2) {
743
- const mn = m2;
744
- const l2 = MapTreeModule_mapiOpt(f, MapTreeNode$2__get_Left(mn));
745
- const v2 = f(MapTreeLeaf$2__get_Key(mn), MapTreeLeaf$2__get_Value(mn));
746
- const r2 = MapTreeModule_mapiOpt(f, MapTreeNode$2__get_Right(mn));
747
- return MapTreeNode$2_$ctor_Z39DE9543(MapTreeLeaf$2__get_Key(mn), v2, l2, r2, MapTreeNode$2__get_Height(mn));
748
- }
749
- else {
750
- return MapTreeLeaf$2_$ctor_5BDDA1(MapTreeLeaf$2__get_Key(m2), f(MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2)));
751
- }
752
- }
753
- else {
754
- return MapTreeModule_empty();
755
- }
756
- }
757
- function MapTreeModule_mapi(f, m) {
758
- return MapTreeModule_mapiOpt(f, m);
759
- }
760
- function MapTreeModule_foldBackOpt(f_mut, m_mut, x_mut) {
761
- MapTreeModule_foldBackOpt: while (true) {
762
- const f = f_mut, m = m_mut, x = x_mut;
763
- if (m != null) {
764
- const m2 = (0, Option_ts_1.value)(m);
765
- if (m2 instanceof MapTreeNode$2) {
766
- const mn = m2;
767
- const x_1 = MapTreeModule_foldBackOpt(f, MapTreeNode$2__get_Right(mn), x);
768
- const x_2 = f(MapTreeLeaf$2__get_Key(mn), MapTreeLeaf$2__get_Value(mn), x_1);
769
- f_mut = f;
770
- m_mut = MapTreeNode$2__get_Left(mn);
771
- x_mut = x_2;
772
- continue MapTreeModule_foldBackOpt;
773
- }
774
- else {
775
- return f(MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2), x);
776
- }
777
- }
778
- else {
779
- return x;
780
- }
781
- break;
782
- }
783
- }
784
- function MapTreeModule_foldBack(f, m, x) {
785
- return MapTreeModule_foldBackOpt(f, m, x);
786
- }
787
- function MapTreeModule_foldOpt(f_mut, x_mut, m_mut) {
788
- MapTreeModule_foldOpt: while (true) {
789
- const f = f_mut, x = x_mut, m = m_mut;
790
- if (m != null) {
791
- const m2 = (0, Option_ts_1.value)(m);
792
- if (m2 instanceof MapTreeNode$2) {
793
- const mn = m2;
794
- f_mut = f;
795
- x_mut = f(MapTreeModule_foldOpt(f, x, MapTreeNode$2__get_Left(mn)), MapTreeLeaf$2__get_Key(mn), MapTreeLeaf$2__get_Value(mn));
796
- m_mut = MapTreeNode$2__get_Right(mn);
797
- continue MapTreeModule_foldOpt;
798
- }
799
- else {
800
- return f(x, MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2));
801
- }
802
- }
803
- else {
804
- return x;
805
- }
806
- break;
807
- }
808
- }
809
- function MapTreeModule_fold(f, x, m) {
810
- return MapTreeModule_foldOpt(f, x, m);
811
- }
812
- function MapTreeModule_foldSectionOpt(comparer, lo, hi, f, m, x) {
813
- const foldFromTo = (f_1_mut, m_1_mut, x_1_mut) => {
814
- foldFromTo: while (true) {
815
- const f_1 = f_1_mut, m_1 = m_1_mut, x_1 = x_1_mut;
816
- if (m_1 != null) {
817
- const m2 = (0, Option_ts_1.value)(m_1);
818
- if (m2 instanceof MapTreeNode$2) {
819
- const mn = m2;
820
- const cLoKey = comparer.Compare(lo, MapTreeLeaf$2__get_Key(mn)) | 0;
821
- const cKeyHi = comparer.Compare(MapTreeLeaf$2__get_Key(mn), hi) | 0;
822
- const x_2 = (cLoKey < 0) ? foldFromTo(f_1, MapTreeNode$2__get_Left(mn), x_1) : x_1;
823
- const x_3 = ((cLoKey <= 0) && (cKeyHi <= 0)) ? f_1(MapTreeLeaf$2__get_Key(mn), MapTreeLeaf$2__get_Value(mn), x_2) : x_2;
824
- if (cKeyHi < 0) {
825
- f_1_mut = f_1;
826
- m_1_mut = MapTreeNode$2__get_Right(mn);
827
- x_1_mut = x_3;
828
- continue foldFromTo;
829
- }
830
- else {
831
- return x_3;
832
- }
833
- }
834
- else if ((comparer.Compare(lo, MapTreeLeaf$2__get_Key(m2)) <= 0) && (comparer.Compare(MapTreeLeaf$2__get_Key(m2), hi) <= 0)) {
835
- return f_1(MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2), x_1);
836
- }
837
- else {
838
- return x_1;
839
- }
840
- }
841
- else {
842
- return x_1;
843
- }
844
- break;
845
- }
846
- };
847
- if (comparer.Compare(lo, hi) === 1) {
848
- return x;
849
- }
850
- else {
851
- return foldFromTo(f, m, x);
852
- }
853
- }
854
- function MapTreeModule_foldSection(comparer, lo, hi, f, m, x) {
855
- return MapTreeModule_foldSectionOpt(comparer, lo, hi, f, m, x);
856
- }
857
- function MapTreeModule_toList(m) {
858
- const loop = (m_1_mut, acc_mut) => {
859
- loop: while (true) {
860
- const m_1 = m_1_mut, acc = acc_mut;
861
- if (m_1 != null) {
862
- const m2 = (0, Option_ts_1.value)(m_1);
863
- if (m2 instanceof MapTreeNode$2) {
864
- const mn = m2;
865
- m_1_mut = MapTreeNode$2__get_Left(mn);
866
- acc_mut = (0, List_ts_1.cons)([MapTreeLeaf$2__get_Key(mn), MapTreeLeaf$2__get_Value(mn)], loop(MapTreeNode$2__get_Right(mn), acc));
867
- continue loop;
868
- }
869
- else {
870
- return (0, List_ts_1.cons)([MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2)], acc);
871
- }
872
- }
873
- else {
874
- return acc;
875
- }
876
- break;
877
- }
878
- };
879
- return loop(m, (0, List_ts_1.empty)());
880
- }
881
- function MapTreeModule_copyToArray(m, arr, i) {
882
- let j = i;
883
- MapTreeModule_iter((x, y) => {
884
- (0, Array_ts_1.setItem)(arr, j, [x, y]);
885
- j = ((j + 1) | 0);
886
- }, m);
887
- }
888
- function MapTreeModule_toArray(m) {
889
- const n = MapTreeModule_size(m) | 0;
890
- const res = (0, Array_ts_1.fill)(new Array(n), 0, n, [null, null]);
891
- MapTreeModule_copyToArray(m, res, 0);
892
- return res;
893
- }
894
- function MapTreeModule_ofList(comparer, l) {
895
- return (0, List_ts_1.fold)((acc, tupledArg) => MapTreeModule_add(comparer, tupledArg[0], tupledArg[1], acc), MapTreeModule_empty(), l);
896
- }
897
- function MapTreeModule_mkFromEnumerator(comparer_mut, acc_mut, e_mut) {
898
- MapTreeModule_mkFromEnumerator: while (true) {
899
- const comparer = comparer_mut, acc = acc_mut, e = e_mut;
900
- if (e["System.Collections.IEnumerator.MoveNext"]()) {
901
- const patternInput = e["System.Collections.Generic.IEnumerator`1.get_Current"]();
902
- comparer_mut = comparer;
903
- acc_mut = MapTreeModule_add(comparer, patternInput[0], patternInput[1], acc);
904
- e_mut = e;
905
- continue MapTreeModule_mkFromEnumerator;
906
- }
907
- else {
908
- return acc;
909
- }
910
- break;
911
- }
912
- }
913
- function MapTreeModule_ofArray(comparer, arr) {
914
- let res = MapTreeModule_empty();
915
- for (let idx = 0; idx <= (arr.length - 1); idx++) {
916
- const forLoopVar = (0, Array_ts_1.item)(idx, arr);
917
- res = MapTreeModule_add(comparer, forLoopVar[0], forLoopVar[1], res);
918
- }
919
- return res;
920
- }
921
- function MapTreeModule_ofSeq(comparer, c) {
922
- if ((0, Util_ts_1.isArrayLike)(c)) {
923
- return MapTreeModule_ofArray(comparer, c);
924
- }
925
- else if (c instanceof List_ts_1.FSharpList) {
926
- return MapTreeModule_ofList(comparer, c);
927
- }
928
- else {
929
- const ie = (0, Util_ts_1.getEnumerator)(c);
930
- try {
931
- return MapTreeModule_mkFromEnumerator(comparer, MapTreeModule_empty(), ie);
932
- }
933
- finally {
934
- (0, Util_ts_1.disposeSafe)(ie);
935
- }
936
- }
937
- }
938
- class MapTreeModule_MapIterator$2 extends Types_ts_1.Record {
939
- constructor(stack, started) {
940
- super();
941
- this.stack = stack;
942
- this.started = started;
943
- }
944
- }
945
- exports.MapTreeModule_MapIterator$2 = MapTreeModule_MapIterator$2;
946
- function MapTreeModule_MapIterator$2_$reflection(gen0, gen1) {
947
- return (0, Reflection_ts_1.record_type)("Map.MapTreeModule.MapIterator`2", [gen0, gen1], MapTreeModule_MapIterator$2, () => [["stack", (0, Reflection_ts_1.list_type)((0, Reflection_ts_1.option_type)(MapTreeLeaf$2_$reflection(gen0, gen1)))], ["started", Reflection_ts_1.bool_type]]);
948
- }
949
- function MapTreeModule_collapseLHS(stack_mut) {
950
- MapTreeModule_collapseLHS: while (true) {
951
- const stack = stack_mut;
952
- if (!(0, List_ts_1.isEmpty)(stack)) {
953
- const rest = (0, List_ts_1.tail)(stack);
954
- const m = (0, List_ts_1.head)(stack);
955
- if (m != null) {
956
- const m2 = (0, Option_ts_1.value)(m);
957
- if (m2 instanceof MapTreeNode$2) {
958
- const mn = m2;
959
- stack_mut = (0, List_ts_1.ofArrayWithTail)([MapTreeNode$2__get_Left(mn), MapTreeLeaf$2_$ctor_5BDDA1(MapTreeLeaf$2__get_Key(mn), MapTreeLeaf$2__get_Value(mn)), MapTreeNode$2__get_Right(mn)], rest);
960
- continue MapTreeModule_collapseLHS;
961
- }
962
- else {
963
- return stack;
964
- }
965
- }
966
- else {
967
- stack_mut = rest;
968
- continue MapTreeModule_collapseLHS;
969
- }
970
- }
971
- else {
972
- return (0, List_ts_1.empty)();
973
- }
974
- break;
975
- }
976
- }
977
- function MapTreeModule_mkIterator(m) {
978
- return new MapTreeModule_MapIterator$2(MapTreeModule_collapseLHS((0, List_ts_1.singleton)(m)), false);
979
- }
980
- function MapTreeModule_notStarted() {
981
- throw new Util_ts_1.Exception("enumeration not started");
982
- }
983
- function MapTreeModule_alreadyFinished() {
984
- throw new Util_ts_1.Exception("enumeration already finished");
985
- }
986
- function MapTreeModule_current(i) {
987
- if (i.started) {
988
- const matchValue = i.stack;
989
- if (!(0, List_ts_1.isEmpty)(matchValue)) {
990
- if ((0, List_ts_1.head)(matchValue) != null) {
991
- const m = (0, Option_ts_1.value)((0, List_ts_1.head)(matchValue));
992
- if (m instanceof MapTreeNode$2) {
993
- throw new Util_ts_1.Exception("Please report error: Map iterator, unexpected stack for current");
994
- }
995
- else {
996
- return [MapTreeLeaf$2__get_Key(m), MapTreeLeaf$2__get_Value(m)];
997
- }
998
- }
999
- else {
1000
- throw new Util_ts_1.Exception("Please report error: Map iterator, unexpected stack for current");
1001
- }
1002
- }
1003
- else {
1004
- return MapTreeModule_alreadyFinished();
1005
- }
1006
- }
1007
- else {
1008
- return MapTreeModule_notStarted();
1009
- }
1010
- }
1011
- function MapTreeModule_moveNext(i) {
1012
- if (i.started) {
1013
- const matchValue = i.stack;
1014
- if (!(0, List_ts_1.isEmpty)(matchValue)) {
1015
- if ((0, List_ts_1.head)(matchValue) != null) {
1016
- const m = (0, Option_ts_1.value)((0, List_ts_1.head)(matchValue));
1017
- if (m instanceof MapTreeNode$2) {
1018
- throw new Util_ts_1.Exception("Please report error: Map iterator, unexpected stack for moveNext");
1019
- }
1020
- else {
1021
- i.stack = MapTreeModule_collapseLHS((0, List_ts_1.tail)(matchValue));
1022
- return !(0, List_ts_1.isEmpty)(i.stack);
1023
- }
1024
- }
1025
- else {
1026
- throw new Util_ts_1.Exception("Please report error: Map iterator, unexpected stack for moveNext");
1027
- }
1028
- }
1029
- else {
1030
- return false;
1031
- }
1032
- }
1033
- else {
1034
- i.started = true;
1035
- return !(0, List_ts_1.isEmpty)(i.stack);
1036
- }
1037
- }
1038
- function MapTreeModule_mkIEnumerator(m) {
1039
- let i = MapTreeModule_mkIterator(m);
1040
- return {
1041
- "System.Collections.Generic.IEnumerator`1.get_Current"() {
1042
- return MapTreeModule_current(i);
1043
- },
1044
- "System.Collections.IEnumerator.get_Current"() {
1045
- return MapTreeModule_current(i);
1046
- },
1047
- "System.Collections.IEnumerator.MoveNext"() {
1048
- return MapTreeModule_moveNext(i);
1049
- },
1050
- "System.Collections.IEnumerator.Reset"() {
1051
- i = MapTreeModule_mkIterator(m);
1052
- },
1053
- Dispose() {
1054
- },
1055
- };
1056
- }
1057
- function MapTreeModule_toSeq(s) {
1058
- return (0, Seq_ts_1.unfold)((en_1) => {
1059
- if (en_1["System.Collections.IEnumerator.MoveNext"]()) {
1060
- return [en_1["System.Collections.Generic.IEnumerator`1.get_Current"](), en_1];
1061
- }
1062
- else {
1063
- return undefined;
1064
- }
1065
- }, MapTreeModule_mkIEnumerator(s));
1066
- }
1067
- function MapTreeModule_leftmost(m_mut) {
1068
- MapTreeModule_leftmost: while (true) {
1069
- const m = m_mut;
1070
- if (m != null) {
1071
- const m2 = (0, Option_ts_1.value)(m);
1072
- let matchResult = undefined, nd_1 = undefined;
1073
- if (m2 instanceof MapTreeNode$2) {
1074
- if (MapTreeNode$2__get_Height(m2) > 1) {
1075
- matchResult = 0;
1076
- nd_1 = m2;
1077
- }
1078
- else {
1079
- matchResult = 1;
1080
- }
1081
- }
1082
- else {
1083
- matchResult = 1;
1084
- }
1085
- switch (matchResult) {
1086
- case 0:
1087
- if (MapTreeNode$2__get_Left(nd_1) == null) {
1088
- return [MapTreeLeaf$2__get_Key(nd_1), MapTreeLeaf$2__get_Value(nd_1)];
1089
- }
1090
- else {
1091
- m_mut = MapTreeNode$2__get_Left(nd_1);
1092
- continue MapTreeModule_leftmost;
1093
- }
1094
- default:
1095
- return [MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2)];
1096
- }
1097
- }
1098
- else {
1099
- throw (0, System_Collections_Generic_ts_1.KeyNotFoundException_$ctor)();
1100
- }
1101
- break;
1102
- }
1103
- }
1104
- function MapTreeModule_rightmost(m_mut) {
1105
- MapTreeModule_rightmost: while (true) {
1106
- const m = m_mut;
1107
- if (m != null) {
1108
- const m2 = (0, Option_ts_1.value)(m);
1109
- let matchResult = undefined, nd_1 = undefined;
1110
- if (m2 instanceof MapTreeNode$2) {
1111
- if (MapTreeNode$2__get_Height(m2) > 1) {
1112
- matchResult = 0;
1113
- nd_1 = m2;
1114
- }
1115
- else {
1116
- matchResult = 1;
1117
- }
1118
- }
1119
- else {
1120
- matchResult = 1;
1121
- }
1122
- switch (matchResult) {
1123
- case 0:
1124
- if (MapTreeNode$2__get_Right(nd_1) == null) {
1125
- return [MapTreeLeaf$2__get_Key(nd_1), MapTreeLeaf$2__get_Value(nd_1)];
1126
- }
1127
- else {
1128
- m_mut = MapTreeNode$2__get_Right(nd_1);
1129
- continue MapTreeModule_rightmost;
1130
- }
1131
- default:
1132
- return [MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2)];
1133
- }
1134
- }
1135
- else {
1136
- throw (0, System_Collections_Generic_ts_1.KeyNotFoundException_$ctor)();
1137
- }
1138
- break;
1139
- }
1140
- }
1141
- class FSharpMap {
1142
- constructor(comparer, tree) {
1143
- this.comparer = comparer;
1144
- this.tree = tree;
1145
- }
1146
- GetHashCode() {
1147
- const this$ = this;
1148
- return FSharpMap__ComputeHashCode(this$) | 0;
1149
- }
1150
- Equals(other) {
1151
- const this$ = this;
1152
- if (other instanceof FSharpMap) {
1153
- const that = other;
1154
- const e1 = (0, Util_ts_1.getEnumerator)(this$);
1155
- try {
1156
- const e2 = (0, Util_ts_1.getEnumerator)(that);
1157
- try {
1158
- const loop = () => {
1159
- const m1 = e1["System.Collections.IEnumerator.MoveNext"]();
1160
- if (m1 === e2["System.Collections.IEnumerator.MoveNext"]()) {
1161
- if (!m1) {
1162
- return true;
1163
- }
1164
- else {
1165
- const e1c = e1["System.Collections.Generic.IEnumerator`1.get_Current"]();
1166
- const e2c = e2["System.Collections.Generic.IEnumerator`1.get_Current"]();
1167
- if ((0, Util_ts_1.equals)(e1c[0], e2c[0]) && (0, Util_ts_1.equals)(e1c[1], e2c[1])) {
1168
- return loop();
1169
- }
1170
- else {
1171
- return false;
1172
- }
1173
- }
1174
- }
1175
- else {
1176
- return false;
1177
- }
1178
- };
1179
- return loop();
1180
- }
1181
- finally {
1182
- (0, Util_ts_1.disposeSafe)(e2);
1183
- }
1184
- }
1185
- finally {
1186
- (0, Util_ts_1.disposeSafe)(e1);
1187
- }
1188
- }
1189
- else {
1190
- return false;
1191
- }
1192
- }
1193
- toString() {
1194
- const this$ = this;
1195
- return ("map [" + (0, String_ts_1.join)("; ", (0, Seq_ts_1.map)((kv) => (0, String_ts_1.format)("({0}, {1})", kv[0], kv[1]), this$))) + "]";
1196
- }
1197
- get [Symbol.toStringTag]() {
1198
- return "FSharpMap";
1199
- }
1200
- toJSON() {
1201
- const this$ = this;
1202
- return Array.from(this$);
1203
- }
1204
- GetEnumerator() {
1205
- const _ = this;
1206
- return MapTreeModule_mkIEnumerator(_.tree);
1207
- }
1208
- [Symbol.iterator]() {
1209
- return (0, Util_ts_1.toIterator)((0, Util_ts_1.getEnumerator)(this));
1210
- }
1211
- "System.Collections.IEnumerable.GetEnumerator"() {
1212
- const _ = this;
1213
- return MapTreeModule_mkIEnumerator(_.tree);
1214
- }
1215
- CompareTo(other) {
1216
- let that = undefined;
1217
- const this$ = this;
1218
- return ((other instanceof FSharpMap) ? ((that = other, (0, Seq_ts_1.compareWith)((kvp1, kvp2) => {
1219
- const c = this$.comparer.Compare(kvp1[0], kvp2[0]) | 0;
1220
- return ((c !== 0) ? c : (0, Util_ts_1.compare)(kvp1[1], kvp2[1])) | 0;
1221
- }, this$, that))) : 1) | 0;
1222
- }
1223
- "System.Collections.Generic.ICollection`1.Add2B595"(x) {
1224
- throw (0, System_ts_1.NotSupportedException_$ctor_Z721C83C5)("Map cannot be mutated");
1225
- }
1226
- "System.Collections.Generic.ICollection`1.Clear"() {
1227
- throw (0, System_ts_1.NotSupportedException_$ctor_Z721C83C5)("Map cannot be mutated");
1228
- }
1229
- "System.Collections.Generic.ICollection`1.Remove2B595"(x) {
1230
- throw (0, System_ts_1.NotSupportedException_$ctor_Z721C83C5)("Map cannot be mutated");
1231
- }
1232
- "System.Collections.Generic.ICollection`1.Contains2B595"(x) {
1233
- const m = this;
1234
- return FSharpMap__ContainsKey(m, x[0]) && (0, Util_ts_1.equals)(FSharpMap__get_Item(m, x[0]), x[1]);
1235
- }
1236
- "System.Collections.Generic.ICollection`1.CopyToZ3B4C077E"(arr, i) {
1237
- const m = this;
1238
- MapTreeModule_copyToArray(m.tree, arr, i);
1239
- }
1240
- "System.Collections.Generic.ICollection`1.get_IsReadOnly"() {
1241
- return true;
1242
- }
1243
- "System.Collections.Generic.ICollection`1.get_Count"() {
1244
- const m = this;
1245
- return FSharpMap__get_Count(m) | 0;
1246
- }
1247
- "System.Collections.Generic.IReadOnlyCollection`1.get_Count"() {
1248
- const m = this;
1249
- return FSharpMap__get_Count(m) | 0;
1250
- }
1251
- get size() {
1252
- const m = this;
1253
- return FSharpMap__get_Count(m) | 0;
1254
- }
1255
- clear() {
1256
- throw new Util_ts_1.Exception("Map cannot be mutated");
1257
- }
1258
- delete(_arg) {
1259
- throw new Util_ts_1.Exception("Map cannot be mutated");
1260
- return false;
1261
- }
1262
- entries() {
1263
- const m = this;
1264
- return (0, Seq_ts_1.map)((p) => [p[0], p[1]], m);
1265
- }
1266
- get(k) {
1267
- const m = this;
1268
- return FSharpMap__get_Item(m, k);
1269
- }
1270
- has(k) {
1271
- const m = this;
1272
- return FSharpMap__ContainsKey(m, k);
1273
- }
1274
- keys() {
1275
- const m = this;
1276
- return (0, Seq_ts_1.map)((p) => p[0], m);
1277
- }
1278
- set(k, v) {
1279
- const m = this;
1280
- throw new Util_ts_1.Exception("Map cannot be mutated");
1281
- return m;
1282
- }
1283
- values() {
1284
- const m = this;
1285
- return (0, Seq_ts_1.map)((p) => p[1], m);
1286
- }
1287
- forEach(f, thisArg) {
1288
- const m = this;
1289
- (0, Seq_ts_1.iterate)((p) => {
1290
- f(p[1], p[0], m);
1291
- }, m);
1292
- }
1293
- }
1294
- exports.FSharpMap = FSharpMap;
1295
- function FSharpMap_$reflection(gen0, gen1) {
1296
- return (0, Reflection_ts_1.class_type)("Map.FSharpMap", [gen0, gen1], FSharpMap);
1297
- }
1298
- function FSharpMap_$ctor(comparer, tree) {
1299
- return new FSharpMap(comparer, tree);
1300
- }
1301
- function FSharpMap_Empty(comparer) {
1302
- return FSharpMap_$ctor(comparer, MapTreeModule_empty());
1303
- }
1304
- function FSharpMap__get_Comparer(m) {
1305
- return m.comparer;
1306
- }
1307
- function FSharpMap__get_Tree(m) {
1308
- return m.tree;
1309
- }
1310
- function FSharpMap__Add(m, key, value) {
1311
- return FSharpMap_$ctor(m.comparer, MapTreeModule_add(m.comparer, key, value, m.tree));
1312
- }
1313
- function FSharpMap__Change(m, key, f) {
1314
- return FSharpMap_$ctor(m.comparer, MapTreeModule_change(m.comparer, key, f, m.tree));
1315
- }
1316
- function FSharpMap__get_IsEmpty(m) {
1317
- return m.tree == null;
1318
- }
1319
- function FSharpMap__get_Item(m, key) {
1320
- return MapTreeModule_find(m.comparer, key, m.tree);
1321
- }
1322
- function FSharpMap__TryPick(m, f) {
1323
- return MapTreeModule_tryPick(f, m.tree);
1324
- }
1325
- function FSharpMap__Exists(m, predicate) {
1326
- return MapTreeModule_exists(predicate, m.tree);
1327
- }
1328
- function FSharpMap__Filter(m, predicate) {
1329
- return FSharpMap_$ctor(m.comparer, MapTreeModule_filter(m.comparer, predicate, m.tree));
1330
- }
1331
- function FSharpMap__ForAll(m, predicate) {
1332
- return MapTreeModule_forall(predicate, m.tree);
1333
- }
1334
- function FSharpMap__Fold(m, f, acc) {
1335
- return MapTreeModule_foldBack(f, m.tree, acc);
1336
- }
1337
- function FSharpMap__FoldSection(m, lo, hi, f, acc) {
1338
- return MapTreeModule_foldSection(m.comparer, lo, hi, f, m.tree, acc);
1339
- }
1340
- function FSharpMap__Iterate(m, f) {
1341
- MapTreeModule_iter(f, m.tree);
1342
- }
1343
- function FSharpMap__MapRange(m, f) {
1344
- return FSharpMap_$ctor(m.comparer, MapTreeModule_map(f, m.tree));
1345
- }
1346
- function FSharpMap__Map(m, f) {
1347
- return FSharpMap_$ctor(m.comparer, MapTreeModule_mapi(f, m.tree));
1348
- }
1349
- function FSharpMap__Partition(m, predicate) {
1350
- const patternInput = MapTreeModule_partition(m.comparer, predicate, m.tree);
1351
- return [FSharpMap_$ctor(m.comparer, patternInput[0]), FSharpMap_$ctor(m.comparer, patternInput[1])];
1352
- }
1353
- function FSharpMap__get_Count(m) {
1354
- return MapTreeModule_size(m.tree) | 0;
1355
- }
1356
- function FSharpMap__ContainsKey(m, key) {
1357
- return MapTreeModule_mem(m.comparer, key, m.tree);
1358
- }
1359
- function FSharpMap__Remove(m, key) {
1360
- return FSharpMap_$ctor(m.comparer, MapTreeModule_remove(m.comparer, key, m.tree));
1361
- }
1362
- function FSharpMap__TryGetValue(_, key, value) {
1363
- const matchValue = MapTreeModule_tryFind(_.comparer, key, _.tree);
1364
- if (matchValue == null) {
1365
- return false;
1366
- }
1367
- else {
1368
- const v = (0, Option_ts_1.value)(matchValue);
1369
- value.contents = v;
1370
- return true;
1371
- }
1372
- }
1373
- function FSharpMap__get_Keys(_) {
1374
- return (0, Array_ts_1.map)((kvp) => kvp[0], MapTreeModule_toArray(_.tree));
1375
- }
1376
- function FSharpMap__get_Values(_) {
1377
- return (0, Array_ts_1.map)((kvp) => kvp[1], MapTreeModule_toArray(_.tree));
1378
- }
1379
- function FSharpMap__get_MinKeyValue(m) {
1380
- return MapTreeModule_leftmost(m.tree);
1381
- }
1382
- function FSharpMap__get_MaxKeyValue(m) {
1383
- return MapTreeModule_rightmost(m.tree);
1384
- }
1385
- function FSharpMap__TryFind(m, key) {
1386
- return MapTreeModule_tryFind(m.comparer, key, m.tree);
1387
- }
1388
- function FSharpMap__ToList(m) {
1389
- return MapTreeModule_toList(m.tree);
1390
- }
1391
- function FSharpMap__ToArray(m) {
1392
- return MapTreeModule_toArray(m.tree);
1393
- }
1394
- function FSharpMap__ComputeHashCode(this$) {
1395
- const combineHash = (x, y) => ((((x << 1) + y) + 631) | 0);
1396
- let res = 0;
1397
- const enumerator = (0, Util_ts_1.getEnumerator)(this$);
1398
- try {
1399
- while (enumerator["System.Collections.IEnumerator.MoveNext"]()) {
1400
- const activePatternResult = enumerator["System.Collections.Generic.IEnumerator`1.get_Current"]();
1401
- res = (combineHash(res, (0, Util_ts_1.structuralHash)(activePatternResult[0])) | 0);
1402
- res = (combineHash(res, (0, Util_ts_1.structuralHash)(activePatternResult[1])) | 0);
1403
- }
1404
- }
1405
- finally {
1406
- (0, Util_ts_1.disposeSafe)(enumerator);
1407
- }
1408
- return res | 0;
1409
- }
1410
- function isEmpty(table) {
1411
- return FSharpMap__get_IsEmpty(table);
1412
- }
1413
- function add(key, value, table) {
1414
- return FSharpMap__Add(table, key, value);
1415
- }
1416
- function change(key, f, table) {
1417
- return FSharpMap__Change(table, key, f);
1418
- }
1419
- function find(key, table) {
1420
- return FSharpMap__get_Item(table, key);
1421
- }
1422
- function tryFind(key, table) {
1423
- return FSharpMap__TryFind(table, key);
1424
- }
1425
- function remove(key, table) {
1426
- return FSharpMap__Remove(table, key);
1427
- }
1428
- function containsKey(key, table) {
1429
- return FSharpMap__ContainsKey(table, key);
1430
- }
1431
- function iterate(action, table) {
1432
- FSharpMap__Iterate(table, action);
1433
- }
1434
- function tryPick(chooser, table) {
1435
- return FSharpMap__TryPick(table, chooser);
1436
- }
1437
- function pick(chooser, table) {
1438
- const matchValue = tryPick(chooser, table);
1439
- if (matchValue != null) {
1440
- return (0, Option_ts_1.value)(matchValue);
1441
- }
1442
- else {
1443
- throw (0, System_Collections_Generic_ts_1.KeyNotFoundException_$ctor)();
1444
- }
1445
- }
1446
- function exists(predicate, table) {
1447
- return FSharpMap__Exists(table, predicate);
1448
- }
1449
- function filter(predicate, table) {
1450
- return FSharpMap__Filter(table, predicate);
1451
- }
1452
- function partition(predicate, table) {
1453
- return FSharpMap__Partition(table, predicate);
1454
- }
1455
- function forAll(predicate, table) {
1456
- return FSharpMap__ForAll(table, predicate);
1457
- }
1458
- function map(mapping, table) {
1459
- return FSharpMap__Map(table, mapping);
1460
- }
1461
- function fold(folder, state, table) {
1462
- return MapTreeModule_fold(folder, state, FSharpMap__get_Tree(table));
1463
- }
1464
- function foldBack(folder, table, state) {
1465
- return MapTreeModule_foldBack(folder, FSharpMap__get_Tree(table), state);
1466
- }
1467
- function toSeq(table) {
1468
- return (0, Seq_ts_1.map)((kvp) => [kvp[0], kvp[1]], table);
1469
- }
1470
- function findKey(predicate, table) {
1471
- return (0, Seq_ts_1.pick)((kvp) => {
1472
- const k = kvp[0];
1473
- if (predicate(k, kvp[1])) {
1474
- return (0, Option_ts_1.some)(k);
1475
- }
1476
- else {
1477
- return undefined;
1478
- }
1479
- }, table);
1480
- }
1481
- function tryFindKey(predicate, table) {
1482
- return (0, Seq_ts_1.tryPick)((kvp) => {
1483
- const k = kvp[0];
1484
- if (predicate(k, kvp[1])) {
1485
- return (0, Option_ts_1.some)(k);
1486
- }
1487
- else {
1488
- return undefined;
1489
- }
1490
- }, table);
1491
- }
1492
- function ofList(elements, comparer) {
1493
- return FSharpMap_$ctor(comparer, MapTreeModule_ofSeq(comparer, elements));
1494
- }
1495
- function ofSeq(elements, comparer) {
1496
- return FSharpMap_$ctor(comparer, MapTreeModule_ofSeq(comparer, elements));
1497
- }
1498
- function ofArray(elements, comparer) {
1499
- return FSharpMap_$ctor(comparer, MapTreeModule_ofSeq(comparer, elements));
1500
- }
1501
- function toList(table) {
1502
- return FSharpMap__ToList(table);
1503
- }
1504
- function toArray(table) {
1505
- return FSharpMap__ToArray(table);
1506
- }
1507
- function keys(table) {
1508
- return FSharpMap__get_Keys(table);
1509
- }
1510
- function values(table) {
1511
- return FSharpMap__get_Values(table);
1512
- }
1513
- function minKeyValue(table) {
1514
- return FSharpMap__get_MinKeyValue(table);
1515
- }
1516
- function maxKeyValue(table) {
1517
- return FSharpMap__get_MaxKeyValue(table);
1518
- }
1519
- function empty(comparer) {
1520
- return FSharpMap_Empty(comparer);
1521
- }
1522
- function count(table) {
1523
- return FSharpMap__get_Count(table) | 0;
1524
- }
1525
- //# sourceMappingURL=Map.js.map