WildcardType wildcard = (WildcardType) componentType;
      Type[] lowerBounds = wildcard.getLowerBounds();
      checkArgument(lowerBounds.length <= 1, "Wildcard cannot have more than one lower bounds.");
      if (lowerBounds.length == 1) {
        return supertypeOf(newArrayType(lowerBounds[0]));
      } else {
        Type[] upperBounds = wildcard.getUpperBounds();

    private Trans2FindFirst2Response response;

    public DirFileEntryEnumIterator1(final SmbTreeHandleImpl th, final SmbResource parent, final String wildcard,
            final ResourceNameFilter filter, final int searchAttributes) throws CIFSException {
        super(th, parent, wildcard, filter, searchAttributes);
    }

    @SuppressWarnings("resource")
    @Override
    protected final FileEntry open() throws CIFSException {

        verify(tree, atLeastOnce()).release();
    }

    @ParameterizedTest
    @ValueSource(strings = { "", " ", "*", "?" })
    @DisplayName("Supports various wildcard values without throwing (edge cases)")
    void wildcardEdgeCases(String wildcard) throws Exception {
        // minimal successful first response with a single entry

        regQ(existsQuery);
        return existsQuery;
    }

    protected WildcardQueryBuilder regWildcardQ(String name, String wildcard) {
        checkEsInvalidQuery(name, wildcard);
        WildcardQueryBuilder wildcardQuery = QueryBuilders.wildcardQuery(name, wildcard);
        regQ(wildcardQuery);
        return wildcardQuery;
    }

    protected RegexpQueryBuilder regRegexpQ(String name, String regexp) {

        regQ(existsQuery);
        return existsQuery;
    }

    protected WildcardQueryBuilder regWildcardQ(String name, String wildcard) {
        checkEsInvalidQuery(name, wildcard);
        WildcardQueryBuilder wildcardQuery = QueryBuilders.wildcardQuery(name, wildcard);
        regQ(wildcardQuery);
        return wildcardQuery;
    }

    protected RegexpQueryBuilder regRegexpQ(String name, String regexp) {

	for pattern := range rules {
		if wildcard.MatchSimple(pattern, objectName) {
			return true
		}
	}
	return false
}

// Match - returns TargetIDSet matching object name in rules.
func (rules Rules) Match(objectName string) TargetIDSet {
	targetIDs := NewTargetIDSet()

	for pattern, targetIDSet := range rules {
		if wildcard.MatchSimple(pattern, objectName) {

            if (dff.wildcard != null) {
                wildcard = dff.wildcard;
            }
            searchAttributes = dff.attributes;
        }

        try {
            final int hostlen = url.getHost().length();
            if (hostlen == 0 || getType() == TYPE_WORKGROUP) {
                doNetServerEnum(list, files, wildcard, searchAttributes, fnf, ff);

        assertNotNull(queryBuilder3);
    }

    @Test
    public void test_convertWildcardQuery_withSpecialCharacters() throws Exception {
        // Test with special wildcard characters
        QueryContext queryContext1 = new QueryContext("te?t*", false);
        WildcardQuery wildcardQuery1 = new WildcardQuery(new Term("title", "te?t*"));

        // Default constructor
    }

    /**
     * Wraps a query string with wildcard characters to enable partial matching.
     * This method ensures that the query string is surrounded by asterisks (*)
     * to support prefix and suffix matching in search operations.
     *
     * @param query the query string to wrap with wildcards
     * @return the wrapped query string with leading and trailing asterisks
     */

      PublicSuffixType exactType = getExactMatchType(metadata);
      if (matchesType(desiredType, exactType)) {
        bestResult = i;
      }

      // Wildcard match (*.rule). If the wildcard type bits are set, any child of this node is a
      // public suffix. For example, "*.ck" means "any.ck" is a public suffix.
      PublicSuffixType wildcardType = getWildcardMatchType(metadata);