rebcabin

The introduction to Reactive Programming you've been missing

(by @andrestaltz)

So you're curious in learning this new thing called (Functional) Reactive Programming (FRP).

Learning it is hard, even harder by the lack of good material. When I started, I tried looking for tutorials. I found only a handful of practical guides, but they just scratched the surface and never tackled the challenge of building the whole architecture around it. Library documentations often don't help when you're trying to understand some function. I mean, honestly, look at this:

Rx.Observable.prototype.flatMapLatest(selector, [thisArg])

Projects each element of an observable sequence into a new sequence of observable sequences by incorporating the element's index and then transforms an observable sequence of observable sequences into an observable sequence producing values only from the most recent observable sequence.

rebcabin

Org-mode Org-mode Reference Card

Org mode reference card

Created from the plain text reference card on orgmode.org Download this file, and open it in Emacs org-mode!

rebcabin

Reader Macros in Common Lisp

This post also appears on lisper.in.

Reader macros are perhaps not as famous as ordinary macros. While macros are a great way to create your own DSL, reader macros provide even greater flexibility by allowing you to create entirely new syntax on top of Lisp.

Paul Graham explains them very well in [On Lisp][] (Chapter 17, Read-Macros):

The three big moments in a Lisp expression's life are read-time, compile-time, and runtime. Functions are in control at runtime. Macros give us a chance to perform transformations on programs at compile-time. ...read-macros... do their work at read-time.

rebcabin

subroutine f(mu, Sigma, H, INFO, R, Sigmavar_2, data, muvar_2, k, n)
implicit none

integer, intent(in) :: k
integer, intent(in) :: n
real*8, intent(in) :: Sigma(n, n)        !  Sigma
real*8, intent(in) :: H(k, n)            !  H
real*8, intent(in) :: mu(n)              !  mu
real*8, intent(in) :: R(k, k)            !  R, H*Sigma*H' + R
real*8, intent(in) :: data(k)            !  (H*Sigma*H' + R)^-1*((-1)*data + H*mu), data, (-1)*   data + H*mu

rebcabin

module Drone.Control.Ukf

open System
open Drone.Control.Matrix


type IDiscreteModel =
    abstract Process : Matrix -> Matrix
    abstract Observe : Matrix -> Matrix
    abstract InitialState : Matrix

rebcabin

#include <algorithm>
#include <vector>
#include <iterator>
#include <iostream>

template< class F, class X, class S >
constexpr X foldl( F&& f, X x, const S& s ) {
    return std::accumulate (
        std::begin(s), std::end(s),

rebcabin

(ns clj-spec-playground
  (:require [clojure.string :as str]
            [clojure.spec :as s]
            [clojure.test.check.generators :as gen]))

;;; examples of clojure.spec being used like a gradual/dependently typed system.

(defn make-user
  "Create a map of inputs after splitting name."
  ([name email]

rebcabin

(ns spec-test.virtual-time
  (:require [clojure.spec :as s]
            [clojure.spec.test :as st]))

(s/def ::virtual-time
       (s/or 
        :positive-infinity #{:positive-infinity}
        :negative-infinity #{:negative-infinity}
        :number number?))
(s/fdef vt-lt

rebcabin

(ns spec-test.virtual-time
  (:require [clojure.spec :as s]
            [clojure.spec.test :as st]
            [clojure.spec.gen :as sgen]))

(deftype VirtualTime [time]
  Object
  (hashCode [_]
            (hash time))
  (equals [this that]

rebcabin

#! /usr/bin/env python
'''
	Simple example demonstrating how to take a screenshot
'''
import time
import sys
import os
import argparse

#OpenGL