blob: 2c2f63e4e8bfad05cf7eda4aa05068c0beb1af5e [file] [log] [blame]
Torne (Richard Coles)1e202182013-10-18 15:46:42 +01001/*
2 * Copyright (C) 2013 Google Inc. All rights reserved.
3 *
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions are
6 * met:
7 *
8 * * Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * * Redistributions in binary form must reproduce the above
11 * copyright notice, this list of conditions and the following disclaimer
12 * in the documentation and/or other materials provided with the
13 * distribution.
14 * * Neither the name of Google Inc. nor the names of its
15 * contributors may be used to endorse or promote products derived from
16 * this software without specific prior written permission.
17 *
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29 */
30
31#include "config.h"
32#include "core/animation/AnimatableRepeatable.h"
33
Torne (Richard Coles)d6cdb822014-06-03 10:59:05 +010034#include "wtf/MathExtras.h"
Torne (Richard Coles)1e202182013-10-18 15:46:42 +010035
36namespace WebCore {
37
Torne (Richard Coles)09380292014-02-21 12:17:33 +000038bool AnimatableRepeatable::usesDefaultInterpolationWith(const AnimatableValue* value) const
39{
Ben Murdoch07a852d2014-03-31 11:51:52 +010040 const WillBeHeapVector<RefPtrWillBeMember<AnimatableValue> >& fromValues = m_values;
41 const WillBeHeapVector<RefPtrWillBeMember<AnimatableValue> >& toValues = toAnimatableRepeatable(value)->m_values;
Torne (Richard Coles)09380292014-02-21 12:17:33 +000042 ASSERT(!fromValues.isEmpty() && !toValues.isEmpty());
43 size_t size = lowestCommonMultiple(fromValues.size(), toValues.size());
Torne (Richard Coles)d6cdb822014-06-03 10:59:05 +010044 ASSERT(size > 0);
Torne (Richard Coles)09380292014-02-21 12:17:33 +000045 for (size_t i = 0; i < size; ++i) {
46 const AnimatableValue* from = fromValues[i % fromValues.size()].get();
47 const AnimatableValue* to = toValues[i % toValues.size()].get();
48 // Spec: If a pair of values cannot be interpolated, then the lists are not interpolable.
49 if (AnimatableValue::usesDefaultInterpolation(from, to))
50 return true;
51 }
52 return false;
53}
54
Ben Murdoch07a852d2014-03-31 11:51:52 +010055bool AnimatableRepeatable::interpolateLists(const WillBeHeapVector<RefPtrWillBeMember<AnimatableValue> >& fromValues, const WillBeHeapVector<RefPtrWillBeMember<AnimatableValue> >& toValues, double fraction, WillBeHeapVector<RefPtrWillBeMember<AnimatableValue> >& interpolatedValues)
Torne (Richard Coles)1e202182013-10-18 15:46:42 +010056{
57 // Interpolation behaviour spec: http://www.w3.org/TR/css3-transitions/#animtype-repeatable-list
58 ASSERT(interpolatedValues.isEmpty());
59 ASSERT(!fromValues.isEmpty() && !toValues.isEmpty());
60 size_t size = lowestCommonMultiple(fromValues.size(), toValues.size());
Torne (Richard Coles)d6cdb822014-06-03 10:59:05 +010061 ASSERT(size > 0);
Torne (Richard Coles)1e202182013-10-18 15:46:42 +010062 for (size_t i = 0; i < size; ++i) {
63 const AnimatableValue* from = fromValues[i % fromValues.size()].get();
64 const AnimatableValue* to = toValues[i % toValues.size()].get();
65 // Spec: If a pair of values cannot be interpolated, then the lists are not interpolable.
Torne (Richard Coles)09380292014-02-21 12:17:33 +000066 if (AnimatableValue::usesDefaultInterpolation(from, to))
Torne (Richard Coles)1e202182013-10-18 15:46:42 +010067 return false;
68 interpolatedValues.append(interpolate(from, to, fraction));
69 }
70 return true;
71}
72
Ben Murdoch07a852d2014-03-31 11:51:52 +010073PassRefPtrWillBeRawPtr<AnimatableValue> AnimatableRepeatable::interpolateTo(const AnimatableValue* value, double fraction) const
Torne (Richard Coles)1e202182013-10-18 15:46:42 +010074{
Ben Murdoch07a852d2014-03-31 11:51:52 +010075 WillBeHeapVector<RefPtrWillBeMember<AnimatableValue> > interpolatedValues;
Torne (Richard Coles)1e202182013-10-18 15:46:42 +010076 bool success = interpolateLists(m_values, toAnimatableRepeatable(value)->m_values, fraction, interpolatedValues);
Ben Murdoch07a852d2014-03-31 11:51:52 +010077 if (success)
78 return create(interpolatedValues);
79 return defaultInterpolateTo(this, value, fraction);
Torne (Richard Coles)1e202182013-10-18 15:46:42 +010080}
81
Torne (Richard Coles)1e202182013-10-18 15:46:42 +010082bool AnimatableRepeatable::equalTo(const AnimatableValue* value) const
83{
Ben Murdoch07a852d2014-03-31 11:51:52 +010084 const WillBeHeapVector<RefPtrWillBeMember<AnimatableValue> >& otherValues = toAnimatableRepeatable(value)->m_values;
Torne (Richard Coles)1e202182013-10-18 15:46:42 +010085 if (m_values.size() != otherValues.size())
86 return false;
87 for (size_t i = 0; i < m_values.size(); ++i) {
88 if (!m_values[i]->equals(otherValues[i].get()))
89 return false;
90 }
91 return true;
92}
93
Ben Murdoch07a852d2014-03-31 11:51:52 +010094void AnimatableRepeatable::trace(Visitor* visitor)
95{
96 visitor->trace(m_values);
Torne (Richard Coles)32348042014-05-14 12:12:57 +010097 AnimatableValue::trace(visitor);
Ben Murdoch07a852d2014-03-31 11:51:52 +010098}
99
Torne (Richard Coles)1e202182013-10-18 15:46:42 +0100100} // namespace WebCore