- Sort Score
- Num 10 results
- Language All
Results 71 - 80 of 133 for benchmark (0.07 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
cmd/object-api-utils_test.go
} } return path.Join(elem...) + trailingSlash } func concatNaive(ss ...string) string { rs := ss[0] for i := 1; i < len(ss); i++ { rs += ss[i] } return rs } func benchmark(b *testing.B, data []string) { b.Run("concat naive", func(b *testing.B) { b.ResetTimer() b.ReportAllocs() for b.Loop() { concatNaive(data...) } }) b.Run("concat fast", func(b *testing.B) {
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 24.1K bytes - Click Count (0) -
android/guava-tests/benchmark/com/google/common/base/EnumsBenchmark.java
* See the License for the specific language governing permissions and * limitations under the License. */ package com.google.common.base; import com.google.caliper.BeforeExperiment; import com.google.caliper.Benchmark; import com.google.caliper.Param; import java.util.ArrayList; import java.util.Collections; import java.util.List; import org.jspecify.annotations.NullUnmarked;
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 29.4K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/SortedLists.java
checkNotNull(list); checkNotNull(presentBehavior); checkNotNull(absentBehavior); if (!(list instanceof RandomAccess)) { list = new ArrayList<>(list); } // TODO(lowasser): benchmark when it's best to do a linear search int lower = 0; int upper = list.size() - 1; while (lower <= upper) { int middle = (lower + upper) >>> 1;
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Sun Dec 22 03:38:46 GMT 2024 - 10.9K bytes - Click Count (0) -
internal/config/storageclass/storage-class.go
return cfg, err } if inlineBlock > 128*humanize.KiByte { configLogOnceIf(context.Background(), fmt.Errorf("inline block value bigger than recommended max of 128KiB -> %s, performance may degrade for PUT please benchmark the changes", inlineBlockStr), inlineBlockStr) } cfg.inlineBlock = int64(inlineBlock) } else { cfg.inlineBlock = 128 * humanize.KiByte } cfg.initialized = true return cfg, nil }
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 12.3K bytes - Click Count (0) -
cmd/utils.go
// provide any API to calculate the profiler file path in the // disk since the name of this latter is randomly generated. type profilerWrapper struct { // Profile recorded at start of benchmark. records map[string][]byte stopFn func() ([]byte, error) ext string } // record will record the profile and store it as the base.Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 33K bytes - Click Count (0) -
configure.py
] # List of files to configure when building Bazel on Apple platforms. APPLE_BAZEL_FILES = [ 'tensorflow/lite/ios/BUILD', 'tensorflow/lite/objc/BUILD', 'tensorflow/lite/swift/BUILD', 'tensorflow/lite/tools/benchmark/experimental/ios/BUILD' ] # List of files to move when building for iOS. IOS_FILES = [ 'tensorflow/lite/objc/TensorFlowLiteObjC.podspec', 'tensorflow/lite/swift/TensorFlowLiteSwift.podspec', ]Created: Tue Dec 30 12:39:10 GMT 2025 - Last Modified: Wed Apr 30 15:18:54 GMT 2025 - 48.3K bytes - Click Count (0) -
cmd/object-api-listobjects_test.go
return obj } // BenchmarkListObjects - Run ListObject Repeatedly and benchmark. func BenchmarkListObjects(b *testing.B) { // Make a temporary directory to use as the obj. directory := b.TempDir() // Create the obj. obj := initFSObjectsB(directory, b) bucket := "ls-benchmark-bucket" // Create a bucket. err := obj.MakeBucket(b.Context(), bucket, MakeBucketOptions{})
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Oct 10 18:57:03 GMT 2025 - 76.1K bytes - Click Count (0) -
guava/src/com/google/common/collect/CompactHashMap.java
* world. Figure out what sort of space-time tradeoff we're actually going to get here with the * *Map variants. This class is particularly hard to benchmark, because the benefit is not only in * less allocation, but also having the GC do less work to scan the heap because of fewer * references, which is particularly hard to quantify. */
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Jul 08 18:32:10 GMT 2025 - 39.6K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/CompactHashMap.java
* world. Figure out what sort of space-time tradeoff we're actually going to get here with the * *Map variants. This class is particularly hard to benchmark, because the benefit is not only in * less allocation, but also having the GC do less work to scan the heap because of fewer * references, which is particularly hard to quantify. */
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Sat Aug 09 01:14:59 GMT 2025 - 35.7K bytes - Click Count (0) -
docs/es/docs/benchmarks.md
# Benchmarks { #benchmarks } Los benchmarks independientes de TechEmpower muestran aplicaciones de **FastAPI** ejecutándose bajo Uvicorn como <a href="https://www.techempower.com/benchmarks/#section=test&runid=7464e520-0dc2-473d-bd34-dbdfd7e85911&hw=ph&test=query&l=zijzen-7" class="external-link" target="_blank">uno de los frameworks de Python más rápidos disponibles</a>, solo por debajo de Starlette y Uvicorn en sí mismos (utilizados internamente por FastAPI).Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Tue Dec 16 16:33:45 GMT 2025 - 3.8K bytes - Click Count (0)