Searched refs:nodes (Results 1 - 25 of 34) sorted by relevance

12

/frameworks/base/core/java/android/view/accessibility/
H A DAccessibilityCache.java31 * It is updated when windows change or nodes change.
118 * the cache will either refresh some nodes or evict some nodes.
193 LongSparseArray<AccessibilityNodeInfo> nodes = mNodeCache.get(windowId);
194 if (nodes == null) {
197 AccessibilityNodeInfo cachedInfo = nodes.get(sourceId);
220 LongSparseArray<AccessibilityNodeInfo> nodes = mNodeCache.get(windowId);
221 if (nodes == null) {
224 AccessibilityNodeInfo info = nodes.get(accessibilityNodeId);
292 LongSparseArray<AccessibilityNodeInfo> nodes
422 clearSubTreeRecursiveLocked(LongSparseArray<AccessibilityNodeInfo> nodes, long rootNodeId) argument
[all...]
/frameworks/base/apct-tests/perftests/core/src/android/graphics/perftests/
H A DRenderNodePerfTest.java86 RenderNode[] nodes = new RenderNode[30];
87 DisplayListCanvas[] canvases = new DisplayListCanvas[nodes.length];
88 for (int i = 0; i < nodes.length; i++) {
89 nodes[i] = RenderNode.create("LinearLayout", null);
93 for (int i = 0; i < nodes.length; i++) {
94 canvases[i] = nodes[i].start(100, 100);
96 for (int i = nodes.length - 1; i >= 0; i--) {
97 nodes[i].end(canvases[i]);
/frameworks/base/cmds/statsd/benchmark/
H A Dfilter_value_benchmark.cpp34 std::vector<AttributionNodeInternal> nodes = {node, node}; local
35 event->write(nodes);
H A Dget_dimensions_for_condition_benchmark.cpp34 std::vector<AttributionNodeInternal> nodes = {node, node}; local
35 event->write(nodes);
/frameworks/data-binding/compiler/src/main/kotlin/android/databinding/tool/writer/
H A DKCode.kt27 private val nodes = arrayListOf<Any>()
46 fun isNull(kcode : KCode?) = kcode == null || (kcode.nodes.isEmpty() && (kcode.s == null || kcode.s.trim() == ""))
70 nodes.add(c)
78 nodes.add(c)
107 nodes.add(Appendix(glue, c!!))
129 val newlineFirstNode = s != null || (nodes.isNotEmpty() && nodes.first() is Appendix)
131 nodes.forEach { when(it) {
/frameworks/base/cmds/statsd/tests/
H A DLogEvent_test.cpp28 std::vector<AttributionNodeInternal> nodes; local
33 nodes.push_back(node1);
38 nodes.push_back(node2);
40 event1.write(nodes);
95 std::vector<AttributionNodeInternal> nodes; local
103 nodes.push_back(node1);
108 nodes.push_back(node2);
109 event1.write(nodes);
/frameworks/base/core/proto/android/os/
H A Dworksource.proto37 repeated WorkSourceContentProto nodes = 1;
/frameworks/base/libs/hwui/pipeline/skia/
H A DSkiaPipeline.cpp324 const std::vector<sp<RenderNode>>& nodes, bool opaque,
337 renderFrameImpl(layers, clip, nodes, opaque, wideColorGamut, contentDrawBounds, canvas);
342 renderOverdraw(layers, clip, nodes, contentDrawBounds, surface);
357 const std::vector<sp<RenderNode>>& nodes, bool opaque,
368 if (1 == nodes.size()) {
369 if (!nodes[0]->nothingToDraw()) {
370 RenderNodeDrawable root(nodes[0].get(), canvas);
373 } else if (0 == nodes.size()) {
376 // It there are multiple render nodes, they are laid out as follows:
379 // #2 - additional overlay nodes
323 renderFrame(const LayerUpdateQueue& layers, const SkRect& clip, const std::vector<sp<RenderNode>>& nodes, bool opaque, bool wideColorGamut, const Rect& contentDrawBounds, sk_sp<SkSurface> surface) argument
356 renderFrameImpl(const LayerUpdateQueue& layers, const SkRect& clip, const std::vector<sp<RenderNode>>& nodes, bool opaque, bool wideColorGamut, const Rect& contentDrawBounds, SkCanvas* canvas) argument
485 renderOverdraw(const LayerUpdateQueue& layers, const SkRect& clip, const std::vector<sp<RenderNode>>& nodes, const Rect& contentDrawBounds, sk_sp<SkSurface> surface) argument
[all...]
H A DSkiaPipeline.h53 const std::vector<sp<RenderNode>>& nodes, bool opaque, bool wideColorGamut,
115 const std::vector<sp<RenderNode>>& nodes, bool opaque, bool wideColorGamut,
123 const std::vector<sp<RenderNode>>& nodes, const Rect& contentDrawBounds,
/frameworks/support/navigation/common/src/main/java/androidx/navigation/
H A DNavGraph.java37 * NavGraph is a collection of {@link NavDestination} nodes fetchable by ID.
139 * @param nodes destinations to add
141 public void addDestinations(@NonNull Collection<NavDestination> nodes) { argument
142 for (NavDestination node : nodes) {
158 * @param nodes destinations to add
160 public void addDestinations(@NonNull NavDestination... nodes) { argument
161 for (NavDestination node : nodes) {
/frameworks/base/libs/hwui/tests/unit/
H A DSkiaPipelineTests.cpp292 std::vector<sp<RenderNode>> nodes; local
297 nodes.push_back(TestUtils::createSkiaNode(
305 nodes.push_back(TestUtils::createSkiaNode(
312 nodes.push_back(TestUtils::createSkiaNode(
322 pipeline->renderFrame(layerUpdateQueue, dirty, nodes, true, false, contentDrawBounds, surface);
340 std::vector<sp<RenderNode>> nodes; local
341 nodes.push_back(TestUtils::createSkiaNode(
352 pipeline->renderFrame(layerUpdateQueue, dirty, nodes, true, false,
371 std::vector<sp<RenderNode>> nodes; local
372 nodes
[all...]
/frameworks/opt/telephony/src/java/com/android/internal/telephony/uicc/
H A DAnswerToReset.java94 ArrayMap<Integer, byte[]> nodes = new ArrayMap<>();
99 index = parseLtvNode(index, nodes, originalData, startIndex + length - 1);
106 return new HistoricalBytes(rawData, nodes, rawData[0]);
109 private HistoricalBytes(byte[] rawData, ArrayMap<Integer, byte[]> nodes, byte category) { argument
111 mNodes = nodes;
116 int index, ArrayMap<Integer, byte[]> nodes, byte[] data, int lastByteIndex) {
127 nodes.put(tag, value);
115 parseLtvNode( int index, ArrayMap<Integer, byte[]> nodes, byte[] data, int lastByteIndex) argument
/frameworks/opt/telephony/src/java/com/android/internal/telephony/uicc/euicc/
H A DEuiccCard.java545 List<Asn1Node> nodes = root.getChildren(Tags.TAG_CTX_COMP_0);
547 new EuiccRulesAuthTable.Builder(nodes.size());
548 int size = nodes.size();
550 Asn1Node node = nodes.get(i);
812 List<Asn1Node> nodes = root.getChild(Tags.TAG_CTX_COMP_0).getChildren();
813 EuiccNotification[] notifications = new EuiccNotification[nodes.size()];
815 notifications[i] = createNotification(nodes.get(i));
853 List<Asn1Node> nodes = root.getChild(Tags.TAG_CTX_COMP_0).getChildren();
854 EuiccNotification[] notifications = new EuiccNotification[nodes.size()];
856 notifications[i] = createNotification(nodes
1157 buildUiccAccessRule(List<Asn1Node> nodes) argument
[all...]
/frameworks/base/libs/hwui/
H A DFrameBuilder.cpp129 void FrameBuilder::deferRenderNodeScene(const std::vector<sp<RenderNode> >& nodes, argument
131 if (nodes.size() < 1) return;
132 if (nodes.size() == 1) {
133 if (!nodes[0]->nothingToDraw()) {
134 deferRenderNode(*nodes[0]);
138 // It there are multiple render nodes, they are laid out as follows:
141 // #2 - additional overlay nodes
147 // Additional nodes will be drawn on top with no particular clipping semantics.
154 const Rect backdrop = nodeBounds(*nodes[0]);
159 if (!content.contains(backdrop) && !nodes[
[all...]
H A DFrameBuilder.h75 void deferRenderNodeScene(const std::vector<sp<RenderNode> >& nodes,
/frameworks/base/cmds/statsd/src/logd/
H A DLogEvent.cpp131 bool LogEvent::write(const std::vector<AttributionNodeInternal>& nodes) { argument
136 for (size_t i = 0; i < nodes.size(); ++i) {
137 if (!write(nodes[i])) {
H A DLogEvent.h111 bool write(const std::vector<AttributionNodeInternal>& nodes);
/frameworks/av/media/libstagefright/omx/1.0/
H A DOmxStore.cpp68 hidl_vec<NodeInfo>& nodeList = role.nodes;
/frameworks/base/core/java/android/widget/
H A DRelativeLayout.java1711 * List of nodes in the graph. Each node is identified by its
1726 final ArrayList<Node> nodes = mNodes;
1727 final int count = nodes.size();
1730 nodes.get(i).release();
1732 nodes.clear();
1805 final ArrayList<Node> nodes = mNodes;
1806 final int count = nodes.size();
1811 final Node node = nodes.get(i);
1818 final Node node = nodes.get(i);
1846 // Finds all the roots in the graph: all nodes wit
[all...]
/frameworks/minikin/tools/
H A Dmk_hyb_file.py198 nodes = Freelist()
208 if (ix >= 0 and nodes.is_free(ix) and
214 nodes.is_free(ix) # actually don't need nodes at all when use_node,
217 ix, _ = nodes.next(0)
220 nodes.use(ix)
229 # return list of nodes in bfs order
246 # suffix compression - convert the trie into an acyclic digraph, merging nodes when
269 print(len(uniques), 'unique nodes,', len(self.bfs_order), 'total')
/frameworks/support/compat/src/main/java/androidx/core/graphics/
H A DPathParser.java75 PathDataNode[] nodes = createNodesFromPathData(pathData);
76 if (nodes != null) {
78 PathDataNode.nodesToPath(nodes, path);
/frameworks/opt/vcard/tests/src/com/android/vcard/tests/testutils/
H A DPropertyNodesVerifierElem.java215 for (List<PropertyNode> nodes : mOrderedNodeMap.values()) {
216 for (PropertyNode node : nodes) {
/frameworks/support/graphics/drawable/static/src/main/java/androidx/vectordrawable/graphics/drawable/
H A DVectorDrawableCompat.java1528 public String nodesToString(PathParser.PathDataNode[] nodes) { argument
1530 for (int i = 0; i < nodes.length; i++) {
1531 result += nodes[i].mType + ":";
1532 float[] params = nodes[i].mParams;
1575 public void setPathData(PathParser.PathDataNode[] nodes) { argument
1576 if (!PathParser.canMorph(mNodes, nodes)) {
1578 mNodes = PathParser.deepCopyNodes(nodes);
1580 PathParser.updateNodes(mNodes, nodes);
/frameworks/av/media/libstagefright/
H A DOmxInfoBuilder.cpp149 // If preferPlatformNodes is true, hardware nodes must be added after
150 // platform (software) nodes. hwCodecs is used to hold hardware nodes
151 // that need to be added after software nodes for the same role.
153 for (const IOmxStore::NodeInfo& node : role.nodes) {
187 // added after all software nodes.
207 // If preferPlatformNodes is true, hardware nodes will not have been
/frameworks/layoutlib/bridge/src/android/util/
H A DPathParser_Delegate.java58 private PathParser_Delegate(@NonNull PathDataNode[] nodes) { argument
59 mPathDataNodes = nodes;
107 PathDataNode[] nodes = createNodesFromPathData(pathString);
108 PathParser_Delegate delegate = new PathParser_Delegate(nodes);

Completed in 800 milliseconds

12