tree.put("tree", 3);
    assertThat(tree.keySet()).containsExactly("tree", "google").inOrder();
    assertThat(tree.get("google")).containsExactly(6, 2).inOrder();

    TreeMultimap<String, Integer> copy = TreeMultimap.create(tree);
    assertEquals(tree, copy);
    assertThat(copy.keySet()).containsExactly("google", "tree").inOrder();
    assertThat(copy.get("google")).containsExactly(2, 6).inOrder();

        TestIterator it = TestIterator.create(tree, parent, wildcard, null, attrs, initial, pages);

        // Assert
        assertSame(tree, it.getTreeHandle(), "tree handle should be same instance returned by acquire");
        assertEquals(attrs, it.getSearchAttributes());
        assertEquals(wildcard, it.getWildcard());
        assertSame(parent, it.getParent());
        verify(tree, times(1)).acquire();
    }

    @Test

package jcifs.internal;

/**
 * Interface for SMB Tree Connect response messages.
 * Handles the server's response to a tree connect request, providing tree ID,
 * service type, and DFS information for the connected share.
 *
 * @author mbechler
 */
public interface TreeConnectResponse extends CommonServerMessageBlockResponse {

    /**
     * Returns the tree identifier (TID) assigned to this tree connection.
     *
     * @return tree id

    @Mock
    SmbTreeHandleImpl tree;

    @Mock
    SmbNamedPipe pipe;

    @Mock
    SmbFileHandleImpl fileHandle;

    private SmbPipeOutputStream newStream() throws CIFSException {
        // Arrange common constructor collaborators to avoid touching network/state
        when(handle.getPipe()).thenReturn(pipe);
        when(tree.isSMB2()).thenReturn(true);
        when(tree.getSendBufferSize()).thenReturn(4096);

    }

    private synchronized SmbTreeImpl getTree() {
        final SmbTreeImpl t = this.tree;
        if (t != null) {
            return t.acquire(false);
        }
        if (this.delegate != null) {
            this.tree = this.delegate.getTree();
            return this.tree;
        }
        return t;
    }

    /**
     * @return
     */

    void setup() throws MalformedURLException, CIFSException {
        // Common happy-path defaults
        // Use lenient() to avoid strict stubbing issues with Mockito
        lenient().when(tree.acquire()).thenReturn(tree);
        lenient().when(tree.getConfig()).thenReturn(config);
        lenient().when(config.getListCount()).thenReturn(10);
        lenient().when(config.getListSize()).thenReturn(4096);

        this.options = options;
        this.tree = tree.acquire();
        this.tree_num = tree.getTreeId();

        if (cfg.isTraceResourceUsage()) {
            this.creationBacktrace = Thread.currentThread().getStackTrace();
        } else {
            this.creationBacktrace = null;
        }
    }

    /**
     * @param cfg
     * @param fid
     * @param tree
     * @param unc
     * @param options

    /**
     * construct graph from a "dirty" tree
     */
    public MetadataGraph(MetadataTreeNode tree) throws MetadataResolutionException {
        this(tree, false, false);
    }
    // ------------------------------------------------------------------------
    /**
     * construct graph from a "dirty" tree
     *
     * @param tree "dirty" tree root

   */
  public void testCreateFromTreeMultimap() {
    Multimap<Double, Double> tree = TreeMultimap.create(KEY_COMPARATOR, VALUE_COMPARATOR);
    tree.put(1.0, 2.0);
    tree.put(2.0, 3.0);
    tree.put(3.0, 4.0);
    tree.put(4.0, 5.0);

    TreeMultimap<Double, Double> copyFromTree = TreeMultimap.create(tree);
    assertEquals(tree, copyFromTree);
    assertThat(copyFromTree.keyComparator()).isEqualTo(Ordering.natural());

   */
  public void testCreateFromTreeMultimap() {
    Multimap<Double, Double> tree = TreeMultimap.create(KEY_COMPARATOR, VALUE_COMPARATOR);
    tree.put(1.0, 2.0);
    tree.put(2.0, 3.0);
    tree.put(3.0, 4.0);
    tree.put(4.0, 5.0);

    TreeMultimap<Double, Double> copyFromTree = TreeMultimap.create(tree);
    assertEquals(tree, copyFromTree);
    assertThat(copyFromTree.keyComparator()).isEqualTo(Ordering.natural());