- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 112 for linear_1 (0.2 sec)
-
platforms/documentation/docs/src/snippets/kotlinDsl/androidSingleBuild/kotlin/src/main/res/drawable-v24/ic_launcher_foreground.xml
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Nov 27 17:53:42 UTC 2023 - 1.8K bytes - Viewed (0) -
platforms/documentation/docs/src/samples/templates/java-android-application/app/src/main/res/drawable-v24/ic_launcher_foreground.xml
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Nov 27 17:53:42 UTC 2023 - 1.8K bytes - Viewed (0) -
platforms/documentation/docs/src/samples/templates/java-android-application/src/main/res/drawable-v24/ic_launcher_foreground.xml
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Nov 27 17:53:42 UTC 2023 - 1.8K bytes - Viewed (0) -
platforms/documentation/docs/src/snippets/kotlinDsl/androidBuild/kotlin/app/src/main/res/drawable-v24/ic_launcher_foreground.xml
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Nov 27 17:53:42 UTC 2023 - 1.8K bytes - Viewed (0) -
platforms/core-execution/snapshots/src/main/java/org/gradle/internal/snapshot/ChildMapFactory.java
import java.util.ArrayList; import java.util.Collection; import java.util.Comparator; import java.util.List; public class ChildMapFactory { /** * If a node has fewer children, we use a linear search for the child. * We use this limit since {@link VfsRelativePath#compareToFirstSegment(String, CaseSensitivity)} * is about twice as slow as {@link VfsRelativePath#hasPrefix(String, CaseSensitivity)},
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 22 09:34:50 UTC 2023 - 2.6K bytes - Viewed (0) -
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) -
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) -
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/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) -
src/regexp/backtrack.go
// a bit vector with (length of input) * (length of prog) bits, // to make sure it never explores the same (character position, instruction) // state multiple times. This limits the search to run in time linear in // the length of the test. // // backtrack is a fast replacement for the NFA code on small // regexps when onepass cannot be used. package regexp import ( "regexp/syntax" "sync" )
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Sep 14 17:25:39 UTC 2023 - 8.8K bytes - Viewed (0)