


import argparse


__a     =			"""docs/source/_static/js/custom.js"""
def   _UpperCamelCase				(						lowerCAmelCase_   )						->Optional[Any]:
   with open(lowerCAmelCase_  ,						encoding="""utf-8"""  ,						newline="""\n"""   ) as f:
      UpperCAmelCase							=     f.readlines()
   UpperCAmelCase							=     0

   # First let's put the right version
   while not lines[index].startswith("""const stableVersion ="""   ):
      index += 1
   UpperCAmelCase							=     F"""const stableVersion = \"v{version}\"\n"""

   # Then update the dictionary
   while not lines[index].startswith("""const versionMapping = {"""   ):
      index += 1

   # We go until the end
   while not lines[index].startswith("""}"""   ):
      index += 1
   # We add the new version at the end
   lines[index - 1] += F"""    \"v{version}\": \"v{version}\",\n"""

   with open(lowerCAmelCase_  ,						"""w"""  ,						encoding="""utf-8"""  ,						newline="""\n"""   ) as f:
      f.writelines(lowerCAmelCase_   )


if __name__ == "__main__":
 __a     =			argparse.ArgumentParser()
 parser.add_argument("""--version""", help="""Release version.""")
 __a     =			parser.parse_args()
 update_custom_js(args.version)







import math






class   __lowercase				:





      def        _lowercase				(		self						:					Union[str, Any]					,       __lowerCamelCase						:					list[list[float]]					,       __lowerCamelCase						:					list[int]       )    ->   int:






         """simple docstring"""







         UpperCAmelCase							=     0.0
         UpperCAmelCase							=     0.0
         for i in range(len(__lowerCamelCase       )       ):
            da += math.pow((sample[i] - weights[0][i])					,       2       )
            da += math.pow((sample[i] - weights[1][i])					,       2       )
            return 0 if da > da else 1
         return 0





      def        _lowercase				(		self						:					List[Any]					,       __lowerCamelCase						:					list[list[int | float]]					,       __lowerCamelCase						:					list[int]					,       __lowerCamelCase						:					int					,       __lowerCamelCase						:					float       )    ->   list[list[int | float]]:






         """simple docstring"""







         for i in range(len(__lowerCamelCase       )       ):
            weights[j][i] += alpha * (sample[i] - weights[j][i])
         return weights

def   _UpperCamelCase				(						)						->None:
   # Training Examples ( m, n )
   UpperCAmelCase							=     [[1, 1, 0, 0], [0, 0, 0, 1], [1, 0, 0, 0], [0, 0, 1, 1]]

   # weight initialization ( n, C )
   UpperCAmelCase							=     [[0.2, 0.6, 0.5, 0.9], [0.8, 0.4, 0.7, 0.3]]

   # training
   UpperCAmelCase							=     SelfOrganizingMap()
   UpperCAmelCase							=     3
   UpperCAmelCase							=     0.5

   for _ in range(lowerCAmelCase_   ):
      for j in range(len(lowerCAmelCase_   )   ):
         # training sample
         UpperCAmelCase							=     training_samples[j]

         # Compute the winning vector
         UpperCAmelCase							=     self_organizing_map.get_winner(lowerCAmelCase_  ,						lowerCAmelCase_   )

         # Update the winning vector
         UpperCAmelCase							=     self_organizing_map.update(lowerCAmelCase_  ,						lowerCAmelCase_  ,						lowerCAmelCase_  ,						lowerCAmelCase_   )

    # classify test sample
   UpperCAmelCase							=     [0, 0, 0, 1]
   UpperCAmelCase							=     self_organizing_map.get_winner(lowerCAmelCase_  ,						lowerCAmelCase_   )

   # results
   print(F"""Clusters that the test sample belongs to : {winner}"""   )
   print(F"""Weights that have been trained : {weights}"""   )


# running the main() function
if __name__ == "__main__":
 main()



