(self, node)
| 316 | self.prune() |
| 317 | |
| 318 | def n_return(self, node): |
| 319 | start = len(self.f.getvalue()) + len(self.indent) |
| 320 | if self.params["is_lambda"]: |
| 321 | self.preorder(node[0]) |
| 322 | if hasattr(node[-1], "offset"): |
| 323 | self.set_pos_info(node[-1], start, len(self.f.getvalue())) |
| 324 | self.prune() |
| 325 | else: |
| 326 | start = len(self.f.getvalue()) + len(self.indent) |
| 327 | self.write(self.indent, "return") |
| 328 | if self.return_none or node != SyntaxTree( |
| 329 | "return", [SyntaxTree("return_expr", [NONE]), Token("RETURN_VALUE")] |
| 330 | ): |
| 331 | self.write(" ") |
| 332 | self.last_finish = len(self.f.getvalue()) |
| 333 | self.preorder(node[0]) |
| 334 | if hasattr(node[-1], "offset"): |
| 335 | self.set_pos_info(node[-1], start, len(self.f.getvalue())) |
| 336 | pass |
| 337 | pass |
| 338 | else: |
| 339 | for n in node: |
| 340 | self.set_pos_info_recurse(n, start, len(self.f.getvalue())) |
| 341 | pass |
| 342 | pass |
| 343 | self.set_pos_info(node, start, len(self.f.getvalue())) |
| 344 | self.println() |
| 345 | self.prune() # stop recursing |
| 346 | |
| 347 | def n_return_if_stmt(self, node): |
| 348 | start = len(self.f.getvalue()) + len(self.indent) |
nothing calls this directly
no test coverage detected