- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 382 for Sizes (0.41 sec)
-
guava-testlib/src/com/google/common/collect/testing/testers/ListEqualsTester.java
assertFalse( "Lists of different sizes should not be equal.", getList().equals(new ArrayList<E>(fewerElements))); } public void testEquals_longerList() { Collection<E> moreElements = getSampleElements(getNumElements() + 1); assertFalse( "Lists of different sizes should not be equal.", getList().equals(new ArrayList<E>(moreElements))); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Jan 09 20:10:38 UTC 2018 - 3.5K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/testers/SetEqualsTester.java
assertFalse( "Sets of different sizes should not be equal.", getSet().equals(MinimalSet.from(fewerElements))); } public void testEquals_largerSet() { Collection<E> moreElements = getSampleElements(getNumElements() + 1); assertFalse( "Sets of different sizes should not be equal.", getSet().equals(MinimalSet.from(moreElements))); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Jan 09 20:10:38 UTC 2018 - 3.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) -
build-logic/performance-testing/src/main/groovy/gradlebuild/performance/generator/DependencyGenerator.groovy
* dependencies to projects in lower layers. The sizes of different layers are created so that * the first and last layers are the smallest and the layers in the middle are the largest. * * For example when numberOfProjects = 150, 10 layers will be created with sizes of * [1, 2, 6, 16, 50, 50, 16, 6, 2, 1] *
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Dec 09 08:14:05 UTC 2020 - 5.2K 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) -
src/runtime/memmove_plan9_amd64.s
TEXT runtime·memmove(SB), NOSPLIT, $0-24 MOVQ to+0(FP), DI MOVQ from+8(FP), SI MOVQ n+16(FP), BX // REP instructions have a high startup cost, so we handle small sizes // with some straightline code. The REP MOVSQ instruction is really fast // for large sizes. The cutover is approximately 1K. tail: TESTQ BX, BX JEQ move_0 CMPQ BX, $2 JBE move_1or2 CMPQ BX, $4 JBE move_3or4 CMPQ BX, $8 JB move_5through7
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jun 04 07:25:06 UTC 2020 - 3K bytes - Viewed (0)