0.1.17 • Published 4 years ago
comy v0.1.17
Introduction
Combinatorial algorithms are computational procedures which are designed to help solve combinatorial problems.
Install
$ npm install comy
Usage
const comy = require("comy");
// Specific example:
const { priorityGroups } = require("comy");
const arr = [
{ name: "Michael", priority: 1 },
{ name: "Murphy", priority: 2 },
{ name: "Capone", priority: 3 },
{ name: "Donnie", priority: 1 },
{ name: "Koby", priority: 2 },
{ name: "Felis", priority: 3 }
];
//Split the arr into 2 balanced groups by priority
console.log(priorityGroups(arr, 2, "priority"));
/* Possible output:
[
[ { name: 'Donnie', priority: 1 },
{ name: 'Koby', priority: 2 },
{ name: 'Felis', priority: 3 }
],
[
{ name: 'Michael', priority: 1 },
{ name: 'Murphy', priority: 2 },
{ name: 'Capone', priority: 3 }
]
]
*/
Methods
pickNumbers: (from: any, to: any, size: any) => any[]
pickRandom: (arr: any, n?: number) => any
pickHexColor: () => string
priorityGroups: (arr: any, numOfGroups: any, attr?: string) => any[][]
groups: (arr: any, numOfGroups: any) => any
generateString: () => string