



'''simple docstring'''


def 				__lowerCamelCase				(   A__    ,						A__    )       ->	list:






   """simple docstring"""
   UpperCamelCase					=  len(A__    )
   UpperCamelCase					=  []
   for i in range(len(A__    ) - pat_len + 1    ):
      UpperCamelCase					=  True
      for j in range(A__    ):
         if s[i + j] != pattern[j]:
            UpperCamelCase					=  False
            break
      if match_found:
         position.append(A__    )
   return position


if __name__ == "__main__":
   assert naive_pattern_search("ABCDEFG", "DE") == [3]
   print(naive_pattern_search("ABAAABCDBBABCDDEBCABC", "ABC"))






'''simple docstring'''


_lowerCamelCase	:       int      	=	"0.21.0"

from .accelerator import Accelerator
from .big_modeling import (
    cpu_offload,
    cpu_offload_with_hook,
    disk_offload,
    dispatch_model,
    init_empty_weights,
    init_on_device,
    load_checkpoint_and_dispatch,
)
from .data_loader import skip_first_batches
from .launchers import debug_launcher, notebook_launcher
from .state import PartialState
from .utils import (
    DeepSpeedPlugin,
    DistributedDataParallelKwargs,
    DistributedType,
    FullyShardedDataParallelPlugin,
    GradScalerKwargs,
    InitProcessGroupKwargs,
    find_executable_batch_size,
    infer_auto_device_map,
    is_rich_available,
    load_checkpoint_in_model,
    synchronize_rng_states,
)


if is_rich_available():
   from .utils import rich

