@revolist/revogrid 4.9.22 → 4.9.23
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/cjs/{app-globals-a6bcda2f.js → app-globals-c0b20747.js} +2 -2
- package/dist/cjs/{app-globals-a6bcda2f.js.map → app-globals-c0b20747.js.map} +1 -1
- package/dist/cjs/{column.drag.plugin-3644bda6.js → column.drag.plugin-eb1db875.js} +50 -55
- package/dist/cjs/column.drag.plugin-eb1db875.js.map +1 -0
- package/dist/cjs/{column.service-caec759a.js → column.service-6089b047.js} +10 -20
- package/dist/cjs/column.service-6089b047.js.map +1 -0
- package/dist/{esm/debounce-e8e9464a.js → cjs/debounce-ec7a04b4.js} +36 -78
- package/dist/cjs/debounce-ec7a04b4.js.map +1 -0
- package/dist/cjs/{edit.utils-18840bb3.js → edit.utils-093fe9cd.js} +2 -2
- package/dist/cjs/{edit.utils-18840bb3.js.map → edit.utils-093fe9cd.js.map} +1 -1
- package/dist/cjs/{filter.button-1e1e16be.js → filter.button-afb16244.js} +2 -2
- package/dist/cjs/{filter.button-1e1e16be.js.map → filter.button-afb16244.js.map} +1 -1
- package/dist/cjs/{header-cell-renderer-4fd62cec.js → header-cell-renderer-2d56e8f5.js} +3 -3
- package/dist/cjs/{header-cell-renderer-4fd62cec.js.map → header-cell-renderer-2d56e8f5.js.map} +1 -1
- package/dist/cjs/{index-34dfb0db.js → index-10d10c55.js} +14 -20
- package/dist/cjs/index-10d10c55.js.map +1 -0
- package/dist/cjs/{index-71b783e2.js → index-a9ee8eef.js} +290 -854
- package/dist/cjs/index-a9ee8eef.js.map +1 -0
- package/dist/cjs/index.cjs.js +11 -11
- package/dist/cjs/{key.utils-48b178d1.js → key.utils-1438f2ac.js} +2 -2
- package/dist/cjs/{key.utils-48b178d1.js.map → key.utils-1438f2ac.js.map} +1 -1
- package/dist/cjs/loader.cjs.js +2 -2
- package/dist/cjs/revo-grid.cjs.entry.js +43 -74
- package/dist/cjs/revo-grid.cjs.entry.js.map +1 -1
- package/dist/cjs/revo-grid.cjs.js +3 -3
- package/dist/cjs/revo-grid.cjs.js.map +1 -1
- package/dist/cjs/revogr-attribution_6.cjs.entry.js +10 -10
- package/dist/cjs/revogr-attribution_6.cjs.entry.js.map +1 -1
- package/dist/cjs/revogr-clipboard_3.cjs.entry.js +7 -7
- package/dist/cjs/revogr-clipboard_3.cjs.entry.js.map +1 -1
- package/dist/cjs/revogr-data_4.cjs.entry.js +24 -47
- package/dist/cjs/revogr-data_4.cjs.entry.js.map +1 -1
- package/dist/cjs/revogr-filter-panel.cjs.entry.js +4 -4
- package/dist/cjs/revogr-filter-panel.cjs.entry.js.map +1 -1
- package/dist/cjs/{row-header-utils-baf917a2.js → row-header-utils-eb5949b3.js} +7 -9
- package/dist/cjs/row-header-utils-eb5949b3.js.map +1 -0
- package/dist/cjs/{sorting.sign-54938069.js → sorting.sign-8bf92449.js} +2 -2
- package/dist/cjs/{sorting.sign-54938069.js.map → sorting.sign-8bf92449.js.map} +1 -1
- package/dist/cjs/{text-editor-bdc757b1.js → text-editor-ea3badef.js} +3 -3
- package/dist/cjs/{text-editor-bdc757b1.js.map → text-editor-ea3badef.js.map} +1 -1
- package/dist/cjs/{throttle-b5d436ca.js → throttle-6fecba1e.js} +6 -11
- package/dist/cjs/throttle-6fecba1e.js.map +1 -0
- package/dist/collection/collection-manifest.json +1 -1
- package/dist/collection/components/revoGrid/revo-grid.js +9 -13
- package/dist/collection/components/revoGrid/revo-grid.js.map +1 -1
- package/dist/collection/services/dimension.provider.js +4 -3
- package/dist/collection/services/dimension.provider.js.map +1 -1
- package/dist/collection/store/dimension/dimension.store.js +19 -6
- package/dist/collection/store/dimension/dimension.store.js.map +1 -1
- package/dist/collection/store/vp/viewport.store.js +5 -7
- package/dist/collection/store/vp/viewport.store.js.map +1 -1
- package/dist/esm/{app-globals-43714036.js → app-globals-3a760941.js} +2 -2
- package/dist/esm/{app-globals-43714036.js.map → app-globals-3a760941.js.map} +1 -1
- package/dist/esm/{column.drag.plugin-49737eae.js → column.drag.plugin-cb25a5e1.js} +47 -52
- package/dist/esm/column.drag.plugin-cb25a5e1.js.map +1 -0
- package/dist/esm/{column.service-dc98409c.js → column.service-407956dd.js} +7 -17
- package/dist/esm/column.service-407956dd.js.map +1 -0
- package/dist/{cjs/debounce-cb5f4e35.js → esm/debounce-7b511afc.js} +26 -88
- package/dist/esm/debounce-7b511afc.js.map +1 -0
- package/dist/esm/{edit.utils-177d6b9e.js → edit.utils-1eeabeab.js} +2 -2
- package/dist/esm/{edit.utils-177d6b9e.js.map → edit.utils-1eeabeab.js.map} +1 -1
- package/dist/esm/{filter.button-91088160.js → filter.button-37373672.js} +2 -2
- package/dist/esm/{filter.button-91088160.js.map → filter.button-37373672.js.map} +1 -1
- package/dist/esm/{header-cell-renderer-07c6f845.js → header-cell-renderer-da468bd2.js} +3 -3
- package/dist/esm/{header-cell-renderer-07c6f845.js.map → header-cell-renderer-da468bd2.js.map} +1 -1
- package/dist/esm/{index-70354f39.js → index-a61f225b.js} +14 -20
- package/dist/esm/index-a61f225b.js.map +1 -0
- package/dist/esm/{index-29a9a87a.js → index-b6586f9b.js} +270 -834
- package/dist/esm/index-b6586f9b.js.map +1 -0
- package/dist/esm/index.js +11 -11
- package/dist/esm/{key.utils-0bbb3bc6.js → key.utils-562c749e.js} +2 -2
- package/dist/esm/{key.utils-0bbb3bc6.js.map → key.utils-562c749e.js.map} +1 -1
- package/dist/esm/loader.js +3 -3
- package/dist/esm/revo-grid.entry.js +39 -70
- package/dist/esm/revo-grid.entry.js.map +1 -1
- package/dist/esm/revo-grid.js +4 -4
- package/dist/esm/revo-grid.js.map +1 -1
- package/dist/esm/revogr-attribution_6.entry.js +10 -10
- package/dist/esm/revogr-attribution_6.entry.js.map +1 -1
- package/dist/esm/revogr-clipboard_3.entry.js +7 -7
- package/dist/esm/revogr-clipboard_3.entry.js.map +1 -1
- package/dist/esm/revogr-data_4.entry.js +20 -43
- package/dist/esm/revogr-data_4.entry.js.map +1 -1
- package/dist/esm/revogr-filter-panel.entry.js +4 -4
- package/dist/esm/revogr-filter-panel.entry.js.map +1 -1
- package/dist/esm/{row-header-utils-32049c13.js → row-header-utils-e043f744.js} +7 -9
- package/dist/esm/row-header-utils-e043f744.js.map +1 -0
- package/dist/esm/{sorting.sign-569a1f3c.js → sorting.sign-1afddea1.js} +2 -2
- package/dist/esm/{sorting.sign-569a1f3c.js.map → sorting.sign-1afddea1.js.map} +1 -1
- package/dist/esm/{text-editor-b1bb2bd3.js → text-editor-654f5d53.js} +3 -3
- package/dist/esm/{text-editor-b1bb2bd3.js.map → text-editor-654f5d53.js.map} +1 -1
- package/dist/esm/{throttle-c6f34cc0.js → throttle-bb3169c7.js} +4 -9
- package/dist/esm/throttle-bb3169c7.js.map +1 -0
- package/dist/revo-grid/app-globals-3a760941.js +5 -0
- package/dist/revo-grid/column.drag.plugin-cb25a5e1.js +5 -0
- package/dist/revo-grid/column.drag.plugin-cb25a5e1.js.map +1 -0
- package/dist/revo-grid/column.service-407956dd.js +5 -0
- package/dist/revo-grid/column.service-407956dd.js.map +1 -0
- package/dist/revo-grid/debounce-7b511afc.js +5 -0
- package/dist/revo-grid/debounce-7b511afc.js.map +1 -0
- package/dist/revo-grid/{edit.utils-177d6b9e.js → edit.utils-1eeabeab.js} +2 -2
- package/dist/revo-grid/{filter.button-91088160.js → filter.button-37373672.js} +2 -2
- package/dist/revo-grid/{header-cell-renderer-07c6f845.js → header-cell-renderer-da468bd2.js} +2 -2
- package/dist/revo-grid/index-a61f225b.js +6 -0
- package/dist/revo-grid/index-a61f225b.js.map +1 -0
- package/dist/revo-grid/index-b6586f9b.js +5 -0
- package/dist/revo-grid/index-b6586f9b.js.map +1 -0
- package/dist/revo-grid/index.esm.js +1 -1
- package/dist/revo-grid/{key.utils-0bbb3bc6.js → key.utils-562c749e.js} +2 -2
- package/dist/revo-grid/revo-grid.entry.js +1 -1
- package/dist/revo-grid/revo-grid.entry.js.map +1 -1
- package/dist/revo-grid/revo-grid.esm.js +1 -1
- package/dist/revo-grid/revo-grid.esm.js.map +1 -1
- package/dist/revo-grid/revogr-attribution_6.entry.js +1 -1
- package/dist/revo-grid/revogr-clipboard_3.entry.js +1 -1
- package/dist/revo-grid/revogr-data_4.entry.js +1 -1
- package/dist/revo-grid/revogr-data_4.entry.js.map +1 -1
- package/dist/revo-grid/revogr-filter-panel.entry.js +1 -1
- package/dist/revo-grid/row-header-utils-e043f744.js +5 -0
- package/dist/revo-grid/row-header-utils-e043f744.js.map +1 -0
- package/dist/revo-grid/{sorting.sign-569a1f3c.js → sorting.sign-1afddea1.js} +2 -2
- package/dist/revo-grid/{text-editor-b1bb2bd3.js → text-editor-654f5d53.js} +2 -2
- package/dist/revo-grid/throttle-bb3169c7.js +5 -0
- package/dist/revo-grid/throttle-bb3169c7.js.map +1 -0
- package/dist/types/store/dimension/dimension.store.d.ts +2 -1
- package/dist/types/store/vp/viewport.store.d.ts +0 -1
- package/hydrate/index.d.ts +4 -4
- package/hydrate/index.js +426 -1128
- package/hydrate/index.mjs +426 -1128
- package/package.json +3 -3
- package/standalone/column.service.js +5 -16
- package/standalone/column.service.js.map +1 -1
- package/standalone/debounce.js +7 -16
- package/standalone/debounce.js.map +1 -1
- package/standalone/dimension.helpers.js +15 -45
- package/standalone/dimension.helpers.js.map +1 -1
- package/standalone/index.js +0 -2
- package/standalone/index.js.map +1 -1
- package/standalone/index2.js +0 -2
- package/standalone/index2.js.map +1 -1
- package/standalone/reduce.js +1319 -474
- package/standalone/reduce.js.map +1 -1
- package/standalone/revo-grid.js +74 -111
- package/standalone/revo-grid.js.map +1 -1
- package/standalone/revogr-data2.js +0 -2
- package/standalone/revogr-data2.js.map +1 -1
- package/standalone/revogr-filter-panel.js +2 -2
- package/standalone/revogr-filter-panel.js.map +1 -1
- package/standalone/revogr-focus2.js +0 -2
- package/standalone/revogr-focus2.js.map +1 -1
- package/standalone/revogr-header2.js +12 -37
- package/standalone/revogr-header2.js.map +1 -1
- package/standalone/revogr-order-editor2.js +2 -4
- package/standalone/revogr-order-editor2.js.map +1 -1
- package/standalone/revogr-overlay-selection2.js +2 -4
- package/standalone/revogr-overlay-selection2.js.map +1 -1
- package/standalone/revogr-row-headers2.js +5 -9
- package/standalone/revogr-row-headers2.js.map +1 -1
- package/standalone/revogr-temp-range2.js +2 -2
- package/standalone/revogr-temp-range2.js.map +1 -1
- package/standalone/revogr-viewport-scroll2.js +2 -2
- package/standalone/revogr-viewport-scroll2.js.map +1 -1
- package/standalone/selection.utils.js +0 -2
- package/standalone/selection.utils.js.map +1 -1
- package/standalone/throttle.js +3 -8
- package/standalone/throttle.js.map +1 -1
- package/standalone/toNumber.js +165 -22
- package/standalone/toNumber.js.map +1 -1
- package/dist/cjs/column.drag.plugin-3644bda6.js.map +0 -1
- package/dist/cjs/column.service-caec759a.js.map +0 -1
- package/dist/cjs/debounce-cb5f4e35.js.map +0 -1
- package/dist/cjs/index-34dfb0db.js.map +0 -1
- package/dist/cjs/index-71b783e2.js.map +0 -1
- package/dist/cjs/row-header-utils-baf917a2.js.map +0 -1
- package/dist/cjs/throttle-b5d436ca.js.map +0 -1
- package/dist/esm/column.drag.plugin-49737eae.js.map +0 -1
- package/dist/esm/column.service-dc98409c.js.map +0 -1
- package/dist/esm/debounce-e8e9464a.js.map +0 -1
- package/dist/esm/index-29a9a87a.js.map +0 -1
- package/dist/esm/index-70354f39.js.map +0 -1
- package/dist/esm/row-header-utils-32049c13.js.map +0 -1
- package/dist/esm/throttle-c6f34cc0.js.map +0 -1
- package/dist/revo-grid/app-globals-43714036.js +0 -5
- package/dist/revo-grid/column.drag.plugin-49737eae.js +0 -5
- package/dist/revo-grid/column.drag.plugin-49737eae.js.map +0 -1
- package/dist/revo-grid/column.service-dc98409c.js +0 -5
- package/dist/revo-grid/column.service-dc98409c.js.map +0 -1
- package/dist/revo-grid/debounce-e8e9464a.js +0 -5
- package/dist/revo-grid/debounce-e8e9464a.js.map +0 -1
- package/dist/revo-grid/index-29a9a87a.js +0 -5
- package/dist/revo-grid/index-29a9a87a.js.map +0 -1
- package/dist/revo-grid/index-70354f39.js +0 -6
- package/dist/revo-grid/index-70354f39.js.map +0 -1
- package/dist/revo-grid/row-header-utils-32049c13.js +0 -5
- package/dist/revo-grid/row-header-utils-32049c13.js.map +0 -1
- package/dist/revo-grid/throttle-c6f34cc0.js +0 -5
- package/dist/revo-grid/throttle-c6f34cc0.js.map +0 -1
- package/standalone/_stringToPath.js +0 -1389
- package/standalone/_stringToPath.js.map +0 -1
- package/standalone/isObjectLike.js +0 -195
- package/standalone/isObjectLike.js.map +0 -1
- /package/dist/revo-grid/{app-globals-43714036.js.map → app-globals-3a760941.js.map} +0 -0
- /package/dist/revo-grid/{edit.utils-177d6b9e.js.map → edit.utils-1eeabeab.js.map} +0 -0
- /package/dist/revo-grid/{filter.button-91088160.js.map → filter.button-37373672.js.map} +0 -0
- /package/dist/revo-grid/{header-cell-renderer-07c6f845.js.map → header-cell-renderer-da468bd2.js.map} +0 -0
- /package/dist/revo-grid/{key.utils-0bbb3bc6.js.map → key.utils-562c749e.js.map} +0 -0
- /package/dist/revo-grid/{sorting.sign-569a1f3c.js.map → sorting.sign-1afddea1.js.map} +0 -0
- /package/dist/revo-grid/{text-editor-b1bb2bd3.js.map → text-editor-654f5d53.js.map} +0 -0
|
@@ -1,8 +1,8 @@
|
|
|
1
1
|
/*!
|
|
2
2
|
* Built by Revolist OU ❤️
|
|
3
3
|
*/
|
|
4
|
-
import {
|
|
5
|
-
import { g as getRenderingRef, f as forceUpdate } from './index-
|
|
4
|
+
import { i as isObject, b as baseGetTag, r as root, S as Symbol, a as isObjectLike, f as freeGlobal, c as isSymbol, t as toNumber } from './debounce-7b511afc.js';
|
|
5
|
+
import { g as getRenderingRef, f as forceUpdate } from './index-a61f225b.js';
|
|
6
6
|
|
|
7
7
|
/**
|
|
8
8
|
* All items
|
|
@@ -50,8 +50,7 @@ function isProxy(k) {
|
|
|
50
50
|
* @param {boolean} [fromRight] Specify iterating from right to left.
|
|
51
51
|
* @returns {number} Returns the index of the matched value, else `-1`.
|
|
52
52
|
*/
|
|
53
|
-
|
|
54
|
-
function baseFindIndex$1(array, predicate, fromIndex, fromRight) {
|
|
53
|
+
function baseFindIndex(array, predicate, fromIndex, fromRight) {
|
|
55
54
|
var length = array.length,
|
|
56
55
|
index = fromIndex + (fromRight ? 1 : -1);
|
|
57
56
|
|
|
@@ -63,8 +62,6 @@ function baseFindIndex$1(array, predicate, fromIndex, fromRight) {
|
|
|
63
62
|
return -1;
|
|
64
63
|
}
|
|
65
64
|
|
|
66
|
-
var _baseFindIndex = baseFindIndex$1;
|
|
67
|
-
|
|
68
65
|
/**
|
|
69
66
|
* Removes all key-value entries from the list cache.
|
|
70
67
|
*
|
|
@@ -72,14 +69,11 @@ var _baseFindIndex = baseFindIndex$1;
|
|
|
72
69
|
* @name clear
|
|
73
70
|
* @memberOf ListCache
|
|
74
71
|
*/
|
|
75
|
-
|
|
76
|
-
function listCacheClear$1() {
|
|
72
|
+
function listCacheClear() {
|
|
77
73
|
this.__data__ = [];
|
|
78
74
|
this.size = 0;
|
|
79
75
|
}
|
|
80
76
|
|
|
81
|
-
var _listCacheClear = listCacheClear$1;
|
|
82
|
-
|
|
83
77
|
/**
|
|
84
78
|
* Performs a
|
|
85
79
|
* [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
|
|
@@ -112,15 +106,10 @@ var _listCacheClear = listCacheClear$1;
|
|
|
112
106
|
* _.eq(NaN, NaN);
|
|
113
107
|
* // => true
|
|
114
108
|
*/
|
|
115
|
-
|
|
116
|
-
function eq$3(value, other) {
|
|
109
|
+
function eq(value, other) {
|
|
117
110
|
return value === other || (value !== value && other !== other);
|
|
118
111
|
}
|
|
119
112
|
|
|
120
|
-
var eq_1 = eq$3;
|
|
121
|
-
|
|
122
|
-
var eq$2 = eq_1;
|
|
123
|
-
|
|
124
113
|
/**
|
|
125
114
|
* Gets the index at which the `key` is found in `array` of key-value pairs.
|
|
126
115
|
*
|
|
@@ -129,20 +118,16 @@ var eq$2 = eq_1;
|
|
|
129
118
|
* @param {*} key The key to search for.
|
|
130
119
|
* @returns {number} Returns the index of the matched value, else `-1`.
|
|
131
120
|
*/
|
|
132
|
-
function assocIndexOf
|
|
121
|
+
function assocIndexOf(array, key) {
|
|
133
122
|
var length = array.length;
|
|
134
123
|
while (length--) {
|
|
135
|
-
if (eq
|
|
124
|
+
if (eq(array[length][0], key)) {
|
|
136
125
|
return length;
|
|
137
126
|
}
|
|
138
127
|
}
|
|
139
128
|
return -1;
|
|
140
129
|
}
|
|
141
130
|
|
|
142
|
-
var _assocIndexOf = assocIndexOf$4;
|
|
143
|
-
|
|
144
|
-
var assocIndexOf$3 = _assocIndexOf;
|
|
145
|
-
|
|
146
131
|
/** Used for built-in method references. */
|
|
147
132
|
var arrayProto = Array.prototype;
|
|
148
133
|
|
|
@@ -158,9 +143,9 @@ var splice = arrayProto.splice;
|
|
|
158
143
|
* @param {string} key The key of the value to remove.
|
|
159
144
|
* @returns {boolean} Returns `true` if the entry was removed, else `false`.
|
|
160
145
|
*/
|
|
161
|
-
function listCacheDelete
|
|
146
|
+
function listCacheDelete(key) {
|
|
162
147
|
var data = this.__data__,
|
|
163
|
-
index = assocIndexOf
|
|
148
|
+
index = assocIndexOf(data, key);
|
|
164
149
|
|
|
165
150
|
if (index < 0) {
|
|
166
151
|
return false;
|
|
@@ -175,10 +160,6 @@ function listCacheDelete$1(key) {
|
|
|
175
160
|
return true;
|
|
176
161
|
}
|
|
177
162
|
|
|
178
|
-
var _listCacheDelete = listCacheDelete$1;
|
|
179
|
-
|
|
180
|
-
var assocIndexOf$2 = _assocIndexOf;
|
|
181
|
-
|
|
182
163
|
/**
|
|
183
164
|
* Gets the list cache value for `key`.
|
|
184
165
|
*
|
|
@@ -188,17 +169,13 @@ var assocIndexOf$2 = _assocIndexOf;
|
|
|
188
169
|
* @param {string} key The key of the value to get.
|
|
189
170
|
* @returns {*} Returns the entry value.
|
|
190
171
|
*/
|
|
191
|
-
function listCacheGet
|
|
172
|
+
function listCacheGet(key) {
|
|
192
173
|
var data = this.__data__,
|
|
193
|
-
index = assocIndexOf
|
|
174
|
+
index = assocIndexOf(data, key);
|
|
194
175
|
|
|
195
176
|
return index < 0 ? undefined : data[index][1];
|
|
196
177
|
}
|
|
197
178
|
|
|
198
|
-
var _listCacheGet = listCacheGet$1;
|
|
199
|
-
|
|
200
|
-
var assocIndexOf$1 = _assocIndexOf;
|
|
201
|
-
|
|
202
179
|
/**
|
|
203
180
|
* Checks if a list cache value for `key` exists.
|
|
204
181
|
*
|
|
@@ -208,14 +185,10 @@ var assocIndexOf$1 = _assocIndexOf;
|
|
|
208
185
|
* @param {string} key The key of the entry to check.
|
|
209
186
|
* @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
|
|
210
187
|
*/
|
|
211
|
-
function listCacheHas
|
|
212
|
-
return assocIndexOf
|
|
188
|
+
function listCacheHas(key) {
|
|
189
|
+
return assocIndexOf(this.__data__, key) > -1;
|
|
213
190
|
}
|
|
214
191
|
|
|
215
|
-
var _listCacheHas = listCacheHas$1;
|
|
216
|
-
|
|
217
|
-
var assocIndexOf = _assocIndexOf;
|
|
218
|
-
|
|
219
192
|
/**
|
|
220
193
|
* Sets the list cache `key` to `value`.
|
|
221
194
|
*
|
|
@@ -226,7 +199,7 @@ var assocIndexOf = _assocIndexOf;
|
|
|
226
199
|
* @param {*} value The value to set.
|
|
227
200
|
* @returns {Object} Returns the list cache instance.
|
|
228
201
|
*/
|
|
229
|
-
function listCacheSet
|
|
202
|
+
function listCacheSet(key, value) {
|
|
230
203
|
var data = this.__data__,
|
|
231
204
|
index = assocIndexOf(data, key);
|
|
232
205
|
|
|
@@ -239,14 +212,6 @@ function listCacheSet$1(key, value) {
|
|
|
239
212
|
return this;
|
|
240
213
|
}
|
|
241
214
|
|
|
242
|
-
var _listCacheSet = listCacheSet$1;
|
|
243
|
-
|
|
244
|
-
var listCacheClear = _listCacheClear,
|
|
245
|
-
listCacheDelete = _listCacheDelete,
|
|
246
|
-
listCacheGet = _listCacheGet,
|
|
247
|
-
listCacheHas = _listCacheHas,
|
|
248
|
-
listCacheSet = _listCacheSet;
|
|
249
|
-
|
|
250
215
|
/**
|
|
251
216
|
* Creates an list cache object.
|
|
252
217
|
*
|
|
@@ -254,7 +219,7 @@ var listCacheClear = _listCacheClear,
|
|
|
254
219
|
* @constructor
|
|
255
220
|
* @param {Array} [entries] The key-value pairs to cache.
|
|
256
221
|
*/
|
|
257
|
-
function ListCache
|
|
222
|
+
function ListCache(entries) {
|
|
258
223
|
var index = -1,
|
|
259
224
|
length = entries == null ? 0 : entries.length;
|
|
260
225
|
|
|
@@ -266,15 +231,11 @@ function ListCache$4(entries) {
|
|
|
266
231
|
}
|
|
267
232
|
|
|
268
233
|
// Add methods to `ListCache`.
|
|
269
|
-
ListCache
|
|
270
|
-
ListCache
|
|
271
|
-
ListCache
|
|
272
|
-
ListCache
|
|
273
|
-
ListCache
|
|
274
|
-
|
|
275
|
-
var _ListCache = ListCache$4;
|
|
276
|
-
|
|
277
|
-
var ListCache$3 = _ListCache;
|
|
234
|
+
ListCache.prototype.clear = listCacheClear;
|
|
235
|
+
ListCache.prototype['delete'] = listCacheDelete;
|
|
236
|
+
ListCache.prototype.get = listCacheGet;
|
|
237
|
+
ListCache.prototype.has = listCacheHas;
|
|
238
|
+
ListCache.prototype.set = listCacheSet;
|
|
278
239
|
|
|
279
240
|
/**
|
|
280
241
|
* Removes all key-value entries from the stack.
|
|
@@ -283,13 +244,11 @@ var ListCache$3 = _ListCache;
|
|
|
283
244
|
* @name clear
|
|
284
245
|
* @memberOf Stack
|
|
285
246
|
*/
|
|
286
|
-
function stackClear
|
|
287
|
-
this.__data__ = new ListCache
|
|
247
|
+
function stackClear() {
|
|
248
|
+
this.__data__ = new ListCache;
|
|
288
249
|
this.size = 0;
|
|
289
250
|
}
|
|
290
251
|
|
|
291
|
-
var _stackClear = stackClear$1;
|
|
292
|
-
|
|
293
252
|
/**
|
|
294
253
|
* Removes `key` and its value from the stack.
|
|
295
254
|
*
|
|
@@ -299,8 +258,7 @@ var _stackClear = stackClear$1;
|
|
|
299
258
|
* @param {string} key The key of the value to remove.
|
|
300
259
|
* @returns {boolean} Returns `true` if the entry was removed, else `false`.
|
|
301
260
|
*/
|
|
302
|
-
|
|
303
|
-
function stackDelete$1(key) {
|
|
261
|
+
function stackDelete(key) {
|
|
304
262
|
var data = this.__data__,
|
|
305
263
|
result = data['delete'](key);
|
|
306
264
|
|
|
@@ -308,8 +266,6 @@ function stackDelete$1(key) {
|
|
|
308
266
|
return result;
|
|
309
267
|
}
|
|
310
268
|
|
|
311
|
-
var _stackDelete = stackDelete$1;
|
|
312
|
-
|
|
313
269
|
/**
|
|
314
270
|
* Gets the stack value for `key`.
|
|
315
271
|
*
|
|
@@ -319,13 +275,10 @@ var _stackDelete = stackDelete$1;
|
|
|
319
275
|
* @param {string} key The key of the value to get.
|
|
320
276
|
* @returns {*} Returns the entry value.
|
|
321
277
|
*/
|
|
322
|
-
|
|
323
|
-
function stackGet$1(key) {
|
|
278
|
+
function stackGet(key) {
|
|
324
279
|
return this.__data__.get(key);
|
|
325
280
|
}
|
|
326
281
|
|
|
327
|
-
var _stackGet = stackGet$1;
|
|
328
|
-
|
|
329
282
|
/**
|
|
330
283
|
* Checks if a stack value for `key` exists.
|
|
331
284
|
*
|
|
@@ -335,16 +288,10 @@ var _stackGet = stackGet$1;
|
|
|
335
288
|
* @param {string} key The key of the entry to check.
|
|
336
289
|
* @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
|
|
337
290
|
*/
|
|
338
|
-
|
|
339
|
-
function stackHas$1(key) {
|
|
291
|
+
function stackHas(key) {
|
|
340
292
|
return this.__data__.has(key);
|
|
341
293
|
}
|
|
342
294
|
|
|
343
|
-
var _stackHas = stackHas$1;
|
|
344
|
-
|
|
345
|
-
var baseGetTag$3 = _baseGetTag,
|
|
346
|
-
isObject$3 = isObject_1;
|
|
347
|
-
|
|
348
295
|
/** `Object#toString` result references. */
|
|
349
296
|
var asyncTag = '[object AsyncFunction]',
|
|
350
297
|
funcTag$1 = '[object Function]',
|
|
@@ -368,30 +315,24 @@ var asyncTag = '[object AsyncFunction]',
|
|
|
368
315
|
* _.isFunction(/abc/);
|
|
369
316
|
* // => false
|
|
370
317
|
*/
|
|
371
|
-
function isFunction
|
|
372
|
-
if (!isObject
|
|
318
|
+
function isFunction(value) {
|
|
319
|
+
if (!isObject(value)) {
|
|
373
320
|
return false;
|
|
374
321
|
}
|
|
375
322
|
// The use of `Object#toString` avoids issues with the `typeof` operator
|
|
376
323
|
// in Safari 9 which returns 'object' for typed arrays and other constructors.
|
|
377
|
-
var tag = baseGetTag
|
|
324
|
+
var tag = baseGetTag(value);
|
|
378
325
|
return tag == funcTag$1 || tag == genTag || tag == asyncTag || tag == proxyTag;
|
|
379
326
|
}
|
|
380
327
|
|
|
381
|
-
var isFunction_1 = isFunction$2;
|
|
382
|
-
|
|
383
|
-
var root$6 = _root;
|
|
384
|
-
|
|
385
328
|
/** Used to detect overreaching core-js shims. */
|
|
386
|
-
var coreJsData
|
|
329
|
+
var coreJsData = root['__core-js_shared__'];
|
|
387
330
|
|
|
388
|
-
|
|
389
|
-
|
|
390
|
-
var coreJsData = _coreJsData;
|
|
331
|
+
const coreJsData$1 = coreJsData;
|
|
391
332
|
|
|
392
333
|
/** Used to detect methods masquerading as native. */
|
|
393
334
|
var maskSrcKey = (function() {
|
|
394
|
-
var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');
|
|
335
|
+
var uid = /[^.]+$/.exec(coreJsData$1 && coreJsData$1.keys && coreJsData$1.keys.IE_PROTO || '');
|
|
395
336
|
return uid ? ('Symbol(src)_1.' + uid) : '';
|
|
396
337
|
}());
|
|
397
338
|
|
|
@@ -402,14 +343,11 @@ var maskSrcKey = (function() {
|
|
|
402
343
|
* @param {Function} func The function to check.
|
|
403
344
|
* @returns {boolean} Returns `true` if `func` is masked, else `false`.
|
|
404
345
|
*/
|
|
405
|
-
function isMasked
|
|
346
|
+
function isMasked(func) {
|
|
406
347
|
return !!maskSrcKey && (maskSrcKey in func);
|
|
407
348
|
}
|
|
408
349
|
|
|
409
|
-
var _isMasked = isMasked$1;
|
|
410
|
-
|
|
411
350
|
/** Used for built-in method references. */
|
|
412
|
-
|
|
413
351
|
var funcProto$1 = Function.prototype;
|
|
414
352
|
|
|
415
353
|
/** Used to resolve the decompiled source of functions. */
|
|
@@ -422,7 +360,7 @@ var funcToString$1 = funcProto$1.toString;
|
|
|
422
360
|
* @param {Function} func The function to convert.
|
|
423
361
|
* @returns {string} Returns the source code.
|
|
424
362
|
*/
|
|
425
|
-
function toSource
|
|
363
|
+
function toSource(func) {
|
|
426
364
|
if (func != null) {
|
|
427
365
|
try {
|
|
428
366
|
return funcToString$1.call(func);
|
|
@@ -434,13 +372,6 @@ function toSource$2(func) {
|
|
|
434
372
|
return '';
|
|
435
373
|
}
|
|
436
374
|
|
|
437
|
-
var _toSource = toSource$2;
|
|
438
|
-
|
|
439
|
-
var isFunction$1 = isFunction_1,
|
|
440
|
-
isMasked = _isMasked,
|
|
441
|
-
isObject$2 = isObject_1,
|
|
442
|
-
toSource$1 = _toSource;
|
|
443
|
-
|
|
444
375
|
/**
|
|
445
376
|
* Used to match `RegExp`
|
|
446
377
|
* [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).
|
|
@@ -474,16 +405,14 @@ var reIsNative = RegExp('^' +
|
|
|
474
405
|
* @returns {boolean} Returns `true` if `value` is a native function,
|
|
475
406
|
* else `false`.
|
|
476
407
|
*/
|
|
477
|
-
function baseIsNative
|
|
478
|
-
if (!isObject
|
|
408
|
+
function baseIsNative(value) {
|
|
409
|
+
if (!isObject(value) || isMasked(value)) {
|
|
479
410
|
return false;
|
|
480
411
|
}
|
|
481
|
-
var pattern = isFunction
|
|
482
|
-
return pattern.test(toSource
|
|
412
|
+
var pattern = isFunction(value) ? reIsNative : reIsHostCtor;
|
|
413
|
+
return pattern.test(toSource(value));
|
|
483
414
|
}
|
|
484
415
|
|
|
485
|
-
var _baseIsNative = baseIsNative$1;
|
|
486
|
-
|
|
487
416
|
/**
|
|
488
417
|
* Gets the value at `key` of `object`.
|
|
489
418
|
*
|
|
@@ -492,16 +421,10 @@ var _baseIsNative = baseIsNative$1;
|
|
|
492
421
|
* @param {string} key The key of the property to get.
|
|
493
422
|
* @returns {*} Returns the property value.
|
|
494
423
|
*/
|
|
495
|
-
|
|
496
|
-
function getValue$1(object, key) {
|
|
424
|
+
function getValue(object, key) {
|
|
497
425
|
return object == null ? undefined : object[key];
|
|
498
426
|
}
|
|
499
427
|
|
|
500
|
-
var _getValue = getValue$1;
|
|
501
|
-
|
|
502
|
-
var baseIsNative = _baseIsNative,
|
|
503
|
-
getValue = _getValue;
|
|
504
|
-
|
|
505
428
|
/**
|
|
506
429
|
* Gets the native function at `key` of `object`.
|
|
507
430
|
*
|
|
@@ -510,29 +433,20 @@ var baseIsNative = _baseIsNative,
|
|
|
510
433
|
* @param {string} key The key of the method to get.
|
|
511
434
|
* @returns {*} Returns the function if it's native, else `undefined`.
|
|
512
435
|
*/
|
|
513
|
-
function getNative
|
|
436
|
+
function getNative(object, key) {
|
|
514
437
|
var value = getValue(object, key);
|
|
515
438
|
return baseIsNative(value) ? value : undefined;
|
|
516
439
|
}
|
|
517
440
|
|
|
518
|
-
var _getNative = getNative$6;
|
|
519
|
-
|
|
520
|
-
var getNative$5 = _getNative,
|
|
521
|
-
root$5 = _root;
|
|
522
|
-
|
|
523
441
|
/* Built-in method references that are verified to be native. */
|
|
524
|
-
var Map$
|
|
525
|
-
|
|
526
|
-
var _Map = Map$4;
|
|
442
|
+
var Map$1 = getNative(root, 'Map');
|
|
527
443
|
|
|
528
|
-
|
|
444
|
+
const Map$2 = Map$1;
|
|
529
445
|
|
|
530
446
|
/* Built-in method references that are verified to be native. */
|
|
531
|
-
var nativeCreate
|
|
447
|
+
var nativeCreate = getNative(Object, 'create');
|
|
532
448
|
|
|
533
|
-
|
|
534
|
-
|
|
535
|
-
var nativeCreate$3 = _nativeCreate;
|
|
449
|
+
const nativeCreate$1 = nativeCreate;
|
|
536
450
|
|
|
537
451
|
/**
|
|
538
452
|
* Removes all key-value entries from the hash.
|
|
@@ -541,13 +455,11 @@ var nativeCreate$3 = _nativeCreate;
|
|
|
541
455
|
* @name clear
|
|
542
456
|
* @memberOf Hash
|
|
543
457
|
*/
|
|
544
|
-
function hashClear
|
|
545
|
-
this.__data__ = nativeCreate$
|
|
458
|
+
function hashClear() {
|
|
459
|
+
this.__data__ = nativeCreate$1 ? nativeCreate$1(null) : {};
|
|
546
460
|
this.size = 0;
|
|
547
461
|
}
|
|
548
462
|
|
|
549
|
-
var _hashClear = hashClear$1;
|
|
550
|
-
|
|
551
463
|
/**
|
|
552
464
|
* Removes `key` and its value from the hash.
|
|
553
465
|
*
|
|
@@ -558,17 +470,12 @@ var _hashClear = hashClear$1;
|
|
|
558
470
|
* @param {string} key The key of the value to remove.
|
|
559
471
|
* @returns {boolean} Returns `true` if the entry was removed, else `false`.
|
|
560
472
|
*/
|
|
561
|
-
|
|
562
|
-
function hashDelete$1(key) {
|
|
473
|
+
function hashDelete(key) {
|
|
563
474
|
var result = this.has(key) && delete this.__data__[key];
|
|
564
475
|
this.size -= result ? 1 : 0;
|
|
565
476
|
return result;
|
|
566
477
|
}
|
|
567
478
|
|
|
568
|
-
var _hashDelete = hashDelete$1;
|
|
569
|
-
|
|
570
|
-
var nativeCreate$2 = _nativeCreate;
|
|
571
|
-
|
|
572
479
|
/** Used to stand-in for `undefined` hash values. */
|
|
573
480
|
var HASH_UNDEFINED$2 = '__lodash_hash_undefined__';
|
|
574
481
|
|
|
@@ -587,19 +494,15 @@ var hasOwnProperty$6 = objectProto$8.hasOwnProperty;
|
|
|
587
494
|
* @param {string} key The key of the value to get.
|
|
588
495
|
* @returns {*} Returns the entry value.
|
|
589
496
|
*/
|
|
590
|
-
function hashGet
|
|
497
|
+
function hashGet(key) {
|
|
591
498
|
var data = this.__data__;
|
|
592
|
-
if (nativeCreate$
|
|
499
|
+
if (nativeCreate$1) {
|
|
593
500
|
var result = data[key];
|
|
594
501
|
return result === HASH_UNDEFINED$2 ? undefined : result;
|
|
595
502
|
}
|
|
596
503
|
return hasOwnProperty$6.call(data, key) ? data[key] : undefined;
|
|
597
504
|
}
|
|
598
505
|
|
|
599
|
-
var _hashGet = hashGet$1;
|
|
600
|
-
|
|
601
|
-
var nativeCreate$1 = _nativeCreate;
|
|
602
|
-
|
|
603
506
|
/** Used for built-in method references. */
|
|
604
507
|
var objectProto$7 = Object.prototype;
|
|
605
508
|
|
|
@@ -615,15 +518,11 @@ var hasOwnProperty$5 = objectProto$7.hasOwnProperty;
|
|
|
615
518
|
* @param {string} key The key of the entry to check.
|
|
616
519
|
* @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
|
|
617
520
|
*/
|
|
618
|
-
function hashHas
|
|
521
|
+
function hashHas(key) {
|
|
619
522
|
var data = this.__data__;
|
|
620
523
|
return nativeCreate$1 ? (data[key] !== undefined) : hasOwnProperty$5.call(data, key);
|
|
621
524
|
}
|
|
622
525
|
|
|
623
|
-
var _hashHas = hashHas$1;
|
|
624
|
-
|
|
625
|
-
var nativeCreate = _nativeCreate;
|
|
626
|
-
|
|
627
526
|
/** Used to stand-in for `undefined` hash values. */
|
|
628
527
|
var HASH_UNDEFINED$1 = '__lodash_hash_undefined__';
|
|
629
528
|
|
|
@@ -637,21 +536,13 @@ var HASH_UNDEFINED$1 = '__lodash_hash_undefined__';
|
|
|
637
536
|
* @param {*} value The value to set.
|
|
638
537
|
* @returns {Object} Returns the hash instance.
|
|
639
538
|
*/
|
|
640
|
-
function hashSet
|
|
539
|
+
function hashSet(key, value) {
|
|
641
540
|
var data = this.__data__;
|
|
642
541
|
this.size += this.has(key) ? 0 : 1;
|
|
643
|
-
data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED$1 : value;
|
|
542
|
+
data[key] = (nativeCreate$1 && value === undefined) ? HASH_UNDEFINED$1 : value;
|
|
644
543
|
return this;
|
|
645
544
|
}
|
|
646
545
|
|
|
647
|
-
var _hashSet = hashSet$1;
|
|
648
|
-
|
|
649
|
-
var hashClear = _hashClear,
|
|
650
|
-
hashDelete = _hashDelete,
|
|
651
|
-
hashGet = _hashGet,
|
|
652
|
-
hashHas = _hashHas,
|
|
653
|
-
hashSet = _hashSet;
|
|
654
|
-
|
|
655
546
|
/**
|
|
656
547
|
* Creates a hash object.
|
|
657
548
|
*
|
|
@@ -659,7 +550,7 @@ var hashClear = _hashClear,
|
|
|
659
550
|
* @constructor
|
|
660
551
|
* @param {Array} [entries] The key-value pairs to cache.
|
|
661
552
|
*/
|
|
662
|
-
function Hash
|
|
553
|
+
function Hash(entries) {
|
|
663
554
|
var index = -1,
|
|
664
555
|
length = entries == null ? 0 : entries.length;
|
|
665
556
|
|
|
@@ -671,17 +562,11 @@ function Hash$1(entries) {
|
|
|
671
562
|
}
|
|
672
563
|
|
|
673
564
|
// Add methods to `Hash`.
|
|
674
|
-
Hash
|
|
675
|
-
Hash
|
|
676
|
-
Hash
|
|
677
|
-
Hash
|
|
678
|
-
Hash
|
|
679
|
-
|
|
680
|
-
var _Hash = Hash$1;
|
|
681
|
-
|
|
682
|
-
var Hash = _Hash,
|
|
683
|
-
ListCache$2 = _ListCache,
|
|
684
|
-
Map$3 = _Map;
|
|
565
|
+
Hash.prototype.clear = hashClear;
|
|
566
|
+
Hash.prototype['delete'] = hashDelete;
|
|
567
|
+
Hash.prototype.get = hashGet;
|
|
568
|
+
Hash.prototype.has = hashHas;
|
|
569
|
+
Hash.prototype.set = hashSet;
|
|
685
570
|
|
|
686
571
|
/**
|
|
687
572
|
* Removes all key-value entries from the map.
|
|
@@ -690,17 +575,15 @@ var Hash = _Hash,
|
|
|
690
575
|
* @name clear
|
|
691
576
|
* @memberOf MapCache
|
|
692
577
|
*/
|
|
693
|
-
function mapCacheClear
|
|
578
|
+
function mapCacheClear() {
|
|
694
579
|
this.size = 0;
|
|
695
580
|
this.__data__ = {
|
|
696
581
|
'hash': new Hash,
|
|
697
|
-
'map': new (Map$
|
|
582
|
+
'map': new (Map$2 || ListCache),
|
|
698
583
|
'string': new Hash
|
|
699
584
|
};
|
|
700
585
|
}
|
|
701
586
|
|
|
702
|
-
var _mapCacheClear = mapCacheClear$1;
|
|
703
|
-
|
|
704
587
|
/**
|
|
705
588
|
* Checks if `value` is suitable for use as unique object key.
|
|
706
589
|
*
|
|
@@ -708,18 +591,13 @@ var _mapCacheClear = mapCacheClear$1;
|
|
|
708
591
|
* @param {*} value The value to check.
|
|
709
592
|
* @returns {boolean} Returns `true` if `value` is suitable, else `false`.
|
|
710
593
|
*/
|
|
711
|
-
|
|
712
|
-
function isKeyable$1(value) {
|
|
594
|
+
function isKeyable(value) {
|
|
713
595
|
var type = typeof value;
|
|
714
596
|
return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')
|
|
715
597
|
? (value !== '__proto__')
|
|
716
598
|
: (value === null);
|
|
717
599
|
}
|
|
718
600
|
|
|
719
|
-
var _isKeyable = isKeyable$1;
|
|
720
|
-
|
|
721
|
-
var isKeyable = _isKeyable;
|
|
722
|
-
|
|
723
601
|
/**
|
|
724
602
|
* Gets the data for `map`.
|
|
725
603
|
*
|
|
@@ -728,17 +606,13 @@ var isKeyable = _isKeyable;
|
|
|
728
606
|
* @param {string} key The reference key.
|
|
729
607
|
* @returns {*} Returns the map data.
|
|
730
608
|
*/
|
|
731
|
-
function getMapData
|
|
609
|
+
function getMapData(map, key) {
|
|
732
610
|
var data = map.__data__;
|
|
733
611
|
return isKeyable(key)
|
|
734
612
|
? data[typeof key == 'string' ? 'string' : 'hash']
|
|
735
613
|
: data.map;
|
|
736
614
|
}
|
|
737
615
|
|
|
738
|
-
var _getMapData = getMapData$4;
|
|
739
|
-
|
|
740
|
-
var getMapData$3 = _getMapData;
|
|
741
|
-
|
|
742
616
|
/**
|
|
743
617
|
* Removes `key` and its value from the map.
|
|
744
618
|
*
|
|
@@ -748,16 +622,12 @@ var getMapData$3 = _getMapData;
|
|
|
748
622
|
* @param {string} key The key of the value to remove.
|
|
749
623
|
* @returns {boolean} Returns `true` if the entry was removed, else `false`.
|
|
750
624
|
*/
|
|
751
|
-
function mapCacheDelete
|
|
752
|
-
var result = getMapData
|
|
625
|
+
function mapCacheDelete(key) {
|
|
626
|
+
var result = getMapData(this, key)['delete'](key);
|
|
753
627
|
this.size -= result ? 1 : 0;
|
|
754
628
|
return result;
|
|
755
629
|
}
|
|
756
630
|
|
|
757
|
-
var _mapCacheDelete = mapCacheDelete$1;
|
|
758
|
-
|
|
759
|
-
var getMapData$2 = _getMapData;
|
|
760
|
-
|
|
761
631
|
/**
|
|
762
632
|
* Gets the map value for `key`.
|
|
763
633
|
*
|
|
@@ -767,14 +637,10 @@ var getMapData$2 = _getMapData;
|
|
|
767
637
|
* @param {string} key The key of the value to get.
|
|
768
638
|
* @returns {*} Returns the entry value.
|
|
769
639
|
*/
|
|
770
|
-
function mapCacheGet
|
|
771
|
-
return getMapData
|
|
640
|
+
function mapCacheGet(key) {
|
|
641
|
+
return getMapData(this, key).get(key);
|
|
772
642
|
}
|
|
773
643
|
|
|
774
|
-
var _mapCacheGet = mapCacheGet$1;
|
|
775
|
-
|
|
776
|
-
var getMapData$1 = _getMapData;
|
|
777
|
-
|
|
778
644
|
/**
|
|
779
645
|
* Checks if a map value for `key` exists.
|
|
780
646
|
*
|
|
@@ -784,14 +650,10 @@ var getMapData$1 = _getMapData;
|
|
|
784
650
|
* @param {string} key The key of the entry to check.
|
|
785
651
|
* @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
|
|
786
652
|
*/
|
|
787
|
-
function mapCacheHas
|
|
788
|
-
return getMapData
|
|
653
|
+
function mapCacheHas(key) {
|
|
654
|
+
return getMapData(this, key).has(key);
|
|
789
655
|
}
|
|
790
656
|
|
|
791
|
-
var _mapCacheHas = mapCacheHas$1;
|
|
792
|
-
|
|
793
|
-
var getMapData = _getMapData;
|
|
794
|
-
|
|
795
657
|
/**
|
|
796
658
|
* Sets the map `key` to `value`.
|
|
797
659
|
*
|
|
@@ -802,7 +664,7 @@ var getMapData = _getMapData;
|
|
|
802
664
|
* @param {*} value The value to set.
|
|
803
665
|
* @returns {Object} Returns the map cache instance.
|
|
804
666
|
*/
|
|
805
|
-
function mapCacheSet
|
|
667
|
+
function mapCacheSet(key, value) {
|
|
806
668
|
var data = getMapData(this, key),
|
|
807
669
|
size = data.size;
|
|
808
670
|
|
|
@@ -811,14 +673,6 @@ function mapCacheSet$1(key, value) {
|
|
|
811
673
|
return this;
|
|
812
674
|
}
|
|
813
675
|
|
|
814
|
-
var _mapCacheSet = mapCacheSet$1;
|
|
815
|
-
|
|
816
|
-
var mapCacheClear = _mapCacheClear,
|
|
817
|
-
mapCacheDelete = _mapCacheDelete,
|
|
818
|
-
mapCacheGet = _mapCacheGet,
|
|
819
|
-
mapCacheHas = _mapCacheHas,
|
|
820
|
-
mapCacheSet = _mapCacheSet;
|
|
821
|
-
|
|
822
676
|
/**
|
|
823
677
|
* Creates a map cache object to store key-value pairs.
|
|
824
678
|
*
|
|
@@ -826,7 +680,7 @@ var mapCacheClear = _mapCacheClear,
|
|
|
826
680
|
* @constructor
|
|
827
681
|
* @param {Array} [entries] The key-value pairs to cache.
|
|
828
682
|
*/
|
|
829
|
-
function MapCache
|
|
683
|
+
function MapCache(entries) {
|
|
830
684
|
var index = -1,
|
|
831
685
|
length = entries == null ? 0 : entries.length;
|
|
832
686
|
|
|
@@ -838,17 +692,11 @@ function MapCache$3(entries) {
|
|
|
838
692
|
}
|
|
839
693
|
|
|
840
694
|
// Add methods to `MapCache`.
|
|
841
|
-
MapCache
|
|
842
|
-
MapCache
|
|
843
|
-
MapCache
|
|
844
|
-
MapCache
|
|
845
|
-
MapCache
|
|
846
|
-
|
|
847
|
-
var _MapCache = MapCache$3;
|
|
848
|
-
|
|
849
|
-
var ListCache$1 = _ListCache,
|
|
850
|
-
Map$2 = _Map,
|
|
851
|
-
MapCache$2 = _MapCache;
|
|
695
|
+
MapCache.prototype.clear = mapCacheClear;
|
|
696
|
+
MapCache.prototype['delete'] = mapCacheDelete;
|
|
697
|
+
MapCache.prototype.get = mapCacheGet;
|
|
698
|
+
MapCache.prototype.has = mapCacheHas;
|
|
699
|
+
MapCache.prototype.set = mapCacheSet;
|
|
852
700
|
|
|
853
701
|
/** Used as the size to enable large array optimizations. */
|
|
854
702
|
var LARGE_ARRAY_SIZE = 200;
|
|
@@ -863,31 +711,22 @@ var LARGE_ARRAY_SIZE = 200;
|
|
|
863
711
|
* @param {*} value The value to set.
|
|
864
712
|
* @returns {Object} Returns the stack cache instance.
|
|
865
713
|
*/
|
|
866
|
-
function stackSet
|
|
714
|
+
function stackSet(key, value) {
|
|
867
715
|
var data = this.__data__;
|
|
868
|
-
if (data instanceof ListCache
|
|
716
|
+
if (data instanceof ListCache) {
|
|
869
717
|
var pairs = data.__data__;
|
|
870
718
|
if (!Map$2 || (pairs.length < LARGE_ARRAY_SIZE - 1)) {
|
|
871
719
|
pairs.push([key, value]);
|
|
872
720
|
this.size = ++data.size;
|
|
873
721
|
return this;
|
|
874
722
|
}
|
|
875
|
-
data = this.__data__ = new MapCache
|
|
723
|
+
data = this.__data__ = new MapCache(pairs);
|
|
876
724
|
}
|
|
877
725
|
data.set(key, value);
|
|
878
726
|
this.size = data.size;
|
|
879
727
|
return this;
|
|
880
728
|
}
|
|
881
729
|
|
|
882
|
-
var _stackSet = stackSet$1;
|
|
883
|
-
|
|
884
|
-
var ListCache = _ListCache,
|
|
885
|
-
stackClear = _stackClear,
|
|
886
|
-
stackDelete = _stackDelete,
|
|
887
|
-
stackGet = _stackGet,
|
|
888
|
-
stackHas = _stackHas,
|
|
889
|
-
stackSet = _stackSet;
|
|
890
|
-
|
|
891
730
|
/**
|
|
892
731
|
* Creates a stack cache object to store key-value pairs.
|
|
893
732
|
*
|
|
@@ -895,22 +734,19 @@ var ListCache = _ListCache,
|
|
|
895
734
|
* @constructor
|
|
896
735
|
* @param {Array} [entries] The key-value pairs to cache.
|
|
897
736
|
*/
|
|
898
|
-
function Stack
|
|
737
|
+
function Stack(entries) {
|
|
899
738
|
var data = this.__data__ = new ListCache(entries);
|
|
900
739
|
this.size = data.size;
|
|
901
740
|
}
|
|
902
741
|
|
|
903
742
|
// Add methods to `Stack`.
|
|
904
|
-
Stack
|
|
905
|
-
Stack
|
|
906
|
-
Stack
|
|
907
|
-
Stack
|
|
908
|
-
Stack
|
|
909
|
-
|
|
910
|
-
var _Stack = Stack$2;
|
|
743
|
+
Stack.prototype.clear = stackClear;
|
|
744
|
+
Stack.prototype['delete'] = stackDelete;
|
|
745
|
+
Stack.prototype.get = stackGet;
|
|
746
|
+
Stack.prototype.has = stackHas;
|
|
747
|
+
Stack.prototype.set = stackSet;
|
|
911
748
|
|
|
912
749
|
/** Used to stand-in for `undefined` hash values. */
|
|
913
|
-
|
|
914
750
|
var HASH_UNDEFINED = '__lodash_hash_undefined__';
|
|
915
751
|
|
|
916
752
|
/**
|
|
@@ -923,13 +759,11 @@ var HASH_UNDEFINED = '__lodash_hash_undefined__';
|
|
|
923
759
|
* @param {*} value The value to cache.
|
|
924
760
|
* @returns {Object} Returns the cache instance.
|
|
925
761
|
*/
|
|
926
|
-
function setCacheAdd
|
|
762
|
+
function setCacheAdd(value) {
|
|
927
763
|
this.__data__.set(value, HASH_UNDEFINED);
|
|
928
764
|
return this;
|
|
929
765
|
}
|
|
930
766
|
|
|
931
|
-
var _setCacheAdd = setCacheAdd$1;
|
|
932
|
-
|
|
933
767
|
/**
|
|
934
768
|
* Checks if `value` is in the array cache.
|
|
935
769
|
*
|
|
@@ -939,17 +773,10 @@ var _setCacheAdd = setCacheAdd$1;
|
|
|
939
773
|
* @param {*} value The value to search for.
|
|
940
774
|
* @returns {number} Returns `true` if `value` is found, else `false`.
|
|
941
775
|
*/
|
|
942
|
-
|
|
943
|
-
function setCacheHas$1(value) {
|
|
776
|
+
function setCacheHas(value) {
|
|
944
777
|
return this.__data__.has(value);
|
|
945
778
|
}
|
|
946
779
|
|
|
947
|
-
var _setCacheHas = setCacheHas$1;
|
|
948
|
-
|
|
949
|
-
var MapCache$1 = _MapCache,
|
|
950
|
-
setCacheAdd = _setCacheAdd,
|
|
951
|
-
setCacheHas = _setCacheHas;
|
|
952
|
-
|
|
953
780
|
/**
|
|
954
781
|
*
|
|
955
782
|
* Creates an array cache object to store unique values.
|
|
@@ -958,21 +785,19 @@ var MapCache$1 = _MapCache,
|
|
|
958
785
|
* @constructor
|
|
959
786
|
* @param {Array} [values] The values to cache.
|
|
960
787
|
*/
|
|
961
|
-
function SetCache
|
|
788
|
+
function SetCache(values) {
|
|
962
789
|
var index = -1,
|
|
963
790
|
length = values == null ? 0 : values.length;
|
|
964
791
|
|
|
965
|
-
this.__data__ = new MapCache
|
|
792
|
+
this.__data__ = new MapCache;
|
|
966
793
|
while (++index < length) {
|
|
967
794
|
this.add(values[index]);
|
|
968
795
|
}
|
|
969
796
|
}
|
|
970
797
|
|
|
971
798
|
// Add methods to `SetCache`.
|
|
972
|
-
SetCache
|
|
973
|
-
SetCache
|
|
974
|
-
|
|
975
|
-
var _SetCache = SetCache$1;
|
|
799
|
+
SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;
|
|
800
|
+
SetCache.prototype.has = setCacheHas;
|
|
976
801
|
|
|
977
802
|
/**
|
|
978
803
|
* A specialized version of `_.some` for arrays without support for iteratee
|
|
@@ -984,8 +809,7 @@ var _SetCache = SetCache$1;
|
|
|
984
809
|
* @returns {boolean} Returns `true` if any element passes the predicate check,
|
|
985
810
|
* else `false`.
|
|
986
811
|
*/
|
|
987
|
-
|
|
988
|
-
function arraySome$1(array, predicate) {
|
|
812
|
+
function arraySome(array, predicate) {
|
|
989
813
|
var index = -1,
|
|
990
814
|
length = array == null ? 0 : array.length;
|
|
991
815
|
|
|
@@ -997,8 +821,6 @@ function arraySome$1(array, predicate) {
|
|
|
997
821
|
return false;
|
|
998
822
|
}
|
|
999
823
|
|
|
1000
|
-
var _arraySome = arraySome$1;
|
|
1001
|
-
|
|
1002
824
|
/**
|
|
1003
825
|
* Checks if a `cache` value for `key` exists.
|
|
1004
826
|
*
|
|
@@ -1007,17 +829,10 @@ var _arraySome = arraySome$1;
|
|
|
1007
829
|
* @param {string} key The key of the entry to check.
|
|
1008
830
|
* @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
|
|
1009
831
|
*/
|
|
1010
|
-
|
|
1011
|
-
function cacheHas$1(cache, key) {
|
|
832
|
+
function cacheHas(cache, key) {
|
|
1012
833
|
return cache.has(key);
|
|
1013
834
|
}
|
|
1014
835
|
|
|
1015
|
-
var _cacheHas = cacheHas$1;
|
|
1016
|
-
|
|
1017
|
-
var SetCache = _SetCache,
|
|
1018
|
-
arraySome = _arraySome,
|
|
1019
|
-
cacheHas = _cacheHas;
|
|
1020
|
-
|
|
1021
836
|
/** Used to compose bitmasks for value comparisons. */
|
|
1022
837
|
var COMPARE_PARTIAL_FLAG$5 = 1,
|
|
1023
838
|
COMPARE_UNORDERED_FLAG$3 = 2;
|
|
@@ -1035,7 +850,7 @@ var COMPARE_PARTIAL_FLAG$5 = 1,
|
|
|
1035
850
|
* @param {Object} stack Tracks traversed `array` and `other` objects.
|
|
1036
851
|
* @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.
|
|
1037
852
|
*/
|
|
1038
|
-
function equalArrays
|
|
853
|
+
function equalArrays(array, other, bitmask, customizer, equalFunc, stack) {
|
|
1039
854
|
var isPartial = bitmask & COMPARE_PARTIAL_FLAG$5,
|
|
1040
855
|
arrLength = array.length,
|
|
1041
856
|
othLength = other.length;
|
|
@@ -1097,14 +912,10 @@ function equalArrays$2(array, other, bitmask, customizer, equalFunc, stack) {
|
|
|
1097
912
|
return result;
|
|
1098
913
|
}
|
|
1099
914
|
|
|
1100
|
-
var _equalArrays = equalArrays$2;
|
|
1101
|
-
|
|
1102
|
-
var root$4 = _root;
|
|
1103
|
-
|
|
1104
915
|
/** Built-in value references. */
|
|
1105
|
-
var Uint8Array
|
|
916
|
+
var Uint8Array = root.Uint8Array;
|
|
1106
917
|
|
|
1107
|
-
|
|
918
|
+
const Uint8Array$1 = Uint8Array;
|
|
1108
919
|
|
|
1109
920
|
/**
|
|
1110
921
|
* Converts `map` to its key-value pairs.
|
|
@@ -1113,8 +924,7 @@ var _Uint8Array = Uint8Array$1;
|
|
|
1113
924
|
* @param {Object} map The map to convert.
|
|
1114
925
|
* @returns {Array} Returns the key-value pairs.
|
|
1115
926
|
*/
|
|
1116
|
-
|
|
1117
|
-
function mapToArray$1(map) {
|
|
927
|
+
function mapToArray(map) {
|
|
1118
928
|
var index = -1,
|
|
1119
929
|
result = Array(map.size);
|
|
1120
930
|
|
|
@@ -1124,8 +934,6 @@ function mapToArray$1(map) {
|
|
|
1124
934
|
return result;
|
|
1125
935
|
}
|
|
1126
936
|
|
|
1127
|
-
var _mapToArray = mapToArray$1;
|
|
1128
|
-
|
|
1129
937
|
/**
|
|
1130
938
|
* Converts `set` to an array of its values.
|
|
1131
939
|
*
|
|
@@ -1133,8 +941,7 @@ var _mapToArray = mapToArray$1;
|
|
|
1133
941
|
* @param {Object} set The set to convert.
|
|
1134
942
|
* @returns {Array} Returns the values.
|
|
1135
943
|
*/
|
|
1136
|
-
|
|
1137
|
-
function setToArray$1(set) {
|
|
944
|
+
function setToArray(set) {
|
|
1138
945
|
var index = -1,
|
|
1139
946
|
result = Array(set.size);
|
|
1140
947
|
|
|
@@ -1144,15 +951,6 @@ function setToArray$1(set) {
|
|
|
1144
951
|
return result;
|
|
1145
952
|
}
|
|
1146
953
|
|
|
1147
|
-
var _setToArray = setToArray$1;
|
|
1148
|
-
|
|
1149
|
-
var Symbol$1 = _Symbol,
|
|
1150
|
-
Uint8Array = _Uint8Array,
|
|
1151
|
-
eq$1 = eq_1,
|
|
1152
|
-
equalArrays$1 = _equalArrays,
|
|
1153
|
-
mapToArray = _mapToArray,
|
|
1154
|
-
setToArray = _setToArray;
|
|
1155
|
-
|
|
1156
954
|
/** Used to compose bitmasks for value comparisons. */
|
|
1157
955
|
var COMPARE_PARTIAL_FLAG$4 = 1,
|
|
1158
956
|
COMPARE_UNORDERED_FLAG$2 = 2;
|
|
@@ -1172,7 +970,7 @@ var arrayBufferTag$1 = '[object ArrayBuffer]',
|
|
|
1172
970
|
dataViewTag$2 = '[object DataView]';
|
|
1173
971
|
|
|
1174
972
|
/** Used to convert symbols to primitives and strings. */
|
|
1175
|
-
var symbolProto$1 = Symbol
|
|
973
|
+
var symbolProto$1 = Symbol ? Symbol.prototype : undefined,
|
|
1176
974
|
symbolValueOf = symbolProto$1 ? symbolProto$1.valueOf : undefined;
|
|
1177
975
|
|
|
1178
976
|
/**
|
|
@@ -1192,7 +990,7 @@ var symbolProto$1 = Symbol$1 ? Symbol$1.prototype : undefined,
|
|
|
1192
990
|
* @param {Object} stack Tracks traversed `object` and `other` objects.
|
|
1193
991
|
* @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
|
|
1194
992
|
*/
|
|
1195
|
-
function equalByTag
|
|
993
|
+
function equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {
|
|
1196
994
|
switch (tag) {
|
|
1197
995
|
case dataViewTag$2:
|
|
1198
996
|
if ((object.byteLength != other.byteLength) ||
|
|
@@ -1204,7 +1002,7 @@ function equalByTag$1(object, other, tag, bitmask, customizer, equalFunc, stack)
|
|
|
1204
1002
|
|
|
1205
1003
|
case arrayBufferTag$1:
|
|
1206
1004
|
if ((object.byteLength != other.byteLength) ||
|
|
1207
|
-
!equalFunc(new Uint8Array(object), new Uint8Array(other))) {
|
|
1005
|
+
!equalFunc(new Uint8Array$1(object), new Uint8Array$1(other))) {
|
|
1208
1006
|
return false;
|
|
1209
1007
|
}
|
|
1210
1008
|
return true;
|
|
@@ -1214,7 +1012,7 @@ function equalByTag$1(object, other, tag, bitmask, customizer, equalFunc, stack)
|
|
|
1214
1012
|
case numberTag$1:
|
|
1215
1013
|
// Coerce booleans to `1` or `0` and dates to milliseconds.
|
|
1216
1014
|
// Invalid dates are coerced to `NaN`.
|
|
1217
|
-
return eq
|
|
1015
|
+
return eq(+object, +other);
|
|
1218
1016
|
|
|
1219
1017
|
case errorTag$1:
|
|
1220
1018
|
return object.name == other.name && object.message == other.message;
|
|
@@ -1245,7 +1043,7 @@ function equalByTag$1(object, other, tag, bitmask, customizer, equalFunc, stack)
|
|
|
1245
1043
|
|
|
1246
1044
|
// Recursively compare objects (susceptible to call stack limits).
|
|
1247
1045
|
stack.set(object, other);
|
|
1248
|
-
var result = equalArrays
|
|
1046
|
+
var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);
|
|
1249
1047
|
stack['delete'](object);
|
|
1250
1048
|
return result;
|
|
1251
1049
|
|
|
@@ -1257,8 +1055,6 @@ function equalByTag$1(object, other, tag, bitmask, customizer, equalFunc, stack)
|
|
|
1257
1055
|
return false;
|
|
1258
1056
|
}
|
|
1259
1057
|
|
|
1260
|
-
var _equalByTag = equalByTag$1;
|
|
1261
|
-
|
|
1262
1058
|
/**
|
|
1263
1059
|
* Appends the elements of `values` to `array`.
|
|
1264
1060
|
*
|
|
@@ -1267,8 +1063,7 @@ var _equalByTag = equalByTag$1;
|
|
|
1267
1063
|
* @param {Array} values The values to append.
|
|
1268
1064
|
* @returns {Array} Returns `array`.
|
|
1269
1065
|
*/
|
|
1270
|
-
|
|
1271
|
-
function arrayPush$1(array, values) {
|
|
1066
|
+
function arrayPush(array, values) {
|
|
1272
1067
|
var index = -1,
|
|
1273
1068
|
length = values.length,
|
|
1274
1069
|
offset = array.length;
|
|
@@ -1279,8 +1074,6 @@ function arrayPush$1(array, values) {
|
|
|
1279
1074
|
return array;
|
|
1280
1075
|
}
|
|
1281
1076
|
|
|
1282
|
-
var _arrayPush = arrayPush$1;
|
|
1283
|
-
|
|
1284
1077
|
/**
|
|
1285
1078
|
* Checks if `value` is classified as an `Array` object.
|
|
1286
1079
|
*
|
|
@@ -1304,13 +1097,9 @@ var _arrayPush = arrayPush$1;
|
|
|
1304
1097
|
* _.isArray(_.noop);
|
|
1305
1098
|
* // => false
|
|
1306
1099
|
*/
|
|
1100
|
+
var isArray = Array.isArray;
|
|
1307
1101
|
|
|
1308
|
-
|
|
1309
|
-
|
|
1310
|
-
var isArray_1 = isArray$a;
|
|
1311
|
-
|
|
1312
|
-
var arrayPush = _arrayPush,
|
|
1313
|
-
isArray$9 = isArray_1;
|
|
1102
|
+
const isArray$1 = isArray;
|
|
1314
1103
|
|
|
1315
1104
|
/**
|
|
1316
1105
|
* The base implementation of `getAllKeys` and `getAllKeysIn` which uses
|
|
@@ -1323,13 +1112,11 @@ var arrayPush = _arrayPush,
|
|
|
1323
1112
|
* @param {Function} symbolsFunc The function to get the symbols of `object`.
|
|
1324
1113
|
* @returns {Array} Returns the array of property names and symbols.
|
|
1325
1114
|
*/
|
|
1326
|
-
function baseGetAllKeys
|
|
1115
|
+
function baseGetAllKeys(object, keysFunc, symbolsFunc) {
|
|
1327
1116
|
var result = keysFunc(object);
|
|
1328
|
-
return isArray$
|
|
1117
|
+
return isArray$1(object) ? result : arrayPush(result, symbolsFunc(object));
|
|
1329
1118
|
}
|
|
1330
1119
|
|
|
1331
|
-
var _baseGetAllKeys = baseGetAllKeys$1;
|
|
1332
|
-
|
|
1333
1120
|
/**
|
|
1334
1121
|
* A specialized version of `_.filter` for arrays without support for
|
|
1335
1122
|
* iteratee shorthands.
|
|
@@ -1339,8 +1126,7 @@ var _baseGetAllKeys = baseGetAllKeys$1;
|
|
|
1339
1126
|
* @param {Function} predicate The function invoked per iteration.
|
|
1340
1127
|
* @returns {Array} Returns the new filtered array.
|
|
1341
1128
|
*/
|
|
1342
|
-
|
|
1343
|
-
function arrayFilter$1(array, predicate) {
|
|
1129
|
+
function arrayFilter(array, predicate) {
|
|
1344
1130
|
var index = -1,
|
|
1345
1131
|
length = array == null ? 0 : array.length,
|
|
1346
1132
|
resIndex = 0,
|
|
@@ -1355,8 +1141,6 @@ function arrayFilter$1(array, predicate) {
|
|
|
1355
1141
|
return result;
|
|
1356
1142
|
}
|
|
1357
1143
|
|
|
1358
|
-
var _arrayFilter = arrayFilter$1;
|
|
1359
|
-
|
|
1360
1144
|
/**
|
|
1361
1145
|
* This method returns a new empty array.
|
|
1362
1146
|
*
|
|
@@ -1375,16 +1159,10 @@ var _arrayFilter = arrayFilter$1;
|
|
|
1375
1159
|
* console.log(arrays[0] === arrays[1]);
|
|
1376
1160
|
* // => false
|
|
1377
1161
|
*/
|
|
1378
|
-
|
|
1379
|
-
function stubArray$1() {
|
|
1162
|
+
function stubArray() {
|
|
1380
1163
|
return [];
|
|
1381
1164
|
}
|
|
1382
1165
|
|
|
1383
|
-
var stubArray_1 = stubArray$1;
|
|
1384
|
-
|
|
1385
|
-
var arrayFilter = _arrayFilter,
|
|
1386
|
-
stubArray = stubArray_1;
|
|
1387
|
-
|
|
1388
1166
|
/** Used for built-in method references. */
|
|
1389
1167
|
var objectProto$6 = Object.prototype;
|
|
1390
1168
|
|
|
@@ -1401,7 +1179,7 @@ var nativeGetSymbols = Object.getOwnPropertySymbols;
|
|
|
1401
1179
|
* @param {Object} object The object to query.
|
|
1402
1180
|
* @returns {Array} Returns the array of symbols.
|
|
1403
1181
|
*/
|
|
1404
|
-
var getSymbols
|
|
1182
|
+
var getSymbols = !nativeGetSymbols ? stubArray : function(object) {
|
|
1405
1183
|
if (object == null) {
|
|
1406
1184
|
return [];
|
|
1407
1185
|
}
|
|
@@ -1411,7 +1189,7 @@ var getSymbols$1 = !nativeGetSymbols ? stubArray : function(object) {
|
|
|
1411
1189
|
});
|
|
1412
1190
|
};
|
|
1413
1191
|
|
|
1414
|
-
|
|
1192
|
+
const getSymbols$1 = getSymbols;
|
|
1415
1193
|
|
|
1416
1194
|
/**
|
|
1417
1195
|
* The base implementation of `_.times` without support for iteratee shorthands
|
|
@@ -1422,8 +1200,7 @@ var _getSymbols = getSymbols$1;
|
|
|
1422
1200
|
* @param {Function} iteratee The function invoked per iteration.
|
|
1423
1201
|
* @returns {Array} Returns the array of results.
|
|
1424
1202
|
*/
|
|
1425
|
-
|
|
1426
|
-
function baseTimes$1(n, iteratee) {
|
|
1203
|
+
function baseTimes(n, iteratee) {
|
|
1427
1204
|
var index = -1,
|
|
1428
1205
|
result = Array(n);
|
|
1429
1206
|
|
|
@@ -1433,11 +1210,6 @@ function baseTimes$1(n, iteratee) {
|
|
|
1433
1210
|
return result;
|
|
1434
1211
|
}
|
|
1435
1212
|
|
|
1436
|
-
var _baseTimes = baseTimes$1;
|
|
1437
|
-
|
|
1438
|
-
var baseGetTag$2 = _baseGetTag,
|
|
1439
|
-
isObjectLike$3 = isObjectLike_1;
|
|
1440
|
-
|
|
1441
1213
|
/** `Object#toString` result references. */
|
|
1442
1214
|
var argsTag$2 = '[object Arguments]';
|
|
1443
1215
|
|
|
@@ -1448,15 +1220,10 @@ var argsTag$2 = '[object Arguments]';
|
|
|
1448
1220
|
* @param {*} value The value to check.
|
|
1449
1221
|
* @returns {boolean} Returns `true` if `value` is an `arguments` object,
|
|
1450
1222
|
*/
|
|
1451
|
-
function baseIsArguments
|
|
1452
|
-
return isObjectLike
|
|
1223
|
+
function baseIsArguments(value) {
|
|
1224
|
+
return isObjectLike(value) && baseGetTag(value) == argsTag$2;
|
|
1453
1225
|
}
|
|
1454
1226
|
|
|
1455
|
-
var _baseIsArguments = baseIsArguments$1;
|
|
1456
|
-
|
|
1457
|
-
var baseIsArguments = _baseIsArguments,
|
|
1458
|
-
isObjectLike$2 = isObjectLike_1;
|
|
1459
|
-
|
|
1460
1227
|
/** Used for built-in method references. */
|
|
1461
1228
|
var objectProto$5 = Object.prototype;
|
|
1462
1229
|
|
|
@@ -1484,14 +1251,12 @@ var propertyIsEnumerable = objectProto$5.propertyIsEnumerable;
|
|
|
1484
1251
|
* _.isArguments([1, 2, 3]);
|
|
1485
1252
|
* // => false
|
|
1486
1253
|
*/
|
|
1487
|
-
var isArguments
|
|
1488
|
-
return isObjectLike
|
|
1254
|
+
var isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {
|
|
1255
|
+
return isObjectLike(value) && hasOwnProperty$4.call(value, 'callee') &&
|
|
1489
1256
|
!propertyIsEnumerable.call(value, 'callee');
|
|
1490
1257
|
};
|
|
1491
1258
|
|
|
1492
|
-
|
|
1493
|
-
|
|
1494
|
-
var isBuffer$2 = {exports: {}};
|
|
1259
|
+
const isArguments$1 = isArguments;
|
|
1495
1260
|
|
|
1496
1261
|
/**
|
|
1497
1262
|
* This method returns `false`.
|
|
@@ -1506,28 +1271,21 @@ var isBuffer$2 = {exports: {}};
|
|
|
1506
1271
|
* _.times(2, _.stubFalse);
|
|
1507
1272
|
* // => [false, false]
|
|
1508
1273
|
*/
|
|
1509
|
-
|
|
1510
1274
|
function stubFalse() {
|
|
1511
1275
|
return false;
|
|
1512
1276
|
}
|
|
1513
1277
|
|
|
1514
|
-
var stubFalse_1 = stubFalse;
|
|
1515
|
-
|
|
1516
|
-
(function (module, exports) {
|
|
1517
|
-
var root = _root,
|
|
1518
|
-
stubFalse = stubFalse_1;
|
|
1519
|
-
|
|
1520
1278
|
/** Detect free variable `exports`. */
|
|
1521
|
-
var freeExports = exports && !exports.nodeType && exports;
|
|
1279
|
+
var freeExports$1 = typeof exports == 'object' && exports && !exports.nodeType && exports;
|
|
1522
1280
|
|
|
1523
1281
|
/** Detect free variable `module`. */
|
|
1524
|
-
var freeModule = freeExports &&
|
|
1282
|
+
var freeModule$1 = freeExports$1 && typeof module == 'object' && module && !module.nodeType && module;
|
|
1525
1283
|
|
|
1526
1284
|
/** Detect the popular CommonJS extension `module.exports`. */
|
|
1527
|
-
var moduleExports = freeModule && freeModule.exports === freeExports;
|
|
1285
|
+
var moduleExports$1 = freeModule$1 && freeModule$1.exports === freeExports$1;
|
|
1528
1286
|
|
|
1529
1287
|
/** Built-in value references. */
|
|
1530
|
-
var Buffer = moduleExports ? root.Buffer : undefined;
|
|
1288
|
+
var Buffer = moduleExports$1 ? root.Buffer : undefined;
|
|
1531
1289
|
|
|
1532
1290
|
/* Built-in method references for those with the same name as other `lodash` methods. */
|
|
1533
1291
|
var nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined;
|
|
@@ -1551,11 +1309,9 @@ var nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined;
|
|
|
1551
1309
|
*/
|
|
1552
1310
|
var isBuffer = nativeIsBuffer || stubFalse;
|
|
1553
1311
|
|
|
1554
|
-
|
|
1555
|
-
}(isBuffer$2, isBuffer$2.exports));
|
|
1312
|
+
const isBuffer$1 = isBuffer;
|
|
1556
1313
|
|
|
1557
1314
|
/** Used as references for various `Number` constants. */
|
|
1558
|
-
|
|
1559
1315
|
var MAX_SAFE_INTEGER$1 = 9007199254740991;
|
|
1560
1316
|
|
|
1561
1317
|
/** Used to detect unsigned integer values. */
|
|
@@ -1569,7 +1325,7 @@ var reIsUint = /^(?:0|[1-9]\d*)$/;
|
|
|
1569
1325
|
* @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.
|
|
1570
1326
|
* @returns {boolean} Returns `true` if `value` is a valid index, else `false`.
|
|
1571
1327
|
*/
|
|
1572
|
-
function isIndex
|
|
1328
|
+
function isIndex(value, length) {
|
|
1573
1329
|
var type = typeof value;
|
|
1574
1330
|
length = length == null ? MAX_SAFE_INTEGER$1 : length;
|
|
1575
1331
|
|
|
@@ -1579,10 +1335,7 @@ function isIndex$3(value, length) {
|
|
|
1579
1335
|
(value > -1 && value % 1 == 0 && value < length);
|
|
1580
1336
|
}
|
|
1581
1337
|
|
|
1582
|
-
var _isIndex = isIndex$3;
|
|
1583
|
-
|
|
1584
1338
|
/** Used as references for various `Number` constants. */
|
|
1585
|
-
|
|
1586
1339
|
var MAX_SAFE_INTEGER = 9007199254740991;
|
|
1587
1340
|
|
|
1588
1341
|
/**
|
|
@@ -1611,17 +1364,11 @@ var MAX_SAFE_INTEGER = 9007199254740991;
|
|
|
1611
1364
|
* _.isLength('3');
|
|
1612
1365
|
* // => false
|
|
1613
1366
|
*/
|
|
1614
|
-
function isLength
|
|
1367
|
+
function isLength(value) {
|
|
1615
1368
|
return typeof value == 'number' &&
|
|
1616
1369
|
value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;
|
|
1617
1370
|
}
|
|
1618
1371
|
|
|
1619
|
-
var isLength_1 = isLength$3;
|
|
1620
|
-
|
|
1621
|
-
var baseGetTag$1 = _baseGetTag,
|
|
1622
|
-
isLength$2 = isLength_1,
|
|
1623
|
-
isObjectLike$1 = isObjectLike_1;
|
|
1624
|
-
|
|
1625
1372
|
/** `Object#toString` result references. */
|
|
1626
1373
|
var argsTag$1 = '[object Arguments]',
|
|
1627
1374
|
arrayTag$1 = '[object Array]',
|
|
@@ -1672,13 +1419,11 @@ typedArrayTags[weakMapTag$1] = false;
|
|
|
1672
1419
|
* @param {*} value The value to check.
|
|
1673
1420
|
* @returns {boolean} Returns `true` if `value` is a typed array, else `false`.
|
|
1674
1421
|
*/
|
|
1675
|
-
function baseIsTypedArray
|
|
1676
|
-
return isObjectLike
|
|
1677
|
-
isLength
|
|
1422
|
+
function baseIsTypedArray(value) {
|
|
1423
|
+
return isObjectLike(value) &&
|
|
1424
|
+
isLength(value.length) && !!typedArrayTags[baseGetTag(value)];
|
|
1678
1425
|
}
|
|
1679
1426
|
|
|
1680
|
-
var _baseIsTypedArray = baseIsTypedArray$1;
|
|
1681
|
-
|
|
1682
1427
|
/**
|
|
1683
1428
|
* The base implementation of `_.unary` without support for storing metadata.
|
|
1684
1429
|
*
|
|
@@ -1686,25 +1431,17 @@ var _baseIsTypedArray = baseIsTypedArray$1;
|
|
|
1686
1431
|
* @param {Function} func The function to cap arguments for.
|
|
1687
1432
|
* @returns {Function} Returns the new capped function.
|
|
1688
1433
|
*/
|
|
1689
|
-
|
|
1690
|
-
function baseUnary$1(func) {
|
|
1434
|
+
function baseUnary(func) {
|
|
1691
1435
|
return function(value) {
|
|
1692
1436
|
return func(value);
|
|
1693
1437
|
};
|
|
1694
1438
|
}
|
|
1695
1439
|
|
|
1696
|
-
var _baseUnary = baseUnary$1;
|
|
1697
|
-
|
|
1698
|
-
var _nodeUtil = {exports: {}};
|
|
1699
|
-
|
|
1700
|
-
(function (module, exports) {
|
|
1701
|
-
var freeGlobal = _freeGlobal;
|
|
1702
|
-
|
|
1703
1440
|
/** Detect free variable `exports`. */
|
|
1704
|
-
var freeExports = exports && !exports.nodeType && exports;
|
|
1441
|
+
var freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;
|
|
1705
1442
|
|
|
1706
1443
|
/** Detect free variable `module`. */
|
|
1707
|
-
var freeModule = freeExports &&
|
|
1444
|
+
var freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;
|
|
1708
1445
|
|
|
1709
1446
|
/** Detect the popular CommonJS extension `module.exports`. */
|
|
1710
1447
|
var moduleExports = freeModule && freeModule.exports === freeExports;
|
|
@@ -1727,15 +1464,10 @@ var nodeUtil = (function() {
|
|
|
1727
1464
|
} catch (e) {}
|
|
1728
1465
|
}());
|
|
1729
1466
|
|
|
1730
|
-
|
|
1731
|
-
}(_nodeUtil, _nodeUtil.exports));
|
|
1732
|
-
|
|
1733
|
-
var baseIsTypedArray = _baseIsTypedArray,
|
|
1734
|
-
baseUnary = _baseUnary,
|
|
1735
|
-
nodeUtil = _nodeUtil.exports;
|
|
1467
|
+
const nodeUtil$1 = nodeUtil;
|
|
1736
1468
|
|
|
1737
1469
|
/* Node.js helper references. */
|
|
1738
|
-
var nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;
|
|
1470
|
+
var nodeIsTypedArray = nodeUtil$1 && nodeUtil$1.isTypedArray;
|
|
1739
1471
|
|
|
1740
1472
|
/**
|
|
1741
1473
|
* Checks if `value` is classified as a typed array.
|
|
@@ -1754,16 +1486,9 @@ var nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;
|
|
|
1754
1486
|
* _.isTypedArray([]);
|
|
1755
1487
|
* // => false
|
|
1756
1488
|
*/
|
|
1757
|
-
var isTypedArray
|
|
1489
|
+
var isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;
|
|
1758
1490
|
|
|
1759
|
-
|
|
1760
|
-
|
|
1761
|
-
var baseTimes = _baseTimes,
|
|
1762
|
-
isArguments$1 = isArguments_1,
|
|
1763
|
-
isArray$8 = isArray_1,
|
|
1764
|
-
isBuffer$1 = isBuffer$2.exports,
|
|
1765
|
-
isIndex$2 = _isIndex,
|
|
1766
|
-
isTypedArray$1 = isTypedArray_1;
|
|
1491
|
+
const isTypedArray$1 = isTypedArray;
|
|
1767
1492
|
|
|
1768
1493
|
/** Used for built-in method references. */
|
|
1769
1494
|
var objectProto$4 = Object.prototype;
|
|
@@ -1779,8 +1504,8 @@ var hasOwnProperty$3 = objectProto$4.hasOwnProperty;
|
|
|
1779
1504
|
* @param {boolean} inherited Specify returning inherited property names.
|
|
1780
1505
|
* @returns {Array} Returns the array of property names.
|
|
1781
1506
|
*/
|
|
1782
|
-
function arrayLikeKeys
|
|
1783
|
-
var isArr = isArray$
|
|
1507
|
+
function arrayLikeKeys(value, inherited) {
|
|
1508
|
+
var isArr = isArray$1(value),
|
|
1784
1509
|
isArg = !isArr && isArguments$1(value),
|
|
1785
1510
|
isBuff = !isArr && !isArg && isBuffer$1(value),
|
|
1786
1511
|
isType = !isArr && !isArg && !isBuff && isTypedArray$1(value),
|
|
@@ -1798,7 +1523,7 @@ function arrayLikeKeys$1(value, inherited) {
|
|
|
1798
1523
|
// PhantomJS 2 has enumerable non-index properties on typed arrays.
|
|
1799
1524
|
(isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||
|
|
1800
1525
|
// Skip index properties.
|
|
1801
|
-
isIndex
|
|
1526
|
+
isIndex(key, length)
|
|
1802
1527
|
))) {
|
|
1803
1528
|
result.push(key);
|
|
1804
1529
|
}
|
|
@@ -1806,10 +1531,7 @@ function arrayLikeKeys$1(value, inherited) {
|
|
|
1806
1531
|
return result;
|
|
1807
1532
|
}
|
|
1808
1533
|
|
|
1809
|
-
var _arrayLikeKeys = arrayLikeKeys$1;
|
|
1810
|
-
|
|
1811
1534
|
/** Used for built-in method references. */
|
|
1812
|
-
|
|
1813
1535
|
var objectProto$3 = Object.prototype;
|
|
1814
1536
|
|
|
1815
1537
|
/**
|
|
@@ -1819,15 +1541,13 @@ var objectProto$3 = Object.prototype;
|
|
|
1819
1541
|
* @param {*} value The value to check.
|
|
1820
1542
|
* @returns {boolean} Returns `true` if `value` is a prototype, else `false`.
|
|
1821
1543
|
*/
|
|
1822
|
-
function isPrototype
|
|
1544
|
+
function isPrototype(value) {
|
|
1823
1545
|
var Ctor = value && value.constructor,
|
|
1824
1546
|
proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto$3;
|
|
1825
1547
|
|
|
1826
1548
|
return value === proto;
|
|
1827
1549
|
}
|
|
1828
1550
|
|
|
1829
|
-
var _isPrototype = isPrototype$1;
|
|
1830
|
-
|
|
1831
1551
|
/**
|
|
1832
1552
|
* Creates a unary function that invokes `func` with its argument transformed.
|
|
1833
1553
|
*
|
|
@@ -1836,24 +1556,16 @@ var _isPrototype = isPrototype$1;
|
|
|
1836
1556
|
* @param {Function} transform The argument transform.
|
|
1837
1557
|
* @returns {Function} Returns the new function.
|
|
1838
1558
|
*/
|
|
1839
|
-
|
|
1840
|
-
function overArg$1(func, transform) {
|
|
1559
|
+
function overArg(func, transform) {
|
|
1841
1560
|
return function(arg) {
|
|
1842
1561
|
return func(transform(arg));
|
|
1843
1562
|
};
|
|
1844
1563
|
}
|
|
1845
1564
|
|
|
1846
|
-
var _overArg = overArg$1;
|
|
1847
|
-
|
|
1848
|
-
var overArg = _overArg;
|
|
1849
|
-
|
|
1850
1565
|
/* Built-in method references for those with the same name as other `lodash` methods. */
|
|
1851
|
-
var nativeKeys
|
|
1852
|
-
|
|
1853
|
-
var _nativeKeys = nativeKeys$1;
|
|
1566
|
+
var nativeKeys = overArg(Object.keys, Object);
|
|
1854
1567
|
|
|
1855
|
-
|
|
1856
|
-
nativeKeys = _nativeKeys;
|
|
1568
|
+
const nativeKeys$1 = nativeKeys;
|
|
1857
1569
|
|
|
1858
1570
|
/** Used for built-in method references. */
|
|
1859
1571
|
var objectProto$2 = Object.prototype;
|
|
@@ -1868,9 +1580,9 @@ var hasOwnProperty$2 = objectProto$2.hasOwnProperty;
|
|
|
1868
1580
|
* @param {Object} object The object to query.
|
|
1869
1581
|
* @returns {Array} Returns the array of property names.
|
|
1870
1582
|
*/
|
|
1871
|
-
function baseKeys
|
|
1583
|
+
function baseKeys(object) {
|
|
1872
1584
|
if (!isPrototype(object)) {
|
|
1873
|
-
return nativeKeys(object);
|
|
1585
|
+
return nativeKeys$1(object);
|
|
1874
1586
|
}
|
|
1875
1587
|
var result = [];
|
|
1876
1588
|
for (var key in Object(object)) {
|
|
@@ -1881,11 +1593,6 @@ function baseKeys$1(object) {
|
|
|
1881
1593
|
return result;
|
|
1882
1594
|
}
|
|
1883
1595
|
|
|
1884
|
-
var _baseKeys = baseKeys$1;
|
|
1885
|
-
|
|
1886
|
-
var isFunction = isFunction_1,
|
|
1887
|
-
isLength$1 = isLength_1;
|
|
1888
|
-
|
|
1889
1596
|
/**
|
|
1890
1597
|
* Checks if `value` is array-like. A value is considered array-like if it's
|
|
1891
1598
|
* not a function and has a `value.length` that's an integer greater than or
|
|
@@ -1911,16 +1618,10 @@ var isFunction = isFunction_1,
|
|
|
1911
1618
|
* _.isArrayLike(_.noop);
|
|
1912
1619
|
* // => false
|
|
1913
1620
|
*/
|
|
1914
|
-
function isArrayLike
|
|
1915
|
-
return value != null && isLength
|
|
1621
|
+
function isArrayLike(value) {
|
|
1622
|
+
return value != null && isLength(value.length) && !isFunction(value);
|
|
1916
1623
|
}
|
|
1917
1624
|
|
|
1918
|
-
var isArrayLike_1 = isArrayLike$3;
|
|
1919
|
-
|
|
1920
|
-
var arrayLikeKeys = _arrayLikeKeys,
|
|
1921
|
-
baseKeys = _baseKeys,
|
|
1922
|
-
isArrayLike$2 = isArrayLike_1;
|
|
1923
|
-
|
|
1924
1625
|
/**
|
|
1925
1626
|
* Creates an array of the own enumerable property names of `object`.
|
|
1926
1627
|
*
|
|
@@ -1949,16 +1650,10 @@ var arrayLikeKeys = _arrayLikeKeys,
|
|
|
1949
1650
|
* _.keys('hi');
|
|
1950
1651
|
* // => ['0', '1']
|
|
1951
1652
|
*/
|
|
1952
|
-
function keys
|
|
1953
|
-
return isArrayLike
|
|
1653
|
+
function keys(object) {
|
|
1654
|
+
return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);
|
|
1954
1655
|
}
|
|
1955
1656
|
|
|
1956
|
-
var keys_1 = keys$3;
|
|
1957
|
-
|
|
1958
|
-
var baseGetAllKeys = _baseGetAllKeys,
|
|
1959
|
-
getSymbols = _getSymbols,
|
|
1960
|
-
keys$2 = keys_1;
|
|
1961
|
-
|
|
1962
1657
|
/**
|
|
1963
1658
|
* Creates an array of own enumerable property names and symbols of `object`.
|
|
1964
1659
|
*
|
|
@@ -1966,14 +1661,10 @@ var baseGetAllKeys = _baseGetAllKeys,
|
|
|
1966
1661
|
* @param {Object} object The object to query.
|
|
1967
1662
|
* @returns {Array} Returns the array of property names and symbols.
|
|
1968
1663
|
*/
|
|
1969
|
-
function getAllKeys
|
|
1970
|
-
return baseGetAllKeys(object, keys
|
|
1664
|
+
function getAllKeys(object) {
|
|
1665
|
+
return baseGetAllKeys(object, keys, getSymbols$1);
|
|
1971
1666
|
}
|
|
1972
1667
|
|
|
1973
|
-
var _getAllKeys = getAllKeys$1;
|
|
1974
|
-
|
|
1975
|
-
var getAllKeys = _getAllKeys;
|
|
1976
|
-
|
|
1977
1668
|
/** Used to compose bitmasks for value comparisons. */
|
|
1978
1669
|
var COMPARE_PARTIAL_FLAG$3 = 1;
|
|
1979
1670
|
|
|
@@ -1996,7 +1687,7 @@ var hasOwnProperty$1 = objectProto$1.hasOwnProperty;
|
|
|
1996
1687
|
* @param {Object} stack Tracks traversed `object` and `other` objects.
|
|
1997
1688
|
* @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
|
|
1998
1689
|
*/
|
|
1999
|
-
function equalObjects
|
|
1690
|
+
function equalObjects(object, other, bitmask, customizer, equalFunc, stack) {
|
|
2000
1691
|
var isPartial = bitmask & COMPARE_PARTIAL_FLAG$3,
|
|
2001
1692
|
objProps = getAllKeys(object),
|
|
2002
1693
|
objLength = objProps.length,
|
|
@@ -2061,47 +1752,25 @@ function equalObjects$1(object, other, bitmask, customizer, equalFunc, stack) {
|
|
|
2061
1752
|
return result;
|
|
2062
1753
|
}
|
|
2063
1754
|
|
|
2064
|
-
var _equalObjects = equalObjects$1;
|
|
2065
|
-
|
|
2066
|
-
var getNative$3 = _getNative,
|
|
2067
|
-
root$3 = _root;
|
|
2068
|
-
|
|
2069
1755
|
/* Built-in method references that are verified to be native. */
|
|
2070
|
-
var DataView
|
|
2071
|
-
|
|
2072
|
-
var _DataView = DataView$1;
|
|
1756
|
+
var DataView = getNative(root, 'DataView');
|
|
2073
1757
|
|
|
2074
|
-
|
|
2075
|
-
root$2 = _root;
|
|
1758
|
+
const DataView$1 = DataView;
|
|
2076
1759
|
|
|
2077
1760
|
/* Built-in method references that are verified to be native. */
|
|
2078
|
-
var Promise$
|
|
1761
|
+
var Promise$1 = getNative(root, 'Promise');
|
|
2079
1762
|
|
|
2080
|
-
|
|
2081
|
-
|
|
2082
|
-
var getNative$1 = _getNative,
|
|
2083
|
-
root$1 = _root;
|
|
1763
|
+
const Promise$2 = Promise$1;
|
|
2084
1764
|
|
|
2085
1765
|
/* Built-in method references that are verified to be native. */
|
|
2086
|
-
var Set
|
|
2087
|
-
|
|
2088
|
-
var _Set = Set$1;
|
|
1766
|
+
var Set = getNative(root, 'Set');
|
|
2089
1767
|
|
|
2090
|
-
|
|
2091
|
-
root = _root;
|
|
1768
|
+
const Set$1 = Set;
|
|
2092
1769
|
|
|
2093
1770
|
/* Built-in method references that are verified to be native. */
|
|
2094
|
-
var WeakMap
|
|
1771
|
+
var WeakMap = getNative(root, 'WeakMap');
|
|
2095
1772
|
|
|
2096
|
-
|
|
2097
|
-
|
|
2098
|
-
var DataView = _DataView,
|
|
2099
|
-
Map$1 = _Map,
|
|
2100
|
-
Promise$1 = _Promise,
|
|
2101
|
-
Set = _Set,
|
|
2102
|
-
WeakMap = _WeakMap,
|
|
2103
|
-
baseGetTag = _baseGetTag,
|
|
2104
|
-
toSource = _toSource;
|
|
1773
|
+
const WeakMap$1 = WeakMap;
|
|
2105
1774
|
|
|
2106
1775
|
/** `Object#toString` result references. */
|
|
2107
1776
|
var mapTag = '[object Map]',
|
|
@@ -2113,11 +1782,11 @@ var mapTag = '[object Map]',
|
|
|
2113
1782
|
var dataViewTag = '[object DataView]';
|
|
2114
1783
|
|
|
2115
1784
|
/** Used to detect maps, sets, and weakmaps. */
|
|
2116
|
-
var dataViewCtorString = toSource(DataView),
|
|
2117
|
-
mapCtorString = toSource(Map$
|
|
2118
|
-
promiseCtorString = toSource(Promise$
|
|
2119
|
-
setCtorString = toSource(Set),
|
|
2120
|
-
weakMapCtorString = toSource(WeakMap);
|
|
1785
|
+
var dataViewCtorString = toSource(DataView$1),
|
|
1786
|
+
mapCtorString = toSource(Map$2),
|
|
1787
|
+
promiseCtorString = toSource(Promise$2),
|
|
1788
|
+
setCtorString = toSource(Set$1),
|
|
1789
|
+
weakMapCtorString = toSource(WeakMap$1);
|
|
2121
1790
|
|
|
2122
1791
|
/**
|
|
2123
1792
|
* Gets the `toStringTag` of `value`.
|
|
@@ -2126,15 +1795,15 @@ var dataViewCtorString = toSource(DataView),
|
|
|
2126
1795
|
* @param {*} value The value to query.
|
|
2127
1796
|
* @returns {string} Returns the `toStringTag`.
|
|
2128
1797
|
*/
|
|
2129
|
-
var getTag
|
|
1798
|
+
var getTag = baseGetTag;
|
|
2130
1799
|
|
|
2131
1800
|
// Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.
|
|
2132
|
-
if ((DataView && getTag
|
|
2133
|
-
(Map$
|
|
2134
|
-
(Promise$
|
|
2135
|
-
(Set && getTag
|
|
2136
|
-
(WeakMap && getTag
|
|
2137
|
-
getTag
|
|
1801
|
+
if ((DataView$1 && getTag(new DataView$1(new ArrayBuffer(1))) != dataViewTag) ||
|
|
1802
|
+
(Map$2 && getTag(new Map$2) != mapTag) ||
|
|
1803
|
+
(Promise$2 && getTag(Promise$2.resolve()) != promiseTag) ||
|
|
1804
|
+
(Set$1 && getTag(new Set$1) != setTag) ||
|
|
1805
|
+
(WeakMap$1 && getTag(new WeakMap$1) != weakMapTag)) {
|
|
1806
|
+
getTag = function(value) {
|
|
2138
1807
|
var result = baseGetTag(value),
|
|
2139
1808
|
Ctor = result == objectTag$1 ? value.constructor : undefined,
|
|
2140
1809
|
ctorString = Ctor ? toSource(Ctor) : '';
|
|
@@ -2152,16 +1821,7 @@ if ((DataView && getTag$1(new DataView(new ArrayBuffer(1))) != dataViewTag) ||
|
|
|
2152
1821
|
};
|
|
2153
1822
|
}
|
|
2154
1823
|
|
|
2155
|
-
|
|
2156
|
-
|
|
2157
|
-
var Stack$1 = _Stack,
|
|
2158
|
-
equalArrays = _equalArrays,
|
|
2159
|
-
equalByTag = _equalByTag,
|
|
2160
|
-
equalObjects = _equalObjects,
|
|
2161
|
-
getTag = _getTag,
|
|
2162
|
-
isArray$7 = isArray_1,
|
|
2163
|
-
isBuffer = isBuffer$2.exports,
|
|
2164
|
-
isTypedArray = isTypedArray_1;
|
|
1824
|
+
const getTag$1 = getTag;
|
|
2165
1825
|
|
|
2166
1826
|
/** Used to compose bitmasks for value comparisons. */
|
|
2167
1827
|
var COMPARE_PARTIAL_FLAG$2 = 1;
|
|
@@ -2191,11 +1851,11 @@ var hasOwnProperty = objectProto.hasOwnProperty;
|
|
|
2191
1851
|
* @param {Object} [stack] Tracks traversed `object` and `other` objects.
|
|
2192
1852
|
* @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
|
|
2193
1853
|
*/
|
|
2194
|
-
function baseIsEqualDeep
|
|
2195
|
-
var objIsArr = isArray$
|
|
2196
|
-
othIsArr = isArray$
|
|
2197
|
-
objTag = objIsArr ? arrayTag : getTag(object),
|
|
2198
|
-
othTag = othIsArr ? arrayTag : getTag(other);
|
|
1854
|
+
function baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {
|
|
1855
|
+
var objIsArr = isArray$1(object),
|
|
1856
|
+
othIsArr = isArray$1(other),
|
|
1857
|
+
objTag = objIsArr ? arrayTag : getTag$1(object),
|
|
1858
|
+
othTag = othIsArr ? arrayTag : getTag$1(other);
|
|
2199
1859
|
|
|
2200
1860
|
objTag = objTag == argsTag ? objectTag : objTag;
|
|
2201
1861
|
othTag = othTag == argsTag ? objectTag : othTag;
|
|
@@ -2204,16 +1864,16 @@ function baseIsEqualDeep$1(object, other, bitmask, customizer, equalFunc, stack)
|
|
|
2204
1864
|
othIsObj = othTag == objectTag,
|
|
2205
1865
|
isSameTag = objTag == othTag;
|
|
2206
1866
|
|
|
2207
|
-
if (isSameTag && isBuffer(object)) {
|
|
2208
|
-
if (!isBuffer(other)) {
|
|
1867
|
+
if (isSameTag && isBuffer$1(object)) {
|
|
1868
|
+
if (!isBuffer$1(other)) {
|
|
2209
1869
|
return false;
|
|
2210
1870
|
}
|
|
2211
1871
|
objIsArr = true;
|
|
2212
1872
|
objIsObj = false;
|
|
2213
1873
|
}
|
|
2214
1874
|
if (isSameTag && !objIsObj) {
|
|
2215
|
-
stack || (stack = new Stack
|
|
2216
|
-
return (objIsArr || isTypedArray(object))
|
|
1875
|
+
stack || (stack = new Stack);
|
|
1876
|
+
return (objIsArr || isTypedArray$1(object))
|
|
2217
1877
|
? equalArrays(object, other, bitmask, customizer, equalFunc, stack)
|
|
2218
1878
|
: equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);
|
|
2219
1879
|
}
|
|
@@ -2225,22 +1885,17 @@ function baseIsEqualDeep$1(object, other, bitmask, customizer, equalFunc, stack)
|
|
|
2225
1885
|
var objUnwrapped = objIsWrapped ? object.value() : object,
|
|
2226
1886
|
othUnwrapped = othIsWrapped ? other.value() : other;
|
|
2227
1887
|
|
|
2228
|
-
stack || (stack = new Stack
|
|
1888
|
+
stack || (stack = new Stack);
|
|
2229
1889
|
return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);
|
|
2230
1890
|
}
|
|
2231
1891
|
}
|
|
2232
1892
|
if (!isSameTag) {
|
|
2233
1893
|
return false;
|
|
2234
1894
|
}
|
|
2235
|
-
stack || (stack = new Stack
|
|
1895
|
+
stack || (stack = new Stack);
|
|
2236
1896
|
return equalObjects(object, other, bitmask, customizer, equalFunc, stack);
|
|
2237
1897
|
}
|
|
2238
1898
|
|
|
2239
|
-
var _baseIsEqualDeep = baseIsEqualDeep$1;
|
|
2240
|
-
|
|
2241
|
-
var baseIsEqualDeep = _baseIsEqualDeep,
|
|
2242
|
-
isObjectLike = isObjectLike_1;
|
|
2243
|
-
|
|
2244
1899
|
/**
|
|
2245
1900
|
* The base implementation of `_.isEqual` which supports partial comparisons
|
|
2246
1901
|
* and tracks traversed objects.
|
|
@@ -2255,21 +1910,16 @@ var baseIsEqualDeep = _baseIsEqualDeep,
|
|
|
2255
1910
|
* @param {Object} [stack] Tracks traversed `value` and `other` objects.
|
|
2256
1911
|
* @returns {boolean} Returns `true` if the values are equivalent, else `false`.
|
|
2257
1912
|
*/
|
|
2258
|
-
function baseIsEqual
|
|
1913
|
+
function baseIsEqual(value, other, bitmask, customizer, stack) {
|
|
2259
1914
|
if (value === other) {
|
|
2260
1915
|
return true;
|
|
2261
1916
|
}
|
|
2262
1917
|
if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {
|
|
2263
1918
|
return value !== value && other !== other;
|
|
2264
1919
|
}
|
|
2265
|
-
return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual
|
|
1920
|
+
return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);
|
|
2266
1921
|
}
|
|
2267
1922
|
|
|
2268
|
-
var _baseIsEqual = baseIsEqual$2;
|
|
2269
|
-
|
|
2270
|
-
var Stack = _Stack,
|
|
2271
|
-
baseIsEqual$1 = _baseIsEqual;
|
|
2272
|
-
|
|
2273
1923
|
/** Used to compose bitmasks for value comparisons. */
|
|
2274
1924
|
var COMPARE_PARTIAL_FLAG$1 = 1,
|
|
2275
1925
|
COMPARE_UNORDERED_FLAG$1 = 2;
|
|
@@ -2284,7 +1934,7 @@ var COMPARE_PARTIAL_FLAG$1 = 1,
|
|
|
2284
1934
|
* @param {Function} [customizer] The function to customize comparisons.
|
|
2285
1935
|
* @returns {boolean} Returns `true` if `object` is a match, else `false`.
|
|
2286
1936
|
*/
|
|
2287
|
-
function baseIsMatch
|
|
1937
|
+
function baseIsMatch(object, source, matchData, customizer) {
|
|
2288
1938
|
var index = matchData.length,
|
|
2289
1939
|
length = index,
|
|
2290
1940
|
noCustomizer = !customizer;
|
|
@@ -2318,7 +1968,7 @@ function baseIsMatch$1(object, source, matchData, customizer) {
|
|
|
2318
1968
|
var result = customizer(objValue, srcValue, key, object, source, stack);
|
|
2319
1969
|
}
|
|
2320
1970
|
if (!(result === undefined
|
|
2321
|
-
? baseIsEqual
|
|
1971
|
+
? baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG$1 | COMPARE_UNORDERED_FLAG$1, customizer, stack)
|
|
2322
1972
|
: result
|
|
2323
1973
|
)) {
|
|
2324
1974
|
return false;
|
|
@@ -2328,10 +1978,6 @@ function baseIsMatch$1(object, source, matchData, customizer) {
|
|
|
2328
1978
|
return true;
|
|
2329
1979
|
}
|
|
2330
1980
|
|
|
2331
|
-
var _baseIsMatch = baseIsMatch$1;
|
|
2332
|
-
|
|
2333
|
-
var isObject$1 = isObject_1;
|
|
2334
|
-
|
|
2335
1981
|
/**
|
|
2336
1982
|
* Checks if `value` is suitable for strict equality comparisons, i.e. `===`.
|
|
2337
1983
|
*
|
|
@@ -2340,15 +1986,10 @@ var isObject$1 = isObject_1;
|
|
|
2340
1986
|
* @returns {boolean} Returns `true` if `value` if suitable for strict
|
|
2341
1987
|
* equality comparisons, else `false`.
|
|
2342
1988
|
*/
|
|
2343
|
-
function isStrictComparable
|
|
2344
|
-
return value === value && !isObject
|
|
1989
|
+
function isStrictComparable(value) {
|
|
1990
|
+
return value === value && !isObject(value);
|
|
2345
1991
|
}
|
|
2346
1992
|
|
|
2347
|
-
var _isStrictComparable = isStrictComparable$2;
|
|
2348
|
-
|
|
2349
|
-
var isStrictComparable$1 = _isStrictComparable,
|
|
2350
|
-
keys$1 = keys_1;
|
|
2351
|
-
|
|
2352
1993
|
/**
|
|
2353
1994
|
* Gets the property names, values, and compare flags of `object`.
|
|
2354
1995
|
*
|
|
@@ -2356,21 +1997,19 @@ var isStrictComparable$1 = _isStrictComparable,
|
|
|
2356
1997
|
* @param {Object} object The object to query.
|
|
2357
1998
|
* @returns {Array} Returns the match data of `object`.
|
|
2358
1999
|
*/
|
|
2359
|
-
function getMatchData
|
|
2360
|
-
var result = keys
|
|
2000
|
+
function getMatchData(object) {
|
|
2001
|
+
var result = keys(object),
|
|
2361
2002
|
length = result.length;
|
|
2362
2003
|
|
|
2363
2004
|
while (length--) {
|
|
2364
2005
|
var key = result[length],
|
|
2365
2006
|
value = object[key];
|
|
2366
2007
|
|
|
2367
|
-
result[length] = [key, value, isStrictComparable
|
|
2008
|
+
result[length] = [key, value, isStrictComparable(value)];
|
|
2368
2009
|
}
|
|
2369
2010
|
return result;
|
|
2370
2011
|
}
|
|
2371
2012
|
|
|
2372
|
-
var _getMatchData = getMatchData$1;
|
|
2373
|
-
|
|
2374
2013
|
/**
|
|
2375
2014
|
* A specialized version of `matchesProperty` for source values suitable
|
|
2376
2015
|
* for strict equality comparisons, i.e. `===`.
|
|
@@ -2380,8 +2019,7 @@ var _getMatchData = getMatchData$1;
|
|
|
2380
2019
|
* @param {*} srcValue The value to match.
|
|
2381
2020
|
* @returns {Function} Returns the new spec function.
|
|
2382
2021
|
*/
|
|
2383
|
-
|
|
2384
|
-
function matchesStrictComparable$2(key, srcValue) {
|
|
2022
|
+
function matchesStrictComparable(key, srcValue) {
|
|
2385
2023
|
return function(object) {
|
|
2386
2024
|
if (object == null) {
|
|
2387
2025
|
return false;
|
|
@@ -2391,12 +2029,6 @@ function matchesStrictComparable$2(key, srcValue) {
|
|
|
2391
2029
|
};
|
|
2392
2030
|
}
|
|
2393
2031
|
|
|
2394
|
-
var _matchesStrictComparable = matchesStrictComparable$2;
|
|
2395
|
-
|
|
2396
|
-
var baseIsMatch = _baseIsMatch,
|
|
2397
|
-
getMatchData = _getMatchData,
|
|
2398
|
-
matchesStrictComparable$1 = _matchesStrictComparable;
|
|
2399
|
-
|
|
2400
2032
|
/**
|
|
2401
2033
|
* The base implementation of `_.matches` which doesn't clone `source`.
|
|
2402
2034
|
*
|
|
@@ -2404,21 +2036,16 @@ var baseIsMatch = _baseIsMatch,
|
|
|
2404
2036
|
* @param {Object} source The object of property values to match.
|
|
2405
2037
|
* @returns {Function} Returns the new spec function.
|
|
2406
2038
|
*/
|
|
2407
|
-
function baseMatches
|
|
2039
|
+
function baseMatches(source) {
|
|
2408
2040
|
var matchData = getMatchData(source);
|
|
2409
2041
|
if (matchData.length == 1 && matchData[0][2]) {
|
|
2410
|
-
return matchesStrictComparable
|
|
2042
|
+
return matchesStrictComparable(matchData[0][0], matchData[0][1]);
|
|
2411
2043
|
}
|
|
2412
2044
|
return function(object) {
|
|
2413
2045
|
return object === source || baseIsMatch(object, source, matchData);
|
|
2414
2046
|
};
|
|
2415
2047
|
}
|
|
2416
2048
|
|
|
2417
|
-
var _baseMatches = baseMatches$1;
|
|
2418
|
-
|
|
2419
|
-
var isArray$6 = isArray_1,
|
|
2420
|
-
isSymbol$4 = isSymbol_1;
|
|
2421
|
-
|
|
2422
2049
|
/** Used to match property names within property paths. */
|
|
2423
2050
|
var reIsDeepProp = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/,
|
|
2424
2051
|
reIsPlainProp = /^\w*$/;
|
|
@@ -2431,23 +2058,19 @@ var reIsDeepProp = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/,
|
|
|
2431
2058
|
* @param {Object} [object] The object to query keys on.
|
|
2432
2059
|
* @returns {boolean} Returns `true` if `value` is a property name, else `false`.
|
|
2433
2060
|
*/
|
|
2434
|
-
function isKey
|
|
2435
|
-
if (isArray$
|
|
2061
|
+
function isKey(value, object) {
|
|
2062
|
+
if (isArray$1(value)) {
|
|
2436
2063
|
return false;
|
|
2437
2064
|
}
|
|
2438
2065
|
var type = typeof value;
|
|
2439
2066
|
if (type == 'number' || type == 'symbol' || type == 'boolean' ||
|
|
2440
|
-
value == null || isSymbol
|
|
2067
|
+
value == null || isSymbol(value)) {
|
|
2441
2068
|
return true;
|
|
2442
2069
|
}
|
|
2443
2070
|
return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||
|
|
2444
2071
|
(object != null && value in Object(object));
|
|
2445
2072
|
}
|
|
2446
2073
|
|
|
2447
|
-
var _isKey = isKey$3;
|
|
2448
|
-
|
|
2449
|
-
var MapCache = _MapCache;
|
|
2450
|
-
|
|
2451
2074
|
/** Error message constants. */
|
|
2452
2075
|
var FUNC_ERROR_TEXT = 'Expected a function';
|
|
2453
2076
|
|
|
@@ -2495,7 +2118,7 @@ var FUNC_ERROR_TEXT = 'Expected a function';
|
|
|
2495
2118
|
* // Replace `_.memoize.Cache`.
|
|
2496
2119
|
* _.memoize.Cache = WeakMap;
|
|
2497
2120
|
*/
|
|
2498
|
-
function memoize
|
|
2121
|
+
function memoize(func, resolver) {
|
|
2499
2122
|
if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {
|
|
2500
2123
|
throw new TypeError(FUNC_ERROR_TEXT);
|
|
2501
2124
|
}
|
|
@@ -2511,16 +2134,12 @@ function memoize$1(func, resolver) {
|
|
|
2511
2134
|
memoized.cache = cache.set(key, result) || cache;
|
|
2512
2135
|
return result;
|
|
2513
2136
|
};
|
|
2514
|
-
memoized.cache = new (memoize
|
|
2137
|
+
memoized.cache = new (memoize.Cache || MapCache);
|
|
2515
2138
|
return memoized;
|
|
2516
2139
|
}
|
|
2517
2140
|
|
|
2518
2141
|
// Expose `MapCache`.
|
|
2519
|
-
memoize
|
|
2520
|
-
|
|
2521
|
-
var memoize_1 = memoize$1;
|
|
2522
|
-
|
|
2523
|
-
var memoize = memoize_1;
|
|
2142
|
+
memoize.Cache = MapCache;
|
|
2524
2143
|
|
|
2525
2144
|
/** Used as the maximum memoize cache size. */
|
|
2526
2145
|
var MAX_MEMOIZE_SIZE = 500;
|
|
@@ -2533,7 +2152,7 @@ var MAX_MEMOIZE_SIZE = 500;
|
|
|
2533
2152
|
* @param {Function} func The function to have its output memoized.
|
|
2534
2153
|
* @returns {Function} Returns the new memoized function.
|
|
2535
2154
|
*/
|
|
2536
|
-
function memoizeCapped
|
|
2155
|
+
function memoizeCapped(func) {
|
|
2537
2156
|
var result = memoize(func, function(key) {
|
|
2538
2157
|
if (cache.size === MAX_MEMOIZE_SIZE) {
|
|
2539
2158
|
cache.clear();
|
|
@@ -2545,10 +2164,6 @@ function memoizeCapped$1(func) {
|
|
|
2545
2164
|
return result;
|
|
2546
2165
|
}
|
|
2547
2166
|
|
|
2548
|
-
var _memoizeCapped = memoizeCapped$1;
|
|
2549
|
-
|
|
2550
|
-
var memoizeCapped = _memoizeCapped;
|
|
2551
|
-
|
|
2552
2167
|
/** Used to match property names within property paths. */
|
|
2553
2168
|
var rePropName = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g;
|
|
2554
2169
|
|
|
@@ -2562,7 +2177,7 @@ var reEscapeChar = /\\(\\)?/g;
|
|
|
2562
2177
|
* @param {string} string The string to convert.
|
|
2563
2178
|
* @returns {Array} Returns the property path array.
|
|
2564
2179
|
*/
|
|
2565
|
-
var stringToPath
|
|
2180
|
+
var stringToPath = memoizeCapped(function(string) {
|
|
2566
2181
|
var result = [];
|
|
2567
2182
|
if (string.charCodeAt(0) === 46 /* . */) {
|
|
2568
2183
|
result.push('');
|
|
@@ -2573,7 +2188,7 @@ var stringToPath$1 = memoizeCapped(function(string) {
|
|
|
2573
2188
|
return result;
|
|
2574
2189
|
});
|
|
2575
2190
|
|
|
2576
|
-
|
|
2191
|
+
const stringToPath$1 = stringToPath;
|
|
2577
2192
|
|
|
2578
2193
|
/**
|
|
2579
2194
|
* A specialized version of `_.map` for arrays without support for iteratee
|
|
@@ -2584,8 +2199,7 @@ var _stringToPath = stringToPath$1;
|
|
|
2584
2199
|
* @param {Function} iteratee The function invoked per iteration.
|
|
2585
2200
|
* @returns {Array} Returns the new mapped array.
|
|
2586
2201
|
*/
|
|
2587
|
-
|
|
2588
|
-
function arrayMap$1(array, iteratee) {
|
|
2202
|
+
function arrayMap(array, iteratee) {
|
|
2589
2203
|
var index = -1,
|
|
2590
2204
|
length = array == null ? 0 : array.length,
|
|
2591
2205
|
result = Array(length);
|
|
@@ -2596,13 +2210,6 @@ function arrayMap$1(array, iteratee) {
|
|
|
2596
2210
|
return result;
|
|
2597
2211
|
}
|
|
2598
2212
|
|
|
2599
|
-
var _arrayMap = arrayMap$1;
|
|
2600
|
-
|
|
2601
|
-
var Symbol = _Symbol,
|
|
2602
|
-
arrayMap = _arrayMap,
|
|
2603
|
-
isArray$5 = isArray_1,
|
|
2604
|
-
isSymbol$3 = isSymbol_1;
|
|
2605
|
-
|
|
2606
2213
|
/** Used as references for various `Number` constants. */
|
|
2607
2214
|
var INFINITY$2 = 1 / 0;
|
|
2608
2215
|
|
|
@@ -2618,26 +2225,22 @@ var symbolProto = Symbol ? Symbol.prototype : undefined,
|
|
|
2618
2225
|
* @param {*} value The value to process.
|
|
2619
2226
|
* @returns {string} Returns the string.
|
|
2620
2227
|
*/
|
|
2621
|
-
function baseToString
|
|
2228
|
+
function baseToString(value) {
|
|
2622
2229
|
// Exit early for strings to avoid a performance hit in some environments.
|
|
2623
2230
|
if (typeof value == 'string') {
|
|
2624
2231
|
return value;
|
|
2625
2232
|
}
|
|
2626
|
-
if (isArray$
|
|
2233
|
+
if (isArray$1(value)) {
|
|
2627
2234
|
// Recursively convert values (susceptible to call stack limits).
|
|
2628
|
-
return arrayMap(value, baseToString
|
|
2235
|
+
return arrayMap(value, baseToString) + '';
|
|
2629
2236
|
}
|
|
2630
|
-
if (isSymbol
|
|
2237
|
+
if (isSymbol(value)) {
|
|
2631
2238
|
return symbolToString ? symbolToString.call(value) : '';
|
|
2632
2239
|
}
|
|
2633
2240
|
var result = (value + '');
|
|
2634
2241
|
return (result == '0' && (1 / value) == -INFINITY$2) ? '-0' : result;
|
|
2635
2242
|
}
|
|
2636
2243
|
|
|
2637
|
-
var _baseToString = baseToString$1;
|
|
2638
|
-
|
|
2639
|
-
var baseToString = _baseToString;
|
|
2640
|
-
|
|
2641
2244
|
/**
|
|
2642
2245
|
* Converts `value` to a string. An empty string is returned for `null`
|
|
2643
2246
|
* and `undefined` values. The sign of `-0` is preserved.
|
|
@@ -2659,17 +2262,10 @@ var baseToString = _baseToString;
|
|
|
2659
2262
|
* _.toString([1, 2, 3]);
|
|
2660
2263
|
* // => '1,2,3'
|
|
2661
2264
|
*/
|
|
2662
|
-
function toString
|
|
2265
|
+
function toString(value) {
|
|
2663
2266
|
return value == null ? '' : baseToString(value);
|
|
2664
2267
|
}
|
|
2665
2268
|
|
|
2666
|
-
var toString_1 = toString$1;
|
|
2667
|
-
|
|
2668
|
-
var isArray$4 = isArray_1,
|
|
2669
|
-
isKey$2 = _isKey,
|
|
2670
|
-
stringToPath = _stringToPath,
|
|
2671
|
-
toString = toString_1;
|
|
2672
|
-
|
|
2673
2269
|
/**
|
|
2674
2270
|
* Casts `value` to a path array if it's not one.
|
|
2675
2271
|
*
|
|
@@ -2678,17 +2274,13 @@ var isArray$4 = isArray_1,
|
|
|
2678
2274
|
* @param {Object} [object] The object to query keys on.
|
|
2679
2275
|
* @returns {Array} Returns the cast property path array.
|
|
2680
2276
|
*/
|
|
2681
|
-
function castPath
|
|
2682
|
-
if (isArray$
|
|
2277
|
+
function castPath(value, object) {
|
|
2278
|
+
if (isArray$1(value)) {
|
|
2683
2279
|
return value;
|
|
2684
2280
|
}
|
|
2685
|
-
return isKey
|
|
2281
|
+
return isKey(value, object) ? [value] : stringToPath$1(toString(value));
|
|
2686
2282
|
}
|
|
2687
2283
|
|
|
2688
|
-
var _castPath = castPath$2;
|
|
2689
|
-
|
|
2690
|
-
var isSymbol$2 = isSymbol_1;
|
|
2691
|
-
|
|
2692
2284
|
/** Used as references for various `Number` constants. */
|
|
2693
2285
|
var INFINITY$1 = 1 / 0;
|
|
2694
2286
|
|
|
@@ -2699,19 +2291,14 @@ var INFINITY$1 = 1 / 0;
|
|
|
2699
2291
|
* @param {*} value The value to inspect.
|
|
2700
2292
|
* @returns {string|symbol} Returns the key.
|
|
2701
2293
|
*/
|
|
2702
|
-
function toKey
|
|
2703
|
-
if (typeof value == 'string' || isSymbol
|
|
2294
|
+
function toKey(value) {
|
|
2295
|
+
if (typeof value == 'string' || isSymbol(value)) {
|
|
2704
2296
|
return value;
|
|
2705
2297
|
}
|
|
2706
2298
|
var result = (value + '');
|
|
2707
2299
|
return (result == '0' && (1 / value) == -INFINITY$1) ? '-0' : result;
|
|
2708
2300
|
}
|
|
2709
2301
|
|
|
2710
|
-
var _toKey = toKey$4;
|
|
2711
|
-
|
|
2712
|
-
var castPath$1 = _castPath,
|
|
2713
|
-
toKey$3 = _toKey;
|
|
2714
|
-
|
|
2715
2302
|
/**
|
|
2716
2303
|
* The base implementation of `_.get` without support for default values.
|
|
2717
2304
|
*
|
|
@@ -2720,22 +2307,18 @@ var castPath$1 = _castPath,
|
|
|
2720
2307
|
* @param {Array|string} path The path of the property to get.
|
|
2721
2308
|
* @returns {*} Returns the resolved value.
|
|
2722
2309
|
*/
|
|
2723
|
-
function baseGet
|
|
2724
|
-
path = castPath
|
|
2310
|
+
function baseGet(object, path) {
|
|
2311
|
+
path = castPath(path, object);
|
|
2725
2312
|
|
|
2726
2313
|
var index = 0,
|
|
2727
2314
|
length = path.length;
|
|
2728
2315
|
|
|
2729
2316
|
while (object != null && index < length) {
|
|
2730
|
-
object = object[toKey
|
|
2317
|
+
object = object[toKey(path[index++])];
|
|
2731
2318
|
}
|
|
2732
2319
|
return (index && index == length) ? object : undefined;
|
|
2733
2320
|
}
|
|
2734
2321
|
|
|
2735
|
-
var _baseGet = baseGet$2;
|
|
2736
|
-
|
|
2737
|
-
var baseGet$1 = _baseGet;
|
|
2738
|
-
|
|
2739
2322
|
/**
|
|
2740
2323
|
* Gets the value at `path` of `object`. If the resolved value is
|
|
2741
2324
|
* `undefined`, the `defaultValue` is returned in its place.
|
|
@@ -2761,13 +2344,11 @@ var baseGet$1 = _baseGet;
|
|
|
2761
2344
|
* _.get(object, 'a.b.c', 'default');
|
|
2762
2345
|
* // => 'default'
|
|
2763
2346
|
*/
|
|
2764
|
-
function get
|
|
2765
|
-
var result = object == null ? undefined : baseGet
|
|
2347
|
+
function get(object, path, defaultValue) {
|
|
2348
|
+
var result = object == null ? undefined : baseGet(object, path);
|
|
2766
2349
|
return result === undefined ? defaultValue : result;
|
|
2767
2350
|
}
|
|
2768
2351
|
|
|
2769
|
-
var get_1 = get$1;
|
|
2770
|
-
|
|
2771
2352
|
/**
|
|
2772
2353
|
* The base implementation of `_.hasIn` without support for deep paths.
|
|
2773
2354
|
*
|
|
@@ -2776,20 +2357,10 @@ var get_1 = get$1;
|
|
|
2776
2357
|
* @param {Array|string} key The key to check.
|
|
2777
2358
|
* @returns {boolean} Returns `true` if `key` exists, else `false`.
|
|
2778
2359
|
*/
|
|
2779
|
-
|
|
2780
|
-
function baseHasIn$1(object, key) {
|
|
2360
|
+
function baseHasIn(object, key) {
|
|
2781
2361
|
return object != null && key in Object(object);
|
|
2782
2362
|
}
|
|
2783
2363
|
|
|
2784
|
-
var _baseHasIn = baseHasIn$1;
|
|
2785
|
-
|
|
2786
|
-
var castPath = _castPath,
|
|
2787
|
-
isArguments = isArguments_1,
|
|
2788
|
-
isArray$3 = isArray_1,
|
|
2789
|
-
isIndex$1 = _isIndex,
|
|
2790
|
-
isLength = isLength_1,
|
|
2791
|
-
toKey$2 = _toKey;
|
|
2792
|
-
|
|
2793
2364
|
/**
|
|
2794
2365
|
* Checks if `path` exists on `object`.
|
|
2795
2366
|
*
|
|
@@ -2799,7 +2370,7 @@ var castPath = _castPath,
|
|
|
2799
2370
|
* @param {Function} hasFunc The function to check properties.
|
|
2800
2371
|
* @returns {boolean} Returns `true` if `path` exists, else `false`.
|
|
2801
2372
|
*/
|
|
2802
|
-
function hasPath
|
|
2373
|
+
function hasPath(object, path, hasFunc) {
|
|
2803
2374
|
path = castPath(path, object);
|
|
2804
2375
|
|
|
2805
2376
|
var index = -1,
|
|
@@ -2807,7 +2378,7 @@ function hasPath$1(object, path, hasFunc) {
|
|
|
2807
2378
|
result = false;
|
|
2808
2379
|
|
|
2809
2380
|
while (++index < length) {
|
|
2810
|
-
var key = toKey
|
|
2381
|
+
var key = toKey(path[index]);
|
|
2811
2382
|
if (!(result = object != null && hasFunc(object, key))) {
|
|
2812
2383
|
break;
|
|
2813
2384
|
}
|
|
@@ -2817,15 +2388,10 @@ function hasPath$1(object, path, hasFunc) {
|
|
|
2817
2388
|
return result;
|
|
2818
2389
|
}
|
|
2819
2390
|
length = object == null ? 0 : object.length;
|
|
2820
|
-
return !!length && isLength(length) && isIndex
|
|
2821
|
-
(isArray$
|
|
2391
|
+
return !!length && isLength(length) && isIndex(key, length) &&
|
|
2392
|
+
(isArray$1(object) || isArguments$1(object));
|
|
2822
2393
|
}
|
|
2823
2394
|
|
|
2824
|
-
var _hasPath = hasPath$1;
|
|
2825
|
-
|
|
2826
|
-
var baseHasIn = _baseHasIn,
|
|
2827
|
-
hasPath = _hasPath;
|
|
2828
|
-
|
|
2829
2395
|
/**
|
|
2830
2396
|
* Checks if `path` is a direct or inherited property of `object`.
|
|
2831
2397
|
*
|
|
@@ -2852,20 +2418,10 @@ var baseHasIn = _baseHasIn,
|
|
|
2852
2418
|
* _.hasIn(object, 'b');
|
|
2853
2419
|
* // => false
|
|
2854
2420
|
*/
|
|
2855
|
-
function hasIn
|
|
2421
|
+
function hasIn(object, path) {
|
|
2856
2422
|
return object != null && hasPath(object, path, baseHasIn);
|
|
2857
2423
|
}
|
|
2858
2424
|
|
|
2859
|
-
var hasIn_1 = hasIn$1;
|
|
2860
|
-
|
|
2861
|
-
var baseIsEqual = _baseIsEqual,
|
|
2862
|
-
get = get_1,
|
|
2863
|
-
hasIn = hasIn_1,
|
|
2864
|
-
isKey$1 = _isKey,
|
|
2865
|
-
isStrictComparable = _isStrictComparable,
|
|
2866
|
-
matchesStrictComparable = _matchesStrictComparable,
|
|
2867
|
-
toKey$1 = _toKey;
|
|
2868
|
-
|
|
2869
2425
|
/** Used to compose bitmasks for value comparisons. */
|
|
2870
2426
|
var COMPARE_PARTIAL_FLAG = 1,
|
|
2871
2427
|
COMPARE_UNORDERED_FLAG = 2;
|
|
@@ -2878,9 +2434,9 @@ var COMPARE_PARTIAL_FLAG = 1,
|
|
|
2878
2434
|
* @param {*} srcValue The value to match.
|
|
2879
2435
|
* @returns {Function} Returns the new spec function.
|
|
2880
2436
|
*/
|
|
2881
|
-
function baseMatchesProperty
|
|
2882
|
-
if (isKey
|
|
2883
|
-
return matchesStrictComparable(toKey
|
|
2437
|
+
function baseMatchesProperty(path, srcValue) {
|
|
2438
|
+
if (isKey(path) && isStrictComparable(srcValue)) {
|
|
2439
|
+
return matchesStrictComparable(toKey(path), srcValue);
|
|
2884
2440
|
}
|
|
2885
2441
|
return function(object) {
|
|
2886
2442
|
var objValue = get(object, path);
|
|
@@ -2890,8 +2446,6 @@ function baseMatchesProperty$1(path, srcValue) {
|
|
|
2890
2446
|
};
|
|
2891
2447
|
}
|
|
2892
2448
|
|
|
2893
|
-
var _baseMatchesProperty = baseMatchesProperty$1;
|
|
2894
|
-
|
|
2895
2449
|
/**
|
|
2896
2450
|
* This method returns the first argument it receives.
|
|
2897
2451
|
*
|
|
@@ -2908,13 +2462,10 @@ var _baseMatchesProperty = baseMatchesProperty$1;
|
|
|
2908
2462
|
* console.log(_.identity(object) === object);
|
|
2909
2463
|
* // => true
|
|
2910
2464
|
*/
|
|
2911
|
-
|
|
2912
|
-
function identity$3(value) {
|
|
2465
|
+
function identity(value) {
|
|
2913
2466
|
return value;
|
|
2914
2467
|
}
|
|
2915
2468
|
|
|
2916
|
-
var identity_1 = identity$3;
|
|
2917
|
-
|
|
2918
2469
|
/**
|
|
2919
2470
|
* The base implementation of `_.property` without support for deep paths.
|
|
2920
2471
|
*
|
|
@@ -2922,17 +2473,12 @@ var identity_1 = identity$3;
|
|
|
2922
2473
|
* @param {string} key The key of the property to get.
|
|
2923
2474
|
* @returns {Function} Returns the new accessor function.
|
|
2924
2475
|
*/
|
|
2925
|
-
|
|
2926
|
-
function baseProperty$1(key) {
|
|
2476
|
+
function baseProperty(key) {
|
|
2927
2477
|
return function(object) {
|
|
2928
2478
|
return object == null ? undefined : object[key];
|
|
2929
2479
|
};
|
|
2930
2480
|
}
|
|
2931
2481
|
|
|
2932
|
-
var _baseProperty = baseProperty$1;
|
|
2933
|
-
|
|
2934
|
-
var baseGet = _baseGet;
|
|
2935
|
-
|
|
2936
2482
|
/**
|
|
2937
2483
|
* A specialized version of `baseProperty` which supports deep paths.
|
|
2938
2484
|
*
|
|
@@ -2940,19 +2486,12 @@ var baseGet = _baseGet;
|
|
|
2940
2486
|
* @param {Array|string} path The path of the property to get.
|
|
2941
2487
|
* @returns {Function} Returns the new accessor function.
|
|
2942
2488
|
*/
|
|
2943
|
-
function basePropertyDeep
|
|
2489
|
+
function basePropertyDeep(path) {
|
|
2944
2490
|
return function(object) {
|
|
2945
2491
|
return baseGet(object, path);
|
|
2946
2492
|
};
|
|
2947
2493
|
}
|
|
2948
2494
|
|
|
2949
|
-
var _basePropertyDeep = basePropertyDeep$1;
|
|
2950
|
-
|
|
2951
|
-
var baseProperty = _baseProperty,
|
|
2952
|
-
basePropertyDeep = _basePropertyDeep,
|
|
2953
|
-
isKey = _isKey,
|
|
2954
|
-
toKey = _toKey;
|
|
2955
|
-
|
|
2956
2495
|
/**
|
|
2957
2496
|
* Creates a function that returns the value at `path` of a given object.
|
|
2958
2497
|
*
|
|
@@ -2975,18 +2514,10 @@ var baseProperty = _baseProperty,
|
|
|
2975
2514
|
* _.map(_.sortBy(objects, _.property(['a', 'b'])), 'a.b');
|
|
2976
2515
|
* // => [1, 2]
|
|
2977
2516
|
*/
|
|
2978
|
-
function property
|
|
2517
|
+
function property(path) {
|
|
2979
2518
|
return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);
|
|
2980
2519
|
}
|
|
2981
2520
|
|
|
2982
|
-
var property_1 = property$1;
|
|
2983
|
-
|
|
2984
|
-
var baseMatches = _baseMatches,
|
|
2985
|
-
baseMatchesProperty = _baseMatchesProperty,
|
|
2986
|
-
identity$2 = identity_1,
|
|
2987
|
-
isArray$2 = isArray_1,
|
|
2988
|
-
property = property_1;
|
|
2989
|
-
|
|
2990
2521
|
/**
|
|
2991
2522
|
* The base implementation of `_.iteratee`.
|
|
2992
2523
|
*
|
|
@@ -2994,27 +2525,23 @@ var baseMatches = _baseMatches,
|
|
|
2994
2525
|
* @param {*} [value=_.identity] The value to convert to an iteratee.
|
|
2995
2526
|
* @returns {Function} Returns the iteratee.
|
|
2996
2527
|
*/
|
|
2997
|
-
function baseIteratee
|
|
2528
|
+
function baseIteratee(value) {
|
|
2998
2529
|
// Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.
|
|
2999
2530
|
// See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.
|
|
3000
2531
|
if (typeof value == 'function') {
|
|
3001
2532
|
return value;
|
|
3002
2533
|
}
|
|
3003
2534
|
if (value == null) {
|
|
3004
|
-
return identity
|
|
2535
|
+
return identity;
|
|
3005
2536
|
}
|
|
3006
2537
|
if (typeof value == 'object') {
|
|
3007
|
-
return isArray$
|
|
2538
|
+
return isArray$1(value)
|
|
3008
2539
|
? baseMatchesProperty(value[0], value[1])
|
|
3009
2540
|
: baseMatches(value);
|
|
3010
2541
|
}
|
|
3011
2542
|
return property(value);
|
|
3012
2543
|
}
|
|
3013
2544
|
|
|
3014
|
-
var _baseIteratee = baseIteratee$2;
|
|
3015
|
-
|
|
3016
|
-
var toNumber = toNumber_1;
|
|
3017
|
-
|
|
3018
2545
|
/** Used as references for various `Number` constants. */
|
|
3019
2546
|
var INFINITY = 1 / 0,
|
|
3020
2547
|
MAX_INTEGER = 1.7976931348623157e+308;
|
|
@@ -3042,7 +2569,7 @@ var INFINITY = 1 / 0,
|
|
|
3042
2569
|
* _.toFinite('3.2');
|
|
3043
2570
|
* // => 3.2
|
|
3044
2571
|
*/
|
|
3045
|
-
function toFinite
|
|
2572
|
+
function toFinite(value) {
|
|
3046
2573
|
if (!value) {
|
|
3047
2574
|
return value === 0 ? value : 0;
|
|
3048
2575
|
}
|
|
@@ -3054,10 +2581,6 @@ function toFinite$2(value) {
|
|
|
3054
2581
|
return value === value ? value : 0;
|
|
3055
2582
|
}
|
|
3056
2583
|
|
|
3057
|
-
var toFinite_1 = toFinite$2;
|
|
3058
|
-
|
|
3059
|
-
var toFinite$1 = toFinite_1;
|
|
3060
|
-
|
|
3061
2584
|
/**
|
|
3062
2585
|
* Converts `value` to an integer.
|
|
3063
2586
|
*
|
|
@@ -3084,19 +2607,13 @@ var toFinite$1 = toFinite_1;
|
|
|
3084
2607
|
* _.toInteger('3.2');
|
|
3085
2608
|
* // => 3
|
|
3086
2609
|
*/
|
|
3087
|
-
function toInteger
|
|
3088
|
-
var result = toFinite
|
|
2610
|
+
function toInteger(value) {
|
|
2611
|
+
var result = toFinite(value),
|
|
3089
2612
|
remainder = result % 1;
|
|
3090
2613
|
|
|
3091
2614
|
return result === result ? (remainder ? result - remainder : result) : 0;
|
|
3092
2615
|
}
|
|
3093
2616
|
|
|
3094
|
-
var toInteger_1 = toInteger$1;
|
|
3095
|
-
|
|
3096
|
-
var baseFindIndex = _baseFindIndex,
|
|
3097
|
-
baseIteratee$1 = _baseIteratee,
|
|
3098
|
-
toInteger = toInteger_1;
|
|
3099
|
-
|
|
3100
2617
|
/* Built-in method references for those with the same name as other `lodash` methods. */
|
|
3101
2618
|
var nativeMax$1 = Math.max;
|
|
3102
2619
|
|
|
@@ -3144,13 +2661,10 @@ function findIndex(array, predicate, fromIndex) {
|
|
|
3144
2661
|
if (index < 0) {
|
|
3145
2662
|
index = nativeMax$1(length + index, 0);
|
|
3146
2663
|
}
|
|
3147
|
-
return baseFindIndex(array, baseIteratee
|
|
2664
|
+
return baseFindIndex(array, baseIteratee(predicate), index);
|
|
3148
2665
|
}
|
|
3149
2666
|
|
|
3150
|
-
var findIndex_1 = findIndex;
|
|
3151
|
-
|
|
3152
2667
|
/* Built-in method references for those with the same name as other `lodash` methods. */
|
|
3153
|
-
|
|
3154
2668
|
var nativeCeil = Math.ceil,
|
|
3155
2669
|
nativeMax = Math.max;
|
|
3156
2670
|
|
|
@@ -3165,7 +2679,7 @@ var nativeCeil = Math.ceil,
|
|
|
3165
2679
|
* @param {boolean} [fromRight] Specify iterating from right to left.
|
|
3166
2680
|
* @returns {Array} Returns the range of numbers.
|
|
3167
2681
|
*/
|
|
3168
|
-
function baseRange
|
|
2682
|
+
function baseRange(start, end, step, fromRight) {
|
|
3169
2683
|
var index = -1,
|
|
3170
2684
|
length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),
|
|
3171
2685
|
result = Array(length);
|
|
@@ -3177,13 +2691,6 @@ function baseRange$1(start, end, step, fromRight) {
|
|
|
3177
2691
|
return result;
|
|
3178
2692
|
}
|
|
3179
2693
|
|
|
3180
|
-
var _baseRange = baseRange$1;
|
|
3181
|
-
|
|
3182
|
-
var eq = eq_1,
|
|
3183
|
-
isArrayLike$1 = isArrayLike_1,
|
|
3184
|
-
isIndex = _isIndex,
|
|
3185
|
-
isObject = isObject_1;
|
|
3186
|
-
|
|
3187
2694
|
/**
|
|
3188
2695
|
* Checks if the given arguments are from an iteratee call.
|
|
3189
2696
|
*
|
|
@@ -3194,13 +2701,13 @@ var eq = eq_1,
|
|
|
3194
2701
|
* @returns {boolean} Returns `true` if the arguments are from an iteratee call,
|
|
3195
2702
|
* else `false`.
|
|
3196
2703
|
*/
|
|
3197
|
-
function isIterateeCall
|
|
2704
|
+
function isIterateeCall(value, index, object) {
|
|
3198
2705
|
if (!isObject(object)) {
|
|
3199
2706
|
return false;
|
|
3200
2707
|
}
|
|
3201
2708
|
var type = typeof index;
|
|
3202
2709
|
if (type == 'number'
|
|
3203
|
-
? (isArrayLike
|
|
2710
|
+
? (isArrayLike(object) && isIndex(index, object.length))
|
|
3204
2711
|
: (type == 'string' && index in object)
|
|
3205
2712
|
) {
|
|
3206
2713
|
return eq(object[index], value);
|
|
@@ -3208,12 +2715,6 @@ function isIterateeCall$1(value, index, object) {
|
|
|
3208
2715
|
return false;
|
|
3209
2716
|
}
|
|
3210
2717
|
|
|
3211
|
-
var _isIterateeCall = isIterateeCall$1;
|
|
3212
|
-
|
|
3213
|
-
var baseRange = _baseRange,
|
|
3214
|
-
isIterateeCall = _isIterateeCall,
|
|
3215
|
-
toFinite = toFinite_1;
|
|
3216
|
-
|
|
3217
2718
|
/**
|
|
3218
2719
|
* Creates a `_.range` or `_.rangeRight` function.
|
|
3219
2720
|
*
|
|
@@ -3221,7 +2722,7 @@ var baseRange = _baseRange,
|
|
|
3221
2722
|
* @param {boolean} [fromRight] Specify iterating from right to left.
|
|
3222
2723
|
* @returns {Function} Returns the new range function.
|
|
3223
2724
|
*/
|
|
3224
|
-
function createRange
|
|
2725
|
+
function createRange(fromRight) {
|
|
3225
2726
|
return function(start, end, step) {
|
|
3226
2727
|
if (step && typeof step != 'number' && isIterateeCall(start, end, step)) {
|
|
3227
2728
|
end = step = undefined;
|
|
@@ -3239,10 +2740,6 @@ function createRange$1(fromRight) {
|
|
|
3239
2740
|
};
|
|
3240
2741
|
}
|
|
3241
2742
|
|
|
3242
|
-
var _createRange = createRange$1;
|
|
3243
|
-
|
|
3244
|
-
var createRange = _createRange;
|
|
3245
|
-
|
|
3246
2743
|
/**
|
|
3247
2744
|
* Creates an array of numbers (positive and/or negative) progressing from
|
|
3248
2745
|
* `start` up to, but not including, `end`. A step of `-1` is used if a negative
|
|
@@ -3286,7 +2783,7 @@ var createRange = _createRange;
|
|
|
3286
2783
|
*/
|
|
3287
2784
|
var range$1 = createRange();
|
|
3288
2785
|
|
|
3289
|
-
|
|
2786
|
+
const range$2 = range$1;
|
|
3290
2787
|
|
|
3291
2788
|
const appendToMap = (map, propName, value) => {
|
|
3292
2789
|
const items = map.get(propName);
|
|
@@ -3549,7 +3046,7 @@ class DataStore {
|
|
|
3549
3046
|
}
|
|
3550
3047
|
// clear items
|
|
3551
3048
|
this.store.set('items', []);
|
|
3552
|
-
const items =
|
|
3049
|
+
const items = range$2(0, (source === null || source === void 0 ? void 0 : source.length) || 0);
|
|
3553
3050
|
// set proxy first
|
|
3554
3051
|
setStore(this.store, {
|
|
3555
3052
|
source,
|
|
@@ -3646,7 +3143,7 @@ function setItems(store, items) {
|
|
|
3646
3143
|
function getSourceItemVirtualIndexByProp(store, prop) {
|
|
3647
3144
|
const items = store.get('items');
|
|
3648
3145
|
const source = store.get('source');
|
|
3649
|
-
const physicalIndex =
|
|
3146
|
+
const physicalIndex = findIndex(source, { prop });
|
|
3650
3147
|
return items.indexOf(physicalIndex);
|
|
3651
3148
|
}
|
|
3652
3149
|
|
|
@@ -3662,8 +3159,7 @@ function getSourceItemVirtualIndexByProp(store, prop) {
|
|
|
3662
3159
|
* the initial value.
|
|
3663
3160
|
* @returns {*} Returns the accumulated value.
|
|
3664
3161
|
*/
|
|
3665
|
-
|
|
3666
|
-
function arrayReduce$1(array, iteratee, accumulator, initAccum) {
|
|
3162
|
+
function arrayReduce(array, iteratee, accumulator, initAccum) {
|
|
3667
3163
|
var index = -1,
|
|
3668
3164
|
length = array == null ? 0 : array.length;
|
|
3669
3165
|
|
|
@@ -3676,8 +3172,6 @@ function arrayReduce$1(array, iteratee, accumulator, initAccum) {
|
|
|
3676
3172
|
return accumulator;
|
|
3677
3173
|
}
|
|
3678
3174
|
|
|
3679
|
-
var _arrayReduce = arrayReduce$1;
|
|
3680
|
-
|
|
3681
3175
|
/**
|
|
3682
3176
|
* Creates a base function for methods like `_.forIn` and `_.forOwn`.
|
|
3683
3177
|
*
|
|
@@ -3685,8 +3179,7 @@ var _arrayReduce = arrayReduce$1;
|
|
|
3685
3179
|
* @param {boolean} [fromRight] Specify iterating from right to left.
|
|
3686
3180
|
* @returns {Function} Returns the new base function.
|
|
3687
3181
|
*/
|
|
3688
|
-
|
|
3689
|
-
function createBaseFor$1(fromRight) {
|
|
3182
|
+
function createBaseFor(fromRight) {
|
|
3690
3183
|
return function(object, iteratee, keysFunc) {
|
|
3691
3184
|
var index = -1,
|
|
3692
3185
|
iterable = Object(object),
|
|
@@ -3703,10 +3196,6 @@ function createBaseFor$1(fromRight) {
|
|
|
3703
3196
|
};
|
|
3704
3197
|
}
|
|
3705
3198
|
|
|
3706
|
-
var _createBaseFor = createBaseFor$1;
|
|
3707
|
-
|
|
3708
|
-
var createBaseFor = _createBaseFor;
|
|
3709
|
-
|
|
3710
3199
|
/**
|
|
3711
3200
|
* The base implementation of `baseForOwn` which iterates over `object`
|
|
3712
3201
|
* properties returned by `keysFunc` and invokes `iteratee` for each property.
|
|
@@ -3718,12 +3207,9 @@ var createBaseFor = _createBaseFor;
|
|
|
3718
3207
|
* @param {Function} keysFunc The function to get the keys of `object`.
|
|
3719
3208
|
* @returns {Object} Returns `object`.
|
|
3720
3209
|
*/
|
|
3721
|
-
var baseFor
|
|
3210
|
+
var baseFor = createBaseFor();
|
|
3722
3211
|
|
|
3723
|
-
|
|
3724
|
-
|
|
3725
|
-
var baseFor = _baseFor,
|
|
3726
|
-
keys = keys_1;
|
|
3212
|
+
const baseFor$1 = baseFor;
|
|
3727
3213
|
|
|
3728
3214
|
/**
|
|
3729
3215
|
* The base implementation of `_.forOwn` without support for iteratee shorthands.
|
|
@@ -3733,14 +3219,10 @@ var baseFor = _baseFor,
|
|
|
3733
3219
|
* @param {Function} iteratee The function invoked per iteration.
|
|
3734
3220
|
* @returns {Object} Returns `object`.
|
|
3735
3221
|
*/
|
|
3736
|
-
function baseForOwn
|
|
3737
|
-
return object && baseFor(object, iteratee, keys);
|
|
3222
|
+
function baseForOwn(object, iteratee) {
|
|
3223
|
+
return object && baseFor$1(object, iteratee, keys);
|
|
3738
3224
|
}
|
|
3739
3225
|
|
|
3740
|
-
var _baseForOwn = baseForOwn$1;
|
|
3741
|
-
|
|
3742
|
-
var isArrayLike = isArrayLike_1;
|
|
3743
|
-
|
|
3744
3226
|
/**
|
|
3745
3227
|
* Creates a `baseEach` or `baseEachRight` function.
|
|
3746
3228
|
*
|
|
@@ -3749,7 +3231,7 @@ var isArrayLike = isArrayLike_1;
|
|
|
3749
3231
|
* @param {boolean} [fromRight] Specify iterating from right to left.
|
|
3750
3232
|
* @returns {Function} Returns the new base function.
|
|
3751
3233
|
*/
|
|
3752
|
-
function createBaseEach
|
|
3234
|
+
function createBaseEach(eachFunc, fromRight) {
|
|
3753
3235
|
return function(collection, iteratee) {
|
|
3754
3236
|
if (collection == null) {
|
|
3755
3237
|
return collection;
|
|
@@ -3770,11 +3252,6 @@ function createBaseEach$1(eachFunc, fromRight) {
|
|
|
3770
3252
|
};
|
|
3771
3253
|
}
|
|
3772
3254
|
|
|
3773
|
-
var _createBaseEach = createBaseEach$1;
|
|
3774
|
-
|
|
3775
|
-
var baseForOwn = _baseForOwn,
|
|
3776
|
-
createBaseEach = _createBaseEach;
|
|
3777
|
-
|
|
3778
3255
|
/**
|
|
3779
3256
|
* The base implementation of `_.forEach` without support for iteratee shorthands.
|
|
3780
3257
|
*
|
|
@@ -3783,9 +3260,9 @@ var baseForOwn = _baseForOwn,
|
|
|
3783
3260
|
* @param {Function} iteratee The function invoked per iteration.
|
|
3784
3261
|
* @returns {Array|Object} Returns `collection`.
|
|
3785
3262
|
*/
|
|
3786
|
-
var baseEach
|
|
3263
|
+
var baseEach = createBaseEach(baseForOwn);
|
|
3787
3264
|
|
|
3788
|
-
|
|
3265
|
+
const baseEach$1 = baseEach;
|
|
3789
3266
|
|
|
3790
3267
|
/**
|
|
3791
3268
|
* The base implementation of `_.reduce` and `_.reduceRight`, without support
|
|
@@ -3800,8 +3277,7 @@ var _baseEach = baseEach$2;
|
|
|
3800
3277
|
* @param {Function} eachFunc The function to iterate over `collection`.
|
|
3801
3278
|
* @returns {*} Returns the accumulated value.
|
|
3802
3279
|
*/
|
|
3803
|
-
|
|
3804
|
-
function baseReduce$1(collection, iteratee, accumulator, initAccum, eachFunc) {
|
|
3280
|
+
function baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {
|
|
3805
3281
|
eachFunc(collection, function(value, index, collection) {
|
|
3806
3282
|
accumulator = initAccum
|
|
3807
3283
|
? (initAccum = false, value)
|
|
@@ -3810,14 +3286,6 @@ function baseReduce$1(collection, iteratee, accumulator, initAccum, eachFunc) {
|
|
|
3810
3286
|
return accumulator;
|
|
3811
3287
|
}
|
|
3812
3288
|
|
|
3813
|
-
var _baseReduce = baseReduce$1;
|
|
3814
|
-
|
|
3815
|
-
var arrayReduce = _arrayReduce,
|
|
3816
|
-
baseEach$1 = _baseEach,
|
|
3817
|
-
baseIteratee = _baseIteratee,
|
|
3818
|
-
baseReduce = _baseReduce,
|
|
3819
|
-
isArray$1 = isArray_1;
|
|
3820
|
-
|
|
3821
3289
|
/**
|
|
3822
3290
|
* Reduces `collection` to a value which is the accumulated result of running
|
|
3823
3291
|
* each element in `collection` thru `iteratee`, where each successive
|
|
@@ -3862,8 +3330,6 @@ function reduce(collection, iteratee, accumulator) {
|
|
|
3862
3330
|
return func(collection, baseIteratee(iteratee), accumulator, initAccum, baseEach$1);
|
|
3863
3331
|
}
|
|
3864
3332
|
|
|
3865
|
-
var reduce_1 = reduce;
|
|
3866
|
-
|
|
3867
3333
|
/**
|
|
3868
3334
|
* A specialized version of `_.forEach` for arrays without support for
|
|
3869
3335
|
* iteratee shorthands.
|
|
@@ -3873,8 +3339,7 @@ var reduce_1 = reduce;
|
|
|
3873
3339
|
* @param {Function} iteratee The function invoked per iteration.
|
|
3874
3340
|
* @returns {Array} Returns `array`.
|
|
3875
3341
|
*/
|
|
3876
|
-
|
|
3877
|
-
function arrayEach$1(array, iteratee) {
|
|
3342
|
+
function arrayEach(array, iteratee) {
|
|
3878
3343
|
var index = -1,
|
|
3879
3344
|
length = array == null ? 0 : array.length;
|
|
3880
3345
|
|
|
@@ -3886,10 +3351,6 @@ function arrayEach$1(array, iteratee) {
|
|
|
3886
3351
|
return array;
|
|
3887
3352
|
}
|
|
3888
3353
|
|
|
3889
|
-
var _arrayEach = arrayEach$1;
|
|
3890
|
-
|
|
3891
|
-
var identity$1 = identity_1;
|
|
3892
|
-
|
|
3893
3354
|
/**
|
|
3894
3355
|
* Casts `value` to `identity` if it's not a function.
|
|
3895
3356
|
*
|
|
@@ -3897,17 +3358,10 @@ var identity$1 = identity_1;
|
|
|
3897
3358
|
* @param {*} value The value to inspect.
|
|
3898
3359
|
* @returns {Function} Returns cast function.
|
|
3899
3360
|
*/
|
|
3900
|
-
function castFunction
|
|
3901
|
-
return typeof value == 'function' ? value : identity
|
|
3361
|
+
function castFunction(value) {
|
|
3362
|
+
return typeof value == 'function' ? value : identity;
|
|
3902
3363
|
}
|
|
3903
3364
|
|
|
3904
|
-
var _castFunction = castFunction$1;
|
|
3905
|
-
|
|
3906
|
-
var arrayEach = _arrayEach,
|
|
3907
|
-
baseEach = _baseEach,
|
|
3908
|
-
castFunction = _castFunction,
|
|
3909
|
-
isArray = isArray_1;
|
|
3910
|
-
|
|
3911
3365
|
/**
|
|
3912
3366
|
* Iterates over elements of `collection` and invokes `iteratee` for each element.
|
|
3913
3367
|
* The iteratee is invoked with three arguments: (value, index|key, collection).
|
|
@@ -3939,16 +3393,10 @@ var arrayEach = _arrayEach,
|
|
|
3939
3393
|
* // => Logs 'a' then 'b' (iteration order is not guaranteed).
|
|
3940
3394
|
*/
|
|
3941
3395
|
function forEach(collection, iteratee) {
|
|
3942
|
-
var func = isArray(collection) ? arrayEach : baseEach;
|
|
3396
|
+
var func = isArray$1(collection) ? arrayEach : baseEach$1;
|
|
3943
3397
|
return func(collection, castFunction(iteratee));
|
|
3944
3398
|
}
|
|
3945
3399
|
|
|
3946
|
-
var forEach_1 = forEach;
|
|
3947
|
-
|
|
3948
|
-
var each = forEach_1;
|
|
3949
|
-
|
|
3950
|
-
var isSymbol$1 = isSymbol_1;
|
|
3951
|
-
|
|
3952
3400
|
/** Used as references for the maximum length and index of an array. */
|
|
3953
3401
|
var MAX_ARRAY_LENGTH$1 = 4294967295,
|
|
3954
3402
|
MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH$1 - 1;
|
|
@@ -3970,7 +3418,7 @@ var nativeFloor = Math.floor,
|
|
|
3970
3418
|
* @returns {number} Returns the index at which `value` should be inserted
|
|
3971
3419
|
* into `array`.
|
|
3972
3420
|
*/
|
|
3973
|
-
function baseSortedIndexBy
|
|
3421
|
+
function baseSortedIndexBy(array, value, iteratee, retHighest) {
|
|
3974
3422
|
var low = 0,
|
|
3975
3423
|
high = array == null ? 0 : array.length;
|
|
3976
3424
|
if (high === 0) {
|
|
@@ -3980,7 +3428,7 @@ function baseSortedIndexBy$1(array, value, iteratee, retHighest) {
|
|
|
3980
3428
|
value = iteratee(value);
|
|
3981
3429
|
var valIsNaN = value !== value,
|
|
3982
3430
|
valIsNull = value === null,
|
|
3983
|
-
valIsSymbol = isSymbol
|
|
3431
|
+
valIsSymbol = isSymbol(value),
|
|
3984
3432
|
valIsUndefined = value === undefined;
|
|
3985
3433
|
|
|
3986
3434
|
while (low < high) {
|
|
@@ -3989,7 +3437,7 @@ function baseSortedIndexBy$1(array, value, iteratee, retHighest) {
|
|
|
3989
3437
|
othIsDefined = computed !== undefined,
|
|
3990
3438
|
othIsNull = computed === null,
|
|
3991
3439
|
othIsReflexive = computed === computed,
|
|
3992
|
-
othIsSymbol = isSymbol
|
|
3440
|
+
othIsSymbol = isSymbol(computed);
|
|
3993
3441
|
|
|
3994
3442
|
if (valIsNaN) {
|
|
3995
3443
|
var setLow = retHighest || othIsReflexive;
|
|
@@ -4013,12 +3461,6 @@ function baseSortedIndexBy$1(array, value, iteratee, retHighest) {
|
|
|
4013
3461
|
return nativeMin(high, MAX_ARRAY_INDEX);
|
|
4014
3462
|
}
|
|
4015
3463
|
|
|
4016
|
-
var _baseSortedIndexBy = baseSortedIndexBy$1;
|
|
4017
|
-
|
|
4018
|
-
var baseSortedIndexBy = _baseSortedIndexBy,
|
|
4019
|
-
identity = identity_1,
|
|
4020
|
-
isSymbol = isSymbol_1;
|
|
4021
|
-
|
|
4022
3464
|
/** Used as references for the maximum length and index of an array. */
|
|
4023
3465
|
var MAX_ARRAY_LENGTH = 4294967295,
|
|
4024
3466
|
HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1;
|
|
@@ -4035,7 +3477,7 @@ var MAX_ARRAY_LENGTH = 4294967295,
|
|
|
4035
3477
|
* @returns {number} Returns the index at which `value` should be inserted
|
|
4036
3478
|
* into `array`.
|
|
4037
3479
|
*/
|
|
4038
|
-
function baseSortedIndex
|
|
3480
|
+
function baseSortedIndex(array, value, retHighest) {
|
|
4039
3481
|
var low = 0,
|
|
4040
3482
|
high = array == null ? low : array.length;
|
|
4041
3483
|
|
|
@@ -4056,10 +3498,6 @@ function baseSortedIndex$1(array, value, retHighest) {
|
|
|
4056
3498
|
return baseSortedIndexBy(array, value, identity, retHighest);
|
|
4057
3499
|
}
|
|
4058
3500
|
|
|
4059
|
-
var _baseSortedIndex = baseSortedIndex$1;
|
|
4060
|
-
|
|
4061
|
-
var baseSortedIndex = _baseSortedIndex;
|
|
4062
|
-
|
|
4063
3501
|
/**
|
|
4064
3502
|
* Uses a binary search to determine the lowest index at which `value`
|
|
4065
3503
|
* should be inserted into `array` in order to maintain its sort order.
|
|
@@ -4081,8 +3519,6 @@ function sortedIndex(array, value) {
|
|
|
4081
3519
|
return baseSortedIndex(array, value);
|
|
4082
3520
|
}
|
|
4083
3521
|
|
|
4084
|
-
var sortedIndex_1 = sortedIndex;
|
|
4085
|
-
|
|
4086
3522
|
/**
|
|
4087
3523
|
* Pre-calculation
|
|
4088
3524
|
* Dimension custom sizes for each cell
|
|
@@ -4096,12 +3532,12 @@ function calculateDimensionData(originItemSize, newSizes = {}) {
|
|
|
4096
3532
|
const sizes = Object.assign({}, newSizes);
|
|
4097
3533
|
// prepare order sorted new sizes and calculate changed real size
|
|
4098
3534
|
let newIndexes = [];
|
|
4099
|
-
|
|
3535
|
+
forEach(newSizes, (_, i) => {
|
|
4100
3536
|
const index = parseInt(i, 10);
|
|
4101
|
-
newIndexes[
|
|
3537
|
+
newIndexes[sortedIndex(newIndexes, index)] = index;
|
|
4102
3538
|
});
|
|
4103
3539
|
// fill new coordinates based on what is changed
|
|
4104
|
-
|
|
3540
|
+
reduce(newIndexes, (previous, itemIndex, i) => {
|
|
4105
3541
|
const newItem = {
|
|
4106
3542
|
itemIndex,
|
|
4107
3543
|
start: 0,
|
|
@@ -4137,7 +3573,7 @@ const getItemByPosition = ({ indexes, positionIndexes, originItemSize, positionI
|
|
|
4137
3573
|
start: 0,
|
|
4138
3574
|
end: 0,
|
|
4139
3575
|
};
|
|
4140
|
-
const currentPlace = indexes.length ?
|
|
3576
|
+
const currentPlace = indexes.length ? sortedIndex(positionIndexes, pos) : 0;
|
|
4141
3577
|
// not found or first index
|
|
4142
3578
|
if (!currentPlace) {
|
|
4143
3579
|
item.itemIndex = Math.floor(pos / originItemSize);
|
|
@@ -4169,7 +3605,7 @@ function getItemByIndex(dimension, index) {
|
|
|
4169
3605
|
return dimension.indexToItem[index];
|
|
4170
3606
|
}
|
|
4171
3607
|
const currentPlace = dimension.indexes.length
|
|
4172
|
-
?
|
|
3608
|
+
? sortedIndex(dimension.indexes, index)
|
|
4173
3609
|
: 0;
|
|
4174
3610
|
// not found or first index
|
|
4175
3611
|
if (!currentPlace) {
|
|
@@ -4413,6 +3849,6 @@ function applyMixins(derivedCtor, constructors) {
|
|
|
4413
3849
|
});
|
|
4414
3850
|
}
|
|
4415
3851
|
|
|
4416
|
-
export { OsPlatform as $, HEADER_SORTABLE_CLASS as A, HEADER_ROW_CLASS as B, CELL_CLASS as C, DataStore as D, HEADER_ACTUAL_ROW_CLASS as E, DRAG_ICON_CLASS as F, DRAGGABLE_CLASS as G, HEADER_CLASS as H, FOCUS_CLASS as I, MOBILE_CLASS as J, CELL_HANDLER_CLASS as K, EDIT_INPUT_WR as L, MIN_COL_SIZE as M, DRAGG_TEXT as N, GRID_INTERNALS as O, ROW_FOCUSED_CLASS as P, codesLetter as Q, RESIZE_INTERVAL as R, SELECTION_BORDER_CLASS as S, TMP_SELECTION_BG_CLASS as T, keyValues as U, createStore as V,
|
|
3852
|
+
export { OsPlatform as $, HEADER_SORTABLE_CLASS as A, HEADER_ROW_CLASS as B, CELL_CLASS as C, DataStore as D, HEADER_ACTUAL_ROW_CLASS as E, DRAG_ICON_CLASS as F, DRAGGABLE_CLASS as G, HEADER_CLASS as H, FOCUS_CLASS as I, MOBILE_CLASS as J, CELL_HANDLER_CLASS as K, EDIT_INPUT_WR as L, MIN_COL_SIZE as M, DRAGG_TEXT as N, GRID_INTERNALS as O, ROW_FOCUSED_CLASS as P, codesLetter as Q, RESIZE_INTERVAL as R, SELECTION_BORDER_CLASS as S, TMP_SELECTION_BG_CLASS as T, keyValues as U, createStore as V, reduce as W, forEach as X, toInteger as Y, isIterateeCall as Z, isArray$1 as _, getVisibleSourceItem as a, KeyCodesEnum as a0, baseProperty as a1, isArrayLike as a2, getTag$1 as a3, baseKeys as a4, range$2 as a5, findIndex as a6, getNative as a7, baseEach$1 as a8, baseIteratee as a9, getSourceItem as b, setSourceByPhysicalIndex as c, setItems as d, getSourceItemVirtualIndexByProp as e, gatherTrimmedItems as f, getPhysical as g, calculateDimensionData as h, getItemByPosition as i, getItemByIndex as j, findPositionInArray as k, pushSorted as l, mergeSortedArray as m, getScrollbarSize as n, scaleValue as o, proxyPlugin as p, timeout as q, range as r, setSourceByVirtualIndex as s, trimmedPlugin as t, applyMixins as u, setStore as v, DATA_COL as w, DATA_ROW as x, DISABLED_CLASS as y, ROW_HEADER_TYPE as z };
|
|
4417
3853
|
|
|
4418
|
-
//# sourceMappingURL=index-
|
|
3854
|
+
//# sourceMappingURL=index-b6586f9b.js.map
|