| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/ |
| simple_paths.py | 81 visited = [source]
88 visited.pop()
89 elif len(visited) < cutoff:
91 yield visited + [target]
92 elif child not in visited:
93 visited.append(child)
95 else: #len(visited) == cutoff:
97 yield visited + [target]
99 visited.pop()
105 visited = [source
[all...] |
| /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);
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/traversal/ |
| depth_first_search.py | 31 visited=set()
33 if start in visited:
35 visited.add(start)
41 if child not in visited:
43 visited.add(child)
103 visited=set()
105 if start in visited:
108 visited.add(start)
114 if child in visited:
118 visited.add(child
[all...] |
| breadth_first_search.py | 24 visited=set([source])
30 if child not in visited:
32 visited.add(child)
|
| /external/v8/src/compiler/ |
| generic-algorithm.h | 48 BoolVector visited(Traits::max_id(graph), false, zone);
55 bool visit = !GetVisited(&visited, id);
59 if (!IsReenter(control)) SetVisited(&visited, id, true);
71 SetVisited(&visited, post_order_node->id(), !IsReenter(control));
85 if (!GetVisited(&visited, current->id())) break;
115 static void SetVisited(BoolVector* visited, int id, bool value) {
116 if (id >= static_cast<int>(visited->size())) {
118 visited->resize((3 * id) / 2, false);
120 visited->at(id) = value;
123 static bool GetVisited(BoolVector* visited, int id)
[all...] |
| /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);
|
| /art/compiler/optimizing/ |
| dead_code_elimination.cc | 23 static void MarkReachableBlocks(HBasicBlock* block, ArenaBitVector* visited) {
25 if (visited->IsBitSet(block_id)) {
28 visited->SetBit(block_id);
35 MarkReachableBlocks(if_instruction->IfTrueSuccessor(), visited);
36 MarkReachableBlocks(if_instruction->IfFalseSuccessor(), visited);
38 MarkReachableBlocks(if_instruction->IfTrueSuccessor(), visited);
41 MarkReachableBlocks(if_instruction->IfFalseSuccessor(), visited);
45 MarkReachableBlocks(block->GetSuccessors().Get(i), visited);
|
| /cts/tools/signature-tools/templates/ |
| Styles.st | 8 a.default:visited {color: blue; text-decoration: none}
12 a.discreet:visited {color: black; text-decoration: none}
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/utils/ |
| rcm.py | 114 visited = set([start])
118 if parent not in visited:
122 if child not in visited:
124 visited.add(child)
|
| /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);
|
| /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);
|
| /external/v8/test/cctest/ |
| test-global-handles.cc | 80 visited.Add(*o);
83 List<Object*> visited; member in class:TestObjectVisitor
130 // Nothing was visited.
131 DCHECK(visitor.visited.length() == 0);
139 // The first grough should still be visited, since only one object is
154 // The first group was visited.
155 DCHECK(visitor.visited.length() == 2);
156 DCHECK(visitor.visited.Contains(*g1s1.location()));
157 DCHECK(visitor.visited.Contains(*g1s2.location()));
173 // The second group was visited
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGPrinter.cpp | 219 bool SelectionDAG::setSubgraphColorHelper(SDNode *N, const char *Color, DenseSet<SDNode *> &visited,
232 unsigned oldSize = visited.size();
233 visited.insert(N);
234 if (visited.size() != oldSize) {
239 hit_limit = setSubgraphColorHelper(*i, Color, visited, level+1, printed) || hit_limit;
253 DenseSet<SDNode *> visited; local
255 if (setSubgraphColorHelper(N, Color, visited, 0, printed)) {
258 setSubgraphColorHelper(N, "blue", visited, 0, printed);
260 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);
204 WalkFieldsInOrder(visited, callback, value, arg);
211 void SpaceBitmap<kAlignment>::WalkFieldsInOrder(SpaceBitmap<kAlignment>* visited,
214 if (visited->Test(obj)) {
219 visited->Set(obj);
222 WalkInstanceFields(visited, callback, obj, klass, arg);
231 WalkFieldsInOrder(visited, callback, value, arg);
242 WalkFieldsInOrder(visited, callback, value, arg);
250 std::unique_ptr<SpaceBitmap<kAlignment>> visited(
[all...] |
| /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);
|
