Is there anything similar to a slice.contains(object) method in Go without having to do a search through each element in a slice?
Is there anything similar to a slice.contains(object) method in Go without having to do
Share
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.
Mostafa has already pointed out that such a method is trivial to write, and mkb gave you a hint to use the binary search from the sort package. But if you are going to do a lot of such contains checks, you might also consider using a map instead.
It’s trivial to check if a specific map key exists by using the
value, ok := yourmap[key]idiom. Since you aren’t interested in the value, you might also create amap[string]struct{}for example. Using an emptystruct{}here has the advantage that it doesn’t require any additional space and Go’s internal map type is optimized for that kind of values. Therefore,map[string] struct{}is a popular choice for sets in the Go world.