Determine common requirement for a distribution made by a working set.
working_set: iterable of distributions
dist: distribution
Returns a requirement for a given distribution that is the largest common subset of all requirements made for that distribution by the given working set. I.e., its version specification is the intersection of all individual version specifications.
Compute the intersection of two open intervals.
Intervals are pairs of comparable values, one or both may be None to denote (negative) infinity.
Returns the intersection if it is not empty.
>>> interval_intersection((1, 3), (2, 4))
(2, 3)
>>> interval_intersection((1, 2), (2, 3))
>>> interval_intersection((None, 1), (None, 2))
(None, 1)
>>> interval_intersection((1, None), (2, None))
(2, None)
>>> interval_intersection((None, None), (None, None))
(None, None)
>>> interval_intersection((None, 1), (1, None))
Print a requirements list to standard output.
graph: a tl.eggdeps.graph.Graph instance
options: an object that provides formatting options as attributes
version_numbers: bool, print version numbers of active distributions?