This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
PUT /term_test | |
{ | |
"settings": { | |
"index": { | |
"number_of_shards": 2, | |
"number_of_replicas": 0 | |
} | |
}, | |
"mappings": { | |
"item": { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
public static void zoom(List<String> path, final String dest, final int width, final int height, final double quality, final String extension) throws Exception { | |
Observable.from(path) | |
.observeOn(Schedulers.io()) | |
.map(new Func1<String, BufferedImage>() { | |
@Override | |
public BufferedImage call(String path) { | |
try { | |
System.out.println("IO " + Thread.currentThread().getName()); | |
return ImageIO.read(new File(path)); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
1.在二叉排序树上面找出第3大的节点。注意:不能把二叉树全量存储到另外的存储空间,比如存储到数组中,然后取出数组的第三个元素。 | |
struct TreeNode { | |
int value; | |
struct TreeNode * left, * right; | |
}; | |
static int k = 0; | |
TreeNode* getThirdNode( TreeNode *node){ | |
if(!node) return; | |
TreeNode *p; | |
if((p = getThirdNode(node->right)) != NULL) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
" history存储长度。 | |
set history=2000 | |
"检测文件类型 | |
filetype on | |
"针对不同的文件类型采用不同的缩进格式 | |
filetype indent on | |
"允许插件 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
####################################################################### | |
# | |
# imouto.host | |
# | |
# #Ver : 1.16.120 Tokisaki Kurumi | |
# #Update Time : 2013.08.05;14:52 | |
# #Fix & Bug : 请参阅imouto.host.Readme.txt | |
# | |
# 数据来源于互联网上的无名英雄们 | |
# 感谢他们! |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Piwik_Segment( | |
segment =Piwik_SegmentExpression( | |
joins = | |
valuesBind = | |
parsedTree = | |
tree = array( | |
[0] =>array( | |
[0] => | |
[1] => 'browserName==FF' | |
) |