Merge branch 'feature/quotes' into develop

codejsha · codejsha · commit e19812961ee0 · 2024-02-11T11:45:56.000+09:00
diff --git a/python-algorithm/algorithm/greedy/test/test_cashier_change.py b/python-algorithm/algorithm/greedy/test/test_cashier_change.py
@@ -3,14 +3,14 @@
 from algorithm.greedy.cashier_change import cashier_change
 
 
-@pytest.mark.benchmark(group="cashier_change")
+@pytest.mark.benchmark(group='cashier_change')
 @pytest.mark.parametrize(
-    argnames="denominations, price, expected",
+    argnames='denominations, price, expected',
     argvalues=[
         ([25, 10, 5, 1], 30, 2),
         ([25, 10, 5, 1], 24, 6)
     ],
-    ids=["case1", "case2"])
+    ids=['case1', 'case2'])
 def test_cashier_change(benchmark, denominations, price, expected):
     result = benchmark(cashier_change, denominations, price)
     assert expected == result
diff --git a/python-algorithm/algorithm/greedy/test/test_interval_schedule.py b/python-algorithm/algorithm/greedy/test/test_interval_schedule.py
@@ -15,11 +15,11 @@
             'end': time.strptime('2022-07-25 12:00:00', '%Y-%m-%d %H:%M:%S')}
 
 
-@pytest.mark.benchmark(group="interval_scheduling_lecture")
+@pytest.mark.benchmark(group='interval_scheduling_lecture')
 @pytest.mark.parametrize(
-    argnames="lectures, expected",
+    argnames='lectures, expected',
     argvalues=[([lecture1, lecture2, lecture3], [lecture2, lecture3])],
-    ids=["case1"])
+    ids=['case1'])
 def test_interval_scheduling_lecture(benchmark, lectures, expected):
     result = benchmark(interval_scheduling_lecture, lectures)
     assert expected == result
diff --git a/python-algorithm/algorithm/math/test/test_addition_integer.py b/python-algorithm/algorithm/math/test/test_addition_integer.py
@@ -3,11 +3,11 @@
 from algorithm.math.binary_operation import addition_binary_number
 
 
-@pytest.mark.benchmark(group="addition_of_binary_number")
+@pytest.mark.benchmark(group='addition_of_binary_number')
 @pytest.mark.parametrize(
-    argnames="a, b, expected",
+    argnames='a, b, expected',
     argvalues=[('1110', '1011', '11001')],
-    ids=["case1"])
+    ids=['case1'])
 def test_addition_of_binary_number(benchmark, a, b, expected):
     result = benchmark(addition_binary_number, a, b)
     assert expected == result
diff --git a/python-algorithm/algorithm/math/test/test_base_expansion.py b/python-algorithm/algorithm/math/test/test_base_expansion.py
@@ -3,15 +3,15 @@
 from algorithm.math.base_expansion import base_expansion
 
 
-@pytest.mark.benchmark(group="base_expansion")
+@pytest.mark.benchmark(group='base_expansion')
 @pytest.mark.parametrize(
-    argnames="number, base, expected",
+    argnames='number, base, expected',
     argvalues=[
         (12345, 8, '30071'),
         (177130, 16, '2B3EA'),
         (241, 2, '11110001')
     ],
-    ids=["base8", "base16", "base2"])
+    ids=['base8', 'base16', 'base2'])
 def test_base_expansion(benchmark, number, base, expected):
     result = benchmark(base_expansion, number, base)
     assert expected == result
diff --git a/python-algorithm/algorithm/math/test/test_greatest_common_divisor.py b/python-algorithm/algorithm/math/test/test_greatest_common_divisor.py
@@ -3,9 +3,9 @@
 from algorithm.math.greatest_common_divisor import gcd_euclidean, gcd_euclidean_divmod, gcd_extended_euclidean
 
 
-@pytest.mark.benchmark(group="gcd_euclidean")
+@pytest.mark.benchmark(group='gcd_euclidean')
 @pytest.mark.parametrize(
-    argnames="pair, expected",
+    argnames='pair, expected',
     argvalues=[
         ((24, 36), 12),
         ((17, 22), 1),
@@ -17,9 +17,9 @@ def test_gcd_euclidean(benchmark, pair, expected):
     assert expected == result
 
 
-@pytest.mark.benchmark(group="gcd_euclidean_divmod")
+@pytest.mark.benchmark(group='gcd_euclidean_divmod')
 @pytest.mark.parametrize(
-    argnames="pair, expected",
+    argnames='pair, expected',
     argvalues=[
         ((24, 36), 12),
         ((17, 22), 1),
@@ -31,9 +31,9 @@ def test_gcd_euclidean_divmod(benchmark, pair, expected):
     assert expected == result
 
 
-@pytest.mark.benchmark(group="gcd_extended_euclidean")
+@pytest.mark.benchmark(group='gcd_extended_euclidean')
 @pytest.mark.parametrize(
-    argnames="pair, expected",
+    argnames='pair, expected',
     argvalues=[
         ((24, 36), (12, -1, 1)),
         ((17, 22), (1, -9, 7)),
diff --git a/python-algorithm/algorithm/math/test/test_least_common_multiple.py b/python-algorithm/algorithm/math/test/test_least_common_multiple.py
@@ -3,9 +3,9 @@
 from algorithm.math.least_common_multiple import lcm
 
 
-@pytest.mark.benchmark(group="lcm")
+@pytest.mark.benchmark(group='lcm')
 @pytest.mark.parametrize(
-    argnames="pair, expected",
+    argnames='pair, expected',
     argvalues=[
         ((24, 36), 72),
         ((17, 22), 374),
diff --git a/python-algorithm/algorithm/math/test/test_matrix_multiplication.py b/python-algorithm/algorithm/math/test/test_matrix_multiplication.py
@@ -8,21 +8,21 @@
 matrix_ab = np.array([[22, 28], [49, 64]])
 
 
-@pytest.mark.benchmark(group="matrix_multiplication")
+@pytest.mark.benchmark(group='matrix_multiplication')
 @pytest.mark.parametrize(
-    argnames="a, b, expected",
+    argnames='a, b, expected',
     argvalues=[(matrix_a, matrix_b, matrix_ab)],
-    ids=["multiply_matrix"])
+    ids=['multiply_matrix'])
 def test_matrix_multiplication1(benchmark, a, b, expected):
     result = benchmark(multiply_matrix, a, b)
     assert np.array_equal(expected, result)
 
 
-@pytest.mark.benchmark(group="matrix_multiplication")
+@pytest.mark.benchmark(group='matrix_multiplication')
 @pytest.mark.parametrize(
-    argnames="a, b, expected",
+    argnames='a, b, expected',
     argvalues=[(matrix_a, matrix_b, matrix_ab)],
-    ids=["np.dot"])
+    ids=['np.dot'])
 def test_matrix_multiplication2(benchmark, a, b, expected):
     result = benchmark(np.dot, a, b)
     assert np.array_equal(expected, result)
diff --git a/python-algorithm/algorithm/search/generic_search.py b/python-algorithm/algorithm/search/generic_search.py
@@ -1,7 +1,7 @@
 from typing import TypeVar, Iterable, Tuple, List, Sequence
 
 T = TypeVar('T')
-C = TypeVar("C", bound="Comparable")
+C = TypeVar('C', bound='Comparable')
 
 
 def generic_linear_contains(iterable: Iterable[T], key: T) -> bool:
diff --git a/python-algorithm/algorithm/search/test/test_binary_search.py b/python-algorithm/algorithm/search/test/test_binary_search.py
@@ -3,14 +3,14 @@
 from algorithm.search.binary_search import binary_search
 
 
-@pytest.mark.benchmark(group="binary_search")
+@pytest.mark.benchmark(group='binary_search')
 @pytest.mark.parametrize(
-    argnames="sequence, target, expected",
+    argnames='sequence, target, expected',
     argvalues=[
         ([1, 2, 3, 4, 5], 5, 4),
         ([1, 2, 3, 4, 5], 6, -1)
     ],
-    ids=["case1", "case2"])
+    ids=['case1', 'case2'])
 def test_binary_search(benchmark, sequence, target, expected):
     result = benchmark(binary_search, sequence, target)
     assert expected == result
diff --git a/python-algorithm/algorithm/search/test/test_dna_search.py b/python-algorithm/algorithm/search/test/test_dna_search.py
@@ -2,35 +2,35 @@
 from algorithm.search.dna_search import Nucleotide, string_to_gene, linear_contains, binary_contains
 
 
-@pytest.mark.benchmark(group="linear_contains")
+@pytest.mark.benchmark(group='linear_contains')
 @pytest.mark.parametrize(
-    argnames="gene, key_codon, expected",
+    argnames='gene, key_codon, expected',
     argvalues=[
-        (string_to_gene("ACGTGGCTCTCTAACGTACGTACGTACGGGGTTTATATATACCCTAGGACTCCCTTT"),
+        (string_to_gene('ACGTGGCTCTCTAACGTACGTACGTACGGGGTTTATATATACCCTAGGACTCCCTTT'),
          (Nucleotide.A, Nucleotide.C, Nucleotide.G),
          True),
-        (string_to_gene("ACGTGGCTCTCTAACGTACGTACGTACGGGGTTTATATATACCCTAGGACTCCCTTT"),
+        (string_to_gene('ACGTGGCTCTCTAACGTACGTACGTACGGGGTTTATATATACCCTAGGACTCCCTTT'),
          (Nucleotide.G, Nucleotide.A, Nucleotide.T),
          False),
     ],
-    ids=["found", "not_found"])
+    ids=['found', 'not_found'])
 def test_linear_contains(benchmark, gene, key_codon, expected):
     result = benchmark(linear_contains, gene, key_codon)
     assert expected == result
 
 
-@pytest.mark.benchmark(group="binary_contains")
+@pytest.mark.benchmark(group='binary_contains')
 @pytest.mark.parametrize(
-    argnames="gene, key_codon, expected",
+    argnames='gene, key_codon, expected',
     argvalues=[
-        (sorted(string_to_gene("ACGTGGCTCTCTAACGTACGTACGTACGGGGTTTATATATACCCTAGGACTCCCTTT")),
+        (sorted(string_to_gene('ACGTGGCTCTCTAACGTACGTACGTACGGGGTTTATATATACCCTAGGACTCCCTTT')),
          (Nucleotide.A, Nucleotide.C, Nucleotide.G),
          True),
-        (sorted(string_to_gene("ACGTGGCTCTCTAACGTACGTACGTACGGGGTTTATATATACCCTAGGACTCCCTTT")),
+        (sorted(string_to_gene('ACGTGGCTCTCTAACGTACGTACGTACGGGGTTTATATATACCCTAGGACTCCCTTT')),
          (Nucleotide.G, Nucleotide.A, Nucleotide.T),
          False),
     ],
-    ids=["found", "not_found"])
+    ids=['found', 'not_found'])
 def test_binary_contains(benchmark, gene, key_codon, expected):
     result = benchmark(binary_contains, gene, key_codon)
     assert expected == result
diff --git a/python-algorithm/algorithm/search/test/test_generic_search.py b/python-algorithm/algorithm/search/test/test_generic_search.py
@@ -2,26 +2,26 @@
 from algorithm.search.generic_search import generic_linear_contains, generic_binary_contains
 
 
-@pytest.mark.benchmark(group="linear_contains")
+@pytest.mark.benchmark(group='linear_contains')
 @pytest.mark.parametrize(
-    argnames="elements, target, expected",
+    argnames='elements, target, expected',
     argvalues=[
         ([1, 5, 15, 15, 15, 15, 20], 5, True)
     ],
-    ids=["found"])
+    ids=['found'])
 def test_generic_linear_contains(benchmark, elements, target, expected):
     result = benchmark(generic_linear_contains, elements, target)
     assert expected == result
 
 
-@pytest.mark.benchmark(group="binary_contains")
+@pytest.mark.benchmark(group='binary_contains')
 @pytest.mark.parametrize(
-    argnames="elements, target, expected",
+    argnames='elements, target, expected',
     argvalues=[
-        (["a", "d", "e", "f", "z"], "f", True),
-        (["john", "mark", "ronald", "sarah"], "sheila", False)
+        (['a', 'd', 'e', 'f', 'z'], 'f', True),
+        (['john', 'mark', 'ronald', 'sarah'], 'sheila', False)
     ],
-    ids=["found", "not_found"])
+    ids=['found', 'not_found'])
 def test_generic_binary_contains(benchmark, elements, target, expected):
     result = benchmark(generic_binary_contains, elements, target)
     assert expected == result
diff --git a/python-algorithm/algorithm/search/test/test_linear_search.py b/python-algorithm/algorithm/search/test/test_linear_search.py
@@ -3,14 +3,14 @@
 from algorithm.search.linear_search import linear_search
 
 
-@pytest.mark.benchmark(group="linear_search")
+@pytest.mark.benchmark(group='linear_search')
 @pytest.mark.parametrize(
-    argnames="sequence, target, expected",
+    argnames='sequence, target, expected',
     argvalues=[
         ([1, 2, 3, 4, 5], 5, 4),
         ([1, 2, 3, 4, 5], 6, -1)
     ],
-    ids=["found1", "found2"])
+    ids=['found1', 'found2'])
 def test_linear_search(benchmark, sequence, target, expected):
     result = benchmark(linear_search, sequence, target)
     assert expected == result
diff --git a/python-algorithm/algorithm/string/test/test_naive_string_matcher.py b/python-algorithm/algorithm/string/test/test_naive_string_matcher.py
@@ -3,11 +3,11 @@
 from algorithm.string.naive_string_search import naive_string_matcher
 
 
-@pytest.mark.benchmark(group="naive_string_matcher")
+@pytest.mark.benchmark(group='naive_string_matcher')
 @pytest.mark.parametrize(
-    argnames="text, pattern, expected",
+    argnames='text, pattern, expected',
     argvalues=[('eceyeye', 'eye', [2, 4])],
-    ids=["case1"])
+    ids=['case1'])
 def test_naive_string_matcher(benchmark, text, pattern, expected):
     result = benchmark(naive_string_matcher, text, pattern)
     assert expected == result
