if (existing != null) return existing

    if (computed == null) {
      computed = compute()
    }

    // If we successfully add the computed element, we're done.
    val newTags = tags.plus(type, computed)
    if (compareAndSet(tags, newTags)) return computed

    // We lost the race. Possibly to other code that was putting a *different* key. Try again!
  }

      for (int i = off; i < off + len; i++) {
        out.write(b[i]);
      }
    } else {
      out.write(b, off, len);
    }
    out.flush(); // for coverage
  }

  // TODO(chrisn): only works if we ensure we have crossed file threshold

  public void testWriteErrorAfterClose() throws Exception {
    byte[] data = newPreFilledByteArray(100);
    FileBackedOutputStream out = new FileBackedOutputStream(50);

   * 4. Tests of illegal usages of the API.
   */

  /*
   * Covering every combination would lead to an explosion in the number of tests. So we cover only:
   * - median with compute taking a double-collection and with computeInPlace;
   * - quartiles with index and with indexes taking int-varargs, and with compute taking a
   *   double-collection and with computeInPlace;

   * 4. Tests of illegal usages of the API.
   */

  /*
   * Covering every combination would lead to an explosion in the number of tests. So we cover only:
   * - median with compute taking a double-collection and with computeInPlace;
   * - quartiles with index and with indexes taking int-varargs, and with compute taking a
   *   double-collection and with computeInPlace;

   * process in any way, for example being sent over RPC, or saved to disk. For a general-purpose,
   * non-cryptographic hash function that will never change behavior, we suggest {@link
   * #murmur3_128}.
   *
   * <p>Repeated calls to this method on the same loaded {@code Hashing} class, using the same value

            // split packages across the dependencies, which is "ok", in that we don't care
            // about it for the purpose of this project, that split will be detected in
            // the other project
            Map<String, List<File>> dependencyPackages = getDependencyPackages();

            // Next read each of the source directories and find if we define any package directories
            // that match those in our dependencies.

        this.squashedPrefix = squashedPrefix;
    }

    @Override
    public String apply(String line) {
        if (line.startsWith("\r\u001b")) {
            /* We don't want to try to be a full terminal emulator but we want to
              keep the escape sequences from leaking and catch _some_ of the
              meaning. */
            line = line.substring(2);
            if ("[K".equals(line)) {

      // buffer is full; not enough room for a primitive. We have at least one full chunk.
      munch();
    }
  }

  private void munch() {
    Java8Compatibility.flip(buffer);
    while (buffer.remaining() >= chunkSize) {
      // we could limit the buffer to ensure process() does not read more than
      // chunkSize number of bytes, but we trust the implementations
      process(buffer);
    }

     * on most other types: In cases in which we "should" receive both an interrupt and a
     * notification nearly simultaneously, we sometimes receive only an interrupt. Thus, when we're
     * interrupted, we can't just poll whether it's time to end the wait because our "end the wait"
     * notification has been lost. (This is in contrast to how we can poll with, say, a

    Runnable task =
        () -> {
          do {
            // We can't have a GOLDEN_NOT_PRESENT_KEY because false positives are
            // possible! It's false negatives that can't happen.
            assertThat(bloomFilter.mightContain(GOLDEN_PRESENT_KEY)).isTrue();

            int key = getNonGoldenRandomKey();
            // We can't check that the key is mightContain() == false before the