rpc.UpdateMetacacheListing(ctx, *c)
				}
			}
		}()
		o.ID = ""
	}

	if contextCanceled(ctx) {
		return entries, ctx.Err()
	}
	// Do listing in-place.
	// Create output for our results.
	// Create filter for results.
	o.debugln("Raw List", o)
	filterCh := make(chan metaCacheEntry, o.Limit)
	listCtx, cancelList := context.WithCancel(ctx)
	filteredResults := o.gatherResults(listCtx, filterCh)

            // The close method calls super.close(), then handle.close(), then pipe.close()
            lenient().doNothing().when((DcerpcHandle) handle).close();

            // Setup close to call real method which will then call our mocked components
            doCallRealMethod().when(handle).close();

            handle.close();

            verify(mockSmbPipeHandleInternal).close();
            verify(mockSmbNamedPipe).close();
        }

    }
    assertCollectionSize(map.keySet(), size);
    assertCollectionSize(map.entrySet(), size);
    assertCollectionSize(map.values(), size);
  }

  @SuppressWarnings("IterablesSizeOfCollection") // we are testing our iterator implementation
  private void assertCollectionSize(Collection<?> collection, int size) {
    assertThat(collection.size()).isEqualTo(size);
    if (size > 0) {
      assertThat(collection.isEmpty()).isFalse();

            Parent parent = currentModel.getParent();

            // Check if this parent is in our local pomMap
            Path parentPath = findParentInPomMap(parent, pomMap);
            if (parentPath != null) {
                // Parent is local, so it becomes our new candidate
                lastLocalParent = parentPath;

                // Load the parent model to continue walking up

   * @param max the upper bound (inclusive) of the range to constrain {@code value} to
   * @throws IllegalArgumentException if {@code min > max}
   * @since 21.0
   */
  // A call to bare "min" or "max" would resolve to our varargs method, not to any static import.
  @SuppressWarnings("StaticImportPreferred")
  public static int constrainToRange(int value, int min, int max) {

        assertEquals((byte) 0xCC, buffer[5]);
        assertEquals((byte) 0xCC, buffer[6]);
        assertEquals((byte) 0xCC, buffer[7]);

        // FileId (16 bytes) - should match our test file ID
        byte[] wireFileId = new byte[16];
        System.arraycopy(buffer, 8, wireFileId, 0, 16);
        assertArrayEquals(testFileId, wireFileId);

        // Verify nothing was written beyond the structure

    ContainsBothWithMultisetFirst reMultisetFirst = reserialize(multisetFirst);
    assertThat(reMultisetFirst.a.isEmpty()).isFalse();
    // The following NPE is a side effect of our changes to avoid mutating `final` fields.
    assertThrows(NullPointerException.class, () -> reMultisetFirst.z.multiset.isEmpty());

    ContainsBothWithContainsMultisetFirst reContainsMultisetFirst =

    // Serial form:
    // 1 signed byte for the strategy
    // 1 unsigned byte for the number of hash functions
    // 1 big endian int, the number of longs in our bitset
    // N big endian longs of our bitset
    DataOutputStream dout = new DataOutputStream(out);
    dout.writeByte(SignedBytes.checkedCast(strategy.ordinal()));

      case 1:
        /*
         * requireNonNull is safe because the callers promise to put non-null objects in the first
         * `length` array elements.
         */
        @SuppressWarnings("unchecked") // our callers put only E instances into the array
        E onlyElement = (E) requireNonNull(elements[0]);
        return of(onlyElement);
      default:
        /*

  private static final byte[] ARRAY234 = {(byte) 2, (byte) 3, (byte) 4};

  private static final byte[] VALUES = {Byte.MIN_VALUE, -1, 0, 1, Byte.MAX_VALUE};

  // We need to test that our method behaves like the JDK method.
  @SuppressWarnings("InlineMeInliner")
  public void testHashCode() {
    for (byte value : VALUES) {
      assertThat(Bytes.hashCode(value)).isEqualTo(Byte.hashCode(value));
    }
  }