Intersect TaskGroup states and ALL_TASK_STATES

As `dict.values` supports intersections and `ALL_TASK_STATES` is a
`set`, we can just compute their intersection directly. This winds up
being significantly faster and simpler.

distributed/scheduler.py

@@ -5908,7 +5908,7 @@ def transition(self, key, finish: str, *args, **kwargs):
             tg: TaskGroup = ts._group
             if ts._state == "forgotten" and tg._name in parent._task_groups:
                 # Remove TaskGroup if all tasks are in the forgotten state
-                if not any([tg._states.get(s) for s in ALL_TASK_STATES]):
+                if not (tg._states.values() & ALL_TASK_STATES):
                     ts._prefix._groups.remove(tg)
                     del parent._task_groups[tg._name]