- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 71 for s_size (0.12 sec)
-
tensorflow/c/eager/c_api.cc
case tensorflow::AttrValue::kList: { // String if (const int s_size = default_value.list().s_size()) { absl::InlinedVector<const void*, 4> values_vector; values_vector.reserve(s_size); absl::InlinedVector<size_t, 4> lengths_vector; lengths_vector.reserve(s_size); for (int i = 0; i < s_size; ++i) { const string& v = default_value.list().s(i);
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu May 09 08:11:23 UTC 2024 - 44K bytes - Viewed (0) -
tensorflow/cc/framework/cc_op_gen_util.cc
return list.s_size() == 0 && list.i_size() == 0 && list.f_size() == 0 && list.b_size() == 0 && list.type_size() == 0 && list.shape_size() == 0 && list.tensor_size() == 0; } string ToCamelCase(StringPiece str) { string result; const char joiner = '_'; size_t i = 0; bool cap = true; while (i < str.size()) { const char c = str[i++]; if (c == '>') {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Feb 26 00:57:05 UTC 2024 - 25K bytes - Viewed (0) -
tensorflow/c/experimental/ops/gen/cpp/views/attr_view.cc
return std::to_string(attr_value.f()); case AttrValue::kB: return attr_value.b() ? "true" : "false"; case AttrValue::kList: if (attr_.full_type() == "list(string)" && attr_value.list().s_size() == 0) { return "{}"; } LOG(WARNING) << "Unimplemented: default value of list-typed attribute."; return "/* UNIMPLEMENTED */"; case AttrValue::kShape: case AttrValue::kTensor:
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Jun 03 07:02:00 UTC 2024 - 4.3K bytes - Viewed (0) -
tensorflow/c/kernels.cc
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue May 28 22:53:47 UTC 2024 - 36K bytes - Viewed (0) -
tensorflow/c/c_api.cc
DCHECK(tf_results->missing_unused_key_names_data.empty()); size_t size = results.missing_unused_input_map_keys.size(); tf_results->missing_unused_key_names.resize(size); tf_results->missing_unused_key_indexes.resize(size); for (int i = 0; i < size; ++i) { TensorId id = results.missing_unused_input_map_keys[i]; tf_results->missing_unused_key_names_data.emplace_back(id.first); tf_results->missing_unused_key_names[i] =
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Apr 15 03:35:10 UTC 2024 - 102.3K bytes - Viewed (0) -
tensorflow/cc/framework/gradient_checker.cc
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Sat Apr 13 05:57:22 UTC 2024 - 18.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/flatbuffer_export.cc
<< ") != terminator operands (" << term->getNumOperands() << ")"; return {}; } // Verify number of tensors for inputs and outputs matches size // of the list in the signature def. if (input_names.size() != sig_def_inputs.size() || output_names.size() != sig_def_outputs.size()) { main_op.emitWarning(
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Jun 12 21:41:49 UTC 2024 - 164.5K bytes - Viewed (0) -
src/runtime/msize.go
// Malloc small size classes. // // See malloc.go for overview. // See also mksizeclasses.go for how we decide what size classes to use. package runtime // Returns size of the memory block that mallocgc will allocate if you ask for the size, // minus any inline space for metadata. func roundupsize(size uintptr, noscan bool) (reqSize uintptr) { reqSize = size if reqSize <= maxSmallSize-mallocHeaderSize {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 09 04:07:57 UTC 2024 - 1.3K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/transforms/dense_to_sparse.cc
std::vector<TfLiteDimensionType>* format, std::vector<int>* b_map, std::vector<int>* b_size) { const int dims_count = block_size.size(); traversal_order->resize(dims_count); format->resize(dims_count); for (int i = 0; i < dims_count; i++) { (*traversal_order)[i] = i; } for (int i = 0; i < dims_count - 1; i++) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 16.1K bytes - Viewed (0) -
src/runtime/mpagealloc_64bit.go
have := makeAddrRange(chunksBase+haveMin*scSize, chunksBase+haveMax*scSize) need := makeAddrRange(chunksBase+needMin*scSize, chunksBase+needMax*scSize) // Subtract any overlap from rounding. We can't re-map memory because // it'll be zeroed. need = need.subtract(have) // If we've got something to map, map it, and update the slice bounds. if need.size() != 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 03 11:00:10 UTC 2024 - 9.3K bytes - Viewed (0)