quadractic probing in hash function

[hav206]

I am trying to do the quadractic probing in hashing function. I want to know if this is right? and how do I check if the table is full?

  //
//  hash_func.h
//  hash_function
//

//

#ifndef hash_func_h
#define hash_func_h
#include <iostream>

//template <typename T>
class hash_entry
{
private:
    int value;
    int key;
public:
    hash_entry(int m_value,int m_key)
    {
        this->value = m_value;
        this->key = m_key;
    }
};


class hashMap
{
private:
    hash_entry ** myTable;
public:
    hashMap()
    {
        myTable = new  hash_entry *[128];
        for (int i = 0; i < 128; i++)
        {
            myTable[i] = NULL;
        }
    }
    void putIntoHash(int m_value, int m_key)
    {
        int i = 0;
        int hash = m_key % 128;
        if (myTable[hash] == NULL)
        {
            myTable[hash] = new hash_entry(m_value, m_key);
            return;
        }
        while (myTable[hash] != NULL)
        {
            i++;
            hash += (i * i) % 128;
            if (myTable[hash] == NULL)
            {
                myTable[hash] = new hash_entry(m_value, m_key);
                break;
            }
                
            
        }
    }
};

#endif /* hash_func_h */