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

1 2 3 4 5 6

  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/
DependencyGraph.java 165 Set<ViewData> visiting = new HashSet<ViewData>(); local
169 findBackwards(view, visiting, reachable, vertical, view);
183 Set<ViewData> visiting, List<ViewData> reachable,
185 visiting.add(view);
197 if (visiting.contains(from)) {
206 findBackwards(from, visiting, reachable, vertical, start);
210 visiting.remove(view);
216 Set<ViewData> visiting = new HashSet<ViewData>(); local
220 return findForwards(view, visiting, path, vertical, to);
226 private List<Constraint> findForwards(ViewData view, Set<ViewData> visiting,
    [all...]
  /prebuilts/tools/common/m2/repository/com/google/auto/auto-common/0.3/
auto-common-0.3.jar 
  /prebuilts/tools/common/m2/repository/com/google/auto/auto-common/0.6/
auto-common-0.6.jar 
  /prebuilts/tools/common/m2/repository/com/google/auto/auto-common/0.7/
auto-common-0.7.jar 
  /external/dagger2/lib/
auto-common-1.0-20151022.071545-39.jar 
  /prebuilts/tools/common/m2/repository/com/google/auto/auto-common/0.4/
auto-common-0.4.jar 
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/
IncludeFinder.java 753 Set<String> visiting = new HashSet<String>(mIncludes.size()); local
754 String chain = dfs(from, visiting);
767 private String dfs(String from, Set<String> visiting) {
768 visiting.add(from);
773 if (visiting.contains(include)) {
776 String chain = dfs(include, visiting);
783 visiting.remove(from);
    [all...]
  /external/antlr/antlr-3.4/runtime/ObjC/Framework/
ANTLRUnbufferedCommonTreeNodeStream.h 112 #pragma mark Node visiting
  /external/guice/core/test/com/google/inject/spi/
SpiBindingsTest.java 355 final AtomicBoolean visiting = new AtomicBoolean(false); local
366 if(visiting.get()) {
381 visiting.set(true);
  /prebuilts/tools/common/m2/repository/com/squareup/dagger/dagger/1.2.2/
dagger-1.2.2.jar 
  /build/blueprint/
context.go     [all...]
  /prebuilts/tools/common/m2/repository/com/google/dagger/dagger-compiler/2.0/
dagger-compiler-2.0.jar 
  /prebuilts/tools/common/m2/repository/org/apache/maven/shared/maven-dependency-tree/1.2/
maven-dependency-tree-1.2.jar 
  /external/v8/tools/
profile.js 697 * prior to visiting node's children.
699 * after visiting node's children.
  /art/compiler/optimizing/
nodes.cc 58 // Nodes that we're currently visiting, indexed by block id.
59 ArenaBitVector visiting(arena_, blocks_.size(), false, kArenaAllocGraphBuilder);
64 // Stack of nodes that we're currently visiting (same as marked in "visiting" above).
69 visiting.SetBit(entry_block_->GetBlockId());
76 visiting.ClearBit(current_id);
81 if (visiting.IsBitSet(successor_id)) {
86 visiting.SetBit(successor_id);
253 // dominator of the block. We can then start visiting its successors.
580 // We're visiting loops in post-order, so inner loops must have bee
    [all...]
  /prebuilts/go/darwin-x86/src/cmd/link/internal/ld/
lib.go 2125 visiting const
    [all...]
  /prebuilts/go/darwin-x86/src/image/jpeg/
scan.go 180 // For a baseline 32x16 pixel image, the Y blocks visiting order is:
  /prebuilts/go/linux-x86/src/cmd/link/internal/ld/
lib.go 2125 visiting const
    [all...]
  /prebuilts/go/linux-x86/src/image/jpeg/
scan.go 180 // For a baseline 32x16 pixel image, the Y blocks visiting order is:
  /prebuilts/go/darwin-x86/src/path/filepath/
path.go 388 // directory in the tree, including root. All errors that arise visiting files
  /prebuilts/go/linux-x86/src/path/filepath/
path.go 388 // directory in the tree, including root. All errors that arise visiting files
  /prebuilts/tools/common/m2/repository/com/google/auto/value/auto-value/1.3/
auto-value-1.3.jar 
  /prebuilts/tools/common/m2/repository/com/google/auto/value/auto-value/1.3-rc1/
auto-value-1.3-rc1.jar 
  /external/v8/
Android.v8.mk 271 src/heap/objects-visiting.cc \
  /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/
Antlr.Runtime.Tree.pas     [all...]

Completed in 675 milliseconds

1 2 3 4 5 6