Introducing Socket Firewall: Free, Proactive Protection for Your Software Supply Chain.Learn More
Socket
Book a DemoInstallSign in
Socket

@blakek/partition

Package Overview
Dependencies
Maintainers
1
Versions
2
Alerts
File Explorer

Advanced tools

Socket logo

Install Socket

Detect and block malicious and high-risk dependencies

Install

@blakek/partition

🗂 Partition an array or other iterable into two or more parts

latest
Source
npmnpm
Version
1.1.0
Version published
Maintainers
1
Created
Source

partition

🗂 Partition an array or other iterable into two or more parts

partition() is like [].filter() except you get the true and false results as separate arrays.

partitionMap() is like partition(), but instead of true/false, results are grouped by the return value of the passed function.

Install

Using Yarn:

$ yarn add @blakek/partition

…or using npm:

$ npm i --save @blakek/partition

Usage

import { partition, partitionMap } from '@blakek/partition';

const isEven = n => n % 2 === 0;

const [even, odd] = partition([1, 2, 3, 4, 5], isEven);

console.log(even); //» [2, 4]
console.log(odd); //» [1, 3, 5]

const scores = [
  { initials: 'ABC', score: 125 },
  { initials: 'CBK', score: 920 },
  { initials: 'ABC', score: 123 },
  { initials: 'CBD', score: 420 },
  { initials: 'CBK', score: 1000 }
];

partitionMap(scores, x => x.initials);
//» Map {
//»   'ABC' => [ { initials: 'ABC', score: 125 }, { initials: 'ABC', score: 123 } ],
//»   'CBK' => [ { initials: 'CBK', score: 920 }, { initials: 'CBK', score: 1000 } ],
//»   'CBD' => [ { initials: 'CBD', score: 420 } ]
//» }

API

partition

function partition<T>(
  iterable: Iterable<T>,
  partitionFunction: (value?: T, index?: number, array?: T[]) => boolean
): [T[], T[]];

Splits an array into two parts: those where the partition function was truthy, and those where it was falsy.

partitionMap

function partitionMap<T, U>(
  iterable: Iterable<T>,
  partitionFunction: (value?: T, index?: number, array?: T[]) => U
): Map<U, T[]>;

Creates a Map from the returns of the partition function.

partitionMap([1, 2, 3, 4, 5], n => n % 2 == 0);
//» Map(2) { false => [ 1, 3, 5 ], true => [ 2, 4 ] }

const name = n => {
  if (n < 3) return 'small';
  if (n < 7) return 'medium';
  return 'large';
};

partitionMap(new Set([1, 2, 3, 4, 5, 6, 7, 8]), n => name(n));
//» Map(3) {
//»   'small' => [ 1, 2 ],
//»   'medium' => [ 3, 4, 5, 6 ],
//»   'large' => [ 7, 8 ]
//» }

Contributing

Node.js and Yarn are required to work with this project.

To install all dependencies, run:

yarn

Useful Commands

yarn buildBuilds the project to ./dist
yarn formatFormat the source following the Prettier styles
yarn testRun project tests
yarn test --watchRun project tests, watching for file changes

License

MIT

Keywords

hash

FAQs

Package last updated on 20 Jul 2020

Did you know?

Socket

Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.

Install

Related posts