*
   * <p>In contrast, {@code multisetToModify.retainAll(multisetToRetain)} keeps all occurrences of
   * elements that appear at all in {@code multisetToRetain}, and deletes all occurrences of all
   * other elements.
   *
   * @return {@code true} if {@code multisetToModify} was changed as a result of this operation
   * @since 10.0
   */
  @CanIgnoreReturnValue

    @Nullable Object[] keys = requireKeys();
    @Nullable Object[] values = requireValues();
    int srcIndex = size() - 1;
    if (dstIndex < srcIndex) {
      // move last entry to deleted spot
      Object key = keys[srcIndex];
      keys[dstIndex] = key;
      values[dstIndex] = values[srcIndex];
      keys[srcIndex] = null;
      values[srcIndex] = null;

   *
   * <p>In contrast, {@code multisetToModify.retainAll(multisetToRetain)} keeps all occurrences of
   * elements that appear at all in {@code multisetToRetain}, and deletes all occurrences of all
   * other elements.
   *
   * @return {@code true} if {@code multisetToModify} was changed as a result of this operation
   * @since 10.0
   */
  @CanIgnoreReturnValue

            assertTrue(s2.isBlank());
        }

        @ParameterizedTest(name = "type {0} -> {1}")
        @CsvSource({ "0, 0", "1, User", "2, Domain group", "3, Domain", "4, Local group", "5, Builtin group", "6, Deleted", "7, Invalid",
                "8, Unknown" })
        @DisplayName("getType and getTypeText cover all types")
        void testGetTypeAndText(int type, String text) {

    public int getNodeType() throws UnknownHostException {
        checkData();
        return nodeType;
    }

    /**
     * Determines if this address in the process of being deleted.
     *
     * @return true if the address is being deleted, false otherwise
     * @throws UnknownHostException if the host cannot be resolved to find out.
     */

    public boolean isBeingDeleted() throws UnknownHostException {

      // is now at the end of queue. If that's the element we wanted to remove in the first place,
      // don't try to (incorrectly) trickle it. Instead, just delete it and we're done.
      queue[size] = null;
      return null;
    }
    E toTrickle = elementData(size);
    queue[size] = null;
    MoveDesc<E> changes = fillHole(index, toTrickle);

    return Array.newInstance(componentType, 0).getClass();
  }

  /*
   * TODO(benyu): Once behavior is the same for all Java (and Android) versions we support, delete
   * this. It is possible that one or both of JAVA6 and JAVA7 have become unnecessary already.
   */
  enum JavaVersion {
    JAVA6 {
      @Override
      GenericArrayType newArrayType(Type componentType) {

    private static final Logger log = LoggerFactory.getLogger(SID.class);

    static final String[] SID_TYPE_NAMES =
            { "0", "User", "Domain group", "Domain", "Local group", "Builtin group", "Deleted", "Invalid", "Unknown" };

    /**
     * Flag indicating that SIDs should be resolved to names.
     */
    public static final int SID_FLAG_RESOLVE_SIDS = 0x0001;

    /**
     * Well known SID: EVERYONE

   *
   * <p>The returned fluent iterable's iterator supports {@code remove()} if the {@code Iterator} of
   * this fluent iterable supports it. Note that it is <i>not</i> possible to delete the last
   * skipped element by immediately calling {@code remove()} on the returned fluent iterable's
   * iterator, as the {@code Iterator} contract states that a call to {@code * remove()} before a

     * Get the value for the key 'indexer.data.max.delete.cache.size'. <br>
     * The value is, e.g. 100 <br>
     * comment: Maximum delete cache size for data in the indexer.
     * @return The value of found property. (NotNull: if not found, exception but basically no way)
     */
    String getIndexerDataMaxDeleteCacheSize();

    /**
     * Get the value for the key 'indexer.data.max.delete.cache.size' as {@link Integer}. <br>