Searched refs:node (Results 101 - 125 of 2839) sorted by relevance

1234567891011>>

/external/chromium_org/third_party/WebKit/Source/devtools/scripts/jsdoc-validator/src/org/chromium/devtools/jsdoc/
H A DDoDidNodeVisitor.java7 * Pre-visit node. Visitable children (if any) of {@code node} will be visited afterwards.
8 * @param node
10 void doVisit(AstNode node); argument
13 * Post-visit node. The method is invoked once all visitable children (if any) of {@code node}
15 * @param node
17 void didVisit(AstNode node); argument
/external/chromium_org/third_party/sfntly/cpp/src/test/
H A Dtest_xml_utils.cc23 void InternalGetNodesWithName(const TiXmlNode* node, const std::string& name, argument
25 if (node->ValueStr() == name)
26 wanted_nodes->push_back(node);
27 for (const TiXmlNode* child = node->FirstChild();
33 TiXmlNodeVector* GetNodesWithName(const TiXmlNode* node, argument
36 InternalGetNodesWithName(node, name, wanted_nodes);
40 const TiXmlAttribute* GetAttribute(const TiXmlNode* node, argument
42 for (const TiXmlAttribute* attribute = node->ToElement()->FirstAttribute();
/external/chromium_org/third_party/skia/src/core/
H A DSkQuadTree.cpp57 void SkQuadTree::insert(Node* node, Entry* entry) { argument
59 if (NULL != node->fChildren[0]) {
60 switch(child_intersect(entry->fBounds, node->fSplitPoint)) {
62 this->insert(node->fChildren[kTopLeft], entry);
65 this->insert(node->fChildren[kTopRight], entry);
68 this->insert(node->fChildren[kBottomLeft], entry);
71 this->insert(node->fChildren[kBottomRight], entry);
74 node->fEntries.push(entry);
78 // No children yet, add to this node
79 node
86 split(Node* node) argument
113 search(Node* node, const SkIRect& query, SkTDArray<void*>* results) const argument
132 clear(Node* node) argument
[all...]
/external/chromium_org/tools/grit/grit/tool/
H A Dtoolbar_postprocess.py14 import grit.node.empty namespace
15 from grit.node import misc
31 grdnode: the root node of the grd xml data generated by
35 The root node of the processed GRD tree.
41 identifiers = grit.node.empty.IdentifiersNode()
55 for node in messages.children[:]:
56 name_attr = node.attrs['name']
98 previous_node = node
105 new_node = grit.node.empty.MessagesNode()
111 def AddIdentifiers(self, rctext, node)
[all...]
/external/sfntly/cpp/src/test/
H A Dtest_xml_utils.cc23 void InternalGetNodesWithName(const TiXmlNode* node, const std::string& name, argument
25 if (node->ValueStr() == name)
26 wanted_nodes->push_back(node);
27 for (const TiXmlNode* child = node->FirstChild();
33 TiXmlNodeVector* GetNodesWithName(const TiXmlNode* node, argument
36 InternalGetNodesWithName(node, name, wanted_nodes);
40 const TiXmlAttribute* GetAttribute(const TiXmlNode* node, argument
42 for (const TiXmlAttribute* attribute = node->ToElement()->FirstAttribute();
/external/skia/src/core/
H A DSkQuadTree.cpp57 void SkQuadTree::insert(Node* node, Entry* entry) { argument
59 if (NULL != node->fChildren[0]) {
60 switch(child_intersect(entry->fBounds, node->fSplitPoint)) {
62 this->insert(node->fChildren[kTopLeft], entry);
65 this->insert(node->fChildren[kTopRight], entry);
68 this->insert(node->fChildren[kBottomLeft], entry);
71 this->insert(node->fChildren[kBottomRight], entry);
74 node->fEntries.push(entry);
78 // No children yet, add to this node
79 node
86 split(Node* node) argument
113 search(Node* node, const SkIRect& query, SkTDArray<void*>* results) const argument
132 clear(Node* node) argument
[all...]
/external/chromium_org/chrome/browser/resources/sync_internals/
H A Dsync_node_browser.css5 #sync-node-browser-refresher {
9 #sync-node-browser-refresher > * {
13 #sync-node-browser-container {
18 #sync-node-tree-container {
29 #sync-node-tree {
36 #sync-node-tree .leaf .tree-label {
40 #sync-node-splitter {
50 #sync-node-details-container {
57 #node-details {
61 #node
[all...]
/external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/
H A DAAltCommand.java3 package com.google.clearsilver.jsilver.syntax.node;
52 public void setPosition(PPosition node) argument
59 if(node != null)
61 if(node.parent() != null)
63 node.parent().removeChild(node);
66 node.parent(this);
69 this._position_ = node;
77 public void setExpression(PExpression node) argument
84 if(node !
102 setCommand(PCommand node) argument
[all...]
H A DAAutoescapeCommand.java3 package com.google.clearsilver.jsilver.syntax.node;
52 public void setPosition(PPosition node) argument
59 if(node != null)
61 if(node.parent() != null)
63 node.parent().removeChild(node);
66 node.parent(this);
69 this._position_ = node;
77 public void setExpression(PExpression node) argument
84 if(node !
102 setCommand(PCommand node) argument
[all...]
H A DAEscapeCommand.java3 package com.google.clearsilver.jsilver.syntax.node;
52 public void setPosition(PPosition node) argument
59 if(node != null)
61 if(node.parent() != null)
63 node.parent().removeChild(node);
66 node.parent(this);
69 this._position_ = node;
77 public void setExpression(PExpression node) argument
84 if(node !
102 setCommand(PCommand node) argument
[all...]
H A DASetCommand.java3 package com.google.clearsilver.jsilver.syntax.node;
52 public void setPosition(PPosition node) argument
59 if(node != null)
61 if(node.parent() != null)
63 node.parent().removeChild(node);
66 node.parent(this);
69 this._position_ = node;
77 public void setVariable(PVariable node) argument
84 if(node !
102 setExpression(PExpression node) argument
[all...]
H A DSwitchable.java3 package com.google.clearsilver.jsilver.syntax.node;
/external/bluetooth/bluedroid/osi/src/
H A Dlist.c18 static list_node_t *list_free_node_(list_t *list, list_node_t *node);
76 assert(node != NULL);
79 list_node_t *node = (list_node_t *)malloc(sizeof(list_node_t)); local
80 if (!node)
83 node->next = prev_node->next;
84 node->data = data;
85 prev_node->next = node;
87 list->tail = node;
100 list_node_t *node = (list_node_t *)malloc(sizeof(list_node_t)); local
101 if (!node)
120 list_node_t *node = (list_node_t *)malloc(sizeof(list_node_t)); local
215 list_next(const list_node_t *node) argument
222 list_node(const list_node_t *node) argument
227 list_free_node_(list_t *list, list_node_t *node) argument
[all...]
/external/chromium_org/components/bookmarks/test/
H A Dtest_bookmark_client.cc36 bool TestBookmarkClient::IsExtraNodeRoot(const BookmarkNode* node) { argument
38 if (node == extra_nodes_[i])
44 bool TestBookmarkClient::IsAnExtraNode(const BookmarkNode* node) { argument
45 if (!node)
48 if (node->HasAncestor(extra_nodes_[i]))
55 const BookmarkPermanentNode* node) {
56 DCHECK(node->type() == BookmarkNode::BOOKMARK_BAR ||
57 node->type() == BookmarkNode::OTHER_NODE ||
58 node->type() == BookmarkNode::MOBILE ||
59 IsExtraNodeRoot(node));
54 IsPermanentNodeVisible( const BookmarkPermanentNode* node) argument
76 CanSyncNode(const BookmarkNode* node) argument
80 CanBeEditedByUser(const BookmarkNode* node) argument
[all...]
/external/chromium_org/third_party/WebKit/Source/core/inspector/
H A DInspectorNodeIds.cpp18 int InspectorNodeIds::idForNode(Node* node) argument
22 int result = ids.value(node);
25 ids.put(node, result);
32 return nodeIds().node(id);
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i965/
H A Dbrw_fs_live_variables.h57 void *node; local
59 node = rzalloc_size(ctx, size);
60 assert(node != NULL);
62 return node;
/external/chromium_org/ui/views/controls/tree/
H A Dtree_view_controller.cc12 bool TreeViewController::CanEdit(TreeView* tree_view, ui::TreeModelNode* node) { argument
/external/chromium_org/ui/webui/resources/js/
H A Devent_tracker.js35 * @typedef {{node: !Node,
45 * @param {!Node} node The DOM node to add a listener to.
50 add: function(node, eventType, listener, capture) {
52 node: node,
58 node.addEventListener(eventType, listener, capture);
63 * @param {!Node} node The DOM node to remove a listener from.
66 remove: function(node, eventTyp
[all...]
/external/chromium_org/v8/src/
H A Drewriter.cc63 virtual void Visit##type(type* node);
80 void Processor::VisitBlock(Block* node) { argument
89 if (!node->is_initializer_block()) Process(node->statements());
93 void Processor::VisitModuleStatement(ModuleStatement* node) { argument
95 Visit(node->body());
100 void Processor::VisitExpressionStatement(ExpressionStatement* node) { argument
102 if (!is_set_ && !node->expression()->IsThrow()) {
103 node->set_expression(SetResult(node
109 VisitIfStatement(IfStatement* node) argument
120 VisitIterationStatement(IterationStatement* node) argument
128 VisitDoWhileStatement(DoWhileStatement* node) argument
133 VisitWhileStatement(WhileStatement* node) argument
138 VisitForStatement(ForStatement* node) argument
143 VisitForInStatement(ForInStatement* node) argument
148 VisitForOfStatement(ForOfStatement* node) argument
153 VisitTryCatchStatement(TryCatchStatement* node) argument
165 VisitTryFinallyStatement(TryFinallyStatement* node) argument
175 VisitSwitchStatement(SwitchStatement* node) argument
187 VisitContinueStatement(ContinueStatement* node) argument
192 VisitBreakStatement(BreakStatement* node) argument
197 VisitWithStatement(WithStatement* node) argument
205 VisitVariableDeclaration(VariableDeclaration* node) argument
206 VisitFunctionDeclaration(FunctionDeclaration* node) argument
207 VisitModuleDeclaration(ModuleDeclaration* node) argument
208 VisitImportDeclaration(ImportDeclaration* node) argument
209 VisitExportDeclaration(ExportDeclaration* node) argument
210 VisitModuleLiteral(ModuleLiteral* node) argument
211 VisitModuleVariable(ModuleVariable* node) argument
212 VisitModulePath(ModulePath* node) argument
213 VisitModuleUrl(ModuleUrl* node) argument
214 VisitEmptyStatement(EmptyStatement* node) argument
215 VisitReturnStatement(ReturnStatement* node) argument
216 VisitDebuggerStatement(DebuggerStatement* node) argument
[all...]
/external/ltrace/
H A Dexpr.h54 } node; member in union:expr_node::__anon25784
79 void expr_init_self(struct expr_node *node);
83 void expr_init_named(struct expr_node *node,
87 void expr_init_argno(struct expr_node *node, size_t num);
91 void expr_init_const(struct expr_node *node, struct value *val);
92 void expr_init_const_word(struct expr_node *node, long l,
97 void expr_init_index(struct expr_node *node,
103 void expr_init_up(struct expr_node *node, struct expr_node *lhs, int own_lhs);
107 void expr_init_cb1(struct expr_node *node,
117 void expr_init_cb2(struct expr_node *node,
[all...]
/external/mesa3d/src/mesa/drivers/dri/i965/
H A Dbrw_fs_live_variables.h57 void *node; local
59 node = rzalloc_size(ctx, size);
60 assert(node != NULL);
62 return node;
/external/chromium_org/ppapi/generators/
H A Didl_c_proto.py43 def Comment(node, prefix=None, tabs=0):
44 # Generate a comment block from the provided Comment node.
45 comment = node.GetName()
49 # for this node.
60 def GetNodeComments(node, tabs=0):
62 # the provided node.
64 for doc in node.GetListOf('Comment'):
206 def GetMacroHelper(self, node):
207 macro = node.GetProperty('macro')
209 name = node
[all...]
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/tree/
H A Ddebug.rb22 node = super
23 @debug_listener.create_node( node, payload )
24 return node
28 node = super
29 @debug_listener.create_node( node )
30 return node
34 node = super
35 @debug_listener.create_node( node )
36 return node
40 node
[all...]
/external/chromium_org/chrome/common/extensions/docs/examples/extensions/irc/servlet/jstemplate/
H A Dutil.js200 * Creates a new node in the given document
212 * node and invokes the given callback as a method on every element
213 * node encountered.
215 * @param {Element} node Parent element of the subtree to traverse.
216 * @param {Function} callback Called on each node in the traversal.
218 function domTraverseElements(node, callback) {
220 traverser.run(node);
225 * @param {Function} callback Called on each node in the traversal.
235 * @param {Element} root The root node of the traversal.
246 * Processes a single node
[all...]
/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/common/
H A Dlru_cache.py62 node = Node(key, value)
63 node.prev = self._first
64 self._first.next = node
65 self._first = node
66 self._dict[key] = node
69 node = Node(key, value)
70 self._dict[key] = node
71 self._first = node
72 self._last = node
91 node
[all...]

Completed in 3026 milliseconds

1234567891011>>