komamitsu

(* ocamlfind c -w A -linkpkg -package lwt,lwt.unix,lwt.syntax -syntax camlp4o,lwt.syntax myecho.ml -o myecho *)
(* This code refers to https://github.com/avsm/ocaml-cohttpserver/blob/master/server/http_tcp_server.ml *)
open Lwt

let server_port = 12345
let so_timeout = Some 20
let backlog = 10

let try_close chan =
  catch (fun () -> Lwt_io.close chan)

komamitsu

package com.komamitsu;

import java.io.IOException;
import java.net.InetSocketAddress;
import java.nio.ByteBuffer;
import java.nio.channels.SelectionKey;
import java.nio.channels.Selector;
import java.nio.channels.ServerSocketChannel;
import java.nio.channels.SocketChannel;
import java.util.Iterator;

komamitsu

let split_rev cut xs =
  let (_, f, s) =   
    List.fold_left  
    (fun (i, f, s) x ->
      if i < cut then (i + 1, x::f, s) else (i + 1, f, x::s))
    (0, [], []) xs  
  in
  (f, s)

let rec ms xs =

komamitsu

package com.komamitsu;

import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;

public class App {
  private static class MyRunnable implements Runnable {
    private int num = 0;

    @Override

komamitsu

require 'strscan'
require 'test/unit'

class Calc
  def run(str)
    @scanner = StringScanner.new(str)
    expr
  end

  def scan(re)

komamitsu

# Encoding: UTF-8
require 'MeCab'

mecab = MeCab::Tagger.new
node = mecab.parseToNode (ARGF.read)

x,y = nil,nil
acm = []

while node do

komamitsu

    <uses-permission android:name="android.permission.ACCESS_WIFI_STATE"></uses-permission>
    <uses-permission android:name="android.permission.INTERNET"></uses-permission>

komamitsu

let ($) f g = f g

let safe n q qs =
  let (qx, qy) = q in
  if List.exists begin
      fun (x, y) -> qx = x || qy = y
    end qs then false
  else
    let rec row_iter iy =
      if iy >= n then true

komamitsu

komamitsu@carrot ~/lab/scala/traitsample2 $ cat Hello.scala 
trait T1 {
  val age:Int
}

trait T2 {
  def hello(name:String) = println("hello " + name)
}

class C extends T1 with T2 { val age = 42 }

komamitsu

class Hoge {
  def fib(n: Int, i: Int, a: Int, b: Int) : Int = {
    if (i >= n) b
    else fib(n, i + 1, b, a + b)
  }

  def simple_tailrec(n: Int) : Int = {
    if (n < 0) n else simple_tailrec(n - 1)
  }
}