def find_segment_place()

in src/pathpicker/formatted_text.py [0:0]

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

    def find_segment_place(self, to_go: int) -> Tuple[int, int]:
        index = 1

        while index < len(self.segments):
            to_go -= len(self.segments[index])
            if to_go < 0:
                return index, to_go

            index += 2

        if to_go == 0:
            # we could reach here if the requested place is equal
            # to the very end of the string (as we do a <0 above).
            return index - 2, len(self.segments[index - 2])
        raise AssertionError("Unreachable")