OwlCyberSecurity - MANAGER
Edit File: test_recipes.cpython-38.pyc
U �[fL � @ s d dl mZ d dlmZ d dlmZ d dlmZ d dlZ dd� Z G dd � d e�Z G d d � d e�Z G d d � d e�Z G dd� de�ZG dd� de�ZG dd� de�ZG dd� de�ZG dd� de�ZG dd� de�ZG dd� de�ZG d d � d e�ZG d d � d e�ZG d d!� d!e�ZG d"d#� d#e�ZG d$d%� d%e�ZG d&d'� d'e�ZG d(d)� d)e�ZG d*d+� d+e�Z G d,d-� d-e�Z G d.d/� d/e�Z G d0d1� d1e�Z G d2d3� d3e�Z G d4d5� d5e�Z!G d6d7� d7e�Z"G d8d9� d9e�Z#G d:d;� d;e�Z$G d<d=� d=e�Z%G d>d?� d?e�Z&dS )@� )� DocTestSuite)�TestCase)� combinations)�rangeNc C s |� td�� |S )Nzmore_itertools.recipes)ZaddTestsr )�loaderZtests�ignore� r �C/usr/lib/python3/dist-packages/more_itertools/tests/test_recipes.py� load_tests s r c @ s0 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd S ) �AccumulateTestszTests for ``accumulate()``c C s | � tt�g ��g � dS )z0Test that an empty input returns an empty outputN�� assertEqual�list�mi� accumulate��selfr r r � test_empty s zAccumulateTests.test_emptyc C s& | � tt�dddg��dddg� dS )z4Test accumulate with the default function (addition)� � � � Nr r r r r � test_default s z AccumulateTests.test_defaultc C s6 | � t��" ttjdddgdd� d�� W 5 Q R X dS )z(Test accumulate with an invalid functionr r r c S s | S �Nr ��xr r r �<lambda> � z5AccumulateTests.test_bogus_function.<locals>.<lambda>��funcN)� assertRaises� TypeErrorr r r r r r r �test_bogus_function s z#AccumulateTests.test_bogus_functionc C s( | � ttjdtd��dddddg� dS )z&Test accumulate with a custom function)r r r r r r r r r N)r r r r �maxr r r r �test_custom_function s �z$AccumulateTests.test_custom_functionN)�__name__� __module__� __qualname__�__doc__r r r" r$ r r r r r s r c @ s0 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd S ) � TakeTestszTests for ``take()``c C s* t �dtd��}| �|dddddg� dS ) zTest basic usage� � r r r r � N�r �taker r �r �tr r r �test_simple_take* s zTakeTests.test_simple_takec C s t �dtd��}| �|g � dS )�Check the null caser r+ Nr- r/ r r r �test_null_take/ s zTakeTests.test_null_takec C s | � tdd� � dS )z7Make sure taking negative items results in a ValueErrorc S s t �dtd��S )N���r+ )r r. r r r r r r 6 r z.TakeTests.test_negative_take.<locals>.<lambda>N�r � ValueErrorr r r r �test_negative_take4 s z TakeTests.test_negative_takec C s* t �dtd��}| �|dddddg� dS ) zkTaking more than an iterator has remaining should return what the iterator has remaining. r+ r* r r r r r, Nr- r/ r r r �test_take_too_much8 s z TakeTests.test_take_too_muchN)r% r& r' r( r1 r3 r7 r8 r r r r r) ' s r) c @ s e Zd ZdZdd� Zdd� ZdS )� TabulateTestszTests for ``tabulate()``c s8 t �dd� �� t� fdd�td�D ��}| �|d� dS )zTest the happy pathc S s | S r r r r r r r F r z4TabulateTests.test_simple_tabulate.<locals>.<lambda>c s g | ] }t � ��qS r ��next��.0�_�r0 r r � <listcomp>G s z6TabulateTests.test_simple_tabulate.<locals>.<listcomp>r )r r r N)r �tabulate�tupler r �r �fr r? r �test_simple_tabulateD s z"TabulateTests.test_simple_tabulatec C s6 t �dd� d�}t|�t|�t|�f}| �|d� dS )z&Ensure tabulate accepts specific countc S s d| S )Nr r r r r r r L r z*TabulateTests.test_count.<locals>.<lambda>���)���r r N)r rA r; r )r r0 rD r r r � test_countJ s zTabulateTests.test_countN)r% r& r' r( rE rH r r r r r9 A s r9 c @ s( e Zd ZdZdd� Zdd� Zdd� ZdS ) � TailTestszTests for ``tail()``c C s" | � tt�dd��dddg� dS )z2Length of iterable is greather than requested tailr �ABCDEFG�E�F�GN�r r r �tailr r r r � test_greaterT s zTailTests.test_greaterc C s* | � tt�dd��ddddddd g� d S ) z1Length of iterable is equal to the requested tail� rJ �A�B�C�DrK rL rM NrN r r r r � test_equalX s �zTailTests.test_equalc C s* | � tt�dd��ddddddd g� d S ) z.Length of iterable is less than requested tail� rJ rR rS rT rU rK rL rM NrN r r r r � test_less^ s �zTailTests.test_lessN)r% r& r' r( rP rV rX r r r r rI Q s rI c @ s0 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd S ) � ConsumeTestszTests for ``consume()``c C s2 dd� t d�D �}t�|d� | �dt|�� dS )zTest basic functionalityc s s | ] }|V qd S r r �r= r r r r � <genexpr>j s z+ConsumeTests.test_sanity.<locals>.<genexpr>r+ r N�r r �consumer r; �r �rr r r � test_sanityh s zConsumeTests.test_sanityc C s2 dd� t d�D �}t�|d� | �dt|�� dS )r2 c s s | ] }|V qd S r r rZ r r r r[ p s z1ConsumeTests.test_null_consume.<locals>.<genexpr>r+ r Nr\ r^ r r r �test_null_consumen s z ConsumeTests.test_null_consumec s* dd� t d�D �� | �t� fdd�� dS )z.Check that negative consumsion throws an errorc s s | ] }|V qd S r r rZ r r r r[ v s z5ConsumeTests.test_negative_consume.<locals>.<genexpr>r+ c s t �� d�S )NrF )r r] r �r_ r r r w r z4ConsumeTests.test_negative_consume.<locals>.<lambda>N)r r r6 r r rb r �test_negative_consumet s z"ConsumeTests.test_negative_consumec s4 dd� t d�D �� t�� � | �t� fdd�� dS )z2Check that iterator is totally consumed by defaultc s s | ] }|V qd S r r rZ r r r r[ { s z2ConsumeTests.test_total_consume.<locals>.<genexpr>r+ c s t � �S r r: r rb r r r } r z1ConsumeTests.test_total_consume.<locals>.<lambda>N)r r r] r � StopIterationr r rb r �test_total_consumey s z ConsumeTests.test_total_consumeN)r% r& r' r( r` ra rc re r r r r rY e s rY c @ s( e Zd ZdZdd� Zdd� Zdd� ZdS ) �NthTestszTests for ``nth()``c C s2 t d�}t|�D ] \}}| �t�||�|� qdS )z"Make sure the nth item is returnedr+ N)r � enumerater r �nth)r �l�i�vr r r � test_basic� s zNthTests.test_basicc C s" t d�}| �t�|dd�d� dS )z:Ensure a default value is returned when nth item not foundr �d ZzebraN)r r r rh �r ri r r r r � s zNthTests.test_defaultc C s | � tdd� � dS )z5Ensure asking for a negative item raises an exceptionc S s t �td�d�S )Nr+ r4 )r rh r r r r r r � r z4NthTests.test_negative_item_raises.<locals>.<lambda>Nr5 r r r r �test_negative_item_raises� s z"NthTests.test_negative_item_raisesN)r% r& r' r( rl r ro r r r r rf � s rf c @ s8 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd d � Zd S ) � AllEqualTestszTests for ``all_equal()``c C s, | � t�d�� | � t�ddddg�� dS )zEverything is equalZaaaaaar N�� assertTruer � all_equalr r r r � test_true� s zAllEqualTests.test_truec C s, | � t�d�� | � t�ddddg�� dS )zNot everything is equalZaaaaabr r N)Z assertFalser rs r r r r � test_false� s zAllEqualTests.test_falsec C s$ dt dd�dg}| �t�|�� dS )z4Not everything is identical, but everything is equalr r g �?N)�complexrr r rs )r �itemsr r r � test_tricky� s zAllEqualTests.test_trickyc C s$ | � t�d�� | � t�g �� dS )z$Return True if the iterable is empty� Nrq r r r r r � s zAllEqualTests.test_emptyc C s& | � t�d�� | � t�dg�� dS )z'Return True if the iterable is singular�0r Nrq r r r r �test_one� s zAllEqualTests.test_oneN) r% r& r' r( rt ru rx r r{ r r r r rp � s rp c @ s e Zd ZdZdd� Zdd� ZdS )� QuantifyTestszTests for ``quantify()``c C s dddg}| � t�|�d� dS )z Make sure True count is returnedTFr N)r r �quantify�r �qr r r �test_happy_path� s z QuantifyTests.test_happy_pathc C s$ t d�}| �t�|dd� �d� dS )z0Ensure non-default predicates return as expectedr+ c S s | d dkS )Nr r r r r r r r � r z5QuantifyTests.test_custom_predicate.<locals>.<lambda>r* N)r r r r} r~ r r r �test_custom_predicate� s z#QuantifyTests.test_custom_predicateN)r% r& r' r( r� r� r r r r r| � s r| c @ s e Zd ZdZdd� ZdS )� PadnoneTestszTests for ``padnone()``c s< t d�}t�|�� | �ddddg� fdd�t d�D �� dS )z0wrapper iterator should return None indefinitelyr r r Nc s g | ] }t � ��qS r r: r< ��pr r r@ � s z0PadnoneTests.test_happy_path.<locals>.<listcomp>r, )r r Zpadnoner r^ r r� r r� � s z PadnoneTests.test_happy_pathN�r% r& r' r( r� r r r r r� � s r� c @ s( e Zd ZdZdd� Zdd� Zdd� ZdS ) � NcyclesTestszTests for ``nyclces()``c C s< dddg}t �|d�}| �dddddddddg t|�� dS )z cycle a sequence three times�a�b�cr N)r �ncyclesr r )r r_ �nr r r r� � s �z NcyclesTests.test_happy_pathc s( t �td�d�� | �t� fdd�� dS )z3asking for 0 cycles should return an empty iteratorrm r c s t � �S r r: r �r� r r r � r z-NcyclesTests.test_null_case.<locals>.<lambda>N�r r� r r rd r r r� r �test_null_case� s zNcyclesTests.test_null_casec s( t �td�d�� | �t� fdd�� dS )z:asking for negative cycles should return an empty iteratorrm i����c s t � �S r r: r r� r r r � r z5NcyclesTests.test_pathalogical_case.<locals>.<lambda>Nr� r r r� r �test_pathalogical_case� s z#NcyclesTests.test_pathalogical_caseN)r% r& r' r( r� r� r� r r r r r� � s r� c @ s e Zd ZdZdd� ZdS )�DotproductTestszTests for ``dotproduct()``'c C s | � dt�ddgddg�� dS )zsimple dotproduct examplei� r+ � N)r r Z dotproductr r r r r� � s z DotproductTests.test_happy_pathNr� r r r r r� � s r� c @ s e Zd ZdZdd� Zdd� ZdS )� FlattenTestszTests for ``flatten()``c C s6 dddgdddgg}| � ttd��tt�|��� dS ) z+ensure list of lists is flattened one levelr r r r r, r* r N)r r r r �flattenrC r r r �test_basic_usage� s z FlattenTests.test_basic_usagec C sB dddggddgdgg}| � dddgddgdgtt�|��� dS )z0ensure list of lists is flattened only one levelr r r r r, r* N)r r r r� rC r r r �test_single_level� s z FlattenTests.test_single_levelN)r% r& r' r( r� r� r r r r r� � s r� c @ s0 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd S ) �RepeatfuncTestszTests for ``repeatfunc()``c s: t �dd� �� | �dddddg� fdd�td�D �� dS )z test simple repeated functionsc S s dS �Nr* r r r r r r � r z4RepeatfuncTests.test_simple_repeat.<locals>.<lambda>r* c s g | ] }t � ��qS r r: r< rb r r r@ � s z6RepeatfuncTests.test_simple_repeat.<locals>.<listcomp>N)r � repeatfuncr r r r rb r �test_simple_repeat� s z"RepeatfuncTests.test_simple_repeatc C s0 t jdd� dd�}| �dddddgt|�� dS )z,ensure limited repeat when times is providedc S s dS r� r r r r r r � r z4RepeatfuncTests.test_finite_repeat.<locals>.<lambda>r* )�timesN�r r� r r r^ r r r �test_finite_repeat� s z"RepeatfuncTests.test_finite_repeatc C s* t �dd� dd�}| �ddgt|�� dS )z,ensure arguments are applied to the functionc S s | S r r r r r r r r z6RepeatfuncTests.test_added_arguments.<locals>.<lambda>r r Nr� r^ r r r �test_added_arguments s z$RepeatfuncTests.test_added_argumentsc s& t �tdd�� | �t� fdd�� dS )z(repeat 0 should return an empty iteratorr r c s t � �S r r: r rb r r r r z1RepeatfuncTests.test_null_times.<locals>.<lambda>N)r r� r r rd r r rb r �test_null_times s z RepeatfuncTests.test_null_timesN)r% r& r' r( r� r� r� r� r r r r r� � s r� c @ s e Zd ZdZdd� Zdd� ZdS )� PairwiseTestszTests for ``pairwise()``c C s( t �dddg�}| �ddgt|�� dS )z'ensure an iterable will return pairwiser r r �r r �r r N)r �pairwiser r �r r� r r r �test_base_case s z PairwiseTests.test_base_casec s" t �d�� | �t� fdd�� dS )z=ensure an empty iterator if there's not enough values to pairr� c s t � �S r r: r r� r r r r z/PairwiseTests.test_short_case.<locals>.<lambda>N)r r� r rd r r r� r �test_short_case s z PairwiseTests.test_short_caseN)r% r& r' r( r� r� r r r r r� s r� c @ s( e Zd ZdZdd� Zdd� Zdd� ZdS ) � GrouperTestszTests for ``grouper()``c C s | � tt�dd��ddg� dS )zVTest when group size divides evenly into the length of the iterable. r ZABCDEF�rR rS rT )rU rK rL N�r r r Zgrouperr r r r � test_even s �zGrouperTests.test_evenc C s | � tt�dd��ddg� dS )z^Test when group size does not divide evenly into the length of the iterable. r �ABCDEr� )rU rK NNr� r r r r �test_odd' s �zGrouperTests.test_oddc C s" | � tt�ddd��ddg� dS )z7Test that the fill value is used to pad the final groupr r� r r� )rU rK r Nr� r r r r �test_fill_value0 s �z GrouperTests.test_fill_valueN)r% r& r' r( r� r� r� r r r r r� s r� c @ s e Zd ZdZdd� Zdd� ZdS )�RoundrobinTestszTests for ``roundrobin()``c C s: | � tt�ddddgtd���dddddddddg � d S ) z5Ensure ordered output from evenly populated iterables�ABCr r r rR r rS rT N�r r r Z roundrobinr r r r r �test_even_groups; s �z RoundrobinTests.test_even_groupsc C s2 | � tt�dddgtd���ddddddg� d S ) z7Ensure ordered output from unevenly populated iterablesZABCDr r r rR rS rT rU Nr� r r r r �test_uneven_groupsB s �z"RoundrobinTests.test_uneven_groupsN)r% r& r' r( r� r� r r r r r� 8 s r� c @ s e Zd ZdZdd� Zdd� ZdS )�PartitionTestszTests for ``partition()``c C sP t �dd� td��\}}| �t|�dddddd g� | �t|�d d d d g� dS )z"Test when pred() returns a booleanc S s | dkS r� r r r r r r O r z*PartitionTests.test_bool.<locals>.<lambda>r+ r r r r r, r* r rQ rW � N�r � partitionr r r )r ZlesserZgreaterr r r � test_boolM s zPartitionTests.test_boolc C sP t �dd� td��\}}| �t|�ddddg� | �t|�dd d d d d g� dS )z#Test when pred() returns an integerc S s | d S )Nr r r r r r r U r z/PartitionTests.test_arbitrary.<locals>.<lambda>r+ r r r r� r r r, r* rQ rW Nr� )r Z divisiblesZ remaindersr r r �test_arbitraryS s z PartitionTests.test_arbitraryN)r% r& r' r( r� r� r r r r r� J s r� c @ s e Zd ZdZdd� ZdS )� PowersetTestszTests for ``powerset()``c C s4 t �dddg�}| �t|�dddddd d d g� d S ) zEnsure a proper enumerationr r r r )r )r )r r� )r r r� )r r r N)r Zpowersetr r r� r r r �test_combinatorics] s �z PowersetTests.test_combinatoricsN)r% r& r' r( r� r r r r r� Z s r� c @ s0 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd S ) �UniqueEverseenTestsz Tests for ``unique_everseen()``c C s& t �d�}| �ddddgt|�� dS )z%ensure duplicate elements are ignoredZAAAABBBBCCDAABBBrR rS rT rU N�r �unique_everseenr r �r �ur r r � test_everseeni s �z!UniqueEverseenTests.test_everseenc C s( t jdtjd�}| �td�t|�� dS )�&ensure the custom key comparison worksZaAbACCc��keyZabCN)r r� �str�lowerr r r� r r r �test_custom_keyq s z#UniqueEverseenTests.test_custom_keyc C s@ ddddgdddgdg}t �|�}| �t|�ddddgg� dS )z'ensure things work for unhashable itemsr� r r r Nr� �r �iterabler� r r r �test_unhashablev s z#UniqueEverseenTests.test_unhashablec C sH ddddgdddgdg}t j|dd� d�}| �t|�ddddgg� dS ) z9ensure things work for unhashable items with a custom keyr� r r r c S s | S r r r r r r r r z9UniqueEverseenTests.test_unhashable_key.<locals>.<lambda>r� Nr� r� r r r �test_unhashable_key| s z'UniqueEverseenTests.test_unhashable_keyN)r% r& r' r( r� r� r� r� r r r r r� f s r� c @ s e Zd ZdZdd� Zdd� ZdS )�UniqueJustseenTestsz Tests for ``unique_justseen()``c C s" t �d�}| �td�t|�� dS )z#ensure only last item is rememberedZ AAAABBBCCDABBZABCDABN)r �unique_justseenr r r� r r r � test_justseen� s z!UniqueJustseenTests.test_justseenc C s& t �dtj�}| �td�t|�� dS )r� ZAABCcADZABCADN)r r� r� r� r r r� r r r r� � s z#UniqueJustseenTests.test_custom_keyN)r% r& r' r( r� r� r r r r r� � s r� c @ s0 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd S ) �IterExceptTestszTests for ``iter_except()``c C s2 dddg}t �|jt�}| �t|�dddg� dS )z.ensure the exact specified exception is caughtr r r N�r � iter_except�pop� IndexErrorr r �r ri rj r r r �test_exact_exception� s z$IterExceptTests.test_exact_exceptionc C s. ddg}t �|jt�}| �t|�ddg� dS )z*ensure the generic exception can be caughtr r N)r r� r� � Exceptionr r r� r r r �test_generic_exception� s z&IterExceptTests.test_generic_exceptionc s0 dddg}t �|jt�� | �t� fdd�� dS )z*ensure a non-specified exception is raisedr r r c s t � �S r )r r �rj r r r � r zCIterExceptTests.test_uncaught_exception_is_raised.<locals>.<lambda>N)r r� r� �KeyErrorr r� rn r r� r �!test_uncaught_exception_is_raised� s z1IterExceptTests.test_uncaught_exception_is_raisedc C s> dddg}dd� }t �|jt|�}| �t|�ddddg� dS )z'ensure first is run before the functionr r r c S s dS )N� r r r r r r � r z,IterExceptTests.test_first.<locals>.<lambda>r� Nr� )r ri rD rj r r r � test_first� s zIterExceptTests.test_firstN)r% r& r' r( r� r� r� r� r r r r r� � s r� c @ s0 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd S ) �FirstTrueTestszTests for ``first_true()``c C s | � t�td��d� dS )zTest with no keywordsr+ r N)r r � first_truer r r r r �test_something_true� s z"FirstTrueTests.test_something_truec C s | � t�dddg�d� dS )zTest default return value.r FN�r r r� r r r r �test_nothing_true� s z FirstTrueTests.test_nothing_truec C s | � tjdddgdd�d� dS )zTest with a default keywordr �!)�defaultNr� r r r r r � s zFirstTrueTests.test_defaultc C s$ | � tjdddgdd� d�d� dS )z Test with a custom predicater r, r c S s | d dkS )Nr r r r r r r r � r z*FirstTrueTests.test_pred.<locals>.<lambda>)ZpredNr� r r r r � test_pred� s �zFirstTrueTests.test_predN)r% r& r' r( r� r� r r� r r r r r� � s r� c @ s e Zd ZdZdd� Zdd� ZdS )�RandomProductTestsz�Tests for ``random_product()`` Since random.choice() has different results with the same seed across python versions 2.x and 3.x, these tests use highly probably events to create predictable outcomes across platforms. c s� dddg�dddg� t � �fdd�td �D �� \}}t|�t|� }}| �|t��� | �|t� �� | �t|�t��� | �t|�t� �� d S ) a� Ensure that one item is chosen from each list in each pair. Also ensure that each item from each list eventually appears in the chosen combinations. Odds are roughly 1 in 7.1 * 10e16 that one item from either list will not be chosen after 100 samplings of one item from each list. Just to be safe, better use a known random seed, too. r r r r� r� r� c s g | ]}t ��� ��qS r )r �random_productr< ��lets�numsr r r@ � s z8RandomProductTests.test_simple_lists.<locals>.<listcomp>rm N)�zipr �setr �len)r r� �mr r� r �test_simple_lists� s z$RandomProductTests.test_simple_listsc C s� dddg}dddg}t tj||dd��}| �d t|�� t|d d d� �t|dd d� � }}| �|t|�� | �|t|�� | �t|�t|�� | �t|�t|�� d S ) z�ensure multiple items are chosen, and that they appear to be chosen from one list then the next, in proper order. r r r r� r� r� rm )�repeat�� N)r r r� r r� r� )r r� r� r_ r� r� r r r �test_list_with_repeat� s &z(RandomProductTests.test_list_with_repeatN)r% r& r' r( r� r� r r r r r� � s r� c @ s e Zd ZdZdd� Zdd� ZdS )�RandomPermutationTestsz"Tests for ``random_permutation()``c C s: t d�}t�|�}| �t|�t|�� ||kr6td��dS )z�ensure every item from the iterable is returned in a new ordering 15 elements have a 1 in 1.3 * 10e12 of appearing in sorted order, so we fix a seed value just to be sure. � zValues were not permutedN)r r �random_permutationr r� �AssertionError)r rj r_ r r r �test_full_permutation� s z,RandomPermutationTests.test_full_permutationc C sl t d�}t|�}t� }t d�D ]<}t�|d�}| �t|�d� t|�}| �||� ||O }q | �||� dS )a� ensure all returned items are from the iterable, that the returned permutation is of the desired length, and that all items eventually get returned. Sampling 100 permutations of length 5 from a set of 15 leaves a (2/3)^100 chance that an item will not be chosen. Multiplied by 15 items, there is a 1 in 2.6e16 chance that at least 1 item will not show up in the resulting output. Using a random seed will fix that. r� rm r* N)r r� r r� r r� ZassertLessEqual)r rw Zitem_set� all_itemsr> Z permutationZpermutation_setr r r �test_partial_permutation� s z/RandomPermutationTests.test_partial_permutationN)r% r& r' r( r� r� r r r r r� � s r� c @ s e Zd ZdZdd� Zdd� ZdS )�RandomCombinationTestsz"Tests for ``random_combination()``c C sH t d�}t� }t d�D ] }t�|d�}|t|�O }q| �|t|�� dS �zhensure different subsets of the iterable get returned over many samplings of random combinationsr� �2 r* N)r r� r �random_combinationr �r rw r� r> � combinationr r r �test_psuedorandomness s z,RandomCombinationTests.test_psuedorandomnessc sV t d�� t d�D ],}t�� t� ��}| �t|�tt|��� q| �t� fdd�� dS )z4ensure that elements are sampled without replacementr� r� c s t �� t� �d �S )Nr )r r� r� r �rw r r r * r z<RandomCombinationTests.test_no_replacement.<locals>.<lambda>N)r r r� r� r r� r r6 )r r> r� r r� r �test_no_replacement# s �z*RandomCombinationTests.test_no_replacementN)r% r& r' r( r� r� r r r r r� s r� c @ s e Zd ZdZdd� Zdd� ZdS )�%RandomCombinationWithReplacementTestsz3Tests for ``random_combination_with_replacement()``c C sT t d�}t�|t|�d �}| �dt|� t|�� tt|��t|�krPtd��dS )z1ensure that elements are sampled with replacementr* r z#Combination contained no duplicatesN)r r �#random_combination_with_replacementr� r r� r� )r rw Zcombor r r �test_replacement1 s z6RandomCombinationWithReplacementTests.test_replacementc C sH t d�}t� }t d�D ] }t�|d�}|t|�O }q| �|t|�� dS r� )r r� r r r r� r r r �test_pseudorandomness9 s z;RandomCombinationWithReplacementTests.test_pseudorandomnessN)r% r& r' r( r r r r r r r . s r c @ s e Zd Zdd� Zdd� ZdS )�NthCombinationTestsc C s> d}d}t t||��D ]"\}}t�|||�}| �||� qd S )N�abcdefgr, )rg r r �nth_combinationr )r r� r_ �index�expected�actualr r r rl E s z NthCombinationTests.test_basicc C s& t �td�dd�}d}| �||� d S )N� r, i�� )r � �# �~ )r r r r )r r r r r r � test_longL s z NthCombinationTests.test_longN)r% r& r' rl r r r r r r D s r c @ s e Zd Zdd� Zdd� ZdS )� PrependTestsc C s4 d}t d�}tt�||��}td�}| �||� d S )Nr� Zbcdefgr )�iterr r �prependr �r �value�iteratorr r r r r rl S s zPrependTests.test_basicc C s8 d}t d�}tt�||��}dtd� }| �||� d S )N�abZcdefg)r )r rB r r r r r r r � test_multipleZ s zPrependTests.test_multipleN)r% r& r' rl r r r r r r R s r )'Zdoctestr Zunittestr � itertoolsr Z six.movesr Zmore_itertoolsr r r r) r9 rI rY rf rp r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r �<module> sB +'