@itwin/core-bentley 5.5.0-dev.1 → 5.5.0-dev.2

package/lib/esm/internal/RepositoryStatus.js.map

@@ -1 +1 @@
-{"version":3,"file":"RepositoryStatus.js","sourceRoot":"","sources":["../../../src/internal/RepositoryStatus.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH;;GAEG;AACH,MAAM,CAAN,IAAY,gBAgCX;AAhCD,WAAY,gBAAgB;IAC1B,6DAAW,CAAA;IACX,yDAAyD;IACzD,qFAA2B,CAAA;IAC3B,6DAA6D;IAC7D,iFAAyB,CAAA;IACzB,mDAAmD;IACnD,qEAAmB,CAAA;IACnB,0CAA0C;IAC1C,iFAAyB,CAAA;IACzB,uEAAuE;IACvE,yFAA6B,CAAA;IAC7B,oFAAoF;IACpF,mEAAkB,CAAA;IAClB,kEAAkE;IAClE,6FAA+B,CAAA;IAC/B,uCAAuC;IACvC,+EAAwB,CAAA;IACxB,uHAAuH;IACvH,qFAA2B,CAAA;IAC3B,qEAAqE;IACrE,iFAAyB,CAAA;IACzB,gGAAgG;IAChG,iFAAyB,CAAA;IACzB,wEAAwE;IACxE,mEAAkB,CAAA;IAClB,oDAAoD;IACpD,yEAAqB,CAAA;IACrB,yDAAyD;IACzD,uFAA4B,CAAA;IAC5B,sGAAsG;IACtG,uGAAoC,CAAA;AACtC,CAAC,EAhCW,gBAAgB,KAAhB,gBAAgB,QAgC3B","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Errors\r\n */\r\n\r\n/** Return codes for methods which perform repository management operations.\r\n * @internal\r\n */\r\nexport enum RepositoryStatus {\r\n  Success = 0,\r\n  /** The repository server did not respond to a request */\r\n  ServerUnavailable = 0x15001,\r\n  /** A requested lock was already held by another briefcase */\r\n  LockAlreadyHeld = 0x15002,\r\n  /** Failed to sync briefcase manager with server */\r\n  SyncError = 0x15003,\r\n  /** Response from server not understood */\r\n  InvalidResponse = 0x15004,\r\n  /** An operation requires local changes to be committed or abandoned */\r\n  PendingTransactions = 0x15005,\r\n  /** A lock cannot be relinquished because the associated object has been modified */\r\n  LockUsed = 0x15006,\r\n  /** An operation required creation of a ChangeSet, which failed */\r\n  CannotCreateChangeSet = 0x15007,\r\n  /** Request to server not understood */\r\n  InvalidRequest = 0x15008,\r\n  /** A change set committed to the server must be integrated into the briefcase before the operation can be completed */\r\n  ChangeSetRequired = 0x15009,\r\n  /** A requested DgnCode is reserved by another briefcase or in use */\r\n  CodeUnavailable = 0x1500A,\r\n  /** A DgnCode cannot be released because it has not been reserved by the requesting briefcase */\r\n  CodeNotReserved = 0x1500B,\r\n  /** A DgnCode cannot be relinquished because it has been used locally */\r\n  CodeUsed = 0x1500C,\r\n  /** A required lock is not held by this briefcase */\r\n  LockNotHeld = 0x1500D,\r\n  /** Repository is currently locked, no changes allowed */\r\n  RepositoryIsLocked = 0x1500E,\r\n  /** Channel write constraint violation, such as an attempt to write outside the designated channel. */\r\n  ChannelConstraintViolation = 0x1500F,\r\n}\r\n\r\n"]}
+{"version":3,"file":"RepositoryStatus.js","sourceRoot":"","sources":["../../../src/internal/RepositoryStatus.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH;;GAEG;AACH,MAAM,CAAN,IAAY,gBAgCX;AAhCD,WAAY,gBAAgB;IAC1B,6DAAW,CAAA;IACX,yDAAyD;IACzD,qFAA2B,CAAA;IAC3B,6DAA6D;IAC7D,iFAAyB,CAAA;IACzB,mDAAmD;IACnD,qEAAmB,CAAA;IACnB,0CAA0C;IAC1C,iFAAyB,CAAA;IACzB,uEAAuE;IACvE,yFAA6B,CAAA;IAC7B,oFAAoF;IACpF,mEAAkB,CAAA;IAClB,kEAAkE;IAClE,6FAA+B,CAAA;IAC/B,uCAAuC;IACvC,+EAAwB,CAAA;IACxB,uHAAuH;IACvH,qFAA2B,CAAA;IAC3B,qEAAqE;IACrE,iFAAyB,CAAA;IACzB,gGAAgG;IAChG,iFAAyB,CAAA;IACzB,wEAAwE;IACxE,mEAAkB,CAAA;IAClB,oDAAoD;IACpD,yEAAqB,CAAA;IACrB,yDAAyD;IACzD,uFAA4B,CAAA;IAC5B,sGAAsG;IACtG,uGAAoC,CAAA;AACtC,CAAC,EAhCW,gBAAgB,KAAhB,gBAAgB,QAgC3B","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Errors\n */\n\n/** Return codes for methods which perform repository management operations.\n * @internal\n */\nexport enum RepositoryStatus {\n  Success = 0,\n  /** The repository server did not respond to a request */\n  ServerUnavailable = 0x15001,\n  /** A requested lock was already held by another briefcase */\n  LockAlreadyHeld = 0x15002,\n  /** Failed to sync briefcase manager with server */\n  SyncError = 0x15003,\n  /** Response from server not understood */\n  InvalidResponse = 0x15004,\n  /** An operation requires local changes to be committed or abandoned */\n  PendingTransactions = 0x15005,\n  /** A lock cannot be relinquished because the associated object has been modified */\n  LockUsed = 0x15006,\n  /** An operation required creation of a ChangeSet, which failed */\n  CannotCreateChangeSet = 0x15007,\n  /** Request to server not understood */\n  InvalidRequest = 0x15008,\n  /** A change set committed to the server must be integrated into the briefcase before the operation can be completed */\n  ChangeSetRequired = 0x15009,\n  /** A requested DgnCode is reserved by another briefcase or in use */\n  CodeUnavailable = 0x1500A,\n  /** A DgnCode cannot be released because it has not been reserved by the requesting briefcase */\n  CodeNotReserved = 0x1500B,\n  /** A DgnCode cannot be relinquished because it has been used locally */\n  CodeUsed = 0x1500C,\n  /** A required lock is not held by this briefcase */\n  LockNotHeld = 0x1500D,\n  /** Repository is currently locked, no changes allowed */\n  RepositoryIsLocked = 0x1500E,\n  /** Channel write constraint violation, such as an attempt to write outside the designated channel. */\n  ChannelConstraintViolation = 0x1500F,\n}\n\n"]}

package/lib/esm/internal/cross-package.js.map

@@ -1 +1 @@
-{"version":3,"file":"cross-package.js","sourceRoot":"","sources":["../../../src/internal/cross-package.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F,OAAO,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AACtD,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,oBAAoB,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\nexport { RepositoryStatus } from \"./RepositoryStatus\";\r\nexport { DbChangeStage, DbConflictCause, DbConflictResolution, DbValueType } from \"./BeSQLiteInternal\";\r\n"]}
+{"version":3,"file":"cross-package.js","sourceRoot":"","sources":["../../../src/internal/cross-package.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F,OAAO,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AACtD,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,oBAAoB,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\nexport { RepositoryStatus } from \"./RepositoryStatus\";\nexport { DbChangeStage, DbConflictCause, DbConflictResolution, DbValueType } from \"./BeSQLiteInternal\";\n"]}

package/lib/esm/partitionArray.js.map

@@ -1 +1 @@
-{"version":3,"file":"partitionArray.js","sourceRoot":"","sources":["../../src/partitionArray.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,cAAc,CAAI,KAAU,EAAE,SAAkC;IAC9E,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC;IAC7B,OAAO,KAAK,GAAG,SAAS,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC1B,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;YACpB,EAAE,KAAK,CAAC;QACV,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,EAAE,SAAS,CAAC,CAAC;YAClC,KAAK,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Collections\r\n */\r\n\r\n/** Partitions an array in-place according to some criterion, such that elements that fulfill the criterion are grouped in the lower\r\n * portion of the array, and those that fail to fulfill the criterion are grouped in the upper portion of the array.\r\n * @param array The array to be partitioned.\r\n * @param criterion A function invoked for each element of the array, returning whether the element fulfills the criterion.\r\n * @returns The index of the upper partition, i.e., of the first element that fails the criterion. If all elements fulfill the criterion, this is the length of the array.\r\n * @note The relative ordering of elements within each partition is unspecified.\r\n * Example:\r\n * ```ts\r\n * function isEven(n: number) { return 0 === n % 2; }\r\n * const list = [ 1, 2, 3, 4, 5 ];\r\n * const firstOddIndex = partitionArray(list, isEven); // firstOddIndex = 2\r\n * // 2 and 4 now appear before 1, 3, and 5 in the list; their ordering is otherwise unspecified.\r\n * for (let i = 0; i < list.length; i++)\r\n *   assert(isEven(list[i]) === i < firstOddIndex);\r\n * ```\r\n * @public\r\n */\r\nexport function partitionArray<T>(array: T[], criterion: (element: T) => boolean): number {\r\n  let index = 0;\r\n  let partition = array.length;\r\n  while (index < partition) {\r\n    const elem = array[index];\r\n    if (criterion(elem)) {\r\n      ++index;\r\n    } else {\r\n      array[index] = array[--partition];\r\n      array[partition] = elem;\r\n    }\r\n  }\r\n\r\n  return partition;\r\n}\r\n"]}
+{"version":3,"file":"partitionArray.js","sourceRoot":"","sources":["../../src/partitionArray.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,cAAc,CAAI,KAAU,EAAE,SAAkC;IAC9E,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC;IAC7B,OAAO,KAAK,GAAG,SAAS,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC1B,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;YACpB,EAAE,KAAK,CAAC;QACV,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,EAAE,SAAS,CAAC,CAAC;YAClC,KAAK,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Collections\n */\n\n/** Partitions an array in-place according to some criterion, such that elements that fulfill the criterion are grouped in the lower\n * portion of the array, and those that fail to fulfill the criterion are grouped in the upper portion of the array.\n * @param array The array to be partitioned.\n * @param criterion A function invoked for each element of the array, returning whether the element fulfills the criterion.\n * @returns The index of the upper partition, i.e., of the first element that fails the criterion. If all elements fulfill the criterion, this is the length of the array.\n * @note The relative ordering of elements within each partition is unspecified.\n * Example:\n * ```ts\n * function isEven(n: number) { return 0 === n % 2; }\n * const list = [ 1, 2, 3, 4, 5 ];\n * const firstOddIndex = partitionArray(list, isEven); // firstOddIndex = 2\n * // 2 and 4 now appear before 1, 3, and 5 in the list; their ordering is otherwise unspecified.\n * for (let i = 0; i < list.length; i++)\n *   assert(isEven(list[i]) === i < firstOddIndex);\n * ```\n * @public\n */\nexport function partitionArray<T>(array: T[], criterion: (element: T) => boolean): number {\n  let index = 0;\n  let partition = array.length;\n  while (index < partition) {\n    const elem = array[index];\n    if (criterion(elem)) {\n      ++index;\n    } else {\n      array[index] = array[--partition];\n      array[partition] = elem;\n    }\n  }\n\n  return partition;\n}\n"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@itwin/core-bentley",
-  "version": "5.5.0-dev.1",
+  "version": "5.5.0-dev.2",
   "description": "Bentley JavaScript core components",
   "main": "lib/cjs/core-bentley.js",
   "module": "lib/esm/core-bentley.js",
@@ -30,7 +30,7 @@
     "rimraf": "^6.0.1",
     "typescript": "~5.6.2",
     "vitest": "^3.0.6",
-    "@itwin/build-tools": "5.5.0-dev.1"
+    "@itwin/build-tools": "5.5.0-dev.2"
   },
   "nyc": {
     "extends": "./node_modules/@itwin/build-tools/.nycrc"