- Sort Score
- Result 10 results
- Languages All
Results 541 - 550 of 782 for passing (0.12 sec)
-
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/ws/WebSocketReader.kt
} if (isControlFrame && frameLength > PAYLOAD_BYTE_MAX) { throw ProtocolException("Control frame must be less than ${PAYLOAD_BYTE_MAX}B.") } if (isMasked) { // Read the masking key as bytes so that they can be used directly for unmasking. source.readFully(maskKey!!) } } @Throws(IOException::class) private fun readControlFrame() { if (frameLength > 0L) {
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Tue Jul 29 22:04:11 UTC 2025 - 9.9K bytes - Viewed (0) -
guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ImmutableBiMap.java
Function<? super T, ? extends K> keyFunction, Function<? super T, ? extends V> valueFunction) { return CollectCollectors.toImmutableBiMap(keyFunction, valueFunction); } // Casting to any type is safe because the set will never hold any elements. @SuppressWarnings("unchecked") public static <K, V> ImmutableBiMap<K, V> of() { return (ImmutableBiMap<K, V>) RegularImmutableBiMap.EMPTY; }
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Wed Aug 06 18:32:41 UTC 2025 - 7.1K bytes - Viewed (0) -
src/main/java/jcifs/internal/smb2/Smb2SigningDigest.java
this.provider = Crypto.getProvider(); break; case Smb2Constants.SMB2_DIALECT_0311: if (preauthIntegrityHash == null) { throw new IllegalArgumentException("Missing preauthIntegrityHash for SMB 3.1.1"); } this.signingKey = Smb3KeyDerivation.deriveSigningKey(dialect, sessionKey, preauthIntegrityHash); this.algorithmName = "AESCMAC";
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 30 05:58:03 UTC 2025 - 9.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSet.java
* can hold setSize elements with the desired load factor. Always returns at least setSize + 2. */ // TODO(cpovirk): Move to Hashing or something, since it's used elsewhere in the Android version. static int chooseTableSize(int setSize) { setSize = max(setSize, 2); // Correct the size for open addressing to match desired load factor.
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 35.2K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/opensearch/user/cbean/ca/bs/BsRoleCA.java
import org.opensearch.search.aggregations.bucket.filter.FilterAggregationBuilder; import org.opensearch.search.aggregations.bucket.global.GlobalAggregationBuilder; import org.opensearch.search.aggregations.bucket.missing.MissingAggregationBuilder; import org.opensearch.search.aggregations.bucket.range.IpRangeAggregationBuilder; import org.opensearch.search.aggregations.bucket.sampler.SamplerAggregationBuilder;
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Sat Mar 15 06:53:53 UTC 2025 - 9K bytes - Viewed (0) -
src/main/java/jcifs/pac/Pac.java
throw new PACDecodingException("Malformed PAC", e); } if (this.serverSignature == null || this.kdcSignature == null || this.logonInfo == null) { throw new PACDecodingException("Missing required buffers"); } if (log.isTraceEnabled()) { log.trace(String.format("Checksum data %s type %d signature %s", Hexdump.toHexString(checksumData),
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 7.3K bytes - Viewed (0) -
docs/erasure/README.md
## What is Erasure Code?
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Tue Aug 12 18:20:36 UTC 2025 - 4.2K bytes - Viewed (0) -
docs/es/docs/tutorial/extra-models.md
Si no lo sabes, aprenderás qué es un "hash de contraseña" en los [capítulos de seguridad](security/simple-oauth2.md#password-hashing){.internal-link target=_blank}. /// ## Múltiples modelos Aquí tienes una idea general de cómo podrían ser los modelos con sus campos de contraseña y los lugares donde se utilizan:
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Mon Dec 30 18:26:57 UTC 2024 - 7.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java
putEdge(N1, N2); assertThat(graphAsMutableGraph.putEdge(N2, N1)).isFalse(); } /** * Tests that the method {@code putEdge} will silently add the missing nodes to the graph, then * add the edge connecting them. We are not using the proxy methods here as we want to test {@code * putEdge} when the end-points are not elements of the graph. */ @Test
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 12.7K bytes - Viewed (0) -
docs/site-replication/run-multi-site-oidc.sh
./mc ls -r --versions minio1/newbucket >/tmp/minio1.txt ./mc ls -r --versions minio2/newbucket >/tmp/minio2.txt out=$(diff -qpruN /tmp/minio1.txt /tmp/minio2.txt) ret=$? if [ $ret -ne 0 ]; then echo "BUG: expected no missing entries after replication resync: $out" exit 1
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Tue Sep 24 08:03:58 UTC 2024 - 8.5K bytes - Viewed (0)