permutation-rank

WebJar for permutation-rank

License	MIT
GroupId	org.webjars.npm
ArtifactId	permutation-rank
Last Version	1.0.0
Release Date	Mar 10, 2018
Type	jar
Description	permutation-rank WebJar for permutation-rank
Project URL	http://webjars.org
Source Code Management	https://github.com/scijs/permutation-rank

Download permutation-rank

Filename	Size
permutation-rank-1.0.0.pom
permutation-rank-1.0.0.jar	6 KB
permutation-rank-1.0.0-sources.jar	22 bytes
permutation-rank-1.0.0-javadoc.jar	22 bytes

How to add to project

Apache Maven

<!-- https://jarcasting.com/artifacts/org.webjars.npm/permutation-rank/ -->
<dependency>
    <groupId>org.webjars.npm</groupId>
    <artifactId>permutation-rank</artifactId>
    <version>1.0.0</version>
</dependency>

Gradle Groovy

// https://jarcasting.com/artifacts/org.webjars.npm/permutation-rank/
implementation 'org.webjars.npm:permutation-rank:1.0.0'

Gradle Kotlin

// https://jarcasting.com/artifacts/org.webjars.npm/permutation-rank/
implementation ("org.webjars.npm:permutation-rank:1.0.0")

Apache Buildr

'org.webjars.npm:permutation-rank:jar:1.0.0'

Apache Ivy

<dependency org="org.webjars.npm" name="permutation-rank" rev="1.0.0">
  <artifact name="permutation-rank" type="jar" />
</dependency>

Groovy Grape

@Grapes(
@Grab(group='org.webjars.npm', module='permutation-rank', version='1.0.0')
)

Scala SBT

libraryDependencies += "org.webjars.npm" % "permutation-rank" % "1.0.0"

Leiningen

[org.webjars.npm/permutation-rank "1.0.0"]

Dependencies

compile (2)

Group / Artifact	Type	Version
org.webjars.npm : invert-permutation	jar	[1.0.0,2)
org.webjars.npm : typedarray-pool	jar	[1.0.0,2)

Project Modules

There are no modules declared in this project.

permutation-rank

Ranks and unranks permutations. Based on the following paper:

W. Myrvold, F. Ruskey. (2000) "Ranking and Unranking Permutations in Linear Time". Information Processing Letters.

Usage

First install using npm:

npm install permutation-rank

Then you can use it like this:

var prank = require("permutation-rank")
var perm = [0,3,1,2]
var r = prank.rank(perm)
console.log("r = ", r)
var u = prank.unrank(perm.length, r)
console.log("u = ", u)

//Prints:
//        r =  15
//        u =  [ 0, 3, 1, 2 ]

prank.rank(permutation)

Computes an integer representing the colexicographic rank of the permutation

• permutation is an array encoding some permutation

Returns An integer representing the ranked encoding of the permutation

prank.unrank(length, rank[, result])

Computes a permutation from a rank order with the given length

• length is the length of the permuation
• rank is the index of the permutation
• result is an optional argument which stores the result of the inversion

Returns The permutation at the given rank

Credits

(c) 2013 Mikola Lysenko. MIT License

Versions

Version
1.0.0 Mar 10, 2018