- Sort Score
- Result 10 results
- Languages All
Results 171 - 180 of 254 for Ward (0.02 sec)
-
src/test/java/jcifs/smb1/smb1/SmbConstantsTest.java
* {@code SmbTransport} collaborator and is used only for * demonstration – the real class behaviour is not required for * validating constants. */ public class SmbConstantsTest { /** * Verify that the hard‑coded default values are present. */ @Test @DisplayName("Default constant values match expectations") void defaultValues() { assertEquals(445, SmbConstants.DEFAULT_PORT);Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 4.2K bytes - Viewed (0) -
docs/en/data/github_sponsors.yml
avatarUrl: https://avatars.githubusercontent.com/u/9536869?u=652dd0d49717803c0cbcbf44f7740e53cf2d4892&v=4 url: https://github.com/DMantis - login: hard-coders avatarUrl: https://avatars.githubusercontent.com/u/9651103?u=95db33927bbff1ed1c07efddeb97ac2ff33068ed&v=4 url: https://github.com/hard-coders - login: mntolia avatarUrl: https://avatars.githubusercontent.com/u/10390224?v=4 url: https://github.com/mntolia - login: ZuzahRegistered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Mon Dec 01 06:30:56 UTC 2025 - 20.1K bytes - Viewed (0) -
docs/erasure/README.md
Bit Rot, also known as data rot or silent data corruption is a data loss issue faced by disk drives today. Data on the drive may silently get corrupted without signaling an error has occurred, making bit rot more dangerous than a permanent hard drive failure. MinIO's erasure coded backend uses high speed [HighwayHash](https://github.com/minio/highwayhash) checksums to protect against Bit Rot. ## How are drives used for Erasure Code?
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Tue Aug 12 18:20:36 UTC 2025 - 4.2K bytes - Viewed (0) -
guava-testlib/src/com/google/common/testing/GcFinalization.java
* gigantic heap, in which case we scale by heap size. */ private static long timeoutSeconds() { // This class can make no hard guarantees. The methods in this class are inherently flaky, but // we try hard to make them robust in practice. We could additionally try to add in a system // load timeout multiplier. Or we could try to use a CPU time bound instead of wall clock time
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 11.5K bytes - Viewed (0) -
docs/fr/docs/tutorial/body-multiple-params.md
/// info `Body` possède les mêmes paramètres de validation additionnels et de gestion des métadonnées que `Query` et `Path`, ainsi que d'autres que nous verrons plus tard. /// ## Inclure un paramètre imbriqué dans le body Disons que vous avez seulement un paramètre `item` dans le body, correspondant à un modèle Pydantic `Item`.
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Sat Nov 09 11:10:17 UTC 2024 - 5.6K bytes - Viewed (0) -
cmd/bitrot.go
} } return nil } // bitrotSelfTest performs a self-test to ensure that bitrot // algorithms compute correct checksums. If any algorithm // produces an incorrect checksum it fails with a hard error. // // bitrotSelfTest tries to catch any issue in the bitrot implementation // early instead of silently corrupting data. func bitrotSelfTest() { checksums := map[BitrotAlgorithm]string{
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Sun Sep 28 20:59:21 UTC 2025 - 7.7K bytes - Viewed (0) -
src/main/webapp/js/admin/adminlte.min.js.map
nconst EVENT_REMOVED = `removed${EVENT_KEY}`\n\nconst CLASS_NAME_CARD = 'card'\nconst CLASS_NAME_COLLAPSED = 'collapsed-card'\nconst CLASS_NAME_COLLAPSING = 'collapsing-card'\nconst CLASS_NAME_EXPANDING = 'expanding-card'\nconst CLASS_NAME_WAS_COLLAPSED = 'was-collapsed'\nconst CLASS_NAME_MAXIMIZED = 'maximized-card'\n\nconst SELECTOR_DATA_REMOVE = '[data-card-widget=\"remove\"]'\nconst SELECTOR_DATA_COLLAPSE = '[data-card-widget=\"collapse\"]'\nconst SELECTOR_DATA_MAXIMIZE = '[data-card-widget=...Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Sat Oct 26 01:49:09 UTC 2024 - 132.4K bytes - Viewed (0) -
docs/kms/IAM.md
There used to be two different mechanisms - one for regular S3 objects and one for IAM data. - Reduced server startup time. For IAM encryption with the root credentials, MinIO had to use a memory-hard function (Argon2) that (on purpose) consumes a lot of memory and CPU. The new KMS-based approach can use a key derivation function that is orders of magnitudes cheaper w.r.t. memory and CPU.
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Thu Jan 18 07:03:17 UTC 2024 - 5.3K bytes - Viewed (0) -
docs/es/llm-prompt.md
* full-stack: full-stack (do not translate to "de pila completa") * stack: stack (do not translate to "pila") * loop (as in async loop): loop (do not translate to "bucle" or "ciclo") * hard dependencies: dependencias obligatorias (do not translate to "dependencias duras") * locking: locking (do not translate to "bloqueo") * testing (as in software testing): escribir pruebas (do not translate to "probar")
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Tue Dec 16 16:33:45 UTC 2025 - 5.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Platform.java
*/ /* * The new array contains nulls, even if the old array did not. If we wanted to be accurate, we * would declare a return type of `@Nullable T[]`. However, we've decided not to think too hard * about arrays for now, as they're a mess. (We previously discussed this in the review of * ObjectArrays, which is the main caller of this method.) */
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 5.3K bytes - Viewed (0)