This file contains hidden or 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
function getSelectionHtml() { | |
var html = ""; | |
if (typeof window.getSelection != "undefined") { | |
var sel = window.getSelection(); | |
if (sel.rangeCount) { | |
var container = document.createElement("div"); | |
for (var i = 0, len = sel.rangeCount; i < len; ++i) { | |
container.appendChild(sel.getRangeAt(i).cloneContents()); | |
} | |
html = container.innerHTML; |
This file contains hidden or 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
# -*- coding: utf-8 -*- | |
__author__ = 'klb3713' | |
import threading, time, httplib | |
HOST = "127.0.0.1"; #主机地址 例如192.168.1.101 | |
PORT = 8001 #端口 | |
URI = "/api/huohuaId2Url" #相对地址,加参数防止缓存,否则可能会返回304 | |
TOTAL = 0 #总数 | |
SUCC = 0 #响应成功数 | |
FAIL = 0 #响应失败数 |
This file contains hidden or 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
import threading,time | |
class Timer(threading.Thread): | |
def __init__(self,fn,args=(),sleep=0,lastDo=True): | |
threading.Thread.__init__(self) | |
self.fn = fn | |
self.args = args | |
self.sleep = sleep | |
self.lastDo = lastDo | |
self.setDaemon(True) |
This file contains hidden or 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
# -*- coding: utf-8 -*- | |
__author__ = 'klb3713' | |
import re | |
import json | |
import urllib2 | |
from lxml import etree | |
from multiprocessing import Process | |
from pymongo import Connection |
This file contains hidden or 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
# -*- coding: utf-8 -*- | |
__author__ = 'klb3713' | |
from lxml import etree | |
xsdfile = etree.parse("./test.xsd") | |
xmlschema = etree.XMLSchema(xsdfile) | |
xmldoc = etree.parse("./test.xml") | |
print xmlschema.validate(xmldoc) |
This file contains hidden or 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
import theano | |
import theano.tensor as T | |
import numpy as np | |
import cPickle as pickle | |
#theano.config.compute_test_value = 'warn' | |
class Meta(object): | |
def __init__(self): |
This file contains hidden or 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
/* | |
* ===================================================================================== | |
* | |
* Filename: regexp.c | |
* | |
* Description: 参考《代码之美》写的一个实现了. * + c ^ $六种常用语法的正则匹配器 | |
* | |
* Version: 1.0 | |
* Created: 2014-4-30 | |
* Revision: none |
This file contains hidden or 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
// generate [0..n-1] | |
auto seq = [](size_t n) -> std::vector<size_t> { | |
std::vector<size_t> v(n); | |
for (size_t i=0; i<n; ++i) v[i] = i; | |
return v; | |
}; | |
auto index = seq(n); | |
// n * n distance matrix | |
std::vector<D> dists(n * n); |