OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2013 Google Inc. All rights reserved. | 2 * Copyright (C) 2013 Google Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
(...skipping 73 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
84 const WillBeHeapVector<RefPtrWillBeMember<AnimatableValue> >& otherValues =
toAnimatableRepeatable(value)->m_values; | 84 const WillBeHeapVector<RefPtrWillBeMember<AnimatableValue> >& otherValues =
toAnimatableRepeatable(value)->m_values; |
85 if (m_values.size() != otherValues.size()) | 85 if (m_values.size() != otherValues.size()) |
86 return false; | 86 return false; |
87 for (size_t i = 0; i < m_values.size(); ++i) { | 87 for (size_t i = 0; i < m_values.size(); ++i) { |
88 if (!m_values[i]->equals(otherValues[i].get())) | 88 if (!m_values[i]->equals(otherValues[i].get())) |
89 return false; | 89 return false; |
90 } | 90 } |
91 return true; | 91 return true; |
92 } | 92 } |
93 | 93 |
94 void AnimatableRepeatable::trace(Visitor* visitor) | 94 DEFINE_TRACE(AnimatableRepeatable) |
95 { | 95 { |
96 visitor->trace(m_values); | 96 visitor->trace(m_values); |
97 AnimatableValue::trace(visitor); | 97 AnimatableValue::trace(visitor); |
98 } | 98 } |
99 | 99 |
100 } // namespace blink | 100 } // namespace blink |
OLD | NEW |