// Property-based tests using fast-check
import { describe, it } from 'vitest';
import fc from 'fast-check';
import Database from 'better-sqlite3';
import { initSchema } from '../schema.mjs';
import {
  sanitizeFtsQuery,
  scrubSecrets,
  computeMinHash,
  estimateJaccardFromMinHash,
  jaccardSimilarity,
  estimateTokens,
  clampImportance,
} from '../utils.mjs';

// ─── sanitizeFtsQuery ───────────────────────────────────────────────────────

describe('sanitizeFtsQuery properties', () => {
  it('output is always valid FTS5 (never throws on MATCH)', () => {
    const db = new Database(':memory:');
    db.pragma('journal_mode = WAL');
    db.pragma('foreign_keys = OFF');
    initSchema(db);

    fc.assert(
      fc.property(fc.string({ minLength: 1, maxLength: 200 }), (input) => {
        const result = sanitizeFtsQuery(input);
        if (result === null) return true;
        // Should not throw when used in FTS5 MATCH
        try {
          db.prepare("SELECT rowid FROM observations_fts WHERE observations_fts MATCH ?").all(result);
          return true;
        } catch {
          return false;
        }
      }),
      { numRuns: 200 },
    );

    db.close();
  });

  it('returns null or non-empty string', () => {
    fc.assert(
      fc.property(fc.string({ maxLength: 500 }), (input) => {
        const result = sanitizeFtsQuery(input);
        return result === null || (typeof result === 'string' && result.length > 0);
      }),
      { numRuns: 500 },
    );
  });
});

// ─── scrubSecrets ───────────────────────────────────────────────────────────

describe('scrubSecrets properties', () => {
  it('is idempotent: scrub(scrub(x)) === scrub(x)', () => {
    fc.assert(
      fc.property(fc.string({ maxLength: 1000 }), (input) => {
        const once = scrubSecrets(input);
        const twice = scrubSecrets(once);
        return once === twice;
      }),
      { numRuns: 300 },
    );
  });

  it('preserves non-secret text unchanged', () => {
    // Generate strings that cannot match any secret pattern
    const safeChars = 'abcdefghijklmnopqrstuvwxyz 0123456789';
    const safeArb = fc.string({ minLength: 1, maxLength: 200 }).map(
      s => Array.from(s).map(c => safeChars[c.charCodeAt(0) % safeChars.length]).join('')
    );

    fc.assert(
      fc.property(safeArb, (input) => {
        return scrubSecrets(input) === input;
      }),
      { numRuns: 200 },
    );
  });
});

// ─── computeMinHash ─────────────────────────────────────────────────────────

describe('computeMinHash properties', () => {
  it('is deterministic: same input produces same output', () => {
    fc.assert(
      fc.property(
        fc.string({ minLength: 20, maxLength: 500 }),
        (input) => {
          const sig1 = computeMinHash(input);
          const sig2 = computeMinHash(input);
          return sig1 === sig2;
        },
      ),
      { numRuns: 200 },
    );
  });
});

// ─── estimateJaccardFromMinHash ─────────────────────────────────────────────

describe('estimateJaccardFromMinHash properties', () => {
  it('is symmetric: f(a,b) === f(b,a)', () => {
    // Generate meaningful text to get non-null signatures
    const textArb = fc.array(fc.lorem({ maxCount: 5 }), { minLength: 3, maxLength: 10 })
      .map(words => words.join(' '));

    fc.assert(
      fc.property(textArb, textArb, (a, b) => {
        const sigA = computeMinHash(a);
        const sigB = computeMinHash(b);
        if (!sigA || !sigB) return true; // skip short texts
        return estimateJaccardFromMinHash(sigA, sigB) === estimateJaccardFromMinHash(sigB, sigA);
      }),
      { numRuns: 100 },
    );
  });

  it('is bounded [0, 1]', () => {
    const textArb = fc.array(fc.lorem({ maxCount: 5 }), { minLength: 3, maxLength: 10 })
      .map(words => words.join(' '));

    fc.assert(
      fc.property(textArb, textArb, (a, b) => {
        const sigA = computeMinHash(a);
        const sigB = computeMinHash(b);
        if (!sigA || !sigB) return true;
        const similarity = estimateJaccardFromMinHash(sigA, sigB);
        return similarity >= 0 && similarity <= 1;
      }),
      { numRuns: 100 },
    );
  });

  it('identity: f(sig, sig) === 1.0', () => {
    const textArb = fc.array(fc.lorem({ maxCount: 5 }), { minLength: 3, maxLength: 10 })
      .map(words => words.join(' '));

    fc.assert(
      fc.property(textArb, (text) => {
        const sig = computeMinHash(text);
        if (!sig) return true;
        return estimateJaccardFromMinHash(sig, sig) === 1.0;
      }),
      { numRuns: 100 },
    );
  });
});

// ─── jaccardSimilarity ──────────────────────────────────────────────────────

describe('jaccardSimilarity properties', () => {
  it('is symmetric', () => {
    fc.assert(
      fc.property(fc.string(), fc.string(), (a, b) => {
        return jaccardSimilarity(a, b) === jaccardSimilarity(b, a);
      }),
      { numRuns: 300 },
    );
  });

  it('is bounded [0, 1]', () => {
    fc.assert(
      fc.property(fc.string(), fc.string(), (a, b) => {
        const sim = jaccardSimilarity(a, b);
        return sim >= 0 && sim <= 1;
      }),
      { numRuns: 300 },
    );
  });

  it('identity: f(s, s) === 1.0 for non-empty strings with words', () => {
    fc.assert(
      fc.property(
        fc.array(fc.lorem({ maxCount: 1 }), { minLength: 1, maxLength: 5 }).map(w => w.join(' ')),
        (s) => {
          return jaccardSimilarity(s, s) === 1.0;
        },
      ),
      { numRuns: 200 },
    );
  });
});

// ─── estimateTokens ─────────────────────────────────────────────────────────

describe('estimateTokens properties', () => {
  it('returns positive value for non-empty input', () => {
    fc.assert(
      fc.property(fc.string({ minLength: 1 }), (text) => {
        return estimateTokens(text) > 0;
      }),
      { numRuns: 300 },
    );
  });
});

// ─── clampImportance ────────────────────────────────────────────────────────

describe('clampImportance properties', () => {
  it('always returns 1, 2, or 3', () => {
    fc.assert(
      fc.property(fc.anything(), (val) => {
        const result = clampImportance(val);
        return [1, 2, 3].includes(result);
      }),
      { numRuns: 500 },
    );
  });
});
