How is the search for an element inside a HashSet structure carried out and what is its time complexity?

HashSet is based on a hash table. When searching for an element, its hash code is first computed, then the index of the bucket in the array is determined. After that, the element is searched within this bucket, usually through comparison using equals. The average time complexity of searching in a HashSet is O(1), meaning constant time, assuming a uniform distribution of hashes and low collision.