OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2000 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 2000 Lars Knoll (knoll@kde.org) |
3 * (C) 2000 Antti Koivisto (koivisto@kde.org) | 3 * (C) 2000 Antti Koivisto (koivisto@kde.org) |
4 * (C) 2000 Dirk Mueller (mueller@kde.org) | 4 * (C) 2000 Dirk Mueller (mueller@kde.org) |
5 * Copyright (C) 2003, 2005, 2006, 2007, 2008 Apple Inc. All rights reserved. | 5 * Copyright (C) 2003, 2005, 2006, 2007, 2008 Apple Inc. All rights reserved. |
6 * Copyright (C) 2006 Graham Dennis (graham.dennis@gmail.com) | 6 * Copyright (C) 2006 Graham Dennis (graham.dennis@gmail.com) |
7 * | 7 * |
8 * This library is free software; you can redistribute it and/or | 8 * This library is free software; you can redistribute it and/or |
9 * modify it under the terms of the GNU Library General Public | 9 * modify it under the terms of the GNU Library General Public |
10 * License as published by the Free Software Foundation; either | 10 * License as published by the Free Software Foundation; either |
(...skipping 57 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
68 return false; | 68 return false; |
69 } | 69 } |
70 | 70 |
71 bool operationsMatch(const TransformOperations&) const; | 71 bool operationsMatch(const TransformOperations&) const; |
72 | 72 |
73 void clear() | 73 void clear() |
74 { | 74 { |
75 m_operations.clear(); | 75 m_operations.clear(); |
76 } | 76 } |
77 | 77 |
78 Vector<RefPtr<TransformOperation> >& operations() { return m_operations; } | 78 Vector<RefPtr<TransformOperation>>& operations() { return m_operations; } |
79 const Vector<RefPtr<TransformOperation> >& operations() const { return m_ope
rations; } | 79 const Vector<RefPtr<TransformOperation>>& operations() const { return m_oper
ations; } |
80 | 80 |
81 size_t size() const { return m_operations.size(); } | 81 size_t size() const { return m_operations.size(); } |
82 const TransformOperation* at(size_t index) const { return index < m_operatio
ns.size() ? m_operations.at(index).get() : 0; } | 82 const TransformOperation* at(size_t index) const { return index < m_operatio
ns.size() ? m_operations.at(index).get() : 0; } |
83 | 83 |
84 bool blendedBoundsForBox(const FloatBox&, const TransformOperations& from, c
onst double& minProgress, const double& maxProgress, FloatBox* bounds) const; | 84 bool blendedBoundsForBox(const FloatBox&, const TransformOperations& from, c
onst double& minProgress, const double& maxProgress, FloatBox* bounds) const; |
85 TransformOperations blendByMatchingOperations(const TransformOperations& fro
m, const double& progress) const; | 85 TransformOperations blendByMatchingOperations(const TransformOperations& fro
m, const double& progress) const; |
86 TransformOperations blendByUsingMatrixInterpolation(const TransformOperation
s& from, double progress) const; | 86 TransformOperations blendByUsingMatrixInterpolation(const TransformOperation
s& from, double progress) const; |
87 TransformOperations blend(const TransformOperations& from, double progress)
const; | 87 TransformOperations blend(const TransformOperations& from, double progress)
const; |
88 TransformOperations add(const TransformOperations& addend) const; | 88 TransformOperations add(const TransformOperations& addend) const; |
89 | 89 |
90 private: | 90 private: |
91 Vector<RefPtr<TransformOperation> > m_operations; | 91 Vector<RefPtr<TransformOperation>> m_operations; |
92 }; | 92 }; |
93 | 93 |
94 } // namespace blink | 94 } // namespace blink |
95 | 95 |
96 #endif // TransformOperations_h | 96 #endif // TransformOperations_h |
OLD | NEW |