congrats Icon
New! Announcing Tabnine Chat Beta
Learn More
Tabnine Logo
Traverser$TreeTraverser.checkThatNodeIsInTree
Code IndexAdd Tabnine to your IDE (free)

How to use
checkThatNodeIsInTree
method
in
com.google.common.graph.Traverser$TreeTraverser

Best Java code snippets using com.google.common.graph.Traverser$TreeTraverser.checkThatNodeIsInTree (Showing top 15 results out of 315)

origin: google/guava

@Override
public Iterable<N> breadthFirst(final Iterable<? extends N> startNodes) {
 checkNotNull(startNodes);
 if (Iterables.isEmpty(startNodes)) {
  return ImmutableSet.of();
 }
 for (N startNode : startNodes) {
  checkThatNodeIsInTree(startNode);
 }
 return new Iterable<N>() {
  @Override
  public Iterator<N> iterator() {
   return new BreadthFirstIterator(startNodes);
  }
 };
}
origin: google/guava

@Override
public Iterable<N> depthFirstPostOrder(final Iterable<? extends N> startNodes) {
 checkNotNull(startNodes);
 if (Iterables.isEmpty(startNodes)) {
  return ImmutableSet.of();
 }
 for (N startNode : startNodes) {
  checkThatNodeIsInTree(startNode);
 }
 return new Iterable<N>() {
  @Override
  public Iterator<N> iterator() {
   return new DepthFirstPostOrderIterator(startNodes);
  }
 };
}
origin: google/guava

@Override
public Iterable<N> depthFirstPreOrder(final Iterable<? extends N> startNodes) {
 checkNotNull(startNodes);
 if (Iterables.isEmpty(startNodes)) {
  return ImmutableSet.of();
 }
 for (N node : startNodes) {
  checkThatNodeIsInTree(node);
 }
 return new Iterable<N>() {
  @Override
  public Iterator<N> iterator() {
   return new DepthFirstPreOrderIterator(startNodes);
  }
 };
}
origin: org.kill-bill.billing/killbill-platform-osgi-bundles-logger

@Override
public Iterable<N> depthFirstPreOrder(final Iterable<? extends N> startNodes) {
 checkNotNull(startNodes);
 if (Iterables.isEmpty(startNodes)) {
  return ImmutableSet.of();
 }
 for (N node : startNodes) {
  checkThatNodeIsInTree(node);
 }
 return new Iterable<N>() {
  @Override
  public Iterator<N> iterator() {
   return new DepthFirstPreOrderIterator(startNodes);
  }
 };
}
origin: org.jboss.eap/wildfly-client-all

@Override
public Iterable<N> depthFirstPostOrder(final Iterable<? extends N> startNodes) {
 checkNotNull(startNodes);
 if (Iterables.isEmpty(startNodes)) {
  return ImmutableSet.of();
 }
 for (N startNode : startNodes) {
  checkThatNodeIsInTree(startNode);
 }
 return new Iterable<N>() {
  @Override
  public Iterator<N> iterator() {
   return new DepthFirstPostOrderIterator(startNodes);
  }
 };
}
origin: org.jboss.eap/wildfly-client-all

@Override
public Iterable<N> breadthFirst(final Iterable<? extends N> startNodes) {
 checkNotNull(startNodes);
 if (Iterables.isEmpty(startNodes)) {
  return ImmutableSet.of();
 }
 for (N startNode : startNodes) {
  checkThatNodeIsInTree(startNode);
 }
 return new Iterable<N>() {
  @Override
  public Iterator<N> iterator() {
   return new BreadthFirstIterator(startNodes);
  }
 };
}
origin: org.kill-bill.billing/killbill-platform-osgi-bundles-logger

@Override
public Iterable<N> depthFirstPostOrder(final Iterable<? extends N> startNodes) {
 checkNotNull(startNodes);
 if (Iterables.isEmpty(startNodes)) {
  return ImmutableSet.of();
 }
 for (N startNode : startNodes) {
  checkThatNodeIsInTree(startNode);
 }
 return new Iterable<N>() {
  @Override
  public Iterator<N> iterator() {
   return new DepthFirstPostOrderIterator(startNodes);
  }
 };
}
origin: org.jboss.eap/wildfly-client-all

@Override
public Iterable<N> depthFirstPreOrder(final Iterable<? extends N> startNodes) {
 checkNotNull(startNodes);
 if (Iterables.isEmpty(startNodes)) {
  return ImmutableSet.of();
 }
 for (N node : startNodes) {
  checkThatNodeIsInTree(node);
 }
 return new Iterable<N>() {
  @Override
  public Iterator<N> iterator() {
   return new DepthFirstPreOrderIterator(startNodes);
  }
 };
}
origin: org.kill-bill.billing/killbill-platform-osgi-bundles-logger

@Override
public Iterable<N> breadthFirst(final Iterable<? extends N> startNodes) {
 checkNotNull(startNodes);
 if (Iterables.isEmpty(startNodes)) {
  return ImmutableSet.of();
 }
 for (N startNode : startNodes) {
  checkThatNodeIsInTree(startNode);
 }
 return new Iterable<N>() {
  @Override
  public Iterator<N> iterator() {
   return new BreadthFirstIterator(startNodes);
  }
 };
}
origin: wildfly/wildfly

@Override
public Iterable<N> depthFirstPostOrder(final Iterable<? extends N> startNodes) {
 checkNotNull(startNodes);
 if (Iterables.isEmpty(startNodes)) {
  return ImmutableSet.of();
 }
 for (N startNode : startNodes) {
  checkThatNodeIsInTree(startNode);
 }
 return new Iterable<N>() {
  @Override
  public Iterator<N> iterator() {
   return new DepthFirstPostOrderIterator(startNodes);
  }
 };
}
origin: wildfly/wildfly

@Override
public Iterable<N> depthFirstPreOrder(final Iterable<? extends N> startNodes) {
 checkNotNull(startNodes);
 if (Iterables.isEmpty(startNodes)) {
  return ImmutableSet.of();
 }
 for (N node : startNodes) {
  checkThatNodeIsInTree(node);
 }
 return new Iterable<N>() {
  @Override
  public Iterator<N> iterator() {
   return new DepthFirstPreOrderIterator(startNodes);
  }
 };
}
origin: wildfly/wildfly

@Override
public Iterable<N> breadthFirst(final Iterable<? extends N> startNodes) {
 checkNotNull(startNodes);
 if (Iterables.isEmpty(startNodes)) {
  return ImmutableSet.of();
 }
 for (N startNode : startNodes) {
  checkThatNodeIsInTree(startNode);
 }
 return new Iterable<N>() {
  @Override
  public Iterator<N> iterator() {
   return new BreadthFirstIterator(startNodes);
  }
 };
}
origin: google/j2objc

@Override
public Iterable<N> breadthFirst(final Iterable<? extends N> startNodes) {
 checkNotNull(startNodes);
 if (Iterables.isEmpty(startNodes)) {
  return ImmutableSet.of();
 }
 for (N startNode : startNodes) {
  checkThatNodeIsInTree(startNode);
 }
 return new Iterable<N>() {
  @Override
  public Iterator<N> iterator() {
   return new BreadthFirstIterator(startNodes);
  }
 };
}
origin: google/j2objc

@Override
public Iterable<N> depthFirstPostOrder(final Iterable<? extends N> startNodes) {
 checkNotNull(startNodes);
 if (Iterables.isEmpty(startNodes)) {
  return ImmutableSet.of();
 }
 for (N startNode : startNodes) {
  checkThatNodeIsInTree(startNode);
 }
 return new Iterable<N>() {
  @Override
  public Iterator<N> iterator() {
   return new DepthFirstPostOrderIterator(startNodes);
  }
 };
}
origin: google/j2objc

@Override
public Iterable<N> depthFirstPreOrder(final Iterable<? extends N> startNodes) {
 checkNotNull(startNodes);
 if (Iterables.isEmpty(startNodes)) {
  return ImmutableSet.of();
 }
 for (N node : startNodes) {
  checkThatNodeIsInTree(node);
 }
 return new Iterable<N>() {
  @Override
  public Iterator<N> iterator() {
   return new DepthFirstPreOrderIterator(startNodes);
  }
 };
}
com.google.common.graphTraverser$TreeTraversercheckThatNodeIsInTree

Popular methods of Traverser$TreeTraverser

  • <init>
  • breadthFirst
  • depthFirstPostOrder
  • depthFirstPreOrder

Popular in Java

  • Finding current android device location
  • getSupportFragmentManager (FragmentActivity)
  • onRequestPermissionsResult (Fragment)
  • startActivity (Activity)
  • SQLException (java.sql)
    An exception that indicates a failed JDBC operation. It provides the following information about pro
  • SortedSet (java.util)
    SortedSet is a Set which iterates over its elements in a sorted order. The order is determined eithe
  • Stack (java.util)
    Stack is a Last-In/First-Out(LIFO) data structure which represents a stack of objects. It enables u
  • JFrame (javax.swing)
  • XPath (javax.xml.xpath)
    XPath provides access to the XPath evaluation environment and expressions. Evaluation of XPath Expr
  • LoggerFactory (org.slf4j)
    The LoggerFactory is a utility class producing Loggers for various logging APIs, most notably for lo
  • Top plugins for Android Studio
Tabnine Logo
  • Products

    Search for Java codeSearch for JavaScript code
  • IDE Plugins

    IntelliJ IDEAWebStormVisual StudioAndroid StudioEclipseVisual Studio CodePyCharmSublime TextPhpStormVimGoLandRubyMineEmacsJupyter NotebookJupyter LabRiderDataGripAppCode
  • Company

    About UsContact UsCareers
  • Resources

    FAQBlogTabnine AcademyTerms of usePrivacy policyJava Code IndexJavascript Code Index
Get Tabnine for your IDE now