tablica.h

Implementation of genetic algorithm, to search for desired extreme n-variable function.

//---------------------------------------------------------------------------
#ifndef tablicaH
#define tablicaH

//---------------------------------------------------------------------------

template <typename Typ, unsigned N = 10>
class TTablica
{
  private:
	Typ* tablica;
	unsigned next;
	Typ Temp;

  public:
	TTablica(void)
	{
		tablica = new Typ[N];
		next = 0;
	}
	~TTablica(void)
	{
		delete [] tablica;
     }

	int add(Typ const& el)
	{
		if(next == N) return -1;
		tablica[next++] = el;
		return next - 1;
     }
	int count(void)
	{
		return next;
     }
	int size(void)
	{
		return N;
     }
	bool set(Typ const& el, int index)
	{
		if(index < 0 || index >= next) return false;
		tablica[index] = el;
		return true;
	}
	Typ const& at(int index)
	{
		if(index < 0 || index >= next) return Temp;
		return tablica[index];
     }
	void clear(void)
	{
		for(int i = 0; i < N; i++)
			tablica[i] = Temp;
		next = 0;
	}
	void assign(Typ const& el)
	{
		for(int i = 0; i < N; i++)
			tablica[i] = el;
		next = N;
	}
};
//---------------------------------------------------------------------------
#endif