Closed rkatic closed 3 years ago
Considering that Maps and Sets are very crucial data structures for efficient algorithms, I am wondering what performance overhead would be introduced by adding internal complexity on each collection operation.
As my understanding, current proposal won't add performance overhead on normal Maps/Sets which do not pass coerce options.
Correct, normal collections should not be affected
Considering that Maps and Sets are very crucial data structures for efficient algorithms, I am wondering what performance overhead would be introduced by adding internal complexity on each collection operation.