| /external/chromium_org/v8/test/mjsunit/ |
| this-property-assignment.js | 31 function Node() {
37 var n1 = new Node();
40 var n2 = new Node();
|
| /external/v8/test/mjsunit/ |
| this-property-assignment.js | 31 function Node() {
37 var n1 = new Node();
40 var n2 = new Node();
|
| /external/llvm/unittests/ADT/ |
| ilistTest.cpp | 20 struct Node : ilist_node<Node> {
23 Node() {}
24 Node(int _Value) : Value(_Value) {}
25 ~Node() { Value = -1; }
29 ilist<Node> List;
30 List.push_back(Node(1));
35 List.push_back(Node(2));
40 const ilist<Node> &ConstList = List;
47 ilist<Node> List
[all...] |
| /external/clang/test/CXX/expr/expr.post/expr.ref/ |
| p3.cpp | 4 template<typename T> struct Node {
8 Node<T> n[1];
14 Node<int> n;
|
| /external/chromium_org/third_party/jinja2/ |
| visitor.py | 11 from jinja2.nodes import Node
16 node found. The visitor functions may return values which will be
20 class name of the node. So a `TryFinally` node visit function would
22 the `get_visitor` function. If no visitor function exists for a node
26 def get_visitor(self, node):
27 """Return the visitor function for this node or `None` if no visitor
28 exists for this node. In that case the generic visit function is
31 method = 'visit_' + node.__class__.__name__
34 def visit(self, node, *args, **kwargs)
[all...] |
| /external/chromium_org/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...] |
| /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...] |
| /external/chromium_org/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));
|
| regress-1713b.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/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/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
| DOMExtension.js | 36 Node.prototype.rangeOfWord = function(offset, stopCharacters, stayWithinNode, direction)
47 var node = this;
48 while (node) {
49 if (node === stayWithinNode) {
55 if (node.nodeType === Node.TEXT_NODE) {
56 var start = (node === this ? (offset - 1) : (node.nodeValue.length - 1));
58 if (stopCharacters.indexOf(node.nodeValue[i]) !== -1) {
59 startNode = node;
[all...] |
| /cts/suite/pts/deviceTests/browserbench/assets/octane/ |
| 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...] |
| /cts/tools/utils/ |
| rerun.py | 19 from xml.dom import Node
25 if (child.nodeType == Node.ELEMENT_NODE) and (child.tagName == tagName):
|
| /external/chromium_org/third_party/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/chromium_org/third_party/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/chromium_org/third_party/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/chromium_org/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/chromium_org/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/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/chromium_org/third_party/WebKit/Source/core/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...] |
