filled := 0
						missing := 0
						for i, v := range combineFilled {
							if v == 1 {
								m.filled[i] = 1
								m.mapped[i] = combineShared[i]
								filled++
							} else {
								missing++
							}
						}
						fmt.Println("Missing", missing, "bytes. Filled", filled, "bytes.")
						break
					}
					if key == otherKey {
						continue
					}

    @Nullable ImmutableMapEntry<K, V>[] keyTable = createEntryArray(tableSize);
    @Nullable ImmutableMapEntry<K, V>[] valueTable = createEntryArray(tableSize);
    /*
     * The cast is safe: n==entryArray.length means that we have filled the whole array with Entry
     * instances, in which case it is safe to cast it from an array of nullable entries to an array
     * of non-null entries.
     */
    @SuppressWarnings("nullness")
    Entry<K, V>[] entries =

        StackTraceElement[] originalStackTrace = exception.getStackTrace();
        assertNotNull(originalStackTrace);
        assertTrue(originalStackTrace.length > 0);

        // Fill in stack trace again
        Throwable filled = exception.fillInStackTrace();
        assertSame(exception, filled);

	ResumeItemsSkipped uint64 `json:"-"`
	ResumeBytesDone    uint64 `json:"-"`
	ResumeBytesFailed  uint64 `json:"-"`
	ResumeBytesSkipped uint64 `json:"-"`

	// Filled on startup/restarts.
	QueuedBuckets []string

	// Filled during heal.
	HealedBuckets []string

	// ID of the current healing operation
	HealID string

	ItemsSkipped uint64
	BytesSkipped uint64

	RetryAttempts uint64

  static PairedStats createPairedStatsOf(List<Double> xValues, List<Double> yValues) {
    return createFilledPairedStatsAccumulator(xValues, yValues).snapshot();
  }

  /**
   * Creates a {@link PairedStatsAccumulator} filled with the given lists of {@code x} and {@code y}
   * values, which must be of the same size.
   */
  static PairedStatsAccumulator createFilledPairedStatsAccumulator(
      List<Double> xValues, List<Double> yValues) {

        info.setCapability(capability);

        return info;
    }

    private void encodeSockaddr(byte[] buffer, int offset) {
        // MS-SMB2: SockAddr_Storage field is 128 bytes
        // Clear the entire field first
        for (int i = 0; i < 128; i++) {
            buffer[offset + i] = 0;
        }

        if (ipv6) {
            // IPv6 sockaddr_in6 structure (Windows AF_INET6 = 23)

            assertEquals(CLOCK_SEQ_LOW, uuid.clock_seq_low, "clock_seq_low should be parsed correctly");
            // Node array will be partially filled
            assertEquals((byte) 0xAA, uuid.node[0]);
            assertEquals((byte) 0xBB, uuid.node[1]);
            assertEquals((byte) 0xCC, uuid.node[2]);
            assertEquals((byte) 0xDD, uuid.node[3]);

	maxBucketSSEConfigSize = 1 * humanize.MiByte

	// diskFillFraction is the fraction of a disk we allow to be filled.
	diskFillFraction = 0.99

	// diskReserveFraction is the fraction of a disk where we will fill other server pools first.
	// If all pools reach this, we will use all pools with regular placement.
	diskReserveFraction = 0.15

            .and(Equivalence.equals());
    ImmutableListMultimap<Character, Character> empty = ImmutableListMultimap.of();
    ImmutableListMultimap<Character, Character> filled =
        ImmutableListMultimap.<Character, Character>builder()
            .putAll('b', Arrays.asList('a', 'n', 'a', 'n', 'a'))
            .putAll('a', Arrays.asList('p', 'p', 'l', 'e'))

      @Override
      public int read(char[] cbuf, int off, int len) throws IOException {
        // if a buffer isn't being cleared correctly, this method will eventually start being called
        // with a len of 0 forever
        if (len <= 0) {
          fail("read called with a len of " + len);
        }
        // read fewer than the max number of chars to read
        // shouldn't be a problem unless the buffer is shrinking each call