/**
 * Base Mode Implementation
 *
 * Separated to avoid circular dependencies.
 */
/**
 * Base class for mode implementations
 */
export class BaseModeImplementation {
    config;
    optimizations;
    isInitialized = false;
    constructor(config, optimizations) {
        this.config = config;
        this.optimizations = optimizations;
    }
    async initialize() {
        this.isInitialized = true;
    }
    async cleanup() {
        this.isInitialized = false;
    }
    /**
     * Compute cosine similarity between two vectors (SIMD-optimized)
     */
    cosineSimilarity(a, b) {
        if (a.length !== b.length)
            return 0;
        let dotProduct = 0;
        let normA = 0;
        let normB = 0;
        // Process 4 elements at a time for SIMD-like behavior
        const len = a.length;
        const simdLen = len - (len % 4);
        for (let i = 0; i < simdLen; i += 4) {
            dotProduct += a[i] * b[i] + a[i + 1] * b[i + 1] + a[i + 2] * b[i + 2] + a[i + 3] * b[i + 3];
            normA += a[i] * a[i] + a[i + 1] * a[i + 1] + a[i + 2] * a[i + 2] + a[i + 3] * a[i + 3];
            normB += b[i] * b[i] + b[i + 1] * b[i + 1] + b[i + 2] * b[i + 2] + b[i + 3] * b[i + 3];
        }
        // Handle remaining elements
        for (let i = simdLen; i < len; i++) {
            dotProduct += a[i] * b[i];
            normA += a[i] * a[i];
            normB += b[i] * b[i];
        }
        const denom = Math.sqrt(normA) * Math.sqrt(normB);
        return denom > 0 ? dotProduct / denom : 0;
    }
    /**
     * Apply LoRA: output = input + BA * input (simplified)
     */
    applyLoRATransform(input, A, B, rank) {
        const dim = input.length;
        const output = new Float32Array(dim);
        // Copy input to output
        output.set(input);
        // Compute A * input -> intermediate (rank dimensions)
        const intermediate = new Float32Array(rank);
        for (let r = 0; r < rank; r++) {
            let sum = 0;
            for (let d = 0; d < dim; d++) {
                sum += A[d * rank + r] * input[d];
            }
            intermediate[r] = sum;
        }
        // Compute B * intermediate -> delta (dim dimensions)
        for (let d = 0; d < dim; d++) {
            let sum = 0;
            for (let r = 0; r < rank; r++) {
                sum += B[r * dim + d] * intermediate[r];
            }
            output[d] += sum;
        }
        return output;
    }
}
//# sourceMappingURL=base.js.map