Is your feature request related to a problem? Please describe.
Currently we use unique hash key when adding listeners and search array for O(n) and find type(action name) == target.
We can reduce time complexity by implementing hash table for O(1), but when we have hash collapsing then for O(n)
Describe the solution you'd like
Implementing hash table and hash collapsing.
Is your feature request related to a problem? Please describe. Currently we use unique hash key when adding listeners and search array for O(n) and find type(action name) == target. We can reduce time complexity by implementing hash table for O(1), but when we have hash collapsing then for O(n)
Describe the solution you'd like Implementing hash table and hash collapsing.