Lines Matching refs:key
10 * This utility does not support any collision handling. New hash table entries with a used key overwrite older ones.
25 * The individual tables can be accessed by the key they are hashing against.
65 * @description Setup the hash table for a given key with all existing records in the recordset
68 * @param key {string} A key to hash by.
72 _setHashTable: function(key) {
79 obj[host._items[i].getValue(key)] = host._items[i];
99 //in each hashtable, look to see if the key is represented in the object being added.
101 function(v, key) {
104 //if the object being added has a key which is being stored by hashtable v, add it into the table.
105 if (o.getValue(key)) {
106 v[o.getValue(key)] = o;
124 //in each hashtable, look to see if the key is represented in the object being deleted.
126 function(v, key) {
129 reckey = o.getValue(key);
131 //if the hashtable has a key storing a record, and the key and the record both match the record being deleted, delete that row from the hashtable
156 Y.each(tbl, function(v, key) {
160 reckey = o.getValue(key);
167 if (e.overwritten[i] && (v[e.overwritten[i].getValue(key)] === e.overwritten[i])) {
168 delete v[e.overwritten[i].getValue(key)];
175 // //add the new updated record if it has a key that corresponds to a hash table
176 // if (o.getValue(key)) {
177 // v[o.getValue(key)] = o;
193 * @param key {string} A key to hash by.
194 * @return tbls[key] {object} The created hash table
197 createTable: function(key) {
199 tbls[key] = this._setHashTable(key);
202 return tbls[key];
207 * @description Get a hash table that hashes records by a given key.
210 * @param key {string} A key to hash by.
214 getTable: function(key) {
215 return this.get('hashTables')[key];