@jmruthers/pace-core 0.5.181 → 0.5.183

package/dist/chunk-7QCC6MCP.js

@@ -1,288 +0,0 @@
-import {
-  createLogger,
-  init_logger
-} from "./chunk-XDNLUEXI.js";
-import {
-  __esm
-} from "./chunk-PLDDJCW6.js";
-
-// src/utils/context/organisationContext.ts
-async function setOrganisationContext(supabase, organisationId) {
-  if (!supabase || !organisationId) {
-    return;
-  }
-  try {
-    const timeoutPromise = new Promise((_, reject) => {
-      setTimeout(() => reject(new Error("RPC timeout after 3 seconds")), 3e3);
-    });
-    const rpcPromise = supabase.rpc("set_organisation_context", {
-      org_id: organisationId
-    });
-    const { error } = await Promise.race([rpcPromise, timeoutPromise]);
-    if (error) {
-      log.debug("RPC function not available or failed, continuing without database context");
-    } else {
-      log.debug("Organisation context set in database successfully");
-    }
-  } catch (error) {
-    log.debug("Failed to set database context, continuing without it:", error);
-  }
-}
-async function clearOrganisationContext(supabase) {
-  if (!supabase) {
-    return;
-  }
-  try {
-    const { error } = await supabase.rpc("rbac_audit_log", {
-      p_event_type: "organisation_switched",
-      p_metadata: { action: "clear_context" }
-    });
-    if (error) {
-    } else {
-    }
-  } catch (error) {
-  }
-}
-async function getOrganisationContext(supabase) {
-  if (!supabase) {
-    return null;
-  }
-  try {
-    const data = null;
-    const error = null;
-    if (error) {
-      return null;
-    }
-    if (typeof data === "string") {
-      return data;
-    }
-    return null;
-  } catch (error) {
-    return null;
-  }
-}
-async function isOrganisationContextAvailable(supabase) {
-  if (!supabase) {
-    return false;
-  }
-  try {
-    const { error } = await supabase.rpc("get_organisation_context");
-    if (error) {
-      return false;
-    }
-    return true;
-  } catch (error) {
-    return false;
-  }
-}
-var log;
-var init_organisationContext = __esm({
-  "src/utils/context/organisationContext.ts"() {
-    "use strict";
-    init_logger();
-    log = createLogger("organisationContext");
-  }
-});
-
-// src/utils/security/secureStorage.ts
-var SecureStorageImpl, secureStorage;
-var init_secureStorage = __esm({
-  "src/utils/security/secureStorage.ts"() {
-    "use strict";
-    SecureStorageImpl = class {
-      constructor() {
-        this.encryptionKey = null;
-        this.initialized = false;
-      }
-      /**
-       * Initialize secure storage with encryption
-       */
-      async init() {
-        if (this.initialized) return;
-        try {
-          if (window.crypto && window.crypto.subtle) {
-            const keyData = localStorage.getItem("_sec_key");
-            if (keyData) {
-              try {
-                const keyBuffer = this.base64ToArrayBuffer(keyData);
-                this.encryptionKey = await window.crypto.subtle.importKey(
-                  "raw",
-                  keyBuffer,
-                  { name: "AES-GCM" },
-                  false,
-                  ["encrypt", "decrypt"]
-                );
-              } catch (error) {
-                await this.generateNewKey();
-              }
-            } else {
-              await this.generateNewKey();
-            }
-          }
-          this.initialized = true;
-        } catch (error) {
-          this.initialized = true;
-        }
-      }
-      /**
-       * Store item securely
-       */
-      async setItem(key, value, options = {}) {
-        await this.init();
-        const data = {
-          value,
-          timestamp: Date.now(),
-          expiry: options.expiry ? Date.now() + options.expiry : void 0
-        };
-        const serialized = JSON.stringify(data);
-        if (options.encrypt && this.encryptionKey) {
-          try {
-            const encrypted = await this.encrypt(serialized);
-            localStorage.setItem(`_sec_${key}`, encrypted);
-            return;
-          } catch (error) {
-          }
-        }
-        localStorage.setItem(key, serialized);
-      }
-      /**
-       * Retrieve item securely
-       */
-      async getItem(key) {
-        await this.init();
-        const encryptedData = localStorage.getItem(`_sec_${key}`);
-        if (encryptedData && this.encryptionKey) {
-          try {
-            const decrypted = await this.decrypt(encryptedData);
-            const parsed = JSON.parse(decrypted);
-            if (parsed.expiry && Date.now() > parsed.expiry) {
-              await this.removeItem(key);
-              return null;
-            }
-            return parsed.value;
-          } catch (error) {
-          }
-        }
-        const plainData = localStorage.getItem(key);
-        if (!plainData) return null;
-        try {
-          const parsed = JSON.parse(plainData);
-          if (parsed.expiry && Date.now() > parsed.expiry) {
-            await this.removeItem(key);
-            return null;
-          }
-          return parsed.value || plainData;
-        } catch (error) {
-          return plainData;
-        }
-      }
-      /**
-       * Remove item
-       */
-      async removeItem(key) {
-        localStorage.removeItem(key);
-        localStorage.removeItem(`_sec_${key}`);
-      }
-      /**
-       * Clear all secure storage
-       */
-      async clear() {
-        const keys = Object.keys(localStorage);
-        for (const key of keys) {
-          if (key.startsWith("_sec_")) {
-            localStorage.removeItem(key);
-          }
-        }
-      }
-      /**
-       * Generate new encryption key
-       */
-      async generateNewKey() {
-        if (!window.crypto?.subtle) return;
-        try {
-          this.encryptionKey = await window.crypto.subtle.generateKey(
-            { name: "AES-GCM", length: 256 },
-            true,
-            ["encrypt", "decrypt"]
-          );
-          const exportedKey = await window.crypto.subtle.exportKey("raw", this.encryptionKey);
-          const keyData = this.arrayBufferToBase64(exportedKey);
-          localStorage.setItem("_sec_key", keyData);
-        } catch (error) {
-        }
-      }
-      /**
-       * Encrypt data
-       */
-      async encrypt(data) {
-        if (!this.encryptionKey || !window.crypto?.subtle) {
-          throw new Error("Encryption not available");
-        }
-        const encoder = new TextEncoder();
-        const dataBuffer = encoder.encode(data);
-        const iv = window.crypto.getRandomValues(new Uint8Array(12));
-        const encrypted = await window.crypto.subtle.encrypt(
-          { name: "AES-GCM", iv },
-          this.encryptionKey,
-          dataBuffer
-        );
-        const combined = new Uint8Array(iv.length + encrypted.byteLength);
-        combined.set(iv);
-        combined.set(new Uint8Array(encrypted), iv.length);
-        return this.arrayBufferToBase64(combined.buffer);
-      }
-      /**
-       * Decrypt data
-       */
-      async decrypt(encryptedData) {
-        if (!this.encryptionKey || !window.crypto?.subtle) {
-          throw new Error("Decryption not available");
-        }
-        const combined = this.base64ToArrayBuffer(encryptedData);
-        const iv = combined.slice(0, 12);
-        const encrypted = combined.slice(12);
-        const decrypted = await window.crypto.subtle.decrypt(
-          { name: "AES-GCM", iv },
-          this.encryptionKey,
-          encrypted
-        );
-        const decoder = new TextDecoder();
-        return decoder.decode(decrypted);
-      }
-      /**
-       * Convert ArrayBuffer to base64
-       */
-      arrayBufferToBase64(buffer) {
-        const bytes = new Uint8Array(buffer);
-        let binary = "";
-        for (let i = 0; i < bytes.byteLength; i++) {
-          binary += String.fromCharCode(bytes[i]);
-        }
-        return btoa(binary);
-      }
-      /**
-       * Convert base64 to ArrayBuffer
-       */
-      base64ToArrayBuffer(base64) {
-        const binary = atob(base64);
-        const bytes = new Uint8Array(binary.length);
-        for (let i = 0; i < binary.length; i++) {
-          bytes[i] = binary.charCodeAt(i);
-        }
-        return bytes.buffer;
-      }
-    };
-    secureStorage = new SecureStorageImpl();
-  }
-});
-
-export {
-  setOrganisationContext,
-  clearOrganisationContext,
-  getOrganisationContext,
-  isOrganisationContextAvailable,
-  init_organisationContext,
-  secureStorage,
-  init_secureStorage
-};
-//# sourceMappingURL=chunk-7QCC6MCP.js.map

package/dist/chunk-BESYRHQM.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/hooks/useToast.ts","../src/components/DataTable/utils/performanceUtils.ts","../src/components/DataTable/utils/errorHandling.ts","../src/hooks/useDataTablePerformance.ts"],"sourcesContent":["\n/**\n * @file Toast hook for managing toast notifications\n * @package @jmruthers/pace-core\n * @module Hooks\n * @since 0.1.0\n *\n * Toast notifications automatically dismiss after 5 seconds by default.\n * The duration is fixed to the pace-core default to ensure consistent behaviour.\n */\n\nimport * as React from \"react\"\n\n/** Maximum number of toasts to show at once */\nconst TOAST_LIMIT = 5\n/** Delay before removing a dismissed toast */\nconst TOAST_REMOVE_DELAY = 1000\n/** Default duration for auto-dismissing toasts (5 seconds) */\nconst DEFAULT_TOAST_DURATION = 5000\n\nexport interface ToastProps {\n  title?: React.ReactNode;\n  description?: React.ReactNode;\n  variant?: 'default' | 'destructive' | 'success';\n  onClose?: () => void;\n  action?: React.ReactElement;\n}\n\n/**\n * Extended toast props with additional properties\n * @interface ToasterToast\n */\ntype ToasterToast = ToastProps & {\n  /** Unique identifier for the toast */\n  id: string\n  /** Duration before automatic dismissal in milliseconds */\n  duration?: number\n  /** Optional title content */\n  title?: React.ReactNode\n  /** Optional description content */\n  description?: React.ReactNode\n  /** Optional action button */\n  action?: React.ReactElement\n  /** Open state */\n  open?: boolean\n  /** Open change handler */\n  onOpenChange?: (open: boolean) => void\n  /** Dismiss function */\n  dismiss?: () => void\n}\n\n/**\n * State interface for toast management\n */\ninterface State {\n  /** Array of active toasts */\n  toasts: ToasterToast[]\n}\n\n/** Map of toast IDs to their removal timeouts */\nconst toastTimeouts = new Map<string, ReturnType<typeof setTimeout>>()\n\n/** Current toast state */\nlet memoryState: State = {\n  toasts: [],\n}\n\n/** List of state change listeners */\nconst listeners: Array<(state: State) => void> = []\n\n/**\n * Reset the toast state and clear all timeouts\n */\nexport function reset() {\n  memoryState = { toasts: [] }\n  toastTimeouts.forEach((timeout) => clearTimeout(timeout))\n  toastTimeouts.clear()\n}\n\n/**\n * Dispatch a state change\n * @param action - Action to dispatch\n */\nfunction dispatch(action: {\n  type: \"ADD_TOAST\" | \"UPDATE_TOAST\" | \"DISMISS_TOAST\" | \"REMOVE_TOAST\"\n  toast?: ToasterToast\n  toastId?: string\n}) {\n  memoryState = reducer(memoryState, action)\n  listeners.forEach((listener) => {\n    listener(memoryState)\n  })\n}\n\n/**\n * Generate a unique ID for a toast\n * @returns Unique ID string\n */\nfunction genId() {\n  return Math.random().toString(36).substring(2, 9)\n}\n\n/**\n * Add a toast to the removal queue\n * @param toastId - ID of the toast to remove\n */\nconst addToRemoveQueue = (toastId: string) => {\n  if (toastTimeouts.has(toastId)) {\n    return\n  }\n\n  const timeout = setTimeout(() => {\n    toastTimeouts.delete(toastId)\n    dispatch({\n      type: \"REMOVE_TOAST\",\n      toastId: toastId,\n    })\n  }, TOAST_REMOVE_DELAY)\n\n  toastTimeouts.set(toastId, timeout)\n}\n\n/**\n * State reducer for toast management\n * @param state - Current state\n * @param action - Action to process\n * @returns New state\n */\nfunction reducer(state: State, action: {\n  type: \"ADD_TOAST\" | \"UPDATE_TOAST\" | \"DISMISS_TOAST\" | \"REMOVE_TOAST\"\n  toast?: ToasterToast\n  toastId?: string\n}): State {\n  switch (action.type) {\n    case \"ADD_TOAST\":\n      return {\n        ...state,\n        toasts: [action.toast!, ...state.toasts].slice(0, TOAST_LIMIT),\n      }\n\n    case \"UPDATE_TOAST\":\n      return {\n        ...state,\n        toasts: state.toasts.map((t) =>\n          t.id === action.toast?.id ? { ...t, ...action.toast } : t\n        ),\n      }\n\n    case \"DISMISS_TOAST\": {\n      const { toastId } = action\n\n      if (toastId) {\n        addToRemoveQueue(toastId)\n      }\n\n      return {\n        ...state,\n        toasts: state.toasts.map((t) =>\n          t.id === toastId || toastId === undefined\n            ? {\n                ...t,\n                open: false,\n              }\n            : t\n        ),\n      }\n    }\n\n    case \"REMOVE_TOAST\":\n      if (action.toastId === undefined) {\n        return {\n          ...state,\n          toasts: [],\n        }\n      }\n      return {\n        ...state,\n        toasts: state.toasts.filter((t) => t.id !== action.toastId),\n      }\n  }\n}\n\n/**\n * Toast configuration without ID\n * Duration is fixed to DEFAULT_TOAST_DURATION and cannot be overridden\n */\ntype Toast = Omit<ToasterToast, \"id\" | \"duration\">\n\n/**\n * Creates a new toast notification\n * @param props - Toast configuration. Duration is automatically set to 5 seconds (5000ms) and cannot be customized.\n * @returns Object with toast ID and control methods\n */\nfunction toast(props: Toast) {\n  const id = genId()\n\n  const update = (props: Partial<Omit<ToasterToast, \"id\" | \"duration\">>) =>\n    dispatch({\n      type: \"UPDATE_TOAST\",\n      toast: { ...props, duration: DEFAULT_TOAST_DURATION, id },\n    })\n  const dismiss = () => dispatch({ type: \"DISMISS_TOAST\", toastId: id })\n\n  dispatch({\n    type: \"ADD_TOAST\",\n    toast: {\n      ...props,\n      duration: DEFAULT_TOAST_DURATION,\n      id,\n      open: true,\n      dismiss,\n      onOpenChange: (open) => {\n        if (!open) dismiss()\n      },\n    },\n  })\n\n  return {\n    id: id,\n    dismiss,\n    update,\n  }\n}\n\n/**\n * Hook for managing toast notifications\n * @returns Object with toast state and control methods\n */\nfunction useToast() {\n  const [state, setState] = React.useState<State>(memoryState)\n\n  React.useEffect(() => {\n    listeners.push(setState)\n    return () => {\n      const index = listeners.indexOf(setState)\n      if (index > -1) {\n        listeners.splice(index, 1)\n      }\n    }\n  }, [state])\n\n  return {\n    ...state,\n    toast,\n    dismiss: (toastId?: string) => dispatch({ type: \"DISMISS_TOAST\", toastId }),\n  }\n}\n\nexport { useToast, toast }\nexport type { ToasterToast }\n","/**\n * @file Performance Utilities for DataTable\n * @package @jmruthers/pace-core\n * @module Components/DataTable/Utils/Performance\n * @since 0.3.0\n */\n\nimport type { \n  DataRecord, \n  PaginationMode, \n  ChunkingConfig, \n  SearchIndexConfig\n} from '../types';\n\n// ============================================================================\n// PAGINATION MODE DETECTION\n// ============================================================================\n\n/**\n * Determines the optimal pagination mode based on dataset size\n * \n * IMPORTANT: This function NEVER returns 'server' mode - it only returns 'client' or 'hybrid'.\n * Server mode should ONLY be used when serverSide config is explicitly provided.\n * Returning 'server' without serverSide config breaks pagination because TanStack Table\n * expects pre-paginated data but receives all client-side data.\n * \n * For large datasets (>10k rows), returns 'hybrid' which still uses client-side pagination\n * but with optimizations. If true server-side pagination is needed, serverSide config must be provided.\n */\nexport function determinePaginationMode(\n  dataLength: number,\n  serverSideThreshold: number = 10000\n): 'client' | 'hybrid' {\n  if (dataLength <= 1000) return 'client';\n  // Even for very large datasets, use 'hybrid' mode (client-side pagination with optimizations)\n  // unless serverSide config is explicitly provided (handled in useDataTablePerformance)\n  return 'hybrid';\n}\n\n/**\n * Gets optimal page size options based on pagination mode and dataset size\n */\nexport function getOptimalPageSizeOptions(\n  mode: PaginationMode,\n  dataLength: number\n): number[] {\n  switch (mode) {\n    case 'client':\n      return dataLength <= 100 ? [10, 25, 50] : [10, 25, 50, 100];\n    case 'hybrid':\n      return [50, 100, 250, 500];\n    case 'server':\n      return [25, 50, 100, 250];\n    default:\n      return [10, 25, 50, 100];\n  }\n}\n\n// ============================================================================\n// DATA CHUNKING\n// ============================================================================\n\n/**\n * Splits data into chunks for memory management\n */\nexport function chunkData<TData extends DataRecord>(\n  data: TData[],\n  chunkSize: number\n): TData[][] {\n  const chunks: TData[][] = [];\n  for (let i = 0; i < data.length; i += chunkSize) {\n    chunks.push(data.slice(i, i + chunkSize));\n  }\n  return chunks;\n}\n\n/**\n * Manages data chunks with LRU cache\n */\nexport class DataChunkManager<TData extends DataRecord> {\n  private chunks: Map<number, TData[]> = new Map();\n  private accessOrder: number[] = [];\n  private maxChunks: number;\n  private chunkSize: number;\n\n  constructor(config: ChunkingConfig) {\n    this.maxChunks = config.maxChunksInMemory;\n    this.chunkSize = config.chunkSize;\n  }\n\n  getChunk(chunkIndex: number, allData: TData[]): TData[] {\n    // Check if chunk is already in memory\n    if (this.chunks.has(chunkIndex)) {\n      this.updateAccessOrder(chunkIndex);\n      return this.chunks.get(chunkIndex)!;\n    }\n\n    // Calculate chunk bounds\n    const startIndex = chunkIndex * this.chunkSize;\n    const endIndex = Math.min(startIndex + this.chunkSize, allData.length);\n    const chunk = allData.slice(startIndex, endIndex);\n\n    // Add chunk to memory\n    this.addChunk(chunkIndex, chunk);\n    return chunk;\n  }\n\n  private addChunk(chunkIndex: number, chunk: TData[]): void {\n    // Remove oldest chunk if at capacity\n    if (this.chunks.size >= this.maxChunks && !this.chunks.has(chunkIndex)) {\n      const oldestChunk = this.accessOrder.shift();\n      if (oldestChunk !== undefined) {\n        this.chunks.delete(oldestChunk);\n      }\n    }\n\n    this.chunks.set(chunkIndex, chunk);\n    this.updateAccessOrder(chunkIndex);\n  }\n\n  private updateAccessOrder(chunkIndex: number): void {\n    const existingIndex = this.accessOrder.indexOf(chunkIndex);\n    if (existingIndex > -1) {\n      this.accessOrder.splice(existingIndex, 1);\n    }\n    this.accessOrder.push(chunkIndex);\n  }\n\n  clear(): void {\n    this.chunks.clear();\n    this.accessOrder = [];\n  }\n\n  getMemoryUsage(): number {\n    let totalSize = 0;\n    for (const chunk of this.chunks.values()) {\n      totalSize += JSON.stringify(chunk).length;\n    }\n    return totalSize / (1024 * 1024); // Convert to MB\n  }\n}\n\n// ============================================================================\n// SEARCH INDEXING\n// ============================================================================\n\n/**\n * Creates a search index for fast text searching\n */\nexport class SearchIndex<TData extends DataRecord> {\n  private index: Map<string, Set<number>> = new Map();\n  private data: TData[] = [];\n  private indexedFields: string[];\n  private fuzzySearch: boolean;\n  private fuzzyThreshold: number;\n\n  constructor(config: SearchIndexConfig) {\n    this.indexedFields = config.indexedFields;\n    this.fuzzySearch = config.fuzzySearch ?? false;\n    this.fuzzyThreshold = config.fuzzyThreshold ?? 0.6;\n  }\n\n  buildIndex(data: TData[]): void {\n    this.data = data;\n    this.index.clear();\n\n    data.forEach((row, rowIndex) => {\n      this.indexedFields.forEach(field => {\n        const value = this.getNestedValue(row, field);\n        if (value != null) {\n          const searchableText = String(value).toLowerCase();\n          const words = this.tokenize(searchableText);\n          \n          words.forEach(word => {\n            if (!this.index.has(word)) {\n              this.index.set(word, new Set());\n            }\n            this.index.get(word)!.add(rowIndex);\n          });\n        }\n      });\n    });\n  }\n\n  search(query: string): number[] {\n    if (!query.trim()) return [];\n\n    const searchTerms = this.tokenize(query.toLowerCase());\n    const matchingSets: Set<number>[] = [];\n\n    searchTerms.forEach(term => {\n      const matches = new Set<number>();\n      \n      // Exact matches\n      if (this.index.has(term)) {\n        this.index.get(term)!.forEach(index => matches.add(index));\n      }\n\n      // Fuzzy matches\n      if (this.fuzzySearch) {\n        for (const [indexedTerm, indices] of this.index.entries()) {\n          if (this.calculateSimilarity(term, indexedTerm) >= this.fuzzyThreshold) {\n            indices.forEach(index => matches.add(index));\n          }\n        }\n      }\n\n      matchingSets.push(matches);\n    });\n\n    // Find intersection of all matching sets\n    if (matchingSets.length === 0) return [];\n    \n    let result = matchingSets[0];\n    for (let i = 1; i < matchingSets.length; i++) {\n      result = new Set([...result].filter(x => matchingSets[i].has(x)));\n    }\n\n    return Array.from(result);\n  }\n\n  private getNestedValue(obj: any, path: string): any {\n    return path.split('.').reduce((current, key) => current?.[key], obj);\n  }\n\n  private tokenize(text: string): string[] {\n    return text\n      .replace(/[^\\w\\s]/g, ' ')\n      .split(/\\s+/)\n      .filter(word => word.length > 0);\n  }\n\n  private calculateSimilarity(str1: string, str2: string): number {\n    const longer = str1.length > str2.length ? str1 : str2;\n    const shorter = str1.length > str2.length ? str2 : str1;\n    \n    if (longer.length === 0) return 1.0;\n    \n    const editDistance = this.levenshteinDistance(longer, shorter);\n    return (longer.length - editDistance) / longer.length;\n  }\n\n  private levenshteinDistance(str1: string, str2: string): number {\n    const matrix = Array(str2.length + 1).fill(null).map(() => \n      Array(str1.length + 1).fill(null)\n    );\n\n    for (let i = 0; i <= str1.length; i++) matrix[0][i] = i;\n    for (let j = 0; j <= str2.length; j++) matrix[j][0] = j;\n\n    for (let j = 1; j <= str2.length; j++) {\n      for (let i = 1; i <= str1.length; i++) {\n        const substitutionCost = str1[i - 1] === str2[j - 1] ? 0 : 1;\n        matrix[j][i] = Math.min(\n          matrix[j][i - 1] + 1, // insertion\n          matrix[j - 1][i] + 1, // deletion\n          matrix[j - 1][i - 1] + substitutionCost // substitution\n        );\n      }\n    }\n\n    return matrix[str2.length][str1.length];\n  }\n}\n\n\n// ============================================================================\n// DEBOUNCE UTILITIES\n// ============================================================================\n\n/**\n * Creates a debounced function\n */\nexport function debounce<T extends (...args: any[]) => any>(\n  func: T,\n  delay: number\n): (...args: Parameters<T>) => void {\n  let timeoutId: NodeJS.Timeout;\n  \n  return (...args: Parameters<T>) => {\n    clearTimeout(timeoutId);\n    timeoutId = setTimeout(() => func(...args), delay);\n  };\n}\n\n/**\n * Creates a throttled function\n */\nexport function throttle<T extends (...args: any[]) => any>(\n  func: T,\n  delay: number\n): (...args: Parameters<T>) => void {\n  let lastCall = 0;\n  \n  return (...args: Parameters<T>) => {\n    const now = Date.now();\n    if (now - lastCall >= delay) {\n      lastCall = now;\n      func(...args);\n    }\n  };\n}\n\n// ============================================================================\n// MEMORY MANAGEMENT\n// ============================================================================\n\n/**\n * Intersection Observer for tracking visible rows\n */\nexport class VisibilityTracker {\n  private observer: IntersectionObserver | null = null;\n  private visibleElements = new Set<Element>();\n  private callbacks = new Set<(visibleCount: number) => void>();\n\n  constructor() {\n    if (typeof IntersectionObserver !== 'undefined') {\n      this.observer = new IntersectionObserver(\n        (entries) => {\n          entries.forEach(entry => {\n            if (entry.isIntersecting) {\n              this.visibleElements.add(entry.target);\n            } else {\n              this.visibleElements.delete(entry.target);\n            }\n          });\n          \n          this.callbacks.forEach(callback => {\n            callback(this.visibleElements.size);\n          });\n        },\n        { threshold: 0.1 }\n      );\n    }\n  }\n\n  observe(element: Element): void {\n    this.observer?.observe(element);\n  }\n\n  unobserve(element: Element): void {\n    this.observer?.unobserve(element);\n    this.visibleElements.delete(element);\n  }\n\n  onVisibilityChange(callback: (visibleCount: number) => void): () => void {\n    this.callbacks.add(callback);\n    return () => this.callbacks.delete(callback);\n  }\n\n  getVisibleCount(): number {\n    return this.visibleElements.size;\n  }\n\n  destroy(): void {\n    this.observer?.disconnect();\n    this.visibleElements.clear();\n    this.callbacks.clear();\n  }\n} ","/**\n * @file Error Handling Stubs\n * @package @jmruthers/pace-core\n * @module Components/DataTable/Utils/Stubs\n * \n * Minimal stubs for removed error handling utilities.\n * This file exists only to prevent import errors in useDataTablePerformance.\n */\n\nexport interface FallbackConfig {\n  enabled: boolean;\n}\n\nexport const DEFAULT_FALLBACK_CONFIG: FallbackConfig = {\n  enabled: false\n};\n\nexport enum DataTableErrorType {\n  VIRTUALIZATION = 'virtualization',\n  SEARCH_INDEX = 'search_index',\n  DATA_CHUNK = 'data_chunk',\n  SERVER_FETCH = 'server_fetch',\n  MEMORY = 'memory'\n}\n\nexport class DataTableError extends Error {\n  constructor(\n    message: string,\n    public type: DataTableErrorType,\n    public recoverable: boolean = true\n  ) {\n    super(message);\n    this.name = 'DataTableError';\n  }\n}\n\nexport class ErrorRecoveryManager {\n  constructor(private config: FallbackConfig) {}\n  \n  async handleError(error: DataTableError) {\n    return { recovered: false, strategy: null };\n  }\n  \n  clearErrorLog(): void {\n    // Stub method\n  }\n}\n\nexport class MemoryMonitor {\n  constructor(private threshold: number = 100) {}\n  \n  getCurrentUsage(): number {\n    return 0;\n  }\n  \n  checkThreshold(): boolean {\n    return true;\n  }\n  \n  stopMonitoring(): void {\n    // Stub method\n  }\n}\n\nexport class CircuitBreaker {\n  constructor() {}\n  \n  isOpen(): boolean {\n    return false;\n  }\n  \n  recordSuccess(): void {}\n  \n  recordFailure(): void {}\n  \n  reset(): void {}\n}\n\nexport function safeExecute<T>(fn: () => T, fallback: T): T {\n  try {\n    return fn();\n  } catch {\n    return fallback;\n  }\n}\n\n","/**\n * @file DataTable Performance Hook\n * @package @jmruthers/pace-core\n * @module Hooks/DataTablePerformance\n * @since 0.3.0\n */\n\nimport { useState, useEffect, useCallback, useMemo, useRef } from 'react';\nimport type { \n  DataRecord,\n  PaginationMode,\n  PerformanceConfig,\n  ServerSideConfig,\n  ServerSideParams,\n  ServerSideResponse,\n  ChunkingConfig,\n  SearchIndexConfig,\n} from '../components/DataTable/types';\nimport {\n  determinePaginationMode,\n  getOptimalPageSizeOptions,\n  DataChunkManager,\n  SearchIndex,\n  debounce,\n  VisibilityTracker\n} from '../components/DataTable/utils/performanceUtils';\nimport {\n  ErrorRecoveryManager,\n  DataTableError,\n  DataTableErrorType,\n  safeExecute,\n  MemoryMonitor,\n  CircuitBreaker,\n  DEFAULT_FALLBACK_CONFIG,\n  type FallbackConfig\n} from '../components/DataTable/utils/errorHandling';\nimport { logger } from '../utils/core/logger';\n\nexport interface UseDataTablePerformanceOptions<TData extends DataRecord> {\n  data: TData[];\n  performance?: PerformanceConfig;\n  serverSide?: ServerSideConfig<TData>;\n  chunking?: ChunkingConfig;\n  searchIndex?: SearchIndexConfig;\n  // Enhanced error handling options\n  fallbackConfig?: FallbackConfig;\n  onError?: (error: DataTableError) => void;\n  enableErrorRecovery?: boolean;\n}\n\nexport interface UseDataTablePerformanceReturn<TData extends DataRecord> {\n  // Performance state\n  paginationMode: PaginationMode;\n  isVirtualized: boolean;\n  pageSizeOptions: number[];\n  \n  // Data management\n  processedData: TData[];\n  totalCount: number;\n  isLoading: boolean;\n  \n  // Search functionality\n  searchQuery: string;\n  setSearchQuery: (query: string) => void;\n  searchResults: number[];\n  \n  // Server-side functionality\n  fetchServerData: (params: ServerSideParams) => Promise<void>;\n  serverData: ServerSideResponse<TData> | null;\n  \n  // Performance monitoring\n  memoryUsage: number;\n  \n  // Error handling and recovery\n  errorState: {\n    hasErrors: boolean;\n    errorCount: number;\n    lastError: DataTableError | null;\n    fallbacksActive: string[];\n  };\n  retryLastOperation: () => Promise<void>;\n  clearErrors: () => void;\n  \n  // Cleanup\n  cleanup: () => void;\n}\n\n/**\n * Hook for managing DataTable performance optimizations\n */\nexport function useDataTablePerformance<TData extends DataRecord>({\n  data,\n  performance = {},\n  serverSide,\n  chunking,\n  searchIndex,\n  fallbackConfig = DEFAULT_FALLBACK_CONFIG,\n  onError,\n  enableErrorRecovery = true\n}: UseDataTablePerformanceOptions<TData>): UseDataTablePerformanceReturn<TData> {\n  // ============================================================================\n  // STATE MANAGEMENT\n  // ============================================================================\n  \n  const [isLoading, setIsLoading] = useState(false);\n  const [searchQuery, setSearchQuery] = useState('');\n  const [searchResults, setSearchResults] = useState<number[]>([]);\n  const [serverData, setServerData] = useState<ServerSideResponse<TData> | null>(null);\n  const [memoryUsage, setMemoryUsage] = useState(0);\n  \n  // Error handling state\n  const [errorState, setErrorState] = useState({\n    hasErrors: false,\n    errorCount: 0,\n    lastError: null as DataTableError | null,\n    fallbacksActive: [] as string[],\n  });\n  const [lastFailedOperation, setLastFailedOperation] = useState<(() => Promise<any>) | null>(null);\n\n  // ============================================================================\n  // REFS AND MANAGERS\n  // ============================================================================\n  \n  const chunkManagerRef = useRef<DataChunkManager<TData> | null>(null);\n  const searchIndexRef = useRef<SearchIndex<TData> | null>(null);\n  const visibilityTrackerRef = useRef<VisibilityTracker | null>(null);\n  \n  // Error handling managers\n  const errorRecoveryManagerRef = useRef<ErrorRecoveryManager>(new ErrorRecoveryManager(fallbackConfig));\n  const memoryMonitorRef = useRef<MemoryMonitor | null>(null);\n  const circuitBreakerRef = useRef<CircuitBreaker>(new CircuitBreaker());\n\n  // ============================================================================\n  // COMPUTED VALUES\n  // ============================================================================\n  \n  const paginationMode = useMemo(() => {\n    // CRITICAL FIX: Only use 'server' mode if serverSide config is explicitly provided.\n    // determinePaginationMode now never returns 'server' - it only returns 'client' or 'hybrid'.\n    // This fixes pagination issues where large datasets would auto-detect 'server' mode\n    // but have no serverSide config, causing pagination controls to break.\n    if (serverSide) return 'server';\n    return determinePaginationMode(data?.length || 0, performance.serverSideThreshold);\n  }, [data?.length, performance.serverSideThreshold, serverSide]);\n\n  // Virtualization is now handled internally by UnifiedTableBody\n  const isVirtualized = false;\n\n  const pageSizeOptions = useMemo(() => {\n    return getOptimalPageSizeOptions(paginationMode, data?.length || 0);\n  }, [paginationMode, data?.length]);\n\n  // ============================================================================\n  // DATA PROCESSING\n  // ============================================================================\n  \n  const processedData = useMemo(() => {\n    if (serverSide && serverData) {\n      return serverData.data;\n    }\n\n    let filteredData = data;\n    \n    // Apply search filtering - ensure we don't exclude zero values\n    if (searchQuery && searchResults.length > 0) {\n      filteredData = searchResults.map(index => data[index]);\n    }\n\n    // Important: Ensure we don't accidentally filter out rows with zero values\n    // This was causing \"no data\" issues when rows contained zero values in numeric columns\n    // The filtering should be explicit, not implicit based on falsy values\n\n    return filteredData;\n  }, [data, serverData, searchQuery, searchResults, serverSide]);\n\n  const totalCount = useMemo(() => {\n    if (serverSide && serverData) {\n      return serverData.totalCount;\n    }\n    return processedData?.length || 0;\n  }, [serverData, processedData?.length, serverSide]);\n\n  // ============================================================================\n  // CHUNK MANAGEMENT\n  // ============================================================================\n  \n  useEffect(() => {\n    if (chunking && !chunkManagerRef.current) {\n      chunkManagerRef.current = new DataChunkManager<TData>(chunking);\n    }\n  }, [chunking]);\n\n  // ============================================================================\n  // SEARCH INDEX MANAGEMENT\n  // ============================================================================\n  \n  useEffect(() => {\n    if (searchIndex && !searchIndexRef.current) {\n      searchIndexRef.current = new SearchIndex<TData>(searchIndex);\n    }\n\n    if (searchIndexRef.current && data.length > 0) {\n      searchIndexRef.current.buildIndex(data);\n    }\n  }, [searchIndex, data]);\n\n  // Debounced search function\n  const debouncedSearch = useCallback(\n    debounce((query: string) => {\n      if (!searchIndexRef.current) return;\n      \n      if (!query.trim()) {\n        setSearchResults([]);\n        return;\n      }\n\n      const results = searchIndexRef.current.search(query);\n      setSearchResults(results);\n    }, performance.debounceSearch ?? 300),\n    [performance.debounceSearch]\n  );\n\n  // Handle search query changes\n  useEffect(() => {\n    debouncedSearch(searchQuery);\n  }, [searchQuery, debouncedSearch]);\n\n  // ============================================================================\n  // SERVER-SIDE DATA FETCHING\n  // ============================================================================\n  \n  const fetchServerData = useCallback(async (params: ServerSideParams) => {\n    if (!serverSide) return;\n\n    setIsLoading(true);\n    try {\n      const response = await serverSide.fetchData(params);\n      setServerData(response);\n    } catch (error) {\n      logger.error('useDataTablePerformance', 'Failed to fetch server data:', error);\n    } finally {\n      setIsLoading(false);\n    }\n  }, [serverSide]);\n\n  // ============================================================================\n  // PERFORMANCE MONITORING\n  // ============================================================================\n  \n  useEffect(() => {\n    if (!visibilityTrackerRef.current) {\n      visibilityTrackerRef.current = new VisibilityTracker();\n    }\n\n    const tracker = visibilityTrackerRef.current;\n    const unsubscribe = tracker.onVisibilityChange((visibleCount) => {\n      // Performance monitoring removed\n    });\n\n    return unsubscribe;\n  }, [totalCount, isVirtualized, paginationMode]);\n\n  // Update memory usage\n  useEffect(() => {\n    const updateMemoryUsage = () => {\n      let usage = 0;\n      \n      if (chunkManagerRef.current) {\n        usage += chunkManagerRef.current.getMemoryUsage();\n      }\n      \n      // Add general memory estimation\n      usage += (JSON.stringify(processedData || []).length) / (1024 * 1024);\n      \n      setMemoryUsage(usage);\n    };\n\n    updateMemoryUsage();\n    \n    // Only set up interval in non-test environments to prevent memory leaks during testing\n    const interval = import.meta.env.MODE !== 'test' \n      ? setInterval(updateMemoryUsage, 5000) \n      : null;\n    \n    return () => {\n      if (interval) {\n        clearInterval(interval);\n      }\n    };\n  }, [processedData]);\n\n  // ============================================================================\n  // ERROR HANDLING FUNCTIONS\n  // ============================================================================\n  \n  const handleError = useCallback(async (error: DataTableError, operation?: () => Promise<any>) => {\n    if (enableErrorRecovery) {\n      try {\n        const recovery = await errorRecoveryManagerRef.current.handleError(error);\n        setErrorState(prev => ({\n          hasErrors: true,\n          errorCount: prev.errorCount + 1,\n          lastError: error,\n          fallbacksActive: [...prev.fallbacksActive, error.type],\n        }));\n        \n        if (operation) {\n          setLastFailedOperation(() => operation);\n        }\n        \n        onError?.(error);\n        return recovery;\n      } catch (recoveryError) {\n        logger.error('useDataTablePerformance', 'Error recovery failed:', recoveryError);\n      }\n    }\n    throw error;\n  }, [enableErrorRecovery, onError]);\n\n  const retryLastOperation = useCallback(async () => {\n    if (lastFailedOperation) {\n      try {\n        await lastFailedOperation();\n        setLastFailedOperation(null);\n        setErrorState(prev => ({ ...prev, hasErrors: false }));\n      } catch (error) {\n        logger.error('useDataTablePerformance', 'Retry failed:', error);\n      }\n    }\n  }, [lastFailedOperation]);\n\n  const clearErrors = useCallback(() => {\n    setErrorState({\n      hasErrors: false,\n      errorCount: 0,\n      lastError: null,\n      fallbacksActive: [],\n    });\n    setLastFailedOperation(null);\n    errorRecoveryManagerRef.current.clearErrorLog();\n  }, []);\n\n  // ============================================================================\n  // CLEANUP\n  // ============================================================================\n  \n  const cleanup = useCallback(() => {\n    chunkManagerRef.current?.clear();\n    visibilityTrackerRef.current?.destroy();\n    memoryMonitorRef.current?.stopMonitoring();\n  }, []);\n\n  useEffect(() => {\n    return cleanup;\n  }, [cleanup]);\n\n  // ============================================================================\n  // RETURN VALUES\n  // ============================================================================\n  \n  return {\n    // Performance state\n    paginationMode,\n    isVirtualized,\n    pageSizeOptions,\n    \n    // Data management\n    processedData,\n    totalCount,\n    isLoading,\n    \n    // Search functionality\n    searchQuery,\n    setSearchQuery,\n    searchResults,\n    \n    // Server-side functionality\n    fetchServerData,\n    serverData,\n    \n    // Performance monitoring\n    memoryUsage,\n    \n    // Error handling and recovery\n    errorState,\n    retryLastOperation,\n    clearErrors,\n    \n    // Cleanup\n    cleanup\n  };\n} "],"mappings":";;;;;;AAWA,YAAY,WAAW;AAGvB,IAAM,cAAc;AAEpB,IAAM,qBAAqB;AAE3B,IAAM,yBAAyB;AA0C/B,IAAM,gBAAgB,oBAAI,IAA2C;AAGrE,IAAI,cAAqB;AAAA,EACvB,QAAQ,CAAC;AACX;AAGA,IAAM,YAA2C,CAAC;AAelD,SAAS,SAAS,QAIf;AACD,gBAAc,QAAQ,aAAa,MAAM;AACzC,YAAU,QAAQ,CAAC,aAAa;AAC9B,aAAS,WAAW;AAAA,EACtB,CAAC;AACH;AAMA,SAAS,QAAQ;AACf,SAAO,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,UAAU,GAAG,CAAC;AAClD;AAMA,IAAM,mBAAmB,CAAC,YAAoB;AAC5C,MAAI,cAAc,IAAI,OAAO,GAAG;AAC9B;AAAA,EACF;AAEA,QAAM,UAAU,WAAW,MAAM;AAC/B,kBAAc,OAAO,OAAO;AAC5B,aAAS;AAAA,MACP,MAAM;AAAA,MACN;AAAA,IACF,CAAC;AAAA,EACH,GAAG,kBAAkB;AAErB,gBAAc,IAAI,SAAS,OAAO;AACpC;AAQA,SAAS,QAAQ,OAAc,QAIrB;AACR,UAAQ,OAAO,MAAM;AAAA,IACnB,KAAK;AACH,aAAO;AAAA,QACL,GAAG;AAAA,QACH,QAAQ,CAAC,OAAO,OAAQ,GAAG,MAAM,MAAM,EAAE,MAAM,GAAG,WAAW;AAAA,MAC/D;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,GAAG;AAAA,QACH,QAAQ,MAAM,OAAO;AAAA,UAAI,CAAC,MACxB,EAAE,OAAO,OAAO,OAAO,KAAK,EAAE,GAAG,GAAG,GAAG,OAAO,MAAM,IAAI;AAAA,QAC1D;AAAA,MACF;AAAA,IAEF,KAAK,iBAAiB;AACpB,YAAM,EAAE,QAAQ,IAAI;AAEpB,UAAI,SAAS;AACX,yBAAiB,OAAO;AAAA,MAC1B;AAEA,aAAO;AAAA,QACL,GAAG;AAAA,QACH,QAAQ,MAAM,OAAO;AAAA,UAAI,CAAC,MACxB,EAAE,OAAO,WAAW,YAAY,SAC5B;AAAA,YACE,GAAG;AAAA,YACH,MAAM;AAAA,UACR,IACA;AAAA,QACN;AAAA,MACF;AAAA,IACF;AAAA,IAEA,KAAK;AACH,UAAI,OAAO,YAAY,QAAW;AAChC,eAAO;AAAA,UACL,GAAG;AAAA,UACH,QAAQ,CAAC;AAAA,QACX;AAAA,MACF;AACA,aAAO;AAAA,QACL,GAAG;AAAA,QACH,QAAQ,MAAM,OAAO,OAAO,CAAC,MAAM,EAAE,OAAO,OAAO,OAAO;AAAA,MAC5D;AAAA,EACJ;AACF;AAaA,SAAS,MAAM,OAAc;AAC3B,QAAM,KAAK,MAAM;AAEjB,QAAM,SAAS,CAACA,WACd,SAAS;AAAA,IACP,MAAM;AAAA,IACN,OAAO,EAAE,GAAGA,QAAO,UAAU,wBAAwB,GAAG;AAAA,EAC1D,CAAC;AACH,QAAM,UAAU,MAAM,SAAS,EAAE,MAAM,iBAAiB,SAAS,GAAG,CAAC;AAErE,WAAS;AAAA,IACP,MAAM;AAAA,IACN,OAAO;AAAA,MACL,GAAG;AAAA,MACH,UAAU;AAAA,MACV;AAAA,MACA,MAAM;AAAA,MACN;AAAA,MACA,cAAc,CAAC,SAAS;AACtB,YAAI,CAAC,KAAM,SAAQ;AAAA,MACrB;AAAA,IACF;AAAA,EACF,CAAC;AAED,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAMA,SAAS,WAAW;AAClB,QAAM,CAAC,OAAO,QAAQ,IAAU,eAAgB,WAAW;AAE3D,EAAM,gBAAU,MAAM;AACpB,cAAU,KAAK,QAAQ;AACvB,WAAO,MAAM;AACX,YAAM,QAAQ,UAAU,QAAQ,QAAQ;AACxC,UAAI,QAAQ,IAAI;AACd,kBAAU,OAAO,OAAO,CAAC;AAAA,MAC3B;AAAA,IACF;AAAA,EACF,GAAG,CAAC,KAAK,CAAC;AAEV,SAAO;AAAA,IACL,GAAG;AAAA,IACH;AAAA,IACA,SAAS,CAAC,YAAqB,SAAS,EAAE,MAAM,iBAAiB,QAAQ,CAAC;AAAA,EAC5E;AACF;;;ACzNO,SAAS,wBACd,YACA,sBAA8B,KACT;AACrB,MAAI,cAAc,IAAM,QAAO;AAG/B,SAAO;AACT;AAKO,SAAS,0BACd,MACA,YACU;AACV,UAAQ,MAAM;AAAA,IACZ,KAAK;AACH,aAAO,cAAc,MAAM,CAAC,IAAI,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,IAAI,GAAG;AAAA,IAC5D,KAAK;AACH,aAAO,CAAC,IAAI,KAAK,KAAK,GAAG;AAAA,IAC3B,KAAK;AACH,aAAO,CAAC,IAAI,IAAI,KAAK,GAAG;AAAA,IAC1B;AACE,aAAO,CAAC,IAAI,IAAI,IAAI,GAAG;AAAA,EAC3B;AACF;AASO,SAAS,UACd,MACA,WACW;AACX,QAAM,SAAoB,CAAC;AAC3B,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,WAAW;AAC/C,WAAO,KAAK,KAAK,MAAM,GAAG,IAAI,SAAS,CAAC;AAAA,EAC1C;AACA,SAAO;AACT;AAKO,IAAM,mBAAN,MAAiD;AAAA,EAMtD,YAAY,QAAwB;AALpC,SAAQ,SAA+B,oBAAI,IAAI;AAC/C,SAAQ,cAAwB,CAAC;AAK/B,SAAK,YAAY,OAAO;AACxB,SAAK,YAAY,OAAO;AAAA,EAC1B;AAAA,EAEA,SAAS,YAAoB,SAA2B;AAEtD,QAAI,KAAK,OAAO,IAAI,UAAU,GAAG;AAC/B,WAAK,kBAAkB,UAAU;AACjC,aAAO,KAAK,OAAO,IAAI,UAAU;AAAA,IACnC;AAGA,UAAM,aAAa,aAAa,KAAK;AACrC,UAAM,WAAW,KAAK,IAAI,aAAa,KAAK,WAAW,QAAQ,MAAM;AACrE,UAAM,QAAQ,QAAQ,MAAM,YAAY,QAAQ;AAGhD,SAAK,SAAS,YAAY,KAAK;AAC/B,WAAO;AAAA,EACT;AAAA,EAEQ,SAAS,YAAoB,OAAsB;AAEzD,QAAI,KAAK,OAAO,QAAQ,KAAK,aAAa,CAAC,KAAK,OAAO,IAAI,UAAU,GAAG;AACtE,YAAM,cAAc,KAAK,YAAY,MAAM;AAC3C,UAAI,gBAAgB,QAAW;AAC7B,aAAK,OAAO,OAAO,WAAW;AAAA,MAChC;AAAA,IACF;AAEA,SAAK,OAAO,IAAI,YAAY,KAAK;AACjC,SAAK,kBAAkB,UAAU;AAAA,EACnC;AAAA,EAEQ,kBAAkB,YAA0B;AAClD,UAAM,gBAAgB,KAAK,YAAY,QAAQ,UAAU;AACzD,QAAI,gBAAgB,IAAI;AACtB,WAAK,YAAY,OAAO,eAAe,CAAC;AAAA,IAC1C;AACA,SAAK,YAAY,KAAK,UAAU;AAAA,EAClC;AAAA,EAEA,QAAc;AACZ,SAAK,OAAO,MAAM;AAClB,SAAK,cAAc,CAAC;AAAA,EACtB;AAAA,EAEA,iBAAyB;AACvB,QAAI,YAAY;AAChB,eAAW,SAAS,KAAK,OAAO,OAAO,GAAG;AACxC,mBAAa,KAAK,UAAU,KAAK,EAAE;AAAA,IACrC;AACA,WAAO,aAAa,OAAO;AAAA,EAC7B;AACF;AASO,IAAM,cAAN,MAA4C;AAAA,EAOjD,YAAY,QAA2B;AANvC,SAAQ,QAAkC,oBAAI,IAAI;AAClD,SAAQ,OAAgB,CAAC;AAMvB,SAAK,gBAAgB,OAAO;AAC5B,SAAK,cAAc,OAAO,eAAe;AACzC,SAAK,iBAAiB,OAAO,kBAAkB;AAAA,EACjD;AAAA,EAEA,WAAW,MAAqB;AAC9B,SAAK,OAAO;AACZ,SAAK,MAAM,MAAM;AAEjB,SAAK,QAAQ,CAAC,KAAK,aAAa;AAC9B,WAAK,cAAc,QAAQ,WAAS;AAClC,cAAM,QAAQ,KAAK,eAAe,KAAK,KAAK;AAC5C,YAAI,SAAS,MAAM;AACjB,gBAAM,iBAAiB,OAAO,KAAK,EAAE,YAAY;AACjD,gBAAM,QAAQ,KAAK,SAAS,cAAc;AAE1C,gBAAM,QAAQ,UAAQ;AACpB,gBAAI,CAAC,KAAK,MAAM,IAAI,IAAI,GAAG;AACzB,mBAAK,MAAM,IAAI,MAAM,oBAAI,IAAI,CAAC;AAAA,YAChC;AACA,iBAAK,MAAM,IAAI,IAAI,EAAG,IAAI,QAAQ;AAAA,UACpC,CAAC;AAAA,QACH;AAAA,MACF,CAAC;AAAA,IACH,CAAC;AAAA,EACH;AAAA,EAEA,OAAO,OAAyB;AAC9B,QAAI,CAAC,MAAM,KAAK,EAAG,QAAO,CAAC;AAE3B,UAAM,cAAc,KAAK,SAAS,MAAM,YAAY,CAAC;AACrD,UAAM,eAA8B,CAAC;AAErC,gBAAY,QAAQ,UAAQ;AAC1B,YAAM,UAAU,oBAAI,IAAY;AAGhC,UAAI,KAAK,MAAM,IAAI,IAAI,GAAG;AACxB,aAAK,MAAM,IAAI,IAAI,EAAG,QAAQ,WAAS,QAAQ,IAAI,KAAK,CAAC;AAAA,MAC3D;AAGA,UAAI,KAAK,aAAa;AACpB,mBAAW,CAAC,aAAa,OAAO,KAAK,KAAK,MAAM,QAAQ,GAAG;AACzD,cAAI,KAAK,oBAAoB,MAAM,WAAW,KAAK,KAAK,gBAAgB;AACtE,oBAAQ,QAAQ,WAAS,QAAQ,IAAI,KAAK,CAAC;AAAA,UAC7C;AAAA,QACF;AAAA,MACF;AAEA,mBAAa,KAAK,OAAO;AAAA,IAC3B,CAAC;AAGD,QAAI,aAAa,WAAW,EAAG,QAAO,CAAC;AAEvC,QAAI,SAAS,aAAa,CAAC;AAC3B,aAAS,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;AAC5C,eAAS,IAAI,IAAI,CAAC,GAAG,MAAM,EAAE,OAAO,OAAK,aAAa,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAAA,IAClE;AAEA,WAAO,MAAM,KAAK,MAAM;AAAA,EAC1B;AAAA,EAEQ,eAAe,KAAU,MAAmB;AAClD,WAAO,KAAK,MAAM,GAAG,EAAE,OAAO,CAAC,SAAS,QAAQ,UAAU,GAAG,GAAG,GAAG;AAAA,EACrE;AAAA,EAEQ,SAAS,MAAwB;AACvC,WAAO,KACJ,QAAQ,YAAY,GAAG,EACvB,MAAM,KAAK,EACX,OAAO,UAAQ,KAAK,SAAS,CAAC;AAAA,EACnC;AAAA,EAEQ,oBAAoB,MAAc,MAAsB;AAC9D,UAAM,SAAS,KAAK,SAAS,KAAK,SAAS,OAAO;AAClD,UAAM,UAAU,KAAK,SAAS,KAAK,SAAS,OAAO;AAEnD,QAAI,OAAO,WAAW,EAAG,QAAO;AAEhC,UAAM,eAAe,KAAK,oBAAoB,QAAQ,OAAO;AAC7D,YAAQ,OAAO,SAAS,gBAAgB,OAAO;AAAA,EACjD;AAAA,EAEQ,oBAAoB,MAAc,MAAsB;AAC9D,UAAM,SAAS,MAAM,KAAK,SAAS,CAAC,EAAE,KAAK,IAAI,EAAE;AAAA,MAAI,MACnD,MAAM,KAAK,SAAS,CAAC,EAAE,KAAK,IAAI;AAAA,IAClC;AAEA,aAAS,IAAI,GAAG,KAAK,KAAK,QAAQ,IAAK,QAAO,CAAC,EAAE,CAAC,IAAI;AACtD,aAAS,IAAI,GAAG,KAAK,KAAK,QAAQ,IAAK,QAAO,CAAC,EAAE,CAAC,IAAI;AAEtD,aAAS,IAAI,GAAG,KAAK,KAAK,QAAQ,KAAK;AACrC,eAAS,IAAI,GAAG,KAAK,KAAK,QAAQ,KAAK;AACrC,cAAM,mBAAmB,KAAK,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,IAAI,IAAI;AAC3D,eAAO,CAAC,EAAE,CAAC,IAAI,KAAK;AAAA,UAClB,OAAO,CAAC,EAAE,IAAI,CAAC,IAAI;AAAA;AAAA,UACnB,OAAO,IAAI,CAAC,EAAE,CAAC,IAAI;AAAA;AAAA,UACnB,OAAO,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI;AAAA;AAAA,QACzB;AAAA,MACF;AAAA,IACF;AAEA,WAAO,OAAO,KAAK,MAAM,EAAE,KAAK,MAAM;AAAA,EACxC;AACF;AAUO,SAAS,SACd,MACA,OACkC;AAClC,MAAI;AAEJ,SAAO,IAAI,SAAwB;AACjC,iBAAa,SAAS;AACtB,gBAAY,WAAW,MAAM,KAAK,GAAG,IAAI,GAAG,KAAK;AAAA,EACnD;AACF;AAKO,SAAS,SACd,MACA,OACkC;AAClC,MAAI,WAAW;AAEf,SAAO,IAAI,SAAwB;AACjC,UAAM,MAAM,KAAK,IAAI;AACrB,QAAI,MAAM,YAAY,OAAO;AAC3B,iBAAW;AACX,WAAK,GAAG,IAAI;AAAA,IACd;AAAA,EACF;AACF;AASO,IAAM,oBAAN,MAAwB;AAAA,EAK7B,cAAc;AAJd,SAAQ,WAAwC;AAChD,SAAQ,kBAAkB,oBAAI,IAAa;AAC3C,SAAQ,YAAY,oBAAI,IAAoC;AAG1D,QAAI,OAAO,yBAAyB,aAAa;AAC/C,WAAK,WAAW,IAAI;AAAA,QAClB,CAAC,YAAY;AACX,kBAAQ,QAAQ,WAAS;AACvB,gBAAI,MAAM,gBAAgB;AACxB,mBAAK,gBAAgB,IAAI,MAAM,MAAM;AAAA,YACvC,OAAO;AACL,mBAAK,gBAAgB,OAAO,MAAM,MAAM;AAAA,YAC1C;AAAA,UACF,CAAC;AAED,eAAK,UAAU,QAAQ,cAAY;AACjC,qBAAS,KAAK,gBAAgB,IAAI;AAAA,UACpC,CAAC;AAAA,QACH;AAAA,QACA,EAAE,WAAW,IAAI;AAAA,MACnB;AAAA,IACF;AAAA,EACF;AAAA,EAEA,QAAQ,SAAwB;AAC9B,SAAK,UAAU,QAAQ,OAAO;AAAA,EAChC;AAAA,EAEA,UAAU,SAAwB;AAChC,SAAK,UAAU,UAAU,OAAO;AAChC,SAAK,gBAAgB,OAAO,OAAO;AAAA,EACrC;AAAA,EAEA,mBAAmB,UAAsD;AACvE,SAAK,UAAU,IAAI,QAAQ;AAC3B,WAAO,MAAM,KAAK,UAAU,OAAO,QAAQ;AAAA,EAC7C;AAAA,EAEA,kBAA0B;AACxB,WAAO,KAAK,gBAAgB;AAAA,EAC9B;AAAA,EAEA,UAAgB;AACd,SAAK,UAAU,WAAW;AAC1B,SAAK,gBAAgB,MAAM;AAC3B,SAAK,UAAU,MAAM;AAAA,EACvB;AACF;;;AC1VO,IAAM,0BAA0C;AAAA,EACrD,SAAS;AACX;AAEO,IAAK,qBAAL,kBAAKC,wBAAL;AACL,EAAAA,oBAAA,oBAAiB;AACjB,EAAAA,oBAAA,kBAAe;AACf,EAAAA,oBAAA,gBAAa;AACb,EAAAA,oBAAA,kBAAe;AACf,EAAAA,oBAAA,YAAS;AALC,SAAAA;AAAA,GAAA;AAQL,IAAM,iBAAN,cAA6B,MAAM;AAAA,EACxC,YACE,SACO,MACA,cAAuB,MAC9B;AACA,UAAM,OAAO;AAHN;AACA;AAGP,SAAK,OAAO;AAAA,EACd;AACF;AAEO,IAAM,uBAAN,MAA2B;AAAA,EAChC,YAAoB,QAAwB;AAAxB;AAAA,EAAyB;AAAA,EAE7C,MAAM,YAAY,OAAuB;AACvC,WAAO,EAAE,WAAW,OAAO,UAAU,KAAK;AAAA,EAC5C;AAAA,EAEA,gBAAsB;AAAA,EAEtB;AACF;AAEO,IAAM,gBAAN,MAAoB;AAAA,EACzB,YAAoB,YAAoB,KAAK;AAAzB;AAAA,EAA0B;AAAA,EAE9C,kBAA0B;AACxB,WAAO;AAAA,EACT;AAAA,EAEA,iBAA0B;AACxB,WAAO;AAAA,EACT;AAAA,EAEA,iBAAuB;AAAA,EAEvB;AACF;AAEO,IAAM,iBAAN,MAAqB;AAAA,EAC1B,cAAc;AAAA,EAAC;AAAA,EAEf,SAAkB;AAChB,WAAO;AAAA,EACT;AAAA,EAEA,gBAAsB;AAAA,EAAC;AAAA,EAEvB,gBAAsB;AAAA,EAAC;AAAA,EAEvB,QAAc;AAAA,EAAC;AACjB;AAEO,SAAS,YAAe,IAAa,UAAgB;AAC1D,MAAI;AACF,WAAO,GAAG;AAAA,EACZ,QAAQ;AACN,WAAO;AAAA,EACT;AACF;;;AC7EA,SAAS,YAAAC,WAAU,aAAAC,YAAW,aAAa,SAAS,cAAc;AA6BlE;AAsDO,SAAS,wBAAkD;AAAA,EAChE;AAAA,EACA,cAAc,CAAC;AAAA,EACf;AAAA,EACA;AAAA,EACA;AAAA,EACA,iBAAiB;AAAA,EACjB;AAAA,EACA,sBAAsB;AACxB,GAAgF;AAK9E,QAAM,CAAC,WAAW,YAAY,IAAIC,UAAS,KAAK;AAChD,QAAM,CAAC,aAAa,cAAc,IAAIA,UAAS,EAAE;AACjD,QAAM,CAAC,eAAe,gBAAgB,IAAIA,UAAmB,CAAC,CAAC;AAC/D,QAAM,CAAC,YAAY,aAAa,IAAIA,UAA2C,IAAI;AACnF,QAAM,CAAC,aAAa,cAAc,IAAIA,UAAS,CAAC;AAGhD,QAAM,CAAC,YAAY,aAAa,IAAIA,UAAS;AAAA,IAC3C,WAAW;AAAA,IACX,YAAY;AAAA,IACZ,WAAW;AAAA,IACX,iBAAiB,CAAC;AAAA,EACpB,CAAC;AACD,QAAM,CAAC,qBAAqB,sBAAsB,IAAIA,UAAsC,IAAI;AAMhG,QAAM,kBAAkB,OAAuC,IAAI;AACnE,QAAM,iBAAiB,OAAkC,IAAI;AAC7D,QAAM,uBAAuB,OAAiC,IAAI;AAGlE,QAAM,0BAA0B,OAA6B,IAAI,qBAAqB,cAAc,CAAC;AACrG,QAAM,mBAAmB,OAA6B,IAAI;AAC1D,QAAM,oBAAoB,OAAuB,IAAI,eAAe,CAAC;AAMrE,QAAM,iBAAiB,QAAQ,MAAM;AAKnC,QAAI,WAAY,QAAO;AACvB,WAAO,wBAAwB,MAAM,UAAU,GAAG,YAAY,mBAAmB;AAAA,EACnF,GAAG,CAAC,MAAM,QAAQ,YAAY,qBAAqB,UAAU,CAAC;AAG9D,QAAM,gBAAgB;AAEtB,QAAM,kBAAkB,QAAQ,MAAM;AACpC,WAAO,0BAA0B,gBAAgB,MAAM,UAAU,CAAC;AAAA,EACpE,GAAG,CAAC,gBAAgB,MAAM,MAAM,CAAC;AAMjC,QAAM,gBAAgB,QAAQ,MAAM;AAClC,QAAI,cAAc,YAAY;AAC5B,aAAO,WAAW;AAAA,IACpB;AAEA,QAAI,eAAe;AAGnB,QAAI,eAAe,cAAc,SAAS,GAAG;AAC3C,qBAAe,cAAc,IAAI,WAAS,KAAK,KAAK,CAAC;AAAA,IACvD;AAMA,WAAO;AAAA,EACT,GAAG,CAAC,MAAM,YAAY,aAAa,eAAe,UAAU,CAAC;AAE7D,QAAM,aAAa,QAAQ,MAAM;AAC/B,QAAI,cAAc,YAAY;AAC5B,aAAO,WAAW;AAAA,IACpB;AACA,WAAO,eAAe,UAAU;AAAA,EAClC,GAAG,CAAC,YAAY,eAAe,QAAQ,UAAU,CAAC;AAMlD,EAAAC,WAAU,MAAM;AACd,QAAI,YAAY,CAAC,gBAAgB,SAAS;AACxC,sBAAgB,UAAU,IAAI,iBAAwB,QAAQ;AAAA,IAChE;AAAA,EACF,GAAG,CAAC,QAAQ,CAAC;AAMb,EAAAA,WAAU,MAAM;AACd,QAAI,eAAe,CAAC,eAAe,SAAS;AAC1C,qBAAe,UAAU,IAAI,YAAmB,WAAW;AAAA,IAC7D;AAEA,QAAI,eAAe,WAAW,KAAK,SAAS,GAAG;AAC7C,qBAAe,QAAQ,WAAW,IAAI;AAAA,IACxC;AAAA,EACF,GAAG,CAAC,aAAa,IAAI,CAAC;AAGtB,QAAM,kBAAkB;AAAA,IACtB,SAAS,CAAC,UAAkB;AAC1B,UAAI,CAAC,eAAe,QAAS;AAE7B,UAAI,CAAC,MAAM,KAAK,GAAG;AACjB,yBAAiB,CAAC,CAAC;AACnB;AAAA,MACF;AAEA,YAAM,UAAU,eAAe,QAAQ,OAAO,KAAK;AACnD,uBAAiB,OAAO;AAAA,IAC1B,GAAG,YAAY,kBAAkB,GAAG;AAAA,IACpC,CAAC,YAAY,cAAc;AAAA,EAC7B;AAGA,EAAAA,WAAU,MAAM;AACd,oBAAgB,WAAW;AAAA,EAC7B,GAAG,CAAC,aAAa,eAAe,CAAC;AAMjC,QAAM,kBAAkB,YAAY,OAAO,WAA6B;AACtE,QAAI,CAAC,WAAY;AAEjB,iBAAa,IAAI;AACjB,QAAI;AACF,YAAM,WAAW,MAAM,WAAW,UAAU,MAAM;AAClD,oBAAc,QAAQ;AAAA,IACxB,SAAS,OAAO;AACd,aAAO,MAAM,2BAA2B,gCAAgC,KAAK;AAAA,IAC/E,UAAE;AACA,mBAAa,KAAK;AAAA,IACpB;AAAA,EACF,GAAG,CAAC,UAAU,CAAC;AAMf,EAAAA,WAAU,MAAM;AACd,QAAI,CAAC,qBAAqB,SAAS;AACjC,2BAAqB,UAAU,IAAI,kBAAkB;AAAA,IACvD;AAEA,UAAM,UAAU,qBAAqB;AACrC,UAAM,cAAc,QAAQ,mBAAmB,CAAC,iBAAiB;AAAA,IAEjE,CAAC;AAED,WAAO;AAAA,EACT,GAAG,CAAC,YAAY,eAAe,cAAc,CAAC;AAG9C,EAAAA,WAAU,MAAM;AACd,UAAM,oBAAoB,MAAM;AAC9B,UAAI,QAAQ;AAEZ,UAAI,gBAAgB,SAAS;AAC3B,iBAAS,gBAAgB,QAAQ,eAAe;AAAA,MAClD;AAGA,eAAU,KAAK,UAAU,iBAAiB,CAAC,CAAC,EAAE,UAAW,OAAO;AAEhE,qBAAe,KAAK;AAAA,IACtB;AAEA,sBAAkB;AAGlB,UAAM,WAAW,YAAY,IAAI,SAAS,SACtC,YAAY,mBAAmB,GAAI,IACnC;AAEJ,WAAO,MAAM;AACX,UAAI,UAAU;AACZ,sBAAc,QAAQ;AAAA,MACxB;AAAA,IACF;AAAA,EACF,GAAG,CAAC,aAAa,CAAC;AAMlB,QAAM,cAAc,YAAY,OAAO,OAAuB,cAAmC;AAC/F,QAAI,qBAAqB;AACvB,UAAI;AACF,cAAM,WAAW,MAAM,wBAAwB,QAAQ,YAAY,KAAK;AACxE,sBAAc,WAAS;AAAA,UACrB,WAAW;AAAA,UACX,YAAY,KAAK,aAAa;AAAA,UAC9B,WAAW;AAAA,UACX,iBAAiB,CAAC,GAAG,KAAK,iBAAiB,MAAM,IAAI;AAAA,QACvD,EAAE;AAEF,YAAI,WAAW;AACb,iCAAuB,MAAM,SAAS;AAAA,QACxC;AAEA,kBAAU,KAAK;AACf,eAAO;AAAA,MACT,SAAS,eAAe;AACtB,eAAO,MAAM,2BAA2B,0BAA0B,aAAa;AAAA,MACjF;AAAA,IACF;AACA,UAAM;AAAA,EACR,GAAG,CAAC,qBAAqB,OAAO,CAAC;AAEjC,QAAM,qBAAqB,YAAY,YAAY;AACjD,QAAI,qBAAqB;AACvB,UAAI;AACF,cAAM,oBAAoB;AAC1B,+BAAuB,IAAI;AAC3B,sBAAc,WAAS,EAAE,GAAG,MAAM,WAAW,MAAM,EAAE;AAAA,MACvD,SAAS,OAAO;AACd,eAAO,MAAM,2BAA2B,iBAAiB,KAAK;AAAA,MAChE;AAAA,IACF;AAAA,EACF,GAAG,CAAC,mBAAmB,CAAC;AAExB,QAAM,cAAc,YAAY,MAAM;AACpC,kBAAc;AAAA,MACZ,WAAW;AAAA,MACX,YAAY;AAAA,MACZ,WAAW;AAAA,MACX,iBAAiB,CAAC;AAAA,IACpB,CAAC;AACD,2BAAuB,IAAI;AAC3B,4BAAwB,QAAQ,cAAc;AAAA,EAChD,GAAG,CAAC,CAAC;AAML,QAAM,UAAU,YAAY,MAAM;AAChC,oBAAgB,SAAS,MAAM;AAC/B,yBAAqB,SAAS,QAAQ;AACtC,qBAAiB,SAAS,eAAe;AAAA,EAC3C,GAAG,CAAC,CAAC;AAEL,EAAAA,WAAU,MAAM;AACd,WAAO;AAAA,EACT,GAAG,CAAC,OAAO,CAAC;AAMZ,SAAO;AAAA;AAAA,IAEL;AAAA,IACA;AAAA,IACA;AAAA;AAAA,IAGA;AAAA,IACA;AAAA,IACA;AAAA;AAAA,IAGA;AAAA,IACA;AAAA,IACA;AAAA;AAAA,IAGA;AAAA,IACA;AAAA;AAAA,IAGA;AAAA;AAAA,IAGA;AAAA,IACA;AAAA,IACA;AAAA;AAAA,IAGA;AAAA,EACF;AACF;","names":["props","DataTableErrorType","useState","useEffect","useState","useEffect"]}

package/dist/chunk-BJPBT3CU.js

@@ -1,21 +0,0 @@
-// src/utils/validation/schema.ts
-import { z } from "zod";
-function pickSchema(schema, keys) {
-  const shape = Object.entries(schema.shape).filter(([key]) => keys.includes(key)).reduce((acc, [key, value]) => {
-    acc[key] = value;
-    return acc;
-  }, {});
-  return z.object(shape);
-}
-function combineSchemas(schemas) {
-  return schemas.reduce(
-    (merged, schema) => merged.merge(schema),
-    z.object({})
-  );
-}
-
-export {
-  pickSchema,
-  combineSchemas
-};
-//# sourceMappingURL=chunk-BJPBT3CU.js.map

package/dist/chunk-BJPBT3CU.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/utils/validation/schema.ts"],"sourcesContent":["/**\n * @file Schema utility functions\n * @package @jmruthers/pace-core\n * @module Utils/Validation/Schema\n * @since 0.1.0\n * \n * Utility functions for working with Zod schemas.\n */\n\nimport { z } from 'zod';\n\n/**\n * Creates a subset schema from a larger schema\n * \n * @param schema - Original Zod schema\n * @param keys - Array of keys to pick from the schema\n * @returns New schema with only the selected fields\n */\nexport function pickSchema<T extends z.ZodObject<any, any, any>, K extends keyof z.infer<T>>(\n  schema: T,\n  keys: K[]\n): z.ZodObject<Pick<z.infer<T>, K>> {\n  const shape = Object.entries(schema.shape)\n    .filter(([key]) => keys.includes(key as K))\n    .reduce((acc, [key, value]) => {\n      (acc as Record<string, unknown>)[key] = value as unknown;\n      return acc;\n    }, {} as Record<string, unknown>);\n\n  return z.object(shape as Record<string, z.ZodTypeAny>) as z.ZodObject<Pick<z.infer<T>, K>>;\n}\n\n/**\n * Combines multiple Zod schemas into one\n * \n * @param schemas - Array of Zod schemas to combine\n * @returns Combined schema\n */\nexport function combineSchemas<T extends z.ZodObject<any, any, any>[]>(\n  schemas: T\n): z.ZodObject<any, any, any> {\n  return schemas.reduce(\n    (merged, schema) => merged.merge(schema),\n    z.object({})\n  );\n}\n\n"],"mappings":";AASA,SAAS,SAAS;AASX,SAAS,WACd,QACA,MACkC;AAClC,QAAM,QAAQ,OAAO,QAAQ,OAAO,KAAK,EACtC,OAAO,CAAC,CAAC,GAAG,MAAM,KAAK,SAAS,GAAQ,CAAC,EACzC,OAAO,CAAC,KAAK,CAAC,KAAK,KAAK,MAAM;AAC7B,IAAC,IAAgC,GAAG,IAAI;AACxC,WAAO;AAAA,EACT,GAAG,CAAC,CAA4B;AAElC,SAAO,EAAE,OAAO,KAAqC;AACvD;AAQO,SAAS,eACd,SAC4B;AAC5B,SAAO,QAAQ;AAAA,IACb,CAAC,QAAQ,WAAW,OAAO,MAAM,MAAM;AAAA,IACvC,EAAE,OAAO,CAAC,CAAC;AAAA,EACb;AACF;","names":[]}