```{ .dockerfile .annotate }
# (1)
FROM python:3.9 as requirements-stage

# (2)
WORKDIR /tmp

# (3)
RUN pip install poetry

# (4)
COPY ./pyproject.toml ./poetry.lock* /tmp/

# (5)
RUN poetry export -f requirements.txt --output requirements.txt --without-hashes

# (6)
FROM python:3.9

# (7)
WORKDIR /code

# (8)

   *
   * @param arrays zero or more {@code int} arrays
   * @return a single array containing all the values from the source arrays, in order
   * @throws IllegalArgumentException if the total number of elements in {@code arrays} does not fit
   *     in an {@code int}
   */
  public static int[] concat(int[]... arrays) {
    long length = 0;
    for (int[] array : arrays) {
      length += array.length;

        @Test
        @DisplayName("Should decode with actual free units skipped")
        void testDecodeSkipsActualFreeUnits() throws SMBProtocolDecodingException {
            byte[] buffer = new byte[32];
            // total allocation units (8 bytes)
            buffer[4] = 0x01;
            // caller available allocation units (8 bytes)
            buffer[12] = 0x01;
            // actual free units (8 bytes) - should be skipped

 * elements. A multiset is also sometimes called a <i>bag</i>.
 *
 * <p>Elements of a multiset that are equal to one another are referred to as <i>occurrences</i> of
 * the same single element. The total number of occurrences of an element in a multiset is called
 * the <i>count</i> of that element (the terms "frequency" and "multiplicity" are equivalent, but

            assertTrue(successCount.get() > 0, "Some requests should succeed");
            assertEquals(5, rejectedCount.get() + successCount.get(), "Total should be 5");

        } finally {
            backpressureCircuitBreaker.close();
        }
    }

    @Test
    public void testResponseTimeTracking() throws Exception {

			return nil
		}

		disks = disks[:len(disks)-healing] // healing drives are always at the end of the list

		if len(disks) < er.setDriveCount/2 {
			return fmt.Errorf("not enough drives (found=%d, healing=%d, total=%d) are available to heal `%s`", len(disks), healing, er.setDriveCount, tracker.disk.String())
		}

		rand.Shuffle(len(disks), func(i, j int) {
			disks[i], disks[j] = disks[j], disks[i]
		})

      List<Constructor<X>> constructors) {
    return WITH_STRING_PARAM_THEN_WITH_THROWABLE_PARAM.sortedCopy(constructors);
  }

  // TODO: b/296487962 - Consider defining a total order over constructors.
  private static final Ordering<List<Class<?>>> ORDERING_BY_CONSTRUCTOR_PARAMETER_LIST =
      Ordering.natural()
          .onResultOf((List<Class<?>> params) -> params.contains(String.class))

 * class to read a response that is larger than the entire memory allocated to the current process.
 * It can even stream a response larger than the total storage on the current device, which is a
 * common requirement for video streaming applications.
 *
 * Because this class does not buffer the full response in memory, the application may not

     */
    public PathValidator() {
        this(260, 255, true, false);
    }

    /**
     * Create path validator with custom settings
     *
     * @param maxPathLength maximum total path length
     * @param maxComponentLength maximum length for path components
     * @param allowUncPaths whether to allow UNC paths
     * @param strictMode strict validation mode
     */

        int result = nameQueryResponse.readBodyWireFormat(src, srcIndex);
        assertEquals(12 + 6, result, "readBodyWireFormat should return the total bytes read");
    }

    @Test
    void writeRDataWireFormat_shouldReturnZero() {
        // This method is implemented to always return 0
        byte[] dst = new byte[10];
        int dstIndex = 0;