OLD | NEW |
1 // Copyright 2012 The Chromium Authors. All rights reserved. | 1 // Copyright 2012 The Chromium Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #include "cc/keyframed_animation_curve.h" | 5 #include "cc/keyframed_animation_curve.h" |
6 | 6 |
7 using WebKit::WebTransformationMatrix; | 7 using WebKit::WebTransformationMatrix; |
8 | 8 |
9 namespace cc { | 9 namespace cc { |
10 | 10 |
11 namespace { | 11 namespace { |
12 | 12 |
13 template <class Keyframe> | 13 template <class Keyframe> |
14 void insertKeyframe(scoped_ptr<Keyframe> keyframe, ScopedPtrVector<Keyframe>& ke
yframes) | 14 void insertKeyframe(scoped_ptr<Keyframe> keyframe, ScopedPtrVector<Keyframe>& ke
yframes) |
15 { | 15 { |
16 // Usually, the keyframes will be added in order, so this loop would be unne
cessary and | 16 // Usually, the keyframes will be added in order, so this loop would be unne
cessary and |
17 // we should skip it if possible. | 17 // we should skip it if possible. |
18 if (!keyframes.isEmpty() && keyframe->time() < keyframes.last()->time()) { | 18 if (!keyframes.empty() && keyframe->time() < keyframes.back()->time()) { |
19 for (size_t i = 0; i < keyframes.size(); ++i) { | 19 for (size_t i = 0; i < keyframes.size(); ++i) { |
20 if (keyframe->time() < keyframes[i]->time()) { | 20 if (keyframe->time() < keyframes[i]->time()) { |
21 keyframes.insert(i, keyframe.Pass()); | 21 keyframes.insert(keyframes.begin() + i, keyframe.Pass()); |
22 return; | 22 return; |
23 } | 23 } |
24 } | 24 } |
25 } | 25 } |
26 | 26 |
27 keyframes.append(keyframe.Pass()); | 27 keyframes.push_back(keyframe.Pass()); |
28 } | 28 } |
29 | 29 |
30 scoped_ptr<TimingFunction> cloneTimingFunction(const TimingFunction* timingFunct
ion) | 30 scoped_ptr<TimingFunction> cloneTimingFunction(const TimingFunction* timingFunct
ion) |
31 { | 31 { |
32 DCHECK(timingFunction); | 32 DCHECK(timingFunction); |
33 scoped_ptr<AnimationCurve> curve(timingFunction->clone()); | 33 scoped_ptr<AnimationCurve> curve(timingFunction->clone()); |
34 return scoped_ptr<TimingFunction>(static_cast<TimingFunction*>(curve.release
())); | 34 return scoped_ptr<TimingFunction>(static_cast<TimingFunction*>(curve.release
())); |
35 } | 35 } |
36 | 36 |
37 } // namespace | 37 } // namespace |
(...skipping 87 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
125 { | 125 { |
126 } | 126 } |
127 | 127 |
128 void KeyframedFloatAnimationCurve::addKeyframe(scoped_ptr<FloatKeyframe> keyfram
e) | 128 void KeyframedFloatAnimationCurve::addKeyframe(scoped_ptr<FloatKeyframe> keyfram
e) |
129 { | 129 { |
130 insertKeyframe(keyframe.Pass(), m_keyframes); | 130 insertKeyframe(keyframe.Pass(), m_keyframes); |
131 } | 131 } |
132 | 132 |
133 double KeyframedFloatAnimationCurve::duration() const | 133 double KeyframedFloatAnimationCurve::duration() const |
134 { | 134 { |
135 return m_keyframes.last()->time() - m_keyframes.first()->time(); | 135 return m_keyframes.back()->time() - m_keyframes.front()->time(); |
136 } | 136 } |
137 | 137 |
138 scoped_ptr<AnimationCurve> KeyframedFloatAnimationCurve::clone() const | 138 scoped_ptr<AnimationCurve> KeyframedFloatAnimationCurve::clone() const |
139 { | 139 { |
140 scoped_ptr<KeyframedFloatAnimationCurve> toReturn(KeyframedFloatAnimationCur
ve::create()); | 140 scoped_ptr<KeyframedFloatAnimationCurve> toReturn(KeyframedFloatAnimationCur
ve::create()); |
141 for (size_t i = 0; i < m_keyframes.size(); ++i) | 141 for (size_t i = 0; i < m_keyframes.size(); ++i) |
142 toReturn->addKeyframe(m_keyframes[i]->clone()); | 142 toReturn->addKeyframe(m_keyframes[i]->clone()); |
143 return toReturn.PassAs<AnimationCurve>(); | 143 return toReturn.PassAs<AnimationCurve>(); |
144 } | 144 } |
145 | 145 |
146 float KeyframedFloatAnimationCurve::getValue(double t) const | 146 float KeyframedFloatAnimationCurve::getValue(double t) const |
147 { | 147 { |
148 if (t <= m_keyframes.first()->time()) | 148 if (t <= m_keyframes.front()->time()) |
149 return m_keyframes.first()->value(); | 149 return m_keyframes.front()->value(); |
150 | 150 |
151 if (t >= m_keyframes.last()->time()) | 151 if (t >= m_keyframes.back()->time()) |
152 return m_keyframes.last()->value(); | 152 return m_keyframes.back()->value(); |
153 | 153 |
154 size_t i = 0; | 154 size_t i = 0; |
155 for (; i < m_keyframes.size() - 1; ++i) { | 155 for (; i < m_keyframes.size() - 1; ++i) { |
156 if (t < m_keyframes[i+1]->time()) | 156 if (t < m_keyframes[i+1]->time()) |
157 break; | 157 break; |
158 } | 158 } |
159 | 159 |
160 float progress = static_cast<float>((t - m_keyframes[i]->time()) / (m_keyfra
mes[i+1]->time() - m_keyframes[i]->time())); | 160 float progress = static_cast<float>((t - m_keyframes[i]->time()) / (m_keyfra
mes[i+1]->time() - m_keyframes[i]->time())); |
161 | 161 |
162 if (m_keyframes[i]->timingFunction()) | 162 if (m_keyframes[i]->timingFunction()) |
(...skipping 15 matching lines...) Expand all Loading... |
178 { | 178 { |
179 } | 179 } |
180 | 180 |
181 void KeyframedTransformAnimationCurve::addKeyframe(scoped_ptr<TransformKeyframe>
keyframe) | 181 void KeyframedTransformAnimationCurve::addKeyframe(scoped_ptr<TransformKeyframe>
keyframe) |
182 { | 182 { |
183 insertKeyframe(keyframe.Pass(), m_keyframes); | 183 insertKeyframe(keyframe.Pass(), m_keyframes); |
184 } | 184 } |
185 | 185 |
186 double KeyframedTransformAnimationCurve::duration() const | 186 double KeyframedTransformAnimationCurve::duration() const |
187 { | 187 { |
188 return m_keyframes.last()->time() - m_keyframes.first()->time(); | 188 return m_keyframes.back()->time() - m_keyframes.front()->time(); |
189 } | 189 } |
190 | 190 |
191 scoped_ptr<AnimationCurve> KeyframedTransformAnimationCurve::clone() const | 191 scoped_ptr<AnimationCurve> KeyframedTransformAnimationCurve::clone() const |
192 { | 192 { |
193 scoped_ptr<KeyframedTransformAnimationCurve> toReturn(KeyframedTransformAnim
ationCurve::create()); | 193 scoped_ptr<KeyframedTransformAnimationCurve> toReturn(KeyframedTransformAnim
ationCurve::create()); |
194 for (size_t i = 0; i < m_keyframes.size(); ++i) | 194 for (size_t i = 0; i < m_keyframes.size(); ++i) |
195 toReturn->addKeyframe(m_keyframes[i]->clone()); | 195 toReturn->addKeyframe(m_keyframes[i]->clone()); |
196 return toReturn.PassAs<AnimationCurve>(); | 196 return toReturn.PassAs<AnimationCurve>(); |
197 } | 197 } |
198 | 198 |
199 WebTransformationMatrix KeyframedTransformAnimationCurve::getValue(double t) con
st | 199 WebTransformationMatrix KeyframedTransformAnimationCurve::getValue(double t) con
st |
200 { | 200 { |
201 if (t <= m_keyframes.first()->time()) | 201 if (t <= m_keyframes.front()->time()) |
202 return m_keyframes.first()->value().apply(); | 202 return m_keyframes.front()->value().apply(); |
203 | 203 |
204 if (t >= m_keyframes.last()->time()) | 204 if (t >= m_keyframes.back()->time()) |
205 return m_keyframes.last()->value().apply(); | 205 return m_keyframes.back()->value().apply(); |
206 | 206 |
207 size_t i = 0; | 207 size_t i = 0; |
208 for (; i < m_keyframes.size() - 1; ++i) { | 208 for (; i < m_keyframes.size() - 1; ++i) { |
209 if (t < m_keyframes[i+1]->time()) | 209 if (t < m_keyframes[i+1]->time()) |
210 break; | 210 break; |
211 } | 211 } |
212 | 212 |
213 double progress = (t - m_keyframes[i]->time()) / (m_keyframes[i+1]->time() -
m_keyframes[i]->time()); | 213 double progress = (t - m_keyframes[i]->time()) / (m_keyframes[i+1]->time() -
m_keyframes[i]->time()); |
214 | 214 |
215 if (m_keyframes[i]->timingFunction()) | 215 if (m_keyframes[i]->timingFunction()) |
216 progress = m_keyframes[i]->timingFunction()->getValue(progress); | 216 progress = m_keyframes[i]->timingFunction()->getValue(progress); |
217 | 217 |
218 return m_keyframes[i+1]->value().blend(m_keyframes[i]->value(), progress); | 218 return m_keyframes[i+1]->value().blend(m_keyframes[i]->value(), progress); |
219 } | 219 } |
220 | 220 |
221 } // namespace cc | 221 } // namespace cc |
OLD | NEW |