| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| SelectionOverlay.java | 157 private void paintSelectionFeedback(GCWrapper gcWrapper, List<NodeProxy> nodes,
161 // Group nodes into parent/child groups
163 for (INode node : nodes) {
173 for (INode node : nodes) {
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| TreeWizard.cs | 52 * In order to create nodes and navigate, this class needs a TreeAdaptor.
55 * iterating over the various nodes with a particular type.
133 * nodes such as function definition nodes (you'll want to seek
135 * dynamic searches; i.e., go find me all PLUS nodes.
205 * Walk the entire tree and make a node name to nodes mapping.
242 public FindTreeWizardVisitor(IList nodes) {
243 _nodes = nodes;
266 /** <summary>Return a List of tree nodes with token type ttype</summary> */
268 IList nodes = new List<object>()
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| TreeWizard.cs | 53 * In order to create nodes and navigate, this class needs a TreeAdaptor.
56 * iterating over the various nodes with a particular type.
151 * nodes such as function definition nodes (you'll want to seek
153 * dynamic searches; i.e., go find me all PLUS nodes.
232 * Walk the entire tree and make a node name to nodes mapping.
275 public FindTreeWizardVisitor( IList nodes )
277 _nodes = nodes;
305 /** <summary>Return a List of tree nodes with token type ttype</summary> */
308 IList nodes = new List<object>()
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| MoveHandler.java | 65 // Compute list of nodes being dragged within the layout, if any
66 List<INode> nodes = new ArrayList<INode>(); local
70 nodes.add(view.node);
73 mDraggedNodes = nodes;
75 mHorizontalDeps = mDependencyGraph.dependsOn(nodes, false /* verticalEdge */);
76 mVerticalDeps = mDependencyGraph.dependsOn(nodes, true /* verticalEdge */);
|
| /external/webkit/Source/WebCore/dom/ |
| ContainerNode.cpp | 59 static inline void collectNodes(Node* node, NodeVector& nodes)
62 nodes.append(child);
65 static void collectTargetNodes(Node* node, NodeVector& nodes)
68 nodes.append(node);
71 collectNodes(node, nodes);
365 Vector<RefPtr<Node>, 10> nodes; local
366 nodes.reserveInitialCapacity(childNodeCount());
368 nodes.append(n);
369 for (; nodes.size(); nodes.removeLast()
[all...] |
| /external/webkit/Source/WebCore/editing/ |
| markup.cpp | 120 StyledMarkupAccumulator(Vector<Node*>* nodes, EAbsoluteURLs shouldResolveURLs, EAnnotateForInterchange shouldAnnotate, const Range* range)
121 : MarkupAccumulator(nodes, shouldResolveURLs, range)
300 // If the node is not fully selected by the range, then we don't want to keep styles that affect its relationship to the nodes around it
301 // only the ones that affect it and the nodes within it.
524 String createMarkup(const Range* range, Vector<Node*>* nodes, EAnnotateForInterchange shouldAnnotate, bool convertBlocksToInlines, EAbsoluteURLs shouldResolveURLs)
558 StyledMarkupAccumulator accumulator(nodes, shouldResolveURLs, shouldAnnotate, updatedRange.get());
620 if (nodes)
621 nodes->append(ancestor);
630 // Add a wrapper span with the styles that all of the nodes in the markup inherit.
688 String createMarkup(const Node* node, EChildrenOnly childrenOnly, Vector<Node*>* nodes, EAbsoluteURLs shouldResolveURLs
[all...] |
| /external/webkit/Source/WebCore/platform/graphics/android/context/ |
| PlatformGraphicsContextRecording.cpp | 356 Vector<RecordingData*> &nodes)
360 , m_nodes(nodes)
443 Vector<RecordingData*> nodes; local
446 m_recording->m_tree.search(iclip, nodes);
448 size_t count = nodes.size();
449 ALOGV("Drawing %d nodes out of %d", count, m_recording->m_nodeCount);
452 nonCopyingSort(nodes.begin(), nodes.end(), CompareRecordingDataOrder);
457 ClippingPainter painter(recording(), context, canvas->getTotalMatrix(), nodes); local
465 GraphicsOperation::Operation* op = nodes[i]->m_operation
[all...] |
| /ndk/sources/host-tools/sed-4.2.1/lib/ |
| regcomp.c | 318 for (node_cnt = 0; node_cnt < init_state->nodes.nelem; ++node_cnt)
320 Idx node = init_state->nodes.elems[node_cnt];
321 re_token_type_t type = dfa->nodes[node].type;
325 re_set_fastmap (fastmap, icase, dfa->nodes[node].opr.c);
335 *p++ = dfa->nodes[node].opr.c;
337 && dfa->nodes[node].type == CHARACTER
338 && dfa->nodes[node].mb_partial)
339 *p++ = dfa->nodes[node].opr.c;
355 bitset_word_t w = dfa->nodes[node].opr.sbcset[i];
364 re_charset_t *cset = dfa->nodes[node].opr.mbcset
[all...] |
| /external/libxml2/include/libxml/ |
| xpathInternals.h | 383 xmlXPathDistinctSorted (xmlNodeSetPtr nodes);
385 xmlXPathDistinct (xmlNodeSetPtr nodes);
392 xmlXPathNodeLeadingSorted (xmlNodeSetPtr nodes,
398 xmlXPathNodeLeading (xmlNodeSetPtr nodes,
405 xmlXPathNodeTrailingSorted (xmlNodeSetPtr nodes,
411 xmlXPathNodeTrailing (xmlNodeSetPtr nodes,
|
| /external/webkit/Source/WebCore/xml/ |
| XPathFunctions.cpp | 324 const NodeSet& nodes = a.toNodeSet(); local
325 for (size_t i = 0; i < nodes.size(); ++i) {
326 String str = stringValue(nodes[i]);
352 // If there are several nodes with the same id, id() should return the first one.
368 // The local part of an XPath expanded-name matches DOM local name for most node types, except for namespace nodes and processing instruction nodes.
639 const NodeSet& nodes = a.toNodeSet(); local
643 for (unsigned i = 0; i < nodes.size(); i++)
644 sum += Value(stringValue(nodes[i])).toNumber();
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| TreeWizard.java | 42 * In order to create nodes and navigate, this class needs a TreeAdaptor.
45 * iterating over the various nodes with a particular type.
107 * nodes such as function definition nodes (you'll want to seek
109 * dynamic searches; i.e., go find me all PLUS nodes.
167 /** Walk the entire tree and make a node name to nodes mapping.
199 /** Return a List of tree nodes with token type ttype */
201 final List nodes = new ArrayList(); local
204 nodes.add(t);
207 return nodes;
[all...] |
| /external/antlr/antlr-3.4/runtime/Ruby/test/functional/template-output/ |
| template-output.rb | 398 nodes = ANTLR3::AST::CommonTreeNodeStream.new( tree )
399 nodes.token_stream = tokens
400 tree_parser = TreeRewriteTG::TreeParser.new( nodes )
|
| /external/chromium/chrome/browser/ui/gtk/bookmarks/ |
| bookmark_menu_controller_gtk.cc | 261 std::vector<const BookmarkNode*> nodes; local
263 nodes.push_back(node);
267 page_navigator_, parent, nodes));
|
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
| Antlr.Runtime.Tree.pas | 109 /// Is tree considered a nil node used to make lists of child nodes?
159 /// constructing these nodes so we should have this control for
181 /// For identifying trees. How to identify nodes so we can say "add node
187 /// <item>Number the nodes as they are created?</item>
267 /// Each rule that creates AST nodes will call this
331 /// <summary>A stream of tree nodes, accessing nodes from a tree of some kind </summary>
344 /// If you don't want to buffer up nodes, then this method makes no
351 /// i<0 indicates nodes in the past. So LT(-1) is previous node, but
363 /// <summary>Return the text of all nodes from start to stop, inclusive
[all...] |
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3commontreenodestream.h | 68 /// i<0 indicates nodes in the past. So LT(-1) is previous node, but
80 /// Where is this stream pulling nodes from? This is not the name, but
85 /// What adaptor can tell me how to interpret/navigate nodes and
90 /// As we flatten the tree, we use UP, DOWN nodes to represent
91 /// the tree structure. When debugging we need unique nodes
94 /// navigation nodes. Default should be false;
100 /// Return the text of all nodes from start to stop, inclusive.
101 /// If the stream does not buffer all the nodes then it can still
108 /// Return the text of all nodes from start to stop, inclusive, into the
110 /// If the stream does not buffer all the nodes then it can stil
194 pANTLR3_VECTOR nodes; member in struct:ANTLR3_COMMON_TREE_NODE_STREAM_struct
[all...] |
| /external/chromium/chrome/browser/accessibility/ |
| browser_accessibility.h | 68 // including this node, onto the end of |nodes|.
69 void DetachTree(std::vector<BrowserAccessibility*>* nodes);
|
| /external/chromium/chrome/browser/ui/views/bookmarks/ |
| bookmark_menu_controller_views.cc | 212 std::vector<const BookmarkNode*> nodes; local
213 nodes.push_back(menu_id_to_node_map_[id]);
219 nodes[0]->parent(),
220 nodes));
403 // to support different parents, but this would need to prune any nodes whose
404 // parent has been removed. As all nodes currently have the same parent, there
413 // Remove any descendants of the removed nodes in node_to_menu_id_map_.
|
| /external/openssl/apps/ |
| CA.pl | 8 # CA -newreq[-nodes] ... will generate a certificate request
67 print STDERR "usage: CA -newcert|-newreq|-newreq-nodes|-newca|-sign|-verify\n";
79 } elsif (/^-newreq-nodes$/) {
81 system ("$REQ -new -nodes -keyout newkey.pem -out newreq.pem $DAYS");
167 print STDERR "usage: CA -newcert|-newreq|-newreq-nodes|-newca|-sign|-verify\n";
|
| /external/quake/quake/src/QW/client/ |
| gl_refrag.c | 184 R_SplitEntityOnNode (cl.worldmodel->nodes);
|
| /external/quake/quake/src/WinQuake/ |
| gl_refrag.cpp | 184 R_SplitEntityOnNode (cl.worldmodel->nodes);
|
| /external/webkit/LayoutTests/dom/html/level1/core/ |
| hc_nodeappendchilddocfragment.js | 84 new nodes at the end of the list, they should be the
85 two Element nodes from the DocumentFragment.
|
| hc_nodechildnodesempty.js | 81 contain any nodes.
85 NodeList returned should not have any nodes.
|
| hc_textparseintolistofelements.js | 80 EntityReference nodes and two Text nodes. After
|
| /external/webkit/LayoutTests/dom/html/level2/core/ |
| hc_nodedocumentfragmentnormalize1.js | 78 Create a document fragment with two adjacent text nodes, normalize and see if the text nodes
|
| /external/webkit/LayoutTests/dom/xhtml/level1/core/ |
| hc_nodeappendchilddocfragment.js | 84 new nodes at the end of the list, they should be the
85 two Element nodes from the DocumentFragment.
|
