- Sort Score
- Result 10 results
- Languages All
Results 301 - 310 of 371 for generation (0.05 sec)
-
internal/auth/credentials.go
// Maximum secret key length for MinIO, this // is used when autogenerating new credentials. // There is no max length enforcement for secret keys secretKeyMaxLen = 40 // Alpha numeric table used for generating access keys. alphaNumericTable = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ" // Total length of the alpha numeric table. alphaNumericTableLen = byte(len(alphaNumericTable)) reservedChars = "=," )
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 11.8K bytes - Viewed (0) -
docs/es/docs/features.md
* Diseñado alrededor de estos estándares, tras un estudio meticuloso. En lugar de ser una capa adicional. * Esto también permite el uso de **generación de código cliente automática** en muchos idiomas. ### Documentación automática { #automatic-docs }Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Wed Dec 17 10:15:01 UTC 2025 - 10.8K bytes - Viewed (0) -
cmd/benchmark-utils_test.go
} // randomly picks a character and returns its equivalent byte array. func getRandomByte() []byte { const letterBytes = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ" // seeding the random number generator. rand.Seed(UTCNow().UnixNano()) // pick a character randomly. return []byte{letterBytes[rand.Intn(len(letterBytes))]} } // picks a random byte and repeats it to size bytes.
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 8.1K bytes - Viewed (0) -
docs/de/README.md
## Website [fess.codelibs.org](https://fess.codelibs.org/) ## Probleme/Fragen [discuss.codelibs.org](https://discuss.codelibs.org/c/FessEN/) ## Erste Schritte
Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Tue Nov 11 22:42:32 UTC 2025 - 7.8K bytes - Viewed (0) -
docs/zh-CN/README.md
*[Fess 网站搜索](https://github.com/codelibs/fess-site-search)* 是 [Google 网站搜索](https://enterprise.google.com/search/products/gss.html)的免费替代品。更多详情请参阅 [FSS JS 生成器文档](https://fss-generator.codelibs.org/docs/manual)。 ## 官网 [fess.codelibs.org](https://fess.codelibs.org/) ## 问题/疑问 [discuss.codelibs.org](https://discuss.codelibs.org/c/FessEN/) ## 入门
Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Tue Nov 11 22:42:32 UTC 2025 - 7K bytes - Viewed (0) -
src/main/java/jcifs/smb/PreauthIntegrityService.java
this(new SecureRandom(), DEFAULT_HASH_ALGORITHM, true); } /** * Constructs a PreauthIntegrityService with specified configuration. * * @param secureRandom the secure random generator * @param hashAlgorithm the hash algorithm to use * @param enforceIntegrity whether to enforce integrity checks */
Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Sun Aug 31 08:00:57 UTC 2025 - 12.1K bytes - Viewed (0) -
docs/en/docs/js/termynal.js
div.innerHTML = `<span ${this._attributes(line)}>${line.value || ''}</span>`; return div.firstElementChild; }); } /** * Helper function for generating attributes string. * * @param {Object} line - Line data object. * @returns {string} - String of attributes. */ _attributes(line) { let attrs = '';Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Sun Aug 31 10:32:57 UTC 2025 - 9.3K bytes - Viewed (0) -
docs/sts/README.md
- Temporary credentials have a limited lifetime, there is no need to rotate them or explicitly revoke them. Expired temporary credentials cannot be reused. ## Identity Federation | AuthN | Description |
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Tue Aug 12 18:20:36 UTC 2025 - 7.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/Crc32cHashFunctionTest.java
assertEquals( String.format("expected: %08x, actual: %08x", expectedCrc, actualCrc), expectedCrc, actualCrcHasher); } // From RFC 3720, Section 12.1, the polynomial generator is 0x11EDC6F41. // We calculate the constant below by: // 1. Omitting the most significant bit (because it's always 1). => 0x1EDC6F41
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 6.6K bytes - Viewed (0) -
guava/src/com/google/common/hash/BloomFilterStrategies.java
import java.util.Arrays; import java.util.concurrent.atomic.AtomicLongArray; import java.util.concurrent.atomic.LongAdder; import org.jspecify.annotations.Nullable; /** * Collections of strategies of generating the k * log(M) bits required for an element to be mapped * to a BloomFilter of M bits and k hash functions. These strategies are part of the serialized form
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Wed Jan 08 14:27:16 UTC 2025 - 10.7K bytes - Viewed (0)