User loginNavigation |
Chunked sequences: Lookahead lazinessTo add to Ehud's proposed Clojure department: A recent Reddit thread mentioned the release of Clojure 1.1 RC 1, which features, among other things, support for ‘chunked sequences’—essentially, lazy sequences where elements are evaluated in chunks of 32, rather than on-demand. (If the behaviour sounds familiar, it's apparently what lazy bytestrings already do in Haskell.) As a mathematician, there are few things more dear to me than laziness—of the physical sort, at least, which is perhaps why the programming sort appeals so much to me. I lamented its demise, and Rich Hickey responded with some very nice background and explanation. By L Spice at 2009-12-18 19:56 | LtU Forum | previous forum topic | next forum topic | other blogs | 6126 reads
|
Browse archives
Active forum topics |
Recent comments
25 weeks 3 days ago
25 weeks 3 days ago
25 weeks 3 days ago
47 weeks 4 days ago
51 weeks 6 days ago
1 year 1 week ago
1 year 1 week ago
1 year 4 weeks ago
1 year 8 weeks ago
1 year 8 weeks ago