(by @andrestaltz)
If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.
| #!/usr/bin/env scheme --script | |
| (import (nanopass)) | |
| (define unique-var | |
| (let () | |
| (define count 0) | |
| (lambda (name) | |
| (let ([c count]) | |
| (set! count (+ count 1)) |
| #include <SWI-Prolog.h> | |
| #include <stdio.h> | |
| #include <stdlib.h> | |
| typedef struct context /* define a context structure */ | |
| { | |
| int max; | |
| } context; | |
| foreign_t |
(by @andrestaltz)
If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.
| #lang racket/base | |
| (provide uniq) | |
| ;;; | |
| ;;; Uniq | |
| ;;; | |
| ; The function uniq takes a list as input and returns a new list: | |
| ; adjacent elements are compared and omits any repeated elements. | |
| ; In other words, uniq works like the Unix utility uniq, but on list. |