Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 3 of 3 for encloseAll (0.04 sec)

  1. android/guava/src/com/google/common/collect/AbstractRangeSet.java

      }
    
      @Override
      public void clear() {
        remove(Range.<C>all());
      }
    
      @Override
      public boolean enclosesAll(RangeSet<C> other) {
        return enclosesAll(other.asRanges());
      }
    
      @Override
      public boolean enclosesAll(Iterable<Range<C>> ranges) {
        for (Range<C> range : ranges) {
          if (!encloses(range)) {
            return false;
          }
        }
        return true;
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 2.8K bytes
    - Viewed (0)
  2. guava/src/com/google/common/collect/AbstractRangeSet.java

        throw new UnsupportedOperationException();
      }
    
      @Override
      public void clear() {
        remove(Range.<C>all());
      }
    
      @Override
      public boolean enclosesAll(RangeSet<C> other) {
        return enclosesAll(other.asRanges());
      }
    
      @Override
      public void addAll(RangeSet<C> other) {
        addAll(other.asRanges());
      }
    
      @Override
      public void removeAll(RangeSet<C> other) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 2.4K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/collect/RangeSet.java

       * other} is empty.
       *
       * <p>This is equivalent to checking if this range set {@link #encloses} each of the ranges in
       * {@code other}.
       */
      boolean enclosesAll(RangeSet<C> other);
    
      /**
       * Returns {@code true} if for each range in {@code other} there exists a member range in this
       * range set which {@linkplain Range#encloses encloses} it. Returns {@code true} if {@code other}
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 9.8K bytes
    - Viewed (0)
Back to top