maruks

qsort([]) ->
    [];
qsort([H | T]) ->
    L = [E || E <- T, E < H],
    R = [E || E <- T, E > H],
    P = [E || E <- T, E =:= H],
    qsort(L) ++ [H | P] ++ qsort(R).

maruks

#lang racket

(define tree-1 '(1 (2 (3 4) 5) (6 7)))

(define (tree-map tree fn)
  (if (list? tree)
      (map (lambda (x) (tree-map x fn)) tree)
      (fn tree)))

(define foo (tree-map tree-1 (lambda (x) (* x x))))

maruks

#lang racket

(define t 0)

(define (reset)
  (set! t 0))

(define (f n)
  (let ((p t))
    (set! t n)

maruks

(define-syntax thread-first
  (syntax-rules ()
    [(_ expr (fn args ...))
	  (fn expr args ...)]
    [(_ expr fn)
     (fn expr)]))

(define-syntax cond->
  (syntax-rules ()
    [(_ expr test fn)

maruks

(define-syntax (aif stx)
  (syntax-case stx ()
    [(_ expr then else)
     (with-syntax ([it (datum->syntax stx 'it)] )
       #'(let ((it expr))
	         (if it then else)))]))

maruks

#lang racket

(define (mlist . elem)
  (mcons (car elem)
	 (if (null? (cdr elem))
	     '()
	     (apply mlist (cdr elem)))))

;; has-cycle

maruks

(setq inferior-erlang-machine "rebar3")
(setq inferior-erlang-machine-options '("shell"))
(setq inferior-erlang-shell-type nil)

maruks

isSorted :: Tree -> Bool
isSorted t = isSortedTree t minBound maxBound

insert :: Tree -> Int -> Tree
insert Leaf e = Node e Leaf Leaf
insert n@(Node v l r) e
  | v < e = Node v l (insert r e)
  | v > e = Node v (insert l e) r
  | otherwise = n

maruks

-module(main).
-define(WINDOW_SIZE, 200000).
-define(MSG_COUNT, 1000000).
-define(MSG_SIZE, 1024).

-export([main/0]).

push_message(N) ->
    Start = erlang:monotonic_time(),
    Bin = list_to_binary(lists:duplicate(?MSG_SIZE, N rem 255)),

maruks

-module(main).
-define(WINDOW_SIZE, 200000).
-define(MSG_COUNT, 1000000).
-define(MSG_SIZE, 1024).

-export([main/0]).

push_message(N, Tab) ->
    Start = erlang:monotonic_time(),
    Bin = list_to_binary(lists:duplicate(?MSG_SIZE, N rem 255)),