



from collections import defaultdict



class   UpperCAmelCase_    :







							def __init__(   self,			__a,			__a):

														'''simple docstring'''

														_lowerCAmelCase     :							List[Any]    =    total  # total no of tasks (N)

														# DP table will have a dimension of (2^M)*N
														# initially all values are set to -1
														_lowerCAmelCase     :							Union[str, Any]    =    [
														    [-1 for i in range(total + 1)] for j in range(2 ** len(__UpperCAmelCase))
														]

														_lowerCAmelCase     :							List[str]    =    defaultdict(__UpperCAmelCase)  # stores the list of persons for each task

														# final_mask is used to check if all persons are included by setting all bits
														# to 1
														_lowerCAmelCase     :							Optional[int]    =    (1 << len(__UpperCAmelCase)) - 1







							def    snake_case__      (   self,			__a,			__a):

														'''simple docstring'''

														if mask == self.final_mask:
																					return 1

														# if not everyone gets the task and no more tasks are available, return 0
														if task_no > self.total_tasks:
																					return 0

														# if case already considered
														if self.dp[mask][task_no] != -1:
																					return self.dp[mask][task_no]

														# Number of ways when we don't this task in the arrangement
														_lowerCAmelCase     :							int    =    self.count_ways_until(__UpperCAmelCase,			task_no + 1)

														# now assign the tasks one by one to all possible persons and recursively
														# assign for the remaining tasks.
														if task_no in self.task:
																					for p in self.task[task_no]:
																												# if p is already given a task
																												if mask & (1 << p):
																																			continue

																												# assign this task to p and change the mask value. And recursively
																												# assign tasks with the new mask value.
																												total_ways_util += self.count_ways_until(mask | (1 << p),			task_no + 1)

        # save the value.
														_lowerCAmelCase     :							Dict    =    total_ways_util

														return self.dp[mask][task_no]







							def    snake_case__      (   self,			__a):

														'''simple docstring'''

														for i in range(len(__UpperCAmelCase)):
																					for j in task_performed[i]:
																												self.task[j].append(__UpperCAmelCase)

        # call the function to fill the DP table, final answer is stored in dp[0][1]
														return self.count_ways_until(0,			1)


if __name__ == "__main__":
						_snake_case		=  5  # total no of tasks (the value of N)

						# the list of tasks that can be done by M persons.
						_snake_case		=  [[1, 3, 4], [1, 2, 5], [3, 4]]
						print(
						    AssignmentUsingBitmask(task_performed, total_tasks).count_no_of_ways(
						        task_performed
						    )
						)

"""simple docstring"""




import unittest
from pathlib import Path
from tempfile import NamedTemporaryFile, TemporaryDirectory

from transformers import BertConfig, BertTokenizerFast, FeatureExtractionPipeline
from transformers.convert_graph_to_onnx import (
    convert,
    ensure_valid_input,
    generate_identified_filename,
    infer_shapes,
    quantize,
)
from transformers.testing_utils import require_tf, require_tokenizers, require_torch, slow
class 			UpperCamelCase__:





						def  snake_case__		(				self						,__UpperCAmelCase						,__UpperCAmelCase						,__UpperCAmelCase   )    -> int:
													return None






class 			UpperCamelCase__:





						def  snake_case__		(				self						,__UpperCAmelCase						,__UpperCAmelCase						,__UpperCAmelCase						,__UpperCAmelCase   )    -> Tuple:
													return None






class 			UpperCamelCase__(	unittest.TestCase       ):
						lowerCAmelCase__     :  Tuple  							=						[
						    # (model_name, model_kwargs)
						    ('bert-base-cased', {}),
						    ('gpt2', {'use_cache': False}),  # We don't support exporting GPT2 past keys anymore
						]





						@require_tf
						@slow
						def  snake_case__		(				self   )    -> int:
													for model, model_kwargs in OnnxExportTestCase.MODEL_TO_TEST:
																				self._test_export(__UpperCAmelCase						,'tf'						,12						,**__UpperCAmelCase   )





						@require_torch
						@slow
						def  snake_case__		(				self   )    -> int:
													for model, model_kwargs in OnnxExportTestCase.MODEL_TO_TEST:
																				self._test_export(__UpperCAmelCase						,'pt'						,12						,**__UpperCAmelCase   )





						@require_torch
						@slow
						def  snake_case__		(				self   )    -> Optional[Any]:
													from transformers import BertModel

													A__		   =							['[UNK]', '[SEP]', '[CLS]', '[PAD]', '[MASK]', 'some', 'other', 'words']
													with NamedTemporaryFile(mode='w+t'   ) as vocab_file:
																				vocab_file.write('\n'.join(__UpperCAmelCase   )   )
																				vocab_file.flush()
																				A__		   =							BertTokenizerFast(vocab_file.name   )

													with TemporaryDirectory() as bert_save_dir:
																				A__		   =							BertModel(BertConfig(vocab_size=len(__UpperCAmelCase   )   )   )
																				model.save_pretrained(__UpperCAmelCase   )
																				self._test_export(__UpperCAmelCase						,'pt'						,12						,__UpperCAmelCase   )





						@require_tf
						@slow
						def  snake_case__		(				self   )    -> Optional[Any]:
													for model, model_kwargs in OnnxExportTestCase.MODEL_TO_TEST:
																				A__		   =							self._test_export(__UpperCAmelCase						,'tf'						,12						,**__UpperCAmelCase   )
																				A__		   =							quantize(Path(__UpperCAmelCase   )   )

																				# Ensure the actual quantized model is not bigger than the original one
																				if quantized_path.stat().st_size >= Path(__UpperCAmelCase   ).stat().st_size:
																											self.fail('Quantized model is bigger than initial ONNX model'   )





						@require_torch
						@slow
						def  snake_case__		(				self   )    -> str:
													for model, model_kwargs in OnnxExportTestCase.MODEL_TO_TEST:
																				A__		   =							self._test_export(__UpperCAmelCase						,'pt'						,12						,**__UpperCAmelCase   )
																				A__		   =							quantize(__UpperCAmelCase   )

																				# Ensure the actual quantized model is not bigger than the original one
																				if quantized_path.stat().st_size >= Path(__UpperCAmelCase   ).stat().st_size:
																											self.fail('Quantized model is bigger than initial ONNX model'   )





						def  snake_case__		(				self						,__UpperCAmelCase						,__UpperCAmelCase						,__UpperCAmelCase						,__UpperCAmelCase=None						,**__UpperCAmelCase   )    -> Union[str, Any]:
													try:
																				# Compute path
																				with TemporaryDirectory() as tempdir:
																											A__		   =							Path(__UpperCAmelCase   ).joinpath('model.onnx'   )

																				# Remove folder if exists
																				if path.parent.exists():
																											path.parent.rmdir()

																				# Export
																				convert(__UpperCAmelCase						,__UpperCAmelCase						,__UpperCAmelCase						,__UpperCAmelCase						,__UpperCAmelCase						,**__UpperCAmelCase   )

																				return path
													except Exception as e:
																				self.fail(__UpperCAmelCase   )





						@require_torch
						@require_tokenizers
						@slow
						def  snake_case__		(				self   )    -> Optional[Any]:
													from transformers import BertModel

													A__		   =							BertModel(BertConfig.from_pretrained('lysandre/tiny-bert-random'   )   )
													A__		   =							BertTokenizerFast.from_pretrained('lysandre/tiny-bert-random'   )
													self._test_infer_dynamic_axis(__UpperCAmelCase						,__UpperCAmelCase						,'pt'   )





						@require_tf
						@require_tokenizers
						@slow
						def  snake_case__		(				self   )    -> Optional[Any]:
													from transformers import TFBertModel

													A__		   =							TFBertModel(BertConfig.from_pretrained('lysandre/tiny-bert-random'   )   )
													A__		   =							BertTokenizerFast.from_pretrained('lysandre/tiny-bert-random'   )
													self._test_infer_dynamic_axis(__UpperCAmelCase						,__UpperCAmelCase						,'tf'   )





						def  snake_case__		(				self						,__UpperCAmelCase						,__UpperCAmelCase						,__UpperCAmelCase   )    -> str:
													A__		   =							FeatureExtractionPipeline(__UpperCAmelCase						,__UpperCAmelCase   )

													A__		   =							['input_ids', 'token_type_ids', 'attention_mask', 'output_0', 'output_1']
													A__   ,     A__   ,     A__   ,     A__		   =							infer_shapes(__UpperCAmelCase						,__UpperCAmelCase   )

													# Assert all variables are present
													self.assertEqual(len(__UpperCAmelCase   )						,len(__UpperCAmelCase   )   )
													self.assertTrue(all(var_name in shapes for var_name in variable_names   )   )
													self.assertSequenceEqual(variable_names[:3]						,__UpperCAmelCase   )
													self.assertSequenceEqual(variable_names[3:]						,__UpperCAmelCase   )

													# Assert inputs are {0: batch, 1: sequence}
													for var_name in ["input_ids", "token_type_ids", "attention_mask"]:
																				self.assertDictEqual(shapes[var_name]						,{0: 'batch', 1: 'sequence'}   )

													# Assert outputs are {0: batch, 1: sequence} and {0: batch}
													self.assertDictEqual(shapes['output_0']						,{0: 'batch', 1: 'sequence'}   )
													self.assertDictEqual(shapes['output_1']						,{0: 'batch'}   )





						def  snake_case__		(				self   )    -> Union[str, Any]:
													A__		   =							['input_ids', 'attention_mask', 'token_type_ids']
													A__		   =							{'input_ids': [1, 2, 3, 4], 'attention_mask': [0, 0, 0, 0], 'token_type_ids': [1, 1, 1, 1]}
													A__   ,     A__		   =							ensure_valid_input(FuncContiguousArgs()						,__UpperCAmelCase						,__UpperCAmelCase   )

													# Should have exactly the same number of args (all are valid)
													self.assertEqual(len(__UpperCAmelCase   )						,3   )

													# Should have exactly the same input names
													self.assertEqual(set(__UpperCAmelCase   )						,set(__UpperCAmelCase   )   )

													# Parameter should be reordered according to their respective place in the function:
													# (input_ids, token_type_ids, attention_mask)
													self.assertEqual(__UpperCAmelCase						,(tokens['input_ids'], tokens['token_type_ids'], tokens['attention_mask'])   )

													# Generated args are interleaved with another args (for instance parameter "past" in GPT2)
													A__   ,     A__		   =							ensure_valid_input(FuncNonContiguousArgs()						,__UpperCAmelCase						,__UpperCAmelCase   )

													# Should have exactly the one arg (all before the one not provided "some_other_args")
													self.assertEqual(len(__UpperCAmelCase   )						,1   )
													self.assertEqual(len(__UpperCAmelCase   )						,1   )

													# Should have only "input_ids"
													self.assertEqual(inputs_args[0]						,tokens['input_ids']   )
													self.assertEqual(ordered_input_names[0]						,'input_ids'   )





						def  snake_case__		(				self   )    -> Union[str, Any]:
													A__		   =							generate_identified_filename(Path('/home/something/my_fake_model.onnx'   )						,'-test'   )
													self.assertEqual('/home/something/my_fake_model-test.onnx'						,generated.as_posix()   )





