Span.h

Go to the documentation of this file.

// -*- lsst-c++ -*-
/*
 * LSST Data Management System
 * Copyright 2008, 2009, 2010 LSST Corporation.
 *
 * This product includes software developed by the
 * LSST Project (http://www.lsst.org/).
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the LSST License Statement and
 * the GNU General Public License along with this program.  If not,
 * see <http://www.lsstcorp.org/LegalNotices/>.
 */
 
#ifndef LSST_AFW_GEOM_Span_h_INCLUDED
#define LSST_AFW_GEOM_Span_h_INCLUDED
 
#include <string>
#include <iostream>
 
#include "lsst/base.h"
#include "lsst/cpputils/hashCombine.h"
#include "lsst/geom.h"
#include "lsst/afw/geom/SpanPixelIterator.h"
 
namespace lsst {
namespace afw {
 
namespace detection {
class Footprint;
}  // namespace detection
 
namespace geom {
 
class Span final {
public:
    using Iterator = SpanPixelIterator;
 
    using Interval = lsst::geom::IntervalI;
 
    Span(int y,   
         int x0,  
         int x1)  
            : _y(y), _x0(x0), _x1(x1) {}
 
    Span(Interval const & x, int y) : _y(y), _x0(x.getMin()), _x1(x.getMax()) {}
 
    Span() noexcept : _y(0), _x0(0), _x1(-1) {}
 
    Span(Span const&) noexcept = default;
    Span(Span&&) noexcept = default;
    Span& operator=(Span const&) noexcept = default;
    Span& operator=(Span&&) noexcept = default;
    ~Span() noexcept = default;
 
    Iterator begin() const noexcept { return Iterator(lsst::geom::Point2I(_x0, _y)); }
 
    Iterator end() const noexcept { return Iterator(lsst::geom::Point2I(_x1 + 1, _y)); }
 
    int getX0() const noexcept { return _x0; }               
    int& getX0() noexcept { return _x0; }                    
    int getX1() const noexcept { return _x1; }               
    int& getX1() noexcept { return _x1; }                    
    Interval getX() const noexcept { return Interval::fromMinMax(_x0, _x1); }
    int getY() const noexcept { return _y; }                 
    int& getY() noexcept { return _y; }                      
    int getWidth() const noexcept { return _x1 - _x0 + 1; }  
    int getMinX() const noexcept { return _x0; }             
    int getMaxX() const noexcept { return _x1; }             
    int getBeginX() const noexcept { return _x0; }           
    int getEndX() const noexcept { return _x1 + 1; }         
    lsst::geom::Point2I const getMin() const noexcept {
        return lsst::geom::Point2I(_x0, _y);
    }  
    lsst::geom::Point2I const getMax() const noexcept {
        return lsst::geom::Point2I(_x1, _y);
    }  
 
    bool contains(int x) const noexcept { return (x >= _x0) && (x <= _x1); }
    bool contains(int x, int y) const noexcept { return (x >= _x0) && (x <= _x1) && (y == _y); }
    bool contains(lsst::geom::Point2I const& point) const noexcept {
        return contains(point.getX(), point.getY());
    }
 
    bool isEmpty() const noexcept { return _x1 < _x0; }
 
    std::string toString() const;
 
    void shift(int dx, int dy) noexcept {
        _x0 += dx;
        _x1 += dx;
        _y += dy;
    }
 
    friend std::ostream& operator<<(std::ostream& os, Span const& span) { return os << span.toString(); }
 
    bool operator==(Span const& other) const noexcept {
        return other.getY() == getY() && other.getMinX() == getMinX() && other.getMaxX() == getMaxX();
    }
    bool operator!=(Span const& other) const noexcept { return !(*this == other); }
 
    std::size_t hash_value() const noexcept {
        // Completely arbitrary seed
        return cpputils::hashCombine(42, getY(), getMinX(), getMaxX());
    }
 
    /* Required to make Span "LessThanComparable" so they can be used
     * in sorting, binary search, etc.
     * http://www.sgi.com/tech/stl/LessThanComparable.html
     */
    bool operator<(const Span& b) const noexcept;
 
    friend class detection::Footprint;
 
private:
    int _y;   
    int _x0;  
    int _x1;  
};
}  // namespace geom
}  // namespace afw
}  // namespace lsst
 
namespace std {
template <>
struct hash<lsst::afw::geom::Span> {
    using argument_type = lsst::afw::geom::Span;
    using result_type = size_t;
    result_type operator()(argument_type const& obj) const noexcept { return obj.hash_value(); }
};
}  // namespace std
 
#endif  // LSST_AFW_GEOM_Span_h_INCLUDED