| 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 11 matching lines...) Expand all Loading... |
| 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 29 */ | 29 */ |
| 30 | 30 |
| 31 #include "config.h" | 31 #include "config.h" |
| 32 #include "core/animation/AnimatableShadow.h" | 32 #include "core/animation/animatable/AnimatableShadow.h" |
| 33 | 33 |
| 34 namespace WebCore { | 34 namespace WebCore { |
| 35 | 35 |
| 36 PassRefPtrWillBeRawPtr<AnimatableValue> AnimatableShadow::interpolateTo(const An
imatableValue* value, double fraction) const | 36 PassRefPtrWillBeRawPtr<AnimatableValue> AnimatableShadow::interpolateTo(const An
imatableValue* value, double fraction) const |
| 37 { | 37 { |
| 38 const AnimatableShadow* shadowList = toAnimatableShadow(value); | 38 const AnimatableShadow* shadowList = toAnimatableShadow(value); |
| 39 return AnimatableShadow::create(ShadowList::blend(m_shadowList.get(), shadow
List->m_shadowList.get(), fraction)); | 39 return AnimatableShadow::create(ShadowList::blend(m_shadowList.get(), shadow
List->m_shadowList.get(), fraction)); |
| 40 } | 40 } |
| 41 | 41 |
| 42 bool AnimatableShadow::equalTo(const AnimatableValue* value) const | 42 bool AnimatableShadow::equalTo(const AnimatableValue* value) const |
| 43 { | 43 { |
| 44 const ShadowList* shadowList = toAnimatableShadow(value)->m_shadowList.get()
; | 44 const ShadowList* shadowList = toAnimatableShadow(value)->m_shadowList.get()
; |
| 45 return m_shadowList == shadowList || (m_shadowList && shadowList && *m_shado
wList == *shadowList); | 45 return m_shadowList == shadowList || (m_shadowList && shadowList && *m_shado
wList == *shadowList); |
| 46 } | 46 } |
| 47 | 47 |
| 48 } // namespace WebCore | 48 } // namespace WebCore |
| OLD | NEW |