

"""simple docstring"""






from typing import TYPE_CHECKING

from ...utils import (
    OptionalDependencyNotAvailable,
    _LazyModule,
    is_tf_available,
    is_tokenizers_available,
    is_torch_available,
)


lowerCamelCase__				:  Optional[int]													=  {
    '''configuration_deberta_v2''': ['''DEBERTA_V2_PRETRAINED_CONFIG_ARCHIVE_MAP''', '''DebertaV2Config''', '''DebertaV2OnnxConfig'''],
    '''tokenization_deberta_v2''': ['''DebertaV2Tokenizer'''],
}

try:
						if not is_tokenizers_available():
												raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
						pass
else:
						lowerCamelCase__				:  int													=  ['''DebertaV2TokenizerFast''']

try:
						if not is_tf_available():
												raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
						pass
else:
						lowerCamelCase__				:  Union[str, Any]													=  [
						    '''TF_DEBERTA_V2_PRETRAINED_MODEL_ARCHIVE_LIST''',
						    '''TFDebertaV2ForMaskedLM''',
						    '''TFDebertaV2ForQuestionAnswering''',
						    '''TFDebertaV2ForSequenceClassification''',
						    '''TFDebertaV2ForTokenClassification''',
						    '''TFDebertaV2Model''',
						    '''TFDebertaV2PreTrainedModel''',
						]

try:
						if not is_torch_available():
												raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
						pass
else:
						lowerCamelCase__				:  str													=  [
						    '''DEBERTA_V2_PRETRAINED_MODEL_ARCHIVE_LIST''',
						    '''DebertaV2ForMaskedLM''',
						    '''DebertaV2ForMultipleChoice''',
						    '''DebertaV2ForQuestionAnswering''',
						    '''DebertaV2ForSequenceClassification''',
						    '''DebertaV2ForTokenClassification''',
						    '''DebertaV2Model''',
						    '''DebertaV2PreTrainedModel''',
						]


if TYPE_CHECKING:
						from .configuration_deberta_va import (
						    DEBERTA_V2_PRETRAINED_CONFIG_ARCHIVE_MAP,
						    DebertaVaConfig,
						    DebertaVaOnnxConfig,
						)
						from .tokenization_deberta_va import DebertaVaTokenizer

						try:
												if not is_tokenizers_available():
																		raise OptionalDependencyNotAvailable()
						except OptionalDependencyNotAvailable:
												pass
						else:
												from .tokenization_deberta_va_fast import DebertaVaTokenizerFast

						try:
												if not is_tf_available():
																		raise OptionalDependencyNotAvailable()
						except OptionalDependencyNotAvailable:
												pass
						else:
												from .modeling_tf_deberta_va import (
												    TF_DEBERTA_V2_PRETRAINED_MODEL_ARCHIVE_LIST,
												    TFDebertaVaForMaskedLM,
												    TFDebertaVaForQuestionAnswering,
												    TFDebertaVaForSequenceClassification,
												    TFDebertaVaForTokenClassification,
												    TFDebertaVaModel,
												    TFDebertaVaPreTrainedModel,
												)

						try:
												if not is_torch_available():
																		raise OptionalDependencyNotAvailable()
						except OptionalDependencyNotAvailable:
												pass
						else:
												from .modeling_deberta_va import (
												    DEBERTA_V2_PRETRAINED_MODEL_ARCHIVE_LIST,
												    DebertaVaForMaskedLM,
												    DebertaVaForMultipleChoice,
												    DebertaVaForQuestionAnswering,
												    DebertaVaForSequenceClassification,
												    DebertaVaForTokenClassification,
												    DebertaVaModel,
												    DebertaVaPreTrainedModel,
												)

else:
						import sys

						lowerCamelCase__				:  Any													=  _LazyModule(__name__, globals()['''__file__'''], _import_structure, module_spec=__spec__)








"""simple docstring"""






def       UpperCamelCase					(			_lowerCAmelCase     :						int,  _lowerCAmelCase     :						int = 1000 )				->			str:
	if (not isinstance(_lowerCAmelCase,  _lowerCAmelCase )) or (digit_position <= 0):
		raise ValueError("""Digit position must be a positive integer""" )
	elif (not isinstance(_lowerCAmelCase,  _lowerCAmelCase )) or (precision < 0):
		raise ValueError("""Precision must be a nonnegative integer""" )

	# compute an approximation of (16 ** (n - 1)) * pi whose fractional part is mostly
	# accurate
	_UpperCAmelCase    :							List[Any]									=					(
	    4 * _subsum(_lowerCAmelCase,  1,  _lowerCAmelCase )
	    - 2 * _subsum(_lowerCAmelCase,  4,  _lowerCAmelCase )
	    - _subsum(_lowerCAmelCase,  5,  _lowerCAmelCase )
	    - _subsum(_lowerCAmelCase,  6,  _lowerCAmelCase )
	)

	# return the first hex digit of the fractional part of the result
	return hex(int((sum_result % 1) * 16 ) )[2:]
def       UpperCamelCase					(			_lowerCAmelCase     :						int,  _lowerCAmelCase     :						int,  _lowerCAmelCase     :						int )				->			float:
	_UpperCAmelCase    :							Optional[int]									=					0.0
	for sum_index in range(digit_pos_to_extract + precision ):
		_UpperCAmelCase    :							Optional[Any]									=					8 * sum_index + denominator_addend
		if sum_index < digit_pos_to_extract:
			# if the exponential term is an integer and we mod it by the denominator
			# before dividing, only the integer part of the sum will change;
			# the fractional part will not
			_UpperCAmelCase    :							Optional[Any]									=					pow(
			    16,  digit_pos_to_extract - 1 - sum_index,  _lowerCAmelCase )
		else:
			_UpperCAmelCase    :							int									=					pow(16,  digit_pos_to_extract - 1 - sum_index )
		total += exponential_term / denominator
	return total


if __name__ == "__main__":
						import doctest

						doctest.testmod()





