max-priority-queue-typed 2.5.1 → 2.5.2

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

@@ -181,6 +181,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -336,6 +351,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -506,6 +536,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -672,6 +717,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -826,6 +886,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -978,6 +1053,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1131,6 +1221,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1284,6 +1389,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1438,6 +1558,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1594,6 +1729,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1749,6 +1899,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1902,6 +2067,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2053,6 +2233,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2203,6 +2398,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2353,6 +2563,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2506,6 +2731,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2658,6 +2898,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2710,6 +2965,9 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
      
      
      
@@ -2773,6 +3031,9 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
      
      
      
@@ -2814,6 +3075,9 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
      
      
      
@@ -2857,6 +3121,9 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
      
      
      
@@ -2980,6 +3247,18 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3122,6 +3401,18 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3256,6 +3547,18 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3388,6 +3691,18 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3523,6 +3838,18 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3555,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)
@@ -3686,6 +4062,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      

package/dist/types/data-structures/graph/directed-graph.d.ts

@@ -182,6 +182,9 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
      
      
      
@@ -238,6 +241,9 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
      
      
      
@@ -296,6 +302,9 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
    
    
    
+   
+   
+   
    
    
    
@@ -342,6 +351,9 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
      
      
      
@@ -387,6 +399,9 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
      
      
      
@@ -460,6 +475,9 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
      
      
      
@@ -515,6 +533,9 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
    
    
    
+   
+   
+   
    
    
    
@@ -556,6 +577,9 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
    
    
    
+   
+   
+   
    
    
    
@@ -624,6 +648,9 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
      
      
      
@@ -688,6 +715,9 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+