44 def iup_contour(delta, coords):  argument
45 	assert len(delta) == len(coords)
46 	if None not in delta:
47 		return delta
49 	n = len(delta)
51 	indices = [i for i,v in enumerate(delta) if v is not None]
62 		out.extend(iup_segment(coords[i1:i2], coords[ri1], delta[ri1], coords[ri2], delta[ri2]))
63 	out.append(delta[start])
67 			out.extend(iup_segment(coords[i1:i2], coords[ri1], delta[ri1], coords[ri2], delta[ri2]))
68 		out.append(delta[end])
73 		out.extend(iup_segment(coords[i1:i2], coords[ri1], delta[ri1], coords[ri2], delta[ri2]))
75 	assert len(delta) == len(out), (len(delta), len(out))
78 def iup_delta(delta, coords, ends):  argument
86 		contour = iup_contour(delta[start:end], coords[start:end])
103 def _iup_contour_bound_forced_set(delta, coords, tolerance=0):  argument
111 	assert len(delta) == len(coords)
115 	nd, nc = delta[0], coords[0]
116 	ld, lc = delta[-1], coords[-1]
117 	for i in range(len(delta)-1, -1, -1):
119 		ld, lc = delta[i-1], coords[i-1]
171 def _iup_contour_optimize_dp(delta, coords, forced={}, tolerance=0, lookback=None):  argument
181 	n = len(delta)
199 			if cost < best_cost and can_iup_in_between(delta, coords, j, i, tolerance):
221 def iup_contour_optimize(delta, coords, tolerance=0.):  argument
222 	n = len(delta)
227 	if all(abs(complex(*p)) <= tolerance for p in delta):
232 		return delta
235 	d0 = delta[0]
236 	if all(d0 == d for d in delta):
241 	forced = _iup_contour_bound_forced_set(delta, coords, tolerance)
253 		delta  = _rot_list(delta, k)
257 		chain, costs = _iup_contour_optimize_dp(delta, coords, forced, tolerance)
266 		delta = [delta[i] if i in solution else None for i in range(n)]
268 		delta = _rot_list(delta, -k)
273 		chain, costs = _iup_contour_optimize_dp(delta+delta, coords+coords, forced, tolerance, n)
288 		delta = [delta[i] if i in best_sol else None for i in range(n)]
291 	return delta
293 def iup_delta_optimize(delta, coords, ends, tolerance=0.):  argument
300 		contour = iup_contour_optimize(delta[start:end+1], coords[start:end+1], tolerance)