Add early return check to passive Bluetooth entities listener

[bdraco]

Proposed change

Most of the time we can avoid iterating in python code

This is covered by existing tests

Type of change

• Dependency upgrade
• Bugfix (non-breaking change which fixes an issue)
• New integration (thank you!)
• New feature (which adds functionality to an existing integration)
• Deprecation (breaking change to happen in the future)
• Breaking change (fix/feature causing existing functionality to break)
• Code quality improvements to existing code or addition of tests

Additional information

• This PR fixes or closes issue: fixes #
• This PR is related to issue:
• Link to documentation pull request:

Checklist

• The code change is tested and works locally.
• Local tests pass. Your PR cannot be merged unless tests pass
• There is no commented out code in this PR.
• I have followed the development checklist
• I have followed the perfect PR recommendations
• The code has been formatted using Black (black --fast homeassistant tests)
• Tests have been added to verify that the new code works.

If user exposed functionality or configuration variables are added/changed:

• Documentation added/updated for www.home-assistant.io

If the code communicates with devices, web services, or third-party tools:

• The manifest file has all fields filled out correctly.
  Updated and included derived files by running: python3 -m script.hassfest.
• New or updated dependencies have been added to requirements_all.txt.
  Updated by running python3 -m script.gen_requirements_all.
• For the updated dependencies - a link to the changelog, or at minimum a diff between library versions is added to the PR description.
• Untested files have been added to .coveragerc.

To help with the load of incoming pull requests:

• I have reviewed two other open pull requests in this repository.

[elupus]

Looks good.

I wonder how something like:

keys = data.bla.keys() - created
for key in keys:
  new = data.bla[key]
  ...

Probably slower for the creation, i wonder if there is some neat python trick to get values and filter keys at the same time.

[bdraco]

I wonder how something like:

keys = data.bla.keys() - created
for key in keys:
  new = data.bla[key]
  ...

That should work fine, but likely a bit slower than the optimized path of issuperset has a c implementation https://github.com/python/cpython/blob/5e7727b05232b43589d177c15263d7f4f8c584a0/Objects/setobject.c#L1760

Would have to try and compare, but TBH it almost never ends the rest of the body of the function after this change so something to think about for the future.

[bdraco]

Thanks