Chromium Code Reviews| OLD | NEW |
|---|---|
| (Empty) | |
| 1 /* | |
| 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 | |
| 34 namespace { | |
| 35 | |
| 36 size_t greatestCommonDenominator(size_t a, size_t b) | |
|
dstockwell
2013/10/09 23:15:07
denominator -> divisor?
alancutter (OOO until 2018)
2013/10/10 00:58:38
Done.
| |
| 37 { | |
| 38 return b ? greatestCommonDenominator(b, a % b) : a; | |
| 39 } | |
| 40 | |
| 41 size_t lowestCommonMultiplier(size_t a, size_t b) | |
|
dstockwell
2013/10/09 23:15:07
multiplier -> multiple?
alancutter (OOO until 2018)
2013/10/10 00:58:38
Done.
| |
| 42 { | |
| 43 if (!a && !b) | |
| 44 return 0; | |
|
Steve Block
2013/10/09 23:19:05
I think that handling of the case where one or bot
alancutter (OOO until 2018)
2013/10/10 00:58:38
Done.
| |
| 45 return a / greatestCommonDenominator(a, b) * b; | |
| 46 } | |
| 47 | |
| 48 } | |
|
Steve Block
2013/10/09 23:19:05
// namespace
alancutter (OOO until 2018)
2013/10/10 00:58:38
Done.
| |
| 49 | |
| 50 namespace WebCore { | |
| 51 | |
| 52 PassRefPtr<AnimatableValue> AnimatableRepeatable::interpolateTo(const Animatable Value* value, double fraction) const | |
| 53 { | |
| 54 // Interpolation behaviour spec: http://www.w3.org/TR/css3-transitions/#anim type-repeatable-list | |
| 55 const Vector<RefPtr<AnimatableValue> >& otherValues = toAnimatableRepeatable (value)->m_values; | |
| 56 Vector<RefPtr<AnimatableValue> > interpolatedValues(lowestCommonMultiplier(m _values.size(), otherValues.size())); | |
| 57 for (size_t i = 0; i < interpolatedValues.size(); ++i) { | |
| 58 const AnimatableValue* from = m_values[i % m_values.size()].get(); | |
| 59 const AnimatableValue* to = otherValues[i % otherValues.size()].get(); | |
| 60 if (!from->isSameType(to)) | |
|
dstockwell
2013/10/09 23:15:07
comment here would still help
alancutter (OOO until 2018)
2013/10/10 00:58:38
Done.
| |
| 61 return defaultInterpolateTo(this, value, fraction); | |
| 62 interpolatedValues[i] = interpolate(from, to, fraction); | |
| 63 } | |
| 64 return create(interpolatedValues); | |
| 65 } | |
| 66 | |
| 67 PassRefPtr<AnimatableValue> AnimatableRepeatable::addWith(const AnimatableValue* value) const | |
| 68 { | |
| 69 const Vector<RefPtr<AnimatableValue> >& otherValues = toAnimatableRepeatable (value)->m_values; | |
| 70 Vector<RefPtr<AnimatableValue> > addedValues(lowestCommonMultiplier(m_values .size(), otherValues.size())); | |
| 71 for (size_t i = 0; i < addedValues.size(); ++i) { | |
| 72 const AnimatableValue* left = m_values[i % m_values.size()].get(); | |
| 73 const AnimatableValue* right = otherValues[i % otherValues.size()].get() ; | |
| 74 if (!left->isSameType(right)) | |
| 75 return defaultAddWith(this, value); | |
| 76 addedValues[i] = add(left, right); | |
| 77 } | |
| 78 return create(addedValues); | |
| 79 } | |
| 80 | |
| 81 bool AnimatableRepeatable::equalTo(const AnimatableValue* value) const | |
| 82 { | |
| 83 const Vector<RefPtr<AnimatableValue> >& otherValues = toAnimatableRepeatable (value)->m_values; | |
| 84 if (m_values.size() != otherValues.size()) | |
| 85 return false; | |
| 86 for (size_t i = 0; i < m_values.size(); ++i) { | |
| 87 if (!m_values[i]->equals(otherValues[i].get())) | |
| 88 return false; | |
| 89 } | |
| 90 return true; | |
| 91 } | |
| 92 | |
| 93 } // namespace WebCore | |
| OLD | NEW |