List<Object> values = new ArrayList<>(map.values());
    assertThat(alternatingKeysAndValues).hasLength(2 * entries.size());
    assertThat(alternatingKeysAndValues).hasLength(2 * keys.size());
    assertThat(alternatingKeysAndValues).hasLength(2 * values.size());
    for (int i = 0; i < map.size(); i++) {
      Object expectedKey = alternatingKeysAndValues[2 * i];
      Object expectedValue = alternatingKeysAndValues[2 * i + 1];

      return cellIterator();
    }

    @Override
    public Spliterator<Cell<R, C, V>> spliterator() {
      return cellSpliterator();
    }

    @Override
    public int size() {
      return AbstractTable.this.size();
    }
  }

  @LazyInit private transient @Nullable Collection<V> values;

  @Override
  public Collection<V> values() {
    Collection<V> result = values;

  // Represents how tightly we can pack things, as a maximum.
  private static final double DESIRED_LOAD_FACTOR = 0.5;

  /**
   * Returns an array size suitable for the backing array of a hash table that uses open addressing
   * with linear probing in its implementation. The returned size is the smallest power of two that
   * can hold setSize elements with the desired load factor.
   */
  @VisibleForTesting

        .testEquals();
  }

  /** Returns a {@link Set} with a {@link Set#size()} of {@code size}. */
  private static ContiguousSet<Integer> setSize(int size) {
    checkArgument(size >= 0);
    ContiguousSet<Integer> set = ContiguousSet.closedOpen(0, size);
    checkState(set.size() == size);
    return set;
  }

  /**

    @ValidateTypeFailure
    public Integer crudMode;

    /** The input word that should be stemmed differently */
    @Required
    @Size(max = 1000)
    public String input;

    /** The desired stem output for the input word */
    @Required
    @Size(max = 1000)
    public String output;

    /**
     * Initializes the form with default values for creating a new stemmer override entry.
     */

    boolean removal = (maximumSize == LocalCache.UNSET_INT) ? false : (size() > maximumSize);
    if ((removalListener != null) && removal) {
      removalListener.onRemoval(
          RemovalNotification.create(
              ignored.getKey(), ignored.getValue().getValue(), RemovalCause.SIZE));
    }
    statsCounter.recordEviction();
    return removal;
  }

  int charSplitter(int reps) {
    int total = 0;

    for (int i = 0; i < reps; i++) {
      total += Iterables.size(CHAR_SPLITTER.split(input));
    }

    return total;
  }

  @Benchmark
  int stringSplitter(int reps) {
    int total = 0;

    for (int i = 0; i < reps; i++) {
      total += Iterables.size(STRING_SPLITTER.split(input));
    }

    return total;
  }

	s := syscall.Statfs_t{}
	err = syscall.Statfs(path, &s)
	if err != nil {
		return Info{}, err
	}
	reservedBlocks := s.Bfree - uint64(s.Bavail)
	info = Info{
		Total:  uint64(s.Bsize) * (s.Blocks - reservedBlocks),
		Free:   uint64(s.Bsize) * uint64(s.Bavail),
		Files:  s.Files,
		Ffree:  uint64(s.Ffree),
		FSType: getFSType(s.Fstypename[:]),
	}
	if info.Free > info.Total {

    @ValidateTypeFailure
    public Integer crudMode;

    /** Input terms (comma-separated) that will be mapped to the output term */
    @Required
    @Size(max = 1000)
    public String inputs;

    /** Output term that input terms will be mapped to */
    @Size(min = 1, max = 1000)
    public String output;

    /**
     * Initializes the form with default values for creating a new mapping dictionary entry.
     */

    @ValidateTypeFailure
    public Integer crudMode;

    /** The input terms that should be considered synonymous */
    @Required
    @Size(max = 1000)
    public String inputs;

    /** The output synonyms that should be matched for the input terms */
    @Required
    @Size(max = 1000)
    public String outputs;

    /**
     * Initializes the form with default values for creating a new synonym entry.
     */