





"""simple docstring"""




from __future__ import annotations






def       _SCREAMING_SNAKE_CASE		(	_lowercase						:    list[int]    ,       _lowercase						:    list[int]    ,       _lowercase						:    list[int]    ,       _lowercase						:    list[list[str]]    ,       _lowercase						:    int    ,       ) ->None:






	'''simple docstring'''






	a      :		Optional[int]	=				len(_lowercase					)

	# If row is equal to the size of the board it means there are a queen in each row in
	# the current board (possible_board)
	if row == n:
		# We convert the variable possible_board that looks like this: [1, 3, 0, 2] to
		# this: ['. Q . . ', '. . . Q ', 'Q . . . ', '. . Q . ']
		boards.append([". " * i + "Q " + ". " * (n - 1 - i) for i in possible_board]					)
		return

	# We iterate each column in the row to find all possible results in each row
	for col in range(_lowercase					):
		# We apply that we learned previously. First we check that in the current board
		# (possible_board) there are not other same value because if there is it means
		# that there are a collision in vertical. Then we apply the two formulas we
		# learned before:
		#
		# 45º: y - x = b or 45: row - col = b
		# 135º: y + x = b or row + col = b.
		#
		# And we verify if the results of this two formulas not exist in their variables
		# respectively.  (diagonal_right_collisions, diagonal_left_collisions)
		#
		# If any or these are True it means there is a collision so we continue to the
		# next value in the for loop.
		if (
		    col in possible_board
		    or row - col in diagonal_right_collisions
		    or row + col in diagonal_left_collisions
		):
			continue

		# If it is False we call dfs function again and we update the inputs
		depth_first_search(
		    [*possible_board, col]    ,       [*diagonal_right_collisions, row - col]    ,       [*diagonal_left_collisions, row + col]    ,       _lowercase    ,       _lowercase    ,       )






def       _SCREAMING_SNAKE_CASE		(	_lowercase						:    int					) ->None:






	'''simple docstring'''






	a      :		list[list[str]]	=				[]
	depth_first_search([]    ,       []    ,       []    ,       _lowercase    ,       _lowercase					)

	# Print all the boards
	for board in boards:
		for column in board:
			print(_lowercase					)
		print(""					)

	print(len(_lowercase					)    ,       "solutions were found."					)


if __name__ == "__main__":
		import doctest

		doctest.testmod()
		n_queens_solution(4)









"""simple docstring"""




from unittest.mock import Mock, patch

from file_transfer.send_file import send_file






@patch("socket.socket"					)
@patch("builtins.open"					)
def       _SCREAMING_SNAKE_CASE		(	_lowercase						:    List[Any]    ,       _lowercase						:    int					) ->str:






	'''simple docstring'''






	a      :		Optional[Any]	=				Mock()
	a      :		Dict	=				conn, Mock()
	a      :		Union[str, Any]	=				iter([1, None]					)
	a      :		Optional[int]	=				lambda _lowercase					: next(_lowercase					)

	# ===== invoke =====
	send_file(filename="mytext.txt"    ,       testing=_lowercase					)

	# ===== ensurance =====
	sock.assert_called_once()
	sock.return_value.bind.assert_called_once()
	sock.return_value.listen.assert_called_once()
	sock.return_value.accept.assert_called_once()
	conn.recv.assert_called_once()

	file.return_value.__enter__.assert_called_once()
	file.return_value.__enter__.return_value.read.assert_called()

	conn.send.assert_called_once()
	conn.close.assert_called_once()
	sock.return_value.shutdown.assert_called_once()
	sock.return_value.close.assert_called_once()


