- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 159 for ancestors (0.5 sec)
-
subprojects/core/src/main/java/org/gradle/execution/plan/ExecutionNodeAccessHierarchy.java
* * That includes node which access ancestors or children of the location. */ public ImmutableSet<Node> getNodesAccessing(String location) { return visitValues(location, new CollectingNodeAccessVisitor()); } /** * Visits all nodes which access the location. * * That includes node which access ancestors or children of the location. */
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Sep 12 20:10:34 UTC 2022 - 6.9K bytes - Viewed (0) -
src/mdo/model-version.vm
#set ( $isAsso = false ) #if ( $field.toClass ) #set ( $ancestors = $Helper.ancestors( $field.toClass ) ) #foreach ( $cl in $ancestors ) #if ( $classToFields.containsKey( $cl ) ) #set ( $isAsso = true ) #end
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Mon Oct 16 13:44:33 UTC 2023 - 7.4K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/tests/prepare_tpu_computation_for_tf_export.mlir
} // CHECK-LABEL: @RewriteHostComputeMlirOp func.func @RewriteHostComputeMlirOp(%arg0: tensor<*xf32>, %arg1: tensor<3x?xf64>) -> (tensor<*xf32>) { // CHECK: "tf.XlaHostCompute"(%arg0, %arg1) // CHECK-SAME: ancestors = [] // CHECK-SAME: cost_estimate_ns = 1000000 : i64 // CHECK-SAME: key = "" // CHECK-SAME: recv_key = "host_compute_channel_recv" // CHECK-SAME: send_key = "host_compute_channel_send"
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Feb 14 18:46:36 UTC 2024 - 9.2K bytes - Viewed (0) -
src/mdo/transformer.vm
return transformer.apply(value); } #foreach ( $class in $model.allClasses ) #if ( $class.name != "InputSource" && $class.name != "InputLocation" ) #set ( $ancestors = $Helper.ancestors( $class ) ) #set ( $allFields = $Helper.xmlFields( $class ) ) protected ${class.name} transform${class.name}(${class.name} target) { if (target == null) { return null; }
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Wed Apr 03 17:49:40 UTC 2024 - 7.6K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/flatbuffer_import.h
// If `use_external_constant` is true, it will create `tfl.external_const` // instead of `tfl.const`. // If `experimental_prune_unreachable_nodes_unconditionally` is true, nodes that // are not ancestors of the output nodes will be pruned. mlir::OwningOpRef<mlir::ModuleOp> FlatBufferToMlir( absl::string_view buffer, mlir::MLIRContext* context, mlir::Location base_loc, bool use_external_constant = false,
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Mar 14 19:15:40 UTC 2024 - 2.3K bytes - Viewed (0) -
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. type lcaRange struct {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 30 21:52:15 UTC 2023 - 3.8K bytes - Viewed (0) -
platforms/software/testing-base/src/test/groovy/org/gradle/api/internal/tasks/testing/logging/AbstractTestLoggerTest.groovy
then: textOutputFactory.toString() == "{TestEventLogger}{INFO}${sep}a test {failure}FAILED{normal}${sep}" } def "logging of atomic test whose ancestors don't have a test class"() { createLogger(LogLevel.INFO) def testSuiteDescriptor = new SimpleTestDescriptor(name: "Tests", displayName: "Tests", className: null, composite: true, parent: workerDescriptor)
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Sep 18 20:52:40 UTC 2023 - 7.3K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/flatbuffer_translate.cc
// the operations. // NOLINTNEXTLINE static opt<bool, true> experimental_prune_unreachable_nodes_unconditionally_flg( "experimental-prune-unreachable-nodes-unconditionally", llvm::cl::desc("Prune nodes that are not ancestors of the output nodes."), llvm::cl::location(experimental_prune_unreachable_nodes_unconditionally), llvm::cl::init(false)); // NOLINTNEXTLINE static opt<std::string> input_arrays_flag( "input-arrays",
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Mar 14 19:15:40 UTC 2024 - 9.4K bytes - Viewed (0) -
src/compress/flate/huffman_code.go
// be a legitimate value that never gets chosen. var levels [maxBitsLimit]levelInfo // leafCounts[i] counts the number of literals at the left // of ancestors of the rightmost node at level i. // leafCounts[i][j] is the number of literals at the left // of the level j ancestor. var leafCounts [maxBitsLimit][maxBitsLimit]int32 for level := int32(1); level <= maxBits; level++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 9.7K bytes - Viewed (0) -
build-logic-commons/basics/src/main/kotlin/gradlebuild/basics/accessors/accessors.kt
* limitations under the License. */ @file:Suppress("deprecation") package gradlebuild.basics.accessors import org.gradle.api.Project import org.gradle.api.file.SourceDirectorySet import org.gradle.kotlin.dsl.* import org.jetbrains.kotlin.gradle.dsl.KotlinJvmProjectExtension // TODO these accessors should be generated - https://github.com/gradle/gradle/issues/3191
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Feb 12 13:19:06 UTC 2024 - 1.1K bytes - Viewed (0)