Searched refs:forbidden_intervals_ (Results 1 – 6 of 6) sorted by relevance
32 forbidden_intervals_.push_back (forbidden); in add_forbidden_interval()59 for (vsize i = 0; i < forbidden_intervals_.size (); i++) in solve()66 if (forbidden_intervals_[i][d] == d * infinity_f) in solve()68 else if (forbidden_intervals_[i].contains (feasible_widened[d]) in solve()69 || forbidden_intervals_[i].contains (feasible_widened[-d]) in solve()70 || feasible_widened.contains (forbidden_intervals_[i][d]) in solve()71 || feasible_widened.contains (forbidden_intervals_[i][-d])) in solve()73 … feasible_placements_[d] = forbidden_intervals_[i][d] + d * (epsilon + (bulk_ / 2)); in solve()
38 std::vector<Interval> forbidden_intervals_; member in Interval_minefield
37 std::vector<Interval> forbidden_intervals_; member in Interval_minefield
2598 return forbidden_intervals_; in forbidden_intervals()2607 DCHECK_LT(index, forbidden_intervals_.size()); in GetFirstPossibleGreaterOrEqualValueForNode()2609 forbidden_intervals_[index]; in GetFirstPossibleGreaterOrEqualValueForNode()2626 DCHECK_LT(index, forbidden_intervals_.size()); in GetLastPossibleLessOrEqualValueForNode()2628 forbidden_intervals_[index]; in GetLastPossibleLessOrEqualValueForNode()3008 std::vector<SortedDisjointIntervalList> forbidden_intervals_; variable
2324 dimension->forbidden_intervals_[index].InsertIntervals(starts_argument_, in RegisterInspectors()2327 << dimension->forbidden_intervals_[index].DebugString(); in RegisterInspectors()6189 forbidden_intervals_.resize(size); in InitializeCumuls()6692 const SortedDisjointIntervalList& forbidden = forbidden_intervals_[index]; in GetAllowedIntervalsInRange()