cout << "Found " << entry->mNode->mUnicode << endl;
printf("Found %u\n", entry->mNode->mUnicode);
testTHashtable(nsTHashtable<EntityToUnicodeEntry>& hash, PRUint32 numEntries) {  cout << "Filling hash with " << numEntries << " entries." << endl;  PRUint32 i;  for (i = 0; i < numEntries; ++i) {    cout << "  Putting entry \"" << gEntities[i].mStr << "\"...";    EntityToUnicodeEntry* entry =      hash.PutEntry(gEntities[i].mStr);    if (!entry) {      cout << "FAILED" << endl;      exit (2);    }    cout << "OK...";    if (entry->mNode) {      cout << "entry already exists!" << endl;      exit (3);    }    cout << endl;    entry->mNode = &gEntities[i];  }  cout << "Testing Get:" << endl;  for (i = 0; i < numEntries; ++i) {    cout << "  Getting entry \"" << gEntities[i].mStr << "\"...";    EntityToUnicodeEntry* entry =      hash.GetEntry(gEntities[i].mStr);    if (!entry) {      cout << "FAILED" << endl;      exit (4);    }    cout << "Found " << entry->mNode->mUnicode << endl;  }  cout << "Testing non-existent entries...";  EntityToUnicodeEntry* entry =    hash.GetEntry("xxxy");  if (entry) {    cout << "FOUND! BAD!" << endl;    exit (5);  }  cout << "not found; good." << endl;  cout << "Enumerating:" << endl;  PRUint32 count = hash.EnumerateEntries(nsTEnumGo, nsnull);  if (count != numEntries) {    cout << "  Bad count!" << endl;    exit (6);  }}