Zeeshan Lakhani zeeshanlakhani
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #Code from http://fmota.eu/, great! | |
| class Monoid: | |
| def __init__(self, null, lift, op): | |
| self.null = null | |
| self.lift = lift | |
| self.op = op | |
| def fold(self, xs): | |
| if hasattr(xs, "__fold__"): | |
| return xs.__fold__(self) |
zeeshanlakhani
/ generator-ttd.scm
Created
September 30, 2011 17:32
— forked from apg/generator-ttd.scm
generators (like python yield), in scheme, a language that doesn't normally have them.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| ;; Deriving something like generators, but I didn't really feel like | |
| ;; doing exactly that. | |
| ;; It doesn't, for instance, support sending back into the generator | |
| ;; This applys a function across a range from 0 to x. | |
| (define (apply-to-range f i x) | |
| (when (< i x) | |
| (f i) | |
| (apply-to-range f (+ 1 i) x))) |
NewerOlder