indusagi-coding-agent 0.1.58 → 0.1.60

package/dist/helpers/array.js

@@ -1,692 +0,0 @@
-/**
- * @fileoverview Advanced array manipulation utilities with functional programming patterns
- *
- * This module provides:
- * - Array grouping and partitioning
- * - Unique value extraction
- * - Flattening and chunking
- * - Sorting and searching
- * - Array zipping and pairing
- * - Filtering and transforming
- * - Set operations (union, intersection, difference)
- * - Performance optimized with O(n) complexity notes
- *
- * @example
- * import { groupBy, unique, flatten, chunk, sortBy } from './array';
- *
- * const items = [{ id: 1, type: 'A' }, { id: 2, type: 'B' }];
- * const grouped = groupBy(items, item => item.type);
- * const flattened = flatten([1, [2, [3, [4]]]]);
- *
- * @author indusagi
- * @version 1.0.0
- */
-/**
- * Group array items by key function
- * @param items - Array to group
- * @param keyFn - Function to determine grouping key
- * @returns Object with grouped arrays
- *
- * Performance: O(n) where n = array length
- *
- * @example
- * const users = [
- *   { name: 'John', role: 'admin' },
- *   { name: 'Jane', role: 'user' },
- *   { name: 'Bob', role: 'admin' }
- * ];
- * const byRole = groupBy(users, u => u.role);
- * // {
- * //   admin: [{ name: 'John', role: 'admin' }, { name: 'Bob', role: 'admin' }],
- * //   user: [{ name: 'Jane', role: 'user' }]
- * // }
- */
-export function groupBy(items, keyFn) {
-    const result = {};
-    items.forEach((item, index) => {
-        const key = keyFn(item, index);
-        if (!(key in result)) {
-            result[key] = [];
-        }
-        result[key].push(item);
-    });
-    return result;
-}
-/**
- * Get unique items from array
- * @param items - Array with potential duplicates
- * @param keyFn - Optional function to determine uniqueness
- * @returns Array with unique items (preserves order of first occurrence)
- *
- * Performance: O(n) with Set, very efficient
- *
- * @example
- * unique([1, 2, 2, 3, 3, 3, 4]);
- * // [1, 2, 3, 4]
- *
- * @example
- * const users = [
- *   { id: 1, name: 'John' },
- *   { id: 2, name: 'Jane' },
- *   { id: 1, name: 'John' }
- * ];
- * const unique_ = unique(users, u => u.id);
- * // [{ id: 1, name: 'John' }, { id: 2, name: 'Jane' }]
- */
-export function unique(items, keyFn) {
-    const seen = new Set();
-    const result = [];
-    for (const item of items) {
-        const key = keyFn ? keyFn(item) : item;
-        if (!seen.has(key)) {
-            seen.add(key);
-            result.push(item);
-        }
-    }
-    return result;
-}
-/**
- * Flatten nested array to specified depth
- * @param items - Nested array
- * @param depth - Flattening depth (default: Infinity)
- * @returns Flattened array
- *
- * Performance: O(n) where n = total items at all levels
- *
- * @example
- * flatten([1, [2, [3, [4]]]]);
- * // [1, 2, 3, 4]
- *
- * @example
- * flatten([1, [2, [3, [4]]]], 1);
- * // [1, 2, [3, [4]]]
- *
- * @example
- * flatten([1, [2, 3], [4, [5, 6]]]);
- * // [1, 2, 3, 4, 5, 6]
- */
-export function flatten(items, depth = Infinity) {
-    if (depth <= 0) {
-        return items;
-    }
-    const result = [];
-    for (const item of items) {
-        if (Array.isArray(item)) {
-            result.push(...flatten(item, depth - 1));
-        }
-        else {
-            result.push(item);
-        }
-    }
-    return result;
-}
-/**
- * Split array into chunks of specified size
- * @param items - Array to chunk
- * @param size - Chunk size
- * @returns Array of chunks
- *
- * Performance: O(n) where n = array length
- *
- * @example
- * chunk([1, 2, 3, 4, 5], 2);
- * // [[1, 2], [3, 4], [5]]
- *
- * @example
- * chunk(['a', 'b', 'c', 'd', 'e', 'f'], 3);
- * // [['a', 'b', 'c'], ['d', 'e', 'f']]
- */
-export function chunk(items, size) {
-    if (size <= 0) {
-        throw new Error('Chunk size must be greater than 0');
-    }
-    const result = [];
-    for (let i = 0; i < items.length; i += size) {
-        result.push(items.slice(i, i + size));
-    }
-    return result;
-}
-/**
- * Sort array by key function
- * @param items - Array to sort
- * @param keyFn - Function to get sort key
- * @param descending - Sort in descending order (default: false)
- * @returns Sorted array (creates new array)
- *
- * Performance: O(n log n)
- *
- * @example
- * const users = [
- *   { name: 'Charlie', age: 30 },
- *   { name: 'Alice', age: 25 },
- *   { name: 'Bob', age: 25 }
- * ];
- * const sorted = sortBy(users, user => user.age);
- */
-export function sortBy(items, keyFn, descending = false) {
-    return [...items].sort((a, b) => {
-        const keyA = keyFn(a);
-        const keyB = keyFn(b);
-        // Handle null/undefined
-        if (keyA == null && keyB == null)
-            return 0;
-        if (keyA == null)
-            return descending ? 1 : -1;
-        if (keyB == null)
-            return descending ? -1 : 1;
-        let comparison;
-        if (typeof keyA === 'string' && typeof keyB === 'string') {
-            comparison = keyA.localeCompare(keyB);
-        }
-        else {
-            comparison = keyA - keyB;
-        }
-        return descending ? -comparison : comparison;
-    });
-}
-/**
- * Find index of item matching predicate
- * @param items - Array to search
- * @param predicate - Test function
- * @returns Index of first match or -1
- *
- * Performance: O(n) worst case
- *
- * @example
- * const items = [10, 20, 30, 40];
- * findIndex(items, x => x > 25); // 2
- *
- * @example
- * const users = [{ id: 1 }, { id: 2 }, { id: 3 }];
- * findIndex(users, u => u.id === 2); // 1
- */
-export function findIndex(items, predicate) {
-    for (let i = 0; i < items.length; i++) {
-        if (predicate(items[i], i)) {
-            return i;
-        }
-    }
-    return -1;
-}
-/**
- * Find last index of item matching predicate
- * @param items - Array to search
- * @param predicate - Test function
- * @returns Index of last match or -1
- *
- * @example
- * const items = [10, 20, 30, 20, 40];
- * findLastIndex(items, x => x === 20); // 3
- */
-export function findLastIndex(items, predicate) {
-    for (let i = items.length - 1; i >= 0; i--) {
-        if (predicate(items[i], i)) {
-            return i;
-        }
-    }
-    return -1;
-}
-/**
- * Partition array into two arrays based on predicate
- * @param items - Array to partition
- * @param predicate - Test function
- * @returns Tuple of [passing, failing]
- *
- * Performance: O(n)
- *
- * @example
- * const numbers = [1, 2, 3, 4, 5, 6];
- * const [even, odd] = partition(numbers, x => x % 2 === 0);
- * // even: [2, 4, 6]
- * // odd: [1, 3, 5]
- *
- * @example
- * const users = [
- *   { name: 'John', active: true },
- *   { name: 'Jane', active: false },
- *   { name: 'Bob', active: true }
- * ];
- * const [active, inactive] = partition(users, u => u.active);
- */
-export function partition(items, predicate) {
-    const passing = [];
-    const failing = [];
-    for (const item of items) {
-        if (predicate(item)) {
-            passing.push(item);
-        }
-        else {
-            failing.push(item);
-        }
-    }
-    return [passing, failing];
-}
-/**
- * Zip arrays together
- * @param arrays - Arrays to zip
- * @returns Array of tuples
- *
- * Performance: O(n) where n = length of shortest array
- *
- * @example
- * const names = ['John', 'Jane', 'Bob'];
- * const ages = [30, 28, 25];
- * const zipped = zip(names, ages);
- * // [['John', 30], ['Jane', 28], ['Bob', 25]]
- *
- * @example
- * const a = [1, 2, 3];
- * const b = ['a', 'b', 'c'];
- * const c = [true, false, true];
- * const result = zip(a, b, c);
- * // [[1, 'a', true], [2, 'b', false], [3, 'c', true]]
- */
-export function zip(...arrays) {
-    if (arrays.length === 0) {
-        return [];
-    }
-    const minLength = Math.min(...arrays.map((arr) => arr.length));
-    const result = [];
-    for (let i = 0; i < minLength; i++) {
-        const tuple = arrays.map((arr) => arr[i]);
-        result.push(tuple);
-    }
-    return result;
-}
-/**
- * Unzip array of tuples
- * @param items - Array of tuples
- * @returns Array of arrays
- *
- * @example
- * const zipped = [['John', 30], ['Jane', 28], ['Bob', 25]];
- * const [names, ages] = unzip(zipped);
- * // names: ['John', 'Jane', 'Bob']
- * // ages: [30, 28, 25]
- */
-export function unzip(items) {
-    if (items.length === 0) {
-        return [];
-    }
-    const length = items[0].length;
-    const result = Array.from({ length }, () => []);
-    for (const item of items) {
-        for (let i = 0; i < length; i++) {
-            result[i].push(item[i]);
-        }
-    }
-    return result;
-}
-/**
- * Get first n items from array
- * @param items - Array
- * @param n - Number of items
- * @returns First n items
- *
- * @example
- * take([1, 2, 3, 4, 5], 3); // [1, 2, 3]
- */
-export function take(items, n) {
-    return items.slice(0, Math.max(0, n));
-}
-/**
- * Remove first n items from array
- * @param items - Array
- * @param n - Number of items to skip
- * @returns Items after first n
- *
- * @example
- * drop([1, 2, 3, 4, 5], 2); // [3, 4, 5]
- */
-export function drop(items, n) {
-    return items.slice(Math.max(0, n));
-}
-/**
- * Get last n items from array
- * @param items - Array
- * @param n - Number of items
- * @returns Last n items
- *
- * @example
- * takeLast([1, 2, 3, 4, 5], 2); // [4, 5]
- */
-export function takeLast(items, n) {
-    return items.slice(Math.max(0, items.length - n));
-}
-/**
- * Remove last n items from array
- * @param items - Array
- * @param n - Number of items to remove
- * @returns Items excluding last n
- *
- * @example
- * dropLast([1, 2, 3, 4, 5], 2); // [1, 2, 3]
- */
-export function dropLast(items, n) {
-    return items.slice(0, Math.max(0, items.length - n));
-}
-/**
- * Find union of arrays (all unique items from all arrays)
- * @param arrays - Arrays to union
- * @returns Array of unique items from all arrays
- *
- * Performance: O(n) where n = total items
- *
- * @example
- * union([1, 2, 3], [2, 3, 4], [3, 4, 5]);
- * // [1, 2, 3, 4, 5]
- */
-export function union(...arrays) {
-    const seen = new Set();
-    const result = [];
-    for (const array of arrays) {
-        for (const item of array) {
-            if (!seen.has(item)) {
-                seen.add(item);
-                result.push(item);
-            }
-        }
-    }
-    return result;
-}
-/**
- * Find intersection of arrays (items present in all arrays)
- * @param arrays - Arrays to intersect
- * @returns Array of items present in all arrays
- *
- * Performance: O(n*m) where n = first array, m = other arrays
- *
- * @example
- * intersection([1, 2, 3, 4], [2, 3, 4, 5], [3, 4, 5, 6]);
- * // [3, 4]
- */
-export function intersection(...arrays) {
-    if (arrays.length === 0) {
-        return [];
-    }
-    const [first, ...rest] = arrays;
-    const otherSets = rest.map((arr) => new Set(arr));
-    return first.filter((item) => otherSets.every((set) => set.has(item)));
-}
-/**
- * Find difference (items in first array not in others)
- * @param first - First array
- * @param rest - Other arrays to subtract
- * @returns Items in first but not in others
- *
- * Performance: O(n+m) where n = first, m = total other items
- *
- * @example
- * difference([1, 2, 3, 4], [2, 3], [4]);
- * // [1]
- */
-export function difference(first, ...rest) {
-    const otherSet = new Set();
-    for (const array of rest) {
-        for (const item of array) {
-            otherSet.add(item);
-        }
-    }
-    return first.filter((item) => !otherSet.has(item));
-}
-/**
- * Remove falsy values from array
- * @param items - Array with potential falsy values
- * @returns Array without falsy values (0, '', false, null, undefined, NaN)
- *
- * @example
- * compact([1, 0, '', null, 'text', undefined, false]);
- * // [1, 'text']
- */
-export function compact(items) {
-    return items.filter((item) => Boolean(item));
-}
-/**
- * Filter and map in one operation
- * @param items - Array to transform
- * @param fn - Function returning value or null/undefined to filter
- * @returns Filtered and mapped array
- *
- * Performance: O(n)
- *
- * @example
- * const items = [1, 2, 3, 4, 5];
- * const result = mapFilter(items, x => x > 2 ? x * 2 : null);
- * // [6, 8, 10]
- */
-export function mapFilter(items, fn) {
-    const result = [];
-    for (const item of items) {
-        const mapped = fn(item);
-        if (mapped != null) {
-            result.push(mapped);
-        }
-    }
-    return result;
-}
-/**
- * Shuffle array randomly
- * @param items - Array to shuffle
- * @returns Shuffled copy of array
- *
- * @example
- * shuffle([1, 2, 3, 4, 5]);
- * // [3, 1, 4, 5, 2] (random order)
- */
-export function shuffle(items) {
-    const arr = [...items];
-    for (let i = arr.length - 1; i > 0; i--) {
-        const j = Math.floor(Math.random() * (i + 1));
-        [arr[i], arr[j]] = [arr[j], arr[i]];
-    }
-    return arr;
-}
-/**
- * Get random item from array
- * @param items - Array to sample from
- * @returns Random item or undefined if empty
- *
- * @example
- * const item = sample([1, 2, 3, 4, 5]);
- * // One random item from the array
- */
-export function sample(items) {
-    if (items.length === 0) {
-        return undefined;
-    }
-    return items[Math.floor(Math.random() * items.length)];
-}
-/**
- * Get multiple random items from array
- * @param items - Array to sample from
- * @param n - Number of items to sample
- * @returns Array of random items
- *
- * @example
- * sampleSize([1, 2, 3, 4, 5], 3);
- * // [2, 4, 1] (3 random items)
- */
-export function sampleSize(items, n) {
-    const shuffled = shuffle(items);
-    return shuffled.slice(0, Math.max(0, Math.min(n, items.length)));
-}
-/**
- * Find item with minimum value
- * @param items - Array to search
- * @param compareFn - Function to get comparable value
- * @returns Item with minimum value or undefined
- *
- * @example
- * const items = [{ val: 10 }, { val: 5 }, { val: 20 }];
- * const min = minBy(items, x => x.val);
- * // { val: 5 }
- */
-export function minBy(items, compareFn) {
-    if (items.length === 0)
-        return undefined;
-    let minItem = items[0];
-    let minValue = compareFn(minItem);
-    for (let i = 1; i < items.length; i++) {
-        const value = compareFn(items[i]);
-        if (value < minValue) {
-            minValue = value;
-            minItem = items[i];
-        }
-    }
-    return minItem;
-}
-/**
- * Find item with maximum value
- * @param items - Array to search
- * @param compareFn - Function to get comparable value
- * @returns Item with maximum value or undefined
- *
- * @example
- * const items = [{ val: 10 }, { val: 5 }, { val: 20 }];
- * const max = maxBy(items, x => x.val);
- * // { val: 20 }
- */
-export function maxBy(items, compareFn) {
-    if (items.length === 0)
-        return undefined;
-    let maxItem = items[0];
-    let maxValue = compareFn(maxItem);
-    for (let i = 1; i < items.length; i++) {
-        const value = compareFn(items[i]);
-        if (value > maxValue) {
-            maxValue = value;
-            maxItem = items[i];
-        }
-    }
-    return maxItem;
-}
-/**
- * Sum array values
- * @param items - Array to sum
- * @param fn - Optional function to get numeric value
- * @returns Sum of array
- *
- * @example
- * sum([1, 2, 3, 4]); // 10
- *
- * @example
- * const items = [{ val: 10 }, { val: 20 }];
- * sum(items, x => x.val); // 30
- */
-export function sum(items, fn) {
-    return items.reduce((acc, item) => acc + (fn ? fn(item) : item), 0);
-}
-/**
- * Average array values
- * @param items - Array to average
- * @param fn - Optional function to get numeric value
- * @returns Average of array
- *
- * @example
- * average([1, 2, 3, 4]); // 2.5
- */
-export function average(items, fn) {
-    if (items.length === 0)
-        return 0;
-    return sum(items, fn) / items.length;
-}
-/**
- * Alias for average - calculate mean of array values
- * @param items - Array to average
- * @param fn - Optional function to get numeric value
- * @returns Mean of array
- *
- * @example
- * mean([2, 4, 6]); // 4
- */
-export function mean(items, fn) {
-    return average(items, fn);
-}
-/**
- * Generate range of numbers
- * @param start - Start value (or end if only one argument)
- * @param end - End value (inclusive)
- * @param step - Step increment (default: 1)
- * @returns Array of numbers
- *
- * @example
- * range(1, 5);    // [1, 2, 3, 4, 5]
- * range(3);       // [0, 1, 2]
- * range(0, 10, 2); // [0, 2, 4, 6, 8, 10]
- */
-export function range(start, end, step = 1) {
-    // Handle single argument case: range(3) -> [0, 1, 2]
-    if (end === undefined) {
-        end = start;
-        start = 0;
-    }
-    const result = [];
-    if (step > 0) {
-        for (let i = start; i <= end; i += step) {
-            result.push(i);
-        }
-    }
-    else if (step < 0) {
-        for (let i = start; i >= end; i += step) {
-            result.push(i);
-        }
-    }
-    return result;
-}
-/**
- * Find maximum value in array
- * @param items - Array to search
- * @param fn - Optional function to get numeric value
- * @returns Maximum value or undefined if empty
- *
- * @example
- * max([1, 5, 3, 2]); // 5
- *
- * @example
- * const items = [{ age: 20 }, { age: 30 }, { age: 25 }];
- * max(items, item => item.age); // 30
- */
-export function max(items, fn) {
-    if (items.length === 0)
-        return undefined;
-    if (fn) {
-        let maxValue = fn(items[0]);
-        for (let i = 1; i < items.length; i++) {
-            const value = fn(items[i]);
-            if (value > maxValue) {
-                maxValue = value;
-            }
-        }
-        return maxValue;
-    }
-    return Math.max(...items);
-}
-/**
- * Find minimum value in array
- * @param items - Array to search
- * @param fn - Optional function to get numeric value
- * @returns Minimum value or undefined if empty
- *
- * @example
- * min([1, 5, 3, 2]); // 1
- *
- * @example
- * const items = [{ age: 20 }, { age: 30 }, { age: 25 }];
- * min(items, item => item.age); // 20
- */
-export function min(items, fn) {
-    if (items.length === 0)
-        return undefined;
-    if (fn) {
-        let minValue = fn(items[0]);
-        for (let i = 1; i < items.length; i++) {
-            const value = fn(items[i]);
-            if (value < minValue) {
-                minValue = value;
-            }
-        }
-        return minValue;
-    }
-    return Math.min(...items);
-}
-//# sourceMappingURL=array.js.map

package/dist/helpers/array.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"array.js","sourceRoot":"","sources":["../../app/helpers/array.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,UAAU,OAAO,CACrB,KAAU,EACV,KAAoC;IAEpC,MAAM,MAAM,GAAQ,EAAE,CAAC;IAEvB,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;QAC5B,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC/B,IAAI,CAAC,CAAC,GAAG,IAAI,MAAM,CAAC,EAAE,CAAC;YACrB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;QACnB,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,UAAU,MAAM,CACpB,KAAU,EACV,KAAsB;IAEtB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAK,CAAC;IAC1B,MAAM,MAAM,GAAQ,EAAE,CAAC;IAEvB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAG,IAAsB,CAAC;QAC3D,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACnB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,UAAU,OAAO,CAAI,KAAY,EAAE,KAAK,GAAG,QAAQ;IACvD,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;QACf,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,MAAM,GAAQ,EAAE,CAAC;IAEvB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACxB,MAAM,CAAC,IAAI,CAAC,GAAG,OAAO,CAAI,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,IAAI,CAAC,IAAoB,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,KAAK,CAAI,KAAU,EAAE,IAAY;IAC/C,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;QACd,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;IACvD,CAAC;IAED,MAAM,MAAM,GAAU,EAAE,CAAC;IAEzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;QAC5C,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IACxC,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,MAAM,CACpB,KAAU,EACV,KAAsD,EACtD,aAAsB,KAAK;IAE3B,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC9B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAEtB,wBAAwB;QACxB,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;YAAE,OAAO,CAAC,CAAC;QAC3C,IAAI,IAAI,IAAI,IAAI;YAAE,OAAO,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAI,IAAI,IAAI,IAAI;YAAE,OAAO,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAE7C,IAAI,UAAkB,CAAC;QACvB,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;YACzD,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QACxC,CAAC;aAAM,CAAC;YACN,UAAU,GAAI,IAAe,GAAI,IAAe,CAAC;QACnD,CAAC;QAED,OAAO,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC;IAC/C,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,SAAS,CACvB,KAAU,EACV,SAA8C;IAE9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YAC3B,OAAO,CAAC,CAAC;QACX,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,aAAa,CAC3B,KAAU,EACV,SAA8C;IAE9C,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YAC3B,OAAO,CAAC,CAAC;QACX,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,UAAU,SAAS,CACvB,KAAU,EACV,SAA+B;IAE/B,MAAM,OAAO,GAAQ,EAAE,CAAC;IACxB,MAAM,OAAO,GAAQ,EAAE,CAAC;IAExB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;YACpB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IAED,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;AAC5B,CAAC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,UAAU,GAAG,CAAoB,GAAG,MAAS;IACjD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;IAC/D,MAAM,MAAM,GAAU,EAAE,CAAC;IAEzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrB,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,KAAK,CAAkB,KAAU;IAC/C,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAC/B,MAAM,MAAM,GAAiB,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IAE9D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,IAAI,CAAI,KAAU,EAAE,CAAS;IAC3C,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AACxC,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,IAAI,CAAI,KAAU,EAAE,CAAS;IAC3C,OAAO,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AACrC,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,QAAQ,CAAI,KAAU,EAAE,CAAS;IAC/C,OAAO,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;AACpD,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,QAAQ,CAAI,KAAU,EAAE,CAAS;IAC/C,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;AACvD,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,KAAK,CAAI,GAAG,MAAa;IACvC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAK,CAAC;IAC1B,MAAM,MAAM,GAAQ,EAAE,CAAC;IAEvB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACpB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACf,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,YAAY,CAAI,GAAG,MAAa;IAC9C,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,GAAG,MAAM,CAAC;IAChC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAElD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAC3B,SAAS,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CACxC,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,UAAU,CAAI,KAAU,EAAE,GAAG,IAAW;IACtD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAK,CAAC;IAE9B,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;QACzB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;AACrD,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,OAAO,CAAI,KAA6D;IACtF,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAa,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;AAC1D,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,SAAS,CACvB,KAAU,EACV,EAAqC;IAErC,MAAM,MAAM,GAAQ,EAAE,CAAC;IAEvB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QACxB,IAAI,MAAM,IAAI,IAAI,EAAE,CAAC;YACnB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,OAAO,CAAI,KAAU;IACnC,MAAM,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;IAEvB,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,MAAM,CAAI,KAAU;IAClC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;AACzD,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,UAAU,CAAI,KAAU,EAAE,CAAS;IACjD,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;IAChC,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;AACnE,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,KAAK,CACnB,KAAU,EACV,SAA8B;IAE9B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAEzC,IAAI,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,IAAI,QAAQ,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC;IAElC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;YACrB,QAAQ,GAAG,KAAK,CAAC;YACjB,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,KAAK,CACnB,KAAU,EACV,SAA8B;IAE9B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAEzC,IAAI,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,IAAI,QAAQ,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC;IAElC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;YACrB,QAAQ,GAAG,KAAK,CAAC;YACjB,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,GAAG,CACjB,KAAU,EACV,EAAwB;IAExB,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAE,IAAY,CAAC,EAAE,CAAC,CAAC,CAAC;AAC/E,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,OAAO,CACrB,KAAU,EACV,EAAwB;IAExB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACjC,OAAO,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;AACvC,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,IAAI,CAClB,KAAU,EACV,EAAwB;IAExB,OAAO,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;AAC5B,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,KAAK,CAAC,KAAa,EAAE,GAAY,EAAE,OAAe,CAAC;IACjE,qDAAqD;IACrD,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;QACtB,GAAG,GAAG,KAAK,CAAC;QACZ,KAAK,GAAG,CAAC,CAAC;IACZ,CAAC;IAED,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;YACxC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;SAAM,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;YACxC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,GAAG,CACjB,KAAU,EACV,EAAwB;IAExB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAEzC,IAAI,EAAE,EAAE,CAAC;QACP,IAAI,QAAQ,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3B,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;gBACrB,QAAQ,GAAG,KAAK,CAAC;YACnB,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,OAAO,IAAI,CAAC,GAAG,CAAC,GAAI,KAAkB,CAAC,CAAC;AAC1C,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,GAAG,CACjB,KAAU,EACV,EAAwB;IAExB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAEzC,IAAI,EAAE,EAAE,CAAC;QACP,IAAI,QAAQ,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3B,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;gBACrB,QAAQ,GAAG,KAAK,CAAC;YACnB,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,OAAO,IAAI,CAAC,GAAG,CAAC,GAAI,KAAkB,CAAC,CAAC;AAC1C,CAAC"}