from __future__ import annotations

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

lowerCamelCase_				:		Any       						=       TypeVar("""T""")
lowerCamelCase_				:		List[Any]       						=       TypeVar("""U""")


class 						a__							(   Generic[T, U]		):



			def __init__(						self      ,						UpperCAmelCase      ,						UpperCAmelCase    ) ->    Any:
								__a							=   key
								__a							=   val
								__a							=   0
								__a							=   None
								__a							=   None







			def __repr__(						self    ) ->    str:
								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 						a__							(   Generic[T, U]		):



			def __init__(						self    ) ->    None:
								__a							=   DoubleLinkedListNode(UpperCAmelCase      ,						UpperCAmelCase    )
								__a							=   DoubleLinkedListNode(UpperCAmelCase      ,						UpperCAmelCase    )
								__a					,      __a							=   self.rear, self.head



			def __repr__(						self    ) ->    str:
								__a							=   ['DoubleLinkedList']
								__a							=   self.head
								while node.next is not None:
													rep.append(str(UpperCAmelCase    )    )
													__a							=   node.next
								rep.append(str(self.rear    )    )
								return ",\n    ".join(UpperCAmelCase    )



			def __SCREAMING_SNAKE_CASE							(						self      ,						UpperCAmelCase    ) ->    None:
								__a							=   self.rear.prev

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

								__a							=   node
								__a							=   previous
								__a							=   node
								__a							=   self.rear
								node.freq += 1
								self._position_node(UpperCAmelCase    )



			def __SCREAMING_SNAKE_CASE							(						self      ,						UpperCAmelCase    ) ->    None:

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

													__a							=   previous_node.prev
													__a							=   node.prev
													__a							=   previous_node
													__a							=   node







			def __SCREAMING_SNAKE_CASE							(						self      ,						UpperCAmelCase    ) ->    DoubleLinkedListNode[T, U] | None:

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

								__a							=   node.next
								__a							=   node.prev
								__a							=   None
								__a							=   None
								return node






class 						a__							(   Generic[T, U]		):
			A__				:   dict[Callable[[T], U], LFUCache[T, U]]								=			{}



			def __init__(						self      ,						UpperCAmelCase    ) ->    Optional[int]:
								__a							=   DoubleLinkedList()
								__a							=   capacity
								__a							=   0
								__a							=   0
								__a							=   0
								__a							=   {}



			def __repr__(						self    ) ->    str:
								return (
								    f'''CacheInfo(hits={self.hits}, misses={self.miss}, '''
								    f'''capacity={self.capacity}, current_size={self.num_keys})'''
								)



			def __contains__(						self      ,						UpperCAmelCase    ) ->    bool:
								return key in self.cache



			def __SCREAMING_SNAKE_CASE							(						self      ,						UpperCAmelCase    ) ->    U | None:

								if key in self.cache:
													self.hits += 1
													__a							=   self.cache[key]
													__a							=   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 __SCREAMING_SNAKE_CASE							(						self      ,						UpperCAmelCase      ,						UpperCAmelCase    ) ->    None:

								if key not in self.cache:
													if self.num_keys >= self.capacity:
																		# delete first node when over capacity
																		__a							=   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
													__a							=   DoubleLinkedListNode(UpperCAmelCase      ,						UpperCAmelCase    )
													self.list.add(self.cache[key]    )
													self.num_keys += 1

								else:
													__a							=   self.list.remove(self.cache[key]    )
													assert node is not None  # node guaranteed to be in list
													__a							=   value
													self.list.add(UpperCAmelCase    )







			@classmethod
			def __SCREAMING_SNAKE_CASE							(						cls      ,						UpperCAmelCase = 1_2_8    ) ->    Callable[[Callable[[T], U]], Callable[..., U]]:

								def cache_decorator_inner(UpperCAmelCase    ) -> Callable[..., U]:
													def cache_decorator_wrapper(*UpperCAmelCase    ) -> U:
																		if func not in cls.decorator_function_to_instance_map:
																							__a							=   LFUCache(UpperCAmelCase    )

																		__a							=   cls.decorator_function_to_instance_map[func].get(args[0]    )
																		if result is None:
																							__a							=   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()





from dataclasses import dataclass
from typing import Callable, Optional

import datasets


@dataclass
class 						a__							(   datasets.BuilderConfig		):
			A__				:   Optional[Callable]								=			None
			A__				:   Optional[dict]								=			None
			A__				:   Optional[datasets.Features]								=			None



			def __SCREAMING_SNAKE_CASE							(						self    ) ->    Any:
								assert self.generator is not None, "generator must be specified"

								if self.gen_kwargs is None:
													__a							=   {}






class 						a__							(   datasets.GeneratorBasedBuilder		):
			A__				:   List[Any]								=			GeneratorConfig



			def __SCREAMING_SNAKE_CASE							(						self    ) ->    Tuple:
								return datasets.DatasetInfo(features=self.config.features    )



			def __SCREAMING_SNAKE_CASE							(						self      ,						UpperCAmelCase    ) ->    Optional[int]:
								return [datasets.SplitGenerator(name=datasets.Split.TRAIN      ,						gen_kwargs=self.config.gen_kwargs    )]







			def __SCREAMING_SNAKE_CASE							(						self      ,						**UpperCAmelCase    ) ->    Tuple:
								for idx, ex in enumerate(self.config.generator(**UpperCAmelCase    )    ):
													yield idx, ex




