JasTobi/WeihnachtsKalenderMelly
3
0
Fork 0
Code Issues 3 Pull Requests Releases 4 Activity

update, text, response

Browse Source
This commit is contained in:
Jason
2025-11-02 11:09:14 +01:00
parent 14776c86b0
commit eed8a4ddcf
2794 changed files with 156786 additions and 129204 deletions
Download Patch File Download Diff File Expand all files Collapse all files

164
node_modules/immutable/README.md generated vendored
View File

@@ -2,7 +2,7 @@
[![Build Status](https://github.com/immutable-js/immutable-js/actions/workflows/ci.yml/badge.svg?branch=main)](https://github.com/immutable-js/immutable-js/actions/workflows/ci.yml?query=branch%3Amain) [Chat on slack](https://immutable-js.slack.com)
[Read the docs](https://immutable-js.com) and eat your vegetables.
[Read the docs](https://immutable-js.com/docs/) and eat your vegetables.
Docs are automatically generated from [README.md][] and [immutable.d.ts][].
Please contribute! Also, don't miss the [wiki][] which contains articles on
@@ -58,21 +58,23 @@ Want to hear more? Watch the presentation about Immutable.js:
Install `immutable` using npm.
```shell
# using npm
npm install immutable
```
Or install using yarn.
```shell
# using Yarn
yarn add immutable
# using pnpm
pnpm add immutable
# using Bun
bun add immutable
```
Then require it into any module.
<!-- runkit:activate -->
```js
const { Map } = require('immutable');
import { Map } from 'immutable';
const map1 = Map({ a: 1, b: 2, c: 3 });
const map2 = map1.set('b', 50);
map1.get('b') + ' vs. ' + map2.get('b'); // 2 vs. 50
@@ -82,7 +84,7 @@ map1.get('b') + ' vs. ' + map2.get('b'); // 2 vs. 50
Immutable.js has no dependencies, which makes it predictable to include in a Browser.
It's highly recommended to use a module bundler like [webpack](https://webpack.github.io/),
It's highly recommended to use a module bundler like [webpack](https://webpack.js.org/),
[rollup](https://rollupjs.org/), or
[browserify](https://browserify.org/). The `immutable` npm module works
without any additional consideration. All examples throughout the documentation
@@ -122,9 +124,9 @@ collections in your [Flowtype](https://flowtype.org/) or [TypeScript](https://ty
advantage of type generics, error detection, and auto-complete in your IDE.
Installing `immutable` via npm brings with it type definitions for Flow (v0.55.0 or higher)
and TypeScript (v2.1.0 or higher), so you shouldn't need to do anything at all!
and TypeScript (v4.5 or higher), so you shouldn't need to do anything at all!
#### Using TypeScript with Immutable.js v4
#### Using TypeScript with Immutable.js v4+
Immutable.js type definitions embrace ES2015. While Immutable.js itself supports
legacy browsers and environments, its type definitions require TypeScript's 2015
@@ -132,10 +134,8 @@ lib. Include either `"target": "es2015"` or `"lib": "es2015"` in your
`tsconfig.json`, or provide `--target es2015` or `--lib es2015` to the
`tsc` command.
<!-- runkit:activate -->
```js
const { Map } = require('immutable');
import { Map } from 'immutable';
const map1 = Map({ a: 1, b: 2, c: 3 });
const map2 = map1.set('b', 50);
map1.get('b') + ' vs. ' + map2.get('b'); // 2 vs. 50
@@ -148,9 +148,9 @@ via relative path to the type definitions at the top of your file.
```js
///<reference path='./node_modules/immutable/dist/immutable.d.ts'/>
import Immutable from 'immutable';
var map1: Immutable.Map<string, number>;
map1 = Immutable.Map({ a: 1, b: 2, c: 3 });
import { Map } from 'immutable';
var map1: Map<string, number>;
map1 = Map({ a: 1, b: 2, c: 3 });
var map2 = map1.set('b', 50);
map1.get('b'); // 2
map2.get('b'); // 50
@@ -183,10 +183,8 @@ treat Immutable.js collections as values, it's important to use the
`Immutable.is()` function or `.equals()` method to determine _value equality_
instead of the `===` operator which determines object _reference identity_.
<!-- runkit:activate -->
```js
const { Map } = require('immutable');
import { Map } from 'immutable';
const map1 = Map({ a: 1, b: 2, c: 3 });
const map2 = Map({ a: 1, b: 2, c: 3 });
map1.equals(map2); // true
@@ -201,10 +199,8 @@ which would prefer to re-run the function if a deeper equality check could
potentially be more costly. The `===` equality check is also used internally by
`Immutable.is` and `.equals()` as a performance optimization.
<!-- runkit:activate -->
```js
const { Map } = require('immutable');
import { Map } from 'immutable';
const map1 = Map({ a: 1, b: 2, c: 3 });
const map2 = map1.set('b', 2); // Set to same value
map1 === map2; // true
@@ -215,10 +211,8 @@ to it instead of copying the entire object. Because a reference is much smaller
than the object itself, this results in memory savings and a potential boost in
execution speed for programs which rely on copies (such as an undo-stack).
<!-- runkit:activate -->
```js
const { Map } = require('immutable');
import { Map } from 'immutable';
const map = Map({ a: 1, b: 2, c: 3 });
const mapCopy = map; // Look, "copies" are free!
```
@@ -226,7 +220,6 @@ const mapCopy = map; // Look, "copies" are free!
[React]: https://reactjs.org/
[Flux]: https://facebook.github.io/flux/docs/in-depth-overview/
## JavaScript-first API
While Immutable.js is inspired by Clojure, Scala, Haskell and other functional
@@ -244,10 +237,8 @@ the collection, like `push`, `set`, `unshift` or `splice`, instead return a new
immutable collection. Methods which return new arrays, like `slice` or `concat`,
instead return new immutable collections.
<!-- runkit:activate -->
```js
const { List } = require('immutable');
import { List } from 'immutable';
const list1 = List([1, 2]);
const list2 = list1.push(3, 4, 5);
const list3 = list2.unshift(0);
@@ -264,10 +255,8 @@ Almost all of the methods on [Array][] will be found in similar form on
found on `Immutable.Set`, including collection operations like `forEach()`
and `map()`.
<!-- runkit:activate -->
```js
const { Map } = require('immutable');
import { Map } from 'immutable';
const alpha = Map({ a: 1, b: 2, c: 3, d: 4 });
alpha.map((v, k) => k.toUpperCase()).join();
// 'A,B,C,D'
@@ -279,10 +268,8 @@ Designed to inter-operate with your existing JavaScript, Immutable.js
accepts plain JavaScript Arrays and Objects anywhere a method expects a
`Collection`.
<!-- runkit:activate -->
```js
const { Map, List } = require('immutable');
import { Map, List } from 'immutable';
const map1 = Map({ a: 1, b: 2, c: 3, d: 4 });
const map2 = Map({ c: 10, a: 20, t: 30 });
const obj = { d: 100, o: 200, g: 300 };
@@ -301,13 +288,11 @@ collection methods on JavaScript Objects, which otherwise have a very sparse
native API. Because Seq evaluates lazily and does not cache intermediate
results, these operations can be extremely efficient.
<!-- runkit:activate -->
```js
const { Seq } = require('immutable');
import { Seq } from 'immutable';
const myObject = { a: 1, b: 2, c: 3 };
Seq(myObject)
.map(x => x * x)
.map((x) => x * x)
.toObject();
// { a: 1, b: 4, c: 9 }
```
@@ -316,10 +301,8 @@ Keep in mind, when using JS objects to construct Immutable Maps, that
JavaScript Object properties are always strings, even if written in a quote-less
shorthand, while Immutable Maps accept keys of any type.
<!-- runkit:activate -->
```js
const { fromJS } = require('immutable');
import { fromJS } from 'immutable';
const obj = { 1: 'one' };
console.log(Object.keys(obj)); // [ "1" ]
@@ -341,10 +324,8 @@ All Immutable Collections also implement `toJSON()` allowing them to be passed
to `JSON.stringify` directly. They also respect the custom `toJSON()` methods of
nested objects.
<!-- runkit:activate -->
```js
const { Map, List } = require('immutable');
import { Map, List } from 'immutable';
const deep = Map({ a: 1, b: 2, c: List([3, 4, 5]) });
console.log(deep.toObject()); // { a: 1, b: 2, c: List [ 3, 4, 5 ] }
console.log(deep.toArray()); // [ 1, 2, List [ 3, 4, 5 ] ]
@@ -365,7 +346,7 @@ browsers, they need to be translated to ES5.
```js
// ES2015
const mapped = foo.map(x => x * x);
const mapped = foo.map((x) => x * x);
// ES5
var mapped = foo.map(function (x) {
return x * x;
@@ -375,10 +356,8 @@ var mapped = foo.map(function (x) {
All Immutable.js collections are [Iterable][iterators], which allows them to be
used anywhere an Iterable is expected, such as when spreading into an Array.
<!-- runkit:activate -->
```js
const { List } = require('immutable');
import { List } from 'immutable';
const aList = List([1, 2, 3]);
const anArray = [0, ...aList, 4, 5]; // [ 0, 1, 2, 3, 4, 5 ]
```
@@ -391,16 +370,13 @@ not always be well defined, as is the case for the `Map` and `Set`.
[Classes]: https://wiki.ecmascript.org/doku.php?id=strawman:maximally_minimal_classes
[Modules]: https://www.2ality.com/2014/09/es6-modules-final.html
## Nested Structures
The collections in Immutable.js are intended to be nested, allowing for deep
trees of data, similar to JSON.
<!-- runkit:activate -->
```js
const { fromJS } = require('immutable');
import { fromJS } from 'immutable';
const nested = fromJS({ a: { b: { c: [3, 4, 5] } } });
// Map { a: Map { b: Map { c: List [ 3, 4, 5 ] } } }
```
@@ -409,10 +385,8 @@ A few power-tools allow for reading and operating on nested data. The
most useful are `mergeDeep`, `getIn`, `setIn`, and `updateIn`, found on `List`,
`Map` and `OrderedMap`.
<!-- runkit:activate -->
```js
const { fromJS } = require('immutable');
import { fromJS } from 'immutable';
const nested = fromJS({ a: { b: { c: [3, 4, 5] } } });
const nested2 = nested.mergeDeep({ a: { b: { d: 6 } } });
@@ -420,11 +394,11 @@ const nested2 = nested.mergeDeep({ a: { b: { d: 6 } } });
console.log(nested2.getIn(['a', 'b', 'd'])); // 6
const nested3 = nested2.updateIn(['a', 'b', 'd'], value => value + 1);
const nested3 = nested2.updateIn(['a', 'b', 'd'], (value) => value + 1);
console.log(nested3);
// Map { a: Map { b: Map { c: List [ 3, 4, 5 ], d: 7 } } }
const nested4 = nested3.updateIn(['a', 'b', 'c'], list => list.push(6));
const nested4 = nested3.updateIn(['a', 'b', 'c'], (list) => list.push(6));
// Map { a: Map { b: Map { c: List [ 3, 4, 5, 6 ], d: 7 } } }
```
@@ -439,15 +413,13 @@ determines if two variables represent references to the same object instance.
Consider the example below where two identical `Map` instances are not
_reference equal_ but are _value equal_.
<!-- runkit:activate -->
```js
// First consider:
const obj1 = { a: 1, b: 2, c: 3 };
const obj2 = { a: 1, b: 2, c: 3 };
obj1 !== obj2; // two different instances are always not equal with ===
const { Map, is } = require('immutable');
import { Map, is } from 'immutable';
const map1 = Map({ a: 1, b: 2, c: 3 });
const map2 = Map({ a: 1, b: 2, c: 3 });
map1 !== map2; // two different instances are not reference-equal
@@ -458,10 +430,8 @@ is(map1, map2); // alternatively can use the is() function
Value equality allows Immutable.js collections to be used as keys in Maps or
values in Sets, and retrieved with different but equivalent collections:
<!-- runkit:activate -->
```js
const { Map, Set } = require('immutable');
import { Map, Set } from 'immutable';
const map1 = Map({ a: 1, b: 2, c: 3 });
const map2 = Map({ a: 1, b: 2, c: 3 });
const set = Set().add(map1);
@@ -498,10 +468,8 @@ When possible, Immutable.js avoids creating new objects for updates where no
change in _value_ occurred, to allow for efficient _reference equality_ checking
to quickly determine if no change occurred.
<!-- runkit:activate -->
```js
const { Map } = require('immutable');
import { Map } from 'immutable';
const originalMap = Map({ a: 1, b: 2, c: 3 });
const updatedMap = originalMap.set('b', 2);
updatedMap === originalMap; // No-op .set() returned the original reference.
@@ -511,10 +479,8 @@ However updates which do result in a change will return a new reference. Each
of these operations occur independently, so two similar updates will not return
the same reference:
<!-- runkit:activate -->
```js
const { Map } = require('immutable');
import { Map } from 'immutable';
const originalMap = Map({ a: 1, b: 2, c: 3 });
const updatedMap = originalMap.set('b', 1000);
// New instance, leaving the original immutable.
@@ -545,10 +511,8 @@ exactly how Immutable.js applies complex mutations itself.
As an example, building `list2` results in the creation of 1, not 3, new
immutable Lists.
<!-- runkit:activate -->
```js
const { List } = require('immutable');
import { List } from 'immutable';
const list1 = List([1, 2, 3]);
const list2 = list1.withMutations(function (list) {
list.push(4).push(5).push(6);
@@ -586,10 +550,10 @@ For example, the following performs no work, because the resulting
`Seq`'s values are never iterated:
```js
const { Seq } = require('immutable');
import { Seq } from 'immutable';
const oddSquares = Seq([1, 2, 3, 4, 5, 6, 7, 8])
.filter(x => x % 2 !== 0)
.map(x => x * x);
.filter((x) => x % 2 !== 0)
.map((x) => x * x);
```
Once the `Seq` is used, it performs only the work necessary. In this
@@ -602,10 +566,8 @@ oddSquares.get(1); // 9
Any collection can be converted to a lazy Seq with `Seq()`.
<!-- runkit:activate -->
```js
const { Map, Seq } = require('immutable');
import { Map, Seq } from 'immutable';
const map = Map({ a: 1, b: 2, c: 3 });
const lazySeq = Seq(map);
```
@@ -616,7 +578,7 @@ expression of logic that can otherwise be very tedious:
```js
lazySeq
.flip()
.map(key => key.toUpperCase())
.map((key) => key.toUpperCase())
.flip();
// Seq { A: 1, B: 2, C: 3 }
```
@@ -624,14 +586,12 @@ lazySeq
As well as expressing logic that would otherwise seem memory or time
limited, for example `Range` is a special kind of Lazy sequence.
<!-- runkit:activate -->
```js
const { Range } = require('immutable');
import { Range } from 'immutable';
Range(1, Infinity)
.skip(1000)
.map(n => -n)
.filter(n => n % 2 === 0)
.map((n) => -n)
.filter((n) => n % 2 === 0)
.take(2)
.reduce((r, n) => r * n, 1);
// 1006008
@@ -642,8 +602,8 @@ Range(1, Infinity)
The `filter()`, `groupBy()`, and `partition()` methods are similar in that they
all divide a collection into parts based on applying a function to each element.
All three call the predicate or grouping function once for each item in the
input collection. All three return zero or more collections of the same type as
their input. The returned collections are always distinct from the input
input collection. All three return zero or more collections of the same type as
their input. The returned collections are always distinct from the input
(according to `===`), even if the contents are identical.
Of these methods, `filter()` is the only one that is lazy and the only one which
@@ -654,21 +614,21 @@ methods to form a pipeline of operations.
The `partition()` method is similar to an eager version of `filter()`, but it
returns two collections; the first contains the items that would have been
discarded by `filter()`, and the second contains the items that would have been
kept. It always returns an array of exactly two collections, which can make it
easier to use than `groupBy()`. Compared to making two separate calls to
kept. It always returns an array of exactly two collections, which can make it
easier to use than `groupBy()`. Compared to making two separate calls to
`filter()`, `partition()` makes half as many calls it the predicate passed to
it.
The `groupBy()` method is a more generalized version of `partition()` that can
group by an arbitrary function rather than just a predicate. It returns a map
group by an arbitrary function rather than just a predicate. It returns a map
with zero or more entries, where the keys are the values returned by the
grouping function, and the values are nonempty collections of the corresponding
arguments. Although `groupBy()` is more powerful than `partition()`, it can be
arguments. Although `groupBy()` is more powerful than `partition()`, it can be
harder to use because it is not always possible predict in advance how many
entries the returned map will have and what their keys will be.
| Summary | `filter` | `partition` | `groupBy` |
|:------------------------------|:---------|:------------|:---------------|
| :---------------------------- | :------- | :---------- | :------------- |
| ease of use | easiest | moderate | hardest |
| generality | least | moderate | most |
| laziness | lazy | eager | eager |
@@ -680,49 +640,63 @@ entries the returned map will have and what their keys will be.
## Additional Tools and Resources
- [Atom-store](https://github.com/jameshopkins/atom-store/)
- A Clojure-inspired atom implementation in Javascript with configurability
for external persistance.
- [Chai Immutable](https://github.com/astorije/chai-immutable)
- If you are using the [Chai Assertion Library](https://chaijs.com/), this
provides a set of assertions to use against Immutable.js collections.
- [Fantasy-land](https://github.com/fantasyland/fantasy-land)
- Specification for interoperability of common algebraic structures in JavaScript.
- [Immutagen](https://github.com/pelotom/immutagen)
- A library for simulating immutable generators in JavaScript.
- [Immutable-cursor](https://github.com/redbadger/immutable-cursor)
- Immutable cursors incorporating the Immutable.js interface over
Clojure-inspired atom.
Clojure-inspired atom.
- [Immutable-ext](https://github.com/DrBoolean/immutable-ext)
- Fantasyland extensions for immutablejs
- [Immutable-js-tools](https://github.com/madeinfree/immutable-js-tools)
- Util tools for immutable.js
- [Immutable-Redux](https://github.com/gajus/redux-immutable)
- redux-immutable is used to create an equivalent function of Redux
combineReducers that works with Immutable.js state.
combineReducers that works with Immutable.js state.
- [Immutable-Treeutils](https://github.com/lukasbuenger/immutable-treeutils)
- Functional tree traversal helpers for ImmutableJS data structures.
- [Irecord](https://github.com/ericelliott/irecord)
- An immutable store that exposes an RxJS observable. Great for React.
- [Mudash](https://github.com/brianneisler/mudash)
- Lodash wrapper providing Immutable.JS support.
- [React-Immutable-PropTypes](https://github.com/HurricaneJames/react-immutable-proptypes)
- PropType validators that work with Immutable.js.
- [Redux-Immutablejs](https://github.com/indexiatech/redux-immutablejs)
- Redux Immutable facilities.
- [Rxstate](https://github.com/yamalight/rxstate)
- Simple opinionated state management library based on RxJS and Immutable.js.
- [Transit-Immutable-js](https://github.com/glenjamin/transit-immutable-js)

1692
node_modules/immutable/dist/immutable.d.ts generated vendored
View File

File diff suppressed because it is too large Load Diff

2661
node_modules/immutable/dist/immutable.es.js generated vendored
View File

File diff suppressed because it is too large Load Diff

11541
node_modules/immutable/dist/immutable.js generated vendored
View File

File diff suppressed because it is too large Load Diff

144
node_modules/immutable/dist/immutable.js.flow generated vendored
View File

@@ -33,7 +33,7 @@ type $KeyOf<C> = $Call<
(<T>(?$ReadOnlyArray<T>) => number) &
(<T>(?RecordInstance<T> | T) => $Keys<T>) &
(<T: Object>(T) => $Keys<T>),
C
C,
>;
type $ValOf<C, K = $KeyOf<C>> = $Call<
@@ -42,7 +42,7 @@ type $ValOf<C, K = $KeyOf<C>> = $Call<
(<T, K: $Keys<T>>(?RecordInstance<T> | T, K) => $ElementType<T, K>) &
(<T: Object>(T) => $Values<T>),
C,
K
K,
>;
type $IterableOf<C> = $Call<
@@ -53,11 +53,11 @@ type $IterableOf<C> = $Call<
V:
| KeyedCollection<any, any>
| RecordInstance<any>
| PlainObjInput<any, any>
| PlainObjInput<any, any>,
>(
V
) => Iterable<[$KeyOf<V>, $ValOf<V>]>),
C
C,
>;
const PairSorting: $ReadOnly<{ LeftThenRight: number, RightThenLeft: number }> =
@@ -76,8 +76,10 @@ declare class _Collection<K, +V> implements ValueObject {
has(key: K): boolean;
includes(value: V): boolean;
contains(value: V): boolean;
first<NSV>(notSetValue?: NSV): V | NSV;
last<NSV>(notSetValue?: NSV): V | NSV;
first(): V | void;
first<NSV>(notSetValue: NSV): V | NSV;
last(): V | void;
last<NSV>(notSetValue: NSV): V | NSV;
hasIn(keyPath: Iterable<mixed>): boolean;
@@ -95,7 +97,7 @@ declare class _Collection<K, +V> implements ValueObject {
NSV,
K2: $KeyOf<V>,
K3: $KeyOf<$ValOf<V, K2>>,
K4: $KeyOf<$ValOf<$ValOf<V, K2>, K3>>
K4: $KeyOf<$ValOf<$ValOf<V, K2>, K3>>,
>(
keyPath: [K, K2, K3, K4],
notSetValue: NSV
@@ -105,7 +107,7 @@ declare class _Collection<K, +V> implements ValueObject {
K2: $KeyOf<V>,
K3: $KeyOf<$ValOf<V, K2>>,
K4: $KeyOf<$ValOf<$ValOf<V, K2>, K3>>,
K5: $KeyOf<$ValOf<$ValOf<$ValOf<V, K2>, K3>, K4>>
K5: $KeyOf<$ValOf<$ValOf<$ValOf<V, K2>, K3>, K4>>,
>(
keyPath: [K, K2, K3, K4, K5],
notSetValue: NSV
@@ -218,16 +220,16 @@ declare class _Collection<K, +V> implements ValueObject {
context?: mixed
): Map<G, number>;
find<NSV>(
find(
predicate: (value: V, key: K, iter: this) => mixed,
context?: mixed,
notSetValue?: NSV
): V | NSV;
findLast<NSV>(
notSetValue?: V
): V | void;
findLast(
predicate: (value: V, key: K, iter: this) => mixed,
context?: mixed,
notSetValue?: NSV
): V | NSV;
notSetValue?: V
): V | void;
findEntry(predicate: (value: V, key: K, iter: this) => mixed): [K, V] | void;
findLastEntry(
@@ -439,7 +441,7 @@ declare class IndexedCollection<+T> extends Collection<number, T> {
e: Iterable<E>,
..._: []
): IndexedCollection<
[T | void, A | void, B | void, C | void, D | void, E | void]
[T | void, A | void, B | void, C | void, D | void, E | void],
>;
zipWith<A, R>(
@@ -793,7 +795,7 @@ declare class UpdatableInCollection<K, +V> {
K2: $KeyOf<V>,
K3: $KeyOf<$ValOf<V, K2>>,
K4: $KeyOf<$ValOf<$ValOf<V, K2>, K3>>,
S: $ValOf<$ValOf<$ValOf<V, K2>, K3>, K4>
S: $ValOf<$ValOf<$ValOf<V, K2>, K3>, K4>,
>(
keyPath: [K, K2, K3, K4],
value: S
@@ -803,7 +805,7 @@ declare class UpdatableInCollection<K, +V> {
K3: $KeyOf<$ValOf<V, K2>>,
K4: $KeyOf<$ValOf<$ValOf<V, K2>, K3>>,
K5: $KeyOf<$ValOf<$ValOf<$ValOf<V, K2>, K3>, K4>>,
S: $ValOf<$ValOf<$ValOf<$ValOf<V, K2>, K3>, K4>, K5>
S: $ValOf<$ValOf<$ValOf<$ValOf<V, K2>, K3>, K4>, K5>,
>(
keyPath: [K, K2, K3, K4, K5],
value: S
@@ -818,7 +820,7 @@ declare class UpdatableInCollection<K, +V> {
deleteIn<
K2: $KeyOf<V>,
K3: $KeyOf<$ValOf<V, K2>>,
K4: $KeyOf<$ValOf<$ValOf<V, K2>, K3>>
K4: $KeyOf<$ValOf<$ValOf<V, K2>, K3>>,
>(
keyPath: [K, K2, K3, K4]
): this;
@@ -826,7 +828,7 @@ declare class UpdatableInCollection<K, +V> {
K2: $KeyOf<V>,
K3: $KeyOf<$ValOf<V, K2>>,
K4: $KeyOf<$ValOf<$ValOf<V, K2>, K3>>,
K5: $KeyOf<$ValOf<$ValOf<$ValOf<V, K2>, K3>, K4>>
K5: $KeyOf<$ValOf<$ValOf<$ValOf<V, K2>, K3>, K4>>,
>(
keyPath: [K, K2, K3, K4, K5]
): this;
@@ -840,7 +842,7 @@ declare class UpdatableInCollection<K, +V> {
removeIn<
K2: $KeyOf<V>,
K3: $KeyOf<$ValOf<V, K2>>,
K4: $KeyOf<$ValOf<$ValOf<V, K2>, K3>>
K4: $KeyOf<$ValOf<$ValOf<V, K2>, K3>>,
>(
keyPath: [K, K2, K3, K4]
): this;
@@ -848,7 +850,7 @@ declare class UpdatableInCollection<K, +V> {
K2: $KeyOf<V>,
K3: $KeyOf<$ValOf<V, K2>>,
K4: $KeyOf<$ValOf<$ValOf<V, K2>, K3>>,
K5: $KeyOf<$ValOf<$ValOf<$ValOf<V, K2>, K3>, K4>>
K5: $KeyOf<$ValOf<$ValOf<$ValOf<V, K2>, K3>, K4>>,
>(
keyPath: [K, K2, K3, K4, K5]
): this;
@@ -870,7 +872,7 @@ declare class UpdatableInCollection<K, +V> {
NSV,
K2: $KeyOf<V>,
K3: $KeyOf<$ValOf<V, K2>>,
S: $ValOf<$ValOf<V, K2>, K3>
S: $ValOf<$ValOf<V, K2>, K3>,
>(
keyPath: [K, K2, K3],
notSetValue: NSV,
@@ -879,7 +881,7 @@ declare class UpdatableInCollection<K, +V> {
updateIn<
K2: $KeyOf<V>,
K3: $KeyOf<$ValOf<V, K2>>,
S: $ValOf<$ValOf<V, K2>, K3>
S: $ValOf<$ValOf<V, K2>, K3>,
>(
keyPath: [K, K2, K3],
updater: (value: $ValOf<$ValOf<V, K2>, K3>) => S
@@ -889,7 +891,7 @@ declare class UpdatableInCollection<K, +V> {
K2: $KeyOf<V>,
K3: $KeyOf<$ValOf<V, K2>>,
K4: $KeyOf<$ValOf<$ValOf<V, K2>, K3>>,
S: $ValOf<$ValOf<$ValOf<V, K2>, K3>, K4>
S: $ValOf<$ValOf<$ValOf<V, K2>, K3>, K4>,
>(
keyPath: [K, K2, K3, K4],
notSetValue: NSV,
@@ -899,7 +901,7 @@ declare class UpdatableInCollection<K, +V> {
K2: $KeyOf<V>,
K3: $KeyOf<$ValOf<V, K2>>,
K4: $KeyOf<$ValOf<$ValOf<V, K2>, K3>>,
S: $ValOf<$ValOf<$ValOf<V, K2>, K3>, K4>
S: $ValOf<$ValOf<$ValOf<V, K2>, K3>, K4>,
>(
keyPath: [K, K2, K3, K4],
updater: (value: $ValOf<$ValOf<$ValOf<V, K2>, K3>, K4>) => S
@@ -910,7 +912,7 @@ declare class UpdatableInCollection<K, +V> {
K3: $KeyOf<$ValOf<V, K2>>,
K4: $KeyOf<$ValOf<$ValOf<V, K2>, K3>>,
K5: $KeyOf<$ValOf<$ValOf<$ValOf<V, K2>, K3>, K4>>,
S: $ValOf<$ValOf<$ValOf<$ValOf<V, K2>, K3>, K4>, K5>
S: $ValOf<$ValOf<$ValOf<$ValOf<V, K2>, K3>, K4>, K5>,
>(
keyPath: [K, K2, K3, K4, K5],
notSetValue: NSV,
@@ -923,7 +925,7 @@ declare class UpdatableInCollection<K, +V> {
K3: $KeyOf<$ValOf<V, K2>>,
K4: $KeyOf<$ValOf<$ValOf<V, K2>, K3>>,
K5: $KeyOf<$ValOf<$ValOf<$ValOf<V, K2>, K3>, K4>>,
S: $ValOf<$ValOf<$ValOf<$ValOf<V, K2>, K3>, K4>, K5>
S: $ValOf<$ValOf<$ValOf<$ValOf<V, K2>, K3>, K4>, K5>,
>(
keyPath: [K, K2, K3, K4, K5],
updater: (value: $ValOf<$ValOf<$ValOf<$ValOf<V, K2>, K3>, K4>, K5>) => S
@@ -936,7 +938,7 @@ declare class List<+T>
extends IndexedCollection<T>
mixins UpdatableInCollection<number, T>
{
static (collection?: Iterable<T>): List<T>;
static <T>(collection?: Iterable<T>): List<T>;
static of<T>(...values: T[]): List<T>;
@@ -1308,8 +1310,8 @@ declare class Set<+T> extends SetCollection<T> {
values: Iterable<[T, mixed]> | PlainObjInput<T, mixed>
): Set<T>;
static intersect(sets: Iterable<Iterable<T>>): Set<T>;
static union(sets: Iterable<Iterable<T>>): Set<T>;
static intersect<T>(sets: Iterable<Iterable<T>>): Set<T>;
static union<T>(sets: Iterable<Iterable<T>>): Set<T>;
static isSet: typeof isSet;
@@ -1688,7 +1690,7 @@ declare class RecordInstance<T: Object = Object> {
NSV,
K: $Keys<T>,
K2: $KeyOf<$ValOf<T, K>>,
K3: $KeyOf<$ValOf<$ValOf<T, K>, K2>>
K3: $KeyOf<$ValOf<$ValOf<T, K>, K2>>,
>(
keyPath: [K, K2, K3],
notSetValue: NSV
@@ -1698,7 +1700,7 @@ declare class RecordInstance<T: Object = Object> {
K: $Keys<T>,
K2: $KeyOf<$ValOf<T, K>>,
K3: $KeyOf<$ValOf<$ValOf<T, K>, K2>>,
K4: $KeyOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>>
K4: $KeyOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>>,
>(
keyPath: [K, K2, K3, K4],
notSetValue: NSV
@@ -1709,7 +1711,7 @@ declare class RecordInstance<T: Object = Object> {
K2: $KeyOf<$ValOf<T, K>>,
K3: $KeyOf<$ValOf<$ValOf<T, K>, K2>>,
K4: $KeyOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>>,
K5: $KeyOf<$ValOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>, K4>>
K5: $KeyOf<$ValOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>, K4>>,
>(
keyPath: [K, K2, K3, K4, K5],
notSetValue: NSV
@@ -1756,7 +1758,7 @@ declare class RecordInstance<T: Object = Object> {
K: $Keys<T>,
K2: $KeyOf<$ValOf<T, K>>,
K3: $KeyOf<$ValOf<$ValOf<T, K>, K2>>,
S: $ValOf<$ValOf<$ValOf<T, K>, K2>, K3>
S: $ValOf<$ValOf<$ValOf<T, K>, K2>, K3>,
>(
keyPath: [K, K2, K3],
value: S
@@ -1766,7 +1768,7 @@ declare class RecordInstance<T: Object = Object> {
K2: $KeyOf<$ValOf<T, K>>,
K3: $KeyOf<$ValOf<$ValOf<T, K>, K2>>,
K4: $KeyOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>>,
S: $ValOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>, K4>
S: $ValOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>, K4>,
>(
keyPath: [K, K2, K3, K4],
value: S
@@ -1777,7 +1779,7 @@ declare class RecordInstance<T: Object = Object> {
K3: $KeyOf<$ValOf<$ValOf<T, K>, K2>>,
K4: $KeyOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>>,
K5: $KeyOf<$ValOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>, K4>>,
S: $ValOf<$ValOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>, K4>, K5>
S: $ValOf<$ValOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>, K4>, K5>,
>(
keyPath: [K, K2, K3, K4, K5],
value: S
@@ -1791,7 +1793,7 @@ declare class RecordInstance<T: Object = Object> {
deleteIn<
K: $Keys<T>,
K2: $KeyOf<$ValOf<T, K>>,
K3: $KeyOf<$ValOf<$ValOf<T, K>, K2>>
K3: $KeyOf<$ValOf<$ValOf<T, K>, K2>>,
>(
keyPath: [K, K2, K3]
): this & $ReadOnly<T>;
@@ -1799,7 +1801,7 @@ declare class RecordInstance<T: Object = Object> {
K: $Keys<T>,
K2: $KeyOf<$ValOf<T, K>>,
K3: $KeyOf<$ValOf<$ValOf<T, K>, K2>>,
K4: $KeyOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>>
K4: $KeyOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>>,
>(
keyPath: [K, K2, K3, K4]
): this & $ReadOnly<T>;
@@ -1808,7 +1810,7 @@ declare class RecordInstance<T: Object = Object> {
K2: $KeyOf<$ValOf<T, K>>,
K3: $KeyOf<$ValOf<$ValOf<T, K>, K2>>,
K4: $KeyOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>>,
K5: $KeyOf<$ValOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>, K4>>
K5: $KeyOf<$ValOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>, K4>>,
>(
keyPath: [K, K2, K3, K4, K5]
): this & $ReadOnly<T>;
@@ -1821,7 +1823,7 @@ declare class RecordInstance<T: Object = Object> {
removeIn<
K: $Keys<T>,
K2: $KeyOf<$ValOf<T, K>>,
K3: $KeyOf<$ValOf<$ValOf<T, K>, K2>>
K3: $KeyOf<$ValOf<$ValOf<T, K>, K2>>,
>(
keyPath: [K, K2, K3]
): this & $ReadOnly<T>;
@@ -1829,7 +1831,7 @@ declare class RecordInstance<T: Object = Object> {
K: $Keys<T>,
K2: $KeyOf<$ValOf<T, K>>,
K3: $KeyOf<$ValOf<$ValOf<T, K>, K2>>,
K4: $KeyOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>>
K4: $KeyOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>>,
>(
keyPath: [K, K2, K3, K4]
): this & $ReadOnly<T>;
@@ -1838,7 +1840,7 @@ declare class RecordInstance<T: Object = Object> {
K2: $KeyOf<$ValOf<T, K>>,
K3: $KeyOf<$ValOf<$ValOf<T, K>, K2>>,
K4: $KeyOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>>,
K5: $KeyOf<$ValOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>, K4>>
K5: $KeyOf<$ValOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>, K4>>,
>(
keyPath: [K, K2, K3, K4, K5]
): this & $ReadOnly<T>;
@@ -1862,7 +1864,7 @@ declare class RecordInstance<T: Object = Object> {
NSV,
K: $Keys<T>,
K2: $KeyOf<$ValOf<T, K>>,
S: $ValOf<$ValOf<T, K>, K2>
S: $ValOf<$ValOf<T, K>, K2>,
>(
keyPath: [K, K2],
notSetValue: NSV,
@@ -1877,7 +1879,7 @@ declare class RecordInstance<T: Object = Object> {
K: $Keys<T>,
K2: $KeyOf<$ValOf<T, K>>,
K3: $KeyOf<$ValOf<$ValOf<T, K>, K2>>,
S: $ValOf<$ValOf<$ValOf<T, K>, K2>, K3>
S: $ValOf<$ValOf<$ValOf<T, K>, K2>, K3>,
>(
keyPath: [K, K2, K3],
notSetValue: NSV,
@@ -1887,7 +1889,7 @@ declare class RecordInstance<T: Object = Object> {
K: $Keys<T>,
K2: $KeyOf<$ValOf<T, K>>,
K3: $KeyOf<$ValOf<$ValOf<T, K>, K2>>,
S: $ValOf<$ValOf<$ValOf<T, K>, K2>, K3>
S: $ValOf<$ValOf<$ValOf<T, K>, K2>, K3>,
>(
keyPath: [K, K2, K3],
updater: (value: $ValOf<$ValOf<$ValOf<T, K>, K2>, K3>) => S
@@ -1898,7 +1900,7 @@ declare class RecordInstance<T: Object = Object> {
K2: $KeyOf<$ValOf<T, K>>,
K3: $KeyOf<$ValOf<$ValOf<T, K>, K2>>,
K4: $KeyOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>>,
S: $ValOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>, K4>
S: $ValOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>, K4>,
>(
keyPath: [K, K2, K3, K4],
notSetValue: NSV,
@@ -1911,7 +1913,7 @@ declare class RecordInstance<T: Object = Object> {
K2: $KeyOf<$ValOf<T, K>>,
K3: $KeyOf<$ValOf<$ValOf<T, K>, K2>>,
K4: $KeyOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>>,
S: $ValOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>, K4>
S: $ValOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>, K4>,
>(
keyPath: [K, K2, K3, K4],
updater: (value: $ValOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>, K4>) => S
@@ -1923,7 +1925,7 @@ declare class RecordInstance<T: Object = Object> {
K3: $KeyOf<$ValOf<$ValOf<T, K>, K2>>,
K4: $KeyOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>>,
K5: $KeyOf<$ValOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>, K4>>,
S: $ValOf<$ValOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>, K4>, K5>
S: $ValOf<$ValOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>, K4>, K5>,
>(
keyPath: [K, K2, K3, K4, K5],
notSetValue: NSV,
@@ -1937,7 +1939,7 @@ declare class RecordInstance<T: Object = Object> {
K3: $KeyOf<$ValOf<$ValOf<T, K>, K2>>,
K4: $KeyOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>>,
K5: $KeyOf<$ValOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>, K4>>,
S: $ValOf<$ValOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>, K4>, K5>
S: $ValOf<$ValOf<$ValOf<$ValOf<$ValOf<T, K>, K2>, K3>, K4>, K5>,
>(
keyPath: [K, K2, K3, K4, K5],
updater: (
@@ -2026,7 +2028,7 @@ declare function getIn<
K: $KeyOf<C>,
K2: $KeyOf<$ValOf<C, K>>,
K3: $KeyOf<$ValOf<$ValOf<C, K>, K2>>,
NSV
NSV,
>(
collection: C,
keyPath: [K, K2, K3],
@@ -2038,7 +2040,7 @@ declare function getIn<
K2: $KeyOf<$ValOf<C, K>>,
K3: $KeyOf<$ValOf<$ValOf<C, K>, K2>>,
K4: $KeyOf<$ValOf<$ValOf<$ValOf<C, K>, K2>, K3>>,
NSV
NSV,
>(
collection: C,
keyPath: [K, K2, K3, K4],
@@ -2051,7 +2053,7 @@ declare function getIn<
K3: $KeyOf<$ValOf<$ValOf<C, K>, K2>>,
K4: $KeyOf<$ValOf<$ValOf<$ValOf<C, K>, K2>, K3>>,
K5: $KeyOf<$ValOf<$ValOf<$ValOf<$ValOf<C, K>, K2>, K3>, K4>>,
NSV
NSV,
>(
collection: C,
keyPath: [K, K2, K3, K4, K5],
@@ -2070,7 +2072,7 @@ declare function removeIn<
C,
K: $KeyOf<C>,
K2: $KeyOf<$ValOf<C, K>>,
K3: $KeyOf<$ValOf<$ValOf<C, K>, K2>>
K3: $KeyOf<$ValOf<$ValOf<C, K>, K2>>,
>(
collection: C,
keyPath: [K, K2, K3]
@@ -2080,7 +2082,7 @@ declare function removeIn<
K: $KeyOf<C>,
K2: $KeyOf<$ValOf<C, K>>,
K3: $KeyOf<$ValOf<$ValOf<C, K>, K2>>,
K4: $KeyOf<$ValOf<$ValOf<$ValOf<C, K>, K2>, K3>>
K4: $KeyOf<$ValOf<$ValOf<$ValOf<C, K>, K2>, K3>>,
>(
collection: C,
keyPath: [K, K2, K3, K4]
@@ -2091,7 +2093,7 @@ declare function removeIn<
K2: $KeyOf<$ValOf<C, K>>,
K3: $KeyOf<$ValOf<$ValOf<C, K>, K2>>,
K4: $KeyOf<$ValOf<$ValOf<$ValOf<C, K>, K2>, K3>>,
K5: $KeyOf<$ValOf<$ValOf<$ValOf<$ValOf<C, K>, K2>, K3>, K4>>
K5: $KeyOf<$ValOf<$ValOf<$ValOf<$ValOf<C, K>, K2>, K3>, K4>>,
>(
collection: C,
keyPath: [K, K2, K3, K4, K5]
@@ -2107,7 +2109,7 @@ declare function setIn<
C,
K: $KeyOf<C>,
K2: $KeyOf<$ValOf<C, K>>,
S: $ValOf<$ValOf<C, K>, K2>
S: $ValOf<$ValOf<C, K>, K2>,
>(
collection: C,
keyPath: [K, K2],
@@ -2118,7 +2120,7 @@ declare function setIn<
K: $KeyOf<C>,
K2: $KeyOf<$ValOf<C, K>>,
K3: $KeyOf<$ValOf<$ValOf<C, K>, K2>>,
S: $ValOf<$ValOf<$ValOf<C, K>, K2>, K3>
S: $ValOf<$ValOf<$ValOf<C, K>, K2>, K3>,
>(
collection: C,
keyPath: [K, K2, K3],
@@ -2130,7 +2132,7 @@ declare function setIn<
K2: $KeyOf<$ValOf<C, K>>,
K3: $KeyOf<$ValOf<$ValOf<C, K>, K2>>,
K4: $KeyOf<$ValOf<$ValOf<$ValOf<C, K>, K2>, K3>>,
S: $ValOf<$ValOf<$ValOf<$ValOf<C, K>, K2>, K3>, K4>
S: $ValOf<$ValOf<$ValOf<$ValOf<C, K>, K2>, K3>, K4>,
>(
collection: C,
keyPath: [K, K2, K3, K4],
@@ -2143,7 +2145,7 @@ declare function setIn<
K3: $KeyOf<$ValOf<$ValOf<C, K>, K2>>,
K4: $KeyOf<$ValOf<$ValOf<$ValOf<C, K>, K2>, K3>>,
K5: $KeyOf<$ValOf<$ValOf<$ValOf<$ValOf<C, K>, K2>, K3>, K4>>,
S: $ValOf<$ValOf<$ValOf<$ValOf<$ValOf<C, K>, K2>, K3>, K4>, K5>
S: $ValOf<$ValOf<$ValOf<$ValOf<$ValOf<C, K>, K2>, K3>, K4>, K5>,
>(
collection: C,
keyPath: [K, K2, K3, K4, K5],
@@ -2177,7 +2179,7 @@ declare function updateIn<
K: $KeyOf<C>,
K2: $KeyOf<$ValOf<C, K>>,
S: $ValOf<$ValOf<C, K>, K2>,
NSV
NSV,
>(
collection: C,
keyPath: [K, K2],
@@ -2188,7 +2190,7 @@ declare function updateIn<
C,
K: $KeyOf<C>,
K2: $KeyOf<$ValOf<C, K>>,
S: $ValOf<$ValOf<C, K>, K2>
S: $ValOf<$ValOf<C, K>, K2>,
>(
collection: C,
keyPath: [K, K2],
@@ -2200,7 +2202,7 @@ declare function updateIn<
K2: $KeyOf<$ValOf<C, K>>,
K3: $KeyOf<$ValOf<$ValOf<C, K>, K2>>,
S: $ValOf<$ValOf<$ValOf<C, K>, K2>, K3>,
NSV
NSV,
>(
collection: C,
keyPath: [K, K2, K3],
@@ -2212,7 +2214,7 @@ declare function updateIn<
K: $KeyOf<C>,
K2: $KeyOf<$ValOf<C, K>>,
K3: $KeyOf<$ValOf<$ValOf<C, K>, K2>>,
S: $ValOf<$ValOf<$ValOf<C, K>, K2>, K3>
S: $ValOf<$ValOf<$ValOf<C, K>, K2>, K3>,
>(
collection: C,
keyPath: [K, K2, K3],
@@ -2225,7 +2227,7 @@ declare function updateIn<
K3: $KeyOf<$ValOf<$ValOf<C, K>, K2>>,
K4: $KeyOf<$ValOf<$ValOf<$ValOf<C, K>, K2>, K3>>,
S: $ValOf<$ValOf<$ValOf<$ValOf<C, K>, K2>, K3>, K4>,
NSV
NSV,
>(
collection: C,
keyPath: [K, K2, K3, K4],
@@ -2238,7 +2240,7 @@ declare function updateIn<
K2: $KeyOf<$ValOf<C, K>>,
K3: $KeyOf<$ValOf<$ValOf<C, K>, K2>>,
K4: $KeyOf<$ValOf<$ValOf<$ValOf<C, K>, K2>, K3>>,
S: $ValOf<$ValOf<$ValOf<$ValOf<C, K>, K2>, K3>, K4>
S: $ValOf<$ValOf<$ValOf<$ValOf<C, K>, K2>, K3>, K4>,
>(
collection: C,
keyPath: [K, K2, K3, K4],
@@ -2252,7 +2254,7 @@ declare function updateIn<
K4: $KeyOf<$ValOf<$ValOf<$ValOf<C, K>, K2>, K3>>,
K5: $KeyOf<$ValOf<$ValOf<$ValOf<$ValOf<C, K>, K2>, K3>, K4>>,
S: $ValOf<$ValOf<$ValOf<$ValOf<$ValOf<C, K>, K2>, K3>, K4>, K5>,
NSV
NSV,
>(
collection: C,
keyPath: [K, K2, K3, K4, K5],
@@ -2268,7 +2270,7 @@ declare function updateIn<
K3: $KeyOf<$ValOf<$ValOf<C, K>, K2>>,
K4: $KeyOf<$ValOf<$ValOf<$ValOf<C, K>, K2>, K3>>,
K5: $KeyOf<$ValOf<$ValOf<$ValOf<$ValOf<C, K>, K2>, K3>, K4>>,
S: $ValOf<$ValOf<$ValOf<$ValOf<$ValOf<C, K>, K2>, K3>, K4>, K5>
S: $ValOf<$ValOf<$ValOf<$ValOf<$ValOf<C, K>, K2>, K3>, K4>, K5>,
>(
collection: C,
keyPath: [K, K2, K3, K4, K5],
@@ -2282,7 +2284,7 @@ declare function merge<C>(
...collections: Array<
| $IterableOf<C>
| $Shape<RecordValues<C>>
| PlainObjInput<$KeyOf<C>, $ValOf<C>>
| PlainObjInput<$KeyOf<C>, $ValOf<C>>,
>
): C;
declare function mergeWith<C>(
@@ -2291,7 +2293,7 @@ declare function mergeWith<C>(
...collections: Array<
| $IterableOf<C>
| $Shape<RecordValues<C>>
| PlainObjInput<$KeyOf<C>, $ValOf<C>>
| PlainObjInput<$KeyOf<C>, $ValOf<C>>,
>
): C;
declare function mergeDeep<C>(
@@ -2299,7 +2301,7 @@ declare function mergeDeep<C>(
...collections: Array<
| $IterableOf<C>
| $Shape<RecordValues<C>>
| PlainObjInput<$KeyOf<C>, $ValOf<C>>
| PlainObjInput<$KeyOf<C>, $ValOf<C>>,
>
): C;
declare function mergeDeepWith<C>(
@@ -2308,7 +2310,7 @@ declare function mergeDeepWith<C>(
...collections: Array<
| $IterableOf<C>
| $Shape<RecordValues<C>>
| PlainObjInput<$KeyOf<C>, $ValOf<C>>
| PlainObjInput<$KeyOf<C>, $ValOf<C>>,
>
): C;

34
node_modules/immutable/dist/immutable.min.js generated vendored
View File

File diff suppressed because one or more lines are too long

3
node_modules/immutable/package.json generated vendored
View File

@@ -1,6 +1,6 @@
{
"name": "immutable",
"version": "4.3.2",
"version": "5.1.4",
"description": "Immutable Data Collections",
"license": "MIT",
"homepage": "https://immutable-js.com",
@@ -17,7 +17,6 @@
},
"main": "dist/immutable.js",
"module": "dist/immutable.es.js",
"sideEffects": false,
"types": "dist/immutable.d.ts",
"files": [
"dist",