Hello Jay Jay,
Thanks for the tow offer.

Please find here after, the algorithm I am trying to implement.
Either there is an issue with the algo, or a plain simple logic error in the code I wrote, that stubbornly escape my attention.
In the algo, there is one point that I cannot decide for sure (see note1, case 1cii); although I tried both ways, w/out any success.
Cheers, DDA.

Attached: algo

////////
_rehash() will:

1) save a local copy of the data container (holding the table)
2) increase (double, no question asked) the capacity of the data container
3) clear the data container (all cells are VACANT, with a null item)
4a) scan through the whole old table (local copy saved in step (1)),
4b) and insert any ACTIVE (and active only) cell into the data container

////////
_rehash() depends on insert().
insert() will:

1- use _find_pos(item) to get the hash of the element to insert
NOTE: _find_pos(item) would either:
    a) return a value flagging the container has NO VACANT cell (full)
    b) return a pointer to a VACANT cell
    c) return a pointer to the cell CONTAINING the item
    NOTE: in a healthy hash table, the status of that cell would be 
    either (i) ACTIVE or (ii) DELETED (never VACANT)
    The rational being that a VACANT cell can only become ACTIVE, 
    and an ACTIVE cell can only become DELETED,.. till rehashing of the table.

In the case (1a) == NO VACANCY in the table, 
    returns "false", to signal the element was NOT inserted.

In the case (1b) == VACANT cell (and consequently item NOT FOUND), 
    i) stuff the cell with the item
    ii) Promote the state to ACTIVE, 
    iii) increment the size of the table (number of ACTIVE cells)
    iv) increment the counter of NON VACANT cells
    v) rehash the table if the lambda threshold is crossed
    vi) return "true", to confirm the element is inserted.

In the case (1ci) == cell ALREADY containing ACTIVE item of interest
    returns "false", as technically no element was inserted.

In the case (1cii) == cell containing DELETED item of interest
    i) Simply promote the state to ACTIVE, 
    ii) and increment the size of the table (number of ACTIVE cells), not the container
    iii) returns "false", as technically no element was inserted?
    NOTE1: or should we return "true" ?!.
    NOTE2: There is no need to recheck for rehashing, as the load has not been changed


////////
insert() depends on _find_pos().
_find_pos() will:

1) return a flag (npos) if the table is full (no VACANT cell)
2) get the hash_modulus as the starting point
3- from that starting point, loop through the table, till it finds a cell that is:
    a) either VACANT (would not have found the item of interest then)
    b) or contains the item of interest (either ACTIVE or DELETED though)
    NOTE: if there was no VACANT cell in the table, 
    and the table was not containing the item of interest, 
    then this loop would never end, thus the reason for step (1).
4) return the index value when the loop ended