1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
|
/*
* Copyright (C) 2005-2022 Centre National d'Etudes Spatiales (CNES)
*
* This file is part of Orfeo Toolbox
*
* https://www.orfeo-toolbox.org/
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#ifndef otbInterval_h
#define otbInterval_h
#include "itkIntTypes.h"
#include <algorithm>
#include <cassert>
#include <ostream>
namespace otb
{
/** Simplified index interval.
* Inspired by `boost::numeric::interval`.
*
* \invariant Can be empty.
* \invariant lower <= upper
* \author Luc Hermitte (CS Group)
* \copyright CNES
* \ingroup OTBCommon
*/
class Interval
{
public:
using IndexType = itk::IndexValueType;
using SizeType = itk::SizeValueType;
/** Init constructor from the pair of its extremities. */
constexpr Interval(IndexType l, IndexType u) noexcept
: m_lower(l), m_upper(u)
{
#if defined(__cpp_constexpr) && __cpp_constexpr >= 201304
assert(l <= u);
#endif
}
/** Alternate factory function from a position and a length. */
static constexpr Interval OfLength(IndexType low, SizeType len) noexcept{
return Interval{low, IndexType(low+len)};
}
constexpr SizeType size() const noexcept
{ return m_upper - m_lower; }
constexpr bool empty() const noexcept
{ return m_lower == m_upper; }
constexpr IndexType lower() const noexcept
{ return m_lower; }
constexpr IndexType upper() const noexcept
{ return m_upper; }
/** Computes the intersection between two intervals.
* @return their intersection
* @return {0,0} if they don't intersect.
*
* @note this function is an hidden friend
*/
friend constexpr Interval intersect(
Interval const& lhs, Interval const& rhs) noexcept
{
#if defined(__cpp_constexpr) && __cpp_constexpr >= 201304
auto const low = std::max(lhs.lower(), rhs.lower());
auto const upp = std::min(lhs.upper(), rhs.upper());
return low <= upp ? Interval{low, upp} : Interval{0,0};
#else
// MSVC version supported is not C++14 compliant
return std::max(lhs.lower(), rhs.lower()) <= std::min(lhs.upper(), rhs.upper())
? Interval{std::max(lhs.lower(), rhs.lower()), std::min(lhs.upper(), rhs.upper())}
: Interval{0,0};
#endif
}
/** Stream inserter for intervals.
* @note this function is an hidden friend
*/
friend std::ostream & operator<<(std::ostream & os, Interval const& v)
{
return os << '[' << v.lower() << ".." << v.upper() << '[';
}
private:
IndexType m_lower;
IndexType m_upper;
};
} // otb namespace
#endif // otbInterval_h
|
