Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

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.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 6732251
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 26, 20262026-05-26T10:37:38+00:00 2026-05-26T10:37:38+00:00

This is part of my implementation aFList = new HashSet<Fault>(); bFList = new HashSet<Fault>();

  • 0

This is part of my implementation

aFList = new HashSet<Fault>();
bFList = new HashSet<Fault>();
oFList = new HashSet<Fault>();

temp.addAll(aFList);
temp.addAll(bFList);
oFList.addAll(temp);

Fault Class is as follows

public class Fault {
    int nodeIndex;
    boolean val;
}

Display() {
    Object [] temp;
    temp = aFList2.toArray();
    for(int i=0;i<temp.length;i++)
        ((Fault) temp[i]).display();
}

Results:

14_true 
6_true 
17_false 
16_false 
16_false 
9_false 
14_true 

Question: Why do I get repeated list elements? It might be because oFList already contained those elements but I thought a HashSet would take care of duplicates. Am I missing something?

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-26T10:37:39+00:00Added an answer on May 26, 2026 at 10:37 am

    If you’re going to put a class in a HashMap or HashSet, you MUST implement equals() and hashCode().

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Considering this part of a Java class, private List<Object> components = new ArrayList<Object>(); private
This part of my code works fine: #include <stdio.h> int main(){ //char somestring[3] =
How do you invoke something like this from C/C++ etc: Implementation: int foo(int a,
template<class Y> operator auto_ptr_ref<Y>() throw() { return auto_ptr_ref<Y>(release()); } It is part of implementation
This is a part algorithm-logic question (how to do it), part implementation question (how
Im looking at this implementation of DCT using cuda: http://www.cse.nd.edu/courses/cse60881/www/source_code/dct8x8/dct8x8_kernel1.cu The part in question
This part of my code is used to award a grade to a student
This part of an app that I am working on, I have the following
I have this part of script from my GAE application which uses webapp2, which
I want to code this part of a VB6 application in c#. How can

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.