Хеш-таблицы: string subscript out of range

#include <iostream>
#include <string.h>
#include <string>
using namespace std;
 
typedef string nametype;
struct celltype 
{
  nametype element;
  celltype* next;
};
const int DICT_SIZE = 15;
typedef celltype* DICTIONARY[DICT_SIZE];
 
int Hash(nametype);
void PRINT(DICTIONARY);
bool MEMBER(nametype, DICTIONARY &);
void INSERT(nametype, DICTIONARY &);
void MAKENULL(DICTIONARY &);
void DELETE(nametype, DICTIONARY &);
 
int main()
{
  DICTIONARY D;
  string strings[DICT_SIZE] = {"Willis","DeNiro","Tarantino","AlPacino","Statham","Butler","Sandler","Portman","Cage","Hanks","Freeman","Banderos","Stalone","VanDam","Pitt"};
  MAKENULL(D);
  for (int i = 0; i < DICT_SIZE; i++) 
  {
    INSERT(strings[i], D);
  }
  PRINT(D);
  DELETE("Banderos", D);
  PRINT(D);
  return 0;
}
 
int Hash(nametype x)
{
  int sum = 0;
  for (unsigned int i = 0; i < sizeof(x); i++)
  {
    sum += (int) x[i];
  }
  return  sum % (DICT_SIZE);
}
 
void PRINT(DICTIONARY A)
{
  celltype* current;
  for (int i = 0; i < DICT_SIZE; i++) 
  {
    cout<<endl<<"["<<i<<"]";
    current = A[i];
    while (current != NULL) 
    {
      cout<<current->element<<" ";
      current = current->next;
    }
  }
  cout<<endl;
}
 
bool MEMBER(nametype x, DICTIONARY &A)
{
  celltype* current;
  current = A[Hash(x)];
  while (current != NULL) 
  {
    if (current->element == x)
      return true;
    else 
      current = current->next;
  }
  return false;
}
 
void INSERT(nametype x, DICTIONARY &A)
{
  int bucket;
  celltype* oldHeader;
  if (!MEMBER(x, A))
  {
    bucket = Hash(x);
    oldHeader = A[bucket];
    A[bucket] = new celltype;
    A[bucket]->element = x;
    A[bucket]->next = oldHeader;
  }
}
 
void MAKENULL(DICTIONARY &A)
{
  for (int i = 0; i < DICT_SIZE; i++) 
  {
    A[i] = NULL;
  }
}
 
void DELETE(nametype x, DICTIONARY &A)
{
  int bucket;
  celltype* current;
  bucket = Hash(x);
  if (A[bucket] != NULL)
  {
    if (A[bucket]->element == x) 
    {
      A[bucket] = A[bucket]->next;
    }
    else 
    {
      current = A[bucket];
      while (current->next != NULL) 
      {
        if (current->next->element == x) 
        {
          current->next = current->next->next;
          break;
        }
        else 
        {
          current = current->next;
        }
      }
    }
  }
}

  for (unsigned int i = 0; i < sizeof(x); i++)
  {
    sum += (int) x[i];
  }

  for (unsigned int i = 0; i < x.size(); i++)
  {
    sum += (int) x[i];
  }