@antv/layout
Version:
graph layout algorithm
50 lines (42 loc) • 1.5 kB
JavaScript
import { __require as require_listCacheClear } from './_listCacheClear.js';
import { __require as require_listCacheDelete } from './_listCacheDelete.js';
import { __require as require_listCacheGet } from './_listCacheGet.js';
import { __require as require_listCacheHas } from './_listCacheHas.js';
import { __require as require_listCacheSet } from './_listCacheSet.js';
var _ListCache;
var hasRequired_ListCache;
function require_ListCache () {
if (hasRequired_ListCache) return _ListCache;
hasRequired_ListCache = 1;
var listCacheClear = require_listCacheClear(),
listCacheDelete = require_listCacheDelete(),
listCacheGet = require_listCacheGet(),
listCacheHas = require_listCacheHas(),
listCacheSet = require_listCacheSet();
/**
* Creates an list cache object.
*
* @private
* @constructor
* @param {Array} [entries] The key-value pairs to cache.
*/
function ListCache(entries) {
var index = -1,
length = entries == null ? 0 : entries.length;
this.clear();
while (++index < length) {
var entry = entries[index];
this.set(entry[0], entry[1]);
}
}
// Add methods to `ListCache`.
ListCache.prototype.clear = listCacheClear;
ListCache.prototype['delete'] = listCacheDelete;
ListCache.prototype.get = listCacheGet;
ListCache.prototype.has = listCacheHas;
ListCache.prototype.set = listCacheSet;
_ListCache = ListCache;
return _ListCache;
}
export { require_ListCache as __require };
//# sourceMappingURL=_ListCache.js.map