123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171
import _includes from './_includes';

function _Set() {  /* globals Set */  this._nativeSet = typeof Set === 'function' ? new Set() : null;  this._items = {};}
// until we figure out why jsdoc chokes on this// @param item The item to add to the Set// @returns {boolean} true if the item did not exist prior, otherwise false//_Set.prototype.add = function(item) {  return !hasOrAdd(item, true, this);};
//// @param item The item to check for existence in the Set// @returns {boolean} true if the item exists in the Set, otherwise false//_Set.prototype.has = function(item) {  return hasOrAdd(item, false, this);};
//// Combines the logic for checking whether an item is a member of the set and// for adding a new item to the set.//// @param item       The item to check or add to the Set instance.// @param shouldAdd  If true, the item will be added to the set if it doesn't//                   already exist.// @param set        The set instance to check or add to.// @return {boolean} true if the item already existed, otherwise false.//function hasOrAdd(item, shouldAdd, set) {  var type = typeof item;  var prevSize, newSize;  switch (type) {    case 'string':    case 'number':      // distinguish between +0 and -0      if (item === 0 && 1 / item === -Infinity) {        if (set._items['-0']) {          return true;        } else {          if (shouldAdd) {            set._items['-0'] = true;          }          return false;        }      }      // these types can all utilise the native Set      if (set._nativeSet !== null) {        if (shouldAdd) {          prevSize = set._nativeSet.size;          set._nativeSet.add(item);          newSize = set._nativeSet.size;          return newSize === prevSize;        } else {          return set._nativeSet.has(item);        }      } else {        if (!(type in set._items)) {          if (shouldAdd) {            set._items[type] = {};            set._items[type][item] = true;          }          return false;        } else if (item in set._items[type]) {          return true;        } else {          if (shouldAdd) {            set._items[type][item] = true;          }          return false;        }      }
    case 'boolean':      // set._items['boolean'] holds a two element array      // representing [ falseExists, trueExists ]      if (type in set._items) {        var bIdx = item ? 1 : 0;        if (set._items[type][bIdx]) {          return true;        } else {          if (shouldAdd) {            set._items[type][bIdx] = true;          }          return false;        }      } else {        if (shouldAdd) {          set._items[type] = item ? [false, true] : [true, false];        }        return false;      }
    case 'function':      // compare functions for reference equality      if (set._nativeSet !== null) {        if (shouldAdd) {          prevSize = set._nativeSet.size;          set._nativeSet.add(item);          newSize = set._nativeSet.size;          return newSize === prevSize;        } else {          return set._nativeSet.has(item);        }      } else {        if (!(type in set._items)) {          if (shouldAdd) {            set._items[type] = [item];          }          return false;        }        if (!_includes(item, set._items[type])) {          if (shouldAdd) {            set._items[type].push(item);          }          return false;        }        return true;      }
    case 'undefined':      if (set._items[type]) {        return true;      } else {        if (shouldAdd) {          set._items[type] = true;        }        return false;      }
    case 'object':      if (item === null) {        if (!set._items['null']) {          if (shouldAdd) {            set._items['null'] = true;          }          return false;        }        return true;      }    /* falls through */    default:      // reduce the search size of heterogeneous sets by creating buckets      // for each type.      type = Object.prototype.toString.call(item);      if (!(type in set._items)) {        if (shouldAdd) {          set._items[type] = [item];        }        return false;      }      // scan through all previously applied items      if (!_includes(item, set._items[type])) {        if (shouldAdd) {          set._items[type].push(item);        }        return false;      }      return true;  }}
// A simple Set type that honours R.equals semanticsexport default _Set;