handler.handle(WinError.WINERR_CODES[i], WinError.WINERR_MESSAGES[i]);
        }

        // Verify the collaborator is invoked exactly N times
        verify(handler, times(WinError.WINERR_CODES.length)).handle(anyInt(), anyString());

        // Capture one known interaction to verify argument integrity

 * either express or implied. See the License for the specific language
 * governing permissions and limitations under the License.
 */
package org.codelibs.fess.crawler.service.impl;

import static org.mockito.Mockito.times;
import static org.mockito.Mockito.verify;
import static org.mockito.Mockito.when;

import java.util.ArrayList;
import java.util.List;
import java.util.regex.Pattern;

        // Verify interactions with dependency are meaningful and ordered
        InOrder order = inOrder(mockContext);
        order.verify(mockContext, times(1)).getConfig();
        order.verify(mockContext, times(1)).getCredentials();
        verifyNoMoreInteractions(mockContext);
    }

    @Test
    @DisplayName("createContext throws on null CIFSContext")

        });

        // When: Create iterator and close multiple times
        NetServerEnumIterator iterator = new NetServerEnumIterator(parent, treeHandle, "*", 0, null);

        iterator.close();
        iterator.close(); // Second close should be safe

        // Then: Tree handle should be released only once
        verify(treeHandle, times(1)).release();
    }

    @Test

}

// commonTime returns a maximally occurring time from a list of time.
func commonTimeAndOccurrence(times []time.Time, group time.Duration) (maxTime time.Time, maxima int) {
	timeOccurrenceMap := make(map[int64]int, len(times))
	groupNano := group.Nanoseconds()
	// Ignore the uuid sentinel and count the rest.
	for _, t := range times {
		if t.Equal(timeSentinel) || t.IsZero() {
			continue
		}
		nano := t.UnixNano()
		if group > 0 {

                org.codelibs.core.timer.TimeoutTask accessTimeoutTask = null;
                if (accessTimeout != null) {
                    accessTimeoutTarget = new org.codelibs.fess.crawler.client.AccessTimeoutTarget(Thread.currentThread());
                    accessTimeoutTask = org.codelibs.core.timer.TimeoutManager.getInstance()

  //             Policy.setPolicy(permissivePolicy());
  //             System.setSecurityManager(new SecurityManager());
  //         }
  //         int iters = (args.length == 0) ? 1 : Integer.parseInt(args[0]);

  //         Test s = suite();
  //         for (int i = 0; i < iters; ++i) {
  //             junit.textui.TestRunner.run(s);
  //             System.gc();
  //             System.runFinalization();
  //         }

    call?.cancel()
  }

  override fun onEvent(
    id: String?,
    type: String?,
    data: String,
  ) {
    listener.onEvent(this, id, type, data)
  }

  override fun onRetryChange(timeMs: Long) {
    // Ignored. We do not auto-retry.
  }

## Alternativas { #alternatives }

Eu tenho criado APIs com requisitos complexos por vários anos (Aprendizado de Máquina, sistemas distribuídos, tarefas assíncronas, banco de dados NoSQL etc.), liderando vários times de desenvolvedores.

Como parte disso, eu precisava investigar, testar e usar muitas alternativas.

A história do **FastAPI** é, em grande parte, a história de seus predecessores.

            // Given
            byte[] buffer = new byte[60];
            SMBUtil.writeInt2(60, buffer, 0);

            // SMB times are in 100-nanosecond intervals since 1601
            // Java times are in milliseconds since 1970
            long currentJavaTime = System.currentTimeMillis();
            long smbTime = currentJavaTime * 10000L + 116444736000000000L;