lazy graph framework
Project description
lazy-graph
lazy-graph is python package for lazy evaluation, with enhancement for updating values of upstream and copying the entire lazy graph.
Install
Copy or link this folder directly. Or use pip
to obtain the distribution pip install lazy_graph
.
Documents
Simple example
from lazy import Root, Node
def add(a, b):
print(f"calculating {a} + {b}")
return a + b
print("create nodes")
a = Root(1)
b = Root(2)
c = Node(add, a, b)
print("get the value")
print(f"c is {c()}")
create nodes
get the value
calculating 1 + 2
c is 3
Update upstream
from lazy import Root, Node
def add(a, b):
print(f"calculating {a} + {b}")
return a + b
print("create nodes")
a = Root(1)
b = Root(2)
c = Node(add, a, b)
print("get the value")
print(f"c is {c()}")
print("get the value again")
print(f"c is {c()}")
print("update upstream")
a.reset(4)
print("get the new value")
print(f"c is {c()}")
create nodes
get the value
calculating 1 + 2
c is 3
get the value again
c is 3
update upstream
get the new value
calculating 4 + 2
c is 6
Normal argument or keyword argument are also available
from lazy import Root, Node
def add(a, b, c, d):
print(f"calculating {a} + {b} + {c} + {d}")
return a + b + c + d
print("create nodes")
a = Root(1)
c = Root(3)
z = Node(add, a, 2, c=c, d=4)
print("get the value")
print(f"c is {z()}")
create nodes
get the value
calculating 1 + 2 + 3 + 4
c is 10
Copy the lazy graph
from lazy import Root, Node, Copy
def add(a, b):
print(f"calculating {a} + {b}")
return a + b
print("create nodes")
a = Root(1)
b = Root(2)
c = Node(add, a, b)
print("get the value")
print(f"c is {c()}")
print("copy lazy graph")
copy = Copy()
new_a = copy(a)
new_b = copy(b)
new_c = copy(c)
print("get the new value")
print(f"new c is {new_c()}")
print("reset value")
a.reset(4)
new_a.reset(8)
print("get the old value and new value")
print(f"c is {c()}, new c is {new_c()}")
create nodes
get the value
calculating 1 + 2
c is 3
copy lazy graph
get the new value
new c is 3
reset value
get the old value and new value
calculating 4 + 2
calculating 8 + 2
c is 6, new c is 10
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distributions
No source distribution files available for this release.See tutorial on generating distribution archives.
Built Distribution
File details
Details for the file lazy_graph-0.3.2-py3-none-any.whl
.
File metadata
- Download URL: lazy_graph-0.3.2-py3-none-any.whl
- Upload date:
- Size: 5.3 kB
- Tags: Python 3
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/4.0.1 CPython/3.11.2
File hashes
Algorithm | Hash digest | |
---|---|---|
SHA256 | 3c57a7aa9f0e8f6e225a3888fa14c37542fa980f667811675d025135d9399762 |
|
MD5 | c9c5b3a04c135399c0bfa61d3f6c0ca9 |
|
BLAKE2b-256 | f45e96bdbf447ee0390487650dd2da17e07d2c93cd82cdb48c37b59f6d8a4d0e |