
    <h                         S r S rS rg)zIUtilities for working with data structures like lists, dicts and tuples.
c                     [        5       nU  Vs/ s H$  o"U;  d  M
  UR                  U5      (       a  M"  UPM&     sn$ s  snf )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.
)setadd)elemsseenxs      eC:\Users\julio\OneDrive\Documentos\Trabajo\Ideas Frescas\venv\Lib\site-packages\IPython/utils/data.pyuniq_stabler	      s3     5DBu!AdhhqkAuBBBs   	===c                 b    [        S[        U 5      U5       Vs/ s H	  o X"U-    PM     sn$ s  snf )z.Chop a sequence into chunks of the given size.    )rangelen)seqsizeis      r   chopr      s/    #(3s8D#9:#9aD&M#9:::s   ,N)__doc__r	   r        r   <module>r      s   
C;r   