@itwin/core-bentley 4.0.0-dev.52 → 4.0.0-dev.55

package/lib/cjs/IndexMap.d.ts

@@ -1,66 +1,66 @@
-/** @packageDocumentation
- * @module Collections
- */
-import { OrderedComparator } from "./Compare";
-import { CloneFunction } from "./SortedArray";
-/** Associates a value of type T with an index representing its insertion order in an IndexMap<T>
- * @public
- */
-export declare class IndexedValue<T> {
-    readonly value: T;
-    readonly index: number;
-    constructor(value: T, index: number);
-}
-/**
- * Maintains a set of unique elements in sorted order and retains the insertion order of each.
- * The uniqueness of the elements is determined by a comparison routine supplied by the user.
- * The user may also supply a maximum size, beyond which insertions will fail.
- * @public
- */
-export declare class IndexMap<T> {
-    protected _array: Array<IndexedValue<T>>;
-    protected readonly _compareValues: OrderedComparator<T>;
-    protected readonly _clone: CloneFunction<T>;
-    protected readonly _maximumSize: number;
-    /**
-     * Construct a new IndexMap<T>.
-     * @param compare The function used to compare elements within the map.
-     * @param maximumSize The maximum number of elements permitted in the IndexMap. The maximum index of an element is maximumSize-1.
-     * @param clone The function invoked to clone a new element for insertion into the array. The default implementation simply returns its input.
-     */
-    constructor(compare: OrderedComparator<T>, maximumSize?: number, clone?: CloneFunction<T>);
-    /** The number of elements in the map. */
-    get length(): number;
-    /** Returns true if the maximum number of elements have been inserted. */
-    get isFull(): boolean;
-    /** Returns true if the map contains no elements. */
-    get isEmpty(): boolean;
-    /** Removes all elements from the map. */
-    clear(): void;
-    /** Attempt to insert a new value into the map.
-     * If an equivalent element already exists in the map, the corresponding index is returned.
-     * If the map is full, nothing is inserted and -1 is returned.
-     * Otherwise:
-     *  The new element is mapped to the next-available index (that is, the length of the map prior to insertion of this new element);
-     *  the value is cloned using the function supplied to the IndexMap constructor;
-     *  the cloned result is inserted into the map; and
-     *  the index of the new element is returned.
-     * @param value The value to insert
-     * @param onInsert The optional callback method to call if insertion occurs with the inserted value
-     * @returns the index of the equivalent element in the map, or -1 if the map is full and no equivalent element exists.
-     */
-    insert(value: T, onInsert?: (value: T) => any): number;
-    /**
-     * Finds the index of an element equivalent to the supplied value.
-     * @param value the value to find
-     * @returns the index of an equivalent element in the map, or -1 if no such element exists.
-     */
-    indexOf(value: T): number;
-    protected lowerBound(value: T): {
-        index: number;
-        equal: boolean;
-    };
-    /** Return an array of the elements in this map in which the array index of each element corresponds to the index assigned to it by the map. */
-    toArray(): T[];
-}
+/** @packageDocumentation
+ * @module Collections
+ */
+import { OrderedComparator } from "./Compare";
+import { CloneFunction } from "./SortedArray";
+/** Associates a value of type T with an index representing its insertion order in an IndexMap<T>
+ * @public
+ */
+export declare class IndexedValue<T> {
+    readonly value: T;
+    readonly index: number;
+    constructor(value: T, index: number);
+}
+/**
+ * Maintains a set of unique elements in sorted order and retains the insertion order of each.
+ * The uniqueness of the elements is determined by a comparison routine supplied by the user.
+ * The user may also supply a maximum size, beyond which insertions will fail.
+ * @public
+ */
+export declare class IndexMap<T> {
+    protected _array: Array<IndexedValue<T>>;
+    protected readonly _compareValues: OrderedComparator<T>;
+    protected readonly _clone: CloneFunction<T>;
+    protected readonly _maximumSize: number;
+    /**
+     * Construct a new IndexMap<T>.
+     * @param compare The function used to compare elements within the map.
+     * @param maximumSize The maximum number of elements permitted in the IndexMap. The maximum index of an element is maximumSize-1.
+     * @param clone The function invoked to clone a new element for insertion into the array. The default implementation simply returns its input.
+     */
+    constructor(compare: OrderedComparator<T>, maximumSize?: number, clone?: CloneFunction<T>);
+    /** The number of elements in the map. */
+    get length(): number;
+    /** Returns true if the maximum number of elements have been inserted. */
+    get isFull(): boolean;
+    /** Returns true if the map contains no elements. */
+    get isEmpty(): boolean;
+    /** Removes all elements from the map. */
+    clear(): void;
+    /** Attempt to insert a new value into the map.
+     * If an equivalent element already exists in the map, the corresponding index is returned.
+     * If the map is full, nothing is inserted and -1 is returned.
+     * Otherwise:
+     *  The new element is mapped to the next-available index (that is, the length of the map prior to insertion of this new element);
+     *  the value is cloned using the function supplied to the IndexMap constructor;
+     *  the cloned result is inserted into the map; and
+     *  the index of the new element is returned.
+     * @param value The value to insert
+     * @param onInsert The optional callback method to call if insertion occurs with the inserted value
+     * @returns the index of the equivalent element in the map, or -1 if the map is full and no equivalent element exists.
+     */
+    insert(value: T, onInsert?: (value: T) => any): number;
+    /**
+     * Finds the index of an element equivalent to the supplied value.
+     * @param value the value to find
+     * @returns the index of an equivalent element in the map, or -1 if no such element exists.
+     */
+    indexOf(value: T): number;
+    protected lowerBound(value: T): {
+        index: number;
+        equal: boolean;
+    };
+    /** Return an array of the elements in this map in which the array index of each element corresponds to the index assigned to it by the map. */
+    toArray(): T[];
+}
 //# sourceMappingURL=IndexMap.d.ts.map

package/lib/cjs/IndexMap.js

@@ -1,92 +1,92 @@
-"use strict";
-/*---------------------------------------------------------------------------------------------
-* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
-* See LICENSE.md in the project root for license terms and full copyright notice.
-*--------------------------------------------------------------------------------------------*/
-/** @packageDocumentation
- * @module Collections
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.IndexMap = exports.IndexedValue = void 0;
-const SortedArray_1 = require("./SortedArray");
-/** Associates a value of type T with an index representing its insertion order in an IndexMap<T>
- * @public
- */
-class IndexedValue {
-    constructor(value, index) {
-        this.value = value;
-        this.index = index;
-    }
-}
-exports.IndexedValue = IndexedValue;
-/**
- * Maintains a set of unique elements in sorted order and retains the insertion order of each.
- * The uniqueness of the elements is determined by a comparison routine supplied by the user.
- * The user may also supply a maximum size, beyond which insertions will fail.
- * @public
- */
-class IndexMap {
-    /**
-     * Construct a new IndexMap<T>.
-     * @param compare The function used to compare elements within the map.
-     * @param maximumSize The maximum number of elements permitted in the IndexMap. The maximum index of an element is maximumSize-1.
-     * @param clone The function invoked to clone a new element for insertion into the array. The default implementation simply returns its input.
-     */
-    constructor(compare, maximumSize = Number.MAX_SAFE_INTEGER, clone = SortedArray_1.shallowClone) {
-        this._array = [];
-        this._compareValues = compare;
-        this._clone = clone;
-        this._maximumSize = maximumSize;
-    }
-    /** The number of elements in the map. */
-    get length() { return this._array.length; }
-    /** Returns true if the maximum number of elements have been inserted. */
-    get isFull() { return this.length >= this._maximumSize; }
-    /** Returns true if the map contains no elements. */
-    get isEmpty() { return 0 === this.length; }
-    /** Removes all elements from the map. */
-    clear() { this._array = []; }
-    /** Attempt to insert a new value into the map.
-     * If an equivalent element already exists in the map, the corresponding index is returned.
-     * If the map is full, nothing is inserted and -1 is returned.
-     * Otherwise:
-     *  The new element is mapped to the next-available index (that is, the length of the map prior to insertion of this new element);
-     *  the value is cloned using the function supplied to the IndexMap constructor;
-     *  the cloned result is inserted into the map; and
-     *  the index of the new element is returned.
-     * @param value The value to insert
-     * @param onInsert The optional callback method to call if insertion occurs with the inserted value
-     * @returns the index of the equivalent element in the map, or -1 if the map is full and no equivalent element exists.
-     */
-    insert(value, onInsert) {
-        const bound = this.lowerBound(value);
-        if (bound.equal)
-            return this._array[bound.index].index;
-        else if (this.isFull)
-            return -1;
-        const entry = new IndexedValue(this._clone(value), this._array.length);
-        if (undefined !== onInsert)
-            onInsert(entry.value);
-        this._array.splice(bound.index, 0, entry);
-        return entry.index;
-    }
-    /**
-     * Finds the index of an element equivalent to the supplied value.
-     * @param value the value to find
-     * @returns the index of an equivalent element in the map, or -1 if no such element exists.
-     */
-    indexOf(value) {
-        const bound = this.lowerBound(value);
-        return bound.equal ? this._array[bound.index].index : -1;
-    }
-    lowerBound(value) { return (0, SortedArray_1.lowerBound)(value, this._array, (lhs, rhs) => this._compareValues(lhs, rhs.value)); }
-    /** Return an array of the elements in this map in which the array index of each element corresponds to the index assigned to it by the map. */
-    toArray() {
-        const array = [];
-        for (const entry of this._array)
-            array[entry.index] = entry.value;
-        return array;
-    }
-}
-exports.IndexMap = IndexMap;
+"use strict";
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Collections
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.IndexMap = exports.IndexedValue = void 0;
+const SortedArray_1 = require("./SortedArray");
+/** Associates a value of type T with an index representing its insertion order in an IndexMap<T>
+ * @public
+ */
+class IndexedValue {
+    constructor(value, index) {
+        this.value = value;
+        this.index = index;
+    }
+}
+exports.IndexedValue = IndexedValue;
+/**
+ * Maintains a set of unique elements in sorted order and retains the insertion order of each.
+ * The uniqueness of the elements is determined by a comparison routine supplied by the user.
+ * The user may also supply a maximum size, beyond which insertions will fail.
+ * @public
+ */
+class IndexMap {
+    /**
+     * Construct a new IndexMap<T>.
+     * @param compare The function used to compare elements within the map.
+     * @param maximumSize The maximum number of elements permitted in the IndexMap. The maximum index of an element is maximumSize-1.
+     * @param clone The function invoked to clone a new element for insertion into the array. The default implementation simply returns its input.
+     */
+    constructor(compare, maximumSize = Number.MAX_SAFE_INTEGER, clone = SortedArray_1.shallowClone) {
+        this._array = [];
+        this._compareValues = compare;
+        this._clone = clone;
+        this._maximumSize = maximumSize;
+    }
+    /** The number of elements in the map. */
+    get length() { return this._array.length; }
+    /** Returns true if the maximum number of elements have been inserted. */
+    get isFull() { return this.length >= this._maximumSize; }
+    /** Returns true if the map contains no elements. */
+    get isEmpty() { return 0 === this.length; }
+    /** Removes all elements from the map. */
+    clear() { this._array = []; }
+    /** Attempt to insert a new value into the map.
+     * If an equivalent element already exists in the map, the corresponding index is returned.
+     * If the map is full, nothing is inserted and -1 is returned.
+     * Otherwise:
+     *  The new element is mapped to the next-available index (that is, the length of the map prior to insertion of this new element);
+     *  the value is cloned using the function supplied to the IndexMap constructor;
+     *  the cloned result is inserted into the map; and
+     *  the index of the new element is returned.
+     * @param value The value to insert
+     * @param onInsert The optional callback method to call if insertion occurs with the inserted value
+     * @returns the index of the equivalent element in the map, or -1 if the map is full and no equivalent element exists.
+     */
+    insert(value, onInsert) {
+        const bound = this.lowerBound(value);
+        if (bound.equal)
+            return this._array[bound.index].index;
+        else if (this.isFull)
+            return -1;
+        const entry = new IndexedValue(this._clone(value), this._array.length);
+        if (undefined !== onInsert)
+            onInsert(entry.value);
+        this._array.splice(bound.index, 0, entry);
+        return entry.index;
+    }
+    /**
+     * Finds the index of an element equivalent to the supplied value.
+     * @param value the value to find
+     * @returns the index of an equivalent element in the map, or -1 if no such element exists.
+     */
+    indexOf(value) {
+        const bound = this.lowerBound(value);
+        return bound.equal ? this._array[bound.index].index : -1;
+    }
+    lowerBound(value) { return (0, SortedArray_1.lowerBound)(value, this._array, (lhs, rhs) => this._compareValues(lhs, rhs.value)); }
+    /** Return an array of the elements in this map in which the array index of each element corresponds to the index assigned to it by the map. */
+    toArray() {
+        const array = [];
+        for (const entry of this._array)
+            array[entry.index] = entry.value;
+        return array;
+    }
+}
+exports.IndexMap = IndexMap;
 //# sourceMappingURL=IndexMap.js.map

package/lib/cjs/JsonSchema.d.ts

@@ -1,78 +1,78 @@
-/** @packageDocumentation
- * @module Json
- */
-/** @public */
-export declare type JSONSchemaTypeName = "string" | "number" | "integer" | "boolean" | "null" | "array" | "object";
-/** @public */
-export declare type JSONSchemaType = string | number | boolean | object | JSONSchemaType[];
-/** @public */
-export interface JSONSchema {
-    id?: string;
-    $id?: string;
-    $schema?: string;
-    type?: JSONSchemaTypeName | JSONSchemaTypeName[];
-    title?: string;
-    default?: JSONSchemaType;
-    definitions?: JSONSchemaMap;
-    description?: string;
-    properties?: JSONSchemaMap;
-    patternProperties?: JSONSchemaMap;
-    additionalProperties?: boolean | JSONSchema;
-    minProperties?: number;
-    maxProperties?: number;
-    dependencies?: JSONSchemaMap | {
-        [prop: string]: string[];
-    };
-    items?: JSONSchema | JSONSchema[];
-    minItems?: number;
-    maxItems?: number;
-    uniqueItems?: boolean;
-    additionalItems?: boolean | JSONSchema;
-    pattern?: string;
-    minLength?: number;
-    maxLength?: number;
-    minimum?: number;
-    maximum?: number;
-    exclusiveMinimum?: boolean | number;
-    exclusiveMaximum?: boolean | number;
-    multipleOf?: number;
-    required?: string[];
-    $ref?: string;
-    anyOf?: JSONSchema[];
-    allOf?: JSONSchema[];
-    oneOf?: JSONSchema[];
-    not?: JSONSchema;
-    enum?: JSONSchemaType[];
-    format?: string;
-    const?: any;
-    contains?: JSONSchema;
-    propertyNames?: JSONSchema;
-    $comment?: string;
-    if?: JSONSchema;
-    then?: JSONSchema;
-    else?: JSONSchema;
-    defaultSnippets?: JSONSchemaSnippet[];
-    errorMessage?: string;
-    patternErrorMessage?: string;
-    deprecationMessage?: string;
-    markdownDeprecationMessage?: string;
-    enumDescriptions?: string[];
-    markdownEnumDescriptions?: string[];
-    markdownDescription?: string;
-    doNotSuggest?: boolean;
-    suggestSortText?: string;
-    allowComments?: boolean;
-    allowTrailingCommas?: boolean;
-}
-/** @public */
-export interface JSONSchemaMap {
-    [name: string]: JSONSchema;
-}
-/** @public */
-export interface JSONSchemaSnippet {
-    label?: string;
-    description?: string;
-    body?: any;
-    bodyText?: string;
-}
+/** @packageDocumentation
+ * @module Json
+ */
+/** @public */
+export type JSONSchemaTypeName = "string" | "number" | "integer" | "boolean" | "null" | "array" | "object";
+/** @public */
+export type JSONSchemaType = string | number | boolean | object | JSONSchemaType[];
+/** @public */
+export interface JSONSchema {
+    id?: string;
+    $id?: string;
+    $schema?: string;
+    type?: JSONSchemaTypeName | JSONSchemaTypeName[];
+    title?: string;
+    default?: JSONSchemaType;
+    definitions?: JSONSchemaMap;
+    description?: string;
+    properties?: JSONSchemaMap;
+    patternProperties?: JSONSchemaMap;
+    additionalProperties?: boolean | JSONSchema;
+    minProperties?: number;
+    maxProperties?: number;
+    dependencies?: JSONSchemaMap | {
+        [prop: string]: string[];
+    };
+    items?: JSONSchema | JSONSchema[];
+    minItems?: number;
+    maxItems?: number;
+    uniqueItems?: boolean;
+    additionalItems?: boolean | JSONSchema;
+    pattern?: string;
+    minLength?: number;
+    maxLength?: number;
+    minimum?: number;
+    maximum?: number;
+    exclusiveMinimum?: boolean | number;
+    exclusiveMaximum?: boolean | number;
+    multipleOf?: number;
+    required?: string[];
+    $ref?: string;
+    anyOf?: JSONSchema[];
+    allOf?: JSONSchema[];
+    oneOf?: JSONSchema[];
+    not?: JSONSchema;
+    enum?: JSONSchemaType[];
+    format?: string;
+    const?: any;
+    contains?: JSONSchema;
+    propertyNames?: JSONSchema;
+    $comment?: string;
+    if?: JSONSchema;
+    then?: JSONSchema;
+    else?: JSONSchema;
+    defaultSnippets?: JSONSchemaSnippet[];
+    errorMessage?: string;
+    patternErrorMessage?: string;
+    deprecationMessage?: string;
+    markdownDeprecationMessage?: string;
+    enumDescriptions?: string[];
+    markdownEnumDescriptions?: string[];
+    markdownDescription?: string;
+    doNotSuggest?: boolean;
+    suggestSortText?: string;
+    allowComments?: boolean;
+    allowTrailingCommas?: boolean;
+}
+/** @public */
+export interface JSONSchemaMap {
+    [name: string]: JSONSchema;
+}
+/** @public */
+export interface JSONSchemaSnippet {
+    label?: string;
+    description?: string;
+    body?: any;
+    bodyText?: string;
+}
 //# sourceMappingURL=JsonSchema.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"JsonSchema.d.ts","sourceRoot":"","sources":["../../src/JsonSchema.ts"],"names":[],"mappings":"AAIA;;GAEG;AAIH,cAAc;AACd,oBAAY,kBAAkB,GAAG,QAAQ,GAAG,QAAQ,GAAG,SAAS,GAAG,SAAS,GAAG,MAAM,GAAG,OAAO,GAAG,QAAQ,CAAC;AAE3G,cAAc;AACd,oBAAY,cAAc,GAAG,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,MAAM,GAAG,cAAc,EAAE,CAAC;AAEnF,cAAc;AACd,MAAM,WAAW,UAAU;IACzB,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,IAAI,CAAC,EAAE,kBAAkB,GAAG,kBAAkB,EAAE,CAAC;IACjD,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,OAAO,CAAC,EAAE,cAAc,CAAC;IACzB,WAAW,CAAC,EAAE,aAAa,CAAC;IAC5B,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,UAAU,CAAC,EAAE,aAAa,CAAC;IAC3B,iBAAiB,CAAC,EAAE,aAAa,CAAC;IAClC,oBAAoB,CAAC,EAAE,OAAO,GAAG,UAAU,CAAC;IAC5C,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,YAAY,CAAC,EAAE,aAAa,GAAG;QAAE,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAAA;KAAE,CAAC;IAC5D,KAAK,CAAC,EAAE,UAAU,GAAG,UAAU,EAAE,CAAC;IAClC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB,eAAe,CAAC,EAAE,OAAO,GAAG,UAAU,CAAC;IACvC,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,gBAAgB,CAAC,EAAE,OAAO,GAAG,MAAM,CAAC;IACpC,gBAAgB,CAAC,EAAE,OAAO,GAAG,MAAM,CAAC;IACpC,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;IACpB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,UAAU,EAAE,CAAC;IACrB,KAAK,CAAC,EAAE,UAAU,EAAE,CAAC;IACrB,KAAK,CAAC,EAAE,UAAU,EAAE,CAAC;IACrB,GAAG,CAAC,EAAE,UAAU,CAAC;IACjB,IAAI,CAAC,EAAE,cAAc,EAAE,CAAC;IACxB,MAAM,CAAC,EAAE,MAAM,CAAC;IAGhB,KAAK,CAAC,EAAE,GAAG,CAAC;IACZ,QAAQ,CAAC,EAAE,UAAU,CAAC;IACtB,aAAa,CAAC,EAAE,UAAU,CAAC;IAG3B,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,EAAE,CAAC,EAAE,UAAU,CAAC;IAChB,IAAI,CAAC,EAAE,UAAU,CAAC;IAClB,IAAI,CAAC,EAAE,UAAU,CAAC;IAGlB,eAAe,CAAC,EAAE,iBAAiB,EAAE,CAAC;IACtC,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,0BAA0B,CAAC,EAAE,MAAM,CAAC;IACpC,gBAAgB,CAAC,EAAE,MAAM,EAAE,CAAC;IAC5B,wBAAwB,CAAC,EAAE,MAAM,EAAE,CAAC;IACpC,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,mBAAmB,CAAC,EAAE,OAAO,CAAC;CAC/B;AAED,cAAc;AACd,MAAM,WAAW,aAAa;IAC5B,CAAC,IAAI,EAAE,MAAM,GAAG,UAAU,CAAC;CAC5B;AAED,cAAc;AACd,MAAM,WAAW,iBAAiB;IAChC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,IAAI,CAAC,EAAE,GAAG,CAAC;IACX,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB"}
+{"version":3,"file":"JsonSchema.d.ts","sourceRoot":"","sources":["../../src/JsonSchema.ts"],"names":[],"mappings":"AAIA;;GAEG;AAIH,cAAc;AACd,MAAM,MAAM,kBAAkB,GAAG,QAAQ,GAAG,QAAQ,GAAG,SAAS,GAAG,SAAS,GAAG,MAAM,GAAG,OAAO,GAAG,QAAQ,CAAC;AAE3G,cAAc;AACd,MAAM,MAAM,cAAc,GAAG,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,MAAM,GAAG,cAAc,EAAE,CAAC;AAEnF,cAAc;AACd,MAAM,WAAW,UAAU;IACzB,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,IAAI,CAAC,EAAE,kBAAkB,GAAG,kBAAkB,EAAE,CAAC;IACjD,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,OAAO,CAAC,EAAE,cAAc,CAAC;IACzB,WAAW,CAAC,EAAE,aAAa,CAAC;IAC5B,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,UAAU,CAAC,EAAE,aAAa,CAAC;IAC3B,iBAAiB,CAAC,EAAE,aAAa,CAAC;IAClC,oBAAoB,CAAC,EAAE,OAAO,GAAG,UAAU,CAAC;IAC5C,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,YAAY,CAAC,EAAE,aAAa,GAAG;QAAE,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAAA;KAAE,CAAC;IAC5D,KAAK,CAAC,EAAE,UAAU,GAAG,UAAU,EAAE,CAAC;IAClC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB,eAAe,CAAC,EAAE,OAAO,GAAG,UAAU,CAAC;IACvC,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,gBAAgB,CAAC,EAAE,OAAO,GAAG,MAAM,CAAC;IACpC,gBAAgB,CAAC,EAAE,OAAO,GAAG,MAAM,CAAC;IACpC,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;IACpB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,UAAU,EAAE,CAAC;IACrB,KAAK,CAAC,EAAE,UAAU,EAAE,CAAC;IACrB,KAAK,CAAC,EAAE,UAAU,EAAE,CAAC;IACrB,GAAG,CAAC,EAAE,UAAU,CAAC;IACjB,IAAI,CAAC,EAAE,cAAc,EAAE,CAAC;IACxB,MAAM,CAAC,EAAE,MAAM,CAAC;IAGhB,KAAK,CAAC,EAAE,GAAG,CAAC;IACZ,QAAQ,CAAC,EAAE,UAAU,CAAC;IACtB,aAAa,CAAC,EAAE,UAAU,CAAC;IAG3B,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,EAAE,CAAC,EAAE,UAAU,CAAC;IAChB,IAAI,CAAC,EAAE,UAAU,CAAC;IAClB,IAAI,CAAC,EAAE,UAAU,CAAC;IAGlB,eAAe,CAAC,EAAE,iBAAiB,EAAE,CAAC;IACtC,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,0BAA0B,CAAC,EAAE,MAAM,CAAC;IACpC,gBAAgB,CAAC,EAAE,MAAM,EAAE,CAAC;IAC5B,wBAAwB,CAAC,EAAE,MAAM,EAAE,CAAC;IACpC,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,mBAAmB,CAAC,EAAE,OAAO,CAAC;CAC/B;AAED,cAAc;AACd,MAAM,WAAW,aAAa;IAC5B,CAAC,IAAI,EAAE,MAAM,GAAG,UAAU,CAAC;CAC5B;AAED,cAAc;AACd,MAAM,WAAW,iBAAiB;IAChC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,IAAI,CAAC,EAAE,GAAG,CAAC;IACX,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB"}

package/lib/cjs/JsonSchema.js

@@ -1,10 +1,10 @@
-"use strict";
-/*---------------------------------------------------------------------------------------------
-* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
-* See LICENSE.md in the project root for license terms and full copyright notice.
-*--------------------------------------------------------------------------------------------*/
-/** @packageDocumentation
- * @module Json
- */
-Object.defineProperty(exports, "__esModule", { value: true });
+"use strict";
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Json
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
 //# sourceMappingURL=JsonSchema.js.map