- Sort Score
- Result 10 results
- Languages All
Results 281 - 290 of 369 for processes (0.04 sec)
-
src/test/java/jcifs/smb/SmbSessionImplSecurityTest.java
// Then - Session should be in consistent state // The double-check pattern should prevent inconsistent cleanup assertTrue(releaseCount.get() > 0 || acquireCount.get() > 0, "Release and acquire counts should be processed"); } /** * Test that trees collection is properly cleared during cleanup. */ @Test public void testTreesCollectionCleanup() { // GivenRegistered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Sun Aug 31 08:00:57 UTC 2025 - 11K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AggregateFutureState.java
* file. For discussion, see AbstractFutureState. */ // Lazily initialized the first time we see an exception; not released until all the input futures // have completed and we have processed them all. volatile @Nullable Set<Throwable> seenExceptionsField = null; volatile int remainingField; private static final AtomicHelper ATOMIC_HELPER;
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 8.5K bytes - Viewed (0) -
docs/fr/docs/deployment/https.md
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Tue Aug 06 04:48:30 UTC 2024 - 4.1K bytes - Viewed (0) -
compat/maven-resolver-provider/src/main/java/org/apache/maven/repository/internal/type/DefaultTypeProvider.java
new DefaultType(Type.FATJAR, Language.JAVA_FAMILY, "jar", null, true, JavaPathType.CLASSES), new DefaultType( Type.PROCESSOR, Language.JAVA_FAMILY, "jar", null, false, JavaPathType.PROCESSOR_CLASSES,
Registered: Sun Dec 28 03:35:09 UTC 2025 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 4.1K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
* specified access policy. * * @param capacity the capacity of this queue * @param fair if {@code true} then queue accesses for threads blocked on insertion or removal, * are processed in FIFO order; if {@code false} the access order is unspecified. * @throws IllegalArgumentException if {@code capacity} is less than 1 */ public MonitorBasedArrayBlockingQueue(int capacity, boolean fair) {Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue May 13 18:46:00 UTC 2025 - 22.4K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/exec/ThumbnailGenerator.java
Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Fri Nov 28 16:29:12 UTC 2025 - 9.4K bytes - Viewed (0) -
src/test/java/jcifs/smb1/smb1/SmbComNegotiateResponseTest.java
byte[] byteData = buffer.array(); // Call the method int bytesRead = response.readBytesWireFormat(byteData, 0); // Assertions // readBytesWireFormat returns bytes processed up to null terminator assertEquals(14, bytesRead); // 8 bytes key + 6 bytes domain name assertArrayEquals(encryptionKey, serverData.encryptionKey); assertEquals("DOMAIN", serverData.oemDomainName);Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 9.2K bytes - Viewed (0) -
docs/pt/docs/deployment/manually.md
Esta é a ideia básica. Mas você provavelmente vai querer cuidar de algumas coisas adicionais, como: * Segurança - HTTPS * Executando na inicialização * Reinicializações * Replicação (o número de processos em execução) * Memória * Passos anteriores antes de começar
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Wed Nov 12 16:23:57 UTC 2025 - 7.4K bytes - Viewed (0) -
src/cmd/asm/internal/lex/lex_test.go
} } } // lines joins the arguments together as complete lines. func lines(a ...string) string { return strings.Join(a, "\n") + "\n" } // drain returns a single string representing the processed input tokens. func drain(input *Input) string { var buf strings.Builder for { tok := input.Next() if tok == scanner.EOF { return buf.String() } if tok == '#' { continue }
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Tue Aug 29 07:48:38 UTC 2023 - 5.8K bytes - Viewed (0) -
src/main/java/org/codelibs/curl/Curl.java
Registered: Sat Dec 20 09:13:53 UTC 2025 - Last Modified: Thu Nov 20 13:34:13 UTC 2025 - 5.9K bytes - Viewed (0)