Complexity in list comprehensions

Having asdf.py:

elements = [0, 1, 2, 3, 4]
ignore = [1, 2]


def loop():
    for x in elements:
        if x in ignore:
            continue
        print(x)


def comprehension():
    filtered = [x for x in elements if x not in ignore]
    for x in filtered:
        print(x)


loop()
print('----')
comprehension()

The McCabe complexity in loop() seems to be higher than in comprehension():

$ python -m mccabe asdf.py 
5:0: 'loop' 3
12:0: 'comprehension' 2

Is that really expected? Should not fors and ifs in list comprehensions count towards total complexity?

Reproduce the reported output with the asdf.py example by running python -m mccabe asdf.py. Then inspect how McCabe calculates complexity for loops, conditionals, and list comprehensions, and determine the expected counting behavior before adding focused coverage for the chosen result.