| /external/chromium_org/chrome/browser/extensions/api/bookmarks/ |
| bookmark_api_helpers.h | 29 // Add a JSON representation of |node| to the JSON |nodes|.
32 std::vector<linked_ptr<api::bookmarks::BookmarkTreeNode> >* nodes,
38 api::bookmarks::BookmarkTreeNode> >* nodes,
|
| /external/chromium_org/chrome/browser/ui/views/bookmarks/ |
| bookmark_drag_drop_views.cc | 26 const std::vector<const BookmarkNode*>& nodes,
29 DCHECK(!nodes.empty());
33 BookmarkNodeData drag_data(nodes);
42 if (bookmark_utils::CanAllBeEditedByUser(model->client(), nodes))
140 std::vector<const BookmarkNode*> nodes = data.GetNodes(model, profile_path); local
141 for (size_t i = 0; i < nodes.size(); ++i) {
143 // nodes being dragged.
144 const BookmarkNode* node = nodes[i];
146 drop_parent->GetIndexOf(nodes[i]) : -1;
|
| /external/chromium_org/components/bookmarks/browser/ |
| bookmark_expanded_state_tracker.h | 18 // BookmarkExpandedStateTracker is used to track a set of expanded nodes. The
19 // nodes are persisted in preferences. If an expanded node is removed from the
23 typedef std::set<const BookmarkNode*> Nodes;
29 // The set of expanded nodes.
30 void SetExpandedNodes(const Nodes& nodes);
31 Nodes GetExpandedNodes();
50 void UpdatePrefs(const Nodes& nodes);
|
| bookmark_utils.h | 39 // Clones bookmark node, adding newly created nodes to |parent| starting at
49 // Copies nodes onto the clipboard. If |remove_nodes| is true the nodes are
50 // removed after copied to the clipboard. The nodes are copied in such a way
53 const std::vector<const BookmarkNode*>& nodes,
56 // Pastes from the clipboard. The new nodes are added to |parent|, unless
57 // |parent| is null in which case this does nothing. The nodes are inserted
58 // at |index|. If |index| is -1 the nodes are added to the end.
72 // only nodes of type url.
75 std::vector<const BookmarkNode*>* nodes);
[all...] |
| bookmark_node_data.cc | 108 const std::vector<const BookmarkNode*>& nodes) {
109 ReadFromVector(nodes);
125 const std::vector<const BookmarkNode*>& nodes) {
128 if (nodes.empty())
131 for (size_t i = 0; i < nodes.size(); ++i)
132 elements.push_back(Element(nodes[i]));
248 std::vector<const BookmarkNode*> nodes; local
251 return nodes;
256 nodes.clear();
257 return nodes;
267 std::vector<const BookmarkNode*> nodes = GetNodes(model, profile_path); local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| StaticNodeList.cpp | 37 PassRefPtrWillBeRawPtr<StaticNodeList> StaticNodeList::adopt(WillBeHeapVector<RefPtrWillBeMember<Node> >& nodes)
40 nodeList->m_nodes.swap(nodes);
|
| StaticNodeList.h | 44 static PassRefPtrWillBeRawPtr<StaticNodeList> adopt(WillBeHeapVector<RefPtrWillBeMember<Node> >& nodes);
|
| /external/chromium_org/third_party/WebKit/Source/core/inspector/ |
| InspectorMemoryAgent.h | 53 virtual void getDOMCounters(ErrorString*, int* documents, int* nodes, int* jsEventListeners) OVERRIDE;
|
| /external/chromium_org/components/query_parser/ |
| query_parser.h | 88 // Parses |query|, returning the nodes that constitute the valid words in the
90 // the nodes passes to the caller.
92 QueryNodeStarVector* nodes);
94 // Returns true if the string text matches the query nodes created by a call
98 const QueryNodeStarVector& nodes,
101 // Returns true if all of the |words| match the query |nodes| created by a
104 const QueryNodeStarVector& nodes);
115 // Does the work of parsing |query|; creates nodes in |root| as appropriate.
|
| /external/chromium_org/third_party/freetype/src/cache/ |
| ftcmru.c | 177 list->nodes = NULL;
187 while ( list->nodes )
188 FTC_MruList_Remove( list, list->nodes );
210 first = list->nodes;
221 FTC_MruNode_Up( &list->nodes, node );
247 node = list->nodes->prev;
253 FTC_MruNode_Up( &list->nodes, node );
260 FTC_MruNode_Remove( &list->nodes, node );
273 FTC_MruNode_Prepend( &list->nodes, node );
311 FTC_MruNode_Remove( &list->nodes, node )
[all...] |
| /external/chromium_org/third_party/openssl/openssl/crypto/x509v3/ |
| pcy_lib.c | 115 if (level->nodes)
116 n += sk_X509_POLICY_NODE_num(level->nodes);
130 return sk_X509_POLICY_NODE_value(level->nodes, i);
|
| /external/freetype/src/cache/ |
| ftcmru.c | 177 list->nodes = NULL;
187 while ( list->nodes )
188 FTC_MruList_Remove( list, list->nodes );
210 first = list->nodes;
221 FTC_MruNode_Up( &list->nodes, node );
247 node = list->nodes->prev;
253 FTC_MruNode_Up( &list->nodes, node );
260 FTC_MruNode_Remove( &list->nodes, node );
273 FTC_MruNode_Prepend( &list->nodes, node );
311 FTC_MruNode_Remove( &list->nodes, node )
[all...] |
| /external/openssl/crypto/x509v3/ |
| pcy_lib.c | 115 if (level->nodes)
116 n += sk_X509_POLICY_NODE_num(level->nodes);
130 return sk_X509_POLICY_NODE_value(level->nodes, i);
|
| /external/robolectric/src/main/java/com/xtremelabs/robolectric/res/ |
| XpathResourceXmlLoader.java | 23 NodeList nodes = (NodeList) stringsXPath.evaluate(document, XPathConstants.NODESET); local
24 for (int i = 0; i < nodes.getLength(); i++) {
25 Node node = nodes.item(i);
|
| /frameworks/testing/espresso/espresso-lib/src/main/java/com/google/android/apps/common/testing/ui/espresso/util/ |
| TreeIterables.java | 139 * Converts a tree into an Iterable of the tree's nodes presented in a given traversal order.
155 final LinkedList<T> nodes = Lists.newLinkedList();
156 nodes.add(root);
160 if (nodes.isEmpty()) {
163 T nextItem = checkNotNull(traversalStrategy.next(nodes), "Null items not allowed!");
164 traversalStrategy.combineNewChildren(nodes, treeViewer.children(nextItem));
175 <T> void combineNewChildren(LinkedList<T> nodes, Collection<T> newChildren) {
176 nodes.addAll(newChildren);
180 <T> void combineNewChildren(LinkedList<T> nodes, Collection<T> newChildren) {
181 nodes.addAll(0, newChildren)
[all...] |
| /external/antlr/antlr-3.4/runtime/Ruby/test/functional/tree-parser/ |
| basic.rb | 37 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
38 nodes.token_stream = tokens
39 walker = FlatListWalker::TreeParser.new( nodes )
73 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
74 nodes.token_stream = tokens
75 walker = SimpleTreeWalker::TreeParser.new( nodes )
112 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
113 nodes.token_stream = tokens
114 walker = FlatVsTreeDecisionWalker::TreeParser.new( nodes )
150 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree
[all...] |
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| FuncKey.java | 61 XNodeSet nodes = null; local
138 nodes = new XNodeSet(upi);
143 nodes = kmgr.getNodeSetDTMByKey(xctxt, docContext, keyname,
146 nodes.setRoot(xctxt.getCurrentNode(), xctxt);
149 return nodes;
|
| /libcore/dom/src/test/java/org/w3c/domts/level2/core/ |
| documentimportnode21.java | 40 * second element node whose tagName is address and import these nodes into another document.
41 * Verify if the nodes have been imported correctly by checking the nodeNames of the
42 * imported nodes, since they are imported into a new document which doesnot have thes defined,
43 * the imported nodes should not have any children.
44 * Now import the entityRef nodes into the same document and verify if the nodes have been
45 * imported correctly by checking the nodeNames of the imported nodes, and by checking the
46 * value of the replacement text of the imported nodes.
97 NodeList nodes; local
120 nodes = entRefImp2.getChildNodes()
[all...] |
| /external/chromium_org/chrome/browser/resources/ |
| about_stats.js | 40 /* Do the filter work. Hide all nodes matching node.*/
56 var nodes = document.getElementsByName('counter');
57 filterMatching(text, nodes, getCounterNameFromCounterNode);
58 var nodes = document.getElementsByName('timer');
59 filterMatching(text, nodes, getTimerNameFromTimerNode);
64 var nodes = document.getElementsByName('counter');
65 for (var i = 0, node; node = nodes[i]; i++) {
79 var nodes = document.getElementsByName('counter');
80 for (var i = nodes.length - 1; i >= 0; i--) {
81 var node = nodes[i]
[all...] |
| /external/chromium_org/ui/accessibility/ |
| ax_generated_tree_unittest.cc | 49 // A class to create all possible trees with <n> nodes and the ids [1...n].
60 // The second part is the assignment of ids to the nodes in the tree.
73 // bugs that affect trees with >4 nodes that wouldn't affect a smaller tree
109 // Build an AXTreeUpdate. The first two nodes of the tree always
112 update.nodes.resize(node_count_);
113 update.nodes[0].id = permuted[0];
114 update.nodes[0].role = AX_ROLE_ROOT_WEB_AREA;
115 update.nodes[0].child_ids.push_back(permuted[1]);
116 update.nodes[1].id = permuted[1];
118 // The remaining nodes are assigned based on their paren
[all...] |
| /external/smack/src/org/jivesoftware/smackx/provider/ |
| VCardProvider.java | 142 List<Node> nodes = new ArrayList<Node>(childNodeCount); local
144 nodes.add(childNodes.item(i));
148 for (Node n : nodes) {
166 NodeList nodes = document.getElementsByTagName("USERID"); local
167 if (nodes == null) return;
168 for (int i = 0; i < nodes.getLength(); i++) {
169 Element element = (Element) nodes.item(i);
183 NodeList nodes = allPhones.item(i).getChildNodes(); local
187 for (int j = 0; j < nodes.getLength(); j++) {
188 Node node = nodes.item(j)
249 NodeList nodes = document.getElementsByTagName(tag); local
[all...] |
| /external/chromium_org/cc/resources/ |
| task_graph_runner.cc | 49 std::find_if(graph_->nodes.begin(),
50 graph_->nodes.end(),
53 DCHECK(it != graph_->nodes.end());
125 nodes.swap(other->nodes);
130 nodes.clear();
166 graph->nodes.size(),
171 DCHECK(std::find_if(graph->nodes.begin(),
172 graph->nodes.end(),
174 graph->nodes.end())
[all...] |
| /packages/apps/UnifiedEmail/src/com/google/android/mail/common/html/parser/ |
| HtmlTree.java | 41 * of the tree, we simply keeps a linear list of nodes (in-order).
43 * nodes:
101 /** Contains html nodes */
102 private final List<HtmlDocument.Node> nodes = new ArrayList<HtmlDocument.Node>(); field in class:HtmlTree
147 * @return the nodes of the tree
150 return Collections.unmodifiableList(nodes);
154 * @return number of nodes
157 return nodes.size();
165 X.assertTrue(endTagNodeNum >= 0 && endTagNodeNum < nodes.size());
174 X.assertTrue(openTagNodeNum >= 0 && openTagNodeNum < nodes.size())
[all...] |
| /external/chromium_org/third_party/jinja2/ |
| parser.py | 11 from jinja2 import nodes namespace
107 """Return a new free identifier as :class:`~jinja2.nodes.InternalName`."""
109 rv = object.__new__(nodes.InternalName)
110 nodes.Node.__init__(rv, 'fi%d' % self._last_identifier, lineno=lineno)
174 return nodes.Assign(target, expr, lineno=lineno)
192 return nodes.For(target, iter, body, else_, test,
197 node = result = nodes.If(lineno=self.stream.expect('name:if').lineno)
204 new_node = nodes.If(lineno=self.stream.current.lineno)
217 node = nodes.Block(lineno=next(self.stream).lineno)
234 node = nodes.Extends(lineno=next(self.stream).lineno
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/ |
| ast.py | 21 nodes = {} variable
24 """Abstract base class for ast nodes."""
40 nodes["expression"] = "Expression"
69 def __init__(self, nodes, lineno=None):
70 self.nodes = nodes
74 return tuple(flatten(self.nodes))
78 nodelist.extend(flatten_nodes(self.nodes))
82 return "And(%s)" % (repr(self.nodes),)
101 def __init__(self, nodes, lineno=None)
[all...] |
