'''simple docstring'''

from .chunk_utils import chunk_layer
from .data_transforms import make_atomaa_masks
from .feats import atomaa_to_atomaa, frames_and_literature_positions_to_atomaa_pos, torsion_angles_to_frames
from .loss import compute_predicted_aligned_error, compute_tm
from .protein import Protein as OFProtein
from .protein import to_pdb
from .rigid_utils import Rigid, Rotation
from .tensor_utils import dict_multimap, flatten_final_dims, permute_final_dims







"""simple docstring"""


class    snake_case						:


   '''simple docstring'''

   def __init__(      self					:	Optional[Any]    ):

     '''simple docstring'''
     # numbermap keys are the number and its values are lists of indexes sorted
     # in ascending order
     __A		     =					{}
     # indexmap keys are an index and it's values are the number at that index
     __A		     =					{}


   def 							_SCREAMING_SNAKE_CASE							(      self					:	List[str],			_lowerCamelCase					:	list | str | range,			_lowerCamelCase					:	int    ):

     '''simple docstring'''
     if isinstance(_lowerCamelCase,			(range, str)    ):
       __A		     =					list(_lowerCamelCase    )
     elif not isinstance(_lowerCamelCase,			_lowerCamelCase    ):
       raise TypeError(
           '''binary_search_delete() only accepts either a list, range or str'''    )

     __A		     =					0
     __A		     =					len(_lowerCamelCase    ) - 1

     while low <= high:
       __A		     =					(low + high) // 2
       if array[mid] == item:
         array.pop(_lowerCamelCase    )
         return array
       elif array[mid] < item:
         __A		     =					mid + 1
       else:
         __A		     =					mid - 1
     raise ValueError(
         '''Either the item is not in the array or the array was unsorted'''    )


   def 							_SCREAMING_SNAKE_CASE							(      self					:	Any,			_lowerCamelCase					:	list | str | range,			_lowerCamelCase					:	int    ):

     '''simple docstring'''
     if isinstance(_lowerCamelCase,			(range, str)    ):
       __A		     =					list(_lowerCamelCase    )
     elif not isinstance(_lowerCamelCase,			_lowerCamelCase    ):
       raise TypeError(
           '''binary_search_insert() only accepts either a list, range or str'''    )

     __A		     =					0
     __A		     =					len(_lowerCamelCase    ) - 1

     while low <= high:
       __A		     =					(low + high) // 2
       if array[mid] == index:
         # If the item already exists in the array,
         # insert it after the existing item
         array.insert(mid + 1,			_lowerCamelCase    )
         return array
       elif array[mid] < index:
         __A		     =					mid + 1
       else:
         __A		     =					mid - 1

        # If the item doesn't exist in the array, insert it at the appropriate position
     array.insert(_lowerCamelCase,			_lowerCamelCase    )
     return array


   def 							_SCREAMING_SNAKE_CASE							(      self					:	Dict,			_lowerCamelCase					:	int,			_lowerCamelCase					:	int    ):

     '''simple docstring'''
     # Remove previous index
     if index in self.indexmap:
       __A		     =					self.indexmap[index]
       if len(self.numbermap[n]    ) == 1:
         del self.numbermap[n]
       else:
         __A		     =					self.binary_search_delete(self.numbermap[n],			_lowerCamelCase    )

        # Set new index
     __A		     =					number

     # Number not seen before or empty so insert number value
     if number not in self.numbermap:
       __A		     =					[index]

     # Here we need to perform a binary search insertion in order to insert
     # The item in the correct place
     else:
       __A		     =					self.binary_search_insert(
           self.numbermap[number],			_lowerCamelCase    )






   def 							_SCREAMING_SNAKE_CASE							(      self					:	Dict,			_lowerCamelCase					:	int    ):

     '''simple docstring'''
     return self.numbermap.get(_lowerCamelCase,			[-1]    )[0]


if __name__ == "__main__":
       import doctest

       doctest.testmod()




