Searched refs:num_repeats_ (Results 1 – 5 of 5) sorted by relevance
32 … : num_repeats_(1), num_epochs_(1), is_merge_(false), is_cached_(false), cache_lookup_(nullptr) {} in RepeatPass()40 if (node->Count() == DatasetOp::kInfiniteRepeat && num_repeats_ < 0) { in Visit()41 num_repeats_ = -num_repeats_; in Visit()55 num_repeats_ *= node->Count(); in Visit()69 num_repeats_ *= num_epochs_; in Visit()102 cache_lookup_->SetTotalRepeats(num_repeats_); in VisitAfter()110 node->SetTotalRepeats(num_repeats_); in VisitAfter()117 num_repeats_ /= node->Count(); in VisitAfter()126 node->SetTotalRepeats(num_repeats_); in VisitAfter()129 num_repeats_ /= node->Count(); in VisitAfter()[all …]
123 int32_t num_repeats_; // A multiplier to the total number of repeats variable
26 RepeatOp::RepeatOp(int32_t count) : PipelineOp(0), num_repeats_(count), repeat_count_(0) {} in RepeatOp()37 out << " [repeats: " << num_repeats_ << "]\n"; in Print()42 …out << "\nCurrent count: " << repeat_count_ << "\nMax count: " << num_repeats_ << "\nLeaf Nodes in… in Print()88 if (repeat_count_ == num_repeats_) { in EoeReceived()152 int64_t RepeatOp::GetTreeRepeatCount() { return num_repeats_; } in GetTreeRepeatCount()
36 out << " [epochs: " << num_repeats_ << "]\n"; in Print()65 << ". Max epochs: " << num_repeats_; in EoeReceived()70 if (repeat_count_ != num_repeats_) { in EoeReceived()
94 int32_t num_repeats() { return num_repeats_; } in num_repeats()113 int32_t num_repeats_;