Download the PHP package drupol/phpermutations without Composer
On this page you can find all versions of the php package drupol/phpermutations. It is possible to download/install these versions without Composer. Possible dependencies are resolved automatically.
Download drupol/phpermutations
More information about drupol/phpermutations
Files in drupol/phpermutations
Package phpermutations
Short Description Generators and iterators, permutations and combinations.
License MIT
Homepage https://github.com/drupol/phpermutations
FAQ
Example:
In general, it is recommended to use always a project to download your libraries. In an application normally there is more than one library needed.
- Some hosting areas are not accessible by a terminal or SSH. Then it is not possible to use Composer.
- To use Composer is sometimes complicated. Especially for beginners.
- Composer needs much resources. Sometimes they are not available on a simple webspace.
- If you are using private repositories you don't need to share your credentials. You can set up everything on our site and then you provide a simple download link to your team member.
- Simplify your Composer build process. Use our own command line tool to download the vendor folder as binary. This makes your build process faster and you don't need to expose your credentials for private repositories.
Informations about the package phpermutations
PHPermutations
PHP Iterators and Generators to generate combinations and permutations in an efficient way.
At first the library was created to only generate permutations and combinations.
In the end, I added other Iterators and Generators like:
- Fibonacci numbers,
- Perfect numbers,
- Prime numbers,
- Product of numbers,
- Rotation of an array,
- Cycling through an array,
- Permutations,
- Combinations,
Introduction
I've always been fascinated by numbers and everything around them... in other words, mathematics.
The library has been written first for being used in PHPartition, then it has been extended here and there.
Its main use is for generating Permutations and Combinations without running out of memory, thanks to PHP Generators and and Iterators.
The difference with other combinatorics library is that you can use an extra parameter 'length', that allows you to compute Permutations and Combinations of a particular size. The other notable difference is that your input arrays may contains any type of object (integers, arrays, strings or objects), the library will still continue to work without any trouble.
Requirements
- PHP >= 7.1.3,
How to use
Include this library in your project by doing:
composer require drupol/phpermutations
Let's say you want to find all the permutations of the list of number [1, 2, 3, 4, 5] having a length of 3:
Most of the components always has the same arguments except for very few of them.
As the documentation per component is not written yet, I advise you to check the tests to see how to use them.
Combinations
In mathematics, a combination is a way of selecting items from a collection, such that (unlike permutations) the order of selection does not matter. -- Wikipedia
In one sentence: When the order doesn't matter, it is a Combination.
Examples
Let's say we have a group of fruits:
$list = ['Apple', 'Pear', 'Banana', 'Orange']
and we want to find the combinations of length: 3, the result will be:
['Apple', 'Pear', 'Banana']
['Apple', 'Pear', 'Orange']
['Apple', 'Banana', 'Orange']
['Pear', 'Banana', 'Orange']
Permutations
In mathematics, the notion of permutation relates to the act of arranging all the members of a set into some sequence or order, or if the set is already ordered, rearranging (reordering) its elements, a process called permuting. These differ from combinations, which are selections of some members of a set where order is disregarded. -- Wikipedia
In one sentence: When the order does matter, it is a Permutation.
Examples
Let's say we have a group of fruits
['Apple', 'Pear', 'Banana', 'Orange']
and we want to find the permutations of length: 3, the result will be:
['Apple', 'Pear', 'Banana']
['Pear', 'Apple', 'Banana']
['Apple', 'Banana', 'Pear']
['Banana', 'Apple', 'Pear']
['Pear', 'Banana', 'Apple']
['Banana', 'Pear', 'Apple']
['Apple', 'Pear', 'Orange']
['Pear', 'Apple', 'Orange']
['Apple', 'Orange', 'Pear']
['Orange', 'Apple', 'Pear']
['Pear', 'Orange', 'Apple']
['Orange', 'Pear', 'Apple']
['Apple', 'Banana', 'Orange']
['Banana', 'Apple', 'Orange']
['Apple', 'Orange', 'Banana']
['Orange', 'Apple', 'Banana']
['Banana', 'Orange', 'Apple']
['Orange', 'Banana', 'Apple']
['Pear', 'Banana', 'Orange']
['Banana', 'Pear', 'Orange']
['Pear', 'Orange', 'Banana']
['Orange', 'Pear', 'Banana']
['Banana', 'Orange', 'Pear']
['Orange', 'Banana', 'Pear']
The permutations of length 3 of the array [1, 2, 3, 4, 5] are, please hold on tight, the sum of all the permutations of each combinations having a length of 3 of that array.
Tests
Each Generators and Iterators are tested using the same values as input. I try to be as much complete as possible with the tests. Every time the sources are modified, Github, the continuous integration service, tests the code against those tests, this way you are aware if the changes that you are introducing are valid.
Contributing
Feel free to contribute to this library by sending Github pull requests. I'm quite reactive :-)
