def distance(self, other):
    '\n        Compute the distance from ``self`` to ``other``.\n\n        The distance is a reflexive, transitive, and anti-symmetric relation,\n        which establishes a total ordering amongst Vectors.\n\n        The distance is a function [Vector x Vector --> D]. D is a tuple of length\n        equal to the Vector ``rank``. The i-th entry of D, D_i, indicates whether\n        the i-th component of ``self``, self_i, precedes (< 0), equals (== 0), or\n        succeeds (> 0) the i-th component of ``other``, other_i.\n\n        In particular, the *absolute value* of D_i represents the number of\n        integer points that exist between self_i and sink_i.\n\n        Examples\n        --------\n                 | 3 |           | 1 |               |  2  |\n        source = | 2 | ,  sink = | 4 | , distance => | -2  |\n                 | 1 |           | 5 |               | -4  |\n\n        There are 2, 2, and 4 points between [3-2], [2-4], and [1-5], respectively.\n        '
    return (self - other)
Compute the distance from ``self`` to ``other``.

The distance is a reflexive, transitive, and anti-symmetric relation,
which establishes a total ordering amongst Vectors.

The distance is a function [Vector x Vector --> D]. D is a tuple of length
equal to the Vector ``rank``. The i-th entry of D, D_i, indicates whether
the i-th component of ``self``, self_i, precedes (< 0), equals (== 0), or
succeeds (> 0) the i-th component of ``other``, other_i.

In particular, the *absolute value* of D_i represents the number of
integer points that exist between self_i and sink_i.

Examples
--------
         | 3 |           | 1 |               |  2  |
source = | 2 | ,  sink = | 4 | , distance => | -2  |
         | 1 |           | 5 |               | -4  |

There are 2, 2, and 4 points between [3-2], [2-4], and [1-5], respectively.
def distance(self, other):
    '\n        Compute the distance from ``self`` to ``other``.\n\n        The distance is a reflexive, transitive, and anti-symmetric relation,\n        which establishes a total ordering amongst Vectors.\n\n        The distance is a function [Vector x Vector --> D]. D is a tuple of length\n        equal to the Vector ``rank``. The i-th entry of D, D_i, indicates whether\n        the i-th component of ``self``, self_i, precedes (< 0), equals (== 0), or\n        succeeds (> 0) the i-th component of ``other``, other_i.\n\n        In particular, the *absolute value* of D_i represents the number of\n        integer points that exist between self_i and sink_i.\n\n        Examples\n        --------\n                 | 3 |           | 1 |               |  2  |\n        source = | 2 | ,  sink = | 4 | , distance => | -2  |\n                 | 1 |           | 5 |               | -4  |\n\n        There are 2, 2, and 4 points between [3-2], [2-4], and [1-5], respectively.\n        '
    return (self - other)