Merge branch 'master' into issue-2-knn-distance

Author: kdt523

data_structures/queues/circular_queue.py

@@ -17,7 +17,7 @@ def __len__(self) -> int:
         >>> len(cq)
         0
         >>> cq.enqueue("A")  # doctest: +ELLIPSIS
-        <data_structures.queues.circular_queue.CircularQueue object at ...
+        <data_structures.queues.circular_queue.CircularQueue object at ...>
         >>> cq.array
         ['A', None, None, None, None]
         >>> len(cq)
@@ -51,17 +51,24 @@ def enqueue(self, data):
         """
         This function inserts an element at the end of the queue using self.rear value
         as an index.
+
         >>> cq = CircularQueue(5)
         >>> cq.enqueue("A")  # doctest: +ELLIPSIS
-        <data_structures.queues.circular_queue.CircularQueue object at ...
+        <data_structures.queues.circular_queue.CircularQueue object at ...>
         >>> (cq.size, cq.first())
         (1, 'A')
         >>> cq.enqueue("B")  # doctest: +ELLIPSIS
-        <data_structures.queues.circular_queue.CircularQueue object at ...
+        <data_structures.queues.circular_queue.CircularQueue object at ...>
         >>> cq.array
         ['A', 'B', None, None, None]
         >>> (cq.size, cq.first())
         (2, 'A')
+        >>> cq.enqueue("C").enqueue("D").enqueue("E")  # doctest: +ELLIPSIS
+        <data_structures.queues.circular_queue.CircularQueue object at ...>
+        >>> cq.enqueue("F")
+        Traceback (most recent call last):
+           ...
+        Exception: QUEUE IS FULL
         """
         if self.size >= self.n:
             raise Exception("QUEUE IS FULL")
@@ -75,6 +82,7 @@ def dequeue(self):
         """
         This function removes an element from the queue using on self.front value as an
         index and returns it
+
         >>> cq = CircularQueue(5)
         >>> cq.dequeue()
         Traceback (most recent call last):

graphs/graph_adjacency_list.py

@@ -61,6 +61,15 @@ def add_vertex(self, vertex: T) -> None:
         """
         Adds a vertex to the graph. If the given vertex already exists,
         a ValueError will be thrown.
+
+        >>> g = GraphAdjacencyList(vertices=[], edges=[], directed=False)
+        >>> g.add_vertex("A")
+        >>> g.adj_list
+        {'A': []}
+        >>> g.add_vertex("A")
+        Traceback (most recent call last):
+        ...
+        ValueError: Incorrect input: A is already in the graph.
         """
         if self.contains_vertex(vertex):
             msg = f"Incorrect input: {vertex} is already in the graph."

machine_learning/apriori_algorithm.py

@@ -11,6 +11,7 @@
 Examples: https://www.kaggle.com/code/earthian/apriori-association-rules-mining
 """
 
+from collections import Counter
 from itertools import combinations
 
 
@@ -44,11 +45,16 @@ def prune(itemset: list, candidates: list, length: int) -> list:
     >>> prune(itemset, candidates, 3)
     []
     """
+    itemset_counter = Counter(tuple(item) for item in itemset)
     pruned = []
     for candidate in candidates:
         is_subsequence = True
         for item in candidate:
-            if item not in itemset or itemset.count(item) < length - 1:
+            item_tuple = tuple(item)
+            if (
+                item_tuple not in itemset_counter
+                or itemset_counter[item_tuple] < length - 1
+            ):
                 is_subsequence = False
                 break
         if is_subsequence:

maths/test_factorial.py

@@ -33,5 +33,11 @@ def test_negative_number(function):
         function(-3)
 
 
+@pytest.mark.parametrize("function", [factorial, factorial_recursive])
+def test_float_number(function):
+    with pytest.raises(ValueError):
+        function(1.5)
+
+
 if __name__ == "__main__":
     pytest.main(["-v", __file__])