HomeSort by relevance Sort by last modified time
    Searched full:containernode (Results 1 - 25 of 265) sorted by null

1 2 3 4 5 6 7 8 91011

  /external/chromium_org/third_party/WebKit/Source/core/css/resolver/
ScopedStyleTree.h 42 ScopedStyleResolver* ensureScopedStyleResolver(ContainerNode& scopingNode);
43 ScopedStyleResolver* lookupScopedStyleResolverFor(const ContainerNode* scopingNode)
45 HashMap<const ContainerNode*, OwnPtr<ScopedStyleResolver> >::iterator it = m_authorStyles.find(scopingNode);
49 ScopedStyleResolver* scopedStyleResolverFor(const ContainerNode& scopingNode);
50 ScopedStyleResolver* addScopedStyleResolver(ContainerNode& scopingNode, bool& isNewEntry);
62 void remove(const ContainerNode* scopingNode);
64 void pushStyleCache(const ContainerNode& scopingNode, const ContainerNode* parent);
65 void popStyleCache(const ContainerNode& scopingNode);
74 bool cacheIsValid(const ContainerNode* parent) const { return parent && parent == m_cache.nodeForScopedStyles;
    [all...]
ScopedStyleTree.cpp 37 ScopedStyleResolver* ScopedStyleTree::ensureScopedStyleResolver(ContainerNode& scopingNode)
46 ScopedStyleResolver* ScopedStyleTree::scopedStyleResolverFor(const ContainerNode& scopingNode)
56 ScopedStyleResolver* ScopedStyleTree::addScopedStyleResolver(ContainerNode& scopingNode, bool& isNewEntry)
58 HashMap<const ContainerNode*, OwnPtr<ScopedStyleResolver> >::AddResult addResult = m_authorStyles.add(&scopingNode, nullptr);
73 const ContainerNode& scopingNode = target->scopingNode();
78 for (ContainerNode* node = scopingNode.parentOrShadowHostNode(); node; node = node->parentOrShadowHostNode()) {
96 for (HashMap<const ContainerNode*, OwnPtr<ScopedStyleResolver> >::iterator it = m_authorStyles.begin(); it != m_authorStyles.end(); ++it) {
147 inline ScopedStyleResolver* ScopedStyleTree::enclosingScopedStyleResolverFor(const ContainerNode* scopingNode)
156 void ScopedStyleTree::resolveStyleCache(const ContainerNode* scopingNode)
162 void ScopedStyleTree::pushStyleCache(const ContainerNode& scopingNode, const ContainerNode* parent
    [all...]
ScopedStyleResolver.h 32 #include "core/dom/ContainerNode.h"
48 static PassOwnPtr<ScopedStyleResolver> create(ContainerNode& scopingNode) { return adoptPtr(new ScopedStyleResolver(scopingNode)); }
50 static ContainerNode* scopingNodeFor(Document&, const CSSStyleSheet*);
52 const ContainerNode& scopingNode() const { return m_scopingNode; }
70 explicit ScopedStyleResolver(ContainerNode& scopingNode) : m_scopingNode(scopingNode), m_parent(0) { }
74 ContainerNode& m_scopingNode;
ElementResolveContext.h 31 class ContainerNode;
51 const ContainerNode* parentNode() const { return m_parentNode; }
59 ContainerNode* m_parentNode;
MatchRequest.h 30 class ContainerNode;
34 MatchRequest(RuleSet* ruleSet, bool includeEmptyRules = false, const ContainerNode* scope = 0, bool elementApplyAuthorStyles = true, unsigned styleSheetIndex = 0)
48 const ContainerNode* scope;
  /external/chromium_org/third_party/WebKit/Source/core/css/
TreeBoundaryCrossingRules.h 35 class ContainerNode;
40 void addRule(StyleRule*, size_t selectorIndex, ContainerNode* scopingNode, AddRuleFlags);
42 void reset(const ContainerNode* scopingNode);
48 RuleSet* ruleSetScopedBy(const ContainerNode* scopingNode) { return m_treeBoundaryCrossingRuleSetMap.get(scopingNode); }
52 typedef HashMap<const ContainerNode*, OwnPtr<RuleSet> > TreeBoundaryCrossingRuleSetMap;
  /external/chromium_org/third_party/WebKit/Source/core/dom/
ParentNode.h 34 #include "core/dom/ContainerNode.h"
40 static PassRefPtr<HTMLCollection> children(ContainerNode* node)
45 static Element* firstElementChild(ContainerNode* node)
50 static Element* lastElementChild(ContainerNode* node)
55 static unsigned childElementCount(ContainerNode* node)
ContainerNode.cpp 24 #include "core/dom/ContainerNode.h"
62 if (ContainerNode* oldParent = node.parentNode())
70 void ContainerNode::removeDetachedChildren()
77 removeDetachedChildrenInContainer<Node, ContainerNode>(*this);
80 void ContainerNode::parserTakeAllChildrenFrom(ContainerNode& oldParent)
89 ContainerNode::~ContainerNode()
95 bool ContainerNode::isChildTypeAllowed(const Node& child) const
107 bool ContainerNode::containsConsideringHostElements(const Node& newChild) cons
    [all...]
Notation.h 25 #include "core/dom/ContainerNode.h"
29 class Notation : public ContainerNode {
31 Notation(TreeScope* treeScope) : ContainerNode(treeScope)
ElementTraversal.h 37 Element* firstWithin(const ContainerNode&);
42 Element* next(const ContainerNode&);
43 Element* next(const ContainerNode&, const Node* stayWithin);
48 Element* nextSkippingChildren(const ContainerNode&);
49 Element* nextSkippingChildren(const ContainerNode&, const Node* stayWithin);
68 inline Element* firstWithin(const ContainerNode& current) { return firstElementWithinTemplate(current); }
79 inline Element* next(const ContainerNode& current) { return traverseNextElementTemplate(current); }
90 inline Element* next(const ContainerNode& current, const Node* stayWithin) { return traverseNextElementTemplate(current, stayWithin); }
101 inline Element* nextSkippingChildren(const ContainerNode& current) { return traverseNextElementSkippingChildrenTemplate(current); }
112 inline Element* nextSkippingChildren(const ContainerNode& current, const Node* stayWithin) { return traverseNextElementSkippingChildrenTemplate(current, st (…)
    [all...]
ContainerNodeAlgorithms.h 34 explicit ChildNodeInsertionNotifier(ContainerNode& insertionPoint)
42 void notifyDescendantInsertedIntoDocument(ContainerNode&);
43 void notifyDescendantInsertedIntoTree(ContainerNode&);
45 void notifyNodeInsertedIntoTree(ContainerNode&);
47 ContainerNode& m_insertionPoint;
53 explicit ChildNodeRemovalNotifier(ContainerNode& insertionPoint)
61 void notifyDescendantRemovedFromDocument(ContainerNode&);
62 void notifyDescendantRemovedFromTree(ContainerNode&);
64 void notifyNodeRemovedFromTree(ContainerNode&);
66 ContainerNode& m_insertionPoint
    [all...]
StyleSheetScopingNodeList.h 30 #include "core/dom/ContainerNode.h"
42 void add(ContainerNode*);
43 void remove(ContainerNode*);
ContainerNode.h 79 class ContainerNode : public Node {
81 virtual ~ContainerNode();
110 void parserTakeAllChildrenFrom(ContainerNode&);
114 void cloneChildNodes(ContainerNode* clone);
136 ContainerNode(TreeScope*, ConstructionType = CreateContainer);
171 bool childAttachedAllowedWhenAttachingChildren(ContainerNode*);
174 DEFINE_NODE_TYPE_CASTS(ContainerNode, isContainerNode());
176 inline ContainerNode::ContainerNode(TreeScope* treeScope, ConstructionType type)
183 inline void ContainerNode::attachChildren(const AttachContext& context
    [all...]
Entity.h 25 #include "core/dom/ContainerNode.h"
29 class Entity : public ContainerNode {
NodeTraversal.h 40 Node* next(const ContainerNode&);
41 Node* next(const ContainerNode&, const Node* stayWithin);
46 Node* nextSkippingChildren(const ContainerNode&);
47 Node* nextSkippingChildren(const ContainerNode&, const Node* stayWithin);
80 inline Node* next(const ContainerNode& current) { return traverseNextTemplate(current); }
94 inline Node* next(const ContainerNode& current, const Node* stayWithin) { return traverseNextTemplate(current, stayWithin); }
104 inline Node* nextSkippingChildren(const ContainerNode& current) { return traverseNextSkippingChildrenTemplate(current); }
116 inline Node* nextSkippingChildren(const ContainerNode& current, const Node* stayWithin) { return traverseNextSkippingChildrenTemplate(current, stayWithin); }
  /external/chromium_org/third_party/WebKit/Source/core/editing/
AppendNodeCommand.h 35 static PassRefPtr<AppendNodeCommand> create(PassRefPtr<ContainerNode> parent, PassRefPtr<Node> node)
41 AppendNodeCommand(PassRefPtr<ContainerNode> parent, PassRefPtr<Node>);
46 RefPtr<ContainerNode> m_parent;
PlainTextRange.h 34 class ContainerNode;
51 PassRefPtr<Range> createRange(const ContainerNode& scope) const;
52 PassRefPtr<Range> createRangeForSelection(const ContainerNode& scope) const;
60 PassRefPtr<Range> createRangeFor(const ContainerNode& scope, GetRangeFor) const;
ApplyBlockElementCommand.cpp 84 RefPtr<ContainerNode> startScope;
86 RefPtr<ContainerNode> endScope;
158 Node* textNode = position.containerNode();
173 if (position.anchorType() != Position::PositionIsOffsetInAnchor || !position.containerNode() || !position.containerNode()->isTextNode())
175 return position.containerNode()->renderStyle();
187 isStartAndEndOnSameNode = renderStyleOfEnclosingTextNode(end) && start.containerNode() == end.containerNode();
188 bool isStartAndEndOfLastParagraphOnSameNode = renderStyleOfEnclosingTextNode(m_endOfLastParagraph) && start.containerNode() == m_endOfLastParagraph.containerNode();
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/svg/
SVGMPathElement.h 51 virtual InsertionNotificationRequest insertedInto(ContainerNode*) OVERRIDE;
52 void removedFrom(ContainerNode*);
59 void notifyParentOfPathChange(ContainerNode*);
SVGHKernElement.cpp 41 Node::InsertionNotificationRequest SVGHKernElement::insertedInto(ContainerNode* rootParent)
43 ContainerNode* fontNode = parentNode();
50 void SVGHKernElement::removedFrom(ContainerNode* rootParent)
52 ContainerNode* fontNode = parentNode();
SVGVKernElement.cpp 40 Node::InsertionNotificationRequest SVGVKernElement::insertedInto(ContainerNode* rootParent)
43 ContainerNode* fontNode = parentNode();
51 void SVGVKernElement::removedFrom(ContainerNode* rootParent)
53 ContainerNode* fontNode = parentNode();
SVGHKernElement.h 40 virtual InsertionNotificationRequest insertedInto(ContainerNode*) OVERRIDE;
41 virtual void removedFrom(ContainerNode*) OVERRIDE;
  /external/chromium_org/third_party/WebKit/Source/core/html/
HTMLStyleElement.h 46 ContainerNode* scopingNode();
74 virtual InsertionNotificationRequest insertedInto(ContainerNode*) OVERRIDE;
76 virtual void removedFrom(ContainerNode*) OVERRIDE;
93 void unregisterWithScopingNode(ContainerNode*);
HTMLBaseElement.h 43 virtual InsertionNotificationRequest insertedInto(ContainerNode*) OVERRIDE;
44 virtual void removedFrom(ContainerNode*) OVERRIDE;
HTMLMapElement.h 50 virtual InsertionNotificationRequest insertedInto(ContainerNode*) OVERRIDE;
51 virtual void removedFrom(ContainerNode*) OVERRIDE;

Completed in 240 milliseconds

1 2 3 4 5 6 7 8 91011