In Python, the raise keyword is primarily used for exception handling. Exception handling is responsible for handling exceptions or errors so that the system does not fail due to incorrect code.
The raise keyword generates an error and halts the program’s control flow. It is used to invoke the current exception handler so that it can be handled further up the call stack.
Syntax:
raise {name_of_ the_ exception_class}
Example:
The code below demonstrates a program that raises an error if the value of the variable x
is lower than 0:
# Input
x = -1
# Use of "raise"
if x < 0:
raise Exception("Sorry, no numbers below zero allowed")
Output:
Traceback (most recent call last):
File "<string>", line 6, in <module>
Exception: Sorry, no numbers below zero allowed
Note: While raising an error, we can also specify the type of error and, if necessary, print out a text.
There is no requirement to provide an exception class when we use the raise keyword. When we use the raise keyword without specifying an exception class name, it reraises the last exception that occurred. This is used generally inside an except code block to reraise an exception that is caught.
Example:
a = 10
b = 'a'
try:
print(a/b)
except ValueError:
raise
Output:
Traceback (most recent call last):
File "<string>", line 4, in <module>
TypeError: unsupported operand type(s) for /: 'int' and 'str'
Note: also read about Python Exception Handling – II(Finally Keyword )
Please follow me to read my latest post on programming and technology if you like my post.
https://www.instagram.com/coderz.py/
https://www.facebook.com/coderz.py
Staying up to the mark is what defines me. Hi all! I’m Rabecca Fatima a keen learner, great enthusiast, ready to take new challenges as stepping stones towards flying colors.
Problem Statement: Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. Example…
Given an integer A. Compute and return the square root of A. If A is…
Given a zero-based permutation nums (0-indexed), build an array ans of the same length where…
A heap is a specialized tree-based data structure that satisfies the heap property. It is…
What is the Lowest Common Ancestor? In a tree, the lowest common ancestor (LCA) of…