- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 226 for slowTest (0.37 sec)
-
src/cmd/compile/internal/ssa/lca.go
package ssa import ( "math/bits" ) // Code to compute lowest common ancestors in the dominator tree. // https://en.wikipedia.org/wiki/Lowest_common_ancestor // https://en.wikipedia.org/wiki/Range_minimum_query#Solution_using_constant_time_and_linearithmic_space // lcaRange is a data structure that can compute lowest common ancestor queries // in O(n lg n) precomputed space and O(1) time per query.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 30 21:52:15 UTC 2023 - 3.8K bytes - Viewed (0) -
tensorflow/compiler/mlir/quantization/tensorflow/calibrator/calibration_statistics_collector_min_max.cc
// global_max will be updated by std::max(global_max, input_value) so it // is initialized with the value numeric_limits<float>::lowest(). min_max_statistics_.set_global_max(std::numeric_limits<float>::lowest()); } void CalibrationStatisticsCollectorMinMax::Collect( const float min, const float max, absl::Span<const int64_t> histogram) { min_max_statistics_.set_global_min(
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Apr 05 03:57:26 UTC 2024 - 2.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/TopKSelector.java
import org.checkerframework.checker.nullness.qual.Nullable; /** * An accumulator that selects the "top" {@code k} elements added to it, relative to a provided * comparator. "Top" can mean the greatest or the lowest elements, specified in the factory used to * create the {@code TopKSelector} instance. * * <p>If your input data is available as a {@link Stream}, prefer passing {@link
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 11.2K bytes - Viewed (0) -
src/runtime/libfuzzer_amd64.s
// ValueProfileMap.AddValue() truncates its argument to 16 bits and shifts the // PC to the left by log_2(128)=7, which means that only the lowest 16 - 7 bits // of the return address matter. String compare hooks use the lowest 12 bits, // but take the return address as an argument and thus don't require the // indirection through a trampoline.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 10 04:57:07 UTC 2023 - 5K bytes - Viewed (0) -
src/cmd/internal/obj/loong64/a.out.go
ALAST // aliases AJMP = obj.AJMP AJAL = obj.ACALL ARET = obj.ARET ) func init() { // The asm encoder generally assumes that the lowest 5 bits of the // REG_XX constants match the machine instruction encoding, i.e. // the lowest 5 bits is the register number. // Check this here. if REG_R0%32 != 0 { panic("REG_R0 is not a multiple of 32") } if REG_F0%32 != 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 02:04:54 UTC 2024 - 5.7K bytes - Viewed (0) -
platforms/ide/tooling-api/src/crossVersionTest/groovy/org/gradle/integtests/tooling/r24/BuildInvocationsCrossVersionSpec.groovy
import org.gradle.tooling.model.gradle.BuildInvocations class BuildInvocationsCrossVersionSpec extends ToolingApiSpecification { def "set task selector description taken from task with path that has lowest ordering"() { temporaryFolder.createFile('settings.gradle') << ''' rootProject.name = 'TestProject' include 'sub' ''' temporaryFolder.createFile('build.gradle') << '''
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Sep 26 14:49:20 UTC 2023 - 2.1K bytes - Viewed (0) -
guava/src/com/google/common/escape/ArrayBasedCharEscaper.java
* lies outside that, then {@link #escapeUnsafe} is called, otherwise no escaping is performed. * * @param replacementMap a map of characters to their escaped representations * @param safeMin the lowest character value in the safe range * @param safeMax the highest character value in the safe range */ protected ArrayBasedCharEscaper( Map<Character, String> replacementMap, char safeMin, char safeMax) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Jan 18 20:55:09 UTC 2022 - 6.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TopKSelector.java
import org.checkerframework.checker.nullness.qual.Nullable; /** * An accumulator that selects the "top" {@code k} elements added to it, relative to a provided * comparator. "Top" can mean the greatest or the lowest elements, specified in the factory used to * create the {@code TopKSelector} instance. * * <p>If your input data is available as an {@link Iterable} or {@link Iterator}, prefer {@link
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 11.2K bytes - Viewed (0) -
pilot/pkg/networking/core/loadbalancer/loadbalancer.go
// Afterwards the final priorities can be calculted from 0 (highest) to N (lowest) without skipping. priorityInt := int(loadAssignment.Endpoints[i].Priority*5) + priority loadAssignment.Endpoints[i].Priority = uint32(priorityInt) priorityMap[priorityInt] = append(priorityMap[priorityInt], i) } // since Priorities should range from 0 (highest) to N (lowest) without skipping. // 2. adjust the priorities in order
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Tue Apr 23 05:38:57 UTC 2024 - 11.8K bytes - Viewed (0) -
src/cmd/internal/pgo/pgo.go
// edge weight. type NamedEdgeMap struct { Weight map[NamedCallEdge]int64 // ByWeight lists all keys in Weight, sorted by edge weight from // highest to lowest. ByWeight []NamedCallEdge } func emptyProfile() *Profile { // Initialize empty maps/slices for easier use without a requiring a // nil check. return &Profile{ NamedEdgeMap: NamedEdgeMap{
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 27 20:20:01 UTC 2024 - 1.6K bytes - Viewed (0)