cursor-recursive-rag 0.2.0-alpha.2 → 0.2.0

package/dist/types/relationships.d.ts

@@ -0,0 +1,167 @@
+/**
+ * Typed relationships between knowledge chunks
+ *
+ * These relationship types enable multi-hop reasoning and graph traversal
+ * for more intelligent knowledge retrieval.
+ */
+import { RelationshipType } from './memory.js';
+export { RelationshipType };
+/**
+ * Categories of relationship types for filtering
+ */
+export declare const RELATIONSHIP_CATEGORIES: {
+    readonly semantic: readonly [RelationshipType.RELATES_TO, RelationshipType.SIMILAR_TO];
+    readonly causal: readonly [RelationshipType.LEADS_TO, RelationshipType.DERIVES_FROM, RelationshipType.SOLVES];
+    readonly temporal: readonly [RelationshipType.SUPERSEDES, RelationshipType.OCCURRED_BEFORE, RelationshipType.EVOLVED_INTO];
+    readonly conflict: readonly [RelationshipType.CONTRADICTS, RelationshipType.INVALIDATED_BY];
+    readonly preference: readonly [RelationshipType.PREFERS_OVER];
+    readonly structural: readonly [RelationshipType.PART_OF, RelationshipType.DEPENDS_ON, RelationshipType.IMPLEMENTS, RelationshipType.EXEMPLIFIES, RelationshipType.EXTENDS, RelationshipType.REFERENCES, RelationshipType.EXAMPLE_OF, RelationshipType.ALTERNATIVE_TO];
+};
+/**
+ * Bidirectional relationship pairs - relationships that naturally work both ways
+ */
+export declare const BIDIRECTIONAL_RELATIONSHIPS: Set<RelationshipType>;
+/**
+ * Maps relationship types to their logical reverse
+ */
+export declare const REVERSE_RELATIONSHIP_MAP: Record<RelationshipType, RelationshipType>;
+/**
+ * A relationship between two chunks with metadata
+ */
+export interface Relationship {
+    id: string;
+    fromChunkId: string;
+    toChunkId: string;
+    type: RelationshipType;
+    strength: number;
+    createdAt: Date;
+    metadata: Record<string, unknown>;
+    bidirectional: boolean;
+}
+/**
+ * Options for graph traversal operations
+ */
+export interface GraphTraversalOptions {
+    maxDepth: number;
+    relationshipTypes?: RelationshipType[];
+    minStrength?: number;
+    excludeArchived?: boolean;
+    includeMetadata?: boolean;
+    direction?: 'from' | 'to' | 'both';
+}
+/**
+ * Default traversal options
+ */
+export declare const DEFAULT_TRAVERSAL_OPTIONS: GraphTraversalOptions;
+/**
+ * A node in the traversal result graph
+ */
+export interface GraphNode {
+    chunkId: string;
+    depth: number;
+    path: string[];
+    relationshipType: RelationshipType;
+    strength: number;
+    metadata?: Record<string, unknown>;
+}
+/**
+ * Result of a graph traversal operation
+ */
+export interface GraphTraversalResult {
+    startChunkId: string;
+    nodes: GraphNode[];
+    totalNodes: number;
+    maxDepthReached: number;
+    truncated: boolean;
+}
+/**
+ * A detected contradiction between chunks
+ */
+export interface Contradiction {
+    chunkId: string;
+    type: 'contradiction' | 'invalidation' | 'superseded';
+    strength: number;
+    metadata?: Record<string, unknown>;
+}
+/**
+ * A potential contradiction detected automatically
+ */
+export interface PotentialContradiction {
+    existingChunkId: string;
+    newChunkId: string;
+    similarity: number;
+    reason: string;
+    suggestedAction: 'review' | 'supersede' | 'merge' | 'ignore';
+}
+/**
+ * Statistics about the relationship graph
+ */
+export interface GraphStats {
+    totalRelationships: number;
+    relationshipsByType: Record<RelationshipType, number>;
+    avgRelationshipsPerChunk: number;
+    maxDepth: number;
+    isolatedChunks: number;
+    mostConnectedChunks: Array<{
+        chunkId: string;
+        connections: number;
+    }>;
+}
+/**
+ * Options for finding related chunks
+ */
+export interface FindRelatedOptions {
+    types?: RelationshipType[];
+    minStrength?: number;
+    maxResults?: number;
+    includeTransitive?: boolean;
+    transitiveDepth?: number;
+}
+/**
+ * A related chunk with relationship context
+ */
+export interface RelatedChunk {
+    chunkId: string;
+    relationshipType: RelationshipType;
+    strength: number;
+    isTransitive: boolean;
+    path?: string[];
+}
+/**
+ * Batch operation for creating multiple relationships
+ */
+export interface RelationshipBatch {
+    relationships: Array<{
+        fromChunkId: string;
+        toChunkId: string;
+        type: RelationshipType;
+        strength?: number;
+        bidirectional?: boolean;
+        metadata?: Record<string, unknown>;
+    }>;
+}
+/**
+ * Result of a batch relationship operation
+ */
+export interface RelationshipBatchResult {
+    created: number;
+    updated: number;
+    failed: number;
+    errors?: Array<{
+        index: number;
+        error: string;
+    }>;
+}
+/**
+ * Helper function to check if a relationship type is bidirectional
+ */
+export declare function isBidirectional(type: RelationshipType): boolean;
+/**
+ * Get the reverse relationship type for a given type
+ */
+export declare function getReverseType(type: RelationshipType): RelationshipType;
+/**
+ * Get all relationship types in a category
+ */
+export declare function getRelationshipsByCategory(category: keyof typeof RELATIONSHIP_CATEGORIES): RelationshipType[];
+//# sourceMappingURL=relationships.d.ts.map

package/dist/types/relationships.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"relationships.d.ts","sourceRoot":"","sources":["../../src/types/relationships.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAG/C,OAAO,EAAE,gBAAgB,EAAE,CAAC;AAE5B;;GAEG;AACH,eAAO,MAAM,uBAAuB;;;;;;;CAgC1B,CAAC;AAEX;;GAEG;AACH,eAAO,MAAM,2BAA2B,uBAItC,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,wBAAwB,EAAE,MAAM,CAAC,gBAAgB,EAAE,gBAAgB,CAoB/E,CAAC;AAEF;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,gBAAgB,CAAC;IACvB,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,IAAI,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAClC,aAAa,EAAE,OAAO,CAAC;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,qBAAqB;IACpC,QAAQ,EAAE,MAAM,CAAC;IACjB,iBAAiB,CAAC,EAAE,gBAAgB,EAAE,CAAC;IACvC,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,GAAG,MAAM,CAAC;CACpC;AAED;;GAEG;AACH,eAAO,MAAM,yBAAyB,EAAE,qBAMvC,CAAC;AAEF;;GAEG;AACH,MAAM,WAAW,SAAS;IACxB,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,gBAAgB,EAAE,gBAAgB,CAAC;IACnC,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACpC;AAED;;GAEG;AACH,MAAM,WAAW,oBAAoB;IACnC,YAAY,EAAE,MAAM,CAAC;IACrB,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,eAAe,EAAE,MAAM,CAAC;IACxB,SAAS,EAAE,OAAO,CAAC;CACpB;AAED;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,eAAe,GAAG,cAAc,GAAG,YAAY,CAAC;IACtD,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACpC;AAED;;GAEG;AACH,MAAM,WAAW,sBAAsB;IACrC,eAAe,EAAE,MAAM,CAAC;IACxB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,eAAe,EAAE,QAAQ,GAAG,WAAW,GAAG,OAAO,GAAG,QAAQ,CAAC;CAC9D;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,mBAAmB,EAAE,MAAM,CAAC,gBAAgB,EAAE,MAAM,CAAC,CAAC;IACtD,wBAAwB,EAAE,MAAM,CAAC;IACjC,QAAQ,EAAE,MAAM,CAAC;IACjB,cAAc,EAAE,MAAM,CAAC;IACvB,mBAAmB,EAAE,KAAK,CAAC;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,WAAW,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CACtE;AAED;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC,KAAK,CAAC,EAAE,gBAAgB,EAAE,CAAC;IAC3B,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,iBAAiB,CAAC,EAAE,OAAO,CAAC;IAC5B,eAAe,CAAC,EAAE,MAAM,CAAC;CAC1B;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,OAAO,EAAE,MAAM,CAAC;IAChB,gBAAgB,EAAE,gBAAgB,CAAC;IACnC,QAAQ,EAAE,MAAM,CAAC;IACjB,YAAY,EAAE,OAAO,CAAC;IACtB,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;CACjB;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,aAAa,EAAE,KAAK,CAAC;QACnB,WAAW,EAAE,MAAM,CAAC;QACpB,SAAS,EAAE,MAAM,CAAC;QAClB,IAAI,EAAE,gBAAgB,CAAC;QACvB,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,aAAa,CAAC,EAAE,OAAO,CAAC;QACxB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;KACpC,CAAC,CAAC;CACJ;AAED;;GAEG;AACH,MAAM,WAAW,uBAAuB;IACtC,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CAClD;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,gBAAgB,GAAG,OAAO,CAE/D;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,gBAAgB,GAAG,gBAAgB,CAEvE;AAED;;GAEG;AACH,wBAAgB,0BAA0B,CACxC,QAAQ,EAAE,MAAM,OAAO,uBAAuB,GAC7C,gBAAgB,EAAE,CAEpB"}

package/dist/types/relationships.js

@@ -0,0 +1,106 @@
+/**
+ * Typed relationships between knowledge chunks
+ *
+ * These relationship types enable multi-hop reasoning and graph traversal
+ * for more intelligent knowledge retrieval.
+ */
+import { RelationshipType } from './memory.js';
+// Re-export for convenience
+export { RelationshipType };
+/**
+ * Categories of relationship types for filtering
+ */
+export const RELATIONSHIP_CATEGORIES = {
+    semantic: [
+        RelationshipType.RELATES_TO,
+        RelationshipType.SIMILAR_TO,
+    ],
+    causal: [
+        RelationshipType.LEADS_TO,
+        RelationshipType.DERIVES_FROM,
+        RelationshipType.SOLVES,
+    ],
+    temporal: [
+        RelationshipType.SUPERSEDES,
+        RelationshipType.OCCURRED_BEFORE,
+        RelationshipType.EVOLVED_INTO,
+    ],
+    conflict: [
+        RelationshipType.CONTRADICTS,
+        RelationshipType.INVALIDATED_BY,
+    ],
+    preference: [
+        RelationshipType.PREFERS_OVER,
+    ],
+    structural: [
+        RelationshipType.PART_OF,
+        RelationshipType.DEPENDS_ON,
+        RelationshipType.IMPLEMENTS,
+        RelationshipType.EXEMPLIFIES,
+        RelationshipType.EXTENDS,
+        RelationshipType.REFERENCES,
+        RelationshipType.EXAMPLE_OF,
+        RelationshipType.ALTERNATIVE_TO,
+    ],
+};
+/**
+ * Bidirectional relationship pairs - relationships that naturally work both ways
+ */
+export const BIDIRECTIONAL_RELATIONSHIPS = new Set([
+    RelationshipType.RELATES_TO,
+    RelationshipType.SIMILAR_TO,
+    RelationshipType.CONTRADICTS,
+]);
+/**
+ * Maps relationship types to their logical reverse
+ */
+export const REVERSE_RELATIONSHIP_MAP = {
+    [RelationshipType.RELATES_TO]: RelationshipType.RELATES_TO,
+    [RelationshipType.SIMILAR_TO]: RelationshipType.SIMILAR_TO,
+    [RelationshipType.LEADS_TO]: RelationshipType.DERIVES_FROM,
+    [RelationshipType.DERIVES_FROM]: RelationshipType.LEADS_TO,
+    [RelationshipType.SOLVES]: RelationshipType.SOLVES,
+    [RelationshipType.SUPERSEDES]: RelationshipType.SUPERSEDES,
+    [RelationshipType.OCCURRED_BEFORE]: RelationshipType.OCCURRED_BEFORE,
+    [RelationshipType.EVOLVED_INTO]: RelationshipType.DERIVES_FROM,
+    [RelationshipType.CONTRADICTS]: RelationshipType.CONTRADICTS,
+    [RelationshipType.INVALIDATED_BY]: RelationshipType.INVALIDATED_BY,
+    [RelationshipType.PREFERS_OVER]: RelationshipType.PREFERS_OVER,
+    [RelationshipType.PART_OF]: RelationshipType.PART_OF,
+    [RelationshipType.DEPENDS_ON]: RelationshipType.DEPENDS_ON,
+    [RelationshipType.IMPLEMENTS]: RelationshipType.EXEMPLIFIES,
+    [RelationshipType.EXEMPLIFIES]: RelationshipType.IMPLEMENTS,
+    [RelationshipType.EXTENDS]: RelationshipType.EXTENDS,
+    [RelationshipType.REFERENCES]: RelationshipType.REFERENCES,
+    [RelationshipType.EXAMPLE_OF]: RelationshipType.EXAMPLE_OF,
+    [RelationshipType.ALTERNATIVE_TO]: RelationshipType.ALTERNATIVE_TO,
+};
+/**
+ * Default traversal options
+ */
+export const DEFAULT_TRAVERSAL_OPTIONS = {
+    maxDepth: 2,
+    minStrength: 0.3,
+    excludeArchived: true,
+    includeMetadata: false,
+    direction: 'both',
+};
+/**
+ * Helper function to check if a relationship type is bidirectional
+ */
+export function isBidirectional(type) {
+    return BIDIRECTIONAL_RELATIONSHIPS.has(type);
+}
+/**
+ * Get the reverse relationship type for a given type
+ */
+export function getReverseType(type) {
+    return REVERSE_RELATIONSHIP_MAP[type];
+}
+/**
+ * Get all relationship types in a category
+ */
+export function getRelationshipsByCategory(category) {
+    return [...RELATIONSHIP_CATEGORIES[category]];
+}
+//# sourceMappingURL=relationships.js.map

package/dist/types/relationships.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"relationships.js","sourceRoot":"","sources":["../../src/types/relationships.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAE/C,4BAA4B;AAC5B,OAAO,EAAE,gBAAgB,EAAE,CAAC;AAE5B;;GAEG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAAG;IACrC,QAAQ,EAAE;QACR,gBAAgB,CAAC,UAAU;QAC3B,gBAAgB,CAAC,UAAU;KAC5B;IACD,MAAM,EAAE;QACN,gBAAgB,CAAC,QAAQ;QACzB,gBAAgB,CAAC,YAAY;QAC7B,gBAAgB,CAAC,MAAM;KACxB;IACD,QAAQ,EAAE;QACR,gBAAgB,CAAC,UAAU;QAC3B,gBAAgB,CAAC,eAAe;QAChC,gBAAgB,CAAC,YAAY;KAC9B;IACD,QAAQ,EAAE;QACR,gBAAgB,CAAC,WAAW;QAC5B,gBAAgB,CAAC,cAAc;KAChC;IACD,UAAU,EAAE;QACV,gBAAgB,CAAC,YAAY;KAC9B;IACD,UAAU,EAAE;QACV,gBAAgB,CAAC,OAAO;QACxB,gBAAgB,CAAC,UAAU;QAC3B,gBAAgB,CAAC,UAAU;QAC3B,gBAAgB,CAAC,WAAW;QAC5B,gBAAgB,CAAC,OAAO;QACxB,gBAAgB,CAAC,UAAU;QAC3B,gBAAgB,CAAC,UAAU;QAC3B,gBAAgB,CAAC,cAAc;KAChC;CACO,CAAC;AAEX;;GAEG;AACH,MAAM,CAAC,MAAM,2BAA2B,GAAG,IAAI,GAAG,CAAC;IACjD,gBAAgB,CAAC,UAAU;IAC3B,gBAAgB,CAAC,UAAU;IAC3B,gBAAgB,CAAC,WAAW;CAC7B,CAAC,CAAC;AAEH;;GAEG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAA+C;IAClF,CAAC,gBAAgB,CAAC,UAAU,CAAC,EAAE,gBAAgB,CAAC,UAAU;IAC1D,CAAC,gBAAgB,CAAC,UAAU,CAAC,EAAE,gBAAgB,CAAC,UAAU;IAC1D,CAAC,gBAAgB,CAAC,QAAQ,CAAC,EAAE,gBAAgB,CAAC,YAAY;IAC1D,CAAC,gBAAgB,CAAC,YAAY,CAAC,EAAE,gBAAgB,CAAC,QAAQ;IAC1D,CAAC,gBAAgB,CAAC,MAAM,CAAC,EAAE,gBAAgB,CAAC,MAAM;IAClD,CAAC,gBAAgB,CAAC,UAAU,CAAC,EAAE,gBAAgB,CAAC,UAAU;IAC1D,CAAC,gBAAgB,CAAC,eAAe,CAAC,EAAE,gBAAgB,CAAC,eAAe;IACpE,CAAC,gBAAgB,CAAC,YAAY,CAAC,EAAE,gBAAgB,CAAC,YAAY;IAC9D,CAAC,gBAAgB,CAAC,WAAW,CAAC,EAAE,gBAAgB,CAAC,WAAW;IAC5D,CAAC,gBAAgB,CAAC,cAAc,CAAC,EAAE,gBAAgB,CAAC,cAAc;IAClE,CAAC,gBAAgB,CAAC,YAAY,CAAC,EAAE,gBAAgB,CAAC,YAAY;IAC9D,CAAC,gBAAgB,CAAC,OAAO,CAAC,EAAE,gBAAgB,CAAC,OAAO;IACpD,CAAC,gBAAgB,CAAC,UAAU,CAAC,EAAE,gBAAgB,CAAC,UAAU;IAC1D,CAAC,gBAAgB,CAAC,UAAU,CAAC,EAAE,gBAAgB,CAAC,WAAW;IAC3D,CAAC,gBAAgB,CAAC,WAAW,CAAC,EAAE,gBAAgB,CAAC,UAAU;IAC3D,CAAC,gBAAgB,CAAC,OAAO,CAAC,EAAE,gBAAgB,CAAC,OAAO;IACpD,CAAC,gBAAgB,CAAC,UAAU,CAAC,EAAE,gBAAgB,CAAC,UAAU;IAC1D,CAAC,gBAAgB,CAAC,UAAU,CAAC,EAAE,gBAAgB,CAAC,UAAU;IAC1D,CAAC,gBAAgB,CAAC,cAAc,CAAC,EAAE,gBAAgB,CAAC,cAAc;CACnE,CAAC;AA4BF;;GAEG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAA0B;IAC9D,QAAQ,EAAE,CAAC;IACX,WAAW,EAAE,GAAG;IAChB,eAAe,EAAE,IAAI;IACrB,eAAe,EAAE,KAAK;IACtB,SAAS,EAAE,MAAM;CAClB,CAAC;AAwGF;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,IAAsB;IACpD,OAAO,2BAA2B,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;AAC/C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,IAAsB;IACnD,OAAO,wBAAwB,CAAC,IAAI,CAAC,CAAC;AACxC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,0BAA0B,CACxC,QAA8C;IAE9C,OAAO,CAAC,GAAG,uBAAuB,CAAC,QAAQ,CAAC,CAAC,CAAC;AAChD,CAAC"}

package/dist/types/rulesOptimizer.d.ts

@@ -0,0 +1,345 @@
+/**
+ * Rules Optimizer Types
+ *
+ * Types for parsing, analyzing, and optimizing Cursor rules and AGENTS.md files.
+ */
+/**
+ * Supported rule file formats
+ */
+export type RuleFileFormat = 'mdc' | 'md' | 'txt' | 'cursorrules';
+/**
+ * A rule file in the filesystem
+ */
+export interface RuleFile {
+    /** Absolute path to the file */
+    path: string;
+    /** File name without directory */
+    filename: string;
+    /** File format detected from extension */
+    format: RuleFileFormat;
+    /** Raw file content */
+    content: string;
+    /** File size in bytes */
+    size: number;
+    /** Last modified timestamp */
+    lastModified: Date;
+    /** Whether file is in .cursor/rules directory */
+    isCursorRule: boolean;
+}
+/**
+ * Metadata extracted from .mdc frontmatter
+ */
+export interface RuleFrontmatter {
+    /** Rule description */
+    description?: string;
+    /** Glob patterns for file matching */
+    globs?: string | string[];
+    /** Whether rule is always applied */
+    alwaysApply?: boolean;
+    /** Rule priority/order */
+    priority?: number;
+    /** Custom tags */
+    tags?: string[];
+    /** Any additional frontmatter fields */
+    [key: string]: unknown;
+}
+/**
+ * A parsed rule extracted from a file
+ */
+export interface ParsedRule {
+    /** Unique identifier for this rule */
+    id: string;
+    /** Rule title/name (from first heading or filename) */
+    title: string;
+    /** Rule content (markdown body) */
+    content: string;
+    /** Source file */
+    sourceFile: RuleFile;
+    /** Starting line in source file */
+    startLine: number;
+    /** Ending line in source file */
+    endLine: number;
+    /** Frontmatter metadata (for .mdc files) */
+    frontmatter?: RuleFrontmatter;
+    /** Extracted tags/categories */
+    tags: string[];
+    /** Dependencies on other rules (by ID or title) */
+    dependencies: string[];
+    /** Estimated token count */
+    tokenCount: number;
+    /** Content hash for deduplication */
+    contentHash: string;
+    /** Whether this is a section within a larger file */
+    isSection: boolean;
+    /** Parent rule ID if this is a section */
+    parentRuleId?: string;
+}
+/**
+ * Similarity match between two rules
+ */
+export interface DuplicateMatch {
+    /** First rule */
+    rule1: ParsedRule;
+    /** Second rule */
+    rule2: ParsedRule;
+    /** Similarity score (0-1) */
+    similarity: number;
+    /** Type of match */
+    matchType: DuplicateMatchType;
+    /** Specific overlapping content/concepts */
+    overlappingConcepts: string[];
+    /** Recommendation for handling this duplicate */
+    recommendation: DuplicateRecommendation;
+}
+export type DuplicateMatchType = 'exact' | 'near_exact' | 'semantic' | 'subset' | 'contradicting';
+export type DuplicateRecommendation = 'merge' | 'keep_newer' | 'keep_specific' | 'manual_review' | 'resolve_conflict';
+/**
+ * A cluster of related rules that could be merged
+ */
+export interface RuleCluster {
+    /** Cluster identifier */
+    id: string;
+    /** Suggested name for merged rule */
+    suggestedName: string;
+    /** Rules in this cluster */
+    rules: ParsedRule[];
+    /** Common tags across all rules */
+    commonTags: string[];
+    /** Topic/theme of this cluster */
+    topic: string;
+    /** Confidence score for this grouping (0-1) */
+    confidence: number;
+    /** Total tokens if kept separate */
+    totalTokensSeparate: number;
+    /** Estimated tokens after merging */
+    estimatedTokensMerged: number;
+    /** Token savings percentage */
+    savingsPercent: number;
+}
+/**
+ * A candidate for rule merging
+ */
+export interface MergeCandidate {
+    /** Rules to be merged */
+    rules: ParsedRule[];
+    /** Proposed merged content */
+    mergedContent: string;
+    /** Proposed merged title */
+    mergedTitle: string;
+    /** Reasoning for the merge */
+    mergeRationale: string;
+    /** Confidence score (0-1) */
+    confidence: number;
+    /** Token count before merge */
+    tokensBefore: number;
+    /** Token count after merge */
+    tokensAfter: number;
+    /** What was preserved from each rule */
+    preservedFrom: Array<{
+        ruleId: string;
+        preservedConcepts: string[];
+    }>;
+}
+/**
+ * Conflict between rules
+ */
+export interface RuleConflict {
+    /** First conflicting rule */
+    rule1: ParsedRule;
+    /** Second conflicting rule */
+    rule2: ParsedRule;
+    /** Type of conflict */
+    conflictType: ConflictType;
+    /** Description of the conflict */
+    description: string;
+    /** Specific conflicting statements */
+    conflictingStatements: Array<{
+        from: string;
+        statement1: string;
+        statement2: string;
+    }>;
+    /** Suggested resolution */
+    resolution?: ConflictResolution;
+}
+export type ConflictType = 'direct_contradiction' | 'implicit_contradiction' | 'scope_overlap' | 'version_mismatch' | 'preference_conflict';
+export interface ConflictResolution {
+    /** Which rule to prefer */
+    preferredRuleId: string;
+    /** Why this rule is preferred */
+    reasoning: string;
+    /** Suggested merged content (if applicable) */
+    mergedContent?: string;
+}
+/**
+ * Overall optimization report
+ */
+export interface OptimizationReport {
+    /** Report generation timestamp */
+    generatedAt: Date;
+    /** Directory/path that was analyzed */
+    analyzedPath: string;
+    /** Summary statistics */
+    summary: {
+        /** Total rule files found */
+        totalFiles: number;
+        /** Total individual rules extracted */
+        totalRules: number;
+        /** Total tokens before optimization */
+        totalTokensBefore: number;
+        /** Total tokens after optimization (if applied) */
+        totalTokensAfter: number;
+        /** Token savings percentage */
+        savingsPercent: number;
+        /** Number of duplicates found */
+        duplicatesFound: number;
+        /** Number of conflicts found */
+        conflictsFound: number;
+        /** Number of merge candidates */
+        mergeCandidates: number;
+        /** Number of outdated rules */
+        outdatedRules: number;
+    };
+    /** Detailed findings */
+    findings: {
+        /** Duplicate matches */
+        duplicates: DuplicateMatch[];
+        /** Rule clusters */
+        clusters: RuleCluster[];
+        /** Merge candidates */
+        merges: MergeCandidate[];
+        /** Conflicts */
+        conflicts: RuleConflict[];
+        /** Rules detected as outdated */
+        outdated: OutdatedRule[];
+    };
+    /** Optimization plan */
+    plan: OptimizationPlan;
+    /** Files that would be modified/created/deleted */
+    fileChanges: FileChange[];
+}
+/**
+ * A rule detected as potentially outdated
+ */
+export interface OutdatedRule {
+    /** The outdated rule */
+    rule: ParsedRule;
+    /** Why it's considered outdated */
+    reason: string;
+    /** Confidence score (0-1) */
+    confidence: number;
+    /** Suggested action */
+    action: 'remove' | 'update' | 'review';
+    /** Specific outdated references */
+    outdatedReferences: Array<{
+        reference: string;
+        currentVersion?: string;
+        suggestedUpdate?: string;
+    }>;
+}
+/**
+ * Optimization plan with prioritized actions
+ */
+export interface OptimizationPlan {
+    /** Ordered list of actions to take */
+    actions: OptimizationAction[];
+    /** Total estimated time to apply */
+    estimatedDuration: string;
+    /** Risk level of the plan */
+    riskLevel: 'low' | 'medium' | 'high';
+    /** Whether plan requires manual review */
+    requiresManualReview: boolean;
+}
+export interface OptimizationAction {
+    /** Action type */
+    type: 'merge' | 'delete' | 'update' | 'create' | 'move' | 'review';
+    /** Human-readable description */
+    description: string;
+    /** Rules affected */
+    affectedRules: string[];
+    /** Files affected */
+    affectedFiles: string[];
+    /** Token impact (negative = savings) */
+    tokenImpact: number;
+    /** Priority (1 = highest) */
+    priority: number;
+    /** Whether this action is safe to auto-apply */
+    autoApplyable: boolean;
+}
+/**
+ * File change for applying optimization
+ */
+export interface FileChange {
+    /** File path */
+    path: string;
+    /** Type of change */
+    changeType: 'create' | 'modify' | 'delete' | 'rename';
+    /** Original content (for modify) */
+    originalContent?: string;
+    /** New content (for create/modify) */
+    newContent?: string;
+    /** New path (for rename) */
+    newPath?: string;
+    /** Backup path if created */
+    backupPath?: string;
+}
+/**
+ * Options for the rules optimizer
+ */
+export interface RulesOptimizerOptions {
+    /** Minimum similarity threshold for duplicate detection (0-1) */
+    duplicateThreshold?: number;
+    /** Aggressiveness level for merging */
+    aggressiveness?: 'conservative' | 'balanced' | 'aggressive';
+    /** Whether to create backups before modifying */
+    createBackups?: boolean;
+    /** Directory for backups */
+    backupDir?: string;
+    /** Whether to detect outdated patterns */
+    detectOutdated?: boolean;
+    /** Whether to detect conflicts */
+    detectConflicts?: boolean;
+    /** Maximum token count per merged rule */
+    maxTokensPerRule?: number;
+    /** File patterns to include */
+    includePatterns?: string[];
+    /** File patterns to exclude */
+    excludePatterns?: string[];
+    /** Whether to use LLM for semantic analysis */
+    useLLM?: boolean;
+    /** Dry run mode - don't make actual changes */
+    dryRun?: boolean;
+}
+/**
+ * Default optimizer options
+ */
+export declare const DEFAULT_OPTIMIZER_OPTIONS: Required<RulesOptimizerOptions>;
+/**
+ * Result of applying optimization
+ */
+export interface OptimizationResult {
+    /** Whether optimization was successful */
+    success: boolean;
+    /** Changes that were applied */
+    appliedChanges: FileChange[];
+    /** Changes that failed */
+    failedChanges: Array<{
+        change: FileChange;
+        error: string;
+    }>;
+    /** Backup directory if backups were created */
+    backupDir?: string;
+    /** Final statistics */
+    stats: {
+        filesModified: number;
+        filesCreated: number;
+        filesDeleted: number;
+        tokensSaved: number;
+        rulesRemoved: number;
+        rulesMerged: number;
+    };
+    /** Any warnings */
+    warnings: string[];
+    /** Duration of operation */
+    durationMs: number;
+}
+//# sourceMappingURL=rulesOptimizer.d.ts.map

package/dist/types/rulesOptimizer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rulesOptimizer.d.ts","sourceRoot":"","sources":["../../src/types/rulesOptimizer.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH;;GAEG;AACH,MAAM,MAAM,cAAc,GAAG,KAAK,GAAG,IAAI,GAAG,KAAK,GAAG,aAAa,CAAC;AAElE;;GAEG;AACH,MAAM,WAAW,QAAQ;IACvB,gCAAgC;IAChC,IAAI,EAAE,MAAM,CAAC;IACb,kCAAkC;IAClC,QAAQ,EAAE,MAAM,CAAC;IACjB,0CAA0C;IAC1C,MAAM,EAAE,cAAc,CAAC;IACvB,uBAAuB;IACvB,OAAO,EAAE,MAAM,CAAC;IAChB,yBAAyB;IACzB,IAAI,EAAE,MAAM,CAAC;IACb,8BAA8B;IAC9B,YAAY,EAAE,IAAI,CAAC;IACnB,iDAAiD;IACjD,YAAY,EAAE,OAAO,CAAC;CACvB;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,uBAAuB;IACvB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,sCAAsC;IACtC,KAAK,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC;IAC1B,qCAAqC;IACrC,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB,0BAA0B;IAC1B,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,kBAAkB;IAClB,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;IAChB,wCAAwC;IACxC,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB,sCAAsC;IACtC,EAAE,EAAE,MAAM,CAAC;IACX,uDAAuD;IACvD,KAAK,EAAE,MAAM,CAAC;IACd,mCAAmC;IACnC,OAAO,EAAE,MAAM,CAAC;IAChB,kBAAkB;IAClB,UAAU,EAAE,QAAQ,CAAC;IACrB,mCAAmC;IACnC,SAAS,EAAE,MAAM,CAAC;IAClB,iCAAiC;IACjC,OAAO,EAAE,MAAM,CAAC;IAChB,4CAA4C;IAC5C,WAAW,CAAC,EAAE,eAAe,CAAC;IAC9B,gCAAgC;IAChC,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,mDAAmD;IACnD,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,4BAA4B;IAC5B,UAAU,EAAE,MAAM,CAAC;IACnB,qCAAqC;IACrC,WAAW,EAAE,MAAM,CAAC;IACpB,qDAAqD;IACrD,SAAS,EAAE,OAAO,CAAC;IACnB,0CAA0C;IAC1C,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,iBAAiB;IACjB,KAAK,EAAE,UAAU,CAAC;IAClB,kBAAkB;IAClB,KAAK,EAAE,UAAU,CAAC;IAClB,6BAA6B;IAC7B,UAAU,EAAE,MAAM,CAAC;IACnB,oBAAoB;IACpB,SAAS,EAAE,kBAAkB,CAAC;IAC9B,4CAA4C;IAC5C,mBAAmB,EAAE,MAAM,EAAE,CAAC;IAC9B,iDAAiD;IACjD,cAAc,EAAE,uBAAuB,CAAC;CACzC;AAED,MAAM,MAAM,kBAAkB,GAC1B,OAAO,GACP,YAAY,GACZ,UAAU,GACV,QAAQ,GACR,eAAe,CAAC;AAEpB,MAAM,MAAM,uBAAuB,GAC/B,OAAO,GACP,YAAY,GACZ,eAAe,GACf,eAAe,GACf,kBAAkB,CAAC;AAEvB;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,yBAAyB;IACzB,EAAE,EAAE,MAAM,CAAC;IACX,qCAAqC;IACrC,aAAa,EAAE,MAAM,CAAC;IACtB,4BAA4B;IAC5B,KAAK,EAAE,UAAU,EAAE,CAAC;IACpB,mCAAmC;IACnC,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,kCAAkC;IAClC,KAAK,EAAE,MAAM,CAAC;IACd,+CAA+C;IAC/C,UAAU,EAAE,MAAM,CAAC;IACnB,oCAAoC;IACpC,mBAAmB,EAAE,MAAM,CAAC;IAC5B,qCAAqC;IACrC,qBAAqB,EAAE,MAAM,CAAC;IAC9B,+BAA+B;IAC/B,cAAc,EAAE,MAAM,CAAC;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,yBAAyB;IACzB,KAAK,EAAE,UAAU,EAAE,CAAC;IACpB,8BAA8B;IAC9B,aAAa,EAAE,MAAM,CAAC;IACtB,4BAA4B;IAC5B,WAAW,EAAE,MAAM,CAAC;IACpB,8BAA8B;IAC9B,cAAc,EAAE,MAAM,CAAC;IACvB,6BAA6B;IAC7B,UAAU,EAAE,MAAM,CAAC;IACnB,+BAA+B;IAC/B,YAAY,EAAE,MAAM,CAAC;IACrB,8BAA8B;IAC9B,WAAW,EAAE,MAAM,CAAC;IACpB,wCAAwC;IACxC,aAAa,EAAE,KAAK,CAAC;QACnB,MAAM,EAAE,MAAM,CAAC;QACf,iBAAiB,EAAE,MAAM,EAAE,CAAC;KAC7B,CAAC,CAAC;CACJ;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,6BAA6B;IAC7B,KAAK,EAAE,UAAU,CAAC;IAClB,8BAA8B;IAC9B,KAAK,EAAE,UAAU,CAAC;IAClB,uBAAuB;IACvB,YAAY,EAAE,YAAY,CAAC;IAC3B,kCAAkC;IAClC,WAAW,EAAE,MAAM,CAAC;IACpB,sCAAsC;IACtC,qBAAqB,EAAE,KAAK,CAAC;QAC3B,IAAI,EAAE,MAAM,CAAC;QACb,UAAU,EAAE,MAAM,CAAC;QACnB,UAAU,EAAE,MAAM,CAAC;KACpB,CAAC,CAAC;IACH,2BAA2B;IAC3B,UAAU,CAAC,EAAE,kBAAkB,CAAC;CACjC;AAED,MAAM,MAAM,YAAY,GACpB,sBAAsB,GACtB,wBAAwB,GACxB,eAAe,GACf,kBAAkB,GAClB,qBAAqB,CAAC;AAE1B,MAAM,WAAW,kBAAkB;IACjC,2BAA2B;IAC3B,eAAe,EAAE,MAAM,CAAC;IACxB,iCAAiC;IACjC,SAAS,EAAE,MAAM,CAAC;IAClB,+CAA+C;IAC/C,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC,kCAAkC;IAClC,WAAW,EAAE,IAAI,CAAC;IAClB,uCAAuC;IACvC,YAAY,EAAE,MAAM,CAAC;IAErB,yBAAyB;IACzB,OAAO,EAAE;QACP,6BAA6B;QAC7B,UAAU,EAAE,MAAM,CAAC;QACnB,uCAAuC;QACvC,UAAU,EAAE,MAAM,CAAC;QACnB,uCAAuC;QACvC,iBAAiB,EAAE,MAAM,CAAC;QAC1B,mDAAmD;QACnD,gBAAgB,EAAE,MAAM,CAAC;QACzB,+BAA+B;QAC/B,cAAc,EAAE,MAAM,CAAC;QACvB,iCAAiC;QACjC,eAAe,EAAE,MAAM,CAAC;QACxB,gCAAgC;QAChC,cAAc,EAAE,MAAM,CAAC;QACvB,iCAAiC;QACjC,eAAe,EAAE,MAAM,CAAC;QACxB,+BAA+B;QAC/B,aAAa,EAAE,MAAM,CAAC;KACvB,CAAC;IAEF,wBAAwB;IACxB,QAAQ,EAAE;QACR,wBAAwB;QACxB,UAAU,EAAE,cAAc,EAAE,CAAC;QAC7B,oBAAoB;QACpB,QAAQ,EAAE,WAAW,EAAE,CAAC;QACxB,uBAAuB;QACvB,MAAM,EAAE,cAAc,EAAE,CAAC;QACzB,gBAAgB;QAChB,SAAS,EAAE,YAAY,EAAE,CAAC;QAC1B,iCAAiC;QACjC,QAAQ,EAAE,YAAY,EAAE,CAAC;KAC1B,CAAC;IAEF,wBAAwB;IACxB,IAAI,EAAE,gBAAgB,CAAC;IAEvB,mDAAmD;IACnD,WAAW,EAAE,UAAU,EAAE,CAAC;CAC3B;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,wBAAwB;IACxB,IAAI,EAAE,UAAU,CAAC;IACjB,mCAAmC;IACnC,MAAM,EAAE,MAAM,CAAC;IACf,6BAA6B;IAC7B,UAAU,EAAE,MAAM,CAAC;IACnB,uBAAuB;IACvB,MAAM,EAAE,QAAQ,GAAG,QAAQ,GAAG,QAAQ,CAAC;IACvC,mCAAmC;IACnC,kBAAkB,EAAE,KAAK,CAAC;QACxB,SAAS,EAAE,MAAM,CAAC;QAClB,cAAc,CAAC,EAAE,MAAM,CAAC;QACxB,eAAe,CAAC,EAAE,MAAM,CAAC;KAC1B,CAAC,CAAC;CACJ;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,sCAAsC;IACtC,OAAO,EAAE,kBAAkB,EAAE,CAAC;IAC9B,oCAAoC;IACpC,iBAAiB,EAAE,MAAM,CAAC;IAC1B,6BAA6B;IAC7B,SAAS,EAAE,KAAK,GAAG,QAAQ,GAAG,MAAM,CAAC;IACrC,0CAA0C;IAC1C,oBAAoB,EAAE,OAAO,CAAC;CAC/B;AAED,MAAM,WAAW,kBAAkB;IACjC,kBAAkB;IAClB,IAAI,EAAE,OAAO,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,GAAG,MAAM,GAAG,QAAQ,CAAC;IACnE,iCAAiC;IACjC,WAAW,EAAE,MAAM,CAAC;IACpB,qBAAqB;IACrB,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,qBAAqB;IACrB,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,wCAAwC;IACxC,WAAW,EAAE,MAAM,CAAC;IACpB,6BAA6B;IAC7B,QAAQ,EAAE,MAAM,CAAC;IACjB,gDAAgD;IAChD,aAAa,EAAE,OAAO,CAAC;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB,gBAAgB;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,qBAAqB;IACrB,UAAU,EAAE,QAAQ,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,CAAC;IACtD,oCAAoC;IACpC,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,sCAAsC;IACtC,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,4BAA4B;IAC5B,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,6BAA6B;IAC7B,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED;;GAEG;AACH,MAAM,WAAW,qBAAqB;IACpC,iEAAiE;IACjE,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,uCAAuC;IACvC,cAAc,CAAC,EAAE,cAAc,GAAG,UAAU,GAAG,YAAY,CAAC;IAC5D,iDAAiD;IACjD,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,4BAA4B;IAC5B,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,0CAA0C;IAC1C,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,kCAAkC;IAClC,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,0CAA0C;IAC1C,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,+BAA+B;IAC/B,eAAe,CAAC,EAAE,MAAM,EAAE,CAAC;IAC3B,+BAA+B;IAC/B,eAAe,CAAC,EAAE,MAAM,EAAE,CAAC;IAC3B,+CAA+C;IAC/C,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,+CAA+C;IAC/C,MAAM,CAAC,EAAE,OAAO,CAAC;CAClB;AAED;;GAEG;AACH,eAAO,MAAM,yBAAyB,EAAE,QAAQ,CAAC,qBAAqB,CAYrE,CAAC;AAEF;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC,0CAA0C;IAC1C,OAAO,EAAE,OAAO,CAAC;IACjB,gCAAgC;IAChC,cAAc,EAAE,UAAU,EAAE,CAAC;IAC7B,0BAA0B;IAC1B,aAAa,EAAE,KAAK,CAAC;QACnB,MAAM,EAAE,UAAU,CAAC;QACnB,KAAK,EAAE,MAAM,CAAC;KACf,CAAC,CAAC;IACH,+CAA+C;IAC/C,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,uBAAuB;IACvB,KAAK,EAAE;QACL,aAAa,EAAE,MAAM,CAAC;QACtB,YAAY,EAAE,MAAM,CAAC;QACrB,YAAY,EAAE,MAAM,CAAC;QACrB,WAAW,EAAE,MAAM,CAAC;QACpB,YAAY,EAAE,MAAM,CAAC;QACrB,WAAW,EAAE,MAAM,CAAC;KACrB,CAAC;IACF,mBAAmB;IACnB,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,4BAA4B;IAC5B,UAAU,EAAE,MAAM,CAAC;CACpB"}

package/dist/types/rulesOptimizer.js

@@ -0,0 +1,22 @@
+/**
+ * Rules Optimizer Types
+ *
+ * Types for parsing, analyzing, and optimizing Cursor rules and AGENTS.md files.
+ */
+/**
+ * Default optimizer options
+ */
+export const DEFAULT_OPTIMIZER_OPTIONS = {
+    duplicateThreshold: 0.7,
+    aggressiveness: 'balanced',
+    createBackups: true,
+    backupDir: '.cursor-rag/rules-backup',
+    detectOutdated: true,
+    detectConflicts: true,
+    maxTokensPerRule: 2000,
+    includePatterns: ['**/*.mdc', '**/*.md', '**/AGENTS.md', '**/.cursorrules'],
+    excludePatterns: ['**/node_modules/**', '**/.git/**'],
+    useLLM: true,
+    dryRun: false,
+};
+//# sourceMappingURL=rulesOptimizer.js.map

package/dist/types/rulesOptimizer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rulesOptimizer.js","sourceRoot":"","sources":["../../src/types/rulesOptimizer.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAyVH;;GAEG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAAoC;IACxE,kBAAkB,EAAE,GAAG;IACvB,cAAc,EAAE,UAAU;IAC1B,aAAa,EAAE,IAAI;IACnB,SAAS,EAAE,0BAA0B;IACrC,cAAc,EAAE,IAAI;IACpB,eAAe,EAAE,IAAI;IACrB,gBAAgB,EAAE,IAAI;IACtB,eAAe,EAAE,CAAC,UAAU,EAAE,SAAS,EAAE,cAAc,EAAE,iBAAiB,CAAC;IAC3E,eAAe,EAAE,CAAC,oBAAoB,EAAE,YAAY,CAAC;IACrD,MAAM,EAAE,IAAI;IACZ,MAAM,EAAE,KAAK;CACd,CAAC"}