/frameworks/base/core/java/android/view/accessibility/ |
D | AccessibilityCache.java | 143 LongSparseArray<AccessibilityNodeInfo> nodes = mNodeCache.get(windowId); in refreshCachedNodeLocked() local 144 if (nodes == null) { in refreshCachedNodeLocked() 147 AccessibilityNodeInfo cachedInfo = nodes.get(sourceId); in refreshCachedNodeLocked() 170 LongSparseArray<AccessibilityNodeInfo> nodes = mNodeCache.get(windowId); in getNode() local 171 if (nodes == null) { in getNode() 174 AccessibilityNodeInfo info = nodes.get(accessibilityNodeId); in getNode() 235 LongSparseArray<AccessibilityNodeInfo> nodes = mNodeCache.get(windowId); in add() local 236 if (nodes == null) { in add() 237 nodes = new LongSparseArray<>(); in add() 238 mNodeCache.put(windowId, nodes); in add() [all …]
|
/frameworks/base/libs/hwui/ |
D | RenderNode.h | 185 static size_t findNonNegativeIndex(const Vector<ZDrawRenderNodeOpPair>& nodes) { in findNonNegativeIndex() argument 186 for (size_t i = 0; i < nodes.size(); i++) { in findNonNegativeIndex() 187 if (nodes[i].key >= 0.0f) return i; in findNonNegativeIndex() 189 return nodes.size(); in findNonNegativeIndex()
|
/frameworks/base/docs/html/training/wearables/data-layer/ |
D | messages.jd | 63 Here's a simple way to get a list of connected nodes that you can potentially 69 NodeApi.GetConnectedNodesResult nodes = 71 for (Node node : nodes.getNodes()) {
|
/frameworks/base/core/java/android/widget/ |
D | RelativeLayout.java | 1638 final ArrayList<Node> nodes = mNodes; in clear() local 1639 final int count = nodes.size(); in clear() 1642 nodes.get(i).release(); in clear() 1644 nodes.clear(); in clear() 1717 final ArrayList<Node> nodes = mNodes; in findRoots() local 1718 final int count = nodes.size(); in findRoots() 1723 final Node node = nodes.get(i); in findRoots() 1730 final Node node = nodes.get(i); in findRoots() 1760 final Node node = nodes.get(i); in findRoots()
|
/frameworks/base/core/java/android/util/ |
D | PathParser.java | 35 PathDataNode[] nodes = createNodesFromPathData(pathData); in createPathFromPathData() local 36 if (nodes != null) { in createPathFromPathData() 38 PathDataNode.nodesToPath(nodes, path); in createPathFromPathData()
|
/frameworks/opt/vcard/tests/src/com/android/vcard/tests/testutils/ |
D | PropertyNodesVerifierElem.java | 215 for (List<PropertyNode> nodes : mOrderedNodeMap.values()) { in verify() 216 for (PropertyNode node : nodes) { in verify()
|
/frameworks/base/docs/html/tools/help/ |
D | dmtracedump.jd | 62 <td>Minimum threshold for including child nodes in the graph (child's inclusive time as a
|
/frameworks/base/graphics/java/android/graphics/drawable/ |
D | VectorDrawable.java | 1288 public void setPathData(PathParser.PathDataNode[] nodes) { in setPathData() argument 1289 if (!PathParser.canMorph(mNodes, nodes)) { in setPathData() 1291 mNodes = PathParser.deepCopyNodes(nodes); in setPathData() 1293 PathParser.updateNodes(mNodes, nodes); in setPathData()
|
/frameworks/base/docs/html/guide/topics/graphics/ |
D | drawable-animation.jd | 19 series of child <code><item></code> nodes that each define a frame: a drawable resource for
|
/frameworks/base/core/java/android/view/ |
D | AccessibilityInteractionController.java | 828 private void enforceNodeTreeConsistent(List<AccessibilityNodeInfo> nodes) { in enforceNodeTreeConsistent() argument 831 final int nodeCount = nodes.size(); in enforceNodeTreeConsistent() 833 AccessibilityNodeInfo node = nodes.get(i); in enforceNodeTreeConsistent()
|
/frameworks/base/docs/html/tools/debugging/ |
D | debugging-ui.jd | 143 To highlight the nodes in the tree whose class or ID match a search string, enter the 145 window. The background of nodes that match the search string will change from gray to 274 the node. When you click one of the nodes, you see the following: 329 View nodes with red or yellow performance indicators to identify the slower View objects. As you
|
D | debugging-tracing.jd | 192 represented as a node. It shows call flow (from parent node to child nodes) using arrows. The 263 <td>Minimum threshold for including child nodes in the graph (child's inclusive time as a
|
/frameworks/base/docs/html/training/auto/audio/ |
D | index.jd | 242 to retrieve its child nodes, which are subsequently displayed as the top menu items. 251 onLoadChildren()} again to retrieve the child nodes of the selected menu item.</li> 326 submenus by calling the same method with other child nodes. The following
|
/frameworks/base/docs/html/training/accessibility/ |
D | service.jd | 247 // Using this parent, get references to both child nodes, the label and the checkbox.
|
/frameworks/wilhelm/doc/ |
D | Doxyfile | 1586 # nodes that will be shown in the graph. If the number of nodes in a graph 1596 # graphs generated by dot. A depth value of 3 means that only nodes reachable
|
/frameworks/base/docs/html/about/versions/ |
D | kitkat.jd | 959 In accessibility nodes, developers can now determine whether a node is a 961 nodes that contain grid-like information, such as lists and tables. For
|
D | android-4.0-highlights.jd | 997 properties such as parent and child nodes, available states, supported actions,
|
D | jelly-bean.jd | 944 nodes in the View hierarchy.</p>
|
/frameworks/base/docs/html/tools/help/uiautomator/ |
D | UiDevice.jd | 2623 framework will only contain nodes that are important for uiautomator 2624 testing. Any unnecessary surrounding layout nodes that make viewing
|