}

        if (enqueuedCall != null) {
          readyAsyncCalls.add(enqueuedCall)

          // Mutate the AsyncCall so that it shares the AtomicInteger of an existing running call to
          // the same host.
          if (!enqueuedCall.call.forWebSocket) {
            val existingCall = findExistingCallWithHost(enqueuedCall.host)

            assertEquals("smb1://server/share/", new SmbFile("smb1://server/share/file.txt").getParent());
            // Test parent of a directory
            assertEquals("smb1://server/share/", new SmbFile("smb1://server/share/dir/").getParent());
            // Test parent of a share
            assertEquals("smb1://server/", new SmbFile("smb1://server/share/").getParent());
            // Test parent of a server

     */
    int connectionState;
    int tid;

    String share;
    String service = "?????";
    String service0;
    SmbSession session;
    boolean inDfs, inDomainDfs;
    int tree_num; // used by SmbFile.isOpen

    SmbTree(final SmbSession session, final String share, final String service) {
        this.session = session;
        this.share = share.toUpperCase();
        if (service != null && !service.startsWith("??")) {

        SmbTreeImpl tree = new SmbTreeImpl(session, "SHARE", "A:");
        assertNotNull(tree);
        assertEquals("SHARE", tree.getShare());
        assertEquals("A:", tree.getService());
    }

    // Test case for the matches method
    @Test
    void testMatches() {
        SmbTreeImpl tree = new SmbTreeImpl(session, "SHARE", "A:");
        assertTrue(tree.matches("share", "A:"));

            p++;
        }
        while (p < len && pathInfo.charAt(p) == '/') {
            p++;
        }
        if (p < len) { /* then there must be a share */
            out[i] = '/';
            i++;
            do { /* collect the share name */
                out[i++] = ch = pathInfo.charAt(p++);
            } while (p < len && ch != '/');
        }
        return new String(out, 0, i);
    }

The expression <code>x</code> is evaluated and saved during the evaluation of the
method value; the saved copy is then used as the receiver in any calls,
which may be executed later.
</p>

<pre>
type S struct { *T }
type T int
func (t T) M() { print(t) }

t := new(T)
s := S{T: t}
f := t.M                    // receiver *t is evaluated and stored in f

Erasure coding used by MinIO is [Reed-Solomon](https://github.com/klauspost/reedsolomon) erasure coding scheme, which has a total shard maximum of 256 i.e 128 data and 128 parity. MinIO design goes beyond this limitation by doing some practical architecture choices.

- Erasure set is a single erasure coding unit within a MinIO deployment. An object is sharded within an erasure set. Erasure set size is automatically calculated based on the number of drives. MinIO supports unlimited number...

                this.canon = "/" + this.share + "/" + StringUtil.join("/", remainParts) + (trailingSlash ? "/" : "");
            } else {
                this.unc = "\\";
                if (this.share != null) {
                    this.canon = "/" + this.share + (trailingSlash ? "/" : "");
                } else {
                    this.canon = "/";
                }

        }

        /*
         * Subtract the server and share from the pathConsumed so that
         * it reflects the part of the relative path consumed and not
         * the entire path.
         */

        DfsReferralDataInternal next = dri;
        do {
            next.stripPathConsumed(1 + server.length() + 1 + share.length());
            next = next.next();
        } while (next != dri);

    }

    @ParameterizedTest
    @DisplayName("Test valid share names")
    @ValueSource(strings = { "share", "share$", "SHARE", "share123", "share-name", "share_name", "share.name" })
    void testValidShareNames(String share) {
        assertDoesNotThrow(() -> InputValidator.validateShareName(share));
    }

    @Test
    @DisplayName("Test port validation")
    void testPortValidation() {