Search Options

Results per page
Sort
Preferred Languages
Advance

Results 11 - 20 of 21 for Constraint (0.18 sec)

  1. tensorflow/compiler/mlir/tensorflow/transforms/tf_passes.td

        as its predecessor. This is because the weight of cut edges is always
        minimized when the `Split` is with its predecessor. This colocation
        constraint will be used by the placer graph optimization to assign a device
        to the op.
    
        This pass should run in the export pipeline after tf-replicate-to-island so
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Wed Jun 12 21:18:05 UTC 2024
    - 99.6K bytes
    - Viewed (0)
  2. tensorflow/compiler/mlir/tensorflow/transforms/shape_inference.cc

      }
    
      if (auto host_compute_op = dyn_cast<XlaHostComputeOp>(op)) {
        return InferShapeForFunctionAttachedToXlaHostCompute(host_compute_op);
      }
    
      // TODO(jpienaar): Extract function input arg constraint interface.
      // TODO(jpienaar): Unify the shape propagation to functions using interface.
      if (auto map_dataset_op = dyn_cast<MapDatasetOp>(op)) {
        // TODO(jpienaar): The output type of these ops need to be refined.
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Sat Jun 08 07:28:49 UTC 2024
    - 134.1K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/cache/LocalCache.java

       * penalty of applying the batches is spread across threads so that the amortized cost is slightly
       * higher than performing just the operation without enforcing the capacity constraint.
       *
       * This implementation uses a per-segment queue to record a memento of the additions, removals,
       * and accesses that were performed on the map. The queue is drained on writes and when it exceeds
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Sat May 18 03:24:34 UTC 2024
    - 143.6K bytes
    - Viewed (0)
  4. guava/src/com/google/common/cache/LocalCache.java

       * penalty of applying the batches is spread across threads so that the amortized cost is slightly
       * higher than performing just the operation without enforcing the capacity constraint.
       *
       * This implementation uses a per-segment queue to record a memento of the additions, removals,
       * and accesses that were performed on the map. The queue is drained on writes and when it exceeds
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Sat May 18 03:24:34 UTC 2024
    - 149.2K bytes
    - Viewed (0)
  5. doc/go1.17_spec.html

    FieldName     = identifier .
    Element       = Expression | LiteralValue .
    </pre>
    
    <p>
    The LiteralType's underlying type must be a struct, array, slice, or map type
    (the grammar enforces this constraint except when the type is given
    as a TypeName).
    The types of the elements and keys must be <a href="#Assignability">assignable</a>
    to the respective field, element, and key types of the literal type;
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Apr 11 20:22:45 UTC 2024
    - 211.6K bytes
    - Viewed (0)
  6. src/cmd/go/internal/load/pkg.go

    	IgnoredGoFiles    []string `json:",omitempty"` // .go source files ignored due to build constraints
    	InvalidGoFiles    []string `json:",omitempty"` // .go source files with detected problems (parse error, wrong package name, and so on)
    	IgnoredOtherFiles []string `json:",omitempty"` // non-.go source files ignored due to build constraints
    	CFiles            []string `json:",omitempty"` // .c source files
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue May 28 17:00:51 UTC 2024
    - 120K bytes
    - Viewed (0)
  7. src/cmd/internal/obj/x86/asm6.go

    // least as high as a, which should be a power of two
    // and between 8 and 2048, inclusive.
    //
    // the boolean result indicates whether the alignment meets those constraints
    func requireAlignment(a int64, ctxt *obj.Link, cursym *obj.LSym) bool {
    	if !((a&(a-1) == 0) && 8 <= a && a <= 2048) {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 15 15:44:14 UTC 2024
    - 146.9K bytes
    - Viewed (0)
  8. pkg/controller/daemon/daemon_controller_test.go

    							Labels: simpleDaemonSetLabel,
    						},
    						Spec: resourcePodSpec("", "100M", "0.5"),
    					},
    				},
    			},
    			shouldRun:             shouldRun, // This is because we don't care about the resource constraints any more and let default scheduler handle it.
    			shouldContinueRunning: true,
    		},
    		{
    			predicateName: "ShouldRunDaemonPod",
    			podsOnNode: []*v1.Pod{
    				{
    					Spec: v1.PodSpec{
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Sat May 04 18:33:12 UTC 2024
    - 111.4K bytes
    - Viewed (0)
  9. tensorflow/compiler/mlir/lite/ir/tfl_ops.cc

      // refinement, so allow it to only be compatible. The op will be refined
      // during shape inference and casts inserted as needed to satisfy type
      // constraints of consumers.
      return succeeded(verifyCompatibleShapes(l, r));
    }
    
    namespace {
    struct FoldPseudoConstOp : public OpRewritePattern<ConstOp> {
      using OpRewritePattern<ConstOp>::OpRewritePattern;
    
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Thu May 02 09:41:17 UTC 2024
    - 169.2K bytes
    - Viewed (0)
  10. pkg/kubelet/kubelet.go

    	// In that case, be cautious when changing the constant, it must work with nodeMonitorGracePeriod
    	// in nodecontroller. There are several constraints:
    	// 1. nodeMonitorGracePeriod must be N times more than nodeStatusUpdateFrequency, where
    	//    N means number of retries allowed for kubelet to post node status. It is pointless
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Fri Jun 14 16:09:17 UTC 2024
    - 126.1K bytes
    - Viewed (0)
Back to top