LookaheadSet

Adds an entry to the structure

An entry is comprised of a function that describes the prerequisites and resultant starting time of a set of tasks, and a list of Tasks that should start if this function returns Some(value).

The function has type Map[UUID,Long]=>Option[Long]. It should take a map that contains the IDs of completed/scheduled tasks and their respective finishing times, and it should return None if the prerequisites of this entry are not met, and Some(value) if the prerequisites are met, where value should be the starting time of the tasks contained in this entry. This allows us to express a complex relationship whereby the starting time of the tasks in this lookahead entry can be an intricate function of the finishing times of the prerequisites.

Removes a task with the corresponding ID from the structure

Once removed, the task with this ID will no longer be returned.

Retrieves all tasks that can start given the list of scheduled/completed tasks

Provides a nicer interface for adding elements to the lookeahead structure.

Allows adding a single generator instead of a list of generators.

Provides a nicer interface for adding elements to the lookeahead structure.

Allows adding a simple one-to-one relationship, where the generator task starts right after the sourceID task finishes.

Combines two Lookaheads