Home | History | Annotate | Download | only in css
      1 /*
      2  * Copyright (C) 1999 Lars Knoll (knoll (at) 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/css/RuleSet.h"
     27 #include "core/dom/DocumentOrderedList.h"
     28 
     29 #include "wtf/OwnPtr.h"
     30 #include "wtf/RefPtr.h"
     31 #include "wtf/Vector.h"
     32 
     33 namespace WebCore {
     34 
     35 class ContainerNode;
     36 class RuleFeatureSet;
     37 
     38 class TreeBoundaryCrossingRules {
     39 public:
     40     void addRule(StyleRule*, size_t selectorIndex, ContainerNode* scopingNode, AddRuleFlags);
     41     void clear() { m_treeBoundaryCrossingRuleSetMap.clear(); }
     42     void reset(const ContainerNode* scopingNode);
     43     bool isEmpty() const { return m_treeBoundaryCrossingRuleSetMap.isEmpty(); }
     44     void collectFeaturesTo(RuleFeatureSet&);
     45 
     46     DocumentOrderedList::iterator begin() { return m_scopingNodes.begin(); }
     47     DocumentOrderedList::iterator end() { return m_scopingNodes.end(); }
     48     RuleSet* ruleSetScopedBy(const ContainerNode* scopingNode) { return m_treeBoundaryCrossingRuleSetMap.get(scopingNode); }
     49 
     50 private:
     51     DocumentOrderedList m_scopingNodes;
     52     typedef HashMap<const ContainerNode*, OwnPtr<RuleSet> > TreeBoundaryCrossingRuleSetMap;
     53     TreeBoundaryCrossingRuleSetMap m_treeBoundaryCrossingRuleSetMap;
     54 };
     55 
     56 } // namespace WebCore
     57 
     58 #endif // TreeBoundaryCrossingRules_h
     59