Home
last modified time | relevance | path

Searched refs:splits_list (Results 1 – 4 of 4) sorted by relevance

/external/tensorflow/tensorflow/python/ops/ragged/
Dragged_array_ops.py139 splits_list = [
143 ragged_util.assert_splits_match(splits_list)):
533 def _concat_ragged_splits(splits_list): argument
535 pieces = [splits_list[0]]
536 splits_offset = splits_list[0][-1]
537 for splits in splits_list[1:]:
Dragged_util.py96 for splits_list in nested_splits_lists:
97 if len(splits_list) != len(nested_splits_lists[0]):
101 for splits_list in nested_splits_lists[1:]
102 for (s1, s2) in zip(nested_splits_lists[0], splits_list)
Dragged_concat_ops.py295 def _concat_ragged_splits(splits_list): argument
297 pieces = [splits_list[0]]
298 splits_offset = splits_list[0][-1]
299 for splits in splits_list[1:]:
/external/tensorflow/tensorflow/contrib/boosted_trees/kernels/
Dtraining_ops.cc367 OpInputList splits_list; in Compute() local
371 OP_REQUIRES_OK(context, context->input_list("splits", &splits_list)); in Compute()
381 gains_list, splits_list, &best_splits); in Compute()
385 FindBestSplitOblivious(context, gains_list, splits_list, &best_splits); in Compute()
443 const OpInputList& gains_list, const OpInputList& splits_list, in FindBestSplitsPerPartitionNormal() argument
450 const auto& splits = splits_list[handler_id].vec<string>(); in FindBestSplitsPerPartitionNormal()
479 const OpInputList& splits_list, in FindBestSplitOblivious() argument
484 const auto& splits = splits_list[handler_id].vec<string>(); in FindBestSplitOblivious()