



"""simple docstring"""





from __future__ import annotations

import unittest

from transformers import is_tf_available
from transformers.testing_utils import require_sentencepiece, require_tf, require_tokenizers, slow


if is_tf_available():
	import numpy as np
	import tensorflow as tf

	from transformers import TFCamembertModel




@require_tf
@require_sentencepiece
@require_tokenizers
class 			lowercase__			(      unittest.TestCase    ):
							'''simple docstring'''







							@slow
							def        lowerCamelCase_   (  self						)			->							Union[str, Any]:
									_UpperCAmelCase							 =		TFCamembertModel.from_pretrained('jplu/tf-camembert-base'						)

									_UpperCAmelCase							 =		tf.convert_to_tensor(
									    [[5, 121, 11, 660, 16, 730, 25543, 110, 83, 6]]	,       dtype=tf.intaa	,       )  # J'aime le camembert !"

									_UpperCAmelCase							 =		model(_a						)["""last_hidden_state"""]
									_UpperCAmelCase							 =		tf.TensorShape((1, 10, 768)						)
									self.assertEqual(output.shape	,       _a						)
									# compare the actual values for a slice.
									_UpperCAmelCase							 =		tf.convert_to_tensor(
									    [[[-0.0254, 0.0235, 0.1027], [0.0606, -0.1811, -0.0418], [-0.1561, -0.1127, 0.2687]]]	,       dtype=tf.floataa	,       )
									# camembert = torch.hub.load('pytorch/fairseq', 'camembert.v0')
									# camembert.eval()
									# expected_slice = roberta.model.forward(input_ids)[0][:, :3, :3].detach()

									self.assertTrue(np.allclose(output[:, :3, :3].numpy()	,       expected_slice.numpy()	,       atol=1E-4						)						)







"""simple docstring"""





from __future__ import annotations




def 	UpperCAmelCase     (		A	:						int     ,				A	:						int       ):

		'''simple docstring'''


		_UpperCAmelCase							 =		[]
		create_all_state(1     ,				A     ,				A     ,				[]     ,				A       )
		return result




def 	UpperCAmelCase     (		A	:						int     ,				A	:						int     ,				A	:						int     ,				A	:						list[int]     ,				A	:						list[list[int]]     ,				):

		'''simple docstring'''


		if level == 0:
				total_list.append(current_list[:]       )
				return

		for i in range(A     ,				total_number - level + 2       ):
				current_list.append(A       )
				create_all_state(i + 1     ,				A     ,				level - 1     ,				A     ,				A       )
				current_list.pop()




def 	UpperCAmelCase     (		A	:						list[list[int]]       ):

		'''simple docstring'''


		for i in total_list:
				print(*A       )


if __name__ == "__main__":
					lowercase  							=					4
					lowercase  							=					2
					lowercase  							=					generate_all_combinations(n, k)
					print_all_state(total_list)


