athos

Rich Hickey Q&A

by Michael Fogus

Best known as the inventor of Clojure, a Lisp that runs on the Java Virtual Machine and the first new member of the Lisp family to attract any widespread interest since Scheme and Common Lisp, Rich Hickey has been a software developer and consultant for two decades.

Rich Hickeyは20年来のソフトウェア技術者およびコンサルタントで、Clojureの創始者としてよく知られる。ClojureはJava仮想マシン上で動作するLispで、Lisp族の中ではSchemeやCommon Lisp以来はじめて幅広い人の興味を引いた新しい言語だ。

athos

(use gauche.partcont)
(use util.queue)

(define-class <channel> (buf takes puts))

(define (chan)
  (make <channel> (make-queue) (make-queue) (make-queue)))

(define-syntax go
  (syntax-rules ()

athos

Clojure製ボットフレームワークを作る

リポジトリ on GitHub

• https://github.com/athos/reacta

前提

• Hubot: GitHub製ボットフレームワーク(CoffeeScript)
  • アダプター: ボットを動かすサービスの差を吸収するレイヤー
  • スクリプト: コマンドに対するアクションを規定

athos

(ns redef-as-serializable.core)

(defmacro redef-as-serializable [& ts]
  `(do ~@(for [t ts
               :let [c (resolve t)
                     fields (mapv #(symbol (.getName %)) (.getDeclaredFields c))]]
           `(deftype ~(symbol (str t \')) ~fields
              java.io.Serializable))))

athos

gen-class 勉強会 プログラム

No.	タイトル	担当	レベル
1	Java のクラスの作り方	@tnoda\_	未経験者
2	Docstring 逐条講義	@tnoda\_	ビギナー
3	gen-class の内部実装の話	@athos0220	上級者
4	アノテーションの使い方	@tnoda\_	中級者
5	gen-class クイズ	@tnoda\_	中級者

athos

> defmodule M do
>  def f do
>   x = 0
>   {fn -> x = 1 end, fn -> x end}
>  end
> end
iex:4: warning: variable x is unused
{:module, M,
 <<70, 79, 82, 49, 0, 0, 5, 24, 66, 69, 65, 77, 69, 120, 68, 99, 0, 0, 0, 124, 131, 104, 2, 100, 0, 14, 101, 108, 105, 120, 105, 114, 95, 100, 111, 99, 115, 95, 118, 49, 108, 0, 0, 0, 4, 104, 2, ...>>,
 {:f, 0}}

athos

(defn include? [[x & xs :as xxs] [y & ys :as yys]]
  (or (empty? xxs)
      (and (not (empty? yys))
           (if (= x y)
             (recur xs ys)
             (recur xxs ys)))))

athos

(defn include? [xs ys]
  (let [ys' (frequencies ys)]
    (reduce (fn [_ [e n]]
              (or (some->> (ys' e) (<= n))
                  (reduced false)))
            true
            (frequencies xs))))

athos

(def players
  (->> (repeatedly #(read *in* false nil))
       (take-while identity)
       (map-indexed #(vector % ('{J 11 Q 12 K 13 A 14 2 15} %2 %2)))
       (into clojure.lang.PersistentQueue/EMPTY)))

(defn solve [ps]
  (loop [[[id n :as p] :as ps] ps, card nil, passes 0, winners []]
    (cond (empty? ps) winners
          (= passes (count ps)) (recur ps nil 0 winners)

athos

(def actions
  (repeatedly (read) (fn [] [(read) (read)])))

(defn step [[[[t op] & as' :as as] temp temps] time]
  (let [temp' (+ temp (if (= time t) (get '{out 3 in 5} op) 0))]
    [(if (= time t) as' as), (max (dec temp') 0), (conj temps temp')]))

(defn calc [actions]
  (let [zs (count (filter zero? (last (reduce step [actions 0 []] (range 24)))))]
    (+ zs (* 2 (- 24 zs)))))