congrats Icon
New! Announcing Tabnine Chat Beta
Learn More
Tabnine Logo
EmptyContiguousSet
Code IndexAdd Tabnine to your IDE (free)

How to use
EmptyContiguousSet
in
com.google.common.collect

Best Java code snippets using com.google.common.collect.EmptyContiguousSet (Showing top 20 results out of 315)

origin: google/guava

private Object readResolve() {
 return new EmptyContiguousSet<C>(domain);
}
origin: google/j2objc

private Object readResolve() {
 return new EmptyContiguousSet<C>(domain);
}
origin: wildfly/wildfly

private Object readResolve() {
 return new EmptyContiguousSet<C>(domain);
}
origin: google/guava

@Override
public ContiguousSet<C> intersection(ContiguousSet<C> other) {
 checkNotNull(other);
 checkArgument(this.domain.equals(other.domain));
 if (other.isEmpty()) {
  return other;
 } else {
  C lowerEndpoint = Ordering.natural().max(this.first(), other.first());
  C upperEndpoint = Ordering.natural().min(this.last(), other.last());
  return (lowerEndpoint.compareTo(upperEndpoint) <= 0)
    ? ContiguousSet.create(Range.closed(lowerEndpoint, upperEndpoint), domain)
    : new EmptyContiguousSet<C>(domain);
 }
}
origin: google/guava

private ContiguousSet<C> intersectionInCurrentDomain(Range<C> other) {
 return range.isConnected(other)
   ? ContiguousSet.create(range.intersection(other), domain)
   : new EmptyContiguousSet<C>(domain);
}
origin: google/guava

@Override
ContiguousSet<C> subSetImpl(
  C fromElement, boolean fromInclusive, C toElement, boolean toInclusive) {
 if (fromElement.compareTo(toElement) == 0 && !fromInclusive && !toInclusive) {
  // Range would reject our attempt to create (x, x).
  return new EmptyContiguousSet<C>(domain);
 }
 return intersectionInCurrentDomain(
   Range.range(
     fromElement, BoundType.forBoolean(fromInclusive),
     toElement, BoundType.forBoolean(toInclusive)));
}
origin: google/j2objc

@Override
public ContiguousSet<C> intersection(ContiguousSet<C> other) {
 checkNotNull(other);
 checkArgument(this.domain.equals(other.domain));
 if (other.isEmpty()) {
  return other;
 } else {
  C lowerEndpoint = Ordering.natural().max(this.first(), other.first());
  C upperEndpoint = Ordering.natural().min(this.last(), other.last());
  return (lowerEndpoint.compareTo(upperEndpoint) <= 0)
    ? ContiguousSet.create(Range.closed(lowerEndpoint, upperEndpoint), domain)
    : new EmptyContiguousSet<C>(domain);
 }
}
origin: google/j2objc

private ContiguousSet<C> intersectionInCurrentDomain(Range<C> other) {
 return (range.isConnected(other))
   ? ContiguousSet.create(range.intersection(other), domain)
   : new EmptyContiguousSet<C>(domain);
}
origin: google/j2objc

@Override
ContiguousSet<C> subSetImpl(
  C fromElement, boolean fromInclusive, C toElement, boolean toInclusive) {
 if (fromElement.compareTo(toElement) == 0 && !fromInclusive && !toInclusive) {
  // Range would reject our attempt to create (x, x).
  return new EmptyContiguousSet<C>(domain);
 }
 return intersectionInCurrentDomain(
   Range.range(
     fromElement, BoundType.forBoolean(fromInclusive),
     toElement, BoundType.forBoolean(toInclusive)));
}
origin: wildfly/wildfly

@Override
public ContiguousSet<C> intersection(ContiguousSet<C> other) {
 checkNotNull(other);
 checkArgument(this.domain.equals(other.domain));
 if (other.isEmpty()) {
  return other;
 } else {
  C lowerEndpoint = Ordering.natural().max(this.first(), other.first());
  C upperEndpoint = Ordering.natural().min(this.last(), other.last());
  return (lowerEndpoint.compareTo(upperEndpoint) <= 0)
    ? ContiguousSet.create(Range.closed(lowerEndpoint, upperEndpoint), domain)
    : new EmptyContiguousSet<C>(domain);
 }
}
origin: wildfly/wildfly

@Override
ContiguousSet<C> subSetImpl(
  C fromElement, boolean fromInclusive, C toElement, boolean toInclusive) {
 if (fromElement.compareTo(toElement) == 0 && !fromInclusive && !toInclusive) {
  // Range would reject our attempt to create (x, x).
  return new EmptyContiguousSet<C>(domain);
 }
 return intersectionInCurrentDomain(
   Range.range(
     fromElement, BoundType.forBoolean(fromInclusive),
     toElement, BoundType.forBoolean(toInclusive)));
}
origin: wildfly/wildfly

private ContiguousSet<C> intersectionInCurrentDomain(Range<C> other) {
 return (range.isConnected(other))
   ? ContiguousSet.create(range.intersection(other), domain)
   : new EmptyContiguousSet<C>(domain);
}
origin: google/guava

? new EmptyContiguousSet<C>(domain)
: new RegularContiguousSet<C>(effectiveRange, domain);
origin: google/j2objc

? new EmptyContiguousSet<C>(domain)
: new RegularContiguousSet<C>(effectiveRange, domain);
origin: wildfly/wildfly

? new EmptyContiguousSet<C>(domain)
: new RegularContiguousSet<C>(effectiveRange, domain);
origin: com.google.guava/guava-jdk5

private Object readResolve() {
 return new EmptyContiguousSet<C>(domain);
}
origin: com.diffplug.guava/guava-collect

private Object readResolve() {
  return new EmptyContiguousSet<C>(domain);
}
origin: com.google.guava/guava-jdk5

@Override public ContiguousSet<C> intersection(ContiguousSet<C> other) {
 checkNotNull(other);
 checkArgument(this.domain.equals(other.domain));
 if (other.isEmpty()) {
  return other;
 } else {
  C lowerEndpoint = Ordering.natural().max(this.first(), other.first());
  C upperEndpoint = Ordering.natural().min(this.last(), other.last());
  return (lowerEndpoint.compareTo(upperEndpoint) < 0)
    ? ContiguousSet.create(Range.closed(lowerEndpoint, upperEndpoint), domain)
    : new EmptyContiguousSet<C>(domain);
 }
}
origin: at.bestsolution.efxclipse.eclipse/com.google.guava

@Override public ContiguousSet<C> intersection(ContiguousSet<C> other) {
 checkNotNull(other);
 checkArgument(this.domain.equals(other.domain));
 if (other.isEmpty()) {
  return other;
 } else {
  C lowerEndpoint = Ordering.natural().max(this.first(), other.first());
  C upperEndpoint = Ordering.natural().min(this.last(), other.last());
  return (lowerEndpoint.compareTo(upperEndpoint) < 0)
    ? ContiguousSet.create(Range.closed(lowerEndpoint, upperEndpoint), domain)
    : new EmptyContiguousSet<C>(domain);
 }
}
origin: org.hudsonci.lib.guava/guava

private ContiguousSet<C> intersectionInCurrentDomain(Range<C> other) {
 return (range.isConnected(other))
   ? ContiguousSet.create(range.intersection(other), domain)
   : new EmptyContiguousSet<C>(domain);
}
com.google.common.collectEmptyContiguousSet

Javadoc

An empty contiguous set.

Most used methods

  • <init>

Popular in Java

  • Making http post requests using okhttp
  • notifyDataSetChanged (ArrayAdapter)
  • setScale (BigDecimal)
  • setRequestProperty (URLConnection)
  • VirtualMachine (com.sun.tools.attach)
    A Java virtual machine. A VirtualMachine represents a Java virtual machine to which this Java vir
  • Component (java.awt)
    A component is an object having a graphical representation that can be displayed on the screen and t
  • Deque (java.util)
    A linear collection that supports element insertion and removal at both ends. The name deque is shor
  • NoSuchElementException (java.util)
    Thrown when trying to retrieve an element past the end of an Enumeration or Iterator.
  • ZipFile (java.util.zip)
    This class provides random read access to a zip file. You pay more to read the zip file's central di
  • Option (scala)
  • Github Copilot alternatives
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