first version distribution

Author: yanismnsr

.DS_Store

@@ -0,0 +1,2 @@
+dist
+src/Py*

.gitignore

@@ -0,0 +1,17 @@
+# The package
+combinations is a package used to generate all possible combinations of a given length `k` 
+on a given set. The set is given as a list, and `k` must be equal to 0 or positive. 
+
+# Usage examples 
+```python
+from combs import combinations
+
+l = [89,32,6,7]
+k = 2
+combs = combinations.find_combinations(l, k)
+print(combs)
+```
+Output :
+```
+[[89, 32], [89, 6], [89, 7], [32, 6], [32, 7], [6, 7]]
+```

README.md

@@ -0,0 +1,6 @@
+[build-system]
+requires = [
+    "setuptools>=42",
+    "wheel"
+]
+build-backend = "setuptools.build_meta"

pyproject.toml

@@ -0,0 +1,24 @@
+[metadata]
+name = PyCombs-YM
+version = 1.0.0
+author = Yanis MANSOUR
+author_email = mansouryanis6@gmail.com
+description = A package that generates all possible combinations in a given set as a list
+long_description = file: README.md
+long_description_content_type = text/markdown
+url = https://github.com/yanismnsr/PyCombinations
+project_urls =
+    Bug Tracker = https://github.com/yanismnsr/PyCombinations/issues
+classifiers =
+    Programming Language :: Python :: 3
+    License :: OSI Approved :: GNU General Public License v3 (GPLv3)
+    Operating System :: OS Independent
+
+[options]
+package_dir =
+    = src
+packages = find:
+python_requires = >=3.0
+
+[options.packages.find]
+where = src

setup.cfg

@@ -1,6 +1,6 @@
 import unittest
 import math
-from src.combinations import combinations
+from src.combs import combinations
 
 def _combinationsNumber (n, k) :
     return math.factorial(n) / (math.factorial(k) * math.factorial(n - k))