map.put(keyOne, valueOne);
        assertTrue(segment.recencyQueue.isEmpty());

        for (int i = 0; i < DRAIN_THRESHOLD / 2; i++) {
          map.get(keyOne);
        }
        assertFalse(segment.recencyQueue.isEmpty());

        map.put(keyTwo, valueTwo);
        assertTrue(segment.recencyQueue.isEmpty());
      }
    }
  }

  public void testDrainRecencyQueueOnRead() {

                    if (arList.isEmpty()) {
                        emptyListCount++;
                    } else {
                        emptyListCount = 0; // reset
                    }
                    long hitCount = ((OpenSearchResultList<OpenSearchAccessResult>) arList).getTotalHits();
                    while (hitCount > 0) {
                        if (arList.isEmpty()) {

	S3 S3Location `xml:"S3,omitempty"`
}

// IsEmpty returns true if output location not specified.
func (o *OutputLocation) IsEmpty() bool {
	return o.S3.BucketName == ""
}

// SelectParameters specifies sql select parameters
type SelectParameters struct {
	s3select.S3Select
}

// IsEmpty returns true if no select parameters set
func (sp *SelectParameters) IsEmpty() bool {
	return sp == nil
}

    @Override
    protected SortedSet<Integer> create(Integer[] elements) {
      SortedSet<Integer> set = nullCheckedTreeSet(elements);
      int tooHigh = set.isEmpty() ? 0 : set.last() + 1;
      set.add(tooHigh);
      return checkedCreate(set).headSet(tooHigh);
    }
  }

  public static class ContiguousSetTailsetGenerator extends AbstractContiguousSetGenerator {

        }
        if (!dr.getPath().isEmpty()) {
            dunc = "\\" + dr.getPath() + dunc;
        }

        if (dunc.charAt(0) != '\\') {
            log.warn("No slash at start of remaining DFS path " + dunc);
        }

        this.unc = dunc;
        if (dr.getShare() != null && !dr.getShare().isEmpty()) {
            this.share = dr.getShare();
        }

      Entry<K, Collection<V>> entry = entryIterator.next();
      K key = entry.getKey();
      Collection<V> collection = filterCollection(entry.getValue(), new ValuePredicate(key));
      if (!collection.isEmpty()
          && predicate.apply(Maps.<K, Collection<V>>immutableEntry(key, collection))) {
        if (collection.size() == entry.getValue().size()) {
          entryIterator.remove();
        } else {

  }

  /**
   * Returns an immutable range set containing the specified single range. If {@link Range#isEmpty()
   * range.isEmpty()}, this is equivalent to {@link ImmutableRangeSet#of()}.
   */
  public static <C extends Comparable> ImmutableRangeSet<C> of(Range<C> range) {
    checkNotNull(range);
    if (range.isEmpty()) {
      return of();
    } else if (range.equals(Range.all())) {
      return all();
    } else {

            if (path != null && !path.isEmpty()) {
                validatePath(path);
            }

            // Reconstruct normalized URL
            StringBuilder normalized = new StringBuilder("smb://");

            // Add credentials if present
            String userInfo = url.getUserInfo();
            if (userInfo != null && !userInfo.isEmpty()) {
                // Don't log credentials

        Set<ConstraintViolation<TestBean>> violations = validator.validate(bean);
        assertTrue(violations.isEmpty());

        // Test empty string (should be valid)
        bean.setCronExpression("");
        violations = validator.validate(bean);
        assertTrue(violations.isEmpty());

        // Test blank string (should be valid)
        bean.setCronExpression("   ");

        }

        @Override
        public Tuple3<String, String, String> createTask(String path, Map<String, Object> docMap) {
            // Validate inputs
            if (path == null || path.isEmpty() || docMap == null || docMap.isEmpty()) {
                return null;
            }

            Object mimeType = docMap.get("mimetype");
            if (mimeType == null) {
                return null;
            }