How do collections implement Remove and Contains?

In particular, in the case of records. Do they look for exact references, or do they apply the record equality test as I'd expect them to?

Let's say I've got a simple record like:

record S(int X, string Y);

record S(int X, string Y);

And I've got a collection of

, such as a

HashSet

HashSet

. Will the HashSet test the values of

and

and return true if it finds that the HashSet contains such an element? Or will it need the exact reference to

?

That is, would the following be enough to find a reference containing an

instance with

X = 5

X = 5

and

Y = "42"

Y = "42"

return HashSet.Contains(new S(5, "42"));

return HashSet.Contains(new S(5, "42"));

C#•4y ago•

4 replies

Vir Godem

How do collections implement Remove and Contains?

In particular, in the case of records. Do they look for exact references, or do they apply the record equality test as I'd expect them to?

Let's say I've got a simple record like:

record S(int X, string Y);

record S(int X, string Y);

And I've got a collection of

, such as a

HashSet

HashSet

. Will the HashSet test the values of

and

and return true if it finds that the HashSet contains such an element? Or will it need the exact reference to

?

That is, would the following be enough to find a reference containing an

instance with

X = 5

X = 5

and

Y = "42"

Y = "42"

return HashSet.Contains(new S(5, "42"));

return HashSet.Contains(new S(5, "42"));

How do collections implement Remove and Contains?

Similar Threads

How do collections implement Remove and Contains?

Similar Threads

Similar Threads

Similar Threads