Search Options

Results per page
Sort
Preferred Languages
Advance

Results 71 - 75 of 75 for offset2 (0.18 sec)

  1. tensorflow/compiler/mlir/tensorflow/tests/tf-ops.mlir

      func.return
    }
    
    // -----
    
    func.func @testConcatOffest(%concat_dim: tensor<i32>, %shape0: tensor<3xi32>, %shape1: tensor<3xi32>) {
      // expected-error @+1 {{'tf.ConcatOffset' op requires sizes of shapes and offsets to be the same, got sizes 2 and 3}}
      %0:3 = "tf.ConcatOffset"(%concat_dim, %shape0, %shape1) : (tensor<i32>, tensor<3xi32>, tensor<3xi32>) -> (tensor<3xi32>, tensor<3xi32>, tensor<3xi32>)
      func.return
    }
    
    // -----
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Mon Oct 23 14:40:35 UTC 2023
    - 236.4K bytes
    - Viewed (0)
  2. cmd/bucket-replication.go

    		ServerSideEncryption: opts.ServerSideEncryption,
    		Internal: minio.AdvancedGetOptions{
    			ReplicationProxyRequest: "true",
    		},
    		PartNumber: opts.PartNumber,
    	}
    	// get correct offsets for encrypted object
    	if rs != nil {
    		h, err := rs.ToHeader()
    		if err != nil {
    			return nil, proxy, err
    		}
    		gopts.Set(xhttp.Range, h)
    	}
    	// Make sure to match ETag when proxying.
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Thu Jun 13 06:56:12 UTC 2024
    - 114.4K bytes
    - Viewed (0)
  3. guava/src/com/google/common/cache/LocalCache.java

          }
    
          /*
           * Reclassify nodes in each list to new Map. Because we are using power-of-two expansion, the
           * elements from each bin must either stay at same index, or move with a power of two offset.
           * We eliminate unnecessary node creation by catching cases where old nodes can be reused
           * because their next fields won't change. Statistically, at the default threshold, only about
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Sat May 18 03:24:34 UTC 2024
    - 149.2K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/cache/LocalCache.java

          }
    
          /*
           * Reclassify nodes in each list to new Map. Because we are using power-of-two expansion, the
           * elements from each bin must either stay at same index, or move with a power of two offset.
           * We eliminate unnecessary node creation by catching cases where old nodes can be reused
           * because their next fields won't change. Statistically, at the default threshold, only about
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Sat May 18 03:24:34 UTC 2024
    - 143.6K bytes
    - Viewed (0)
  5. tensorflow/compiler/mlir/tensorflow/ir/tf_ops_n_z.cc

        // current dimension. `c` means case: 0 for begin, 1 for end.
        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)
Back to top