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
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
|
/*
* Copyright (C) 2008 Apple Inc. 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 APPLE INC. ``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 APPLE INC. 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 SMILTime_h
#define SMILTime_h
#include "wtf/Assertions.h"
#include "wtf/HashTraits.h"
#include "wtf/MathExtras.h"
namespace blink {
class SMILTime {
public:
SMILTime() : m_time(0) { }
SMILTime(double time) : m_time(time) { }
static SMILTime unresolved() { return std::numeric_limits<double>::quiet_NaN(); }
static SMILTime indefinite() { return std::numeric_limits<double>::infinity(); }
double value() const { return m_time; }
bool isFinite() const { return std::isfinite(m_time); }
bool isIndefinite() const { return std::isinf(m_time); }
bool isUnresolved() const { return std::isnan(m_time); }
private:
double m_time;
};
class SMILTimeWithOrigin {
public:
enum Origin {
ParserOrigin,
ScriptOrigin
};
SMILTimeWithOrigin()
: m_origin(ParserOrigin)
{
}
SMILTimeWithOrigin(const SMILTime& time, Origin origin)
: m_time(time)
, m_origin(origin)
{
}
const SMILTime& time() const { return m_time; }
bool originIsScript() const { return m_origin == ScriptOrigin; }
private:
SMILTime m_time;
Origin m_origin;
};
struct SMILInterval {
SMILInterval() { }
SMILInterval(const SMILTime& begin, const SMILTime& end) : begin(begin), end(end) { }
SMILTime begin;
SMILTime end;
};
inline bool operator==(const SMILTime& a, const SMILTime& b) { return (a.isUnresolved() && b.isUnresolved()) || a.value() == b.value(); }
inline bool operator!(const SMILTime& a) { return !a.isFinite() || !a.value(); }
inline bool operator!=(const SMILTime& a, const SMILTime& b) { return !operator==(a, b); }
// Ordering of SMILTimes has to follow: finite < indefinite (Inf) < unresolved (NaN). The first comparison is handled by IEEE754 but
// NaN values must be checked explicitly to guarantee that unresolved is ordered correctly too.
inline bool operator>(const SMILTime& a, const SMILTime& b) { return a.isUnresolved() || (a.value() > b.value()); }
inline bool operator<(const SMILTime& a, const SMILTime& b) { return operator>(b, a); }
inline bool operator>=(const SMILTime& a, const SMILTime& b) { return operator>(a, b) || operator==(a, b); }
inline bool operator<=(const SMILTime& a, const SMILTime& b) { return operator<(a, b) || operator==(a, b); }
inline bool operator<(const SMILTimeWithOrigin& a, const SMILTimeWithOrigin& b) { return a.time() < b.time(); }
inline SMILTime operator+(const SMILTime& a, const SMILTime& b) { return a.value() + b.value(); }
inline SMILTime operator-(const SMILTime& a, const SMILTime& b) { return a.value() - b.value(); }
// So multiplying times does not make too much sense but SMIL defines it for duration * repeatCount
SMILTime operator*(const SMILTime&, const SMILTime&);
inline bool operator!=(const SMILInterval& a, const SMILInterval& b)
{
// Compare the "raw" values since the operator!= for SMILTime always return
// true for non-finite times.
return a.begin.value() != b.begin.value() || a.end.value() != b.end.value();
}
struct SMILTimeHash {
static unsigned hash(const SMILTime& key) { return WTF::FloatHash<double>::hash(key.value()); }
static bool equal(const SMILTime& a, const SMILTime& b) { return WTF::FloatHash<double>::equal(a.value(), b.value()); }
static const bool safeToCompareToEmptyOrDeleted = true;
};
} // namespace blink
namespace WTF {
template<> struct DefaultHash<blink::SMILTime> {
typedef blink::SMILTimeHash Hash;
};
template<> struct HashTraits<blink::SMILTime> : GenericHashTraits<blink::SMILTime> {
static blink::SMILTime emptyValue() { return blink::SMILTime::unresolved(); }
static void constructDeletedValue(blink::SMILTime& slot, bool) { slot = -std::numeric_limits<double>::infinity(); }
static bool isDeletedValue(blink::SMILTime value) { return value == -std::numeric_limits<double>::infinity(); }
};
} // namespace WTF
#endif // SMILTime_h
|
