|
|
var arr = new Array();
arr['item1'] = 'the value of item 1 ';
arr['item2'] = 'the value of item 2 ';
alert(arr['item1']);
alert(arr['item2']);
但上述功能，不符我們的實(shí)際要求，另外查詢遍歷也不方便，我們需要在Array的基礎(chǔ)上進(jìn)行擴(kuò)展，
下面我們可以用js中的數(shù)組來實(shí)現(xiàn)類似的hashtable的功能,
復(fù)制代碼 代碼如下:
function Hashtable(){
this.clear = hashtable_clear;
this.containsKey = hashtable_containsKey;
this.containsValue = hashtable_containsValue;
this.get = hashtable_get;
this.isEmpty = hashtable_isEmpty;
this.keys = hashtable_keys;
this.put = hashtable_put;
this.remove = hashtable_remove;
this.size = hashtable_size;
this.toString = hashtable_toString;
this.values = hashtable_values;
this.hashtable = new Array();
}
function hashtable_clear(){
this.hashtable = new Array();
}
function hashtable_containsKey(key){
var exists = false;
for (var i in this.hashtable) {
if (i == key && this.hashtable[i] != null) {
exists = true;
break;
}
}
return exists;
}
function hashtable_containsValue(value){
var contains = false;
if (value != null) {
for (var i in this.hashtable) {
if (this.hashtable[i] == value) {
contains = true;
break;
}
}
}
return contains;
}
function hashtable_get(key){
return this.hashtable[key];
}
function hashtable_isEmpty(){
return (this.size == 0) ? true : false;
}
function hashtable_keys(){
var keys = new Array();
for (var i in this.hashtable) {
if (this.hashtable[i] != null)
keys.push(i);
}
return keys;
}
function hashtable_put(key, value){
if (key == null || value == null) {
throw 'NullPointerException {' + key + '},{' + value + '}';
}else{
this.hashtable[key] = value;
}
}
function hashtable_remove(key){
var rtn = this.hashtable[key];
//this.hashtable[key] =null;
this.hashtable.splice(key,1);
return rtn;
}
function hashtable_size(){
var size = 0;
for (var i in this.hashtable) {
if (this.hashtable[i] != null)
size ++;
}
return size;
}
function hashtable_toString(){
var result = '';
for (var i in this.hashtable)
{
if (this.hashtable[i] != null)
result += '{' + i + '},{' + this.hashtable[i] + '}/n';
}
return result;
}
function hashtable_values(){
var values = new Array();
for (var i in this.hashtable) {
if (this.hashtable[i] != null)
values.push(this.hashtable[i]);
}
return values;
}
Hastable類使用方法:
復(fù)制代碼 代碼如下:
//實(shí)例化一個自定義的哈希表類
var hashTable = new Hashtable();
hashTable.put(0,'abc'); //0為key, 'abc'為value
hashTable.put(1,'123');
hashTable.put(2,'88a');
hashTable.put(3,'88a');
//遍歷hashtable, 相當(dāng)于c#和Java中的foreach
for (var key in hashTable.keys()){ /* 用keys方法 */
alert(hashTable.get(key)); //按key遍歷value
}
//遍歷hashtable, 相當(dāng)于c#和Java中的foreach
for (var key in hashTable.hashtable)){ /* 用hashtable屬性 */
alert(hashTable.get(key)); //按key遍歷value
}
alert(hashTable.containsKey(1)); //返回true
alert(hashTable.containsKey(4)); //因?yàn)椴淮嬖趉ey為4的，返回false
alert(hashTable.containsValue('888')); //返回true
alert(hashTable.containsValue('mobidogs')); //因?yàn)椴淮嬖趘alue為'mobidogs'的，返回false
hashTable.remove(1); //移除key為1的元素
alert(hashTable.containsKey(1)); //因?yàn)閗ey為1的元素已被上行的reomve()方法移除，所以返回false
//關(guān)于hastable的其它方法使用簡單,讀者可以自己測試 (此略)
JavaScript技術(shù)：javascript hashtable實(shí)現(xiàn)代碼，轉(zhuǎn)載需保留來源！
鄭重聲明：本文版權(quán)歸原作者所有，轉(zhuǎn)載文章僅為傳播更多信息之目的，如作者信息標(biāo)記有誤，請第一時間聯(lián)系我們修改或刪除，多謝。
