Immutable.js Flashcards

Question 1

Q

List

Create a new immutable _____ containing the values of the provided iterable-like.

\_\_\_\_\_<T>():\_\_\_\_\_<T>\_\_\_\_\_<T>(iter: IndexedIterable<T>):\_\_\_\_\_<T>\_\_\_\_\_<T>(iter: SetIterable<T>):\_\_\_\_\_<T>\_\_\_\_\_<K, V>(iter: KeyedIterable<K, V>):\_\_\_\_\_<any>\_\_\_\_\_<T>(array: Array<T>):\_\_\_\_\_<T>\_\_\_\_\_<T>(iterator: Iterator<T>):\_\_\_\_\_<T>\_\_\_\_\_<T>(iterable: Object):\_\_\_\_\_<T>

1 construction methods.

Answer

A

List

Create a new immutable List containing the values of the provided iterable-like.

List<T>(): List<T>List<T>(iter: IndexedIterable<T>): List<T>List<T>(iter: SetIterable<T>): List<T>List<K, V>(iter: KeyedIterable<K, V>): List<any>List<T>(array: Array<T>): List<T>List<T>(iterator: Iterator<T>): List<T>List<T>(iterable: Object): List<T>

Question 2

Q

List

True if the provided value is a List

List.isList(maybeList: any): boolean

2 static methods methods.

Answer

A

List.isList

True if the provided value is a List

List.isList(maybeList: any): boolean

Question 3

Q

List

Creates a new List containing values.

List.of<T>(...values: T[]): List<T>

2 static methods methods.

Answer

A

List.of

Creates a new List containing values.

List.of<T>(...values: T[]): List<T>

Question 4

Q

List

Returns a new List which includes value at index. If index already exists in this List, it will be replaced.

\_\_\_\_\_(index: number, value: T): List<T>

13 persistent changes methods.

Answer

A

set

Returns a new List which includes value at index. If index already exists in this List, it will be replaced.

set(index: number, value: T): List<T>

Question 5

Q

List

Returns a new List which excludes this index and with a size 1 less than this List. Values at indicies above index are shifted down by 1 to fill the position.

\_\_\_\_\_(index: number): List<T>

13 persistent changes methods.

Answer

A

delete

Returns a new List which excludes this index and with a size 1 less than this List. Values at indicies above index are shifted down by 1 to fill the position.

delete(index: number): List<T>

Question 6

Q

List

Returns a new List with 0 size and no values.

\_\_\_\_\_(): List<T>

13 persistent changes methods.

Answer

A

clear

Returns a new List with 0 size and no values.

clear(): List<T>

Question 7

Q

List

Returns a new List with the provided values appended, starting at this List’s size.

\_\_\_\_\_(...values: T[]): List<T>

13 persistent changes methods.

Answer

A

push

Returns a new List with the provided values appended, starting at this List’s size.

push(...values: T[]): List<T>

Question 8

Q

List

Returns a new List with a size ones less than this List, excluding the last index in this List.

\_\_\_\_\_(): List<T>

13 persistent changes methods.

Answer

A

pop

Returns a new List with a size ones less than this List, excluding the last index in this List.

pop(): List<T>

Question 9

Q

List

Returns a new List with the provided values prepended, shifting other values ahead to higher indices.

\_\_\_\_\_(...values: T[]): List<T>

13 persistent changes methods.

Answer

A

unshift

Returns a new List with the provided values prepended, shifting other values ahead to higher indices.

unshift(...values: T[]): List<T>

Question 10

Q

List

Returns a new List with a size ones less than this List, excluding the first index in this List, _____ing all other values to a lower index.

\_\_\_\_\_(): List<T>

13 persistent changes methods.

Answer

A

shift

Returns a new List with a size ones less than this List, excluding the first index in this List, shifting all other values to a lower index.

shift(): List<T>

Question 11

Q

List

Returns a new List with an _____d value at index with the return value of calling \_\_\_\_\_r with the existing value, or notSetValue if index was not set. If called with a single argument, \_\_\_\_\_r is called with the List itself.

\_\_\_\_\_(\_\_\_\_\_r: (value: List<T>) => List<T>): List<T>\_\_\_\_\_(index: number,\_\_\_\_\_r: (value: T) => T): List<T>\_\_\_\_\_(index: number, notSetValue: T,\_\_\_\_\_r: (value: T) => T): List<T>

13 persistent changes methods.

Answer

A

update

Returns a new List with an updated value at index with the return value of calling updater with the existing value, or notSetValue if index was not set. If called with a single argument, updater is called with the List itself.

update(updater: (value: List<T>) => List<T>): List<T>update(index: number, updater: (value: T) => T): List<T>update(index: number, notSetValue: T, updater: (value: T) => T): List<T>

Question 12

Q

List
\_\_\_\_\_(...iterables: IndexedIterable<T>[]): List<T>\_\_\_\_\_(...iterables: Array<T>[]): List<T>

13 persistent changes methods.

Answer

A

merge
merge(...iterables: IndexedIterable<T>[]): List<T>merge(...iterables: Array<T>[]): List<T>

Question 13

Q

List
`_____(
merger: (previous?: T, next?: T, key?: number) => T,…iterables: IndexedIterable<T>[]</T>

): List<T>\_\_\_\_\_(
merger: (previous?: T, next?: T, key?: number) => T,...iterables: Array<T>[]</T></T>

): List<T>`</T>

13 persistent changes methods.

Answer

A

mergeWith
`mergeWith(
merger: (previous?: T, next?: T, key?: number) => T,…iterables: IndexedIterable<T>[]</T>

): List<T>mergeWith(
merger: (previous?: T, next?: T, key?: number) => T,...iterables: Array<T>[]</T></T>

): List<T>`</T>

Question 14

Q

List
\_\_\_\_\_(...iterables: IndexedIterable<T>[]): List<T>\_\_\_\_\_(...iterables: Array<T>[]): List<T>

13 persistent changes methods.

Answer

A

mergeDeep
mergeDeep(...iterables: IndexedIterable<T>[]): List<T>mergeDeep(...iterables: Array<T>[]): List<T>

Question 15

Q

List
`_____(
merger: (previous?: T, next?: T, key?: number) => T,…iterables: IndexedIterable<T>[]</T>

): List<T>\_\_\_\_\_(
merger: (previous?: T, next?: T, key?: number) => T,...iterables: Array<T>[]</T></T>

): List<T>`</T>

13 persistent changes methods.

Answer

A

mergeDeepWith
`mergeDeepWith(
merger: (previous?: T, next?: T, key?: number) => T,…iterables: IndexedIterable<T>[]</T>

): List<T>mergeDeepWith(
merger: (previous?: T, next?: T, key?: number) => T,...iterables: Array<T>[]</T></T>

): List<T>`</T>

Question 16

Q

List

Returns a new List with size size. If size is less than this List’s size, the new List will exclude values at the higher indices. If size is greater than this List’s size, the new List will have undefined values for the newly available indices.

\_\_\_\_\_(size: number): List<T>

13 persistent changes methods.

Answer

A

setSize

Returns a new List with size size. If size is less than this List’s size, the new List will exclude values at the higher indices. If size is greater than this List’s size, the new List will have undefined values for the newly available indices.

setSize(size: number): List<T>

Question 17

Q

List

Returns a new List having set value at this keyPath. If any keys in keyPath do not exist, a new immutable Map will be created at that key.

\_\_\_\_\_(keyPath: Array<any>, value: any): List<T>\_\_\_\_\_(keyPath: Iterable<any, any>, value: any): List<T>

5 deep persistent changes methods.

Answer

A

setIn

Returns a new List having set value at this keyPath. If any keys in keyPath do not exist, a new immutable Map will be created at that key.

setIn(keyPath: Array<any>, value: any): List<T>setIn(keyPath: Iterable<any, any>, value: any): List<T>

Question 18

Q

List

Returns a new List having removed the value at this keyPath. If any keys in keyPath do not exist, no change will occur.

\_\_\_\_\_(keyPath: Array<any>): List<T>\_\_\_\_\_(keyPath: Iterable<any, any>): List<T>

5 deep persistent changes methods.

Answer

A

deleteIn

Returns a new List having removed the value at this keyPath. If any keys in keyPath do not exist, no change will occur.

deleteIn(keyPath: Array<any>): List<T>deleteIn(keyPath: Iterable<any, any>): List<T>

Question 19

Q

List
`_____(keyPath: Array<any>, updater: (value: any) => any): List<T>\_\_\_\_\_(
keyPath: Array<any>,notSetValue: any,updater: (value: any) => any</any></T></any>

): List<T>\_\_\_\_\_(keyPath: Iterable<any, any>, updater: (value: any) => any): List<T>\_\_\_\_\_(
keyPath: Iterable<any, any>,notSetValue: any,updater: (value: any) => any</T></T>

): List<T>`</T>

5 deep persistent changes methods.

Answer

A

updateIn
`updateIn(keyPath: Array<any>, updater: (value: any) => any): List<T>updateIn(
keyPath: Array<any>,notSetValue: any,updater: (value: any) => any</any></T></any>

): List<T>updateIn(keyPath: Iterable<any, any>, updater: (value: any) => any): List<T>updateIn(
keyPath: Iterable<any, any>,notSetValue: any,updater: (value: any) => any</T></T>

): List<T>`</T>

Question 20

Q

List
`_____(
keyPath: Iterable<any, any>,…iterables: IndexedIterable<T>[]</T>

): List<T>\_\_\_\_\_(keyPath: Array<any>, ...iterables: IndexedIterable<T>[]): List<T>\_\_\_\_\_(keyPath: Array<any>, ...iterables: Array<T>[]): List<T>`</T></T></any></T></T></any></T>

5 deep persistent changes methods.

Answer

A

mergeIn
`mergeIn(
keyPath: Iterable<any, any>,…iterables: IndexedIterable<T>[]</T>

): List<T>mergeIn(keyPath: Array<any>, ...iterables: IndexedIterable<T>[]): List<T>mergeIn(keyPath: Array<any>, ...iterables: Array<T>[]): List<T>`</T></T></any></T></T></any></T>

Question 21

Q

List
`_____(
keyPath: Iterable<any, any>,…iterables: IndexedIterable<T>[]</T>

): List<T>\_\_\_\_\_(keyPath: Array<any>, ...iterables: IndexedIterable<T>[]): List<T>\_\_\_\_\_(keyPath: Array<any>, ...iterables: Array<T>[]): List<T>`</T></T></any></T></T></any></T>

5 deep persistent changes methods.

Answer

A

mergeDeepIn
`mergeDeepIn(
keyPath: Iterable<any, any>,…iterables: IndexedIterable<T>[]</T>

): List<T>mergeDeepIn(keyPath: Array<any>, ...iterables: IndexedIterable<T>[]): List<T>mergeDeepIn(keyPath: Array<any>, ...iterables: Array<T>[]): List<T>`</T></T></any></T></T></any></T>

Question 22

Q

List

Note: Not all methods can be used on a mutable collection or within \_\_\_\_\_! Only set, push, pop, shift, unshift and merge may be used mutatively.

\_\_\_\_\_(mutator: (mutable: List<T>) => any): List<T>

3 transient changes methods.

Answer

A

withMutations

Note: Not all methods can be used on a mutable collection or within withMutations! Only set, push, pop, shift, unshift and merge may be used mutatively.

withMutations(mutator: (mutable: List<T>) => any): List<T>

Question 23

Q

List
\_\_\_\_\_(): List<T>

3 transient changes methods.

Answer

A

asMutable
asMutable(): List<T>

Question 24

Q

List
\_\_\_\_\_(): List<T>

3 transient changes methods.

Answer

A

asImmutable
asImmutable(): List<T>

Question 25

Q

Map

Creates a new Immutable _____.

\_\_\_\_\_<K, V>():\_\_\_\_\_<K, V>\_\_\_\_\_<K, V>(iter: KeyedIterable<K, V>):\_\_\_\_\_<K, V>\_\_\_\_\_<K, V>(iter: Iterable<any, Array<any>>):\_\_\_\_\_<K, V>\_\_\_\_\_<K, V>(array: Array<Array<any>>):\_\_\_\_\_<K, V>\_\_\_\_\_<V>(obj: {[key: string]: V}):\_\_\_\_\_<string, V>\_\_\_\_\_<K, V>(iterator: Iterator<Array<any>>):\_\_\_\_\_<K, V>\_\_\_\_\_<K, V>(iterable: Object):\_\_\_\_\_<K, V>

1 construction methods.

Answer

A

Map

Creates a new Immutable Map.

Map<K, V>(): Map<K, V>Map<K, V>(iter: KeyedIterable<K, V>): Map<K, V>Map<K, V>(iter: Iterable<any, Array<any>>): Map<K, V>Map<K, V>(array: Array<Array<any>>): Map<K, V>Map<V>(obj: {[key: string]: V}): Map<string, V>Map<K, V>(iterator: Iterator<Array<any>>): Map<K, V>Map<K, V>(iterable: Object): Map<K, V>

Question 26

Q

Map

True if the provided value is a Map

Map.isMap(maybeMap: any): boolean

1 static methods methods.

Answer

A

Map.isMap

True if the provided value is a Map

Map.isMap(maybeMap: any): boolean

Question 27

Q

Map

Returns a new Map also containing the new key, value pair. If an equivalent key already exists in this Map, it will be replaced.

\_\_\_\_\_(key: K, value: V): Map<K, V>

8 persistent changes methods.

Answer

A

set

Returns a new Map also containing the new key, value pair. If an equivalent key already exists in this Map, it will be replaced.

set(key: K, value: V): Map<K, V>

Question 28

Q

Map

Returns a new Map which excludes this key.

\_\_\_\_\_(key: K): Map<K, V>

8 persistent changes methods.

Answer

A

delete

Returns a new Map which excludes this key.

delete(key: K): Map<K, V>

Question 29

Q

Map

Returns a new Map containing no keys or values.

\_\_\_\_\_(): Map<K, V>

8 persistent changes methods.

Answer

A

clear

Returns a new Map containing no keys or values.

clear(): Map<K, V>

Question 30

Q

Map

Returns a new Map having _____d the value at this key with the return value of calling \_\_\_\_\_r with the existing value, or notSetValue if the key was not set. If called with only a single argument, \_\_\_\_\_r is called with the Map itself.

\_\_\_\_\_(\_\_\_\_\_r: (value: Map<K, V>) => Map<K, V>): Map<K, V>\_\_\_\_\_(key: K,\_\_\_\_\_r: (value: V) => V): Map<K, V>\_\_\_\_\_(key: K, notSetValue: V,\_\_\_\_\_r: (value: V) => V): Map<K, V>

8 persistent changes methods.

Answer

A

update

Returns a new Map having updated the value at this key with the return value of calling updater with the existing value, or notSetValue if the key was not set. If called with only a single argument, updater is called with the Map itself.

update(updater: (value: Map<K, V>) => Map<K, V>): Map<K, V>update(key: K, updater: (value: V) => V): Map<K, V>update(key: K, notSetValue: V, updater: (value: V) => V): Map<K, V>

Question 31

Q

Map

Returns a new Map resulting from merging the provided Iterables (or JS objects) into this Map. In other words, this takes each entry of each iterable and sets it on this Map.

\_\_\_\_\_(...iterables: Iterable<K, V>[]): Map<K, V>\_\_\_\_\_(...iterables: {[key: string]: V}[]): Map<string, V>

8 persistent changes methods.

Answer

A

merge

Returns a new Map resulting from merging the provided Iterables (or JS objects) into this Map. In other words, this takes each entry of each iterable and sets it on this Map.

merge(...iterables: Iterable<K, V>[]): Map<K, V>merge(...iterables: {[key: string]: V}[]): Map<string, V>

Question 32

Q

Map

Like merge(), \_\_\_\_\_() returns a new Map resulting from merging the provided Iterables (or JS objects) into this Map, but uses the merger function for dealing with conflicts.

`_____(
merger: (previous?: V, next?: V, key?: K) => V,…iterables: Iterable<K, V>[]

): Map<K, V>_____(
merger: (previous?: V, next?: V, key?: K) => V,…iterables: {[key: string]: V}[]

): Map<string, V>`

8 persistent changes methods.

Answer

A

mergeWith

Like merge(), mergeWith() returns a new Map resulting from merging the provided Iterables (or JS objects) into this Map, but uses the merger function for dealing with conflicts.

`mergeWith(
merger: (previous?: V, next?: V, key?: K) => V,…iterables: Iterable<K, V>[]

): Map<K, V>mergeWith(
merger: (previous?: V, next?: V, key?: K) => V,…iterables: {[key: string]: V}[]

): Map<string, V>`

Question 33

Q

Map

Like merge(), but when two Iterables conflict, it merges them as well, recursing deeply through the nested data.

\_\_\_\_\_(...iterables: Iterable<K, V>[]): Map<K, V>\_\_\_\_\_(...iterables: {[key: string]: V}[]): Map<string, V>

8 persistent changes methods.

Answer

A

mergeDeep

Like merge(), but when two Iterables conflict, it merges them as well, recursing deeply through the nested data.

mergeDeep(...iterables: Iterable<K, V>[]): Map<K, V>mergeDeep(...iterables: {[key: string]: V}[]): Map<string, V>

Question 34

Q

Map

Like mergeDeep(), but when two non-Iterables conflict, it uses the merger function to determine the resulting value.

`_____(
merger: (previous?: V, next?: V, key?: K) => V,…iterables: Iterable<K, V>[]

): Map<K, V>_____(
merger: (previous?: V, next?: V, key?: K) => V,…iterables: {[key: string]: V}[]

): Map<string, V>`

8 persistent changes methods.

Answer

A

mergeDeepWith

Like mergeDeep(), but when two non-Iterables conflict, it uses the merger function to determine the resulting value.

`mergeDeepWith(
merger: (previous?: V, next?: V, key?: K) => V,…iterables: Iterable<K, V>[]

): Map<K, V>mergeDeepWith(
merger: (previous?: V, next?: V, key?: K) => V,…iterables: {[key: string]: V}[]

): Map<string, V>`

Question 35

Q

Map

Returns a new Map having set value at this keyPath. If any keys in keyPath do not exist, a new immutable Map will be created at that key.

\_\_\_\_\_(keyPath: Array<any>, value: any): Map<K, V>\_\_\_\_\_(KeyPath: Iterable<any, any>, value: any): Map<K, V>

5 deep persistent changes methods.

Answer

A

setIn

Returns a new Map having set value at this keyPath. If any keys in keyPath do not exist, a new immutable Map will be created at that key.

setIn(keyPath: Array<any>, value: any): Map<K, V>setIn(KeyPath: Iterable<any, any>, value: any): Map<K, V>

Question 36

Q

Map

Returns a new Map having removed the value at this keyPath. If any keys in keyPath do not exist, no change will occur.

\_\_\_\_\_(keyPath: Array<any>): Map<K, V>\_\_\_\_\_(keyPath: Iterable<any, any>): Map<K, V>

5 deep persistent changes methods.

Answer

A

deleteIn

Returns a new Map having removed the value at this keyPath. If any keys in keyPath do not exist, no change will occur.

deleteIn(keyPath: Array<any>): Map<K, V>deleteIn(keyPath: Iterable<any, any>): Map<K, V>

Question 37

Q

Map

Returns a new Map having applied the updater to the entry found at the keyPath.

`_____(keyPath: Array<any>, updater: (value: any) => any): Map<K, V>\_\_\_\_\_(
keyPath: Array<any>,notSetValue: any,updater: (value: any) => any</any></any>

): Map<K, V>_____(keyPath: Iterable<any, any>, updater: (value: any) => any): Map<K, V>_____(
keyPath: Iterable<any, any>,notSetValue: any,updater: (value: any) => any

): Map<K, V>`

5 deep persistent changes methods.

Answer

A

updateIn

Returns a new Map having applied the updater to the entry found at the keyPath.

`updateIn(keyPath: Array<any>, updater: (value: any) => any): Map<K, V>updateIn(
keyPath: Array<any>,notSetValue: any,updater: (value: any) => any</any></any>

): Map<K, V>updateIn(keyPath: Iterable<any, any>, updater: (value: any) => any): Map<K, V>updateIn(
keyPath: Iterable<any, any>,notSetValue: any,updater: (value: any) => any

): Map<K, V>`

Question 38

Q

Map

A combination of updateIn and merge, returning a new Map, but performing the merge at a point arrived at by following the keyPath. In other words, these two lines are equivalent:

\_\_\_\_\_(keyPath: Iterable<any, any>, ...iterables: Iterable<K, V>[]): Map<K, V>\_\_\_\_\_(keyPath: Array<any>, ...iterables: Iterable<K, V>[]): Map<K, V>\_\_\_\_\_(keyPath: Array<any>, ...iterables: {[key: string]: V}[]): Map<string, V>

5 deep persistent changes methods.

Answer

A

mergeIn

A combination of updateIn and merge, returning a new Map, but performing the merge at a point arrived at by following the keyPath. In other words, these two lines are equivalent:

mergeIn(keyPath: Iterable<any, any>, ...iterables: Iterable<K, V>[]): Map<K, V>mergeIn(keyPath: Array<any>, ...iterables: Iterable<K, V>[]): Map<K, V>mergeIn(keyPath: Array<any>, ...iterables: {[key: string]: V}[]): Map<string, V>

Question 39

Q

Map

A combination of updateIn and mergeDeep, returning a new Map, but performing the deep merge at a point arrived at by following the keyPath. In other words, these two lines are equivalent:

`_____(
keyPath: Iterable<any, any>,…iterables: Iterable<K, V>[]

): Map<K, V>_____(keyPath: Array<any>, ...iterables: Iterable<K, V>[]): Map<K, V>\_\_\_\_\_(
keyPath: Array<any>,...iterables: {[key: string]: V}[]</any></any>

): Map<string, V>`

5 deep persistent changes methods.

Answer

A

mergeDeepIn

A combination of updateIn and mergeDeep, returning a new Map, but performing the deep merge at a point arrived at by following the keyPath. In other words, these two lines are equivalent:

`mergeDeepIn(
keyPath: Iterable<any, any>,…iterables: Iterable<K, V>[]

): Map<K, V>mergeDeepIn(keyPath: Array<any>, ...iterables: Iterable<K, V>[]): Map<K, V>mergeDeepIn(
keyPath: Array<any>,...iterables: {[key: string]: V}[]</any></any>

): Map<string, V>`

Question 40

Q

Map

Every time you call one of the above functions, a new immutable Map is created. If a pure function calls a number of these to produce a final return value, then a penalty on performance and memory has been paid by creating all of the intermediate immutable Maps.

\_\_\_\_\_(mutator: (mutable: Map<K, V>) => any): Map<K, V>

3 transient changes methods.

Answer

A

withMutations

Every time you call one of the above functions, a new immutable Map is created. If a pure function calls a number of these to produce a final return value, then a penalty on performance and memory has been paid by creating all of the intermediate immutable Maps.

withMutations(mutator: (mutable: Map<K, V>) => any): Map<K, V>

Question 41

Q

Map

Another way to avoid creation of intermediate Immutable maps is to create a mutable copy of this collection. Mutable copies always return this, and thus shouldn’t be used for equality. Your function should never return a mutable copy of a collection, only use it internally to create a new collection. If possible, use withMutations as it provides an easier to use API.

\_\_\_\_\_(): Map<K, V>

3 transient changes methods.

Answer

A

asMutable

Another way to avoid creation of intermediate Immutable maps is to create a mutable copy of this collection. Mutable copies always return this, and thus shouldn’t be used for equality. Your function should never return a mutable copy of a collection, only use it internally to create a new collection. If possible, use withMutations as it provides an easier to use API.

asMutable(): Map<K, V>

Question 42

Q

Map

The yin to asMutable’s yang. Because it applies to mutable collections, this operation is mutable and returns itself. Once performed, the mutable copy has become immutable and can be safely returned from a function.

\_\_\_\_\_(): Map<K, V>

3 transient changes methods.

Answer

A

asImmutable

The yin to asMutable’s yang. Because it applies to mutable collections, this operation is mutable and returns itself. Once performed, the mutable copy has become immutable and can be safely returned from a function.

asImmutable(): Map<K, V>

Question 43

Q

OrderedMap

Creates a new Immutable _____.

\_\_\_\_\_<K, V>():\_\_\_\_\_<K, V>\_\_\_\_\_<K, V>(iter: KeyedIterable<K, V>):\_\_\_\_\_<K, V>\_\_\_\_\_<K, V>(iter: Iterable<any, Array<any>>):\_\_\_\_\_<K, V>\_\_\_\_\_<K, V>(array: Array<Array<any>>):\_\_\_\_\_<K, V>\_\_\_\_\_<V>(obj: {[key: string]: V}):\_\_\_\_\_<string, V>\_\_\_\_\_<K, V>(iterator: Iterator<Array<any>>):\_\_\_\_\_<K, V>\_\_\_\_\_<K, V>(iterable: Object):\_\_\_\_\_<K, V>

1 construction methods.

Answer

A

OrderedMap

Creates a new Immutable OrderedMap.

OrderedMap<K, V>(): OrderedMap<K, V>OrderedMap<K, V>(iter: KeyedIterable<K, V>): OrderedMap<K, V>OrderedMap<K, V>(iter: Iterable<any, Array<any>>): OrderedMap<K, V>OrderedMap<K, V>(array: Array<Array<any>>): OrderedMap<K, V>OrderedMap<V>(obj: {[key: string]: V}): OrderedMap<string, V>OrderedMap<K, V>(iterator: Iterator<Array<any>>): OrderedMap<K, V>OrderedMap<K, V>(iterable: Object): OrderedMap<K, V>

Question 44

Q

OrderedMap

True if the provided value is an OrderedMap.

OrderedMap.isOrderedMap(maybeOrderedMap: any): boolean

1 static methods methods.

Answer

A

OrderedMap.isOrderedMap

True if the provided value is an OrderedMap.

OrderedMap.isOrderedMap(maybeOrderedMap: any): boolean

Question 45

Q

Set

Create a new immutable _____ containing the values of the provided iterable-like.

\_\_\_\_\_<T>():\_\_\_\_\_<T>\_\_\_\_\_<T>(iter:\_\_\_\_\_Iterable<T>): \_\_\_\_\_<T>\_\_\_\_\_<T>(iter: IndexedIterable<T>): \_\_\_\_\_<T>\_\_\_\_\_<K, V>(iter: KeyedIterable<K, V>): \_\_\_\_\_<any>\_\_\_\_\_<T>(array: Array<T>): \_\_\_\_\_<T>\_\_\_\_\_<T>(iterator: Iterator<T>): \_\_\_\_\_<T>\_\_\_\_\_<T>(iterable: Object): \_\_\_\_\_<T>

1 construction methods.

Answer

A

Set

Create a new immutable Set containing the values of the provided iterable-like.

Set<T>(): Set<T>Set<T>(iter: SetIterable<T>): Set<T>Set<T>(iter: IndexedIterable<T>): Set<T>Set<K, V>(iter: KeyedIterable<K, V>): Set<any>Set<T>(array: Array<T>): Set<T>Set<T>(iterator: Iterator<T>): Set<T>Set<T>(iterable: Object): Set<T>

Question 46

Q

Set

True if the provided value is a Set

Set.isSet(maybeSet: any): boolean

3 static methods methods.

Answer

A

Set.isSet

True if the provided value is a Set

Set.isSet(maybeSet: any): boolean

Question 47

Q

Set

Creates a new Set containing values.

Set.of<T>(...values: T[]): Set<T>

3 static methods methods.

Answer

A

Set.of

Creates a new Set containing values.

Set.of<T>(...values: T[]): Set<T>

Question 48

Q

Set

Set.fromKeys() creates a new immutable Set containing the keys from this Iterable or JavaScript Object.

Set.fromKeys<T>(iter: Iterable<T, any>): Set<T>Set.fromKeys(obj: {[key: string]: any}): Set<string>

3 static methods methods.

Answer

A

Set.fromKeys

Set.fromKeys() creates a new immutable Set containing the keys from this Iterable or JavaScript Object.

Set.fromKeys<T>(iter: Iterable<T, any>): Set<T>Set.fromKeys(obj: {[key: string]: any}): Set<string>

Question 49

Q

Set

Returns a new Set which also includes this value.

\_\_\_\_\_(value: T): Set<T>

6 persistent changes methods.

Answer

A

add

Returns a new Set which also includes this value.

add(value: T): Set<T>

Question 50

Q

Set

Returns a new Set which excludes this value.

\_\_\_\_\_(value: T): Set<T>

6 persistent changes methods.

Answer

A

delete

Returns a new Set which excludes this value.

delete(value: T): Set<T>

Question 51

Q

Set

Returns a new Set containing no values.

\_\_\_\_\_(): Set<T>

6 persistent changes methods.

Answer

A

clear

Returns a new Set containing no values.

clear(): Set<T>

Question 52

Q

Set

Returns a Set including any value from iterables that does not already exist in this Set.

\_\_\_\_\_(...iterables: Iterable<any, T>[]): Set<T>\_\_\_\_\_(...iterables: Array<T>[]): Set<T>

6 persistent changes methods.

Answer

A

union

Returns a Set including any value from iterables that does not already exist in this Set.

union(...iterables: Iterable<any, T>[]): Set<T>union(...iterables: Array<T>[]): Set<T>

Question 53

Q

Set

Returns a Set which has removed any values not also contained within iterables.

\_\_\_\_\_(...iterables: Iterable<any, T>[]): Set<T>\_\_\_\_\_(...iterables: Array<T>[]): Set<T>

6 persistent changes methods.

Answer

A

intersect

Returns a Set which has removed any values not also contained within iterables.

intersect(...iterables: Iterable<any, T>[]): Set<T>intersect(...iterables: Array<T>[]): Set<T>

Question 54

Q

Set

Returns a Set excluding any values contained within iterables.

\_\_\_\_\_(...iterables: Iterable<any, T>[]): Set<T>\_\_\_\_\_(...iterables: Array<T>[]): Set<T>

6 persistent changes methods.

Answer

A

subtract

Returns a Set excluding any values contained within iterables.

subtract(...iterables: Iterable<any, T>[]): Set<T>subtract(...iterables: Array<T>[]): Set<T>

Question 55

Q

Set

Note: Not all methods can be used on a mutable collection or within \_\_\_\_\_! Only add may be used mutatively.

\_\_\_\_\_(mutator: (mutable: Set<T>) => any): Set<T>

3 transient changes methods.

Answer

A

withMutations

Note: Not all methods can be used on a mutable collection or within withMutations! Only add may be used mutatively.

withMutations(mutator: (mutable: Set<T>) => any): Set<T>

Question 56

Q

Set
\_\_\_\_\_(): Set<T>

3 transient changes methods.

Answer

A

asMutable
asMutable(): Set<T>

Question 57

Q

Set
\_\_\_\_\_(): Set<T>

3 transient changes methods.

Answer

A

asImmutable
asImmutable(): Set<T>

Question 58

Q

OrderedSet

Create a new immutable _____ containing the values of the provided iterable-like.

\_\_\_\_\_<T>():\_\_\_\_\_<T>\_\_\_\_\_<T>(iter: SetIterable<T>):\_\_\_\_\_<T>\_\_\_\_\_<T>(iter: IndexedIterable<T>):\_\_\_\_\_<T>\_\_\_\_\_<K, V>(iter: KeyedIterable<K, V>):\_\_\_\_\_<any>\_\_\_\_\_<T>(array: Array<T>):\_\_\_\_\_<T>\_\_\_\_\_<T>(iterator: Iterator<T>):\_\_\_\_\_<T>\_\_\_\_\_<T>(iterable: Object):\_\_\_\_\_<T>

1 construction methods.

Answer

A

OrderedSet

Create a new immutable OrderedSet containing the values of the provided iterable-like.

OrderedSet<T>(): OrderedSet<T>OrderedSet<T>(iter: SetIterable<T>): OrderedSet<T>OrderedSet<T>(iter: IndexedIterable<T>): OrderedSet<T>OrderedSet<K, V>(iter: KeyedIterable<K, V>): OrderedSet<any>OrderedSet<T>(array: Array<T>): OrderedSet<T>OrderedSet<T>(iterator: Iterator<T>): OrderedSet<T>OrderedSet<T>(iterable: Object): OrderedSet<T>

Question 59

Q

OrderedSet

True if the provided value is an OrderedSet.

OrderedSet.isOrderedSet(maybeOrderedSet: any): boolean

3 static methods methods.

Answer

A

OrderedSet.isOrderedSet

True if the provided value is an OrderedSet.

OrderedSet.isOrderedSet(maybeOrderedSet: any): boolean

Question 60

Q

OrderedSet

Creates a new OrderedSet containing values.

OrderedSet.of<T>(...values: T[]): OrderedSet<T>

3 static methods methods.

Answer

A

OrderedSet.of

Creates a new OrderedSet containing values.

OrderedSet.of<T>(...values: T[]): OrderedSet<T>

Question 61

Q

OrderedSet

OrderedSet.fromKeys() creates a new immutable OrderedSet containing the keys from this Iterable or JavaScript Object.

OrderedSet.fromKeys<T>(iter: Iterable<T, any>): OrderedSet<T>OrderedSet.fromKeys(obj: {[key: string]: any}): OrderedSet<string>

3 static methods methods.

Answer

A

OrderedSet.fromKeys

OrderedSet.fromKeys() creates a new immutable OrderedSet containing the keys from this Iterable or JavaScript Object.

OrderedSet.fromKeys<T>(iter: Iterable<T, any>): OrderedSet<T>OrderedSet.fromKeys(obj: {[key: string]: any}): OrderedSet<string>

Question 62

Q

Stack

Create a new immutable _____ containing the values of the provided iterable-like.

\_\_\_\_\_<T>():\_\_\_\_\_<T>\_\_\_\_\_<T>(iter: IndexedIterable<T>):\_\_\_\_\_<T>\_\_\_\_\_<T>(iter: SetIterable<T>):\_\_\_\_\_<T>\_\_\_\_\_<K, V>(iter: KeyedIterable<K, V>):\_\_\_\_\_<any>\_\_\_\_\_<T>(array: Array<T>):\_\_\_\_\_<T>\_\_\_\_\_<T>(iterator: Iterator<T>):\_\_\_\_\_<T>\_\_\_\_\_<T>(iterable: Object):\_\_\_\_\_<T>

1 construction methods.

Answer

A

Stack

Create a new immutable Stack containing the values of the provided iterable-like.

Stack<T>(): Stack<T>Stack<T>(iter: IndexedIterable<T>): Stack<T>Stack<T>(iter: SetIterable<T>): Stack<T>Stack<K, V>(iter: KeyedIterable<K, V>): Stack<any>Stack<T>(array: Array<T>): Stack<T>Stack<T>(iterator: Iterator<T>): Stack<T>Stack<T>(iterable: Object): Stack<T>

Question 63

Q

Stack

True if the provided value is a Stack

Stack.isStack(maybeStack: any): boolean

2 static methods methods.

Answer

A

Stack.isStack

True if the provided value is a Stack

Stack.isStack(maybeStack: any): boolean

Question 64

Q

Stack

Creates a new Stack containing values.

Stack.of<T>(...values: T[]): Stack<T>

2 static methods methods.

Answer

A

Stack.of

Creates a new Stack containing values.

Stack.of<T>(...values: T[]): Stack<T>

Answer 65

A

peek

Alias for Stack.first().

peek(): T

Answer 66

A

clear

Returns a new Stack with 0 size and no values.

clear(): Stack<T>

Answer 67

A

unshift

Returns a new Stack with the provided values prepended, shifting other values ahead to higher indices.

unshift(...values: T[]): Stack<T>

Answer 68

A

unshiftAll

Like Stack#unshift, but accepts a iterable rather than varargs.

unshiftAll(iter: Iterable<any, T>): Stack<T>unshiftAll(iter: Array<T>): Stack<T>

Answer 69

A

shift

Returns a new Stack with a size ones less than this Stack, excluding the first item in this Stack, shifting all other values to a lower index.

shift(): Stack<T>

Answer 70

A

push

Alias for Stack#unshift and is not equivalent to List#push.

push(...values: T[]): Stack<T>

Answer 71

A

pushAll

Alias for Stack#unshiftAll.

pushAll(iter: Iterable<any, T>): Stack<T>pushAll(iter: Array<T>): Stack<T>

Answer 72

A

pop

Alias for Stack#shift and is not equivalent to List#pop.

pop(): Stack<T>

Answer 73

A

withMutations

Note: Not all methods can be used on a mutable collection or within withMutations! Only set, push, and pop may be used mutatively.

withMutations(mutator: (mutable: Stack<T>) => any): Stack<T>

Answer 74

A

asMutable
asMutable(): Stack<T>

Answer 75

A

asImmutable
asImmutable(): Stack<T>

Answer 76

A

Record
Record(defaultValues: {[key: string]: any}, name?: string): Record.Class

Answer 77

A

Seq

Creates a Seq.

Seq<K, V>(): Seq<K, V>Seq<K, V>(seq: Seq<K, V>): Seq<K, V>Seq<K, V>(iterable: Iterable<K, V>): Seq<K, V>Seq<T>(array: Array<T>): IndexedSeq<T>Seq<V>(obj: {[key: string]: V}): KeyedSeq<string, V>Seq<T>(iterator: Iterator<T>): IndexedSeq<T>Seq<T>(iterable: Object): IndexedSeq<T>

Answer 78

A

Seq.isSeq

True if maybeSeq is a Seq, it is not backed by a concrete structure such as Map, List, or Set.

Seq.isSeq(maybeSeq: any): boolean

Answer 79

A

Seq.of

Returns a Seq of the values provided. Alias for IndexedSeq.of().

Seq.of<T>(...values: T[]): IndexedSeq<T>

Answer 80

A

si
size: number

Answer 81

A

cacheResult

Because Sequences are lazy and designed to be chained together, they do not cache their results. For example, this map function is called a total of 6 times, as each join iterates the Seq of three values.

cacheResult(): Seq<K, V>

Answer 82

A

KeyedSeq

Always returns a KeyedSeq, if input is not keyed, expects an iterable of [K, V] tuples.

KeyedSeq<K, V>(): KeyedSeq<K, V>KeyedSeq<K, V>(seq: KeyedIterable<K, V>): KeyedSeq<K, V>KeyedSeq<K, V>(seq: Iterable<any, any>): KeyedSeq<K, V>KeyedSeq<K, V>(array: Array<any>): KeyedSeq<K, V>KeyedSeq<V>(obj: {[key: string]: V}): KeyedSeq<string, V>KeyedSeq<K, V>(iterator: Iterator<any>): KeyedSeq<K, V>KeyedSeq<K, V>(iterable: Object): KeyedSeq<K, V>

Answer 83

A

toSeq

Returns itself

toSeq(): KeyedSeq<K, V>

Answer 84

A

IndexedSeq

Always returns IndexedSeq, discarding associated keys and supplying incrementing indices.

IndexedSeq<T>(): IndexedSeq<T>IndexedSeq<T>(seq: IndexedIterable<T>): IndexedSeq<T>IndexedSeq<T>(seq: SetIterable<T>): IndexedSeq<T>IndexedSeq<K, V>(seq: KeyedIterable<K, V>): IndexedSeq<any>IndexedSeq<T>(array: Array<T>): IndexedSeq<T>IndexedSeq<T>(iterator: Iterator<T>): IndexedSeq<T>IndexedSeq<T>(iterable: Object): IndexedSeq<T>

Answer 85

A

IndexedSeq.of

Provides an IndexedSeq of the values provided.

IndexedSeq.of<T>(...values: T[]): IndexedSeq<T>

Answer 86

A

toSeq

Returns itself

toSeq(): IndexedSeq<T>

Answer 87

A

SetSeq

Always returns a SetSeq, discarding associated indices or keys.

SetSeq<T>(): SetSeq<T>SetSeq<T>(seq: SetIterable<T>): SetSeq<T>SetSeq<T>(seq: IndexedIterable<T>): SetSeq<T>SetSeq<K, V>(seq: KeyedIterable<K, V>): SetSeq<any>SetSeq<T>(array: Array<T>): SetSeq<T>SetSeq<T>(iterator: Iterator<T>): SetSeq<T>SetSeq<T>(iterable: Object): SetSeq<T>

Answer 88

A

SetSeq.of

Returns a SetSeq of the provided values

SetSeq.of<T>(...values: T[]): SetSeq<T>

Answer 89

A

toSeq

Returns itself

toSeq(): SetSeq<T>

Answer 90

A

Iterable

Creates an Iterable.

Iterable<K, V>(iterable: Iterable<K, V>): Iterable<K, V>Iterable<T>(array: Array<T>): IndexedIterable<T>Iterable<V>(obj: {[key: string]: V}): KeyedIterable<string, V>Iterable<T>(iterator: Iterator<T>): IndexedIterable<T>Iterable<T>(iterable: Object): IndexedIterable<T>Iterable<V>(value: V): IndexedIterable<V>

Answer 91

A

Iterable.isIterable

True if maybeIterable is an Iterable, or any of its subclasses.

Iterable.isIterable(maybeIterable: any): boolean

Answer 92

A

Iterable.isKeyed

True if maybeKeyed is a KeyedIterable, or any of its subclasses.

Iterable.isKeyed(maybeKeyed: any): boolean

Answer 93

A

Iterable.isIndexed

True if maybeIndexed is a IndexedIterable, or any of its subclasses.

Iterable.isIndexed(maybeIndexed: any): boolean

Answer 94

A

Iterable.isAssociative

True if maybeAssociative is either a keyed or indexed Iterable.

Iterable.isAssociative(maybeAssociative: any): boolean

Answer 95

A

Iterable.isOrdered

True if maybeOrdered is an Iterable where iteration order is well defined. True for IndexedIterable as well as OrderedMap and OrderedSet.

Iterable.isOrdered(maybeOrdered: any): boolean

Answer 96

A

equals

True if this and the other Iterable have value equality, as defined by Immutable.is().

equals(other: Iterable<K, V>): boolean

Answer 97

A

hashCode

Computes and returns the hashed identity for this Iterable.

hashCode(): number

Answer 98

A

get

Returns the value associated with the provided key, or notSetValue if the Iterable does not contain this key.

get(key: K, notSetValue?: V): V

Answer 99

A

has

True if a key exists within this Iterable.

has(key: K): boolean

Answer 100

A

includes

True if a value exists within this Iterable.

includes(value: V): boolean

Answer 101

A

first

The first value in the Iterable.

first(): V

Answer 102

A

last

The last value in the Iterable.

last(): V

Answer 103

A

getIn

Returns the value found by following a path of keys or indices through nested Iterables.

getIn(searchKeyPath: Array<any>, notSetValue?: any): anygetIn(searchKeyPath: Iterable<any, any>, notSetValue?: any): any

Answer 104

A

hasIn

True if the result of following a path of keys or indices through nested Iterables results in a set value.

hasIn(searchKeyPath: Array<any>): booleanhasIn(searchKeyPath: Iterable<any, any>): boolean

Answer 105

A

toJS

Deeply converts this Iterable to equivalent JS.

toJS(): any

Answer 106

A

toArray

Shallowly converts this iterable to an Array, discarding keys.

toArray(): Array<V>

Answer 107

A

toObject

Shallowly converts this Iterable to an Object.

toObject(): {[key: string]: V}

Answer 108

A

toMap

Converts this Iterable to a Map, Throws if keys are not hashable.

toMap(): Map<K, V>

Answer 109

A

toOrderedMap

Converts this Iterable to a Map, maintaining the order of iteration.

toOrderedMap(): Map<K, V>

Answer 110

A

toSet

Converts this Iterable to a Set, discarding keys. Throws if values are not hashable.

toSet(): Set<V>

Answer 111

A

toOrderedSet

Converts this Iterable to a Set, maintaining the order of iteration and discarding keys.

toOrderedSet(): Set<V>

Answer 112

A

toList

Converts this Iterable to a List, discarding keys.

toList(): List<V>

Answer 113

A

toStack

Converts this Iterable to a Stack, discarding keys. Throws if values are not hashable.

toStack(): Stack<V>

Answer 114

A

toSeq

Converts this Iterable to a Seq of the same kind (indexed, keyed, or set).

toSeq(): Seq<K, V>

Answer 115

A

toKeyedSeq

Returns a KeyedSeq from this Iterable where indices are treated as keys.

toKeyedSeq(): KeyedSeq<K, V>

Answer 116

A

toIndexedSeq

Returns an IndexedSeq of the values of this Iterable, discarding keys.

toIndexedSeq(): IndexedSeq<V>

Answer 117

A

toSetSeq

Returns a SetSeq of the values of this Iterable, discarding keys.

toSetSeq(): SetSeq<V>

Answer 118

A

keys

An iterator of this Iterable’s keys.

keys(): Iterator<K>

Answer 119

A

values

An iterator of this Iterable’s values.

values(): Iterator<V>

Answer 120

A

entries

An iterator of this Iterable’s entries as [key, value] tuples.

entries(): Iterator<Array<any>>

Answer 121

A

keySeq

Returns a new IndexedSeq of the keys of this Iterable, discarding values.

keySeq(): IndexedSeq<K>

Answer 122

A

valueSeq

Returns an IndexedSeq of the values of this Iterable, discarding keys.

valueSeq(): IndexedSeq<V>

Answer 123

A

entrySeq

Returns a new IndexedSeq of [key, value] tuples.

entrySeq(): IndexedSeq<Array<any>>

Answer 124

A

map

Returns a new Iterable of the same type with values passed through a mapper function.

`map<M>(
mapper: (value?: V, key?: K, iter?: Iterable<K, V>) => M,context?: any</M>

): Iterable<K, M>`

Answer 125

A

filter

Returns a new Iterable of the same type with only the entries for which the predicate function returns true.

`filter(
predicate: (value?: V, key?: K, iter?: Iterable<K, V>) => boolean,context?: any

): Iterable<K, V>`

Answer 126

A

filterNot

Returns a new Iterable of the same type with only the entries for which the predicate function returns false.

`filterNot(
predicate: (value?: V, key?: K, iter?: Iterable<K, V>) => boolean,context?: any

): Iterable<K, V>`

Answer 127

A

reverse

Returns a new Iterable of the same type in reverse order.

reverse(): Iterable<K, V>

Answer 128

A

sort

Returns a new Iterable of the same type which includes the same entries, stably sorted by using a comparator.

sort(comparator?: (valueA: V, valueB: V) => number): Iterable<K, V>

Answer 129

A

sortBy

Like sort, but also accepts a comparatorValueMapper which allows for sorting by more sophisticated means:

`sortBy<C>(
comparatorValueMapper: (value?: V, key?: K, iter?: Iterable<K, V>) => C,comparator?: (valueA: C, valueB: C) => number</C>

): Iterable<K, V>`

Answer 130

A

groupBy

Returns a KeyedIterable of KeyedIterables, grouped by the return value of the grouper function.

`groupBy<G>(
grouper: (value?: V, key?: K, iter?: Iterable<K, V>) => G,context?: any</G>

): KeyedSeq<G, Iterable<K, V»`

Answer 131

A

forEach

The sideEffect is executed for every entry in the Iterable.

`forEach(
sideEffect: (value?: V, key?: K, iter?: Iterable<K, V>) => any,context?: any

): number`

Answer 132

A

slice

Returns a new Iterable of the same type representing a portion of this Iterable from start up to but not including end.

slice(begin?: number, end?: number): Iterable<K, V>

Answer 133

A

rest

Returns a new Iterable of the same type containing all entries except the first.

rest(): Iterable<K, V>

Answer 134

A

butLast

Returns a new Iterable of the same type containing all entries except the last.

butLast(): Iterable<K, V>

Answer 135

A

skip

Returns a new Iterable of the same type which excludes the first amount entries from this Iterable.

skip(amount: number): Iterable<K, V>

Answer 136

A

skipLast

Returns a new Iterable of the same type which excludes the last amount entries from this Iterable.

skipLast(amount: number): Iterable<K, V>

Answer 137

A

skipWhile

Returns a new Iterable of the same type which includes entries starting from when predicate first returns false.

`skipWhile(
predicate: (value?: V, key?: K, iter?: Iterable<K, V>) => boolean,context?: any

): Iterable<K, V>`

Answer 138

A

skipUntil

Returns a new Iterable of the same type which includes entries starting from when predicate first returns true.

`skipUntil(
predicate: (value?: V, key?: K, iter?: Iterable<K, V>) => boolean,context?: any

): Iterable<K, V>`

Answer 139

A

take

Returns a new Iterable of the same type which includes the first amount entries from this Iterable.

take(amount: number): Iterable<K, V>

Answer 140

A

takeLast

Returns a new Iterable of the same type which includes the last amount entries from this Iterable.

takeLast(amount: number): Iterable<K, V>

Answer 141

A

takeWhile

Returns a new Iterable of the same type which includes entries from this Iterable as long as the predicate returns true.

`takeWhile(
predicate: (value?: V, key?: K, iter?: Iterable<K, V>) => boolean,context?: any

): Iterable<K, V>`

Answer 142

A

takeUntil

Returns a new Iterable of the same type which includes entries from this Iterable as long as the predicate returns false.

`takeUntil(
predicate: (value?: V, key?: K, iter?: Iterable<K, V>) => boolean,context?: any

): Iterable<K, V>`

Answer 143

A

concat

Returns a new Iterable of the same type with other values and iterable-like concatenated to this one.

concat(...valuesOrIterables: any[]): Iterable<K, V>

Answer 144

A

flatten

Flattens nested Iterables.

flatten(depth?: number): Iterable<any, any>flatten(shallow?: boolean): Iterable<any, any>

Answer 145

A

flatMap

Flat-maps the Iterable, returning an Iterable of the same type.

`flatMap<MK, MV>(
mapper: (value?: V, key?: K, iter?: Iterable<K, V>) => Iterable<MK, MV>,context?: any

): Iterable<MK, MV>flatMap<MK, MV>(
mapper: (value?: V, key?: K, iter?: Iterable<K, V>) => any,context?: any

): Iterable<MK, MV>`

Answer 146

A

reduce

Reduces the Iterable to a value by calling the reducer for every entry in the Iterable and passing along the reduced value.

`reduce<R>(
reducer: (reduction?: R, value?: V, key?: K, iter?: Iterable<K, V>) => R,initialReduction?: R,context?: any</R>

): R`

Answer 147

A

reduceRight

Reduces the Iterable in reverse (from the right side).

`reduceRight<R>(
reducer: (reduction?: R, value?: V, key?: K, iter?: Iterable<K, V>) => R,initialReduction?: R,context?: any</R>

): R`

Answer 148

A

every

True if predicate returns true for all entries in the Iterable.

`every(
predicate: (value?: V, key?: K, iter?: Iterable<K, V>) => boolean,context?: any

): boolean`

Answer 149

A

some

True if predicate returns true for any entry in the Iterable.

`some(
predicate: (value?: V, key?: K, iter?: Iterable<K, V>) => boolean,context?: any

): boolean`

Answer 150

A

join

Joins values together as a string, inserting a separator between each. The default separator is ",".

join(separator?: string): string

Answer 151

A

isEmpty

Returns true if this Iterable includes no values.

isEmpty(): boolean

Answer 152

A

count

Returns the size of this Iterable.

`count(): numbercount(
predicate: (value?: V, key?: K, iter?: Iterable<K, V>) => boolean,context?: any

): number`

Answer 153

A

countBy

Returns a KeyedSeq of counts, grouped by the return value of the grouper function.

`countBy<G>(
grouper: (value?: V, key?: K, iter?: Iterable<K, V>) => G,context?: any</G>

): Map<G, number>`

Answer 154

A

find

Returns the value for which the predicate returns true.

`find(
predicate: (value?: V, key?: K, iter?: Iterable<K, V>) => boolean,context?: any,notSetValue?: V

): V`

Answer 155

A

findLast

Returns the last value for which the predicate returns true.

`findLast(
predicate: (value?: V, key?: K, iter?: Iterable<K, V>) => boolean,context?: any,notSetValue?: V

): V`

Answer 156

A

findEntry

Returns the [key, value] entry for which the predicate returns true.

`findEntry(
predicate: (value?: V, key?: K, iter?: Iterable<K, V>) => boolean,context?: any,notSetValue?: V

): Array<any>`</any>

Answer 157

A

findLastEntry

Returns the last [key, value] entry for which the predicate returns true.

`findLastEntry(
predicate: (value?: V, key?: K, iter?: Iterable<K, V>) => boolean,context?: any,notSetValue?: V

): Array<any>`</any>

Answer 158

A

max

Returns the maximum value in this collection. If any values are comparatively equivalent, the first one found will be returned.

max(comparator?: (valueA: V, valueB: V) => number): V

Answer 159

A

maxBy

Like max, but also accepts a comparatorValueMapper which allows for comparing by more sophisticated means:

`maxBy<C>(
comparatorValueMapper: (value?: V, key?: K, iter?: Iterable<K, V>) => C,comparator?: (valueA: C, valueB: C) => number</C>

): V`

Answer 160

A

min

Returns the minimum value in this collection. If any values are comparatively equivalent, the first one found will be returned.

min(comparator?: (valueA: V, valueB: V) => number): V

Answer 161

A

minBy

Like min, but also accepts a comparatorValueMapper which allows for comparing by more sophisticated means:

`minBy<C>(
comparatorValueMapper: (value?: V, key?: K, iter?: Iterable<K, V>) => C,comparator?: (valueA: C, valueB: C) => number</C>

): V`

Answer 162

A

isSubset

True if iter includes every value in this Iterable.

isSubset(iter: Iterable<any, V>): booleanisSubset(iter: Array<V>): boolean

Answer 163

A

isSuperset

True if this Iterable includes every value in iter.

isSuperset(iter: Iterable<any, V>): booleanisSuperset(iter: Array<V>): boolean

Answer 164

A

KeyedIterable

Creates a KeyedIterable

KeyedIterable<K, V>(iter: KeyedIterable<K, V>): KeyedIterable<K, V>KeyedIterable<K, V>(iter: Iterable<any, any>): KeyedIterable<K, V>KeyedIterable<K, V>(array: Array<any>): KeyedIterable<K, V>KeyedIterable<V>(obj: {[key: string]: V}): KeyedIterable<string, V>KeyedIterable<K, V>(iterator: Iterator<any>): KeyedIterable<K, V>KeyedIterable<K, V>(iterable: Object): KeyedIterable<K, V>

Answer 165

A

toSeq

Returns KeyedSeq.

toSeq(): KeyedSeq<K, V>

Answer 166

A

flip

Returns a new KeyedIterable of the same type where the keys and values have been flipped.

flip(): KeyedIterable<V, K>

Answer 167

A

mapKeys

Returns a new KeyedIterable of the same type with keys passed through a mapper function.

`mapKeys<M>(
mapper: (key?: K, value?: V, iter?: KeyedIterable<K, V>) => M,context?: any</M>

): KeyedIterable<M, V>`

Answer 168

A

mapEntries

Returns a new KeyedIterable of the same type with entries ([key, value] tuples) passed through a mapper function.

`mapEntries<KM, VM>(
mapper: (
entry?: Array<any>,index?: number,iter?: KeyedIterable<K, V></any>

) => Array<any>,context?: any</any>

): KeyedIterable<KM, VM>`

Answer 169

A

keyOf

Returns the key associated with the search value, or undefined.

keyOf(searchValue: V): K

Answer 170

A

lastKeyOf

Returns the last key associated with the search value, or undefined.

lastKeyOf(searchValue: V): K

Answer 171

A

findKey

Returns the key for which the predicate returns true.

`findKey(
predicate: (value?: V, key?: K, iter?: KeyedIterable<K, V>) => boolean,context?: any

): K`

Answer 172

A

findLastKey

Returns the last key for which the predicate returns true.

`findLastKey(
predicate: (value?: V, key?: K, iter?: KeyedIterable<K, V>) => boolean,context?: any

): K`

Answer 173

A

IndexedIterable

Creates a new IndexedIterable.

IndexedIterable<T>(iter: IndexedIterable<T>): IndexedIterable<T>IndexedIterable<T>(iter: SetIterable<T>): IndexedIterable<T>IndexedIterable<K, V>(iter: KeyedIterable<K, V>): IndexedIterable<any>IndexedIterable<T>(array: Array<T>): IndexedIterable<T>IndexedIterable<T>(iterator: Iterator<T>): IndexedIterable<T>IndexedIterable<T>(iterable: Object): IndexedIterable<T>

Answer 174

A

get

Returns the value associated with the provided index, or notSetValue if the index is beyond the bounds of the Iterable.

get(index: number, notSetValue?: T): T

Answer 175

A

toSeq

Returns IndexedSeq.

toSeq(): IndexedSeq<T>

Answer 176

A

fromEntrySeq

If this is an iterable of [key, value] entry tuples, it will return a KeyedSeq of those entries.

fromEntrySeq(): KeyedSeq<any, any>

Answer 177

A

interpose

Returns an Iterable of the same type with separator between each item in this Iterable.

interpose(separator: T): IndexedIterable<T>

Answer 178

A

interleave

Returns an Iterable of the same type with the provided iterables interleaved into this iterable.

interleave(...iterables: Array<Iterable<any, T>>): IndexedIterable<T>

Answer 179

A

splice

Splice returns a new indexed Iterable by replacing a region of this Iterable with new values. If values are not provided, it only skips the region to be removed.

splice(index: number, removeNum: number, ...values: any[]): IndexedIterable<T>

Answer 180

A

zip

Returns an Iterable of the same type “zipped” with the provided iterables.

zip(...iterables: Array<Iterable<any, any>>): IndexedIterable<any>

Answer 181

A

zipWith

Returns an Iterable of the same type “zipped” with the provided iterables by using a custom zipper function.

`zipWith<U, Z>(
zipper: (value: T, otherValue: U) => Z,otherIterable: Iterable<any, U>

): IndexedIterable<Z>zipWith<U, V, Z>(
zipper: (value: T, otherValue: U, thirdValue: V) => Z,otherIterable: Iterable<any, U>,thirdIterable: Iterable<any, V></Z>

): IndexedIterable<Z>zipWith<Z>(
zipper: (...any: Array<any>) => Z,...iterables: Array<Iterable<any, any>></any></Z></Z>

): IndexedIterable<Z>`</Z>

Answer 182

A

indexOf

Returns the first index at which a given value can be found in the Iterable, or -1 if it is not present.

indexOf(searchValue: T): number

Answer 183

A

lastIndexOf

Returns the last index at which a given value can be found in the Iterable, or -1 if it is not present.

lastIndexOf(searchValue: T): number

Answer 184

A

findIndex

Returns the first index in the Iterable where a value satisfies the provided predicate function. Otherwise -1 is returned.

`findIndex(
predicate: (value?: T, index?: number, iter?: IndexedIterable<T>) => boolean,context?: any</T>

): number`

Answer 185

A

findLastIndex

Returns the last index in the Iterable where a value satisfies the provided predicate function. Otherwise -1 is returned.

`findLastIndex(
predicate: (value?: T, index?: number, iter?: IndexedIterable<T>) => boolean,context?: any</T>

): number`

Answer 186

A

SetIterable

Similar to Iterable(), but always returns a SetIterable.

SetIterable<T>(iter: SetIterable<T>): SetIterable<T>SetIterable<T>(iter: IndexedIterable<T>): SetIterable<T>SetIterable<K, V>(iter: KeyedIterable<K, V>): SetIterable<any>SetIterable<T>(array: Array<T>): SetIterable<T>SetIterable<T>(iterator: Iterator<T>): SetIterable<T>SetIterable<T>(iterable: Object): SetIterable<T>

Answer 187

A

toSeq

Returns SetSeq.

toSeq(): SetSeq<T>

Answer 188

A

si
size: number

Answer 189

A

toSeq

Returns KeyedSeq.

toSeq(): KeyedSeq<K, V>

Answer 190

A

toSeq

Returns IndexedSeq.

toSeq(): IndexedSeq<T>

Answer 191

A

toSeq

Returns SetSeq.

toSeq(): SetSeq<T>