*/
    public String[] getNewInputs() {
        return newInputs == null ? null : newInputs.clone();
    }

    /**
     * Sets the array of new input character sequences for update operations.
     *
     * @param newInputs array of new input sequences to set
     */
    public void setNewInputs(final String[] newInputs) {
        this.newInputs = newInputs;
    }

    /**

     * @return the property value
     */
    <T> T getValue(Object target);

    /**
     * Sets the value of the property.
     *
     * @param target
     *            the target object. Must not be {@literal null}
     * @param value
     *            the value to set to the property
     */
    void setValue(Object target, Object value);

    /**

                Arguments.of(0x00001234, NtStatus.NT_STATUS_UNSUCCESSFUL));
    }

    @ParameterizedTest
    @MethodSource("intErrorCodes")
    @DisplayName("int ctor: sets message and NT status as expected")
    void intConstructor_populatesMessageAndStatus(int errCode, int expectedStatus) {
        // Arrange & Act: create exception with error code

    Set<String> set = of("a", "b");
    assertEquals(newHashSet("a", "b"), set);
  }

  public void testCreation_threeElements() {
    Set<String> set = of("a", "b", "c");
    assertEquals(newHashSet("a", "b", "c"), set);
  }

  public void testCreation_fourElements() {
    Set<String> set = of("a", "b", "c", "d");
    assertEquals(newHashSet("a", "b", "c", "d"), set);
  }

  public void testCreation_fiveElements() {

              @Override
              public SortedSet<String> create(String[] elements) {
                SortedSet<String> set = new TreeSet<>(arbitraryNullFriendlyComparator());
                Collections.addAll(set, elements);
                return set;
              }
            })
        .named("TreeSet, with comparator")
        .withFeatures(
            SetFeature.GENERAL_PURPOSE,

              @Override
              public SortedSet<String> create(String[] elements) {
                SortedSet<String> set = new TreeSet<>(arbitraryNullFriendlyComparator());
                Collections.addAll(set, elements);
                return set;
              }
            })
        .named("TreeSet, with comparator")
        .withFeatures(
            SetFeature.GENERAL_PURPOSE,

  abstract ContiguousSet<C> tailSetImpl(C fromElement, boolean inclusive);

  /**
   * Returns the set of values that are contained in both this set and the other.
   *
   * <p>This method should always be used instead of {@link Sets#intersection} for {@link
   * ContiguousSet} instances.
   */
  public abstract ContiguousSet<C> intersection(ContiguousSet<C> other);

  /**

     */
    public void setImageExtention(final String imageExtention) {
        this.imageExtention = imageExtention;
    }

    /**
     * Sets the split size for directory organization.
     *
     * @param splitSize the split size to set
     */
    public void setSplitSize(final int splitSize) {
        this.splitSize = splitSize;
    }

    /**

    /**
     * Updates crawling information parameters for the specified session.
     * Sets the name and expiration time based on the provided parameters.
     *
     * @param sessionId the session ID to update
     * @param name the name to set for the crawling session (uses system name if blank)
     * @param dayForCleanup number of days until cleanup (sets expiration if >= 0)

      return emptySet();
    } else {
      return emptyList();
    }
  }

  @Override
  public void clear() {
    keySet().clear();
  }

  @Override
  Set<K> createKeySet() {
    return Sets.filter(unfiltered.keySet(), keyPredicate);
  }

  @Override
  public Collection<V> get(@ParametricNullness K key) {
    if (keyPredicate.apply(key)) {
      return unfiltered.get(key);