



'''simple docstring'''



from __future__ import annotations

from collections.abc import Callable
from typing import Generic, TypeVar

_lowercase       :						Tuple						=TypeVar("T")
_lowercase       :						str						=TypeVar("U")






class 			_SCREAMING_SNAKE_CASE				(Generic[T, U]      ):



			def __init__(     self		:						Union[str, Any]    ,			__UpperCamelCase		:						T | None    ,			__UpperCamelCase		:						U | None			)      ->      Dict:
							"""simple docstring"""





							snake_case__      :   Optional[int]      =    key
							snake_case__      :   Any      =    val
							snake_case__      :   int      =    0
							snake_case__      :   DoubleLinkedListNode[T, U] | None      =    None
							snake_case__      :   DoubleLinkedListNode[T, U] | None      =    None







			def __repr__(     self		:						Union[str, Any]			)      ->      str:
							"""simple docstring"""





							return "Node: key: {}, val: {}, freq: {}, has next: {}, has prev: {}".format(
							    self.key    ,			self.val    ,			self.freq    ,			self.next is not None    ,			self.prev is not None			)






class 			_SCREAMING_SNAKE_CASE				(Generic[T, U]      ):



			def __init__(     self		:						List[str]			)      ->      None:
							"""simple docstring"""





							snake_case__      :   DoubleLinkedListNode[T, U]      =    DoubleLinkedListNode(__UpperCamelCase    ,			__UpperCamelCase			)
							snake_case__      :   DoubleLinkedListNode[T, U]      =    DoubleLinkedListNode(__UpperCamelCase    ,			__UpperCamelCase			)
							snake_case__  ,      snake_case__      :   Tuple      =    self.rear, self.head



			def __repr__(     self		:						str			)      ->      str:
							"""simple docstring"""





							snake_case__      :   Union[str, Any]      =    ['''DoubleLinkedList''']
							snake_case__      :   Union[str, Any]      =    self.head
							while node.next is not None:
											rep.append(str(__UpperCamelCase			)			)
											snake_case__      :   List[Any]      =    node.next
							rep.append(str(self.rear			)			)
							return ",\n    ".join(__UpperCamelCase			)



			def 				lowerCAmelCase (     self		:						Tuple    ,			__UpperCamelCase		:						DoubleLinkedListNode[T, U]			)      ->      None:
							"""simple docstring"""





							snake_case__      :   Tuple      =    self.rear.prev

							# All nodes other than self.head are guaranteed to have non-None previous
							assert previous is not None

							snake_case__      :   Dict      =    node
							snake_case__      :   str      =    previous
							snake_case__      :   List[Any]      =    node
							snake_case__      :   Optional[int]      =    self.rear
							node.freq += 1
							self._position_node(__UpperCamelCase			)



			def 				lowerCAmelCase (     self		:						Optional[int]    ,			__UpperCamelCase		:						DoubleLinkedListNode[T, U]			)      ->      None:
							"""simple docstring"""





							while node.prev is not None and node.prev.freq > node.freq:
											# swap node with previous node
											snake_case__      :   str      =    node.prev

											snake_case__      :   Dict      =    previous_node.prev
											snake_case__      :   Union[str, Any]      =    node.prev
											snake_case__      :   Tuple      =    previous_node
											snake_case__      :   List[str]      =    node







			def 				lowerCAmelCase (     self		:						Any    ,			__UpperCamelCase		:						DoubleLinkedListNode[T, U]			)      ->      DoubleLinkedListNode[T, U] | None:
							"""simple docstring"""





							if node.prev is None or node.next is None:
											return None

							snake_case__      :   Any      =    node.next
							snake_case__      :   Any      =    node.prev
							snake_case__      :   Optional[int]      =    None
							snake_case__      :   Any      =    None
							return node






class 			_SCREAMING_SNAKE_CASE				(Generic[T, U]      ):
			A__								=  {}



			def __init__(     self		:						List[Any]    ,			__UpperCamelCase		:						int			)      ->      Optional[int]:
							"""simple docstring"""





							snake_case__      :   DoubleLinkedList[T, U]      =    DoubleLinkedList()
							snake_case__      :   Tuple      =    capacity
							snake_case__      :   str      =    0
							snake_case__      :   List[str]      =    0
							snake_case__      :   Optional[Any]      =    0
							snake_case__      :   dict[T, DoubleLinkedListNode[T, U]]      =    {}



			def __repr__(     self		:						Union[str, Any]			)      ->      str:
							"""simple docstring"""





							return (
							    F'''CacheInfo(hits={self.hits}, misses={self.miss}, '''
							    F'''capacity={self.capacity}, current_size={self.num_keys})'''
							)



			def __contains__(     self		:						Tuple    ,			__UpperCamelCase		:						T			)      ->      bool:
							"""simple docstring"""





							return key in self.cache



			def 				lowerCAmelCase (     self		:						Tuple    ,			__UpperCamelCase		:						T			)      ->      U | None:
							"""simple docstring"""





							if key in self.cache:
											self.hits += 1
											snake_case__      :   DoubleLinkedListNode[T, U]      =    self.cache[key]
											snake_case__      :   Optional[int]      =    self.list.remove(self.cache[key]			)
											assert node == value_node

											# node is guaranteed not None because it is in self.cache
											assert node is not None
											self.list.add(__UpperCamelCase			)
											return node.val
							self.miss += 1
							return None



			def 				lowerCAmelCase (     self		:						List[Any]    ,			__UpperCamelCase		:						T    ,			__UpperCamelCase		:						U			)      ->      None:
							"""simple docstring"""





							if key not in self.cache:
											if self.num_keys >= self.capacity:
															# delete first node when over capacity
															snake_case__      :   Any      =    self.list.head.next

															# guaranteed to have a non-None first node when num_keys > 0
															# explain to type checker via assertions
															assert first_node is not None
															assert first_node.key is not None
															assert self.list.remove(__UpperCamelCase			) is not None
															# first_node guaranteed to be in list

															del self.cache[first_node.key]
															self.num_keys -= 1
											snake_case__      :   List[Any]      =    DoubleLinkedListNode(__UpperCamelCase    ,			__UpperCamelCase			)
											self.list.add(self.cache[key]			)
											self.num_keys += 1

							else:
											snake_case__      :   Any      =    self.list.remove(self.cache[key]			)
											assert node is not None  # node guaranteed to be in list
											snake_case__      :   List[str]      =    value
											self.list.add(__UpperCamelCase			)







			@classmethod
			def 				lowerCAmelCase (     cls		:						type[LFUCache[T, U]]    ,			__UpperCamelCase		:						int = 128			)      ->      Callable[[Callable[[T], U]], Callable[..., U]]:
							"""simple docstring"""





							def cache_decorator_inner(__UpperCamelCase		:						Callable[[T], U]			) -> Callable[..., U]:
											def cache_decorator_wrapper(*__UpperCamelCase		:						T			) -> U:
															if func not in cls.decorator_function_to_instance_map:
																			snake_case__      :   int      =    LFUCache(__UpperCamelCase			)

															snake_case__      :   str      =    cls.decorator_function_to_instance_map[func].get(args[0]			)
															if result is None:
																			snake_case__      :   List[str]      =    func(*__UpperCamelCase			)
																			cls.decorator_function_to_instance_map[func].put(args[0]    ,			__UpperCamelCase			)
															return result

											def cache_info() -> LFUCache[T, U]:
															return cls.decorator_function_to_instance_map[func]

											setattr(__UpperCamelCase    ,			'''cache_info'''    ,			__UpperCamelCase			)  # noqa: B010

											return cache_decorator_wrapper

							return cache_decorator_inner


if __name__ == "__main__":
				import doctest

				doctest.testmod()












"""simple docstring"""







from ...configuration_utils import PretrainedConfig
from ...utils import logging


__a							:						Union[str, Any]   							=			logging.get_logger(__name__)

__a							:						Optional[Any]   							=			{
    'tau/splinter-base': 'https://huggingface.co/tau/splinter-base/resolve/main/config.json',
    'tau/splinter-base-qass': 'https://huggingface.co/tau/splinter-base-qass/resolve/main/config.json',
    'tau/splinter-large': 'https://huggingface.co/tau/splinter-large/resolve/main/config.json',
    'tau/splinter-large-qass': 'https://huggingface.co/tau/splinter-large-qass/resolve/main/config.json',
    # See all Splinter models at https://huggingface.co/models?filter=splinter
}







class 							_SCREAMING_SNAKE_CASE    (	__snake_case				):





							"""simple docstring"""





							_SCREAMING_SNAKE_CASE     ='splinter'




							def __init__( self:  Dict					,		__A:  List[Any]=30522					,		__A:  str=768					,		__A:  int=12					,		__A:  str=12					,		__A:  Tuple=3072					,		__A:  Dict="gelu"					,		__A:  Optional[int]=0.1					,		__A:  List[str]=0.1					,		__A:  str=512					,		__A:  List[Any]=2					,		__A:  Any=0.0_2					,		__A:  Any=1e-12					,		__A:  Tuple=True					,		__A:  List[Any]=0					,		__A:  List[str]=104					,		**__A:  Union[str, Any]					,		):

												'''simple docstring'''

												super().__init__(pad_token_id=__A					,		**__A     )

												a__ 							=	vocab_size
												a__ 							=	max_position_embeddings
												a__ 							=	hidden_size
												a__ 							=	num_hidden_layers
												a__ 							=	num_attention_heads
												a__ 							=	intermediate_size
												a__ 							=	hidden_act
												a__ 							=	hidden_dropout_prob
												a__ 							=	attention_probs_dropout_prob
												a__ 							=	initializer_range
												a__ 							=	type_vocab_size
												a__ 							=	layer_norm_eps
												a__ 							=	use_cache
												a__ 							=	question_token_id


