Free the set's memory from heap.
Free the set's memory from heap. Note: The memory of the elements themselves is not freed. For hash sets this method has a time complexity of O(1). For tree sets this method has a time complexity of O(N).
Note: The memory of the elements themselves is not freed.
For hash sets this method has a time complexity of O(1). For tree sets this method has a time complexity of O(N).
Alphabetic index
