| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| MutationObserverRegistration.cpp | 134 void MutationObserverRegistration::addRegistrationNodesToSet(HashSet<Node*>& nodes) const
137 nodes.add(m_registrationNode.get());
141 nodes.add(iter->get());
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_except.py | 30 def find_excepts(nodes):
31 for i, n in enumerate(nodes):
34 yield (n, nodes[i+2])
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_except.py | 30 def find_excepts(nodes):
31 for i, n in enumerate(nodes):
34 yield (n, nodes[i+2])
|
| /external/icu/icu4c/source/i18n/ |
| collationbuilder.cpp | 203 rootPrimaryIndexes(errorCode), nodes(errorCode) {
315 int64_t node = nodes.elementAti(index);
317 // then skip backwards over this and further "weaker" nodes.
320 node = nodes.elementAti(index);
350 // Tailor after the last node between adjacent root nodes.
352 node = nodes.elementAti(index);
363 node = nodes.elementAti(index);
392 node = nodes.elementAti(i);
406 node = nodes.elementAti(i);
418 node = nodes.elementAti(i)
[all...] |
| /ndk/sources/host-tools/sed-4.2.1/lib/ |
| regex_internal.c | 28 const re_node_set *nodes,
31 const re_node_set *nodes,
[all...] |
| regexec.c | 154 const re_node_set *nodes)
164 static Idx find_subexp_node (const re_dfa_t *dfa, const re_node_set *nodes,
695 if (dfa->init_state->nodes.nelem == 0
696 && dfa->init_state_word->nodes.nelem == 0
697 && (dfa->init_state_nl->nodes.nelem == 0
2804 const re_node_set *nodes; local
[all...] |
| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/walkers/ |
| bare_object_walker.js | 6 * @fileoverview A JavaScript class for walking the leaf nodes of the dom.
8 * when traversal of the leaf nodes is required (e.g. by other walkers), but
|
| /external/chromium_org/components/bookmarks/browser/ |
| bookmark_client.h | 58 const NodeSet& nodes,
69 // Returns a task that will be used to load any additional root nodes. This
|
| bookmark_node_data.h | 29 // . A set of nodes from the bookmark model.
65 // Children, only used for non-URL nodes.
91 explicit BookmarkNodeData(const std::vector<const BookmarkNode*>& nodes);
102 bool ReadFromVector(const std::vector<const BookmarkNode*>& nodes);
133 // Returns the nodes represented by this DragData. If this DragData was
134 // created from the same profile then the nodes from the model are returned.
135 // If the nodes can't be found (may have been deleted), an empty vector is
142 // match any nodes or there is more than one node.
|
| /external/chromium_org/third_party/WebKit/Source/core/dom/shadow/ |
| ContentDistribution.h | 63 const WillBeHeapVector<RefPtrWillBeMember<Node> >& nodes() const { return m_nodes; } function in class:WebCore::FINAL
|
| /external/chromium_org/tools/telemetry/telemetry/core/backends/chrome/ |
| inspector_memory.py | 33 A dictionary containing the counts associated with "nodes", "documents",
40 'nodes' not in res['result'] or
47 'nodes': res['result']['nodes'],
|
| /external/libsepol/include/sepol/ |
| sepol.h | 17 #include <sepol/nodes.h>
|
| /external/pdfium/core/src/fxcodec/fx_libopenjpeg/libopenjpeg20/ |
| tgt.h | 72 opj_tgt_node_t *nodes; member in struct:opj_tgt_tree
73 OPJ_UINT32 nodes_size; /* maximum size taken by nodes */
|
| /frameworks/base/libs/hwui/ |
| RenderNode.h | 185 static size_t findNonNegativeIndex(const Vector<ZDrawRenderNodeOpPair>& nodes) {
186 for (size_t i = 0; i < nodes.size(); i++) {
187 if (nodes[i].key >= 0.0f) return i;
189 return nodes.size();
|
| /hardware/ti/omap3/omx/ti_omx_config_parser/ |
| Android.mk | 23 $(PV_TOP)/nodes/pvmediaoutputnode/include \
24 $(PV_TOP)/nodes/pvdownloadmanagernode/config/opencore \
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| tree-dump.h | 68 /* The first node in the queue of nodes to be written out. */
72 /* Free queue nodes. */
74 /* The tree nodes which we have already written out. The
75 keys are the addresses of the nodes; the values are the integer
77 splay_tree nodes; member in struct:dump_info
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| DynamicContextMenu.java | 165 List<INode> nodes = new ArrayList<INode>(selections.size()); local
167 nodes.add(item.getNode());
170 List<IContributionItem> menuItems = getMenuItems(nodes);
182 * collection of nodes
184 * @param nodes the collection of nodes to look up actions for
185 * @return a list of contribution items applicable for all the nodes
187 private List<IContributionItem> getMenuItems(List<INode> nodes) {
189 for (INode node : nodes) {
201 // the set of all selected nodes to that first action. Actions are require
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/ui/tree/ |
| UiActions.java | 141 public void doRemove(final List<UiElementNode> nodes, Shell shell) {
143 if (nodes == null || nodes.size() == 0) {
147 final int len = nodes.size();
150 for (UiElementNode node : nodes) {
167 UiElementNode node = nodes.get(i);
374 final List<UiElementNode> nodes,
376 if (nodes == null || nodes.size() < 1) {
388 for (int i = nodes.size() - 1; i >= 0; i--)
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/BuildOptions/ |
| DebugTreeGrammarHelper.cs | 52 public DebugTreeGrammar( CommonTreeNodeStream nodes, List<CommonTree> functionDefinitions )
53 : this( nodes )
|
| ProfileTreeGrammarHelper.cs | 52 public ProfileTreeGrammar( CommonTreeNodeStream nodes, List<CommonTree> functionDefinitions )
53 : this( nodes )
|
| /external/chromium_org/sync/sessions/ |
| directory_type_debug_info_emitter.cc | 33 scoped_ptr<base::ListValue> nodes(
35 return nodes.Pass();
|
| /external/jemalloc/test/unit/ |
| rb.c | 80 /* Red nodes must be interleaved with black nodes. */
222 node_t nodes[NNODES]; local
244 /* Initialize tree and nodes. */
248 nodes[k].magic = NODE_MAGIC;
249 nodes[k].key = bag[k];
252 /* Insert nodes. */
254 tree_insert(&tree, &nodes[k]);
273 tree_next(&tree, &nodes[k]);
274 tree_prev(&tree, &nodes[k])
[all...] |
| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/chromevox/injected/ |
| navigation_history.js | 6 * @fileoverview Navigation history tracks recently visited nodes. The
8 * navigating to and from valid nodes.
28 * The maximum length of history tracked for recently visited nodes.
44 * An array of nodes ordered from newest to oldest in the history.
45 * The most recent nodes are at the start of the array.
96 // Remove any invalid nodes from history_.
116 * returns true if it is a valid recovery candidate. Nodes that do not
118 * predicate is provided, return the two most recent nodes.
120 * The two nodes to override default navigation behavior with. Returning
131 // Remove the most-recent-nodes that do not match the predicate
[all...] |
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/parse-only/ |
| prototype-1.6.0.3.js | [all...] |
| /external/chromium_org/third_party/libxml/src/ |
| xmlwriter.c | 85 xmlListPtr nodes; /* element name stack */ member in struct:_xmlTextWriter
185 ret->nodes = xmlListCreate((xmlListDeallocator)
189 if (ret->nodes == NULL) {
203 xmlListDelete(ret->nodes);
213 xmlListDelete(ret->nodes);
483 if (writer->nodes != NULL)
484 xmlListDelete(writer->nodes);
531 lk = xmlListFront(writer->nodes);
651 while ((lk = xmlListFront(writer->nodes)) != NULL) {
737 lk = xmlListFront(writer->nodes);
[all...] |
