sunxu

sunxu

local path = ngx.var.request:split(" ")[2] -- path
local t={}
local cjson = require "cjson"
local m =  ngx.re.match(path,[=[^/sentence/(.+)]=])
local words = m[1]:split("%%20") -- words in the sentence

for i,k in pairs(words) do
   local res_word = ngx.location.capture("/real/".. k )
   local value=cjson.new().decode(res_word.body)
   table.insert(t, value.sentiment)

sunxu

Latency numbers every programmer should know

L1 cache reference ......................... 0.5 ns
Branch mispredict ............................ 5 ns
L2 cache reference ........................... 7 ns
Mutex lock/unlock ........................... 25 ns
Main memory reference ...................... 100 ns             
Compress 1K bytes with Zippy ............. 3,000 ns  =   3 µs
Send 2K bytes over 1 Gbps network ....... 20,000 ns  =  20 µs
SSD random read ........................ 150,000 ns  = 150 µs

Read 1 MB sequentially from memory ..... 250,000 ns = 250 µs

sunxu

" neocomplcache
" http://github.com/Shougo/neocomplcache

let g:neocomplcache_enable_at_startup = 1

let g:neocomplcache_max_list = 100
let g:neocomplcache_max_keyword_width = 50
let g:neocomplcache_max_filename_width = 15

let g:neocomplcache_auto_completion_start_length = 2

sunxu

#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>

typedef struct _node{
	int             data;
	struct _node*   next;
    struct _node*   max;
} Node, *pNode;

sunxu

#include <stdio.h>
#include <stdbool.h>
#include <stdlib.h>

//链表节点，链表头结点不存储数据
typedef struct _node{
    int             data;
    struct _node *  next;
} node;

sunxu

//
//  minsubstr.c
//  Test
//
//  Created by 孙 旭 on 12-11-15.
//  Copyright (c) 2012年 孙 旭. All rights reserved.
//

#include <stdio.h>
#include <stdlib.h>