* time, this interface will be officially discouraged.
 *
 * @author Harry Heymann
 * @since 2.0
 */
@GwtCompatible
public interface Supplier<T extends @Nullable Object> {
  /**
   * Retrieves an instance of the appropriate type. The returned object may or may not be a new
   * instance, depending on the implementation.
   *
   * @return an instance of the appropriate type
   */
  @ParametricNullness

     */
    protected final SmbAuthException getRequestingException() {
        return sae;
    }

    /**
     * Used internally by jCIFS when an <code>SmbAuthException</code> is trapped to retrieve new user credentials.
     * @param url the URL that requires authentication
     * @param sae the authentication exception that was thrown
     * @return credentials returned by prompt or null if none available
     */

    }

    /*
     * (non-Javadoc)
     *
     * @see
     * org.codelibs.fess.crawler.service.impl.UrlFilterService#getExcludeUrlPatternList
     * (java.lang.String)
     */
    /**
     * Retrieves a list of URL patterns to be excluded for a given session.
     * @param sessionId The ID of the session.
     * @return A list of compiled regular expression patterns.
     */
    @Override

            new EntriesGenerator<K, V>(parentBuilder.getSubjectGenerator()))
        .withFeatures(computeEntriesFeatures(parentBuilder.getFeatures()))
        .named(parentBuilder.getName() + ".entries")
        .suppressing(parentBuilder.getSuppressedTests())
        .createTestSuite();
  }

  private static final class EntriesGenerator<K, V>

 * with any other implementation of this interface.
 *
 * <p>If you have your own graph implementation based around a custom node type {@code MyNode},
 * which has a method {@code getParents()} that retrieves its predecessors in a graph:
 *
 * {@snippet :
 * someGraphAlgorithm(startNode, MyNode::getParents);
 * }
 *
 * <p>If you have some other mechanism for returning the predecessors of a node, or one that doesn't

 * any other implementation of this interface.
 *
 * <p>If you have your own graph implementation based around a custom node type {@code MyNode},
 * which has a method {@code getChildren()} that retrieves its successors in a graph:
 *
 * {@snippet :
 * someGraphAlgorithm(startNode, MyNode::getChildren);
 * }
 *
 * <p>If you have some other mechanism for returning the successors of a node, or one that doesn't

     * @param filename the path to search in
     * @param wildcard the wildcard pattern to match
     * @param searchAttributes the file attributes to search for
     * @param batchCount the number of entries to return
     * @param batchSize the maximum size of the response buffer
     */
    public Trans2FindFirst2(final Configuration config, final String filename, final String wildcard, final int searchAttributes,

        // Test reading data from an empty buffer
        byte[] buffer = new byte[10];

        // Set data count to test return value
        response.setDataCount(5);

        // With 0 entries, should return dataCount
        int result = response.readDataWireFormat(buffer, 0, 0);
        // Should return dataCount
        assertEquals(5, result);
    }

    @Test
    void testGetSid() {

				}
			}

			if task.respCh != nil {
				task.respCh <- healResult{result: res, err: err}
				continue
			}

			// when respCh is not set caller is not waiting but we
			// update the relevant metrics for them
			if bgSeq != nil {
				if err == nil {
					bgSeq.countHealed(res.Type)
				} else {
					bgSeq.countFailed(res.Type)
				}
			}
		case <-ctx.Done():
			return
		}
	}
}

			w.Header()[header] = []string{strings.Join(v, ",")}
		}
	}
}

// SelectObjectContentHandler - GET Object?select
// ----------
// This implementation of the GET operation retrieves object content based
// on an SQL expression. In the request, along with the sql expression, you must
// also specify a data serialization format (JSON, CSV) of the object.