def isLargeSameDirection(inset, loop, radius):
 if (euclidean.isWiddershins(inset) != euclidean.isWiddershins(loop)):
  return False
 return (euclidean.getMaximumSpan(inset) > (2.01 * abs(radius)))

def isLargeSameDirection ( inset , loop , radius ) : if ( euclidean . isWiddershins ( inset ) != euclidean . isWiddershins ( loop ) ) : return False return ( euclidean . getMaximumSpan ( inset ) > ( 2.01 * abs ( radius ) ) )
determine if the inset is in the same direction as the loop and it is large enough .