- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 170 for linear_1 (0.32 sec)
-
platforms/core-configuration/model-core/src/main/java/org/gradle/api/internal/provider/FlatMapProvider.java
} // Note, that the potential side effect of the transformed provider // is going to be executed before this fixed side effect. // It is not possible to preserve linear execution order in the general case, // as the transformed provider can have side effects hidden under other wrapping providers. return Providers.internal(transformedProvider).withSideEffect(SideEffect.fixedFrom(value));
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Jan 17 23:22:41 UTC 2024 - 3.6K bytes - Viewed (0) -
guava/src/com/google/common/escape/ArrayBasedEscaperMap.java
// Returns the non-null array of replacements for fast lookup. char[][] getReplacementArray() { return replacementArray; } // Creates a replacement array from the given map. The returned array is a // linear lookup table of replacement character sequences indexed by the // original character value. @VisibleForTesting static char[][] createReplacementArray(Map<Character, String> map) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Jan 18 20:55:09 UTC 2022 - 3.2K bytes - Viewed (0) -
guava/src/com/google/common/math/LinearTransformation.java
import com.google.common.annotations.J2ktIncompatible; import com.google.errorprone.annotations.concurrent.LazyInit; import javax.annotation.CheckForNull; /** * The representation of a linear transformation between real numbers {@code x} and {@code y}. * Graphically, this is the specification of a straight line on a plane. The transformation can be
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 12 17:02:53 UTC 2023 - 9.6K bytes - Viewed (0) -
android/guava/src/com/google/common/escape/ArrayBasedEscaperMap.java
// Returns the non-null array of replacements for fast lookup. char[][] getReplacementArray() { return replacementArray; } // Creates a replacement array from the given map. The returned array is a // linear lookup table of replacement character sequences indexed by the // original character value. @VisibleForTesting static char[][] createReplacementArray(Map<Character, String> map) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Jan 18 20:55:09 UTC 2022 - 3.2K bytes - Viewed (0) -
tensorflow/compiler/jit/tests/device_compiler_test_helper.cc
#include "xla/service/hlo.pb.h" #include "tensorflow/core/platform/path.h" #include "tensorflow/core/public/session.h" namespace tensorflow { namespace { // Creates a float tensor of linearly increasing values, starting from offset. Tensor CreateInputTensor(const TensorShape& shape, float offset) { Tensor tensor(DT_FLOAT, shape); for (int64 i = 0; i < tensor.flat<float>().size(); ++i) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Feb 09 08:24:16 UTC 2024 - 6.2K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LinearTransformation.java
import com.google.common.annotations.J2ktIncompatible; import com.google.errorprone.annotations.concurrent.LazyInit; import javax.annotation.CheckForNull; /** * The representation of a linear transformation between real numbers {@code x} and {@code y}. * Graphically, this is the specification of a straight line on a plane. The transformation can be
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 12 17:02:53 UTC 2023 - 9.6K bytes - Viewed (0) -
tensorflow/compiler/jit/xla_tensor.cc
mutex_lock lock(mu_); if (!definition_event_) { return; } // The set of defined streams is expected to be very small indeed (usually // 1-2), so a simple linear scan should be fast enough. if (std::find(streams_defined_on_.begin(), streams_defined_on_.end(), stream) != streams_defined_on_.end()) { // stream is in streams_defined_on_; it doesn't need to be waited on.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 22 08:47:20 UTC 2024 - 4.5K bytes - Viewed (0) -
src/cmd/internal/obj/wasm/a.out.go
AEnd // opcode 0x0B ABr ABrIf ABrTable // ACall and AReturn are WebAssembly instructions. obj.ACALL and obj.ARET are higher level instructions // with Go semantics, e.g. they manipulate the Go stack on the linear memory. AReturn ACall ACallIndirect ADrop // opcode 0x1A ASelect ALocalGet // opcode 0x20 ALocalSet ALocalTee AGlobalGet AGlobalSet AI32Load // opcode 0x28 AI64Load
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 02 05:28:55 UTC 2023 - 4.3K bytes - Viewed (0) -
src/cmd/cover/testdata/main.go
fmt.Fprintf(os.Stderr, "bad after panic") PASS = false } } // count returns the count and index for the counter at the specified line. func count(line uint32) (uint32, int) { // Linear search is fine. Choose perfect fit over approximate. // We can have a closing brace for a range on the same line as a condition for an "else if" // and we don't want that brace to steal the count for the condition on the "if".
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Oct 04 16:40:40 UTC 2016 - 3K bytes - Viewed (0) -
src/net/http/mapping_test.go
"articles", } if len(children) != 32 { panic("bad len") } for _, n := range []int{2, 4, 8, 16, 32} { list := children[:n] b.Run(fmt.Sprintf("n=%d", n), func(b *testing.B) { b.Run("rep=linear", func(b *testing.B) { var entries []entry[string, any] for _, c := range list { entries = append(entries, entry[string, any]{c, nil}) } b.ResetTimer() for i := 0; i < b.N; i++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Sep 12 17:47:07 UTC 2023 - 2.9K bytes - Viewed (0)