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.
I’m in the position of extending LinkedList and implement Set, so that I have a list with no duplicates. I’m wondering if such an implementation doesn’t exist already?
All I’m planning to do is to override the add(e) method to first look-up the element, and if present don’t add it. Something like:
add(E){
if(get(E) == null) super.add(E);
}
No Java implementation exists in the standard collections.
However, you can take a look at SetUniqueList from the Common Collections which may be along the lines of what you are looking for.