LSST Applications 27.0.0,g0265f82a02+469cd937ee,g02d81e74bb+21ad69e7e1,g1470d8bcf6+cbe83ee85a,g2079a07aa2+e67c6346a6,g212a7c68fe+04a9158687,g2305ad1205+94392ce272,g295015adf3+81dd352a9d,g2bbee38e9b+469cd937ee,g337abbeb29+469cd937ee,g3939d97d7f+72a9f7b576,g487adcacf7+71499e7cba,g50ff169b8f+5929b3527e,g52b1c1532d+a6fc98d2e7,g591dd9f2cf+df404f777f,g5a732f18d5+be83d3ecdb,g64a986408d+21ad69e7e1,g858d7b2824+21ad69e7e1,g8a8a8dda67+a6fc98d2e7,g99cad8db69+f62e5b0af5,g9ddcbc5298+d4bad12328,ga1e77700b3+9c366c4306,ga8c6da7877+71e4819109,gb0e22166c9+25ba2f69a1,gb6a65358fc+469cd937ee,gbb8dafda3b+69d3c0e320,gc07e1c2157+a98bf949bb,gc120e1dc64+615ec43309,gc28159a63d+469cd937ee,gcf0d15dbbd+72a9f7b576,gdaeeff99f8+a38ce5ea23,ge6526c86ff+3a7c1ac5f1,ge79ae78c31+469cd937ee,gee10cc3b42+a6fc98d2e7,gf1cff7945b+21ad69e7e1,gfbcc870c63+9a11dc8c8f
LSST Data Management Base Package
Loading...
Searching...
No Matches
Classes | Functions
lsst.scarlet.lite.bbox Namespace Reference

Classes

class  Box
 

Functions

tuple[tuple[slice,...], tuple[slice,...]] overlapped_slices (Box bbox1, Box bbox2)
 

Function Documentation

◆ overlapped_slices()

tuple[tuple[slice, ...], tuple[slice, ...]] lsst.scarlet.lite.bbox.overlapped_slices ( Box bbox1,
Box bbox2 )
Slices of bbox1 and bbox2 that overlap

Parameters
----------
bbox1:
    The first box.
bbox2:
    The second box.

Returns
-------
slices: tuple[Sequence[slice], Sequence[slice]]
    The slice of an array bounded by `bbox1` and
    the slice of an array bounded by `bbox2` in the
    overlapping region.

Definition at line 486 of file bbox.py.

486def overlapped_slices(bbox1: Box, bbox2: Box) -> tuple[tuple[slice, ...], tuple[slice, ...]]:
487 """Slices of bbox1 and bbox2 that overlap
488
489 Parameters
490 ----------
491 bbox1:
492 The first box.
493 bbox2:
494 The second box.
495
496 Returns
497 -------
498 slices: tuple[Sequence[slice], Sequence[slice]]
499 The slice of an array bounded by `bbox1` and
500 the slice of an array bounded by `bbox2` in the
501 overlapping region.
502 """
503 overlap = bbox1 & bbox2
504 if np.all(np.array(overlap.shape) == 0):
505 # There was no overlap, so return empty slices
506 return (slice(0, 0),) * len(overlap.shape), (slice(0, 0),) * len(overlap.shape)
507 _bbox1 = overlap - bbox1.origin
508 _bbox2 = overlap - bbox2.origin
509 slices = (
510 _bbox1.slices,
511 _bbox2.slices,
512 )
513 return slices