TSet.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 TSet
  {
  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:
    TSet()
      : Data(nullptr), Capacity(0), Size(0)
    {
    }
 
    ~TSet()
    {
      delete[] Data;  
    }
 
    void Add(const T& Element)
    {
      if (Contains(Element))
      {
        return;  
      }
      if (Size == Capacity)
      {
        Resize(Capacity == 0 ? 1 : Capacity * 2);  
      }
      Data[Size++] = Element;  
    }
 
    void Remove(const T& Element)
    {
      for (size_t i = 0; i < Size; ++i)
      {
        if (Data[i] == Element)
        {
          for (size_t j = i; j < Size - 1; ++j)
          {
            Data[j] = Data[j + 1];  
          }
          --Size;  
          return;
        }
      }
      std::cerr << "Element not found" << std::endl;  
    }
 
    bool Contains(const T& Element) const
    {
      for (size_t i = 0; i < Size; ++i)
      {
        if (Data[i] == Element)
        {
          return true;  
        }
      }
      return false;  
    }
 
    size_t Num() const
    {
      return Size;  
    }
 
    size_t GetCapacity() const
    {
      return Capacity;  
    }
  };
 
  // Example
 
  /*
  int main()
  {
    TSet<int> MySet;  ///< Crear una instancia de TSet para elementos enteros.
    MySet.Add(1);  ///< Añadir elementos al conjunto.
    MySet.Add(2);
    MySet.Add(3);
 
    MySet.Remove(2);  ///< Eliminar el elemento 2 del conjunto.
 
    std::cout << "Contains 1: " << MySet.Contains(1) << std::endl;  ///< Verificar e imprimir si el conjunto contiene el elemento 1.
    std::cout << "Contains 2: " << MySet.Contains(2) << std::endl;  ///< Verificar e imprimir si el conjunto contiene el elemento 2.
 
    std::cout << "Size: " << MySet.Num() << ", Capacity: " << MySet.GetCapacity() << std::endl;  ///< Imprimir el tamaño y la capacidad del conjunto.
 
    return 0;
  }
  */
}