code: 
  
  
  
  
  
  import gc
  import unittest
  
  import numpy as np
  import torch
  
  from diffusers import DDPMScheduler, MidiProcessor, SpectrogramDiffusionPipeline
  from diffusers.pipelines.spectrogram_diffusion import SpectrogramContEncoder, SpectrogramNotesEncoder, TaFilmDecoder
  from diffusers.utils import require_torch_gpu, skip_mps, slow, torch_device
  from diffusers.utils.testing_utils import enable_full_determinism, require_note_seq, require_onnxruntime
  
  from ..pipeline_params import TOKENS_TO_AUDIO_GENERATION_BATCH_PARAMS, TOKENS_TO_AUDIO_GENERATION_PARAMS
  from ..test_pipelines_common import PipelineTesterMixin
  
  
  enable_full_determinism()
  
  
  _lowercase		:     Optional[Any] 					="""./tests/fixtures/elise_format0.mid"""
  
  
  
  
  
  
  @unittest.skip('The note-seq package currently throws an error on import'       )
  class 	UpperCamelCase_     (     snake_case__     ,    unittest.TestCase       ):
  					_a			:	int							=				SpectrogramDiffusionPipeline
  					_a			:	Dict							=				PipelineTesterMixin.required_optional_params - {
  					    'callback',
  					    'latents',
  					    'callback_steps',
  					    'output_type',
  					    'num_images_per_prompt',
  					}
  					_a			:	str							=				False
  					_a			:	Union[str, Any]							=				False
  					_a			:	Optional[int]							=				TOKENS_TO_AUDIO_GENERATION_PARAMS
  					_a			:	Optional[Any]							=				TOKENS_TO_AUDIO_GENERATION_BATCH_PARAMS
  
  
  
  					def      __a    (		self    :    Dict	):
  							torch.manual_seed(0	)
  							lowerCamelCase_  :    List[str]   	=			SpectrogramNotesEncoder(
  							    max_length=20_48					,			vocab_size=15_36					,			d_model=7_68					,			dropout_rate=0.1					,			num_layers=1					,			num_heads=1					,			d_kv=4					,			d_ff=20_48					,			feed_forward_proj='gated-gelu'					,			)
  
  							lowerCamelCase_  :    Union[str, Any]   	=			SpectrogramContEncoder(
  							    input_dims=1_28					,			targets_context_length=2_56					,			d_model=7_68					,			dropout_rate=0.1					,			num_layers=1					,			num_heads=1					,			d_kv=4					,			d_ff=20_48					,			feed_forward_proj='gated-gelu'					,			)
  
  							lowerCamelCase_  :    Union[str, Any]   	=			TaFilmDecoder(
  							    input_dims=1_28					,			targets_length=2_56					,			max_decoder_noise_time=20_000.0					,			d_model=7_68					,			num_layers=1					,			num_heads=1					,			d_kv=4					,			d_ff=20_48					,			dropout_rate=0.1					,			)
  
  							lowerCamelCase_  :    Any   	=			DDPMScheduler()
  
  							lowerCamelCase_  :    str   	=			{
  							    'notes_encoder': notes_encoder.eval(),
  							    'continuous_encoder': continuous_encoder.eval(),
  							    'decoder': decoder.eval(),
  							    'scheduler': scheduler,
  							    'melgan': None,
  							}
  							return components
  
  
  
  					def      __a    (		self    :    Any					,			lowerCamelCase    :    Any					,			lowerCamelCase    :    int=0	):
  							if str(lowerCamelCase	).startswith('mps'	):
  									lowerCamelCase_  :    Optional[int]   	=			torch.manual_seed(lowerCamelCase	)
  							else:
  									lowerCamelCase_  :    Dict   	=			torch.Generator(device=lowerCamelCase	).manual_seed(lowerCamelCase	)
  							lowerCamelCase_  :    str   	=			{
  							    'input_tokens': [
  							        [11_34, 90, 11_35, 11_33, 10_80, 1_12, 11_32, 10_80, 11_33, 10_79, 1_33, 11_32, 10_79, 11_33, 1] + [0] * 20_33
  							    ],
  							    'generator': generator,
  							    'num_inference_steps': 4,
  							    'output_type': 'mel',
  							}
  							return inputs
  
  
  
  					def      __a    (		self    :    Dict	):
  							lowerCamelCase_  :    str   	=			'cpu'  # ensure determinism for the device-dependent torch.Generator
  							lowerCamelCase_  :    Dict   	=			self.get_dummy_components()
  							lowerCamelCase_  :    Tuple   	=			SpectrogramDiffusionPipeline(**lowerCamelCase	)
  							lowerCamelCase_  :    List[str]   	=			pipe.to(lowerCamelCase	)
  							pipe.set_progress_bar_config(disable=lowerCamelCase	)
  
  							lowerCamelCase_  :    Optional[Any]   	=			self.get_dummy_inputs(lowerCamelCase	)
  							lowerCamelCase_  :    str   	=			pipe(**lowerCamelCase	)
  							lowerCamelCase_  :    Tuple   	=			output.audios
  
  							lowerCamelCase_  :    Tuple   	=			mel[0, -3:, -3:]
  
  							assert mel_slice.shape == (3, 3)
  							lowerCamelCase_  :    List[str]   	=			np.array(
  							    [-11.512_925, -4.788_215, -0.46_172_905, -2.051_715, -10.539_147, -10.970_963, -9.091_634, 4.0, 4.0]	)
  							assert np.abs(mel_slice.flatten() - expected_slice	).max() < 1E-2
  
  
  
  					@skip_mps
  					def      __a    (		self    :    Any	):
  							return super().test_save_load_local()
  
  
  
  					@skip_mps
  					def      __a    (		self    :    Tuple	):
  							return super().test_dict_tuple_outputs_equivalent()
  
  
  
  					@skip_mps
  					def      __a    (		self    :    Dict	):
  							return super().test_save_load_optional_components()
  
  
  
  					@skip_mps
  					def      __a    (		self    :    str	):
  							return super().test_attention_slicing_forward_pass()
  
  
  
  					def      __a    (		self    :    Any	):
  							pass
  
  
  
  					def      __a    (		self    :    Optional[int]	):
  							pass
  
  
  
  
  
  					@skip_mps
  					def      __a    (		self    :    Optional[Any]	):
  							return super().test_progress_bar()
  
  
  
  
  
  
  @slow
  @require_torch_gpu
  @require_onnxruntime
  @require_note_seq
  class 	UpperCamelCase_     (     unittest.TestCase       ):
  
  
  
  					def      __a    (		self    :    Optional[int]	):
  							# clean up the VRAM after each test
  							super().tearDown()
  							gc.collect()
  							torch.cuda.empty_cache()
  
  
  
  					def      __a    (		self    :    str	):
  							# TODO - test that pipeline can decode tokens in a callback
  							# so that music can be played live
  							lowerCamelCase_  :    Optional[Any]   	=			torch_device
  
  							lowerCamelCase_  :    Union[str, Any]   	=			SpectrogramDiffusionPipeline.from_pretrained('google/music-spectrogram-diffusion'	)
  							lowerCamelCase_  :    str   	=			pipe.melgan
  							lowerCamelCase_  :    Optional[int]   	=			None
  
  							lowerCamelCase_  :    str   	=			pipe.to(lowerCamelCase	)
  							pipe.set_progress_bar_config(disable=lowerCamelCase	)
  
  							def callback(lowerCamelCase    :    int					,			lowerCamelCase    :    int	):
  									# decode mel to audio
  									lowerCamelCase_  :    Union[str, Any]   	=			melgan(input_features=mel_output.astype(np.floataa	)	)[0]
  									assert len(audio[0]	) == 8_19_20 * (step + 1)
  									# simulate that audio is played
  									return audio
  
  							lowerCamelCase_  :    Any   	=			MidiProcessor()
  							lowerCamelCase_  :    str   	=			processor(lowerCamelCase	)
  
  							lowerCamelCase_  :    str   	=			input_tokens[:3]
  							lowerCamelCase_  :    Dict   	=			torch.manual_seed(0	)
  							pipe(lowerCamelCase					,			num_inference_steps=5					,			generator=lowerCamelCase					,			callback=lowerCamelCase					,			output_type='mel'	)
  
  
  
  					def      __a    (		self    :    str	):
  							lowerCamelCase_  :    List[str]   	=			torch_device
  
  							lowerCamelCase_  :    List[str]   	=			SpectrogramDiffusionPipeline.from_pretrained('google/music-spectrogram-diffusion'	)
  							lowerCamelCase_  :    Union[str, Any]   	=			pipe.to(lowerCamelCase	)
  							pipe.set_progress_bar_config(disable=lowerCamelCase	)
  							lowerCamelCase_  :    int   	=			MidiProcessor()
  
  							lowerCamelCase_  :    Dict   	=			processor(lowerCamelCase	)
  							# just run two denoising loops
  							lowerCamelCase_  :    Optional[Any]   	=			input_tokens[:2]
  
  							lowerCamelCase_  :    List[Any]   	=			torch.manual_seed(0	)
  							lowerCamelCase_  :    str   	=			pipe(lowerCamelCase					,			num_inference_steps=2					,			generator=lowerCamelCase	)
  
  							lowerCamelCase_  :    Dict   	=			output.audios[0]
  
  							assert abs(np.abs(lowerCamelCase	).sum() - 3_612.841	) < 1E-1
  
  
  
  
  
  					def      __a    (		self    :    List[Any]	):
  							lowerCamelCase_  :    int   	=			torch_device
  
  							lowerCamelCase_  :    str   	=			SpectrogramDiffusionPipeline.from_pretrained('google/music-spectrogram-diffusion'	)
  							lowerCamelCase_  :    Optional[int]   	=			pipe.to(lowerCamelCase	)
  							pipe.set_progress_bar_config(disable=lowerCamelCase	)
  
  							lowerCamelCase_  :    Tuple   	=			MidiProcessor()
  
  							lowerCamelCase_  :    int   	=			processor(lowerCamelCase	)
  
  							# just run 4 denoising loops
  							lowerCamelCase_  :    Optional[Any]   	=			input_tokens[:4]
  
  							lowerCamelCase_  :    List[Any]   	=			torch.manual_seed(0	)
  							lowerCamelCase_  :    int   	=			pipe(lowerCamelCase					,			num_inference_steps=1_00					,			generator=lowerCamelCase	)
  
  							lowerCamelCase_  :    List[Any]   	=			output.audios[0]
  							assert abs(np.abs(lowerCamelCase	).sum() - 9_389.1_111	) < 5E-2
  
style_context: 
  
  
  
  
  
  class 	UpperCamelCase_     :
  
  
  
  					def __init__(		self    :    List[Any]					,			lowerCamelCase    :    int	):
  							lowerCamelCase_  :    Union[str, Any]   	=			val
  							# Number of nodes in left subtree
  							lowerCamelCase_  :    Dict   	=			0
  							lowerCamelCase_  :    str   	=			None
  							lowerCamelCase_  :    int   	=			None
  							lowerCamelCase_  :    Dict   	=			None
  
  
  
  
  
  					def      __a    (		self    :    Optional[int]					,			lowerCamelCase    :    List[Any]	):
  							assert self.left_tree_size == other.left_tree_size, "Unequal Sizes of Blocks"
  
  							if self.val < other.val:
  									lowerCamelCase_  :    int   	=			self.right
  									lowerCamelCase_  :    Any   	=			None
  									if self.right:
  											lowerCamelCase_  :    Optional[Any]   	=			other
  									lowerCamelCase_  :    Union[str, Any]   	=			other
  									lowerCamelCase_  :    List[Any]   	=			self.left_tree_size * 2 + 1
  									return self
  							else:
  									lowerCamelCase_  :    str   	=			other.right
  									lowerCamelCase_  :    List[Any]   	=			None
  									if other.right:
  											lowerCamelCase_  :    Union[str, Any]   	=			self
  									lowerCamelCase_  :    Optional[int]   	=			self
  									lowerCamelCase_  :    Optional[int]   	=			other.left_tree_size * 2 + 1
  									return other
  
  
  
  
  
  
  class 	UpperCamelCase_     :
  
  
  
  					def __init__(		self    :    List[str]					,			lowerCamelCase    :    Optional[int]=None					,			lowerCamelCase    :    str=None					,			lowerCamelCase    :    List[Any]=0	):
  							lowerCamelCase_  :    Any   	=			heap_size
  							lowerCamelCase_  :    int   	=			bottom_root
  							lowerCamelCase_  :    Any   	=			min_node
  
  
  
  					def      __a    (		self    :    int					,			lowerCamelCase    :    int	):
  
  							# Empty heaps corner cases
  							if other.size == 0:
  									return None
  							if self.size == 0:
  									lowerCamelCase_  :    List[str]   	=			other.size
  									lowerCamelCase_  :    Tuple   	=			other.bottom_root
  									lowerCamelCase_  :    Tuple   	=			other.min_node
  									return None
  							# Update size
  							lowerCamelCase_  :    Optional[Any]   	=			self.size + other.size
  
  							# Update min.node
  							if self.min_node.val > other.min_node.val:
  									lowerCamelCase_  :    Optional[Any]   	=			other.min_node
  							# Merge
  
  							# Order roots by left_subtree_size
  							lowerCamelCase_  :    Dict   	=			[]
  							lowerCamelCase_	,			lowerCamelCase_  :    Optional[Any]   	=			self.bottom_root, other.bottom_root
  							while i or j:
  									if i and ((not j) or i.left_tree_size < j.left_tree_size):
  											combined_roots_list.append((i, True)	)
  											lowerCamelCase_  :    Tuple   	=			i.parent
  									else:
  											combined_roots_list.append((j, False)	)
  											lowerCamelCase_  :    Optional[Any]   	=			j.parent
          # Insert links between them
  							for i in range(len(lowerCamelCase	) - 1	):
  									if combined_roots_list[i][1] != combined_roots_list[i + 1][1]:
  											lowerCamelCase_  :    Dict   	=			combined_roots_list[i + 1][0]
  											lowerCamelCase_  :    Optional[int]   	=			combined_roots_list[i][0]
          # Consecutively merge roots with same left_tree_size
  							lowerCamelCase_  :    Any   	=			combined_roots_list[0][0]
  							while i.parent:
  									if (
  									    (i.left_tree_size == i.parent.left_tree_size) and (not i.parent.parent)
  									) or (
  									    i.left_tree_size == i.parent.left_tree_size
  									    and i.left_tree_size != i.parent.parent.left_tree_size
  									):
  											# Neighbouring Nodes
  											lowerCamelCase_  :    Dict   	=			i.left
  											lowerCamelCase_  :    int   	=			i.parent.parent
  
  											# Merging trees
  											lowerCamelCase_  :    str   	=			i.merge_trees(i.parent	)
  
  											# Updating links
  											lowerCamelCase_  :    Union[str, Any]   	=			previous_node
  											lowerCamelCase_  :    List[Any]   	=			next_node
  											if previous_node:
  													lowerCamelCase_  :    List[str]   	=			i
  											if next_node:
  													lowerCamelCase_  :    Dict   	=			i
  									else:
  											lowerCamelCase_  :    List[str]   	=			i.parent
          # Updating self.bottom_root
  							while i.left:
  									lowerCamelCase_  :    Union[str, Any]   	=			i.left
  							lowerCamelCase_  :    Any   	=			i
  
  							# Update other
  							lowerCamelCase_  :    Optional[int]   	=			self.size
  							lowerCamelCase_  :    Optional[Any]   	=			self.bottom_root
  							lowerCamelCase_  :    str   	=			self.min_node
  
  							# Return the merged heap
  							return self
  
  
  
  					def      __a    (		self    :    Any					,			lowerCamelCase    :    Dict	):
  							if self.size == 0:
  									lowerCamelCase_  :    Tuple   	=			Node(lowerCamelCase	)
  									lowerCamelCase_  :    Optional[int]   	=			1
  									lowerCamelCase_  :    Optional[int]   	=			self.bottom_root
  							else:
  									# Create new node
  									lowerCamelCase_  :    List[Any]   	=			Node(lowerCamelCase	)
  
  									# Update size
  									self.size += 1
  
  									# update min_node
  									if val < self.min_node.val:
  											lowerCamelCase_  :    List[str]   	=			new_node
  									# Put new_node as a bottom_root in heap
  									lowerCamelCase_  :    int   	=			new_node
  									lowerCamelCase_  :    Tuple   	=			self.bottom_root
  									lowerCamelCase_  :    Any   	=			new_node
  
  									# Consecutively merge roots with same left_tree_size
  									while (
  									    self.bottom_root.parent
  									    and self.bottom_root.left_tree_size
  									    == self.bottom_root.parent.left_tree_size
  									):
  											# Next node
  											lowerCamelCase_  :    Any   	=			self.bottom_root.parent.parent
  
  											# Merge
  											lowerCamelCase_  :    int   	=			self.bottom_root.merge_trees(self.bottom_root.parent	)
  
  											# Update Links
  											lowerCamelCase_  :    Dict   	=			next_node
  											lowerCamelCase_  :    Optional[Any]   	=			None
  											if next_node:
  													lowerCamelCase_  :    Union[str, Any]   	=			self.bottom_root
  
  
  
  					def      __a    (		self    :    Dict	):
  							return self.min_node.val
  
  
  
  					def      __a    (		self    :    int	):
  							return self.size == 0
  
  
  
  					def      __a    (		self    :    List[Any]	):
  							lowerCamelCase_  :    Tuple   	=			self.min_node.val
  
  							# Last element in heap corner case
  							if self.size == 1:
  									# Update size
  									lowerCamelCase_  :    Optional[Any]   	=			0
  
  									# Update bottom root
  									lowerCamelCase_  :    Any   	=			None
  
  									# Update min_node
  									lowerCamelCase_  :    List[str]   	=			None
  
  									return min_value
  							# No right subtree corner case
  							# The structure of the tree implies that this should be the bottom root
  							# and there is at least one other root
  							if self.min_node.right is None:
  									# Update size
  									self.size -= 1
  
  									# Update bottom root
  									lowerCamelCase_  :    Union[str, Any]   	=			self.bottom_root.parent
  									lowerCamelCase_  :    Union[str, Any]   	=			None
  
  									# Update min_node
  									lowerCamelCase_  :    Union[str, Any]   	=			self.bottom_root
  									lowerCamelCase_  :    Union[str, Any]   	=			self.bottom_root.parent
  									while i:
  											if i.val < self.min_node.val:
  													lowerCamelCase_  :    Union[str, Any]   	=			i
  											lowerCamelCase_  :    Optional[int]   	=			i.parent
  									return min_value
  							# General case
  							# Find the BinomialHeap of the right subtree of min_node
  							lowerCamelCase_  :    Dict   	=			self.min_node.right
  							lowerCamelCase_  :    Dict   	=			None
  							lowerCamelCase_  :    Tuple   	=			bottom_of_new
  							lowerCamelCase_  :    Dict   	=			1
  
  							# Size, min_node and bottom_root
  							while bottom_of_new.left:
  									lowerCamelCase_  :    Any   	=			size_of_new * 2 + 1
  									lowerCamelCase_  :    Tuple   	=			bottom_of_new.left
  									if bottom_of_new.val < min_of_new.val:
  											lowerCamelCase_  :    int   	=			bottom_of_new
          # Corner case of single root on top left path
  							if (not self.min_node.left) and (not self.min_node.parent):
  									lowerCamelCase_  :    Union[str, Any]   	=			size_of_new
  									lowerCamelCase_  :    Union[str, Any]   	=			bottom_of_new
  									lowerCamelCase_  :    Tuple   	=			min_of_new
  									# print("Single root, multiple nodes case")
  									return min_value
  							# Remaining cases
  							# Construct heap of right subtree
  							lowerCamelCase_  :    Optional[Any]   	=			BinomialHeap(
  							    bottom_root=lowerCamelCase					,			min_node=lowerCamelCase					,			heap_size=lowerCamelCase	)
  
  							# Update size
  							lowerCamelCase_  :    Union[str, Any]   	=			self.size - 1 - size_of_new
  
  							# Neighbour nodes
  							lowerCamelCase_  :    Union[str, Any]   	=			self.min_node.left
  							lowerCamelCase_  :    Optional[Any]   	=			self.min_node.parent
  
  							# Initialize new bottom_root and min_node
  							lowerCamelCase_  :    Optional[int]   	=			previous_node or next_node
  							lowerCamelCase_  :    Tuple   	=			next_node
  
  							# Update links of previous_node and search below for new min_node and
  							# bottom_root
  							if previous_node:
  									lowerCamelCase_  :    Dict   	=			next_node
  
  									# Update bottom_root and search for min_node below
  									lowerCamelCase_  :    int   	=			previous_node
  									lowerCamelCase_  :    Tuple   	=			previous_node
  									while self.bottom_root.left:
  											lowerCamelCase_  :    Union[str, Any]   	=			self.bottom_root.left
  											if self.bottom_root.val < self.min_node.val:
  													lowerCamelCase_  :    Any   	=			self.bottom_root
  							if next_node:
  									lowerCamelCase_  :    Any   	=			previous_node
  
  									# Search for new min_node above min_node
  									lowerCamelCase_  :    List[str]   	=			next_node
  									while i:
  											if i.val < self.min_node.val:
  													lowerCamelCase_  :    List[Any]   	=			i
  											lowerCamelCase_  :    Dict   	=			i.parent
          # Merge heaps
  							self.merge_heaps(lowerCamelCase	)
  
  							return min_value
  
  
  
  					def      __a    (		self    :    Optional[int]	):
  							lowerCamelCase_  :    List[Any]   	=			self.bottom_root
  							while top_root.parent:
  									lowerCamelCase_  :    Tuple   	=			top_root.parent
  							# preorder
  							lowerCamelCase_  :    str   	=			[]
  							self.__traversal(lowerCamelCase					,			lowerCamelCase	)
  							return heap_pre_order
  
  
  
  					def      __a    (		self    :    Dict					,			lowerCamelCase    :    Tuple					,			lowerCamelCase    :    Dict					,			lowerCamelCase    :    List[str]=0	):
  							if curr_node:
  									preorder.append((curr_node.val, level)	)
  									self.__traversal(curr_node.left					,			lowerCamelCase					,			level + 1	)
  									self.__traversal(curr_node.right					,			lowerCamelCase					,			level + 1	)
  							else:
  									preorder.append(('#', level)	)
  
  
  
  
  
  					def __str__(		self    :    List[Any]	):
  							if self.is_empty():
  									return ""
  							lowerCamelCase_  :    str   	=			self.pre_order()
  
  							return "\n".join(('-' * level + str(lowerCamelCase	)) for value, level in preorder_heap	)
  
  
  # Unit Tests
  if __name__ == "__main__":
  		import doctest
  
  		doctest.testmod()
  