congrats Icon
New! Announcing our next generation AI code completions
Read here
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

  • Reading from database using SQL prepared statement
  • runOnUiThread (Activity)
  • requestLocationUpdates (LocationManager)
  • getResourceAsStream (ClassLoader)
  • Time (java.sql)
    Java representation of an SQL TIME value. Provides utilities to format and parse the time's represen
  • DecimalFormat (java.text)
    A concrete subclass of NumberFormat that formats decimal numbers. It has a variety of features desig
  • Set (java.util)
    A Set is a data structure which does not allow duplicate elements.
  • TimeZone (java.util)
    TimeZone represents a time zone offset, and also figures out daylight savings. Typically, you get a
  • ExecutorService (java.util.concurrent)
    An Executor that provides methods to manage termination and methods that can produce a Future for tr
  • Servlet (javax.servlet)
    Defines methods that all servlets must implement. A servlet is a small Java program that runs within
  • Top 17 Free Sublime Text Plugins
Tabnine Logo
  • Products

    Search for Java codeSearch for JavaScript code
  • IDE Plugins

    IntelliJ IDEAWebStormVisual StudioAndroid StudioEclipseVisual Studio CodePyCharmSublime TextPhpStormVimAtomGoLandRubyMineEmacsJupyter NotebookJupyter LabRiderDataGripAppCode
  • Company

    About UsContact UsCareers
  • Resources

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