



from dataclasses import dataclass
from enum import Enum
from typing import List, Optional, Union

import numpy as np
import PIL
from PIL import Image

from ...utils import BaseOutput, is_torch_available, is_transformers_available







@dataclass
class      __lowerCAmelCase       (     A		):
			UpperCamelCase     =	{
			    '''sld_warmup_steps''': 1_5,
			    '''sld_guidance_scale''': 2_0,
			    '''sld_threshold''': 0.0,
			    '''sld_momentum_scale''': 0.0,
			    '''sld_mom_beta''': 0.0,
			}
			UpperCamelCase     =	{
			    '''sld_warmup_steps''': 1_0,
			    '''sld_guidance_scale''': 1_0_0_0,
			    '''sld_threshold''': 0.01,
			    '''sld_momentum_scale''': 0.3,
			    '''sld_mom_beta''': 0.4,
			}
			UpperCamelCase     =	{
			    '''sld_warmup_steps''': 7,
			    '''sld_guidance_scale''': 2_0_0_0,
			    '''sld_threshold''': 0.025,
			    '''sld_momentum_scale''': 0.5,
			    '''sld_mom_beta''': 0.7,
			}
			UpperCamelCase     =	{
			    '''sld_warmup_steps''': 0,
			    '''sld_guidance_scale''': 5_0_0_0,
			    '''sld_threshold''': 1.0,
			    '''sld_momentum_scale''': 0.5,
			    '''sld_mom_beta''': 0.7,
			}







@dataclass
class      __lowerCAmelCase       (     A		):
			UpperCamelCase     =	42
			UpperCamelCase     =	42
			UpperCamelCase     =	42
			UpperCamelCase     =	42


if is_transformers_available() and is_torch_available():
							from .pipeline_stable_diffusion_safe import StableDiffusionPipelineSafe
							from .safety_checker import SafeStableDiffusionSafetyChecker





def 				A      (	_UpperCAmelCase							:  List[Any]       )							->					List[Any]:







			'''simple docstring'''
			_UpperCAmelCase									=  len(_UpperCAmelCase       )
			for _ in range(
			    0				,  int(((no_of_elements - 1) / 2) + 1       )       ):  # we don't need to traverse to end of list as
						for j in range(0				,  no_of_elements - 1       ):
									if (
									    lst[j + 1] < lst[j]
									):  # applying bubble sort algorithm from left to right (or forwards)
												_UpperCAmelCase									=  lst[j + 1]
												_UpperCAmelCase									=  lst[j]
												_UpperCAmelCase									=  temp
									if (
									    lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
									):  # applying bubble sort algorithm from right to left (or backwards)
												_UpperCAmelCase									=  lst[no_of_elements - 1 - j]
												_UpperCAmelCase									=  lst[no_of_elements - 2 - j]
												_UpperCAmelCase									=  temp
			return lst


if __name__ == "__main__":
							print("enter the list to be sorted")
							UpperCAmelCase__  =			[int(x) for x in input().split()]  # inputing elements of the list in one line
							UpperCAmelCase__  =			double_sort(lst)
							print("the sorted list is")
							print(sorted_lst)
