

"""simple docstring"""





from typing import TYPE_CHECKING

from ...utils import OptionalDependencyNotAvailable, _LazyModule, is_torch_available, is_vision_available


_SCREAMING_SNAKE_CASE       :  str        = {
    """configuration_mobilenet_v1""": [
        """MOBILENET_V1_PRETRAINED_CONFIG_ARCHIVE_MAP""",
        """MobileNetV1Config""",
        """MobileNetV1OnnxConfig""",
    ],
}

try:
	if not is_vision_available():
		raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
	pass
else:
	_SCREAMING_SNAKE_CASE       :  Union[str, Any]        = ["""MobileNetV1FeatureExtractor"""]
	_SCREAMING_SNAKE_CASE       :  int        = ["""MobileNetV1ImageProcessor"""]

try:
	if not is_torch_available():
		raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
	pass
else:
	_SCREAMING_SNAKE_CASE       :  Optional[Any]        = [
	    """MOBILENET_V1_PRETRAINED_MODEL_ARCHIVE_LIST""",
	    """MobileNetV1ForImageClassification""",
	    """MobileNetV1Model""",
	    """MobileNetV1PreTrainedModel""",
	    """load_tf_weights_in_mobilenet_v1""",
	]


if TYPE_CHECKING:
	from .configuration_mobilenet_va import (
	    MOBILENET_V1_PRETRAINED_CONFIG_ARCHIVE_MAP,
	    MobileNetVaConfig,
	    MobileNetVaOnnxConfig,
	)

	try:
		if not is_vision_available():
			raise OptionalDependencyNotAvailable()
	except OptionalDependencyNotAvailable:
		pass
	else:
		from .feature_extraction_mobilenet_va import MobileNetVaFeatureExtractor
		from .image_processing_mobilenet_va import MobileNetVaImageProcessor

	try:
		if not is_torch_available():
			raise OptionalDependencyNotAvailable()
	except OptionalDependencyNotAvailable:
		pass
	else:
		from .modeling_mobilenet_va import (
		    MOBILENET_V1_PRETRAINED_MODEL_ARCHIVE_LIST,
		    MobileNetVaForImageClassification,
		    MobileNetVaModel,
		    MobileNetVaPreTrainedModel,
		    load_tf_weights_in_mobilenet_va,
		)


else:
	import sys

	_SCREAMING_SNAKE_CASE       :  Union[str, Any]        = _LazyModule(__name__, globals()["""__file__"""], _import_structure, module_spec=__spec__)





"""simple docstring"""





from __future__ import annotations

from collections.abc import Iterable
from dataclasses import dataclass
from typing import Any

class     __a   :

			"""simple docstring"""

			SCREAMING_SNAKE_CASE_						     =						('_front', '_back', '_len')

			@dataclass
			class     __a   :

						"""simple docstring"""

						SCREAMING_SNAKE_CASE_						     =						None
						SCREAMING_SNAKE_CASE_						     =						None
						SCREAMING_SNAKE_CASE_						     =						None



			class     __a   :

						"""simple docstring"""

						SCREAMING_SNAKE_CASE_						     =						('_cur',)






						def __init__(							self     :					Optional[int]						,  lowercase_     :					Deque._Node | None						):
											UpperCamelCase__		:    List[str]         =cur






						def __iter__(							self     :					List[str]						):
											return self






						def    _lowerCAmelCase			(							self     :					List[Any]						):
											if self._cur is None:
																# finished iterating
																raise StopIteration
											UpperCamelCase__		:    str         =self._cur.val
											UpperCamelCase__		:    Any         =self._cur.next_node

											return val






			def __init__(							self     :					str						,  lowercase_     :					Iterable[Any] | None = None						):
								UpperCamelCase__		:    Any         =None
								UpperCamelCase__		:    Any         =None
								UpperCamelCase__		:    int         =0

								if iterable is not None:
													# append every value to the deque
													for val in iterable:
																		self.append(lowercase_						)






			def    _lowerCAmelCase			(							self     :					str						,  lowercase_     :					Any						):
								UpperCamelCase__		:    Union[str, Any]         =self._Node(lowercase_						,  lowercase_						,  lowercase_						)
								if self.is_empty():
													# front = back
													UpperCamelCase__		:    Any         =node
													UpperCamelCase__		:    List[Any]         =1
								else:
													# connect nodes
													UpperCamelCase__		:    Any         =node
													UpperCamelCase__		:    Optional[Any]         =self._back
													UpperCamelCase__		:    str         =node  # assign new back to the new node

													self._len += 1

													# make sure there were no errors
													assert not self.is_empty(), "Error on appending value."






			def    _lowerCAmelCase			(							self     :					Optional[Any]						,  lowercase_     :					Any						):
								UpperCamelCase__		:    str         =self._Node(lowercase_						,  lowercase_						,  lowercase_						)
								if self.is_empty():
													# front = back
													UpperCamelCase__		:    str         =node
													UpperCamelCase__		:    Any         =1
								else:
													# connect nodes
													UpperCamelCase__		:    int         =self._front
													UpperCamelCase__		:    int         =node
													UpperCamelCase__		:    Any         =node  # assign new front to the new node

													self._len += 1

													# make sure there were no errors
													assert not self.is_empty(), "Error on appending value."






			def    _lowerCAmelCase			(							self     :					List[Any]						,  lowercase_     :					Iterable[Any]						):
								for val in iterable:
													self.append(lowercase_						)






			def    _lowerCAmelCase			(							self     :					Dict						,  lowercase_     :					Iterable[Any]						):
								for val in iterable:
													self.appendleft(lowercase_						)






			def    _lowerCAmelCase			(							self     :					Optional[int]						):
								assert not self.is_empty(), "Deque is empty."

								UpperCamelCase__		:    List[Any]         =self._back
								UpperCamelCase__		:    Any         =self._back.prev_node  # set new back
								# drop the last node - python will deallocate memory automatically
								UpperCamelCase__		:    List[str]         =None

								self._len -= 1

								return topop.val






			def    _lowerCAmelCase			(							self     :					str						):
								assert not self.is_empty(), "Deque is empty."

								UpperCamelCase__		:    List[str]         =self._front
								UpperCamelCase__		:    List[Any]         =self._front.next_node  # set new front and drop the first node
								UpperCamelCase__		:    Dict         =None

								self._len -= 1

								return topop.val






			def    _lowerCAmelCase			(							self     :					Dict						):
								return self._front is None






			def __len__(							self     :					Any						):
								return self._len






			def __eq__(							self     :					Dict						,  lowercase_     :					object						):

								if not isinstance(lowercase_						,  lowercase_						):
													return NotImplemented

								UpperCamelCase__		:    Union[str, Any]         =self._front
								UpperCamelCase__		:    Union[str, Any]         =other._front

								# if the length of the dequeues are not the same, they are not equal
								if len(self						) != len(lowercase_						):
													return False

								while me is not None and oth is not None:
													# compare every value
													if me.val != oth.val:
																		return False
													UpperCamelCase__		:    Union[str, Any]         =me.next_node
													UpperCamelCase__		:    Union[str, Any]         =oth.next_node

								return True






			def __iter__(							self     :					Optional[int]						):
								return Deque._Iterator(self._front						)






			def __repr__(							self     :					Tuple						):
								UpperCamelCase__		:    List[Any]         =[]
								UpperCamelCase__		:    Optional[int]         =self._front
								while aux is not None:
													# append the values in a list to display
													values_list.append(aux.val						)
													UpperCamelCase__		:    Optional[Any]         =aux.next_node

								return f'''[{', '.join(repr(lowercase_						) for val in values_list						)}]'''


if __name__ == "__main__":
				import doctest

				doctest.testmod()


