Skip to main content

Set Methods in Python

 

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
Labels:

Popular posts from this blog

Generators in Python

  Learning Sections          show Generators in Python Generators are a special type of iterator in Python that allow you to iterate over a sequence of items without storing them all in memory at once. They are useful for generating large sequences of data on-the-fly, or for processing data in a memory-efficient manner. Creating Generators In Python, generators are created using generator functions or generator expressions: # Generator function def my_generator ( n ): for i in range ( n ): yield i # Generator expression my_generator = ( i for i in range ( 10 )) A generator function uses the yield keyword to yield values one at a time, while a generator expression creates an anonymous generator. Iterating Over Generators You can iterate over the values produced by a generator using a for loop: for value in my_generator ( 5 ): print ( value ) This w...
Read more

Walrus Operator in Python

  Learning Sections          show Walrus Operator in Python The walrus operator ( := ) is a new assignment operator introduced in Python 3.8. It allows you to assign values to variables as part of an expression, making certain constructs more concise. Basic Usage The basic syntax for the walrus operator is: variable_name := expression Here, variable_name is assigned the value of expression , and the result of the expression is also returned. Example: Simplifying Code Consider the following example where we find and print the length of a list if it's greater than 3: # Without walrus operator my_list = [ 1 , 2 , 3 , 4 ] if len ( my_list ) > 3 : length = len ( my_list ) print ( length ) # With walrus operator my_list = [ 1 , 2 , 3 , 4 ] if ( length := len ( my_list )) > 3 : print ( length ) In the second example, the walrus operator assigns the result of len(my...
Read more

Lambda Functions in Python

  Learning Sections          show Lambda Functions in Python Lambda functions, also known as anonymous functions, are small, unnamed functions defined with the lambda keyword. They can have any number of arguments but only one expression. Lambda functions are often used for short, throwaway functions that are not needed elsewhere in the code. 1. Basic Syntax The syntax for a lambda function is: lambda arguments : expression Example: add = lambda x , y : x + y print ( add ( 2 , 3 )) # Output: 5 2. Using Lambda with Built-in Functions Lambda functions are commonly used with built-in functions like map() , filter() , and sorted() . Example with map() : numbers = [ 1 , 2 , 3 , 4 , 5 ] squared = map ( lambda x : x ** 2 , numbers ) print ( list ( squared )) # Output: [1, 4, 9, 16, 25] Example with filter() : numbers = [ 1 , 2 , 3 , 4 , 5 ] even = filter ( lambd...
Read more