درهم‌سازی کامل پویا

function Locate(x) is
       j = h(x);
       if (position hj(x) of subtable Tj contains x (not deleted))
          return (x is in S);
       end if
       else
          return (x is not in S);
       end else
end

function Insert(x) is
       count = count + 1;
       if (count> M)
          FullRehash(x);
       end if
       else
          j = h(x);
          if (Position hj(x) of subtable Tj contains x)
             if (x is marked deleted)
                remove the delete marker;
             end if
          end if
          else
             bj = bj + 1;
             if (bj <= mj)
                if position hj(x) of Tj is empty
                   store x in position hj(x) of Tj;
                end if
                else
                   Put all unmarked elements of Tj in list Lj;
                   Append x to list Lj;
                   bj = length of Lj;
                   repeat
                      hj = randomly chosen function in Hsj;
                   until hj is injective on the elements of Lj;
                   for all y on list Lj
                      store y in position hj(y) of Tj;
                   end for
                end else
             end if
             else
                mj = ۲ * max{1, mj};
                sj = ۲ * mj * (mj - 1);
                if the sum total of all sj ≤ ۳۲ * M / s(M) + 4 * M
                   Allocate sj cells for Tj;
                   Put all unmarked elements of Tj in list Lj;
                   Append x to list Lj;
                   bj = length of Lj;
                   repeat
                      hj = randomly chosen function in Hsj;
                   until hj is injective on the elements of Lj;
                   for all y on list Lj
                      store y in position hj(y) of Tj;
                   end for
                end if
                else
                   FullRehash(x);
                end else
             end else
          end else
       end else
end

function Delete(x) is
       count = count + 1;
       j = h(x);
       if position h(x) of subtable Tj contains x
          mark x as deleted;
       end if
       else
          return (x is not a member of S);
       end else
       if (count>= M)
          FullRehash(-1);
       end if
end

${\displaystyle \sum _{0\le j\le s(M)}{s}_j\le \frac{32M^2}{s(M)}+4M.}$

function FullRehash(x) is
       Put all unmarked elements of T in list L;
       if (x is in U)
          append x to L;
       end if
       count = length of list L;
       M = (1 + c) * max{count, 4};
       repeat
          h = randomly chosen function in Hs(M);
          for all j <s(M)
             form a list Lj for h(x) = j;
             bj = length of Lj;
             mj = ۲ * bj;
             sj = ۲ * mj * (mj - 1);
          end for
       until the sum total of all sj ≤ ۳۲ * M / s(M) + 4 * M
       for all j <s(M)
          Allocate space sj for subtable Tj;
          repeat
             hj = randomly chosen function in Hsj;
          until hj is injective on the elements of list Lj;
       end for
       for all x on list Lj
          store x in position hj(x) of Tj;
       end for
end