#include <disjunctive.h>

Inheritance diagram for operations_research::sat::DisjunctiveEdgeFinding:

Public Member Functions
	DisjunctiveEdgeFinding (bool time_direction, SchedulingConstraintHelper helper, Model model=nullptr)

bool	Propagate () final

int	RegisterWith (GenericLiteralWatcher *watcher)

Public Member Functions inherited from operations_research::sat::PropagatorInterface
	PropagatorInterface ()=default

virtual	~PropagatorInterface ()=default

virtual bool	IncrementalPropagate (const std::vector< int > &)

Detailed Description

Definition at line 311 of file disjunctive.h.

Constructor & Destructor Documentation

◆ DisjunctiveEdgeFinding()

operations_research::sat::DisjunctiveEdgeFinding::DisjunctiveEdgeFinding	(	bool	time_direction,
		SchedulingConstraintHelper *	helper,
		Model *	model = nullptr )

inline

Definition at line 313 of file disjunctive.h.

Member Function Documentation

◆ Propagate()

bool operations_research::sat::DisjunctiveEdgeFinding::Propagate ( )

finalvirtual

This will be called after one or more literals that are watched by this propagator changed. It will also always be called on the first propagation cycle after registration.

Note: we use the real start min here not the shifted one. This is because we might be able to push it if it is smaller than window end.

We need at least 3 tasks for the edge-finding to be different from detectable precedences.

Corner case: The propagation of the previous window might have made the current task absent even if it wasn't at the loop beginning.

Start of the next window.

Implements operations_research::sat::PropagatorInterface.

Definition at line 1552 of file disjunctive.cc.

◆ RegisterWith()

int operations_research::sat::DisjunctiveEdgeFinding::RegisterWith ( GenericLiteralWatcher * watcher )

Definition at line 1836 of file disjunctive.cc.

The documentation for this class was generated from the following files: