@noldova/context.collections 0.0.0-stage → 0.0.2

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) Noldova
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/api/index.d.ts

@@ -0,0 +1,40 @@
+/**
+ * @license
+ * Copyright (c) Noldova.
+ *
+ * This source code is licensed under the license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+
+/**
+ * Provides binary-search operations for ascending numeric arrays.
+ */
+export declare class BinarySearchService {
+  /**
+   * Finds the last array position whose value is less than or equal to the target.
+   *
+   * @param values The numbers to search, sorted from smallest to greatest.
+   * Equal consecutive values are allowed.
+   * @param target The inclusive comparison limit. An exact match is not required;
+   * when none exists, the search finds the nearest lower value.
+   * @returns The zero-based index of the last qualifying value. If that value
+   * occurs more than once, returns its last index. Returns `-1` when no value
+   * qualifies, including an empty array or a target below the first value.
+   *
+   * @remarks
+   * Ordering is a caller precondition and is not checked. The method does not sort,
+   * modify, copy, or retain the array. It performs O(log n) comparisons and uses
+   * O(1) additional storage, where n is the number of values.
+   *
+   * @example
+   * ```ts
+   * BinarySearchService.floorIndex([1, 3, 5, 7], 5); // 2: exact match.
+   * BinarySearchService.floorIndex([1, 3, 5, 7], 4); // 1: the nearest lower value is 3.
+   * BinarySearchService.floorIndex([1, 3, 3, 5], 3); // 2: the last duplicate.
+   * BinarySearchService.floorIndex([1, 3, 5], 9); // 2: the last value is below the target.
+   * BinarySearchService.floorIndex([1, 3, 5], 0); // -1: all values exceed the target.
+   * BinarySearchService.floorIndex([], 5); // -1: the array is empty.
+   * ```
+   */
+  public static floorIndex(values: readonly number[], target: number): number;
+}

package/api/index.js

@@ -0,0 +1,9 @@
+/**
+ * @license
+ * Copyright (c) Noldova.
+ *
+ * This source code is licensed under the license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+export { BinarySearchService } from "../services/binary-search.service.js";
+//# sourceMappingURL=index.js.map

package/api/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/noldova.context.collections/src/api/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,mBAAmB,EAAE,MAAM,sCAAsC,CAAC"}

package/package.json

@@ -1,6 +1,21 @@
 {
   "name": "@noldova/context.collections",
-  "version": "0.0.0-stage",
-  "stub": true,
-  "description": "Temporary package placeholder for staged publishing"
-}
+  "version": "0.0.2",
+  "type": "module",
+  "main": "api/index.js",
+  "types": "api/index.d.ts",
+  "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/noldova-com/context.git",
+    "directory": "src/noldova.context.collections"
+  },
+  "homepage": "https://github.com/noldova-com/context#readme",
+  "bugs": {
+    "url": "https://github.com/noldova-com/context/issues"
+  },
+  "publishConfig": {
+    "access": "public",
+    "registry": "https://registry.npmjs.org/"
+  }
+}

package/services/binary-search.service.js

@@ -0,0 +1,22 @@
+/**
+ * @license
+ * Copyright (c) Noldova.
+ *
+ * This source code is licensed under the license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+export class BinarySearchService {
+    static floorIndex(values, target) {
+        let lowerIndex = 0;
+        let upperIndex = values.length - 1;
+        while (lowerIndex <= upperIndex) {
+            const middleIndex = lowerIndex + ((upperIndex - lowerIndex) >>> 1);
+            if (values[middleIndex] <= target)
+                lowerIndex = middleIndex + 1;
+            else
+                upperIndex = middleIndex - 1;
+        }
+        return upperIndex;
+    }
+}
+//# sourceMappingURL=binary-search.service.js.map

package/services/binary-search.service.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"binary-search.service.js","sourceRoot":"","sources":["../../../../src/noldova.context.collections/src/services/binary-search.service.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,MAAM,OAAO,mBAAmB;IACvB,MAAM,CAAC,UAAU,CAAC,MAAyB,EAAE,MAAc;QAChE,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,UAAU,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAEnC,OAAO,UAAU,IAAI,UAAU,EAAE,CAAC;YAChC,MAAM,WAAW,GAAG,UAAU,GAAG,CAAC,CAAC,UAAU,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC;YACnE,IAAI,MAAM,CAAC,WAAW,CAAE,IAAI,MAAM;gBAChC,UAAU,GAAG,WAAW,GAAG,CAAC,CAAC;;gBAE7B,UAAU,GAAG,WAAW,GAAG,CAAC,CAAC;QACjC,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;CACF"}

package/README.md

@@ -1,3 +0,0 @@
-# Temporary Holding Version
-
-This version is a temporary placeholder for this package. An operational version to replace this has been submitted for review and is awaiting a staged release.