pythagoras 0.23.15__tar.gz → 0.23.17__tar.gz

{pythagoras-0.23.15 → pythagoras-0.23.17}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.3
 Name: pythagoras
-Version: 0.23.15
+Version: 0.23.17
 Summary: Planet-scale distributed computing in Python.
 Keywords: cloud,ML,AI,serverless,distributed,parallel,machine-learning,deep-learning,pythagoras
 Author: Volodymyr (Vlad) Pavlov
@@ -66,7 +66,7 @@ data science, machine learning, and AI workflows.
 Pythagoras excels at complex, long-running, resource-demanding computations. 
 It’s not recommended for real-time, latency-sensitive workflows.
 
-## Usage
+## Tutorials
 
 Pythagoras elevates two popular techniques — memoization and parallelization — 
 to a global scale and then fuses them, unlocking performance and scalability 
@@ -85,6 +85,123 @@ preferred functional patterns, augmented by new capabilities.
 
 **!!! BOOKMARK THIS PAGE AND COME BACK LATER, WE WILL PUBLISH MORE TUTORIALS SOON !!!**
 
+## Videos
+
+* [Data Phoenix Webinar, August 27, 2025](https://youtu.be/eb6_atu1RQI) ([slides](https://docs.google.com/presentation/d/1fGBqnp0aqVHPJ-BYGYnUll1_TJI_WObAbEVX89Z3-yA))
+
+
+## Usage Examples
+
+Importing Pythagoras:
+```python
+from pythagoras.core import *
+import pythagoras as pth
+```
+
+Creating a portal based on a (shared) folder:
+```python
+my_portal = get_portal("./my_local_folder")
+```
+
+Checking the state of a portal:
+```python
+my_portal.describe()
+```
+
+Decorating a function:
+```python
+@pure()
+def my_long_running_function(a:float, b:float) -> float:
+  from time import sleep # imports must be placed inside a pure function
+  for i in range(5):
+    sleep(1)
+    print("waiting....")
+  return a+10*b
+```
+
+Using a decorated function synchronously:
+```python
+result = my_long_running_function(a=1, b=2)
+```
+
+Using a decorated function asynchronously:
+```python
+future_result_address = my_long_running_function.swarm(a=10, b=20)
+if ready(future_result_address):
+    result = get(future_result_address)
+```
+
+Pre-conditions for executing a function:
+```python
+@pure(pre_validators=[
+    unused_ram(Gb=5),
+    installed_packages("scikit-learn","pandas"),
+    unused_cpu(cores=10)])
+def my_long_running_function(a:float, b:float) -> float:
+  from time import sleep
+  for i in range(5):
+    sleep(1)
+    print(
+        "waiting...."
+        )
+  return a+10*b
+```
+
+Recursion:
+```python
+@pure(pre_validators=[recursive_parameters("n")])
+def factorial(n:int)->int:
+  if n == 1:
+    return 1
+  else:
+    return n*factorial(n=n-1)
+```
+
+Partial function application:
+```python
+@pure()
+def my_map(input_list:list, transformer: PureFn)->list:
+  result = []
+  for element in input_list:
+    transformed_element = transformer(x=element)
+    result.append(transformed_element)
+  return result
+
+@pure()
+def my_square(x):
+  return x*x
+
+result = my_map(input_list=[1,2,3,4,5], transformer=my_square)
+
+my_square_map = my_map.fix_kwargs(transformer = my_square)
+
+result = my_square_map(input_list=[1,2,3,4,5])
+```
+
+Mutually recursive functions:
+```python
+@pure(pre_validators=recursive_parameters("n"))
+def is_even(n:int, is_odd ,is_even)->bool:
+  if n in {0,2}:
+    return True
+  else:
+    return is_odd(n=n-1, is_even=is_even, is_odd=is_odd)
+
+@pure(pre_validators=recursive_parameters("n"))
+def is_odd(n:int, is_even, is_odd)->bool:
+  if n in {0,2}:
+    return False
+  else:
+    return is_even(n=n-1, is_odd=is_odd, is_even=is_even)
+
+(is_even, is_odd) = (
+  is_even.fix_kwargs(is_odd=is_odd, is_even=is_even)
+  , is_odd.fix_kwargs(is_odd=is_odd, is_even=is_even) )
+
+assert is_even(n=10)
+assert is_odd(n=11)
+```
+
 ## How to get it?
 
 The source code is hosted on GitHub at: https://github.com/pythagoras-dev/pythagoras

{pythagoras-0.23.15 → pythagoras-0.23.17}/README.md

@@ -14,7 +14,7 @@ data science, machine learning, and AI workflows.
 Pythagoras excels at complex, long-running, resource-demanding computations. 
 It’s not recommended for real-time, latency-sensitive workflows.
 
-## Usage
+## Tutorials
 
 Pythagoras elevates two popular techniques — memoization and parallelization — 
 to a global scale and then fuses them, unlocking performance and scalability 
@@ -33,6 +33,123 @@ preferred functional patterns, augmented by new capabilities.
 
 **!!! BOOKMARK THIS PAGE AND COME BACK LATER, WE WILL PUBLISH MORE TUTORIALS SOON !!!**
 
+## Videos
+
+* [Data Phoenix Webinar, August 27, 2025](https://youtu.be/eb6_atu1RQI) ([slides](https://docs.google.com/presentation/d/1fGBqnp0aqVHPJ-BYGYnUll1_TJI_WObAbEVX89Z3-yA))
+
+
+## Usage Examples
+
+Importing Pythagoras:
+```python
+from pythagoras.core import *
+import pythagoras as pth
+```
+
+Creating a portal based on a (shared) folder:
+```python
+my_portal = get_portal("./my_local_folder")
+```
+
+Checking the state of a portal:
+```python
+my_portal.describe()
+```
+
+Decorating a function:
+```python
+@pure()
+def my_long_running_function(a:float, b:float) -> float:
+  from time import sleep # imports must be placed inside a pure function
+  for i in range(5):
+    sleep(1)
+    print("waiting....")
+  return a+10*b
+```
+
+Using a decorated function synchronously:
+```python
+result = my_long_running_function(a=1, b=2)
+```
+
+Using a decorated function asynchronously:
+```python
+future_result_address = my_long_running_function.swarm(a=10, b=20)
+if ready(future_result_address):
+    result = get(future_result_address)
+```
+
+Pre-conditions for executing a function:
+```python
+@pure(pre_validators=[
+    unused_ram(Gb=5),
+    installed_packages("scikit-learn","pandas"),
+    unused_cpu(cores=10)])
+def my_long_running_function(a:float, b:float) -> float:
+  from time import sleep
+  for i in range(5):
+    sleep(1)
+    print(
+        "waiting...."
+        )
+  return a+10*b
+```
+
+Recursion:
+```python
+@pure(pre_validators=[recursive_parameters("n")])
+def factorial(n:int)->int:
+  if n == 1:
+    return 1
+  else:
+    return n*factorial(n=n-1)
+```
+
+Partial function application:
+```python
+@pure()
+def my_map(input_list:list, transformer: PureFn)->list:
+  result = []
+  for element in input_list:
+    transformed_element = transformer(x=element)
+    result.append(transformed_element)
+  return result
+
+@pure()
+def my_square(x):
+  return x*x
+
+result = my_map(input_list=[1,2,3,4,5], transformer=my_square)
+
+my_square_map = my_map.fix_kwargs(transformer = my_square)
+
+result = my_square_map(input_list=[1,2,3,4,5])
+```
+
+Mutually recursive functions:
+```python
+@pure(pre_validators=recursive_parameters("n"))
+def is_even(n:int, is_odd ,is_even)->bool:
+  if n in {0,2}:
+    return True
+  else:
+    return is_odd(n=n-1, is_even=is_even, is_odd=is_odd)
+
+@pure(pre_validators=recursive_parameters("n"))
+def is_odd(n:int, is_even, is_odd)->bool:
+  if n in {0,2}:
+    return False
+  else:
+    return is_even(n=n-1, is_odd=is_odd, is_even=is_even)
+
+(is_even, is_odd) = (
+  is_even.fix_kwargs(is_odd=is_odd, is_even=is_even)
+  , is_odd.fix_kwargs(is_odd=is_odd, is_even=is_even) )
+
+assert is_even(n=10)
+assert is_odd(n=11)
+```
+
 ## How to get it?
 
 The source code is hosted on GitHub at: https://github.com/pythagoras-dev/pythagoras

{pythagoras-0.23.15 → pythagoras-0.23.17}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "uv_build"
 
 [project]
 name = "pythagoras"
-version = "0.23.15"
+version = "0.23.17"
 authors = [
     {name = "Volodymyr (Vlad) Pavlov", email = "vlpavlov@ieee.org"},
 ]