Array

Array is a linear data structure that stores elements in contiguous memory locations. Each element can be accessed directly using its index, which allows for efficient retrieval and modification.

class Array:
  def __init__(self,capacity =8):
    self.__capacity = capacity
    self.__size = 0
    self.__items = [0] * capacity

  def __str__(self):
    arr_str = "["
    for i in range(self.__size):
      arr_str += str(self.__items[i])
      if i != self.__size - 1:
        arr_str += ", "
    arr_str += "]"
    return arr_str

  @property
  def size(self):
    return self.__size
  
  def is_empty(self):
    return self.__size == 0

  def __grow(self):
    self.new__items = [0] * (self.__capacity * 2)
    for i in range(self.__size):
      self.new__items[i] = self.__items[i]
    self.__items = self.new__items
    self.__capacity *= 2

  def insert(self, index, item):
    if index < 0 or index > self.__size:
      raise IndexError("Index out of bounds")
    if self.__size == self.__capacity:
      self.__grow()
    for i in range(self.__size, index, -1):
      self.__items[i] = self.__items[i - 1]
    self.__items[index] = item
    self.__size += 1
  
  def append(self, item):
    self.insert(self.__size, item)

  def remove(self, index):
    if index < 0 or index >= self.__size:
      raise IndexError("Index out of bounds")
    for i in range(index, self.__size - 1):
      self.__items[i] = self.__items[i + 1]
    self.__size -= 1

  def set(self, index, item):
    if index < 0 or index >= self.__size:
      raise IndexError("Index out of bounds")
    self.__items[index] = item

  def get(self, index):
    if index < 0 or index >= self.__size:
      raise IndexError("Index out of bounds")
    return self.__items[index]

  def find(self, item):
    for i in range(self.__size):
      if self.__items[i] == item:
        return i
    return -1

  def for_each(self, func):
    for i in range(self.__size):
      func(self.__items[i])