HomeSort by relevance Sort by last modified time
    Searched refs:visited (Results 76 - 100 of 967) sorted by null

1 2 34 5 6 7 8 91011>>

  /external/v8/src/compiler/
control-equivalence.cc 109 if (GetData(input)->visited) continue;
139 if (GetData(use)->visited) continue;
195 DCHECK(!GetData(node)->visited);
206 GetData(node)->visited = true;
loop-peeling.cc 364 ZoneVector<bool> visited(graph->NodeCount(), false, temp_zone);
373 if (!visited[control->id()]) {
374 visited[control->id()] = true;
380 if (!visited[control->id()]) {
381 visited[control->id()] = true;
  /frameworks/support/v7/recyclerview/src/androidTest/java/androidx/recyclerview/widget/
GridLayoutManagerBaseConfigSetTest.java 73 int visited = 0;
74 while (visited < mAdapter.getItemCount()) {
81 visited++;
100 logPrefix + " If scroll is complete, all views should be visited",
101 visited, mAdapter.getItemCount());
  /libcore/metrictests/memory/host/src/libcore/heapmetrics/
HeapCategorization.java 293 Set<AhatInstance> visited = new HashSet<>(); local
295 visited.add(rooted);
315 if (!visited.contains(reference)) {
316 visited.add(reference);
  /system/tools/hidl/
FmqType.h 57 bool deepIsJavaCompatible(std::unordered_set<const Type*>* visited) const override;
HandleType.h 61 bool deepIsJavaCompatible(std::unordered_set<const Type*>* visited) const override;
MemoryType.h 62 bool deepIsJavaCompatible(std::unordered_set<const Type*>* visited) const override;
StringType.h 30 bool deepCanCheckEquality(std::unordered_set<const Type*>* visited) const override;
  /external/icu/icu4j/
stylesheet8.css 19 a:link, a:visited {
103 .bar a, .bar a:link, .bar a:visited, .bar a:active {
181 .topNav a:link, .topNav a:active, .topNav a:visited, .bottomNav a:link, .bottomNav a:active, .bottomNav a:visited {
394 .overviewSummary caption a:visited, .memberSummary caption a:visited, .typeSummary caption a:visited,
395 .useSummary caption a:visited, .constantsSummary caption a:visited, .deprecatedSummary caption a:visited {
    [all...]
  /external/pdfium/fpdfsdk/
fpdfdoc.cpp 28 std::set<CPDF_Dictionary*>* visited) {
30 if (pdfium::ContainsKey(*visited, bookmark.GetDict()))
32 visited->insert(bookmark.GetDict());
42 while (child.GetDict() && !pdfium::ContainsKey(*visited, child.GetDict())) {
44 CPDF_Bookmark found = FindBookmark(tree, child, title, visited);
108 std::set<CPDF_Dictionary*> visited; local
109 return FindBookmark(tree, CPDF_Bookmark(), encodedTitle, &visited).GetDict();
  /external/subsampling-scale-image-view/docs/javadoc/
stylesheet.css 15 a:link, a:visited {
99 .bar a, .bar a:link, .bar a:visited, .bar a:active {
177 .topNav a:link, .topNav a:active, .topNav a:visited, .bottomNav a:link, .bottomNav a:active, .bottomNav a:visited {
390 .overviewSummary caption a:visited, .memberSummary caption a:visited, .typeSummary caption a:visited,
391 .useSummary caption a:visited, .constantsSummary caption a:visited, .deprecatedSummary caption a:visited {
    [all...]
  /build/make/tools/
java-layers.py 56 def recurse(obj, dep, visited):
58 if dep in visited:
61 for v in visited:
66 visited.append(dep)
70 recurse(obj, deps[upper], visited)
  /external/tensorflow/tensorflow/core/kernels/
sparse_fill_empty_rows_op.cc 237 auto visited = visited_t.vec<bool>(); variable
238 visited.device(d) = visited.constant(false);
243 // the gradient into it. Mark it as visited.
245 visited(reverse_index_map(i)) = true;
251 if (!visited(j)) {
  /external/tensorflow/tensorflow/core/profiler/internal/
tfprof_graph.cc 119 std::set<string>* visited) {
125 if (visited->find(root->name()) != visited->end()) continue;
126 visited->insert(root->name());
142 SearchRoot(root->show_children, regexes, visited);
  /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/spirv-tools/source/
cfa.h 52 /// @param[in] work_list Set of blocks visited in the the depth first traversal
249 // The set of nodes which have been visited from any of the roots so far.
250 std::unordered_set<const BB*> visited; local
252 auto mark_visited = [&visited](const BB* b) { visited.insert(b); };
268 assert(visited.count(block) == 0 && "Malformed graph!");
276 if (visited.count(block) == 0) {
  /external/skia/tests/
PDFPrimitivesTest.cpp 355 static sk_sp<DummyImageFilter> Make(bool visited = false) {
356 return sk_sp<DummyImageFilter>(new DummyImageFilter(visited));
361 bool visited() const { return fVisited; } function in class:__anon34296::DummyImageFilter
375 DummyImageFilter(bool visited) : INHERITED(nullptr, 0, nullptr), fVisited(visited) {}
384 bool visited = buffer.readBool(); local
385 return DummyImageFilter::Make(visited);
408 REPORTER_ASSERT(reporter, !filter->visited());
414 // Filter was used in rendering; should be visited.
415 REPORTER_ASSERT(reporter, filter->visited());
    [all...]
  /external/skqp/tests/
PDFPrimitivesTest.cpp 355 static sk_sp<DummyImageFilter> Make(bool visited = false) {
356 return sk_sp<DummyImageFilter>(new DummyImageFilter(visited));
361 bool visited() const { return fVisited; } function in class:__anon34966::DummyImageFilter
375 DummyImageFilter(bool visited) : INHERITED(nullptr, 0, nullptr), fVisited(visited) {}
384 bool visited = buffer.readBool(); local
385 return DummyImageFilter::Make(visited);
408 REPORTER_ASSERT(reporter, !filter->visited());
414 // Filter was used in rendering; should be visited.
415 REPORTER_ASSERT(reporter, filter->visited());
    [all...]
  /development/vndk/tools/sourcedr/sourcedr/static/prism/js/
prism.js 138 DFS: function(o, callback, type, visited) {
139 visited = visited || {};
144 if (_.util.type(o[i]) === 'Object' && !visited[_.util.objId(o[i])]) {
145 visited[_.util.objId(o[i])] = true;
146 _.languages.DFS(o[i], callback, null, visited);
148 else if (_.util.type(o[i]) === 'Array' && !visited[_.util.objId(o[i])]) {
149 visited[_.util.objId(o[i])] = true;
150 _.languages.DFS(o[i], callback, i, visited);
  /external/guava/
javadoc-stylesheet.css 12 a:link, a:visited {
86 .bar a, .bar a:link, .bar a:visited, .bar a:active {
167 .topNav a:link, .topNav a:active, .topNav a:visited, .bottomNav a:link, .bottomNav a:active, .bottomNav a:visited {
372 caption a:link, caption a:hover, caption a:active, caption a:visited {
416 td.colOne a:link, td.colOne a:active, td.colOne a:visited, td.colOne a:hover, td.colFirst a:link, td.colFirst a:active, td.colFirst a:visited, td.colFirst a:hover, td.colLast a:link, td.colLast a:active, td.colLast a:visited, td.colLast a:hover, .constantValuesContainer td a:link, .constantValuesContainer td a:active, .constantValuesContainer td a:visited, .constantValuesContainer td a:hover {
  /external/libjpeg-turbo/java/doc/
stylesheet.css 12 a:link, a:visited {
86 .bar a, .bar a:link, .bar a:visited, .bar a:active {
167 .topNav a:link, .topNav a:active, .topNav a:visited, .bottomNav a:link, .bottomNav a:active, .bottomNav a:visited {
372 caption a:link, caption a:hover, caption a:active, caption a:visited {
416 td.colOne a:link, td.colOne a:active, td.colOne a:visited, td.colOne a:hover, td.colFirst a:link, td.colFirst a:active, td.colFirst a:visited, td.colFirst a:hover, td.colLast a:link, td.colLast a:active, td.colLast a:visited, td.colLast a:hover, .constantValuesContainer td a:link, .constantValuesContainer td a:active, .constantValuesContainer td a:visited, .constantValuesContainer td a:hover {
  /external/v8/tools/turbolizer/
graph-layout.js 266 var visited = [];
275 visited[n.id] = false;
284 var visited = [];
326 visited = [];
328 if (visited[n.id]) return;
329 visited[n.id] = true;
350 visited = [];
352 if (visited[n.id]) return;
353 visited[n.id] = true;
  /external/tensorflow/tensorflow/compiler/xla/service/
hlo_computation.cc 308 tensorflow::gtl::FlatSet<HloComputation*>* visited,
310 if (visited->count(computation) > 0) {
317 ComputeComputationPostOrder(called_computation, visited, post_order);
321 visited->insert(computation);
351 tensorflow::gtl::FlatSet<HloComputation*> visited; local
357 ComputeComputationPostOrder(const_cast<HloComputation*>(this), &visited, local
540 std::set<std::pair<const HloInstruction*, const HloInstruction*>> visited; local
542 [&visited, &eq](const HloInstruction* a, const HloInstruction* b) {
543 // If <a,b> are visited but not identical, the recursion should have
544 // been aborted. So, if <a,b> are visited at this point, they must b
692 std::unordered_set<const HloInstruction*> visited; local
    [all...]
  /compatibility/cdd/source/
android-cdd-cover.css 11 a:visited {
  /external/bzip2/
bzip.css 13 a, a:link, a:visited, a:active { color: #336699; }
  /external/swiftshader/third_party/LLVM/lib/CodeGen/
CalcSpillWeights.cpp 97 SmallPtrSet<MachineInstr*, 8> visited; local
113 if (!visited.insert(mi))

Completed in 781 milliseconds

1 2 34 5 6 7 8 91011>>