/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);
|
/external/libdaemon/doc/ |
style.css | 27 a:link, a:visited { color: #900000; }
|
/external/v8/src/compiler/ |
select-lowering.cc | 68 BoolVector visited(graph()->NodeCount(), false, &zone); 70 visited[source->id()] = true; 76 if (!visited[input->id()]) { 78 visited[input->id()] = true;
|
/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);
|
/external/mockito/cglib-and-asm/src/org/mockito/asm/signature/ |
SignatureReader.java | 147 boolean visited, inner;
173 visited = false;
179 if (!visited) {
192 visited = false;
203 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);
|
/external/chromium-trace/catapult/third_party/html5lib-python/html5lib/tests/ |
support.py | 139 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...] |
test_treeadapters.py | 40 assert expected == handler.visited
|
/packages/providers/ContactsProvider/src/com/android/providers/contacts/aggregation/util/ |
ContactAggregatorHelper.java | 97 Set<Long> visited = new HashSet<>(); local 99 if (!visited.contains(id)) { 101 findConnectedComponentForRawContact(matchingRawIdPairs, visited, id, set); 109 Set<Long> visited, Long rawContactId, Set<Long> results) { 110 visited.add(rawContactId); 113 if (!visited.contains(match)) { 114 findConnectedComponentForRawContact(connections, visited, match, results);
|
/frameworks/base/tools/aapt2/ |
ValueVisitor_test.cpp | 30 Reference* visited = nullptr; 33 visited = ref; 58 EXPECT_EQ(visitor.visited, &ref);
|
/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);
|
/art/runtime/gc/accounting/ |
space_bitmap.cc | 188 void SpaceBitmap<kAlignment>::WalkInstanceFields(SpaceBitmap<kAlignment>* visited, 195 WalkInstanceFields(visited, callback, obj, super, arg); 202 WalkFieldsInOrder(visited, callback, value, arg); 209 void SpaceBitmap<kAlignment>::WalkFieldsInOrder(SpaceBitmap<kAlignment>* visited, 212 if (visited->Test(obj)) { 217 visited->Set(obj); 220 WalkInstanceFields(visited, callback, obj, klass, arg); 227 WalkFieldsInOrder(visited, callback, value, arg); 238 WalkFieldsInOrder(visited, callback, value, arg); 246 std::unique_ptr<SpaceBitmap<kAlignment>> visited( [all...] |
/external/avahi/man/ |
xmltoman.css | 20 a:link, a:visited { color: #900000; }
|
/external/chromium-trace/catapult/third_party/pipeline/pipeline/ui/ |
common.css | 39 #butter a:visited,
|
/external/clang/lib/StaticAnalyzer/Checkers/ |
UnreachableCodeChecker.cpp | 10 // path-sensitive analysis. We mark any path visited, and then walk the CFG as a 11 // post-analysis to determine what was never visited. 47 CFGBlocksSet &visited); 56 CFGBlocksSet reachable, visited; local 111 if (!visited.count(CB->getBlockID())) 112 FindUnreachableEntryPoints(CB, reachable, visited); 176 CFGBlocksSet &visited) { 177 visited.insert(CB->getBlockID()); 188 if (!visited.count((*I)->getBlockID())) 189 // If we haven't previously visited the unreachable predecessor, recurs [all...] |
/external/clang/www/ |
menu.css | 37 #menu a:visited {
|
/external/compiler-rt/www/ |
menu.css | 37 #menu a:visited {
|
/external/libcxx/www/ |
menu.css | 37 #menu a:visited {
|
/external/libcxxabi/www/ |
menu.css | 37 #menu a:visited {
|
/sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/descriptors/ |
ElementDescriptor.java | 401 Set<ElementDescriptor> visited) { 402 if (recursive && visited == null) { 403 visited = new HashSet<ElementDescriptor>(); 412 if (visited != null) { 413 visited.add(this); 418 if (visited != null) { 419 if (!visited.add(e)) { // Set.add() returns false if element is already present 424 recursive, visited);
|
/art/compiler/optimizing/ |
dead_code_elimination.cc | 25 static void MarkReachableBlocks(HGraph* graph, ArenaBitVector* visited) { 29 visited->SetBit(graph->GetEntryBlock()->GetBlockId()); 36 DCHECK(visited->IsBitSet(block_id)); 75 // Add only those successors that have not been visited yet. 76 if (!visited->IsBitSet(successor->GetBlockId())) { 77 visited->SetBit(successor->GetBlockId());
|