def length(self, t0=<NUM_LIT:0>, t1=<NUM_LIT:1>, error=LENGTH_ERROR, min_depth=LENGTH_MIN_DEPTH):
assert <NUM_LIT:0> <= t0 <= <NUM_LIT:1> and <NUM_LIT:0> <= t1 <= <NUM_LIT:1><EOL>if _quad_available:<EOL><INDENT>return quad(lambda tau: abs(self.derivative(tau)), t0, t1,<EOL>epsabs=error, limit=<NUM_LIT:1000>)[<NUM_LIT:0>]<EOL><DEDENT>else:<EOL><INDENT>return segment_length(self, t0, t1, self.point(t0), self.point(t1),<EOL>error, min_depth, <NUM_LIT:0>)<EOL><DEDENT>
The length of an elliptical large_arc segment requires numerical
        integration, and in that case it's simpler to just do a geometric
        approximation, as for cubic bezier curves.