HomeSort by relevance Sort by last modified time
    Searched refs:visited (Results 1 - 25 of 239) sorted by null

1 2 3 4 5 6 7 8 910

  /external/chromium_org/components/dom_distiller/webui/resources/
about_dom_distiller.css 6 a:visited {
  /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 {
  /dalvik/vm/analysis/
VfyBasicBlock.h 48 bool visited; /* block has been visited at least once */ member in struct:VfyBasicBlock
  /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);
  /external/chromium/chrome/browser/resources/ntp4/
most_visited_page.css 6 .most-visited {
10 .most-visited {
17 .most-visited:focus {
74 .most-visited:focus .edit-bar,
75 .most-visited:hover .edit-bar {
79 .most-visited:hover .edit-bar {
137 .most-visited .title {
188 .most-visited:focus:not(.filler) .thumbnail-wrapper,
189 .most-visited:hover .thumbnail-wrapper {
195 .most-visited:hover .thumbnail-wrapper
    [all...]
  /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());
58 if (visited[block->getBlockID()])
60 visited[block->getBlockID()] = true;
  /external/llvm/unittests/Support/
Path.cpp 308 v_t visited; local
319 visited.push_back(path::filename(i->path()));
321 v_t::const_iterator a0 = std::find(visited.begin(), visited.end(), "a0");
322 v_t::const_iterator aa1 = std::find(visited.begin(), visited.end(), "aa1");
323 v_t::const_iterator ab1 = std::find(visited.begin(), visited.end(), "ab1");
324 v_t::const_iterator dontlookhere = std::find(visited.begin(), visited.end()
    [all...]
  /packages/apps/Gallery2/src/com/android/gallery3d/ingest/
ImportTask.java 66 int visited = 0; local
68 mListener.onImportProgress(visited, total, null);
72 visited++;
84 mListener.onImportProgress(visited, total, importedPath);
88 mListener.onImportFinish(objectsNotImported, visited);
  /art/runtime/gc/accounting/
space_bitmap.cc 175 static void WalkFieldsInOrder(SpaceBitmap* visited, SpaceBitmap::Callback* callback, mirror::Object* obj,
180 static void WalkInstanceFields(SpaceBitmap* visited, SpaceBitmap::Callback* callback, mirror::Object* obj,
186 WalkInstanceFields(visited, callback, obj, super, arg);
197 WalkFieldsInOrder(visited, callback, value, arg);
205 static void WalkFieldsInOrder(SpaceBitmap* visited, SpaceBitmap::Callback* callback, mirror::Object* obj,
208 if (visited->Test(obj)) {
213 visited->Set(obj);
216 WalkInstanceFields(visited, callback, obj, klass, arg);
227 WalkFieldsInOrder(visited, callback, value, arg);
239 WalkFieldsInOrder(visited, callback, value, arg)
    [all...]
  /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 218 bool SelectionDAG::setSubgraphColorHelper(SDNode *N, const char *Color, DenseSet<SDNode *> &visited,
231 unsigned oldSize = visited.size();
232 visited.insert(N);
233 if (visited.size() != oldSize) {
238 hit_limit = setSubgraphColorHelper(*i, Color, visited, level+1, printed) || hit_limit;
252 DenseSet<SDNode *> visited; local
254 if (setSubgraphColorHelper(N, Color, visited, 0, printed)) {
257 setSubgraphColorHelper(N, "blue", visited, 0, printed);
259 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
108 if (!visited.count(CB->getBlockID()))
109 FindUnreachableEntryPoints(CB, reachable, visited);
173 CFGBlocksSet &visited) {
174 visited.insert(CB->getBlockID());
182 if (!visited.count((*I)->getBlockID()))
183 // 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 {
  /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);
  /frameworks/base/sax/java/android/sax/
Element.java 42 boolean visited; field in class:Element
182 requiredChildren.get(i).visited = false;
195 if (!child.visited) {
  /external/chromium_org/chrome/browser/resources/history/
other_devices.css 61 .device-tab-entry:visited,
68 .device-show-more-tabs:visited,
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/
nv50_ir_graph.h 138 int visited; member in class:nv50_ir::Graph::Node
196 if (visited == v)
198 visited = v;
204 return visited;
  /external/llvm/lib/Analysis/
DominanceFrontier.cpp 47 SmallPtrSet<BasicBlock *, 32> visited; local
63 if (visited.count(currentBB) == 0) {
64 visited.insert(currentBB);
83 if (visited.count(childBB) == 0) {
90 // If all children are visited or there is any child then pop this block

Completed in 1047 milliseconds

1 2 3 4 5 6 7 8 910