Search Options

Results per page
Sort
Preferred Languages
Advance

Results 11 - 20 of 46 for rounds (0.23 sec)

  1. tensorflow/compiler/mlir/tensorflow/transforms/shape_inference.cc

        ArrayRef<int64_t> bounds = hlo::encodingToBounds(input_ty.getEncoding());
        // The input type has bounded dynamic dimension.
        if (!bounds.empty()) {
          SmallVector<int64_t> new_bounds(bounds.begin(), bounds.end());
          SmallVector<int64_t> new_shape(shape.begin(), shape.end());
          // If dimension of the input type is dynamic. Update the
          // bounds of the dim with the new type if needed.
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Sat Jun 08 07:28:49 UTC 2024
    - 134.1K bytes
    - Viewed (0)
  2. src/crypto/internal/nistec/fiat/p521_fiat64.go

    // p521CmovznzU64 is a single-word conditional move.
    //
    // Postconditions:
    //
    //	out1 = (if arg1 = 0 then arg2 else arg3)
    //
    // Input Bounds:
    //
    //	arg1: [0x0 ~> 0x1]
    //	arg2: [0x0 ~> 0xffffffffffffffff]
    //	arg3: [0x0 ~> 0xffffffffffffffff]
    //
    // Output Bounds:
    //
    //	out1: [0x0 ~> 0xffffffffffffffff]
    func p521CmovznzU64(out1 *uint64, arg1 p521Uint1, arg2 uint64, arg3 uint64) {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 05 21:53:03 UTC 2022
    - 167K bytes
    - Viewed (0)
  3. tensorflow/compiler/mlir/tensorflow/ir/tf_ops_n_z.cc

        auto canonicalize = [&](int64_t point, int c) {
          if (masks[c]) return stride_i > 0 ? bounds[c] : bounds[(c + 1) & 1];
    
          // Add dim as offset to negative range point.
          point = point < 0 ? dim_i + point : point;
          return Clamp(point, bounds[0], bounds[1]);
        };
    
        begin_i = canonicalize(begin_i, 0);
        end_i = canonicalize(end_i, 1);
    
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Thu May 09 22:07:10 UTC 2024
    - 170.8K bytes
    - Viewed (0)
  4. src/reflect/value.go

    		n := int((*arrayType)(unsafe.Pointer(v.typ())).Len)
    		return unsafe.Slice(p, n)
    	}
    	panic(&ValueError{"reflect.Value.Bytes", v.kind()})
    }
    
    // runes returns v's underlying value.
    // It panics if v's underlying value is not a slice of runes (int32s).
    func (v Value) runes() []rune {
    	v.mustBe(Slice)
    	if v.typ().Elem().Kind() != abi.Int32 {
    		panic("reflect.Value.Bytes of non-rune slice")
    	}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 22 21:17:41 UTC 2024
    - 119.9K bytes
    - Viewed (0)
  5. src/main/webapp/js/admin/popper.min.js.map

    nce.modifiers, 'hide', 'preventOverflow')) {\n    return data;\n  }\n\n  const refRect = data.offsets.reference;\n  const bound = find(\n    data.instance.modifiers,\n    modifier => modifier.name === 'preventOverflow'\n  ).boundaries;\n\n  if (\n    refRect.bottom < bound.top ||\n    refRect.left > bound.right ||\n    refRect.top > bound.bottom ||\n    refRect.right < bound.left\n  ) {\n    // Avoid unnecessary DOM access if visibility hasn't changed\n    if (data.hide === true) {\n      return...
    Registered: Wed Jun 12 13:08:18 UTC 2024
    - Last Modified: Fri Feb 07 10:28:50 UTC 2020
    - 121K bytes
    - Viewed (0)
  6. src/runtime/proc.go

    	}
    
    	// Remove m from allm.
    	lock(&sched.lock)
    	for pprev := &allm; *pprev != nil; pprev = &(*pprev).alllink {
    		if *pprev == mp {
    			*pprev = mp.alllink
    			goto found
    		}
    	}
    	throw("m not found in allm")
    found:
    	// Events must not be traced after this point.
    
    	// Delay reaping m until it's done with the stack.
    	//
    	// Put mp on the free list, though it will not be reaped while freeWait
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 29 17:58:53 UTC 2024
    - 207.5K bytes
    - Viewed (0)
  7. src/cmd/vendor/golang.org/x/telemetry/package-lock.json

          "dev": true
        },
        "node_modules/binary-search-bounds": {
          "version": "2.0.5",
          "resolved": "https://registry.npmjs.org/binary-search-bounds/-/binary-search-bounds-2.0.5.tgz",
          "integrity": "sha512-H0ea4Fd3lS1+sTEB2TgcLoK21lLhwEJzlQv3IN47pJS976Gx4zoWe0ak3q+uYh60ppQxg9F16Ri4tS1sfD4+jA=="
        },
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Mar 04 17:57:25 UTC 2024
    - 156K bytes
    - Viewed (0)
  8. tensorflow/compiler/mlir/lite/ir/tfl_ops.cc

        return op.emitOpError()
               << "found invalid output dimension on row, expected "
               << expected_out_row_dim << " but got " << out_row_dim;
      if (expected_out_col_dim != ShapedType::kDynamic &&
          out_col_dim != ShapedType::kDynamic &&
          out_col_dim != expected_out_col_dim)
        return op.emitOpError()
               << "found invalid output dimension on col, expected "
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Thu May 02 09:41:17 UTC 2024
    - 169.2K bytes
    - Viewed (0)
  9. src/cmd/compile/internal/ssa/_gen/generic.rules

    (Leq32 _ (Const32 [math.MaxInt32]))  => (ConstBool [true])
    (Leq16 _ (Const16 [math.MaxInt16]))  => (ConstBool [true])
    (Leq8  _ (Const8  [math.MaxInt8 ]))  => (ConstBool [true])
    
    // Canonicalize <= on numeric bounds and < near numeric bounds to ==
    (Leq(64|32|16|8)U x c:(Const(64|32|16|8) [0]))     => (Eq(64|32|16|8) x c)
    (Leq(64|32|16|8)U c:(Const(64|32|16|8) [-1]) x)    => (Eq(64|32|16|8) x c)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 16 22:21:05 UTC 2024
    - 135.3K bytes
    - Viewed (0)
  10. tensorflow/compiler/mlir/lite/tests/legalize-tf.mlir

    }
    
    func.func @round(%arg0: tensor<8x16xf32>) -> tensor<8x16xf32> {
      %0 = "tf.Round"(%arg0) : (tensor<8x16xf32>) -> tensor<8x16xf32>
      func.return %0 : tensor<8x16xf32>
    
      // CHECK-LABEL: round
      // CHECK: %[[ARG:.*]]: tensor<8x16xf32>
      // CHECK: %[[RESULT:.*]] = "tfl.round"(%[[ARG]]) : (tensor<8x16xf32>) -> tensor<8x16xf32>
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Wed Jun 05 01:54:33 UTC 2024
    - 153.4K bytes
    - Viewed (0)
Back to top