Recursively walk a tree-sitter SQL AST and extract DDL entities.
(
self,
node,
source: bytes,
file_path_str: str,
nodes: list[NodeInfo],
edges: list[EdgeInfo],
)
| 2082 | return nodes, edges |
| 2083 | |
| 2084 | def _walk_sql_tree( |
| 2085 | self, |
| 2086 | node, |
| 2087 | source: bytes, |
| 2088 | file_path_str: str, |
| 2089 | nodes: list[NodeInfo], |
| 2090 | edges: list[EdgeInfo], |
| 2091 | ) -> None: |
| 2092 | """Recursively walk a tree-sitter SQL AST and extract DDL entities.""" |
| 2093 | if node.type in self._SQL_DDL_NODE_TYPES: |
| 2094 | self._extract_sql_ddl(node, source, file_path_str, nodes, edges) |
| 2095 | return # don't recurse into the DDL body — no nested DDL expected |
| 2096 | for child in node.children: |
| 2097 | self._walk_sql_tree(child, source, file_path_str, nodes, edges) |
| 2098 | |
| 2099 | def _extract_sql_ddl( |
| 2100 | self, |
no test coverage detected