- Sort Score
- Result 10 results
- Languages All
Results 311 - 320 of 420 for 32 (0.04 sec)
-
docs/en/docs/tutorial/security/oauth2-jwt.md
Import the modules installed. Create a random secret key that will be used to sign the JWT tokens. To generate a secure random secret key use the command: <div class="termy"> ```console $ openssl rand -hex 32 09d25e094faa6ca2556c818166b7a9563b93f7099f6f0f4caa6cf63b88e8d3e7 ``` </div> And copy the output to the variable `SECRET_KEY` (don't use the one in the example).
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sat Oct 26 11:45:10 UTC 2024 - 12.8K bytes - Viewed (0) -
cmd/object-api-options.go
"github.com/minio/minio/internal/hash" xhttp "github.com/minio/minio/internal/http" ) func getDefaultOpts(header http.Header, copySource bool, metadata map[string]string) (opts ObjectOptions, err error) { var clientKey [32]byte var sse encrypt.ServerSide opts = ObjectOptions{UserDefined: metadata} if v, ok := header[xhttp.MinIOSourceProxyRequest]; ok { opts.ProxyHeaderSet = true opts.ProxyRequest = strings.Join(v, "") == "true" }
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Wed Aug 21 21:13:59 UTC 2024 - 14.4K bytes - Viewed (0) -
internal/config/identity/ldap/ldap.go
[]string{}, // only need DN, so pass no attributes here nil, ) searchResult, err := conn.Search(searchRequest) if err != nil { // Object does not exist error? if ldap.IsErrorWithCode(err, 32) { ndn, err := ldap.ParseDN(dn) if err != nil { return nil, err } nonExistentUsers = append(nonExistentUsers, ndn.String()) continue } return nil, err }
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri Jul 12 01:04:53 UTC 2024 - 12.4K bytes - Viewed (0) -
src/cmd/asm/internal/asm/testdata/arm64enc.s
Registered: Tue Nov 05 11:13:11 UTC 2024 - Last Modified: Mon Jul 24 01:11:41 UTC 2023 - 43.9K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.19.md
- github.com/spf13/viper: [v1.3.2 → v1.4.0](https://github.com/spf13/viper/compare/v1.3.2...v1.4.0) - github.com/tmc/grpc-websocket-proxy: [89b8d40 → 0ad062e](https://github.com/tmc/grpc-websocket-proxy/compare/89b8d40...0ad062e) - go.opencensus.io: v0.21.0 → v0.22.2 - go.uber.org/atomic: v1.3.2 → v1.4.0 - golang.org/x/exp: 4b39c73 → da58074 - golang.org/x/image: 0694c2d → cff245a
Registered: Fri Nov 01 09:05:11 UTC 2024 - Last Modified: Wed Jan 05 05:42:32 UTC 2022 - 489.7K bytes - Viewed (0) -
cmd/server-main.go
2. Start single node server with 64 local drives "/mnt/data1" to "/mnt/data64". {{.Prompt}} {{.HelpName}} /mnt/data{1...64} 3. Start distributed MinIO server on an 32 node setup with 32 drives each, run following command on all the nodes {{.Prompt}} {{.HelpName}} http://node{1...32}.example.com/mnt/export{1...32}
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Tue Sep 24 21:50:11 UTC 2024 - 35.2K bytes - Viewed (2) -
docs/zh/docs/tutorial/security/oauth2-jwt.md
/// ## 处理 JWT 令牌 导入已安装的模块。 创建用于 JWT 令牌签名的随机密钥。 使用以下命令,生成安全的随机密钥: <div class="termy"> ```console $ openssl rand -hex 32 09d25e094faa6ca2556c818166b7a9563b93f7099f6f0f4caa6cf63b88e8d3e7 ``` </div> 然后,把生成的密钥复制到变量**SECRET_KEY**,注意,不要使用本例所示的密钥。 创建指定 JWT 令牌签名算法的变量 **ALGORITHM**,本例中的值为 `"HS256"`。 创建设置令牌过期时间的变量。
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 06 20:36:54 UTC 2024 - 11K bytes - Viewed (0) -
cmd/admin-handlers.go
size, err := strconv.Atoi(sizeStr) if err != nil { size = 64 * humanize.MiByte } concurrent, err := strconv.Atoi(concurrentStr) if err != nil { concurrent = 32 } duration, err := time.ParseDuration(durationStr) if err != nil { duration = time.Second * 10 } storageInfo := objectAPI.StorageInfo(ctx, false)
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri Oct 04 11:32:32 UTC 2024 - 99.7K bytes - Viewed (0) -
cmd/erasure-decode_test.go
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Tue Jan 30 20:43:25 UTC 2024 - 21.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableMap.java
alternatingKeysAndValues[outKeyIndex ^ 1] = value; } outI++; } return outI == n ? hashTable : new Object[] {hashTable, outI, duplicateKey}; } else { /* * Use 32 bits per entry. */ int[] hashTable = new int[tableSize]; Arrays.fill(hashTable, ABSENT); int outI = 0; entries: for (int i = 0; i < n; i++) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Apr 15 22:32:14 UTC 2024 - 22.7K bytes - Viewed (0)