Searched defs:Node (Results 1 - 25 of 302) 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/llvm/unittests/ADT/
H A DilistTest.cpp20 struct Node : ilist_node<Node> { struct in namespace:__anon26467
23 Node() {} function in struct:__anon26467::Node
24 Node(int _Value) : Value(_Value) {} function in struct:__anon26467::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/chrome/common/extensions/docs/examples/extensions/managed_bookmarks/
H A Dbackground.js65 var Node = function(nodesMap, id, title, url) { class
77 Node.prototype.isRoot = function() {
81 Node.prototype.getIndex = function() {
85 Node.prototype.appendChild = function(node) {
90 Node.prototype.droppedFromParent = function() {
105 Node.prototype.matches = function(bookmark) {
114 Node.prototype.updateChildren = function(wantedChildren, callbackChain) {
133 // The "id" comes with the callback from bookmarks.create() but the Node
135 var newChild = new Node(
165 * Creates new nodes in the bookmark model to represent this Node an
[all...]
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/
H A Dmath_semantic_tree.js16 goog.provide('cvox.SemanticTree.Node');
36 * @type {Node}
40 /** @type {cvox.SemanticTree.Node} */
46 * @param {number} id Node id.
49 cvox.SemanticTree.Node = function(id) {
56 /** @type {cvox.SemanticTree.Node} */
68 /** @type {!Array.<cvox.SemanticTree.Node>} */
76 * @type {!Array.<cvox.SemanticTree.Node>}
85 * @param {function(cvox.SemanticTree.Node): boolean} pred The predicate.
86 * @return {!Array.<cvox.SemanticTree.Node>} Th
[all...]
/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...]
H A Dprofile.js272 * @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/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/chromium_org/remoting/test/
H A Dfake_network_dispatcher.h28 class Node { class in class:remoting::FakeNetworkDispatcher
30 virtual ~Node() {};
49 void AddNode(Node* node);
50 void RemoveNode(Node* node);
58 typedef std::map<rtc::IPAddress, Node*> NodesMap;
/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/chromium_org/native_client_sdk/src/libraries/nacl_io/
H A Dnode.h29 class Node;
32 typedef sdk_util::ScopedRef<Node> ScopedNode;
36 class Node : public sdk_util::RefObject { class in namespace:nacl_io
38 explicit Node(Filesystem* filesystem);
39 virtual ~Node();
49 // Returns the emitter for this Node if it has one, if not, assume this
58 // It is expected that the derived Node will fill with 0 when growing
/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.h115 virtual std::pair<bool, SDNode*> selectNode(SDNode *Node) = 0;
118 inline SDValue getImm(const SDNode *Node, uint64_t Imm) { argument
119 return CurDAG->getTargetConstant(Imm, Node->getValueType(0));
/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;
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/ui/
H A DDOMExtension.js36 * @param {!Node} stayWithinNode
40 Node.prototype.rangeOfWord = function(offset, stopCharacters, stayWithinNode, direction)
59 if (node.nodeType === Node.TEXT_NODE) {
94 if (node.nodeType === Node.TEXT_NODE) {
113 endOffset = stayWithinNode.nodeType === Node.TEXT_NODE ? stayWithinNode.nodeValue.length : stayWithinNode.childNodes.length;
128 * @param {!Node=} stayWithin
129 * @return {?Node}
131 Node.prototype.traverseNextTextNode = function(stayWithin)
137 while (node && node.nodeType !== Node.TEXT_NODE)
145 * @return {!{container: !Node, offse
0 Node.prototype.rangeOfWord = function(offset, stopCharacters, stayWithinNode, direction) class
[all...]
/external/chromium_org/third_party/WebKit/Source/platform/text/
H A DSuffixTree.h58 Node* current = &m_root;
69 class Node { class in class:blink::SuffixTree
71 Node(bool isLeaf = false) function in class:blink::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_org/chrome/browser/sync_file_system/
H A Dsubtree_set.cc13 SubtreeSet::Node::Node() function in class:sync_file_system::SubtreeSet::Node
18 SubtreeSet::Node::Node(bool contained_as_subtree_root, function in class:sync_file_system::SubtreeSet::Node
56 = Node(true, 1);
H A Dsubtree_set.h39 struct Node { struct in class:sync_file_system::SubtreeSet
43 Node();
44 Node(bool contained_as_subtree_root,
49 typedef base::hash_map<StringType, Node> Subtrees;

Completed in 700 milliseconds

1234567891011>>