| /external/chromium_org/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/chrome/common/extensions/docs/examples/extensions/managed_bookmarks/ |
| background.js | 6 * Maps policy names to the root node that they affect.
65 var Node = function(nodesMap, id, title, url) {
77 Node.prototype.isRoot = function() {
81 Node.prototype.getIndex = function() {
85 Node.prototype.appendChild = function(node) {
86 node._parentId = this._id;
87 this._children.push(node);
90 Node.prototype.droppedFromParent = function() {
93 var removeFromNodesMap = function(node) {
[all...] |
| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/ |
| math_semantic_tree.js | 16 goog.provide('cvox.SemanticTree.Node');
25 * @param {!Element} mml The original MathML 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>} */
75 * E.g. a node of type FENCED can have the opening and closing fences here.
76 * @type {!Array.<cvox.SemanticTree.Node>}
[all...] |
| /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...] |
| 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/chromium_org/remoting/test/ |
| fake_network_dispatcher.h | 28 class Node {
30 virtual ~Node() {};
37 // Deliver a packet sent by a different node.
48 // Must be called on the thread that the |node| works on.
49 void AddNode(Node* node);
50 void RemoveNode(Node* node);
58 typedef std::map<rtc::IPAddress, Node*> NodesMap;
|
| /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;
|
| /cts/suite/cts/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/native_client_sdk/src/libraries/nacl_io/ |
| node.h | 29 class Node;
32 typedef sdk_util::ScopedRef<Node> ScopedNode;
36 class Node : public sdk_util::RefObject {
38 explicit Node(Filesystem* filesystem);
39 virtual ~Node();
46 // Return true if the node permissions match the given open mode.
49 // Returns the emitter for this Node if it has one, if not, assume this
54 // Normal OS operations on a node (file), can be called by the kernel
58 // It is expected that the derived Node will fill with 0 when growing
102 // Returns 0 if node is a TT
[all...] |
| /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/chromium_org/third_party/WebKit/Source/devtools/front_end/ui/ |
| DOMExtension.js | 36 * @param {!Node} stayWithinNode
40 Node.prototype.rangeOfWord = function(offset, stopCharacters, stayWithinNode, direction)
51 var node = this;
52 while (node) {
53 if (node === stayWithinNode) {
59 if (node.nodeType === Node.TEXT_NODE) {
60 var start = (node === this ? (offset - 1) : (node.nodeValue.length - 1));
62 if (stopCharacters.indexOf(node.nodeValue[i]) !== -1)
[all...] |
| /external/chromium_org/third_party/WebKit/Source/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_org/chrome/browser/sync_file_system/ |
| subtree_set.cc | 13 SubtreeSet::Node::Node()
18 SubtreeSet::Node::Node(bool contained_as_subtree_root,
56 = Node(true, 1);
|
| subtree_set.h | 39 struct Node {
43 Node();
44 Node(bool contained_as_subtree_root,
49 typedef base::hash_map<StringType, Node> Subtrees;
51 // Contains the root of subtrees and all upward node to root.
|
| /external/chromium_org/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)
127 attributes are encountered, or if any other type of node is encountered.
132 if child.nodeType == Node.ELEMENT_NODE:
138 elif child.nodeType in [Node.TEXT_NODE, Node.CDATA_SECTION_NODE]
[all...] |
