Newer
Older
197001
197002
197003
197004
197005
197006
197007
197008
197009
197010
197011
197012
197013
197014
197015
197016
197017
197018
197019
197020
197021
197022
197023
197024
197025
197026
197027
197028
197029
197030
197031
197032
197033
197034
197035
197036
197037
197038
197039
197040
197041
197042
197043
197044
197045
197046
197047
197048
197049
197050
197051
197052
197053
197054
197055
197056
197057
197058
197059
197060
197061
197062
197063
197064
197065
197066
197067
197068
197069
197070
197071
197072
197073
197074
197075
197076
197077
197078
197079
197080
197081
197082
197083
197084
197085
197086
197087
197088
197089
197090
197091
197092
197093
197094
197095
197096
197097
197098
197099
197100
197101
197102
197103
197104
197105
197106
197107
197108
197109
197110
197111
197112
197113
197114
197115
197116
197117
197118
197119
197120
197121
197122
197123
197124
197125
197126
197127
197128
197129
197130
197131
197132
197133
197134
197135
197136
197137
197138
197139
197140
197141
197142
197143
197144
197145
197146
197147
197148
197149
197150
197151
197152
197153
197154
197155
197156
197157
197158
197159
197160
197161
197162
197163
197164
197165
197166
197167
197168
197169
197170
197171
197172
197173
197174
197175
197176
197177
197178
197179
197180
197181
197182
197183
197184
197185
197186
197187
197188
197189
197190
197191
197192
197193
197194
197195
197196
197197
197198
197199
197200
197201
197202
197203
197204
197205
197206
197207
197208
197209
197210
197211
197212
197213
197214
197215
197216
197217
197218
197219
197220
197221
197222
197223
197224
197225
197226
197227
197228
197229
197230
197231
197232
197233
197234
197235
197236
197237
197238
197239
197240
197241
197242
197243
197244
197245
197246
197247
197248
197249
197250
197251
197252
197253
197254
197255
197256
197257
197258
197259
197260
197261
197262
197263
197264
197265
197266
197267
197268
197269
197270
197271
197272
197273
197274
197275
197276
197277
197278
197279
197280
197281
197282
197283
197284
197285
197286
197287
197288
197289
197290
197291
197292
197293
197294
197295
197296
197297
197298
197299
197300
197301
197302
197303
197304
197305
197306
197307
197308
197309
197310
197311
197312
197313
197314
197315
197316
197317
197318
197319
197320
197321
197322
197323
197324
197325
197326
197327
197328
197329
197330
197331
197332
197333
197334
197335
197336
197337
197338
197339
197340
197341
197342
197343
197344
197345
197346
197347
197348
197349
197350
197351
197352
197353
197354
197355
197356
197357
197358
197359
197360
197361
197362
197363
197364
197365
197366
197367
197368
197369
197370
197371
197372
197373
197374
197375
197376
197377
197378
197379
197380
197381
197382
197383
197384
197385
197386
197387
197388
197389
197390
197391
197392
197393
197394
197395
197396
197397
197398
197399
197400
197401
197402
197403
197404
197405
197406
197407
197408
197409
197410
197411
197412
197413
197414
197415
197416
197417
197418
197419
197420
197421
197422
197423
197424
197425
197426
197427
197428
197429
197430
197431
197432
197433
197434
197435
197436
197437
197438
197439
197440
197441
197442
197443
197444
197445
197446
197447
197448
197449
197450
197451
197452
197453
197454
197455
197456
197457
197458
197459
197460
197461
197462
197463
197464
197465
197466
197467
197468
197469
197470
197471
197472
197473
197474
197475
197476
197477
197478
197479
197480
197481
197482
197483
197484
197485
197486
197487
197488
197489
197490
197491
197492
197493
197494
197495
197496
197497
197498
197499
197500
197501
197502
197503
197504
197505
197506
197507
197508
197509
197510
197511
197512
197513
197514
197515
197516
197517
197518
197519
197520
197521
197522
197523
197524
197525
197526
197527
197528
197529
197530
197531
197532
197533
197534
197535
197536
197537
197538
197539
197540
197541
197542
197543
197544
197545
197546
197547
197548
197549
197550
197551
197552
197553
197554
197555
197556
197557
197558
197559
197560
197561
197562
197563
197564
197565
197566
197567
197568
197569
197570
197571
197572
197573
197574
197575
197576
197577
197578
197579
197580
197581
197582
197583
197584
197585
197586
197587
197588
197589
197590
197591
197592
197593
197594
197595
197596
197597
197598
197599
197600
197601
197602
197603
197604
197605
197606
197607
197608
197609
197610
197611
197612
197613
197614
197615
197616
197617
197618
197619
197620
197621
197622
197623
197624
197625
197626
197627
197628
197629
197630
197631
197632
197633
197634
197635
197636
197637
197638
197639
197640
197641
197642
197643
197644
197645
197646
197647
197648
197649
197650
197651
197652
197653
197654
197655
197656
197657
197658
197659
197660
197661
197662
197663
197664
197665
197666
197667
197668
197669
197670
197671
197672
197673
197674
197675
197676
197677
197678
197679
197680
197681
197682
197683
197684
197685
197686
197687
197688
197689
197690
197691
197692
197693
197694
197695
197696
197697
197698
197699
197700
197701
197702
197703
197704
197705
197706
197707
197708
197709
197710
197711
197712
197713
197714
197715
197716
197717
197718
197719
197720
197721
197722
197723
197724
197725
197726
197727
197728
197729
197730
197731
197732
197733
197734
197735
197736
197737
197738
197739
197740
197741
197742
197743
197744
197745
197746
197747
197748
197749
197750
197751
197752
197753
197754
197755
197756
197757
197758
197759
197760
197761
197762
197763
197764
197765
197766
197767
197768
197769
197770
197771
197772
197773
197774
197775
197776
197777
197778
197779
197780
197781
197782
197783
197784
197785
197786
197787
197788
197789
197790
197791
197792
197793
197794
197795
197796
197797
197798
197799
197800
197801
197802
197803
197804
197805
197806
197807
197808
197809
197810
197811
197812
197813
197814
197815
197816
197817
197818
197819
197820
197821
197822
197823
197824
197825
197826
197827
197828
197829
197830
197831
197832
197833
197834
197835
197836
197837
197838
197839
197840
197841
197842
197843
197844
197845
197846
197847
197848
197849
197850
197851
197852
197853
197854
197855
197856
197857
197858
197859
197860
197861
197862
197863
197864
197865
197866
197867
197868
197869
197870
197871
197872
197873
197874
197875
197876
197877
197878
197879
197880
197881
197882
197883
197884
197885
197886
197887
197888
197889
197890
197891
197892
197893
197894
197895
197896
197897
197898
197899
197900
197901
197902
197903
197904
197905
197906
197907
197908
197909
197910
197911
197912
197913
197914
197915
197916
197917
197918
197919
197920
197921
197922
197923
197924
197925
197926
197927
197928
197929
197930
197931
197932
197933
197934
197935
197936
197937
197938
197939
197940
197941
197942
197943
197944
197945
197946
197947
197948
197949
197950
197951
197952
197953
197954
197955
197956
197957
197958
197959
197960
197961
197962
197963
197964
197965
197966
197967
197968
197969
197970
197971
197972
197973
197974
197975
197976
197977
197978
197979
197980
197981
197982
197983
197984
197985
197986
197987
197988
197989
197990
197991
197992
197993
197994
197995
197996
197997
197998
197999
198000
return this._bulkSave(documents, options)
}
/**
* @private
*
* Meat of the method bulkSave
*/
static _bulkSave(documents, options = {}) {
const { concurrency = 30, logProgress, ...createOrUpdateOptions } = options
return parallelMap(
documents,
doc => {
if (logProgress) {
logProgress(doc)
}
return this.createOrUpdate(doc, createOrUpdateOptions)
},
concurrency
)
}
static query(index, options) {
if (this.usesCozyClient()) {
throw new Error('This method is not implemented yet with CozyClient')
}
return this.queryViaOldClient(index, options)
}
static queryViaOldClient(index, options) {
return this.cozyClient.data.query(index, options)
}
static async fetchAll() {
const stackClient = this.usesCozyClient()
? this.cozyClient.stackClient
: this.cozyClient
try {
const result = await stackClient.fetchJSON(
'GET',
`/data/${this.doctype}/_all_docs?include_docs=true`
)
return result.rows
.filter(x => x.id.indexOf('_design') !== 0 && x.doc)
.map(x => x.doc)
} catch (e) {
if (e && e.response && e.response.status && e.response.status === 404) {
return []
} else {
return []
}
}
}
static async updateAll(docs) {
const stackClient = this.usesCozyClient()
? this.cozyClient.stackClient
: this.cozyClient
if (!docs || !docs.length) {
return Promise.resolve([])
}
try {
const update = await stackClient.fetchJSON(
'POST',
`/data/${this.doctype}/_bulk_docs`,
{
docs
}
)
return update
} catch (e) {
if (
e.reason &&
e.reason.reason &&
e.reason.reason == DATABASE_DOES_NOT_EXIST
) {
const firstDoc = await this.create(docs[0])
const resp = await this.updateAll(docs.slice(1))
resp.unshift({ ok: true, id: firstDoc._id, rev: firstDoc._rev })
return resp
} else {
throw e
}
}
}
static async deleteAll(docs) {
return this.updateAll(docs.map(flagForDeletion))
}
/**
* Find duplicates in a list of documents according to the
* idAttributes of the class. Priority is given to the document
* prior in the list.
*
* To introduce the notion of priority, you can sort your input docs
* according to this priorirty.
*
* @param {Array[object]} docs
* @return {Array[object]} Duplicates
*/
static findDuplicates(docs) {
const fieldSeparator = '#$$$$#'
const idAttributes = this.idAttributes
const key = doc => {
return idAttributes
.map(idAttrPath => get(doc, idAttrPath))
.join(fieldSeparator)
}
const groups = pickBy(groupBy(docs, key), group => group.length > 1)
const duplicates = flatMap(groups, group => group.slice(1))
return duplicates
}
/**
* Delete duplicates on the server. Find duplicates according to the
* idAttributes.
*
* @param {Function} Priority (optional). Among duplicates, which one should be prioritized)
* @return {Promise}
* @example
* ```
* deleteDuplicates(doc => -doc.dateImport) // will duplicate documents so that the oldest document is conserved
* ```
*/
static async deleteDuplicates(priorityFn) {
let allDocs = await this.fetchAll()
if (priorityFn) {
allDocs = sortBy(allDocs, priorityFn)
}
const duplicates = this.findDuplicates(allDocs)
return this.deleteAll(duplicates)
}
/**
* Use Couch _changes API
*
* @param {string} since Starting sequence for changes
* @param {[type]} options { includeDesign: false, includeDeleted: false }
*/
static async fetchChanges(since, options = {}) {
const stackClient = this.usesCozyClient()
? this.cozyClient.stackClient
: this.cozyClient
const queryParams = {
since,
include_docs: 'true'
}
if (options.params) {
Object.assign(queryParams, options.params)
}
const result = await stackClient.fetchJSON(
'GET',
`/data/${this.doctype}/_changes?${querystring.stringify(queryParams)}`
)
const newLastSeq = result.last_seq
let docs = result.results.map(x => x.doc).filter(Boolean)
if (!options.includeDesign) {
docs = docs.filter(doc => doc._id.indexOf('_design') !== 0)
}
if (!options.includeDeleted) {
docs = docs.filter(doc => !doc._deleted)
}
return { newLastSeq, documents: docs }
}
/**
* Fetches all documents for a given doctype exceeding the 100 limit.
* It is slower that fetchAll because it fetches the data 100 by 100 but allows to filter the data
* with a selector and an index
*
* Parameters:
*
* * `selector` (object): the mango query selector
* * `index` (object): (optional) the query selector index. If not defined, the function will
* create it's own index with the keys specified in the selector
*
*
* ```javascript
* const documents = await Bills.queryAll({vendor: 'Direct Energie'})
* ```
*
*/
static async queryAll(selector, index) {
if (this.usesCozyClient()) {
return this.queryAllViaNewClient(selector)
}
return this.queryAllViaOldClient(selector, index)
}
static async queryAllViaNewClient(selector) {
if (!selector) {
return this.fetchAll()
}
const result = []
const query = this.cozyClient.find(this.doctype).where(selector)
let resp = { next: true }
while (resp && resp.next) {
resp = await this.cozyClient.query(query.offset(result.length))
result.push(...resp.data)
}
return result
}
static async queryAllViaOldClient(selector, indexArg) {
if (!selector) {
// fetchAll is faster in this case
return await this.fetchAll()
}
let index = indexArg
if (!index) {
index = await this.cozyClient.data.defineIndex(
this.doctype,
Object.keys(selector)
)
}
const result = []
let resp = { next: true }
while (resp && resp.next) {
resp = await this.cozyClient.data.query(index, {
selector,
wholeResponse: true,
skip: result.length
})
result.push(...resp.docs)
}
return result
}
/**
* Fetch in one request a batch of documents by id.
* @param {String[]} ids - Ids of documents to fetch
* @return {Promise} - Promise resolving to an array of documents, unfound document are filtered
*/
static async getAll(ids) {
const stackClient = this.usesCozyClient()
? this.cozyClient.stackClient
: this.cozyClient
let resp
try {
resp = await stackClient.fetchJSON(
'POST',
`/data/${this.doctype}/_all_docs?include_docs=true`,
{
keys: ids
}
)
} catch (error) {
if (error.message.match(/not_found/)) {
return []
}
throw error
}
const rows = resp.rows.filter(row => row.doc)
return rows.map(row => row.doc)
}
}
Document.defaultDuplicateHandling = 'throw'
Document.duplicateHandlingStrategies = {
throw: function(duplicates, selector) {
throw new Error(
'Create or update with selectors that returns more than 1 result\n' +
JSON.stringify(selector) +
'\n' +
JSON.stringify(duplicates)
)
},
remove: async function(duplicates) {
const docsToRemove = duplicates.slice(1)
if (docsToRemove.length > 0) {
log(
'warn',
`Cleaning duplicates for doctype ${this.doctype} (kept: ${
duplicates[0]._id
}, removed: ${docsToRemove.map(x => x._id)})`
)
await this.deleteAll(docsToRemove)
}
}
}
module.exports = Document
/***/ }),
/* 1394 */
/***/ (function(module, exports, __webpack_require__) {
var arrayMap = __webpack_require__(1395),
baseClone = __webpack_require__(1396),
baseUnset = __webpack_require__(1503),
castPath = __webpack_require__(1504),
copyObject = __webpack_require__(1446),
customOmitClone = __webpack_require__(1517),
flatRest = __webpack_require__(1519),
getAllKeysIn = __webpack_require__(1483);
/** Used to compose bitmasks for cloning. */
var CLONE_DEEP_FLAG = 1,
CLONE_FLAT_FLAG = 2,
CLONE_SYMBOLS_FLAG = 4;
/**
* The opposite of `_.pick`; this method creates an object composed of the
* own and inherited enumerable property paths of `object` that are not omitted.
*
* **Note:** This method is considerably slower than `_.pick`.
*
* @static
* @since 0.1.0
* @memberOf _
* @category Object
* @param {Object} object The source object.
* @param {...(string|string[])} [paths] The property paths to omit.
* @returns {Object} Returns the new object.
* @example
*
* var object = { 'a': 1, 'b': '2', 'c': 3 };
*
* _.omit(object, ['a', 'c']);
* // => { 'b': '2' }
*/
var omit = flatRest(function(object, paths) {
var result = {};
if (object == null) {
return result;
}
var isDeep = false;
paths = arrayMap(paths, function(path) {
path = castPath(path, object);
isDeep || (isDeep = path.length > 1);
return path;
});
copyObject(object, getAllKeysIn(object), result);
if (isDeep) {
result = baseClone(result, CLONE_DEEP_FLAG | CLONE_FLAT_FLAG | CLONE_SYMBOLS_FLAG, customOmitClone);
}
var length = paths.length;
while (length--) {
baseUnset(result, paths[length]);
}
return result;
});
module.exports = omit;
/***/ }),
/* 1395 */
/***/ (function(module, exports) {
/**
* A specialized version of `_.map` for arrays without support for iteratee
* shorthands.
*
* @private
* @param {Array} [array] The array to iterate over.
* @param {Function} iteratee The function invoked per iteration.
* @returns {Array} Returns the new mapped array.
*/
function arrayMap(array, iteratee) {
var index = -1,
length = array == null ? 0 : array.length,
result = Array(length);
while (++index < length) {
result[index] = iteratee(array[index], index, array);
}
return result;
}
module.exports = arrayMap;
/***/ }),
/* 1396 */
/***/ (function(module, exports, __webpack_require__) {
var Stack = __webpack_require__(1397),
arrayEach = __webpack_require__(1441),
assignValue = __webpack_require__(1442),
baseAssign = __webpack_require__(1445),
baseAssignIn = __webpack_require__(1467),
cloneBuffer = __webpack_require__(1471),
copyArray = __webpack_require__(1472),
copySymbols = __webpack_require__(1473),
copySymbolsIn = __webpack_require__(1477),
getAllKeys = __webpack_require__(1481),
getAllKeysIn = __webpack_require__(1483),
getTag = __webpack_require__(1484),
initCloneArray = __webpack_require__(1489),
initCloneByTag = __webpack_require__(1490),
initCloneObject = __webpack_require__(1497),
isArray = __webpack_require__(1453),
isBuffer = __webpack_require__(1454),
isMap = __webpack_require__(1499),
isObject = __webpack_require__(1421),
isSet = __webpack_require__(1501),
keys = __webpack_require__(1447);
/** Used to compose bitmasks for cloning. */
var CLONE_DEEP_FLAG = 1,
CLONE_FLAT_FLAG = 2,
CLONE_SYMBOLS_FLAG = 4;
/** `Object#toString` result references. */
var argsTag = '[object Arguments]',
arrayTag = '[object Array]',
boolTag = '[object Boolean]',
dateTag = '[object Date]',
errorTag = '[object Error]',
funcTag = '[object Function]',
genTag = '[object GeneratorFunction]',
mapTag = '[object Map]',
numberTag = '[object Number]',
objectTag = '[object Object]',
regexpTag = '[object RegExp]',
setTag = '[object Set]',
stringTag = '[object String]',
symbolTag = '[object Symbol]',
weakMapTag = '[object WeakMap]';
var arrayBufferTag = '[object ArrayBuffer]',
dataViewTag = '[object DataView]',
float32Tag = '[object Float32Array]',
float64Tag = '[object Float64Array]',
int8Tag = '[object Int8Array]',
int16Tag = '[object Int16Array]',
int32Tag = '[object Int32Array]',
uint8Tag = '[object Uint8Array]',
uint8ClampedTag = '[object Uint8ClampedArray]',
uint16Tag = '[object Uint16Array]',
uint32Tag = '[object Uint32Array]';
/** Used to identify `toStringTag` values supported by `_.clone`. */
var cloneableTags = {};
cloneableTags[argsTag] = cloneableTags[arrayTag] =
cloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =
cloneableTags[boolTag] = cloneableTags[dateTag] =
cloneableTags[float32Tag] = cloneableTags[float64Tag] =
cloneableTags[int8Tag] = cloneableTags[int16Tag] =
cloneableTags[int32Tag] = cloneableTags[mapTag] =
cloneableTags[numberTag] = cloneableTags[objectTag] =
cloneableTags[regexpTag] = cloneableTags[setTag] =
cloneableTags[stringTag] = cloneableTags[symbolTag] =
cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =
cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;
cloneableTags[errorTag] = cloneableTags[funcTag] =
cloneableTags[weakMapTag] = false;
/**
* The base implementation of `_.clone` and `_.cloneDeep` which tracks
* traversed objects.
*
* @private
* @param {*} value The value to clone.
* @param {boolean} bitmask The bitmask flags.
* 1 - Deep clone
* 2 - Flatten inherited properties
* 4 - Clone symbols
* @param {Function} [customizer] The function to customize cloning.
* @param {string} [key] The key of `value`.
* @param {Object} [object] The parent object of `value`.
* @param {Object} [stack] Tracks traversed objects and their clone counterparts.
* @returns {*} Returns the cloned value.
*/
function baseClone(value, bitmask, customizer, key, object, stack) {
var result,
isDeep = bitmask & CLONE_DEEP_FLAG,
isFlat = bitmask & CLONE_FLAT_FLAG,
isFull = bitmask & CLONE_SYMBOLS_FLAG;
if (customizer) {
result = object ? customizer(value, key, object, stack) : customizer(value);
}
if (result !== undefined) {
return result;
}
if (!isObject(value)) {
return value;
}
var isArr = isArray(value);
if (isArr) {
result = initCloneArray(value);
if (!isDeep) {
return copyArray(value, result);
}
} else {
var tag = getTag(value),
isFunc = tag == funcTag || tag == genTag;
if (isBuffer(value)) {
return cloneBuffer(value, isDeep);
}
if (tag == objectTag || tag == argsTag || (isFunc && !object)) {
result = (isFlat || isFunc) ? {} : initCloneObject(value);
if (!isDeep) {
return isFlat
? copySymbolsIn(value, baseAssignIn(result, value))
: copySymbols(value, baseAssign(result, value));
}
} else {
if (!cloneableTags[tag]) {
return object ? value : {};
}
result = initCloneByTag(value, tag, isDeep);
}
}
// Check for circular references and return its corresponding clone.
stack || (stack = new Stack);
var stacked = stack.get(value);
if (stacked) {
return stacked;
}
stack.set(value, result);
if (isSet(value)) {
value.forEach(function(subValue) {
result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));
});
} else if (isMap(value)) {
value.forEach(function(subValue, key) {
result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));
});
}
var keysFunc = isFull
? (isFlat ? getAllKeysIn : getAllKeys)
: (isFlat ? keysIn : keys);
var props = isArr ? undefined : keysFunc(value);
arrayEach(props || value, function(subValue, key) {
if (props) {
key = subValue;
subValue = value[key];
}
// Recursively populate clone (susceptible to call stack limits).
assignValue(result, key, baseClone(subValue, bitmask, customizer, key, value, stack));
});
return result;
}
module.exports = baseClone;
/***/ }),
/* 1397 */
/***/ (function(module, exports, __webpack_require__) {
var ListCache = __webpack_require__(1398),
stackClear = __webpack_require__(1406),
stackDelete = __webpack_require__(1407),
stackGet = __webpack_require__(1408),
stackHas = __webpack_require__(1409),
stackSet = __webpack_require__(1410);
/**
* Creates a stack cache object to store key-value pairs.
*
* @private
* @constructor
* @param {Array} [entries] The key-value pairs to cache.
*/
function Stack(entries) {
var data = this.__data__ = new ListCache(entries);
this.size = data.size;
}
// Add methods to `Stack`.
Stack.prototype.clear = stackClear;
Stack.prototype['delete'] = stackDelete;
Stack.prototype.get = stackGet;
Stack.prototype.has = stackHas;
Stack.prototype.set = stackSet;
module.exports = Stack;
/***/ }),
/* 1398 */
/***/ (function(module, exports, __webpack_require__) {
var listCacheClear = __webpack_require__(1399),
listCacheDelete = __webpack_require__(1400),
listCacheGet = __webpack_require__(1403),
listCacheHas = __webpack_require__(1404),
listCacheSet = __webpack_require__(1405);
/**
* Creates an list cache object.
*
* @private
* @constructor
* @param {Array} [entries] The key-value pairs to cache.
*/
function ListCache(entries) {
var index = -1,
length = entries == null ? 0 : entries.length;
this.clear();
while (++index < length) {
var entry = entries[index];
this.set(entry[0], entry[1]);
}
}
// Add methods to `ListCache`.
ListCache.prototype.clear = listCacheClear;
ListCache.prototype['delete'] = listCacheDelete;
ListCache.prototype.get = listCacheGet;
ListCache.prototype.has = listCacheHas;
ListCache.prototype.set = listCacheSet;
module.exports = ListCache;
/***/ }),
/* 1399 */
/***/ (function(module, exports) {
/**
* Removes all key-value entries from the list cache.
*
* @private
* @name clear
* @memberOf ListCache
*/
function listCacheClear() {
this.__data__ = [];
this.size = 0;
}
module.exports = listCacheClear;
/***/ }),
/* 1400 */
/***/ (function(module, exports, __webpack_require__) {
var assocIndexOf = __webpack_require__(1401);
/** Used for built-in method references. */
var arrayProto = Array.prototype;
/** Built-in value references. */
var splice = arrayProto.splice;
/**
* Removes `key` and its value from the list cache.
*
* @private
* @name delete
* @memberOf ListCache
* @param {string} key The key of the value to remove.
* @returns {boolean} Returns `true` if the entry was removed, else `false`.
*/
function listCacheDelete(key) {
var data = this.__data__,
index = assocIndexOf(data, key);
if (index < 0) {
return false;
}
var lastIndex = data.length - 1;
if (index == lastIndex) {
data.pop();
} else {
splice.call(data, index, 1);
}
--this.size;
return true;
}
module.exports = listCacheDelete;
/***/ }),
/* 1401 */
/***/ (function(module, exports, __webpack_require__) {
var eq = __webpack_require__(1402);
/**
* Gets the index at which the `key` is found in `array` of key-value pairs.
*
* @private
* @param {Array} array The array to inspect.
* @param {*} key The key to search for.
* @returns {number} Returns the index of the matched value, else `-1`.
*/
function assocIndexOf(array, key) {
var length = array.length;
while (length--) {
if (eq(array[length][0], key)) {
return length;
}
}
return -1;
}
module.exports = assocIndexOf;
/***/ }),
/* 1402 */
/***/ (function(module, exports) {
/**
* Performs a
* [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
* comparison between two values to determine if they are equivalent.
*
* @static
* @memberOf _
* @since 4.0.0
* @category Lang
* @param {*} value The value to compare.
* @param {*} other The other value to compare.
* @returns {boolean} Returns `true` if the values are equivalent, else `false`.
* @example
*
* var object = { 'a': 1 };
* var other = { 'a': 1 };
*
* _.eq(object, object);
* // => true
*
* _.eq(object, other);
* // => false
*
* _.eq('a', 'a');
* // => true
*
* _.eq('a', Object('a'));
* // => false
*
* _.eq(NaN, NaN);
* // => true
*/
function eq(value, other) {
return value === other || (value !== value && other !== other);
}
module.exports = eq;
/***/ }),
/* 1403 */
/***/ (function(module, exports, __webpack_require__) {
var assocIndexOf = __webpack_require__(1401);
/**
* Gets the list cache value for `key`.
*
* @private
* @name get
* @memberOf ListCache
* @param {string} key The key of the value to get.
* @returns {*} Returns the entry value.
*/
function listCacheGet(key) {
var data = this.__data__,
index = assocIndexOf(data, key);
return index < 0 ? undefined : data[index][1];
}
module.exports = listCacheGet;
/***/ }),
/* 1404 */
/***/ (function(module, exports, __webpack_require__) {
var assocIndexOf = __webpack_require__(1401);
/**
* Checks if a list cache value for `key` exists.
*
* @private
* @name has
* @memberOf ListCache
* @param {string} key The key of the entry to check.
* @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
*/
function listCacheHas(key) {
return assocIndexOf(this.__data__, key) > -1;
}
module.exports = listCacheHas;
/***/ }),
/* 1405 */
/***/ (function(module, exports, __webpack_require__) {
var assocIndexOf = __webpack_require__(1401);
/**
* Sets the list cache `key` to `value`.
*
* @private
* @name set
* @memberOf ListCache
* @param {string} key The key of the value to set.
* @param {*} value The value to set.
* @returns {Object} Returns the list cache instance.
*/
function listCacheSet(key, value) {
var data = this.__data__,
index = assocIndexOf(data, key);
if (index < 0) {
++this.size;
data.push([key, value]);
} else {
data[index][1] = value;
}
return this;
}
module.exports = listCacheSet;
/***/ }),
/* 1406 */
/***/ (function(module, exports, __webpack_require__) {
var ListCache = __webpack_require__(1398);
/**
* Removes all key-value entries from the stack.
*
* @private
* @name clear
* @memberOf Stack
*/
function stackClear() {
this.__data__ = new ListCache;
this.size = 0;
}
module.exports = stackClear;
/***/ }),
/* 1407 */
/***/ (function(module, exports) {
/**
* Removes `key` and its value from the stack.
*
* @private
* @name delete
* @memberOf Stack
* @param {string} key The key of the value to remove.
* @returns {boolean} Returns `true` if the entry was removed, else `false`.
*/
function stackDelete(key) {
var data = this.__data__,
result = data['delete'](key);
this.size = data.size;
return result;
}
module.exports = stackDelete;
/***/ }),
/* 1408 */
/***/ (function(module, exports) {
/**
* Gets the stack value for `key`.
*
* @private
* @name get
* @memberOf Stack
* @param {string} key The key of the value to get.
* @returns {*} Returns the entry value.
*/
function stackGet(key) {
return this.__data__.get(key);
}
module.exports = stackGet;
/***/ }),
/* 1409 */
/***/ (function(module, exports) {
/**
* Checks if a stack value for `key` exists.
*
* @private
* @name has
* @memberOf Stack
* @param {string} key The key of the entry to check.
* @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
*/
function stackHas(key) {
return this.__data__.has(key);
}
module.exports = stackHas;
/***/ }),
/* 1410 */
/***/ (function(module, exports, __webpack_require__) {
var ListCache = __webpack_require__(1398),
Map = __webpack_require__(1411),
MapCache = __webpack_require__(1426);
/** Used as the size to enable large array optimizations. */
var LARGE_ARRAY_SIZE = 200;
/**
* Sets the stack `key` to `value`.
*
* @private
* @name set
* @memberOf Stack
* @param {string} key The key of the value to set.
* @param {*} value The value to set.
* @returns {Object} Returns the stack cache instance.
*/
function stackSet(key, value) {
var data = this.__data__;
if (data instanceof ListCache) {
var pairs = data.__data__;
if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {
pairs.push([key, value]);
this.size = ++data.size;
return this;
}
data = this.__data__ = new MapCache(pairs);
}
data.set(key, value);
this.size = data.size;
return this;
}
module.exports = stackSet;
/***/ }),
/* 1411 */
/***/ (function(module, exports, __webpack_require__) {
var getNative = __webpack_require__(1412),
root = __webpack_require__(1417);
/* Built-in method references that are verified to be native. */
var Map = getNative(root, 'Map');
module.exports = Map;
/***/ }),
/* 1412 */
/***/ (function(module, exports, __webpack_require__) {
var baseIsNative = __webpack_require__(1413),
getValue = __webpack_require__(1425);
/**
* Gets the native function at `key` of `object`.
*
* @private
* @param {Object} object The object to query.
* @param {string} key The key of the method to get.
* @returns {*} Returns the function if it's native, else `undefined`.
*/
function getNative(object, key) {
var value = getValue(object, key);
return baseIsNative(value) ? value : undefined;
}