A fast interval tree-like implementation in C, wrapped for the Python ecosystem. It provides data structures for nested interval containment queries (e.g., finding all intervals containing a point or overlapping a range). Version 0.0.70 is current; releases are infrequent and versioned 0.0.x.
pip install nclsVerified import paths — ran on the pinned version, not inferred.
Create an NCLS object from numpy arrays and query overlap with a range.
Convert inputs using np.array() before passing to NCLS constructor.
Sort input arrays before constructing NCLS, e.g., sort via numpy or pandas.
Use ncls.find_overlap(start, end) instead of ncls.find(start, end).
Pass numpy arrays: starts = np.array([...]), ends = np.array([...]), ids = np.array([...]).
Use ncls.find_overlap(start, end) which returns an array of indices.
Install via pip: pip install ncls. Ensure you are using the correct Python interpreter.
No dependency data recorded yet.