}
        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];

        }
        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];

        // 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();

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

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
 * }
 *

import java.util.Queue;
import java.util.function.Consumer;
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
 * }
 *

        CustomSmbTree inner = middle.unwrap(CustomSmbTree.class);

        assertNotNull(middle, "Middle tree should not be null");
        assertNotNull(inner, "Inner tree should not be null");
        assertSame(middleTree, middle, "Should return correct middle tree");
        assertSame(innerTree, inner, "Should return correct inner tree");
    }

    /**
     * Test for unwrap with incompatible type.

    // Test case for the equals method
    @Test
    void testEquals() {
        SmbTreeImpl tree1 = new SmbTreeImpl(session, "SHARE", "A:");
        SmbTreeImpl tree2 = new SmbTreeImpl(session, "SHARE", "A:");
        SmbTreeImpl tree3 = new SmbTreeImpl(session, "OTHER", "A:");
        assertEquals(tree1, tree2);
        assertFalse(tree1.equals(tree3));
    }

    // Test case for the unwrap method
    @Test
    void testUnwrap() {

Vous pouvez :

* <a href="https://github.com/tiangolo" class="external-link" target="_blank">Me suivre sur **GitHub**</a>.
    * Voir d'autres projets Open Source que j'ai créés et qui pourraient vous aider.
    * Suivez-moi pour voir quand je crée un nouveau projet Open Source.
* <a href="https://x.com/tiangolo" class="external-link" target="_blank">Me suivre sur **X (Twitter)**</a>.