| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 1999-2003 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999-2003 Lars Knoll (knoll@kde.org) |
| 3 * 1999 Waldo Bastian (bastian@kde.org) | 3 * 1999 Waldo Bastian (bastian@kde.org) |
| 4 * Copyright (C) 2004, 2006, 2007, 2008, 2009, 2010, 2013 Apple Inc. All rights
reserved. | 4 * Copyright (C) 2004, 2006, 2007, 2008, 2009, 2010, 2013 Apple Inc. All rights
reserved. |
| 5 * | 5 * |
| 6 * This library is free software; you can redistribute it and/or | 6 * This library is free software; you can redistribute it and/or |
| 7 * modify it under the terms of the GNU Library General Public | 7 * modify it under the terms of the GNU Library General Public |
| 8 * License as published by the Free Software Foundation; either | 8 * License as published by the Free Software Foundation; either |
| 9 * version 2 of the License, or (at your option) any later version. | 9 * version 2 of the License, or (at your option) any later version. |
| 10 * | 10 * |
| 11 * This library is distributed in the hope that it will be useful, | 11 * This library is distributed in the hope that it will be useful, |
| 12 * but WITHOUT ANY WARRANTY; without even the implied warranty of | 12 * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | 13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 14 * Library General Public License for more details. | 14 * Library General Public License for more details. |
| 15 * | 15 * |
| 16 * You should have received a copy of the GNU Library General Public License | 16 * You should have received a copy of the GNU Library General Public License |
| 17 * along with this library; see the file COPYING.LIB. If not, write to | 17 * along with this library; see the file COPYING.LIB. If not, write to |
| 18 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, | 18 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, |
| 19 * Boston, MA 02110-1301, USA. | 19 * Boston, MA 02110-1301, USA. |
| 20 */ | 20 */ |
| 21 | 21 |
| 22 #ifndef CSSSelector_h | 22 #ifndef CSSSelector_h |
| 23 #define CSSSelector_h | 23 #define CSSSelector_h |
| 24 | 24 |
| 25 #include "core/dom/QualifiedName.h" | 25 #include "core/dom/QualifiedName.h" |
| 26 #include "core/layout/style/LayoutStyleConstants.h" | 26 #include "core/layout/style/ComputedStyleConstants.h" |
| 27 #include "wtf/OwnPtr.h" | 27 #include "wtf/OwnPtr.h" |
| 28 #include "wtf/PassOwnPtr.h" | 28 #include "wtf/PassOwnPtr.h" |
| 29 | 29 |
| 30 namespace blink { | 30 namespace blink { |
| 31 class CSSSelectorList; | 31 class CSSSelectorList; |
| 32 | 32 |
| 33 // This class represents a selector for a StyleRule. | 33 // This class represents a selector for a StyleRule. |
| 34 | 34 |
| 35 // CSS selector representation is somewhat complicated and subtle. A represe
ntative list of selectors is | 35 // CSS selector representation is somewhat complicated and subtle. A represe
ntative list of selectors is |
| 36 // in CSSSelectorTest; run it in a debug build to see useful debugging outpu
t. | 36 // in CSSSelectorTest; run it in a debug build to see useful debugging outpu
t. |
| (...skipping 504 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 541 if (m_hasRareData) | 541 if (m_hasRareData) |
| 542 return m_data.m_rareData->m_value; | 542 return m_data.m_rareData->m_value; |
| 543 // AtomicString is really just a StringImpl* so the cast below is safe. | 543 // AtomicString is really just a StringImpl* so the cast below is safe. |
| 544 // FIXME: Perhaps call sites could be changed to accept StringImpl? | 544 // FIXME: Perhaps call sites could be changed to accept StringImpl? |
| 545 return *reinterpret_cast<const AtomicString*>(&m_data.m_value); | 545 return *reinterpret_cast<const AtomicString*>(&m_data.m_value); |
| 546 } | 546 } |
| 547 | 547 |
| 548 } // namespace blink | 548 } // namespace blink |
| 549 | 549 |
| 550 #endif // CSSSelector_h | 550 #endif // CSSSelector_h |
| OLD | NEW |