}

    /**
     * Executes the HTTP client request.
     *
     * @param httpRequest The HTTP request to execute
     * @return The HTTP response
     * @throws IOException If an I/O error occurs
     */
    protected ClassicHttpResponse executeHttpClient(final ClassicHttpRequest httpRequest) throws IOException {
        return httpClient.executeOpen(null, httpRequest, httpClientContext);
    }

- When the `RetryGenerateName` feature gate is enabled on the kube-apiserver,...

common:dbg -c dbg
# Only include debug info for files under tensorflow/, excluding kernels, to
# reduce the size of the debug info in the binary. This is because if the debug
# sections in the ELF binary are too large, errors can occur. See
# https://github.com/tensorflow/tensorflow/issues/48919.
# Users can still include debug info for a specific kernel, e.g. with:
#     --config=dbg --per_file_copt=+tensorflow/core/kernels/identity_op.*@-g

		obscured bool      // Obscured with obscuretestdata package
		headers  []*Header // Expected output headers
		chksums  []string  // CRC32 checksum of files, leave as nil if not checked
		err      error     // Expected error to occur
	}{{
		file: "testdata/gnu.tar",
		headers: []*Header{{
			Name:     "small.txt",
			Mode:     0640,
			Uid:      73025,
			Gid:      5000,
			Size:     5,
			ModTime:  time.Unix(1244428340, 0),

       * up to give roundArbitrarily equal to 2^63, so the conversion back to long overflows and
       * roundArbitrarilyAsLong is Long.MAX_VALUE. (This is the only way this condition can occur as
       * otherwise the conversion back to long pads with zero bits.) In this case we know that
       * roundArbitrarily > x. (This is important when x == Long.MAX_VALUE ==
       * roundArbitrarilyAsLong.)
       */

<a href="https://9p.io/sys/doc/compiler.html">this description</a>)
needs no assembler pass in the usual pipeline.
Instead, the compiler operates on a kind of semi-abstract instruction set,
and instruction selection occurs partly after code generation.
The assembler works on the semi-abstract form, so
when you see an instruction like <code>MOV</code>
what the toolchain actually generates for that operation might

   * PeekingIterator#remove()}.
   *
   * <p>Note: If the given iterator is already a {@code PeekingIterator}, it <i>might</i> be
   * returned to the caller, although this is neither guaranteed to occur nor required to be
   * consistent. For example, this method <i>might</i> choose to pass through recognized
   * implementations of {@code PeekingIterator} when the behavior of the implementation is known to

   * PeekingIterator#remove()}.
   *
   * <p>Note: If the given iterator is already a {@code PeekingIterator}, it <i>might</i> be
   * returned to the caller, although this is neither guaranteed to occur nor required to be
   * consistent. For example, this method <i>might</i> choose to pass through recognized
   * implementations of {@code PeekingIterator} when the behavior of the implementation is known to

    ImmutableMap<Object, Object> originalMap = ImmutableMap.copyOf(map);
    assertThat(originalMap).hasSize(liveCount);
    // can't compare map contents until cleanup occurs

    for (int i = 1; i <= originalCount * 2; i *= 2) {
      if (i > 1) {
        segment.expand();
      }
      assertThat(segment.table.length()).isEqualTo(i);

    ImmutableMap<Object, Object> originalMap = ImmutableMap.copyOf(map);
    assertThat(originalMap).hasSize(liveCount);
    // can't compare map contents until cleanup occurs

    for (int i = 1; i <= originalCount * 2; i *= 2) {
      if (i > 1) {
        segment.expand();
      }
      assertThat(segment.table.length()).isEqualTo(i);