HomeSort by relevance Sort by last modified time
    Searched full:nodes (Results 76 - 100 of 4338) sorted by null

1 2 34 5 6 7 8 91011>>

  /frameworks/base/core/java/android/view/accessibility/
AccessibilityCache.java 31 * It is updated when windows change or nodes change.
91 * the cache will either refresh some nodes or evict some nodes.
163 LongSparseArray<AccessibilityNodeInfo> nodes = mNodeCache.get(windowId); local
164 if (nodes == null) {
167 AccessibilityNodeInfo cachedInfo = nodes.get(sourceId);
190 LongSparseArray<AccessibilityNodeInfo> nodes = mNodeCache.get(windowId); local
191 if (nodes == null) {
194 AccessibilityNodeInfo info = nodes.get(accessibilityNodeId);
262 LongSparseArray<AccessibilityNodeInfo> nodes = mNodeCache.get(windowId) local
336 LongSparseArray<AccessibilityNodeInfo> nodes = mNodeCache.get(windowId); local
361 LongSparseArray<AccessibilityNodeInfo> nodes = mNodeCache.get(windowId); local
434 LongSparseArray<AccessibilityNodeInfo> nodes = mNodeCache.valueAt(i); local
    [all...]
  /prebuilts/tools/common/m2/repository/org/jsoup/jsoup/1.6.3/
jsoup-1.6.3.jar 
  /external/llvm/lib/CodeGen/
SpillPlacement.cpp 69 /// value can change when linked nodes change, but convergence is very fast
94 // Undecided nodes (Value==0) go on the stack.
148 bool update(const Node nodes[], const BlockFrequency &Threshold) {
153 if (nodes[I->second].Value == -1)
155 else if (nodes[I->second].Value == 1)
183 assert(!nodes && "Leaking node array");
184 nodes = new Node[bundles->getNumBundles()];
200 delete[] nodes;
201 nodes = nullptr;
209 nodes[n].clear(Threshold)
    [all...]
  /external/chromium-trace/catapult/telemetry/telemetry/internal/backends/chrome_inspector/
inspector_memory.py 31 A dictionary containing the counts associated with "nodes", "documents",
43 'nodes' not in res['result'] or
50 'nodes': res['result']['nodes'],
  /external/iptables/extensions/
libipt_CLUSTERIP.man 1 This module allows you to configure a simple cluster of nodes that share
3 them. Connections are statically distributed between the nodes in this
17 \fB\-\-total\-nodes\fP \fInum\fP
18 Number of total nodes within this cluster.
  /external/libgdx/tests/gdx-tests-android/assets/data/g3d/materials/
badlogic_normal.g3dj 20 "nodes": [],
brick01.g3dj 24 "nodes": [],
brick02.g3dj 24 "nodes": [],
brick03.g3dj 24 "nodes": [],
chesterfield.g3dj 29 "nodes": [],
cloth01.g3dj 24 "nodes": [],
cloth02.g3dj 24 "nodes": [],
elephant01.g3dj 24 "nodes": [],
elephant02.g3dj 24 "nodes": [],
metal01.g3dj 20 "nodes": [],
metal02.g3dj 20 "nodes": [],
moon01.g3dj 24 "nodes": [],
stone01.g3dj 24 "nodes": [],
stone02.g3dj 24 "nodes": [],
wood01.g3dj 24 "nodes": [],
wood02.g3dj 24 "nodes": [],
  /external/libxml2/result/XInclude/
nodes3.xml 3 <!-- Simple test of including a set of nodes from an XML document -->
nodes3.xml.rdr 4 1 8 #comment 0 1 Simple test of including a set of nodes from an XML document
  /external/libxml2/result/XPath/tests/
usr1check 5 Set contains 1 nodes:
  /external/libxml2/result/XPath/xptr/
vidchildseq 5 Set contains 1 nodes:
14 Set contains 1 nodes:
23 Set contains 1 nodes:
32 Set contains 1 nodes:

Completed in 2146 milliseconds

1 2 34 5 6 7 8 91011>>