Definition at line 63 of file disjunctive.h.
#include <disjunctive.h>
◆ Entry
◆ TaskSet()
◆ AddEntry()
| void operations_research::sat::TaskSet::AddEntry |
( |
const Entry & | e | ) |
|
◆ AddShiftedStartMinEntry()
◆ AddUnsortedEntry()
| void operations_research::sat::TaskSet::AddUnsortedEntry |
( |
const Entry & | e | ) |
|
|
inline |
◆ Clear()
| void operations_research::sat::TaskSet::Clear |
( |
| ) |
|
|
inline |
◆ ComputeEndMin() [1/2]
| IntegerValue operations_research::sat::TaskSet::ComputeEndMin |
( |
| ) |
const |
◆ ComputeEndMin() [2/2]
| IntegerValue operations_research::sat::TaskSet::ComputeEndMin |
( |
int | task_to_ignore, |
|
|
int * | critical_index ) const |
◆ GetCriticalIndex()
| int operations_research::sat::TaskSet::GetCriticalIndex |
( |
| ) |
const |
|
inline |
◆ NotifyEntryIsNowLastIfPresent()
| void operations_research::sat::TaskSet::NotifyEntryIsNowLastIfPresent |
( |
const Entry & | e | ) |
|
◆ Sort()
| void operations_research::sat::TaskSet::Sort |
( |
| ) |
|
|
inline |
◆ SortedTasks()
| absl::Span< const Entry > operations_research::sat::TaskSet::SortedTasks |
( |
| ) |
const |
|
inline |
The documentation for this class was generated from the following files: