- Sort Score
- Num 10 results
- Language All
Results 551 - 560 of 1,301 for jake (0.02 seconds)
-
docker-buildx.sh
#!/bin/bash set -ex function _init() { ## All binaries are static make sure to disable CGO. export CGO_ENABLED=0 export CRED_DIR="/media/${USER}/minio" ## List of architectures and OS to test coss compilation. SUPPORTED_OSARCH="linux/ppc64le linux/amd64 linux/arm64" remote=$(git remote get-url upstream) if test "$remote" != "******@****.***:minio/minio.git"; then
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Oct 19 08:22:05 GMT 2025 - 1.9K bytes - Click Count (0) -
docs/bucket/replication/sio-error.sh
#!/bin/bash echo "Running $0" set -e set -x export CI=1 make || exit 255 killall -9 minio || true rm -rf /tmp/xl/ mkdir -p /tmp/xl/1/ /tmp/xl/2/ export MINIO_KMS_SECRET_KEY="my-minio-key:OSMM+vkKUTCvQs9YL/CVMIMt43HFhkUpqJxTmGl6rYw=" NODES=4 args1=() args2=() for i in $(seq 1 $NODES); do args1+=("http://localhost:$((9000 + i))/tmp/xl/1/$i ") args2+=("http://localhost:$((9100 + i))/tmp/xl/2/$i ")Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sat May 18 18:19:01 GMT 2024 - 1.7K bytes - Click Count (0) -
docs/debugging/inspect/decrypt-v1.go
} stream, err := sio.AES_256_GCM.Stream(key) if err != nil { return err } // Zero nonce, we only use each key once, and 32 bytes is plenty. nonce := make([]byte, stream.NonceSize()) encr := stream.DecryptReader(r, nonce, nil) _, err = io.Copy(w, encr) if err == nil { fmt.Println(okMsg) } return err
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Thu Apr 11 21:22:47 GMT 2024 - 1.6K bytes - Click Count (0) -
cmd/bucket-replication-utils_gen.go
} case "brs": var zb0002 uint32 zb0002, err = dc.ReadMapHeader() if err != nil { err = msgp.WrapError(err, "TargetsMap") return } if z.TargetsMap == nil { z.TargetsMap = make(map[string]TargetReplicationResyncStatus, zb0002) } else if len(z.TargetsMap) > 0 { clear(z.TargetsMap) } for zb0002 > 0 { zb0002-- var za0001 string za0001, err = dc.ReadString()
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 59.3K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/SneakyThrows.java
@GwtCompatible final class SneakyThrows<T extends Throwable> { /** * Throws {@code t} as if it were an unchecked {@link Throwable}. * * <p>This method is useful primarily when we make a reflective call to a method with no {@code * throws} clause: Java forces us to handle an arbitrary {@link Throwable} from that method,
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Dec 30 18:44:22 GMT 2024 - 2.4K bytes - Click Count (0) -
android/guava/src/com/google/common/util/concurrent/SneakyThrows.java
@GwtCompatible final class SneakyThrows<T extends Throwable> { /** * Throws {@code t} as if it were an unchecked {@link Throwable}. * * <p>This method is useful primarily when we make a reflective call to a method with no {@code * throws} clause: Java forces us to handle an arbitrary {@link Throwable} from that method,
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Dec 30 18:44:22 GMT 2024 - 2.4K bytes - Click Count (0) -
cmd/endpoint-ellipses.go
// we also use uniform number of drives common across all ellipses patterns. func possibleSetCountsWithSymmetry(setCounts []uint64, argPatterns []ellipses.ArgPattern) []uint64 { newSetCounts := make(map[uint64]struct{}) for _, ss := range setCounts { var symmetry bool for _, argPattern := range argPatterns { for _, p := range argPattern { if uint64(len(p.Seq)) > ss {
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 14.7K bytes - Click Count (0) -
docs/LICENSE
other rights that a licensor has authority to grant. Use of the licensed material may still be restricted for other reasons, including because others have copyright or other rights in the material. A licensor may make special requests, such as asking that all changes be marked or described. Although not required by our licenses, you are encouraged to respect those requests where reasonable. More_considerationsCreated: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Mon May 10 16:50:06 GMT 2021 - 18.2K bytes - Click Count (0) -
internal/hash/checksum.go
continue } if len(res) == 0 { res = make([]map[string]string, parts) } b = b[n:] for part := 0; part < int(parts); part++ { if len(b) < length { break } // Read part checksum cs := base64.StdEncoding.EncodeToString(b[:length]) b = b[length:] if res[part] == nil { res[part] = make(map[string]string, 1) } res[part][typ.String()] = cs }
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Aug 22 14:15:21 GMT 2025 - 18.3K bytes - Click Count (0) -
CONTRIBUTING.md
Code Contributions ------------------ Get working code on a personal branch with tests passing before you submit a PR: ``` ./gradlew clean check ``` Please make every effort to follow existing conventions and style in order to keep the code as readable as possible. Contribute code changes through GitHub by forking the repository and sending a pull request. We
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Tue Feb 14 08:26:50 GMT 2023 - 2K bytes - Click Count (0)