/*
* demo.thrift
* thrift usage demo
*/
namespace cpp ellios.me
namespace java ellios.me
namespace py ellios.me

enum Operation {
  ADD = 1,
  SUBTRACT = 2,
  MULTIPLY = 3,
  DIVIDE = 4
}

struct Work {
  1: i32 num1 = 0,
  2: i32 num2,
  3: Operation op,
  4: optional string comment,
}

exception InvalidOperation {
  1: i32 what,
  2: string why
}

service Calculator {

   i32 calculate(1:i32 logid, 2:Work w) throws (1:InvalidOperation ouch),

}

 thrift --gen java --out . demo.thrift

public class CaloculatorServiceImpl  implements Calculator.Iface {
    @Override
    public int calculate(int logid, Work work) throws InvalidOperation, TException {
        System.out.println("calculate(" + logid + ", {" + work.op + "," + work.num1 + "," + work.num2 + "})");
        int val = 0;
        switch (work.op) {
            case ADD:
                val = work.num1 + work.num2;
                break;
            case SUBTRACT:
                val = work.num1 - work.num2;
                break;
            case MULTIPLY:
                val = work.num1 * work.num2;
                break;
            case DIVIDE:
                if (work.num2 == 0) {
                    InvalidOperation io = new InvalidOperation();
                    io.what = work.op.getValue();
                    io.why = "Cannot divide by 0";
                    throw io;
                }
                val = work.num1 / work.num2;
                break;
            default:
                InvalidOperation io = new InvalidOperation();
                io.what = work.op.getValue();
                io.why = "Unknown operation";
                throw io;
        }
        return val;
    }
}

public class DemoServer {

    public static void main(String [] args) throws TTransportException {
        Calculator.Iface calculatorService = new CaloculatorServiceImpl();
        Calculator.Processor processor = new Calculator.Processor(calculatorService);
        TServerTransport serverTransport = new TServerSocket(8000);
        TServer server = new TThreadPoolServer(new TThreadPoolServer.Args(serverTransport).processor(processor));

        System.out.println("Starting the simple server...");
        server.serve();
    }

}

public class DemoClient {

    public static void main(String [] args) throws Exception {

        TTransport transport = new TSocket("localhost", 8000);
        transport.open();
        TProtocol protocol = new TBinaryProtocol(transport);
        Calculator.Iface client = new Calculator.Client(protocol);

        Work work = new Work();

        work.op = Operation.DIVIDE;
        work.num1 = 1;
        work.num2 = 0;
        try {
            int quotient = client.calculate(1, work);
            System.out.println("Whoa we can divide by 0");
        } catch (InvalidOperation io) {
            System.out.println("Invalid operation: " + io.why);
        }

        work.op = Operation.SUBTRACT;
        work.num1 = 15;
        work.num2 = 10;
        try {
            int diff = client.calculate(2, work);
            System.out.println("15-10=" + diff);
        } catch (InvalidOperation io) {
            System.out.println("Invalid operation: " + io.why);
        }

        transport.close();
    }
}

import sys

from me.ellios.demo import Calculator
from me.ellios.demo.ttypes import *

from thrift import Thrift
from thrift.transport import TSocket
from thrift.transport import TTransport
from thrift.protocol import TBinaryProtocol

try:
  # Make socket
  transport = TSocket.TSocket('localhost', 8000)
  # Buffering is critical. Raw sockets are very slow
  transport = TTransport.TBufferedTransport(transport)
  # Wrap in a protocol
  protocol = TBinaryProtocol.TBinaryProtocol(transport)
  # Create a client to use the protocol encoder
  client = Calculator.Client(protocol)
  # Connect!
  transport.open()
  work = Work()
  work.op = Operation.DIVIDE
  work.num1 = 1
  work.num2 = 0
  try:
    quotient = client.calculate(1, work)
    print 'Whoa? You know how to divide by zero?'
  except InvalidOperation, io:
    print 'InvalidOperation: %r' % io
  work.op = Operation.SUBTRACT
  work.num1 = 15
  work.num2 = 10
  diff = client.calculate(1, work)
  print '15-10=%d' % (diff)
  # Close!
  transport.close()
except Thrift.TException, tx:
  print '%s' % (tx.message)

REVIEWBOARD_URL = "http://reviewboard.xxx.com/"
USERNAME = "xxx"
PASSWORD = "xxx"
HTTP_USERNAME = "xxx"
HTTP_PASSWORD = "xxx"

java.net.ProtocolException: Server redirected too many  times

easy_install -U RBTools

post-review -p --target-groups=xxx --target-people=xxx --summary=xxx --description=xxx files

diff = self.convert_to_absolute_paths(diff, repository_info)

message SearchRequest {
  required string query = 1;
  optional int32 page_number = 2;
  optional int32 result_per_page = 3;
}

 enum Colour {
    RED = 0;
    BLACK = 1;
    BLUE = 2;
  }

package me.ellios.tutorial;

option java_package = "me.ellios.tutorial";
option java_outer_classname = "AddressBookProtos";

message Person {
  required string name = 1;
  required int32 id = 2;
  optional string email = 3;
  repeated PhoneNumber phone = 4;

  enum PhoneType {
    MOBILE = 0;
    HOME = 1;
    WORK = 2;
  }

  message PhoneNumber {
    required string number = 1;
    optional PhoneType type = 2 [default = HOME];
  }
}

message AddressBook {
  repeated Person person = 1;
}

protoc --java_out=. tutorial.proto

package me.ellios.tutorial;

import me.ellios.tutorial.AddressBookProtos.Person;
import me.ellios.tutorial.AddressBookProtos.AddressBook;
import java.io.*;
import java.util.Random;

public class AddressBookExample {

    public static void main(String[] args) throws Exception {
        //要通过builder来构建对象，
        AddressBook.Builder addressBuiler = AddressBook.newBuilder();
        Random random = new Random();

        for(int i=0; i<10; i++){
            Person.Builder personBuilder = Person.newBuilder();
            personBuilder.setName("ellios" + i); //设置name，不能为空
            personBuilder.setId(i); //设置id，也不能为空
            personBuilder.setEmail(""); //email可以为空
            //创建phone
            Person.PhoneNumber.Builder phoneBuilder = Person.PhoneNumber.newBuilder();
            phoneBuilder.setNumber("132222222222");
            phoneBuilder.setType(Person.PhoneType.values()[random.nextInt(3)]);
            //将phone添加到person中,              .
            personBuilder.addPhone(phoneBuilder.build());
            //将person添加到地址簿的列表中
            addressBuiler.addPerson(personBuilder);
        }
        AddressBook addressBook = addressBuiler.build();

        System.out.println("addressBook : "  + addressBook);

        byte[] serializeBytes = addressBook.toByteArray();

        AddressBook addressBook2 = AddressBook.parseFrom(serializeBytes);
        System.out.println("addressBook2 equal to addressBook. result is " + addressBook.equals(addressBook2));

        addressBook.writeTo(new FileOutputStream("addressBook"));

        AddressBook.Builder addressBuilder3 = AddressBook.newBuilder();
        addressBuilder3.mergeFrom(new FileInputStream("addressBook"));
        System.out.println("addressBook3 equal to addressBook. result is " + addressBook.equals(addressBuilder3.build()));
    }
}

protoc --python_out=. tutorial.proto

#! /usr/bin/python

import tutorial_pb2

address_book = tutorial_pb2.AddressBook()

for i in range(10):
    person = address_book.person.add()
    person.id = i
    person.name = 'ellios%d'%i
    person.email = ''
    phone_number = person.phone.add()
    phone_number.number = "13233333333"
    if i % 3 == 0:
        phone_number.type = tutorial_pb2.Person.MOBILE
    elif i % 3 == 1:
        phone_number.type = tutorial_pb2.Person.HOME
    elif i % 3 == 2:
        phone_number.type = tutorial_pb2.Person.WORK

print 'address_book : ', address_book

f = open("address_book", "wb")
f.write(address_book.SerializeToString())
f.close()

address_book2 = tutorial_pb2.AddressBook()
f = open("address_book", "rb")
address_book2.ParseFromString(f.read())
f.close()

print "address_book same with address_book2. the result is %d"%(address_book == address_book2)

protoc --cpp_out=. tutorial.proto

#include <iostream>
#include <fstream>
#include <string>
#include "tutorial.pb.h"
using namespace std;

int main(int argc, char* argv[]) {
  // Verify that the version of the library that we linked against is
  // compatible with the version of the headers we compiled against.
  GOOGLE_PROTOBUF_VERIFY_VERSION;

  tutorial::AddressBook address_book;
  for (int i = 0; i < 10; i++) {
      tutorial::Person* person = address_book.add_person();
      person->set_id(i);
      person->set_name("ellios");
      person->set_email("");
      tutorial::Person::PhoneNumber* phone_number = person->add_phone();
      phone_number->set_number("13333333333");
      phone_number->set_type(tutorial::Person::HOME);
  }
  // Write the new address book back to disk.
  fstream output("address_book", ios::out | ios::trunc | ios::binary);
  if (!address_book.SerializeToOstream(&output)) {
      cerr << "Failed to write address book." << endl;
      return -1;
  }

  cout << "address_book : " << address_book.person_size() << endl;

  tutorial::AddressBook address_book2;
  fstream input("address_book", ios::in | ios::binary);
  address_book2.ParseFromIstream(&input);

  // Optional:  Delete all global objects allocated by libprotobuf.
  google::protobuf::ShutdownProtobufLibrary();

  return 0;
}

/**
 * 针对整形的排序实现
 * @param x 待排序的数据
 * @param off 起始位置
 * @param len 要排序的数据元素的个数
 */
private static void sort1(int x[], int off, int len) {
    //在小规模(size<7)数组中，直接插入排序的效率要比快速排序高。
    if (len < 7) {
        for (int i=off; i<len+off; i++)
            for (int j=i; j>off && x[j-1]>x[j]; j--)
                swap(x, j, j-1);
        return;
    }

    //选择划分元素，即枢轴
    //如果是小规模数组(size=7)，直接取中间元素作为枢轴
    //如果是中等规模数组(7<size<=40)，则在数组首、中、尾三个位置上的数中取中间大小的数作为枢轴
    //如果是大规模数组(size>40),则在9个指定的数中取一个伪中数(中间大小的数s)
    int m = off + (len >> 1);
    if (len > 7) {
        int l = off;
        int n = off + len - 1;
        if (len > 40) {        // Big arrays, pseudomedian of 9
            int s = len/8;
            l = med3(x, l,     l+s, l+2*s);
            m = med3(x, m-s,   m,   m+s);
            n = med3(x, n-2*s, n-s, n);
        }
        m = med3(x, l, m, n); // Mid-size, med of 3
    }
    int v = x[m];

    // 针对相同的元素做优化， 形成 v* (<v)* (>v)* v* 的数组
    int a = off, b = a, c = off + len - 1, d = c;
    while(true) {
        while (b <= c && x[b] <= v) {
            if (x[b] == v)
                swap(x, a++, b);
            b++;
        }
        while (c >= b && x[c] >= v) {
            if (x[c] == v)
                swap(x, c, d--);
            c--;
        }
        if (b > c)
            break;
        swap(x, b++, c--);
    }

    // 将所有相同的枢轴都移到中间，形成(<v)* v* (>v)*
    int s, n = off + len;
    s = Math.min(a-off, b-a  );  vecswap(x, off, b-s, s);
    s = Math.min(d-c,   n-d-1);  vecswap(x, b,   n-s, s);

    // 递归排序子数组
    if ((s = b-a) > 1)
        sort1(x, off, s);
    if ((s = d-c) > 1)
        sort1(x, n-s, s);
}

/**
 * 归并排序对象数组
 * @param src 原待排数组
 * @param dest 目的待排数组
 * @param low 待排数组的下界位置
 * @param high 待排数组的上界位置
 * @param off 从数组的第off个元素开始排序
 */
private static void mergeSort(Object[] src,
                              Object[] dest,
                              int low,
                              int high,
                              int off) {
    int length = high - low;

    //在小规模(size<7)数组中，使用归并排序。
    if (length < INSERTIONSORT_THRESHOLD) {
        for (int i=low; i<high; i++)
            for (int j=i; j>low &&
                    ((Comparable) dest[j-1]).compareTo(dest[j])>0; j--)
                swap(dest, j, j-1);
        return;
    }

    //将src数组划分为两半，并分别递归做归并，
    //在递归调用mergeSort时将desc和src的位置做了互换。
    int destLow  = low;
    int destHigh = high;
    low  += off;
    high += off;
    int mid = (low + high) >>> 1;
    mergeSort(dest, src, low, mid, -off);
    mergeSort(dest, src, mid, high, -off);

    //如果低子列表中的最高元素小于高子列表中的最低元素，则忽略合并
    //如果需要归并的两端low~(middle-1)，middle~high已经有序，即src[mid-1]==src[mid]。
    //那么只需要将src的low~high赋值对应的dest即可，无需再归并。
    if (((Comparable)src[mid-1]).compareTo(src[mid]) <= 0) {
        System.arraycopy(src, low, dest, destLow, length);
        return;
    }

    //将src的两个部分做归并操作，并赋值给dest
    for(int i = destLow, p = low, q = mid; i < destHigh; i++) {
        if (q >= high || p < mid && ((Comparable)src[p]).compareTo(src[q])<=0)
            dest[i] = src[p++];
        else
            dest[i] = src[q++];
    }
}

index = (list, target) ->
  [low, high] = [0, list.length]
  while low < high
    mid = (low + high) >> 1
    val = list[mid]
    return mid if val is target
    if val < target then low = mid + 1 else high = mid
  return -1

console.log 2 is index [10, 20, 30, 40, 50], 30
console.log 4 is index [-97, 35, 67, 88, 1200], 1200
console.log 0 is index [0, 45, 70], 0

(function() {
  var index;

  index = function(list, target) {
    var high, low, mid, val, _ref;
    _ref = [0, list.length], low = _ref[0], high = _ref[1];
    while (low < high) {
      mid = (low + high) >> 1;
      val = list[mid];
      if (val === target) {
        return mid;
      }
      if (val < target) {
        low = mid + 1;
      } else {
        high = mid;
      }
    }
    return -1;
  };

  console.log(2 === index([10, 20, 30, 40, 50], 30));

  console.log(4 === index([-97, 35, 67, 88, 1200], 1200));

  console.log(0 === index([0, 45, 70], 0));

}).call(this);

#匿名函数
console.log do -> "Hello World"
#非匿名函数，函数隐式返回最后一个表达式的值
square = (x) ->
  2 * x
  x * x
#调用函数
cube   = (x) -> square(x) * x
#函数可以有默认参数
fill = (container, liquid = "coffee") ->
  console.log "Filling the #{container} with #{liquid}..."
#函数绑定
setName = (name) -> @name = name;

(function() {
  var cube, fill, setName, square;

  console.log((function() {
    return "Hello World";
  })());

  square = function(x) {
    2 * x;
    return x * x;
  };

  cube = function(x) {
    return square(x) * x;
  };

  fill = function(container, liquid) {
    if (liquid == null) {
      liquid = "coffee";
    }
    return console.log("Filling the " + container + " with " + liquid + "...");
  };

  setName = function(name) {
    return this.name = name;
  };

}).call(this);

npm install -g coffee-script

git clone git://github.com/jashkenas/coffee-script.git
cd coffee-script
bin/cake build:full

/* lexical grammar */
%lex

%%
\s+                   /* skip whitespace */
[0-9]+("."[0-9]+)?\b  return 'NUMBER';
"-"                   return '-';
"+"                   return '+';
<<EOF>>               return 'EOF';

/lex

/* operator associations and precedence */

%left '+' '-'

%start expressions

%% /* language grammar */

expressions
    : e EOF
        {typeof console !== 'undefined' ? console.log($1) : print($1);
         return $1;}
    ;

e
    : e '+' e
        {$$ = $1-$3;}
    | e '-' e
        {$$ = $1+$3;}
    | NUMBER
        {$$ = Number(yytext);}
    ;

>> jison simple_cal.jison && echo "7-3" > 2 && node simple_cal.js 2
>> 10