[minor] Refactor storage

notebooks/deepdive.ipynb

@@ -872,7 +872,7 @@
    ],
    "source": [
     "# Times two\n",
-    "l = Linear(x=10, run_after_init=True)\n",
+    "l = Linear(x=10, autorun=True)\n",
     "(2*l).value  # These nodes will try to run right away if everything upstream is ready"
    ]
   },
@@ -902,7 +902,7 @@
     }
    ],
    "source": [
-    "a_list = Linear(x=[1,2,3,4], run_after_init=True)\n",
+    "a_list = Linear(x=[1,2,3,4], autorun=True)\n",
     "a_list.outputs.x[:2].value  # Explicitly on the output channel"
    ]
   },
@@ -945,7 +945,7 @@
     }
    ],
    "source": [
-    "a_dict = Linear(x={\"a\": 1, \"b\": 2}, run_after_init=True)\n",
+    "a_dict = Linear(x={\"a\": 1, \"b\": 2}, autorun=True)\n",
     "a_dict[\"a\"].value"
    ]
   },
@@ -970,7 +970,7 @@
     "class Foo:\n",
     "    bar = 42\n",
     "    \n",
-    "an_object = Linear(x=Foo(), run_after_init=True)\n",
+    "an_object = Linear(x=Foo(), autorun=True)\n",
     "an_object.bar.value"
    ]
   },
@@ -1085,7 +1085,7 @@
     "    x = (x, x + 3.14)\n",
     "    return x\n",
     "\n",
-    "from_tuple = ReturnsTuple(x=7, run_after_init=True)\n",
+    "from_tuple = ReturnsTuple(x=7, autorun=True)\n",
     "from_tuple.outputs.to_value_dict()"
    ]
   },
@@ -5508,7 +5508,7 @@
    "source": [
     "## Saving and loading\n",
     "\n",
-    "For python >= 3.11, graphs can be saved and loaded on request -- either by manually invoking the `.save()` method, or by setting the `save_after_run` attribute to `True` (on the object or at instantiation by kwarg). This creates a save file (currently using HDF5 as a format) in the parent-most node's working directory.\n",
+    "For python >= 3.11, graphs can be saved and loaded on request -- either by manually invoking the `.save_checkpoint()` method, or by setting the `checkpoint` attribute to `True` (on the object or at instantiation by kwarg). This creates a save file for the parent-most node.\n",
     "\n",
     "Subsequently instantiating a node with the same name in the same place will attempt to reload the saved graph automatically. \n",
     "\n",
@@ -5537,7 +5537,7 @@
     "wf.inp = wf.create.standard.UserInput(42)\n",
     "wf.middle = 2 * wf.inp\n",
     "wf.end = wf.middle - 42\n",
-    "wf.out = wf.create.standard.UserInput(wf.end, save_after_run=True)\n",
+    "wf.out = wf.create.standard.UserInput(wf.end, checkpoint=\"pickle\")\n",
     "wf()\n",
     "# wf.save()  # Not needed, since `wf.out` saves after running"
    ]
@@ -5558,7 +5558,7 @@
    "id": "f9238cf7-3050-4607-a542-010e3bb83f41",
    "metadata": {},
    "source": [
-    "You can force a newly instantiated node to ignore (and delete!) an existing save file by setting the `overwrite_save` kwarg to `True`.\n",
+    "You can force a newly instantiated node to ignore (and delete!) an existing save file by setting the `delete_existing_savefiles` kwarg to `True`.\n",
     "\n",
     "Finally, let's clean up our save to keep this demo director clean:"
    ]
@@ -5570,7 +5570,7 @@
    "metadata": {},
    "outputs": [],
    "source": [
-    "reloaded.storage.delete()"
+    "reloaded.delete_storage()"
    ]
   },
   {

pyiron_workflow/__init__.py

@@ -51,3 +51,8 @@
     inputs_to_list,
     list_to_outputs,
 )
+from pyiron_workflow.storage import (
+    StorageInterface,
+    PickleStorage,
+    available_backends,
+)

pyiron_workflow/mixin/injection.py

@@ -92,7 +92,7 @@ def _node_injection(self, injection_class, *args, inject_self=True):
             # Fall back on creating a new node in case parent is None or node nexists
             node_args = (self, *args) if inject_self else args
             return injection_class(
-                *node_args, parent=self.owner.parent, label=label, run_after_init=True
+                *node_args, parent=self.owner.parent, label=label, autorun=True
             )
 
     # We don't wrap __all__ the operators, because you might really want the string or

pyiron_workflow/mixin/semantics.py

@@ -14,6 +14,7 @@
 from __future__ import annotations
 
 from abc import ABC
+from pathlib import Path
 from typing import Optional
 
 from bidict import bidict
@@ -97,6 +98,15 @@ def semantic_root(self) -> Semantic:
         """The parent-most object in this semantic path; may be self."""
         return self.parent.semantic_root if isinstance(self.parent, Semantic) else self
 
+    def as_path(self, root: Path | str | None = None) -> Path:
+        """
+        The semantic path as a :class:`pathlib.Path`, with a filesystem :param:`root`
+        (default is the current working directory).
+        """
+        return (Path.cwd() if root is None else Path(root)).joinpath(
+            *self.semantic_path.split(self.semantic_delimiter)
+        )
+
     def __getstate__(self):
         state = super().__getstate__()
         state["_parent"] = None