



"""simple docstring"""





import argparse
import logging
import pickle
from collections import Counter


logging.basicConfig(
    format='''%(asctime)s - %(levelname)s - %(name)s - %(message)s''', datefmt='''%m/%d/%Y %H:%M:%S''', level=logging.INFO
)
lowercase  							=					logging.getLogger(__name__)

if __name__ == "__main__":
					lowercase  							=					argparse.ArgumentParser(
					    description='''Token Counts for smoothing the masking probabilities in MLM (cf XLM/word2vec)'''
					)
					parser.add_argument(
					    '''--data_file''', type=str, default='''data/dump.bert-base-uncased.pickle''', help='''The binarized dataset.'''
					)
					parser.add_argument(
					    '''--token_counts_dump''', type=str, default='''data/token_counts.bert-base-uncased.pickle''', help='''The dump file.'''
					)
					parser.add_argument('''--vocab_size''', default=3_05_22, type=int)
					lowercase  							=					parser.parse_args()

					logger.info(F'''Loading data from {args.data_file}''')
					with open(args.data_file, '''rb''') as fp:
										lowercase  							=					pickle.load(fp)

					logger.info('''Counting occurrences for MLM.''')
					lowercase  							=					Counter()
					for tk_ids in data:
										counter.update(tk_ids)
					lowercase  							=					[0] * args.vocab_size
					for k, v in counter.items():
										lowercase  							=					v

					logger.info(F'''Dump to {args.token_counts_dump}''')
					with open(args.token_counts_dump, '''wb''') as handle:
										pickle.dump(counts, handle, protocol=pickle.HIGHEST_PROTOCOL)







"""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)


