vulcan-core 1.0.0__py3-none-any.whl

vulcan_core/engine.py

@@ -0,0 +1,232 @@
+# SPDX-License-Identifier: Apache-2.0
+# Copyright 2025 Latchfield Technologies http://latchfield.com
+
+from __future__ import annotations
+
+from dataclasses import dataclass, field
+from functools import cached_property, partial
+from types import MappingProxyType
+from typing import TYPE_CHECKING
+from uuid import UUID, uuid4
+
+from vulcan_core.models import DeclaresFacts, Fact
+
+if TYPE_CHECKING:  # pragma: no cover - not used at runtime
+    from vulcan_core.actions import Action
+    from vulcan_core.conditions import Expression
+
+
+class InternalStateError(RuntimeError):
+    """Raised when the internal state of the RuleEngine is invalid."""
+
+
+class RecursionLimitError(RuntimeError):
+    """Raised when the recursion limit is reached during rule evaluation."""
+
+
+@dataclass(frozen=True)
+class Rule:
+    """
+    Represents a rule with a condition and corresponding actions.
+
+    Attributes:
+        - id (UUID): A unique identifier for the rule, automatically generated.
+        - name (Optional[str]): The name of the rule.
+        - when (Expression): The condition that triggers the rule.
+        - then (Action): The action to be executed when the condition is met.
+        - inverse (Optional[Action]): An optional action to be executed when the condition is not met.
+    """
+
+    id: UUID = field(default_factory=uuid4, init=False)
+    name: str | None
+    when: Expression
+    then: Action
+    inverse: Action | None
+
+
+# TODO: Look into support for langchain operators and lang graph integration
+
+
+@dataclass(kw_only=True)
+class RuleEngine:
+    """
+    RuleEngine is a class that manages the evaluation of rules based on a set of facts. It allows for the addition of rules,
+    updating of facts, and cascading evaluation of rules.
+
+    Attributes:
+        enabled (bool): Indicates whether the rule engine is enabled.
+        recusion_limit (int): The maximum number of recursive evaluations allowed.
+        facts (dict[type[Fact], Fact]): A dictionary to store facts with their types as keys.
+        rules (dict[str, list[Rule]]): A dictionary to store rules associated with fact strings.
+
+    Methods:
+        rule(self, *, name: str | None = None, when: LogicEvaluator, then: BaseAction, inverse: BaseAction | None = None): Adds a rule to the rule engine.
+        update_facts(self, fact: tuple[Fact | partial[Fact], ...] | partial[Fact] | Fact) -> Iterator[str]: Updates the facts in the working memory.
+        evaluate(self): Evaluates the rules based on the current facts in working memory.
+    """
+
+    enabled: bool = False
+    recusion_limit: int = 10
+    _facts: dict[str, Fact] = field(default_factory=dict, init=False)
+    _rules: dict[str, list[Rule]] = field(default_factory=dict, init=False)
+
+    @cached_property
+    def facts(self) -> MappingProxyType[str, Fact]:
+        return MappingProxyType(self._facts)
+
+    @cached_property
+    def rules(self) -> MappingProxyType[str, list[Rule]]:
+        return MappingProxyType(self._rules)
+
+    def __getitem__[T: Fact](self, key: type[T]) -> T:
+        """
+        Retrieves a fact from the working memory.
+
+        Args:
+            key (type[Fact]): The type of the fact to retrieve.
+
+        Returns:
+            T: The fact instance of the specified type.
+        """
+        return self._facts[key.__name__]  # type: ignore
+
+    def fact(self, fact: Fact | partial[Fact]):
+        """
+        Updates the working memory with a new fact or merges a partial fact.
+
+        Args:
+            fact (Union[Fact, partial[Fact]]): The fact instance or partial fact to update the working memory with.
+
+        Raises:
+            InternalStateError: If a partial fact cannot be instantiated due to missing required fields
+        """
+        # TODO: Figure out how to track only fact attributes that have changed, and fire on affected rules
+
+        if isinstance(fact, partial):
+            fact_name = fact.func.__name__
+            if fact_name in self._facts:
+                self._facts[fact_name] |= fact
+            else:
+                try:
+                    self._facts[fact_name] = fact()
+                except TypeError as err:
+                    msg = f"Fact '{fact_name}' is missing and lacks sufficient defaults to create from partial: {fact}"
+                    raise InternalStateError(msg) from err
+        else:
+            self._facts[type(fact).__name__] = fact
+
+    def rule[T: Fact](self, *, name: str | None = None, when: Expression, then: Action, inverse: Action | None = None):
+        """
+        Convenience method for adding a rule to the rule engine.
+
+        Args:
+          name (Optional[str]): The name of the rule. Defaults to None.
+          when (Expression): The condition that triggers the rule.
+          then (Action): The action to be executed when the condition is met.
+          inverse (Optional[Action]): The action to be executed when the condition is not met. Defaults to None.
+
+        Returns: None
+        """
+        rule = Rule(name, when, then, inverse)
+
+        # TODO: Add automatic inverse option?
+
+        # Update the facts to rule mapping
+        for fact_str in when.facts:
+            if fact_str in self._rules:
+                self._rules[fact_str].append(rule)
+            else:
+                self._rules[fact_str] = [rule]
+
+    def _update_facts(self, fact: tuple[Fact | partial[Fact], ...] | partial[Fact] | Fact) -> list[str]:
+        """
+        Updates the fact in the facts dictionary. If the provided fact is an instance of Fact, it updates the dictionary
+        with the type of the fact as the key. If the provided fact is a partial function, it updates the dictionary with
+        the function of the partial as the key.
+
+        Args:
+            fact (tuple[Fact | partial[Fact], ...] | partial[Fact] | Fact): The fact(s) to be updated, either as an instance of Fact, a partial function, or a tuple of either.
+
+        Returns:
+            Iterator[str]: An iterator over the fact strings of the updated facts.
+        """
+        facts = fact if isinstance(fact, tuple) else (fact,)
+        updated = []
+
+        for f in facts:
+            self.fact(f)
+
+            # Track which attributes were updated
+            if isinstance(f, partial):
+                fact_name = f.func.__name__
+                attrs = f.keywords
+            else:
+                fact_name = f.__class__.__name__
+                attrs = vars(f)
+
+            updated.extend([f"{fact_name}.{attr}" for attr in attrs])
+
+        return updated
+
+    def _resolve_facts(self, declared: DeclaresFacts) -> list[Fact]:
+        # Deduplicate the fact strings and retrieve unique fact instances
+        keys = {key.split(".")[0]: key for key in declared.facts}.values()
+        return [self._facts[key.split(".")[0]] for key in keys]
+
+    def evaluate(self, fact: Fact | partial[Fact] | None = None):
+        """
+        Cascading evaluation of rules based on the facts in working memory.
+
+        If provided a fact, will update and evaluate immediately. Otherwise all rules will be evaluated.
+        """
+        fired_rules: set[UUID] = set()
+        consequence: set[str] = set()
+
+        # TODO: Create an internal consistency check to determine if all referenced Facts are present?
+
+        # TODO: detect cycles in graph before executing
+        # Move to a separate lifecycle step?
+        # Provide option for handling
+
+        # TODO: Check whether fact attributes have actually changed, and only fire rules that are affected
+        if fact:
+            scope = self._update_facts(fact)
+        else:
+            # By default, evaluate all facts
+            fact_list = self._facts.values()
+            scope = {f"{fact.__class__.__name__}.{attr}" for fact in fact_list for attr in vars(fact)}
+
+        # Iterate over the rules until the recusion limit is reached or no new rules are fired
+        for iteration in range(self.recusion_limit + 1):
+            if iteration == self.recusion_limit:
+                msg = f"Recursion limit of {self.recusion_limit} reached"
+                raise RecursionLimitError(msg)
+
+            for fact_str, rules in self._rules.items():
+                if fact_str in scope:
+                    for rule in rules:
+                        # Skip if we already evaluated the rule this iteration
+                        if rule.id in fired_rules:
+                            continue
+                        fired_rules.add(rule.id)
+
+                        # Evaluate the rule's 'when' and determine which action to invoke
+                        action = None
+                        if rule.when(*self._resolve_facts(rule.when)):
+                            action = rule.then
+                        elif rule.inverse:
+                            action = rule.inverse
+
+                        if action:
+                            # Update the facts and track consequences to fire subsequent rules
+                            result = action(*self._resolve_facts(action))
+                            facts = self._update_facts(result)
+                            consequence.update(facts)
+
+            # If rules updated some facts, prepare for the next iteration
+            if consequence:
+                scope = consequence
+                consequence = set()
+                fired_rules.clear()
+            else:
+                break

vulcan_core/models.py

@@ -0,0 +1,260 @@
+# SPDX-License-Identifier: Apache-2.0
+# Copyright 2025 Latchfield Technologies http://latchfield.com
+
+from __future__ import annotations
+
+from abc import ABC, abstractmethod
+from collections.abc import Callable, Iterator, Mapping
+from copy import copy
+from dataclasses import dataclass
+from enum import StrEnum, auto
+from typing import (
+    TYPE_CHECKING,
+    Any,
+    Protocol,
+    Self,
+    dataclass_transform,
+    runtime_checkable,
+)
+
+from langchain.schema import Document
+
+from vulcan_core.util import is_private
+
+if TYPE_CHECKING:  # pragma: no cover - not used at runtime
+    from functools import partial
+
+    from langchain_core.vectorstores import VectorStoreRetriever
+
+type ActionReturn = tuple[partial[Fact] | Fact, ...] | partial[Fact] | Fact
+type ActionCallable = Callable[..., ActionReturn]
+type ConditionCallable = Callable[..., bool]
+
+
+# TODO: Consolidate with AttrDict, and/or figure out how to extende from Mapping
+class ImmutableAttrAsDict:
+    """
+    ImmutableAttrAsDict is an abstract base class that provides dictionary-like access to its attributes.
+    """
+
+    def __getitem__(self, key: str) -> Any:
+        try:
+            return getattr(self, self.validate(key))
+        except KeyError:
+            if hasattr(self, "__missing__"):
+                return self.__missing__(key)  # type: ignore
+            else:
+                raise
+
+    def __contains__(self, key: str) -> bool:
+        return hasattr(self, self.validate(key))
+
+    def __iter__(self) -> Iterator[str]:
+        return (key for key in self.__annotations__ if not is_private(key))
+
+    def __len__(self) -> int:
+        return sum(1 for _ in self)
+
+    def validate(self, key: str) -> str:
+        if is_private(key):
+            msg = f"Access denied to private attribute: {key}"
+            raise KeyError(msg)
+
+        if key not in self.__annotations__:
+            raise KeyError(key)
+
+        return key
+
+    def __init__(self):
+        if type(self) is ImmutableAttrAsDict:
+            msg = f"{ImmutableAttrAsDict.__name__} is an abstract class that can not be directly instantiated."
+            raise TypeError(msg)
+
+    def __reversed__(self) -> Iterator[str]:
+        return reversed(list(self))
+
+    def __or__(self, other: dict) -> dict:
+        return dict(self) | other
+
+    def keys(self) -> list[str]:
+        return list(self)
+
+    def values(self) -> list[Any]:
+        return [getattr(self, key) for key in self]
+
+    def items(self) -> list[tuple[str, Any]]:
+        return [(key, getattr(self, key)) for key in self]
+
+    def get(self, key: str, default: Any = None):
+        return getattr(self, self.validate(key), default)
+
+
+@dataclass_transform(kw_only_default=True, frozen_default=True)
+class FactMetaclass(type):
+    """
+    FactMetaclass is a metaclass that modifies the creation of new classes to automatically
+    apply the `dataclass` decorator with `kw_only=True` and `frozen=True` options.
+    """
+
+    def __new__(cls, name: str, bases: tuple[type], class_dict: dict[str, Any], **kwargs: Any):
+        self = super().__new__(cls, name, bases, class_dict, **kwargs)
+        return dataclass(kw_only=True, frozen=True)(self)
+
+    def _is_dataclass_instance(cls) -> bool:
+        """Determine if this is a dataclass instance by looking for __dataclass_fields__"""
+        return "__dataclass_fields__" not in super().__getattribute__("__dict__")
+
+    # TODO: Implement a context manager to allow access to the default class values
+    # BUG: This causes pylance to not report missing attributes, we need a different way to handle f strings... maybe
+    # the __format__ method?
+    def __getattribute__(cls, name):
+        """
+        Returns a {templated} representation of the Fact's public attributes for deferred use in fstrings. This is
+        useful in rule clauses so that IDE autocomplete can be used in fstrings while deferring evaluation of
+        the content."""
+        if name.startswith("_") or cls._is_dataclass_instance():
+            return super().__getattribute__(name)
+        else:
+            return f"{{{cls.__name__}.{name}}}"
+
+
+class Fact(ImmutableAttrAsDict, metaclass=FactMetaclass):
+    """
+    An abstract class that must be used define rule engine fact schemas and instantiate data into working memory. Facts
+    may be combined with partial facts of the same type using the `|` operator. This is useful for Actions that only
+    need to update a portion of working memory.
+
+    Example: `new_fact = Inventory(apples=1) | partial(Inventory, oranges=2)`
+    """
+
+    def __or__(self, other: partial[Self] | Self) -> Self:
+        """
+        If the right hand operand is a Fact, it is returned as-is. However, if it is a partial Fact, a copy of the
+        lefthand operand is created with the partial Fact's keywords applied.
+        """
+        if isinstance(other, Fact):
+            return other  # type: ignore
+        else:
+            new_fact = copy(self)
+            for kw, value in other.keywords.items():
+                object.__setattr__(new_fact, kw, value)
+            return new_fact  # type: ignore
+
+
+@dataclass(frozen=True)
+class DeclaresFacts(ABC):
+    facts: tuple[str, ...]
+    # TODO differentiate bettwen facts consumed vs produced for better tracking/diagnostics
+    # Will probably be needed to detecte cycles in the graph
+
+
+@dataclass(frozen=True)
+class FactHandler[T: Callable, R: Any](ABC):
+    func: T
+
+    @abstractmethod
+    def __call__(self, *args: Fact) -> R: ...
+
+
+@runtime_checkable
+class HasSource(Protocol):
+    __source__: str
+
+
+class ChunkingStrategy(StrEnum):
+    SENTENCE = auto()
+    PARAGRAPH = auto()
+    PAGE = auto()
+
+
+@dataclass(kw_only=True, slots=True)
+class Similarity(Mapping[str, list[tuple[str, float]]]):
+    # TODO: Figure out how to cache vectors / and results?
+
+    @abstractmethod
+    def __getitem__(self, key: str) -> list[str]:
+        """Vectorizes key and performs similarity search returning a list of matching."""
+        raise NotImplementedError
+
+    @abstractmethod
+    def __contains__(self, key: str) -> bool:
+        """Vectorizes key and performs similarity search returning a boolean if there is at least one match."""
+        raise NotImplementedError
+
+    @abstractmethod
+    def __iadd__(self, value: str) -> Self:
+        raise NotImplementedError
+
+    @abstractmethod
+    def __iter__(self) -> str:
+        raise NotImplementedError
+
+    @abstractmethod
+    def __len__(self) -> int:
+        raise NotImplementedError
+
+
+class ProxyInitializationError(Exception):
+    """Raised when a Proxy class is used without the proxy being initialized."""
+
+
+@dataclass(kw_only=True, slots=True)
+class ProxyLazyLookup(Similarity):
+    _proxy: Similarity | None = None
+
+    @property
+    def proxy(self) -> Similarity:
+        if self._proxy:
+            return self
+        else:
+            msg = "The `proxy` attribute must be set before the class instance can be used."
+            raise ProxyInitializationError(msg)
+
+    @proxy.setter
+    def proxy(self, value: Similarity) -> None:
+        if not self._proxy:
+            self._proxy = value
+        else:
+            msg = "The `proxy` attribute can only be initialized once."
+            raise ProxyInitializationError(msg)
+
+    def __getitem__(self, key: str) -> list[str]:
+        return self.proxy[key]
+
+    def __contains__(self, key: str) -> bool:
+        raise NotImplementedError
+
+    def __iadd__(self, value: str) -> Self:
+        self.proxy += value
+        return self
+
+    def __iter__(self) -> str:
+        raise NotImplementedError
+
+    def __len__(self) -> int:
+        raise NotImplementedError
+
+
+@dataclass(kw_only=True, slots=True)
+class RetrieverAdapter(Similarity):
+    """A lazy lookup that uses the Chroma vector store to perform similarity searches using OpenAI embeddings."""
+
+    store: VectorStoreRetriever
+
+    def __getitem__(self, key: str) -> list[str]:
+        """Vectorizes key and performs similarity search returning a list of matching content."""
+        return [doc.page_content for doc in self.store.invoke(key)]
+
+    def __contains__(self, key: str) -> bool:
+        """Vectorizes key and performs similarity search returning a boolean if there is at least one match."""
+        raise NotImplementedError
+
+    def __iadd__(self, value: str) -> Self:
+        self.store.add_documents([Document(value)])
+        return self
+
+    def __iter__(self) -> str:
+        raise NotImplementedError
+
+    def __len__(self) -> int:
+        raise NotImplementedError

vulcan_core/util.py

@@ -0,0 +1,127 @@
+# SPDX-License-Identifier: Apache-2.0
+# Copyright 2025 Latchfield Technologies http://latchfield.com
+
+import functools
+from collections.abc import Callable, Iterator
+from contextlib import AbstractContextManager
+from dataclasses import dataclass
+from functools import wraps
+from typing import Any, NoReturn
+
+
+@dataclass(frozen=True)
+class WithContext:
+    """Applys a context manager as a decorator.
+
+    @WithContext(suppress(Exception))
+        def foo():
+            raise Exception("Some Exception")
+    """
+
+    context: AbstractContextManager
+
+    def __call__(self, func):
+        @wraps(func)
+        def wrapper(*args, **kwargs):
+            with self.context:
+                return func(*args, **kwargs)
+
+        return wrapper
+
+
+def not_implemented(func) -> Callable:
+    @functools.wraps(func)
+    def wrapper(*args, **kwargs) -> NoReturn:
+        msg = f"{func.__name__} is not implemented."
+        raise NotImplementedError(msg)
+
+    return wrapper
+
+
+def is_private(key: str) -> bool:
+    return key.startswith("_")
+
+
+class AttrDict(dict):
+    def validate(self, key: str) -> str:
+        if is_private(key):
+            msg = f"Access denied to private attribute: {key}"
+            raise KeyError(msg)
+
+        if key not in self.__annotations__:
+            raise KeyError(key)
+
+        return key
+
+    def __init__(self):
+        if type(self) is AttrDict:
+            msg = f"{AttrDict.__name__} is an abstract class that can not be directly instantiated."
+            raise TypeError(msg)
+
+    def __getitem__(self, key: str) -> Any:
+        try:
+            return getattr(self, self.validate(key))
+        except KeyError:
+            if hasattr(self, "__missing__"):
+                return self.__missing__(key)  # type: ignore
+            else:
+                raise
+
+    def __setitem__(self, key: str, value: Any) -> None:
+        setattr(self, self.validate(key), value)
+
+    def __iter__(self) -> Iterator[str]:
+        return (key for key in self.__annotations__ if not is_private(key))
+
+    def __reversed__(self) -> Iterator[str]:
+        return reversed(list(self))
+
+    def __len__(self) -> int:
+        return sum(1 for _ in self)
+
+    def __contains__(self, key: str) -> bool:
+        return hasattr(self, self.validate(key))
+
+    def __or__(self, other: dict) -> dict:
+        return dict(self) | other
+
+    def __repr__(self) -> str:
+        return repr(dict(self))
+
+    def keys(self) -> list[str]:
+        return list(self)
+
+    def values(self) -> list[Any]:
+        return [getattr(self, key) for key in self]
+
+    def items(self) -> list[tuple[str, Any]]:
+        return [(key, getattr(self, key)) for key in self]
+
+    def get(self, key: str, default: Any = None):
+        return getattr(self, self.validate(key), default)
+
+    def setdefault(self, key: str, default: Any = None) -> Any:
+        if key not in self:
+            self[key] = default
+        return self[key]
+
+    @not_implemented
+    def __delitem__(self, key: str) -> NoReturn: ...
+
+    @not_implemented
+    def __ior__(self, other: dict[str, Any]) -> NoReturn: ...
+
+    @not_implemented
+    def clear(self) -> NoReturn: ...
+
+    @not_implemented
+    def copy(self) -> NoReturn: ...
+
+    @not_implemented
+    def pop(self, key: str, defaul: Any = None) -> NoReturn: ...
+
+    @not_implemented
+    def popitem(self) -> NoReturn: ...
+
+    @not_implemented
+    def update(self, *args, **kwargs) -> NoReturn: ...