Returns a value > 0 if this set contains all of the elements in the specified collection.
Returns a value > 0 if this set contains all of the elements in the specified collection.This implementation iterates over the specified collection, checking each element returned by the iterator in turn to see if it's contained in this set. If all elements are so contained a value > 0 is returned, otherwise 0.
For hash sets this method has a time complexity of O(M) and for hash sets this method has a time complexity of O(Log N * M), with N being the size of the set and M being the size of the collection.