-
Notifications
You must be signed in to change notification settings - Fork 94
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Relative Inter Cycle Dependencies #2452
Comments
Another request for this today, see also https://github.com/cylc/cylc/wiki/Possible-Cylc-Futures#graphs |
Ditto for runtime environment. A task may need to know:
|
(note the ability to specify "this task at it's last occurrence on any recurrence" would finally do away with the need for sequential tasks) |
Reposting form Element: We have
This means we can deprecate
Not sure if we'd want to take this any further though, i.e. |
I see it is a long withstanding issue but just wanted to say this would be something quite useful for our Cylc dependent workflow as well! |
With integer cycling the last cycle can be referenced by
-P1
, the second last with-P2
and so on. With date-time cycling we lose this functionality.There are three ways we might want to write inter-cycle triggers with datetime cycling:
ISO8601 Duration
As we presently do though I'd suggest that this covers a small set of use
cases:
[T00] graph = foo[-P1D] => bar
Relative Cycle
As we presently do with integer cycling:
[T00] graph = foo[-P1] => bar
Relative Cycle On Current Recurrence
Refer to the previous cycle on the current recurrence. Possible syntax:
Conclusions
Doing so would enable graph sections to be written independently of the recurrence with which they are implemented:
Note that there is a runtime component to this as tasks will need to determine the cycle point at which their previous occurrence occurred ...
The text was updated successfully, but these errors were encountered: