As LinkedHashMap/Set keeps the order of entry in the Collection so it leads to a little lower performance.
I want to know why this happens.
As LinkedHashMap/Set keeps the order of entry in the Collection so it leads to
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
As LinkedHashMap/Set keeps the order of entry in the Collection so it leads to a little lower performance.
I want to know why this happens.
LinkedHash[Map/Set]use doubly linked lists to keep track of the order of entries. So whenever an element is added, a new DLL node must be created. The allocation takes time, and several extra pointers need to be set.