npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2024 – Pkg Stats / Ryan Hefner

percom

v1.1.3

Published

A calculation npm module that is to simplify the calculation of permutations and combinations

Downloads

11,920

Readme

Percom

npm version Build Status License: MIT

NPM

Combination and Permutation library

Usage

$ npm i percom

1. Combinatioins (組み合わせ)

  const percom = require("percom");

  percom.com(array,num); 
  //array => Target array (対象の配列)
  //num => Number to combine as combinations (組み合わせの数)

Example

  const array = ["A","B","C"];
  
  const result1 = percom.com(array, 2);
  //result1 = [ [ "A", "B" ], [ "A, "C ], [ "B", "C" ] ]
  
  const result2 = percom.com(array, 1);
  //result2 = [ [ "A" ], [ "B" ], [ "C" ] ]

Count the number of combination elements (組み合わせの数を数える)

  percom.countCom(n, r);
  //n => Number of elements : int (要素数)
  //r => Number to choose : int (選ぶ要素の数)

Example

  percom.countCom(8, 3);
  // => 56

2. Permutations (順列)

  percom.per(array,num);
  //array => Target array (対象の配列)
  //num => Number to combine as permutations (一つ一つの順列の要素数)

Example

  const array = ["A","B","C"];
  
  const result1 = percom.per(array, 2);
  //result1 = [ [ 'A', 'B' ], [ 'A', 'C' ], [ 'B', 'A' ], [ 'B', 'C' ], [ 'C', 'A' ], [ 'C', 'B' ] ]
  
  const result2 = percom.per(array, 1);
  //result2 = [ [ "A" ], [ "B" ], [ "C" ] ]

Count the number of permutation elements (順列の数を数える)

  percom.countPer(n, r);
  //n => Number of elements : int (要素数)
  //r => Number to choose : int (選ぶ要素の数)

Example

  percom.countPer(8, 3);
  // => 336

Test Coverage

image

Both uncovered lines are returning of recursive function

License

percom is under MIT license

Development

yarn install

// before create PR
yarn mocha

Since lint-staged and husky are set up, your code will be formatted before commit.

Developer

Kota Yatagai (https://twitter.com/kota_yata)