I’m not sure if you read the answer to the SO ques...
# androidr
rook
07/27/2018, 4:10 PMI’m not sure if you read the answer to the SO question I posted, so I’ll just excerpt it:
In the worst case, a HashMap has an O(n) lookup due to walking through all entries in the same hash bucket (e.g. if they all have the same hash code).