Learning Sections show
Set Methods in Python
A set is an unordered collection of unique elements. Python provides several built-in methods for manipulating sets:
1. add()
Adds an element to the set if it is not already present.
# Define a set
fruits = {'apple', 'banana', 'cherry'}
# Add an element to the set
fruits.add('orange')
print(fruits) # Output: {'banana', 'cherry', 'orange', 'apple'}
2. remove()
Removes the specified element from the set. Raises a KeyError if the element is not present.
# Remove an element from the set
fruits.remove('banana')
print(fruits) # Output: {'apple', 'cherry', 'orange'}
3. discard()
Removes the specified element from the set if it is present. Does not raise an error if the element is not present.
# Discard an element from the set
fruits.discard('grape')
print(fruits) # Output: {'apple', 'cherry', 'orange'}
4. pop()
Removes and returns an arbitrary element from the set. Raises a KeyError if the set is empty.
# Remove an arbitrary element from the set
removed_item = fruits.pop()
print(removed_item) # Output: apple
print(fruits) # Output: {'cherry', 'orange'}
5. clear()
Removes all elements from the set.
# Clear the set
fruits.clear()
print(fruits) # Output: set()
6. union()
Returns a new set containing all elements from the original set and the specified set(s).
# Define another set
more_fruits = {'banana', 'grape'}
# Perform union operation
combined_fruits = fruits.union(more_fruits)
print(combined_fruits) # Output: {'banana', 'grape', 'cherry', 'orange'}
7. intersection()
Returns a new set containing only the elements that are present in both sets.
# Perform intersection operation
common_fruits = fruits.intersection(more_fruits)
print(common_fruits) # Output: {'banana'}
8. difference()
Returns a new set containing the elements that are present in the original set but not in the specified set(s).
# Perform difference operation
unique_fruits = fruits.difference(more_fruits)
print(unique_fruits) # Output: {'cherry', 'orange'}
9. symmetric_difference()
Returns a new set containing the elements that are present in either set, but not both.
# Perform symmetric difference operation
symmetric_diff = fruits.symmetric_difference(more_fruits)
print(symmetric_diff) # Output: {'cherry', 'orange', 'grape'}
10. isdisjoint()
Returns True if two sets have no elements in common.
# Check if sets are disjoint
disjoint = fruits.isdisjoint(more_fruits)
print(disjoint) # Output: False
11. issubset()
Returns True if all elements of one set are present in another set.
# Check if a set is a subset
subset = fruits.issubset(combined_fruits)
print(subset) # Output: True
12. issuperset()
Returns True if all elements of one set are present in another set.
# Check if a set is a superset
superset = combined_fruits.issuperset(fruits)
print(superset) # Output: True