@procedures/client 0.0.0-stage → 0.2.0

package/dist/collections/core/policies.js

@@ -0,0 +1,48 @@
+/**
+ * Policy types for configurable collection behaviors.
+ *
+ * Policies define how collections handle edge cases like overflow,
+ * underflow, and eviction. These are used by behavior decorators
+ * to provide flexible, composable behavior.
+ */
+// ============================================================================
+// Default policies
+// ============================================================================
+/**
+ * Default overflow policy: throw an error.
+ */
+export const DEFAULT_OVERFLOW_POLICY = "throw";
+/**
+ * Default underflow policy: throw an error.
+ */
+export const DEFAULT_UNDERFLOW_POLICY = "throw";
+/**
+ * Default eviction policy: FIFO (oldest first).
+ */
+export const DEFAULT_EVICTION_POLICY = "fifo";
+/**
+ * Default retry policy: 3 attempts with exponential backoff.
+ */
+export const DEFAULT_RETRY_POLICY = {
+    maxAttempts: 3,
+    initialDelay: 100,
+    backoff: "exponential",
+    maxDelay: 5000,
+    jitter: true,
+};
+/**
+ * Default conflict resolution: last write wins.
+ */
+export const DEFAULT_CONFLICT_POLICY = "last-write-wins";
+/**
+ * Default growth policy: double capacity.
+ */
+export const DEFAULT_GROWTH_POLICY = {
+    strategy: "double",
+    maxCapacity: Number.MAX_SAFE_INTEGER,
+};
+/**
+ * Default validation policy: throw on invalid.
+ */
+export const DEFAULT_VALIDATION_POLICY = "throw";
+//# sourceMappingURL=policies.js.map

package/dist/collections/core/policies.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"policies.js","sourceRoot":"","sources":["../../../src/collections/core/policies.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAsQH,+EAA+E;AAC/E,mBAAmB;AACnB,+EAA+E;AAE/E;;GAEG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAAmB,OAAO,CAAC;AAE/D;;GAEG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAoB,OAAO,CAAC;AAEjE;;GAEG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAAmB,MAAM,CAAC;AAE9D;;GAEG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAgB;IAC/C,WAAW,EAAE,CAAC;IACd,YAAY,EAAE,GAAG;IACjB,OAAO,EAAE,aAAa;IACtB,QAAQ,EAAE,IAAI;IACd,MAAM,EAAE,IAAI;CACb,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAClC,iBAAiB,CAAC;AAEpB;;GAEG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAiB;IACjD,QAAQ,EAAE,QAAQ;IAClB,WAAW,EAAE,MAAM,CAAC,gBAAgB;CACrC,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAAqB,OAAO,CAAC"}

package/dist/collections/core/traits.d.ts

@@ -0,0 +1,142 @@
+/**
+ * Core traits and capability interfaces for the collections framework.
+ *
+ * These traits define fundamental capabilities that collections can have,
+ * following the Interface Segregation Principle (SOLID).
+ */
+/**
+ * Equality comparison function.
+ * Returns true if two values are considered equal.
+ *
+ * @example
+ * const primitiveEq: Eq<number> = (a, b) => a === b
+ * const objectEq: Eq<Person> = (a, b) => a.id === b.id
+ */
+export type Eq<T> = (a: T, b: T) => boolean;
+/**
+ * Hash function for creating hash codes.
+ * Returns a 32-bit integer hash of the value.
+ *
+ * Must satisfy: if eq(a, b) === true, then hash(a) === hash(b)
+ *
+ * @example
+ * const stringHash: Hash<string> = (s) => {
+ *   let h = 0;
+ *   for (let i = 0; i < s.length; i++) {
+ *     h = ((h << 5) - h) + s.charCodeAt(i);
+ *     h = h & h; // Convert to 32-bit integer
+ *   }
+ *   return h;
+ * }
+ */
+export type Hash<T> = (value: T) => number;
+/**
+ * Comparison function for ordering values.
+ * Returns:
+ * - negative number if a < b
+ * - zero if a === b
+ * - positive number if a > b
+ *
+ * Must be transitive and consistent with equality.
+ *
+ * @example
+ * const numberCompare: Compare<number> = (a, b) => a - b
+ * const reverseCompare = <T>(cmp: Compare<T>): Compare<T> => (a, b) => cmp(b, a)
+ */
+export type Compare<T> = (a: T, b: T) => number;
+/**
+ * Capability: Has a size property.
+ */
+export interface Sized {
+    /** The number of elements in the collection. */
+    readonly size: number;
+}
+/**
+ * Capability: Can be cleared (all elements removed).
+ */
+export interface Clearable {
+    /** Removes all elements from the collection. */
+    clear(): void;
+}
+/**
+ * Capability: Can check if empty.
+ */
+export interface Emptiable {
+    /** Returns true if the collection contains no elements. */
+    readonly isEmpty: boolean;
+}
+/**
+ * Capability: Can be cloned.
+ */
+export interface Cloneable<T> {
+    /** Creates a shallow copy of the collection. */
+    clone(): T;
+}
+/**
+ * Capability: Can be converted to an array.
+ */
+export interface ArrayConvertible<T> {
+    /** Returns an array containing all elements in the collection. */
+    toArray(): T[];
+}
+/**
+ * Base read-only collection capabilities.
+ * Combines common traits that most collections share.
+ */
+export interface ReadonlyCollectionBase<T> extends Sized, Emptiable, Iterable<T>, ArrayConvertible<T> {
+}
+/**
+ * Base mutable collection capabilities.
+ * Adds mutation operations to readonly base.
+ */
+export interface MutableCollectionBase<T> extends ReadonlyCollectionBase<T>, Clearable {
+}
+/**
+ * Equality provider - allows collections to specify custom equality.
+ */
+export interface EqualityProvider<T> {
+    /** The equality function used by this collection. */
+    readonly eq: Eq<T>;
+}
+/**
+ * Hash provider - allows collections to specify custom hashing.
+ */
+export interface HashProvider<T> {
+    /** The hash function used by this collection. */
+    readonly hash: Hash<T>;
+}
+/**
+ * Comparison provider - allows collections to specify custom ordering.
+ */
+export interface ComparisonProvider<T> {
+    /** The comparison function used by this collection. */
+    readonly compare: Compare<T>;
+}
+/**
+ * Bounded collection - has a maximum capacity.
+ */
+export interface Bounded {
+    /** The maximum number of elements this collection can hold. */
+    readonly capacity: number;
+    /** Returns true if the collection is at capacity. */
+    readonly isFull: boolean;
+    /** Returns the number of additional elements that can be added. */
+    readonly remainingCapacity: number;
+}
+/**
+ * Disposable resource - can be explicitly cleaned up.
+ */
+export interface Disposable {
+    /** Releases any resources held by this collection. */
+    dispose(): void;
+}
+/**
+ * Freezable collection - can be made immutable.
+ */
+export interface Freezable<T> {
+    /** Makes this collection immutable. Returns self for chaining. */
+    freeze(): T;
+    /** Returns true if this collection is frozen. */
+    readonly isFrozen: boolean;
+}
+//# sourceMappingURL=traits.d.ts.map

package/dist/collections/core/traits.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"traits.d.ts","sourceRoot":"","sources":["../../../src/collections/core/traits.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH;;;;;;;GAOG;AACH,MAAM,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC;AAE5C;;;;;;;;;;;;;;;GAeG;AACH,MAAM,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,KAAK,MAAM,CAAC;AAE3C;;;;;;;;;;;;GAYG;AACH,MAAM,MAAM,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC;AAEhD;;GAEG;AACH,MAAM,WAAW,KAAK;IACpB,gDAAgD;IAChD,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAED;;GAEG;AACH,MAAM,WAAW,SAAS;IACxB,gDAAgD;IAChD,KAAK,IAAI,IAAI,CAAC;CACf;AAED;;GAEG;AACH,MAAM,WAAW,SAAS;IACxB,2DAA2D;IAC3D,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;CAC3B;AAED;;GAEG;AACH,MAAM,WAAW,SAAS,CAAC,CAAC;IAC1B,gDAAgD;IAChD,KAAK,IAAI,CAAC,CAAC;CACZ;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB,CAAC,CAAC;IACjC,kEAAkE;IAClE,OAAO,IAAI,CAAC,EAAE,CAAC;CAChB;AAED;;;GAGG;AACH,MAAM,WAAW,sBAAsB,CAAC,CAAC,CACvC,SAAQ,KAAK,EACX,SAAS,EACT,QAAQ,CAAC,CAAC,CAAC,EACX,gBAAgB,CAAC,CAAC,CAAC;CAAG;AAE1B;;;GAGG;AACH,MAAM,WAAW,qBAAqB,CAAC,CAAC,CACtC,SAAQ,sBAAsB,CAAC,CAAC,CAAC,EAC/B,SAAS;CAAG;AAEhB;;GAEG;AACH,MAAM,WAAW,gBAAgB,CAAC,CAAC;IACjC,qDAAqD;IACrD,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;CACpB;AAED;;GAEG;AACH,MAAM,WAAW,YAAY,CAAC,CAAC;IAC7B,iDAAiD;IACjD,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,kBAAkB,CAAC,CAAC;IACnC,uDAAuD;IACvD,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;CAC9B;AAED;;GAEG;AACH,MAAM,WAAW,OAAO;IACtB,+DAA+D;IAC/D,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAE1B,qDAAqD;IACrD,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;IAEzB,mEAAmE;IACnE,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC;CACpC;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB,sDAAsD;IACtD,OAAO,IAAI,IAAI,CAAC;CACjB;AAED;;GAEG;AACH,MAAM,WAAW,SAAS,CAAC,CAAC;IAC1B,kEAAkE;IAClE,MAAM,IAAI,CAAC,CAAC;IAEZ,iDAAiD;IACjD,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;CAC5B"}

package/dist/collections/core/traits.js

@@ -0,0 +1,8 @@
+/**
+ * Core traits and capability interfaces for the collections framework.
+ *
+ * These traits define fundamental capabilities that collections can have,
+ * following the Interface Segregation Principle (SOLID).
+ */
+export {};
+//# sourceMappingURL=traits.js.map

package/dist/collections/core/traits.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"traits.js","sourceRoot":"","sources":["../../../src/collections/core/traits.ts"],"names":[],"mappings":"AAAA;;;;;GAKG"}

package/dist/collections/examples.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Examples demonstrating the Collections Framework.
+ *
+ * These examples show how to use the collections framework
+ * with various compositions of behaviors.
+ */
+export declare function basicListExample(): void;
+export declare function hashMapExample(): void;
+export declare function dequeExample(): void;
+export declare function readonlyExample(): void;
+export declare function factoriesExample(): void;
+export declare function runAllExamples(): void;
+//# sourceMappingURL=examples.d.ts.map

package/dist/collections/examples.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"examples.d.ts","sourceRoot":"","sources":["../../src/collections/examples.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AA4BH,wBAAgB,gBAAgB,IAAK,IAAI,CAkBxC;AAyED,wBAAgB,cAAc,IAAK,IAAI,CAyBtC;AAmCD,wBAAgB,YAAY,IAAK,IAAI,CAqBpC;AAMD,wBAAgB,eAAe,IAAK,IAAI,CAsBvC;AAMD,wBAAgB,gBAAgB,IAAK,IAAI,CAmCxC;AAoFD,wBAAgB,cAAc,IAAK,IAAI,CAWtC"}

package/dist/collections/examples.js

@@ -0,0 +1,302 @@
+/**
+ * Examples demonstrating the Collections Framework.
+ *
+ * These examples show how to use the collections framework
+ * with various compositions of behaviors.
+ */
+import { arrayList, arrayDeque, hashMap, 
+// compose,
+// boundedList,
+// eventedList,
+// eventedMap,
+readonly, 
+// safeList,
+// synchronized,
+emptyList, singletonList, nCopies, range, listOf, mapOf, groupBy,
+// isSome,
+// isNone,
+ } from "./index.js";
+// ============================================================================
+// Example 1: Basic ArrayList usage
+// ============================================================================
+export function basicListExample() {
+    console.log("=== Basic ArrayList Example ===");
+    const list = arrayList();
+    list.add(1);
+    list.add(2);
+    list.add(3);
+    console.log("Size:", list.size); // 3
+    console.log("Get(1):", list.get(1)); // 2
+    console.log("Contains 2:", list.contains(2)); // true
+    list.push(4);
+    list.unshift(0);
+    console.log("Array:", list.toArray()); // [0, 1, 2, 3, 4]
+    list.sort((a, b) => b - a);
+    console.log("Sorted desc:", list.toArray()); // [4, 3, 2, 1, 0]
+}
+// ============================================================================
+// Example 2: Bounded + Evented List
+// ============================================================================
+// NOTE: Composition examples temporarily disabled pending middleware type improvements
+/*
+export function boundedEventedListExample() {
+  console.log("\n=== Bounded + Evented List Example ===");
+
+  const list = compose(
+    eventedList<number>(),
+    boundedList<number>({
+      capacity: 3,
+      policy: "drop-oldest",
+      onOverflow: ({ newElement, currentSize }) => {
+        console.log(`Overflow! Adding ${newElement}, size: ${currentSize}`);
+      },
+    })
+  )(arrayList<number>());
+
+  // Listen to events
+  list.on("add", ({ value }) => {
+    console.log(`Event: Added ${value}`);
+  });
+
+  // Add elements
+  list.add(1); // Event: Added 1
+  list.add(2); // Event: Added 2
+  list.add(3); // Event: Added 3
+  list.add(4); // Overflow! Drops 1, adds 4
+
+  console.log("Final list:", list.toArray()); // [2, 3, 4]
+  console.log("Is full?", list.isFull); // true
+  console.log("Remaining capacity:", list.remainingCapacity); // 0
+}
+*/
+// ============================================================================
+// Example 3: Safe List (Option-based error handling)
+// ============================================================================
+// NOTE: Composition examples temporarily disabled pending middleware type improvements
+/*
+export function safeListExample() {
+  console.log("\n=== Safe List Example ===");
+
+  const list = compose(safeList<number>())(arrayList([10, 20, 30]));
+
+  // Safe get returns Option
+  const value1 = list.safe.get(1);
+  if (isSome(value1)) {
+    console.log("Value at index 1:", value1.value); // 20
+  }
+
+  const value2 = list.safe.get(10);
+  if (isNone(value2)) {
+    console.log("Index 10 is out of bounds"); // This prints
+  }
+
+  // Safe pop
+  const popped = list.safe.pop();
+  if (isSome(popped)) {
+    console.log("Popped:", popped.value); // 30
+  }
+}
+*/
+// ============================================================================
+// Example 4: HashMap with custom equality
+// ============================================================================
+export function hashMapExample() {
+    console.log("\n=== HashMap Example ===");
+    const map = hashMap({
+        keyEq: (a, b) => a.id === b.id,
+        keyHash: (u) => u.id,
+    });
+    const alice = { id: 1, name: "Alice" };
+    const bob = { id: 2, name: "Bob" };
+    map.set(alice, "Engineer");
+    map.set(bob, "Designer");
+    // Can look up with different object with same id
+    const aliceClone = { id: 1, name: "Alice Clone" };
+    console.log("Alice's role:", map.get(aliceClone)); // "Engineer"
+    console.log("Size:", map.size); // 2
+    console.log("Has Bob?", map.has(bob)); // true
+}
+// ============================================================================
+// Example 5: Evented Map with listeners
+// ============================================================================
+// NOTE: Composition examples temporarily disabled pending middleware type improvements
+/*
+export function eventedMapExample() {
+  console.log("\n=== Evented Map Example ===");
+
+  const map = compose(eventedMap<string, number>())(hashMap<string, number>());
+
+  map.on("set", ({ key, value, oldValue }) => {
+    if (oldValue !== undefined) {
+      console.log(`Updated ${key}: ${oldValue} -> ${value}`);
+    } else {
+      console.log(`Added ${key}: ${value}`);
+    }
+  });
+
+  map.on("delete", ({ key, value }) => {
+    console.log(`Deleted ${key} (was ${value})`);
+  });
+
+  map.set("score", 100); // Added score: 100
+  map.set("score", 150); // Updated score: 100 -> 150
+  map.delete("score"); // Deleted score (was 150)
+}
+*/
+// ============================================================================
+// Example 6: ArrayDeque (double-ended queue)
+// ============================================================================
+export function dequeExample() {
+    console.log("\n=== ArrayDeque Example ===");
+    const deque = arrayDeque();
+    // Add to both ends
+    deque.addFirst("middle");
+    deque.addFirst("front");
+    deque.addLast("back");
+    console.log("Array:", deque.toArray()); // ["front", "middle", "back"]
+    // Use as stack (LIFO)
+    deque.push("top");
+    console.log("Pop:", deque.pop()); // "top"
+    // Use as queue (FIFO)
+    deque.offer("end");
+    console.log("Poll:", deque.poll()); // "front"
+    console.log("Final:", deque.toArray()); // ["middle", "back", "end"]
+}
+// ============================================================================
+// Example 7: Readonly collections
+// ============================================================================
+export function readonlyExample() {
+    console.log("\n=== Readonly Example ===");
+    const mutableList = arrayList([1, 2, 3]);
+    const readonlyList = readonly()(mutableList);
+    console.log("Get(0):", readonlyList.get(0)); // 1
+    console.log("Size:", readonlyList.size); // 3
+    try {
+        readonlyList.add(4); // This will throw
+    }
+    catch (error) {
+        console.log("Error:", error.message); // "Cannot modify readonly collection"
+    }
+    // Immutable factories
+    emptyList();
+    const singleton = singletonList(42);
+    const copies = nCopies(5, "hello");
+    console.log("Singleton:", singleton.toArray()); // [42]
+    console.log("Copies:", copies.toArray()); // ["hello", "hello", "hello", "hello", "hello"]
+}
+// ============================================================================
+// Example 8: Factory utilities
+// ============================================================================
+export function factoriesExample() {
+    console.log("\n=== Factories Example ===");
+    // Create from varargs
+    const list = listOf(1, 2, 3, 4, 5);
+    console.log("listOf:", list.toArray());
+    // Create map
+    const map = mapOf(["one", 1], ["two", 2], ["three", 3]);
+    console.log("mapOf keys:", Array.from(map.keys()));
+    // Range
+    const numbers = range(0, 10, 2);
+    console.log("range(0, 10, 2):", numbers.toArray()); // [0, 2, 4, 6, 8]
+    const people = [
+        { name: "Alice", age: 25 },
+        { name: "Bob", age: 30 },
+        { name: "Charlie", age: 25 },
+        { name: "David", age: 30 },
+    ];
+    const byAge = groupBy(people, (p) => p.age);
+    console.log("People aged 25:", byAge.get(25)?.toArray());
+    console.log("People aged 30:", byAge.get(30)?.toArray());
+}
+// ============================================================================
+// Example 9: Complex composition
+// ============================================================================
+// NOTE: Composition examples temporarily disabled pending middleware type improvements
+/*
+export function complexCompositionExample() {
+  console.log("\n=== Complex Composition Example ===");
+
+  // Create a bounded, evented, safe list
+  const list = compose(
+    safeList<number>(),
+    eventedList<number>(),
+    boundedList<number>({ capacity: 5, policy: "reject" })
+  )(arrayList<number>());
+
+  // Subscribe to events
+  list.on("add", ({ value }) => console.log(`Added: ${value}`));
+
+  // Add elements safely
+  for (let i = 0; i < 7; i++) {
+    const added = list.add(i);
+    if (!added) {
+      console.log(`Rejected: ${i} (list is full)`);
+    }
+  }
+
+  // Use safe operations
+  const value = list.safe.get(2);
+  if (isSome(value)) {
+    console.log("Value at index 2:", value.value);
+  }
+
+  console.log("Final list:", list.toArray());
+  console.log("Is full?", list.isFull);
+}
+*/
+// ============================================================================
+// Example 10: All behaviors together
+// ============================================================================
+// NOTE: Composition examples temporarily disabled pending middleware type improvements
+/*
+export function allBehaviorsExample() {
+  console.log("\n=== All Behaviors Example ===");
+
+  const list = compose(
+    synchronized<any>(), // Thread-safe
+    safeList<number>(), // Option/Result API
+    eventedList<number>(), // Mutation events
+    boundedList<number>({ capacity: 10, policy: "drop-oldest" }) // Capacity limit
+  )(arrayList<number>());
+
+  list.on("add", ({ value }) => console.log(`[Event] Added: ${value}`));
+
+  // All operations are now:
+  // - Thread-safe (synchronized)
+  // - Size-limited (bounded)
+  // - Observable (evented)
+  // - Have safe alternatives (safe)
+
+  list.add(1);
+  list.add(2);
+  list.add(3);
+
+  const safeValue = list.safe.get(1);
+  console.log("Safe get result:", isSome(safeValue) ? safeValue.value : "None");
+
+  console.log("Final state:", {
+    size: list.size,
+    capacity: list.capacity,
+    isFull: list.isFull,
+    array: list.toArray(),
+  });
+}
+*/
+// ============================================================================
+// Run all examples
+// ============================================================================
+export function runAllExamples() {
+    basicListExample();
+    // boundedEventedListExample(); // Disabled - pending middleware type improvements
+    // safeListExample(); // Disabled - pending middleware type improvements
+    hashMapExample();
+    // eventedMapExample(); // Disabled - pending middleware type improvements
+    dequeExample();
+    readonlyExample();
+    factoriesExample();
+    // complexCompositionExample(); // Disabled - pending middleware type improvements
+    // allBehaviorsExample(); // Disabled - pending middleware type improvements
+}
+// Uncomment to run examples:
+// runAllExamples();
+//# sourceMappingURL=examples.js.map

package/dist/collections/examples.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"examples.js","sourceRoot":"","sources":["../../src/collections/examples.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EACL,SAAS,EACT,UAAU,EACV,OAAO;AACP,WAAW;AACX,eAAe;AACf,eAAe;AACf,cAAc;AACd,QAAQ;AACR,YAAY;AACZ,gBAAgB;AAChB,SAAS,EACT,aAAa,EACb,OAAO,EACP,KAAK,EACL,MAAM,EACN,KAAK,EACL,OAAO;AACP,UAAU;AACV,UAAU;EACX,MAAM,YAAY,CAAC;AAEpB,+EAA+E;AAC/E,mCAAmC;AACnC,+EAA+E;AAE/E,MAAM,UAAU,gBAAgB;IAC9B,OAAO,CAAC,GAAG,CAAC,iCAAiC,CAAC,CAAC;IAE/C,MAAM,IAAI,GAAG,SAAS,EAAU,CAAC;IACjC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAEZ,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI;IACrC,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI;IACzC,OAAO,CAAC,GAAG,CAAC,aAAa,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO;IAErD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACb,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAChB,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,kBAAkB;IAEzD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAU,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5C,OAAO,CAAC,GAAG,CAAC,cAAc,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,kBAAkB;AACjE,CAAC;AAED,+EAA+E;AAC/E,oCAAoC;AACpC,+EAA+E;AAE/E,uFAAuF;AACvF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EA8BE;AAEF,+EAA+E;AAC/E,qDAAqD;AACrD,+EAA+E;AAE/E,uFAAuF;AACvF;;;;;;;;;;;;;;;;;;;;;;;EAuBE;AAEF,+EAA+E;AAC/E,0CAA0C;AAC1C,+EAA+E;AAE/E,MAAM,UAAU,cAAc;IAC5B,OAAO,CAAC,GAAG,CAAC,2BAA2B,CAAC,CAAC;IAOzC,MAAM,GAAG,GAAG,OAAO,CAAe;QAChC,KAAK,EAAE,CAAC,CAAO,EAAE,CAAO,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE;QAC1C,OAAO,EAAE,CAAC,CAAO,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE;KAC3B,CAAC,CAAC;IAEH,MAAM,KAAK,GAAS,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;IAC7C,MAAM,GAAG,GAAS,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;IAEzC,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;IAC3B,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;IAEzB,iDAAiD;IACjD,MAAM,UAAU,GAAS,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC;IACxD,OAAO,CAAC,GAAG,CAAC,eAAe,EAAE,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,aAAa;IAEhE,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI;IACpC,OAAO,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO;AAChD,CAAC;AAED,+EAA+E;AAC/E,wCAAwC;AACxC,+EAA+E;AAE/E,uFAAuF;AACvF;;;;;;;;;;;;;;;;;;;;;;EAsBE;AAEF,+EAA+E;AAC/E,6CAA6C;AAC7C,+EAA+E;AAE/E,MAAM,UAAU,YAAY;IAC1B,OAAO,CAAC,GAAG,CAAC,8BAA8B,CAAC,CAAC;IAE5C,MAAM,KAAK,GAAG,UAAU,EAAU,CAAC;IAEnC,mBAAmB;IACnB,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;IACzB,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;IACxB,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAEtB,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,8BAA8B;IAEtE,sBAAsB;IACtB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClB,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,QAAQ;IAE1C,sBAAsB;IACtB,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACnB,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,UAAU;IAE9C,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,4BAA4B;AACtE,CAAC;AAED,+EAA+E;AAC/E,kCAAkC;AAClC,+EAA+E;AAE/E,MAAM,UAAU,eAAe;IAC7B,OAAO,CAAC,GAAG,CAAC,4BAA4B,CAAC,CAAC;IAE1C,MAAM,WAAW,GAAG,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACzC,MAAM,YAAY,GAAG,QAAQ,EAAE,CAAC,WAAW,CAAuB,CAAC;IAEnE,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI;IACjD,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI;IAE7C,IAAI,CAAC;QACF,YAAoB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,kBAAkB;IAClD,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAG,KAAe,CAAC,OAAO,CAAC,CAAC,CAAC,sCAAsC;IACzF,CAAC;IAED,sBAAsB;IACtB,SAAS,EAAU,CAAC;IACpB,MAAM,SAAS,GAAG,aAAa,CAAC,EAAE,CAAC,CAAC;IACpC,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IAEnC,OAAO,CAAC,GAAG,CAAC,YAAY,EAAE,SAAS,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,OAAO;IACvD,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,gDAAgD;AAC5F,CAAC;AAED,+EAA+E;AAC/E,+BAA+B;AAC/B,+EAA+E;AAE/E,MAAM,UAAU,gBAAgB;IAC9B,OAAO,CAAC,GAAG,CAAC,6BAA6B,CAAC,CAAC;IAE3C,sBAAsB;IACtB,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACnC,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;IAEvC,aAAa;IACb,MAAM,GAAG,GAAG,KAAK,CACf,CAAC,KAAK,EAAE,CAAC,CAAC,EACV,CAAC,KAAK,EAAE,CAAC,CAAC,EACV,CAAC,OAAO,EAAE,CAAC,CAAC,CACb,CAAC;IACF,OAAO,CAAC,GAAG,CAAC,aAAa,EAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAEnD,QAAQ;IACR,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IAChC,OAAO,CAAC,GAAG,CAAC,kBAAkB,EAAE,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,kBAAkB;IAQtE,MAAM,MAAM,GAAa;QACvB,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE;QAC1B,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE;QACxB,EAAE,IAAI,EAAE,SAAS,EAAE,GAAG,EAAE,EAAE,EAAE;QAC5B,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE;KAC3B,CAAC;IAEF,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACpD,OAAO,CAAC,GAAG,CAAC,iBAAiB,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC;IACzD,OAAO,CAAC,GAAG,CAAC,iBAAiB,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC;AAC3D,CAAC;AAED,+EAA+E;AAC/E,iCAAiC;AACjC,+EAA+E;AAE/E,uFAAuF;AACvF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EA+BE;AAEF,+EAA+E;AAC/E,qCAAqC;AACrC,+EAA+E;AAE/E,uFAAuF;AACvF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAiCE;AAEF,+EAA+E;AAC/E,mBAAmB;AACnB,+EAA+E;AAE/E,MAAM,UAAU,cAAc;IAC5B,gBAAgB,EAAE,CAAC;IACnB,kFAAkF;IAClF,wEAAwE;IACxE,cAAc,EAAE,CAAC;IACjB,0EAA0E;IAC1E,YAAY,EAAE,CAAC;IACf,eAAe,EAAE,CAAC;IAClB,gBAAgB,EAAE,CAAC;IACnB,kFAAkF;IAClF,4EAA4E;AAC9E,CAAC;AAED,6BAA6B;AAC7B,oBAAoB"}