OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2011 Apple Inc. All rights reserved. | 2 * Copyright (C) 2011 Apple 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 | 5 * modification, are permitted provided that the following conditions |
6 * are met: | 6 * are met: |
7 * 1. Redistributions of source code must retain the above copyright | 7 * 1. Redistributions of source code must retain the above copyright |
8 * notice, this list of conditions and the following disclaimer. | 8 * notice, this list of conditions and the following disclaimer. |
9 * 2. Redistributions in binary form must reproduce the above copyright | 9 * 2. Redistributions in binary form must reproduce the above copyright |
10 * notice, this list of conditions and the following disclaimer in the | 10 * notice, this list of conditions and the following disclaimer in the |
(...skipping 41 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
52 bool operator!=(const FilterOperations& o) const | 52 bool operator!=(const FilterOperations& o) const |
53 { | 53 { |
54 return !(*this == o); | 54 return !(*this == o); |
55 } | 55 } |
56 | 56 |
57 void clear() | 57 void clear() |
58 { | 58 { |
59 m_operations.clear(); | 59 m_operations.clear(); |
60 } | 60 } |
61 | 61 |
62 typedef WillBeHeapVector<RefPtrWillBeMember<FilterOperation> > FilterOperati
onVector; | 62 typedef WillBeHeapVector<RefPtrWillBeMember<FilterOperation>> FilterOperatio
nVector; |
63 | 63 |
64 FilterOperationVector& operations() { return m_operations; } | 64 FilterOperationVector& operations() { return m_operations; } |
65 const FilterOperationVector& operations() const { return m_operations; } | 65 const FilterOperationVector& operations() const { return m_operations; } |
66 | 66 |
67 bool isEmpty() const { return !m_operations.size(); } | 67 bool isEmpty() const { return !m_operations.size(); } |
68 size_t size() const { return m_operations.size(); } | 68 size_t size() const { return m_operations.size(); } |
69 const FilterOperation* at(size_t index) const { return index < m_operations.
size() ? m_operations.at(index).get() : 0; } | 69 const FilterOperation* at(size_t index) const { return index < m_operations.
size() ? m_operations.at(index).get() : 0; } |
70 | 70 |
71 bool canInterpolateWith(const FilterOperations&) const; | 71 bool canInterpolateWith(const FilterOperations&) const; |
72 | 72 |
(...skipping 30 matching lines...) Expand all Loading... |
103 } | 103 } |
104 | 104 |
105 FilterOperations m_operations; | 105 FilterOperations m_operations; |
106 }; | 106 }; |
107 #endif | 107 #endif |
108 | 108 |
109 } // namespace blink | 109 } // namespace blink |
110 | 110 |
111 | 111 |
112 #endif // FilterOperations_h | 112 #endif // FilterOperations_h |
OLD | NEW |