Searched defs:Node (Results 1 - 25 of 254) sorted by relevance

1234567891011

/external/chromium_org/v8/test/mjsunit/
H A Dthis-property-assignment.js31 function Node() { class
37 var n1 = new Node();
40 var n2 = new Node();
/external/v8/test/mjsunit/
H A Dthis-property-assignment.js31 function Node() { class
37 var n1 = new Node();
40 var n2 = new Node();
/external/llvm/unittests/ADT/
H A DilistTest.cpp20 struct Node : ilist_node<Node> { struct in namespace:__anon21808
23 Node() {} function in struct:__anon21808::Node
24 Node(int _Value) : Value(_Value) {} function in struct:__anon21808::Node
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> Lis
[all...]
/external/clang/test/CXX/expr/expr.post/expr.ref/
H A Dp3.cpp4 template<typename T> struct Node { struct
8 Node<T> n[1];
14 Node<int> n;
/external/chromium_org/third_party/jinja2/
H A Dvisitor.py11 from jinja2.nodes import Node namespace
63 if isinstance(value, Node):
67 elif not isinstance(value, Node):
72 elif isinstance(old_value, Node):
/external/chromium_org/v8/tools/
H A Dprofile_view.js78 * @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 Dsplaytree.js44 * @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...]
/external/llvm/lib/CodeGen/
H A DMachinePassRegistry.cpp36 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 Dprofile_view.js78 * @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 Dsplaytree.js44 * @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...]
/external/chromium_org/v8/test/mjsunit/regress/
H A Dregress-1713.js46 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));
H A Dregress-1713b.js46 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/clang/test/CodeGenCXX/
H A Dconstructor-template.cpp28 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 Dregress-1713.js46 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/chromium_org/third_party/WebKit/Source/devtools/front_end/
H A DDOMExtension.js36 Node.prototype.rangeOfWord = function(offset, stopCharacters, stayWithinNode, direction)
55 if (node.nodeType === Node.TEXT_NODE) {
90 if (node.nodeType === Node.TEXT_NODE) {
109 endOffset = stayWithinNode.nodeType === Node.TEXT_NODE ? stayWithinNode.nodeValue.length : stayWithinNode.childNodes.length;
123 Node.prototype.traverseNextTextNode = function(stayWithin)
129 while (node && node.nodeType !== Node.TEXT_NODE)
135 Node.prototype.rangeBoundaryForOffset = function(offset)
215 * @param {Node} fromNode
216 * @param {Node} toNode
253 Node
0 Node.prototype.rangeOfWord = function(offset, stopCharacters, stayWithinNode, direction) class
[all...]
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v4/
H A Dv8-splay.js132 * @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/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v5/
H A Dv8-splay.js132 * @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/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v6/
H A Dv8-splay.js133 * @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/chromium_org/v8/benchmarks/spinning-balls/
H A Dsplay-tree.js43 * @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/chromium_org/v8/benchmarks/
H A Dsplay.js138 * @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/clang/lib/AST/
H A DStmtViz.cpp35 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 DMipsISelDAGToDAG.h73 virtual std::pair<bool, SDNode*> selectNode(SDNode *Node) = 0;
76 inline SDValue getImm(const SDNode *Node, uint64_t Imm) { argument
77 return CurDAG->getTargetConstant(Imm, Node->getValueType(0));
/external/v8/benchmarks/spinning-balls/
H A Dsplay-tree.js43 * @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 Dsplay.js138 * @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 Dleak-tree.c24 } Node; typedef in typeref:struct:_Node
26 Node* mk(void)
28 Node *x = malloc(sizeof(Node));
35 Node* t;

Completed in 7529 milliseconds

1234567891011