assertThat(afterBurst).isAtLeast(1000);
    }
  }

  /**
   * This neat test shows that no matter what weights we use in our requests, if we push X amount of
   * permits in a cool state, where X = rate * timeToCoolDown, and we have specified a
   * timeToWarmUp() period, it will cost as the prescribed amount of time. E.g., calling
   * [acquire(5), acquire(1)] takes exactly the same time as [acquire(2), acquire(3), acquire(1)].

      assertThat(afterBurst).isAtLeast(1000);
    }
  }

  /**
   * This neat test shows that no matter what weights we use in our requests, if we push X amount of
   * permits in a cool state, where X = rate * timeToCoolDown, and we have specified a
   * timeToWarmUp() period, it will cost as the prescribed amount of time. E.g., calling
   * [acquire(5), acquire(1)] takes exactly the same time as [acquire(2), acquire(3), acquire(1)].

                if (!currentArg.isEmpty()) {
                    currentArg.setLength(currentArg.length() - 1);
                }

                cleaned.add(currentArg.toString());

                currentArg = null;
                continue;
            }

            // if we haven't added this arg to the buffer, and we ARE building an argument

     * <p>Find a Method using the methodKey provided.</p>
     * <p>Look in the methodMap for an entry. If found,
     * it'll either be a CACHE_MISS, in which case we
     * simply give up, or it'll be a Method, in which
     * case, we return it.</p>
     * <p>If nothing is found, then we must actually go
     * and introspect the method from the MethodMap.</p>
     * @param name Method name.
     * @param params Method parameters.

    latch.awaitSuccessfully(LONG_DELAY_MS);
    assertInterrupted();
  }

  public void testAwaitTimeoutMultiInterruptExpired() {
    /*
     * We don't "need" to schedule a countDown() call at all here, but by doing
     * so, we come the closest we can to testing that the wait time is
     * appropriately decreased on each progressive await() call.
     */

			return written, io.ErrShortWrite
		}

		if totalSize > 0 && written == totalSize {
			// we have written the entire stream, return right here.
			return written, nil
		}

		if eof {
			// We reached EOF prematurely but we did not write everything
			// that we promised that we would write.
			if totalSize > 0 && written != totalSize {
				return written, io.ErrUnexpectedEOF
			}

                        // The method should be idempotent, so we record all package-info.java files we ever allowed and allow them afterward.
                        return true;
                    }
                    String packageName = getPackageName(file);
                    // we pass through package-info.java files for packages we have not seen before, block the rest

      }
      updateLastKnownIndex();
      /*
       * If the entry has been removed from the map, we return null, even though that might not be a
       * valid value. That's the best we can do, short of holding a reference to the most recently
       * seen value. And while we *could* do that, we aren't required to: Map.Entry explicitly says

# For RBE, we explicitly set invalid paths to force the auto-configuration to fail.
TFCI_BAZEL_VC="C:/RBE_ISOLATED_INVALID_PATH"
TFCI_BAZEL_LLVM="C:/RBE_ISOLATED_INVALID_PATH"
TFCI_BAZEL_SH="C:/tools/msys64/usr/bin/bash.exe"
TFCI_USE_CLANG_CL=0

# Map TFCI_BAZEL_* to BAZEL_* so cc_configure can find them in the environment.
# We use the shell's default value substitution to ensure that if these are

    if (entry != null && entry.lockingSourceCount != 0) {
      return null // We can't write this file because a reader is still reading it.
    }

    if (mostRecentTrimFailed || mostRecentRebuildFailed) {
      // The OS has become our enemy! If the trim job failed, it means we are storing more data than
      // requested by the user. Do not allow edits so we do not go over that limit any further. If