Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 4 additions & 4 deletions integration_tests/old_benchmarks/anemoi.py
Original file line number Diff line number Diff line change
Expand Up @@ -6,7 +6,7 @@
# granted to it by virtue of its status as an intergovernmental organisation
# nor does it submit to any jurisdiction.

from earthkit.workflows import Cascade
from earthkit.workflows.visualise import visualise


def get_graph(lead_time, ensemble_members, CKPT=None, date="2024-12-02T00:00"):
Expand All @@ -18,7 +18,7 @@ def get_graph(lead_time, ensemble_members, CKPT=None, date="2024-12-02T00:00"):
result = model_action.mean(dim="ensemble_member")
result = result.map(print)

cascade_model = Cascade.from_actions([result.sel(param="2t")])
cascade_model = result.sel(param="2t").graph()

cascade_model.visualise("model_running.html", preset="blob", cdn_resources="in_line")
return cascade_model._graph
visualise(cascade_model, "model_running.html", preset="blob", cdn_resources="in_line")
return cascade_model
33 changes: 0 additions & 33 deletions src/earthkit/workflows/__init__.py
Original file line number Diff line number Diff line change
Expand Up @@ -16,41 +16,8 @@
# assuming editable install etc
pass
from . import fluent, mark
from .graph import Graph, deduplicate_nodes
from .graph.export import deserialise, serialise


class Cascade:
def __init__(self, graph: Graph = Graph([])):
self._graph = graph

@classmethod
def from_actions(cls, actions):
graph = Graph([])
for action in actions:
graph += action.graph()
return cls(deduplicate_nodes(graph))

def visualise(self, *args, **kwargs):
from .visualise import visualise as _visualise_fn

return _visualise_fn(self._graph, *args, **kwargs)

def __add__(self, other: "Cascade") -> "Cascade":
if not isinstance(other, Cascade):
return NotImplemented
return Cascade(deduplicate_nodes(self._graph + other._graph))

def __iadd__(self, other: "Cascade") -> "Cascade":
if not isinstance(other, Cascade):
return NotImplemented
self._graph += other._graph
self._graph = deduplicate_nodes(self._graph)
return self


__all__ = [
"mark",
"fluent",
"Cascade",
]
Loading