allergies/allergies.py
def _lst_bitops(self) -> List[str]:
        """
        This calculates the allergens Tom is allergic to by converting shifting the score bit for bit and looking if
        the first bit is set after the shifting.

        I came up with this solution after searching for a more mathy way of converting an int to a binary number.

        Instead of `& 1` it is also possible to use `% 2`, since this would return 1 when the shifted number is odd,
        and thus the first bit would be set.
        """

        return [self._allergens[i] for i in range(len(self._allergens)) if self._score >> i & 1]

        This calculates the allergens Tom is allergic to by converting shifting the score bit for bit and looking if
        the first bit is set after the shifting.

        I came up with this solution after searching for a more mathy way of converting an int to a binary number.

        Instead of `& 1` it is also possible to use `% 2`, since this would return 1 when the shifted number is odd,
        and thus the first bit would be set.
        
This calculates the allergens Tom is allergic to by converting shifting the score bit for bit and looking if
the first bit is set after the shifting.

I came up with this solution after searching for a more mathy way of converting an int to a binary number.

Instead of `& 1` it is also possible to use `% 2`, since this would return 1 when the shifted number is odd,
and thus the first bit would be set.
This calculates the allergens Tom is allergic to by converting shifting the score bit for bit and looking if the first bit is set after the shifting . I came up with this solution after searching for a more mathy way of converting an int to a binary number . Instead of ` & 1 ` it is also possible to use ` % 2 ` since this would return 1 when the shifted number is odd and thus the first bit would be set .
def _lst_bitops(self) -> List[str]:
        return [self._allergens[i] for i in range(len(self._allergens)) if self._score >> i & 1]
def _lst_bitops ( self ) -> List [ str ] : return [ self . _allergens [ i ] for i in range ( len ( self . _allergens ) ) if self . _score >> i & 1 ]
This calculates the allergens Tom is allergic to by converting shifting the score bit for bit and looking if
the first bit is set after the shifting.
This calculates the allergens Tom is allergic to by converting shifting the score bit for bit and looking if the first bit is set after the shifting .
"""
        This calculates the allergens Tom is allergic to by converting shifting the score bit for bit and looking if
        the first bit is set after the shifting.

        I came up with this solution after searching for a more mathy way of converting an int to a binary number.

        Instead of `& 1` it is also possible to use `% 2`, since this would return 1 when the shifted number is odd,
        and thus the first bit would be set.
        """
self