learngraph 0.1.0 → 0.2.0

package/LICENSE

@@ -1,21 +1,190 @@
-MIT License
-
-Copyright (c) 2024 LearnGraph Team
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to the Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   Copyright 2025 LearnGraph Team
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.md

@@ -1,8 +1,27 @@
-# jali
+# LearnGraph
 
-AI-powered educational knowledge graph infrastructure.
+**The world's first AI-powered learning path generator.**
 
-See the [main README](../../README.md) for full documentation.
+Transform any syllabus into personalized mastery paths with learning science built in. Every student's path to mastery, powered by decades of educational research.
+
+[![npm version](https://img.shields.io/npm/v/learngraph.svg)](https://www.npmjs.com/package/learngraph)
+[![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)
+
+## Why LearnGraph?
+
+**The Problem**: Traditional curricula treat all learners the same. They present content linearly, ignore prerequisite gaps, and fail to adapt to individual progress.
+
+**The Solution**: LearnGraph decomposes curricula into skill graphs, automatically identifies each learner's Zone of Proximal Development (ZPD), and generates personalized learning paths that respect cognitive load limits.
+
+### Key Features
+
+- **Zone of Proximal Development (ZPD)** - Identifies skills that are challenging but achievable
+- **Bloom's Taxonomy Integration** - Automatic detection and progression through cognitive levels
+- **Bayesian Knowledge Tracing (BKT)** - Probabilistic mastery estimation from performance data
+- **Spaced Repetition** - Optimal review scheduling based on memory science
+- **Prerequisite Mapping** - Hard, soft, and recommended dependency relationships
+- **Threshold Concepts** - Identifies transformative "gateway" skills that unlock understanding
+- **Cognitive Load Management** - Respects working memory limits in session planning
 
 ## Installation
 
@@ -13,13 +32,176 @@ npm install learngraph
 ## Quick Start
 
 ```typescript
-import { createSkillId, type SkillNode, detectBloomLevel } from 'learngraph';
+import {
+  createSkillId,
+  detectBloomLevel,
+  hasMastery,
+  type SkillNode
+} from 'learngraph';
 
 // Detect Bloom's level from a learning objective
 const level = detectBloomLevel('Calculate the derivative of a polynomial');
 console.log(level); // 'apply'
+
+// Define a skill in the knowledge graph
+const skill: SkillNode = {
+  id: createSkillId('derivatives-polynomials'),
+  name: 'Polynomial Derivatives',
+  description: 'Calculate derivatives of polynomial functions using power rule',
+  bloomLevel: 'apply',
+  difficulty: 0.4,
+  isThresholdConcept: false,
+  masteryThreshold: 0.8,
+  estimatedMinutes: 30,
+  tags: ['calculus', 'derivatives'],
+  metadata: {},
+  createdAt: new Date().toISOString(),
+  updatedAt: new Date().toISOString(),
+};
+
+// Check if learner has mastered a skill
+const mastered = hasMastery(0.85); // true (above 0.8 threshold)
 ```
 
+## Educational Research Foundations
+
+LearnGraph is built on decades of peer-reviewed educational psychology research:
+
+| Framework | Purpose | Key Benefit |
+|-----------|---------|-------------|
+| **Zone of Proximal Development** | Vygotsky's theory of optimal learning challenge | Keeps learners in the "sweet spot" |
+| **Bloom's Taxonomy** | Cognitive complexity hierarchy | Ensures proper skill progression |
+| **Bayesian Knowledge Tracing** | Probabilistic mastery modeling | Accurate knowledge state estimation |
+| **Item Response Theory** | Skill difficulty calibration | Fair assessment across items |
+| **Spaced Repetition** | Memory consolidation optimization | Long-term retention |
+| **Cognitive Load Theory** | Working memory management | Prevents overwhelm |
+
+## Storage Adapters
+
+LearnGraph supports multiple storage backends. Use the one that fits your needs:
+
+### In-Memory Storage (Built-in)
+
+Perfect for testing, prototyping, and serverless functions:
+
+```typescript
+import { MemoryStorage } from 'learngraph/storage';
+
+const storage = new MemoryStorage();
+await storage.connect({ backend: 'memory' });
+
+// Create a skill
+const skill = await storage.createSkill({
+  name: 'Add Fractions',
+  description: 'Add fractions with like denominators',
+  bloomLevel: 'apply',
+  difficulty: 0.4,
+  isThresholdConcept: false,
+  masteryThreshold: 0.8,
+  estimatedMinutes: 30,
+  tags: ['math', 'fractions'],
+  metadata: {}
+});
+
+// Create prerequisite relationships
+await storage.createPrerequisite({
+  sourceId: basicMathSkill.id,
+  targetId: skill.id,
+  strength: 0.9,
+  type: 'hard',
+  metadata: {}
+});
+
+// Query the graph
+const prerequisites = await storage.getPrerequisitesOf(skill.id);
+const stats = await storage.getStats();
+```
+
+### LevelGraph Storage (Embedded)
+
+For persistent, file-based storage without external databases:
+
+```bash
+npm install level levelgraph
+```
+
+```typescript
+import { LevelGraphStorage } from 'learngraph/storage';
+
+const storage = new LevelGraphStorage();
+await storage.connect({
+  backend: 'levelgraph',
+  path: './data/learngraph'
+});
+```
+
+### Neo4j Storage (Production)
+
+For production deployments with full graph database capabilities:
+
+```bash
+npm install neo4j-driver
+```
+
+```typescript
+import { Neo4jStorage } from 'learngraph/storage';
+
+const storage = new Neo4jStorage();
+await storage.connect({
+  backend: 'neo4j',
+  uri: 'bolt://localhost:7687',
+  username: 'neo4j',
+  password: 'password',
+  database: 'learngraph'
+});
+```
+
+## Submodule Exports
+
+```typescript
+// Core types and utilities
+import { SkillNode, SkillEdge } from 'learngraph';
+
+// Storage adapters (Memory, LevelGraph, Neo4j)
+import { MemoryStorage, LevelGraphStorage, Neo4jStorage } from 'learngraph/storage';
+
+// LLM integration for curriculum decomposition
+import { LLMProvider } from 'learngraph/llm';
+
+// Query builders and ZPD calculation
+import { ZPDResult, LearningPath } from 'learngraph/query';
+
+// Educational utilities (Bloom's, mastery, etc.)
+import { detectBloomLevel, hasMastery } from 'learngraph/education';
+```
+
+## Use Cases
+
+- **Intelligent Tutoring Systems (ITS)** - Build adaptive learning platforms
+- **Curriculum Decomposition** - Transform syllabi into skill graphs
+- **Learning Path Generation** - Personalized routes to mastery
+- **Prerequisite Analysis** - Identify and fill knowledge gaps
+- **Competency-Based Education** - Track and verify skill mastery
+- **Corporate Training** - Personalized upskilling programs
+
+## Author
+
+**Dr. Ernesto Lee** - Educational technologist and learning scientist
+
+- Website: [https://DrLee.ai](https://DrLee.ai)
+- Email: dr.ernesto.lee@gmail.com
+- GitHub: [@fenago](https://github.com/fenago)
+
+## Contributing
+
+Contributions are welcome! Please see the [main repository](https://github.com/fenago/Jali) for guidelines.
+
 ## License
 
-MIT
+MIT - See [LICENSE](./LICENSE) for details.
+
+## Links
+
+- [GitHub Repository](https://github.com/fenago/Jali)
+- [Issue Tracker](https://github.com/fenago/Jali/issues)
+- [Sponsor](https://github.com/sponsors/fenago)

package/dist/cjs/index.js

@@ -53,7 +53,7 @@ __exportStar(require("./types/index.js"), exports);
 /**
  * Package version
  */
-exports.VERSION = '0.1.0';
+exports.VERSION = '0.1.1';
 /**
  * Package name
  */

package/dist/cjs/parsers/base.js

@@ -0,0 +1,189 @@
+"use strict";
+/**
+ * Base parser utilities
+ *
+ * @packageDocumentation
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DEFAULT_PARSE_OPTIONS = void 0;
+exports.extractTime = extractTime;
+exports.isObjectiveLine = isObjectiveLine;
+exports.cleanText = cleanText;
+exports.objectiveToSkillName = objectiveToSkillName;
+exports.createObjective = createObjective;
+exports.createEmptyResult = createEmptyResult;
+exports.calculateStats = calculateStats;
+const bloom_js_1 = require("../types/bloom.js");
+/**
+ * Default parse options
+ */
+exports.DEFAULT_PARSE_OPTIONS = {
+    detectBloom: true,
+    extractTime: true,
+    suggestNames: true,
+    includeRaw: false,
+    sectionHeaders: [
+        'module',
+        'chapter',
+        'unit',
+        'week',
+        'section',
+        'part',
+        'lesson',
+        'topic',
+    ],
+    objectiveMarkers: [
+        'students will be able to',
+        'learners will',
+        'by the end of this',
+        'learning objectives',
+        'objectives:',
+        'learning outcomes',
+        'outcomes:',
+        'lo:',
+        'swbat',
+        '•',
+        '-',
+        '*',
+    ],
+};
+/**
+ * Common time patterns in syllabi
+ * Note: Decimal hours pattern must come before integer hours pattern
+ */
+const TIME_PATTERNS = [
+    /(\d+)\s*(?:min(?:ute)?s?|mins?)/i,
+    /(\d+\.\d+)\s*(?:hour?s?|hrs?)/i,
+    /(\d+)\s*(?:hour?s?|hrs?)/i,
+];
+/**
+ * Extract estimated time from text
+ */
+function extractTime(text) {
+    for (const pattern of TIME_PATTERNS) {
+        const match = text.match(pattern);
+        if (match && match[1]) {
+            const value = parseFloat(match[1]);
+            if (pattern.source.includes('hour')) {
+                return Math.round(value * 60);
+            }
+            return Math.round(value);
+        }
+    }
+    return undefined;
+}
+/**
+ * Detect if a line is a learning objective
+ */
+function isObjectiveLine(line, markers) {
+    const lower = line.toLowerCase().trim();
+    return markers.some((marker) => lower.includes(marker.toLowerCase()));
+}
+/**
+ * Clean and normalize text
+ */
+function cleanText(text) {
+    return text
+        .replace(/\s+/g, ' ')
+        .replace(/^\s*[-•*]\s*/, '')
+        .replace(/^\d+\.\s*/, '')
+        .trim();
+}
+/**
+ * Generate a skill name from an objective
+ */
+function objectiveToSkillName(objective) {
+    const cleaned = cleanText(objective);
+    // Remove common prefixes
+    const prefixes = [
+        /^students will be able to\s+/i,
+        /^learners will\s+/i,
+        /^by the end of this [\w\s]+,?\s*/i,
+        /^the student will\s+/i,
+        /^understand\s+/i,
+        /^learn\s+/i,
+    ];
+    let result = cleaned;
+    for (const prefix of prefixes) {
+        result = result.replace(prefix, '');
+    }
+    // Capitalize first letter
+    result = result.charAt(0).toUpperCase() + result.slice(1);
+    // Truncate if too long
+    if (result.length > 80) {
+        result = result.substring(0, 77) + '...';
+    }
+    return result;
+}
+/**
+ * Create a learning objective from text
+ */
+function createObjective(text, section, week) {
+    const cleaned = cleanText(text);
+    const bloomLevel = (0, bloom_js_1.detectBloomLevel)(cleaned);
+    const objective = {
+        text: cleaned,
+        bloomLevel,
+        bloomConfidence: bloomLevel ? 0.8 : 0,
+        suggestedName: objectiveToSkillName(cleaned),
+    };
+    if (section !== undefined) {
+        objective.section = section;
+    }
+    if (week !== undefined) {
+        objective.week = week;
+    }
+    return objective;
+}
+/**
+ * Create empty parse result
+ */
+function createEmptyResult(source, format) {
+    return {
+        metadata: {
+            source,
+            format,
+            parsedAt: new Date().toISOString(),
+        },
+        modules: [],
+        topics: [],
+        objectives: [],
+        warnings: [],
+        stats: {
+            moduleCount: 0,
+            topicCount: 0,
+            objectiveCount: 0,
+            bloomDetectedCount: 0,
+            durationMs: 0,
+        },
+    };
+}
+/**
+ * Calculate parse statistics
+ */
+function calculateStats(result, startTime) {
+    let objectiveCount = result.objectives.length;
+    let bloomDetectedCount = result.objectives.filter((o) => o.bloomLevel).length;
+    for (const topic of result.topics) {
+        objectiveCount += topic.objectives.length;
+        bloomDetectedCount += topic.objectives.filter((o) => o.bloomLevel).length;
+    }
+    for (const mod of result.modules) {
+        objectiveCount += mod.objectives.length;
+        bloomDetectedCount += mod.objectives.filter((o) => o.bloomLevel).length;
+        for (const topic of mod.topics) {
+            objectiveCount += topic.objectives.length;
+            bloomDetectedCount += topic.objectives.filter((o) => o.bloomLevel).length;
+        }
+    }
+    const topicCount = result.topics.length +
+        result.modules.reduce((sum, m) => sum + m.topics.length, 0);
+    return {
+        moduleCount: result.modules.length,
+        topicCount,
+        objectiveCount,
+        bloomDetectedCount,
+        durationMs: Date.now() - startTime,
+    };
+}
+//# sourceMappingURL=base.js.map

package/dist/cjs/parsers/base.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"base.js","sourceRoot":"","sources":["../../../src/parsers/base.ts"],"names":[],"mappings":";AAAA;;;;GAIG;;;AA0DH,kCAYC;AAKD,0CAGC;AAKD,8BAMC;AAKD,oDA2BC;AAKD,0CAuBC;AAKD,8CAsBC;AAKD,wCA6BC;AAzMD,gDAAqD;AAErD;;GAEG;AACU,QAAA,qBAAqB,GAA2B;IAC3D,WAAW,EAAE,IAAI;IACjB,WAAW,EAAE,IAAI;IACjB,YAAY,EAAE,IAAI;IAClB,UAAU,EAAE,KAAK;IACjB,cAAc,EAAE;QACd,QAAQ;QACR,SAAS;QACT,MAAM;QACN,MAAM;QACN,SAAS;QACT,MAAM;QACN,QAAQ;QACR,OAAO;KACR;IACD,gBAAgB,EAAE;QAChB,0BAA0B;QAC1B,eAAe;QACf,oBAAoB;QACpB,qBAAqB;QACrB,aAAa;QACb,mBAAmB;QACnB,WAAW;QACX,KAAK;QACL,OAAO;QACP,GAAG;QACH,GAAG;QACH,GAAG;KACJ;CACF,CAAC;AAEF;;;GAGG;AACH,MAAM,aAAa,GAAG;IACpB,kCAAkC;IAClC,gCAAgC;IAChC,2BAA2B;CAC5B,CAAC;AAEF;;GAEG;AACH,SAAgB,WAAW,CAAC,IAAY;IACtC,KAAK,MAAM,OAAO,IAAI,aAAa,EAAE,CAAC;QACpC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAClC,IAAI,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;YACtB,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACnC,IAAI,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;gBACpC,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC;YAChC,CAAC;YACD,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;GAEG;AACH,SAAgB,eAAe,CAAC,IAAY,EAAE,OAAiB;IAC7D,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;IACxC,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;AACxE,CAAC;AAED;;GAEG;AACH,SAAgB,SAAS,CAAC,IAAY;IACpC,OAAO,IAAI;SACR,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC;SACpB,OAAO,CAAC,cAAc,EAAE,EAAE,CAAC;SAC3B,OAAO,CAAC,WAAW,EAAE,EAAE,CAAC;SACxB,IAAI,EAAE,CAAC;AACZ,CAAC;AAED;;GAEG;AACH,SAAgB,oBAAoB,CAAC,SAAiB;IACpD,MAAM,OAAO,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC;IAErC,yBAAyB;IACzB,MAAM,QAAQ,GAAG;QACf,+BAA+B;QAC/B,oBAAoB;QACpB,mCAAmC;QACnC,uBAAuB;QACvB,iBAAiB;QACjB,YAAY;KACb,CAAC;IAEF,IAAI,MAAM,GAAG,OAAO,CAAC;IACrB,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;QAC9B,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IACtC,CAAC;IAED,0BAA0B;IAC1B,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAE1D,uBAAuB;IACvB,IAAI,MAAM,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC;QACvB,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC;IAC3C,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,SAAgB,eAAe,CAC7B,IAAY,EACZ,OAAgB,EAChB,IAAa;IAEb,MAAM,OAAO,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IAChC,MAAM,UAAU,GAAG,IAAA,2BAAgB,EAAC,OAAO,CAAC,CAAC;IAE7C,MAAM,SAAS,GAAsB;QACnC,IAAI,EAAE,OAAO;QACb,UAAU;QACV,eAAe,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACrC,aAAa,EAAE,oBAAoB,CAAC,OAAO,CAAC;KAC7C,CAAC;IAEF,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;QAC1B,SAAS,CAAC,OAAO,GAAG,OAAO,CAAC;IAC9B,CAAC;IACD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,SAAS,CAAC,IAAI,GAAG,IAAI,CAAC;IACxB,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;GAEG;AACH,SAAgB,iBAAiB,CAC/B,MAAc,EACd,MAAmB;IAEnB,OAAO;QACL,QAAQ,EAAE;YACR,MAAM;YACN,MAAM;YACN,QAAQ,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACnC;QACD,OAAO,EAAE,EAAE;QACX,MAAM,EAAE,EAAE;QACV,UAAU,EAAE,EAAE;QACd,QAAQ,EAAE,EAAE;QACZ,KAAK,EAAE;YACL,WAAW,EAAE,CAAC;YACd,UAAU,EAAE,CAAC;YACb,cAAc,EAAE,CAAC;YACjB,kBAAkB,EAAE,CAAC;YACrB,UAAU,EAAE,CAAC;SACd;KACF,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAgB,cAAc,CAAC,MAAmB,EAAE,SAAiB;IACnE,IAAI,cAAc,GAAG,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC;IAC9C,IAAI,kBAAkB,GAAG,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC;IAE9E,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;QAClC,cAAc,IAAI,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC;QAC1C,kBAAkB,IAAI,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC;IAC5E,CAAC;IAED,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;QACjC,cAAc,IAAI,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC;QACxC,kBAAkB,IAAI,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC;QACxE,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;YAC/B,cAAc,IAAI,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC;YAC1C,kBAAkB,IAAI,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC;QAC5E,CAAC;IACH,CAAC;IAED,MAAM,UAAU,GACd,MAAM,CAAC,MAAM,CAAC,MAAM;QACpB,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAE9D,OAAO;QACL,WAAW,EAAE,MAAM,CAAC,OAAO,CAAC,MAAM;QAClC,UAAU;QACV,cAAc;QACd,kBAAkB;QAClB,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;KACnC,CAAC;AACJ,CAAC"}