



'''simple docstring'''





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


lowercase_	 =						logging.get_logger(__name__)

lowercase_	 =						{"ctrl": "https://huggingface.co/ctrl/resolve/main/config.json"}






class __A    (						A		):



 '''simple docstring'''







 __lowerCamelCase					: Any    = 'ctrl'
 __lowerCamelCase					: str    = ['past_key_values']
 __lowerCamelCase					: str    = {
     'max_position_embeddings': 'n_positions',
     'hidden_size': 'n_embd',
     'num_attention_heads': 'n_head',
     'num_hidden_layers': 'n_layer',
 }



 def __init__(self				,     A=246_534				,     A=256				,     A=1_280				,     A=8_192				,     A=48				,     A=16				,     A=0.1				,     A=0.1				,     A=1E-6				,     A=0.02				,     A=True				,     **A				,     )					->  Any:


      """simple docstring"""



      _a											=						vocab_size
      _a											=						n_positions
      _a											=						n_embd
      _a											=						n_layer
      _a											=						n_head
      _a											=						dff
      _a											=						resid_pdrop
      _a											=						embd_pdrop
      _a											=						layer_norm_epsilon
      _a											=						initializer_range

      _a											=						use_cache

      super().__init__(**A )








'''simple docstring'''





def lowerCAmelCase						(__A):



     """simple docstring"""



     _a											=						set()
     # To detect a back edge, keep track of vertices currently in the recursion stack
     _a											=						set()
     return any(
         node not in visited and depth_first_search(__A						,			__A						,			__A						,			__A)
         for node in graph)




def lowerCAmelCase						(__A						,			__A						,			__A						,			__A):



     """simple docstring"""



     visited.add(__A)
     rec_stk.add(__A)

     for node in graph[vertex]:
          if node not in visited:
               if depth_first_search(__A						,			__A						,			__A						,			__A):
                    return True
          elif node in rec_stk:
               return True

    # The node needs to be removed from recursion stack before function ends
     rec_stk.remove(__A)
     return False


if __name__ == "__main__":
  from doctest import testmod

  testmod()



