@itwin/imodel-transformer 0.3.18-fedguidopt.7 → 0.4.0

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@itwin/imodel-transformer",
-  "version": "0.3.18-fedguidopt.7",
+  "version": "0.4.0",
   "description": "API for exporting an iModel's parts and also importing them into another iModel",
   "main": "lib/cjs/transformer.js",
   "typings": "lib/cjs/transformer",
@@ -53,12 +53,12 @@
     "You can find a script to see the latest @itwin/imodel-transformer version for your iTwin.js version in the README"
   ],
   "peerDependencies": {
-    "@itwin/core-backend": "3.6.0 - 4.0.999",
-    "@itwin/core-bentley": "3.6.0 - 4.0.999",
-    "@itwin/core-common": "3.6.0 - 4.0.999",
-    "@itwin/core-geometry": "3.6.0 - 4.0.999",
-    "@itwin/core-quantity": "3.6.0 - 4.0.999",
-    "@itwin/ecschema-metadata": "3.6.0 - 4.0.999"
+    "@itwin/core-backend": "^3.6.0 || ^4.0.0",
+    "@itwin/core-bentley": "^3.6.0 || ^4.0.0",
+    "@itwin/core-common": "^3.6.0 || ^4.0.0",
+    "@itwin/core-geometry": "^3.6.0 || ^4.0.0",
+    "@itwin/core-quantity": "^3.6.0 || ^4.0.0",
+    "@itwin/ecschema-metadata": "^3.6.0 || ^4.0.0"
   },
   "//devDependencies": [
     "NOTE: All peerDependencies should also be listed as devDependencies since peerDependencies are not considered by npm install",
@@ -66,13 +66,13 @@
   ],
   "devDependencies": {
     "@itwin/build-tools": "4.0.0-dev.86",
-    "@itwin/core-backend": "3.6.0 - 4.0.999",
-    "@itwin/core-bentley": "3.6.0 - 4.0.999",
-    "@itwin/core-common": "3.6.0 - 4.0.999",
-    "@itwin/core-geometry": "3.6.0 - 4.0.999",
-    "@itwin/core-quantity": "3.6.0 - 4.0.999",
-    "@itwin/ecschema-metadata": "3.6.0 - 4.0.999",
-    "@itwin/eslint-plugin": "3.6.0 - 4.0.999",
+    "@itwin/core-backend": "^3.6.0 || ^4.0.0",
+    "@itwin/core-bentley": "^3.6.0 || ^4.0.0",
+    "@itwin/core-common": "^3.6.0 || ^4.0.0",
+    "@itwin/core-geometry": "^3.6.0 || ^4.0.0",
+    "@itwin/core-quantity": "^3.6.0 || ^4.0.0",
+    "@itwin/ecschema-metadata": "^3.6.0 || ^4.0.0",
+    "@itwin/eslint-plugin": "^3.6.0 || ^4.0.0",
     "@types/chai": "4.3.1",
     "@types/chai-as-promised": "^7.1.5",
     "@types/mocha": "^8.2.3",

package/lib/cjs/Algo.d.ts

@@ -1,7 +0,0 @@
-/** given a discrete inclusive range [start, end] e.g. [-10, 12] and several "skipped" values", e.g.
- * (-10, 1, -3, 5, 15), return the ordered set of subranges of the original range that exclude
- * those values
- */
-export declare function rangesFromRangeAndSkipped(start: number, end: number, skipped: number[]): [number, number][];
-export declare function renderRanges(ranges: [number, number][]): number[];
-//# sourceMappingURL=Algo.d.ts.map

package/lib/cjs/Algo.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"Algo.d.ts","sourceRoot":"","sources":["../../src/Algo.ts"],"names":[],"mappings":"AAMA;;;GAGG;AACH,wBAAgB,yBAAyB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAiC3G;AAED,wBAAgB,YAAY,CAAC,MAAM,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,GAAG,MAAM,EAAE,CAMjE"}

package/lib/cjs/Algo.js

@@ -1,50 +0,0 @@
-"use strict";
-/*---------------------------------------------------------------------------------------------
-* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
-* See LICENSE.md in the project root for license terms and full copyright notice.
-*--------------------------------------------------------------------------------------------*/
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.renderRanges = exports.rangesFromRangeAndSkipped = void 0;
-// FIXME: tests
-/** given a discrete inclusive range [start, end] e.g. [-10, 12] and several "skipped" values", e.g.
- * (-10, 1, -3, 5, 15), return the ordered set of subranges of the original range that exclude
- * those values
- */
-function rangesFromRangeAndSkipped(start, end, skipped) {
-    function validRange(range) {
-        return range[0] <= range[1];
-    }
-    const firstRange = [start, end];
-    if (!validRange(firstRange))
-        throw RangeError(`invalid range: [${start}, ${end}]`);
-    const ranges = [firstRange];
-    function findRangeContaining(pt, inRanges) {
-        // TODO: binary search
-        return inRanges.findIndex((r) => (pt >= r[0] && pt <= r[1]));
-    }
-    for (const skip of skipped) {
-        const rangeIndex = findRangeContaining(skip, ranges);
-        if (rangeIndex === -1)
-            continue;
-        const range = ranges[rangeIndex];
-        const leftRange = [range[0], skip - 1];
-        const rightRange = [skip + 1, range[1]];
-        if (validRange(leftRange) && validRange(rightRange))
-            ranges.splice(rangeIndex, 1, leftRange, rightRange);
-        else if (validRange(leftRange))
-            ranges.splice(rangeIndex, 1, leftRange);
-        else if (validRange(rightRange))
-            ranges.splice(rangeIndex, 1, rightRange);
-    }
-    return ranges;
-}
-exports.rangesFromRangeAndSkipped = rangesFromRangeAndSkipped;
-function renderRanges(ranges) {
-    const result = [];
-    for (const range of ranges)
-        for (let i = range[0]; i <= range[1]; ++i)
-            result.push(i);
-    return result;
-}
-exports.renderRanges = renderRanges;
-//# sourceMappingURL=Algo.js.map

package/lib/cjs/Algo.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Algo.js","sourceRoot":"","sources":["../../src/Algo.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F,eAAe;AACf;;;GAGG;AACH,SAAgB,yBAAyB,CAAC,KAAa,EAAE,GAAW,EAAE,OAAiB;IACrF,SAAS,UAAU,CAAC,KAAsB;QACxC,OAAO,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC;IAED,MAAM,UAAU,GAAG,CAAC,KAAK,EAAE,GAAG,CAAqB,CAAC;IAEpD,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC;QACzB,MAAM,UAAU,CAAC,mBAAmB,KAAK,KAAK,GAAG,GAAG,CAAC,CAAC;IAExD,MAAM,MAAM,GAAG,CAAC,UAAU,CAAC,CAAC;IAE5B,SAAS,mBAAmB,CAAC,EAAU,EAAE,QAA4B;QACnE,sBAAsB;QACtB,OAAO,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/D,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE;QAC1B,MAAM,UAAU,GAAG,mBAAmB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACrD,IAAI,UAAU,KAAK,CAAC,CAAC;YACnB,SAAS;QACX,MAAM,KAAK,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;QACjC,MAAM,SAAS,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAqB,CAAC;QAC3D,MAAM,UAAU,GAAG,CAAC,IAAI,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAqB,CAAC;QAC5D,IAAI,UAAU,CAAC,SAAS,CAAC,IAAI,UAAU,CAAC,UAAU,CAAC;YACjD,MAAM,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;aACjD,IAAI,UAAU,CAAC,SAAS,CAAC;YAC5B,MAAM,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;aACrC,IAAI,UAAU,CAAC,UAAU,CAAC;YAC7B,MAAM,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;KAC5C;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAjCD,8DAiCC;AAED,SAAgB,YAAY,CAAC,MAA0B;IACrD,MAAM,MAAM,GAAG,EAAE,CAAC;IAClB,KAAK,MAAM,KAAK,IAAI,MAAM;QACxB,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;YACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnB,OAAO,MAAM,CAAC;AAChB,CAAC;AAND,oCAMC","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\n// FIXME: tests\n/** given a discrete inclusive range [start, end] e.g. [-10, 12] and several \"skipped\" values\", e.g.\n * (-10, 1, -3, 5, 15), return the ordered set of subranges of the original range that exclude\n * those values\n */\nexport function rangesFromRangeAndSkipped(start: number, end: number, skipped: number[]): [number, number][] {\n  function validRange(range: [number,number]): boolean {\n    return range[0] <= range[1];\n  }\n\n  const firstRange = [start, end] as [number, number];\n\n  if (!validRange(firstRange))\n    throw RangeError(`invalid range: [${start}, ${end}]`);\n\n  const ranges = [firstRange];\n\n  function findRangeContaining(pt: number, inRanges: [number, number][]): number {\n    // TODO: binary search\n    return inRanges.findIndex((r) => (pt >= r[0] && pt <= r[1]));\n  }\n\n  for (const skip of skipped) {\n    const rangeIndex = findRangeContaining(skip, ranges);\n    if (rangeIndex === -1)\n      continue;\n    const range = ranges[rangeIndex];\n    const leftRange = [range[0], skip - 1] as [number, number];\n    const rightRange = [skip + 1, range[1]] as [number, number];\n    if (validRange(leftRange) && validRange(rightRange))\n      ranges.splice(rangeIndex, 1, leftRange, rightRange);\n    else if (validRange(leftRange))\n      ranges.splice(rangeIndex, 1, leftRange);\n    else if (validRange(rightRange))\n      ranges.splice(rangeIndex, 1, rightRange);\n  }\n\n  return ranges;\n}\n\nexport function renderRanges(ranges: [number, number][]): number[] {\n  const result = [];\n  for (const range of ranges)\n    for (let i = range[0]; i <= range[1]; ++i)\n      result.push(i);\n  return result;\n}\n\n"]}