keyvanakbary

class HttpUrl

  ALPHA = "[a-zA-Z]"
  DIGIT = "[0-9]"
  DIGITS = "#{DIGIT}+"
  SAFE = "[-$_.+]"
  EXTRA = "[!*'(),]"

  ALPHADIGIT = "[a-zA-Z0-9]"
  TOPLABEL = "#{ALPHA}(#{ALPHADIGIT}|-)*#{ALPHADIGIT}|#{ALPHA}"

keyvanakbary

//Module with boilerplate/duplicated code
var Module = function (elements) {
    var
        onLink1Click = function (callback) {
            elements.link1.on("click", function (e) {
                callback();
                e.preventDefault();
            });
        },
        onLink2Click = function (callback) {

keyvanakbary

; Tons of duplicated code :'(
(defn insert-l [a s l]
  (cond
   (empty? l) `()
   (= (first l) s) (cons a l)
   :else (cons (first l) (insert-l a s (rest l)))))

(defn insert-r [a s l]
  (cond
   (empty? l) `()

keyvanakbary

; calculate the sum of odd numbers, the product of even ones and a list of the odds
; example extracted from the book "The Little Schemer"
; more info here http://stackoverflow.com/questions/10692449/the-little-schemer-evens-onlyco
(defn evens-only*&co [l col]
  (cond
   (empty? l) (col `() 1 0)
   (number? (first l))
   (cond
    (even? (first l)) (evens-only*&co
                       (rest l)

keyvanakbary

; pyramid of death
(defn baz [n1 n2]
  (cond (> n1 n2) (+ n1 n2)
        (< n1 n2) (cond (= n1 0) 1
                        (= n2 0) 2
                        :else 3)
        :else 0))

; internal extraction
(defn baz [n1 n2]

keyvanakbary

/*global $,localStorage*/
$.fn.draft = function () {
    'use strict';

    if (!localStorage) {
        return;
    }

    var form = $(this),
        fields = form.find('input,select,textarea'),

keyvanakbary

(defrecord Node [head tail])

(defn create [value]
  (Node. value nil))

(defn push [stack value]
  (Node. value stack))

(defn peek [stack]
  (:head stack))

keyvanakbary

(defrecord Node [value left right])

(defn create [value]
  (Node. value nil nil))

(defn insert [{:keys [left right value] :as tree} v]
  (if tree
    (cond
     (< v value) (Node. value (insert left v) right)
     (> v value) (Node. value left (insert right v))

keyvanakbary

#Direct style
factorial = (n) ->
  return 1 if n is 0
  n * factorial(n-1)

console.log factorial(3)
#6

#Continuation-passing style
eq_ = (n1, n2, fn) ->

keyvanakbary

//CLASSIC PROTOTYPE
var Rectangle = function (width, height) {
    this.width = width;
    this.height = height;
}

Rectangle.prototype.area = function() {
    return this.width * this.height;
}