mixpeek 0.81.1

package/dist/models/algorithm-params.d.ts

@@ -0,0 +1,365 @@
+/**
+ * Mixpeek API
+ * This is the Mixpeek API, providing access to various endpoints for data processing and retrieval.
+ *
+ * The version of the OpenAPI document: 0.81.1
+ * Contact: info@mixpeek.com
+ *
+ * NOTE: This class is auto generated by OpenAPI Generator (https://openapi-generator.tech).
+ * https://openapi-generator.tech
+ * Do not edit the class manually.
+ */
+/**
+ * Algorithm-specific parameters
+ * @export
+ * @interface AlgorithmParams
+ */
+export interface AlgorithmParams {
+    /**
+     * Number of clusters to form
+     * @type {number}
+     * @memberof AlgorithmParams
+     */
+    'n_clusters'?: number;
+    /**
+     * Maximum number of iterations per seed point before the algorithm stops
+     * @type {number}
+     * @memberof AlgorithmParams
+     */
+    'max_iter'?: number;
+    /**
+     * Random seed for reproducibility
+     * @type {number}
+     * @memberof AlgorithmParams
+     */
+    'random_state'?: number;
+    /**
+     * Number of initializations to perform
+     * @type {number}
+     * @memberof AlgorithmParams
+     */
+    'n_init'?: number;
+    /**
+     * Convergence threshold
+     * @type {number}
+     * @memberof AlgorithmParams
+     */
+    'tol'?: number;
+    /**
+     * Method for initialization (\'k-means++\' or \'random\')
+     * @type {string}
+     * @memberof AlgorithmParams
+     */
+    'init'?: string;
+    /**
+     * Enable verbose output
+     * @type {number}
+     * @memberof AlgorithmParams
+     */
+    'verbose'?: number;
+    /**
+     * If True, the original data is not modified
+     * @type {boolean}
+     * @memberof AlgorithmParams
+     */
+    'copy_x'?: boolean;
+    /**
+     * Algorithm to compute pointwise distances (\'auto\', \'ball_tree\', \'kd_tree\', \'brute\')
+     * @type {string}
+     * @memberof AlgorithmParams
+     */
+    'algorithm'?: string;
+    /**
+     * Maximum distance for DBSCAN cluster extraction method
+     * @type {number}
+     * @memberof AlgorithmParams
+     */
+    'eps'?: number;
+    /**
+     * Number of samples in a neighborhood for a point to be considered a core point
+     * @type {number}
+     * @memberof AlgorithmParams
+     */
+    'min_samples'?: number;
+    /**
+     * Metric to use for distance computation
+     * @type {string}
+     * @memberof AlgorithmParams
+     */
+    'metric'?: string;
+    /**
+     * Additional keyword arguments for the metric function
+     * @type {{ [key: string]: any; }}
+     * @memberof AlgorithmParams
+     */
+    'metric_params'?: {
+        [key: string]: any;
+    };
+    /**
+     * Leaf size passed to BallTree or KDTree
+     * @type {number}
+     * @memberof AlgorithmParams
+     */
+    'leaf_size'?: number;
+    /**
+     * Parameter for the Minkowski metric
+     * @type {number}
+     * @memberof AlgorithmParams
+     */
+    'p'?: number;
+    /**
+     * Number of parallel jobs to run (-1 means using all processors)
+     * @type {number}
+     * @memberof AlgorithmParams
+     */
+    'n_jobs'?: number;
+    /**
+     * Minimum number of samples in a cluster. Can be a fraction if < 1.0
+     * @type {number}
+     * @memberof AlgorithmParams
+     */
+    'min_cluster_size'?: number;
+    /**
+     * A distance threshold for cluster selection. Clusters below this value will be merged
+     * @type {number}
+     * @memberof AlgorithmParams
+     */
+    'cluster_selection_epsilon'?: number;
+    /**
+     * Maximum number of samples in a cluster. Clusters above this size will be split
+     * @type {number}
+     * @memberof AlgorithmParams
+     */
+    'max_cluster_size'?: number;
+    /**
+     * A distance scaling parameter
+     * @type {number}
+     * @memberof AlgorithmParams
+     */
+    'alpha'?: number;
+    /**
+     * Method to select clusters from the condensed tree (\'eom\' or \'leaf\')
+     * @type {string}
+     * @memberof AlgorithmParams
+     */
+    'cluster_selection_method'?: string;
+    /**
+     * Allow HDBSCAN to find only a single cluster
+     * @type {boolean}
+     * @memberof AlgorithmParams
+     */
+    'allow_single_cluster'?: boolean;
+    /**
+     * Whether to generate extra data for predicting cluster membership
+     * @type {boolean}
+     * @memberof AlgorithmParams
+     */
+    'prediction_data'?: boolean;
+    /**
+     * Whether to match the reference implementation exactly
+     * @type {boolean}
+     * @memberof AlgorithmParams
+     */
+    'match_reference_implementation'?: boolean;
+    /**
+     * How to construct the affinity matrix (\'nearest_neighbors\', \'rbf\', \'precomputed\', \'precomputed_nearest_neighbors\')
+     * @type {string}
+     * @memberof AlgorithmParams
+     */
+    'affinity'?: string;
+    /**
+     * Path to the caching directory
+     * @type {string}
+     * @memberof AlgorithmParams
+     */
+    'memory'?: string;
+    /**
+     *
+     * @type {any}
+     * @memberof AlgorithmParams
+     */
+    'connectivity'?: any;
+    /**
+     * Whether to compute the full tree (\'auto\', True, or False)
+     * @type {string}
+     * @memberof AlgorithmParams
+     */
+    'compute_full_tree'?: string;
+    /**
+     * Linkage criterion (\'ward\', \'complete\', \'average\', \'single\')
+     * @type {string}
+     * @memberof AlgorithmParams
+     */
+    'linkage'?: string;
+    /**
+     * The linkage distance threshold above which clusters will not be merged
+     * @type {number}
+     * @memberof AlgorithmParams
+     */
+    'distance_threshold'?: number;
+    /**
+     * Whether to compute distances between clusters
+     * @type {boolean}
+     * @memberof AlgorithmParams
+     */
+    'compute_distances'?: boolean;
+    /**
+     * The eigenvalue decomposition strategy (\'arpack\', \'lobpcg\', \'amg\', or None)
+     * @type {string}
+     * @memberof AlgorithmParams
+     */
+    'eigen_solver'?: string;
+    /**
+     * Number of mixture components
+     * @type {number}
+     * @memberof AlgorithmParams
+     */
+    'n_components'?: number;
+    /**
+     * Kernel coefficient for rbf, poly, sigmoid, laplacian and chi2 kernels
+     * @type {number}
+     * @memberof AlgorithmParams
+     */
+    'gamma'?: number;
+    /**
+     * Number of neighbors to use when constructing the affinity matrix using nearest neighbors
+     * @type {number}
+     * @memberof AlgorithmParams
+     */
+    'n_neighbors'?: number;
+    /**
+     * Stopping criterion for eigendecomposition
+     * @type {number}
+     * @memberof AlgorithmParams
+     */
+    'eigen_tol'?: number;
+    /**
+     * Strategy to assign labels in the embedding space (\'kmeans\' or \'discretize\')
+     * @type {string}
+     * @memberof AlgorithmParams
+     */
+    'assign_labels'?: string;
+    /**
+     * Degree of the polynomial kernel. Ignored by other kernels
+     * @type {number}
+     * @memberof AlgorithmParams
+     */
+    'degree'?: number;
+    /**
+     * Zero coefficient for polynomial and sigmoid kernels
+     * @type {number}
+     * @memberof AlgorithmParams
+     */
+    'coef0'?: number;
+    /**
+     * Parameters for the kernel function
+     * @type {{ [key: string]: any; }}
+     * @memberof AlgorithmParams
+     */
+    'kernel_params'?: {
+        [key: string]: any;
+    };
+    /**
+     * Type of covariance parameters (\'full\', \'tied\', \'diag\', \'spherical\')
+     * @type {string}
+     * @memberof AlgorithmParams
+     */
+    'covariance_type'?: string;
+    /**
+     * Regularization added to the diagonal of covariance
+     * @type {number}
+     * @memberof AlgorithmParams
+     */
+    'reg_covar'?: number;
+    /**
+     * Method used to initialize weights, means and covariances (\'kmeans\' or \'random\')
+     * @type {string}
+     * @memberof AlgorithmParams
+     */
+    'init_params'?: string;
+    /**
+     * Initial weights
+     * @type {Array<any>}
+     * @memberof AlgorithmParams
+     */
+    'weights_init'?: Array<any>;
+    /**
+     * Initial means
+     * @type {Array<any>}
+     * @memberof AlgorithmParams
+     */
+    'means_init'?: Array<any>;
+    /**
+     * Initial precisions
+     * @type {Array<any>}
+     * @memberof AlgorithmParams
+     */
+    'precisions_init'?: Array<any>;
+    /**
+     * If True, use the solution of the last fit as initialization
+     * @type {boolean}
+     * @memberof AlgorithmParams
+     */
+    'warm_start'?: boolean;
+    /**
+     * Number of iterations between each verbose message
+     * @type {number}
+     * @memberof AlgorithmParams
+     */
+    'verbose_interval'?: number;
+    /**
+     * Bandwidth used in the RBF kernel. If None, estimated using sklearn.cluster.estimate_bandwidth
+     * @type {number}
+     * @memberof AlgorithmParams
+     */
+    'bandwidth'?: number;
+    /**
+     * Seeds used to initialize kernels. If None, all points are used as seeds
+     * @type {Array<Array<number>>}
+     * @memberof AlgorithmParams
+     */
+    'seeds'?: Array<Array<number>>;
+    /**
+     * If true, initial kernel locations are discretized into a grid to speed up algorithm
+     * @type {boolean}
+     * @memberof AlgorithmParams
+     */
+    'bin_seeding'?: boolean;
+    /**
+     * Minimum number of seeds within a bin for the bin to be considered
+     * @type {number}
+     * @memberof AlgorithmParams
+     */
+    'min_bin_freq'?: number;
+    /**
+     * If true, all points are clustered, even orphans. If false, orphans are given label -1
+     * @type {boolean}
+     * @memberof AlgorithmParams
+     */
+    'cluster_all'?: boolean;
+    /**
+     * Maximum distance between two samples. Default (None) means no maximum distance
+     * @type {number}
+     * @memberof AlgorithmParams
+     */
+    'max_eps'?: number;
+    /**
+     * Method to extract clusters (\'xi\' or \'dbscan\')
+     * @type {string}
+     * @memberof AlgorithmParams
+     */
+    'cluster_method'?: string;
+    /**
+     * Minimum steepness on the reachability plot for cluster boundary (xi method)
+     * @type {number}
+     * @memberof AlgorithmParams
+     */
+    'xi'?: number;
+    /**
+     * Correct clusters based on predecessors (xi method)
+     * @type {boolean}
+     * @memberof AlgorithmParams
+     */
+    'predecessor_correction'?: boolean;
+}
+//# sourceMappingURL=algorithm-params.d.ts.map

package/dist/models/algorithm-params.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"algorithm-params.d.ts","sourceRoot":"","sources":["../../models/algorithm-params.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;GAUG;AA4BH;;;;GAIG;AACH,MAAM,WAAW,eAAe;IAC5B;;;;OAIG;IACH,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB;;;;OAIG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;;;;OAIG;IACH,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB;;;;OAIG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;;;OAIG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;;;;OAIG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB;;;;OAIG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;;;;OAIG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB;;;;OAIG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB;;;;OAIG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;;;;OAIG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB;;;;OAIG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;;;OAIG;IACH,eAAe,CAAC,EAAE;QAAE,CAAC,GAAG,EAAE,MAAM,GAAG,GAAG,CAAC;KAAE,CAAC;IAC1C;;;;OAIG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB;;;;OAIG;IACH,GAAG,CAAC,EAAE,MAAM,CAAC;IACb;;;;OAIG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;;;OAIG;IACH,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B;;;;OAIG;IACH,2BAA2B,CAAC,EAAE,MAAM,CAAC;IACrC;;;;OAIG;IACH,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B;;;;OAIG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB;;;;OAIG;IACH,0BAA0B,CAAC,EAAE,MAAM,CAAC;IACpC;;;;OAIG;IACH,sBAAsB,CAAC,EAAE,OAAO,CAAC;IACjC;;;;OAIG;IACH,iBAAiB,CAAC,EAAE,OAAO,CAAC;IAC5B;;;;OAIG;IACH,gCAAgC,CAAC,EAAE,OAAO,CAAC;IAC3C;;;;OAIG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;;;;OAIG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;;;OAIG;IACH,cAAc,CAAC,EAAE,GAAG,CAAC;IACrB;;;;OAIG;IACH,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B;;;;OAIG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;;;;OAIG;IACH,oBAAoB,CAAC,EAAE,MAAM,CAAC;IAC9B;;;;OAIG;IACH,mBAAmB,CAAC,EAAE,OAAO,CAAC;IAC9B;;;;OAIG;IACH,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB;;;;OAIG;IACH,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB;;;;OAIG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB;;;;OAIG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB;;;;OAIG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB;;;;OAIG;IACH,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB;;;;OAIG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;;;OAIG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB;;;;OAIG;IACH,eAAe,CAAC,EAAE;QAAE,CAAC,GAAG,EAAE,MAAM,GAAG,GAAG,CAAC;KAAE,CAAC;IAC1C;;;;OAIG;IACH,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B;;;;OAIG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB;;;;OAIG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB;;;;OAIG;IACH,cAAc,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;IAC5B;;;;OAIG;IACH,YAAY,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;IAC1B;;;;OAIG;IACH,iBAAiB,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;IAC/B;;;;OAIG;IACH,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB;;;;OAIG;IACH,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B;;;;OAIG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB;;;;OAIG;IACH,OAAO,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;IAC/B;;;;OAIG;IACH,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB;;;;OAIG;IACH,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB;;;;OAIG;IACH,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB;;;;OAIG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;;;;OAIG;IACH,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B;;;;OAIG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;IACd;;;;OAIG;IACH,wBAAwB,CAAC,EAAE,OAAO,CAAC;CACtC"}

package/dist/models/alignment-metrics.d.ts

@@ -0,0 +1,83 @@
+/**
+ * Mixpeek API
+ * This is the Mixpeek API, providing access to various endpoints for data processing and retrieval.
+ *
+ * The version of the OpenAPI document: 0.81.1
+ * Contact: info@mixpeek.com
+ *
+ * NOTE: This class is auto generated by OpenAPI Generator (https://openapi-generator.tech).
+ * https://openapi-generator.tech
+ * Do not edit the class manually.
+ */
+/**
+ * Metrics measuring how well a ranking aligns with observed user behavior.  These metrics compare a candidate pipeline\'s ranking against ground truth derived from actual user interactions (clicks, purchases, etc.).
+ * @export
+ * @interface AlignmentMetrics
+ */
+export interface AlignmentMetrics {
+    /**
+     * Normalized Discounted Cumulative Gain at various K values.
+     * @type {{ [key: string]: number; }}
+     * @memberof AlignmentMetrics
+     */
+    'ndcg_at_k': {
+        [key: string]: number;
+    };
+    /**
+     * Average position of clicked items in the new ranking.
+     * @type {number}
+     * @memberof AlignmentMetrics
+     */
+    'mean_rank_clicked': number;
+    /**
+     * Average position of purchased items (if any purchases observed).
+     * @type {number}
+     * @memberof AlignmentMetrics
+     */
+    'mean_rank_purchased'?: number;
+    /**
+     * Fraction of interacted items found in top K results.
+     * @type {{ [key: string]: number; }}
+     * @memberof AlignmentMetrics
+     */
+    'recall_at_k': {
+        [key: string]: number;
+    };
+    /**
+     * Average change in position for interacted items (negative = promoted).
+     * @type {number}
+     * @memberof AlignmentMetrics
+     */
+    'avg_position_delta': number;
+    /**
+     * Number of interacted items moved to higher positions.
+     * @type {number}
+     * @memberof AlignmentMetrics
+     */
+    'items_promoted': number;
+    /**
+     * Number of interacted items moved to lower positions.
+     * @type {number}
+     * @memberof AlignmentMetrics
+     */
+    'items_demoted': number;
+    /**
+     * Sessions where candidate outperformed baseline.
+     * @type {number}
+     * @memberof AlignmentMetrics
+     */
+    'sessions_improved': number;
+    /**
+     * Sessions where candidate underperformed baseline.
+     * @type {number}
+     * @memberof AlignmentMetrics
+     */
+    'sessions_degraded': number;
+    /**
+     * Sessions with no significant difference.
+     * @type {number}
+     * @memberof AlignmentMetrics
+     */
+    'sessions_neutral': number;
+}
+//# sourceMappingURL=alignment-metrics.d.ts.map

package/dist/models/alignment-metrics.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"alignment-metrics.d.ts","sourceRoot":"","sources":["../../models/alignment-metrics.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;GAUG;AAIH;;;;GAIG;AACH,MAAM,WAAW,gBAAgB;IAC7B;;;;OAIG;IACH,WAAW,EAAE;QAAE,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAAC;KAAE,CAAC;IACxC;;;;OAIG;IACH,mBAAmB,EAAE,MAAM,CAAC;IAC5B;;;;OAIG;IACH,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAC/B;;;;OAIG;IACH,aAAa,EAAE;QAAE,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAAC;KAAE,CAAC;IAC1C;;;;OAIG;IACH,oBAAoB,EAAE,MAAM,CAAC;IAC7B;;;;OAIG;IACH,gBAAgB,EAAE,MAAM,CAAC;IACzB;;;;OAIG;IACH,eAAe,EAAE,MAAM,CAAC;IACxB;;;;OAIG;IACH,mBAAmB,EAAE,MAAM,CAAC;IAC5B;;;;OAIG;IACH,mBAAmB,EAAE,MAAM,CAAC;IAC5B;;;;OAIG;IACH,kBAAkB,EAAE,MAAM,CAAC;CAC9B"}

package/dist/models/and-inner.d.ts

@@ -0,0 +1,39 @@
+/**
+ * Mixpeek API
+ * This is the Mixpeek API, providing access to various endpoints for data processing and retrieval.
+ *
+ * The version of the OpenAPI document: 0.81.1
+ * Contact: info@mixpeek.com
+ *
+ * NOTE: This class is auto generated by OpenAPI Generator (https://openapi-generator.tech).
+ * https://openapi-generator.tech
+ * Do not edit the class manually.
+ */
+import type { DynamicValue } from './dynamic-value';
+import type { FilterOperator } from './filter-operator';
+/**
+ *
+ * @export
+ * @interface AndInner
+ */
+export interface AndInner {
+    /**
+     * Field name to filter on
+     * @type {string}
+     * @memberof AndInner
+     */
+    'field': string;
+    /**
+     * Comparison operator
+     * @type {FilterOperator}
+     * @memberof AndInner
+     */
+    'operator'?: FilterOperator;
+    /**
+     *
+     * @type {DynamicValue}
+     * @memberof AndInner
+     */
+    'value': DynamicValue;
+}
+//# sourceMappingURL=and-inner.d.ts.map

package/dist/models/and-inner.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"and-inner.d.ts","sourceRoot":"","sources":["../../models/and-inner.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;GAUG;AAKH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAMpD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAKxD;;;;GAIG;AACH,MAAM,WAAW,QAAQ;IACrB;;;;OAIG;IACH,OAAO,EAAE,MAAM,CAAC;IAChB;;;;OAIG;IACH,UAAU,CAAC,EAAE,cAAc,CAAC;IAC5B;;;;OAIG;IACH,OAAO,EAAE,YAAY,CAAC;CACzB"}

package/dist/models/anthropic-model.d.ts

@@ -0,0 +1,22 @@
+/**
+ * Mixpeek API
+ * This is the Mixpeek API, providing access to various endpoints for data processing and retrieval.
+ *
+ * The version of the OpenAPI document: 0.81.1
+ * Contact: info@mixpeek.com
+ *
+ * NOTE: This class is auto generated by OpenAPI Generator (https://openapi-generator.tech).
+ * https://openapi-generator.tech
+ * Do not edit the class manually.
+ */
+/**
+ * Anthropic Claude model identifiers for LLM generation.  Claude models excel at long context, complex reasoning, and safety. All models support text and images.  Values:     CLAUDE_3_5_SONNET: Most capable Claude model         - Use for: Complex reasoning, long documents, safety-critical         - Context: 200K tokens         - Vision: Yes         - Cost: $3/1M input, $15/1M output         - Performance: 300-800ms per request         - When to use: Need best reasoning, safety, or long context      CLAUDE_3_5_HAIKU: Fast, cost-effective Claude model         - Use for: High-volume, quick summaries         - Context: 200K tokens         - Vision: Yes         - Cost: $0.25/1M input, $1.25/1M output         - Performance: 100-300ms per request         - When to use: Good balance of quality and cost  Examples:     - Use CLAUDE_3_5_SONNET for complex entity extraction from contracts (best reasoning)     - Use CLAUDE_3_5_HAIKU for high-volume content moderation (cost-effective)
+ * @export
+ * @enum {string}
+ */
+export declare const AnthropicModel: {
+    readonly Claude35Sonnet20241022: "claude-3-5-sonnet-20241022";
+    readonly Claude35Haiku20241022: "claude-3-5-haiku-20241022";
+};
+export type AnthropicModel = typeof AnthropicModel[keyof typeof AnthropicModel];
+//# sourceMappingURL=anthropic-model.d.ts.map

package/dist/models/anthropic-model.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"anthropic-model.d.ts","sourceRoot":"","sources":["../../models/anthropic-model.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;GAUG;AAIH;;;;GAIG;AAEH,eAAO,MAAM,cAAc;;;CAGjB,CAAC;AAEX,MAAM,MAAM,cAAc,GAAG,OAAO,cAAc,CAAC,MAAM,OAAO,cAAc,CAAC,CAAC"}

package/dist/models/api-analytics-buckets-models-time-range.d.ts

@@ -0,0 +1,31 @@
+/**
+ * Mixpeek API
+ * This is the Mixpeek API, providing access to various endpoints for data processing and retrieval.
+ *
+ * The version of the OpenAPI document: 0.81.1
+ * Contact: info@mixpeek.com
+ *
+ * NOTE: This class is auto generated by OpenAPI Generator (https://openapi-generator.tech).
+ * https://openapi-generator.tech
+ * Do not edit the class manually.
+ */
+/**
+ * Time range for analytics queries.
+ * @export
+ * @interface ApiAnalyticsBucketsModelsTimeRange
+ */
+export interface ApiAnalyticsBucketsModelsTimeRange {
+    /**
+     * Start of time range
+     * @type {string}
+     * @memberof ApiAnalyticsBucketsModelsTimeRange
+     */
+    'start': string;
+    /**
+     * End of time range
+     * @type {string}
+     * @memberof ApiAnalyticsBucketsModelsTimeRange
+     */
+    'end': string;
+}
+//# sourceMappingURL=api-analytics-buckets-models-time-range.d.ts.map

package/dist/models/api-analytics-buckets-models-time-range.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"api-analytics-buckets-models-time-range.d.ts","sourceRoot":"","sources":["../../models/api-analytics-buckets-models-time-range.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;GAUG;AAIH;;;;GAIG;AACH,MAAM,WAAW,kCAAkC;IAC/C;;;;OAIG;IACH,OAAO,EAAE,MAAM,CAAC;IAChB;;;;OAIG;IACH,KAAK,EAAE,MAAM,CAAC;CACjB"}

package/dist/models/api-analytics-clusters-models-failure-analysis-response.d.ts

@@ -0,0 +1,45 @@
+/**
+ * Mixpeek API
+ * This is the Mixpeek API, providing access to various endpoints for data processing and retrieval.
+ *
+ * The version of the OpenAPI document: 0.81.1
+ * Contact: info@mixpeek.com
+ *
+ * NOTE: This class is auto generated by OpenAPI Generator (https://openapi-generator.tech).
+ * https://openapi-generator.tech
+ * Do not edit the class manually.
+ */
+import type { ApiAnalyticsClustersModelsTimeRange } from './api-analytics-clusters-models-time-range';
+import type { FailureMetric } from './failure-metric';
+/**
+ * Cluster failure analysis response.
+ * @export
+ * @interface ApiAnalyticsClustersModelsFailureAnalysisResponse
+ */
+export interface ApiAnalyticsClustersModelsFailureAnalysisResponse {
+    /**
+     *
+     * @type {string}
+     * @memberof ApiAnalyticsClustersModelsFailureAnalysisResponse
+     */
+    'cluster_id': string;
+    /**
+     *
+     * @type {ApiAnalyticsClustersModelsTimeRange}
+     * @memberof ApiAnalyticsClustersModelsFailureAnalysisResponse
+     */
+    'time_range': ApiAnalyticsClustersModelsTimeRange;
+    /**
+     *
+     * @type {Array<FailureMetric>}
+     * @memberof ApiAnalyticsClustersModelsFailureAnalysisResponse
+     */
+    'failures': Array<FailureMetric>;
+    /**
+     *
+     * @type {number}
+     * @memberof ApiAnalyticsClustersModelsFailureAnalysisResponse
+     */
+    'total_failures': number;
+}
+//# sourceMappingURL=api-analytics-clusters-models-failure-analysis-response.d.ts.map

package/dist/models/api-analytics-clusters-models-failure-analysis-response.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"api-analytics-clusters-models-failure-analysis-response.d.ts","sourceRoot":"","sources":["../../models/api-analytics-clusters-models-failure-analysis-response.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;GAUG;AAKH,OAAO,KAAK,EAAE,mCAAmC,EAAE,MAAM,4CAA4C,CAAC;AAGtG,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAEtD;;;;GAIG;AACH,MAAM,WAAW,iDAAiD;IAC9D;;;;OAIG;IACH,YAAY,EAAE,MAAM,CAAC;IACrB;;;;OAIG;IACH,YAAY,EAAE,mCAAmC,CAAC;IAClD;;;;OAIG;IACH,UAAU,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC;IACjC;;;;OAIG;IACH,gBAAgB,EAAE,MAAM,CAAC;CAC5B"}

package/dist/models/api-analytics-clusters-models-time-range.d.ts

@@ -0,0 +1,31 @@
+/**
+ * Mixpeek API
+ * This is the Mixpeek API, providing access to various endpoints for data processing and retrieval.
+ *
+ * The version of the OpenAPI document: 0.81.1
+ * Contact: info@mixpeek.com
+ *
+ * NOTE: This class is auto generated by OpenAPI Generator (https://openapi-generator.tech).
+ * https://openapi-generator.tech
+ * Do not edit the class manually.
+ */
+/**
+ * Time range for analytics queries.
+ * @export
+ * @interface ApiAnalyticsClustersModelsTimeRange
+ */
+export interface ApiAnalyticsClustersModelsTimeRange {
+    /**
+     *
+     * @type {string}
+     * @memberof ApiAnalyticsClustersModelsTimeRange
+     */
+    'start': string;
+    /**
+     *
+     * @type {string}
+     * @memberof ApiAnalyticsClustersModelsTimeRange
+     */
+    'end': string;
+}
+//# sourceMappingURL=api-analytics-clusters-models-time-range.d.ts.map

package/dist/models/api-analytics-clusters-models-time-range.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"api-analytics-clusters-models-time-range.d.ts","sourceRoot":"","sources":["../../models/api-analytics-clusters-models-time-range.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;GAUG;AAIH;;;;GAIG;AACH,MAAM,WAAW,mCAAmC;IAChD;;;;OAIG;IACH,OAAO,EAAE,MAAM,CAAC;IAChB;;;;OAIG;IACH,KAAK,EAAE,MAAM,CAAC;CACjB"}