Path 1: 29 calls (0.53)

→ widths [3, 3] (5) [22, 17, 5] (3) [22, 17, 5, 10] (3) [5, 5] (3) [6, 6] (2) [1, 2] (1) [15, 14] (1) [23, 6] (1) [6, 0, 0] (1) [11, 0, 0] (1)

↩ return '┏━━━━━━━━━━━━━━━━━━━━━━┳━━━━━━━━━━━━━━━━━┳━━━━━┓' (3) '┏━━━━━━━━━━━━━━━━━━━━━━┳━━━━━━━━━━━━━━━━━┳━━━━━┳━━━━━━━━━━┓' (3) '┌─────┬─────┐' (3) '+-------...

9 run 0 not run

1def get_top(self, widths: Iterable[int]) -> str:
2        """Get the top of a simple box.
3
4        Args:
5            widths (List[int]): Widths of columns.
6
7        Returns:
8            str: A string of box characters.
9        """
10
11        parts: List[str] = []
12        append = parts.append
13        append(self.top_left)
14        for last, width in loop_last(widths):
15            append(self.top * width)
16            if not last:
17                append(self.top_divider)
18        append(self.top_right)
19        return "".join(parts)
            

Path 2: 26 calls (0.47)

→ widths [3] (5) [98] (3) [48] (3) [14] (2) [12] (2) [6] (2) [65] (2) [39] (1) [18] (1) [24] (1)

↩ return '╭───╮' (5) '╭────────────────────────────────────────────────╮' (3) '╭──────────────╮' (2) '╔════════════════════════════════════════════════════════...

8 run 1 not run

1def get_top(self, widths: Iterable[int]) -> str:
2        """Get the top of a simple box.
3
4        Args:
5            widths (List[int]): Widths of columns.
6
7        Returns:
8            str: A string of box characters.
9        """
10
11        parts: List[str] = []
12        append = parts.append
13        append(self.top_left)
14        for last, width in loop_last(widths):
15            append(self.top * width)
16            if not last:
17                append(self.top_divider)
18        append(self.top_right)
19        return "".join(parts)