/third_party/mindspore/mindspore/ccsrc/minddata/dataset/engine/datasetops/ |
D | dataset_op.cc | 77 child_.push_back(child); in AddChild() 97 child_.erase(std::remove(child_.begin(), child_.end(), child), child_.end()); in RemoveChild() 116 for (const auto &child : child_) { in RemoveChildren() 119 child_.clear(); in RemoveChildren() 138 if (child_.size() > 1) { in Remove() 150 if (!child_.empty()) { in Remove() 155 child_[0]->parent_[0] = parent_[0]; in Remove() 159 child_[0]->parent_.clear(); in Remove() 160 RETURN_IF_NOT_OK(tree_->AssignRoot(child_[0])); in Remove() 167 if (!child_.empty()) { in Remove() [all …]
|
D | concat_op.cc | 56 out << "\nDatasets: " << child_.size() << "\n\n"; in Print() 91 column_name_id_map_ = child_[0]->column_name_id_map(); in ComputeColMap() 96 for (size_t i = 0; i < child_.size(); ++i) { in ComputeColMap() 97 if (child_[i]->column_name_id_map() != column_name_id_map_) { in ComputeColMap() 110 for (const auto &child : child_) { in GetNumClasses() 157 RETURN_IF_NOT_OK(child_[cur_child_]->GetNextRow(row, worker_id, retry_if_eoe)); in GetNextRow() 170 if (cur_child_ == child_.size() - 1) { in GetNextRow() 187 for (int32_t i = cur_child_ + 1; i < child_.size(); i++) { in GetNextRow() 188 RETURN_IF_NOT_OK(child_[i]->GetNextRow(row, worker_id, retry_if_eoe)); in GetNextRow() 210 if (child_.empty() || child_[0] == nullptr) { in NumProducers() [all …]
|
D | zip_op.cc | 36 for (int32_t i = 0; i < child_.size(); ++i) { in getNextZippedRow() 38 RETURN_IF_NOT_OK(child_[i]->GetNextRow(&new_row, worker_id, retry_if_eoe)); in getNextZippedRow() 53 for (int32_t con = 0; con < child_.size(); ++con) { in drainPipeline() 58 RETURN_IF_NOT_OK(child_[con]->GetNextRow(&row, worker_id, retry_if_eoe)); in drainPipeline() 78 out << "\nDatasets: " << child_.size() << "\n\n"; in Print() 96 for (size_t i = 0; i < child_.size(); ++i) { in ComputeColMap() 98 … const std::unordered_map<std::string, int32_t> col_name_id_map = child_[i]->column_name_id_map(); in ComputeColMap() 146 if (child_.empty() || child_[0] == nullptr) { in NumProducers() 150 return child_[0]->NumProducers(); in NumProducers()
|
D | skip_op.cc | 52 RETURN_IF_NOT_OK(child_[0]->GetNextRow(row, worker_id, retry_if_eoe)); in GetNextRow() 60 RETURN_IF_NOT_OK(child_[0]->GetNextRow(row, worker_id, retry_if_eoe)); in GetNextRow() 82 if (child_.empty() || child_[0] == nullptr) { in NumProducers() 86 return child_[0]->NumProducers(); in NumProducers()
|
D | take_op.cc | 47 RETURN_IF_NOT_OK(child_[0]->GetNextRow(row, worker_id, retry_if_eoe)); in GetNextRow() 58 RETURN_IF_NOT_OK(child_[0]->GetNextRow(row, worker_id, retry_if_eoe)); in GetNextRow() 83 if (child_.empty() || child_[0] == nullptr) { in NumProducers() 87 return child_[0]->NumProducers(); in NumProducers()
|
D | repeat_op.cc | 61 if (child_.empty()) { in GetNextRow() 65 RETURN_IF_NOT_OK(child_[0]->GetNextRow(row, worker_id, true)); in GetNextRow() 72 RETURN_IF_NOT_OK(child_[0]->GetNextRow(row, worker_id, true)); in GetNextRow() 144 if (child_.empty() || child_[0] == nullptr) { in NumProducers() 148 return child_[0]->NumProducers(); in NumProducers()
|
D | project_op.cc | 52 RETURN_IF_NOT_OK(child_[0]->GetNextRow(row, worker_id, retry_if_eoe)); in GetNextRow() 92 if (child_.empty() || child_[0] == nullptr) { in NumProducers() 96 return child_[0]->NumProducers(); in NumProducers() 112 …std::unordered_map<std::string, int32_t> child_column_name_mapping = child_[0]->column_name_id_map… in ComputeColMap() 132 RETURN_IF_NOT_OK(child_[0]->GetNextRowPullMode(&new_row)); in GetNextRowPullMode()
|
D | rename_op.cc | 37 RETURN_IF_NOT_OK(child_[0]->GetNextRow(row, worker_id, retry_if_eoe)); in GetNextRow() 51 column_name_id_map_ = child_[0]->column_name_id_map(); in ComputeColMap() 146 if (child_.empty() || child_[0] == nullptr) { in NumProducers() 150 return child_[0]->NumProducers(); in NumProducers()
|
D | epoch_ctrl_op.cc | 44 if (child_.empty()) { in GetNextRow() 49 RETURN_IF_NOT_OK(child_[0]->GetNextRow(row, worker_id, false)); in GetNextRow() 80 int64_t EpochCtrlOp::GetTreeRepeatCount() { return child_[0]->GetTreeRepeatCount(); } in GetTreeRepeatCount()
|
D | dataset_op.h | 283 …int32_t ChildOpConnectorSize(int32_t child_index = 0) const { return child_[child_index]->Connecto… 287 …int32_t ChildOpConnectorCapacity(int32_t child_index = 0) const { return child_[child_index]->Conn… 291 std::vector<std::shared_ptr<DatasetOp>> Children() const { return child_; } in Children() 332 bool IsLeaf() { return (child_.empty()); } in IsLeaf() 373 std::vector<std::shared_ptr<DatasetOp>> child_; // Child nodes variable
|
D | cache_merge_op.cc | 191 child_.size() == kNumChildren, in PrepareOperator() 192 … number of children of CacheMergeOp, required num is 2, but got:" + std::to_string(child_.size())); in PrepareOperator() 195 uint32_t cache_crc = DatasetOp::GenerateCRC(child_[kCacheMissChildIdx]); in PrepareOperator() 210 …CHECK_FAIL_RETURN_UNEXPECTED(child_[kCacheMissChildIdx] != nullptr, "Invalid data, cache miss stre… in ComputeColMap() 212 column_name_id_map_ = child_[kCacheMissChildIdx]->column_name_id_map(); in ComputeColMap()
|
D | batch_op.cc | 512 CHECK_FAIL_RETURN_UNEXPECTED(child_.size() == 1, in ComputeColMap() 515 CHECK_FAIL_RETURN_UNEXPECTED(!(child_[0]->column_name_id_map().empty()), in ComputeColMap() 519 column_name_id_map_ = child_[0]->column_name_id_map(); in ComputeColMap() 524 child_map_ = child_[0]->column_name_id_map(); in ComputeColMap() 586 RETURN_IF_NOT_OK(child_[0]->GetNextRowPullMode(&new_row)); in GetNextRowPullMode()
|
/third_party/ninja/src/ |
D | subprocess-win32.cc | 24 Subprocess::Subprocess(bool use_console) : child_(NULL) , overlapped_(), in Subprocess() 35 if (child_) in ~Subprocess() 150 child_ = process_info.hProcess; in Start() 187 if (!child_) in Finish() 191 WaitForSingleObject(child_, INFINITE); in Finish() 194 GetExitCodeProcess(child_, &exit_code); in Finish() 196 CloseHandle(child_); in Finish() 197 child_ = NULL; in Finish() 245 if (subprocess->child_) in Add() 294 if ((*i)->child_ && !(*i)->use_console_) { in Clear() [all …]
|
D | subprocess.h | 66 HANDLE child_; member
|
/third_party/grpc/src/core/ext/filters/client_channel/lb_policy/ |
D | child_policy_handler.cc | 60 parent_.get(), this, child_, ConnectivityStateName(state), in UpdateState() 85 if (child_ != latest_child_policy) return; in RequestReresolution() 100 void set_child(LoadBalancingPolicy* child) { child_ = child; } in set_child() 104 GPR_ASSERT(child_ != nullptr); in CalledByPendingChild() 105 return child_ == parent_->pending_child_policy_.get(); in CalledByPendingChild() 109 GPR_ASSERT(child_ != nullptr); in CalledByCurrentChild() 110 return child_ == parent_->child_policy_.get(); in CalledByCurrentChild() 114 LoadBalancingPolicy* child_ = nullptr; member in grpc_core::ChildPolicyHandler::Helper
|
/third_party/mindspore/mindspore/ccsrc/minddata/dataset/engine/datasetops/source/sampler/ |
D | sampler.cc | 46 child_sampler = std::dynamic_pointer_cast<SamplerRT>(child_[0]); in HandshakeRandomAccessOp() 135 if (!child_.empty()) { in CalculateNumSamples() 136 child_num_rows = child_[0]->CalculateNumSamples(num_rows); in CalculateNumSamples() 165 if (!child_.empty()) { in AddChild() 170 child_.push_back(child); in AddChild() 175 bool SamplerRT::HasChildSampler() const { return !child_.empty(); } in HasChildSampler() 191 for (const auto &child : child_) { in to_json()
|
D | subset_sampler.cc | 52 RETURN_IF_NOT_OK(child_[0]->ResetSampler()); in ResetSampler() 65 RETURN_IF_NOT_OK(child_[0]->GetNextSample(&child_ids_)); in GetNextSample() 125 if (!child_.empty()) { in CalculateNumSamples() 126 child_num_rows = child_[0]->CalculateNumSamples(num_rows); in CalculateNumSamples()
|
D | sequential_sampler.cc | 35 RETURN_IF_NOT_OK(child_[0]->GetNextSample(&child_ids_)); in GetNextSample() 99 RETURN_IF_NOT_OK(child_[0]->ResetSampler()); in ResetSampler() 109 if (!child_.empty()) { in CalculateNumSamples() 110 child_num_rows = child_[0]->CalculateNumSamples(num_rows); in CalculateNumSamples()
|
D | distributed_sampler.cc | 117 RETURN_IF_NOT_OK(child_[0]->GetNextSample(&child_ids_)); in GetNextSample() 169 RETURN_IF_NOT_OK(child_[0]->ResetSampler()); in ResetSampler() 177 if (!child_.empty()) { in CalculateNumSamples() 178 child_num_rows = child_[0]->CalculateNumSamples(num_rows); in CalculateNumSamples()
|
D | python_sampler.cc | 31 RETURN_IF_NOT_OK(child_[0]->GetNextSample(&child_ids_)); in GetNextSample() 106 RETURN_IF_NOT_OK(child_[0]->ResetSampler()); in ResetSampler()
|
D | random_sampler.cc | 41 RETURN_IF_NOT_OK(child_[0]->GetNextSample(&child_ids_)); in GetNextSample() 114 RETURN_IF_NOT_OK(child_[0]->ResetSampler()); in ResetSampler()
|
D | pk_sampler.cc | 80 RETURN_IF_NOT_OK(child_[0]->GetNextSample(&child_ids_)); in GetNextSample() 113 RETURN_IF_NOT_OK(child_[0]->ResetSampler()); in ResetSampler()
|
D | weighted_random_sampler.cc | 108 RETURN_IF_NOT_OK(child_[0]->ResetSampler()); in ResetSampler() 134 RETURN_IF_NOT_OK(child_[0]->GetNextSample(&child_ids_)); in GetNextSample()
|
/third_party/mindspore/mindspore/ccsrc/minddata/dataset/engine/ |
D | execution_tree.cc | 144 for (size_t i = 0; i < dataset_op->child_.size(); ++i) { in PrintNode() 145 …this->PrintNode(out, dataset_op->child_[i], indent, (i == (dataset_op->child_.size() - 1)), detail… in PrintNode() 226 for (int32_t i = 0; i < node->child_.size(); ++i) { in PostOrderTraverse() 227 PostOrderTraverse(node->child_[i]); in PostOrderTraverse() 272 fifo.insert(fifo.end(), op->child_.begin(), op->child_.end()); in Prepare()
|
/third_party/boost/boost/xpressive/detail/core/matcher/ |
D | action_matcher.hpp | 60 struct child_ struct 73 typedef typename child_<Expr, 0>::type left_type; 74 typedef typename child_<Expr, 1>::type right_type; 115 typedef typename child_<Expr, 0>::type left_type; 116 typedef typename child_<Expr, 1>::type right_type;
|