

'''simple docstring'''







import os
from itertools import chain
from random import randrange, shuffle

import pytest

from .sola import PokerHand

__lowerCamelCase						    =      (
    '''4S 3H 2C 7S 5H''',
    '''9D 8H 2C 6S 7H''',
    '''2D 6D 9D TH 7D''',
    '''TC 8C 2S JH 6C''',
    '''JH 8S TH AH QH''',
    '''TS KS 5S 9S AC''',
    '''KD 6S 9D TH AD''',
    '''KS 8D 4D 9S 4S''',  # pair
    '''8C 4S KH JS 4D''',  # pair
    '''QH 8H KD JH 8S''',  # pair
    '''KC 4H KS 2H 8D''',  # pair
    '''KD 4S KC 3H 8S''',  # pair
    '''AH 8S AS KC JH''',  # pair
    '''3H 4C 4H 3S 2H''',  # 2 pairs
    '''5S 5D 2C KH KH''',  # 2 pairs
    '''3C KH 5D 5S KH''',  # 2 pairs
    '''AS 3C KH AD KH''',  # 2 pairs
    '''7C 7S 3S 7H 5S''',  # 3 of a kind
    '''7C 7S KH 2H 7H''',  # 3 of a kind
    '''AC KH QH AH AS''',  # 3 of a kind
    '''2H 4D 3C AS 5S''',  # straight (low ace)
    '''3C 5C 4C 2C 6H''',  # straight
    '''6S 8S 7S 5H 9H''',  # straight
    '''JS QS 9H TS KH''',  # straight
    '''QC KH TS JS AH''',  # straight (high ace)
    '''8C 9C 5C 3C TC''',  # flush
    '''3S 8S 9S 5S KS''',  # flush
    '''4C 5C 9C 8C KC''',  # flush
    '''JH 8H AH KH QH''',  # flush
    '''3D 2H 3H 2C 2D''',  # full house
    '''2H 2C 3S 3H 3D''',  # full house
    '''KH KC 3S 3H 3D''',  # full house
    '''JC 6H JS JD JH''',  # 4 of a kind
    '''JC 7H JS JD JH''',  # 4 of a kind
    '''JC KH JS JD JH''',  # 4 of a kind
    '''2S AS 4S 5S 3S''',  # straight flush (low ace)
    '''2D 6D 3D 4D 5D''',  # straight flush
    '''5C 6C 3C 7C 4C''',  # straight flush
    '''JH 9H TH KH QH''',  # straight flush
    '''JH AH TH KH QH''',  # royal flush (high ace straight flush)
)

__lowerCamelCase						    =      (
    ('''2H 3H 4H 5H 6H''', '''KS AS TS QS JS''', '''Loss'''),
    ('''2H 3H 4H 5H 6H''', '''AS AD AC AH JD''', '''Win'''),
    ('''AS AH 2H AD AC''', '''JS JD JC JH 3D''', '''Win'''),
    ('''2S AH 2H AS AC''', '''JS JD JC JH AD''', '''Loss'''),
    ('''2S AH 2H AS AC''', '''2H 3H 5H 6H 7H''', '''Win'''),
    ('''AS 3S 4S 8S 2S''', '''2H 3H 5H 6H 7H''', '''Win'''),
    ('''2H 3H 5H 6H 7H''', '''2S 3H 4H 5S 6C''', '''Win'''),
    ('''2S 3H 4H 5S 6C''', '''3D 4C 5H 6H 2S''', '''Tie'''),
    ('''2S 3H 4H 5S 6C''', '''AH AC 5H 6H AS''', '''Win'''),
    ('''2S 2H 4H 5S 4C''', '''AH AC 5H 6H AS''', '''Loss'''),
    ('''2S 2H 4H 5S 4C''', '''AH AC 5H 6H 7S''', '''Win'''),
    ('''6S AD 7H 4S AS''', '''AH AC 5H 6H 7S''', '''Loss'''),
    ('''2S AH 4H 5S KC''', '''AH AC 5H 6H 7S''', '''Loss'''),
    ('''2S 3H 6H 7S 9C''', '''7H 3C TH 6H 9S''', '''Loss'''),
    ('''4S 5H 6H TS AC''', '''3S 5H 6H TS AC''', '''Win'''),
    ('''2S AH 4H 5S 6C''', '''AD 4C 5H 6H 2C''', '''Tie'''),
    ('''AS AH 3H AD AC''', '''AS AH 2H AD AC''', '''Win'''),
    ('''AH AC 5H 5C QS''', '''AH AC 5H 5C KS''', '''Loss'''),
    ('''AH AC 5H 5C QS''', '''KH KC 5H 5C QS''', '''Win'''),
    ('''7C 7S KH 2H 7H''', '''3C 3S AH 2H 3H''', '''Win'''),
    ('''3C 3S AH 2H 3H''', '''7C 7S KH 2H 7H''', '''Loss'''),
    ('''6H 5H 4H 3H 2H''', '''5H 4H 3H 2H AH''', '''Win'''),
    ('''5H 4H 3H 2H AH''', '''5H 4H 3H 2H AH''', '''Tie'''),
    ('''5H 4H 3H 2H AH''', '''6H 5H 4H 3H 2H''', '''Loss'''),
    ('''AH AD KS KC AC''', '''AH KD KH AC KC''', '''Win'''),
    ('''2H 4D 3C AS 5S''', '''2H 4D 3C 6S 5S''', '''Loss'''),
    ('''2H 3S 3C 3H 2S''', '''3S 3C 2S 2H 2D''', '''Win'''),
    ('''4D 6D 5D 2D JH''', '''3S 8S 3H TC KH''', '''Loss'''),
    ('''4S 6C 8S 3S 7S''', '''AD KS 2D 7D 7C''', '''Loss'''),
    ('''6S 4C 7H 8C 3H''', '''5H JC AH 9D 9C''', '''Loss'''),
    ('''9D 9H JH TC QH''', '''3C 2S JS 5C 7H''', '''Win'''),
    ('''2H TC 8S AD 9S''', '''4H TS 7H 2C 5C''', '''Win'''),
    ('''9D 3S 2C 7S 7C''', '''JC TD 3C TC 9H''', '''Loss'''),
)

__lowerCamelCase						    =      (
    ('''2H 3H 4H 5H 6H''', True),
    ('''AS AH 2H AD AC''', False),
    ('''2H 3H 5H 6H 7H''', True),
    ('''KS AS TS QS JS''', True),
    ('''8H 9H QS JS TH''', False),
    ('''AS 3S 4S 8S 2S''', True),
)

__lowerCamelCase						    =      (
    ('''2H 3H 4H 5H 6H''', True),
    ('''AS AH 2H AD AC''', False),
    ('''2H 3H 5H 6H 7H''', False),
    ('''KS AS TS QS JS''', True),
    ('''8H 9H QS JS TH''', True),
)

__lowerCamelCase						    =      (
    ('''2H 4D 3C AS 5S''', True, [5, 4, 3, 2, 14]),
    ('''2H 5D 3C AS 5S''', False, [14, 5, 5, 3, 2]),
    ('''JH QD KC AS TS''', False, [14, 13, 12, 11, 10]),
    ('''9D 3S 2C 7S 7C''', False, [9, 7, 7, 3, 2]),
)

__lowerCamelCase						    =      (
    ('''JH AH TH KH QH''', 0),
    ('''JH 9H TH KH QH''', 0),
    ('''JC KH JS JD JH''', 7),
    ('''KH KC 3S 3H 3D''', 6),
    ('''8C 9C 5C 3C TC''', 0),
    ('''JS QS 9H TS KH''', 0),
    ('''7C 7S KH 2H 7H''', 3),
    ('''3C KH 5D 5S KH''', 2),
    ('''QH 8H KD JH 8S''', 1),
    ('''2D 6D 9D TH 7D''', 0),
)

__lowerCamelCase						    =      (
    ('''JH AH TH KH QH''', 23),
    ('''JH 9H TH KH QH''', 22),
    ('''JC KH JS JD JH''', 21),
    ('''KH KC 3S 3H 3D''', 20),
    ('''8C 9C 5C 3C TC''', 19),
    ('''JS QS 9H TS KH''', 18),
    ('''7C 7S KH 2H 7H''', 17),
    ('''3C KH 5D 5S KH''', 16),
    ('''QH 8H KD JH 8S''', 15),
    ('''2D 6D 9D TH 7D''', 14),
)
def  UpperCAmelCase__      ( )     ->     Tuple:
       A_   ,     A_		   = randrange(len(UpperCAmelCase__			)			), randrange(len(UpperCAmelCase__			)			)
       A_		   = ["""Loss""", """Tie""", """Win"""][(play >= oppo) + (play > oppo)]
       A_   ,     A_		   = SORTED_HANDS[play], SORTED_HANDS[oppo]
       return hand, other, expected
def  UpperCAmelCase__      ( UpperCAmelCase__ = 1_00			)     ->     List[str]:
       return (generate_random_hand() for _ in range(UpperCAmelCase__			))
@pytest.mark.parametrize("""hand, expected""",    UpperCAmelCase__			)
def  UpperCAmelCase__      ( UpperCAmelCase__,    UpperCAmelCase__			)     ->     Tuple:
       assert PokerHand(UpperCAmelCase__			)._is_flush() == expected
@pytest.mark.parametrize("""hand, expected""",    UpperCAmelCase__			)
def  UpperCAmelCase__      ( UpperCAmelCase__,    UpperCAmelCase__			)     ->     List[str]:
       assert PokerHand(UpperCAmelCase__			)._is_straight() == expected
@pytest.mark.parametrize("""hand, expected, card_values""",    UpperCAmelCase__			)
def  UpperCAmelCase__      ( UpperCAmelCase__,    UpperCAmelCase__,    UpperCAmelCase__			)     ->     Tuple:
       A_		   = PokerHand(UpperCAmelCase__			)
       assert player._is_five_high_straight() == expected
       assert player._card_values == card_values
@pytest.mark.parametrize("""hand, expected""",    UpperCAmelCase__			)
def  UpperCAmelCase__      ( UpperCAmelCase__,    UpperCAmelCase__			)     ->     Dict:
       assert PokerHand(UpperCAmelCase__			)._is_same_kind() == expected
@pytest.mark.parametrize("""hand, expected""",    UpperCAmelCase__			)
def  UpperCAmelCase__      ( UpperCAmelCase__,    UpperCAmelCase__			)     ->     Tuple:
       assert PokerHand(UpperCAmelCase__			)._hand_type == expected
@pytest.mark.parametrize("""hand, other, expected""",    UpperCAmelCase__			)
def  UpperCAmelCase__      ( UpperCAmelCase__,    UpperCAmelCase__,    UpperCAmelCase__			)     ->     Union[str, Any]:
       assert PokerHand(UpperCAmelCase__			).compare_with(PokerHand(UpperCAmelCase__			)			) == expected
@pytest.mark.parametrize("""hand, other, expected""",    generate_random_hands()			)
def  UpperCAmelCase__      ( UpperCAmelCase__,    UpperCAmelCase__,    UpperCAmelCase__			)     ->     str:
       assert PokerHand(UpperCAmelCase__			).compare_with(PokerHand(UpperCAmelCase__			)			) == expected
def  UpperCAmelCase__      ( )     ->     Dict:
       A_		   = [PokerHand(UpperCAmelCase__			) for hand in SORTED_HANDS]
       A_		   = poker_hands.copy()
       shuffle(UpperCAmelCase__			)
       A_		   = chain(sorted(UpperCAmelCase__			)			)
       for index, hand in enumerate(UpperCAmelCase__			):
              assert hand == poker_hands[index]
def  UpperCAmelCase__      ( )     ->     Any:
       # Test that five high straights are compared correctly.
       A_		   = [PokerHand("""2D AC 3H 4H 5S"""			), PokerHand("""2S 3H 4H 5S 6C"""			)]
       pokerhands.sort(reverse=UpperCAmelCase__			)
       assert pokerhands[0].__str__() == "2S 3H 4H 5S 6C"
def  UpperCAmelCase__      ( )     ->     List[Any]:
       # Multiple calls to five_high_straight function should still return True
       # and shouldn't mutate the list in every call other than the first.
       A_		   = PokerHand("""2C 4S AS 3D 5C"""			)
       A_		   = True
       A_		   = [5, 4, 3, 2, 14]
       for _ in range(10			):
              assert pokerhand._is_five_high_straight() == expected
              assert pokerhand._card_values == expected_card_values







def  UpperCAmelCase__      ( )     ->     Union[str, Any]:
       # Problem number 54 from Project Euler
       # Testing from poker_hands.txt file
       A_		   = 0
       A_		   = os.path.abspath(os.path.dirname(UpperCAmelCase__			)			)
       A_		   = os.path.join(UpperCAmelCase__,    """poker_hands.txt"""			)
       with open(UpperCAmelCase__			) as file_hand:
              for line in file_hand:
                     A_		   = line[:14].strip()
                     A_		   = line[15:].strip()
                     A_   ,     A_		   = PokerHand(UpperCAmelCase__			), PokerHand(UpperCAmelCase__			)
                     A_		   = player.compare_with(UpperCAmelCase__			)
                     if output == "Win":
                            answer += 1
       assert answer == 3_76



'''simple docstring'''







import heapq as hq
import math
from collections.abc import Iterator


class    A__ :



    def __init__(   self						,			UpperCamelCase__    )  -> Dict:





           '''simple docstring'''
           A_		   = str(id_    )
           A_		   = None
           A_		   = None
           A_		   = []
           A_		   = {}  # {vertex:distance}



    def __lt__(   self						,			UpperCamelCase__    )  -> Optional[int]:





           '''simple docstring'''
           return self.key < other.key



    def __repr__(   self    )  -> Dict:





           '''simple docstring'''
           return self.id



    def    snake_case_     (   self						,			UpperCamelCase__    )  -> Dict:





           '''simple docstring'''
           self.neighbors.append(UpperCamelCase__    )







    def    snake_case_     (   self						,			UpperCamelCase__						,			UpperCamelCase__    )  -> Optional[Any]:





           '''simple docstring'''
           A_		   = weight

def  UpperCAmelCase__      ( UpperCAmelCase__,    UpperCAmelCase__,    UpperCAmelCase__,    UpperCAmelCase__			)     ->     Optional[int]:
       # add the neighbors:
       graph[a - 1].add_neighbor(graph[b - 1]			)
       graph[b - 1].add_neighbor(graph[a - 1]			)
       # add the edges:
       graph[a - 1].add_edge(graph[b - 1],    UpperCAmelCase__			)
       graph[b - 1].add_edge(graph[a - 1],    UpperCAmelCase__			)
def  UpperCAmelCase__      ( UpperCAmelCase__,    UpperCAmelCase__			)     ->     list:
       A_		   = []
       for u in graph:
              A_		   = math.inf
              A_		   = None
       A_		   = 0
       A_		   = graph[:]
       while q:
              A_		   = min(UpperCAmelCase__			)
              q.remove(UpperCAmelCase__			)
              for v in u.neighbors:
                     if (v in q) and (u.edges[v.id] < v.key):
                            A_		   = u
                            A_		   = u.edges[v.id]
       for i in range(1,    len(UpperCAmelCase__			)			):
              a.append((int(graph[i].id			) + 1, int(graph[i].pi.id			) + 1)			)
       return a
def  UpperCAmelCase__      ( UpperCAmelCase__,    UpperCAmelCase__			)     ->     Iterator[tuple]:
       for u in graph:
              A_		   = math.inf
              A_		   = None
       A_		   = 0

       A_		   = list(UpperCAmelCase__			)
       hq.heapify(UpperCAmelCase__			)

       while h:
              A_		   = hq.heappop(UpperCAmelCase__			)
              for v in u.neighbors:
                     if (v in h) and (u.edges[v.id] < v.key):
                            A_		   = u
                            A_		   = u.edges[v.id]
                            hq.heapify(UpperCAmelCase__			)

       for i in range(1,    len(UpperCAmelCase__			)			):
              yield (int(graph[i].id			) + 1, int(graph[i].pi.id			) + 1)
def  UpperCAmelCase__      ( )     ->     None:
       pass


if __name__ == "__main__":
      import doctest

      doctest.testmod()
