Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/nam-hle/slice-arr
https://github.com/nam-hle/slice-arr
Last synced: 8 days ago
JSON representation
- Host: GitHub
- URL: https://github.com/nam-hle/slice-arr
- Owner: nam-hle
- License: mit
- Created: 2021-04-05T14:12:55.000Z (over 3 years ago)
- Default Branch: main
- Last Pushed: 2021-04-05T14:14:20.000Z (over 3 years ago)
- Last Synced: 2024-11-04T00:19:53.294Z (about 2 months ago)
- Size: 2.93 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# chunk-arr
[![Version](https://img.shields.io/npm/v/chunk-arr.svg)](https://www.npmjs.com/package/chunk-arr)
[![XO code style](https://img.shields.io/badge/code_style-XO-5ed9c7.svg)](https://github.com/xojs/xo)
[![codecov](https://codecov.io/gh/nam288/chunk-arr/branch/main/graph/badge.svg?token=fbqIQ8uk7t)](https://codecov.io/gh/nam288/chunk-arr)
![build](https://github.com/nam288/chunk-arr/actions/workflows/main.yml/badge.svg)
> A collection of utility functions to split an array into chunks by size or certain condition.## Why?
* Minimal APIs
* Written in TypeScript
* Actively maintained
* Fully coverage tests
* Inspired from [Ruby chunk](https://ruby-doc.org/core-3.0.0/Enumerable.html#method-i-chunk)## Install
```sh
$ npm install chunk-arr
```## Usage
```js
const { chunkBy } = require('chunk-arr');chunkBy([3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5], n => n % 2);
// [ [3, 1], [4], [1, 5, 9], [2, 6], [5, 3, 5] ]```
## API
### `chunk(array, [size = 1])`
Like lodash/chunk, split the `array` into chunks of `size`. If array can not be split evenly, the final chunk will be the remaining elements.
#### array
* Require: `true`
* Type: `any[]`The array to process
#### size
* Require: `false`
* Type: `number`
* Default: `1`The size of each chunk. Return empty array if `size` smaller than `1`.
**Note:** The `size` will be converted to the largest number that smaller than `size` by `Math.floor`.
**Example:**
```js
const { chunk } = require('chunk-arr');
// or
// const chunk = require('chunk-arr');const chars = ['a', 'b', 'c', 'd', 'e'];
console.log(chunk(chars));
// Output: [ ['a'], ['b'], ['c'], ['d'], ['e'] ]console.log(chunk(chars, 2.4));
// Output: [ ['a', 'b'], ['c', 'd'], ['e'] ]
```### `chunkBy(array, func)`
Iterate over array elements, chunking them together based on the return value of the block.
Consecutive elements which return the same block value are chunked together.
#### array
* Require: `true`
* Type: `T[]`The array to process
#### func
* Require: `true`
* Type: `(element: T, index: number): U`The function used to chunk array based on its return value. It takes two arguments: the current element is iterating and its index
**Example:** Split based on element types
```js
const { chunkBy } = require('chunk-arr');const arr = [true, -3, 1, 'a', 'b', 'c'];
console.log(chunkBy(arr, e => typeof e));
// Output: [ [true], [-3, 1], ['a', 'b', 'c'] ]
```### `chunkWhile(array, func)`
This method splits the array between `previous` and `current` element if the function receives those elements return false.
#### array
* Require: `true`
* Type: `Array`The array to process
#### func
* Require: `true`
* Type: `(previous: T, current: T): boolean`The function, which receives the `previous` and `current` element, uses to split array between them if it returns `false`
**Example:**
* Split array into non-decreasing chunks
```js
const { chunkWhile } = require('chunk-arr');const nums = [0, 9, 2, 2, 3, 2, 7, 5, 9, 5];
console.log(chunkWhile(nums, (prev, curr) => prev <= curr));
// Output: [[0, 9], [2, 2, 3], [2, 7], [5, 9], [5]]
```* Convert increasing numbers into the compact string
```js
const { chunkWhile } = require('chunk-arr');const nums = [1, 2, 4, 9, 10, 11, 12, 15, 16, 19, 20, 21];
console.log(chunkWhile(nums, (prev, curr) => prev + 1 === curr)
.map((chunk) => chunk.length > 2 ? `${chunk[0]}-${chunk[chunk.length - 1]}` : chunk)
.join(',')
);
// Output: '1,2,4,9-12,15,16,19-21'
```## Author
* **Nam Hoang Le**
## Inspri
Give a ⭐️ if this project helped you!