code: 
  
  
  
  
  '''simple docstring'''
  
  
  
  
  
  
  
  from __future__ import annotations
  
  
  
  
  
  
  def 	_lowercase	(			lowercase_		,							lowercase_		,							lowercase_						):
  
  
  
  		'''simple docstring'''
  
  
  
  
  
  
  
  		assert (
  		    c % greatest_common_divisor(lowercase_		,							lowercase_						) == 0
  		)  # greatest_common_divisor(a,b) function implemented below
  		((_snake_case) ,					(_snake_case) ,					(_snake_case))			 = extended_gcd(lowercase_		,							lowercase_						)  # extended_gcd(a,b) function implemented below
  		_snake_case			 = c / d
  		return (r * x, r * y)
  
  
  
  
  
  
  def 	_lowercase	(			lowercase_		,							lowercase_		,							lowercase_		,							lowercase_ = 2						):
  
  
  
  		'''simple docstring'''
  
  
  
  
  
  
  
  		((_snake_case) ,					(_snake_case))			 = diophantine(lowercase_		,							lowercase_		,							lowercase_						)  # Initial value
  		_snake_case			 = greatest_common_divisor(lowercase_		,							lowercase_						)
  		_snake_case			 = a // d
  		_snake_case			 = b // d
  
  		for i in range(lowercase_						):
  				_snake_case			 = xa + i * q
  				_snake_case			 = ya - i * p
  				print(lowercase_		,							lowercase_						)
  
  
  
  
  
  
  def 	_lowercase	(			lowercase_		,							lowercase_						):
  
  
  
  		'''simple docstring'''
  
  
  
  
  
  
  
  		if a < b:
  				_snake_case ,					_snake_case			 = b, a
  
  		while a % b != 0:
  				_snake_case ,					_snake_case			 = b, a % b
  
  		return b
  
  
  
  
  
  
  def 	_lowercase	(			lowercase_		,							lowercase_						):
  
  
  
  		'''simple docstring'''
  
  
  
  
  
  
  
  		assert a >= 0 and b >= 0
  
  		if b == 0:
  				_snake_case ,					_snake_case ,					_snake_case			 = a, 1, 0
  		else:
  				((_snake_case) ,					(_snake_case) ,					(_snake_case))			 = extended_gcd(lowercase_		,							a % b						)
  				_snake_case			 = q
  				_snake_case			 = p - q * (a // b)
  
  		assert a % d == 0 and b % d == 0
  		assert d == a * x + b * y
  
  		return (d, x, y)
  
  
  if __name__ == "__main__":
  						from doctest import testmod
  
  						testmod(name='diophantine', verbose=True)
  						testmod(name='diophantine_all_soln', verbose=True)
  						testmod(name='extended_gcd', verbose=True)
  						testmod(name='greatest_common_divisor', verbose=True)
  
  
  
  
  
  
style_context: 
  
  
  
  
  '''simple docstring'''
  
  
  
  
  
  
  
  import unittest
  import warnings
  from dataclasses import dataclass
  
  from transformers.convert_slow_tokenizer import SpmConverter
  from transformers.testing_utils import get_tests_dir
  
  
  
  
  
  @dataclass
  class   lowerCamelCase_							:
  
  
  
  
  					'''simple docstring'''
  
  
  
  
  
  
  					lowercase__					=				42
  
  
  
  
  
  class   lowerCamelCase_							( unittest.TestCase							):
  
  
  
  
  					'''simple docstring'''
  
  
  
  
  
  
  					def        __SCREAMING_SNAKE_CASE			(					self				):
  							_snake_case			 = get_tests_dir("fixtures/test_sentencepiece.model"				)
  							_snake_case			 = get_tests_dir("fixtures/test_sentencepiece_with_bytefallback.model"				)
  
  							_snake_case			 = FakeOriginalTokenizer(vocab_file=__UpperCamelCase				)
  
  							with warnings.catch_warnings(record=__UpperCamelCase				) as w:
  									_snake_case			 = SpmConverter(__UpperCamelCase				)
  							self.assertEqual(len(__UpperCamelCase				),						0				)
  
  							_snake_case			 = FakeOriginalTokenizer(vocab_file=__UpperCamelCase				)
  
  							with warnings.catch_warnings(record=__UpperCamelCase				) as w:
  									_snake_case			 = SpmConverter(__UpperCamelCase				)
  							self.assertEqual(len(__UpperCamelCase				),						1				)
  
  							self.assertIn(
  							    "The sentencepiece tokenizer that you are converting to a fast tokenizer uses the byte fallback option"
  							    " which is not implemented in the fast tokenizers.",						str(w[0].message				),						)
  
  
  
  
  
  