Method register_cell

marimo/_runtime/dataflow/graph.py:92–139

Add a cell to the graph. Mutates the graph, acquiring `self.lock`. Requires that `cell_id` is not already in the graph.

(self, cell_id: CellId_t, cell: CellImpl)

        return edges.get_referring_cells(name, language, self.topology)

    def register_cell(self, cell_id: CellId_t, cell: CellImpl) -> None:
        """Add a cell to the graph.

        Mutates the graph, acquiring `self.lock`.

        Requires that `cell_id` is not already in the graph.
        """
        LOGGER.debug("Acquiring graph lock to register cell %s", cell_id)
        with self.lock:
            LOGGER.debug("Acquired graph lock.")
            assert cell_id not in self.topology.cells

            # Add the cell to topology
            self.topology.add_node(cell_id, cell)

            # Process definitions and build sibling relationships FIRST
            # This must happen before computing edges because edge computation
            # needs to look up definitions
            for name, variable_data in cell.variable_data.items():
                self.definition_registry.register_definition(
                    cell_id, name, variable_data
                )
            # Now compute edges (which can now find the definitions)
            parents, children = edges.compute_edges_for_cell(
                cell_id, cell, self.topology, self.definition_registry
            )

            # Add edges to topology
            for parent_id in parents:
                self.topology.add_edge(parent_id, cell_id)
                # Detect cycle for this edge
                self.cycle_tracker.detect_cycle_for_edge(
                    (parent_id, cell_id), self.topology
                )

            for child_id in children:
                self.topology.add_edge(cell_id, child_id)
                # Detect cycle for this edge
                self.cycle_tracker.detect_cycle_for_edge(
                    (cell_id, child_id), self.topology
                )

        LOGGER.debug("Registered cell %s and released graph lock", cell_id)
        if self.is_any_ancestor_stale(cell_id):
            self.set_stale({cell_id})

        if self.is_any_ancestor_disabled(cell_id):
            cell.set_runtime_state(status="disabled-transitively")

    def is_any_ancestor_stale(self, cell_id: CellId_t) -> bool:
        """Check if any ancestor of a cell is stale."""