Home
last modified time | relevance | path

Searched refs:visited (Results 1 – 25 of 145) sorted by relevance

123456

/external/eigen/Eigen/src/MetisSupport/
DMetisSupport.h37 IndexVector visited(m); in get_symmetrized_graph()
38 visited.setConstant(-1); in get_symmetrized_graph()
42 visited(j) = j; // Do not include the diagonal element in get_symmetrized_graph()
47 if (visited(idx) != j ) in get_symmetrized_graph()
49 visited(idx) = j; in get_symmetrized_graph()
57 if(visited(idx) != j) in get_symmetrized_graph()
59 visited(idx) = j; in get_symmetrized_graph()
69 visited.setConstant(-1); in get_symmetrized_graph()
75 visited(j) = j; // Do not include the diagonal element in get_symmetrized_graph()
80 if (visited(idx) != j ) in get_symmetrized_graph()
[all …]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
DGraph.java82 Set<Node> visited = new OrderedHashSet<Node>(); in sort() local
84 while ( visited.size() < nodes.size() ) { in sort()
89 if ( !visited.contains(n) ) break; in sort()
91 DFS(n, visited, sorted); in sort()
96 public void DFS(Node n, Set<Node> visited, ArrayList<Object> sorted) { in DFS() argument
97 if ( visited.contains(n) ) return; in DFS()
98 visited.add(n); in DFS()
102 DFS(target, visited, sorted); in DFS()
/external/chromium-trace/catapult/third_party/html5lib-python/html5lib/tests/
Dsupport.py139 self.visited = []
142 self.visited.append('startDocument')
145 self.visited.append('endDocument')
156 self.visited.append(('startElement', name, attrs))
159 self.visited.append(('endElement', name))
162 self.visited.append(('startElementNS', name, qname, dict(attrs)))
165 self.visited.append(('endElementNS', name, qname))
168 self.visited.append(('characters', content))
171 self.visited.append(('ignorableWhitespace', whitespace))
174 self.visited.append(('processingInstruction', target, data))
[all …]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
DDFAOptimizer.java128 protected Set visited = new HashSet(); field in DFAOptimizer
157 visited.clear(); in optimize()
172 visited.clear(); in optimize()
186 if ( visited.contains(sI) ) { in optimizeExitBranches()
189 visited.add(sI); in optimizeExitBranches()
216 if ( visited.contains(sI) ) { in optimizeEOTBranches()
219 visited.add(sI); in optimizeEOTBranches()
DMachineProbe.java49 Set<DFAState> visited = new HashSet<DFAState>(); in getAnyDFAPathToTarget() local
50 return getAnyDFAPathToTarget(dfa.startState, targetState, visited); in getAnyDFAPathToTarget()
54 DFAState targetState, Set<DFAState> visited) { in getAnyDFAPathToTarget() argument
56 visited.add(startState); in getAnyDFAPathToTarget()
65 if (!visited.contains(e.target)) { in getAnyDFAPathToTarget()
67 (DFAState) e.target, targetState, visited); in getAnyDFAPathToTarget()
/external/llvm/lib/CodeGen/SelectionDAG/
DSelectionDAGPrinter.cpp226 bool SelectionDAG::setSubgraphColorHelper(SDNode *N, const char *Color, DenseSet<SDNode *> &visited, in setSubgraphColorHelper() argument
239 unsigned oldSize = visited.size(); in setSubgraphColorHelper()
240 visited.insert(N); in setSubgraphColorHelper()
241 if (visited.size() != oldSize) { in setSubgraphColorHelper()
246 hit_limit = setSubgraphColorHelper(*i, Color, visited, level+1, printed) || hit_limit; in setSubgraphColorHelper()
260 DenseSet<SDNode *> visited; in setSubgraphColor() local
262 if (setSubgraphColorHelper(N, Color, visited, 0, printed)) { in setSubgraphColor()
265 setSubgraphColorHelper(N, "blue", visited, 0, printed); in setSubgraphColor()
267 setSubgraphColorHelper(N, "green", visited, 0, printed); in setSubgraphColor()
/external/clang/lib/StaticAnalyzer/Checkers/
DUnreachableCodeChecker.cpp47 CFGBlocksSet &visited);
56 CFGBlocksSet reachable, visited; in checkEndAnalysis() local
111 if (!visited.count(CB->getBlockID())) in checkEndAnalysis()
112 FindUnreachableEntryPoints(CB, reachable, visited); in checkEndAnalysis()
176 CFGBlocksSet &visited) { in FindUnreachableEntryPoints() argument
177 visited.insert(CB->getBlockID()); in FindUnreachableEntryPoints()
188 if (!visited.count((*I)->getBlockID())) in FindUnreachableEntryPoints()
190 FindUnreachableEntryPoints(*I, reachable, visited); in FindUnreachableEntryPoints()
/external/llvm/unittests/Support/
DPath.cpp666 v_t visited; in TEST_F() local
677 visited.push_back(path::filename(i->path())); in TEST_F()
679 v_t::const_iterator a0 = std::find(visited.begin(), visited.end(), "a0"); in TEST_F()
680 v_t::const_iterator aa1 = std::find(visited.begin(), visited.end(), "aa1"); in TEST_F()
681 v_t::const_iterator ab1 = std::find(visited.begin(), visited.end(), "ab1"); in TEST_F()
682 v_t::const_iterator dontlookhere = std::find(visited.begin(), visited.end(), in TEST_F()
684 v_t::const_iterator da1 = std::find(visited.begin(), visited.end(), "da1"); in TEST_F()
685 v_t::const_iterator z0 = std::find(visited.begin(), visited.end(), "z0"); in TEST_F()
686 v_t::const_iterator za1 = std::find(visited.begin(), visited.end(), "za1"); in TEST_F()
687 v_t::const_iterator pop = std::find(visited.begin(), visited.end(), "pop"); in TEST_F()
[all …]
/external/v8/test/cctest/
Dtest-global-handles.cc80 visited.Add(*o); in VisitPointers()
83 List<Object*> visited; member in TestObjectVisitor
131 CHECK(visitor.visited.length() == 0); in TEST()
155 CHECK(visitor.visited.length() == 2); in TEST()
156 CHECK(visitor.visited.Contains(*g1s1.location())); in TEST()
157 CHECK(visitor.visited.Contains(*g1s2.location())); in TEST()
174 CHECK(visitor.visited.length() == 2); in TEST()
175 CHECK(visitor.visited.Contains(*g2s1.location())); in TEST()
176 CHECK(visitor.visited.Contains(*g2s2.location())); in TEST()
226 CHECK(visitor.visited.length() == 0); in TEST()
[all …]
/external/mockito/cglib-and-asm/src/org/mockito/asm/signature/
DSignatureReader.java147 boolean visited, inner; in parseType()
173 visited = false; in parseType()
179 if (!visited) { in parseType()
192 visited = false; in parseType()
203 visited = true; in parseType()
/external/compiler-rt/lib/sanitizer_common/
Dsanitizer_bvgraph.h113 &visited = t2; in isReachable() local
115 visited.clear(); in isReachable()
116 visited.setBit(from); in isReachable()
119 if (visited.setBit(idx)) in isReachable()
122 return targets.intersectsWith(visited); in isReachable()
/external/valgrind/auxprogs/
DDotToScc.hs114 search relation (visited, sequence) vertex
115 | utSetElementOf vertex visited = (visited, sequence )
120 (utSetUnion visited (utSetSingleton vertex), sequence)
136 search relation (visited, utSetSequence) vertex
137 | utSetElementOf vertex visited = (visited, utSetSequence )
142 (utSetUnion visited (utSetSingleton vertex), [])
/external/openfst/src/include/fst/
Dprune.h131 vector<bool> visited(ns, false); in Prune()
150 visited[s] = true; in Prune()
169 if (visited[arc.nextstate]) continue; in Prune()
181 for (size_t i = 0; i < visited.size(); ++i) in Prune()
182 if (!visited[i]) dead.push_back(i); in Prune()
254 vector<bool> visited; in Prune() local
268 visited.push_back(false); in Prune()
276 visited[s] = true; in Prune()
305 visited.push_back(false); in Prune()
307 if (visited[arc.nextstate]) continue; in Prune()
/external/clang/lib/Analysis/
DCFGReachabilityAnalysis.cpp44 llvm::BitVector visited(analyzed.size()); in mapReachability() local
57 if (visited[block->getBlockID()]) in mapReachability()
59 visited[block->getBlockID()] = true; in mapReachability()
/external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph/
DGraphUtil.py110 visited, removes, orphans = set([head]), set(), set()
130 if tail not in visited:
131 visited.add(tail)
137 return visited, removes, orphans
DGraph.py494 visited, stack = set([start]), deque([start])
510 if tail not in visited:
511 visited.add(tail)
521 visited, stack = set([start]), deque([start])
543 if tail not in visited:
544 visited.add(tail)
553 queue, visited = deque([(start, 0)]), set([start])
570 if tail not in visited:
571 visited.add(tail)
/external/guice/extensions/multibindings/test/com/google/inject/multibindings/
DSpiUtils.java192 Object visited = b.acceptTargetVisitor(visitor); in mapInjectorTest() local
193 if(visited instanceof MapBinderBinding) { in mapInjectorTest()
194 if(visited.equals(mapbinder)) { in mapInjectorTest()
197 otherMapBindings.add(visited); in mapInjectorTest()
329 Object visited = b.acceptTargetVisitor(visitor); in mapModuleTest() local
330 if(visited instanceof MapBinderBinding) { in mapModuleTest()
332 if(visited.equals(mapbinder)) { in mapModuleTest()
335 otherMapBindings.add(visited); in mapModuleTest()
490 Object visited = b.acceptTargetVisitor(visitor); in setInjectorTest() local
491 if(visited != null) { in setInjectorTest()
[all …]
/external/guava/guava/src/com/google/common/reflect/
DTypeVisitor.java63 private final Set<Type> visited = Sets.newHashSet(); field in TypeVisitor
71 if (type == null || !visited.add(type)) { in visit()
93 visited.remove(type); in visit()
/external/v8/tools/turbolizer/
Dgraph-layout.js272 var visited = [];
281 visited[n.id] = false;
290 var visited = [];
332 visited = [];
334 if (visited[n.id]) return;
335 visited[n.id] = true;
356 visited = [];
358 if (visited[n.id]) return;
359 visited[n.id] = true;
/external/mesa3d/src/gallium/drivers/nv50/codegen/
Dnv50_ir_graph.h138 int visited; variable
196 if (visited == v) in visit()
198 visited = v; in visit()
204 return visited; in getSequence()
/external/chromium-trace/catapult/third_party/webapp2/docs/_themes/webapp2/static/
Dwebapp2.css27 a:visited,
28 a:visited tt.literal span.pre {
174 …r h2 a, div.sphinxsidebar h2 a:link, div.sphinxsidebar h2 a:active, div.sphinxsidebar h2 a:visited,
175 …r h3 a, div.sphinxsidebar h3 a:link, div.sphinxsidebar h3 a:active, div.sphinxsidebar h3 a:visited,
176 … h4 a, div.sphinxsidebar h4 a:link, div.sphinxsidebar h4 a:active, div.sphinxsidebar h4 a:visited {
256 table.indextable a:visited {
/external/valgrind/coregrind/
Dm_sparsewa.c376 LevelN* visited[_3_or_7]; in VG_() local
390 visited[nVisited] = levelN; in VG_()
418 vg_assert(visited[nVisited]->child[ visitedIx[nVisited] ]); in VG_()
419 visited[nVisited]->child[ visitedIx[nVisited] ] = NULL; in VG_()
420 visited[nVisited]->nInUse--; in VG_()
421 vg_assert(visited[nVisited]->nInUse >= 0); in VG_()
422 if (visited[nVisited]->nInUse > 0) in VG_()
424 swa->dealloc(visited[nVisited]); in VG_()
/external/llvm/lib/Target/NVPTX/
DNVPTXUtilities.cpp402 void llvm::dumpInstRec(Value *v, std::set<Instruction *> *visited) { in dumpInstRec() argument
405 if (visited->find(I) != visited->end()) in dumpInstRec()
408 visited->insert(I); in dumpInstRec()
411 dumpInstRec(I->getOperand(i), visited); in dumpInstRec()
419 std::set<Instruction *> visited; in dumpInstRec() local
423 dumpInstRec(v, &visited); in dumpInstRec()
/external/skia/tests/
DPDFPrimitivesTest.cpp367 DummyImageFilter(bool visited = false) : SkImageFilter(0, nullptr), fVisited(visited) {} in DummyImageFilter() argument
378 bool visited() const { return fVisited; } in SK_DECLARE_PUBLIC_FLATTENABLE_DESERIALIZATION_PROCS()
386 bool visited = buffer.readBool(); in CreateProc() local
387 return new DummyImageFilter(visited); in CreateProc()
409 REPORTER_ASSERT(reporter, !filter->visited()); in DEF_TEST()
416 REPORTER_ASSERT(reporter, filter->visited()); in DEF_TEST()
/external/testng/doc/samplereport/css/
Dmaven-classic.css91 a:link, #breadcrumbs a:visited, #navcolumn a:visited, .contentBox a:visited, .tasknav a:visited {
99 a:link.selfref, a:visited.selfref {
107 a.externalLink, a.externalLink:link, a.externalLink:visited, a.externalLink:active, a.externalLink:…
116 a.newWindow, a.newWindow:link, a.newWindow:visited, a.newWindow:active, a.newWindow:hover {
184 a:link.selfref, a:visited.selfref {
193 .contentBox h2 a:link, .contentBox h2 a:visited, .contentBox h3 a:link, .contentBox h3 a:visited {
275 .tabs th, .tabs th a:link, .tabs th a:visited {
279 .tabs td, .tabs td a:link, .tabs td a:visited {

123456