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
|
/*
* Copyright (C) 2012 Adobe Systems Incorporated. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above
* copyright notice, this list of conditions and the following
* disclaimer.
* 2. Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials
* provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
* INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
* OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef ShapeInterval_h
#define ShapeInterval_h
#include "wtf/Vector.h"
namespace blink {
template <typename T>
class ShapeInterval {
USING_FAST_MALLOC(ShapeInterval);
public:
ShapeInterval() : m_x1(-1), m_x2(-2) {
// The initial values of m_x1,x2 don't matter (unless you're looking
// at them in the debugger) so long as isUndefined() is true.
ASSERT(isUndefined());
}
ShapeInterval(T x1, T x2) : m_x1(x1), m_x2(x2) { ASSERT(x2 >= x1); }
bool isUndefined() const { return m_x2 < m_x1; }
T x1() const { return isUndefined() ? 0 : m_x1; }
T x2() const { return isUndefined() ? 0 : m_x2; }
T width() const { return isUndefined() ? 0 : m_x2 - m_x1; }
bool isEmpty() const { return isUndefined() ? true : m_x1 == m_x2; }
void set(T x1, T x2) {
ASSERT(x2 >= x1);
m_x1 = x1;
m_x2 = x2;
}
bool overlaps(const ShapeInterval<T>& interval) const {
if (isUndefined() || interval.isUndefined())
return false;
return x2() >= interval.x1() && x1() <= interval.x2();
}
bool contains(const ShapeInterval<T>& interval) const {
if (isUndefined() || interval.isUndefined())
return false;
return x1() <= interval.x1() && x2() >= interval.x2();
}
bool operator==(const ShapeInterval<T>& other) const {
return x1() == other.x1() && x2() == other.x2();
}
bool operator!=(const ShapeInterval<T>& other) const {
return !operator==(other);
}
void unite(const ShapeInterval<T>& interval) {
if (interval.isUndefined())
return;
if (isUndefined())
set(interval.x1(), interval.x2());
else
set(std::min<T>(x1(), interval.x1()), std::max<T>(x2(), interval.x2()));
}
private:
T m_x1;
T m_x2;
};
typedef ShapeInterval<int> IntShapeInterval;
typedef ShapeInterval<float> FloatShapeInterval;
typedef Vector<IntShapeInterval> IntShapeIntervals;
typedef Vector<FloatShapeInterval> FloatShapeIntervals;
} // namespace blink
#endif // ShapeInterval_h
|
