@mui/x-data-grid 5.6.1 → 5.7.0

package/utils/cleanupTracking/TimerBasedCleanupTracking.d.ts

@@ -2,6 +2,8 @@
 import { CleanupTracking, UnregisterToken, UnsubscribeFn } from './CleanupTracking';
 export declare class TimerBasedCleanupTracking implements CleanupTracking {
     timeouts?: Map<number, NodeJS.Timeout> | undefined;
+    cleanupTimeout: number;
+    constructor(timeout?: number);
     register(object: any, unsubscribe: UnsubscribeFn, unregisterToken: UnregisterToken): void;
     unregister(unregisterToken: UnregisterToken): void;
     reset(): void;

package/utils/cleanupTracking/TimerBasedCleanupTracking.js

@@ -1,8 +1,10 @@
 // If no effect ran after this amount of time, we assume that the render was not committed by React
 const CLEANUP_TIMER_LOOP_MILLIS = 1000;
 export class TimerBasedCleanupTracking {
-  constructor() {
+  constructor(timeout = CLEANUP_TIMER_LOOP_MILLIS) {
     this.timeouts = new Map();
+    this.cleanupTimeout = CLEANUP_TIMER_LOOP_MILLIS;
+    this.cleanupTimeout = timeout;
   }
 
   register(object, unsubscribe, unregisterToken) {
@@ -16,7 +18,7 @@ export class TimerBasedCleanupTracking {
       }
 
       this.timeouts.delete(unregisterToken.cleanupToken);
-    }, CLEANUP_TIMER_LOOP_MILLIS);
+    }, this.cleanupTimeout);
     this.timeouts.set(unregisterToken.cleanupToken, timeout);
   }
 

package/utils/utils.d.ts

@@ -1,5 +1,3 @@
-import isDeepEqual from '../lib/lodash/isDeepEqual';
-export { isDeepEqual };
 export declare function isNumber(value: any): value is number;
 export declare function isFunction(value: any): value is Function;
 export declare function isObject(value: any): value is Record<string, any>;
@@ -10,3 +8,30 @@ export declare function escapeRegExp(value: string): string;
  * If min > max, then the min have priority
  */
 export declare const clamp: (value: number, min: number, max: number) => number;
+/**
+ * Based on `fast-deep-equal`
+ *
+ *  MIT License
+ *
+ * Copyright (c) 2017 Evgeny Poberezkin
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in all
+ * copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
+ * We only type the public interface to avoid dozens of `as` in the function.
+ */
+export declare function isDeepEqual<T>(actual: any, expected: T): actual is T;

package/utils/utils.js

@@ -1,5 +1,3 @@
-import isDeepEqual from '../lib/lodash/isDeepEqual';
-export { isDeepEqual };
 export function isNumber(value) {
   return typeof value === 'number';
 }
@@ -30,4 +28,153 @@ export function escapeRegExp(value) {
  * If min > max, then the min have priority
  */
 
-export const clamp = (value, min, max) => Math.max(min, Math.min(max, value));
+export const clamp = (value, min, max) => Math.max(min, Math.min(max, value));
+/**
+ * Based on `fast-deep-equal`
+ *
+ *  MIT License
+ *
+ * Copyright (c) 2017 Evgeny Poberezkin
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in all
+ * copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
+ * We only type the public interface to avoid dozens of `as` in the function.
+ */
+
+export function isDeepEqual(a, b) {
+  if (a === b) {
+    return true;
+  }
+
+  if (a && b && typeof a === 'object' && typeof b === 'object') {
+    if (a.constructor !== b.constructor) {
+      return false;
+    }
+
+    if (Array.isArray(a)) {
+      const length = a.length;
+
+      if (length !== b.length) {
+        return false;
+      }
+
+      for (let i = 0; i < length; i += 1) {
+        if (!isDeepEqual(a[i], b[i])) {
+          return false;
+        }
+      }
+
+      return true;
+    }
+
+    if (a instanceof Map && b instanceof Map) {
+      if (a.size !== b.size) {
+        return false;
+      }
+
+      const entriesA = Array.from(a.entries());
+
+      for (let i = 0; i < entriesA.length; i += 1) {
+        if (!b.has(entriesA[i][0])) {
+          return false;
+        }
+      }
+
+      for (let i = 0; i < entriesA.length; i += 1) {
+        const entryA = entriesA[i];
+
+        if (!isDeepEqual(entryA[1], b.get(entryA[0]))) {
+          return false;
+        }
+      }
+
+      return true;
+    }
+
+    if (a instanceof Set && b instanceof Set) {
+      if (a.size !== b.size) {
+        return false;
+      }
+
+      const entries = Array.from(a.entries());
+
+      for (let i = 0; i < entries.length; i += 1) {
+        if (!b.has(entries[i][0])) {
+          return false;
+        }
+      }
+
+      return true;
+    }
+
+    if (ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {
+      const length = a.length;
+
+      if (length !== b.length) {
+        return false;
+      }
+
+      for (let i = 0; i < length; i += 1) {
+        if (a[i] !== b[i]) {
+          return false;
+        }
+      }
+
+      return true;
+    }
+
+    if (a.constructor === RegExp) {
+      return a.source === b.source && a.flags === b.flags;
+    }
+
+    if (a.valueOf !== Object.prototype.valueOf) {
+      return a.valueOf() === b.valueOf();
+    }
+
+    if (a.toString !== Object.prototype.toString) {
+      return a.toString() === b.toString();
+    }
+
+    const keys = Object.keys(a);
+    const length = keys.length;
+
+    if (length !== Object.keys(b).length) {
+      return false;
+    }
+
+    for (let i = 0; i < length; i += 1) {
+      if (!Object.prototype.hasOwnProperty.call(b, keys[i])) {
+        return false;
+      }
+    }
+
+    for (let i = 0; i < length; i += 1) {
+      const key = keys[i];
+
+      if (!isDeepEqual(a[key], b[key])) {
+        return false;
+      }
+    }
+
+    return true;
+  } // true if both NaN, false otherwise
+  // eslint-disable-next-line no-self-compare
+
+
+  return a !== a && b !== b;
+}

package/hooks/core/rowGroupsPreProcessing/gridRowGroupsPreProcessingApi.d.ts

@@ -1,35 +0,0 @@
-import { GridRowTreeConfig, GridRowId, GridRowsLookup } from '../../../models/gridRows';
-export interface GridRowGroupParams {
-    ids: GridRowId[];
-    idRowsLookup: GridRowsLookup;
-    previousTree: GridRowTreeConfig | null;
-}
-export interface GridRowGroupingResult {
-    /**
-     * Name of the algorithm used to group the rows
-     * It is useful to decide which filtering / sorting algorithm to apply, to avoid applying tree-data filtering on a grouping-by-column dataset for instance.
-     */
-    groupingName: string;
-    tree: GridRowTreeConfig;
-    treeDepth: number;
-    ids: GridRowId[];
-    idRowsLookup: GridRowsLookup;
-}
-export declare type GridRowGroupingPreProcessing = (params: GridRowGroupParams) => GridRowGroupingResult | null;
-export interface GridRowGroupsPreProcessingApi {
-    /**
-     * Register a column pre-processing and emit an event to re-apply the row grouping pre-processing.
-     * @param {string} processingName Name of the pre-processing. Used to clean the previous version of the pre-processing.
-     * @param {GridRowGroupingPreProcessing} columnsPreProcessing Pre-processing to register.
-     * @ignore - do not document.
-     */
-    unstable_registerRowGroupsBuilder: (processingName: string, groupingFunction: GridRowGroupingPreProcessing | null) => void;
-    /**
-     * Apply the first row grouping pre-processing that does not return null.
-     * @param {GridRowsLookup} rowsLookup. Lookup of the rows to group.
-     * @param {GridRowId[]} List of the rows IDs.
-     * @returns {GridRowGroupingResult} The grouped rows.
-     * @ignore - do not document.
-     */
-    unstable_groupRows: (params: GridRowGroupParams) => GridRowGroupingResult;
-}

package/hooks/core/rowGroupsPreProcessing/index.d.ts

@@ -1,2 +0,0 @@
-export * from './useGridRowGroupsPreProcessing';
-export * from './gridRowGroupsPreProcessingApi';

package/hooks/core/rowGroupsPreProcessing/index.js

@@ -1,2 +0,0 @@
-export * from './useGridRowGroupsPreProcessing';
-export * from './gridRowGroupsPreProcessingApi';

package/hooks/core/rowGroupsPreProcessing/useGridRowGroupsPreProcessing.d.ts

@@ -1,3 +0,0 @@
-import * as React from 'react';
-import { GridApiCommunity } from '../../../models/api/gridApiCommunity';
-export declare const useGridRowGroupsPreProcessing: (apiRef: React.MutableRefObject<GridApiCommunity>) => void;

package/hooks/core/rowGroupsPreProcessing/useGridRowGroupsPreProcessing.js

@@ -1,72 +0,0 @@
-import * as React from 'react';
-import { GridEvents } from '../../../models/events';
-import { useGridApiMethod } from '../../utils/useGridApiMethod';
-
-const getFlatRowTree = ({
-  ids,
-  idRowsLookup,
-  previousTree
-}) => {
-  const tree = {};
-
-  for (let i = 0; i < ids.length; i += 1) {
-    const rowId = ids[i];
-
-    if (previousTree && previousTree[rowId]) {
-      tree[rowId] = previousTree[rowId];
-    } else {
-      tree[rowId] = {
-        id: rowId,
-        depth: 0,
-        parent: null,
-        groupingKey: '',
-        groupingField: null
-      };
-    }
-  }
-
-  return {
-    groupingName: 'none',
-    tree,
-    treeDepth: 1,
-    idRowsLookup,
-    ids
-  };
-};
-
-export const useGridRowGroupsPreProcessing = apiRef => {
-  const rowGroupsPreProcessingRef = React.useRef(new Map());
-  const registerRowGroupsBuilder = React.useCallback((processingName, rowGroupingPreProcessing) => {
-    var _rowGroupsPreProcessi;
-
-    const rowGroupingPreProcessingBefore = (_rowGroupsPreProcessi = rowGroupsPreProcessingRef.current.get(processingName)) != null ? _rowGroupsPreProcessi : null;
-
-    if (rowGroupingPreProcessingBefore !== rowGroupingPreProcessing) {
-      rowGroupsPreProcessingRef.current.set(processingName, rowGroupingPreProcessing);
-      apiRef.current.publishEvent(GridEvents.rowGroupsPreProcessingChange);
-    }
-  }, [apiRef]);
-  const groupRows = React.useCallback((...params) => {
-    let response = null;
-    const preProcessingList = Array.from(rowGroupsPreProcessingRef.current.values());
-
-    while (!response && preProcessingList.length) {
-      const preProcessing = preProcessingList.shift();
-
-      if (preProcessing) {
-        response = preProcessing(...params);
-      }
-    }
-
-    if (!response) {
-      return getFlatRowTree(...params);
-    }
-
-    return response;
-  }, []);
-  const rowGroupsPreProcessingApi = {
-    unstable_registerRowGroupsBuilder: registerRowGroupsBuilder,
-    unstable_groupRows: groupRows
-  };
-  useGridApiMethod(apiRef, rowGroupsPreProcessingApi, 'GridRowGroupsPreProcessing');
-};

package/hooks/features/filter/useGridRegisterFilteringMethod.d.ts

@@ -1,4 +0,0 @@
-import * as React from 'react';
-import { GridFilteringMethod } from './gridFilterState';
-import { GridApiCommon } from '../../../models';
-export declare const useGridRegisterFilteringMethod: <Api extends GridApiCommon>(apiRef: React.MutableRefObject<Api>, groupingName: string, filteringMethod: GridFilteringMethod) => void;

package/hooks/features/filter/useGridRegisterFilteringMethod.js

@@ -1,9 +0,0 @@
-import * as React from 'react';
-import { useGridRegisterPreProcessor } from '../../core/preProcessing';
-export const useGridRegisterFilteringMethod = (apiRef, groupingName, filteringMethod) => {
-  const updateRegistration = React.useCallback(filteringMethodCollection => {
-    filteringMethodCollection[groupingName] = filteringMethod;
-    return filteringMethodCollection;
-  }, [groupingName, filteringMethod]);
-  useGridRegisterPreProcessor(apiRef, 'filteringMethod', updateRegistration);
-};

package/hooks/features/sorting/useGridRegisterSortingMethod.d.ts

@@ -1,4 +0,0 @@
-import * as React from 'react';
-import { GridSortingMethod } from './gridSortingState';
-import { GridApiCommon } from '../../../models';
-export declare const useGridRegisterSortingMethod: <Api extends GridApiCommon>(apiRef: React.MutableRefObject<Api>, groupingName: string, filteringMethod: GridSortingMethod) => void;

package/hooks/features/sorting/useGridRegisterSortingMethod.js

@@ -1,9 +0,0 @@
-import * as React from 'react';
-import { useGridRegisterPreProcessor } from '../../core/preProcessing';
-export const useGridRegisterSortingMethod = (apiRef, groupingName, filteringMethod) => {
-  const updateRegistration = React.useCallback(sortingMethodCollection => {
-    sortingMethodCollection[groupingName] = filteringMethod;
-    return sortingMethodCollection;
-  }, [groupingName, filteringMethod]);
-  useGridRegisterPreProcessor(apiRef, 'sortingMethod', updateRegistration);
-};

package/legacy/hooks/core/rowGroupsPreProcessing/index.js

@@ -1,2 +0,0 @@
-export * from './useGridRowGroupsPreProcessing';
-export * from './gridRowGroupsPreProcessingApi';

package/legacy/hooks/core/rowGroupsPreProcessing/useGridRowGroupsPreProcessing.js

@@ -1,71 +0,0 @@
-import * as React from 'react';
-import { GridEvents } from '../../../models/events';
-import { useGridApiMethod } from '../../utils/useGridApiMethod';
-
-var getFlatRowTree = function getFlatRowTree(_ref) {
-  var ids = _ref.ids,
-      idRowsLookup = _ref.idRowsLookup,
-      previousTree = _ref.previousTree;
-  var tree = {};
-
-  for (var i = 0; i < ids.length; i += 1) {
-    var rowId = ids[i];
-
-    if (previousTree && previousTree[rowId]) {
-      tree[rowId] = previousTree[rowId];
-    } else {
-      tree[rowId] = {
-        id: rowId,
-        depth: 0,
-        parent: null,
-        groupingKey: '',
-        groupingField: null
-      };
-    }
-  }
-
-  return {
-    groupingName: 'none',
-    tree: tree,
-    treeDepth: 1,
-    idRowsLookup: idRowsLookup,
-    ids: ids
-  };
-};
-
-export var useGridRowGroupsPreProcessing = function useGridRowGroupsPreProcessing(apiRef) {
-  var rowGroupsPreProcessingRef = React.useRef(new Map());
-  var registerRowGroupsBuilder = React.useCallback(function (processingName, rowGroupingPreProcessing) {
-    var _rowGroupsPreProcessi;
-
-    var rowGroupingPreProcessingBefore = (_rowGroupsPreProcessi = rowGroupsPreProcessingRef.current.get(processingName)) != null ? _rowGroupsPreProcessi : null;
-
-    if (rowGroupingPreProcessingBefore !== rowGroupingPreProcessing) {
-      rowGroupsPreProcessingRef.current.set(processingName, rowGroupingPreProcessing);
-      apiRef.current.publishEvent(GridEvents.rowGroupsPreProcessingChange);
-    }
-  }, [apiRef]);
-  var groupRows = React.useCallback(function () {
-    var response = null;
-    var preProcessingList = Array.from(rowGroupsPreProcessingRef.current.values());
-
-    while (!response && preProcessingList.length) {
-      var preProcessing = preProcessingList.shift();
-
-      if (preProcessing) {
-        response = preProcessing.apply(void 0, arguments);
-      }
-    }
-
-    if (!response) {
-      return getFlatRowTree.apply(void 0, arguments);
-    }
-
-    return response;
-  }, []);
-  var rowGroupsPreProcessingApi = {
-    unstable_registerRowGroupsBuilder: registerRowGroupsBuilder,
-    unstable_groupRows: groupRows
-  };
-  useGridApiMethod(apiRef, rowGroupsPreProcessingApi, 'GridRowGroupsPreProcessing');
-};

package/legacy/hooks/features/filter/useGridRegisterFilteringMethod.js

@@ -1,9 +0,0 @@
-import * as React from 'react';
-import { useGridRegisterPreProcessor } from '../../core/preProcessing';
-export var useGridRegisterFilteringMethod = function useGridRegisterFilteringMethod(apiRef, groupingName, filteringMethod) {
-  var updateRegistration = React.useCallback(function (filteringMethodCollection) {
-    filteringMethodCollection[groupingName] = filteringMethod;
-    return filteringMethodCollection;
-  }, [groupingName, filteringMethod]);
-  useGridRegisterPreProcessor(apiRef, 'filteringMethod', updateRegistration);
-};

package/legacy/hooks/features/sorting/useGridRegisterSortingMethod.js

@@ -1,9 +0,0 @@
-import * as React from 'react';
-import { useGridRegisterPreProcessor } from '../../core/preProcessing';
-export var useGridRegisterSortingMethod = function useGridRegisterSortingMethod(apiRef, groupingName, filteringMethod) {
-  var updateRegistration = React.useCallback(function (sortingMethodCollection) {
-    sortingMethodCollection[groupingName] = filteringMethod;
-    return sortingMethodCollection;
-  }, [groupingName, filteringMethod]);
-  useGridRegisterPreProcessor(apiRef, 'sortingMethod', updateRegistration);
-};

package/legacy/lib/lodash/_DataView.js

@@ -1,8 +0,0 @@
-import getNative from './_getNative.js';
-import root from './_root.js';
-'use strict';
-/* Built-in method references that are verified to be native. */
-
-
-var DataView = getNative(root, 'DataView');
-export default DataView;

package/legacy/lib/lodash/_Hash.js

@@ -1,33 +0,0 @@
-import hashClear from './_hashClear.js';
-import hashDelete from './_hashDelete.js';
-import hashGet from './_hashGet.js';
-import hashHas from './_hashHas.js';
-import hashSet from './_hashSet.js';
-'use strict';
-/**
- * Creates a hash object.
- *
- * @private
- * @constructor
- * @param {Array} [entries] The key-value pairs to cache.
- */
-
-
-function Hash(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 `Hash`.
-
-
-Hash.prototype.clear = hashClear;
-Hash.prototype['delete'] = hashDelete;
-Hash.prototype.get = hashGet;
-Hash.prototype.has = hashHas;
-Hash.prototype.set = hashSet;
-export default Hash;

package/legacy/lib/lodash/_ListCache.js

@@ -1,33 +0,0 @@
-import listCacheClear from './_listCacheClear.js';
-import listCacheDelete from './_listCacheDelete.js';
-import listCacheGet from './_listCacheGet.js';
-import listCacheHas from './_listCacheHas.js';
-import listCacheSet from './_listCacheSet.js';
-'use strict';
-/**
- * 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;
-export default ListCache;

package/legacy/lib/lodash/_Map.js

@@ -1,8 +0,0 @@
-import getNative from './_getNative.js';
-import root from './_root.js';
-'use strict';
-/* Built-in method references that are verified to be native. */
-
-
-var Map = getNative(root, 'Map');
-export default Map;

package/legacy/lib/lodash/_MapCache.js

@@ -1,33 +0,0 @@
-import mapCacheClear from './_mapCacheClear.js';
-import mapCacheDelete from './_mapCacheDelete.js';
-import mapCacheGet from './_mapCacheGet.js';
-import mapCacheHas from './_mapCacheHas.js';
-import mapCacheSet from './_mapCacheSet.js';
-'use strict';
-/**
- * Creates a map cache object to store key-value pairs.
- *
- * @private
- * @constructor
- * @param {Array} [entries] The key-value pairs to cache.
- */
-
-
-function MapCache(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 `MapCache`.
-
-
-MapCache.prototype.clear = mapCacheClear;
-MapCache.prototype['delete'] = mapCacheDelete;
-MapCache.prototype.get = mapCacheGet;
-MapCache.prototype.has = mapCacheHas;
-MapCache.prototype.set = mapCacheSet;
-export default MapCache;

package/legacy/lib/lodash/_Promise.js

@@ -1,8 +0,0 @@
-import getNative from './_getNative.js';
-import root from './_root.js';
-'use strict';
-/* Built-in method references that are verified to be native. */
-
-
-var Promise = getNative(root, 'Promise');
-export default Promise;

package/legacy/lib/lodash/_Set.js

@@ -1,8 +0,0 @@
-import getNative from './_getNative.js';
-import root from './_root.js';
-'use strict';
-/* Built-in method references that are verified to be native. */
-
-
-var Set = getNative(root, 'Set');
-export default Set;

package/legacy/lib/lodash/_SetCache.js

@@ -1,28 +0,0 @@
-import MapCache from './_MapCache.js';
-import setCacheAdd from './_setCacheAdd.js';
-import setCacheHas from './_setCacheHas.js';
-'use strict';
-/**
- *
- * Creates an array cache object to store unique values.
- *
- * @private
- * @constructor
- * @param {Array} [values] The values to cache.
- */
-
-
-function SetCache(values) {
-  var index = -1,
-      length = values == null ? 0 : values.length;
-  this.__data__ = new MapCache();
-
-  while (++index < length) {
-    this.add(values[index]);
-  }
-} // Add methods to `SetCache`.
-
-
-SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;
-SetCache.prototype.has = setCacheHas;
-export default SetCache;