/external/chromium_org/content/test/ |
H A D | content_browser_test_utils_internal.cc | 14 void NavigateFrameToURL(FrameTreeNode* node, const GURL& url) { argument 15 TestFrameNavigationObserver observer(node); 18 params.frame_tree_node_id = node->frame_tree_node_id(); 19 node->navigator()->GetController()->LoadURLWithParams(params);
|
/external/chromium_org/ui/base/models/ |
H A D | tree_node_iterator.h | 15 // Iterator that iterates over the descendants of a node. The iteration does 16 // not include the node itself, only the descendants. The following illustrates 19 // Node* node = iterator.Next(); 20 // // do something with node. 27 // evaluated on each tree node and if it evaluates to true the node and all 29 TreeNodeIterator(NodeType* node, bool (*prune)(NodeType*)) argument 33 // Move forward through the children list until the first non prunable node. 35 // Position at the top of the _positions list must point to a node the 37 for (; index < node 45 TreeNodeIterator(NodeType* node) argument 89 Position(PositionNodeType* node, int index) argument 92 PositionNodeType* node; member in struct:ui::TreeNodeIterator::Position [all...] |
/external/clang/www/analyzer/scripts/ |
H A D | menu.js | 5 node = navRoot.childNodes[i]; 6 if (node.nodeName=="LI") { 7 node.onmouseover=function() { 10 node.onmouseout=function() {
|
/external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/ |
H A D | PCommand.java | 3 package com.google.clearsilver.jsilver.syntax.node;
|
H A D | PExpression.java | 3 package com.google.clearsilver.jsilver.syntax.node;
|
H A D | PPosition.java | 3 package com.google.clearsilver.jsilver.syntax.node;
|
H A D | PVariable.java | 3 package com.google.clearsilver.jsilver.syntax.node;
|
H A D | Switch.java | 3 package com.google.clearsilver.jsilver.syntax.node;
|
H A D | ALoopCommand.java | 3 package com.google.clearsilver.jsilver.syntax.node; 62 public void setPosition(PPosition node) argument 69 if(node != null) 71 if(node.parent() != null) 73 node.parent().removeChild(node); 76 node.parent(this); 79 this._position_ = node; 87 public void setVariable(PVariable node) argument 94 if(node ! 112 setStart(PExpression node) argument 137 setEnd(PExpression node) argument 162 setCommand(PCommand node) argument [all...] |
/external/chromium_org/net/tools/tld_cleanup/ |
H A D | make_dafsa.py | 21 source node and ending at a common sink node. All internal nodes contain 23 the source node to the sink node. 27 Source node: [ children ] 28 Internal node: (label, [ children ]) 29 Sink node: None 36 starting from the source with no backtracking. Thus a node must have at 42 bits in a link (a reference to a child node) indicate if it has a size of one, 43 two or three bytes and if it is the last outgoing link from the actual node [all...] |
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/ |
H A D | group_util.js | 17 * If a node contains more characters than this, it should not be treated 18 * as a leaf node by the smart navigation algorithm. 34 * If a node contains any of these elements, it should not be treated 35 * as a leaf node by the smart navigation algorithm. 104 * Returns true if this is a leaf node for groups. 105 * true for a node => true for all child nodes 106 * true if node has no children 107 * @param {!Node} node The node to check. 108 * @return {boolean} true if this is at the "leaf node" leve [all...] |
/external/chromium_org/third_party/WebKit/Source/core/dom/ |
H A D | DocumentOrderedList.cpp | 35 void DocumentOrderedList::add(Node* node) argument 38 m_nodes.add(node); 50 unsigned short position = n->compareDocumentPositionInternal(node, Node::TreatShadowTreesAsComposed); 52 m_nodes.insertBefore(followingNode, node); 58 m_nodes.insertBefore(followingNode, node); 61 void DocumentOrderedList::parserAdd(Node* node) argument 63 ASSERT(m_nodes.isEmpty() || m_nodes.last()->compareDocumentPositionInternal(node, Node::TreatShadowTreesAsComposed) & Node::DOCUMENT_POSITION_FOLLOWING); 64 m_nodes.add(node); 67 void DocumentOrderedList::remove(const Node* node) argument 69 m_nodes.remove(const_cast<Node*>(node)); [all...] |
H A D | NodeRenderingTraversal.cpp | 41 if (!renderer->node()->isElementNode()) 43 if (toElement(renderer->node())->isInTopLayer()) 55 ContainerNode* parent(const Node* node, ParentDetails* details) argument 57 // FIXME: We should probably ASSERT(!node->document().childNeedsDistributionRecalc()) here, but 60 ASSERT(node); 61 if (isActiveInsertionPoint(*node)) 63 ComposedTreeWalker walker(node, ComposedTreeWalker::CanStartFromShadowBoundary); 67 bool contains(const ContainerNode* container, const Node* node) argument 69 while (node) { 70 if (node 77 nextSibling(const Node* node) argument 96 previousSibling(const Node* node) argument 115 lastChild(const Node* node) argument 122 pseudoAwarePreviousSibling(const Node* node) argument 138 pseudoAwareLastChild(const Node* node) argument 155 previous(const Node* node, const Node* stayWithin) argument 168 firstChild(const Node* node) argument 175 pseudoAwareNextSibling(const Node* node) argument 191 pseudoAwareFirstChild(const Node* node) argument 207 next(const Node* node, const Node* stayWithin) argument 224 nextSiblingRenderer(const Node* node) argument 234 previousSiblingRenderer(const Node* node) argument [all...] |
/external/chromium_org/third_party/angle/src/compiler/translator/ |
H A D | ValidateLimitations.h | 31 bool validateLoopType(TIntermLoop *node); 33 bool validateForLoopHeader(TIntermLoop *node); 35 int validateForLoopInit(TIntermLoop *node); 36 bool validateForLoopCond(TIntermLoop *node, int indexSymbolId); 37 bool validateForLoopExpr(TIntermLoop *node, int indexSymbolId); 41 bool validateFunctionCall(TIntermAggregate *node); 42 bool validateOperation(TIntermOperator *node, TIntermNode *operand); 46 bool isConstExpr(TIntermNode *node); 47 bool isConstIndexExpr(TIntermNode *node); 48 bool validateIndexing(TIntermBinary *node); [all...] |
/external/chromium_org/net/disk_cache/memory/ |
H A D | mem_rankings.h | 23 void Insert(MemEntryImpl* node); 26 void Remove(MemEntryImpl* node); 29 void UpdateRank(MemEntryImpl* node); 32 MemEntryImpl* GetNext(MemEntryImpl* node); 33 MemEntryImpl* GetPrev(MemEntryImpl* node);
|
/external/chromium_org/third_party/WebKit/Source/wtf/ |
H A D | DoublyLinkedList.h | 105 for (T* node = m_head; node; node = node->next()) 126 template<typename T> inline void DoublyLinkedList<T>::push(T* node) argument 130 m_head = node; 131 m_tail = node; 132 node->setPrev(0); 133 node->setNext(0); 138 m_head->setPrev(node); 144 append(T* node) argument 162 remove(T* node) argument 183 T* node = head(); local [all...] |
/external/chromium_org/chrome/common/extensions/docs/examples/api/downloads/download_filename_controller/ |
H A D | options.js | 7 this.node = document.getElementById('rule-template').cloneNode(true); 8 this.node.id = 'rule' + (Rule.next_id++); 9 this.node.rule = this; 10 rules.appendChild(this.node); 11 this.node.hidden = false; 22 this.node.id + '-enabled'; 34 var sib = rule.node.previousSibling; 35 rule.node.parentNode.removeChild(rule.node); 36 sib.parentNode.insertBefore(rule.node, si [all...] |
/external/chromium_org/third_party/WebKit/Source/core/xml/ |
H A D | XPathUtil.cpp | 37 bool isRootDomNode(Node* node) argument 39 return node && !node->parentNode(); 42 String stringValue(Node* node) argument 44 switch (node->nodeType()) { 50 return node->nodeValue(); 52 if (isRootDomNode(node) || node->isElementNode()) { 56 for (Node* n = node->firstChild(); n; n = NodeTraversal::next(*n, node)) { 70 isValidContextNode(Node* node) argument [all...] |
/external/jsilver/src/com/google/clearsilver/jsilver/syntax/ |
H A D | InlineRewriter.java | 22 import com.google.clearsilver.jsilver.syntax.node.ADataCommand; 23 import com.google.clearsilver.jsilver.syntax.node.AInlineCommand; 24 import com.google.clearsilver.jsilver.syntax.node.ANoopCommand; 25 import com.google.clearsilver.jsilver.syntax.node.PCommand; 26 import com.google.clearsilver.jsilver.syntax.node.TData; 64 public void caseADataCommand(ADataCommand node) { 65 TData data = node.getData(); 67 node.replaceBy(new ANoopCommand()); 77 public void caseAInlineCommand(AInlineCommand node) { 79 PCommand command = node 101 caseAInlineCommand(AInlineCommand node) argument [all...] |
/external/chromium_org/third_party/WebKit/Source/core/accessibility/ |
H A D | AXNodeObject.cpp | 51 AXNodeObject::AXNodeObject(Node* node) argument 58 , m_node(node) 62 PassRefPtr<AXNodeObject> AXNodeObject::create(Node* node) argument 64 return adoptRef(new AXNodeObject(node)); 74 static String accessibleNameForNode(Node* node) argument 76 if (!node) 79 if (node->isTextNode()) 80 return toText(node)->data(); 82 if (isHTMLInputElement(*node)) 83 return toHTMLInputElement(*node) 263 Node* node = this->node(); local 374 siblingWithAriaRole(String role, Node* node) argument 399 Node* node = this->node(); local 470 Node* node = this->node(); local 497 Node* node = this->node(); local 516 Node* node = this->node(); local 551 Node* node = this->node(); local 561 Node* node = this->node(); local 579 Node* node = this->node(); local 610 Node* node = this->node(); local 632 Node* node = this->node(); local 680 Node* node = this->node(); local 708 Node* node = this->node(); local 738 Node* node = this->node(); local 775 Node* node = this->node(); local 815 Node* node = this->node(); local 845 Node* node = this->node(); local 999 Node* node = this->node(); local 1097 Node* node = this->node(); local 1151 Node* node = this->node(); local 1206 Node* node = this->node(); local 1385 Node* node = this->node(); local 1429 Node* node = this->node(); local 1452 setNode(Node* node) argument 1497 Node* node = this->node(); local [all...] |
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
H A D | DTMDefaultBaseIterators.java | 39 * Construct a DTMDefaultBaseTraversers object from a DOM node. 61 * Construct a DTMDefaultBaseTraversers object from a DOM node. 72 * @param usePrevsib true if we want to build the previous sibling node array. 92 * with a start node (using iterator.setStartNode()). 174 * with a start node (using iterator.setStartNode()). 257 * returned (starting point for the next() search); for single-node 258 * iterators it may instead be initialized to point to that single node. 263 * Remembers the current node for the next call to gotoMark(). 273 * Restores the current node remembered by setMark(). 285 * Iterator that returns all immediate children of a given node 302 setStartNode(int node) argument 356 setStartNode(int node) argument 447 setStartNode(int node) argument 538 setStartNode(int node) argument 604 setStartNode(int node) argument 709 setStartNode(int node) argument 828 setStartNode(int node) argument 875 setStartNode(int node) argument 981 setStartNode(int node) argument 1046 setStartNode(int node) argument 1107 setStartNode(int node) argument 1300 setStartNode(int node) argument 1501 setStartNode(int node) argument 1652 setStartNode(int node) argument 1761 setStartNode(int node) argument 1827 setStartNode(int node) argument 2053 SingletonIterator(int node) argument 2065 SingletonIterator(int node, boolean constant) argument 2079 setStartNode(int node) argument [all...] |
/external/jsilver/src/com/google/clearsilver/jsilver/syntax/parser/ |
H A D | TokenIndex.java | 5 import com.google.clearsilver.jsilver.syntax.node.*; 13 public void caseTData(@SuppressWarnings("unused") TData node) argument 19 public void caseTComment(@SuppressWarnings("unused") TComment node) argument 25 public void caseTVar(@SuppressWarnings("unused") TVar node) argument 31 public void caseTLvar(@SuppressWarnings("unused") TLvar node) argument 37 public void caseTEvar(@SuppressWarnings("unused") TEvar node) argument 43 public void caseTUvar(@SuppressWarnings("unused") TUvar node) argument 49 public void caseTSet(@SuppressWarnings("unused") TSet node) argument 55 public void caseTIf(@SuppressWarnings("unused") TIf node) argument 61 public void caseTElseIf(@SuppressWarnings("unused") TElseIf node) argument 67 caseTElse(@uppressWarnings�) TElse node) argument 73 caseTWith(@uppressWarnings�) TWith node) argument 79 caseTEscape(@uppressWarnings�) TEscape node) argument 85 caseTAutoescape(@uppressWarnings�) TAutoescape node) argument 91 caseTLoop(@uppressWarnings�) TLoop node) argument 97 caseTEach(@uppressWarnings�) TEach node) argument 103 caseTAlt(@uppressWarnings�) TAlt node) argument 109 caseTName(@uppressWarnings�) TName node) argument 115 caseTDef(@uppressWarnings�) TDef node) argument 121 caseTCall(@uppressWarnings�) TCall node) argument 127 caseTInclude(@uppressWarnings�) TInclude node) argument 133 caseTLinclude(@uppressWarnings�) TLinclude node) argument 139 caseTContentType(@uppressWarnings�) TContentType node) argument 145 caseTInline(@uppressWarnings�) TInline node) argument 151 caseTComma(@uppressWarnings�) TComma node) argument 157 caseTBang(@uppressWarnings�) TBang node) argument 163 caseTAssignment(@uppressWarnings�) TAssignment node) argument 169 caseTEq(@uppressWarnings�) TEq node) argument 175 caseTNe(@uppressWarnings�) TNe node) argument 181 caseTLt(@uppressWarnings�) TLt node) argument 187 caseTGt(@uppressWarnings�) TGt node) argument 193 caseTLte(@uppressWarnings�) TLte node) argument 199 caseTGte(@uppressWarnings�) TGte node) argument 205 caseTAnd(@uppressWarnings�) TAnd node) argument 211 caseTOr(@uppressWarnings�) TOr node) argument 217 caseTString(@uppressWarnings�) TString node) argument 223 caseTHash(@uppressWarnings�) THash node) argument 229 caseTPlus(@uppressWarnings�) TPlus node) argument 235 caseTMinus(@uppressWarnings�) TMinus node) argument 241 caseTStar(@uppressWarnings�) TStar node) argument 247 caseTPercent(@uppressWarnings�) TPercent node) argument 253 caseTBracketOpen(@uppressWarnings�) TBracketOpen node) argument 259 caseTBracketClose(@uppressWarnings�) TBracketClose node) argument 265 caseTParenOpen(@uppressWarnings�) TParenOpen node) argument 271 caseTParenClose(@uppressWarnings�) TParenClose node) argument 277 caseTDot(@uppressWarnings�) TDot node) argument 283 caseTDollar(@uppressWarnings�) TDollar node) argument 289 caseTQuestion(@uppressWarnings�) TQuestion node) argument 295 caseTDecNumber(@uppressWarnings�) TDecNumber node) argument 301 caseTHexNumber(@uppressWarnings�) THexNumber node) argument 307 caseTWord(@uppressWarnings�) TWord node) argument 313 caseTSlash(@uppressWarnings�) TSlash node) argument 319 caseTCsOpen(@uppressWarnings�) TCsOpen node) argument 325 caseTCommentStart(@uppressWarnings�) TCommentStart node) argument 331 caseTCommandDelimiter(@uppressWarnings�) TCommandDelimiter node) argument 337 caseTHardDelimiter(@uppressWarnings�) THardDelimiter node) argument 343 caseTCsClose(@uppressWarnings�) TCsClose node) argument 349 caseEOF(@uppressWarnings�) EOF node) argument [all...] |
/external/chromium_org/chrome/browser/extensions/api/bookmarks/ |
H A D | bookmark_api_helpers.cc | 28 const BookmarkNode* node, 32 if (node->IsVisible()) { 34 node, 44 const BookmarkNode* node, 49 bookmark_tree_node->id = base::Int64ToString(node->id()); 51 const BookmarkNode* parent = node->parent(); 55 bookmark_tree_node->index.reset(new int(parent->GetIndexOf(node))); 58 if (!node->is_folder()) { 59 bookmark_tree_node->url.reset(new std::string(node->url().spec())); 62 base::Time t = node 27 AddNodeHelper(ChromeBookmarkClient* client, const BookmarkNode* node, std::vector<linked_ptr<BookmarkTreeNode> >* nodes, bool recurse, bool only_folders) argument 43 GetBookmarkTreeNode(ChromeBookmarkClient* client, const BookmarkNode* node, bool recurse, bool only_folders) argument 95 AddNode(ChromeBookmarkClient* client, const BookmarkNode* node, std::vector<linked_ptr<BookmarkTreeNode> >* nodes, bool recurse) argument 102 AddNodeFoldersOnly(ChromeBookmarkClient* client, const BookmarkNode* node, std::vector<linked_ptr<BookmarkTreeNode> >* nodes, bool recurse) argument 114 const BookmarkNode* node = GetBookmarkNodeByID(model, id); local 137 GetMetaInfo(const BookmarkNode& node, base::DictionaryValue* id_to_meta_info_map) argument [all...] |
/external/smack/src/org/jivesoftware/smackx/entitycaps/packet/ |
H A D | CapsExtension.java | 25 private String node, ver, hash; field in class:CapsExtension 30 public CapsExtension(String node, String version, String hash) { argument 31 this.node = node; 45 return node; 48 public void setNode(String node) { argument 49 this.node = node; 71 * node='http://code.google.com/p/exodus' 78 "node [all...] |
/external/chromium_org/third_party/WebKit/Source/core/rendering/svg/ |
H A D | RenderSVGTransformableContainer.cpp | 33 RenderSVGTransformableContainer::RenderSVGTransformableContainer(SVGGraphicsElement* node) argument 34 : RenderSVGContainer(node) 40 static bool hasValidPredecessor(const Node* node) argument 42 ASSERT(node); 43 while ((node = node->previousSibling())) { 44 if (node->isSVGElement() && toSVGElement(node)->isValid()) 54 Node* node = child->node(); local [all...] |