sort
  -g 按照 常规数值排序
  -r  逆序输出排序结果
  -k 排序的列

uniq
  -c 统计数量
  -d 只输出重复的行

 235012 123456789
 212749 12345678
  76346 11111111
  46053 dearbook
  34952 00000000

...

1976210 qq.com
1766931 163.com
 807897 126.com
 351594 sina.com
 205491 yahoo.com.cn
...

2012384 qq
1785057 163
 808173 126
 396855 sina
 326406 yahoo
 204509 hotmail
 187087 gmail
 105379 sohu
  72470 tom
...

2012384 qq
1785057 163
808173 126
396855 sina
326406 yahoo
204509 hotmail
187087 gmail
105379 sohu
72470 tom
516409 others

table <- read.table("email_agency_top10.txt")
percent <- round(table$V1/sum(table$V1)*100)
png(file="email_agency_market_share.png", width=500, height=500)
pie(table$V1, labels=paste(table$V2, '(', percent, '%)', sep=""), col=rainbow(length(table$V1)), main="邮箱占有率", family='DejaVu Sans')

var http   = require('http');
http.createServer(function (req, res) {
  res.writeHead(200, {'Content-Type': 'text/plain'});
  res.end('Hello World\n');
}).listen("/tmp/node-"+process.argv[2]+".sock");

var http    = require('http');
var cluster = require('cluster')
var server  = http.createServer(function (req, res) {
  res.writeHead(200, {'Content-Type': 'text/plain'});
  res.end('Hello World\n');
});
cluster(server).listen(1337);

<?php
echo 'hello world';

ModelTemplate = (req) ->
  {db} = req
  class Model
    @create: ->
      console.info "create #{db}"

st = Date.now()
for i in [1..1000]
  Model = ModelTemplate({db: 'hello'})

console.info Date.now() - st

ModelTemplate = (req) ->
  {db} = req
  class Bill
    @create: ->
      console.info "create bill #{db}"

  class Profile
    @create: ->
      console.info "create profile #{db}"

  {Bill, Profile}

st = Date.now()
for i in [1..1e4]
  models = ModelTemplate({db: :hello})
  {Bill} = models

console.info 1e4 * 1e3 / (Date.now() - st)

ModelTemplateBill = (req) ->
  {db} = req
  class Bill
    @create: ->
      console.info "create bill #{db}"

ModelTemplateProfile = (req) ->
  class Profile
    @create: ->
      console.info "create profile #{db}"

ModelTemplate = (req) ->
  {db} = req

  {Bill}    = ModelTemplateBill(req)
  {Profile} = ModelTemplateProfile(req)

  {Bill, Profile}

st = Date.now()
for i in [1..1e4]
  models = ModelTemplate({db: :hello})
  {Bill} = models

console.info 1e4 * 1e3 / (Date.now() - st)

# models/bill.toffee
ModelTemplateBill = (req) ->
  {db} = req
  class Bill
    @create: ->
      console.info "create bill #{db}"

module.exports = ModelTemplateBill

#----
ModelTemplate = (req) ->
  @BillTemplate    ?= require('./models/bill')
  @ProfileTemplate ?= require('./models/profile')

  Bill    = @BillTemplate(req)
  Profile = @ProfileTemplate(req)

  {Bill, Profile}

st = Date.now()
for i in [1..1e4]
  models = ModelTemplate({db: :hello})
  {Bill} = models

console.info 1e4 * 1e3 / (Date.now() - st)

class ResourcePool
  # 代码略

st = Date.now()
res_pool = ResourcePool.create({db: :hello})

for i in [1..1e4]
  res = res_pool.create()
  {Bill, db} = res
  res.close()

console.info 1e4 * 1e3 / (Date.now() - st)

    do ->
      # ! always is a function
      foo_0_0!
      @va = obj.foo_2_1! 'pa', 'pb'
      # @ is inherited
      [va, @vb] = obj::foo_2_2! 'pa', 'pb'

    # another async block
    do ->
      @va = @foo! 'pa'

    # if, while and so on has block too
    if true
      va = foo!
    else
      vb = foo!

    var _this = this;

    (function() {
      var _this = this;
      return foo_0_0(function() {
        return obj.foo_2_1('pa', 'pb', function(va) {
          _this.va = va;
          return obj.prototype.foo_2_2('pa', 'pb', function(va, vb) {
            _this.vb = vb;
          });
        });
      });
    })();

    (function() {
      var _this = this;
      return this.foo('pa', function(va) {
        _this.va = va;
      });
    })();

    if (true) {
      foo(function(va) {});
    } else {
      foo(function(vb) {});
    }

    [any expression] = foo!(params)
    other expression

    foo params, (any expression) =>
      other expression

    [a = '3', @b = '4'] = foo!
    @a = foo!
    ...
    等等

    :hello_world
    :hello-world

    'hello_world'
    'hello-world'

    "hello" =~ /\w+/

    var __matches = null;
    __matches = "hello".match(/\w+/);

    \~: the match
    \&: match[0]
    \1: match[1]
    \2: match[2]
    ...
    \9: match[9]

    if :hello =~ /^\w+$/
      console.info :matched

    if :333-444 =~ /^(\d+)-(\d+)$/
      console.info \1, \2

    (function() {
      var __matches = null;
      if (__matches = 'hello'.match(/^\w+$/)) console.info('matched');
      if (__matches = '333-444'.match(/^(\d+)-(\d+)$/)) {
        console.info(__matches[1], __matches[2]);
      }
    }).call(this);

npm install -g toffee-script

(a, b) => a + b;
() => 'yes';
(a, b) { return a + b; };
() { return 'yes'; };
add(a, b) => a+b;
int add2(a, b) { return a+b; };

print((a, b) { return a + b; }(3, 4)); // 输出 7
print(((a, b) => a + b)(3,4)); // 输出 7

main()
{
	final add = (a, b) => a + b; //合法
	print(add(3,4));
}

class Foo
{
	final add = (a, b) => a + b; // 不合法 1
}
final add = (a, b) => a + b; // 不合法 2，1与2两者实质是一样的

main ()
{
}

foo()
{
	var hello = 'hello';
	return () {
		return hello;
	};
}
main()
{
	print(foo()()); // 输出 hello
}

class 类名称 { [各种成员与方法] }

[static] [返回类型] [get|set] 名称 参数列表

abstract [static] [返回类型] [get|set] 名称

class Foo
{
	static add(a, b) => a + b;
	sub(a, b)
	{
		return a - b;
	}

	get a()
	{
		return 'a';
	}

} 

main()
{
	print(Foo.add(3, 4));         // 输出 7
	print((new Foo()).sub(4, 3)); // 输出 1
	print((new Foo()).a); // Getter a，输出 a
}

for (名称 in 容器) {
}

for (定义; 条件; 执行) {
}

while (条件) {
}

do {
} while (条件);

main()
{
	for (var i in [1, 2]) {
		print(i);
	}

	for (var i=0; i<10; ++i) {
		print(i);
	}

	var i =0;
	while (i < 10) {
		print(i);
		++i;
	}

	i = 0;
	do {
		print(i);
		++i;
	} while (i < 10);

}

main()
{
	var st = new Date.now();
	var j = 0;
	for (var i=1; i <= 100000; ++i)
	{
		j += i;
	}
	var ed = new Date.now();

	print(j);
	print(ed.difference(st));
}

5000050000
0:00:00.288

$ wget http://src.chromium.org/svn/trunk/src/build/install-build-deps.sh
$ source install-build-deps.sh

svn co http://src.chromium.org/svn/trunk/tools/depot_tools

gclient config http://dart.googlecode.com/svn/trunk/deps/standalone.deps

depot_tools/gclient sync

cd dart
../tools/build.py --arch=ia32 --mode=all

../tools/test.py --arch=ia32 --mode=all
# 也可以仅测试其中的部份，如
../tools/test.py --arch=ia32 --mode=release

main() {
  print('Hello World');
}

console.info :hello, :world

console.info('hello', 'world');

What will be translated to for those code?
1. info:hello
{info: hello}

2. {:hello, :world}
ERROR! use {hello, world} instead

if :hello =~ /^\w+$/
  console.info :ok, \&

var __matches = null;
if (__matches = 'hello'.match(/^\w+$/))
  console.info('ok', __matches[0]);

extern int io_setup(int maxevents, io_context_t *ctxp);
extern int io_destroy(io_context_t ctx);
extern int io_submit(io_context_t ctx, long nr, struct iocb *ios[]);
extern int io_cancel(io_context_t ctx, struct iocb *iocb, struct io_event *evt);
extern int io_getevents(io_context_t ctx_id, long min_nr, long nr, struct io_event *events, struct timespec *timeout);

struct io_iocb_poll {
	PADDED(int events, __pad1);
};	/* result code is the set of result flags or -'ve errno */

struct io_iocb_sockaddr {
	struct sockaddr *addr;
	int		len;
};	/* result code is the length of the sockaddr, or -'ve errno */

struct io_iocb_common {
	PADDEDptr(void	*buf, __pad1);
	PADDEDul(nbytes, __pad2);
	long long	offset;
	long long	__pad3;
	unsigned	flags;
	unsigned	resfd;
};	/* result code is the amount read or -'ve errno */

struct io_iocb_vector {
	const struct iovec	*vec;
	int			nr;
	long long		offset;
};	/* result code is the amount read or -'ve errno */

struct iocb {
	PADDEDptr(void *data, __pad1);	/* Return in the io completion event */
	PADDED(unsigned key, __pad2);	/* For use in identifying io requests */

	short		aio_lio_opcode;
	short		aio_reqprio;
	int		aio_fildes;

	union {
		struct io_iocb_common		c;
		struct io_iocb_vector		v;
		struct io_iocb_poll		poll;
		struct io_iocb_sockaddr	saddr;
	} u;
};

struct io_event {
	PADDEDptr(void *data, __pad1);
	PADDEDptr(struct iocb *obj,  __pad2);
	PADDEDul(res,  __pad3);
	PADDEDul(res2, __pad4);
};

static inline void io_set_callback(struct iocb *iocb, io_callback_t cb);
static inline void io_prep_pread(struct iocb *iocb, int fd, void *buf, size_t count, long long offset);
static inline void io_prep_pwrite(struct iocb *iocb, int fd, void *buf, size_t count, long long offset);
static inline void io_prep_preadv(struct iocb *iocb, int fd, const struct iovec *iov, int iovcnt, long long offset);
static inline void io_prep_pwritev(struct iocb *iocb, int fd, const struct iovec *iov, int iovcnt, long long offset);
/* Jeff Moyer says this was implemented in Red Hat AS2.1 and RHEL3.
 * AFAICT, it was never in mainline, and should not be used. --RR */
static inline void io_prep_poll(struct iocb *iocb, int fd, int events);
static inline int io_poll(io_context_t ctx, struct iocb *iocb, io_callback_t cb, int fd, int events);
static inline void io_prep_fsync(struct iocb *iocb, int fd);
static inline int io_fsync(io_context_t ctx, struct iocb *iocb, io_callback_t cb, int fd);
static inline void io_prep_fdsync(struct iocb *iocb, int fd);
static inline int io_fdsync(io_context_t ctx, struct iocb *iocb, io_callback_t cb, int fd);
static inline void io_set_eventfd(struct iocb *iocb, int eventfd);

#include <unistd.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <error.h>
#include <errno.h>

#include <fcntl.h>
#include <libaio.h>

int main(int argc, char *argv[])
{
	// 每次读入32K字节
	const int buffer_size = 0x8000;

	// 最大事件数 32
	const int nr_events   = 32;
	int rt;

	io_context_t ctx = {0};

	// 初使化 io_context_t
	rt = io_setup(nr_events, &ctx);
	if ( rt != 0 )
		error(1, rt, "io_setup");

	// 依次读取参数作为文件名加入提交到ctx
	int pagesize = sysconf(_SC_PAGESIZE);
	for (int i=1; i<argc; ++i) {
		iocb *cb = (iocb*)malloc(sizeof(iocb));
		void *buffer;
		// 要使用O_DIRECT, 必须要对齐
		posix_memalign(&buffer, pagesize, buffer_size);
		io_prep_pread(cb, open(argv[i], O_RDONLY | O_DIRECT), buffer, buffer_size, 0);
		rt = io_submit(ctx, 1, &cb);
		if (rt < 0)
			error(1, -rt, "io_submit %s", argv[i]);;
	}

	io_event events[nr_events];
	iocb     *cbs[nr_events];

	int remain = argc - 1;
	int n      = 0;

	// 接收数据最小返回的请求数为1，最大为nr_events
	while (remain && (n = io_getevents(ctx, 1, nr_events, events, 0))) {
		int nr_cbs = 0;
		for (int i=0; i<n; ++i) {
			io_event &event = events[i];
			iocb     *cb    = event.obj;
			// event.res为unsigned
			//printf("%d receive %d bytes\n", cb->aio_fildes, event.res);
			if (event.res > buffer_size) {
				printf("%s\n", strerror(-event.res));
			}
			if (event.res != buffer_size || event.res2 != 0) {
				--remain;
				// 释放buffer, fd 与 cb
				free(cb->u.c.buf);
				close(cb->aio_fildes);
				free(cb);
			} else {
				// 更新cb的offset
				cb->u.c.offset += event.res;
				cbs[nr_cbs++] = cb;
			}
		}

		if (nr_cbs) {
			// 继续接收数据
			io_submit(ctx, nr_cbs, cbs);
		}
	}
	return 0;
}

$ truncate foo.txt -s 100K
$ truncate foo2.txt -s 200K
$ g++ -O3 libaio_simple.cc -laio && ./a.out foo.txt foo2.txt
3 received 32768 bytes
4 received 32768 bytes
3 received 32768 bytes
4 received 32768 bytes
3 received 32768 bytes
4 received 32768 bytes
3 received 4096 bytes
3 done.
4 received 32768 bytes
4 received 32768 bytes
4 received 32768 bytes
4 received 8192 bytes
4 done.

      reserved_semispace_size_(16*MB),
      max_semispace_size_(16*MB), //GC最大阈值为16M
      initial_semispace_size_(1*MB), //初使的GC的阈值为1M
      max_old_generation_size_(1*GB), //最大内存消耗
      max_executable_size_(256*MB),
      code_range_size_(512*MB),

#include <v8.h>
#include <stdio.h>
#include <sys/time.h>

using namespace v8;
class Foo
{
    public:
	static int total;
	static int number;
	static int last;

	Foo();
	~Foo();
};

int Foo::total  = 1;
int Foo::number = 1;
int Foo::last = 1;

Foo::Foo()
{
	if (last > number) {
		printf("creating from id %d\n", number);
	}
	last = number;
	++number;
	++total;
	// 加上下面这条似乎更合理，不过对于没有成员变量的类来说有没有都无感觉。
	// 2011-08-13 补充，使用sizeof(Foo) 1字节，并不正确，详见文尾补充
	V8::AdjustAmountOfExternalAllocatedMemory(sizeof(Foo));
}

Foo::~Foo()
{
	if (last<number) {
		printf("sweeping from id %d\n", number);
	}
	last = number;
	--number;
	V8::AdjustAmountOfExternalAllocatedMemory(-sizeof(Foo));
}

long long microtime()
{
	timeval tv;
	gettimeofday(&tv, NULL);
	return (long long)tv.tv_sec * 1000 + tv.tv_usec / 1000;
}

int main(int argc, char *argv[])
{
	V8::SetFlagsFromCommandLine(&argc, argv, true);

	HandleScope scope;
	auto context = Context::New();
	Context::Scope context_scope(context);

	auto object_template = ObjectTemplate::New();
	object_template->SetInternalFieldCount(1);

	auto start = microtime();
	int times = 2e8;
	for (int i=0; i<times; ++i) {
		HandleScope scope;
		auto object = object_template->NewInstance();
		auto foo = new Foo();

		// 把foo可入到object，使得在任何时候都可能通过对象object得到foo的指针。
		// 这句也可简写成object->SetPointerInInternalField(0, foo);
		object->SetInternalField(0, External::New(foo));

		// 创建一个Persistent句柄监视object的引用状况，
		// 当object不被任何对象引用时，删除foo与该句柄。
		Persistent<Object>::New(object).MakeWeak(foo, [](Persistent<Value> value, void *data) {
			delete (Foo*)data;
			value.Dispose();
		});
		if (i%(int)1e6 == 0) {
			int speed = i / (microtime() - start);
			printf("Speed: %d\n", speed);
		}
	}

	context.Dispose();
	return 0;
}

$ g++ -std=c++0x -O3 gc_test.cc -lv8

$ ./a.out  --trace-gc
Speed: 0
Scavenge 0.9 -> 0.8 MB, 5 ms.
Scavenge 1.2 -> 1.2 MB, 6 ms.
Scavenge 1.6 -> 1.6 MB, 6 ms.
Scavenge 2.3 -> 2.3 MB, 13 ms.
sweeping from id 114428
Mark-sweep 3.1 -> 3.0 MB, 35 / 74 ms.
creating from id 1
Scavenge 5.0 -> 5.0 MB, 25 ms.
...
...
Scavenge 46.4 -> 46.4 MB, 89 ms.
Speed: 186
Scavenge 52.4 -> 52.4 MB, 103 ms.
Scavenge 58.4 -> 58.4 MB, 112 ms.
...
...
Scavenge 106.4 -> 106.4 MB, 170 ms.
sweeping from id 3233110
Mark-sweep 112.4 -> 74.4 MB, 998 / 1999 ms.
creating from id 1
Speed: 182
Scavenge 82.4 -> 82.4 MB, 89 ms.
Scavenge 88.4 -> 88.4 MB, 94 ms.
Scavenge 94.4 -> 94.4 MB, 104 ms.

$ ./a.out --trace-gc --max-old-space-size=20
Speed: 0
Scavenge 0.9 -> 0.8 MB, 5 ms.
Scavenge 1.2 -> 1.2 MB, 6 ms.
Scavenge 1.6 -> 1.6 MB, 6 ms.
Scavenge 2.3 -> 2.3 MB, 13 ms.
sweeping from id 114428
Mark-sweep 3.1 -> 3.0 MB, 35 / 75 ms.
creating from id 1
Scavenge 5.0 -> 5.0 MB, 26 ms.
Scavenge 6.5 -> 6.5 MB, 24 ms.
Scavenge 9.5 -> 9.5 MB, 52 ms.
Scavenge 12.5 -> 12.5 MB, 54 ms.
sweeping from id 677206
Mark-sweep 18.5 -> 15.9 MB, 213 / 458 ms.
creating from id 1
Speed: 190
sweeping from id 349526
Mark-sweep 23.9 -> 8.4 MB, 111 / 304 ms.
creating from id 1
sweeping from id 349526
Mark-sweep 16.4 -> 8.4 MB, 116 / 284 ms.
creating from id 1
sweeping from id 349526
Mark-sweep 16.4 -> 8.4 MB, 111 / 277 ms.
creating from id 1
Speed: 190
sweeping from id 349526
Mark-sweep 16.4 -> 8.4 MB, 108 / 273 ms.
creating from id 1

$ ./a.out --trace-gc --max-new-space-size=2048 --gc-global
Speed: 0
sweeping from id 16124
Mark-sweep 0.7 -> 0.7 MB, 6 / 15 ms.
creating from id 1
sweeping from id 21846
Mark-sweep 1.2 -> 0.8 MB, 8 / 20 ms.
creating from id 1
sweeping from id 21846
Mark-sweep 1.3 -> 0.8 MB, 8 / 20 ms.
creating from id 1
sweeping from id 43692
Mark-sweep 1.8 -> 1.3 MB, 17 / 39 ms.
creating from id 2
sweeping from id 43692
Mark-sweep 2.3 -> 1.3 MB, 17 / 39 ms.
creating from id 1
sweeping from id 43692
Speed: 186

var crypto = require('crypto');
var mymd5 = function(str, encoding){
  return crypto
  .createHash('md5')
  .update(str)
  .digest(encoding || 'hex');
};

while(1){
  console.info(mymd5("" + parseInt(Math.random() * 100000)));
}

if(typeof(print)=='undefined') {
  print = console.info

}

i = 0;
while(true){
  ++i;
  print(i);
}

if(typeof(print)=='undefined') {
  print = console.info

}

i = 0;
while(true){
  ++i;
  if (i%100 ==0)
    print(i);
}

if(typeof(print)=='undefined') {
  print = console.info

}

var crypto = require('crypto');
var mymd5 = function(str, encoding){
  return crypto
  .createHash('md5')
  .update(str)
  .digest(encoding || 'hex');
};

i=0;
while(1){
  mymd5("" + parseInt(Math.random() * 100000));
  ++i;
  if (i%100000 == 0) {
    print(i);
  }
}

$ node --trace-gc --max-new-space-size=2048 --gc-global md5.js
Mark-sweep 1.5 -> 1.2 MB, 7 ms.
Mark-sweep 1.9 -> 1.5 MB, 1 / 11 ms.
...
...
Mark-sweep 2.9 -> 1.9 MB, 4 / 20 ms.
100000
Mark-sweep 2.9 -> 1.9 MB, 4 / 20 ms.
...
...
Mark-sweep 2.9 -> 1.9 MB, 4 / 19 ms.
200000
Mark-sweep 2.9 -> 1.9 MB, 4 / 19 ms.
Mark-sweep 2.9 -> 1.9 MB, 4 / 18 ms.
Mark-sweep 2.9 -> 1.9 MB, 4 / 18 ms.
Mark-sweep 2.9 -> 1.9 MB, 4 / 20 ms.
Mark-sweep 2.9 -> 1.9 MB, 4 / 19 ms.

if(typeof(print)=='undefined') {
  print = console.info
}

i=0;
while(1){
  str = "hello world" + i
  ++i;
  if (i%1000000 == 0) {
    print(i);
  }
}

$ node --trace-gc md5.js
Scavenge 1.5 -> 1.3 MB, 2 ms.
Scavenge 1.8 -> 1.6 MB, 2 ms.
Scavenge 2.0 -> 1.8 MB, 2 ms.
...
...
Scavenge 5.8 -> 2.1 MB, 2 ms.
Scavenge 5.8 -> 2.1 MB, 2 ms.
Scavenge 5.8 -> 2.1 MB, 2 ms.
1000000
Scavenge 5.8 -> 2.1 MB, 2 ms.
Scavenge 5.8 -> 2.1 MB, 2 ms.
...
...
Scavenge 5.8 -> 2.1 MB, 2 ms.
Scavenge 9.8 -> 2.1 MB, 2 ms.
2000000
Scavenge 9.8 -> 2.1 MB, 2 ms.
Scavenge 9.8 -> 2.1 MB, 2 ms.
...
...
Scavenge 9.8 -> 2.1 MB, 2 ms.
3000000
Scavenge 9.8 -> 2.1 MB, 2 ms.
...
...
Scavenge 9.8 -> 2.1 MB, 2 ms.
5000000
Scavenge 9.8 -> 2.1 MB, 2 ms.
Scavenge 9.8 -> 2.1 MB, 2 ms.
Scavenge 9.8 -> 2.1 MB, 2 ms.

	// 加上下面这条似乎更合理，不过对于没有成员变量的类来说有没有都无感觉。
-	V8::AdjustAmountOfExternalAllocatedMemory(sizeof(Foo));
+	V8::AdjustAmountOfExternalAllocatedMemory(128);  

-	V8::AdjustAmountOfExternalAllocatedMemory(-sizeof(Foo));
+	V8::AdjustAmountOfExternalAllocatedMemory(-128);

sweeping from id 124978
Mark-sweep 11.2 -> 3.2 MB, 85 / 149 ms.
creating from id 2
Speed: 167
sweeping from id 349436
Mark-sweep 11.2 -> 8.4 MB, 235 / 474 ms.
creating from id 1
sweeping from id 124985
Mark-sweep 11.2 -> 3.2 MB, 84 / 147 ms.
creating from id 2

#include <sys/time.h>

#include <cstdlib>
#include <cstdio>

#include <vector>
#include <list>
#include <string>
#include <map>
#include <unordered_map>
#include <boost/asio/detail/hash_map.hpp>
#include <string.h>
using namespace std;

long long microtime()
{
	timeval tv;
	gettimeofday(&tv, NULL);
	return (long long)tv.tv_sec * 1000 + tv.tv_usec / 1000;
}

#define START() long long start = microtime();
#define FINISH(title) printf("%s %lld\n", title, times / (microtime() - start));
#define BENCHMARK for(int i=0; i<times; ++i)

#define BIG_INTERVAL 60 * 60 * 1000
#define SMALL_INTERVAL 1 * 1000
inline char *my_itoa(int n)
{
	bool is_neg = false;
	if (n<0) {
		is_neg = true;
		n = -n;
	}
	static char buf[16];
	char * last = buf + 15;
	*last = 0;
	do {
		*(--last) = '0' + n % 10;
		n /= 10;
	} while(n);
	if (is_neg) {
		*(--last) = '-';
	}
	return last;
}

int main(int argc, char *argv[])
{
	int times = 1e6;
	{
		START();
		char buf[64];
		BENCHMARK {
			sprintf(buf, "%da", i);
		}
		FINISH("i+a");
	}

	{
		START();
		char buf[64];
		BENCHMARK {
			sprintf(buf, "%sa", my_itoa(i));
		}
		FINISH("sprintf without locale");
	}

	{
		START();
		char buf[64];
		BENCHMARK {
			char *dest = buf;
			dest = stpcpy(dest, "a");
			dest = stpcpy(dest, my_itoa(i));
		}
		FINISH("strpcpy");
	}

	{
		START();
		vector<int> vs;
		BENCHMARK {
			vs.push_back(i);
		}
		FINISH("array int");

	}

	{
		START();
		vector<int> vs;
		BENCHMARK {
			vs.push_back(9999);
		}
		FINISH("array int static");

	}

	{
		START();
		list<int> ls;
		BENCHMARK {
			ls.push_back(9999);
		}
		FINISH("array list static");

	}

	{
		START();
		vector<string> vs;
		char buf[64];
		BENCHMARK {
			sprintf(buf, "%d", i);
			vs.push_back(buf);
		}
		FINISH("array string");

	}

	{
		START();
		vector<string> vs;
		char buf[64];
		BENCHMARK {
			vs.push_back("hello world");
		}
		FINISH("array string static");

	}

	{
		START();
		string a = "hello";
		string b = "world";
		string c;
		BENCHMARK {
			c = a + b;
		}
		FINISH("string a+b");
	}

	unordered_map<int, int> um;
	{
		START()
		BENCHMARK {
			um[i] = i;
		}
		FINISH("unordered map");
	}

	boost::asio::detail::hash_map<int, int> hm;
	{
		START()
		BENCHMARK {
			hm.insert(make_pair(i, i));
		}
		FINISH("asio hash map");
	}

	map<int, int> m;
	{
		START()
		BENCHMARK {
			m[i] = i;
		}
		FINISH("map");
	}
	return 0;
}

benchmark = (title, callback) ->
  start = Date.now()
  times = 1e6
  for i in [1..times]
    callback(i)
  console.info title, times / (Date.now() - start)

benchmark 'i+a', (i)->
  i+'a'

a=[]
benchmark 'array int', (i)->
  a.push i

a=[]
benchmark 'array int static', (i)->
  a.push 9999

a=[]
benchmark 'array string', (i)->
  a.push i+''

a=[]
benchmark 'array string static', (i)->
  a.push 'hello world'

benchmark 'string a+b', (i)->
  c = 'hello'+'world'

a={}
benchmark 'map', (i)->
  a[i] = i

Linux myhost 2.6.36-ARCH
#1 SMP PREEMPT Mon Jan 24 18:34:55 UTC 2011 i686
Intel(R) Atom(TM) CPU D510 @ 1.66GHz GenuineIntel GNU/Linux

node v0.4.9
gcc 版本 4.6.1 (GCC)
v8 3.2.10.2

$ g++ -O3   -c -o test.o test.cc
$ g++   test.o   -o test
i+a 1642
array int 52631
array static 58823
array string 881
array string static 2272
string a+b 1594
map 1109

$ coffee test.coffee
i+a 1937.984496124031
array int 14492.753623188406
array int static 16393.44262295082
array string 1564.9452269170579
array string static 11111.111111111111
string a+b 7042.2535211267605
map 8928.57142857143