- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 339 for Sizes (0.05 sec)
-
test/fixedbugs/bug122.go
// Copyright 2009 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. package main func main() { // should allow at most 2 sizes a := make([]int, 10, 20, 30, 40); // ERROR "too many|expects 2 or 3 arguments; found 5" _ = a
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 28 18:13:13 UTC 2023 - 334 bytes - Viewed (0) -
src/cmd/compile/internal/test/testdata/gen/zeroGen.go
// zero the data they are supposed to and clobber no adjacent values. // run as `go run zeroGen.go`. A file called zero.go // will be written into the parent directory containing the tests. var sizes = [...]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 15, 16, 17, 23, 24, 25, 31, 32, 33, 63, 64, 65, 1023, 1024, 1025} var usizes = [...]int{8, 16, 24, 32, 64, 256} func main() { w := new(bytes.Buffer)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Sep 20 02:13:02 UTC 2022 - 4.1K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/experimental/remat/rematerializer.h
public: Rematerializer() = default; virtual ~Rematerializer() = default; // The type used for memory sizes (in bytes) and differences thereof. using SizeT = int64_t; // The memory profile: The i-th element gives the amount of memory // that is needed when performing the i-th operation. This is the // sum of the sizes of // // (1) input tensors of that operation, // (2) output tensors of that operation,
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 14 20:57:44 UTC 2023 - 12K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/storage/etcd3/store_test.go
args: args{v: reflect.ValueOf([]example.Pod{}), maxCapacity: 10, sizes: []int{1, 12}}, cap: 10, }, { name: "takes max", args: args{v: reflect.ValueOf([]example.Pod{}), maxCapacity: 10, sizes: []int{8, 4}}, cap: 8, }, { name: "with existing capacity above max", args: args{initialCapacity: 12, maxCapacity: 10, sizes: []int{8, 4}}, cap: 12, }, {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Jun 11 12:45:33 UTC 2024 - 26.5K bytes - Viewed (0) -
src/hash/crc64/crc64.go
buildSlicing8TablesOnce() crc = ^crc // Table comparison is somewhat expensive, so avoid it for small sizes for len(p) >= 64 { var helperTable *[8]Table if *tab == slicing8TableECMA[0] { helperTable = slicing8TableECMA } else if *tab == slicing8TableISO[0] { helperTable = slicing8TableISO // For smaller sizes creating extended table takes too much time } else if len(p) >= 2048 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat May 18 22:36:41 UTC 2024 - 5.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow_to_stablehlo/python/pywrap_tensorflow_to_stablehlo.cc
* input-arg-shapes: A string representation of input argument shapes for 'main' entry-point, separating tensors with ':', dimension with ',', and using '?' for unknown sizes. For example, 'input-arg-shapes=1,2::1,?' expresses argument shapes [1,2], [] and [1,?]. )pbdoc", py::arg("input_path"), py::arg("exported_model_signatures") =
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue May 21 22:58:42 UTC 2024 - 4.2K bytes - Viewed (0) -
cmd/data-scanner.go
sizeS.failedSize += oi.Size sizeS.failedCount++ case replication.Completed, replication.CompletedLegacy: tgtSizeS.replicatedSize += oi.Size tgtSizeS.replicatedCount++ sizeS.replicatedSize += oi.Size sizeS.replicatedCount++ } sizeS.replTargetStats[arn] = tgtSizeS } if oi.ReplicationStatus == replication.Replica { sizeS.replicaSize += oi.Size sizeS.replicaCount++ }
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri Jun 07 15:43:17 UTC 2024 - 47.6K bytes - Viewed (0) -
tensorflow/compiler/mlir/tfrt/analysis/cost_analysis.cc
} // These ops are cheap regardless of their input sizes. // // TODO(chky): Find a more scalable way to figure out cheap ops. if (llvm::isa<mlir::TF::ShapeOp, mlir::TF::StridedSliceOp, mlir::TF::ReshapeOp, mlir::TF::ExpandDimsOp>(op)) { cost_map_[op] = kDefaultCheapCost; return; } // For other ops, use the sum of input sizes as its cost. int64_t cost = kDefaultCheapCost;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 7.6K bytes - Viewed (0) -
test/fixedbugs/issue28079b.go
// Copyright 2018 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. // Non-Go-constant but constant values aren't ok for array sizes. package p import "unsafe" type T [uintptr(unsafe.Pointer(nil))]int // ERROR "non-constant array bound|array bound is not constant|must be constant" func f() {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jan 11 02:26:58 UTC 2022 - 547 bytes - Viewed (0) -
src/sort/sort_test.go
func countOps(t *testing.T, algo func(Interface), name string) { sizes := countOpsSizes if testing.Short() { sizes = sizes[:5] } if !testing.Verbose() { t.Skip("Counting skipped as non-verbose mode.") } for _, n := range sizes { td := testingData{ desc: name, t: t, data: make([]int, n), maxswap: 1<<31 - 1, }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 07 19:41:04 UTC 2024 - 16.9K bytes - Viewed (0)