Mirrors/knx
1
0
Fork 0
mirror of https://github.com/thelsing/knx.git synced 2025-08-03 13:48:15 +02:00
Code Issues Packages Projects Releases Wiki Activity

added required comments to explain algorithm

Browse Source
This commit is contained in:
Waldemar Porscha 2022-11-06 00:32:47 +01:00
parent b57926333c
commit b96c58ec55
1 changed files with 5 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
src/knx/association_table_object.cpp
View File

@ -103,7 +103,9 @@ const uint8_t* AssociationTableObject::restore(const uint8_t* buffer)
// return type is int32 so that we can return uint16 and -1 // return type is int32 so that we can return uint16 and -1
int32_t AssociationTableObject::translateAsap(uint16_t asap) int32_t AssociationTableObject::translateAsap(uint16_t asap)
{ {
uint16_t entries = entryCount(); // sortedEntryCount is determined in prepareBinarySearch()
// if ETS provides strictly increasing numbers for ASAP
// represents the size of the array to search
if (sortedEntryCount) if (sortedEntryCount)
{ {
uint16_t low = 0; uint16_t low = 0;
@ -123,7 +125,8 @@ int32_t AssociationTableObject::translateAsap(uint16_t asap)
} }
else else
{ {
for (uint16_t i = 0; i < entries; i++) // if ASAP numbers are not strictly increasing linear seach is used
for (uint16_t i = 0; i < entryCount(); i++)
if (getASAP(i) == asap) if (getASAP(i) == asap)
return getTSAP(i); return getTSAP(i);
} }