o
    éË·e÷  ã                   @   s   d Z dd„ Zdd„ ZdS )zIUtilities for working with data structures like lists, dicts and tuples.
c                    s   t ƒ ‰ ‡ fdd„| D ƒS )a/  uniq_stable(elems) -> list

    Return from an iterable, a list of all the unique elements in the input,
    but maintaining the order in which they first appear.

    Note: All elements in the input must be hashable for this routine
    to work, as it internally uses a set for efficiency reasons.
    c                    s"   g | ]}|ˆ vrˆ   |¡s|‘qS © )Úadd)Ú.0Úx©Úseenr   úI/var/www/ideatree/venv/lib/python3.10/site-packages/IPython/utils/data.pyÚ
<listcomp>   s   " zuniq_stable.<locals>.<listcomp>)Úset)Úelemsr   r   r   Úuniq_stable   s   	r   c                    s    ‡ ‡fdd„t dtˆ ƒˆƒD ƒS )z.Chop a sequence into chunks of the given size.c                    s   g | ]
}ˆ ||ˆ … ‘qS r   r   )r   Úi©ÚseqÚsizer   r   r      s    zchop.<locals>.<listcomp>é    )ÚrangeÚlenr   r   r   r   Úchop   s    r   N)Ú__doc__r   r   r   r   r   r   Ú<module>   s   