| /external/eigen/Eigen/src/MetisSupport/ |
| MetisSupport.h | 37 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(idx) != j )
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| Graph.java | 82 Set<Node> visited = new OrderedHashSet<Node>(); local
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) {
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/ |
| DFAOptimizer.java | 128 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.add(sI)
[all...] |
| MachineProbe.java | 49 Set<DFAState> visited = new HashSet<DFAState>(); local
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);
|
| /system/tools/hidl/ |
| Type.cpp | 162 std::unordered_set<const Type*>* visited) {
165 if (visited->find(this) != visited->end()) return OK;
166 visited->insert(this);
172 err = nextType->recursivePass(func, visited);
177 err = nextRef->shallowGet()->recursivePass(func, visited);
185 std::unordered_set<const Type*>* visited) const {
188 if (visited->find(this) != visited->end()) return OK;
189 visited->insert(this)
340 std::unordered_set<const Type*> visited; local
639 std::unordered_set<const Type*> visited; local
698 std::unordered_set<const Type*> visited; local
703 std::unordered_set<const Type*> visited; local
[all...] |
| PointerType.h | 51 bool deepIsJavaCompatible(std::unordered_set<const Type*>* visited) const override;
52 bool deepContainsPointer(std::unordered_set<const Type*>* visited) const override;
|
| RefType.h | 74 bool deepNeedsResolveReferences(std::unordered_set<const Type*>* visited) const override;
77 bool deepIsJavaCompatible(std::unordered_set<const Type*>* visited) const override;
78 bool deepContainsPointer(std::unordered_set<const Type*>* visited) const override;
|
| /external/pdfium/fpdfsdk/ |
| fsdk_actionhandler.cpp | 26 std::set<CPDF_Dictionary*> visited; local
27 return ExecuteDocumentOpenAction(action, pFormFillEnv, &visited);
67 std::set<CPDF_Dictionary*> visited; local
68 return ExecuteDocumentPageAction(action, eType, pFormFillEnv, &visited);
75 std::set<CPDF_Dictionary*> visited; local
76 return ExecuteDocumentPageAction(action, eType, pFormFillEnv, &visited);
84 std::set<CPDF_Dictionary*> visited; local
85 return ExecuteBookMark(action, pFormFillEnv, pBookMark, &visited);
93 std::set<CPDF_Dictionary*> visited; local
94 return ExecuteScreenAction(action, type, pFormFillEnv, pScreen, &visited);
100 std::set<CPDF_Dictionary*> visited; local
110 std::set<CPDF_Dictionary*> visited; local
[all...] |
| fsdk_actionhandler.h | 61 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/tensorflow/tensorflow/core/graph/ |
| algorithm.cc | 37 std::vector<bool> visited(g.num_node_ids(), false);
48 if (visited[n->id()]) continue;
49 visited[n->id()] = true;
56 auto add_work = [&visited, &stack](Node* out) {
57 if (!visited[out->id()]) {
58 // Note; we must not mark as visited until we actually process it.
103 std::vector<bool> visited(g.num_node_ids(), false);
114 if (visited[n->id()]) continue;
115 visited[n->id()] = true;
123 auto add_work = [&visited, &stack](T out)
[all...] |
| /development/vndk/tools/sourcedr/sourcedr/ |
| map.py | 30 visited = set()
34 if v not in visited:
35 visited.add(v)
38 if x not in visited and not x.endswith('.so')
42 visited.remove(s)
43 dep[s] = visited
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Tools/gdb/ |
| libpython.py | 32 visited so far in the traversal, to avoid infinite recursion due to cycles in
169 def write_field_repr(self, name, out, visited):
175 field_obj.write_repr(out, visited)
220 def proxyval(self, visited):
231 visited: a set of all gdb.Value pyobject pointers already visited
259 def write_repr(self, out, visited):
267 return out.write(repr(self.proxyval(visited)))
374 def _write_instance_repr(out, visited, name, pyop_attrdict, address):
388 out.write(pyop_arg.proxyval(visited))
[all...] |
| /external/python/cpython2/Tools/gdb/ |
| libpython.py | 32 visited so far in the traversal, to avoid infinite recursion due to cycles in
201 def write_field_repr(self, name, out, visited):
207 field_obj.write_repr(out, visited)
252 def proxyval(self, visited):
263 visited: a set of all gdb.Value pyobject pointers already visited
291 def write_repr(self, out, visited):
299 return out.write(repr(self.proxyval(visited)))
406 def _write_instance_repr(out, visited, name, pyop_attrdict, address):
420 out.write(pyop_arg.proxyval(visited))
[all...] |
| /external/libdaemon/doc/ |
| style.css | 27 a:link, a:visited { color: #900000; }
|
| /external/clang/lib/Analysis/ |
| CFGReachabilityAnalysis.cpp | 44 llvm::BitVector visited(analyzed.size());
57 if (visited[block->getBlockID()])
59 visited[block->getBlockID()] = true;
|
| /external/guava/guava/src/com/google/common/reflect/ |
| TypeVisitor.java | 53 * <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);
|
| /frameworks/base/tools/aapt2/ |
| ValueVisitor_test.cpp | 30 Reference* visited = nullptr;
32 void Visit(Reference* ref) override { visited = ref; }
54 EXPECT_EQ(visitor.visited, &ref);
|
| /prebuilts/go/darwin-x86/src/go/types/ |
| typestring.go | 78 func writeType(buf *bytes.Buffer, typ Type, qf Qualifier, visited []Type) {
83 for _, t := range visited {
89 visited = append(visited, typ)
112 writeType(buf, t.elem, qf, visited)
116 writeType(buf, t.elem, qf, visited)
128 writeType(buf, f.typ, qf, visited)
137 writeType(buf, t.base, qf, visited)
140 writeTuple(buf, t, false, qf, visited)
144 writeSignature(buf, t, qf, visited)
[all...] |
| /prebuilts/go/linux-x86/src/go/types/ |
| typestring.go | 78 func writeType(buf *bytes.Buffer, typ Type, qf Qualifier, visited []Type) {
83 for _, t := range visited {
89 visited = append(visited, typ)
112 writeType(buf, t.elem, qf, visited)
116 writeType(buf, t.elem, qf, visited)
128 writeType(buf, f.typ, qf, visited)
137 writeType(buf, t.base, qf, visited)
140 writeTuple(buf, t, false, qf, visited)
144 writeSignature(buf, t, qf, visited)
[all...] |
| /external/annotation-tools/asmx/src/org/objectweb/asm/signature/ |
| SignatureReader.java | 151 boolean visited, inner;
177 visited = false;
183 if (!visited) {
196 visited = false;
207 visited = true;
|
| /packages/apps/Gallery2/src/com/android/gallery3d/ingest/data/ |
| ImportTask.java | 76 int visited = 0; local
78 mListener.onImportProgress(visited, total, null);
82 visited++;
94 mListener.onImportProgress(visited, total, importedPath);
98 mListener.onImportFinish(objectsNotImported, visited);
|
| /packages/providers/ContactsProvider/src/com/android/providers/contacts/aggregation/util/ |
| ContactAggregatorHelper.java | 98 Set<Long> visited = new ArraySet<>(); local
100 if (!visited.contains(id)) {
102 findConnectedComponentForRawContact(matchingRawIdPairs, visited, id, set);
110 Set<Long> visited, Long rawContactId, Set<Long> results) {
111 visited.add(rawContactId);
114 if (!visited.contains(match)) {
115 findConnectedComponentForRawContact(connections, visited, match, results);
|
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| call_graph.cc | 139 tensorflow::gtl::FlatSet<const HloComputation*>* visited) const {
140 if (a == b || ContainsKey(*visited, b)) {
141 // The call graph is guaranteed to be acyclic so any previously visited node
153 visited->insert(b);
155 if (!DominatesHelper(a, b_caller, visited)) {
164 tensorflow::gtl::FlatSet<const HloComputation*> visited; local
165 return DominatesHelper(a, b, &visited);
278 tensorflow::gtl::FlatSet<const CallGraphNode*>* visited) const {
279 auto pair = visited->insert(&node);
281 // Node was not inserted. Node has already been visited
295 tensorflow::gtl::FlatSet<const CallGraphNode*> visited; local
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGPrinter.cpp | 226 bool SelectionDAG::setSubgraphColorHelper(SDNode *N, const char *Color, DenseSet<SDNode *> &visited,
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/ |
| SelectionDAGPrinter.cpp | 221 bool SelectionDAG::setSubgraphColorHelper(SDNode *N, const char *Color, DenseSet<SDNode *> &visited,
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);
|
