- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 37 for lentas (0.04 sec)
-
docs/pt/docs/async.md
Então, durante esse tempo, o computador pode ir e fazer outro trabalho, enquanto o "arquivo lento" 📝 termina.
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:56:21 UTC 2025 - 23.6K bytes - Viewed (0) -
docs/es/docs/async.md
Pero como te alejas del mostrador y te sientas en la mesa con un número para tu turno, puedes cambiar 🔀 tu atención a tu crush, y "trabajar" ⏯ 🤓 en eso. Luego, nuevamente estás haciendo algo muy "productivo" como es coquetear con tu crush 😍.
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:56:21 UTC 2025 - 24.7K bytes - Viewed (0) -
src/test/java/jcifs/smb/SmbRandomAccessFileTest.java
raf.writeByte(0x7F); ArgumentCaptor<Integer> lenCap = ArgumentCaptor.forClass(Integer.class); verify(raf, atLeast(2)).write(any(byte[].class), anyInt(), lenCap.capture()); assertTrue(lenCap.getAllValues().stream().allMatch(len -> len == 1)); } @Test @DisplayName("write(short/char/int/long/float/double): correct byte lengths") void write_multiByteVariants_lengths() throws Exception {
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 18.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/ConcurrentHashMultisetBasherTest.java
for (int i = 0; i < nTasks; i++) { futures.add(pool.submit(new MutateTask(multiset, keys))); } int[] deltas = new int[3]; for (Future<int[]> future : futures) { int[] taskDeltas = future.get(); for (int i = 0; i < deltas.length; i++) { deltas[i] += taskDeltas[i]; } } List<Integer> actualCounts = transform( keys,
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 6K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/HashTestUtils.java
*/ static void checkNo2BitCharacteristics(HashFunction function) { Random rand = new Random(0); int keyBits = 32; // get every one of (keyBits choose 2) deltas: for (int i = 0; i < keyBits; i++) { for (int j = 0; j < keyBits; j++) { if (j <= i) continue; int count = 0; int maxCount = 20; // the probability of error here is minuscule
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 25.6K bytes - Viewed (0) -
src/test/java/jcifs/NetbiosAddressTest.java
String smbServer = NbtAddress.SMBSERVER_NAME; assertNotNull(anyHosts); assertNotNull(masterBrowser); assertNotNull(smbServer); // Test that they have expected lengths assertEquals(16, anyHosts.length()); assertEquals(15, masterBrowser.length()); assertEquals(15, smbServer.length()); }
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 1.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/TreeMultimapExplicitTest.java
* * @author Jared Levy */ @GwtCompatible @NullMarked public class TreeMultimapExplicitTest extends TestCase { /** * Compare strings lengths, and if the lengths are equal compare the strings. A {@code null} is * less than any non-null value. */ private enum StringLength implements Comparator<@Nullable String> { COMPARATOR; @Override
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 8.4K bytes - Viewed (0) -
src/main/java/jcifs/internal/smb2/rdma/RdmaChannelInfo.java
*/ package jcifs.internal.smb2.rdma; /** * RDMA channel information for SMB Direct operations. * * This class encapsulates RDMA channel metadata including remote memory keys, * addresses, and lengths for direct memory access operations. */ public class RdmaChannelInfo { private final Smb2RdmaTransform transform; /** * Create new RDMA channel info *
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sun Aug 24 00:12:28 UTC 2025 - 2.8K bytes - Viewed (0) -
guava/src/com/google/common/hash/Fingerprint2011.java
output[1] = seedB + c; } /* * Compute an 8-byte hash of a byte array of length greater than 64 bytes. */ private static long fullFingerprint(byte[] bytes, int offset, int length) { // For lengths over 64 bytes we hash the end first, and then as we // loop we keep 56 bytes of state: v, w, x, y, and z. long x = load64(bytes, offset); long y = load64(bytes, offset + length - 16) ^ K1;
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 6.5K bytes - Viewed (0) -
cmd/erasure-decode_test.go
t.Errorf("Test %d: read returns wrong file content", i) } } } } } // Test erasureDecode with random offset and lengths. // This test is t.Skip()ed as it a long time to run, hence should be run // explicitly after commenting out t.Skip() func TestErasureDecodeRandomOffsetLength(t *testing.T) { if testing.Short() { t.Skip() }
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 21K bytes - Viewed (0)