array

Append ys to xs and return xs.

Create object composed of keys resulting from application of iteratee function to each element of the passed array arr. Values corresponds to the number of occurences of an element in the passed array.

iteratee is optional and defaults to identity function.

Example:

countBy(
    "exemplo plus quam ratione vivimus".split(" "),
    w => w.length
)

Compute array as a \ b (set difference).

Choose a random element from a non-empty array.

Drop the first n elements of a given array or string. Returns array or string without the first n elements.

Drop the last n elements of a given array. Returns array without the last n elements.

Find duplicates in a given array.

Optionally, before comparision, each element is transformed by iteratee function (which defaults to identity).

Example:

array.findDuplicates(["one", "two", "one", "three", "six", "two", "two"])

Simple array flattener.

[[1, 2,], ..., [3, 4,],]  ->  [1, 2, ..., 3, 4,]

Return first element of the given array.

Return array without its last element.

Compute array that is an intersection of a and b arrays.

Checks if a given array is a continuous block.

Checks if a given array is sorted.

Check if array a is a subset of array b.

Return the last element of the given array.

• range(stop) -> array of numbers; start defaults to 0
• range(start, stop[, step]) -> array of numbers

Return a list containing an arithmetic progression.

• range(i, j) returns [i, i+1, i+2, ..., j-1].

When step is given, it specifies the increment (or decrement). For example:

• range(4) returns [0, 1, 2, 3].

Imitates Python's range().

Create a new array with removed duplicates.

Check set equality of two arrays treated as sets.

Shuffle all elements in the given array (Durstenfeld's modification to the Fisher-Yates shuffle algorithm).

The operation is taken in-place.

• sparse(stop, size) -> array of 'size' distinct integers in range [0..stop-1]
• sparse(start, stop, size) -> array of 'size' distinct integers in range [start..stop-1]

Generate sparse array of distinct integers with (almost) uniform distribution.

Return array without its head (first element).

Take the first n elements of a given array.

Take every nth element from an arr array.

Take the last n elements of a given array.

Zip given arrays.

Example:

zip([1, 2, 3, 4, 5], ["a", "b", "c", "d", "e"])
[ [ 1, 'a' ], [ 2, 'b' ], [ 3, 'c' ], [ 4, 'd' ], [ 5, 'e' ] ]

Zip given arrays using provided f operator.

Example:

array.zipWith((a, b) => a + b) ([1, 2, 3, 4], [10, 20, 30, 40])
[ 11, 22, 33, 44 ]

Append ys to xs and return xs.

Create object composed of keys resulting from application of iteratee function to each element of the passed array arr. Values corresponds to the number of occurences of an element in the passed array.

iteratee is optional and defaults to identity function.

Example:

countBy(
    "exemplo plus quam ratione vivimus".split(" "),
    w => w.length
)

Compute array as a \ b (set difference).

Choose a random element from a non-empty array.

Drop the first n elements of a given array or string. Returns array or string without the first n elements.

Drop the last n elements of a given array. Returns array without the last n elements.

Find duplicates in a given array.

Optionally, before comparision, each element is transformed by iteratee function (which defaults to identity).

Example:

array.findDuplicates(["one", "two", "one", "three", "six", "two", "two"])

Simple array flattener.

[[1, 2,], ..., [3, 4,],]  ->  [1, 2, ..., 3, 4,]

Return first element of the given array.

Return array without its last element.

Compute array that is an intersection of a and b arrays.

Checks if a given array is a continuous block.

Checks if a given array is sorted.

Check if array a is a subset of array b.

Return the last element of the given array.

• range(stop) -> array of numbers; start defaults to 0
• range(start, stop[, step]) -> array of numbers

Return a list containing an arithmetic progression.

• range(i, j) returns [i, i+1, i+2, ..., j-1].

When step is given, it specifies the increment (or decrement). For example:

• range(4) returns [0, 1, 2, 3].

Imitates Python's range().

Create a new array with removed duplicates.

Check set equality of two arrays treated as sets.

Shuffle all elements in the given array (Durstenfeld's modification to the Fisher-Yates shuffle algorithm).

The operation is taken in-place.

• sparse(stop, size) -> array of 'size' distinct integers in range [0..stop-1]
• sparse(start, stop, size) -> array of 'size' distinct integers in range [start..stop-1]

Generate sparse array of distinct integers with (almost) uniform distribution.

Return array without its head (first element).

Take the first n elements of a given array.

Take every nth element from an arr array.

Take the last n elements of a given array.

Zip given arrays.

Example:

zip([1, 2, 3, 4, 5], ["a", "b", "c", "d", "e"])
[ [ 1, 'a' ], [ 2, 'b' ], [ 3, 'c' ], [ 4, 'd' ], [ 5, 'e' ] ]

Zip given arrays using provided f operator.

Example:

array.zipWith((a, b) => a + b) ([1, 2, 3, 4], [10, 20, 30, 40])
[ 11, 22, 33, 44 ]

Append ys to xs and return xs.

Create object composed of keys resulting from application of iteratee function to each element of the passed array arr. Values corresponds to the number of occurences of an element in the passed array.

iteratee is optional and defaults to identity function.

Example:

countBy(
    "exemplo plus quam ratione vivimus".split(" "),
    w => w.length
)

Compute array as a \ b (set difference).

Choose a random element from a non-empty array.

Drop the first n elements of a given array or string. Returns array or string without the first n elements.

Drop the last n elements of a given array. Returns array without the last n elements.

Find duplicates in a given array.

Optionally, before comparision, each element is transformed by iteratee function (which defaults to identity).

Example:

array.findDuplicates(["one", "two", "one", "three", "six", "two", "two"])

Simple array flattener.

[[1, 2,], ..., [3, 4,],]  ->  [1, 2, ..., 3, 4,]

Return first element of the given array.

Return array without its last element.

Compute array that is an intersection of a and b arrays.

Checks if a given array is a continuous block.

Checks if a given array is sorted.

Check if array a is a subset of array b.

Return the last element of the given array.

• range(stop) -> array of numbers; start defaults to 0
• range(start, stop[, step]) -> array of numbers

Return a list containing an arithmetic progression.

• range(i, j) returns [i, i+1, i+2, ..., j-1].

When step is given, it specifies the increment (or decrement). For example:

• range(4) returns [0, 1, 2, 3].

Imitates Python's range().

Create a new array with removed duplicates.

Check set equality of two arrays treated as sets.

Shuffle all elements in the given array (Durstenfeld's modification to the Fisher-Yates shuffle algorithm).

The operation is taken in-place.

• sparse(stop, size) -> array of 'size' distinct integers in range [0..stop-1]
• sparse(start, stop, size) -> array of 'size' distinct integers in range [start..stop-1]

Generate sparse array of distinct integers with (almost) uniform distribution.

Return array without its head (first element).

Take the first n elements of a given array.

Take every nth element from an arr array.

Take the last n elements of a given array.

Zip given arrays.

Example:

zip([1, 2, 3, 4, 5], ["a", "b", "c", "d", "e"])
[ [ 1, 'a' ], [ 2, 'b' ], [ 3, 'c' ], [ 4, 'd' ], [ 5, 'e' ] ]

Zip given arrays using provided f operator.

Example:

array.zipWith((a, b) => a + b) ([1, 2, 3, 4], [10, 20, 30, 40])
[ 11, 22, 33, 44 ]

Append ys to xs and return xs.

Create object composed of keys resulting from application of iteratee function to each element of the passed array arr. Values corresponds to the number of occurences of an element in the passed array.

iteratee is optional and defaults to identity function.

Example:

countBy(
    "exemplo plus quam ratione vivimus".split(" "),
    w => w.length
)

Compute array as a \ b (set difference).

Choose a random element from a non-empty array.

Drop the first n elements of a given array or string. Returns array or string without the first n elements.

Drop the last n elements of a given array. Returns array without the last n elements.

Find duplicates in a given array.

Optionally, before comparision, each element is transformed by iteratee function (which defaults to identity).

Example:

array.findDuplicates(["one", "two", "one", "three", "six", "two", "two"])

Simple array flattener.

[[1, 2,], ..., [3, 4,],]  ->  [1, 2, ..., 3, 4,]

Return first element of the given array.

Return array without its last element.

Compute array that is an intersection of a and b arrays.

Checks if a given array is a continuous block.

Checks if a given array is sorted.

Check if array a is a subset of array b.

Return the last element of the given array.

• range(stop) -> array of numbers; start defaults to 0
• range(start, stop[, step]) -> array of numbers

Return a list containing an arithmetic progression.

• range(i, j) returns [i, i+1, i+2, ..., j-1].

When step is given, it specifies the increment (or decrement). For example:

• range(4) returns [0, 1, 2, 3].

Imitates Python's range().

Create a new array with removed duplicates.

Check set equality of two arrays treated as sets.

Shuffle all elements in the given array (Durstenfeld's modification to the Fisher-Yates shuffle algorithm).

The operation is taken in-place.

• sparse(stop, size) -> array of 'size' distinct integers in range [0..stop-1]
• sparse(start, stop, size) -> array of 'size' distinct integers in range [start..stop-1]

Generate sparse array of distinct integers with (almost) uniform distribution.

Return array without its head (first element).

Take the first n elements of a given array.

Take every nth element from an arr array.

Take the last n elements of a given array.

Zip given arrays.

Example:

zip([1, 2, 3, 4, 5], ["a", "b", "c", "d", "e"])
[ [ 1, 'a' ], [ 2, 'b' ], [ 3, 'c' ], [ 4, 'd' ], [ 5, 'e' ] ]

Zip given arrays using provided f operator.

Example:

array.zipWith((a, b) => a + b) ([1, 2, 3, 4], [10, 20, 30, 40])
[ 11, 22, 33, 44 ]