/external/v8/test/mjsunit/ |
H A D | this-property-assignment.js | 31 function Node() { class 37 var n1 = new Node(); 40 var n2 = new Node();
|
/external/llvm/unittests/ADT/ |
H A D | ilistTest.cpp | 20 struct Node : ilist_node<Node> { struct in namespace:__anon11234 23 Node() {} function in struct:__anon11234::Node 24 Node(int Value) : Value(Value) {} function in struct:__anon11234::Node 25 Node(const Node&) = default; 26 ~Node() { Value = -1; } 30 ilist<Node> List; 31 List.push_back(Node(1)); 36 List.push_back(Node( [all...] |
H A D | SCCIteratorTest.cpp | 95 /// NodeType - Node index and set of children of the node. 236 static inline ChildIteratorType child_begin(NodeType *Node) { argument 237 return Graph<N>::child_begin(Node); 239 static inline ChildIteratorType child_end(NodeType *Node) { argument 240 return Graph<N>::child_end(Node);
|
/external/clang/test/CXX/expr/expr.post/expr.ref/ |
H A D | p3.cpp | 4 template<typename T> struct Node { struct 8 Node<T> n[1]; 14 Node<int> n;
|
/external/llvm/lib/CodeGen/ |
H A D | MachinePassRegistry.cpp | 36 void MachinePassRegistry::Add(MachinePassRegistryNode *Node) { argument 37 Node->setNext(List); 38 List = Node; 39 if (Listener) Listener->NotifyAdd(Node->getName(), 40 Node->getCtor(), 41 Node->getDescription()); 47 void MachinePassRegistry::Remove(MachinePassRegistryNode *Node) { argument 49 if (*I == Node) { 50 if (Listener) Listener->NotifyRemove(Node->getName());
|
/external/v8/tools/ |
H A D | profile_view.js | 78 * @param {ProfileView.Node} head View head node. 95 * @param {ProfileView.Node} head Profile view head. 96 * @return {ProfileView.Node} Profile view node. 100 return new ProfileView.Node( 109 * @param {ProfileView.Node} head Head (root) node. 120 * @param {function(ProfileView.Node, 121 * ProfileView.Node):number} sortFunc A sorting 134 * @param {function(ProfileView.Node)} f Visitor function. 157 * @param {ProfileView.Node} head Profile view head. 160 ProfileView.Node [all...] |
H A D | splaytree.js | 44 * @type {SplayTree.Node} 69 this.root_ = new SplayTree.Node(key, value); 78 var node = new SplayTree.Node(key, value); 98 * @return {SplayTree.Node} The removed node. 129 * @return {SplayTree.Node} Node having the specified key. 141 * @return {SplayTree.Node} Node having the minimum key value. 156 * @return {SplayTree.Node} Node havin [all...] |
H A D | profile.js | 272 * @param {function(CallTree.Node)} f Visitor function. 282 * @param {function(CallTree.Node)} f Visitor function. 293 * @param {string} opt_label Node label. 304 * @param {string} opt_label Node label. 315 * @param {string} opt_label Node label. 527 this.root_ = new CallTree.Node( 636 * @param {function(CallTree.Node, *)} f Visitor function. 657 * @param {function(CallTree.Node)} enter A function called 659 * @param {function(CallTree.Node)} exit A function called 675 * @param {string} label Node labe [all...] |
/external/clang/test/CodeGenCXX/ |
H A D | constructor-template.cpp | 28 template <typename T> class Node { class 31 Node(){ } // Node<BinomialNode<int>*>::Node() remains undefined. function in class:Node 32 ~Node() {} 36 template<typename T> class BinomialNode : Node<BinomialNode<T>*> {
|
/external/clang/lib/AST/ |
H A D | StmtViz.cpp | 35 static std::string getNodeLabel(const Stmt* Node, const Stmt* Graph) { argument 41 if (Node) 42 Out << Node->getStmtClassName();
|
/external/llvm/lib/Target/Mips/ |
H A D | MipsISelDAGToDAG.h | 118 virtual std::pair<bool, SDNode*> selectNode(SDNode *Node) = 0; 121 inline SDValue getImm(const SDNode *Node, uint64_t Imm) { argument 122 return CurDAG->getTargetConstant(Imm, Node->getValueType(0));
|
/external/v8/benchmarks/spinning-balls/ |
H A D | splay-tree.js | 43 * @type {SplayTree.Node} 67 this.root_ = new SplayTree.Node(key, value); 76 var node = new SplayTree.Node(key, value); 96 * @return {SplayTree.Node} The removed node. 127 * @return {SplayTree.Node} Node having the specified key. 139 * @return {SplayTree.Node} Node having the maximum key value. 154 * @return {SplayTree.Node} Node havin [all...] |
/external/v8/benchmarks/ |
H A D | splay.js | 138 * @type {SplayTree.Node} 162 this.root_ = new SplayTree.Node(key, value); 171 var node = new SplayTree.Node(key, value); 191 * @return {SplayTree.Node} The removed node. 222 * @return {SplayTree.Node} Node having the specified key. 234 * @return {SplayTree.Node} Node having the maximum key value. 249 * @return {SplayTree.Node} Node havin [all...] |
/external/valgrind/memcheck/tests/ |
H A D | leak-tree.c | 24 } Node; typedef in typeref:struct:_Node 26 Node* mk(void) 28 Node *x = malloc(sizeof(Node)); 35 Node* t;
|
/external/google-breakpad/src/testing/gtest/test/ |
H A D | gtest_xml_outfiles_test.py | 37 from xml.dom import minidom, Node namespace
|
H A D | gtest_xml_test_utils.py | 37 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) 128 if child.nodeType == Node.ELEMENT_NODE: 134 elif child.nodeType in [Node.TEXT_NODE, Node.CDATA_SECTION_NODE]: 136 if (child.nodeType == Node.CDATA_SECTION_NODE or 182 if child.nodeType == Node [all...] |
/external/gtest/test/ |
H A D | gtest_xml_outfiles_test.py | 37 from xml.dom import minidom, Node namespace
|
H A D | gtest_xml_test_utils.py | 37 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/std/containers/associative/ |
H A D | tree_left_rotate.pass.cpp | 20 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 D | tree_right_rotate.pass.cpp | 20 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 D | CallPrinter.cpp | 30 std::string getNodeLabel(CallGraphNode *Node, CallGraph *Graph) { argument 31 if (Function *Func = Node->getFunction())
|
/external/protobuf/gtest/test/ |
H A D | gtest_xml_outfiles_test.py | 37 from xml.dom import minidom, Node namespace
|
H A D | gtest_xml_test_utils.py | 37 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/v8/src/compiler/ |
H A D | generic-algorithm-inl.h | 22 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/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
H A D | Graph.java | 38 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...] |