Amir Amazigh BOUBEKKI

@ZelphirKaltstahl Sorry, long story made short, I made all my repositories private on github. The code you are referring to is: ```scheme ;; Pool of workers that can be used...

In particular: ```scheme (pool-for-each-par-map sproc pproc lst) ``` Will only work if / when the count of jobs `LST` is known in advance. Bad things *may* happen if `PPROC` calls...

I republished https://github.com/amirouche/guile-babelia @ZelphirKaltstahl did you make any progress?

> I don't know how performant it is compared to fibers It depends on the algorithm and its side effects: - Just mutating variables e.g., with integer procedure will consume...

> not found a way (without introducing a global state wrapped in some mutex) to have recursive calls, Have you tried a queue implementing producer-consumer pattern, see this [python code](https://git.sr.ht/~amirouche/python-babelia/tree/main/item/crawl-urls.py),...

How did you find out?

@nathanrpage97 I cloned your branch, rebased and it seems to still work. There is few things to improve, in fact I can only think about making the number of threads...

It is required to delete pyc cache and pass `PYTHONDONTWRITEBYTECODE=1` in order to make the on the fly file rewriting mechanic to work. Something like the following the shell: ```...

Here is the code I use to apply the mutation (it still works with py3.9): ```python with open(path) as f: source = f.read() patched = patch(diff, source) import imp components...

> Property Graphs are a kind of graphs consisting of nodes and links between them where nodes and links may be associated with a set of property-value pairs, **where the...