data-structure-typed 2.5.1 → 2.5.2

package/dist/types/data-structures/binary-tree/tree-set.d.ts

@@ -171,6 +171,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -321,6 +341,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -486,6 +526,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -647,6 +707,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -796,6 +876,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -943,6 +1043,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1091,6 +1211,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1239,6 +1379,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1388,6 +1548,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1539,6 +1719,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1689,6 +1889,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1837,6 +2057,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1983,6 +2223,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2128,6 +2388,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2273,6 +2553,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2421,6 +2721,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2568,6 +2888,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2623,6 +2963,10 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -2685,6 +3029,10 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -2725,6 +3073,10 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -2767,6 +3119,10 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -2883,6 +3239,22 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3021,6 +3393,22 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3151,6 +3539,22 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3279,6 +3683,22 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3410,6 +3830,22 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3446,6 +3882,55 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
    *     console.log(blocklist.has(167772800)); // false;
      */
     rangeSearch(range: [K, K], options?: TreeSetRangeOptions): K[];
+    /**
+     * Returns the element at the k-th position in tree order (0-indexed).
+     * @remarks Time O(log n). Requires `enableOrderStatistic: true`.
+     
+     
+     
+      * @example
+   * // Find k-th element in a TreeSet
+   *  const set = new TreeSet<number>([30, 10, 50, 20, 40], { enableOrderStatistic: true });
+   *       console.log(set.getByRank(0)); // 10;
+   *       console.log(set.getByRank(2)); // 30;
+   *       console.log(set.getRank(30)); // 2;
+     */
+    getByRank(k: number): K | undefined;
+    /**
+     * Returns the 0-based rank of a key (number of elements that precede it in tree order).
+     * @remarks Time O(log n). Requires `enableOrderStatistic: true`.
+      * @example
+   * // Get the rank of a key in sorted order
+   *  const tree = new TreeSet<number>(
+   *         [10, 20, 30, 40, 50],
+   *         { enableOrderStatistic: true }
+   *       );
+   *       console.log(tree.getRank(10)); // 0;  // smallest → rank 0
+   *       console.log(tree.getRank(30)); // 2;  // 2 elements before 30 in tree order
+   *       console.log(tree.getRank(50)); // 4;  // largest → rank 4
+   *       console.log(tree.getRank(25)); // 2;
+     */
+    getRank(key: K): number;
+    /**
+     * Returns elements by rank range (0-indexed, inclusive on both ends).
+     * @remarks Time O(log n + k). Requires `enableOrderStatistic: true`.
+     
+      * @example
+   * // Pagination with rangeByRank
+   *  const tree = new TreeSet<number>(
+   *         [10, 20, 30, 40, 50, 60, 70, 80, 90],
+   *         { enableOrderStatistic: true }
+   *       );
+   *       const pageSize = 3;
+   *
+   *       // Page 1
+   *       console.log(tree.rangeByRank(0, pageSize - 1)); // [10, 20, 30];
+   *       // Page 2
+   *       console.log(tree.rangeByRank(pageSize, 2 * pageSize - 1)); // [40, 50, 60];
+   *       // Page 3
+   *       console.log(tree.rangeByRank(2 * pageSize, 3 * pageSize - 1)); // [70, 80, 90];
+     */
+    rangeByRank(start: number, end: number): K[];
     /**
      * Creates a shallow clone of this set.
      * @remarks Time O(n log n), Space O(n)
@@ -3567,6 +4052,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+