@nahisaho/musubix-library-learner 2.0.0

package/dist/types.d.ts

@@ -0,0 +1,365 @@
+/**
+ * Type definitions for musubix-library-learner
+ *
+ * REQ-LL-001: 階層的抽象化
+ * REQ-LL-002: ライブラリ成長
+ * REQ-LL-003: 型指向探索
+ * REQ-LL-004: E-graph最適化
+ */
+/** Unique identifier for patterns */
+export type PatternId = string;
+/** Unique identifier for E-graph classes */
+export type EClassId = number;
+/** Code corpus for pattern mining */
+export interface CodeCorpus {
+    /** Unique identifier for the corpus */
+    id: string;
+    /** Source files in the corpus */
+    files: SourceFile[];
+    /** Metadata about the corpus */
+    metadata?: Record<string, unknown>;
+}
+/** Source file in a corpus */
+export interface SourceFile {
+    /** File path */
+    path: string;
+    /** File content */
+    content: string;
+    /** Programming language */
+    language: 'typescript' | 'javascript' | 'python' | string;
+}
+/** Candidate pattern detected during mining */
+export interface PatternCandidate {
+    /** Unique identifier */
+    id: PatternId;
+    /** Pattern AST or representation */
+    ast: ASTNode;
+    /** Occurrences in the corpus */
+    occurrences: PatternOccurrence[];
+    /** Computed score */
+    score: number;
+}
+/** Occurrence of a pattern in source code */
+export interface PatternOccurrence {
+    /** Source file path */
+    file: string;
+    /** Start line (1-indexed) */
+    startLine: number;
+    /** End line (1-indexed) */
+    endLine: number;
+    /** Matched bindings */
+    bindings: Map<string, ASTNode>;
+}
+/** Concrete pattern (Level 1 abstraction) */
+export interface ConcretePattern {
+    /** Unique identifier */
+    id: PatternId;
+    /** Pattern AST */
+    ast: ASTNode;
+    /** Number of occurrences */
+    occurrenceCount: number;
+    /** Source locations */
+    locations: PatternOccurrence[];
+}
+/** Parameterized template (Level 2 abstraction) */
+export interface ParameterizedTemplate {
+    /** Unique identifier */
+    id: PatternId;
+    /** Template with holes */
+    template: TemplateNode;
+    /** Parameter names and types */
+    parameters: TemplateParameter[];
+    /** Concrete patterns this abstracts */
+    concretePatterns: PatternId[];
+}
+/** Parameter in a template */
+export interface TemplateParameter {
+    /** Parameter name */
+    name: string;
+    /** Parameter type */
+    type: TypeSignature;
+    /** Default value (if any) */
+    defaultValue?: unknown;
+}
+/** Abstract concept (Level 3 abstraction) */
+export interface AbstractConcept {
+    /** Unique identifier */
+    id: PatternId;
+    /** Concept name */
+    name: string;
+    /** Description */
+    description: string;
+    /** Templates this concept encompasses */
+    templates: PatternId[];
+    /** Semantic category */
+    category: string;
+}
+/** Learned pattern stored in library */
+export interface LearnedPattern {
+    /** Unique identifier */
+    id: PatternId;
+    /** Pattern name */
+    name: string;
+    /** Abstraction level */
+    level: 1 | 2 | 3;
+    /** Pattern content (varies by level) */
+    content: ConcretePattern | ParameterizedTemplate | AbstractConcept;
+    /** Usage count */
+    usageCount: number;
+    /** Confidence score (0-1) */
+    confidence: number;
+    /** Creation timestamp */
+    createdAt: Date;
+    /** Last used timestamp */
+    lastUsedAt: Date;
+    /** Tags for categorization */
+    tags: string[];
+}
+/** Generic AST node */
+export interface ASTNode {
+    /** Node type */
+    type: string;
+    /** Child nodes */
+    children?: ASTNode[];
+    /** Node value (for literals) */
+    value?: unknown;
+    /** Additional properties */
+    [key: string]: unknown;
+}
+/** Template node with holes */
+export interface TemplateNode extends ASTNode {
+    /** Whether this is a hole */
+    isHole?: boolean;
+    /** Hole name (if isHole) */
+    holeName?: string;
+    /** Hole type constraint (if isHole) */
+    holeType?: TypeSignature;
+}
+/** Type signature for type-directed search */
+export interface TypeSignature {
+    /** Type kind */
+    kind: 'primitive' | 'function' | 'generic' | 'union' | 'intersection' | 'object' | 'array';
+    /** Type name (for primitives) */
+    name?: string;
+    /** Parameter types (for functions) */
+    paramTypes?: TypeSignature[];
+    /** Return type (for functions) */
+    returnType?: TypeSignature;
+    /** Type parameters (for generics) */
+    typeParams?: string[];
+    /** Union/intersection members */
+    members?: TypeSignature[];
+    /** Object properties */
+    properties?: Record<string, TypeSignature>;
+    /** Array element type */
+    elementType?: TypeSignature;
+}
+/** Type context for analysis */
+export interface TypeContext {
+    /** Available variables and their types */
+    variables: Map<string, TypeSignature>;
+    /** Available functions and their types */
+    functions: Map<string, TypeSignature>;
+    /** Type aliases */
+    aliases: Map<string, TypeSignature>;
+}
+/** E-graph node */
+export interface ENode {
+    /** Operator name */
+    op: string;
+    /** Child E-class IDs */
+    children: EClassId[];
+}
+/** E-class (equivalence class) */
+export interface EClass {
+    /** Class ID */
+    id: EClassId;
+    /** Nodes in this class */
+    nodes: ENode[];
+    /** Parent classes (for union-find) */
+    parents: Set<EClassId>;
+}
+/** Pattern for e-graph matching */
+export interface EPattern {
+    /** Pattern operator (or variable name if isVar) */
+    op: string;
+    /** Whether this is a pattern variable */
+    isVar?: boolean;
+    /** Child patterns */
+    children?: EPattern[];
+}
+/** Match result from e-graph pattern matching */
+export interface EMatch {
+    /** E-class ID that matched */
+    eclass: EClassId;
+    /** Variable bindings */
+    bindings: Map<string, EClassId>;
+}
+/** Equality rule for e-graph rewriting */
+export interface EqualityRule {
+    /** Rule name */
+    name: string;
+    /** Left-hand side pattern */
+    lhs: EPattern;
+    /** Right-hand side pattern */
+    rhs: EPattern;
+    /** Optional condition */
+    condition?: (match: EMatch) => boolean;
+}
+/** Cost function for extraction */
+export type CostFunction = (node: ENode, childCosts: number[]) => number;
+/** Optimal expression extracted from e-graph */
+export interface OptimalExpression {
+    /** Root E-class ID */
+    root: EClassId;
+    /** Extracted AST */
+    ast: ASTNode;
+    /** Total cost */
+    cost: number;
+}
+/** Query for searching patterns */
+export interface PatternQuery {
+    /** Text search */
+    text?: string;
+    /** Filter by abstraction level */
+    level?: 1 | 2 | 3;
+    /** Filter by tags */
+    tags?: string[];
+    /** Filter by minimum confidence */
+    minConfidence?: number;
+    /** Filter by minimum usage count */
+    minUsageCount?: number;
+    /** Maximum results */
+    limit?: number;
+}
+/** Specification for synthesis */
+export interface Specification {
+    /** Input-output examples */
+    examples?: Array<{
+        input: unknown;
+        output: unknown;
+    }>;
+    /** Type signature */
+    type?: TypeSignature;
+    /** Natural language description */
+    description?: string;
+    /** Constraints */
+    constraints?: string[];
+}
+/** Options for synthesis */
+export interface SynthesizeOptions {
+    /** Maximum search depth */
+    maxDepth?: number;
+    /** Timeout in milliseconds */
+    timeout?: number;
+    /** Whether to use type-directed search */
+    useTypeDirected?: boolean;
+    /** Whether to use E-graph optimization */
+    useEGraph?: boolean;
+}
+/** Result of synthesis */
+export interface SynthesisResult {
+    /** Whether synthesis succeeded */
+    success: boolean;
+    /** Synthesized program (if success) */
+    program?: ASTNode;
+    /** Alternative candidates */
+    candidates?: ASTNode[];
+    /** Time taken in milliseconds */
+    duration: number;
+    /** Number of search nodes explored */
+    searchNodes: number;
+    /** Patterns used */
+    patternsUsed: PatternId[];
+}
+/** Result of learning from corpus */
+export interface LearnResult {
+    /** Number of patterns extracted */
+    patternsExtracted: number;
+    /** Number of patterns added to library */
+    patternsAdded: number;
+    /** Number of patterns consolidated */
+    patternsConsolidated: number;
+    /** Time taken in milliseconds */
+    duration: number;
+}
+/** Statistics about the library */
+export interface LibraryStats {
+    /** Total number of patterns */
+    totalPatterns: number;
+    /** Patterns by level */
+    patternsByLevel: Record<1 | 2 | 3, number>;
+    /** Average confidence */
+    averageConfidence: number;
+    /** Average usage count */
+    averageUsageCount: number;
+    /** Most used patterns */
+    mostUsed: PatternId[];
+    /** Least used patterns */
+    leastUsed: PatternId[];
+}
+/** Report from consolidation */
+export interface ConsolidationReport {
+    /** Number of clusters found */
+    clustersFound: number;
+    /** Number of patterns merged */
+    patternsMerged: number;
+    /** New patterns created */
+    newPatterns: PatternId[];
+    /** Time taken in milliseconds */
+    duration: number;
+}
+/** Report from pruning */
+export interface PruneReport {
+    /** Number of patterns pruned */
+    patternsPruned: number;
+    /** IDs of pruned patterns */
+    prunedIds: PatternId[];
+    /** Time taken in milliseconds */
+    duration: number;
+}
+/** Cluster of similar patterns */
+export interface SimilarityCluster {
+    /** Representative pattern ID */
+    representative: PatternId;
+    /** Member pattern IDs */
+    members: PatternId[];
+    /** Similarity score */
+    similarity: number;
+}
+/** Configuration for LibraryLearner */
+export interface LibraryLearnerConfig {
+    /** Number of abstraction levels (default: 3) */
+    abstractionLevels?: number;
+    /** Minimum occurrences to extract pattern (default: 2) */
+    minOccurrences?: number;
+    /** Decay rate for unused patterns (default: 0.95) */
+    decayRate?: number;
+    /** Threshold for pruning (default: 0.1) */
+    pruneThreshold?: number;
+    /** Whether to use E-graph optimization (default: true) */
+    useEGraph?: boolean;
+    /** Storage path for library */
+    storagePath?: string;
+}
+/** Configuration for PatternMiner */
+export interface PatternMinerConfig {
+    /** Minimum occurrences to consider as pattern */
+    minOccurrences?: number;
+    /** Maximum pattern depth */
+    maxDepth?: number;
+    /** Minimum pattern size (nodes) */
+    minSize?: number;
+    /** Maximum pattern size (nodes) */
+    maxSize?: number;
+}
+/** Configuration for E-graph */
+export interface EGraphConfig {
+    /** Maximum iterations for saturation */
+    maxIterations?: number;
+    /** Timeout for saturation in milliseconds */
+    timeout?: number;
+    /** Whether to enable explanations */
+    enableExplanations?: boolean;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAMH,qCAAqC;AACrC,MAAM,MAAM,SAAS,GAAG,MAAM,CAAC;AAE/B,4CAA4C;AAC5C,MAAM,MAAM,QAAQ,GAAG,MAAM,CAAC;AAE9B,qCAAqC;AACrC,MAAM,WAAW,UAAU;IACzB,uCAAuC;IACvC,EAAE,EAAE,MAAM,CAAC;IACX,iCAAiC;IACjC,KAAK,EAAE,UAAU,EAAE,CAAC;IACpB,gCAAgC;IAChC,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACpC;AAED,8BAA8B;AAC9B,MAAM,WAAW,UAAU;IACzB,gBAAgB;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,mBAAmB;IACnB,OAAO,EAAE,MAAM,CAAC;IAChB,2BAA2B;IAC3B,QAAQ,EAAE,YAAY,GAAG,YAAY,GAAG,QAAQ,GAAG,MAAM,CAAC;CAC3D;AAMD,+CAA+C;AAC/C,MAAM,WAAW,gBAAgB;IAC/B,wBAAwB;IACxB,EAAE,EAAE,SAAS,CAAC;IACd,oCAAoC;IACpC,GAAG,EAAE,OAAO,CAAC;IACb,gCAAgC;IAChC,WAAW,EAAE,iBAAiB,EAAE,CAAC;IACjC,qBAAqB;IACrB,KAAK,EAAE,MAAM,CAAC;CACf;AAED,6CAA6C;AAC7C,MAAM,WAAW,iBAAiB;IAChC,uBAAuB;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,6BAA6B;IAC7B,SAAS,EAAE,MAAM,CAAC;IAClB,2BAA2B;IAC3B,OAAO,EAAE,MAAM,CAAC;IAChB,uBAAuB;IACvB,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CAChC;AAED,6CAA6C;AAC7C,MAAM,WAAW,eAAe;IAC9B,wBAAwB;IACxB,EAAE,EAAE,SAAS,CAAC;IACd,kBAAkB;IAClB,GAAG,EAAE,OAAO,CAAC;IACb,4BAA4B;IAC5B,eAAe,EAAE,MAAM,CAAC;IACxB,uBAAuB;IACvB,SAAS,EAAE,iBAAiB,EAAE,CAAC;CAChC;AAED,mDAAmD;AACnD,MAAM,WAAW,qBAAqB;IACpC,wBAAwB;IACxB,EAAE,EAAE,SAAS,CAAC;IACd,0BAA0B;IAC1B,QAAQ,EAAE,YAAY,CAAC;IACvB,gCAAgC;IAChC,UAAU,EAAE,iBAAiB,EAAE,CAAC;IAChC,uCAAuC;IACvC,gBAAgB,EAAE,SAAS,EAAE,CAAC;CAC/B;AAED,8BAA8B;AAC9B,MAAM,WAAW,iBAAiB;IAChC,qBAAqB;IACrB,IAAI,EAAE,MAAM,CAAC;IACb,qBAAqB;IACrB,IAAI,EAAE,aAAa,CAAC;IACpB,6BAA6B;IAC7B,YAAY,CAAC,EAAE,OAAO,CAAC;CACxB;AAED,6CAA6C;AAC7C,MAAM,WAAW,eAAe;IAC9B,wBAAwB;IACxB,EAAE,EAAE,SAAS,CAAC;IACd,mBAAmB;IACnB,IAAI,EAAE,MAAM,CAAC;IACb,kBAAkB;IAClB,WAAW,EAAE,MAAM,CAAC;IACpB,yCAAyC;IACzC,SAAS,EAAE,SAAS,EAAE,CAAC;IACvB,wBAAwB;IACxB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,wCAAwC;AACxC,MAAM,WAAW,cAAc;IAC7B,wBAAwB;IACxB,EAAE,EAAE,SAAS,CAAC;IACd,mBAAmB;IACnB,IAAI,EAAE,MAAM,CAAC;IACb,wBAAwB;IACxB,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACjB,wCAAwC;IACxC,OAAO,EAAE,eAAe,GAAG,qBAAqB,GAAG,eAAe,CAAC;IACnE,kBAAkB;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,6BAA6B;IAC7B,UAAU,EAAE,MAAM,CAAC;IACnB,yBAAyB;IACzB,SAAS,EAAE,IAAI,CAAC;IAChB,0BAA0B;IAC1B,UAAU,EAAE,IAAI,CAAC;IACjB,8BAA8B;IAC9B,IAAI,EAAE,MAAM,EAAE,CAAC;CAChB;AAMD,uBAAuB;AACvB,MAAM,WAAW,OAAO;IACtB,gBAAgB;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,kBAAkB;IAClB,QAAQ,CAAC,EAAE,OAAO,EAAE,CAAC;IACrB,gCAAgC;IAChC,KAAK,CAAC,EAAE,OAAO,CAAC;IAChB,4BAA4B;IAC5B,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACxB;AAED,+BAA+B;AAC/B,MAAM,WAAW,YAAa,SAAQ,OAAO;IAC3C,6BAA6B;IAC7B,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,4BAA4B;IAC5B,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,uCAAuC;IACvC,QAAQ,CAAC,EAAE,aAAa,CAAC;CAC1B;AAMD,8CAA8C;AAC9C,MAAM,WAAW,aAAa;IAC5B,gBAAgB;IAChB,IAAI,EAAE,WAAW,GAAG,UAAU,GAAG,SAAS,GAAG,OAAO,GAAG,cAAc,GAAG,QAAQ,GAAG,OAAO,CAAC;IAC3F,iCAAiC;IACjC,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,sCAAsC;IACtC,UAAU,CAAC,EAAE,aAAa,EAAE,CAAC;IAC7B,kCAAkC;IAClC,UAAU,CAAC,EAAE,aAAa,CAAC;IAC3B,qCAAqC;IACrC,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;IACtB,iCAAiC;IACjC,OAAO,CAAC,EAAE,aAAa,EAAE,CAAC;IAC1B,wBAAwB;IACxB,UAAU,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;IAC3C,yBAAyB;IACzB,WAAW,CAAC,EAAE,aAAa,CAAC;CAC7B;AAED,gCAAgC;AAChC,MAAM,WAAW,WAAW;IAC1B,0CAA0C;IAC1C,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;IACtC,0CAA0C;IAC1C,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;IACtC,mBAAmB;IACnB,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;CACrC;AAMD,mBAAmB;AACnB,MAAM,WAAW,KAAK;IACpB,oBAAoB;IACpB,EAAE,EAAE,MAAM,CAAC;IACX,wBAAwB;IACxB,QAAQ,EAAE,QAAQ,EAAE,CAAC;CACtB;AAED,kCAAkC;AAClC,MAAM,WAAW,MAAM;IACrB,eAAe;IACf,EAAE,EAAE,QAAQ,CAAC;IACb,0BAA0B;IAC1B,KAAK,EAAE,KAAK,EAAE,CAAC;IACf,sCAAsC;IACtC,OAAO,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC;CACxB;AAED,mCAAmC;AACnC,MAAM,WAAW,QAAQ;IACvB,mDAAmD;IACnD,EAAE,EAAE,MAAM,CAAC;IACX,yCAAyC;IACzC,KAAK,CAAC,EAAE,OAAO,CAAC;IAChB,qBAAqB;IACrB,QAAQ,CAAC,EAAE,QAAQ,EAAE,CAAC;CACvB;AAED,iDAAiD;AACjD,MAAM,WAAW,MAAM;IACrB,8BAA8B;IAC9B,MAAM,EAAE,QAAQ,CAAC;IACjB,wBAAwB;IACxB,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;CACjC;AAED,0CAA0C;AAC1C,MAAM,WAAW,YAAY;IAC3B,gBAAgB;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,6BAA6B;IAC7B,GAAG,EAAE,QAAQ,CAAC;IACd,8BAA8B;IAC9B,GAAG,EAAE,QAAQ,CAAC;IACd,yBAAyB;IACzB,SAAS,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,OAAO,CAAC;CACxC;AAED,mCAAmC;AACnC,MAAM,MAAM,YAAY,GAAG,CAAC,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,EAAE,KAAK,MAAM,CAAC;AAEzE,gDAAgD;AAChD,MAAM,WAAW,iBAAiB;IAChC,sBAAsB;IACtB,IAAI,EAAE,QAAQ,CAAC;IACf,oBAAoB;IACpB,GAAG,EAAE,OAAO,CAAC;IACb,iBAAiB;IACjB,IAAI,EAAE,MAAM,CAAC;CACd;AAMD,mCAAmC;AACnC,MAAM,WAAW,YAAY;IAC3B,kBAAkB;IAClB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,kCAAkC;IAClC,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAClB,qBAAqB;IACrB,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;IAChB,mCAAmC;IACnC,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,oCAAoC;IACpC,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,sBAAsB;IACtB,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,kCAAkC;AAClC,MAAM,WAAW,aAAa;IAC5B,4BAA4B;IAC5B,QAAQ,CAAC,EAAE,KAAK,CAAC;QAAE,KAAK,EAAE,OAAO,CAAC;QAAC,MAAM,EAAE,OAAO,CAAA;KAAE,CAAC,CAAC;IACtD,qBAAqB;IACrB,IAAI,CAAC,EAAE,aAAa,CAAC;IACrB,mCAAmC;IACnC,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,kBAAkB;IAClB,WAAW,CAAC,EAAE,MAAM,EAAE,CAAC;CACxB;AAED,4BAA4B;AAC5B,MAAM,WAAW,iBAAiB;IAChC,2BAA2B;IAC3B,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,8BAA8B;IAC9B,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,0CAA0C;IAC1C,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,0CAA0C;IAC1C,SAAS,CAAC,EAAE,OAAO,CAAC;CACrB;AAED,0BAA0B;AAC1B,MAAM,WAAW,eAAe;IAC9B,kCAAkC;IAClC,OAAO,EAAE,OAAO,CAAC;IACjB,uCAAuC;IACvC,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,6BAA6B;IAC7B,UAAU,CAAC,EAAE,OAAO,EAAE,CAAC;IACvB,iCAAiC;IACjC,QAAQ,EAAE,MAAM,CAAC;IACjB,sCAAsC;IACtC,WAAW,EAAE,MAAM,CAAC;IACpB,oBAAoB;IACpB,YAAY,EAAE,SAAS,EAAE,CAAC;CAC3B;AAMD,qCAAqC;AACrC,MAAM,WAAW,WAAW;IAC1B,mCAAmC;IACnC,iBAAiB,EAAE,MAAM,CAAC;IAC1B,0CAA0C;IAC1C,aAAa,EAAE,MAAM,CAAC;IACtB,sCAAsC;IACtC,oBAAoB,EAAE,MAAM,CAAC;IAC7B,iCAAiC;IACjC,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,mCAAmC;AACnC,MAAM,WAAW,YAAY;IAC3B,+BAA+B;IAC/B,aAAa,EAAE,MAAM,CAAC;IACtB,wBAAwB;IACxB,eAAe,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;IAC3C,yBAAyB;IACzB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,0BAA0B;IAC1B,iBAAiB,EAAE,MAAM,CAAC;IAC1B,yBAAyB;IACzB,QAAQ,EAAE,SAAS,EAAE,CAAC;IACtB,0BAA0B;IAC1B,SAAS,EAAE,SAAS,EAAE,CAAC;CACxB;AAED,gCAAgC;AAChC,MAAM,WAAW,mBAAmB;IAClC,+BAA+B;IAC/B,aAAa,EAAE,MAAM,CAAC;IACtB,gCAAgC;IAChC,cAAc,EAAE,MAAM,CAAC;IACvB,2BAA2B;IAC3B,WAAW,EAAE,SAAS,EAAE,CAAC;IACzB,iCAAiC;IACjC,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,0BAA0B;AAC1B,MAAM,WAAW,WAAW;IAC1B,gCAAgC;IAChC,cAAc,EAAE,MAAM,CAAC;IACvB,6BAA6B;IAC7B,SAAS,EAAE,SAAS,EAAE,CAAC;IACvB,iCAAiC;IACjC,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,kCAAkC;AAClC,MAAM,WAAW,iBAAiB;IAChC,gCAAgC;IAChC,cAAc,EAAE,SAAS,CAAC;IAC1B,yBAAyB;IACzB,OAAO,EAAE,SAAS,EAAE,CAAC;IACrB,uBAAuB;IACvB,UAAU,EAAE,MAAM,CAAC;CACpB;AAMD,uCAAuC;AACvC,MAAM,WAAW,oBAAoB;IACnC,gDAAgD;IAChD,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,0DAA0D;IAC1D,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,qDAAqD;IACrD,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,2CAA2C;IAC3C,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,0DAA0D;IAC1D,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,+BAA+B;IAC/B,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,qCAAqC;AACrC,MAAM,WAAW,kBAAkB;IACjC,iDAAiD;IACjD,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,4BAA4B;IAC5B,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,mCAAmC;IACnC,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,mCAAmC;IACnC,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,gCAAgC;AAChC,MAAM,WAAW,YAAY;IAC3B,wCAAwC;IACxC,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,6CAA6C;IAC7C,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,qCAAqC;IACrC,kBAAkB,CAAC,EAAE,OAAO,CAAC;CAC9B"}

package/dist/types.js

@@ -0,0 +1,10 @@
+/**
+ * Type definitions for musubix-library-learner
+ *
+ * REQ-LL-001: 階層的抽象化
+ * REQ-LL-002: ライブラリ成長
+ * REQ-LL-003: 型指向探索
+ * REQ-LL-004: E-graph最適化
+ */
+export {};
+//# sourceMappingURL=types.js.map

package/dist/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG"}

package/package.json

@@ -0,0 +1,66 @@
+{
+  "name": "@nahisaho/musubix-library-learner",
+  "version": "2.0.0",
+  "description": "DreamCoder-style hierarchical abstraction and library learning for MUSUBIX",
+  "type": "module",
+  "main": "dist/index.js",
+  "types": "dist/index.d.ts",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.js"
+    }
+  },
+  "files": [
+    "dist",
+    "README.md"
+  ],
+  "scripts": {
+    "build": "tsc",
+    "test": "vitest run",
+    "test:watch": "vitest",
+    "test:coverage": "vitest run --coverage",
+    "clean": "rm -rf dist",
+    "prepublishOnly": "npm run build"
+  },
+  "keywords": [
+    "musubix",
+    "library-learning",
+    "dreamcoder",
+    "abstraction",
+    "pattern-mining",
+    "e-graph"
+  ],
+  "author": "nahisaho",
+  "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/nahisaho/MUSUBIX.git",
+    "directory": "packages/library-learner"
+  },
+  "bugs": {
+    "url": "https://github.com/nahisaho/MUSUBIX/issues"
+  },
+  "homepage": "https://github.com/nahisaho/MUSUBIX/tree/main/packages/library-learner#readme",
+  "engines": {
+    "node": ">=20.0.0"
+  },
+  "dependencies": {
+    "@nahisaho/musubix-core": "^1.8.5",
+    "better-sqlite3": "^11.0.0"
+  },
+  "devDependencies": {
+    "@types/better-sqlite3": "^7.6.8",
+    "@types/node": "^20.0.0",
+    "typescript": "^5.3.0",
+    "vitest": "^1.2.0"
+  },
+  "peerDependencies": {
+    "@nahisaho/musubix-pattern-mcp": "^1.8.5"
+  },
+  "peerDependenciesMeta": {
+    "@nahisaho/musubix-pattern-mcp": {
+      "optional": true
+    }
+  }
+}