a
    Mˆc³-  ã                   @   s„  d dl mZmZmZ d dlmZmZ zd dlZW n eyN   d dl	mZ Y n0 ej
r\dZndZeeef Zeeef Zee Zee Zeedf Zee Zee ZdZeeeeeedœd	d
„Zeeedœdd„Zeeeedœdd„Zeeeeeedœdd„Zd&eeeedœdd„Zi d dfeeeedœdd„Zeedœdd„Zeeedœdd„Zd'eeeedœd!d"„Z d(eeeeed#œd$d%„Z!dS ))é    )ÚSequenceÚTupleÚUnion)ÚIntegralÚRealN)ÚcythonTFé   )ÚcoordsÚrc1Úrd1Úrc2Úrd2Úreturnc                 C   sú   ddg}dD ]ä}g  ||< }|| || || || f\}}	}
}||	kr|t | ƒ}|
|krj| |
g| ¡ q| dg| ¡ q||	kr˜|	| }}	||
 }
}||
 |	|  }| D ]B}|| }||krÆ|
}n||	krÔ|}n|
|| |  }| |¡ q¬qt|Ž S )z£Given two reference coordinates `rc1` & `rc2` and their respective
	delta vectors `rd1` & `rd2`, returns interpolated deltas for the set of
	coordinates `coords`. N©r   é   r   )ÚlenÚextendÚappendÚzip)r	   r
   r   r   r   Z
out_arraysÚjÚoutÚx1Zx2Úd1Úd2ÚnZscaleÚpairÚxÚd© r   úW/home/yuhw/wc/wire-cell-python/wcpy/lib/python3.9/site-packages/fontTools/varLib/iup.pyÚiup_segment$   s.    $

r    )Údeltasr	   r   c              
   C   sª  t | ƒt |ƒksJ ‚d| vr | S t | ƒ}dd„ t| ƒD ƒ}|sHdg| S g }t|ƒ}t|ƒ}|dkrªd|||d f\}}}	}
| t|||… ||	 | |	 ||
 | |
 ƒ¡ | | | ¡ |D ]j}|| dk�r|d |||f\}}}	}
| t|||… ||	 | |	 ||
 | |
 ƒ¡ | | | ¡ |}q¼||d k�r€|d |||d f\}}}	}
| t|||… ||	 | |	 ||
 | |
 ƒ¡ t | ƒt |ƒk�s¦J t | ƒt |ƒfƒ‚|S )z‹For the contour given in `coords`, interpolate any missing
	delta values in delta vector `deltas`.

	Returns fully filled-out delta vector.Nc                 S   s   g | ]\}}|d ur|‘qS ©Nr   )Ú.0ÚiÚvr   r   r   Ú
<listcomp>^   ó    ziup_contour.<locals>.<listcomp>)r   r   r   éÿÿÿÿr   )r   Ú	enumerateÚiterÚnextr   r    r   )r!   r	   r   Úindicesr   ÚitÚstartÚi1Úi2Zri1Zri2Úendr   r   r   Úiup_contourQ   s2    
...&r2   )r!   r	   Úendsr   c                 C   sž   t |ƒ|kr,t|ƒ|r"|d d ndd ks0J ‚t|ƒ}||d |d |d |d g }g }d}|D ]4}|d7 }t| ||… |||… ƒ}| |¡ |}qd|S )zÏFor the outline given in `coords`, with contour endpoints given
	in sorted increasing order in `ends`, interpolate any missing
	delta values in delta vector `deltas`.

	Returns fully filled-out delta vector.r(   r   r   é   é   é   )Úsortedr   r2   r   )r!   r	   r3   r   r   r.   r1   Úcontourr   r   r   Ú	iup_deltay   s    	0 
r9   )r!   r	   r$   r   Ú	tolerancer   c                    s€   || dksJ ‚t t||d |… || | | || | | ƒƒ}| |d |… } t| ƒt|ƒksdJ ‚t‡ fdd„t| |ƒD ƒƒS )zªReturn true if the deltas for points at `i` and `j` (`i < j`) can be
	successfully used to interpolate deltas for points in between them within
	provided error tolerance.r6   r   c                 3   s4   | ],\\}}\}}t t|| || ƒƒˆ kV  qd S r"   ©ÚabsÚcomplex)r#   r   ÚyÚpÚq©r:   r   r   Ú	<genexpr>    r'   z%can_iup_in_between.<locals>.<genexpr>)Úlistr    r   Úallr   )r!   r	   r$   r   r:   Zinterpr   rA   r   Úcan_iup_in_between‘   s
    	0rE   )r!   r	   r:   r   c                 C   s  t | ƒt |ƒksJ ‚t | ƒ}tƒ }tt | ƒd ddƒD �]à}| |d  ||d   }}| | ||  }}	| || d  ||| d   }
}dD �]†}|	| }|| }|| }|| }|| }|
| }||krâ|| }}|| }}n|| }}|| }}d}||k�r*t|| ƒ|k�rt|ƒ|k�rd}nÚ||  k�rB|k�rzn n4t||ƒ| |  k�rrt||ƒ| k�sn d}nŠ||k�r||k �rÊt|ƒ|k�rt|| ƒ|k�r|| |k ||k k�rd}n:t|ƒ|k�rt|| ƒ|k�r||| k ||k k�rd}|rŽ| |¡  q6qŽq6|S )a›  The forced set is a conservative set of points on the contour that must be encoded
	explicitly (ie. cannot be interpolated).  Calculating this set allows for significantly
	speeding up the dynamic-programming, as well as resolve circularity in DP.

	The set is precise; that is, if an index is in the returned set, then there is no way
	that IUP can generate delta for that point, given `coords` and `deltas`.
	r   r(   r   FT)r   ÚsetÚranger<   ÚminÚmaxÚadd)r!   r	   r:   r   Úforcedr$   ZldÚlcr   ÚcZndZncr   ÚcjZdjZlcjZldjZncjZndjZc1Úc2r   r   Úforcer   r   r   Ú_iup_contour_bound_forced_set¢   sH    
"




 .

66
rQ   )r!   r	   r:   Úlookbackc                 C   sÜ   t | ƒ}|du r|}t|tƒ}ddi}ddi}td|ƒD ]š}||d  d }	|	||< |d ||< |d |v rnq8t|d t|| dƒdƒD ]H}
||
 d }||	k rÄt| ||
||ƒrÄ| ||< }	|
||< |
|v rˆ q8qˆq8||fS )aÇ  Straightforward Dynamic-Programming.  For each index i, find least-costly encoding of
	points 0 to i where i is explicitly encoded.  We find this by considering all previous
	explicit points j and check whether interpolation can fill points between j and i.

	Note that solution always encodes last point explicitly.  Higher-level is responsible
	for removing that restriction.

	As major speedup, we stop looking further whenever we see a "forced" point.Nr(   r   r   r6   éþÿÿÿ)r   rH   ÚMAX_LOOKBACKrG   rI   rE   )r!   r	   rK   r:   rR   r   ÚcostsÚchainr$   Ú	best_costr   Úcostr   r   r   Ú_iup_contour_optimize_dpê   s(    
rY   )ÚlÚkc                 C   s8   t | ƒ}||; }|s| S | || d… | d|| …  S )zxRotate list by k items forward.  Ie. item at position 0 will be
	at position k in returned list.  Negative k is allowed.N)r   )rZ   r[   r   r   r   r   Ú	_rot_list  s    r\   ©Úsr[   r   c                    s$   ˆ ˆ; ‰ ˆ s| S ‡ ‡fdd„| D ƒS )Nc                    s   h | ]}|ˆ  ˆ ’qS r   r   )r#   r%   ©r[   r   r   r   Ú	<setcomp>  r'   z_rot_set.<locals>.<setcomp>r   r]   r   r_   r   Ú_rot_set  s    ra   ç        c                    s  t ˆƒ}t‡fdd„ˆD ƒƒr(dg| S |dkr4ˆS ˆd ‰t‡fdd„ˆD ƒƒrfˆgdg|d   S tˆ|ˆƒ}|�r6|d t|ƒ }|dks”J ‚tˆ|ƒ‰t||ƒ}t|||ƒ}tˆ||ˆƒ\}}tƒ ‰|d }|durðˆ |¡ || }qÔˆ 	d¡ |ˆk�sJ |ˆfƒ‚‡‡fdd	„t
|ƒD ƒ‰tˆ| ƒ‰nÞtˆˆ || |ˆ|ƒ\}}d|d  ‰ }	t
|d t |ƒd ƒD ]n}
tƒ ‰|
}||
| k�r¬ˆ || ¡ || }�q„||
| k�rv||
 ||
|   }||	k�rvˆ| ‰ }	�qv|ˆ k�süJ |ˆ fƒ‚‡ ‡fd
d	„t
|ƒD ƒ‰ˆS )zÂFor contour with coordinates `coords`, optimize a set of delta
	values `deltas` within error `tolerance`.

	Returns delta vector that has most number of None items instead of
	the input delta.
	c                 3   s   | ]}t t|Ž ƒˆ kV  qd S r"   r;   )r#   r?   rA   r   r   rB   0  r'   z'iup_contour_optimize.<locals>.<genexpr>Nr   r   c                 3   s   | ]}ˆ |kV  qd S r"   r   )r#   r   )Úd0r   r   rB   9  r'   r(   c                    s    g | ]}|ˆv rˆ | nd ‘qS r"   r   ©r#   r$   )r!   Úsolutionr   r   r&   c  r'   z(iup_contour_optimize.<locals>.<listcomp>c                    s    g | ]}|ˆ v rˆ| nd ‘qS r"   r   rd   )Úbest_solr!   r   r   r&     r'   )r   rD   rQ   rI   r\   ra   rY   rF   rJ   ÚremoverG   )r!   r	   r:   r   rK   r[   rV   rU   r$   rW   r.   rX   r   )rf   rc   r!   re   r:   r   Úiup_contour_optimize!  sP    

	





rh   )r!   r	   r3   r:   r   c           	      C   s¼   t |ƒ|kr,t|ƒ|r"|d d ndd ks0J ‚t|ƒ}||d |d |d |d g }g }d}|D ]R}t| ||d … |||d … |ƒ}t|ƒ|| d ks¤J ‚| |¡ |d }qd|S )a  For the outline given in `coords`, with contour endpoints given
	in sorted increasing order in `ends`, optimize a set of delta
	values `deltas` within error `tolerance`.

	Returns delta vector that has most number of None items instead of
	the input delta.
	r(   r   r   r4   r5   r6   )r7   r   rh   r   )	r!   r	   r3   r:   r   r   r.   r1   r8   r   r   r   Úiup_delta_optimize„  s    0 $

ri   )r   )rb   )rb   )"Útypingr   r   r   Znumbersr   r   r   ÚImportErrorZfontTools.miscZcompiledZCOMPILEDZ_PointZ_DeltaZ_PointSegmentZ_DeltaSegmentZ_DeltaOrNoneZ_DeltaOrNoneSegmentZ
_EndpointsrT   r    r2   r9   ÚboolrE   rF   rQ   rY   rC   Úintr\   ra   rh   ri   r   r   r   r   Ú<module>   sz   ü-ÿ(þü þþJüü* þþf ýý