OLD | NEW |
(Empty) | |
| 1 /* |
| 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
| 3 * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc.
All rights reserved. |
| 4 * Copyright (C) 2013 Google Inc. All rights reserved. |
| 5 * |
| 6 * This library is free software; you can redistribute it and/or |
| 7 * modify it under the terms of the GNU Library General Public |
| 8 * License as published by the Free Software Foundation; either |
| 9 * version 2 of the License, or (at your option) any later version. |
| 10 * |
| 11 * This library is distributed in the hope that it will be useful, |
| 12 * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 14 * Library General Public License for more details. |
| 15 * |
| 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 |
| 18 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, |
| 19 * Boston, MA 02110-1301, USA. |
| 20 * |
| 21 */ |
| 22 |
| 23 #ifndef TreeBoundaryCrossingRules_h |
| 24 #define TreeBoundaryCrossingRules_h |
| 25 |
| 26 #include "core/dom/DocumentOrderedList.h" |
| 27 |
| 28 #include "wtf/OwnPtr.h" |
| 29 #include "wtf/RefPtr.h" |
| 30 #include "wtf/Vector.h" |
| 31 |
| 32 namespace blink { |
| 33 |
| 34 class ContainerNode; |
| 35 class Element; |
| 36 class ElementRuleCollector; |
| 37 |
| 38 class TreeBoundaryCrossingRules final { |
| 39 DISALLOW_ALLOCATION(); |
| 40 public: |
| 41 void addScope(ContainerNode&); |
| 42 void removeScope(const ContainerNode&); |
| 43 void collectTreeBoundaryCrossingRules(Element*, ElementRuleCollector&, bool
includeEmptyRules); |
| 44 |
| 45 DECLARE_TRACE(); |
| 46 |
| 47 private: |
| 48 size_t size() const { return m_scopingNodes.size(); } |
| 49 |
| 50 DocumentOrderedList m_scopingNodes; |
| 51 }; |
| 52 |
| 53 } // namespace blink |
| 54 |
| 55 #endif // TreeBoundaryCrossingRules_h |
OLD | NEW |