/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/clang/test/CXX/expr/expr.post/expr.ref/ |
H A D | p3.cpp | 3 template<typename T> struct Node { struct 7 Node<T> n[1]; 13 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/llvm/unittests/ADT/ |
H A D | ilistTest.cpp | 19 struct Node : ilist_node<Node> { struct in namespace:__anon9250 22 Node() {} function in struct:__anon9250::Node 23 Node(int _Value) : Value(_Value) {} function in struct:__anon9250::Node 27 ilist<Node> List; 28 List.push_back(Node(1)); 33 List.push_back(Node(2)); 38 const ilist<Node> &ConstList = List;
|
H A D | SCCIteratorTest.cpp | 97 /// 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/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/v8/test/mjsunit/regress/ |
H A D | regress-1713.js | 46 function Node(v, next) { this.v = v; this.next = next; } class 48 Node.prototype.execute = function (O) { 55 if (N == 0) return new Node(x, null); 56 return new Node(new Array(1024), LongList(N - 1, x));
|
/external/webkit/Source/WebCore/inspector/front-end/ |
H A D | utilities.js | 46 Node.prototype.rangeOfWord = function(offset, stopCharacters, stayWithinNode, direction) 65 if (node.nodeType === Node.TEXT_NODE) { 100 if (node.nodeType === Node.TEXT_NODE) { 119 endOffset = stayWithinNode.nodeType === Node.TEXT_NODE ? stayWithinNode.nodeValue.length : stayWithinNode.childNodes.length; 133 Node.prototype.traverseNextTextNode = function(stayWithin) 139 while (node && node.nodeType !== Node.TEXT_NODE) 145 Node.prototype.rangeBoundaryForOffset = function(offset) 202 Node.prototype.enclosingNodeOrSelfWithNodeNameInArray = function(nameArray) 211 Node.prototype.enclosingNodeOrSelfWithNodeName = function(nodeName) 216 Node 44 Node.prototype.rangeOfWord = function(offset, stopCharacters, stayWithinNode, direction) class [all...] |
/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/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/main/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/webkit/PerformanceTests/SunSpider/tests/v8-v4/ |
H A D | v8-splay.js | 132 * @type {SplayTree.Node} 156 this.root_ = new SplayTree.Node(key, value); 165 var node = new SplayTree.Node(key, value); 185 * @return {SplayTree.Node} The removed node. 216 * @return {SplayTree.Node} Node having the specified key. 228 * @return {SplayTree.Node} Node having the maximum key value that 282 dummy = left = right = new SplayTree.Node(null, null); 340 SplayTree.Node [all...] |
/external/webkit/PerformanceTests/SunSpider/tests/v8-v5/ |
H A D | v8-splay.js | 132 * @type {SplayTree.Node} 156 this.root_ = new SplayTree.Node(key, value); 165 var node = new SplayTree.Node(key, value); 185 * @return {SplayTree.Node} The removed node. 216 * @return {SplayTree.Node} Node having the specified key. 228 * @return {SplayTree.Node} Node having the maximum key value that 282 dummy = left = right = new SplayTree.Node(null, null); 340 SplayTree.Node [all...] |
/external/webkit/PerformanceTests/SunSpider/tests/v8-v6/ |
H A D | v8-splay.js | 133 * @type {SplayTree.Node} 157 this.root_ = new SplayTree.Node(key, value); 166 var node = new SplayTree.Node(key, value); 186 * @return {SplayTree.Node} The removed node. 217 * @return {SplayTree.Node} Node having the specified key. 229 * @return {SplayTree.Node} Node having the maximum key value. 244 * @return {SplayTree.Node} Node havin [all...] |
/external/webkit/Source/JavaScriptCore/API/tests/ |
H A D | Node.h | 29 typedef struct __Node Node; typedef in typeref:struct:__Node 33 Node* node; 43 extern Node* Node_new(void); 44 extern void Node_ref(Node* node); 45 extern void Node_deref(Node* node); 46 extern void Node_appendChild(Node* node, Node* child); 47 extern void Node_removeChild(Node* node, Node* child); 48 extern void Node_replaceChild(Node* nod [all...] |
/external/webkit/Source/WebCore/platform/text/ |
H A D | SuffixTree.h | 58 Node* current = &m_root; 69 class Node { class in class:WebCore::SuffixTree 71 Node(bool isLeaf = false) function in class:WebCore::SuffixTree::Node 78 ~Node() 81 Node* child = m_children.at(i); 87 Node*& at(int codeWord) { return m_children.at(codeWord); } 90 typedef Vector<Node*, Codebook::codeSize> ChildrenVector; 99 Node* current = &m_root; 103 Node*& child = current->at(Codebook::codeWord(text[base + offset])); 105 child = base + offset + 1 == limit ? &m_leaf : new Node(); [all...] |
/external/chromium/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 171 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) 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 171 if child.nodeType == Node [all...] |
/external/llvm/lib/CodeGen/SelectionDAG/ |
H A D | SDNodeOrdering.h | 36 void add(const SDNode *Node, unsigned O) { argument 37 OrderMap[Node] = O; 39 void remove(const SDNode *Node) { argument 40 DenseMap<const SDNode*, unsigned>::iterator Itr = OrderMap.find(Node); 47 unsigned getOrder(const SDNode *Node) { argument 48 return OrderMap[Node];
|