from dascore.core.coords import get_coord
coord = get_coord(data=[1, 3, 4, 10, 11, 12], step=1)
missing = coord.missing()
missing.count, missing.complete
list(missing.iter_runs())
missing.positions().tolist()[2, 5, 6, 7, 8, 9]
| class of dascore.core.coords | source |
Missing(
step: Any ,
runs: tuple[tuple[Any, Any, int], …] ,
dtype: Any = None,
)-> None
The grid positions a coordinate has no sample at.
Built by missing from run arithmetic, so it costs one entry per hole rather than one per position; positions spells the labels out, up to a limit.
| Name | Description |
|---|---|
| iter_runs | Yield each hole as its first and last missing label. |
| positions |
Every missing label, or raise when there are more than limit.
|