Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
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.
Will the Enumerable.Distinct method remove all duplicates from a collection implementing IEnumerable even if it is not sorted?
I’m coming from a C++ background and wonder if Distinct behaves similiar to C++ unique algorithm where the sequence has to be sorted.
Yes.
Note that you need to implement the
IEqualityComparer<T>interface and it’sEqualsandGetHashCodemethods for custom types.