manin 0.0.1__tar.gz

manin-0.0.1/PKG-INFO

@@ -0,0 +1,15 @@
+Metadata-Version: 2.4
+Name: manin
+Version: 0.0.1
+Summary: A trial package that calculates the nth prime number.
+Author-email: sbgenius <sbgenius@example.com>
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Operating System :: OS Independent
+Classifier: Programming Language :: Python :: 3
+Requires-Python: >=3.7
+Description-Content-Type: text/markdown
+
+# nth-prime-sbgenius-demo
+
+This is a trial library to demonstrate how to publish a Python package.
+It contains a single function to calculate the nth prime number.

manin-0.0.1/README.md

@@ -0,0 +1,4 @@
+# nth-prime-sbgenius-demo
+
+This is a trial library to demonstrate how to publish a Python package.
+It contains a single function to calculate the nth prime number.

manin-0.0.1/pyproject.toml

@@ -0,0 +1,21 @@
+[build-system]
+requires = ["hatchling"]
+build-backend = "hatchling.build"
+
+[project]
+name = "manin"
+version = "0.0.1"
+authors = [
+  { name="sbgenius", email="sbgenius@example.com" },
+]
+description = "A trial package that calculates the nth prime number."
+readme = "README.md"
+requires-python = ">=3.7"
+classifiers = [
+    "Programming Language :: Python :: 3",
+    "License :: OSI Approved :: MIT License",
+    "Operating System :: OS Independent",
+]
+
+[tool.hatch.build.targets.wheel]
+packages = ["src/nth_prime"]

manin-0.0.1/src/nth_prime/__init__.py

@@ -0,0 +1,3 @@
+from .calculator import get_nth_prime
+
+__all__ = ["get_nth_prime"]

manin-0.0.1/src/nth_prime/calculator.py

@@ -0,0 +1,27 @@
+def get_nth_prime(n: int) -> int:
+    """
+    Returns the nth prime number.
+    
+    Args:
+        n (int): The position of the prime number to find (1-indexed).
+        
+    Returns:
+        int: The nth prime number.
+    """
+    if n <= 0:
+        raise ValueError("n must be a positive integer greater than 0")
+    
+    primes = []
+    num = 2
+    while len(primes) < n:
+        is_prime = True
+        for p in primes:
+            if p * p > num:
+                break
+            if num % p == 0:
+                is_prime = False
+                break
+        if is_prime:
+            primes.append(num)
+        num += 1
+    return primes[-1]