prompt: You will be provided with a partial code base and an issue statement explaining a problem to resolve.
  <issue>
  Enter the logic for hash table
  ### Describe your change:
  
  
  
  * [ ] Add an algorithm?
  * [ ] Fix a bug or typo in an existing algorithm?
  * [x] Documentation change?
  
  ### Checklist:
  * [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
  * [x] This pull request is all my own work -- I have not plagiarized.
  * [x] I know that pull requests will not be merged if they fail the automated tests.
  * [ ] This PR only changes one algorithm file.  To ease review, please open separate PRs for separate algorithms.
  * [ ] All new Python files are placed inside an existing directory.
  * [x] All filenames are in all lowercase characters with no spaces or dashes.
  * [x] All functions and variable names follow Python naming conventions.
  * [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
  * [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
  * [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
  * [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
  
  
  </issue>
  <code>
  [start of data_structures/hashing/double_hash.py]
  1 #!/usr/bin/env python3
  2 from .hash_table import HashTable
  3 from .number_theory.prime_numbers import is_prime, next_prime
  4 
  5 
  6 class DoubleHash(HashTable):
  7     """
  8     Hash Table example with open addressing and Double Hash
  9     """
  10 
  11     def __init__(self, *args, **kwargs):
  12         super().__init__(*args, **kwargs)
  13 
  14     def __hash_function_2(self, value, data):
  15 
  16         next_prime_gt = (
  17             next_prime(value % self.size_table)
  18             if not is_prime(value % self.size_table)
  19             else value % self.size_table
  20         )  # gt = bigger than
  21         return next_prime_gt - (data % next_prime_gt)
  22 
  23     def __hash_double_function(self, key, data, increment):
  24         return (increment * self.__hash_function_2(key, data)) % self.size_table
  25 
  26     def _collision_resolution(self, key, data=None):
  27         i = 1
  28         new_key = self.hash_function(data)
  29 
  30         while self.values[new_key] is not None and self.values[new_key] != key:
  31             new_key = (
  32                 self.__hash_double_function(key, data, i)
  33                 if self.balanced_factor() >= self.lim_charge
  34                 else None
  35             )
  36             if new_key is None:
  37                 break
  38             else:
  39                 i += 1
  40 
  41         return new_key
  42
  [end of data_structures/hashing/double_hash.py]
  </code>
  
  I need you to solve this issue by generating a single patch file that I can apply directly to this repository using git apply. Please respond with a single patch file in the following format.
  <patch>
  diff --git a/file.py b/file.py
  --- a/file.py
  +++ b/file.py
  @@ -1,27 +1,35 @@
   def euclidean(a, b):
  -    while b:
  -        a, b = b, a % b
  -    return a
  +    if b == 0:
  +        return a
  +    return euclidean(b, a % b)
   
   
   def bresenham(x0, y0, x1, y1):
       points = []
       dx = abs(x1 - x0)
       dy = abs(y1 - y0)
  -    sx = 1 if x0 < x1 else -1
  -    sy = 1 if y0 < y1 else -1
  -    err = dx - dy
  +    x, y = x0, y0
  +    sx = -1 if x0 > x1 else 1
  +    sy = -1 if y0 > y1 else 1
   
  -    while True:
  -        points.append((x0, y0))
  -        if x0 == x1 and y0 == y1:
  -            break
  -        e2 = 2 * err
  -        if e2 > -dy:
  -            err -= dy
  -            x0 += sx
  -        if e2 < dx:
  -            err += dx
  -            y0 += sy
  +    if dx > dy:
  +        err = dx / 2.0
  +        while x != x1:
  +            points.append((x, y))
  +            err -= dy
  +            if err < 0:
  +                y += sy
  +                err += dx
  +            x += sx
  +    else:
  +        err = dy / 2.0
  +        while y != y1:
  +            points.append((x, y))
  +            err -= dx
  +            if err < 0:
  +                x += sx
  +                err += dy
  +            y += sy
  +
  +    points.append((x, y))
       return points
  
  </patch>
golden_diff: diff --git a/data_structures/hashing/double_hash.py b/data_structures/hashing/double_hash.py
  --- a/data_structures/hashing/double_hash.py
  +++ b/data_structures/hashing/double_hash.py
  @@ -1,4 +1,16 @@
   #!/usr/bin/env python3
  +"""
  +Double hashing is a collision resolving technique in Open Addressed Hash tables.
  +Double hashing uses the idea of applying a second hash function to key when a collision
  +occurs. The advantage of Double hashing is that it is one of the best form of  probing,
  +producing a uniform distribution of records throughout a hash table. This technique
  +does not yield any clusters. It is one of effective method for resolving collisions.
  +
  +Double hashing can be done using: (hash1(key) + i * hash2(key)) % TABLE_SIZE
  +Where hash1() and hash2() are hash functions and TABLE_SIZE is size of hash table.
  +
  +Reference: https://en.wikipedia.org/wiki/Double_hashing
  +"""
   from .hash_table import HashTable
   from .number_theory.prime_numbers import is_prime, next_prime
  
verification_info: {"golden_diff": "diff --git a/data_structures/hashing/double_hash.py b/data_structures/hashing/double_hash.py\n--- a/data_structures/hashing/double_hash.py\n+++ b/data_structures/hashing/double_hash.py\n@@ -1,4 +1,16 @@\n #!/usr/bin/env python3\n+\"\"\"\n+Double hashing is a collision resolving technique in Open Addressed Hash tables.\n+Double hashing uses the idea of applying a second hash function to key when a collision\n+occurs. The advantage of Double hashing is that it is one of the best form of  probing,\n+producing a uniform distribution of records throughout a hash table. This technique\n+does not yield any clusters. It is one of effective method for resolving collisions.\n+\n+Double hashing can be done using: (hash1(key) + i * hash2(key)) % TABLE_SIZE\n+Where hash1() and hash2() are hash functions and TABLE_SIZE is size of hash table.\n+\n+Reference: https://en.wikipedia.org/wiki/Double_hashing\n+\"\"\"\n from .hash_table import HashTable\n from .number_theory.prime_numbers import is_prime, next_prime\n", "issue": "Enter the logic for hash table\n### Describe your change:\r\n\r\n\r\n\r\n* [ ] Add an algorithm?\r\n* [ ] Fix a bug or typo in an existing algorithm?\r\n* [x] Documentation change?\r\n\r\n### Checklist:\r\n* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).\r\n* [x] This pull request is all my own work -- I have not plagiarized.\r\n* [x] I know that pull requests will not be merged if they fail the automated tests.\r\n* [ ] This PR only changes one algorithm file.  To ease review, please open separate PRs for separate algorithms.\r\n* [ ] All new Python files are placed inside an existing directory.\r\n* [x] All filenames are in all lowercase characters with no spaces or dashes.\r\n* [x] All functions and variable names follow Python naming conventions.\r\n* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).\r\n* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.\r\n* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.\r\n* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.\r\n\n", "before_files": [{"content": "#!/usr/bin/env python3\nfrom .hash_table import HashTable\nfrom .number_theory.prime_numbers import is_prime, next_prime\n\n\nclass DoubleHash(HashTable):\n    \"\"\"\n    Hash Table example with open addressing and Double Hash\n    \"\"\"\n\n    def __init__(self, *args, **kwargs):\n        super().__init__(*args, **kwargs)\n\n    def __hash_function_2(self, value, data):\n\n        next_prime_gt = (\n            next_prime(value % self.size_table)\n            if not is_prime(value % self.size_table)\n            else value % self.size_table\n        )  # gt = bigger than\n        return next_prime_gt - (data % next_prime_gt)\n\n    def __hash_double_function(self, key, data, increment):\n        return (increment * self.__hash_function_2(key, data)) % self.size_table\n\n    def _collision_resolution(self, key, data=None):\n        i = 1\n        new_key = self.hash_function(data)\n\n        while self.values[new_key] is not None and self.values[new_key] != key:\n            new_key = (\n                self.__hash_double_function(key, data, i)\n                if self.balanced_factor() >= self.lim_charge\n                else None\n            )\n            if new_key is None:\n                break\n            else:\n                i += 1\n\n        return new_key\n", "path": "data_structures/hashing/double_hash.py"}]}