


"""simple docstring"""




import argparse
import re

import numpy as np
import requests
import torch
from huggingface_hub import hf_hub_download
from PIL import Image

from transformers import (
    SamConfig,
    SamImageProcessor,
    SamModel,
    SamProcessor,
    SamVisionConfig,
)


__magic_name__						: Any    =				{
    'iou_prediction_head.layers.0': 'iou_prediction_head.proj_in',
    'iou_prediction_head.layers.1': 'iou_prediction_head.layers.0',
    'iou_prediction_head.layers.2': 'iou_prediction_head.proj_out',
    'mask_decoder.output_upscaling.0': 'mask_decoder.upscale_conv1',
    'mask_decoder.output_upscaling.1': 'mask_decoder.upscale_layer_norm',
    'mask_decoder.output_upscaling.3': 'mask_decoder.upscale_conv2',
    'mask_downscaling.0': 'mask_embed.conv1',
    'mask_downscaling.1': 'mask_embed.layer_norm1',
    'mask_downscaling.3': 'mask_embed.conv2',
    'mask_downscaling.4': 'mask_embed.layer_norm2',
    'mask_downscaling.6': 'mask_embed.conv3',
    'point_embeddings': 'point_embed',
    'pe_layer.positional_encoding_gaussian_matrix': 'shared_embedding.positional_embedding',
    'image_encoder': 'vision_encoder',
    'neck.0': 'neck.conv1',
    'neck.1': 'neck.layer_norm1',
    'neck.2': 'neck.conv2',
    'neck.3': 'neck.layer_norm2',
    'patch_embed.proj': 'patch_embed.projection',
    '.norm': '.layer_norm',
    'blocks': 'layers',
}





def       a_ (	lowercase__ :List[str]     ):
			__lowerCamelCase          =      {}
			state_dict.pop("""pixel_mean""",			lowercase__     )
			state_dict.pop("""pixel_std""",			lowercase__     )

			__lowerCamelCase          =      r""".*.output_hypernetworks_mlps.(\d+).layers.(\d+).*"""

			for key, value in state_dict.items():
						for key_to_modify, new_key in KEYS_TO_MODIFY_MAPPING.items():
									if key_to_modify in key:
												__lowerCamelCase          =      key.replace(lowercase__,			lowercase__     )

						if re.match(lowercase__,			lowercase__     ):
									__lowerCamelCase          =      int(re.match(lowercase__,			lowercase__     ).group(2     )     )
									if layer_nb == 0:
												__lowerCamelCase          =      key.replace("""layers.0""",			"""proj_in"""     )
									elif layer_nb == 1:
												__lowerCamelCase          =      key.replace("""layers.1""",			"""layers.0"""     )
									elif layer_nb == 2:
												__lowerCamelCase          =      key.replace("""layers.2""",			"""proj_out"""     )

						__lowerCamelCase          =      value

			__lowerCamelCase          =      model_state_dict[
			    """prompt_encoder.shared_embedding.positional_embedding"""
			]

			return model_state_dict





def       a_ (	lowercase__ :Optional[Any],			lowercase__ :Tuple,			lowercase__ :str,			lowercase__ :List[Any]="ybelkada/segment-anything"     ):
			__lowerCamelCase          =      hf_hub_download(lowercase__,			f'checkpoints/{model_name}.pth'     )

			if "sam_vit_b" in model_name:
						__lowerCamelCase          =      SamConfig()
			elif "sam_vit_l" in model_name:
						__lowerCamelCase          =      SamVisionConfig(
						    hidden_size=1024,			num_hidden_layers=24,			num_attention_heads=16,			global_attn_indexes=[5, 11, 17, 23],			)

						__lowerCamelCase          =      SamConfig(
						    vision_config=lowercase__,			)
			elif "sam_vit_h" in model_name:
						__lowerCamelCase          =      SamVisionConfig(
						    hidden_size=1280,			num_hidden_layers=32,			num_attention_heads=16,			global_attn_indexes=[7, 15, 23, 31],			)

						__lowerCamelCase          =      SamConfig(
						    vision_config=lowercase__,			)

			__lowerCamelCase          =      torch.load(lowercase__,			map_location="""cpu"""     )
			__lowerCamelCase          =      replace_keys(lowercase__     )

			__lowerCamelCase          =      SamImageProcessor()

			__lowerCamelCase          =      SamProcessor(image_processor=lowercase__     )
			__lowerCamelCase          =      SamModel(lowercase__     )

			hf_model.load_state_dict(lowercase__     )
			__lowerCamelCase          =      hf_model.to("""cuda"""     )

			__lowerCamelCase          =      """https://huggingface.co/ybelkada/segment-anything/resolve/main/assets/car.png"""
			__lowerCamelCase          =      Image.open(requests.get(lowercase__,			stream=lowercase__     ).raw     ).convert("""RGB"""     )

			__lowerCamelCase          =      [[[400, 650]]]
			__lowerCamelCase          =      [[1]]

			__lowerCamelCase          =      processor(images=np.array(lowercase__     ),			return_tensors="""pt"""     ).to("""cuda"""     )

			with torch.no_grad():
						__lowerCamelCase          =      hf_model(**lowercase__     )
			__lowerCamelCase          =      output.iou_scores.squeeze()

			if model_name == "sam_vit_h_4b8939":
						assert scores[-1].item() == 0.579890251159668

						__lowerCamelCase          =      processor(
						    images=np.array(lowercase__     ),			input_points=lowercase__,			input_labels=lowercase__,			return_tensors="""pt"""     ).to("""cuda"""     )

						with torch.no_grad():
									__lowerCamelCase          =      hf_model(**lowercase__     )
						__lowerCamelCase          =      output.iou_scores.squeeze()

						assert scores[-1].item() == 0.9712603092193604

						__lowerCamelCase          =      ((75, 275, 1725, 850),)

						__lowerCamelCase          =      processor(images=np.array(lowercase__     ),			input_boxes=lowercase__,			return_tensors="""pt"""     ).to("""cuda"""     )

						with torch.no_grad():
									__lowerCamelCase          =      hf_model(**lowercase__     )
						__lowerCamelCase          =      output.iou_scores.squeeze()

						assert scores[-1].item() == 0.8686015605926514

						# Test with 2 points and 1 image.
						__lowerCamelCase          =      [[[400, 650], [800, 650]]]
						__lowerCamelCase          =      [[1, 1]]

						__lowerCamelCase          =      processor(
						    images=np.array(lowercase__     ),			input_points=lowercase__,			input_labels=lowercase__,			return_tensors="""pt"""     ).to("""cuda"""     )

						with torch.no_grad():
									__lowerCamelCase          =      hf_model(**lowercase__     )
						__lowerCamelCase          =      output.iou_scores.squeeze()

						assert scores[-1].item() == 0.9936047792434692


if __name__ == "__main__":
					__magic_name__						: List[str]    =				argparse.ArgumentParser()
					__magic_name__						: List[str]    =				['sam_vit_b_01ec64', 'sam_vit_h_4b8939', 'sam_vit_l_0b3195']
					parser.add_argument(
					    '--model_name',
					    default='sam_vit_h_4b8939',
					    choices=choices,
					    type=str,
					    help='Path to hf config.json of model to convert',
					)
					parser.add_argument('--pytorch_dump_folder_path', default=None, type=str, help='Path to the output PyTorch model.')
					parser.add_argument(
					    '--push_to_hub',
					    action='store_true',
					    help='Whether to push the model and processor to the hub after converting',
					)
					parser.add_argument(
					    '--model_hub_id',
					    default='ybelkada/segment-anything',
					    choices=choices,
					    type=str,
					    help='Path to hf config.json of model to convert',
					)

					__magic_name__						: Union[str, Any]    =				parser.parse_args()

					convert_sam_checkpoint(args.model_name, args.pytorch_dump_folder_path, args.push_to_hub, args.model_hub_id)








"""simple docstring"""




import logging
import math
from functools import partial
from typing import Any, Callable, Dict, Iterable, List, Optional, Sequence, Tuple, Union

import torch

from .tensor_utils import tensor_tree_map, tree_map





def       a_ (	lowercase__ :Union[dict, list, tuple, torch.Tensor]     ):
			__lowerCamelCase          =      []
			if isinstance(lowercase__,			lowercase__     ):
						for v in tree.values():
									shapes.extend(_fetch_dims(lowercase__     )     )
			elif isinstance(lowercase__,			(list, tuple)     ):
						for t in tree:
									shapes.extend(_fetch_dims(lowercase__     )     )
			elif isinstance(lowercase__,			torch.Tensor     ):
						shapes.append(tree.shape     )
			else:
						raise ValueError("""Not supported"""     )

			return shapes





@torch.jit.ignore
def       a_ (	lowercase__ :int,			lowercase__ :Tuple[int, ...]     ):
			__lowerCamelCase          =      []
			for d in reversed(lowercase__     ):
						idx.append(flat_idx % d     )
						__lowerCamelCase          =      flat_idx // d

			return tuple(reversed(lowercase__     )     )





@torch.jit.ignore
def       a_ (	lowercase__ :Sequence[int],			lowercase__ :Sequence[int],			lowercase__ :Sequence[int],			lowercase__ :Optional[Sequence[bool]] = None,			lowercase__ :Optional[Sequence[bool]] = None,			):

			# start_edges and end_edges both indicate whether, starting from any given
			# dimension, the start/end index is at the top/bottom edge of the
			# corresponding tensor, modeled as a tree
			def reduce_edge_list(lowercase__ :List[bool]     ) -> None:
						__lowerCamelCase          =      True
						for i in range(len(lowercase__     )     ):
									__lowerCamelCase          =      -1 * (i + 1)
									l[reversed_idx] &= tally
									__lowerCamelCase          =      l[reversed_idx]

			if start_edges is None:
						__lowerCamelCase          =      [s == 0 for s in start]
						reduce_edge_list(lowercase__     )
			if end_edges is None:
						__lowerCamelCase          =      [e == (d - 1) for e, d in zip(lowercase__,			lowercase__     )]
						reduce_edge_list(lowercase__     )

			# Base cases. Either start/end are empty and we're done, or the final,
			# one-dimensional tensor can be simply sliced
			if len(lowercase__     ) == 0:
						return [()]
			elif len(lowercase__     ) == 1:
						return [(slice(start[0],			end[0] + 1     ),)]

			__lowerCamelCase          =      []
			__lowerCamelCase          =      []

			# Dimensions common to start and end can be selected directly
			for s, e in zip(lowercase__,			lowercase__     ):
						if s == e:
									path_list.append(slice(lowercase__,			s + 1     )     )
						else:
									break

			__lowerCamelCase          =      tuple(lowercase__     )
			__lowerCamelCase          =      len(lowercase__     )

			# start == end, and we're done
			if divergence_idx == len(lowercase__     ):
						return [path]

			def upper() -> Tuple[Tuple[slice, ...], ...]:
						assert start_edges is not None
						assert end_edges is not None

						__lowerCamelCase          =      start[divergence_idx]
						return tuple(
						    path + (slice(lowercase__,			sdi + 1     ),) + s
						    for s in _get_minimal_slice_set(
						        start[divergence_idx + 1 :],			[d - 1 for d in dims[divergence_idx + 1 :]],			dims[divergence_idx + 1 :],			start_edges=start_edges[divergence_idx + 1 :],			end_edges=[True for _ in end_edges[divergence_idx + 1 :]],			)     )

			def lower() -> Tuple[Tuple[slice, ...], ...]:
						assert start_edges is not None
						assert end_edges is not None

						__lowerCamelCase          =      end[divergence_idx]
						return tuple(
						    path + (slice(lowercase__,			edi + 1     ),) + s
						    for s in _get_minimal_slice_set(
						        [0 for _ in start[divergence_idx + 1 :]],			end[divergence_idx + 1 :],			dims[divergence_idx + 1 :],			start_edges=[True for _ in start_edges[divergence_idx + 1 :]],			end_edges=end_edges[divergence_idx + 1 :],			)     )

			# If both start and end are at the edges of the subtree rooted at
			# divergence_idx, we can just select the whole subtree at once
			if start_edges[divergence_idx] and end_edges[divergence_idx]:
						slices.append(path + (slice(start[divergence_idx],			end[divergence_idx] + 1     ),)     )
			# If just start is at the edge, we can grab almost all of the subtree,
			# treating only the ragged bottom edge as an edge case
			elif start_edges[divergence_idx]:
						slices.append(path + (slice(start[divergence_idx],			end[divergence_idx]     ),)     )
						slices.extend(lower()     )
			# Analogous to the previous case, but the top is ragged this time
			elif end_edges[divergence_idx]:
						slices.extend(upper()     )
						slices.append(path + (slice(start[divergence_idx] + 1,			end[divergence_idx] + 1     ),)     )
			# If both sides of the range are ragged, we need to handle both sides
			# separately. If there's contiguous meat in between them, we can index it
			# in one big chunk
			else:
						slices.extend(upper()     )
						__lowerCamelCase          =      end[divergence_idx] - start[divergence_idx]
						if middle_ground > 1:
									slices.append(path + (slice(start[divergence_idx] + 1,			end[divergence_idx]     ),)     )
						slices.extend(lower()     )

			return slices





@torch.jit.ignore
def       a_ (	lowercase__ :torch.Tensor,			lowercase__ :int,			lowercase__ :int,			lowercase__ :int     ):
			__lowerCamelCase          =      t.shape[:no_batch_dims]
			__lowerCamelCase          =      list(_flat_idx_to_idx(lowercase__,			lowercase__     )     )
			# _get_minimal_slice_set is inclusive
			__lowerCamelCase          =      list(_flat_idx_to_idx(flat_end - 1,			lowercase__     )     )

			# Get an ordered list of slices to perform
			__lowerCamelCase          =      _get_minimal_slice_set(
			    lowercase__,			lowercase__,			lowercase__,			)

			__lowerCamelCase          =      [t[s] for s in slices]

			return torch.cat([s.view((-1,) + t.shape[no_batch_dims:]     ) for s in sliced_tensors]     )





def       a_ (	lowercase__ :Callable,			lowercase__ :Dict[str, Any],			lowercase__ :int,			lowercase__ :int,			lowercase__ :bool = False,			lowercase__ :Any = None,			lowercase__ :bool = False,			):
			if not (len(lowercase__     ) > 0):
						raise ValueError("""Must provide at least one input"""     )

			__lowerCamelCase          =      [shape[:no_batch_dims] for shape in _fetch_dims(lowercase__     )]
			__lowerCamelCase          =      tuple([max(lowercase__     ) for s in zip(*lowercase__     )]     )

			def _prep_inputs(lowercase__ :torch.Tensor     ) -> torch.Tensor:
						if not low_mem:
									if not sum(t.shape[:no_batch_dims]     ) == no_batch_dims:
												__lowerCamelCase          =      t.expand(orig_batch_dims + t.shape[no_batch_dims:]     )
									__lowerCamelCase          =      t.reshape(-1,			*t.shape[no_batch_dims:]     )
						else:
									__lowerCamelCase          =      t.expand(orig_batch_dims + t.shape[no_batch_dims:]     )
						return t

			__lowerCamelCase          =      tensor_tree_map(_prep_inputs,			lowercase__     )
			__lowerCamelCase          =      None
			if _out is not None:
						__lowerCamelCase          =      tensor_tree_map(lambda lowercase__     : t.view([-1] + list(t.shape[no_batch_dims:]     )     ),			_out     )

			__lowerCamelCase          =      1
			for d in orig_batch_dims:
						flat_batch_dim *= d

			__lowerCamelCase          =      flat_batch_dim // chunk_size + (flat_batch_dim % chunk_size != 0)

			def _select_chunk(lowercase__ :torch.Tensor     ) -> torch.Tensor:
						return t[i : i + chunk_size] if t.shape[0] != 1 else t

			__lowerCamelCase          =      0
			__lowerCamelCase          =      prepped_outputs
			for _ in range(lowercase__     ):
						# Chunk the input
						if not low_mem:
									__lowerCamelCase          =      _select_chunk
						else:
									__lowerCamelCase          =      partial(
									    _chunk_slice,			flat_start=lowercase__,			flat_end=min(lowercase__,			i + chunk_size     ),			no_batch_dims=len(lowercase__     ),			)

						__lowerCamelCase          =      tensor_tree_map(lowercase__,			lowercase__     )

						# Run the layer on the chunk
						__lowerCamelCase          =      layer(**lowercase__     )

						# Allocate space for the output
						if out is None:
									__lowerCamelCase          =      tensor_tree_map(lambda lowercase__     : t.new_zeros((flat_batch_dim,) + t.shape[1:]     ),			lowercase__     )

						# Put the chunk in its pre-allocated space
						if isinstance(lowercase__,			lowercase__     ):

									def assign(lowercase__ :dict,			lowercase__ :dict     ) -> None:
												for k, v in da.items():
															if isinstance(lowercase__,			lowercase__     ):
																		assign(lowercase__,			da[k]     )
															else:
																		if _add_into_out:
																					v[i : i + chunk_size] += da[k]
																		else:
																					__lowerCamelCase          =      da[k]

									assign(lowercase__,			lowercase__     )
						elif isinstance(lowercase__,			lowercase__     ):
									for xa, xa in zip(lowercase__,			lowercase__     ):
												if _add_into_out:
															xa[i : i + chunk_size] += xa
												else:
															__lowerCamelCase          =      xa
						elif isinstance(lowercase__,			torch.Tensor     ):
									if _add_into_out:
												out[i : i + chunk_size] += output_chunk
									else:
												__lowerCamelCase          =      output_chunk
						else:
									raise ValueError("""Not supported"""     )

						i += chunk_size

			__lowerCamelCase          =      tensor_tree_map(lambda lowercase__     : t.view(orig_batch_dims + t.shape[1:]     ),			lowercase__     )

			return out




class 			__snake_case   :




							def __init__(     self:    Union[str, Any]     ,							A_:    int = 5_12     ,							):
										__lowerCamelCase          =      max_chunk_size
										__lowerCamelCase          =      None
										__lowerCamelCase          =      None




							def   __a   (     self:    Tuple     ,							A_:    Callable     ,							A_:    tuple     ,							A_:    int   ):
										logging.info("""Tuning chunk size..."""   )

										if min_chunk_size >= self.max_chunk_size:
													return min_chunk_size

										__lowerCamelCase          =      [2**l for l in range(int(math.log(self.max_chunk_size     ,							2   )   ) + 1   )]
										__lowerCamelCase          =      [c for c in candidates if c > min_chunk_size]
										__lowerCamelCase          =      [min_chunk_size] + candidates
										candidates[-1] += 4

										def test_chunk_size(A_:    int   ) -> bool:
													try:
																with torch.no_grad():
																			fn(*A_     ,							chunk_size=A_   )
																return True
													except RuntimeError:
																return False

										__lowerCamelCase          =      0
										__lowerCamelCase          =      len(A_   ) - 1
										while i > min_viable_chunk_size_index:
													__lowerCamelCase          =      test_chunk_size(candidates[i]   )
													if not viable:
																__lowerCamelCase          =      (min_viable_chunk_size_index + i) // 2
													else:
																__lowerCamelCase          =      i
																__lowerCamelCase          =      (i + len(A_   ) - 1) // 2

										return candidates[min_viable_chunk_size_index]




							def   __a   (     self:    Tuple     ,							A_:    Iterable     ,							A_:    Iterable   ):
										__lowerCamelCase          =      True
										for aa, aa in zip(A_     ,							A_   ):
													assert type(A_   ) == type(A_   )
													if isinstance(A_     ,							(list, tuple)   ):
																consistent &= self._compare_arg_caches(A_     ,							A_   )
													elif isinstance(A_     ,							A_   ):
																__lowerCamelCase          =      [v for _, v in sorted(aa.items()     ,							key=lambda A_   : x[0]   )]
																__lowerCamelCase          =      [v for _, v in sorted(aa.items()     ,							key=lambda A_   : x[0]   )]
																consistent &= self._compare_arg_caches(A_     ,							A_   )
													else:
																consistent &= aa == aa

										return consistent




							def   __a   (     self:    str     ,							A_:    Callable     ,							A_:    tuple     ,							A_:    int     ,							):
										__lowerCamelCase          =      True
										__lowerCamelCase          =      tree_map(lambda A_   : a.shape if isinstance(A_     ,							torch.Tensor   ) else a     ,							A_     ,							A_   )
										if self.cached_arg_data is not None:
													# If args have changed shape/value, we need to re-tune
													assert len(self.cached_arg_data   ) == len(A_   )
													__lowerCamelCase          =      self._compare_arg_caches(self.cached_arg_data     ,							A_   )
										else:
													# Otherwise, we can reuse the precomputed value
													__lowerCamelCase          =      False

										if not consistent:
													__lowerCamelCase          =      self._determine_favorable_chunk_size(
													    A_     ,							A_     ,							A_     ,							)
													__lowerCamelCase          =      arg_data

										assert self.cached_chunk_size is not None

										return self.cached_chunk_size




