Sindbad~EG File Manager

Current Path : /proc/2568807/root/usr/local/lib/python3.12/test/__pycache__/
Current File : //proc/2568807/root/usr/local/lib/python3.12/test/__pycache__/test_setcomps.cpython-312.opt-1.pyc
�

'Μg����ddlZddlZddlZddlmZdZGd�dej�ZdeiZd�Z	e
dk(rej�yy)	�N)�
BrokenIteraK
########### Tests mostly copied from test_listcomps.py ############

Test simple loop with conditional

    >>> sum({i*i for i in range(100) if i&1 == 1})
    166650

Test simple case

    >>> {2*y + x + 1 for x in (0,) for y in (1,)}
    {3}

Test simple nesting

    >>> list(sorted({(i,j) for i in range(3) for j in range(4)}))
    [(0, 0), (0, 1), (0, 2), (0, 3), (1, 0), (1, 1), (1, 2), (1, 3), (2, 0), (2, 1), (2, 2), (2, 3)]

Test nesting with the inner expression dependent on the outer

    >>> list(sorted({(i,j) for i in range(4) for j in range(i)}))
    [(1, 0), (2, 0), (2, 1), (3, 0), (3, 1), (3, 2)]

Test the idiom for temporary variable assignment in comprehensions.

    >>> sorted({j*j for i in range(4) for j in [i+1]})
    [1, 4, 9, 16]
    >>> sorted({j*k for i in range(4) for j in [i+1] for k in [j+1]})
    [2, 6, 12, 20]
    >>> sorted({j*k for i in range(4) for j, k in [(i+1, i+2)]})
    [2, 6, 12, 20]

Not assignment

    >>> sorted({i*i for i in [*range(4)]})
    [0, 1, 4, 9]
    >>> sorted({i*i for i in (*range(4),)})
    [0, 1, 4, 9]

Make sure the induction variable is not exposed

    >>> i = 20
    >>> sum({i*i for i in range(100)})
    328350

    >>> i
    20

Verify that syntax error's are raised for setcomps used as lvalues

    >>> {y for y in (1,2)} = 10          # doctest: +IGNORE_EXCEPTION_DETAIL
    Traceback (most recent call last):
       ...
    SyntaxError: ...

    >>> {y for y in (1,2)} += 10         # doctest: +IGNORE_EXCEPTION_DETAIL
    Traceback (most recent call last):
       ...
    SyntaxError: ...


Make a nested set comprehension that acts like set(range())

    >>> def srange(n):
    ...     return {i for i in range(n)}
    >>> list(sorted(srange(10)))
    [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]

Same again, only as a lambda expression instead of a function definition

    >>> lrange = lambda n:  {i for i in range(n)}
    >>> list(sorted(lrange(10)))
    [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]

Generators can call other generators:

    >>> def grange(n):
    ...     for x in {i for i in range(n)}:
    ...         yield x
    >>> list(sorted(grange(5)))
    [0, 1, 2, 3, 4]


Make sure that None is a valid return value

    >>> {None for i in range(10)}
    {None}

########### Tests for various scoping corner cases ############

Return lambdas that use the iteration variable as a default argument

    >>> items = {(lambda i=i: i) for i in range(5)}
    >>> {x() for x in items} == set(range(5))
    True

Same again, only this time as a closure variable

    >>> items = {(lambda: i) for i in range(5)}
    >>> {x() for x in items}
    {4}

Another way to test that the iteration variable is local to the list comp

    >>> items = {(lambda: i) for i in range(5)}
    >>> i = 20
    >>> {x() for x in items}
    {4}

And confirm that a closure can jump over the list comp scope

    >>> items = {(lambda: y) for i in range(5)}
    >>> y = 2
    >>> {x() for x in items}
    {2}

We also repeat each of the above scoping tests inside a function

    >>> def test_func():
    ...     items = {(lambda i=i: i) for i in range(5)}
    ...     return {x() for x in items}
    >>> test_func() == set(range(5))
    True

    >>> def test_func():
    ...     items = {(lambda: i) for i in range(5)}
    ...     return {x() for x in items}
    >>> test_func()
    {4}

    >>> def test_func():
    ...     items = {(lambda: i) for i in range(5)}
    ...     i = 20
    ...     return {x() for x in items}
    >>> test_func()
    {4}

    >>> def test_func():
    ...     items = {(lambda: y) for i in range(5)}
    ...     y = 2
    ...     return {x() for x in items}
    >>> test_func()
    {2}

c��eZdZd�Zy)�SetComprehensionTestc��d�}d�}d�}|df|df|dffD]�\}}|j|�5|�}tj|j�d}d}|j}	|j|j|	jd	z�|j|j|	jd	z�|j|j|j|z
|j|z
|�ddd���y#1swY��xYw)
Nc�t�	td��D�chc]}|��c}ycc}w#t$r}|cYd}~Sd}~wwxYw)NT)�init_raises�r�	Exception��x�es  �//usr/local/lib/python3.12/test/test_setcomps.pyrzBSetComprehensionTest.test_exception_locations.<locals>.init_raises��8��
�&�4�8�9�8�q��8�9��9���
����
�� �"�	�"�"�	7�2�7�7c�t�	td��D�chc]}|��c}ycc}w#t$r}|cYd}~Sd}~wwxYw)NT)�next_raisesr	rs  rrzBSetComprehensionTest.test_exception_locations.<locals>.next_raises�rrc�t�	td��D�chc]}|��c}ycc}w#t$r}|cYd}~Sd}~wwxYw)NT)�iter_raisesr	rs  rrzBSetComprehensionTest.test_exception_locations.<locals>.iter_raises�rrzBrokenIter(init_raises=True)zBrokenIter(next_raises=True)zBrokenIter(iter_raises=True)r��)�subTest�	traceback�
extract_tb�
__traceback__�__code__�assertEqual�lineno�co_firstlineno�
end_lineno�line�colno�	end_colno)
�selfrrr�func�expected�exc�f�indent�cos
          r�test_exception_locationsz-SetComprehensionTest.test_exception_locations�s���	�	�	�!,�-K�L� +�-K�L� +�-K�L� �N�D�(����d�#��f���(�(��):�):�;�A�>�����]�]��� � ����2�+<�+<�q�+@�A�� � ����r�/@�/@�1�/D�E�� � �������&�(8�1�;�;��;O�!P�!)�+�$�#�	 �$�#�s�CC:�:D	N)�__name__�
__module__�__qualname__r*��rrr�s��"+r/r�doctestsc�L�|jtj��|S)N)�addTest�doctest�DocTestSuite)�loader�tests�patterns   r�
load_testsr8�s��	�M�M�'�&�&�(�)��Lr/�__main__)r3r�unittest�test.supportrr0�TestCaser�__test__r8r+�mainr.r/r�<module>r?sX�����#�P��d#+�8�,�,�#+�J
��"���
�z���H�M�M�O�r/
Sindbad File Manager Version 1.0, Coded By Sindbad EG ~ The Terrorists