- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 154 for Generating (0.16 sec)
-
internal/auth/credentials.go
// Maximum secret key length for MinIO, this // is used when autogenerating new credentials. // There is no max length enforcement for secret keys secretKeyMaxLen = 40 // Alpha numeric table used for generating access keys. alphaNumericTable = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ" // Total length of the alpha numeric table. alphaNumericTableLen = byte(len(alphaNumericTable)) reservedChars = "=," )
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Tue May 28 17:14:16 UTC 2024 - 12K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/translate/export_graphdef.cc
return arg.getParentRegion()->getParentOfType<FuncOp>().getName() == "main"; } // Creates argument nodes from Block argument. If a name is supplied, that // name will be used instead of generating a unique name. Status Exporter::AddArgumentNode(BlockArgument arg, unsigned index, llvm::StringRef name) { TF_ASSIGN_OR_RETURN(auto node_def, GetArgumentNode(arg, index, name));
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed May 01 11:17:36 UTC 2024 - 35.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/tf2xla/api/v2/tf_executor_to_graph.cc
return arg.getParentRegion()->getParentOfType<FuncOp>().getName() == "main"; } // Creates argument nodes from Block argument. If a name is supplied, that // name will be used instead of generating a unique name. Status Exporter::AddArgumentNode(BlockArgument arg, unsigned index, llvm::StringRef name) { TF_ASSIGN_OR_RETURN(auto node_def, GetArgumentNode(arg, index, name));
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Jun 06 23:04:51 UTC 2024 - 35.2K bytes - Viewed (0) -
pkg/istio-agent/agent.go
return nil, fmt.Errorf("failed to start istio tap server: %v", err) } } if a.cfg.GRPCBootstrapPath != "" { if err := a.generateGRPCBootstrap(); err != nil { return nil, fmt.Errorf("failed generating gRPC XDS bootstrap: %v", err) } } if a.proxyConfig.ControlPlaneAuthPolicy != mesh.AuthenticationPolicy_NONE { rootCAForXDS, err := a.FindRootCAForXDS() if err != nil {
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed Jun 05 10:02:56 UTC 2024 - 26.7K bytes - Viewed (0) -
docs/en/docs/advanced/custom-response.md
3. This `yield from` tells the function to iterate over that thing named `file_like`. And then, for each part iterated, yield that part as coming from this generator function. So, it is a generator function that transfers the "generating" work to something else internally. By doing it this way, we can put it in a `with` block, and that way, ensure that it is closed after finishing. !!! tip
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Thu Apr 18 19:53:19 UTC 2024 - 11.7K bytes - Viewed (0) -
platforms/documentation/docs/README.md
### h3 Some feature (i) This is some incubating feature. #### h4 Some detail This detail about the feature is collapsed. The reader can expand it if they are interested. ### Generating Run the `:docs:releaseNotes` task to generate the release notes. ## User Manual The source for the user manual lives @ `src/docs/userguide`, and is authored in [Asciidoctor](https://asciidoctor.org).
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Apr 17 21:49:03 UTC 2024 - 16.3K bytes - Viewed (0) -
analysis/analysis-api-standalone/analysis-api-standalone-base/src/org/jetbrains/kotlin/analysis/api/standalone/base/project/structure/StandaloneProjectFactory.kt
// 2) [CorePackageIndex#addToClasspath], which populates [PackageIndex]; and // 3) [FileIndexFacade#addLibraryRoot], which conflicts with this SOURCE root when generating a library scope. // Thus, here we manually call first two, which are used to: // 1) create [PsiPackage] as a package resolution result; and
Registered: Wed Jun 12 09:53:16 UTC 2024 - Last Modified: Tue Jun 04 22:09:27 UTC 2024 - 22.4K bytes - Viewed (0) -
src/crypto/internal/edwards25519/field/fe.go
// After the light reduction we now have a field element representation // v < 2^255 + 2^13 * 19, but need v < 2^255 - 19. // If v >= 2^255 - 19, then v + 19 >= 2^255, which would overflow 2^255 - 1, // generating a carry. That is, c will be 0 if v < 2^255 - 19, and 1 otherwise. c := (v.l0 + 19) >> 51 c = (v.l1 + c) >> 51 c = (v.l2 + c) >> 51 c = (v.l3 + c) >> 51 c = (v.l4 + c) >> 51
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 11.8K bytes - Viewed (0) -
platforms/jvm/language-java/src/integTest/groovy/org/gradle/api/tasks/compile/JavaCompileToolchainIntegrationTest.groovy
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon May 27 10:21:26 UTC 2024 - 23.4K bytes - Viewed (0) -
pkg/controller/garbagecollector/garbagecollector.go
logger.V(5).Info("item not found, generating a virtual delete event", "item", item.identity, ) gc.dependencyGraphBuilder.enqueueVirtualDeleteEvent(item.identity) return enqueuedVirtualDeleteEventErr case err != nil: return err } if latest.GetUID() != item.identity.UID { logger.V(5).Info("UID doesn't match, item not found, generating a virtual delete event", "item", item.identity, )
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat May 04 18:33:12 UTC 2024 - 32.9K bytes - Viewed (0)