Searched defs:Node (Results 26 - 50 of 302) sorted by path

1234567891011>>

/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/third_party/WebKit/Source/core/dom/
H A DNode.cpp26 #include "core/dom/Node.h"
111 COMPILE_ASSERT(sizeof(Node) <= sizeof(SameSizeAsNode), Node_should_stay_small);
114 void* Node::operator new(size_t size)
120 void Node::operator delete(void* ptr)
128 typedef WillBeHeapHashSet<RawPtrWillBeWeakMember<Node> > WeakNodeSet;
136 void Node::dumpStatistics()
160 Node* node = *it;
245 printf(" Number of Attributes (non-Node and Node): %zu [%zu]\n", attributes, sizeof(Attribute));
254 void Node
265 Node::Node(TreeScope* treeScope, ConstructionType type) function in class:blink::Node
907 commonAncestor(const Node& other, Node* (*parent)(const Node&)) argument
[all...]
H A DNode.h84 typedef StaticNodeTypeList<Node> StaticNodeList;
117 #define NODE_BASE_CLASSES public GarbageCollectedFinalized<Node>, public EventTarget
120 // Node::m_nodeFlags on 64bit platforms.
121 #define NODE_BASE_CLASSES public EventTarget, public TreeShared<Node>
124 class Node : NODE_BASE_CLASSES { class in namespace:blink
125 DEFINE_EVENT_TARGET_REFCOUNTING_WILL_BE_REMOVED(TreeShared<Node>);
127 WILL_BE_USING_GARBAGE_COLLECTED_MIXIN(Node);
174 virtual ~Node();
176 // DOM methods & attributes for Node
188 Node* previousSiblin
[all...]
/external/chromium_org/third_party/WebKit/Source/core/editing/
H A Dhtmlediting.cpp68 bool isAtomicNode(const Node *node)
85 Node* nodeA = commonScope->ancestorInThisScope(a.containerNode());
90 Node* nodeB = commonScope->ancestorInThisScope(b.containerNode());
141 Element* lowestEditableAncestor(Node* node)
156 Node* node = p.parentAnchoredEquivalent().anchorNode();
172 Node* node = pos.deprecatedNode();
179 Node* node = p.deprecatedNode();
191 Node* node = p.containerNode();
270 Node* shadowAncestor = highestRoot->treeScope().ancestorInThisScope(editablePosition.deprecatedNode());
291 Position lastEditablePositionBeforePositionInRoot(const Position& position, Node* highestRoo
591 enclosingNodeOfType(const Position& p, bool (*nodeIsOfType)(const Node*), EditingBoundaryCrossingRule rule) argument
613 highestEnclosingNodeOfType(const Position& p, bool (*nodeIsOfType)(const Node*), EditingBoundaryCrossingRule rule, Node* stayWithin) argument
[all...]
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/profiler/
H A DHeapSnapshotCommon.js125 WebInspector.HeapSnapshotCommon.Node = function(id, name, distance, nodeIndex, retainedSize, selfSize, type)
142 * @param {!WebInspector.HeapSnapshotCommon.Node} node
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/resources/
H A DDirectoryContentView.js67 this.rootNode().appendChild(new WebInspector.DirectoryContentView.Node(entries[i]));
75 this.sortNodes(WebInspector.DirectoryContentView.Node.comparator(column), !this.isSortOrderAscending());
86 WebInspector.DirectoryContentView.Node = function(entry)
107 WebInspector.DirectoryContentView.Node.comparator = function(column)
165 WebInspector.DirectoryContentView.Node.prototype = {
/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/devtools/scripts/closure/
H A Dcompiler.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/javascript/ com/google/javascript/jscomp/ ...
/external/chromium_org/third_party/WebKit/Source/platform/
H A DPODRedBlackTree.h99 class Node;
125 : m_arena(PODFreeListArena<Node>::create())
136 explicit PODRedBlackTree(PassRefPtr<PODFreeListArena<Node> > arena)
165 m_arena = PODFreeListArena<Node>::create();
168 void initIfNeeded(PODFreeListArena<Node>* arena)
177 Node* node = m_arena->template allocateObject<T>(data);
185 Node* node = treeSearch(data);
251 // The base Node class which is stored in the tree. Nodes are only
254 class Node { class in class:blink::PODRedBlackTree
255 WTF_MAKE_NONCOPYABLE(Node);
258 explicit Node(const T& data) function in class:blink::PODRedBlackTree::Node
[all...]
/external/chromium_org/third_party/WebKit/Source/platform/heap/
H A DHeapLinkedStack.h54 for (Node* current = m_head; current; current = current->m_next)
59 class Node : public GarbageCollected<Node> { class in class:blink::HeapLinkedStack
61 Node(const T&, Node* next);
66 Member<Node> m_next;
69 Member<Node> m_head;
74 HeapLinkedStack<T>::Node::Node(const T& data, Node* nex function in class:blink::HeapLinkedStack::Node
[all...]
H A DHeapTest.cpp633 class Node : public GarbageCollected<Node> { class in namespace:blink
635 static Node* create(int i)
637 return new Node(i);
645 Node(int i) : m_value(i) { } function in class:blink::Node
1696 Persistent<Node> typedHeapObject = Node::create(0);
5322 s_node = new Persistent<Node>(Node::create(10));
5327 static Persistent<Node>* s_nod
[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/third_party/WebKit/Source/web/
H A DWebNode.cpp37 #include "core/dom/Node.h"
230 const Node& coreNode = *constUnwrap<Node>();
246 const Node* coreNode = constUnwrap<Node>();
250 WebNode::WebNode(const PassRefPtrWillBeRawPtr<Node>& node)
255 WebNode& WebNode::operator=(const PassRefPtrWillBeRawPtr<Node>& node)
261 WebNode::operator PassRefPtrWillBeRawPtr<Node>() const
/external/chromium_org/third_party/WebKit/Source/wtf/
H A DLinkedHashSet.h145 typedef LinkedHashSetNode<Value, Allocator> Node; typedef in class:WTF::LinkedHashSet
150 typedef HashTable<Node, Node, IdentityExtractor,
254 Node* anchor() { return reinterpret_cast<Node*>(&m_anchor); }
255 const Node* anchor() const { return reinterpret_cast<const Node*>(&m_anchor); }
256 Node* firstNode() { return reinterpret_cast<Node*>(m_anchor.m_next); }
257 const Node* firstNod
272 typedef LinkedHashSetNode<Value, Allocator> Node; typedef in struct:WTF::LinkedHashSetTranslator
299 typedef LinkedHashSetNode<Value, Allocator> Node; typedef in struct:WTF::LinkedHashSetTraits
330 typedef typename LinkedHashSetType::Node Node; typedef in class:WTF::LinkedHashSetIterator
372 typedef typename LinkedHashSetType::Node Node; typedef in class:WTF::LinkedHashSetConstIterator
444 typedef typename LinkedHashSetType::Node Node; typedef in class:WTF::LinkedHashSetReverseIterator
464 typedef typename LinkedHashSetType::Node Node; typedef in class:WTF::LinkedHashSetConstReverseIterator
[all...]
H A DLinkedStack.h56 class Node { class in class:WTF::LinkedStack
59 Node(const T&, PassOwnPtr<Node> next);
62 OwnPtr<Node> m_next;
66 OwnPtr<Node> m_head;
71 LinkedStack<T>::Node::Node(const T& data, PassOwnPtr<Node> next) function in class:WTF::LinkedStack::Node
86 m_head = adoptPtr(new Node(data, m_head.release()));
H A DListHashSet.h82 typedef ListHashSetNode<ValueArg, Allocator> Node; typedef in class:WTF::ListHashSet
83 typedef HashTraits<Node*> NodeTraits;
87 typedef HashTable<Node*, Node*, IdentityExtractor, NodeHash, NodeTraits, NodeTraits, typename Allocator::TableAllocator> ImplType;
88 typedef HashTableIterator<Node*, Node*, IdentityExtractor, NodeHash, NodeTraits, NodeTraits, typename Allocator::TableAllocator> ImplTypeIterator;
89 typedef HashTableConstIterator<Node*, Node*, IdentityExtractor, NodeHash, NodeTraits, NodeTraits, typename Allocator::TableAllocator> ImplTypeConstIterator;
111 HashTableAddResult(Node* storedValue, bool isNewEntry) : storedValue(storedValue), isNewEntry(isNewEntry) { }
112 Node* storedValu
250 typedef ListHashSetNode<ValueArg, ListHashSetAllocator> Node; typedef in struct:WTF::ListHashSetAllocator
440 typedef typename Set::Node Node; typedef in class:WTF::ListHashSetIterator
480 typedef typename Set::Node Node; typedef in class:WTF::ListHashSetConstIterator
548 typedef typename Set::Node Node; typedef in class:WTF::ListHashSetReverseIterator
587 typedef typename Set::Node Node; typedef in class:WTF::ListHashSetConstReverseIterator
[all...]
/external/chromium_org/third_party/WebKit/Tools/Scripts/
H A Dmalloc-tree61 class Node: class in inherits:
73 newChild = Node(name, self.level + 1)
189 node = Node(name, 0, bytes);
/external/chromium_org/third_party/android_platform/webview/
H A Dframeworks.jarMETA-INF/ META-INF/MANIFEST.MF android/ android/location/ android/location/Address$1.class ...
/external/chromium_org/third_party/bintrees/bintrees/
H A Davltree.py40 class Node(object): class in inherits:object
149 return Node(key, value)
H A Dbintree.py16 class Node(object): class in inherits:object
92 return Node(key, value)
H A Drbtree.py42 class Node(object): class in inherits:object
149 return Node(key, value)
158 head = Node() # False tree root
207 head = Node() # False tree root
/external/chromium_org/third_party/checkstyle/
H A Dcheckstyle-5.7-all.jarMETA-INF/MANIFEST.MF META-INF/ checkstyle_packages.xml checkstylecompilation.properties checkstyletask.properties com/ ...
/external/chromium_org/third_party/closure_compiler/compiler/
H A Dcompiler.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/debugging/ com/google/debugging/sourcemap/ ...

Completed in 507 milliseconds

1234567891011>>