The [kstatus document][kstatus_doc] describes a few concepts related to the status conditions and a few standard conditions that controllers can implement. This document tries to provide more details about the status conditions with various examples to describe the mechanics of how the conditions work, what they mean and what we can expected from them.
Starting with an example of status conditions:
| const I = x => x | |
| const K = x => y => x | |
| const A = f => x => f (x) | |
| const T = x => f => f (x) | |
| const W = f => x => f (x) (x) | |
| const C = f => y => x => f (x) (y) | |
| const B = f => g => x => f (g (x)) | |
| const S = f => g => x => f (x) (g (x)) | |
| const S_ = f => g => x => f (g (x)) (x) | |
| const S2 = f => g => h => x => f (g (x)) (h (x)) |
| ;;- -*-scheme-*- | |
| ;;; rabbit compiler | |
| ;;- This is the source code to the RABBIT Scheme compiler, by Guy Steele, | |
| ;;- taken from the Indiana Scheme repository and annotated by me, Darius | |
| ;;- Bacon. I converted it from all-uppercase to all-lowercase and | |
| ;;- reindented it with Emacs for better readability. I've added the | |
| ;;- comments starting with either ;- or ;*. Other comments are by Steele. | |
| ;;- The ;- comments were things I'd figured out, while ;* denoted things | |
| ;;- for me to look into. (Sometimes I didn't bother to type in the answer |
... or Why Pipelining Is Not That Easy
Golang Concurrency Patterns for brave and smart.
By @kachayev
| FROM ubuntu:13.10 | |
| RUN apt-get update | |
| RUN DEBIAN_FRONTEND=noninteractive apt-get -y install golang | |
| RUN mkdir /go | |
| RUN export GOPATH=/go | |
| ENV GOPATH /go | |
| RUN export PATH=$PATH:$GOPATH/bin |
Summary: use good/established messaging patterns like Enterprise Integration Patterns. Don't make up your own. Don't expose transport implementation details to your application.
As much as possible, I prefer to hide Rabbit's implementation details from my application. In .Net we have a Broker abstraction that can communicate through a lot of different transports (rabbit just happens to be our preferred one). The broker allows us to expose a very simple API which is basically:
| ;;; This is one of the example programs from the textbook: | |
| ;;; | |
| ;;; Artificial Intelligence: | |
| ;;; Structures and strategies for complex problem solving | |
| ;;; | |
| ;;; by George F. Luger and William A. Stubblefield | |
| ;;; | |
| ;;; These programs are copyrighted by Benjamin/Cummings Publishers. | |
| ;;; | |
| ;;; We offer them for use, free of charge, for educational purposes only. |
| macro $do { | |
| case { $y:expr } => { | |
| $y | |
| } | |
| case { $x:ident <- $y:expr $rest ... } => { | |
| λ['>=']($y, function($x) { | |
| return $do { $rest ... } | |
| }); | |
| } | |
| } |
| // Actually you can hook #1 up as an event handler too, using the | |
| // promise implementation: | |
| function eventsS() { | |
| var step = function(sync) { | |
| return function(cons, nil) { | |
| sync.then(function(cell) { | |
| cons(cell.value, cell.tail); | |
| }); | |
| } |
