- Sort Score
- Result 10 results
- Languages All
Results 101 - 110 of 145 for Kashem (0.08 sec)
-
CHANGELOG/CHANGELOG-1.18.md
Registered: Fri Nov 01 09:05:11 UTC 2024 - Last Modified: Wed Jun 16 17:18:28 UTC 2021 - 373.2K bytes - Viewed (0) -
guava/src/com/google/common/net/InternetDomainName.java
* * <ul> * <li>Any part containing non-ASCII characters is considered valid. * <li>Underscores ('_') are permitted wherever dashes ('-') are permitted. * <li>Parts other than the final part may start with a digit, as mandated by <a * href="https://tools.ietf.org/html/rfc1123#section-2">RFC 1123</a>. * </ul> *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Feb 05 20:47:23 UTC 2024 - 28K bytes - Viewed (0) -
docs/pt/docs/tutorial/security/simple-oauth2.md
##### Porque usar hashing de senha Se o seu banco de dados for roubado, o ladrão não terá as senhas em texto simples dos seus usuários, apenas os hashes. Assim, o ladrão não poderá tentar usar essas mesmas senhas em outro sistema (como muitos usuários usam a mesma senha em todos os lugares, isso seria perigoso). //// tab | Python 3.10+ ```Python hl_lines="82-85"
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Thu Oct 31 12:17:45 UTC 2024 - 13.3K bytes - Viewed (0) -
src/main/java/jcifs/smb1/http/NetworkExplorer.java
} if( sae.getNtStatus() == sae.NT_STATUS_ACCESS_VIOLATION ) { /* Server challenge no longer valid for * externally supplied password hashes. */ resp.sendRedirect( req.getRequestURL().toString() ); return; } resp.setHeader( "WWW-Authenticate", "NTLM" ); if (offerBasic) {
Registered: Sun Nov 03 00:10:13 UTC 2024 - Last Modified: Wed Jan 22 03:57:31 UTC 2020 - 19.7K bytes - Viewed (0) -
guava/src/com/google/common/hash/Crc32cHashFunction.java
final class Crc32cHashFunction extends AbstractHashFunction { static final HashFunction CRC_32_C = new Crc32cHashFunction(); @Override public int bits() { return 32; } @Override public Hasher newHasher() { return new Crc32cHasher(); } @Override public String toString() { return "Hashing.crc32c()"; } static final class Crc32cHasher extends AbstractStreamingHasher {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Apr 20 18:43:59 UTC 2021 - 21.3K bytes - Viewed (0) -
common-protos/k8s.io/api/flowcontrol/v1beta1/generated.proto
// `handSize` is a small positive number that configures the // shuffle sharding of requests into queues. When enqueuing a request // at this priority level the request's flow identifier (a string // pair) is hashed and the hash value is used to shuffle the list // of queues and deal a hand of the size specified here. The // request is put into one of the shortest queues in that hand.
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Mon Mar 11 18:43:24 UTC 2024 - 19.4K bytes - Viewed (0) -
src/main/java/jcifs/http/NetworkExplorer.java
} if ( sae.getNtStatus() == NtStatus.NT_STATUS_ACCESS_VIOLATION ) { /* * Server challenge no longer valid for * externally supplied password hashes. */ resp.sendRedirect(req.getRequestURL().toString()); return; } resp.setHeader("WWW-Authenticate", "NTLM"); if ( offerBasic ) {
Registered: Sun Nov 03 00:10:13 UTC 2024 - Last Modified: Sun Jul 01 13:12:10 UTC 2018 - 21.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/cache/CacheBuilderTest.java
assertEquals("a", notification.getKey()); assertEquals("a", notification.getValue()); assertEquals(1, cache.size()); assertEquals("b", cache.getUnchecked("b")); } // "Basher tests", where we throw a bunch of stuff at a LoadingCache and check basic invariants. /** * This is a less carefully-controlled version of {@link #testRemovalNotification_clear} - this is
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 18 15:00:32 UTC 2024 - 24.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/BloomFilterTest.java
tester.testAllPublicInstanceMethods(BloomFilter.create(Funnels.unencodedCharsFunnel(), 100)); tester.testAllPublicStaticMethods(BloomFilter.class); } /** Tests that we never get an optimal hashes number of zero. */ public void testOptimalHashes() { for (int n = 1; n < 1000; n++) { for (int m = 0; m < 1000; m++) { assertTrue(BloomFilter.optimalNumOfHashFunctions(n, m) > 0); } }
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Oct 21 14:28:19 UTC 2024 - 21.2K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.20.md
Registered: Fri Nov 01 09:05:11 UTC 2024 - Last Modified: Wed Jan 19 21:05:45 UTC 2022 - 409K bytes - Viewed (0)