Searched refs:visited (Results 1 – 8 of 8) sorted by relevance
30 Reference* visited = nullptr; member32 void Visit(Reference* ref) override { visited = ref; } in Visit()54 EXPECT_EQ(visitor.visited, &ref); in TEST()
73 int visited = 0; in scrollBackAndPreservePositionsTest()74 while (visited < mAdapter.getItemCount()) { in scrollBackAndPreservePositionsTest()81 visited++; in scrollBackAndPreservePositionsTest()101 visited, mAdapter.getItemCount()); in scrollBackAndPreservePositionsTest()
40 boolean visited; field in Element180 requiredChildren.get(i).visited = false; in resetRequiredChildren()193 if (!child.visited) { in checkRequiredChildren()
166 e.visited = true; in start()
1521 ArrayList<Node> visited = new ArrayList<Node>(mNodes.size());1525 updatePlayTime(mRootNode, visited);1652 private void updatePlayTime(Node parent, ArrayList<Node> visited) {1667 visited.add(parent);1673 int index = visited.indexOf(child);1676 for (int j = index; j < visited.size(); j++) {1677 visited.get(j).mLatestParent = null;1678 visited.get(j).mStartTime = DURATION_INFINITE;1679 visited.get(j).mEndTime = DURATION_INFINITE;1703 updatePlayTime(child, visited);[all …]
1330 int[] visited = new int[getCount() + 1]; in topologicalSort() local1333 switch (visited[loc]) { in topologicalSort()1335 visited[loc] = PENDING; in topologicalSort()1340 visited[loc] = COMPLETE; in topologicalSort()
1439 int[] visited = new int[getCount() + 1]; in topologicalSort() local1442 switch (visited[loc]) { in topologicalSort()1444 visited[loc] = PENDING; in topologicalSort()1449 visited[loc] = COMPLETE; in topologicalSort()
114 Finally fields are also visited and changed from protected/private to public.