Searched refs:visited (Results 1 - 25 of 153) sorted by relevance

1234567

/external/eigen/Eigen/src/MetisSupport/
H A DMetisSupport.h37 IndexVector visited(m);
38 visited.setConstant(-1);
42 visited(j) = j; // Do not include the diagonal element
47 if (visited(idx) != j )
49 visited(idx) = j;
57 if(visited(idx) != j)
59 visited(idx) = j;
69 visited.setConstant(-1);
75 visited(j) = j; // Do not include the diagonal element
80 if (visited(id
[all...]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
H A DGraph.java82 Set<Node> visited = new OrderedHashSet<Node>();
84 while ( visited.size() < nodes.size() ) {
89 if ( !visited.contains(n) ) break;
91 DFS(n, visited, sorted);
96 public void DFS(Node n, Set<Node> visited, ArrayList<Object> sorted) { argument
97 if ( visited.contains(n) ) return;
98 visited.add(n);
102 DFS(target, visited, sorted);
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
H A DDFAOptimizer.java128 protected Set visited = new HashSet(); field in class:DFAOptimizer
157 visited.clear();
172 visited.clear();
177 visited.clear();
186 if ( visited.contains(sI) ) {
187 return; // already visited
189 visited.add(sI);
216 if ( visited.contains(sI) ) {
217 return; // already visited
219 visited
[all...]
H A DMachineProbe.java49 Set<DFAState> visited = new HashSet<DFAState>();
50 return getAnyDFAPathToTarget(dfa.startState, targetState, visited);
54 DFAState targetState, Set<DFAState> visited) {
56 visited.add(startState);
65 if (!visited.contains(e.target)) {
67 (DFAState) e.target, targetState, visited);
53 getAnyDFAPathToTarget(DFAState startState, DFAState targetState, Set<DFAState> visited) argument
/external/pdfium/fpdfsdk/
H A Dfsdk_actionhandler.cpp24 std::set<CPDF_Dictionary*> visited; local
25 return ExecuteDocumentOpenAction(action, pFormFillEnv, &visited);
65 std::set<CPDF_Dictionary*> visited; local
66 return ExecuteDocumentPageAction(action, eType, pFormFillEnv, &visited);
73 std::set<CPDF_Dictionary*> visited; local
74 return ExecuteDocumentPageAction(action, eType, pFormFillEnv, &visited);
82 std::set<CPDF_Dictionary*> visited; local
83 return ExecuteBookMark(action, pFormFillEnv, pBookMark, &visited);
91 std::set<CPDF_Dictionary*> visited; local
92 return ExecuteScreenAction(action, type, pFormFillEnv, pScreen, &visited);
98 std::set<CPDF_Dictionary*> visited; local
108 std::set<CPDF_Dictionary*> visited; local
113 ExecuteDocumentOpenAction( const CPDF_Action& action, CPDFSDK_FormFillEnvironment* pFormFillEnv, std::set<CPDF_Dictionary*>* visited) argument
144 ExecuteLinkAction( const CPDF_Action& action, CPDFSDK_FormFillEnvironment* pFormFillEnv, std::set<CPDF_Dictionary*>* visited) argument
184 ExecuteDocumentPageAction( const CPDF_Action& action, CPDF_AAction::AActionType type, CPDFSDK_FormFillEnvironment* pFormFillEnv, std::set<CPDF_Dictionary*>* visited) argument
229 ExecuteFieldAction( const CPDF_Action& action, CPDF_AAction::AActionType type, CPDFSDK_FormFillEnvironment* pFormFillEnv, CPDF_FormField* pFormField, PDFSDK_FieldAction& data, std::set<CPDF_Dictionary*>* visited) argument
266 ExecuteScreenAction( const CPDF_Action& action, CPDF_AAction::AActionType type, CPDFSDK_FormFillEnvironment* pFormFillEnv, CPDFSDK_Annot* pScreen, std::set<CPDF_Dictionary*>* visited) argument
306 ExecuteBookMark( const CPDF_Action& action, CPDFSDK_FormFillEnvironment* pFormFillEnv, CPDF_Bookmark* pBookmark, std::set<CPDF_Dictionary*>* visited) argument
[all...]
H A Dfsdk_actionhandler.h61 std::set<CPDF_Dictionary*>* visited);
65 std::set<CPDF_Dictionary*>* visited);
71 std::set<CPDF_Dictionary*>* visited);
76 std::set<CPDF_Dictionary*>* visited);
80 std::set<CPDF_Dictionary*>* visited);
83 std::set<CPDF_Dictionary*>* visited);
/external/libdaemon/doc/
H A Dstyle.css27 a:link, a:visited { color: #900000; }
/external/clang/lib/Analysis/
H A DCFGReachabilityAnalysis.cpp44 llvm::BitVector visited(analyzed.size());
57 if (visited[block->getBlockID()])
59 visited[block->getBlockID()] = true;
/external/guava/guava/src/com/google/common/reflect/
H A DTypeVisitor.java53 * <p>One {@code Type} is visited at most once. The second time the same type is visited, it's
63 private final Set<Type> visited = Sets.newHashSet(); field in class:TypeVisitor
71 if (type == null || !visited.add(type)) {
72 // null owner type, or already visited;
93 visited.remove(type);
/external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph/
H A DGraphUtil.py98 Returns (visited, removes, orphans).
100 * visited: the set of visited nodes
110 visited, removes, orphans = set([head]), set(), set()
130 if tail not in visited:
131 visited.add(tail)
137 return visited, removes, orphans
H A 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/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAGPrinter.cpp226 bool SelectionDAG::setSubgraphColorHelper(SDNode *N, const char *Color, DenseSet<SDNode *> &visited, argument
239 unsigned oldSize = visited.size();
240 visited.insert(N);
241 if (visited.size() != oldSize) {
246 hit_limit = setSubgraphColorHelper(*i, Color, visited, level+1, printed) || hit_limit;
260 DenseSet<SDNode *> visited; local
262 if (setSubgraphColorHelper(N, Color, visited, 0, printed)) {
265 setSubgraphColorHelper(N, "blue", visited, 0, printed);
267 setSubgraphColorHelper(N, "green", visited, 0, printed);
/external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/
H A DSelectionDAGPrinter.cpp221 bool SelectionDAG::setSubgraphColorHelper(SDNode *N, const char *Color, DenseSet<SDNode *> &visited, argument
234 unsigned oldSize = visited.size();
235 visited.insert(N);
236 if (visited.size() != oldSize) {
241 hit_limit = setSubgraphColorHelper(*i, Color, visited, level+1, printed) || hit_limit;
255 DenseSet<SDNode *> visited; local
257 if (setSubgraphColorHelper(N, Color, visited, 0, printed)) {
260 setSubgraphColorHelper(N, "blue", visited, 0, printed);
262 setSubgraphColorHelper(N, "green", visited, 0, printed);
/external/clang/lib/StaticAnalyzer/Checkers/
H A DUnreachableCodeChecker.cpp10 // path-sensitive analysis. We mark any path visited, and then walk the CFG as a
11 // post-analysis to determine what was never visited.
43 CFGBlocksSet &visited);
52 CFGBlocksSet reachable, visited; local
107 if (!visited.count(CB->getBlockID()))
108 FindUnreachableEntryPoints(CB, reachable, visited);
172 CFGBlocksSet &visited) {
173 visited.insert(CB->getBlockID());
184 if (!visited.count((*I)->getBlockID()))
185 // If we haven't previously visited th
170 FindUnreachableEntryPoints(const CFGBlock *CB, CFGBlocksSet &reachable, CFGBlocksSet &visited) argument
[all...]
/external/clang/www/
H A Dmenu.css37 #menu a:visited {
/external/compiler-rt/www/
H A Dmenu.css37 #menu a:visited {
/external/libcxx/www/
H A Dmenu.css37 #menu a:visited {
/external/libcxxabi/www/
H A Dmenu.css37 #menu a:visited {
/external/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_bvgraph.h113 &visited = t2; local
115 visited.clear();
116 visited.setBit(from);
119 if (visited.setBit(idx))
122 return targets.intersectsWith(visited);
/external/mesa3d/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_graph.h138 int visited; member in class:nv50_ir::Graph::Node
196 if (visited == v)
198 visited = v;
204 return visited;
/external/swiftshader/third_party/LLVM/lib/Analysis/
H A DDominanceFrontier.cpp45 SmallPtrSet<BasicBlock *, 32> visited; local
61 if (visited.count(currentBB) == 0) {
62 visited.insert(currentBB);
81 if (visited.count(childBB) == 0) {
88 // If all children are visited or there is any child then pop this block
/external/valgrind/docs/lib/
H A Dvg_basic.css2 a, a:link, a:visited, a:active { color: #74240f; }
20 code a, code a:link, code a:visited, code a:active, code a:hover {
/external/llvm/unittests/Support/
H A DPath.cpp667 v_t visited; local
678 visited.push_back(path::filename(i->path()));
680 v_t::const_iterator a0 = std::find(visited.begin(), visited.end(), "a0");
681 v_t::const_iterator aa1 = std::find(visited.begin(), visited.end(), "aa1");
682 v_t::const_iterator ab1 = std::find(visited.begin(), visited.end(), "ab1");
683 v_t::const_iterator dontlookhere = std::find(visited.begin(), visited
[all...]
/external/v8/tools/turbolizer/
H A Dgraph-layout.js266 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/guice/extensions/multibindings/test/com/google/inject/multibindings/
H A DSpiUtils.java192 Object visited = b.acceptTargetVisitor(visitor);
193 if(visited instanceof MapBinderBinding) {
194 if(visited.equals(mapbinder)) {
197 otherMapBindings.add(visited);
329 Object visited = b.acceptTargetVisitor(visitor);
330 if(visited instanceof MapBinderBinding) {
332 if(visited.equals(mapbinder)) {
335 otherMapBindings.add(visited);
490 Object visited = b.acceptTargetVisitor(visitor);
491 if(visited !
[all...]

Completed in 1924 milliseconds

1234567