prompt: You will be provided with a partial code base and an issue statement explaining a problem to resolve.
  <issue>
  Use cleaner solution for non-truncating division in python 2
  Prefer `from __future__ import division` to `1.*x/y`
  
  </issue>
  <code>
  [start of great_expectations/rule_based_profiler/types/__init__.py]
  1 from .attributes import Attributes  # isort:skip
  2 from .builder import Builder  # isort:skip
  3 
  4 from .domain import (  # isort:skip
  5     Domain,
  6     SemanticDomainTypes,
  7     InferredSemanticDomainType,
  8 )
  9 from .parameter_container import (  # isort:skip
  10     DOMAIN_KWARGS_PARAMETER_FULLY_QUALIFIED_NAME,
  11     FULLY_QUALIFIED_PARAMETER_NAME_SEPARATOR_CHARACTER,
  12     PARAMETER_KEY,
  13     VARIABLES_KEY,
  14     VARIABLES_PREFIX,
  15     ParameterNode,
  16     ParameterContainer,
  17     build_parameter_container,
  18     build_parameter_container_for_variables,
  19     is_fully_qualified_parameter_name_literal_string_format,
  20     get_parameter_value_by_fully_qualified_parameter_name,
  21     get_parameter_values_for_fully_qualified_parameter_names,
  22     get_fully_qualified_parameter_names,
  23 )
  24
  [end of great_expectations/rule_based_profiler/types/__init__.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/great_expectations/rule_based_profiler/types/__init__.py b/great_expectations/rule_based_profiler/types/__init__.py
  --- a/great_expectations/rule_based_profiler/types/__init__.py
  +++ b/great_expectations/rule_based_profiler/types/__init__.py
  @@ -9,6 +9,8 @@
   from .parameter_container import (  # isort:skip
       DOMAIN_KWARGS_PARAMETER_FULLY_QUALIFIED_NAME,
       FULLY_QUALIFIED_PARAMETER_NAME_SEPARATOR_CHARACTER,
  +    FULLY_QUALIFIED_PARAMETER_NAME_VALUE_KEY,
  +    FULLY_QUALIFIED_PARAMETER_NAME_METADATA_KEY,
       PARAMETER_KEY,
       VARIABLES_KEY,
       VARIABLES_PREFIX,
  
verification_info: {"golden_diff": "diff --git a/great_expectations/rule_based_profiler/types/__init__.py b/great_expectations/rule_based_profiler/types/__init__.py\n--- a/great_expectations/rule_based_profiler/types/__init__.py\n+++ b/great_expectations/rule_based_profiler/types/__init__.py\n@@ -9,6 +9,8 @@\n from .parameter_container import (  # isort:skip\n     DOMAIN_KWARGS_PARAMETER_FULLY_QUALIFIED_NAME,\n     FULLY_QUALIFIED_PARAMETER_NAME_SEPARATOR_CHARACTER,\n+    FULLY_QUALIFIED_PARAMETER_NAME_VALUE_KEY,\n+    FULLY_QUALIFIED_PARAMETER_NAME_METADATA_KEY,\n     PARAMETER_KEY,\n     VARIABLES_KEY,\n     VARIABLES_PREFIX,\n", "issue": "Use cleaner solution for non-truncating division in python 2\nPrefer `from __future__ import division` to `1.*x/y`\n", "before_files": [{"content": "from .attributes import Attributes  # isort:skip\nfrom .builder import Builder  # isort:skip\n\nfrom .domain import (  # isort:skip\n    Domain,\n    SemanticDomainTypes,\n    InferredSemanticDomainType,\n)\nfrom .parameter_container import (  # isort:skip\n    DOMAIN_KWARGS_PARAMETER_FULLY_QUALIFIED_NAME,\n    FULLY_QUALIFIED_PARAMETER_NAME_SEPARATOR_CHARACTER,\n    PARAMETER_KEY,\n    VARIABLES_KEY,\n    VARIABLES_PREFIX,\n    ParameterNode,\n    ParameterContainer,\n    build_parameter_container,\n    build_parameter_container_for_variables,\n    is_fully_qualified_parameter_name_literal_string_format,\n    get_parameter_value_by_fully_qualified_parameter_name,\n    get_parameter_values_for_fully_qualified_parameter_names,\n    get_fully_qualified_parameter_names,\n)\n", "path": "great_expectations/rule_based_profiler/types/__init__.py"}]}