def split_imports()

in usort/sorting.py [0:0]

• 19 lines of code
• 5 McCabe index (conditional complexity)

    def split_imports(self, imports: List[SortableImport]) -> List[SortableImport]:
        idx = 0
        while idx < len(imports):
            imp = imports[idx]
            if imp.stem is None and len(imp.items) > 1:  # import foo, bar
                new_imps = [
                    SortableImport(
                        stem=None,
                        items=[item],
                        comments=evolve(imp.comments),
                        indent=imp.indent,
                        config=imp.config,
                        node=imp.node,
                    )
                    for item in imp.items
                ]
                imports[idx : idx + 1] = new_imps
            idx += 1
        return imports