Made all Exceptions public so they can be handled in client code

Author: VarunS2002

matrix_operations.py

@@ -5,7 +5,7 @@
 
 
 class MatrixOperations:
-    class __IncompatibleDimensionsError(Exception):
+    class IncompatibleDimensionsError(Exception):
         def __str__(self) -> str:
             return "Matrices are not compatible.\n" \
                    "No. of Columns in Matrix 1 have to be the same as No. of Rows in Matrix 2."
@@ -35,7 +35,7 @@ def addition(matrix_1: matrix, matrix_2: matrix) -> matrix:
         compatible_dim: bool
         dim_1, dim_2, same_dim, compatible_dim = MatrixOperations.__get_dimensions(matrix_1, matrix_2)
         if not same_dim:
-            raise MatrixOperations.__IncompatibleDimensionsError
+            raise MatrixOperations.IncompatibleDimensionsError
         sum_m: matrix = [[0 for cols in range(dim_1[1])] for rows in range(dim_1[0])]
         for i in range(0, dim_1[0]):
             for j in range(0, dim_1[1]):
@@ -51,7 +51,7 @@ def subtraction(matrix_1: matrix, matrix_2: matrix) -> matrix:
         compatible_dim: bool
         dim_1, dim_2, same_dim, compatible_dim = MatrixOperations.__get_dimensions(matrix_1, matrix_2)
         if not same_dim:
-            raise MatrixOperations.__IncompatibleDimensionsError
+            raise MatrixOperations.IncompatibleDimensionsError
         difference_m: matrix = [[0 for cols in range(dim_1[1])] for rows in range(dim_1[0])]
         for i in range(0, dim_1[0]):
             for j in range(0, dim_1[1]):
@@ -67,7 +67,7 @@ def multiplication(matrix_1: matrix, matrix_2: matrix) -> matrix:
         compatible_dim: bool
         dim_1, dim_2, same_dim, compatible_dim = MatrixOperations.__get_dimensions(matrix_1, matrix_2)
         if not compatible_dim:
-            raise MatrixOperations.__IncompatibleDimensionsError
+            raise MatrixOperations.IncompatibleDimensionsError
         product_m: matrix = [[0 for cols in range(dim_2[1])] for rows in range(dim_1[0])]
         for i in range(0, dim_1[0]):
             for j in range(0, dim_2[1]):

queue.py

@@ -2,7 +2,7 @@
 
 
 class _BaseQueue:
-    class _EmptyQueueError(Exception):
+    class EmptyQueueError(Exception):
         def __str__(self) -> str:
             return "Queue is empty."
 
@@ -36,7 +36,7 @@ def __eq__(self, other: 'SingleEndedQueue') -> bool:
 
     def first(self) -> Optional[object]:
         if self.is_empty():
-            raise self._EmptyQueueError
+            raise self.EmptyQueueError
         return self._data[self._front]
 
     def _resize(self, capacity: int) -> None:
@@ -57,7 +57,7 @@ def enqueue_back(self, element: Optional[object]) -> None:
 
     def dequeue_front(self) -> Optional[object]:
         if self.is_empty():
-            raise self._EmptyQueueError
+            raise self.EmptyQueueError
         element: Optional[object] = self._data[self._front]
         self._data[self._front] = None
         self._front = (self._front + 1) % len(self._data)
@@ -78,7 +78,7 @@ def __eq__(self, other: 'DoubleEndedQueue') -> bool:
 
     def last(self) -> Optional[object]:
         if self.is_empty():
-            raise self._EmptyQueueError
+            raise self.EmptyQueueError
         return self._data[self._back]
 
     def _resize(self, capacity: int) -> None:
@@ -104,7 +104,7 @@ def enqueue_front(self, element: Optional[object]) -> None:
 
     def dequeue_back(self) -> Optional[object]:
         if self.is_empty():
-            raise self._EmptyQueueError
+            raise self.EmptyQueueError
         back: int = (self._front + self._size - 1) % len(self._data)
         element: Optional[object] = self._data[back]
         self._data[back] = None

stack.py

@@ -1,5 +1,5 @@
 class Stack:
-    class __EmptyStackError(Exception):
+    class EmptyStackError(Exception):
         def __str__(self) -> str:
             return "Stack is empty."
 
@@ -27,7 +27,7 @@ def is_empty(self) -> bool:
 
     def top(self) -> object:
         if self.is_empty():
-            raise Stack.__EmptyStackError
+            raise Stack.EmptyStackError
         return self._data[-1]
 
     def push(self, element: object) -> None:
@@ -36,7 +36,7 @@ def push(self, element: object) -> None:
 
     def pop(self) -> object:
         if self.is_empty():
-            raise Stack.__EmptyStackError
+            raise Stack.EmptyStackError
         self._size -= 1
         return self._data.pop()
 

tower_of_hanoi_stack.py

@@ -2,11 +2,11 @@
 
 
 class TowerOfHanoi:
-    class __EmptySourceRodError(Exception):
+    class EmptySourceRodError(Exception):
         def __str__(self) -> str:
             return "Number of disks in the source rod cannot be less than 1."
 
-    class __AlreadySolvedError(Exception):
+    class AlreadySolvedError(Exception):
         def __str__(self) -> str:
             return "The puzzle has already been solved. Please reset the puzzle before adding more disks."
 
@@ -27,7 +27,7 @@ def add_disks(self, no_of_disks: int) -> None:
             for disk_id in reversed(range(1, self.__no_of_disks + 1)):
                 self.__source_rod.push(f'disk {disk_id}')
         else:
-            raise self.__AlreadySolvedError
+            raise self.AlreadySolvedError
 
     def display(self, show_title: bool = True) -> None:
         if show_title:
@@ -57,7 +57,7 @@ def __tower_of_hanoi(self, disks: int, source: Stack, destination: Stack, auxili
 
     def solve(self, display_steps: bool = False) -> None:
         if self.__no_of_disks < 1:
-            raise self.__EmptySourceRodError
+            raise self.EmptySourceRodError
         if display_steps:
             print("Steps:")
         self.__tower_of_hanoi(len(self.__source_rod), self.__source_rod, self.__destination_rod, self.__auxiliary_rod,