Permuta

Changed
- Updated dependency on automata-lib to version 7.0.1
- Perm.avoids/contains will raise a TypeError if input is not an iterable of Patt

Added
- Now testing on Python 3.11
- 'simple' to the permtool command for checking if finitely many simples in a class

Fixed
- bug in autobisc during setup

Added
- Bijection class for known bijection.
- An implementation of the Simion and Schmidt bijection.
- Enumeration strategy to check whether a class has finitely many simple permutations

Changed
- Perm.to_standard now uses an lru cache

Added
- Statistic: bounce of a permutation.
- Statistic: maximum drop size.
- Statistic: number of primes in the column sums.
- Statistic: holeyness of a permutation.
- Algorithm: `pop stack sort`.
- Statistic: count stack sorts.
- Statistic: count pop stack sorts.
- Statistic: Pinnacle set and number of pinnacles.

Changed
- Functions for ascents and descents now take an optional argument to specify what step size to calculate.
- Moved sorting functions from `permuta/bisc/perm_properties.py` to `permuta/patterns/perm.py`.
- If you pass an iterable (that is not a perm) to a contains method, then it will now raise an error.
These should be passed with the splat '*'.

Added
- using Github Actions for testing and deployment
- `containment_to_tikz` method in `Perm` that returns an iterator of tikz pictures
displaying occurrences of classical patterns in self.
- `permuta.permutils.PermutationStatistic` to check statistic distribution in
classes and preservation and transformation in bijections.

Deprecated
- Python 3.6 is no longer supported

Fixed
- Include the type hints in the pypi release.

Fixed
- Typing for `apply` in `Perm` fixed. It is now of the same base type as argument.