| /external/chromium_org/components/dom_distiller/webui/resources/ |
| about_dom_distiller.css | 6 a:visited {
|
| /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/chromium_org/chrome/browser/resources/ntp4/ |
| most_visited_page.css | 5 .most-visited {
10 .most-visited {
17 .most-visited:focus {
40 .most-visited .close-button {
49 html[dir=rtl] .most-visited .close-button {
54 .most-visited:hover .close-button {
59 .most-visited .close-button:hover {
63 .most-visited .favicon {
75 html[dir='rtl'] .most-visited .favicon {
79 .most-visited .color-stripe
[all...] |
| new_tab_theme.css | 94 /* Most Visited ***************************************************************/
96 .most-visited,
97 .most-visited > .title {
101 .most-visited:focus:not(.filler) .thumbnail-wrapper,
102 .most-visited:hover:not(.filler) .thumbnail-wrapper {
|
| /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/chromium_org/chrome/browser/resources/local_ntp/ |
| most_visited_iframe.css | 18 a:visited {
|
| /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);
|
| /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}
|
| /external/clang/lib/Analysis/ |
| CFGReachabilityAnalysis.cpp | 44 llvm::BitVector visited(analyzed.size());
57 if (visited[block->getBlockID()])
59 visited[block->getBlockID()] = true;
|
| /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);
|
| /art/compiler/dex/ |
| dataflow_iterator-inl.h | 126 // Mark last processed block visited.
128 bb->visited = true;
133 child_bb->visited = false;
149 if (!recalculated || !loop_head->visited) {
165 if (!bb->visited) {
|
| /external/chromium_org/v8/test/cctest/ |
| test-global-handles.cc | 80 visited.Add(*o);
83 List<Object*> visited; member in class:TestObjectVisitor
130 // Nothing was visited.
131 ASSERT(visitor.visited.length() == 0);
139 // The first grough should still be visited, since only one object is
154 // The first group was visited.
155 ASSERT(visitor.visited.length() == 2);
156 ASSERT(visitor.visited.Contains(*g1s1.location()));
157 ASSERT(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);
|
| /external/chromium_org/ppapi/generators/ |
| idl_node.py | 190 def GetDeps(self, release, visited=None):
191 visited = visited or set()
202 # If we are already visited, then return
203 if self in visited:
207 visited |= set([self])
212 deps |= child.GetDeps(release, visited)
213 visited |= set(deps)
218 deps |= typeref.GetDeps(release, visited)
262 def _GetReleaseList(self, releases, visited=None)
[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);
|
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_bvgraph.h | 113 &visited = t2; local
115 visited.clear();
116 visited.setBit(from);
119 if (visited.setBit(idx))
122 return targets.intersectsWith(visited);
|
| /external/llvm/unittests/Support/ |
| Path.cpp | 431 v_t visited; local
442 visited.push_back(path::filename(i->path()));
444 v_t::const_iterator a0 = std::find(visited.begin(), visited.end(), "a0");
445 v_t::const_iterator aa1 = std::find(visited.begin(), visited.end(), "aa1");
446 v_t::const_iterator ab1 = std::find(visited.begin(), visited.end(), "ab1");
447 v_t::const_iterator dontlookhere = std::find(visited.begin(), visited.end()
[all...] |
| /frameworks/base/sax/java/android/sax/ |
| Element.java | 40 boolean visited; field in class:Element
180 requiredChildren.get(i).visited = false;
193 if (!child.visited) {
|
