Searched defs:Node (Results 26 - 50 of 302) sorted by relevance

1234567891011>>

/external/chromium_org/testing/gtest/test/
H A Dgtest_xml_outfiles_test.py37 from xml.dom import minidom, Node namespace
H A Dgtest_xml_test_utils.py37 from xml.dom import minidom, Node namespace
70 if expected_node.nodeType == Node.CDATA_SECTION_NODE:
71 self.assertEquals(Node.CDATA_SECTION_NODE, actual_node.nodeType)
75 self.assertEquals(Node.ELEMENT_NODE, actual_node.nodeType)
76 self.assertEquals(Node.ELEMENT_NODE, expected_node.nodeType)
132 if child.nodeType == Node.ELEMENT_NODE:
138 elif child.nodeType in [Node.TEXT_NODE, Node.CDATA_SECTION_NODE]:
140 if (child.nodeType == Node.CDATA_SECTION_NODE or
186 if child.nodeType == Node
[all...]
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/resources/
H A DDirectoryContentView.js67 this.rootNode().appendChild(new WebInspector.DirectoryContentView.Node(entries[i]));
75 this.sortNodes(WebInspector.DirectoryContentView.Node.comparator(column), !this.isSortOrderAscending());
86 WebInspector.DirectoryContentView.Node = function(entry)
107 WebInspector.DirectoryContentView.Node.comparator = function(column)
165 WebInspector.DirectoryContentView.Node.prototype = {
/external/chromium_org/third_party/WebKit/Source/wtf/
H A DLinkedStack.h56 class Node { class in class:WTF::LinkedStack
59 Node(const T&, PassOwnPtr<Node> next);
62 OwnPtr<Node> m_next;
66 OwnPtr<Node> m_head;
71 LinkedStack<T>::Node::Node(const T& data, PassOwnPtr<Node> next) function in class:WTF::LinkedStack::Node
86 m_head = adoptPtr(new Node(data, m_head.release()));
/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/chromium_org/v8/src/compiler/
H A Dgeneric-algorithm-inl.h22 typedef N Node; typedef in class:v8::internal::compiler::NodeInputIterationTraits
25 static Iterator begin(Node* node) { return node->inputs().begin(); }
26 static Iterator end(Node* node) { return node->inputs().end(); }
28 static Node* to(Iterator iterator) { return *iterator; }
29 static Node* from(Iterator iterator) { return iterator.edge().from(); }
35 typedef N Node; typedef in class:v8::internal::compiler::NodeUseIterationTraits
38 static Iterator begin(Node* node) { return node->uses().begin(); }
39 static Iterator end(Node* node) { return node->uses().end(); }
41 static Node* to(Iterator iterator) { return *iterator; }
42 static Node* fro
[all...]
/external/clang/unittests/AST/
H A DSourceLocationTest.cpp63 virtual SourceRange getRange(const LabelStmt &Node) { argument
64 return Node.getDecl()->getSourceRange();
160 virtual SourceRange getRange(const TypeLoc &Node) { argument
162 Node.getUnqualifiedLoc().castAs<TemplateSpecializationTypeLoc>();
185 virtual SourceRange getRange(const TypeLoc &Node) { argument
187 Node.getUnqualifiedLoc().castAs<UnaryTransformTypeLoc>();
/external/gtest/test/
H A Dgtest_xml_outfiles_test.py37 from xml.dom import minidom, Node namespace
H A Dgtest_xml_test_utils.py37 from xml.dom import minidom, Node namespace
70 if expected_node.nodeType == Node.CDATA_SECTION_NODE:
71 self.assertEquals(Node.CDATA_SECTION_NODE, actual_node.nodeType)
75 self.assertEquals(Node.ELEMENT_NODE, actual_node.nodeType)
76 self.assertEquals(Node.ELEMENT_NODE, expected_node.nodeType)
132 if child.nodeType == Node.ELEMENT_NODE:
138 elif child.nodeType in [Node.TEXT_NODE, Node.CDATA_SECTION_NODE]:
140 if (child.nodeType == Node.CDATA_SECTION_NODE or
186 if child.nodeType == Node
[all...]
/external/libcxx/test/containers/associative/
H A Dtree_left_rotate.pass.cpp20 struct Node struct
22 Node* __left_;
23 Node* __right_;
24 Node* __parent_;
26 Node() : __left_(), __right_(), __parent_() {} function in struct:Node
32 Node root;
33 Node x;
34 Node y;
57 Node root;
58 Node
[all...]
H A Dtree_right_rotate.pass.cpp20 struct Node struct
22 Node* __left_;
23 Node* __right_;
24 Node* __parent_;
26 Node() : __left_(), __right_(), __parent_() {} function in struct:Node
32 Node root;
33 Node x;
34 Node y;
57 Node root;
58 Node
[all...]
/external/llvm/lib/Analysis/IPA/
H A DCallPrinter.cpp30 std::string getNodeLabel(CallGraphNode *Node, CallGraph *Graph) { argument
31 if (Function *Func = Node->getFunction())
/external/llvm/unittests/ADT/
H A DSCCIteratorTest.cpp97 /// NodeType - Node index and set of children of the node.
238 static inline ChildIteratorType child_begin(NodeType *Node) { argument
239 return Graph<N>::child_begin(Node);
241 static inline ChildIteratorType child_end(NodeType *Node) { argument
242 return Graph<N>::child_end(Node);
/external/protobuf/gtest/test/
H A Dgtest_xml_outfiles_test.py37 from xml.dom import minidom, Node namespace
H A Dgtest_xml_test_utils.py37 from xml.dom import minidom, Node namespace
69 if expected_node.nodeType == Node.CDATA_SECTION_NODE:
70 self.assertEquals(Node.CDATA_SECTION_NODE, actual_node.nodeType)
74 self.assertEquals(Node.ELEMENT_NODE, actual_node.nodeType)
75 self.assertEquals(Node.ELEMENT_NODE, expected_node.nodeType)
127 if child.nodeType == Node.ELEMENT_NODE:
133 elif child.nodeType in [Node.TEXT_NODE, Node.CDATA_SECTION_NODE]:
135 if (child.nodeType == Node.CDATA_SECTION_NODE or
164 if child.nodeType == Node
[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/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...]
/external/chromium_org/chrome/android/java/src/org/chromium/chrome/browser/omaha/
H A DXMLParser.java31 static final class Node { class in class:XMLParser
34 public final List<Node> children;
36 public Node(String tagName) { method in class:XMLParser.Node
39 children = new ArrayList<Node>();
43 private final Node mRootNode;
44 private final Stack<Node> mTagStack;
47 mRootNode = new Node(null);
48 mTagStack = new Stack<Node>();
75 public Node getRootNode() {
84 Node currentNod
[all...]
/external/chromium_org/third_party/WebKit/Source/platform/heap/
H A DHeapLinkedStack.h54 for (Node* current = m_head; current; current = current->m_next)
59 class Node : public GarbageCollected<Node> { class in class:blink::HeapLinkedStack
61 Node(const T&, Node* next);
66 Member<Node> m_next;
69 Member<Node> m_head;
74 HeapLinkedStack<T>::Node::Node(const T& data, Node* nex function in class:blink::HeapLinkedStack::Node
[all...]
/external/chromium_org/third_party/WebKit/Tools/Scripts/
H A Dmalloc-tree61 class Node: class in inherits:
73 newChild = Node(name, self.level + 1)
189 node = Node(name, 0, bytes);
/external/chromium_org/third_party/bintrees/bintrees/
H A Dbintree.py16 class Node(object): class in inherits:object
92 return Node(key, value)
H A Drbtree.py42 class Node(object): class in inherits:object
149 return Node(key, value)
158 head = Node() # False tree root
207 head = Node() # False tree root
/external/chromium_org/v8/src/
H A Dunbound-queue-inl.h14 struct UnboundQueue<Record>::Node: public Malloced { struct in class:v8::internal::UnboundQueue
15 explicit Node(const Record& value) function in struct:v8::internal::UnboundQueue::Node
20 Node* next;
26 first_ = new Node(Record());
39 Node* tmp = first_;
48 Node* next = reinterpret_cast<Node*>(divider_)->next;
57 Node*& next = reinterpret_cast<Node*>(last_)->next;
58 next = new Node(re
[all...]
/external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/
H A DNode.java8 public abstract class Node implements Switchable, Cloneable class in inherits:Switchable,Cloneable
10 private Node parent;
15 public Node parent()
20 void parent(@SuppressWarnings("hiding") Node parent)
25 abstract void removeChild(Node child);
26 abstract void replaceChild(Node oldChild, Node newChild);
28 public void replaceBy(Node node)
33 protected String toString(Node node)
56 protected <T extends Node>
[all...]
/external/ksoap2/ksoap2-base/src/main/java/org/ksoap2/
H A DSoapFault12.java26 import org.ksoap2.kdom.Node;
43 public Node Code;
44 public Node Reason;
45 public Node Node; field in class:SoapFault12
46 public Node Role;
47 public Node Detail;
77 this.Code = new Node();
80 this.Reason = new Node();
82 } else if (name.equals("Node")) {
[all...]

Completed in 8235 milliseconds

1234567891011>>