Search Options

Results per page
Sort
Preferred Languages
Advance

Results 21 - 30 of 350 for hard (0.02 sec)

  1. 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 Sep 07 07:19:17 UTC 2025
    - Last Modified: Sat Jul 26 18:57:50 UTC 2025
    - 5.3K bytes
    - Viewed (0)
  2. 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 Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  3. 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 Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 5.5K bytes
    - Viewed (0)
  4. 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 Sep 07 19:28:11 UTC 2025
    - Last Modified: Wed Feb 26 19:26:13 UTC 2025
    - 7.7K bytes
    - Viewed (0)
  5. cmd/erasure-coding.go

    	return tillOffset
    }
    
    // erasureSelfTest performs a self-test to ensure that erasure
    // algorithms compute expected erasure codes. If any algorithm
    // produces an incorrect value it fails with a hard error.
    //
    // erasureSelfTest tries to catch any issue in the erasure implementation
    // early instead of silently corrupting data.
    func erasureSelfTest() {
    	// Approx runtime ~1ms
    	var testConfigs [][2]uint8
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 8.5K bytes
    - Viewed (0)
  6. docs/sts/wso2.md

    ### 2. Configure WSO2
    
    Once WSO2 is up and running, configure WSO2 to generate Self contained id_tokens. In OAuth 2.0 specification there are primarily two ways to provide id_tokens
    
    1. The id_token is an identifier that is hard to guess. For example, a randomly generated string of sufficient length, that the server handling the protected resource can use to lookup the associated authorization information.
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 8.7K bytes
    - Viewed (0)
  7. okhttp/src/jvmTest/kotlin/okhttp3/internal/ws/WebSocketHttpTest.kt

        val server = serverListener.assertOpen()
    
        // Initiate a close on the client, which will schedule a hard cancel in 500 ms.
        val closeAtNanos = System.nanoTime()
        webSocket.close(1000, "goodbye", 500L)
        serverListener.assertClosing(1000, "goodbye")
    
        // Confirm that the hard cancel occurred after 500 ms.
        clientListener.assertFailure()
        val elapsedUntilFailure = System.nanoTime() - closeAtNanos
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Fri Jun 20 11:46:46 UTC 2025
    - 35.5K bytes
    - Viewed (0)
  8. src/archive/tar/writer_test.go

    			testWrite{"hello\n", 6, nil},
    			testClose{nil},
    		},
    	}, {
    		// This file was produced using GNU tar v1.26:
    		//	echo "Slartibartfast" > file.txt
    		//	ln file.txt hard.txt
    		//	tar -b 1 --format=ustar -c -f hardlink.tar file.txt hard.txt
    		file: "testdata/hardlink.tar",
    		tests: []testFnc{
    			testHeader{Header{
    				Typeflag: TypeReg,
    				Name:     "file.txt",
    				Size:     15,
    				Mode:     0644,
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Mon Feb 03 16:38:43 UTC 2025
    - 39.8K bytes
    - Viewed (0)
  9. src/main/java/jcifs/smb/SmbTransportImpl.java

                }
            }
        }
    
        protected synchronized void doDisconnect(final boolean hard) throws IOException {
            doDisconnect(hard, false);
        }
    
        @Override
        protected synchronized boolean doDisconnect(final boolean hard, final boolean inUse) throws IOException {
            final ListIterator<SmbSessionImpl> iter = this.sessions.listIterator();
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 30 05:58:03 UTC 2025
    - 69.8K bytes
    - Viewed (0)
  10. cmd/naughty-disk_test.go

    	"io"
    	"sync"
    	"time"
    
    	"github.com/minio/madmin-go/v3"
    )
    
    // naughtyDisk wraps a POSIX disk and returns programmed errors
    // specified by the developer. The purpose is to simulate errors
    // that are hard to simulate in practice like DiskNotFound.
    // Programmed errors are stored in errors field.
    type naughtyDisk struct {
    	// The real disk
    	disk StorageAPI
    	// Programmed errors: API call number => error to return
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Apr 25 05:41:04 UTC 2025
    - 10.1K bytes
    - Viewed (0)
Back to top