// Close should have sent FindClose2 exactly once
        ArgumentCaptor<SmbComFindClose2> captor = ArgumentCaptor.forClass(SmbComFindClose2.class);
        verify(tree, times(1)).send(captor.capture(), any());
        assertNotNull(captor.getValue());

        // Tree handle is released after close
        verify(tree, atLeastOnce()).release();
    }

    @Test

        assertEquals(42, read);

        // Verify we issued an SMB2 IOCTL
        ArgumentCaptor<Smb2IoctlRequest> captor = ArgumentCaptor.forClass(Smb2IoctlRequest.class);
        verify(tree).send(captor.capture(), any());
        assertNotNull(captor.getValue());
    }

    @Test
    @DisplayName("recv delegates to input.readDirect and returns its value")

        // Verify resolveSids0 called exactly once with the two SIDs needing resolution
        ArgumentCaptor<SID[]> captor = ArgumentCaptor.forClass(SID[].class);
        verify(cache, times(1)).resolveSids0(isNull(), same(ctx), captor.capture());
        SID[] resolvedFirst = captor.getValue();
        assertEquals(2, resolvedFirst.length);
        assertEquals("user1", ((SID) resolvedFirst[0]).acctName);

            // Assert: resolver.resolveSids called with this SID
            ArgumentCaptor<jcifs.SID[]> captor = ArgumentCaptor.forClass(jcifs.SID[].class);
            verify(mockResolver, times(1)).resolveSids(same(mockCtx), eq("server.example"), captor.capture());
            assertSame(sid, captor.getValue()[0]);
        }

        @Test

Lá você pode selecionar “Apenas lançamentos”.

Fazendo isso, você receberá notificações (no seu email) sempre que houver um novo lançamento (uma nova versão) do **FastAPI** com correções de bugs e novas funcionalidades.

## Conecte-se com o autor { #connect-with-the-author }

        verify(signingDigest).sign(dataCaptor.capture(), offsetCaptor.capture(), lengthCaptor.capture(), eq(request), eq(response));

        assertArrayEquals(testData, dataCaptor.getValue());
        assertEquals(offset, offsetCaptor.getValue());
        assertEquals(length, lengthCaptor.getValue());
    }

    @Test
    @DisplayName("Test verify method invocation with argument capture")
    void testVerifyMethodArgumentCapture() {

import (
	"strings"

	"github.com/alecthomas/participle"
	"github.com/alecthomas/participle/lexer"
)

// Types with custom Capture interface for parsing

// Boolean is a type for a parsed Boolean literal
type Boolean bool

// Capture interface used by participle
func (b *Boolean) Capture(values []string) error {
	*b = Boolean(strings.EqualFold(values[0], "true"))
	return nil
}

        (ParameterizedType) new TypeCapture<Entry<String, int[][]>>() {}.capture();
    ParameterizedType ourType =
        Types.newParameterizedTypeWithOwner(Map.class, Entry.class, String.class, int[][].class);

    new EqualsTester()
        .addEqualityGroup(jvmType, ourType)
        .addEqualityGroup(new TypeCapture<Entry<String, String>>() {}.capture())
        .addEqualityGroup(new TypeCapture<Map<String, Integer>>() {}.capture())

   * {@code ArrayList<?>::set}.
   *
   * <p>Instead, {@code <?>} will be resolved to a capture in the form of a type variable {@code
   * <capture-of-? extends Object>}, effectively preventing {@code set} from accepting any type.
   */
  static TypeResolver invariantly(Type contextType) {
    Type invariantContext = WildcardCapturer.INSTANCE.capture(contextType);

   *
   * <p><i>Notes:</i> This is an implementation of the algorithm for Lexicographical Permutations
   * Generation, described in Knuth's "The Art of Computer Programming", Volume 4, Chapter 7,
   * Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the
   * first permutation will be in ascending order, and the last will be in descending order.
   *