| 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/AnimatableClipPathOperation.h" | 32 #include "core/animation/animatable/AnimatableClipPathOperation.h" |
| 33 | 33 |
| 34 namespace WebCore { | 34 namespace WebCore { |
| 35 | 35 |
| 36 bool AnimatableClipPathOperation::usesDefaultInterpolationWith(const AnimatableV
alue* value) const | 36 bool AnimatableClipPathOperation::usesDefaultInterpolationWith(const AnimatableV
alue* value) const |
| 37 { | 37 { |
| 38 const AnimatableClipPathOperation* toOperation = toAnimatableClipPathOperati
on(value); | 38 const AnimatableClipPathOperation* toOperation = toAnimatableClipPathOperati
on(value); |
| 39 | 39 |
| 40 if (m_operation->type() != ClipPathOperation::SHAPE || toOperation->m_operat
ion->type() != ClipPathOperation::SHAPE) | 40 if (m_operation->type() != ClipPathOperation::SHAPE || toOperation->m_operat
ion->type() != ClipPathOperation::SHAPE) |
| 41 return true; | 41 return true; |
| 42 | 42 |
| (...skipping 15 matching lines...) Expand all Loading... |
| 58 return AnimatableClipPathOperation::create(ShapeClipPathOperation::create(to
Shape->blend(fromShape, fraction)).get()); | 58 return AnimatableClipPathOperation::create(ShapeClipPathOperation::create(to
Shape->blend(fromShape, fraction)).get()); |
| 59 } | 59 } |
| 60 | 60 |
| 61 bool AnimatableClipPathOperation::equalTo(const AnimatableValue* value) const | 61 bool AnimatableClipPathOperation::equalTo(const AnimatableValue* value) const |
| 62 { | 62 { |
| 63 const ClipPathOperation* operation = toAnimatableClipPathOperation(value)->m
_operation.get(); | 63 const ClipPathOperation* operation = toAnimatableClipPathOperation(value)->m
_operation.get(); |
| 64 return m_operation == operation || (m_operation && operation && *m_operation
== *operation); | 64 return m_operation == operation || (m_operation && operation && *m_operation
== *operation); |
| 65 } | 65 } |
| 66 | 66 |
| 67 } | 67 } |
| OLD | NEW |