mirror of
https://github.com/honeymoose/OpenSearch.git
synced 2025-03-25 01:19:02 +00:00
The shards in the set are mutated after they are added to the set such that the hashcode doesn't fit anymore. For this reason this used an identity hashset before but the downside of this is that the iteration order is not deterministic. We can just use a list since shard removal is a very rare action and the size of the list is very small such that iteration is fast.