- Sort Score
- Num 10 results
- Language All
Results 61 - 70 of 130 for hara (0.02 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
docs/en/data/github_sponsors.yml
- login: mntolia avatarUrl: https://avatars.githubusercontent.com/u/10390224?v=4 url: https://github.com/mntolia - login: hard-coders avatarUrl: https://avatars.githubusercontent.com/u/9651103?u=78d12d1acdf853c817700145e73de7fd9e5d068b&v=4 url: https://github.com/hard-coders - login: DMantis avatarUrl: https://avatars.githubusercontent.com/u/9536869?u=652dd0d49717803c0cbcbf44f7740e53cf2d4892&v=4Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Fri Jan 02 06:46:57 GMT 2026 - 19.7K bytes - Click Count (0) -
docs/pt/docs/tutorial/response-model.md
/// `response_model` recebe o mesmo tipo que você declararia para um campo de modelo Pydantic, então, pode ser um modelo Pydantic, mas também pode ser, por exemplo, uma `list` de modelos Pydantic, como `List[Item]`. O FastAPI usará este `response_model` para fazer toda a documentação de dados, validação, etc. e também para **converter e filtrar os dados de saída** para sua declaração de tipo. /// tip | Dica
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 19 18:20:43 GMT 2026 - 16.7K bytes - Click Count (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{
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 7.7K bytes - Click Count (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?
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Tue Aug 12 18:20:36 GMT 2025 - 4.2K bytes - Click Count (0) -
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
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Tue Nov 04 19:13:52 GMT 2025 - 35.5K bytes - Click Count (0) -
docs/tr/docs/how-to/migrate-from-pydantic-v1-to-pydantic-v2.md
## Testler { #tests } Uygulamanız için [testleriniz](../tutorial/testing.md) olduğundan ve bunları continuous integration (CI) üzerinde çalıştırdığınızdan emin olun. Bu şekilde yükseltmeyi yapabilir ve her şeyin hâlâ beklendiği gibi çalıştığını doğrulayabilirsiniz. ## `bump-pydantic` { #bump-pydantic }Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Fri Mar 20 07:53:17 GMT 2026 - 6K bytes - Click Count (0) -
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.
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Tue Aug 12 18:20:36 GMT 2025 - 8.7K bytes - Click Count (0) -
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,Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Mon Dec 15 16:34:13 GMT 2025 - 40.2K bytes - Click Count (0) -
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
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Apr 25 05:41:04 GMT 2025 - 10.1K bytes - Click Count (0) -
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
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 8.5K bytes - Click Count (0)