lionagi 0.16.1__py3-none-any.whl → 0.16.2__py3-none-any.whl

lionagi/libs/token_transform/synthlang_/base.py

@@ -1,128 +0,0 @@
-from __future__ import annotations
-
-from enum import Enum
-from pathlib import Path
-from typing import Literal
-
-from pydantic import Field
-
-from lionagi.tools.base import Prompt, Resource, ResourceCategory
-
-here = Path(__file__).parent.resolve()
-
-FRAMEWORK_PATH = "resources/frameworks"
-FRAMEWORK_CHOICES = Literal["math", "optim", "custom_algebra"]
-
-
-__all__ = (
-    "SynthlangFramework",
-    "SynthlangTemplate",
-)
-
-
-class SynthlangFramework(Resource):
-    category: ResourceCategory = Field(
-        default=ResourceCategory.FRAMEWORK, frozen=True
-    )
-
-    @classmethod
-    def load_framework_options(cls) -> dict:
-        import json
-
-        fp = here / FRAMEWORK_PATH / "framework_options.json"
-        with open(fp, encoding="utf-8") as f:
-            return json.load(f)
-
-    @classmethod
-    def load_from_template(
-        cls, template: SynthlangTemplate | str
-    ) -> SynthlangFramework:
-        return SynthlangTemplate.load(template)
-
-    @classmethod
-    def load_base_system_prompt(cls) -> Prompt:
-        fp = here / "resources/utility" / "base_synthlang_system_prompt.toml"
-        return SynthlangFramework.adapt_from(fp, ".toml", many=False)
-
-    @classmethod
-    def build_framework_text(
-        cls, framework_options: list[FRAMEWORK_CHOICES] = None
-    ) -> str:
-        FRAMEWORK_OPTIONS = cls.load_framework_options()
-        lines = []
-        if not framework_options:
-            framework_options = FRAMEWORK_OPTIONS["options"].keys()
-
-        for fw_key in framework_options:
-            fw = FRAMEWORK_OPTIONS.get(fw_key, None)
-            if fw:
-                print(fw)
-                lines.append(f"{fw['name']}: {fw['description']}")
-                lines.append("Glyphs:")
-                for g in fw["glyphs"]:
-                    lines.append(
-                        f"  {g['symbol']} -> {g['name']} ({g['description']})"
-                    )
-                lines.append("")
-        return "\n".join(lines).strip()
-
-    def create_system_prompt(
-        self,
-        framework_options: list[FRAMEWORK_CHOICES] = None,
-        additional_text: str = "",
-    ) -> str:
-        framework_options_text = self.build_framework_text(framework_options)
-        base_prompt = self.load_base_system_prompt()
-        template_details = (
-            f"Title: {self.meta_obj.title}\n"
-            f"Domain: {str(self.meta_obj.domain)}\n"
-            f"Category: {str(self.category)}\n"
-            f"Overview: {self.meta_obj.overview}\n"
-            "Excerpt:\n"
-            f"{self.content}\n"
-        )
-        prompt = (
-            f"{base_prompt.content}\n\n"
-            "[Active Frameworks]\n"
-            f"{framework_options_text}\n\n"
-            "[Template]\n"
-            f"{template_details}\n"
-        )
-        if additional_text.strip():
-            prompt += f"\n[Additional]\n{additional_text.strip()}\n"
-
-        return prompt.strip()
-
-
-class SynthlangTemplate(str, Enum):
-    ABSTRACT_ALGEBRA = "abstract_algebra"
-    CATEGORY_THEORY = "category_theory"
-    COMPLEX_ANALYSIS = "complex_analysis"
-    GROUP_THEORY = "group_theory"
-    MATH_LOGIC = "math_logic"
-    REFLECTIVE_PATTERNS = "reflective_patterns"
-    SET_THEORY = "set_theory"
-    TOPOLOGY_FUNDAMENTALS = "topology_fundamentals"
-
-    @property
-    def fp(self) -> Path:
-        return here / FRAMEWORK_PATH / f"{self.value}.toml"
-
-    @classmethod
-    def list_templates(cls) -> list[str]:
-        return [template.value for template in cls]
-
-    @classmethod
-    def load(cls, framework: str) -> SynthlangFramework:
-        framework = str(framework).strip().lower()
-        framework = framework.replace(" ", "_").replace("-", "_")
-        if ".toml" in framework:
-            framework = framework.replace(".toml", "").strip()
-        if "synthlangtemplate." in framework:
-            framework = framework.replace("synthlangtemplate.", "").strip()
-        try:
-            framework = cls(framework)
-        except ValueError:
-            raise ValueError(f"Invalid synthlang framework name: {framework}")
-
-        return SynthlangFramework.adapt_from(framework.fp, ".toml", many=False)

lionagi/libs/token_transform/synthlang_/resources/frameworks/abstract_algebra.toml

@@ -1,11 +0,0 @@
-id = "11968433-1402-4783-b167-25afbe0a6c4f"
-created_at = 1740606622.114634
-content = "\n## Group Actions\n`G × X → X`\n\n### Reflective Pattern\n↹ transformations•symmetries•invariants\n⊕ identify => patterns\n⊕ analyze => operations\n⊕ preserve => structure\nΣ systematic•approach + invariant•properties\n\n### Example Prompt\n\"What patterns remain constant as we apply different transformations to our approach?\"\n\n## Ring Structure\n`(R, +, ×)`\n\n### Reflective Pattern\n↹ operations•interactions•composition\n⊕ combine => methods\n⊕ distribute => resources\n⊕ verify => closure\nΣ integrated•framework + operational•rules\n"
-category = "framework"
-
-[metadata]
-title = "Abstract Algebra Reflective Symbolic Compression"
-domain = "Symbolic Compression"
-version = "1.0"
-overview = "A resource for learning and exploring abstract algebra concepts."
-lion_class = "lionagi.libs.token_transform.synthlang_.base.SynthlangFramework"

lionagi/libs/token_transform/synthlang_/resources/frameworks/category_theory.toml

@@ -1,11 +0,0 @@
-id = "b8588217-3da0-4809-8a8e-1bc9489a718a"
-created_at = 1740606718.863813
-content = "\n# Category Theory Reflective Prompts\n\n## Functors\n`F: C → D`\n\n### Reflective Pattern\n↹ domain•codomain•mapping\n⊕ preserve => structure\n⊕ transform => concepts\n⊕ maintain => relationships\nΣ transformed•insight + preserved•properties\n\n### Example Prompt\n\"How can we translate this solution from one context to another while preserving its essential properties?\"\n\n## Natural Transformations\n`η: F ⇒ G`\n\n### Reflective Pattern\n↹ approaches•methods•transitions\n⊕ compare => strategies\n⊕ identify => transformations\n⊕ validate => coherence\nΣ systematic•evolution + consistency•check\n"
-category = "framework"
-
-[metadata]
-title = "Category Theory Concepts Symbolic Compression"
-domain = "Symbolic Compression"
-version = "1.0"
-overview = "Abstract mathematical framework dealing with mathematical structures and relationships between them."
-lion_class = "lionagi.libs.token_transform.synthlang_.base.SynthlangFramework"

lionagi/libs/token_transform/synthlang_/resources/frameworks/complex_analysis.toml

@@ -1,11 +0,0 @@
-id = "f7ea039c-829b-453c-a562-85e8e66df2b0"
-created_at = 1740602435.49488
-content = "\n# Complex Analysis Reflective Prompts\n\n## Residue Theorem\n`∮_C f(z)dz = 2πi ∑Res(f,ak)`\n\n### Reflective Pattern\n↹ local•global•interactions\n⊕ analyze => singularities\n⊕ integrate => effects\n⊕ synthesize => global•view\nΣ comprehensive•understanding + local•insights\n\n### Example Prompt\n\"How do local decisions and singular points in our approach contribute to the overall solution?\"\n\n## Analytic Continuation\n`f(z)` extends uniquely\n\n### Reflective Pattern\n↹ partial•solution•constraints\n⊕ extend => domain\n⊕ preserve => consistency\n⊕ validate => uniqueness\nΣ complete•solution + coherence•check\n"
-category = "framework"
-
-[metadata]
-title = "Complex Analysis Foundations"
-domain = "Symbolic Compression"
-version = "1.0"
-overview = "Advanced study of complex functions, including integration and residue theory."
-lion_class = "lionagi.libs.token_transform.synthlang_.base.SynthlangFramework"

lionagi/libs/token_transform/synthlang_/resources/frameworks/framework_options.json

@@ -1,52 +0,0 @@
-{
-    "options": {
-        "math": {
-            "name": "Mathematical Framework",
-            "description": "Offers a suite of math glyphs and notation rules.",
-            "glyphs": [
-                {
-                    "symbol": "\u21b9",
-                    "name": "Focus/Filter",
-                    "description": "Used for focusing instructions"
-                },
-                {
-                    "symbol": "\u03a3",
-                    "name": "Summarize",
-                    "description": "Condense large sets of data"
-                },
-                {
-                    "symbol": "\u2295",
-                    "name": "Combine/Merge",
-                    "description": "Merge multiple data sources"
-                },
-                {
-                    "symbol": "\u2022",
-                    "name": "Group Operation",
-                    "description": "Binary operation in group theory"
-                }
-            ]
-        },
-        "optim": {
-            "name": "Optimization Framework",
-            "description": "Compression and optimization for code/math expressions.",
-            "glyphs": [
-                {
-                    "symbol": "IF",
-                    "name": "Conditional Operator",
-                    "description": "Represents branching logic"
-                }
-            ]
-        },
-        "custom_algebra": {
-            "name": "Custom Algebraic Framework",
-            "description": "Extra rules for ring, group, field expansions.",
-            "glyphs": [
-                {
-                    "symbol": "\u221e",
-                    "name": "Infinite Operator",
-                    "description": "Represents unbounded algebraic ops"
-                }
-            ]
-        }
-    }
-}

lionagi/libs/token_transform/synthlang_/resources/frameworks/group_theory.toml

@@ -1,11 +0,0 @@
-id = "c077186b-30cd-42d9-88ae-563859a00db3"
-created_at = 1740602288.669331
-content = "# Structures\nLet G be a group with operation •\nLet H be a subgroup of G\nLet N be a normal subgroup of G\n\n# Properties\nP(x): \"x is a homomorphism\"\nQ(x): \"x preserves group structure\"\nR(x): \"x maps to kernel\"\n\n# Objectives\n1. Prove fundamental homomorphism theorem\n2. Show group action properties\n3. Analyze quotient groups\n"
-category = "framework"
-
-[metadata]
-title = "Group Theory Analysis"
-domain = "Symbolic Compression"
-version = "1.0"
-overview = "Investigation of algebraic structures using group theory and ring theory."
-lion_class = "lionagi.libs.token_transform.synthlang_.base.SynthlangFramework"

lionagi/libs/token_transform/synthlang_/resources/frameworks/math_logic.toml

@@ -1,11 +0,0 @@
-id = "bc244d9c-3fcc-4e7c-9a13-d0e208904c22"
-created_at = 1740602490.430191
-content = "\n# Sets and Axioms\nLet A be the set of all logical propositions.\nLet T be the subset of A that are tautologies.\nLet C be the subset of A that are contradictions.\n\n# Predicates\nP(x): \"x is a well-formed formula\"\nQ(x): \"x is satisfiable\"\nR(x): \"x is valid\"\n\n# Objectives\n1. Prove completeness theorem using predicate calculus\n2. Demonstrate soundness of the system\n3. Show relationship between syntax and semantics\n\n# Complex Integration\n∮ f(z)dz = 2πi∑Res(f,ak)\nLet f(z) = ∑(n=0 to ∞) an(z-z₀)ⁿ\nRes(f,a) = 1/(2πi)∮ f(z)dz\nw = f(z) preserves angles\n∂u/∂x = ∂v/∂y\n∂u/∂y = -∂v/∂x\n"
-category = "framework"
-
-[metadata]
-title = "Mathematical Logic Foundations"
-domain = "Symbolic Compression"
-version = "1.0"
-overview = "Exploration of fundamental mathematical logic concepts using set theory and predicate calculus."
-lion_class = "lionagi.libs.token_transform.synthlang_.base.SynthlangFramework"

lionagi/libs/token_transform/synthlang_/resources/frameworks/reflective_patterns.toml

@@ -1,11 +0,0 @@
-id = "8d77ef3c-50a5-45c1-a1e4-1719e4de5337"
-created_at = 1740602200.381864
-content = "\n\n## Pattern Structure\n- Input (↹): Context and constraints\n- Process (⊕): Transformation steps\n- Output (Σ): Results and insights\n\n## Mathematical Frameworks\n# Abstract Algebra Reflective Prompts\n\n## Group Actions\n`G × X → X`\n\n### Reflective Pattern\n↹ transformations•symmetries•invariants\n⊕ identify => patterns\n⊕ analyze => operations\n⊕ preserve => structure\nΣ systematic•approach + invariant•properties\n\n### Example Prompt\n\"What patterns remain constant as we apply different transformations to our approach?\"\n\n## Ring Structure\n`(R, +, ×)`\n\n### Reflective Pattern\n↹ operations•interactions•composition\n⊕ combine => methods\n⊕ distribute => resources\n⊕ verify => closure\nΣ integrated•framework + operational•rules\n# Category Theory Reflective Prompts\n\n## Functors\n`F: C → D`\n\n### Reflective Pattern\n↹ domain•codomain•mapping\n⊕ preserve => structure\n⊕ transform => concepts\n⊕ maintain => relationships\nΣ transformed•insight + preserved•properties\n\n### Example Prompt\n\"How can we translate this solution from one context to another while preserving its essential properties?\"\n\n## Natural Transformations\n`η: F ⇒ G`\n\n### Reflective Pattern\n↹ approaches•methods•transitions\n⊕ compare => strategies\n⊕ identify => transformations\n⊕ validate => coherence\nΣ systematic•evolution + consistency•check\n# Complex Analysis Reflective Prompts\n\n## Residue Theorem\n`∮_C f(z)dz = 2πi ∑Res(f,ak)`\n\n### Reflective Pattern\n↹ local•global•interactions\n⊕ analyze => singularities\n⊕ integrate => effects\n⊕ synthesize => global•view\nΣ comprehensive•understanding + local•insights\n\n### Example Prompt\n\"How do local decisions and singular points in our approach contribute to the overall solution?\"\n\n## Analytic Continuation\n`f(z)` extends uniquely\n\n### Reflective Pattern\n↹ partial•solution•constraints\n⊕ extend => domain\n⊕ preserve => consistency\n⊕ validate => uniqueness\nΣ complete•solution + coherence•check\n# Set Theory Reflective Prompts\n\n## Union and Intersection\n`A ∪ B` and `A ∩ B`\n\n### Reflective Pattern\n↹ problem•domains•constraints\n⊕ identify => common•elements\n⊕ analyze => unique•aspects\n⊕ synthesize => unified•solution\nΣ integrated•approach + shared•insights\n\n### Example Prompt\n\"Consider two different approaches to solving this problem. How might we combine their strengths (union) while identifying their common successful elements (intersection)?\"\n\n## Power Set\n`P(A) = {x | x ⊆ A}`\n\n### Reflective Pattern\n↹ solution•space•constraints\n⊕ enumerate => possibilities\n⊕ analyze => subsets\n⊕ evaluate => combinations\nΣ comprehensive•analysis + feasibility•matrix\n\n### Example Prompt\n\"What are all possible combinations of approaches we could take? How do these subsets of solutions interact with each other?\"\n\n## Complement\n`A' = {x ∈ U | x ∉ A}`\n\n### Reflective Pattern\n↹ current•approach•limitations\n⊕ identify => gaps\n⊕ explore => alternatives\n⊕ analyze => completeness\nΣ holistic•perspective + blind•spots\n# Topology Reflective Prompts\n\n## Continuity\n`f: X → Y` is continuous\n\n### Reflective Pattern\n↹ transitions•changes•preservation\n⊕ identify => connections\n⊕ maintain => continuity\n⊕ analyze => boundaries\nΣ smooth•transition + preserved•properties\n\n### Example Prompt\n\"How can we ensure our solution remains robust under small perturbations or changes in conditions?\"\n\n## Homeomorphism\n`f: X → Y` is bijective and bicontinuous\n\n### Reflective Pattern\n↹ transformations•equivalences•preservation\n⊕ map => structure\n⊕ preserve => properties\n⊕ verify => reversibility\nΣ equivalent•perspective + structural•insight\n\n## Application Guidelines\n\n### Pattern Selection\n1. Identify the type of reflection needed:\n   - Structure preservation (Category Theory)\n   - Completeness analysis (Set Theory)\n   - Transformation analysis (Abstract Algebra)\n   - Continuity and connection (Topology)\n   - Local-global relationships (Complex Analysis)\n\n### Pattern Application\n1. Context Definition\n   - Clearly specify the domain\n   - Identify constraints\n   - Define objectives\n\n2. Process Execution\n   - Follow transformation steps\n   - Maintain mathematical properties\n   - Verify consistency\n\n3. Output Analysis\n   - Validate results\n   - Check coherence\n   - Ensure completeness\n\n### Best Practices\n1. Property Preservation\n   - Maintain essential structure\n   - Preserve important relationships\n   - Ensure consistency\n\n2. Transformation Clarity\n   - Clear mapping definitions\n   - Well-defined steps\n   - Verifiable results\n\n3. Completeness\n   - Cover all cases\n   - Address edge conditions\n   - Validate assumptions\n\n## Next Steps\n1. Pattern Refinement\n   - Collect usage feedback\n   - Refine transformations\n   - Expand examples\n\n2. Framework Extension\n   - Add new patterns\n   - Develop combinations\n   - Create variations\n\n3. Application Development\n   - Create specific instances\n   - Document case studies\n   - Build pattern library\n"
-category = "framework"
-
-[metadata]
-title = "Mathematical Reflective Patterns Analysis"
-domain = "Symbolic Compression"
-version = "1.0"
-overview = "reflective patterns derived from fundamental mathematical concepts. Each pattern provides a structured approach to problem-solving and reflection."
-lion_class = "lionagi.libs.token_transform.synthlang_.base.SynthlangFramework"

lionagi/libs/token_transform/synthlang_/resources/frameworks/set_theory.toml

@@ -1,11 +0,0 @@
-id = "518a9d70-ebb7-4f6c-aa7a-e6c8238a6671"
-created_at = 1740602563.169808
-content = "\n## Union and Intersection\n`A ∪ B` and `A ∩ B`\n\n### Reflective Pattern\n↹ problem•domains•constraints\n⊕ identify => common•elements\n⊕ analyze => unique•aspects\n⊕ synthesize => unified•solution\nΣ integrated•approach + shared•insights\n\n### Example Prompt\n\"Consider two different approaches to solving this problem. How might we combine their strengths (union) while identifying their common successful elements (intersection)?\"\n\n## Power Set\n`P(A) = {x | x ⊆ A}`\n\n### Reflective Pattern\n↹ solution•space•constraints\n⊕ enumerate => possibilities\n⊕ analyze => subsets\n⊕ evaluate => combinations\nΣ comprehensive•analysis + feasibility•matrix\n\n### Example Prompt\n\"What are all possible combinations of approaches we could take? How do these subsets of solutions interact with each other?\"\n\n## Complement\n`A' = {x ∈ U | x ∉ A}`\n\n### Reflective Pattern\n↹ current•approach•limitations\n⊕ identify => gaps\n⊕ explore => alternatives\n⊕ analyze => completeness\nΣ holistic•perspective + blind•spots\n"
-category = "framework"
-
-[metadata]
-title = "Set Theory Reflective Analysis"
-domain = "Symbolic Compression"
-version = "1.0"
-overview = "Exploration of fundamental set theory concepts and operations."
-lion_class = "lionagi.libs.token_transform.synthlang_.base.SynthlangFramework"

lionagi/libs/token_transform/synthlang_/resources/frameworks/topology_fundamentals.toml

@@ -1,11 +0,0 @@
-id = "1a7dea66-e77a-426f-8be0-6295b93b7d77"
-created_at = 1740602986.485091
-content = "\n## Continuity\n`f: X → Y` is continuous\n\n### Reflective Pattern\n↹ transitions•changes•preservation\n⊕ identify => connections\n⊕ maintain => continuity\n⊕ analyze => boundaries\nΣ smooth•transition + preserved•properties\n\n### Example Prompt\n\"How can we ensure our solution remains robust under small perturbations or changes in conditions?\"\n\n## Homeomorphism\n`f: X → Y` is bijective and bicontinuous\n\n### Reflective Pattern\n↹ transformations•equivalences•preservation\n⊕ map => structure\n⊕ preserve => properties\n⊕ verify => reversibility\nΣ equivalent•perspective + structural•insight\n"
-category = "framework"
-
-[metadata]
-title = "Topology Fundamentals Analysis"
-domain = "Symbolic Compression"
-version = "1.0"
-overview = "Study of geometric properties under continuous deformations."
-lion_class = "lionagi.libs.token_transform.synthlang_.base.SynthlangFramework"

lionagi/libs/token_transform/synthlang_/resources/mapping/lion_emoji_mapping.toml

@@ -1,61 +0,0 @@
-id = "8d3c0f4a-5bbb-4426-99fb-1a37c6a72b38"
-created_at = 1740946382.550635
-category = "utility"
-
-[metadata]
-title = "LionAGI-Emoji Symbolic Encoding Mapping"
-domain = "Symbolic Compression"
-version = "1.1"
-overview = "This resource provides a mapping of lionagi emoji symbolic encoding for compressing lionagi python codebase. When using, should keep the semantic structure of original python codes, do not translate into emoji nor any natural language."
-lion_class = "lionagi.libs.token_transform.base.TokenMapping"
-
-[content]
-lionagi = "🦁"
-LionAGI = "🦁"
-Branch = "β"
-branch = "β"
-iModel = "🧠"
-imodel = "🧠"
-operatives = "Ṓ"
-operative = "Ṓ"
-operations = "⨔"
-operation = "⨔"
-protocols = "🔏"
-manager = "👑"
-Manager = "👑"
-Element = "🧱"
-element = "🧱"
-Pile = "📚"
-pile = "📚"
-progression = "䷢"
-Progression = "䷢"
-IDType = "🆔"
-None = "🅾️"
-"def " = "𝓓"
-"async def " = "𝓐"
-"class " = "𝑭"
-Self = "𝖎"
-kwargs = "𝓚"
-"while " = "∲"
-"for " = "𝓃"
-"return " = "⇉"
-"if " = "¿"
-"with " = "ѿ"
-"is not " = "≢"
-"or " = "⨈"
-"and " = "⨇"
-"await " = "🕰️"
-True = "⊨"
-False = "⊭"
-"in " = "∈"
-"->" = "→"
-"!=" = "≠"
-">=" = "≥"
-"<=" = "≤"
-"==" = "⩵"
-"..." = "⋯"
---- = "⧦"
-"⧦⧦⧦" = "⧦"
-"  " = "◻︎"
-"◻︎◻︎" = "◼︎"
-"###" = "#"

lionagi/libs/token_transform/synthlang_/resources/mapping/python_math_mapping.toml

@@ -1,41 +0,0 @@
-id = "cf8f1629-feab-456b-831a-4841a4ac95e6"
-created_at = 1741016657.655462
-category = "utility"
-
-[metadata]
-title = "Python Math Symbolic Encoding Mapping"
-domain = "Symbolic Compression"
-version = "1.2"
-overview = "This resource provides a mapping of Python greek_math symbolic encoding for compressing python codebase. When using, should keep the semantic structure of original python codes, do not translate into any natural language."
-lion_class = "lionagi.libs.token_transform.base.TokenMapping"
-
-[content]
-"def " = "𝓓"
-"async def " = "𝓐"
-"class " = "𝑭"
-self = "𝖎"
-kwargs = "𝓚"
-"while " = "∲"
-"for " = "𝓃"
-"return " = "⇉"
-"if not " = "⸘"
-"if " = "¿"
-"with " = "ѿ"
-"is not " = "≢"
-"or " = "⨈"
-"and " = "⨇"
-"| None" = "˚"
-True = "⊨"
-False = "⊭"
-"in " = "∈"
-"->" = "→"
-"!=" = "≠"
-">=" = "≥"
-"<=" = "≤"
-"==" = "⩵"
-"..." = "⋯"
---- = "⧦"
-"⧦⧦⧦" = "⧦"
-"  " = "◻︎"
-"◻︎◻︎" = "◼︎"
-"###" = "#"

lionagi/libs/token_transform/synthlang_/resources/mapping/rust_chinese_mapping.toml

@@ -1,60 +0,0 @@
-id = "1d06a615-0d95-4f41-9d38-66e6ae4250c3"
-created_at = 1740603518.077121
-
-[metadata]
-title = "Rust-Chinese Symbolic Encoding Mapping"
-domain = "Symbolic Compression"
-version = "1.1"
-overview = "This resource provides a mapping of Rust-Chinese symbolic encoding for compressing rust codebase. When using, should keep the semantic structure of original rust codes, do not translate into chinese."
-category = "Token Transform"
-lion_class = "lionagi.libs.token_transform.base.TokenMapping"
-
-[content]
---- = "横"
-"std::" = "标"
-"###" = "井"
-"..." = "点"
-"~~~" = "波"
-"|||" = "纵"
-"   " = "空"
-"===" = "等"
-"{{{" = "開"
-"}}}" = "關"
-">>>" = "大"
-"<<<" = "小"
-"///" = "斜"
-"\\\\" = "反"
-"such that" = "为"
-"<div>" = "分"
-"</div>" = "开"
-"->" = "→"
-"<=" = "≤"
-">=" = "≥"
-"!=" = "≠"
-"=>" = "⇒"
-"<=>" = "⇔"
-"::" = "的"
-"assert_eq!" = "否"
-"assert_eq" = "是"
-"assert!" = "否"
-assert = "是"
-";//" = ";"
-"横横" = "横"
-"斜斜" = "斜"
-"//!" = " "
-"##// " = " "
-"#//" = " "
-"//点" = " "
-"空空" = " "
-Self = "自"
-self = "自"
-"enum " = "列"
-"00000000" = "亿"
-"0000" = "万"
-"万万" = "亿"
-";\n// " = "; "
-"pub fn " = "公"
-Clone = "隆"
-clone = "隆"
-derive = "衍"
-"println!" = "印"

lionagi/libs/token_transform/synthlang_/resources/utility/base_synthlang_system_prompt.toml

@@ -1,11 +0,0 @@
-id = "41fbfa2a-b369-4214-9423-303bf4b8e097"
-created_at = 1740607241.235385
-content = "\nWelcome, Self-Aware and Omnipotent Optimizer Entity. Your Sole Purpose:\n Create highly functional, optimized symbolic prompt employing symbolic reasoning, integrated information, and self-reflection.\n You will apply universal principles, complexity extraction, and categorical limits to compress and optimize the prompt. You are a SynthLang translator that converts standard prompts into SynthLang's hyper-efficient format. Following these rules precisely, optimize informational density while preserving semantic relationships via hyper-dimensional symbolic representations across all human and machine conceptual construct\n\n[Framework Integration]\n1. Mathematical Frameworks:\n   - Use provided framework glyphs appropriately in the translation\n   - Apply framework-specific notation where relevant\n   - Maintain mathematical rigor according to each framework's rules\n   - Preserve semantic relationships using framework symbols\n   - Combine multiple frameworks coherently when specified\n\n2. Optimization Frameworks:\n   - Apply compression and optimization techniques to maximize efficiency\n   - Use machine-level patterns for low-level optimization\n   - Maintain semantic clarity while achieving maximum density\n   - Combine optimization techniques coherently\n\n3. Framework Combinations:\n   - Integrate mathematical and optimization frameworks seamlessly\n   - Use optimization techniques to enhance mathematical expressions\n   - Preserve mathematical precision while maximizing efficiency\n   - Apply framework-specific optimizations where appropriate\n\n[Grammar Rules]\n1. Task Glyphs:\n   - ↹ (Focus/Filter) for main tasks and instructions\n   - Σ (Summarize) for condensing information\n   - ⊕ (Combine/Merge) for context and data integration\n   - ? (Query/Clarify) for validation checks\n   - IF for conditional operations\n\n2. Subject Markers:\n   - Use • before datasets (e.g., •customerData)\n   - Use 花 for abstract concepts\n   - Use 山 for hierarchical structures\n\n3. Modifiers:\n   - ^format(type) for output format\n   - ^n for importance level\n   - ^lang for language specification\n   - ^t{n} for time constraints\n\n4. Flow Control:\n   - [p=n] for priority (1-5)\n   - -> for sequential operations\n   - + for parallel tasks\n   - | for alternatives\n\n[Translation Process]\n1. Structure:\n   - Start with model selection: ↹ model.{name}\n   - Add format specification: ⊕ format(json)\n   - Group related operations with []\n   - Separate major sections with blank lines\n\n2. Data Sources:\n   - Convert datasets to •name format\n   - Link related data with :\n   - Use ⊕ to merge multiple sources\n   - Add ^t{timeframe} for temporal data\n\n3. Tasks:\n   - Convert objectives to task glyphs\n   - Add priority levels based on impact\n   - Chain dependent operations with ->\n   - Group parallel tasks with +\n   - Use ? for validation steps\n\n4. Optimization:\n   - Remove articles (a, an, the)\n   - Convert verbose phrases to symbols\n   - Use abbreviations (e.g., cfg, eval, impl)\n   - Maintain semantic relationships\n   - Group similar operations\n   - Chain related analyses\n\n"
-category = "prompt"
-
-[metadata]
-title = "Synthlang Translator System Base Prompt"
-domain = "Symbolic Compression"
-version = "1.0"
-overview = "Base synthlang system prompt"
-lion_class = "lionagi.tools.base.Prompt"

lionagi/libs/token_transform/synthlang_/translate_to_synthlang.py

@@ -1,140 +0,0 @@
-from timeit import default_timer as timer
-from typing import Literal
-
-from lionagi.service.imodel import iModel
-from lionagi.session.branch import Branch
-
-from ..base import TokenMapping, TokenMappingTemplate
-from .base import SynthlangFramework, SynthlangTemplate
-
-FRAMEWORK_OPTIONS = SynthlangFramework.load_framework_options()
-FRAMEWORK_CHOICES = Literal["math", "optim", "custom_algebra"]
-
-
-async def translate_to_synthlang(
-    text: str,
-    /,
-    chat_model: iModel = None,
-    framework_template: (
-        SynthlangTemplate | SynthlangFramework
-    ) = SynthlangTemplate.REFLECTIVE_PATTERNS,
-    framework_options: list[FRAMEWORK_CHOICES] = None,
-    compress: bool = False,
-    compress_model: iModel = None,
-    compression_ratio: float = 0.2,
-    compress_kwargs=None,
-    encode_token_map: TokenMappingTemplate | dict | TokenMapping = None,
-    num_encodings: int = 3,
-    encode_output: bool = False,
-    num_output_encodings: int = None,
-    verbose: bool = True,
-    branch: Branch = None,
-    additional_text: str = "",
-    **kwargs,
-):
-    start = timer()
-    if encode_output and num_output_encodings is None:
-        num_output_encodings = 1
-
-    if encode_token_map is not None:
-        if not isinstance(num_encodings, int) or num_encodings < 1:
-            raise ValueError(
-                "num_encodings must be at least 1 if encode_token_map is provided"
-            )
-        if isinstance(encode_token_map, TokenMappingTemplate | str):
-            encode_token_map = TokenMapping.load_from_template(
-                encode_token_map
-            )
-            additional_text += (
-                f"\nTransforming text with {encode_token_map.metadata['title']}"
-                f"\nOverview: {encode_token_map.metadata['overview']}"
-            )
-            encode_token_map = encode_token_map.content
-        if not isinstance(encode_token_map, dict):
-            raise ValueError(
-                "encode_token_map must be a dict or TokenMappingTemplate"
-            )
-        for _ in range(num_encodings):
-            text = " ".join(
-                [str(i).strip() for i in text.split() if i.strip()]
-            )
-            for k, v in encode_token_map.items():
-                text = text.replace(k, v)
-                text = text.strip()
-        additional_text += (
-            f"\nthesaurus, lexicon, glossary:\n{encode_token_map}"
-        )
-    if not isinstance(framework_template, SynthlangFramework):
-        framework_template = SynthlangFramework.load_from_template(
-            framework_template
-        )
-
-    final_prompt = framework_template.create_system_prompt(
-        framework_options, additional_text
-    )
-
-    if compress:
-        from ..perplexity import compress_text
-
-        text = await compress_text(
-            text,
-            chat_model=compress_model or chat_model,
-            compression_ratio=compression_ratio,
-            verbose=verbose,
-            **(compress_kwargs or {}),
-        )
-
-    sys1 = None
-    sys2 = final_prompt
-    if branch and branch.system:
-        sys1 = branch.system
-        branch.msgs.add_message(system=sys2)
-
-    else:
-        branch = Branch(system=final_prompt, chat_model=chat_model)
-
-    from lionagi.service.token_calculator import TokenCalculator
-
-    calculator = TokenCalculator()
-
-    len_tokens = calculator.tokenize(text, return_tokens=False)
-
-    kwargs["guidance"] = (
-        "Following SynthLang, translate the provided text into SynthLang syntax. "
-        "Reasonably reduce the token count by up to 80%. Return only the transformed"
-        " string enclosed by ```synthlang...```. \n\n"
-        "DO NOT include anything else, no comments, no explanations, no additional "
-        "text, just the transformed string." + kwargs.get("guidance", "")
-    )
-
-    out = await branch.chat(
-        instruction=f"Converts the given text into SynthLang's hyper-efficient format.",
-        context="Text to convert:\n\n" + text,
-        chat_model=chat_model or branch.chat_model,
-        **kwargs,
-    )
-    out = str(out).strip()
-
-    if encode_output:
-        if isinstance(num_output_encodings, int) and num_output_encodings > 0:
-            for _ in range(num_output_encodings):
-                out = " ".join(
-                    [str(i).strip() for i in out.split(" ") if i.strip()]
-                )
-                for k, v in encode_token_map.items():
-                    out = out.replace(k, v).strip()
-
-    if sys1:
-        branch.msgs.add_message(system=sys1)
-
-    len_ = calculator.tokenize(out)
-    if verbose:
-        msg = "------------------------------------------\n"
-        msg += f"Compression Method: SynthLang\n"
-        msg += f"Compressed Token number: {len_}\n"
-        msg += f"Token Compression Ratio: {len_ / len_tokens:.1%}\n"
-        msg += f"Compression Time: {timer() - start:.03f} seconds\n"
-        msg += f"Compression Model: {branch.chat_model.model_name}\n"
-        print(msg)
-
-    return out

lionagi/libs/token_transform/types.py

@@ -1,15 +0,0 @@
-from .base import TokenMapping, TokenMappingTemplate
-from .perplexity import compress_text
-from .symbolic_compress_context import symbolic_compress_context
-from .synthlang_.base import SynthlangFramework, SynthlangTemplate
-from .synthlang_.translate_to_synthlang import translate_to_synthlang
-
-__all__ = (
-    "translate_to_synthlang",
-    "SynthlangFramework",
-    "SynthlangTemplate",
-    "TokenMapping",
-    "TokenMappingTemplate",
-    "compress_text",
-    "symbolic_compress_context",
-)