#unordered_set search results
Day 50 of #codeSomethingAgainAndAgain I wanted to use #unordered_set since it's also a hashing data structure , but it didn’t work , so I had to use #unordered_map . I think HashSet is like the sidekick who can save the day but never gets the lead role 😅 .
But it was taking (N logN) time as insertion in sorted set takes logN time. So I changed the iteration little to be able to use #unordered_set. Which optimised the solution to logN time complexity
#cpp #unordered_map #unordered_set spec url: http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2003/n1456.html
jerusheng #Cpp #TR1 #unordered_set Be careful! hash<long long> is bullshit!
#cpp #unordered_map #unordered_set Rehashing invalidates iterators, elements ordering and bucketing, but NOT ptrs or refs to elements
What happened? RT: @jerusheng: jerusheng #Cpp #TR1 #unordered_set Be careful! hash<long long> is bullshit!
Day 50 of #codeSomethingAgainAndAgain I wanted to use #unordered_set since it's also a hashing data structure , but it didn’t work , so I had to use #unordered_map . I think HashSet is like the sidekick who can save the day but never gets the lead role 😅 .
But it was taking (N logN) time as insertion in sorted set takes logN time. So I changed the iteration little to be able to use #unordered_set. Which optimised the solution to logN time complexity
#cpp #unordered_map #unordered_set spec url: http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2003/n1456.html
#cpp #unordered_map #unordered_set Rehashing invalidates iterators, elements ordering and bucketing, but NOT ptrs or refs to elements
What happened? RT: @jerusheng: jerusheng #Cpp #TR1 #unordered_set Be careful! hash<long long> is bullshit!
jerusheng #Cpp #TR1 #unordered_set Be careful! hash<long long> is bullshit!
Day 50 of #codeSomethingAgainAndAgain I wanted to use #unordered_set since it's also a hashing data structure , but it didn’t work , so I had to use #unordered_map . I think HashSet is like the sidekick who can save the day but never gets the lead role 😅 .
But it was taking (N logN) time as insertion in sorted set takes logN time. So I changed the iteration little to be able to use #unordered_set. Which optimised the solution to logN time complexity
Something went wrong.
Something went wrong.
United States Trends
- 1. Marshawn Kneeland 28.6K posts
- 2. Nancy Pelosi 35.3K posts
- 3. #MichaelMovie 45.2K posts
- 4. #NO1ShinesLikeHongjoong 31.1K posts
- 5. #영원한_넘버원캡틴쭝_생일 30.6K posts
- 6. ESPN Bet 2,617 posts
- 7. Baxcalibur 4,451 posts
- 8. Chimecho 6,463 posts
- 9. Madam Speaker 1,589 posts
- 10. Gremlins 3 3,576 posts
- 11. Joe Dante N/A
- 12. #LosdeSiemprePorelNO N/A
- 13. Jaafar 13.3K posts
- 14. #thursdayvibes 3,225 posts
- 15. VOTAR NO 28.1K posts
- 16. Chris Columbus 3,171 posts
- 17. Diantha 1,883 posts
- 18. Rest in Peace 20K posts
- 19. Korrina 5,575 posts
- 20. Good Thursday 37.8K posts