JavaScript中实现键值对应的字典与哈希表结构的示例

function Dictionary(){
this._size = 0;
this.datastore = Object.create(null);
}

Dictionary.prototype.isEmpty = function(){
return this._size === 0;
};

Dictionary.prototype.size = function(){
return this._size;
};

Dictionary.prototype.clear = function(){
for(var key in this.datastorE){
delete this.datastore[key];
}
this._size = 0;
};

Dictionary.prototype.add = function(key,value){
this.datastore[key] = value;
this._size++;
};

Dictionary.prototype.find = function(key){
return this.datastore[key];
};

Dictionary.prototype.count = function(){
var n = 0;
for(var key in this.datastorE){
n++;
}
return n;
};

Dictionary.prototype.remove = function(key){
delete this.datastore[key];
this._size--;
};

Dictionary.prototype.showAll = function(){
for(var key in this.datastorE){
console.log(key + "->" + this.datastore[key]);
}
};

function ValuePair(key,value){
this.key = key;
this.value = value;
}

ValuePair.prototype.toString = function(){
return "[" + this.key + ":" + this.value + "]";
};

})();

"use Strict";

var ValuePair = require("./lib/ValuePair");
var LinkedList = require("./LinkedList");

function Hashtable(){
this.table = Object.create(null);
this._size = 0;
}

Hashtable.prototype.isEmpty = function(){
return this._size === 0;
};

Hashtable.prototype.size = function(){
return this._size;
};

Hashtable.prototype.remove = function(key){
var index = hashCode(key);

if(this.table[index] == null){
  return false;
}else{
  var currNode = this.table[index].getHead();
  while(currNode.next){
    currNode = currNode.next;
    if(currNode.element.key == key){
      this.table[index].remove(currNode.element);
      this._size--;
      return true;
    }
  }
  return false;
}

};

Hashtable.prototype.get = function(key){
var index = hashCode(key);

if(this.table[index] == null){
  return null;
}else{
  var currNode = this.table[index].getHead();
  while(currNode.next){
    currNode = currNode.next;
    if(currNode.element.key == key){
      return currNode.element;
    }
  }
  return null;
}

};

Hashtable.prototype.put = function(key,value){
var index = hashCode(key);

if(this.table[index] == null){
  this.table[index] = new LinkedList();
}

var currNode = this.table[index].getHead();
while(currNode.next){            //key若已经存在,修改value值为新值
  currNode = currNode.next;
  if(currNode.element.key == key){
    currNode.element.value = value;
    break;
  }
}

if(currNode.next == null && currNode.element.value != value){         //key不存在,加入新值.注意边界值
  this.table[index].add(new ValuePair(key,value));
  this._size++;
}

return this;

};

Hashtable.prototype.display = function(){
for(var key in this.tablE){
var currNode = this.table[key].getHead();
while(currNode.next){
currNode = currNode.next;
console.log(currNode.element.toString());
}
}
};

/*** Utility Functions ****/

function hashCode(key) { //霍纳算法,质数取37
var hashValue = 6011;
for (var i = 0; i < key.length; i++) {
hashValue = hashValue * 37 + key.charCodeAt(i);
}
return hashValue % 1019;
}

})();