range1d.h

Go to the documentation of this file.

//
// Copyright 2016 Pixar
//
// Licensed under the terms set forth in the LICENSE.txt file available at
// https://openusd.org/license.
//
// This file is generated by a script.  Do not edit directly.  Edit the
// range.template.h file to make changes.
 
#ifndef PXR_BASE_GF_RANGE1D_H
#define PXR_BASE_GF_RANGE1D_H
 
 
#include "pxr/pxr.h"
 
#include "pxr/base/gf/api.h"
#include "pxr/base/gf/traits.h"
#include "pxr/base/tf/hash.h"
 
#include <cfloat>
#include <cstddef>
#include <iosfwd>
 
PXR_NAMESPACE_OPEN_SCOPE
 
class GfRange1d;
class GfRange1f;
 
template <>
struct GfIsGfRange<class GfRange1d> { static const bool value = true; };
 
class GfRange1d
{
public:
 
    typedef double MinMaxType;
 
    static const size_t dimension = 1;
    typedef MinMaxType ScalarType;
 
    // TODO check whether this can be deprecated.
    void inline SetEmpty() {
        _min =  FLT_MAX;
        _max = -FLT_MAX;
    }
 
    GfRange1d() {
        SetEmpty();
    }
 
    GfRange1d(double min, double max)
        : _min(min), _max(max)
    {
    }
 
 
    GF_API
    GfRange1d(class GfRange1f const &other);
 
    double GetMin() const { return _min; }
 
    double GetMax() const { return _max; }
 
    double GetSize() const { return _max - _min; }
 
    double GetMidpoint() const {
        return static_cast<ScalarType>(0.5) * _min
               + static_cast<ScalarType>(0.5) * _max;
    }
 
    void SetMin(double min) { _min = min; }
 
    void SetMax(double max) { _max = max; }
 
    bool IsEmpty() const {
        return _min > _max;
    }
 
    void ExtendBy(double point) { UnionWith(point); }
 
    void ExtendBy(const GfRange1d &range) { UnionWith(range); }
 
    bool Contains(double point) const {
        return (point >= _min && point <= _max);
    }
 
    bool Contains(const GfRange1d &range) const {
        return Contains(range._min) && Contains(range._max);
    }
 
    bool IsInside(double point) const {
        return Contains(point);
    }
 
    bool IsInside(const GfRange1d &range) const {
        return Contains(range);
    }
 
    bool IsOutside(const GfRange1d &range) const {
        return (range._max < _min || range._min > _max);
    }
 
    static GfRange1d GetUnion(const GfRange1d &a, const GfRange1d &b) {
        GfRange1d res = a;
        _FindMin(res._min,b._min);
        _FindMax(res._max,b._max);
        return res;
    }
 
    const GfRange1d &UnionWith(const GfRange1d &b) {
        _FindMin(_min,b._min);
        _FindMax(_max,b._max);
        return *this;
    }
 
    const GfRange1d &UnionWith(double b) {
        _FindMin(_min,b);
        _FindMax(_max,b);
        return *this;
    }
 
    static GfRange1d Union(const GfRange1d &a, const GfRange1d &b) {
        return GetUnion(a, b);
    }
 
    const GfRange1d &Union(const GfRange1d &b) {
        return UnionWith(b);
    }
 
    const GfRange1d &Union(double b) {
        return UnionWith(b);
    }
 
    static GfRange1d GetIntersection(const GfRange1d &a, const GfRange1d &b) {
        GfRange1d res = a;
        _FindMax(res._min,b._min);
        _FindMin(res._max,b._max);
        return res;
    }
 
    static GfRange1d Intersection(const GfRange1d &a, const GfRange1d &b) {
        return GetIntersection(a, b);
    }
 
    const GfRange1d &IntersectWith(const GfRange1d &b) {
        _FindMax(_min,b._min);
        _FindMin(_max,b._max);
        return *this;
    }
 
    const GfRange1d &Intersection(const GfRange1d &b) {
        return IntersectWith(b);
    }
 
    GfRange1d &operator +=(const GfRange1d &b) {
        _min += b._min;
        _max += b._max;
        return *this;
    }
 
    GfRange1d &operator -=(const GfRange1d &b) {
        _min -= b._max;
        _max -= b._min;
        return *this;
    }
 
    GfRange1d &operator *=(double m) {
        if (m > 0) {
            _min *= m;
            _max *= m;
        } else {
            double tmp = _min;
            _min = _max * m;
            _max = tmp * m;
        }
        return *this;
    }
 
    GfRange1d &operator /=(double m) {
        return *this *= (1.0 / m);
    }
 
    GfRange1d operator +(const GfRange1d &b) const {
        return GfRange1d(_min + b._min, _max + b._max);
    }
 
 
    GfRange1d operator -(const GfRange1d &b) const {
        return GfRange1d(_min - b._max, _max - b._min);
    }
 
    friend GfRange1d operator *(double m, const GfRange1d &r) {
        return (m > 0 ? 
            GfRange1d(r._min*m, r._max*m) : 
            GfRange1d(r._max*m, r._min*m));
    }
 
    friend GfRange1d operator *(const GfRange1d &r, double m) {
        return (m > 0 ? 
            GfRange1d(r._min*m, r._max*m) : 
            GfRange1d(r._max*m, r._min*m));
    }
 
    friend GfRange1d operator /(const GfRange1d &r, double m) {
        return r * (1.0 / m);
    }
 
    friend inline size_t hash_value(const GfRange1d &r) {
        return TfHash::Combine(r._min, r._max);
    }
 
    bool operator ==(const GfRange1d &b) const {
        return (_min == b._min && _max == b._max);
    }
 
    bool operator !=(const GfRange1d &b) const {
        return !(*this == b);
    }
 
    GF_API inline bool operator ==(const GfRange1f& other) const;
    GF_API inline bool operator !=(const GfRange1f& other) const;
 
    GF_API
    double GetDistanceSquared(double p) const;
 
 
  private:
    double _min, _max;
 
    static void _FindMin(double &dest, double point) {
        if (point < dest) dest = point;
    }
 
    static void _FindMax(double &dest, double point) {
        if (point > dest) dest = point;
    }
};
 
GF_API std::ostream& operator<<(std::ostream &, GfRange1d const &);
 
PXR_NAMESPACE_CLOSE_SCOPE
#include "pxr/base/gf/range1f.h"
PXR_NAMESPACE_OPEN_SCOPE
 
inline bool
GfRange1d::operator ==(const GfRange1f& other) const {
    return _min == double(other.GetMin()) &&
           _max == double(other.GetMax());
}
 
inline bool
GfRange1d::operator !=(const GfRange1f& other) const {
    return !(*this == other);
}
 
 
PXR_NAMESPACE_CLOSE_SCOPE
 
#endif // PXR_BASE_GF_RANGE1D_H