Returns a value > 0 if the set passed as second parameter is a subset of the set passed as first parameter, ie.

Returns a value > 0 if the set passed as second parameter is a subset of the set passed as first parameter, ie. the first set contains all of the elements in the second set.This implementation iterates over the set passed as second parameter, checking each element returned by the iterator in turn to see if it's contained in the set passed as first parameter.

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 tree sets this method has a time complexity of O((Log N) * M), with N being the size of the first set and M being the size of the second set.

**Parameters:****setA**- Superset to check**setB**- Subset to check**Returns:**- int rc > 0: The set contains all of the elements in the specified collection.

int rc == 0: The set does not contain all of the elements.

int rc < 0: An error, see pbl_errno:

PBL_ERROR_PARAM_COLLECTION - The collection cannot be iterated.

PBL_ERROR_CONCURRENT_MODIFICATION - The collection was modified concurrently.

This page was generated with the help of DOC++.