public String getName() {
        final String urlpath = getURLPath();
        final String shr = getShare();
        if (urlpath.length() > 1) {
            int i = urlpath.length() - 2;
            while (urlpath.charAt(i) != '/') {
                i--;
            }
            return urlpath.substring(i + 1);
        }
        if (shr != null) {
            return shr + '/';
        }

            final int nextEntryOffset = cur.getNextEntryOffset();
            if (nextEntryOffset <= 0) {
                break;
            }
            bufferIndex += nextEntryOffset;
        } while (bufferIndex < bufferOffset + bufferLength);
        this.results = infos.toArray(new FileEntry[infos.size()]);
        return bufferIndex - start;
    }

    private FileBothDirectoryInfo createFileInfo() {

    fun trackFailure(
      call: RealCall,
      e: IOException?,
    )

    fun noNewExchanges()

    fun cancel()
  }

  companion object {
    /**
     * The timeout to use while discarding a stream of input data. Since this is used for connection
     * reuse, this timeout should be significantly less than the time it takes to establish a new
     * connection.
     */

 * default, no recursion is done for type arguments or type bounds. But subclasses can opt to do
 * recursion by calling {@link #visit} for any {@code Type} while visitation is in progress. For
 * example, this can be used to reject wildcards or type variables contained in a type as in:
 *
 * {@snippet :
 * new TypeVisitor() {

    // To start, fill up the cache.
    // Each miss both increments the counter and causes the map to grow by one,
    // so until evictions begin, the size of the map is the greatest return
    // value seen so far
    while (cache.getUnchecked(nextRandomKey()) < maximumSize) {}

    requests.set(0);
    misses.set(0);
  }

  @Benchmark
  int time(int reps) {
    int dummy = 0;
    for (int i = 0; i < reps; i++) {

            throws CIFSException, GeneralSecurityException {
        try (SmbTransportImpl trans = getTransport()) {
            synchronized (trans) {

                while (!this.connectionState.compareAndSet(0, 1)) {
                    int st = this.connectionState.get();
                    if (st == 2 || st == 3) { // connected or disconnecting
                        return chainedResponse;

                archiveStreamFactory.createArchiveInputStream(in.markSupported() ? in : new BufferedInputStream(in))) {
            ZipArchiveEntry entry = null;
            long contentSize = 0;
            while ((entry = (ZipArchiveEntry) ais.getNextEntry()) != null) {
                contentSize += entry.getSize();
                if (maxContentSize != -1 && contentSize > maxContentSize) {

        StringBuilder ret = new StringBuilder().append(proto).append(":").append(server).append("[").append(endpoint);
        if (options != null) {
            final Iterator iter = options.keySet().iterator();
            while (iter.hasNext()) {
                final Object key = iter.next();
                final Object val = options.get(key);
                ret.append(",").append(key).append("=").append(val);
            }
        }

   * at all are provided (an empty list), the resulting Cartesian product has one element, an empty
   * list (counter-intuitive, but mathematically consistent).
   *
   * <p><i>Performance notes:</i> while the cartesian product of lists of size {@code m, n, p} is a
   * list of size {@code m x n x p}, its actual memory consumption is much smaller. When the

   * released until there are no more tasks to run.
   *
   * <p>If a task is submitted while a thread is executing tasks from the task queue, the thread
   * will not be released until that submitted task is also complete.
   *
   * <p>If a task is {@linkplain Thread#interrupt interrupted} while a task is running:
   *
   * <ol>
   *   <li>execution will not stop until the task queue is empty.