Searched refs:candidate_idx (Results 1 – 3 of 3) sorted by relevance
35 int64 candidate_idx; member119 const int64 candidate_idx = candidate.candidate_idx; in Compute() local123 thresholds_list[feature_idx].vec<int32>()(candidate_idx); in Compute()124 const float gain = gains_list[feature_idx].vec<float>()(candidate_idx); in Compute()137 left_node_contribs[feature_idx].matrix<float>()(candidate_idx, 0); in Compute()140 right_node_contribs[feature_idx].matrix<float>()(candidate_idx, 0); in Compute()206 for (size_t candidate_idx = 0; candidate_idx < node_ids.size(); in FindBestSplitsPerNode() local207 ++candidate_idx) { in FindBestSplitsPerNode()209 const auto& node_id = node_ids(candidate_idx); in FindBestSplitsPerNode()210 const auto& gain = gains(candidate_idx); in FindBestSplitsPerNode()[all …]
459 for (size_t candidate_idx = 0; candidate_idx < splits.size(); in FindBestSplitsPerPartitionNormal() local460 ++candidate_idx) { in FindBestSplitsPerPartitionNormal()462 const auto& partition_id = partition_ids(candidate_idx); in FindBestSplitsPerPartitionNormal()463 const auto& gain = gains(candidate_idx); in FindBestSplitsPerPartitionNormal()464 const auto& serialized_split = splits(candidate_idx); in FindBestSplitsPerPartitionNormal()
321 int candidate_idx = 0; in BatchedNonMaxSuppressionOp() local323 candidate_idx < candidate_vector.size()) { in BatchedNonMaxSuppressionOp()324 next_candidate = candidate_vector[candidate_idx++]; in BatchedNonMaxSuppressionOp()