}

    @Test
    @DisplayName("Type detection covers filesystem/share/IPC/workgroup/server")
    void testGetType() throws Exception {
        // Filesystem when there is a path beyond share
        assertEquals(SmbConstants.TYPE_FILESYSTEM, locator("smb://server/share/path").getType());

        // Named pipe for IPC$ root

        if (threads <= 1) {
            executor = Runnable::run;
        } else {
            executor = new ThreadPoolExecutor(
                    threads, threads, 3, TimeUnit.SECONDS, new LinkedBlockingQueue<>(), new DaemonThreadCreator());
        }
    }

    private RepositorySystemSession getSession(ArtifactRepository localRepository) {

      assertTrue(
          IntMath.biggestBinomials[k] == Integer.MAX_VALUE
              || !fitsInInt(BigIntegerMath.binomial(IntMath.biggestBinomials[k] + 1, k)));
      // In the first case, any int is valid; in the second, we want to test that the next-bigger
      // int overflows.
    }
    assertFalse(
        fitsInInt(
            BigIntegerMath.binomial(

            fileFsFullSizeInfo.decode(buffer1.array(), 0, 32);
            long firstCapacity = fileFsFullSizeInfo.getCapacity();
            long firstFree = fileFsFullSizeInfo.getFree();

            // When - second decode with different values
            ByteBuffer buffer2 = ByteBuffer.allocate(32);
            buffer2.order(ByteOrder.LITTLE_ENDIAN);
            buffer2.putLong(2000L);
            buffer2.putLong(1500L);

		},
	)

	newDB.Joins("inner join rgs on rgs.id = user.id")

	stmt := newDB.First(&result).Statement
	str := stmt.SQL.String()

	if !strings.Contains(str, "rgs.id = user.id") {
		t.Errorf("The second join condition is over written instead of combining")
	}

	if !strings.Contains(str, "`users`.`company_id` = `companies`.`id`") && !strings.Contains(str, "\"users\".\"company_id\" = \"companies\".\"id\"") {

 * dispersion is easily corrected using a secondary hash function (which all reasonable hash table
 * implementations in Java use). For the many uses of hash functions beyond data structures,
 * however, {@code Object.hashCode} almost always falls short -- hence this library.
 *
 * @author Kevin Bourrillion
 * @since 11.0
 */
@Immutable
public interface HashFunction {
  /**

(c){b=new a.ActiveXObject("Microsoft.XMLHTTP")}return function(){return b}}(),f=function(a,b){var c=e();c&&(c.open("GET",a,!0),c.onreadystatechange=function(){4!==c.readyState||200!==c.status&&304!==c.status||b(c.responseText)},4!==c.readyState&&c.send(null))};if(c.ajax=f,c.queue=d,c.regex={media:/@media[^\{]+\{([^\{\}]*\{[^\}\{]*\})+/gi,keyframes:/@(?:\-(?:o|moz|webkit)\-)?keyframes[^\{]+\{(?:[^\{\}]*\{[^\}\{]*\})+[^\}]*\}/gi,urls:/(url\()['"]?([^\/\)'"][^:\)'"]+)['"]?(\))/g,findStyles:/@media ...

**FastAPI** fournit le même `WebSocket` directement, simplement pour vous faciliter la vie en tant que développeur. Mais il provient directement de Starlette.

///

## Attendre des messages et envoyer des messages { #await-for-messages-and-send-messages }

Dans votre route WebSocket, vous pouvez `await` des messages et envoyer des messages.

{* ../../docs_src/websockets_/tutorial001_py310.py hl[48:52] *}

    protected DnsResolver dnsResolver = new IdnDnsResolver();

    /** Map of authentication scheme providers */
    protected Map<String, AuthSchemeProvider> authSchemeProviderMap;

    /** Connection check interval in seconds */
    protected int connectionCheckInterval = 5; // sec

    /** Idle connection timeout in milliseconds */
    protected long idleConnectionTimeout = 60 * 1000L; // 1min

    ImmutableList<TestDatum> second =
        ImmutableList.of(new TestDatum("A", 3), new TestDatum("A", 4));

    Comparator<TestDatum> comparator = Comparator.comparing(d -> d.letter);
    Iterator<TestDatum> merged =
        Iterators.mergeSorted(ImmutableList.of(first.iterator(), second.iterator()), comparator);