def __or__(self, other):
		'''
			Find the union of two multipliers: that is, a third multiplier expressing
			the range covered by either of the originals. This is not defined for
			all multipliers since they may not intersect.
		'''
		if not self.canunion(other):
			raise Exception("Can't compute the union of " + repr(self) + " and " + repr(other))
		a = min(self.min, other.min)
		b = max(self.max, other.max)
		return multiplier(a, b)
def __or__ ( self , other ) : if not self . canunion ( other ) : raise Exception ( "Can't compute the union of " + repr ( self ) + " and " + repr ( other ) ) a = min ( self . min , other . min ) b = max ( self . max , other . max ) return multiplier ( a , b )
Find the union of two multipliers: that is, a third multiplier expressing
			the range covered by either of the originals. This is not defined for
			all multipliers since they may not intersect.