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 4237956
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 21, 20262026-05-21T02:50:31+00:00 2026-05-21T02:50:31+00:00

Just wondering if HashSet.equals(anotherHashSet) runs in constant time (also with a ConcurrentHashSet as argument),

  • 0

Just wondering if HashSet.equals(anotherHashSet) runs in constant time (also with a ConcurrentHashSet as argument), which I’m assuming it does for efficiency reasons. Can’t see anything which mentions it, and a portion of the framework I’m building relies on the functionality (wouldn’t want it to take too long!).

Edit: sorry, realised that there was no way that HashSet.equals() could ever run in constant time, since the elements can change while the hashcode for the elements in the map remains the same. Therefore, the best way to approach this problem would be to use hashcode. Does it reek of a code smell though?

  • 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-21T02:50:31+00:00Added an answer on May 21, 2026 at 2:50 am

    Looking at a typical implementation shows that it does containsAll. Each check to contains is going to be O(1) and N of them are going to have to be made, so I reckon O(N).

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

Sidebar

Related Questions

Just wondering: I'm trying to set up an adaptive image handler in Coldfusion8, which
Just wondering what the best (fastest execution time) method for translating the following SQL
Just wondering which Xcode syntax colouring 'theme' all you guys use, and why??
just wondering which approach would be better if both blocks of code would yield
Just wondering. I have a page in Jquery Mobile which uses a popup that
Just wondering from where does the snooze pop up gets triggered when using ScheduledNotification,
I was just wondering if it was a good idea to override equals and
Just wondering whether it is possible to update a ByteArray in C Code, which
just wondering if there is a way to reduce the amount of code needed
Just wondering the best way to replace in place matches on a string. value.replace(bob,

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.