/external/v8/test/mjsunit/ |
this-property-assignment.js | 31 function Node() { 37 var n1 = new Node(); 40 var n2 = new Node();
|
/external/clang/test/CXX/expr/expr.post/expr.ref/ |
p3.cpp | 3 template<typename T> struct Node { 7 Node<T> n[1]; 13 Node<int> n;
|
/external/llvm/unittests/ADT/ |
ilistTest.cpp | 19 struct Node : ilist_node<Node> { 22 Node() {} 23 Node(int _Value) : Value(_Value) {} 27 ilist<Node> List; 28 List.push_back(Node(1)); 33 List.push_back(Node(2)); 38 const ilist<Node> &ConstList = List;
|
/external/v8/tools/ |
profile_view.js | 52 callTree.traverse(function(node, viewParent) { 53 var totalWeight = node.totalWeight * samplingRate; 54 var selfWeight = node.selfWeight * samplingRate; 62 var viewNode = createViewNode(node.label, totalWeight, selfWeight, head); 78 * @param {ProfileView.Node} head View head node. 87 * Factory method for a profile view node. 95 * @param {ProfileView.Node} head Profile view head. 96 * @return {ProfileView.Node} Profile view node [all...] |
splaytree.js | 42 * Pointer to the root node of the tree. 44 * @type {SplayTree.Node} 60 * Inserts a node into the tree with the specified key and value if 61 * the tree does not already contain a node with the specified key. If 69 this.root_ = new SplayTree.Node(key, value); 72 // Splay on the key to move the last node on the search path for 78 var node = new SplayTree.Node(key, value); 80 node.left = this.root_; 81 node.right = this.root_.right [all...] |
profile.js | 272 * @param {function(CallTree.Node)} f Visitor function. 282 * @param {function(CallTree.Node)} f Visitor function. 290 * Calculates a top down profile for a node with the specified label. 293 * @param {string} opt_label Node label. 301 * Calculates a bottom up profile for a node with the specified label. 304 * @param {string} opt_label Node label. 315 * @param {string} opt_label Node label. 330 * Calculates a flat profile of callees starting from a node with 333 * @param {string} opt_label Starting node label. 344 function onEnter(node) { [all...] |
/external/clang/test/CodeGenCXX/ |
constructor-template.cpp | 28 template <typename T> class Node { 31 Node(){ } // Node<BinomialNode<int>*>::Node() remains undefined. 32 ~Node() {} 36 template<typename T> class BinomialNode : Node<BinomialNode<T>*> { 44 BinomialNode<int> *node = new BinomialNode<int>(1); local 45 delete node;
|
/external/v8/test/mjsunit/regress/ |
regress-1713.js | 46 function Node(v, next) { this.v = v; this.next = next; } 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/ |
utilities.js | 46 Node.prototype.rangeOfWord = function(offset, stopCharacters, stayWithinNode, direction) 57 var node = this; 58 while (node) { 59 if (node === stayWithinNode) { 65 if (node.nodeType === Node.TEXT_NODE) { 66 var start = (node === this ? (offset - 1) : (node.nodeValue.length - 1)); 68 if (stopCharacters.indexOf(node.nodeValue[i]) !== -1) { 69 startNode = node; [all...] |
/external/v8/benchmarks/spinning-balls/ |
splay-tree.js | 41 * Pointer to the root node of the tree. 43 * @type {SplayTree.Node} 58 * Inserts a node into the tree with the specified key and value if 59 * the tree does not already contain a node with the specified key. If 67 this.root_ = new SplayTree.Node(key, value); 70 // Splay on the key to move the last node on the search path for 76 var node = new SplayTree.Node(key, value); 78 node.left = this.root_; 79 node.right = this.root_.right [all...] |
/external/v8/benchmarks/ |
splay.js | 53 string : 'String for key ' + tag + ' in leaf node' 72 // Insert new node with a unique key. 136 * Pointer to the root node of the tree. 138 * @type {SplayTree.Node} 153 * Inserts a node into the tree with the specified key and value if 154 * the tree does not already contain a node with the specified key. If 162 this.root_ = new SplayTree.Node(key, value); 165 // Splay on the key to move the last node on the search path for 171 var node = new SplayTree.Node(key, value) [all...] |
/external/valgrind/main/memcheck/tests/ |
leak-tree.c | 24 } Node; 26 Node* mk(void) 28 Node *x = malloc(sizeof(Node)); 35 Node* t;
|
/external/webkit/PerformanceTests/SunSpider/tests/v8-v4/ |
v8-splay.js | 48 string : 'String for key ' + key + ' in leaf node' 67 // Insert new node with a unique key. 130 * Pointer to the root node of the tree. 132 * @type {SplayTree.Node} 147 * Inserts a node into the tree with the specified key and value if 148 * the tree does not already contain a node with the specified key. If 156 this.root_ = new SplayTree.Node(key, value); 159 // Splay on the key to move the last node on the search path for 165 var node = new SplayTree.Node(key, value) [all...] |
/external/webkit/PerformanceTests/SunSpider/tests/v8-v5/ |
v8-splay.js | 48 string : 'String for key ' + key + ' in leaf node' 67 // Insert new node with a unique key. 130 * Pointer to the root node of the tree. 132 * @type {SplayTree.Node} 147 * Inserts a node into the tree with the specified key and value if 148 * the tree does not already contain a node with the specified key. If 156 this.root_ = new SplayTree.Node(key, value); 159 // Splay on the key to move the last node on the search path for 165 var node = new SplayTree.Node(key, value) [all...] |
/external/webkit/PerformanceTests/SunSpider/tests/v8-v6/ |
v8-splay.js | 48 string : 'String for key ' + tag + ' in leaf node' 67 // Insert new node with a unique key. 131 * Pointer to the root node of the tree. 133 * @type {SplayTree.Node} 148 * Inserts a node into the tree with the specified key and value if 149 * the tree does not already contain a node with the specified key. If 157 this.root_ = new SplayTree.Node(key, value); 160 // Splay on the key to move the last node on the search path for 166 var node = new SplayTree.Node(key, value) [all...] |
/external/webkit/Source/JavaScriptCore/API/tests/ |
Node.h | 29 typedef struct __Node Node; 33 Node* node; member in struct:__NodeLink 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) [all...] |
/external/webkit/Source/WebCore/platform/text/ |
SuffixTree.h | 58 Node* current = &m_root; 69 class Node { 71 Node(bool isLeaf = false) 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/base/ |
linked_list_unittest.cc | 12 class Node : public LinkNode<Node> { 14 explicit Node(int id) : id_(id) {} 37 void ExpectListContentsForDirection(const LinkedList<Node>& list, 40 for (const LinkNode<Node>* node = (forward ? list.head() : list.tail()); 41 node != list.end(); 42 node = (forward ? node->next() : node->previous())) 256 MultipleInheritanceNode node; local [all...] |
/external/chromium/testing/gtest/test/ |
gtest_xml_outfiles_test.py | 37 from xml.dom import minidom, Node
|
gtest_xml_test_utils.py | 37 from xml.dom import minidom, Node 53 Asserts that actual_node (a DOM node object) is equivalent to 54 expected_node (another DOM node object), in that either both of 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) 123 attributes are encountered, or if any other type of node is encountered. 128 if child.nodeType == Node.ELEMENT_NODE: 134 elif child.nodeType in [Node.TEXT_NODE, Node.CDATA_SECTION_NODE] [all...] |
/external/clang/test/SemaCXX/ |
arrow-operator.cpp | 31 class Node { public: Point Location(){ Point p; return p; } }; 35 Node** node1;
|
/external/gtest/test/ |
gtest_xml_outfiles_test.py | 37 from xml.dom import minidom, Node
|
gtest_xml_test_utils.py | 37 from xml.dom import minidom, Node 53 Asserts that actual_node (a DOM node object) is equivalent to 54 expected_node (another DOM node object), in that either both of 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) 123 attributes are encountered, or if any other type of node is encountered. 128 if child.nodeType == Node.ELEMENT_NODE: 134 elif child.nodeType in [Node.TEXT_NODE, Node.CDATA_SECTION_NODE] [all...] |
/external/llvm/include/llvm/Analysis/ |
CFGPrinter.h | 35 static std::string getSimpleNodeLabel(const BasicBlock *Node, 37 if (!Node->getName().empty()) 38 return Node->getName().str(); 43 WriteAsOperand(OS, Node, false); 47 static std::string getCompleteNodeLabel(const BasicBlock *Node, 52 if (Node->getName().empty()) { 53 WriteAsOperand(OS, Node, false); 57 OS << *Node; 75 std::string getNodeLabel(const BasicBlock *Node, 78 return getSimpleNodeLabel(Node, Graph) [all...] |
/external/protobuf/gtest/test/ |
gtest_xml_outfiles_test.py | 37 from xml.dom import minidom, Node
|