SmbTree tree4 = new SmbTree(session, "testShare", "otherService");

        // Test equal trees (same share and service)
        assertEquals(tree1, tree2);

        // Test non-equal trees (different share)
        assertNotEquals(tree1, tree3);

        // Test non-equal trees (different service)
        assertNotEquals(tree1, tree4);

        // Test with different object type
        assertNotEquals(tree1, new Object());

                        // Get or create tree
                        SmbTreeImpl tree = session.getSmbTree(share, null);
                        assertNotNull(tree, "Tree should not be null");

                        // Verify we can acquire the tree
                        tree.acquire();
                        successCount.incrementAndGet();

                // Emergency cleanup of trees
                if (this.trees != null) {
                    try {
                        // Clear all tree references
                        for (SmbTreeImpl tree : this.trees) {
                            try {
                                // Force release trees during emergency cleanup
                                tree.release();

        }
        return root;
      }
    },
    RANDOM {
      /**
       * Generates a tree with topology selected uniformly at random from the topologies of binary
       * trees of the specified size.
       */
      @Override
      Optional<BinaryNode> createTree(int size, Random rng) {
        int[] keys = new int[size];

        this.localPort = localPort;
        this.auth = auth;
        trees = new Vector();
        connectionState = 0;
    }

    synchronized SmbTree getSmbTree(String share, final String service) {
        SmbTree t;

        if (share == null) {
            share = "IPC$";
        }
        for (final Enumeration e = trees.elements(); e.hasMoreElements();) {
            t = (SmbTree) e.nextElement();

        }
        return root;
      }
    },
    RANDOM {
      /**
       * Generates a tree with topology selected uniformly at random from the topologies of binary
       * trees of the specified size.
       */
      @Override
      Optional<BinaryNode> createTree(int size, Random rng) {
        int[] keys = new int[size];

import org.apache.maven.api.annotations.Consumer;
import org.apache.maven.api.annotations.Experimental;
import org.apache.maven.api.annotations.Nonnull;

/**
 * Defines a hierarchical visitor for collecting dependency node trees.
 *
 * @since 4.0.0
 */
@Experimental
@Consumer
public interface NodeVisitor {
    /**
     * Starts the visit to the specified dependency node.
     *
     * @param node the dependency node to visit

        // Session starts with usage count > 0
        assertTrue(session.isInUse(), "Session should be in use initially");

        // Create and release trees
        SmbTreeImpl tree = session.getSmbTree("share1", null);
        assertNotNull(tree, "Tree should be created");
        tree.release();

        // Release the session (back to initial state)
        session.release();

Just functions that look the same as the *path operation functions*.

But still, it is very powerful, and allows you to declare arbitrarily deeply nested dependency "graphs" (trees).

/// tip

All this might not seem as useful with these simple examples.

But you will see how useful it is in the chapters about **security**.

And you will also see the amounts of code it will save you.

import java.util.Iterator;
import java.util.Queue;
import org.jspecify.annotations.Nullable;

/**
 * Views elements of a type {@code T} as nodes in a tree, and provides methods to traverse the trees
 * induced by this traverser.
 *
 * <p>For example, the tree
 *
 * {@snippet :
 *        h
 *      / | \
 *     /  e  \
 *    d       g
 *   /|\      |
 *  / | \     f
 * a  b  c
 * }
 *