| OLD | NEW |
| 1 /* | 1 /* |
| 2 * (C) 1999-2003 Lars Knoll (knoll@kde.org) | 2 * (C) 1999-2003 Lars Knoll (knoll@kde.org) |
| 3 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010 Apple Inc. All rights
reserved. | 3 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010 Apple Inc. All rights
reserved. |
| 4 * | 4 * |
| 5 * This library is free software; you can redistribute it and/or | 5 * This library is free software; you can redistribute it and/or |
| 6 * modify it under the terms of the GNU Library General Public | 6 * modify it under the terms of the GNU Library General Public |
| 7 * License as published by the Free Software Foundation; either | 7 * License as published by the Free Software Foundation; either |
| 8 * version 2 of the License, or (at your option) any later version. | 8 * version 2 of the License, or (at your option) any later version. |
| 9 * | 9 * |
| 10 * This library is distributed in the hope that it will be useful, | 10 * This library is distributed in the hope that it will be useful, |
| (...skipping 36 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 47 const CSSValue* item(size_t index) const { return m_values[index].get(); } | 47 const CSSValue* item(size_t index) const { return m_values[index].get(); } |
| 48 CSSValue* itemWithBoundsCheck(size_t index) { return index < m_values.size()
? m_values[index].get() : 0; } | 48 CSSValue* itemWithBoundsCheck(size_t index) { return index < m_values.size()
? m_values[index].get() : 0; } |
| 49 const CSSValue* itemWithBoundsCheck(size_t index) const { return index < m_v
alues.size() ? m_values[index].get() : 0; } | 49 const CSSValue* itemWithBoundsCheck(size_t index) const { return index < m_v
alues.size() ? m_values[index].get() : 0; } |
| 50 | 50 |
| 51 void append(PassRefPtrWillBeRawPtr<CSSValue> value) { m_values.append(value)
; } | 51 void append(PassRefPtrWillBeRawPtr<CSSValue> value) { m_values.append(value)
; } |
| 52 void prepend(PassRefPtrWillBeRawPtr<CSSValue> value) { m_values.prepend(valu
e); } | 52 void prepend(PassRefPtrWillBeRawPtr<CSSValue> value) { m_values.prepend(valu
e); } |
| 53 bool removeAll(CSSValue*); | 53 bool removeAll(CSSValue*); |
| 54 bool hasValue(CSSValue*) const; | 54 bool hasValue(CSSValue*) const; |
| 55 PassRefPtrWillBeRawPtr<CSSValueList> copy(); | 55 PassRefPtrWillBeRawPtr<CSSValueList> copy(); |
| 56 | 56 |
| 57 String customCSSText(CSSTextFormattingFlags = QuoteCSSStringIfNeeded) const; | 57 String customCSSText() const; |
| 58 bool equals(const CSSValueList&) const; | 58 bool equals(const CSSValueList&) const; |
| 59 bool equals(const CSSValue&) const; | 59 bool equals(const CSSValue&) const; |
| 60 | 60 |
| 61 bool hasFailedOrCanceledSubresources() const; | 61 bool hasFailedOrCanceledSubresources() const; |
| 62 | 62 |
| 63 DECLARE_TRACE_AFTER_DISPATCH(); | 63 DECLARE_TRACE_AFTER_DISPATCH(); |
| 64 | 64 |
| 65 protected: | 65 protected: |
| 66 CSSValueList(ClassType, ValueListSeparator); | 66 CSSValueList(ClassType, ValueListSeparator); |
| 67 | 67 |
| (...skipping 17 matching lines...) Expand all Loading... |
| 85 void advance() { m_position++; ASSERT(m_position <= m_list->length());} | 85 void advance() { m_position++; ASSERT(m_position <= m_list->length());} |
| 86 size_t index() const { return m_position; } | 86 size_t index() const { return m_position; } |
| 87 private: | 87 private: |
| 88 RawPtrWillBeMember<CSSValueList> m_list; | 88 RawPtrWillBeMember<CSSValueList> m_list; |
| 89 size_t m_position; | 89 size_t m_position; |
| 90 }; | 90 }; |
| 91 | 91 |
| 92 } // namespace blink | 92 } // namespace blink |
| 93 | 93 |
| 94 #endif // CSSValueList_h | 94 #endif // CSSValueList_h |
| OLD | NEW |