2017 © Pedro Peláez
 

library bijective

Bijective is a class that can compute pairings between alphanumeric strings, and integers. Every integer can be mapped to an alphanumeric string, and every alphanumeric string can be mapped back to an integer with no unpaired permutations.

image

honest/bijective

Bijective is a class that can compute pairings between alphanumeric strings, and integers. Every integer can be mapped to an alphanumeric string, and every alphanumeric string can be mapped back to an integer with no unpaired permutations.

  • Monday, January 9, 2017
  • by honest
  • Repository
  • 1 Watchers
  • 2 Stars
  • 18 Installations
  • PHP
  • 0 Dependents
  • 0 Suggesters
  • 1 Forks
  • 0 Open issues
  • 14 Versions
  • 0 % Grown

The README.md

Bijective

Build Status, (*1)

Bijective is a library that can compute pairings between alphanumeric strings, and integers. Every integer can be mapped to an alphanumeric string, and every alphanumeric string can be mapped back to an integer with zero unpaired permutations., (*2)

Extension

$ git clone git@github.com:unfunco/bijective.git
$ cd bijective/ext/bijective
$ phpize
$ ./configure
$ make
$ make install

License

Copyright © 2013 Daniel Morris
Made available under the terms of the Apache License, Version 2.0., (*3)

The Versions

09/01 2017

dev-master

9999999-dev https://github.com/honestempire/bijective

Bijective is a class that can compute pairings between alphanumeric strings, and integers. Every integer can be mapped to an alphanumeric string, and every alphanumeric string can be mapped back to an integer with no unpaired permutations.

  Sources   Download

MIT

The Requires

  • php >=7.0

 

The Development Requires

bijection bijective

13/10 2016

2.2.0

2.2.0.0 https://github.com/honestempire/bijective

Bijective is a class that can compute pairings between alphanumeric strings, and integers. Every integer can be mapped to an alphanumeric string, and every alphanumeric string can be mapped back to an integer with no unpaired permutations.

  Sources   Download

MIT

The Requires

  • php >=7.0

 

The Development Requires

bijection bijective

17/08 2016

2.1.0

2.1.0.0 https://github.com/honestempire/bijective

Bijective is a class that can compute pairings between alphanumeric strings, and integers. Every integer can be mapped to an alphanumeric string, and every alphanumeric string can be mapped back to an integer with no unpaired permutations.

  Sources   Download

MIT

The Requires

  • php >=7.0

 

The Development Requires

bijection bijective

17/08 2015

2.0.0

2.0.0.0 https://github.com/honestempire/bijective

Bijective is a class that can compute pairings between alphanumeric strings, and integers. Every integer can be mapped to an alphanumeric string, and every alphanumeric string can be mapped back to an integer with no unpaired permutations.

  Sources   Download

MIT

The Requires

  • php >=7.0.0

 

The Development Requires

bijection bijective

07/03 2014

1.0.9

1.0.9.0 https://github.com/honestempire/bijective

Bijective is a class that can compute pairings between alphanumeric strings, and integers. Every integer can be mapped to an alphanumeric string, and every alphanumeric string can be mapped back to an integer with no unpaired permutations.

  Sources   Download

MIT

The Requires

  • php >=5.3.3

 

The Development Requires

bijection bijective

09/01 2014

1.0.8

1.0.8.0 https://github.com/honestempire/bijective

Bijective is a class that can compute pairings between alphanumeric strings, and integers. Every integer can be mapped to an alphanumeric string, and every alphanumeric string can be mapped back to an integer with no unpaired permutations.

  Sources   Download

MIT

The Requires

  • php >=5.3.0

 

The Development Requires

bijection bijective

20/11 2013

1.0.7

1.0.7.0 https://github.com/daniel-morris/bijective

Bijective is a class that can compute pairings between alphanumeric strings, and integers. Every integer can be mapped to an alphanumeric string, and every alphanumeric string can be mapped back to an integer with no unpaired permutations.

  Sources   Download

MIT

The Requires

  • php >=5.3.0

 

The Development Requires

bijection bijective

20/11 2013

1.0.6

1.0.6.0 https://github.com/daniel-morris/bijective

Bijective is a class that can compute pairings between alphanumeric strings, and integers. Every integer can be mapped to an alphanumeric string, and every alphanumeric string can be mapped back to an integer with no unpaired permutations.

  Sources   Download

MIT

The Requires

  • php >=5.3.0

 

The Development Requires

bijection bijective

11/11 2013

1.0.5

1.0.5.0 https://github.com/daniel-morris/bijective

Bijective is a class that can compute pairings between alphanumeric strings, and integers. Every integer can be mapped to an alphanumeric string, and every alphanumeric string can be mapped back to an integer with no unpaired permutations.

  Sources   Download

MIT

The Requires

  • php >=5.3.0

 

The Development Requires

bijection bijective

10/11 2013

1.0.4

1.0.4.0 https://github.com/daniel-morris/bijective

Bijective is a class that can compute an exact pairing of strings and integers. Every integer can be mapped to a string, and every string can be mapped back to an integer, with no unpaired elements.

  Sources   Download

MIT

The Requires

  • php >=5.3.0

 

The Development Requires

bijection bijective

10/11 2013

1.0.3

1.0.3.0 https://github.com/daniel-morris/bijective

Bijective is a class that can compute an exact pairing of strings and integers. Every integer can be mapped to a string, and every string can be mapped back to an integer, with no unpaired elements.

  Sources   Download

MIT

The Requires

  • php >=5.3.0

 

The Development Requires

bijection bijective

10/11 2013

1.0.2

1.0.2.0 https://github.com/daniel-morris/bijective

Bijective is a class that can compute an exact pairing of strings and integers. Every integer can be mapped to a string, and every string can be mapped back to an integer, with no unpaired elements.

  Sources   Download

MIT

The Requires

  • php >=5.2.0

 

The Development Requires

bijection bijective

10/11 2013

1.0.1

1.0.1.0 https://github.com/daniel-morris/bijective

Bijective is a class that can compute an exact pairing of strings and integers. Every integer can be mapped to a string, and every string can be mapped back to an integer, with no unpaired elements.

  Sources   Download

MIT

The Requires

  • php >=5.4.0

 

The Development Requires

bijection bijective

10/11 2013

1.0.0

1.0.0.0 https://github.com/daniel-morris/bijective

Bijective is a class that can compute an exact pairing of strings and integers. Every integer can be mapped to a string, and every string can be mapped back to an integer, with no unpaired elements.

  Sources   Download

MIT

The Requires

  • php >=5.4.0

 

The Development Requires

bijection bijective