Searching for the best enumerator
General ways to traverse collections This article analyzes various ways of traversing a collection. We pay a particular attention to the most complex and general case of enumerating only a subset of a collection and performing actions that depend on the previously seen elements. We also discuss generators such as those in Icon and Python. A proposal is made for a convenient generic enumerator, whi
Project Euler
Gaucheã§Project Eulerを解ã„ã¦ã¿ã‚ˆã† å•é¡Œ1ã‹ã‚‰31ã¾ã§è§£ãã¾ã—ãŸ(gemma(2008/03/31 19:25:20 PDT) (use srfi-1) (use util.stream) (use math.mt-random) (use util.combinations) (use gauche.sequence) n以下ã®ç´ æ•°ã®ãƒªã‚¹ãƒˆã‚’è¿”ã™é–¢æ•°(エラトステãƒã‚¹ã®ç¯©) (define (primes n) (if (<= n 2) '() (let loop ((l (unfold (cut > <> n) values (cut + <> 2) 3)) (prime-list '(2))) (let1 m (car l) (if (> (expt m 2) n) (append (reverse prime-list) l) (loop (remove (lam
SRFI 41: Streams
by Philip L. Bewig Status This SRFI is currently in final status. Here is an explanation of each status that a SRFI can hold. To provide input on this SRFI, please send email to [email protected]emers.org. To subscribe to the list, follow these instructions. You can access previous messages via the mailing list archive. Received: 2007-10-24 Revised: 2007-11-14 Revised: 2007-11-14 Revised: 200
SRFI 40: A Library of Streams
by Philip L. Bewig Status This SRFI is currently in withdrawn status. Here is an explanation of each status that a SRFI can hold. To provide input on this SRFI, please send email to [email protected]emers.org. To subscribe to the list, follow these instructions. You can access previous messages via the mailing list archive. Received: 2003-02-03 Draft: 2003-02-03--2003-04-03 Revised: 2003-08-0
Lazy Sequences in Common Lisp - the zero bit stream
0. Delayed Evaluation with Closures Last week I expressed some anti-lazy sentiment, or at least it was perceived as such. Really, I am just not a fan of laziness by default. Common Lisp is decidedly not lazy by default, but it is easy to defer or avoid computation with closures. With macros, we can add it to the language in an easy-to-use form. Common Lisp is not a lazy language, but it is easy en
Ocaml: Lazy Lists
How can I make a lazy list representing a sequence of doubling numbers? Example: 1 2 4 8 16 32
1
ãŠçŸ¥ã‚‰ã›
障害
ランã‚ング
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
https://okmij.org/ftp/papers/LL3-collections-enumerators.txt
m3ga blog
What is lazy in OCaml
Top (Gauche Users’ Reference)
Re: [Chicken-users] srfi-40 space leak?
[Chicken-users] srfi-40 space leak?
https://groups.google.com/forum/#!topic/clojure/CI2f21vK02o
GitHub - thezerobit/slow-jam: Common Lisp lazy sequence library
Lazy Sequences In Scheme - ceaude
Google Sites: Sign-in
Enfranchised Mind | Blog Archive | Ocaml Lazy Lists- An Introduction
{{#tags}}- {{label}}
{{/tags}}