Would you consider making a DSA series ? Covering programming techniques for solvnig different kinds of questions and Data structure related questions asked in FAANG companies.
It's the same as HashMap except it does it's write operations in a monitor region and applies a segment level lock on the buckets so only the buckets where data is being written are locked and rest are free for use. Read operations do no require locks at all.
1) you might want to copy a map with guaranteed the same order as in the origin map 2) you might want to keep track of insertions for instance by implementing LRU-cache. For this particular case you'd use following constructor: public LinkedHashMap(int initialCapacity, float loadFactor, boolean accessOrder)
@@DailyCodeBuffer Was pleasure. I like your content. Honestly, mentioning implementation of lru-cache was kinda unrealistic of me. I think, Coffeine has ConcurrentLinkedHashMap, which almost covers all needs, unless we're dying to create something very special and customised.:D
Thanks for the detailed explanation. One question what about the uniqueness of elements ? Because it is unique in set always so it will always be unique in linked hashset also?
Besides of delicacy going hand in hand with making use of objects as keys in HashMap: At first: hashcode() on your key-object is called, after that the link to your object is copied into the array's node, after links "next" and "before" (or whatever they're called in java) are renewed, pointing to the node. Were your key-object mutated in the meanwhile, it wouldn't have no impact of next and before pointers. But the hash is toast now, I mean whether mutation changes hash code or not, which is also pretty easy to implement, either way make the value unreachable outside of the map sooner or later, but because the pointers inside the map still live, the value is hardly going to be garbage-collected, unless we make use of weak- or softHashmap.
Well, if we have to do with kinda object that we send to the client and later it's supposed to come back, well then our client will probably have done some mutations on it, won't it. That's why I'd rather call hashCode() on our object-to-send by myself, put this hashcode integer value as key into the map and store it into the specific field in our object-to-send. Once it's back again, I just get the stored value from the field and can keep using it as key. The hashCode() here works like an non-unique id.
I have lot of confusion in-between LinkedHashMap vs LinkedHashSet , now everything is cleared, thanks bro, great work.
🙏🏻🙏🏻
Perfect explanation! Thanks a lot!
Plz keep making videos
And you are completing the whole
Video in the particular topic
Makes this channel best place to visit and see
Thank you so much 😊
Thank you for the video sir, didn't think I could find the explanation so easily
Glad it helped
Great work as always❤
Thanks 🙏
Would you consider making a DSA series ? Covering programming techniques for solvnig different kinds of questions and Data structure related questions asked in FAANG companies.
Planning on it if more people are interested
@@DailyCodeBuffer Yes.. do it please
@@DailyCodeBuffer : please consider LLD videos also.
@@DailyCodeBuffer Please create as these are things which I feel most of people lack and fail when asked in interviews
Please do it.
Thank you a lot! Your explanation is cool and it helped me understand how LinkedHashMap works internally!
Glad it was helpful!
Hi Shabber it was a clear and easy explanation. Please add a video on internal working of ConcurrentHashMap
Thank you so much
Working on it
It's the same as HashMap except it does it's write operations in a monitor region and applies a segment level lock on the buckets so only the buckets where data is being written are locked and rest are free for use. Read operations do no require locks at all.
@@DailyCodeBuffer Concurrent hashmap YES PLS
Boht badiya. Too good.
Well explained.
Love you buddy cleared my concept totally
Glad it helped
Will you make a video on Oops.. if possible?
This linkedhashmap seems pretty complicated. Nicely explained. Why use this rather than a hashmap. Thank you
To maintain insertion order
1) you might want to copy a map with guaranteed the same order as in the origin map
2) you might want to keep track of insertions for instance by implementing LRU-cache. For this particular case you'd use following constructor: public LinkedHashMap(int initialCapacity,
float loadFactor,
boolean accessOrder)
Thank you for detailed information
@@DailyCodeBuffer Was pleasure. I like your content. Honestly, mentioning implementation of lru-cache was kinda unrealistic of me. I think, Coffeine has ConcurrentLinkedHashMap, which almost covers all needs, unless we're dying to create something very special and customised.:D
Happy to see you again bro 🙂🙂
Thanks buddy 🙏🏻
Thanks for the detailed explanation.
One question what about the uniqueness of elements ? Because it is unique in set always so it will always be unique in linked hashset also?
Yes
amazing explanation !
Thanks 🙏🏻
can you made an vedio on Equals and hashcode also with various cases..sometimes it comes confusive : (
What is the Difference between Node and a Entry ?
If hash collision happens then how linkedhashmap() works internally? . Thanks in advance
Thanks!
Thank you so much 🙏🏻🙏🏻
ladka sahi samjhaya hai 👍👍
🙏🏻🙏🏻
What if the key is an object? Will the next and before be resolved by sorting whatever is returned by the hashcode()?
Besides of delicacy going hand in hand with making use of objects as keys in HashMap: At first: hashcode() on your key-object is called, after that the link to your object is copied into the array's node, after links "next" and "before" (or whatever they're called in java) are renewed, pointing to the node. Were your key-object mutated in the meanwhile, it wouldn't have no impact of next and before pointers. But the hash is toast now, I mean whether mutation changes hash code or not, which is also pretty easy to implement, either way make the value unreachable outside of the map sooner or later, but because the pointers inside the map still live, the value is hardly going to be garbage-collected, unless we make use of weak- or softHashmap.
in short-lived-objects it can by considerable, but in long-term state like caching or it can cause a huge pain in the ass. As for me. imho
Well, if we have to do with kinda object that we send to the client and later it's supposed to come back, well then our client will probably have done some mutations on it, won't it. That's why I'd rather call hashCode() on our object-to-send by myself, put this hashcode integer value as key into the map and store it into the specific field in our object-to-send. Once it's back again, I just get the stored value from the field and can keep using it as key. The hashCode() here works like an non-unique id.
What is head and tail.
head is the start of the LinkedList & tail is the end of LinkedList. Understanding Linkedlist would help in understanding hashmaps better
Good more helpful 👍
Thank you 🙏🏻
Yesterday in an Interview,this question was asked to me..i could not explain it..😞😞
Hope this video helps and you will rock next interview
first one 🙏🏻
Thanks Kavita 🙏🏻