Marc Billow
27d6d09fd9
Remove key_fn from Capability — pattern cap keys are now always derived automatically: strip digits from href segments, join with '_', append '_' + desc.key. /door/cooler/0 + 'open' -> door_cooler_open. DOOR_GENERIC entity key: 'open' (not 'door_open'). Remove _door_key helper. Fridge registry: DOOR_FRIDGE/DOOR_FREEZER replaced by DOOR_GENERIC pattern cap. Golden baseline: door_fridge_open -> door_cooler_open. Move device dumps to tests/fixtures/dumps/ (tracked) so tests run in CI without local-tools/ dependencies.
37 lines
1.7 KiB
Python
37 lines
1.7 KiB
Python
"""Verify that multi-instance fridge resources produce distinct entity keys.
|
|
|
|
The two physical door resources (/door/cooler/0, /door/freezer/0) and the two
|
|
ice-maker resources (/icemaker/one/vs/0, /icemaker/two/vs/0) use named path
|
|
segments rather than numeric indices, so they are modelled via DOOR_GENERIC
|
|
pattern capability that auto-derives distinct keys from the href segments.
|
|
"""
|
|
from tests.conftest import _load_resources
|
|
|
|
from samsung_appliance.registry.adapter import _key
|
|
from samsung_appliance.registry.by_type import refrigerator
|
|
from samsung_appliance.registry.discovery import discover
|
|
|
|
|
|
def test_two_doors_get_distinct_keys():
|
|
resources = _load_resources('10.0.0.254')
|
|
reg = refrigerator.REGISTRY
|
|
bound = discover(resources, reg.capabilities, reg.pattern_capabilities)
|
|
door_keys = sorted(_key(b) for b in bound if _key(b).startswith('door'))
|
|
# at least the two physical doors (cooler + freezer) produce distinct keys
|
|
assert len(set(door_keys)) >= 2, f"Expected >= 2 distinct door keys, got: {door_keys}"
|
|
|
|
|
|
def test_two_iceMakers_get_distinct_keys():
|
|
resources = _load_resources('10.0.0.254')
|
|
reg = refrigerator.REGISTRY
|
|
bound = discover(resources, reg.capabilities, reg.pattern_capabilities)
|
|
ice_keys = sorted(f"{b.desc.key}{b.instance}" for b in bound
|
|
if b.desc.key.startswith('ice'))
|
|
# ice1_* and ice2_* are distinct
|
|
ice1_keys = [k for k in ice_keys if k.startswith('ice1')]
|
|
ice2_keys = [k for k in ice_keys if k.startswith('ice2')]
|
|
assert ice1_keys, "No ice1_* keys found"
|
|
assert ice2_keys, "No ice2_* keys found"
|
|
assert set(ice1_keys).isdisjoint(set(ice2_keys)), \
|
|
f"ice1 and ice2 keys overlap: {ice1_keys} vs {ice2_keys}"
|