






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


_a      	=  logging.get_logger(__name__)

_a      	=  {
    '''funnel-transformer/small''': '''https://huggingface.co/funnel-transformer/small/resolve/main/config.json''',
    '''funnel-transformer/small-base''': '''https://huggingface.co/funnel-transformer/small-base/resolve/main/config.json''',
    '''funnel-transformer/medium''': '''https://huggingface.co/funnel-transformer/medium/resolve/main/config.json''',
    '''funnel-transformer/medium-base''': '''https://huggingface.co/funnel-transformer/medium-base/resolve/main/config.json''',
    '''funnel-transformer/intermediate''': (
        '''https://huggingface.co/funnel-transformer/intermediate/resolve/main/config.json'''
    ),
    '''funnel-transformer/intermediate-base''': (
        '''https://huggingface.co/funnel-transformer/intermediate-base/resolve/main/config.json'''
    ),
    '''funnel-transformer/large''': '''https://huggingface.co/funnel-transformer/large/resolve/main/config.json''',
    '''funnel-transformer/large-base''': '''https://huggingface.co/funnel-transformer/large-base/resolve/main/config.json''',
    '''funnel-transformer/xlarge''': '''https://huggingface.co/funnel-transformer/xlarge/resolve/main/config.json''',
    '''funnel-transformer/xlarge-base''': '''https://huggingface.co/funnel-transformer/xlarge-base/resolve/main/config.json''',
}





class __lowerCamelCase (      snake_case__):





	"""simple docstring"""






	UpperCamelCase__								=      "funnel"
	UpperCamelCase__								=      {
	    "hidden_size": "d_model",
	    "num_attention_heads": "n_head",
	}

	def __init__(							self       ,    UpperCAmelCase=3_0522       ,    UpperCAmelCase=[4, 4, 4]       ,    UpperCAmelCase=None       ,    UpperCAmelCase=2       ,    UpperCAmelCase=768       ,    UpperCAmelCase=12       ,    UpperCAmelCase=64       ,    UpperCAmelCase=3072       ,    UpperCAmelCase="gelu_new"       ,    UpperCAmelCase=0.1       ,    UpperCAmelCase=0.1       ,    UpperCAmelCase=0.0       ,    UpperCAmelCase=0.1       ,    UpperCAmelCase=None       ,    UpperCAmelCase=1e-9       ,    UpperCAmelCase="mean"       ,    UpperCAmelCase="relative_shift"       ,    UpperCAmelCase=True       ,    UpperCAmelCase=True       ,    UpperCAmelCase=True       ,    **UpperCAmelCase       ,    ):
							"""simple docstring"""







							_UpperCAmelCase									=			vocab_size
							_UpperCAmelCase									=			block_sizes
							_UpperCAmelCase									=			[1] * len(UpperCAmelCase    ) if block_repeats is None else block_repeats
							assert len(UpperCAmelCase    ) == len(
							    self.block_repeats    ), "`block_sizes` and `block_repeats` should have the same length."
							_UpperCAmelCase									=			num_decoder_layers
							_UpperCAmelCase									=			d_model
							_UpperCAmelCase									=			n_head
							_UpperCAmelCase									=			d_head
							_UpperCAmelCase									=			d_inner
							_UpperCAmelCase									=			hidden_act
							_UpperCAmelCase									=			hidden_dropout
							_UpperCAmelCase									=			attention_dropout
							_UpperCAmelCase									=			activation_dropout
							_UpperCAmelCase									=			initializer_range
							_UpperCAmelCase									=			initializer_std
							_UpperCAmelCase									=			layer_norm_eps
							assert pooling_type in [
							    "mean",
							    "max",
							], F"""Got {pooling_type} for `pooling_type` but only 'mean' and 'max' are supported."""
							_UpperCAmelCase									=			pooling_type
							assert attention_type in [
							    "relative_shift",
							    "factorized",
							], F"""Got {attention_type} for `attention_type` but only 'relative_shift' and 'factorized' are supported."""
							_UpperCAmelCase									=			attention_type
							_UpperCAmelCase									=			separate_cls
							_UpperCAmelCase									=			truncate_seq
							_UpperCAmelCase									=			pool_q_only

							super().__init__(**UpperCAmelCase    )

	@property
	def        UpperCamelCase    (							self    ):
							"""simple docstring"""







							return sum(self.block_sizes    )

	@num_hidden_layers.setter
	def        UpperCamelCase    (							self       ,    UpperCAmelCase    ):
							"""simple docstring"""







							raise NotImplementedError(
							    'This model does not support the setting of `num_hidden_layers`. Please set `block_sizes`.'    )

	@property
	def        UpperCamelCase    (							self    ):
							"""simple docstring"""







							return len(self.block_sizes    )

	@num_blocks.setter
	def        UpperCamelCase    (							self       ,    UpperCAmelCase    ):
							"""simple docstring"""







							raise NotImplementedError('This model does not support the setting of `num_blocks`. Please set `block_sizes`.'    )








class __lowerCamelCase :





	"""simple docstring"""






	def __init__(							self       ,    UpperCAmelCase = ""       ,    UpperCAmelCase = False    ):
							"""simple docstring"""







							_UpperCAmelCase									=			{}

							# A node will be a leaf if the tree contains its word
							_UpperCAmelCase									=			is_leaf

							_UpperCAmelCase									=			prefix

	def        UpperCamelCase    (							self       ,    UpperCAmelCase    ):
							"""simple docstring"""







							_UpperCAmelCase									=			0
							for q, w in zip(self.prefix       ,    UpperCAmelCase    ):
													if q != w:
																			break

													x += 1

							return self.prefix[:x], self.prefix[x:], word[x:]

	def        UpperCamelCase    (							self       ,    UpperCAmelCase    ):
							"""simple docstring"""







							for word in words:
													self.insert(UpperCAmelCase    )

	def        UpperCamelCase    (							self       ,    UpperCAmelCase    ):
							"""simple docstring"""







							if self.prefix == word:
													_UpperCAmelCase									=			True

							# Case 2: The node has no edges that have a prefix to the word
							# Solution: We create an edge from the current node to a new one
							# containing the word
							elif word[0] not in self.nodes:
													_UpperCAmelCase									=			RadixNode(prefix=UpperCAmelCase       ,    is_leaf=UpperCAmelCase    )

							else:
													_UpperCAmelCase									=			self.nodes[word[0]]
													_UpperCAmelCase					, _UpperCAmelCase					, _UpperCAmelCase									=			incoming_node.match(
													    UpperCAmelCase    )

													# Case 3: The node prefix is equal to the matching
													# Solution: We insert remaining word on the next node
													if remaining_prefix == "":
																			self.nodes[matching_string[0]].insert(UpperCAmelCase    )

													# Case 4: The word is greater equal to the matching
													# Solution: Create a node in between both nodes, change
													# prefixes and add the new node for the remaining word
													else:
																			_UpperCAmelCase									=			remaining_prefix

																			_UpperCAmelCase									=			self.nodes[matching_string[0]]
																			_UpperCAmelCase									=			RadixNode(UpperCAmelCase       ,    UpperCAmelCase    )
																			_UpperCAmelCase									=			aux_node

																			if remaining_word == "":
																									_UpperCAmelCase									=			True
																			else:
																									self.nodes[matching_string[0]].insert(UpperCAmelCase    )

	def        UpperCamelCase    (							self       ,    UpperCAmelCase    ):
							"""simple docstring"""







							_UpperCAmelCase									=			self.nodes.get(word[0]       ,    UpperCAmelCase    )
							if not incoming_node:
													return False
							else:
													_UpperCAmelCase					, _UpperCAmelCase					, _UpperCAmelCase									=			incoming_node.match(
													    UpperCAmelCase    )
													# If there is remaining prefix, the word can't be on the tree
													if remaining_prefix != "":
																			return False
													# This applies when the word and the prefix are equal
													elif remaining_word == "":
																			return incoming_node.is_leaf
													# We have word remaining so we check the next node
													else:
																			return incoming_node.find(UpperCAmelCase    )

	def        UpperCamelCase    (							self       ,    UpperCAmelCase    ):
							"""simple docstring"""







							_UpperCAmelCase									=			self.nodes.get(word[0]       ,    UpperCAmelCase    )
							if not incoming_node:
													return False
							else:
													_UpperCAmelCase					, _UpperCAmelCase					, _UpperCAmelCase									=			incoming_node.match(
													    UpperCAmelCase    )
													# If there is remaining prefix, the word can't be on the tree
													if remaining_prefix != "":
																			return False
													# We have word remaining so we check the next node
													elif remaining_word != "":
																			return incoming_node.delete(UpperCAmelCase    )
													else:
																			# If it is not a leaf, we don't have to delete
																			if not incoming_node.is_leaf:
																									return False
																			else:
																									# We delete the nodes if no edges go from it
																									if len(incoming_node.nodes    ) == 0:
																															del self.nodes[word[0]]
																															# We merge the current node with its only child
																															if len(self.nodes    ) == 1 and not self.is_leaf:
																																					_UpperCAmelCase									=			list(self.nodes.values()    )[0]
																																					_UpperCAmelCase									=			merging_node.is_leaf
																																					self.prefix += merging_node.prefix
																																					_UpperCAmelCase									=			merging_node.nodes
                    # If there is more than 1 edge, we just mark it as non-leaf
																									elif len(incoming_node.nodes    ) > 1:
																															_UpperCAmelCase									=			False
																									# If there is 1 edge, we merge it with its child
																									else:
																															_UpperCAmelCase									=			list(incoming_node.nodes.values()    )[0]
																															_UpperCAmelCase									=			merging_node.is_leaf
																															incoming_node.prefix += merging_node.prefix
																															_UpperCAmelCase									=			merging_node.nodes

																									return True

	def        UpperCamelCase    (							self       ,    UpperCAmelCase = 0    ):
							"""simple docstring"""







							if self.prefix != "":
													print('-' * height       ,    self.prefix       ,    '  (leaf)' if self.is_leaf else ''    )

							for value in self.nodes.values():
													value.print_tree(height + 1    )



def __A    (      )->  bool:





						"""simple docstring"""



						_UpperCAmelCase									=			'banana bananas bandana band apple all beast'.split()
						_UpperCAmelCase									=			RadixNode()
						root.insert_many(__lowerCAmelCase	)

						assert all(root.find(__lowerCAmelCase	) for word in words	)
						assert not root.find('bandanas'	)
						assert not root.find('apps'	)
						root.delete('all'	)
						assert not root.find('all'	)
						root.delete('banana'	)
						assert not root.find('banana'	)
						assert root.find('bananas'	)

						return True


def __A    (      )->  None:





						"""simple docstring"""



						assert test_trie()


def __A    (      )->  None:





						"""simple docstring"""



						_UpperCAmelCase									=			RadixNode()
						_UpperCAmelCase									=			'banana bananas bandanas bandana band apple all beast'.split()
						root.insert_many(__lowerCAmelCase	)

						print('Words:' ,		__lowerCAmelCase	)
						print('Tree:'	)
						root.print_tree()


if __name__ == "__main__":
		main()
