





"""simple docstring"""
import os
from itertools import chain
from random import randrange, shuffle

import pytest

from .sola import PokerHand

__UpperCamelCase     :						Union[str, Any]						       =  (
    '''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)
)

__UpperCamelCase     :						Any						       =  (
    ('''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'''),
)

__UpperCamelCase     :						int						       =  (
    ('''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),
)

__UpperCamelCase     :						List[Any]						       =  (
    ('''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),
)

__UpperCamelCase     :						Dict						       =  (
    ('''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]),
)

__UpperCamelCase     :						Optional[int]						       =  (
    ('''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),
)

__UpperCamelCase     :						Optional[int]						       =  (
    ('''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 		_SCREAMING_SNAKE_CASE			():
 lowerCAmelCase				,lowerCAmelCase    				= randrange(len(_UpperCAmelCase			)			), randrange(len(_UpperCAmelCase			)			)
 lowerCAmelCase    				= ['Loss', 'Tie', 'Win'][(play >= oppo) + (play > oppo)]
 lowerCAmelCase				,lowerCAmelCase    				= SORTED_HANDS[play], SORTED_HANDS[oppo]
 return hand, other, expected

def 		_SCREAMING_SNAKE_CASE			(_UpperCAmelCase					:    int = 100			):
 return (generate_random_hand() for _ in range(_UpperCAmelCase			))

@pytest.mark.parametrize('hand, expected'  ,     _UpperCAmelCase			)
def 		_SCREAMING_SNAKE_CASE			(_UpperCAmelCase					:    Any  ,     _UpperCAmelCase					:    List[str]			):
 assert PokerHand(_UpperCAmelCase			)._is_flush() == expected

@pytest.mark.parametrize('hand, expected'  ,     _UpperCAmelCase			)
def 		_SCREAMING_SNAKE_CASE			(_UpperCAmelCase					:    List[Any]  ,     _UpperCAmelCase					:    Any			):
 assert PokerHand(_UpperCAmelCase			)._is_straight() == expected

@pytest.mark.parametrize('hand, expected, card_values'  ,     _UpperCAmelCase			)
def 		_SCREAMING_SNAKE_CASE			(_UpperCAmelCase					:    List[Any]  ,     _UpperCAmelCase					:    int  ,     _UpperCAmelCase					:    int			):
 lowerCAmelCase    				= PokerHand(_UpperCAmelCase			)
 assert player._is_five_high_straight() == expected
 assert player._card_values == card_values

@pytest.mark.parametrize('hand, expected'  ,     _UpperCAmelCase			)
def 		_SCREAMING_SNAKE_CASE			(_UpperCAmelCase					:    Dict  ,     _UpperCAmelCase					:    List[Any]			):
 assert PokerHand(_UpperCAmelCase			)._is_same_kind() == expected

@pytest.mark.parametrize('hand, expected'  ,     _UpperCAmelCase			)
def 		_SCREAMING_SNAKE_CASE			(_UpperCAmelCase					:    Tuple  ,     _UpperCAmelCase					:    List[str]			):
 assert PokerHand(_UpperCAmelCase			)._hand_type == expected

@pytest.mark.parametrize('hand, other, expected'  ,     _UpperCAmelCase			)
def 		_SCREAMING_SNAKE_CASE			(_UpperCAmelCase					:    Tuple  ,     _UpperCAmelCase					:    List[str]  ,     _UpperCAmelCase					:    Optional[int]			):
 assert PokerHand(_UpperCAmelCase			).compare_with(PokerHand(_UpperCAmelCase			)			) == expected

@pytest.mark.parametrize('hand, other, expected'  ,     generate_random_hands()			)
def 		_SCREAMING_SNAKE_CASE			(_UpperCAmelCase					:    Dict  ,     _UpperCAmelCase					:    Dict  ,     _UpperCAmelCase					:    Optional[int]			):
 assert PokerHand(_UpperCAmelCase			).compare_with(PokerHand(_UpperCAmelCase			)			) == expected

def 		_SCREAMING_SNAKE_CASE			():
 lowerCAmelCase    				= [PokerHand(_UpperCAmelCase			) for hand in SORTED_HANDS]
 lowerCAmelCase    				= poker_hands.copy()
 shuffle(_UpperCAmelCase			)
 lowerCAmelCase    				= chain(sorted(_UpperCAmelCase			)			)
 for index, hand in enumerate(_UpperCAmelCase			):
  assert hand == poker_hands[index]

def 		_SCREAMING_SNAKE_CASE			():
 # Test that five high straights are compared correctly.
 lowerCAmelCase    				= [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 		_SCREAMING_SNAKE_CASE			():
 # Multiple calls to five_high_straight function should still return True
 # and shouldn't mutate the list in every call other than the first.
 lowerCAmelCase    				= PokerHand('2C 4S AS 3D 5C'			)
 lowerCAmelCase    				= True
 lowerCAmelCase    				= [5, 4, 3, 2, 14]
 for _ in range(10			):
  assert pokerhand._is_five_high_straight() == expected
  assert pokerhand._card_values == expected_card_values




def 		_SCREAMING_SNAKE_CASE			():
 # Problem number 54 from Project Euler
 # Testing from poker_hands.txt file
 lowerCAmelCase    				= 0
 lowerCAmelCase    				= os.path.abspath(os.path.dirname(_UpperCAmelCase			)			)
 lowerCAmelCase    				= os.path.join(_UpperCAmelCase  ,     'poker_hands.txt'			)
 with open(_UpperCAmelCase			) as file_hand:
  for line in file_hand:
   lowerCAmelCase    				= line[:14].strip()
   lowerCAmelCase    				= line[15:].strip()
   lowerCAmelCase				,lowerCAmelCase    				= PokerHand(_UpperCAmelCase			), PokerHand(_UpperCAmelCase			)
   lowerCAmelCase    				= player.compare_with(_UpperCAmelCase			)
   if output == "Win":
    answer += 1
 assert answer == 376












"""simple docstring"""
from typing import Any







class       a							:



 def __init__(     self				,       _snake_case     ):







  """simple docstring"""






  lowerCAmelCase    				= data
  lowerCAmelCase    				= None



 def __repr__(     self     ):







  """simple docstring"""






  return F'Node({self.data})'







class       a							:



 def __init__(     self     ):







  """simple docstring"""






  lowerCAmelCase    				= None



 def __iter__(     self     ):







  """simple docstring"""






  lowerCAmelCase    				= self.head
  while node:
   yield node.data
   lowerCAmelCase    				= node.next



 def __len__(     self     ):







  """simple docstring"""






  return sum(1 for _ in self     )



 def __repr__(     self     ):







  """simple docstring"""






  return "->".join([str(_snake_case     ) for item in self]     )



 def __getitem__(     self				,       _snake_case     ):







  """simple docstring"""






  if not 0 <= index < len(self     ):
   raise ValueError('list index out of range.'     )
  for i, node in enumerate(self     ):
   if i == index:
    return node
  return None



 def __setitem__(     self				,       _snake_case				,       _snake_case     ):







  """simple docstring"""






  if not 0 <= index < len(self     ):
   raise ValueError('list index out of range.'     )
  lowerCAmelCase    				= self.head
  for _ in range(_snake_case     ):
   lowerCAmelCase    				= current.next
  lowerCAmelCase    				= data



 def    UpperCamelCase__  (     self				,       _snake_case     ):







  """simple docstring"""






  self.insert_nth(len(self     )				,       _snake_case     )



 def    UpperCamelCase__  (     self				,       _snake_case     ):







  """simple docstring"""






  self.insert_nth(0				,       _snake_case     )



 def    UpperCamelCase__  (     self				,       _snake_case				,       _snake_case     ):







  """simple docstring"""






  if not 0 <= index <= len(self     ):
   raise IndexError('list index out of range'     )
  lowerCAmelCase    				= Node(_snake_case     )
  if self.head is None:
   lowerCAmelCase    				= new_node
  elif index == 0:
   lowerCAmelCase    				= self.head  # link new_node to head
   lowerCAmelCase    				= new_node
  else:
   lowerCAmelCase    				= self.head
   for _ in range(index - 1     ):
    lowerCAmelCase    				= temp.next
   lowerCAmelCase    				= temp.next
   lowerCAmelCase    				= new_node



 def    UpperCamelCase__  (     self     ):  # print every node data







  """simple docstring"""






  print(self     )



 def    UpperCamelCase__  (     self     ):







  """simple docstring"""






  return self.delete_nth(0     )



 def    UpperCamelCase__  (     self     ):  # delete from tail







  """simple docstring"""






  return self.delete_nth(len(self     ) - 1     )



 def    UpperCamelCase__  (     self				,       _snake_case = 0     ):







  """simple docstring"""






  if not 0 <= index <= len(self     ) - 1:  # test if index is valid
   raise IndexError('List index out of range.'     )
  lowerCAmelCase    				= self.head  # default first node
  if index == 0:
   lowerCAmelCase    				= self.head.next
  else:
   lowerCAmelCase    				= self.head
   for _ in range(index - 1     ):
    lowerCAmelCase    				= temp.next
   lowerCAmelCase    				= temp.next
   lowerCAmelCase    				= temp.next.next
  return delete_node.data



 def    UpperCamelCase__  (     self     ):







  """simple docstring"""






  return self.head is None



 def    UpperCamelCase__  (     self     ):







  """simple docstring"""






  lowerCAmelCase    				= None
  lowerCAmelCase    				= self.head

  while current:
   # Store the current node's next node.
   lowerCAmelCase    				= current.next
   # Make the current node's next point backwards
   lowerCAmelCase    				= prev
   # Make the previous node be the current node
   lowerCAmelCase    				= current
   # Make the current node the next node (to progress iteration)
   lowerCAmelCase    				= next_node
  # Return prev in order to put the head at the end
  lowerCAmelCase    				= prev


def 		_SCREAMING_SNAKE_CASE			():
 lowerCAmelCase    				= LinkedList()
 assert linked_list.is_empty() is True
 assert str(_UpperCAmelCase			) == ""

 try:
  linked_list.delete_head()
  raise AssertionError  # This should not happen.
 except IndexError:
  assert True  # This should happen.

 try:
  linked_list.delete_tail()
  raise AssertionError  # This should not happen.
 except IndexError:
  assert True  # This should happen.

 for i in range(10			):
  assert len(_UpperCAmelCase			) == i
  linked_list.insert_nth(_UpperCAmelCase  ,     i + 1			)
 assert str(_UpperCAmelCase			) == "->".join(str(_UpperCAmelCase			) for i in range(1  ,     11			)			)

 linked_list.insert_head(0			)
 linked_list.insert_tail(11			)
 assert str(_UpperCAmelCase			) == "->".join(str(_UpperCAmelCase			) for i in range(0  ,     12			)			)

 assert linked_list.delete_head() == 0
 assert linked_list.delete_nth(9			) == 10
 assert linked_list.delete_tail() == 11
 assert len(_UpperCAmelCase			) == 9
 assert str(_UpperCAmelCase			) == "->".join(str(_UpperCAmelCase			) for i in range(1  ,     10			)			)

 assert all(linked_list[i] == i + 1 for i in range(0  ,     9			)			) is True

 for i in range(0  ,     9			):
  lowerCAmelCase    				= -i
 assert all(linked_list[i] == -i for i in range(0  ,     9			)			) is True

 linked_list.reverse()
 assert str(_UpperCAmelCase			) == "->".join(str(_UpperCAmelCase			) for i in range(-8  ,     1			)			)

def 		_SCREAMING_SNAKE_CASE			():
 lowerCAmelCase    				= [
     -9,
     100,
     Node(7734_5112			),
     'dlrow olleH',
     7,
     5555,
     0,
     -192.5_5555,
     'Hello, world!',
     77.9,
     Node(10			),
     None,
     None,
     12.20,
 ]
 lowerCAmelCase    				= LinkedList()

 for i in test_input:
  linked_list.insert_tail(_UpperCAmelCase			)

 # Check if it's empty or not
 assert linked_list.is_empty() is False
 assert (
     str(_UpperCAmelCase			) == "-9->100->Node(77345112)->dlrow olleH->7->5555->0->"
     "-192.55555->Hello, world!->77.9->Node(10)->None->None->12.2"
 )

 # Delete the head
 lowerCAmelCase    				= linked_list.delete_head()
 assert result == -9
 assert (
     str(_UpperCAmelCase			) == "100->Node(77345112)->dlrow olleH->7->5555->0->-192.55555->"
     "Hello, world!->77.9->Node(10)->None->None->12.2"
 )

 # Delete the tail
 lowerCAmelCase    				= linked_list.delete_tail()
 assert result == 12.2
 assert (
     str(_UpperCAmelCase			) == "100->Node(77345112)->dlrow olleH->7->5555->0->-192.55555->"
     "Hello, world!->77.9->Node(10)->None->None"
 )

 # Delete a node in specific location in linked list
 lowerCAmelCase    				= linked_list.delete_nth(10			)
 assert result is None
 assert (
     str(_UpperCAmelCase			) == "100->Node(77345112)->dlrow olleH->7->5555->0->-192.55555->"
     "Hello, world!->77.9->Node(10)->None"
 )

 # Add a Node instance to its head
 linked_list.insert_head(Node('Hello again, world!'			)			)
 assert (
     str(_UpperCAmelCase			)
     == "Node(Hello again, world!)->100->Node(77345112)->dlrow olleH->"
     "7->5555->0->-192.55555->Hello, world!->77.9->Node(10)->None"
 )

 # Add None to its tail
 linked_list.insert_tail(_UpperCAmelCase			)
 assert (
     str(_UpperCAmelCase			)
     == "Node(Hello again, world!)->100->Node(77345112)->dlrow olleH->"
     "7->5555->0->-192.55555->Hello, world!->77.9->Node(10)->None->None"
 )

 # Reverse the linked list
 linked_list.reverse()
 assert (
     str(_UpperCAmelCase			)
     == "None->None->Node(10)->77.9->Hello, world!->-192.55555->0->5555->"
     "7->dlrow olleH->Node(77345112)->100->Node(Hello again, world!)"
 )

def 		_SCREAMING_SNAKE_CASE			():
 from doctest import testmod

 testmod()

 lowerCAmelCase    				= LinkedList()
 linked_list.insert_head(input('Inserting 1st at head '			).strip()			)
 linked_list.insert_head(input('Inserting 2nd at head '			).strip()			)
 print('\nPrint list:'			)
 linked_list.print_list()
 linked_list.insert_tail(input('\nInserting 1st at tail '			).strip()			)
 linked_list.insert_tail(input('Inserting 2nd at tail '			).strip()			)
 print('\nPrint list:'			)
 linked_list.print_list()
 print('\nDelete head'			)
 linked_list.delete_head()
 print('Delete tail'			)
 linked_list.delete_tail()
 print('\nPrint list:'			)
 linked_list.print_list()
 print('\nReverse linked list'			)
 linked_list.reverse()
 print('\nPrint list:'			)
 linked_list.print_list()
 print('\nString representation of linked list:'			)
 print(_UpperCAmelCase			)
 print('\nReading/changing Node data using indexing:'			)
 print(F'Element at Position 1: {linked_list[1]}'			)
 lowerCAmelCase    				= input('Enter New Value: '			).strip()
 print('New list:'			)
 print(_UpperCAmelCase			)
 print(F'length of linked_list is : {len(_UpperCAmelCase			)}'			)


if __name__ == "__main__":
       main()





