117 lines
3.1 KiB
JavaScript
117 lines
3.1 KiB
JavaScript
(function(f){if(typeof exports==="object"&&typeof module!=="undefined"){module.exports=f()}else if(typeof define==="function"&&define.amd){define([],f)}else{var g;if(typeof window!=="undefined"){g=window}else if(typeof global!=="undefined"){g=global}else if(typeof self!=="undefined"){g=self}else{g=this}g.mapOrSimilar = f()}})(function(){var define,module,exports;return (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o<r.length;o++)s(r[o]);return s})({1:[function(_dereq_,module,exports){
|
|
module.exports = function(forceSimilar) {
|
|
if (typeof Map !== 'function' || forceSimilar) {
|
|
var Similar = _dereq_('./similar');
|
|
return new Similar();
|
|
}
|
|
else {
|
|
return new Map();
|
|
}
|
|
}
|
|
|
|
},{"./similar":2}],2:[function(_dereq_,module,exports){
|
|
function Similar() {
|
|
this.list = [];
|
|
this.lastItem = undefined;
|
|
this.size = 0;
|
|
|
|
return this;
|
|
}
|
|
|
|
Similar.prototype.get = function(key) {
|
|
var index;
|
|
|
|
if (this.lastItem && this.isEqual(this.lastItem.key, key)) {
|
|
return this.lastItem.val;
|
|
}
|
|
|
|
index = this.indexOf(key);
|
|
if (index >= 0) {
|
|
this.lastItem = this.list[index];
|
|
return this.list[index].val;
|
|
}
|
|
|
|
return undefined;
|
|
};
|
|
|
|
Similar.prototype.set = function(key, val) {
|
|
var index;
|
|
|
|
if (this.lastItem && this.isEqual(this.lastItem.key, key)) {
|
|
this.lastItem.val = val;
|
|
return this;
|
|
}
|
|
|
|
index = this.indexOf(key);
|
|
if (index >= 0) {
|
|
this.lastItem = this.list[index];
|
|
this.list[index].val = val;
|
|
return this;
|
|
}
|
|
|
|
this.lastItem = { key: key, val: val };
|
|
this.list.push(this.lastItem);
|
|
this.size++;
|
|
|
|
return this;
|
|
};
|
|
|
|
Similar.prototype.delete = function(key) {
|
|
var index;
|
|
|
|
if (this.lastItem && this.isEqual(this.lastItem.key, key)) {
|
|
this.lastItem = undefined;
|
|
}
|
|
|
|
index = this.indexOf(key);
|
|
if (index >= 0) {
|
|
this.size--;
|
|
return this.list.splice(index, 1)[0];
|
|
}
|
|
|
|
return undefined;
|
|
};
|
|
|
|
|
|
// important that has() doesn't use get() in case an existing key has a falsy value, in which case has() would return false
|
|
Similar.prototype.has = function(key) {
|
|
var index;
|
|
|
|
if (this.lastItem && this.isEqual(this.lastItem.key, key)) {
|
|
return true;
|
|
}
|
|
|
|
index = this.indexOf(key);
|
|
if (index >= 0) {
|
|
this.lastItem = this.list[index];
|
|
return true;
|
|
}
|
|
|
|
return false;
|
|
};
|
|
|
|
Similar.prototype.forEach = function(callback, thisArg) {
|
|
var i;
|
|
for (i = 0; i < this.size; i++) {
|
|
callback.call(thisArg || this, this.list[i].val, this.list[i].key, this);
|
|
}
|
|
};
|
|
|
|
Similar.prototype.indexOf = function(key) {
|
|
var i;
|
|
for (i = 0; i < this.size; i++) {
|
|
if (this.isEqual(this.list[i].key, key)) {
|
|
return i;
|
|
}
|
|
}
|
|
return -1;
|
|
};
|
|
|
|
// check if the numbers are equal, or whether they are both precisely NaN (isNaN returns true for all non-numbers)
|
|
Similar.prototype.isEqual = function(val1, val2) {
|
|
return val1 === val2 || (val1 !== val1 && val2 !== val2);
|
|
};
|
|
|
|
module.exports = Similar;
|
|
},{}]},{},[1])(1)
|
|
}); |