Searched refs:Node (Results 1 - 25 of 1565) sorted by relevance

1234567891011>>

/external/chromium_org/third_party/WebKit/Source/core/dom/
H A DEntity.idl22 interface Entity : Node {
H A DNotation.idl22 interface Notation : Node {
H A DNodeTraversal.h28 #include "core/dom/Node.h"
38 Node* next(const Node&);
39 Node* next(const Node&, const Node* stayWithin);
40 Node* next(const ContainerNode&);
41 Node* next(const ContainerNode&, const Node* stayWithin);
44 Node* nextSkippingChildre
[all...]
H A DTreeWalker.h40 static PassRefPtr<TreeWalker> create(PassRefPtr<Node> rootNode, unsigned whatToShow, PassRefPtr<NodeFilter> filter)
45 Node* currentNode() const { return m_current.get(); }
46 void setCurrentNode(PassRefPtr<Node>, ExceptionState&);
48 Node* parentNode(ScriptState*);
49 Node* firstChild(ScriptState*);
50 Node* lastChild(ScriptState*);
51 Node* previousSibling(ScriptState*);
52 Node* nextSibling(ScriptState*);
53 Node* previousNode(ScriptState*);
54 Node* nextNod
[all...]
H A DDocumentOrderedList.h36 class Node;
43 void add(Node*);
44 void parserAdd(Node*);
45 void remove(const Node*);
49 typedef ListHashSet<Node*, 32>::iterator iterator;
55 ListHashSet<Node*, 32> m_nodes;
H A DTreeWalker.idl25 readonly attribute Node root;
29 [RaisesException=Setter] attribute Node currentNode;
31 [CallWith=ScriptState] Node parentNode();
32 [CallWith=ScriptState] Node firstChild();
33 [CallWith=ScriptState] Node lastChild();
34 [CallWith=ScriptState] Node previousSibling();
35 [CallWith=ScriptState] Node nextSibling();
36 [CallWith=ScriptState] Node previousNode();
37 [CallWith=ScriptState] Node nextNode();
H A DNodeTraversal.cpp33 Node* previousIncludingPseudo(const Node& current, const Node* stayWithin)
37 if (Node* previous = current.pseudoAwarePreviousSibling()) {
45 Node* nextIncludingPseudo(const Node& current, const Node* stayWithin)
47 if (Node* next = current.pseudoAwareFirstChild())
51 if (Node* next = current.pseudoAwareNextSibling())
53 for (Node* paren
[all...]
H A DChildListMutationScope.h36 #include "core/dom/Node.h"
48 static PassRefPtr<ChildListMutationAccumulator> getOrCreate(Node&);
51 void childAdded(PassRefPtr<Node>);
52 void willRemoveChild(PassRefPtr<Node>);
57 ChildListMutationAccumulator(PassRefPtr<Node>, PassOwnPtr<MutationObserverInterestGroup>);
61 bool isAddedNodeInOrder(Node*);
62 bool isRemovedNodeInOrder(Node*);
64 RefPtr<Node> m_target;
66 Vector<RefPtr<Node> > m_removedNodes;
67 Vector<RefPtr<Node> > m_addedNode
[all...]
H A DSelectorQuery.h40 class Node;
49 PassRefPtr<NodeList> queryAll(Node& rootNode) const;
50 PassRefPtr<Element> queryFirst(Node& rootNode) const;
59 bool canUseFastQuery(const Node& rootNode) const;
60 bool selectorMatches(const SelectorData&, Element&, const Node&) const;
61 void collectElementsByClassName(Node& rootNode, const AtomicString& className, Vector<RefPtr<Node> >&) const;
62 Element* findElementByClassName(Node& rootNode, const AtomicString& className) const;
63 void collectElementsByTagName(Node& rootNode, const QualifiedName& tagName, Vector<RefPtr<Node> >
[all...]
H A DElementTraversal.h36 Element* firstWithin(const Node&);
40 Element* next(const Node&);
41 Element* next(const Node&, const Node* stayWithin);
43 Element* next(const ContainerNode&, const Node* stayWithin);
46 Element* nextSkippingChildren(const Node&);
47 Element* nextSkippingChildren(const Node&, const Node* stayWithin);
49 Element* nextSkippingChildren(const ContainerNode&, const Node* stayWithin);
52 Element* previousIncludingPseudo(const Node
[all...]
H A DNodeFilterCondition.cpp32 short NodeFilterCondition::acceptNode(ScriptState*, Node*) const
/external/chromium_org/v8/test/mjsunit/
H A Dthis-property-assignment.js31 function Node() { class
37 var n1 = new Node();
40 var n2 = new Node();
/external/clang/test/CXX/expr/expr.post/expr.ref/
H A Dp3.cpp4 template<typename T> struct Node { struct
8 Node<T> n[1];
14 Node<int> n;
/external/v8/test/mjsunit/
H A Dthis-property-assignment.js31 function Node() { class
37 var n1 = new Node();
40 var n2 = new Node();
/external/chromium_org/third_party/WebKit/Source/core/xml/
H A DXPathUtil.h35 class Node;
40 bool isRootDomNode(Node*);
43 String stringValue(Node*);
46 bool isValidContextNode(Node*);
H A DXPathUtil.cpp37 bool isRootDomNode(Node* node)
42 String stringValue(Node* node)
45 case Node::ATTRIBUTE_NODE:
46 case Node::PROCESSING_INSTRUCTION_NODE:
47 case Node::COMMENT_NODE:
48 case Node::TEXT_NODE:
49 case Node::CDATA_SECTION_NODE:
50 case Node::XPATH_NAMESPACE_NODE:
53 if (isRootDomNode(node) || node->nodeType() == Node::ELEMENT_NODE) {
57 for (Node*
[all...]
/external/chromium_org/v8/test/mjsunit/regress/
H A Dregress-99167.js30 eval("function Node() { this.a = 1; this.a = 3; }");
31 new Node;
33 for (var i = 0; i < 100000; ++i) new Node;
/external/v8/test/mjsunit/regress/
H A Dregress-99167.js30 eval("function Node() { this.a = 1; this.a = 3; }");
31 new Node;
33 for (var i = 0; i < 100000; ++i) new Node;
/external/chromium_org/third_party/skia/include/xml/
H A DSkDOM.h25 typedef SkDOMNode Node; typedef in class:SkDOM
30 const Node* build(const char doc[], size_t len);
31 const Node* copy(const SkDOM& dom, const Node* node);
33 const Node* getRootNode() const;
39 Type getType(const Node*) const;
41 const char* getName(const Node*) const;
42 const Node* getFirstChild(const Node*, const char elem[] = NULL) const;
43 const Node* getNextSiblin
[all...]
/external/skia/include/xml/
H A DSkDOM.h25 typedef SkDOMNode Node; typedef in class:SkDOM
30 const Node* build(const char doc[], size_t len);
31 const Node* copy(const SkDOM& dom, const Node* node);
33 const Node* getRootNode() const;
39 Type getType(const Node*) const;
41 const char* getName(const Node*) const;
42 const Node* getFirstChild(const Node*, const char elem[] = NULL) const;
43 const Node* getNextSiblin
[all...]
/external/chromium_org/third_party/WebKit/Source/core/dom/shadow/
H A DContentDistribution.h34 #include "core/dom/Node.h"
45 PassRefPtr<Node> first() const { return m_nodes.first(); }
46 PassRefPtr<Node> last() const { return m_nodes.last(); }
47 PassRefPtr<Node> at(size_t index) const { return m_nodes.at(index); }
52 void append(PassRefPtr<Node>);
56 bool contains(const Node* node) const { return m_indices.contains(node); }
57 size_t find(const Node*) const;
58 Node* nextTo(const Node*) const;
59 Node* previousT
[all...]
H A DComposedTreeWalker.h36 class Node;
50 ComposedTreeWalker(const Node*, StartPolicy = CannotStartFromShadowBoundary);
52 Node* get() const { return const_cast<Node*>(m_node); }
65 Node* traverseParent(const Node*, ParentTraversalDetails* = 0) const;
68 ComposedTreeWalker(const Node*, ParentTraversalDetails*);
92 static Node* traverseNode(const Node*, TraversalDirection);
93 static Node* traverseLightChildre
[all...]
/external/apache-xml/src/main/java/org/apache/xml/utils/
H A DNodeConsumer.java23 import org.w3c.dom.Node;
39 public void setOriginatingNode(Node n);
/external/chromium_org/third_party/WebKit/Source/core/frame/
H A DSmartClip.h34 #include "core/dom/Node.h"
45 SmartClipData(Node* node, IntRect rect, String string)
55 RefPtr<Node> m_node;
74 Node* minNodeContainsNodes(Node* minNode, Node* newNode);
75 Node* findBestOverlappingNode(Node*, const IntRect& cropRect);
76 bool shouldSkipBackgroundImage(Node*);
77 void collectOverlappingChildNodes(Node* parentNod
[all...]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
H A DGraph.java38 public static class Node { class in class:Graph
40 List<Node> edges; // points at which nodes?
42 public Node(Object payload) { this.payload = payload; } method in class:Graph.Node
44 public void addEdge(Node n) {
45 if ( edges==null ) edges = new ArrayList<Node>();
53 protected Map<Object,Node> nodes = new HashMap<Object,Node>();
57 Node a_node = getNode(a);
58 Node b_node = getNode(b);
62 protected Node getNod
[all...]

Completed in 805 milliseconds

1234567891011>>