}
        }

        return di - start;
    }

    /**
     * Decodes a UTF-8 encoded string from a byte array.
     *
     * @param src the source byte array
     * @param si the starting index in the source array
     * @param slim the limit index in the source array
     * @return the decoded String
     * @throws IOException if a decoding error occurs
     */

        }

        /**
         * The number of shares in the array.
         */
        /**
         * The number of shares in the array.
         */
        public int count;
        /**
         * Array of ShareInfo0 structures containing share information.
         */
        public ShareInfo0[] array;

        @Override
        public void encode(NdrBuffer _dst) throws NdrException {

      // Shift value left while iterating logically through the array.
      result |= (input[offset + i] & 0xFFL) << (i * 8);
    }
    return result;
  }

  /**
   * Store 8 bytes into the provided array at the indicated offset, using the value provided.
   *
   * @param sink the output byte array
   * @param offset the offset into the array at which to start writing
   * @param value the value to write
   */

            samr.SamrSamArray array = new samr.SamrSamArray();
            array.count = 0;
            array.entries = null;

            // When: Encoding array
            array.encode(mockNdrBuffer);

            // Then: Should encode null referent
            verify(mockNdrBuffer).align(4);
            verify(mockNdrBuffer).enc_ndr_long(0);

   * array is that of the specified array. The returned array elements are in no particular order.
   * If the queue fits in the specified array, it is returned therein. Otherwise, a new array is
   * allocated with the runtime type of the specified array and the size of this queue.
   *
   * <p>If this queue fits in the specified array with room to spare (i.e., the array has more

    int len = string.length();
    int size = len * count;
    char[] array = new char[size];
    string.getChars(0, len, array, 0);
    int n;
    for (n = len; n < size - n; n <<= 1) {
      System.arraycopy(array, 0, array, n, n);
    }
    System.arraycopy(array, 0, array, n, size - n);
    return new String(array);
  }

                  related_query:
                    type: array
                    items:
                      type: string
                    example: ["aaa"]
                  related_contents:
                    type: array
                    items:
                      type: string
                    example: []
                  data:
                    type: array
                    items:

    /** Array of fields to be included in standard search response */
    protected String[] responseFields;

    /** Array of fields to be included in scroll search response */
    protected String[] scrollResponseFields;

    /** Array of fields to be included in cache search response */
    protected String[] cacheResponseFields;

    /** Array of fields that can be highlighted in search results */

    }

    /**
     * Validates array is not null and has expected length
     *
     * @param array the array to validate
     * @param expectedLength the expected length
     * @param fieldName the field name for error reporting
     * @throws IllegalArgumentException if array is invalid
     */
    public static void validateArrayLength(byte[] array, int expectedLength, String fieldName) {

  public void testRetainAll_duplicatesKept() {
    E[] array = createSamplesArray();
    array[1] = e0();
    collection = getSubjectGenerator().create(array);
    assertFalse(
        "containsDuplicates.retainAll(superset) should return false",
        collection.retainAll(MinimalCollection.of(createSamplesArray())));
    expectContents(array);
  }

  @CollectionFeature.Require(SUPPORTS_REMOVE)