- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 1,104 for iterations (0.27 sec)
-
src/crypto/internal/nistec/p224.go
// ScalarMult, but in this case the doublings are precomputed. The value // [windowValue]G added at iteration k would normally get doubled // (totIterations-k)×4 times, but with a larger precomputation we can // instead add [2^((totIterations-k)×4)][windowValue]G and avoid the // doublings between iterations. t := NewP224Point() p.Set(NewP224Point()) tableIndex := len(tables) - 1 for _, byte := range scalar {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Aug 12 00:04:29 UTC 2022 - 15.9K bytes - Viewed (0) -
src/crypto/internal/nistec/p521.go
// ScalarMult, but in this case the doublings are precomputed. The value // [windowValue]G added at iteration k would normally get doubled // (totIterations-k)×4 times, but with a larger precomputation we can // instead add [2^((totIterations-k)×4)][windowValue]G and avoid the // doublings between iterations. t := NewP521Point() p.Set(NewP521Point()) tableIndex := len(tables) - 1 for _, byte := range scalar {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Aug 12 00:04:29 UTC 2022 - 17K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/cluster_ops_by_policy.cc
} // Sort matched operations by their position in the block. llvm::sort(cluster.operations, [](Operation *a, Operation *b) -> bool { return a->isBeforeInBlock(b); }); // Create tf_device::ClusterOp before the last operation in the block that // is a part of a match set. auto back = cluster.operations.back(); auto loc = back->getLoc(); OpBuilder builder(back);
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 27.9K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/experimental/remat/rematerializer_test.cc
for (int i = 0; i < 1024; ++i) { RandomRemat remat(kNumOperations, kNumTensors, kNumUses, rng); // Worst-case scenario: we might double the length of the computation // schedule each time we remat, so only a few iterations... std::array<int, 3> randos; const auto& [begin, end, insert] = randos; for (int i = 0, num_operations = kNumOperations; i < 4; ++i, num_operations += end - begin) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 14 20:57:44 UTC 2023 - 19.1K bytes - Viewed (0) -
src/go/ast/filter.go
func MergePackageFiles(pkg *Package, mode MergeMode) *File { // Count the number of package docs, comments and declarations across // all package files. Also, compute sorted list of filenames, so that // subsequent iterations can always iterate in the same order. ndocs := 0 ncomments := 0 ndecls := 0 filenames := make([]string, len(pkg.Files)) var minPos, maxPos token.Pos i := 0 for filename, f := range pkg.Files {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 13.3K bytes - Viewed (0) -
pkg/kubelet/cm/cpumanager/cpu_assignment.go
numas := acc.sortAvailableNUMANodes() // Calculate the minimum and maximum possible number of NUMA nodes that // could satisfy this request. This is used to optimize how many iterations // of the loop we need to go through below. minNUMAs, maxNUMAs := acc.rangeNUMANodesNeededToSatisfy(cpuGroupSize) // Try combinations of 1,2,3,... NUMA nodes until we find a combination
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Jan 25 23:56:21 UTC 2024 - 36.3K bytes - Viewed (0) -
src/vendor/golang.org/x/crypto/internal/poly1305/sum_s390x.s
// (m[16:32]r² + m[48:64])r <- lane 1 // ^ ^ // | coefficients for second iteration // coefficients for first iteration // // So in this case we would have two iterations. In the first // both lanes are multiplied by r². In the second only the // first lane is multiplied by r² and the second lane is
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:33 UTC 2023 - 17.5K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/plugin/pkg/authorizer/webhook/webhook_v1_test.go
context: cluster: foobar user: a name current-context: default `, wantErr: true, }, } for _, tt := range tests { // Use a closure so defer statements trigger between loop iterations. err := func() error { tempfile, err := ioutil.TempFile("", "") if err != nil { return err } p := tempfile.Name() defer utiltesting.CloseAndRemove(t, tempfile)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Apr 24 18:25:29 UTC 2024 - 43.2K bytes - Viewed (0) -
src/text/template/doc.go
{{break}} The innermost {{range pipeline}} loop is ended early, stopping the current iteration and bypassing all remaining iterations. {{continue}} The current iteration of the innermost {{range pipeline}} loop is stopped, and the loop starts the next iteration. {{template "name"}} The template with the specified name is executed with nil data. {{template "name" pipeline}}
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Feb 24 21:59:12 UTC 2024 - 17.9K bytes - Viewed (0) -
src/crypto/internal/nistec/p256.go
// ScalarMult, but in this case the doublings are precomputed. The value // [windowValue]G added at iteration k would normally get doubled // (totIterations-k)×4 times, but with a larger precomputation we can // instead add [2^((totIterations-k)×4)][windowValue]G and avoid the // doublings between iterations. t := NewP256Point() p.Set(NewP256Point()) tableIndex := len(tables) - 1 for _, byte := range scalar {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:29:44 UTC 2024 - 17.2K bytes - Viewed (0)