TArray.h

Ir a la documentación de este archivo.

 
/*
 * MIT License
 *
 * Copyright (c) 2024 Roberto Charreton
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in all
 * copies or substantial portions of the Software.
 *
 * In addition, any project or software that uses this library or class must include
 * the following acknowledgment in the credits:
 *
 * "This project uses software developed by Roberto Charreton and Attribute Overload."
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
*/
 
#pragma once
namespace EU {
  template<typename T>
  class TArray
  {
  private:
    T* Data;           
    size_t Capacity;   
    size_t Size;       
 
    void Resize(size_t NewCapacity)
    {
      T* NewData = new T[NewCapacity];  
      for (size_t i = 0; i < Size; ++i)
      {
        NewData[i] = Data[i];  
      }
      delete[] Data;  
      Data = NewData; 
      Capacity = NewCapacity;  
    }
 
  public:
    TArray() : Data(nullptr), Capacity(0), Size(0)  {}
 
    ~TArray() {
      delete[] Data;  
    }
 
    void Add(const T& Element)
    {
      if (Size == Capacity)
      {
        Resize(Capacity == 0 ? 1 : Capacity * 2);  
      }
      Data[Size++] = Element;  
    }
 
    void RemoveAt(size_t Index)
    {
      if (Index >= Size)
      {
        std::cerr << "Index out of range" << std::endl;  
        return;
      }
      for (size_t i = Index; i < Size - 1; ++i)
      {
        Data[i] = Data[i + 1];  
      }
      --Size;  
    }
 
    T& operator[](size_t Index)
    {
      if (Index >= Size)
      {
        std::cerr << "Index out of range" << std::endl;  
        exit(1);  
      }
      return Data[Index];  
    }
 
    const T& operator[](size_t Index) const
    {
      if (Index >= Size)
      {
        std::cerr << "Index out of range" << std::endl;  
        exit(1);  
      }
      return Data[Index];  
    }
 
    size_t Num() const
    {
      return Size;  
    }
 
    size_t GetCapacity() const
    {
      return Capacity;  
    }
  };
 
  // EXAMPLE
 
  /*
  int main() {
 
    // TArray Example
    TArray<int> MyArray;
    MyArray.Add(1);
    MyArray.Add(2);
    MyArray.Add(3);
    MyArray.Add(4);
    MyArray.Add(5);
 
    MyArray.Add(6);
    MyArray.RemoveAt(2);
 
    for (size_t i = 0; i < MyArray.Num(); ++i)
    {
      std::cout << MyArray[i] << " ";
    }
    std::cout << std::endl;
 
    std::cout << "Size: " << MyArray.Num() << ", Capacity: " << MyArray.GetCapacity() << std::endl;
 
    return 0;
  }
  */
}