Object-oriented paths
Project Links
Meta
Author: Artur Maciag
Requires Python: >=3.10,<4.0
Classifiers
Development Status
- 4 - Beta
Intended Audience
- Developers
License
- OSI Approved :: Apache Software License
Operating System
- OS Independent
Programming Language
- Python :: 3
- Python :: 3.10
- Python :: 3.11
- Python :: 3.12
- Python :: 3.13
- Python :: 3.14
Topic
- Software Development :: Libraries
- Software Development :: Libraries :: Python Modules
pathable
About
Pathable provides a small set of "path" objects for traversing hierarchical data (mappings, lists, and other subscriptable trees) using a familiar path-like syntax.
It’s especially handy when you want to:
- express deep lookups as a single object (and pass it around)
- build paths incrementally (
p / "a" / 0 / "b") - safely probe (
exists(),get(...)) or strictly require segments (//)
Key features
- Intuitive path-based navigation for nested data (e.g., dicts/lists)
- Pluggable accessor layer for custom backends
- Pythonic, chainable API for concise and readable code
- Per-instance (bounded LRU) cached lookup accessor for repeated reads of the same tree
Quickstart
from pathable import LookupPath
data = {
"parts": {
"part1": {"name": "Part One"},
"part2": {"name": "Part Two"},
}
}
root = LookupPath.from_lookup(data)
name = (root / "parts" / "part2" / "name").read_value()
assert name == "Part Two"
Usage
from pathable import LookupPath
data = {
"parts": {
"part1": {"name": "Part One"},
"part2": {"name": "Part Two"},
}
}
p = LookupPath.from_lookup(data)
# Concatenate path segments with /
parts = p / "parts"
# Check membership (mapping keys or list indexes)
assert "part2" in parts
# Read a value
assert (parts / "part2" / "name").read_value() == "Part Two"
# Iterate children as paths
for child in parts:
print(child, child.read_value())
# Work with keys/items
print(list(parts.keys()))
print({k: v.read_value() for k, v in parts.items()})
# Safe access
print(parts.get("missing", default=None))
# Strict access (raises KeyError if missing)
must_exist = parts // "part2"
# "Open" yields the current value as a context manager
with parts.open() as parts_value:
assert isinstance(parts_value, dict)
# Optional metadata
print(parts.stat())
Filesystem example
Pathable can also traverse the filesystem via an accessor.
from pathlib import Path
from pathable import FilesystemPath
root_dir = Path(".")
p = FilesystemPath.from_path(root_dir)
readme = p / "README.md"
if readme.exists():
content = readme.read_value() # bytes
print(content[:100])
Core concepts
BasePathis a pure path (segments + separator) with/joining.AccessorPathis aBasePathbound to aNodeAccessor, enablingread_value(),exists(),keys(), iteration, etc.FilesystemPathis anAccessorPathspecialized for filesystem objects.LookupPathis anAccessorPathspecialized for mapping/list lookups.
Notes on parsing:
- A segment like
"a/b"is split into parts using the separator. Nonesegments are ignored."."segments are ignored (relative no-op).- Operations like
relative_to()andis_relative_to()also respect the instance separator.
Equality and ordering:
BasePathequality, hashing, and ordering are all based on bothseparatorandparts.- Ordering is separator-sensitive and deterministic, even when parts mix types (e.g. ints and strings).
- Path parts are type-sensitive (
0is not equal to"0").
Lookup caching:
LookupPathuses a per-instance LRU cache (default maxsize: 128) on its accessor.- You can control it via
path.accessor.clear_cache(),path.accessor.disable_cache(), andpath.accessor.enable_cache(maxsize=...). path.accessor.nodeis immutable; to point at a different tree, create a newLookupPath/accessor.
Installation
Recommended way (via pip):
pip install pathable
Alternatively you can download the code and install from the repository:
pip install -e git+https://github.com/p1c2u/pathable.git#egg=pathable
Benchmarks
Benchmarks live in tests/benchmarks/ and produce JSON reports.
Local run (recommended as modules):
poetry run python -m tests.benchmarks.bench_parse --output reports/bench-parse.json
poetry run python -m tests.benchmarks.bench_lookup --output reports/bench-lookup.json
Quick sanity run:
poetry run python -m tests.benchmarks.bench_parse --quick --output reports/bench-parse.quick.json
poetry run python -m tests.benchmarks.bench_lookup --quick --output reports/bench-lookup.quick.json
Compare two results (fails if candidate is >20% slower in any scenario):
poetry run python -m tests.benchmarks.compare_results \
--baseline reports/bench-before.json \
--candidate reports/bench-after.json \
--tolerance 0.20
CI (on-demand):
- GitHub Actions workflow
Benchmarksruns viaworkflow_dispatchand uploads the JSON artifacts.
0.5.0
Feb 20, 2026
0.5.0b6
Feb 15, 2026
0.5.0b5
Feb 15, 2026
0.5.0b4
Feb 14, 2026
0.5.0b3
Feb 13, 2026
0.5.0b2
Jun 07, 2025
0.5.0b1
Jun 07, 2025
0.5.0a4
Jun 07, 2025
0.5.0a3
Jun 01, 2025
0.5.0a2
May 30, 2025
0.5.0a1
May 26, 2025
0.4.4
Jan 10, 2025
0.4.3
Sep 01, 2022
0.4.2
Aug 29, 2022
0.4.1
Aug 29, 2022
0.4.0
Feb 01, 2022
0.3.0
Feb 01, 2022
0.2.0
Nov 24, 2021
0.1.3
Nov 24, 2021
Wheel compatibility matrix
Files in release
No dependencies