lsst::sphgeom::CompoundRegion Class Reference

CompoundRegion is an intermediate base class for spherical regions that are comprised of a point-set operation on other nested regions. More...

#include <CompoundRegion.h>

Inheritance diagram for lsst::sphgeom::CompoundRegion:

Public Member Functions
	CompoundRegion (std::vector< std::unique_ptr< Region > > operands) noexcept
	Construct by taking ownership of operands.
	CompoundRegion (CompoundRegion const &)
	CompoundRegion (CompoundRegion &&) noexcept=default
CompoundRegion &	operator= (CompoundRegion const &)=delete
CompoundRegion &	operator= (CompoundRegion &&)=delete
size_t	nOperands () const
Region const &	getOperand (std::size_t n) const
virtual Relationship	relate (Region const &r) const =0
Relationship	relate (Box const &b) const override
Relationship	relate (Circle const &c) const override
Relationship	relate (ConvexPolygon const &p) const override
Relationship	relate (Ellipse const &e) const override
virtual std::unique_ptr< Region >	clone () const =0
	clone returns a deep copy of this region.
virtual Box	getBoundingBox () const =0
	getBoundingBox returns a bounding-box for this region.
virtual Box3d	getBoundingBox3d () const =0
	getBoundingBox3d returns a 3-dimensional bounding-box for this region.
virtual Circle	getBoundingCircle () const =0
	getBoundingCircle returns a bounding-circle for this region.
virtual bool	isEmpty () const =0
	isEmpty returns true when a region does not contain any points.
virtual bool	contains (UnitVector3d const &) const =0
	contains tests whether the given unit vector is inside this region.
bool	contains (double x, double y, double z) const
	contains tests whether the unit vector defined by the given (not necessarily normalized) coordinates is inside this region.
bool	contains (double lon, double lat) const
	contains tests whether the unit vector defined by the given longitude and latitude coordinates (in radians) is inside this region.
virtual std::vector< std::uint8_t >	encode () const =0
	encode serializes this region into an opaque byte string.
virtual TriState	overlaps (Region const &other) const =0
virtual TriState	overlaps (Box const &) const =0
virtual TriState	overlaps (Circle const &) const =0
virtual TriState	overlaps (ConvexPolygon const &) const =0
virtual TriState	overlaps (Ellipse const &) const =0

Static Public Member Functions
static std::vector< std::unique_ptr< Region > >	getRegions (Region const &region)
	getRegions returns a vector of Region.
static std::unique_ptr< CompoundRegion >	decode (std::vector< std::uint8_t > const &s)
static std::unique_ptr< CompoundRegion >	decode (std::uint8_t const *buffer, size_t n)
static std::unique_ptr< Region >	decodeBase64 (std::string const &s)
static std::unique_ptr< Region >	decodeBase64 (std::string_view const &s)
static TriState	decodeOverlapsBase64 (std::string const &s)
static TriState	decodeOverlapsBase64 (std::string_view const &s)

Protected Member Functions
std::vector< std::uint8_t >	_encode (std::uint8_t tc) const
std::vector< std::unique_ptr< Region > > const &	operands () const
template<typename Compound >
void	flatten_operands ()

Static Protected Member Functions
static std::vector< std::unique_ptr< Region > >	_decode (std::uint8_t tc, std::uint8_t const *buffer, std::size_t nBytes)
static TriState	_relationship_to_overlaps (Relationship r)

Detailed Description

CompoundRegion is an intermediate base class for spherical regions that are comprised of a point-set operation on other nested regions.

Definition at line 55 of file CompoundRegion.h.

Constructor & Destructor Documentation

CompoundRegion() [1/3]

lsst::sphgeom::CompoundRegion::CompoundRegion ( std::vector< std::unique_ptr< Region > > operands )

explicitnoexcept

Construct by taking ownership of operands.

Definition at line 88 of file CompoundRegion.cc.

        : _operands(std::move(operands))
{
}

CompoundRegion() [2/3]

lsst::sphgeom::CompoundRegion::CompoundRegion

(

CompoundRegion const &

other

)

Definition at line 93 of file CompoundRegion.cc.

        : _operands()
{
    for (auto&& operand: other._operands) {
        _operands.emplace_back(operand->clone());
    }
}

CompoundRegion() [3/3]

lsst::sphgeom::CompoundRegion::CompoundRegion ( CompoundRegion && )

defaultnoexcept

Member Function Documentation

_decode()

std::vector< std::unique_ptr< Region > > lsst::sphgeom::CompoundRegion::_decode ( std::uint8_t tc, std::uint8_t const * buffer, std::size_t nBytes )

staticprotected

Definition at line 135 of file CompoundRegion.cc.

                                                               {
    std::uint8_t const *end = buffer + nBytes;
    if (nBytes == 0) {
        throw std::runtime_error("Encoded CompoundRegion is truncated.");
    }
    if (buffer[0] != tc) {
        throw std::runtime_error("Byte string is not an encoded CompoundRegion.");
    }
    ++buffer;
    std::vector<std::unique_ptr<Region>> result;
    while (buffer != end) {
        std::uint64_t nBytes = consumeDecodeU64(buffer, end);
        if (buffer + nBytes > end) {
            throw std::runtime_error("Encoded CompoundRegion is truncated.");
        }
        result.push_back(Region::decode(buffer, nBytes));
        buffer += nBytes;
    }
    return result;
}

_encode()

std::vector< std::uint8_t > lsst::sphgeom::CompoundRegion::_encode ( std::uint8_t tc ) const

protected

Definition at line 124 of file CompoundRegion.cc.

                                                                 {
    std::vector<std::uint8_t> buffer;
    buffer.push_back(tc);
    for (auto&& operand: _operands) {
        auto operand_buffer = operand->encode();
        encodeU64(operand_buffer.size(), buffer);
        buffer.insert(buffer.end(), operand_buffer.begin(), operand_buffer.end());
    }
    return buffer;
}

_relationship_to_overlaps()

static TriState lsst::sphgeom::Region::_relationship_to_overlaps ( Relationship r )

inlinestaticprotectedinherited

Definition at line 206 of file Region.h.

                                                              {
        // `relate` returns exact relation when specific bit is set, if it is
        // not then relation may be true or not.
        if ((r & DISJOINT) == DISJOINT) {
            return TriState(false);
        }
        if ((r & (WITHIN | CONTAINS)).any()) {
            return TriState(true);
        }
        return TriState();
    }

clone()

virtual std::unique_ptr< Region > lsst::sphgeom::Region::clone ( ) const

pure virtualinherited

clone returns a deep copy of this region.

Implemented in lsst::sphgeom::Box, lsst::sphgeom::Circle, lsst::sphgeom::UnionRegion, lsst::sphgeom::IntersectionRegion, lsst::sphgeom::ConvexPolygon, and lsst::sphgeom::Ellipse.

contains() [1/3]

bool lsst::sphgeom::Region::contains ( double lon, double lat ) const

inherited

contains tests whether the unit vector defined by the given longitude and latitude coordinates (in radians) is inside this region.

Definition at line 54 of file Region.cc.

                                                  {
    return contains(UnitVector3d(LonLat::fromRadians(lon, lat)));
}

contains() [2/3]

bool lsst::sphgeom::Region::contains ( double x, double y, double z ) const

inherited

contains tests whether the unit vector defined by the given (not necessarily normalized) coordinates is inside this region.

Definition at line 50 of file Region.cc.

                                                        {
    return contains(UnitVector3d(x, y, z));
}

contains() [3/3]

virtual bool lsst::sphgeom::Region::contains ( UnitVector3d const & ) const

pure virtualinherited

contains tests whether the given unit vector is inside this region.

Implemented in lsst::sphgeom::Box, lsst::sphgeom::Circle, lsst::sphgeom::UnionRegion, lsst::sphgeom::IntersectionRegion, lsst::sphgeom::ConvexPolygon, lsst::sphgeom::Ellipse, lsst::sphgeom::Box, lsst::sphgeom::Circle, lsst::sphgeom::UnionRegion, lsst::sphgeom::IntersectionRegion, lsst::sphgeom::ConvexPolygon, and lsst::sphgeom::Ellipse.

decode() [1/2]

std::unique_ptr< CompoundRegion > lsst::sphgeom::CompoundRegion::decode ( std::uint8_t const * buffer, size_t n )

static

decode deserializes a CompoundRegion from a byte string produced by encode.

Definition at line 157 of file CompoundRegion.cc.

                                                                                       {
    if (n == 0) {
        throw std::runtime_error("Encoded CompoundRegion is truncated.");
    }
    switch (buffer[0]) {
        case UnionRegion::TYPE_CODE:
            return UnionRegion::decode(buffer, n);
        case IntersectionRegion::TYPE_CODE:
            return IntersectionRegion::decode(buffer, n);
        default:
            throw std::runtime_error("Byte string is not an encoded CompoundRegion.");
    }
}

decode() [2/2]

static std::unique_ptr< CompoundRegion > lsst::sphgeom::CompoundRegion::decode ( std::vector< std::uint8_t > const & s )

inlinestatic

decode deserializes a CompoundRegion from a byte string produced by encode.

Definition at line 88 of file CompoundRegion.h.

                                                                                {
        return decode(s.data(), s.size());
    }

decodeBase64() [1/2]

static std::unique_ptr< Region > lsst::sphgeom::Region::decodeBase64 ( std::string const & s )

inlinestaticinherited

decodeBase64 deserializes a Region from an ASCII string produced by encode and then base64-encoding that result.

This method also interprets ':' as a delimiter for the elements of a UnionRegion, to support cases where a union of region is constructed server-side in a database as a concatenation with that delimiter.

Definition at line 176 of file Region.h.

                                                                   {
        return decodeBase64(s);
    }

decodeBase64() [2/2]

std::unique_ptr< Region > lsst::sphgeom::Region::decodeBase64 ( std::string_view const & s )

staticinherited

decodeBase64 deserializes a Region from an ASCII string produced by encode and then base64-encoding that result.

This method also interprets ':' as a delimiter for the elements of a UnionRegion, to support cases where a union of region is constructed server-side in a database as a concatenation with that delimiter.

Definition at line 93 of file Region.cc.

                                                                   {
    if (s.empty()) {
        return std::unique_ptr<UnionRegion>(new UnionRegion({}));
    }
    auto region_begin = s.begin();
    auto region_end = std::find(s.begin(), s.end(), ':');
    if (region_end != s.end()) {
        std::vector<std::unique_ptr<Region>> union_args;
        while (region_end != s.end()) {
            auto bytes = base64::decode_into<std::vector<std::uint8_t>>(region_begin, region_end);
            union_args.push_back(decode(bytes));
            region_begin = region_end;
            ++region_begin;
            region_end = std::find(region_begin, s.end(), ':');
        }
        auto bytes = base64::decode_into<std::vector<std::uint8_t>>(region_begin, region_end);
        union_args.push_back(decode(bytes));
        return std::unique_ptr<UnionRegion>(new UnionRegion(std::move(union_args)));
    } else {
        auto bytes = base64::decode_into<std::vector<std::uint8_t>>(region_begin, region_end);
        return decode(bytes);
    }
}

decodeOverlapsBase64() [1/2]

static TriState lsst::sphgeom::Region::decodeOverlapsBase64 ( std::string const & s )

inlinestaticinherited

decodeOverlapsBase64 evaluates an encoded overlap expression.

A single overlap expression is formed by concatenating a pair of base64-encoded regions (Region::encode then base64 encoding) with '&' as the delimiter. Multiple such pairwise overlap expressions can then be concatenated with '|' as the delimiter to form the logical OR.

Definition at line 190 of file Region.h.

                                                              {
        return decodeOverlapsBase64(s);
    }

decodeOverlapsBase64() [2/2]

TriState lsst::sphgeom::Region::decodeOverlapsBase64 ( std::string_view const & s )

staticinherited

decodeOverlapsBase64 evaluates an encoded overlap expression.

A single overlap expression is formed by concatenating a pair of base64-encoded regions (Region::encode then base64 encoding) with '&' as the delimiter. Multiple such pairwise overlap expressions can then be concatenated with '|' as the delimiter to form the logical OR.

Definition at line 117 of file Region.cc.

                                                              {
    TriState result(false);
    if (s.empty()) {
        // False makes the most sense as the limit of a logical OR of zero
        // terms (e.g. `any([])` in Python).
        return result;
    }
    auto begin = s.begin();
    while (result != true) {  // if result is known to be true, we're done.
        auto mid = std::find(begin, s.end(), '&');
        if (mid == s.end()) {
            throw std::runtime_error("No '&' found in encoded overlap expression term.");
        }
        auto a = Region::decode(base64::decode_into<std::vector<std::uint8_t>>(begin, mid));
        ++mid;
        auto end = std::find(mid, s.end(), '|');
        auto b = Region::decode(base64::decode_into<std::vector<std::uint8_t>>(mid, end));
        result = result | a->overlaps(*b);
        if (end == s.end()) {
            break;
        } else {
            begin = end;
            ++begin;
        }
    }
    return result;
}

encode()

virtual std::vector< std::uint8_t > lsst::sphgeom::Region::encode ( ) const

pure virtualinherited

encode serializes this region into an opaque byte string.

Byte strings emitted by encode can be deserialized with decode.

Implemented in lsst::sphgeom::Box, lsst::sphgeom::Circle, lsst::sphgeom::UnionRegion, lsst::sphgeom::IntersectionRegion, lsst::sphgeom::ConvexPolygon, and lsst::sphgeom::Ellipse.

flatten_operands()

template<typename Compound >

void lsst::sphgeom::CompoundRegion::flatten_operands ( )

protected

Definition at line 103 of file CompoundRegion.cc.

                                      {
    for (size_t i = 0; i != _operands.size(); ) {
        if (auto compound = dynamic_cast<Compound*>(_operands[i].get())) {
            // Move all regions from this operand, then remove it.
            std::move(
                compound->_operands.begin(),
                compound->_operands.end(),
                std::inserter(_operands, _operands.begin() + i + 1)
            );
            _operands.erase(_operands.begin() + i);
        } else {
            ++ i;
        }
    }
}

getBoundingBox()

virtual Box lsst::sphgeom::Region::getBoundingBox ( ) const

pure virtualinherited

getBoundingBox returns a bounding-box for this region.

Implemented in lsst::sphgeom::Box, lsst::sphgeom::Circle, lsst::sphgeom::UnionRegion, lsst::sphgeom::IntersectionRegion, lsst::sphgeom::ConvexPolygon, and lsst::sphgeom::Ellipse.

getBoundingBox3d()

virtual Box3d lsst::sphgeom::Region::getBoundingBox3d ( ) const

pure virtualinherited

getBoundingBox3d returns a 3-dimensional bounding-box for this region.

Implemented in lsst::sphgeom::Box, lsst::sphgeom::Circle, lsst::sphgeom::UnionRegion, lsst::sphgeom::IntersectionRegion, lsst::sphgeom::ConvexPolygon, and lsst::sphgeom::Ellipse.

getBoundingCircle()

virtual Circle lsst::sphgeom::Region::getBoundingCircle ( ) const

pure virtualinherited

getBoundingCircle returns a bounding-circle for this region.

Implemented in lsst::sphgeom::Box, lsst::sphgeom::Circle, lsst::sphgeom::UnionRegion, lsst::sphgeom::IntersectionRegion, lsst::sphgeom::ConvexPolygon, and lsst::sphgeom::Ellipse.

getOperand()

Region const & lsst::sphgeom::CompoundRegion::getOperand ( std::size_t n ) const

inline

Definition at line 74 of file CompoundRegion.h.

                                                 {
        return *_operands[n];
    }

getRegions()

std::vector< std::unique_ptr< Region > > lsst::sphgeom::Region::getRegions ( Region const & region )

staticinherited

getRegions returns a vector of Region.

Definition at line 145 of file Region.cc.

                                                                        {
    std::vector<std::unique_ptr<Region>> result;
    if (auto union_region = dynamic_cast<UnionRegion const *>(&region)) {
        for(unsigned i = 0; i < union_region->nOperands(); ++i) {
            result.emplace_back(union_region->getOperand(i).clone());
        }
    } else if(auto intersection_region = dynamic_cast<IntersectionRegion const *>(&region)) {
        for(unsigned i = 0; i < intersection_region->nOperands(); ++i) {
            result.emplace_back(intersection_region->getOperand(i).clone());
        }
    } else {
        result.emplace_back(region.clone());
    }
    return result;
}

isEmpty()

virtual bool lsst::sphgeom::Region::isEmpty ( ) const

pure virtualinherited

isEmpty returns true when a region does not contain any points.

Implemented in lsst::sphgeom::Box, lsst::sphgeom::Circle, lsst::sphgeom::UnionRegion, lsst::sphgeom::IntersectionRegion, lsst::sphgeom::ConvexPolygon, and lsst::sphgeom::Ellipse.

nOperands()

size_t lsst::sphgeom::CompoundRegion::nOperands ( ) const

inline

Definition at line 71 of file CompoundRegion.h.

{ return _operands.size(); }

operands()

std::vector< std::unique_ptr< Region > > const & lsst::sphgeom::CompoundRegion::operands ( ) const

inlineprotected

Definition at line 104 of file CompoundRegion.h.

{ return _operands; }

operator=() [1/2]

CompoundRegion & lsst::sphgeom::CompoundRegion::operator= ( CompoundRegion && )

delete

operator=() [2/2]

CompoundRegion & lsst::sphgeom::CompoundRegion::operator= ( CompoundRegion const & )

delete

overlaps() [1/5]

virtual TriState lsst::sphgeom::Region::overlaps ( Box const & ) const

pure virtualinherited

overlaps tests whether two regions overlap. This method returns a TriState object, when the value is true it means that regions definitely overlap, false means they are definitely disjont, and unknown state means that they may or may not overlap.

Implemented in lsst::sphgeom::Box, lsst::sphgeom::Circle, lsst::sphgeom::UnionRegion, lsst::sphgeom::IntersectionRegion, lsst::sphgeom::ConvexPolygon, and lsst::sphgeom::Ellipse.

overlaps() [2/5]

virtual TriState lsst::sphgeom::Region::overlaps ( Circle const & ) const

pure virtualinherited

overlaps tests whether two regions overlap. This method returns a TriState object, when the value is true it means that regions definitely overlap, false means they are definitely disjont, and unknown state means that they may or may not overlap.

Implemented in lsst::sphgeom::Box, lsst::sphgeom::Circle, lsst::sphgeom::UnionRegion, lsst::sphgeom::IntersectionRegion, lsst::sphgeom::ConvexPolygon, and lsst::sphgeom::Ellipse.

overlaps() [3/5]

virtual TriState lsst::sphgeom::Region::overlaps ( ConvexPolygon const & ) const

pure virtualinherited

overlaps tests whether two regions overlap. This method returns a TriState object, when the value is true it means that regions definitely overlap, false means they are definitely disjont, and unknown state means that they may or may not overlap.

Implemented in lsst::sphgeom::Box, lsst::sphgeom::Circle, lsst::sphgeom::UnionRegion, lsst::sphgeom::IntersectionRegion, lsst::sphgeom::ConvexPolygon, and lsst::sphgeom::Ellipse.

overlaps() [4/5]

virtual TriState lsst::sphgeom::Region::overlaps ( Ellipse const & ) const

pure virtualinherited

overlaps tests whether two regions overlap. This method returns a TriState object, when the value is true it means that regions definitely overlap, false means they are definitely disjont, and unknown state means that they may or may not overlap.

Implemented in lsst::sphgeom::Box, lsst::sphgeom::Circle, lsst::sphgeom::UnionRegion, lsst::sphgeom::IntersectionRegion, lsst::sphgeom::ConvexPolygon, and lsst::sphgeom::Ellipse.

overlaps() [5/5]

TriState lsst::sphgeom::Region::overlaps ( Region const & other ) const

pure virtualinherited

overlaps tests whether two regions overlap. This method returns a TriState object, when the value is true it means that regions definitely overlap, false means they are definitely disjont, and unknown state means that they may or may not overlap.

Implemented in lsst::sphgeom::Box, lsst::sphgeom::Circle, lsst::sphgeom::UnionRegion, lsst::sphgeom::IntersectionRegion, lsst::sphgeom::ConvexPolygon, and lsst::sphgeom::Ellipse.

Definition at line 59 of file Region.cc.

                                          {
    // Default implementation just uses `relate`, and it returns unknown state
    // more frequently, subclasses will want to implement better tests.
    auto r = this->relate(other);
    if ((r & DISJOINT).any()) {
        return TriState(false);
    } else if ((r & (CONTAINS | WITHIN)).any()) {
        return TriState(true);
    } else {
        return TriState();
    }
}

relate() [1/5]

Relationship lsst::sphgeom::CompoundRegion::relate ( Box const & ) const

overridevirtual

relate computes the spatial relationships between this region A and another region B. The return value S is a bitset with the following properties:

• Bit S & DISJOINT is set only if A and B do not have any points in common.
• Bit S & CONTAINS is set only if A contains all points in B.
• Bit S & WITHIN is set only if B contains all points in A.

Said another way: if the CONTAINS, WITHIN or DISJOINT bit is set, then the corresponding spatial relationship between the two regions holds conclusively. If it is not set, the relationship may or may not hold.

These semantics allow for conservative relationship computations. In particular, a Region may choose to implement relate by replacing itself and/or the argument with a simplified bounding region.

Implements lsst::sphgeom::Region.

Definition at line 119 of file CompoundRegion.cc.

{ return relate(static_cast<Region const &>(b)); }

relate() [2/5]

Relationship lsst::sphgeom::CompoundRegion::relate ( Circle const & ) const

overridevirtual

relate computes the spatial relationships between this region A and another region B. The return value S is a bitset with the following properties:

• Bit S & DISJOINT is set only if A and B do not have any points in common.
• Bit S & CONTAINS is set only if A contains all points in B.
• Bit S & WITHIN is set only if B contains all points in A.

Said another way: if the CONTAINS, WITHIN or DISJOINT bit is set, then the corresponding spatial relationship between the two regions holds conclusively. If it is not set, the relationship may or may not hold.

These semantics allow for conservative relationship computations. In particular, a Region may choose to implement relate by replacing itself and/or the argument with a simplified bounding region.

Implements lsst::sphgeom::Region.

Definition at line 120 of file CompoundRegion.cc.

{ return relate(static_cast<Region const &>(c)); }

relate() [3/5]

Relationship lsst::sphgeom::CompoundRegion::relate ( ConvexPolygon const & ) const

overridevirtual

relate computes the spatial relationships between this region A and another region B. The return value S is a bitset with the following properties:

• Bit S & DISJOINT is set only if A and B do not have any points in common.
• Bit S & CONTAINS is set only if A contains all points in B.
• Bit S & WITHIN is set only if B contains all points in A.

Said another way: if the CONTAINS, WITHIN or DISJOINT bit is set, then the corresponding spatial relationship between the two regions holds conclusively. If it is not set, the relationship may or may not hold.

These semantics allow for conservative relationship computations. In particular, a Region may choose to implement relate by replacing itself and/or the argument with a simplified bounding region.

Implements lsst::sphgeom::Region.

Definition at line 121 of file CompoundRegion.cc.

{ return relate(static_cast<Region const &>(p)); }

relate() [4/5]

Relationship lsst::sphgeom::CompoundRegion::relate ( Ellipse const & ) const

overridevirtual

relate computes the spatial relationships between this region A and another region B. The return value S is a bitset with the following properties:

• Bit S & DISJOINT is set only if A and B do not have any points in common.
• Bit S & CONTAINS is set only if A contains all points in B.
• Bit S & WITHIN is set only if B contains all points in A.

Said another way: if the CONTAINS, WITHIN or DISJOINT bit is set, then the corresponding spatial relationship between the two regions holds conclusively. If it is not set, the relationship may or may not hold.

These semantics allow for conservative relationship computations. In particular, a Region may choose to implement relate by replacing itself and/or the argument with a simplified bounding region.

Implements lsst::sphgeom::Region.

Definition at line 122 of file CompoundRegion.cc.

{ return relate(static_cast<Region const &>(e)); }

relate() [5/5]

virtual Relationship lsst::sphgeom::CompoundRegion::relate ( Region const & ) const

pure virtual

relate computes the spatial relationships between this region A and another region B. The return value S is a bitset with the following properties:

• Bit S & DISJOINT is set only if A and B do not have any points in common.
• Bit S & CONTAINS is set only if A contains all points in B.
• Bit S & WITHIN is set only if B contains all points in A.

Said another way: if the CONTAINS, WITHIN or DISJOINT bit is set, then the corresponding spatial relationship between the two regions holds conclusively. If it is not set, the relationship may or may not hold.

These semantics allow for conservative relationship computations. In particular, a Region may choose to implement relate by replacing itself and/or the argument with a simplified bounding region.

Implements lsst::sphgeom::Region.

Implemented in lsst::sphgeom::UnionRegion, and lsst::sphgeom::IntersectionRegion.

---

The documentation for this class was generated from the following files:

• /j/snowflake/release/lsstsw/stack/lsst-scipipe-9.0.0/Linux64/sphgeom/g3e8969e208+a8ce1bb630/include/lsst/sphgeom/CompoundRegion.h
• /j/snowflake/release/lsstsw/stack/lsst-scipipe-9.0.0/Linux64/sphgeom/g3e8969e208+a8ce1bb630/src/CompoundRegion.cc