daaf 0.1.0__tar.gz

daaf-0.1.0/.gitignore

@@ -0,0 +1,4 @@
+__pycache__/
+*.pyc
+.venv/
+dist/

daaf-0.1.0/LICENSE

@@ -0,0 +1,176 @@
+                                 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 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

daaf-0.1.0/PKG-INFO

@@ -0,0 +1,117 @@
+Metadata-Version: 2.5
+Name: daaf
+Version: 0.1.0
+Summary: Decision-as-a-function: a typed Python function with a docstring, answered by Laya
+Project-URL: Homepage, https://github.com/LilHenri75/daaf
+License-Expression: Apache-2.0
+License-File: LICENSE
+Keywords: classification,decision,decorator,laya,llm
+Requires-Python: >=3.10
+Requires-Dist: laya>=0.3.27
+Description-Content-Type: text/markdown
+
+# daaf — decision-as-a-function
+
+Write a typed Python function with a docstring. [Laya](https://github.com/NandhaKishorM/laya) answers it, locally, in any of 100+ languages, in tens of milliseconds.
+
+```python
+from enum import Enum, IntEnum
+from typing import Literal
+from daaf import decide
+
+@decide
+def is_scam(message: str) -> bool:
+    """Is this message a scam trying to get money or credentials?"""
+
+class Dept(Enum):
+    billing = "invoices, payments, refunds"   # the value describes the option to the model
+    support = "bugs, outages, login problems"
+    sales = "pricing, buying a product"
+
+@decide
+def department(message: str) -> Dept:
+    """Which department should handle this message?"""
+
+is_scam("Votre colis est bloqué, payez 1,99 € ici")  # True
+department("I was billed twice")                     # Dept.billing
+```
+
+The function body is never run: the docstring is the question, the return type is the set of possible answers.
+
+## Install
+
+```bash
+pip install daaf
+```
+
+The first call downloads the Laya model (a few hundred MB) and loads it, which takes a few seconds. Later calls are fast.
+
+## Return types
+
+| Annotation | Result |
+|---|---|
+| `bool` | `True` / `False` |
+| `Literal["a", "b", ...]` | one of the values (strings, ints…) |
+| `Enum` subclass | one member; string values describe each option, which helps the model |
+| `IntEnum` subclass | an ordered level (Laya's `score` type); member names are read as the level labels |
+
+```python
+class Urgency(IntEnum):
+    not_urgent = 0
+    soon = 1
+    blocking = 2
+
+@decide
+def urgency(message: str) -> Urgency:
+    """How urgent is this message?"""
+
+urgency("Production is down!")  # Urgency.blocking
+```
+
+## Arguments
+
+- One argument: its value is the text Laya reads.
+- Several arguments: Laya reads them as named fields, for example `def urgent(subject: str, body: str) -> bool`.
+
+## Many inputs at once
+
+```python
+is_scam.batch(["message 1", "message 2", ...])         # one-argument function
+urgent.batch([("subject", "body"), {"subject": "s", "body": "b"}])  # several arguments
+```
+
+Inputs share forward passes, which is much faster than a loop. Results come back in input order. `batch_size=` caps how many go through the model at once.
+
+## Options
+
+```python
+@decide(min_confidence=0.8)      # raise daaf.Undecided below 80% instead of guessing
+def is_scam(message: str) -> bool:
+    """Is this message a scam trying to get money or credentials?"""
+
+@decide(model="multilingual", max_len=8192)  # anything else goes to laya's Router.predict
+def is_contract(document: str) -> bool:
+    """Is this document a contract?"""
+
+@decide(router=my_router)        # your own Router, or any object with Laya's .predict / .predict_batch
+def is_spam(text: str) -> bool:
+    """Is this message spam?"""
+```
+
+`Undecided` carries Laya's raw answer in `.answer`, so you can hand the case to a person or a larger model. In `.batch(...)`, the first undecided input raises it.
+
+`is_scam.question` shows the exact question sent to Laya.
+
+## Accuracy
+
+daaf adds no intelligence: answers are as good as Laya's zero-shot checkpoints, which can make mistakes, especially on subtle questions. Test on your own examples, and use `min_confidence` where an error costs something. Clear docstrings and `Enum` descriptions help.
+
+## License
+
+Apache-2.0, like Laya.
+
+## Tests
+
+```bash
+python test_daaf.py   # no model needed, a fake router stands in for Laya
+```

daaf-0.1.0/README.md

@@ -0,0 +1,105 @@
+# daaf — decision-as-a-function
+
+Write a typed Python function with a docstring. [Laya](https://github.com/NandhaKishorM/laya) answers it, locally, in any of 100+ languages, in tens of milliseconds.
+
+```python
+from enum import Enum, IntEnum
+from typing import Literal
+from daaf import decide
+
+@decide
+def is_scam(message: str) -> bool:
+    """Is this message a scam trying to get money or credentials?"""
+
+class Dept(Enum):
+    billing = "invoices, payments, refunds"   # the value describes the option to the model
+    support = "bugs, outages, login problems"
+    sales = "pricing, buying a product"
+
+@decide
+def department(message: str) -> Dept:
+    """Which department should handle this message?"""
+
+is_scam("Votre colis est bloqué, payez 1,99 € ici")  # True
+department("I was billed twice")                     # Dept.billing
+```
+
+The function body is never run: the docstring is the question, the return type is the set of possible answers.
+
+## Install
+
+```bash
+pip install daaf
+```
+
+The first call downloads the Laya model (a few hundred MB) and loads it, which takes a few seconds. Later calls are fast.
+
+## Return types
+
+| Annotation | Result |
+|---|---|
+| `bool` | `True` / `False` |
+| `Literal["a", "b", ...]` | one of the values (strings, ints…) |
+| `Enum` subclass | one member; string values describe each option, which helps the model |
+| `IntEnum` subclass | an ordered level (Laya's `score` type); member names are read as the level labels |
+
+```python
+class Urgency(IntEnum):
+    not_urgent = 0
+    soon = 1
+    blocking = 2
+
+@decide
+def urgency(message: str) -> Urgency:
+    """How urgent is this message?"""
+
+urgency("Production is down!")  # Urgency.blocking
+```
+
+## Arguments
+
+- One argument: its value is the text Laya reads.
+- Several arguments: Laya reads them as named fields, for example `def urgent(subject: str, body: str) -> bool`.
+
+## Many inputs at once
+
+```python
+is_scam.batch(["message 1", "message 2", ...])         # one-argument function
+urgent.batch([("subject", "body"), {"subject": "s", "body": "b"}])  # several arguments
+```
+
+Inputs share forward passes, which is much faster than a loop. Results come back in input order. `batch_size=` caps how many go through the model at once.
+
+## Options
+
+```python
+@decide(min_confidence=0.8)      # raise daaf.Undecided below 80% instead of guessing
+def is_scam(message: str) -> bool:
+    """Is this message a scam trying to get money or credentials?"""
+
+@decide(model="multilingual", max_len=8192)  # anything else goes to laya's Router.predict
+def is_contract(document: str) -> bool:
+    """Is this document a contract?"""
+
+@decide(router=my_router)        # your own Router, or any object with Laya's .predict / .predict_batch
+def is_spam(text: str) -> bool:
+    """Is this message spam?"""
+```
+
+`Undecided` carries Laya's raw answer in `.answer`, so you can hand the case to a person or a larger model. In `.batch(...)`, the first undecided input raises it.
+
+`is_scam.question` shows the exact question sent to Laya.
+
+## Accuracy
+
+daaf adds no intelligence: answers are as good as Laya's zero-shot checkpoints, which can make mistakes, especially on subtle questions. Test on your own examples, and use `min_confidence` where an error costs something. Clear docstrings and `Enum` descriptions help.
+
+## License
+
+Apache-2.0, like Laya.
+
+## Tests
+
+```bash
+python test_daaf.py   # no model needed, a fake router stands in for Laya
+```

daaf-0.1.0/daaf.py

@@ -0,0 +1,134 @@
+"""Decision-as-a-function: write a typed Python function with a docstring, Laya answers it.
+
+    from typing import Literal
+    from daaf import decide
+
+    @decide
+    def is_scam(message: str) -> bool:
+        \"\"\"Is this message a scam trying to get money or credentials?\"\"\"
+
+    @decide
+    def department(message: str) -> Literal["billing", "support", "sales"]:
+        \"\"\"Which department should handle this message?\"\"\"
+
+    is_scam("Your parcel is held, pay 1.99 EUR here")   # True
+    department("I was charged twice")                    # "billing"
+"""
+import functools
+import inspect
+from enum import Enum, IntEnum
+from typing import Literal, get_args, get_origin, get_type_hints
+
+__all__ = ["decide", "Undecided"]
+__version__ = "0.1.0"
+
+_router = None
+
+
+def _default_router():
+    global _router
+    if _router is None:
+        from laya import Router  # imported lazily: loading torch is slow
+        _router = Router()
+    return _router
+
+
+class Undecided(Exception):
+    """Laya's confidence fell below the function's `min_confidence`."""
+
+    def __init__(self, function, answer):
+        self.answer = answer
+        super().__init__(f"{function}: confidence {answer.get('confidence', 0):.2f} too low")
+
+
+def _question(fn):
+    """Build the Laya question from the docstring and return annotation, plus a decoder."""
+    doc = inspect.getdoc(fn)
+    if not doc:
+        raise TypeError(f"{fn.__name__}: the docstring is the question, it must not be empty")
+    ret = get_type_hints(fn).get("return")
+    if ret is bool:
+        return {"type": "noul", "instructions": doc}, lambda a: a["noul"] >= 0.5
+    if get_origin(ret) is Literal:
+        values = get_args(ret)
+        labels = {str(v): v for v in values}
+        if len(labels) != len(values):
+            raise TypeError(f"{fn.__name__}: Literal values must be distinct once turned into text")
+        question = {"type": "choice", "instructions": doc, "criteria": dict.fromkeys(labels)}
+        return question, lambda a: labels[a["choice"]]
+    if inspect.isclass(ret) and issubclass(ret, IntEnum):
+        # Ordered levels: Laya's `score` type, levels sorted by value, names read as text.
+        levels = sorted(ret)
+        question = {"type": "score", "instructions": doc,
+                    "criteria": [m.name.replace("_", " ") for m in levels]}
+        return question, lambda a: levels[_level(a)]
+    if inspect.isclass(ret) and issubclass(ret, Enum):
+        # The member name is the label, its value (a string) describes it to the model.
+        criteria = {m.name: m.value if isinstance(m.value, str) else None for m in ret}
+        question = {"type": "choice", "instructions": doc, "criteria": criteria}
+        return question, lambda a: ret[a["choice"]]
+    raise TypeError(f"{fn.__name__}: the return annotation must be bool, Literal[...], an Enum "
+                    f"or an IntEnum, got {ret!r}")
+
+
+def _level(answer):
+    """Most probable level of a `score` answer (its `score` field is an average, not a level)."""
+    probs = answer.get("probabilities")
+    if probs:
+        return int(max(probs, key=lambda k: float(probs[k])))
+    return round(float(answer["score"]))
+
+
+def decide(fn=None, *, min_confidence=None, router=None, **predict_kwargs):
+    """Turn a typed, documented function into a Laya decision.
+
+    `min_confidence`: below it, raise `Undecided` instead of returning a guess.
+    `router`: any object with Laya's `predict(state, questions, **kw)` (default: `laya.Router()`).
+    Other keyword arguments go to `predict` (for example `model="multilingual"`, `max_len=8192`).
+    """
+    if fn is None:  # used as @decide(...)
+        return lambda f: decide(f, min_confidence=min_confidence, router=router, **predict_kwargs)
+
+    question, decode = _question(fn)
+    signature = inspect.signature(fn)
+    if min_confidence is not None:
+        predict_kwargs["min_confidence"] = min_confidence
+
+    def state(*args, **kwargs):
+        bound = signature.bind(*args, **kwargs)
+        bound.apply_defaults()
+        params = bound.arguments
+        # One argument: the text itself. Several: Laya reads a dict of named fields.
+        return next(iter(params.values())) if len(params) == 1 else dict(params)
+
+    def answer_of(result):
+        answer = result["answers"]["answer"]
+        if answer.get("low_confidence"):
+            raise Undecided(fn.__name__, answer)
+        return decode(answer)
+
+    @functools.wraps(fn)
+    def wrapper(*args, **kwargs):
+        result = (router or _default_router()).predict(state(*args, **kwargs), {"answer": question},
+                                                       **predict_kwargs)
+        return answer_of(result)
+
+    def batch(items, batch_size=None):
+        """Answer many inputs in shared forward passes, in input order.
+
+        For a one-argument function each item is that argument; otherwise each item is a dict
+        of keyword arguments or a tuple of positional ones.
+        """
+        if len(signature.parameters) == 1:
+            states = [state(item) for item in items]
+        else:
+            states = [state(**i) if isinstance(i, dict) else state(*i) for i in items]
+        call = {k: v for k, v in predict_kwargs.items() if k == "min_confidence"}
+        per_request = {k: v for k, v in predict_kwargs.items() if k != "min_confidence"}
+        requests = [{"state": s, "questions": {"answer": question}, **per_request} for s in states]
+        results = (router or _default_router()).predict_batch(requests, batch_size=batch_size, **call)
+        return [answer_of(r) for r in results]
+
+    wrapper.question = question
+    wrapper.batch = batch
+    return wrapper

daaf-0.1.0/pyproject.toml

@@ -0,0 +1,19 @@
+[build-system]
+requires = ["hatchling"]
+build-backend = "hatchling.build"
+
+[project]
+name = "daaf"
+dynamic = ["version"]
+description = "Decision-as-a-function: a typed Python function with a docstring, answered by Laya"
+readme = "README.md"
+requires-python = ">=3.10"
+license = "Apache-2.0"
+dependencies = ["laya>=0.3.27"]
+keywords = ["laya", "decision", "classification", "llm", "decorator"]
+
+[tool.hatch.version]
+path = "daaf.py"
+
+[project.urls]
+Homepage = "https://github.com/LilHenri75/daaf"

daaf-0.1.0/test_daaf.py

@@ -0,0 +1,110 @@
+"""Tests without the model: a fake router stands in for Laya. Run: python -m pytest (or python test_daaf.py)."""
+from enum import Enum, IntEnum
+from typing import Literal
+
+from daaf import Undecided, decide
+
+
+class FakeRouter:
+    def __init__(self, answer):
+        self.answer, self.calls = answer, []
+
+    def predict(self, state, questions, **kw):
+        self.calls.append((state, questions, kw))
+        return {"answers": {"answer": self.answer}}
+
+    def predict_batch(self, requests, **kw):
+        return [self.predict(r["state"], r["questions"], **kw) for r in requests]
+
+
+def test_bool():
+    r = FakeRouter({"noul": 0.9})
+
+    @decide(router=r)
+    def is_scam(message: str) -> bool:
+        """Is this a scam?"""
+
+    assert is_scam("pay now") is True
+    assert r.calls[0][:2] == ("pay now", {"answer": {"type": "noul", "instructions": "Is this a scam?"}})
+
+
+def test_literal_and_several_arguments():
+    r = FakeRouter({"choice": "2"})
+
+    @decide(router=r)
+    def urgency(subject: str, body: str = "") -> Literal[1, 2, 3]:
+        """How urgent?"""
+
+    assert urgency("help") == 2  # the text label comes back as the original value
+    assert r.calls[0][0] == {"subject": "help", "body": ""}
+
+
+def test_enum_values_describe_options():
+    class Dept(Enum):
+        billing = "invoices, refunds"
+        support = "bugs, outages"
+
+    r = FakeRouter({"choice": "support"})
+
+    @decide(router=r)
+    def dept(text: str) -> Dept:
+        """Which department?"""
+
+    assert dept("down") is Dept.support
+    assert r.calls[0][1]["answer"]["criteria"] == {"billing": "invoices, refunds", "support": "bugs, outages"}
+
+
+def test_intenum_is_an_ordered_score():
+    class Urgency(IntEnum):
+        high = 5
+        low = 1
+
+    r = FakeRouter({"score": 0.4, "probabilities": {"0": 0.3, "1": 0.7}})
+
+    @decide(router=r)
+    def urgency(text: str) -> Urgency:
+        """How urgent?"""
+
+    assert urgency("x") is Urgency.high  # most probable level, not the rounded average
+    assert r.calls[0][1]["answer"]["criteria"] == ["low", "high"]  # sorted by value
+
+
+def test_batch():
+    r = FakeRouter({"noul": 0.2})
+
+    @decide(router=r, min_confidence=0.5, model="multilingual")
+    def ok(subject: str, body: str) -> bool:
+        """Ok?"""
+
+    assert ok.batch([("a", "b"), {"subject": "c", "body": "d"}]) == [False, False]
+    assert [c[0] for c in r.calls] == [{"subject": "a", "body": "b"}, {"subject": "c", "body": "d"}]
+
+
+def test_low_confidence_raises():
+    @decide(router=FakeRouter({"noul": 0.55, "confidence": 0.55, "low_confidence": True}), min_confidence=0.8)
+    def f(text: str) -> bool:
+        """Yes?"""
+
+    try:
+        f("x")
+        raise AssertionError("expected Undecided")
+    except Undecided as e:
+        assert e.answer["noul"] == 0.55
+
+
+def test_bad_definitions_fail_at_decoration():
+    for bad in ("def g(t: str) -> bool: pass", 'def g(t: str) -> str:\n    """Q?"""'):
+        ns = {}
+        exec(bad, ns)
+        try:
+            decide(ns["g"], router=FakeRouter({}))
+            raise AssertionError("expected TypeError")
+        except TypeError:
+            pass
+
+
+if __name__ == "__main__":
+    for name, t in list(globals().items()):
+        if name.startswith("test_"):
+            t()
+    print("ok")