assert-one-assert-per-test 20261111143626__py3-none-any.whl

assert_one_assert_per_test/__main__.py

@@ -0,0 +1,3 @@
+from .cli import main
+
+main()

assert_one_assert_per_test/cli.py

@@ -0,0 +1,274 @@
+from __future__ import annotations
+
+import argparse
+import fnmatch
+import glob
+import os
+import sys
+from dataclasses import dataclass
+from typing import TYPE_CHECKING
+
+from .finding import Finding, Unparsable
+from .scanner import SCANNERS, Scanner, scanner_for
+
+if TYPE_CHECKING:
+    from collections.abc import Sequence
+
+EXIT_SUCCESS = 0
+EXIT_FINDINGS = 1
+EXIT_ERROR = 2
+
+
+@dataclass
+class ScanResult:
+    findings: list[Finding]
+    files_scanned: int
+    had_error: bool
+
+
+def create_parser() -> argparse.ArgumentParser:
+    parser = argparse.ArgumentParser(
+        prog="assert-one-assert-per-test",
+        description="Assert that each test function contains exactly one assertion.",
+    )
+
+    parser.add_argument(
+        "files",
+        nargs="+",
+        metavar="FILE",
+        help=(
+            "One or more file paths, directory paths, or glob patterns to scan. "
+            "Directories are scanned recursively for source files of a supported "
+            f"language ({', '.join(sorted(SCANNERS))})."
+        ),
+    )
+
+    parser.add_argument(
+        "--exclude",
+        metavar="PATTERNS",
+        help="Comma-separated glob patterns to exclude files.",
+    )
+
+    output_group = parser.add_mutually_exclusive_group()
+    output_group.add_argument(
+        "--quiet",
+        action="store_true",
+        help="Suppress all output. Exit code indicates success (0) or findings (1).",
+    )
+    output_group.add_argument(
+        "--count",
+        action="store_true",
+        help="Output only the count of findings.",
+    )
+    output_group.add_argument(
+        "--verbose",
+        action="store_true",
+        help="Show detailed processing information.",
+    )
+
+    behavior_group = parser.add_mutually_exclusive_group()
+    behavior_group.add_argument(
+        "--fail-fast",
+        action="store_true",
+        help="Exit immediately after finding the first issue.",
+    )
+    behavior_group.add_argument(
+        "--warn-only",
+        action="store_true",
+        help="Always exit with code 0, even if findings exist.",
+    )
+
+    return parser
+
+
+def parse_patterns(patterns_str: str | None) -> list[str]:
+    if not patterns_str:
+        return []
+    return [p.strip() for p in patterns_str.split(",") if p.strip()]
+
+
+def _is_glob_pattern(path: str) -> bool:
+    return any(c in path for c in ("*", "?", "["))
+
+
+def _expand_glob(pattern: str) -> tuple[list[str], bool]:
+    matched = glob.glob(pattern, recursive=True, include_hidden=True)
+    files = []
+    for path in matched:
+        if os.path.isfile(path):
+            files.append(path)
+        elif os.path.isdir(path):
+            files.extend(_expand_directory(path))
+    return (files, bool(matched))
+
+
+def _expand_directory(directory: str) -> list[str]:
+    files = []
+    for root, dirs, filenames in os.walk(directory):
+        dirs[:] = [d for d in dirs if not d.startswith(".")]
+        for filename in filenames:
+            if scanner_for(filename) is not None:
+                files.append(os.path.join(root, filename))
+    return files
+
+
+def _iter_files(paths: Sequence[str]) -> tuple[list[str], list[str]]:
+    files: list[str] = []
+    missing: list[str] = []
+
+    for path in paths:
+        if _is_glob_pattern(path):
+            matched_files, found = _expand_glob(path)
+            if found:
+                files.extend(matched_files)
+            else:
+                missing.append(path)
+        elif os.path.isfile(path):
+            files.append(path)
+        elif os.path.isdir(path):
+            files.extend(_expand_directory(path))
+        else:
+            missing.append(path)
+
+    seen: set[str] = set()
+    unique_files: list[str] = []
+    for f in files:
+        normalized = os.path.normpath(f)
+        if normalized not in seen:
+            seen.add(normalized)
+            unique_files.append(f)
+
+    return (unique_files, missing)
+
+
+def _should_skip_file(path: str, exclude_patterns: list[str]) -> bool:
+    return any(
+        fnmatch.fnmatch(path, pattern)
+        or fnmatch.fnmatch(os.path.basename(path), pattern)
+        for pattern in exclude_patterns
+    )
+
+
+def _scan_one(path: str, scanner: Scanner) -> list[Finding] | None:
+    try:
+        with open(path, "rb") as f:
+            content = f.read()
+    except OSError as e:
+        print(f"Error reading {path}: {e}", file=sys.stderr)
+        return None
+
+    try:
+        return scanner(path, content)
+    except Unparsable as e:
+        print(f"Syntax error in {path}: {e}", file=sys.stderr)
+        return None
+
+
+def process_files(
+    files: list[str],
+    exclude_patterns: list[str],
+    verbose: bool = False,
+    fail_fast: bool = False,
+) -> ScanResult:
+    findings: list[Finding] = []
+    files_scanned = 0
+    had_error = False
+
+    for path in sorted(files):
+        scanner = scanner_for(path)
+        if scanner is None:
+            if verbose:
+                print(f"Skipping (unsupported language): {path}")
+            continue
+
+        if _should_skip_file(path, exclude_patterns):
+            if verbose:
+                print(f"Skipping (excluded): {path}")
+            continue
+
+        if verbose:
+            print(f"Scanning: {path}")
+
+        file_findings = _scan_one(path, scanner)
+        if file_findings is None:
+            had_error = True
+            continue
+
+        files_scanned += 1
+        findings.extend(file_findings)
+
+        if verbose:
+            for finding in file_findings:
+                print(f"  Found: {finding}")
+
+        if findings and fail_fast:
+            break
+
+    return ScanResult(
+        findings=findings,
+        files_scanned=files_scanned,
+        had_error=had_error,
+    )
+
+
+def output_findings(
+    findings: list[Finding],
+    count_mode: bool = False,
+) -> None:
+    if count_mode:
+        print(len(findings))
+    else:
+        for finding in findings:
+            print(finding)
+
+
+def determine_exit_code(result: ScanResult, warn_only: bool = False) -> int:
+    if warn_only:
+        return EXIT_SUCCESS
+    if result.findings:
+        return EXIT_FINDINGS
+    if result.had_error:
+        return EXIT_ERROR
+    return EXIT_SUCCESS
+
+
+def main(argv: Sequence[str] | None = None) -> None:
+    parser = create_parser()
+    args = parser.parse_args(argv)
+
+    exclude_patterns = parse_patterns(args.exclude)
+
+    files, missing = _iter_files(args.files)
+
+    for path in missing:
+        print(f"Error: Path not found: {path}", file=sys.stderr)
+
+    if not files and missing:
+        sys.exit(EXIT_ERROR)
+
+    if args.verbose:
+        print(f"Scanning {len(files)} file(s) for tests...")
+        if exclude_patterns:
+            print(f"Excluding patterns: {', '.join(exclude_patterns)}")
+        print()
+
+    result = process_files(
+        files=files,
+        exclude_patterns=exclude_patterns,
+        verbose=args.verbose,
+        fail_fast=args.fail_fast,
+    )
+
+    if missing:
+        result.had_error = True
+
+    if args.verbose:
+        print()
+        print(f"Files scanned: {result.files_scanned}")
+        print(f"Findings: {len(result.findings)}")
+        if result.had_error:
+            print("Errors occurred during scanning.")
+    elif not args.quiet:
+        output_findings(result.findings, args.count)
+
+    sys.exit(determine_exit_code(result, args.warn_only))

assert_one_assert_per_test/finding.py

@@ -0,0 +1,25 @@
+from __future__ import annotations
+
+from dataclasses import dataclass
+
+
+@dataclass(frozen=True)
+class Finding:
+    path: str
+    line_number: int
+    function_name: str
+    assert_count: int
+    conjunction: bool = False
+
+    def __str__(self) -> str:
+        suffix = ":conjunction" if self.conjunction else ""
+        return (
+            f"{self.path}:{self.line_number}:{self.function_name}"
+            f":{self.assert_count}{suffix}"
+        )
+
+
+class Unparsable(Exception):
+    def __init__(self, line_number: int) -> None:
+        super().__init__(f"line {line_number}")
+        self.line_number = line_number

assert_one_assert_per_test/rust.py

@@ -0,0 +1,139 @@
+from __future__ import annotations
+
+from typing import TYPE_CHECKING
+
+import tree_sitter_rust
+from tree_sitter import Language, Parser
+
+from .finding import Finding, Unparsable
+
+if TYPE_CHECKING:
+    from collections.abc import Iterator
+
+    from tree_sitter import Node
+
+RUST = Language(tree_sitter_rust.language())
+
+TEST_ATTRIBUTES = frozenset({"test", "rstest", "test_case"})
+PANIC_ATTRIBUTE = "should_panic"
+ASSERTION_FAMILIES = ("assert", "debug_assert")
+COMMENTS = frozenset({"line_comment", "block_comment"})
+NESTED_ITEMS = frozenset(
+    {"function_item", "impl_item", "mod_item", "trait_item"}
+)
+
+
+def text(node: Node) -> str:
+    return (node.text or b"").decode("utf-8", "replace")
+
+
+def last_segment(path: Node) -> str:
+    name = path.child_by_field_name("name")
+    return text(path if name is None else name)
+
+
+def attribute_names(function: Node) -> list[str]:
+    names: list[str] = []
+    sibling = function.prev_named_sibling
+    while sibling is not None and (
+        sibling.type == "attribute_item" or sibling.type in COMMENTS
+    ):
+        if sibling.type == "attribute_item":
+            attribute = sibling.named_children[0]
+            names.append(last_segment(attribute.named_children[0]))
+        sibling = sibling.prev_named_sibling
+    return names
+
+
+def is_test_function(function: Node) -> bool:
+    return any(name in TEST_ATTRIBUTES for name in attribute_names(function))
+
+
+def is_assertion_macro(name: str) -> bool:
+    return any(
+        name == family or name.startswith(f"{family}_")
+        for family in ASSERTION_FAMILIES
+    )
+
+
+def macro_name(macro: Node) -> str:
+    path = macro.child_by_field_name("macro")
+    return "" if path is None else last_segment(path)
+
+
+def assertion_macros(node: Node) -> Iterator[Node]:
+    for child in node.named_children:
+        if child.type in NESTED_ITEMS:
+            continue
+        if child.type == "macro_invocation" and is_assertion_macro(
+            macro_name(child)
+        ):
+            yield child
+        yield from assertion_macros(child)
+
+
+def is_operand(token: Node | None) -> bool:
+    return token is not None and (token.is_named or token.type == "?")
+
+
+def claim_operators(macro: Node) -> list[str]:
+    operators: list[str] = []
+    previous: Node | None = None
+    for token in macro.named_children[-1].children[1:-1]:
+        if token.type == ",":
+            break
+        if token.type in ("&&", "||") and is_operand(previous):
+            operators.append(token.type)
+        previous = token
+    return operators
+
+
+def conjunct_count(macro: Node) -> int:
+    if macro_name(macro) not in ASSERTION_FAMILIES:
+        return 0
+    operators = claim_operators(macro)
+    if "||" in operators or "&&" not in operators:
+        return 0
+    return operators.count("&&") + 1
+
+
+def test_functions(node: Node) -> Iterator[Node]:
+    for child in node.named_children:
+        if child.type == "function_item" and is_test_function(child):
+            yield child
+        yield from test_functions(child)
+
+
+def first_fault(node: Node) -> Node:
+    if node.is_error or node.is_missing:
+        return node
+    return first_fault(next(child for child in node.children if child.has_error))
+
+
+def check_function(path: str, function: Node) -> list[Finding]:
+    name = text(function.child_by_field_name("name") or function)
+    body = function.child_by_field_name("body")
+    macros = [] if body is None else list(assertion_macros(body))
+    panics = attribute_names(function).count(PANIC_ATTRIBUTE)
+    count = len(macros) + panics
+    findings = []
+    if count != 1:
+        findings.append(Finding(path, function.start_point.row + 1, name, count))
+    for macro in macros:
+        conjuncts = conjunct_count(macro)
+        if conjuncts:
+            findings.append(
+                Finding(path, macro.start_point.row + 1, name, conjuncts, True)
+            )
+    return findings
+
+
+def scan(path: str, source: bytes) -> list[Finding]:
+    root = Parser(RUST).parse(source).root_node
+    if root.has_error:
+        raise Unparsable(first_fault(root).start_point.row + 1)
+    return [
+        finding
+        for function in test_functions(root)
+        for finding in check_function(path, function)
+    ]

assert_one_assert_per_test/scanner.py

@@ -0,0 +1,17 @@
+from __future__ import annotations
+
+import os
+from collections.abc import Callable
+
+from . import rust
+from .finding import Finding
+
+Scanner = Callable[[str, bytes], list[Finding]]
+
+SCANNERS: dict[str, Scanner] = {
+    ".rs": rust.scan,
+}
+
+
+def scanner_for(path: str) -> Scanner | None:
+    return SCANNERS.get(os.path.splitext(path)[1])

assert_one_assert_per_test-20261111143626.dist-info/METADATA

@@ -0,0 +1,199 @@
+Metadata-Version: 2.4
+Name: assert-one-assert-per-test
+Version: 20261111143626
+Summary: CLI tool to assert that each test function, in any supported language, contains exactly one assertion
+Author-email: 10U Labs <dev@10ulabs.com>
+License-Expression: Apache-2.0
+Project-URL: Homepage, https://github.com/10U-Labs/assert-one-assert-per-test
+Project-URL: Repository, https://github.com/10U-Labs/assert-one-assert-per-test
+Classifier: Development Status :: 4 - Beta
+Classifier: Environment :: Console
+Classifier: Intended Audience :: Developers
+Classifier: Operating System :: OS Independent
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Programming Language :: Python :: 3.13
+Classifier: Programming Language :: Rust
+Classifier: Topic :: Software Development :: Quality Assurance
+Classifier: Topic :: Software Development :: Testing
+Requires-Python: >=3.10
+Description-Content-Type: text/markdown
+License-File: LICENSE.txt
+Requires-Dist: tree-sitter>=0.25
+Requires-Dist: tree-sitter-rust>=0.24
+Dynamic: license-file
+
+# assert-one-assert-per-test
+
+Assert that each test function contains exactly one assertion, in any language
+the tool can read. Rust is the first.
+
+It is the language-independent sibling of
+[assert-one-assert-per-pytest](https://github.com/10U-Labs/assert-one-assert-per-pytest),
+and reports the same findings in the same format.
+
+## Why One Assert Per Test?
+
+The "one assert per test" pattern encourages writing focused, atomic tests that
+verify a single behavior. Benefits include:
+
+- **Clear failure messages**: When a test fails, you know exactly what behavior broke
+- **Better test names**: Tests naturally describe specific behaviors
+- **Easier maintenance**: Changes to one behavior don't affect unrelated assertions
+- **Faster debugging**: No need to hunt through multiple assertions
+
+## Installation
+
+```bash
+pip install assert-one-assert-per-test
+```
+
+## Usage
+
+### Command Line
+
+```bash
+# Scan a crate's sources and integration tests
+assert-one-assert-per-test src tests
+
+# Scan specific files
+assert-one-assert-per-test src/lib.rs tests/cli.rs
+
+# Use glob patterns
+assert-one-assert-per-test "crates/**/*.rs"
+
+# Exclude patterns
+assert-one-assert-per-test . --exclude "*/target/*"
+
+# Verbose output
+assert-one-assert-per-test src --verbose
+
+# Fail fast (exit on first finding)
+assert-one-assert-per-test src --fail-fast
+
+# Warn only (always exit 0)
+assert-one-assert-per-test src --warn-only
+```
+
+A directory is read recursively for files in a supported language, skipping
+hidden directories. A file in a language the tool cannot read is passed over.
+
+### GitHub Actions
+
+```yaml
+- uses: 10U-Labs/assert-one-assert-per-test@v1
+  with:
+    files: "src tests"
+    exclude: "*/target/*"
+    verbose: "true"
+```
+
+### As a Python Module
+
+```bash
+python -m assert_one_assert_per_test src tests
+```
+
+## Supported Languages
+
+| Language | Suffixes | Parser                                                              |
+| -------- | -------- | ------------------------------------------------------------------- |
+| Rust     | `.rs`    | [tree-sitter-rust](https://github.com/tree-sitter/tree-sitter-rust) |
+
+Each language is read by its own grammar rather than by matching text, so an
+`assert!` inside a string or a comment is never counted.
+
+## Output Format
+
+Default output shows one finding per line:
+
+```text
+src/lib.rs:10:adds:0
+src/lib.rs:15:adds_twice:2
+src/lib.rs:22:adds_both:2:conjunction
+```
+
+Format: `file_path:line_number:function_name:assert_count`
+
+The line number is the line the function's `fn` keyword is on, after any
+attributes. A conjunction finding adds a fifth field, `conjunction`. Its line
+number is the assertion rather than the enclosing function, and its count is the
+number of conjuncts the expression joins.
+
+## Exit Codes
+
+- `0`: No findings (or `--warn-only` specified)
+- `1`: Findings detected
+- `2`: Error (missing files, unreadable files, syntax errors)
+
+## Rust
+
+### What Counts as a Test?
+
+A function carrying an attribute whose last path segment is `test`, `rstest` or
+`test_case`. That covers `#[test]`, `#[tokio::test]`, `#[async_std::test]`,
+`#[sqlx::test]`, `#[rstest]` and `#[test_case(...)]`, wherever the function is,
+including inside `#[cfg(test)] mod tests`. `#[cfg(test)]` on its own does not
+make a function a test.
+
+### What Counts as an Assertion?
+
+- A macro whose last path segment is `assert` or `debug_assert`, or starts with
+  `assert_` or `debug_assert_`: `assert!`, `assert_eq!`, `assert_ne!`,
+  `debug_assert!`, `debug_assert_eq!`, `debug_assert_ne!`,
+  `pretty_assertions::assert_eq!`, `assert_matches!`, and the `assert_*_snapshot!`
+  macros from `insta`.
+- A `#[should_panic]` attribute on the test, which asserts that the body panics.
+
+An assertion inside a closure or a loop in the test body is counted once, where
+it is written. An assertion inside an item nested in the test, a `fn`, `impl`,
+`trait` or `mod`, is not counted, since nothing says the test runs it. Neither
+is an assertion in a helper function the test calls.
+
+### Conjunctions
+
+An `assert!` or `debug_assert!` whose condition is a top-level `&&` carries one
+claim per conjunct, so a red run names the whole expression rather than the
+claim that broke. The tool reports it the way it reports a second assertion.
+
+```rust
+#[test]
+fn parses() {
+    assert!(config.name == "app" && config.port == 8080);
+}
+```
+
+Only a top-level `&&` is refused. These are all allowed:
+
+- `assert!(a || b)`, one claim about two alternatives.
+- `assert!(a || b && c)`, where `&&` binds tighter and the claim being made is
+  the disjunction.
+- `assert!(!(a && b))`, which is `!a || !b`, and so a disjunction.
+- `assert!(items.iter().all(|i| i.a && i.b))`, where the `&&` is evaluated per
+  item inside a closure rather than joining two claims about the test.
+- `assert!(a, "{}", b && c)` and `assert!(a, "b && c")`, where the `&&` is in
+  the message.
+- `assert_eq!(a && b, true)`, which claims one equality.
+
+### Syntax Errors
+
+A file tree-sitter cannot parse completely is reported as a syntax error naming
+the first line it could not place, and the run exits 2, because a test the
+grammar misread could be counted wrongly.
+
+## Options
+
+| Option               | Description                                |
+| -------------------- | ------------------------------------------ |
+| `--exclude PATTERNS` | Glob patterns to exclude (comma-separated) |
+| `--quiet`            | Suppress all output (exit code only)       |
+| `--count`            | Print only the number of findings          |
+| `--verbose`          | Show detailed processing information       |
+| `--fail-fast`        | Exit after the first file with a finding   |
+| `--warn-only`        | Always exit 0, even with findings          |
+
+## License
+
+Apache 2.0 - See [LICENSE.txt](LICENSE.txt)

assert_one_assert_per_test-20261111143626.dist-info/RECORD

@@ -0,0 +1,13 @@
+assert_one_assert_per_test/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+assert_one_assert_per_test/__main__.py,sha256=bYt9eEaoRQWdejEHFD8REx9jxVEdZptECFsV7F49Ink,30
+assert_one_assert_per_test/cli.py,sha256=miHp8ewyhYnFgBZ3f7UJdVfwWuGrQwcr76pI-C3tBuA,7247
+assert_one_assert_per_test/finding.py,sha256=zPGKasj-CVO_SlwB5uBy_YTAFb44cQgbKd0DnrY6PFs,618
+assert_one_assert_per_test/py.typed,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+assert_one_assert_per_test/rust.py,sha256=CapXMPFFb8y8lvbRms7sfdoxR-bqk5xlhQmyEIQI7nw,4201
+assert_one_assert_per_test/scanner.py,sha256=I75K9LZ8QVlTDhsXR75kxRCIChBVfcmuYYGAAtMC3KE,338
+assert_one_assert_per_test-20261111143626.dist-info/licenses/LICENSE.txt,sha256=7C7FkuzwSQFE_PL6st5x2YyMN1aiyjZ9ti1s5X45no8,10761
+assert_one_assert_per_test-20261111143626.dist-info/METADATA,sha256=5flJWVGwg9RBEfXHOT-R1OsXhV7mdwzY67Qzzw7sIWY,6948
+assert_one_assert_per_test-20261111143626.dist-info/WHEEL,sha256=mOdXR9C3wMVov7cSY8PY-XCzo3SmmWCHvGQr5csJoao,91
+assert_one_assert_per_test-20261111143626.dist-info/entry_points.txt,sha256=ZUAuHBa1iixBShGaMH_3FR6j6Uc8poNxwza6JqF8hAw,83
+assert_one_assert_per_test-20261111143626.dist-info/top_level.txt,sha256=iZPv_Xq5dKrKjkTrQJuphmcdvfascXyKqMCCet-bCNU,27
+assert_one_assert_per_test-20261111143626.dist-info/RECORD,,

assert_one_assert_per_test-20261111143626.dist-info/WHEEL

@@ -0,0 +1,5 @@
+Wheel-Version: 1.0
+Generator: setuptools (84.2.1)
+Root-Is-Purelib: true
+Tag: py3-none-any
+

assert_one_assert_per_test-20261111143626.dist-info/entry_points.txt

@@ -0,0 +1,2 @@
+[console_scripts]
+assert-one-assert-per-test = assert_one_assert_per_test.cli:main

assert_one_assert_per_test-20261111143626.dist-info/licenses/LICENSE.txt

@@ -0,0 +1,190 @@
+                                 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 2024 10U Labs LLC
+
+   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.

assert_one_assert_per_test-20261111143626.dist-info/top_level.txt

@@ -0,0 +1 @@
+assert_one_assert_per_test