88 lines
1.6 KiB
Plaintext
88 lines
1.6 KiB
Plaintext
compile Insert RTI_HASHTABLE2_SCRIPT
|
|
function newTable() {
|
|
|
|
var HashTable = new function(){
|
|
|
|
var ourArray = [];
|
|
this.init = function() {
|
|
ourArray.items = [];
|
|
ourArray.length = 0;
|
|
for (var i = 0; i < arguments.length; i += 2) {
|
|
if (typeof(arguments[i + 1]) != 'undefined') {
|
|
ourArray.items[arguments[i]] = arguments[i + 1];
|
|
ourArray.length++;
|
|
}
|
|
}
|
|
};
|
|
this.removeItem = function(in_key)
|
|
{
|
|
var tmp_previous;
|
|
if (typeof(ourArray.items[in_key]) != 'undefined') {
|
|
ourArray.length--;
|
|
var tmp_previous = ourArray.items[in_key];
|
|
delete ourArray.items[in_key];
|
|
}
|
|
|
|
return tmp_previous;
|
|
};
|
|
|
|
|
|
this.getItem = function(in_key) {
|
|
return ourArray.items[in_key];
|
|
};
|
|
|
|
|
|
this.setItem = function(in_key, in_value)
|
|
{
|
|
var tmp_previous;
|
|
if (typeof(in_value) != 'undefined') {
|
|
if (typeof(ourArray.items[in_key]) == 'undefined') {
|
|
ourArray.length++;
|
|
}
|
|
else {
|
|
tmp_previous = ourArray.items[in_key];
|
|
}
|
|
|
|
ourArray.items[in_key] = in_value;
|
|
}
|
|
|
|
return tmp_previous;
|
|
};
|
|
|
|
this.hasItem = function(in_key)
|
|
{
|
|
return typeof(ourArray.items[in_key]) != 'undefined';
|
|
} ;
|
|
|
|
|
|
this.clear = function()
|
|
{
|
|
for (var i in ourArray.items) {
|
|
delete ourArray.items[i];
|
|
}
|
|
|
|
ourArray.length = 0;
|
|
};
|
|
|
|
|
|
this.keyList = function(delimChar)
|
|
{
|
|
var rslt = "",
|
|
prefixChar = "";
|
|
for (var i in ourArray.items) {
|
|
rslt += prefixChar + i;
|
|
prefixChar = delimChar;
|
|
}
|
|
|
|
return rslt;
|
|
};
|
|
|
|
this.getLength = function() {
|
|
return ourArray.length;
|
|
};
|
|
};
|
|
HashTable.init();
|
|
return HashTable
|
|
};
|
|
|