superbobry

# -*- coding: utf-8 -*-

"""
Incomplete RFC 2617 implementation for Tornado web server [1], originally
implemeted as `curtain` by Brian K. Jones [2].

[1] http://tornadoweb.org
[2] http://github.com/bkjones/curtain
"""

superbobry

coffee> f = ([x, y]) -> x + y
[Function]
coffee> f([1, 2])
3

coffee> f = ({x, y}) -> x + y
[Function]
coffee> f({x: 1, y: 2})
3

superbobry

>>> map(lambda (x, y): x + y, ([1, 2], [3, 4]))
[3, 7]
>>> map(lambda (x, y): x + y, [xrange(2)])
[1]
>>> def g():
...     yield 1
...     yield 2
... 
>>> map(lambda (x, y): x + y, [g()])
[3]

superbobry

#use "topfind"
#require "oasis.base"

open OASISTypes
open OASISVersion

let (|>) x f = f x

let find_all_depends =
  let rec inner acc = function

superbobry

# PyPy
>>>> 0 is 0
True
>>>> x = 0
>>>> x is 0
False

# CPython
>>> 0 is 0
True

superbobry

(* Chapter 2: BST *)

type 'a tree = Empty | Node of 'a tree * 'a * 'a tree

module Set : sig
  val empty  : 'a tree
  val member : 'a tree -> 'a -> bool
  val insert : 'a tree -> 'a -> 'a tree
end = struct

superbobry

 (** Task X: Treap. *)

module Treap = struct
  type ('a, 'b) t =
    | Empty
    | Node of ('a, 'b) t * 'a * 'b * ('a, 'b) t

  let empty = Empty

  let rec merge l r = match (l, r) with

superbobry

# module M = Map.Make((val (module String : Map.OrderedType) : Map.OrderedType));;
module M :
  sig
    type key
    type +'a t
  end
# module M = Map.Make(String);;
module M :
  sig
    type key = String.t

superbobry

open StdLabels

type 'a tree = Node of ('a * 'a tree list)

let rec make ~f init =
  let (label, forest) = f init in
  Node (label, (List.map ~f:(make ~f) forest))

and draw ~f (Node (label, forest)) =
  let rec inner = function

superbobry

>>> def f((x, y)): return x + y
... 
>>> def gen():
...     yield 1
...     yield 2
... 
>>> 
>>> f(gen())
3