mirror of
https://github.com/roytam1/palemoon27.git
synced 2026-05-26 14:30:27 +00:00
6ecfad14f8
- Bug 1140558 - Part 2 - Make the testing deepEqual implementation shared properly in ObjectUtils.jsm. r=yoric (f1a217e34a) - Bug 1154773 - Change undefined property a.prototype. r=Yoric (8a4dc37d6c) - Bug 1202971 (part 1) - Fix compile warnings in libmar. r=rstrong. (30cdf015c2) - bug 1200360 - fix $(DEFINES) usage in modules/libmar/tool/moz.build. r=mshal (26f1c5640b) - Bug 903135 - Updates to libmar needed to support B2G MAR signature verification. r=bbondy (81612e2200) - Bug 1228332 - Fix a potentially uninitialized pointer read, flagged by static analysis. r=spohl (9cac770c90) - Bug 1202971 (part 2) - Fix compile warnings in toolkit/mozapps/update/tests. r=rstrong. (814f2b3b8b) - Bug 973933 - Fix libmar warnings. r=rstrong. a=Callek (e0c2d3edcc) - Bug 1232219 (part 1) - Fix -Wunused warnings in libmar/. r=bbondy. (dc046504df) - Bug 1228281 - [GTK3] add padding to buttons. r=karlt (fe8ca55f58) - Bug 1232219 (part 2.5) - Fix -Wunused warnings in parser/expat/lib/. r=hsivonen. (e4d10c5d68) - Bug 1232219 (part 3) - Fix remaining -Wunused warnings. r=glandium. (35c5f3c38e) - Bug 1232219 (follow-up) - Fix nsinstall.c bustage in SM(e) builds. r=me. (d62c12cf35) - Bug 1186815 (part 1) - Replace nsBaseHashtable::Enumerate() calls in modules/libjar/ with iterators. r=mwu. (6959b19fab) - Bug 1186815 (part 2) - Replace nsBaseHashtable::Enumerate() calls in modules/libjar/ with iterators. r=mwu. (02c6f50482) - Bug 1181444 (part 1.5) - Remove dead PLDHashOperator declarations. r=froydnj. (c956e03dc0) - Bug 1225407 - Replace nsInterfaceHashtable::EnumerateRead() call in SubstitutingProtocolHandler with an iterator. r=michal (aa71f5499c) - Bug 1187781 (part 1) - Replace nsBaseHashtable::EnumerateRead() calls in dom/xbl/ with iterators. r=mrbkap. (68f51d05ba) - Bug 1187781 (part 2) - Replace nsBaseHashtable::EnumerateRead() calls in dom/xbl/ with iterators. r=mrbkap. (1dfc261267) - Bug 1187781 (part 3) - Replace nsBaseHashtable::EnumerateRead() calls in dom/xbl/ with iterators. r=mrbkap. (922fc4e4ef) - Bug 1187781 (part 4) - Replace nsBaseHashtable::EnumerateRead() calls in dom/xbl/ with iterators. r=mrbkap. (7b1915053f) - Bug 1187781 (part 5) - Replace nsBaseHashtable::EnumerateRead() calls in dom/xbl/ with iterators. r=mrbkap. (5df4cc1d09) - Bug 1181444 (part 2) - Remove nsBaseHashtable::Enumerate(). r=froydnj. (c606342f1d) - Bug 1243912 - Remove unused Loader::RemoveEntriesWithURI declaration. r=njn (e59b2ef892) - Bug 1187137 (part 4) - Replace nsBaseHashtable::Enumerate() calls in netwerk/protocol/ with iterators. r=valentin. (17fb17c48f) - Bug 1187137 (part 5) - Replace nsBaseHashtable::Enumerate() calls in netwerk/protocol/ with iterators. r=valentin. (89d430cf98) - Bug 1187137 (part 6) - Replace nsBaseHashtable::Enumerate() calls in netwerk/protocol/ with iterators. r=valentin. (37befe08c6) - Bug 1187137 (part 7) - Replace nsBaseHashtable::Enumerate() calls in netwerk/protocol/ with iterators. r=valentin (a8227c4b3e) - Bug 1187137 (part 1) - Replace nsBaseHashtable::Enumerate() calls in netwerk/protocol/ with iterators. r=michal. (05f71a4a94) - Bug 1187137 (part 2) - Replace nsBaseHashtable::Enumerate() calls in netwerk/protocol/ with iterators. r=michal. (5defa991b5) - Bug 1187137 (part 3) - Replace nsBaseHashtable::Enumerate() calls in netwerk/protocol/ with iterators. r=michal. (f2e0a4be0f) - Bug 1187137 (part 8) - Replace nsBaseHashtable::Enumerate() calls in netwerk/protocol/ with iterators. r=valentin. (11b77f3b67) - Bug 1187137 (part 9) - Replace nsBaseHashtable::Enumerate() calls in netwerk/protocol/ with iterators. r=valentin. (7a6bd9a17e) - Bug 1230743 - telemtry for nsConnectionEntry hit rate r=hurley (a75d6ec52c) - Bug 1218297 - eventtokenbucket shutdown leak r=valentin (1723059684) - Bug 1239961 - Minimize amount of PR_Poll and PR_Read calls during shutdown. r=mcmanus (127259afb6) - Bug 1187137 (part 10) - Replace nsBaseHashtable::Enumerate() calls in netwerk/protocol/ with iterators. r=valentin. (eee20459fb) - Bug 1187137 (part 11) - Replace nsBaseHashtable::Enumerate() calls in netwerk/protocol/ with iterators. r=valentin. (864bc96862) - Bug 1187137 (part 12) - Replace nsBaseHashtable::Enumerate() calls in netwerk/protocol/ with iterators. r=valentin. (4fd9540167) - Bug 1187137 (part 13) - Replace nsBaseHashtable::Enumerate() calls in netwerk/protocol/ with iterators. r=valentin. (65a01f4083) - Bug 1187151 (part 14) - Replace nsBaseHashtable::Enumerate() calls in dom/ with iterators. r=baku. (a71b4169a9) - Bug 1187141 - Replace nsBaseHashtable::Enumerate() calls in storage/ with iterators. r=mak. (d95fb168c9) - Bug 1187151 (part 11) - Replace nsBaseHashtable::Enumerate() calls in dom/ with iterators. r=khuey. (dda92d0455) - Bug 1187151 (part 10) - Replace nsBaseHashtable::Enumerate() calls in dom/ with iterators. r=khuey. (f59270049c) - Bug 1191460 Contextual Identity tests r=tanvi,r=ttaubert (03c079ede9) - Bug 1187151 (part 12) - Replace nsBaseHashtable::Enumerate() calls in dom/ with iterators. r=khuey. (0aa9356990) - Bug 1187151 (part 15) - Replace nsBaseHashtable::Enumerate() calls in dom/ with iterators. r=baku. (10e60a4b55) - Bug 1187151 (part 16) - Replace nsBaseHashtable::Enumerate() calls in dom/ with iterators. r=mccr8. (2ef1033aae) - Bug 1187151 (part 17) - Replace nsBaseHashtable::Enumerate() calls in dom/ with iterators. r=mccr8. (dc37dfc17b) - Bug 1241763: Don't fire dom-window-destroyed on outer windows. r=bz (ea30677af6) - Bug 1192128 - In DOM memory reporter, handle WindowID() being a uint64_t. r=mccr8. (b3f834b8f6) - Bug 1187151 (part 18) - Replace nsBaseHashtable::Enumerate() calls in dom/ with iterators. r=mccr8. (22d4fbe0f0) - Bug 1187138 (part 2) - Replace nsBaseHashtable::Enumerate() calls in toolkit/ with iterators. r=froydnj. (b4740ef44b) - Bug 1187138 (part 3) - Replace nsBaseHashtable::Enumerate() calls in toolkit/ with iterators. r=froydnj. (931eb9e813) - Bug 1187138 (part 4) - Replace nsBaseHashtable::Enumerate() calls in toolkit/ with iterators. r=froydnj. (a92fef3586) - Bug 1192189 - Fix assertion condition to use to-be-restyled element's composed document. r=dbaron (6c7733b7cc) - Bug 1187144 (part 10) - Replace nsBaseHashtable::Enumerate() calls in layout/ with iterators. r=heycam. (e93ad4330c) - Bug 1250525 - remove #IFDEF ENABLE_TESTS from dom/quota/ActorsParent.cpp. r=janv (22bc8fc0af) - Bug 1236632 - remove unused variable in FactoryOp::WaitForTransactions; r=janv (3c56b90fff) - Bug 1187116 (part 1) - Replace nsBaseHashtable::EnumerateRead() calls in dom/indexedDB/ with iterators. r=khuey. (f37ac71816) - Bug 1187116 (part 2) - Replace nsBaseHashtable::EnumerateRead() calls in dom/indexedDB/ with iterators. r=khuey. (6bf16c51fe) - Bug 1187116 (part 3) - Replace nsBaseHashtable::EnumerateRead() calls in dom/indexedDB/ with iterators. r=khuey. (351b7d5d34) - Bug 1187116 (part 4) - Replace nsBaseHashtable::EnumerateRead() calls in dom/indexedDB/ with iterators. r=khuey. (330678dde4) - Bug 1187116 (part 5) - Replace nsBaseHashtable::EnumerateRead() calls in dom/indexedDB/ with iterators. r=khuey. (43d20a7fa3) - Bug 1187116 (part 6) - Replace nsBaseHashtable::EnumerateRead() calls in dom/indexedDB/ with iterators. r=khuey. (d448d80726) - quick fix by revert of anticipated patch (00a093055d) - Bug 1186814 - Replace nsBaseHashtable::EnumerateRead() calls in extensions/spellcheck/ with iterators. r=ehsan. (ff78039ba0)
659 lines
15 KiB
C++
659 lines
15 KiB
C++
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
|
|
/* vim: set ts=8 sts=2 et sw=2 tw=80: */
|
|
/* This Source Code Form is subject to the terms of the Mozilla Public
|
|
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
|
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
|
|
|
|
#include "nsTHashtable.h"
|
|
#include "nsBaseHashtable.h"
|
|
#include "nsDataHashtable.h"
|
|
#include "nsInterfaceHashtable.h"
|
|
#include "nsClassHashtable.h"
|
|
|
|
#include "nsCOMPtr.h"
|
|
#include "nsISupports.h"
|
|
#include "nsCOMArray.h"
|
|
#include "mozilla/Attributes.h"
|
|
|
|
#include <stdio.h>
|
|
|
|
namespace TestHashtables {
|
|
|
|
class TestUniChar // for nsClassHashtable
|
|
{
|
|
public:
|
|
explicit TestUniChar(uint32_t aWord)
|
|
{
|
|
printf(" TestUniChar::TestUniChar() %u\n", aWord);
|
|
mWord = aWord;
|
|
}
|
|
|
|
~TestUniChar()
|
|
{
|
|
printf(" TestUniChar::~TestUniChar() %u\n", mWord);
|
|
}
|
|
|
|
uint32_t GetChar() const { return mWord; }
|
|
|
|
private:
|
|
uint32_t mWord;
|
|
};
|
|
|
|
struct EntityNode {
|
|
const char* mStr; // never owns buffer
|
|
uint32_t mUnicode;
|
|
};
|
|
|
|
EntityNode gEntities[] = {
|
|
{"nbsp",160},
|
|
{"iexcl",161},
|
|
{"cent",162},
|
|
{"pound",163},
|
|
{"curren",164},
|
|
{"yen",165},
|
|
{"brvbar",166},
|
|
{"sect",167},
|
|
{"uml",168},
|
|
{"copy",169},
|
|
{"ordf",170},
|
|
{"laquo",171},
|
|
{"not",172},
|
|
{"shy",173},
|
|
{"reg",174},
|
|
{"macr",175}
|
|
};
|
|
|
|
#define ENTITY_COUNT (unsigned(sizeof(gEntities)/sizeof(EntityNode)))
|
|
|
|
class EntityToUnicodeEntry : public PLDHashEntryHdr
|
|
{
|
|
public:
|
|
typedef const char* KeyType;
|
|
typedef const char* KeyTypePointer;
|
|
|
|
explicit EntityToUnicodeEntry(const char* aKey) { mNode = nullptr; }
|
|
EntityToUnicodeEntry(const EntityToUnicodeEntry& aEntry) { mNode = aEntry.mNode; }
|
|
~EntityToUnicodeEntry() { }
|
|
|
|
bool KeyEquals(const char* aEntity) const { return !strcmp(mNode->mStr, aEntity); }
|
|
static const char* KeyToPointer(const char* aEntity) { return aEntity; }
|
|
static PLDHashNumber HashKey(const char* aEntity) { return mozilla::HashString(aEntity); }
|
|
enum { ALLOW_MEMMOVE = true };
|
|
|
|
const EntityNode* mNode;
|
|
};
|
|
|
|
static uint32_t
|
|
nsTIterPrint(nsTHashtable<EntityToUnicodeEntry>& hash)
|
|
{
|
|
uint32_t n = 0;
|
|
for (auto iter = hash.Iter(); !iter.Done(); iter.Next()) {
|
|
EntityToUnicodeEntry* entry = iter.Get();
|
|
printf(" enumerated \"%s\" = %u\n",
|
|
entry->mNode->mStr, entry->mNode->mUnicode);
|
|
n++;
|
|
}
|
|
return n;
|
|
}
|
|
|
|
static uint32_t
|
|
nsTIterPrintRemove(nsTHashtable<EntityToUnicodeEntry>& hash)
|
|
{
|
|
uint32_t n = 0;
|
|
for (auto iter = hash.Iter(); !iter.Done(); iter.Next()) {
|
|
EntityToUnicodeEntry* entry = iter.Get();
|
|
printf(" enumerated \"%s\" = %u\n",
|
|
entry->mNode->mStr, entry->mNode->mUnicode);
|
|
iter.Remove();
|
|
n++;
|
|
}
|
|
return n;
|
|
}
|
|
|
|
void
|
|
testTHashtable(nsTHashtable<EntityToUnicodeEntry>& hash, uint32_t numEntries) {
|
|
printf("Filling hash with %d entries.\n", numEntries);
|
|
|
|
uint32_t i;
|
|
for (i = 0; i < numEntries; ++i) {
|
|
printf(" Putting entry \"%s\"...", gEntities[i].mStr);
|
|
EntityToUnicodeEntry* entry =
|
|
hash.PutEntry(gEntities[i].mStr);
|
|
|
|
if (!entry) {
|
|
printf("FAILED\n");
|
|
exit (2);
|
|
}
|
|
printf("OK...");
|
|
|
|
if (entry->mNode) {
|
|
printf("entry already exists!\n");
|
|
exit (3);
|
|
}
|
|
printf("\n");
|
|
|
|
entry->mNode = &gEntities[i];
|
|
}
|
|
|
|
printf("Testing Get:\n");
|
|
|
|
for (i = 0; i < numEntries; ++i) {
|
|
printf(" Getting entry \"%s\"...", gEntities[i].mStr);
|
|
EntityToUnicodeEntry* entry =
|
|
hash.GetEntry(gEntities[i].mStr);
|
|
|
|
if (!entry) {
|
|
printf("FAILED\n");
|
|
exit (4);
|
|
}
|
|
|
|
printf("Found %u\n", entry->mNode->mUnicode);
|
|
}
|
|
|
|
printf("Testing nonexistent entries...");
|
|
|
|
EntityToUnicodeEntry* entry =
|
|
hash.GetEntry("xxxy");
|
|
|
|
if (entry) {
|
|
printf("FOUND! BAD!\n");
|
|
exit (5);
|
|
}
|
|
|
|
printf("not found; good.\n");
|
|
|
|
printf("Enumerating:\n");
|
|
uint32_t count = nsTIterPrint(hash);
|
|
if (count != numEntries) {
|
|
printf(" Bad count!\n");
|
|
exit (6);
|
|
}
|
|
}
|
|
|
|
//
|
|
// all this nsIFoo stuff was copied wholesale from TestCOMPtr.cpp
|
|
//
|
|
|
|
#define NS_IFOO_IID \
|
|
{ 0x6f7652e0, 0xee43, 0x11d1, \
|
|
{ 0x9c, 0xc3, 0x00, 0x60, 0x08, 0x8c, 0xa6, 0xb3 } }
|
|
|
|
class IFoo final : public nsISupports
|
|
{
|
|
public:
|
|
NS_DECLARE_STATIC_IID_ACCESSOR(NS_IFOO_IID)
|
|
|
|
IFoo();
|
|
|
|
NS_IMETHOD_(MozExternalRefCountType) AddRef();
|
|
NS_IMETHOD_(MozExternalRefCountType) Release();
|
|
NS_IMETHOD QueryInterface( const nsIID&, void** );
|
|
|
|
NS_IMETHOD SetString(const nsACString& /*in*/ aString);
|
|
NS_IMETHOD GetString(nsACString& /*out*/ aString);
|
|
|
|
static void print_totals();
|
|
|
|
private:
|
|
~IFoo();
|
|
|
|
unsigned int refcount_;
|
|
|
|
static unsigned int total_constructions_;
|
|
static unsigned int total_destructions_;
|
|
nsCString mString;
|
|
};
|
|
|
|
NS_DEFINE_STATIC_IID_ACCESSOR(IFoo, NS_IFOO_IID)
|
|
|
|
unsigned int IFoo::total_constructions_;
|
|
unsigned int IFoo::total_destructions_;
|
|
|
|
void
|
|
IFoo::print_totals()
|
|
{
|
|
printf("total constructions/destructions --> %d/%d\n",
|
|
total_constructions_, total_destructions_);
|
|
}
|
|
|
|
IFoo::IFoo()
|
|
: refcount_(0)
|
|
{
|
|
++total_constructions_;
|
|
printf(" new IFoo@%p [#%d]\n",
|
|
static_cast<void*>(this), total_constructions_);
|
|
}
|
|
|
|
IFoo::~IFoo()
|
|
{
|
|
++total_destructions_;
|
|
printf("IFoo@%p::~IFoo() [#%d]\n",
|
|
static_cast<void*>(this), total_destructions_);
|
|
}
|
|
|
|
MozExternalRefCountType
|
|
IFoo::AddRef()
|
|
{
|
|
++refcount_;
|
|
printf("IFoo@%p::AddRef(), refcount --> %d\n",
|
|
static_cast<void*>(this), refcount_);
|
|
return refcount_;
|
|
}
|
|
|
|
MozExternalRefCountType
|
|
IFoo::Release()
|
|
{
|
|
int newcount = --refcount_;
|
|
if ( newcount == 0 )
|
|
printf(">>");
|
|
|
|
printf("IFoo@%p::Release(), refcount --> %d\n",
|
|
static_cast<void*>(this), refcount_);
|
|
|
|
if ( newcount == 0 )
|
|
{
|
|
printf(" delete IFoo@%p\n", static_cast<void*>(this));
|
|
printf("<<IFoo@%p::Release()\n", static_cast<void*>(this));
|
|
delete this;
|
|
}
|
|
|
|
return newcount;
|
|
}
|
|
|
|
nsresult
|
|
IFoo::QueryInterface( const nsIID& aIID, void** aResult )
|
|
{
|
|
printf("IFoo@%p::QueryInterface()\n", static_cast<void*>(this));
|
|
nsISupports* rawPtr = 0;
|
|
nsresult status = NS_OK;
|
|
|
|
if ( aIID.Equals(NS_GET_IID(IFoo)) )
|
|
rawPtr = this;
|
|
else
|
|
{
|
|
nsID iid_of_ISupports = NS_ISUPPORTS_IID;
|
|
if ( aIID.Equals(iid_of_ISupports) )
|
|
rawPtr = static_cast<nsISupports*>(this);
|
|
else
|
|
status = NS_ERROR_NO_INTERFACE;
|
|
}
|
|
|
|
NS_IF_ADDREF(rawPtr);
|
|
*aResult = rawPtr;
|
|
|
|
return status;
|
|
}
|
|
|
|
nsresult
|
|
IFoo::SetString(const nsACString& aString)
|
|
{
|
|
mString = aString;
|
|
return NS_OK;
|
|
}
|
|
|
|
nsresult
|
|
IFoo::GetString(nsACString& aString)
|
|
{
|
|
aString = mString;
|
|
return NS_OK;
|
|
}
|
|
|
|
nsresult
|
|
CreateIFoo( IFoo** result )
|
|
// a typical factory function (that calls AddRef)
|
|
{
|
|
printf(" >>CreateIFoo() --> ");
|
|
IFoo* foop = new IFoo();
|
|
printf("IFoo@%p\n", static_cast<void*>(foop));
|
|
|
|
foop->AddRef();
|
|
*result = foop;
|
|
|
|
printf("<<CreateIFoo()\n");
|
|
return NS_OK;
|
|
}
|
|
|
|
} // namespace TestHashtables
|
|
|
|
using namespace TestHashtables;
|
|
|
|
int
|
|
main(void) {
|
|
// check an nsTHashtable
|
|
printf("Initializing nsTHashtable...");
|
|
nsTHashtable<EntityToUnicodeEntry> EntityToUnicode(ENTITY_COUNT);
|
|
printf("OK\n");
|
|
|
|
printf("Partially filling nsTHashtable:\n");
|
|
testTHashtable(EntityToUnicode, 5);
|
|
|
|
printf("Enumerate-removing...\n");
|
|
uint32_t count = nsTIterPrintRemove(EntityToUnicode);
|
|
if (count != 5) {
|
|
printf("wrong count\n");
|
|
exit (7);
|
|
}
|
|
printf("OK\n");
|
|
|
|
printf("Check enumeration...");
|
|
count = nsTIterPrint(EntityToUnicode);
|
|
if (count != 0) {
|
|
printf("entries remain in table!\n");
|
|
exit (8);
|
|
}
|
|
printf("OK\n");
|
|
|
|
printf("Filling nsTHashtable:\n");
|
|
testTHashtable(EntityToUnicode, ENTITY_COUNT);
|
|
|
|
printf("Clearing...");
|
|
EntityToUnicode.Clear();
|
|
printf("OK\n");
|
|
|
|
printf("Check enumeration...");
|
|
count = nsTIterPrint(EntityToUnicode);
|
|
if (count != 0) {
|
|
printf("entries remain in table!\n");
|
|
exit (9);
|
|
}
|
|
printf("OK\n");
|
|
|
|
//
|
|
// now check a data-hashtable
|
|
//
|
|
|
|
printf("Initializing nsDataHashtable...");
|
|
nsDataHashtable<nsUint32HashKey,const char*> UniToEntity(ENTITY_COUNT);
|
|
printf("OK\n");
|
|
|
|
printf("Filling hash with %u entries.\n", ENTITY_COUNT);
|
|
|
|
uint32_t i;
|
|
for (i = 0; i < ENTITY_COUNT; ++i) {
|
|
printf(" Putting entry %u...", gEntities[i].mUnicode);
|
|
UniToEntity.Put(gEntities[i].mUnicode, gEntities[i].mStr);
|
|
printf("OK...\n");
|
|
}
|
|
|
|
printf("Testing Get:\n");
|
|
const char* str;
|
|
|
|
for (i = 0; i < ENTITY_COUNT; ++i) {
|
|
printf(" Getting entry %u...", gEntities[i].mUnicode);
|
|
if (!UniToEntity.Get(gEntities[i].mUnicode, &str)) {
|
|
printf("FAILED\n");
|
|
exit (12);
|
|
}
|
|
|
|
printf("Found %s\n", str);
|
|
}
|
|
|
|
printf("Testing nonexistent entries...");
|
|
if (UniToEntity.Get(99446, &str)) {
|
|
printf("FOUND! BAD!\n");
|
|
exit (13);
|
|
}
|
|
|
|
printf("not found; good.\n");
|
|
|
|
printf("Enumerating:\n");
|
|
|
|
count = 0;
|
|
for (auto iter = UniToEntity.Iter(); !iter.Done(); iter.Next()) {
|
|
printf(" enumerated %u = \"%s\"\n", iter.Key(), iter.UserData());
|
|
count++;
|
|
}
|
|
if (count != ENTITY_COUNT) {
|
|
printf(" Bad count!\n");
|
|
exit (14);
|
|
}
|
|
|
|
printf("Clearing...");
|
|
UniToEntity.Clear();
|
|
printf("OK\n");
|
|
|
|
printf("Checking count...");
|
|
count = 0;
|
|
for (auto iter = UniToEntity.Iter(); !iter.Done(); iter.Next()) {
|
|
printf(" enumerated %u = \"%s\"\n", iter.Key(), iter.Data());
|
|
count++;
|
|
}
|
|
if (count != 0) {
|
|
printf(" Clear did not remove all entries.\n");
|
|
exit (15);
|
|
}
|
|
|
|
printf("OK\n");
|
|
|
|
//
|
|
// now check a class-hashtable
|
|
//
|
|
|
|
printf("Initializing nsClassHashtable...");
|
|
nsClassHashtable<nsCStringHashKey,TestUniChar> EntToUniClass(ENTITY_COUNT);
|
|
printf("OK\n");
|
|
|
|
printf("Filling hash with %u entries.\n", ENTITY_COUNT);
|
|
|
|
for (i = 0; i < ENTITY_COUNT; ++i) {
|
|
printf(" Putting entry %u...", gEntities[i].mUnicode);
|
|
TestUniChar* temp = new TestUniChar(gEntities[i].mUnicode);
|
|
|
|
EntToUniClass.Put(nsDependentCString(gEntities[i].mStr), temp);
|
|
printf("OK...\n");
|
|
}
|
|
|
|
printf("Testing Get:\n");
|
|
TestUniChar* myChar;
|
|
|
|
for (i = 0; i < ENTITY_COUNT; ++i) {
|
|
printf(" Getting entry %s...", gEntities[i].mStr);
|
|
if (!EntToUniClass.Get(nsDependentCString(gEntities[i].mStr), &myChar)) {
|
|
printf("FAILED\n");
|
|
exit (18);
|
|
}
|
|
|
|
printf("Found %c\n", myChar->GetChar());
|
|
}
|
|
|
|
printf("Testing nonexistent entries...");
|
|
if (EntToUniClass.Get(NS_LITERAL_CSTRING("xxxx"), &myChar)) {
|
|
printf("FOUND! BAD!\n");
|
|
exit (19);
|
|
}
|
|
|
|
printf("not found; good.\n");
|
|
|
|
printf("Enumerating:\n");
|
|
|
|
count = 0;
|
|
for (auto iter = EntToUniClass.Iter(); !iter.Done(); iter.Next()) {
|
|
printf(" enumerated \"%s\" = %c\n",
|
|
PromiseFlatCString(iter.Key()).get(), iter.UserData()->GetChar());
|
|
count++;
|
|
}
|
|
if (count != ENTITY_COUNT) {
|
|
printf(" Bad count!\n");
|
|
exit (20);
|
|
}
|
|
|
|
printf("Clearing...\n");
|
|
EntToUniClass.Clear();
|
|
printf(" Clearing OK\n");
|
|
|
|
printf("Checking count...");
|
|
count = 0;
|
|
for (auto iter = EntToUniClass.Iter(); !iter.Done(); iter.Next()) {
|
|
printf(" enumerated \"%s\" = %c\n",
|
|
PromiseFlatCString(iter.Key()).get(), iter.Data()->GetChar());
|
|
count++;
|
|
}
|
|
if (count != 0) {
|
|
printf(" Clear did not remove all entries.\n");
|
|
exit (21);
|
|
}
|
|
|
|
printf("OK\n");
|
|
|
|
//
|
|
// now check a data-hashtable with an interface key
|
|
//
|
|
|
|
printf("Initializing nsDataHashtable with interface key...");
|
|
nsDataHashtable<nsISupportsHashKey,uint32_t> EntToUniClass2(ENTITY_COUNT);
|
|
printf("OK\n");
|
|
|
|
printf("Filling hash with %u entries.\n", ENTITY_COUNT);
|
|
|
|
nsCOMArray<IFoo> fooArray;
|
|
|
|
for (i = 0; i < ENTITY_COUNT; ++i) {
|
|
printf(" Putting entry %u...", gEntities[i].mUnicode);
|
|
nsCOMPtr<IFoo> foo;
|
|
CreateIFoo(getter_AddRefs(foo));
|
|
foo->SetString(nsDependentCString(gEntities[i].mStr));
|
|
|
|
fooArray.InsertObjectAt(foo, i);
|
|
|
|
EntToUniClass2.Put(foo, gEntities[i].mUnicode);
|
|
printf("OK...\n");
|
|
}
|
|
|
|
printf("Testing Get:\n");
|
|
uint32_t myChar2;
|
|
|
|
for (i = 0; i < ENTITY_COUNT; ++i) {
|
|
printf(" Getting entry %s...", gEntities[i].mStr);
|
|
|
|
if (!EntToUniClass2.Get(fooArray[i], &myChar2)) {
|
|
printf("FAILED\n");
|
|
exit (24);
|
|
}
|
|
|
|
printf("Found %c\n", myChar2);
|
|
}
|
|
|
|
printf("Testing nonexistent entries...");
|
|
if (EntToUniClass2.Get((nsISupports*) 0x55443316, &myChar2)) {
|
|
printf("FOUND! BAD!\n");
|
|
exit (25);
|
|
}
|
|
|
|
printf("not found; good.\n");
|
|
|
|
printf("Enumerating:\n");
|
|
|
|
count = 0;
|
|
for (auto iter = EntToUniClass2.Iter(); !iter.Done(); iter.Next()) {
|
|
nsAutoCString s;
|
|
nsCOMPtr<IFoo> foo = do_QueryInterface(iter.Key());
|
|
foo->GetString(s);
|
|
printf(" enumerated \"%s\" = %u\n", s.get(), iter.UserData());
|
|
count++;
|
|
}
|
|
if (count != ENTITY_COUNT) {
|
|
printf(" Bad count!\n");
|
|
exit (26);
|
|
}
|
|
|
|
printf("Clearing...\n");
|
|
EntToUniClass2.Clear();
|
|
printf(" Clearing OK\n");
|
|
|
|
printf("Checking count...");
|
|
count = 0;
|
|
for (auto iter = EntToUniClass2.Iter(); !iter.Done(); iter.Next()) {
|
|
nsAutoCString s;
|
|
nsCOMPtr<IFoo> foo = do_QueryInterface(iter.Key());
|
|
foo->GetString(s);
|
|
printf(" enumerated \"%s\" = %u\n", s.get(), iter.Data());
|
|
count++;
|
|
}
|
|
if (count != 0) {
|
|
printf(" Clear did not remove all entries.\n");
|
|
exit (27);
|
|
}
|
|
|
|
printf("OK\n");
|
|
|
|
//
|
|
// now check an interface-hashtable with an uint32_t key
|
|
//
|
|
|
|
printf("Initializing nsInterfaceHashtable...");
|
|
nsInterfaceHashtable<nsUint32HashKey,IFoo> UniToEntClass2(ENTITY_COUNT);
|
|
printf("OK\n");
|
|
|
|
printf("Filling hash with %u entries.\n", ENTITY_COUNT);
|
|
|
|
for (i = 0; i < ENTITY_COUNT; ++i) {
|
|
printf(" Putting entry %u...", gEntities[i].mUnicode);
|
|
nsCOMPtr<IFoo> foo;
|
|
CreateIFoo(getter_AddRefs(foo));
|
|
foo->SetString(nsDependentCString(gEntities[i].mStr));
|
|
|
|
UniToEntClass2.Put(gEntities[i].mUnicode, foo);
|
|
printf("OK...\n");
|
|
}
|
|
|
|
printf("Testing Get:\n");
|
|
|
|
for (i = 0; i < ENTITY_COUNT; ++i) {
|
|
printf(" Getting entry %s...", gEntities[i].mStr);
|
|
|
|
nsCOMPtr<IFoo> myEnt;
|
|
if (!UniToEntClass2.Get(gEntities[i].mUnicode, getter_AddRefs(myEnt))) {
|
|
printf("FAILED\n");
|
|
exit (30);
|
|
}
|
|
|
|
nsAutoCString myEntStr;
|
|
myEnt->GetString(myEntStr);
|
|
printf("Found %s\n", myEntStr.get());
|
|
}
|
|
|
|
printf("Testing nonexistent entries...");
|
|
nsCOMPtr<IFoo> myEnt;
|
|
if (UniToEntClass2.Get(9462, getter_AddRefs(myEnt))) {
|
|
printf("FOUND! BAD!\n");
|
|
exit (31);
|
|
}
|
|
|
|
printf("not found; good.\n");
|
|
|
|
printf("Enumerating:\n");
|
|
|
|
count = 0;
|
|
for (auto iter = UniToEntClass2.Iter(); !iter.Done(); iter.Next()) {
|
|
nsAutoCString s;
|
|
iter.UserData()->GetString(s);
|
|
printf(" enumerated %u = \"%s\"\n", iter.Key(), s.get());
|
|
count++;
|
|
}
|
|
if (count != ENTITY_COUNT) {
|
|
printf(" Bad count!\n");
|
|
exit (32);
|
|
}
|
|
|
|
printf("Clearing...\n");
|
|
UniToEntClass2.Clear();
|
|
printf(" Clearing OK\n");
|
|
|
|
printf("Checking count...");
|
|
count = 0;
|
|
for (auto iter = UniToEntClass2.Iter(); !iter.Done(); iter.Next()) {
|
|
nsAutoCString s;
|
|
iter.Data()->GetString(s);
|
|
printf(" enumerated %u = \"%s\"\n", iter.Key(), s.get());
|
|
count++;
|
|
}
|
|
if (count != 0) {
|
|
printf(" Clear did not remove all entries.\n");
|
|
exit (33);
|
|
}
|
|
|
|
printf("OK\n");
|
|
|
|
return 0;
|
|
}
|