I have a use case where I need to translate a list lookup key to its corresponding value for a set of given list lookup keys. I couldn’t find an easy way to achieve that. What I have seen the existing code do is use two-level-deep nested loops like this:
Fetch an item from a subtable.
Fetch the list lookup keys and values for a given list lookup definition
if subtable.key matches current lookup key then
do some logic…
end;
end;
If my subtable has a lot of items or my list lookup definition has a lot of key and value pairs, then the above logic would have a performance issue (N*N).
So is my understanding correct? If yes, is there future plan to add a hash map data type for performance improvement?