Huge News!Announcing our $40M Series B led by Abstract Ventures.Learn More
Socket
Sign inDemoInstall
Socket

@itwin/core-bentley

Package Overview
Dependencies
Maintainers
0
Versions
973
Alerts
File Explorer

Advanced tools

Socket logo

Install Socket

Detect and block malicious and high-risk dependencies

Install

@itwin/core-bentley - npm Package Compare versions

Comparing version 4.10.0-dev.31 to 4.10.0-dev.32

3

lib/cjs/Assert.js

@@ -10,3 +10,3 @@ "use strict";

Object.defineProperty(exports, "__esModule", { value: true });
exports.assert = void 0;
exports.assert = assert;
const assertionsEnabled = process.env.NODE_ENV === "development";

@@ -46,3 +46,2 @@ /** Asserts that a condition is `true` and - when enabled - throws an error if it is not.

}
exports.assert = assert;
//# sourceMappingURL=Assert.js.map

@@ -10,3 +10,4 @@ "use strict";

Object.defineProperty(exports, "__esModule", { value: true });
exports.isSubclassOf = exports.isProperSubclassOf = void 0;
exports.isProperSubclassOf = isProperSubclassOf;
exports.isSubclassOf = isSubclassOf;
/** Check if class `subclass` is a different class from `superclass` but extends from `superclass`

@@ -22,3 +23,2 @@ * @param subclass the class that may be a subclass of `superclass`

}
exports.isProperSubclassOf = isProperSubclassOf;
/** Check if class `subclass` is `superclass` or extends from `superclass`

@@ -34,3 +34,2 @@ * @param subclass the class that may be a subclass of `superclass`.

}
exports.isSubclassOf = isSubclassOf;
//# sourceMappingURL=ClassUtils.js.map

@@ -10,3 +10,11 @@ "use strict";

Object.defineProperty(exports, "__esModule", { value: true });
exports.areEqualPossiblyUndefined = exports.compareBooleansOrUndefined = exports.compareNumbersOrUndefined = exports.compareStringsOrUndefined = exports.comparePossiblyUndefined = exports.compareStrings = exports.compareBooleans = exports.compareNumbers = exports.compareWithTolerance = void 0;
exports.compareWithTolerance = compareWithTolerance;
exports.compareNumbers = compareNumbers;
exports.compareBooleans = compareBooleans;
exports.compareStrings = compareStrings;
exports.comparePossiblyUndefined = comparePossiblyUndefined;
exports.compareStringsOrUndefined = compareStringsOrUndefined;
exports.compareNumbersOrUndefined = compareNumbersOrUndefined;
exports.compareBooleansOrUndefined = compareBooleansOrUndefined;
exports.areEqualPossiblyUndefined = areEqualPossiblyUndefined;
/**

@@ -24,3 +32,2 @@ * An [[OrderedComparator]] for numbers that treats two numbers as equal if the absolute value of their difference is less than a specified tolerance.

}
exports.compareWithTolerance = compareWithTolerance;
/** @public */

@@ -30,3 +37,2 @@ function compareNumbers(a, b) {

}
exports.compareNumbers = compareNumbers;
/** @public */

@@ -36,3 +42,2 @@ function compareBooleans(a, b) {

}
exports.compareBooleans = compareBooleans;
/** @public */

@@ -42,3 +47,2 @@ function compareStrings(a, b) {

}
exports.compareStrings = compareStrings;
/** @public */

@@ -53,3 +57,2 @@ function comparePossiblyUndefined(compareDefined, lhs, rhs) {

}
exports.comparePossiblyUndefined = comparePossiblyUndefined;
/** @public */

@@ -59,3 +62,2 @@ function compareStringsOrUndefined(lhs, rhs) {

}
exports.compareStringsOrUndefined = compareStringsOrUndefined;
/** @public */

@@ -65,3 +67,2 @@ function compareNumbersOrUndefined(lhs, rhs) {

}
exports.compareNumbersOrUndefined = compareNumbersOrUndefined;
/** @public */

@@ -71,3 +72,2 @@ function compareBooleansOrUndefined(lhs, rhs) {

}
exports.compareBooleansOrUndefined = compareBooleansOrUndefined;
/** Compare two possibly-undefined values for equality. If both are undefined, the comparison is performed by the supplied `areEqual` function.

@@ -84,3 +84,2 @@ * @public

}
exports.areEqualPossiblyUndefined = areEqualPossiblyUndefined;
//# sourceMappingURL=Compare.js.map

@@ -119,3 +119,3 @@ /** @packageDocumentation

/** Obtain an iterator over the Ids in this set. The Ids are returned in ascending order based on their unsigned 64-bit integer values. */
[Symbol.iterator](): Iterator<string, any, undefined>;
[Symbol.iterator](): Iterator<string, any, any>;
/** Compute a compact string representation of the union of this and another set of Ids - i.e., those Ids present in either this and/or the other set. */

@@ -122,0 +122,0 @@ computeUnion(ids: OrderedId64Iterable | CompressedId64Set | MutableCompressedId64Set): CompressedId64Set;

@@ -10,3 +10,7 @@ "use strict";

Object.defineProperty(exports, "__esModule", { value: true });
exports.DisposableList = exports.using = exports.disposeArray = exports.dispose = exports.isIDisposable = void 0;
exports.DisposableList = void 0;
exports.isIDisposable = isIDisposable;
exports.dispose = dispose;
exports.disposeArray = disposeArray;
exports.using = using;
/**

@@ -20,3 +24,2 @@ * A type guard that checks whether the given argument implements `IDisposable` interface

}
exports.isIDisposable = isIDisposable;
/** Convenience function for disposing of a disposable object that may be undefined.

@@ -45,3 +48,2 @@ * This is primarily used to simplify implementations of [[IDisposable.dispose]].

}
exports.dispose = dispose;
/** Disposes of and empties a list of disposable objects.

@@ -60,3 +62,2 @@ * @param list The list of disposable objects.

}
exports.disposeArray = disposeArray;
/** A 'using' function which is a substitution for .NET's using statement. It makes sure that 'dispose'

@@ -86,3 +87,2 @@ * is called on the resource no matter if the func returns or throws. If func returns, the return value

}
exports.using = using;
class FuncDisposable {

@@ -89,0 +89,0 @@ constructor(disposeFunc) { this._disposeFunc = disposeFunc; }

@@ -311,3 +311,3 @@ "use strict";

function getFirst(arg) {
return typeof arg === "string" ? arg : (Array.isArray(arg) ? arg[0] : arg.values().next().value);
return typeof arg === "string" ? arg : (Array.isArray(arg) ? arg[0] : arg.values().next().value) ?? Id64.invalid;
}

@@ -314,0 +314,0 @@ Id64.getFirst = getFirst;

@@ -10,3 +10,3 @@ "use strict";

Object.defineProperty(exports, "__esModule", { value: true });
exports.partitionArray = void 0;
exports.partitionArray = partitionArray;
/** Partitions an array in-place according to some criterion, such that elements that fulfill the criterion are grouped in the lower

@@ -44,3 +44,2 @@ * portion of the array, and those that fail to fulfill the criterion are grouped in the upper portion of the array.

}
exports.partitionArray = partitionArray;
//# sourceMappingURL=partitionArray.js.map

@@ -10,3 +10,5 @@ "use strict";

Object.defineProperty(exports, "__esModule", { value: true });
exports.SortedArray = exports.ReadonlySortedArray = exports.DuplicatePolicy = exports.lowerBound = exports.shallowClone = void 0;
exports.SortedArray = exports.ReadonlySortedArray = exports.DuplicatePolicy = void 0;
exports.shallowClone = shallowClone;
exports.lowerBound = lowerBound;
/**

@@ -22,3 +24,2 @@ * A [[CloneFunction]] that, given a value of type T, returns the same value.

}
exports.shallowClone = shallowClone;
/**

@@ -35,3 +36,2 @@ * Given a sorted array, computes the position at which the specified value should be inserted into the array so that the array remains sorted.

}
exports.lowerBound = lowerBound;
function lowerBoundOfEquivalent(list, criterion) {

@@ -38,0 +38,0 @@ let low = 0;

@@ -10,3 +10,4 @@ "use strict";

Object.defineProperty(exports, "__esModule", { value: true });
exports.base64StringToUint8Array = exports.utf8ToString = void 0;
exports.utf8ToString = utf8ToString;
exports.base64StringToUint8Array = base64StringToUint8Array;
/** Given an array of bytes containing a utf-8 string, convert to a string.

@@ -23,3 +24,2 @@ * @param utf8: An array of utf-8 characters as a byte array

}
exports.utf8ToString = utf8ToString;
/** Given a base-64-encoded string, decode it into an array of bytes.

@@ -34,3 +34,2 @@ * @param base64 The base-64-encoded string.

}
exports.base64StringToUint8Array = base64StringToUint8Array;
//# sourceMappingURL=StringUtils.js.map
/** @packageDocumentation
* @module Errors
*/
/// <reference types="node" />
/** A function to be notified when an unexpected error happens

@@ -6,0 +5,0 @@ * @public

@@ -10,3 +10,5 @@ "use strict";

Object.defineProperty(exports, "__esModule", { value: true });
exports.omit = exports.asInstanceOf = exports.isInstanceOf = void 0;
exports.isInstanceOf = isInstanceOf;
exports.asInstanceOf = asInstanceOf;
exports.omit = omit;
/** Returns true if `obj` is an object of class `T`.

@@ -19,3 +21,2 @@ * @see [[asInstanceOf]] to cast `obj` to class `T`.

}
exports.isInstanceOf = isInstanceOf;
/** Cast `obj` to an instance of class `T`, or return undefined if `obj` is not an instance of class `T`.

@@ -28,3 +29,2 @@ * @see [[isInstanceOf]] to query whether `obj` is of class `T`.

}
exports.asInstanceOf = asInstanceOf;
/** A runtime property omitter, makes a shallow copy of the given object without the specified properties

@@ -43,3 +43,2 @@ * Compatible with the typescript `Omit` mapped type:

}
exports.omit = omit;
//# sourceMappingURL=UtilityTypes.js.map

@@ -119,3 +119,3 @@ /** @packageDocumentation

/** Obtain an iterator over the Ids in this set. The Ids are returned in ascending order based on their unsigned 64-bit integer values. */
[Symbol.iterator](): Iterator<string, any, undefined>;
[Symbol.iterator](): Iterator<string, any, any>;
/** Compute a compact string representation of the union of this and another set of Ids - i.e., those Ids present in either this and/or the other set. */

@@ -122,0 +122,0 @@ computeUnion(ids: OrderedId64Iterable | CompressedId64Set | MutableCompressedId64Set): CompressedId64Set;

@@ -308,3 +308,3 @@ /*---------------------------------------------------------------------------------------------

function getFirst(arg) {
return typeof arg === "string" ? arg : (Array.isArray(arg) ? arg[0] : arg.values().next().value);
return typeof arg === "string" ? arg : (Array.isArray(arg) ? arg[0] : arg.values().next().value) ?? Id64.invalid;
}

@@ -311,0 +311,0 @@ Id64.getFirst = getFirst;

/** @packageDocumentation
* @module Errors
*/
/// <reference types="node" />
/** A function to be notified when an unexpected error happens

@@ -6,0 +5,0 @@ * @public

{
"name": "@itwin/core-bentley",
"version": "4.10.0-dev.31",
"version": "4.10.0-dev.32",
"description": "Bentley JavaScript core components",

@@ -31,5 +31,5 @@ "main": "lib/cjs/core-bentley.js",

"rimraf": "^3.0.2",
"typescript": "~5.3.3",
"typescript": "~5.6.2",
"vitest": "^2.1.0",
"@itwin/build-tools": "4.10.0-dev.31"
"@itwin/build-tools": "4.10.0-dev.32"
},

@@ -36,0 +36,0 @@ "nyc": {

Sorry, the diff of this file is not supported yet

Sorry, the diff of this file is not supported yet

Sorry, the diff of this file is not supported yet

Sorry, the diff of this file is not supported yet

Sorry, the diff of this file is not supported yet

Sorry, the diff of this file is not supported yet

Sorry, the diff of this file is not supported yet

Sorry, the diff of this file is not supported yet

Sorry, the diff of this file is not supported yet

Sorry, the diff of this file is not supported yet

Sorry, the diff of this file is not supported yet

Sorry, the diff of this file is not supported yet

Sorry, the diff of this file is not supported yet

Sorry, the diff of this file is not supported yet

SocketSocket SOC 2 Logo

Product

  • Package Alerts
  • Integrations
  • Docs
  • Pricing
  • FAQ
  • Roadmap
  • Changelog

Packages

npm

Stay in touch

Get open source security insights delivered straight into your inbox.


  • Terms
  • Privacy
  • Security

Made with ⚡️ by Socket Inc