Out of curiosity, what would be the alternative? (I have no experience with this game engine.)
- Hash (no predicting the order you find things in)?
- Heap (priority queue)?
Here is a different
List.Contains(item) give Boolean as a return value as it name suggest.
It can give you result of the "exact" item if use in generic type (List<T>)
List.Find(predicate) it give you an item that you inserted as a return value (kind of query thingy)
It can return a null if that item doesn't exist which you can use If() to check, So it can provide what Contains give and a bonus useful item if it found
So based on insta question I would say NO.
Because how you gonna have that exact item and throw into Contains function (a collection of all chores in the world can do it but it just plain bad).
With List.Find is more matched to the question eg. List.Find(x=>x.choreType==sweep) something like this can be use afterward.
Did klei use Find for chores ? IDK I didn't look into it.