Zenuncl

from WordLookup import lookup

# This is a helper function which converts a word string into a list with each letter as an element
def wordToList(word):
    i=0
    a=[]
    while i < len(word):
        a.append(word[i])
        i+=1
    return a

Zenuncl

Selecting previously unselected package pe-ruby-shadow.
Unpacking pe-ruby-shadow (from .../pe-ruby-shadow_2.2.0-1puppet3_amd64.deb) ...
Selecting previously unselected package pe-puppet.
Unpacking pe-puppet (from .../pe-puppet_3.2.4.pe1-1puppet1_all.deb) ...
Selecting previously unselected package pe-rubygem-guid.
Unpacking pe-rubygem-guid (from .../pe-rubygem-guid_0.1.1-1puppet2_all.deb) ...
Selecting previously unselected package pe-rubygem-builder.
Unpacking pe-rubygem-builder (from .../pe-rubygem-builder_3.0.0-1puppet2_all.deb) ...
Selecting previously unselected package pe-rubygem-excon.
Unpacking pe-rubygem-excon (from .../pe-rubygem-excon_0.14.1-1puppet2_all.deb) ...

Zenuncl

<?php
if (isset($_GET['url'])) {
  $url = rawurldecode(trim($_GET['url']));
	if (empty($url))
		return;

	if (substr($url, 0, 4) != 'http')
		$url = "http://{$url}";

	require_once 'PHPWebDriver/__init__.php';

Zenuncl

自用shadowsocks

请到http://shadowsocks.org/downloads 下载相关的工具，本服务需要这些软件的配合。

使用有任何问题都可以在Issues提出。

https://github.com/chuquus/chuqu.us/issues

希望能获得大家在连接速度和稳定性上的反馈，谢谢。

Zenuncl

# 1. Make sure you have nginx sub module compiled in
# nginx -V  2>&1 | grep --color=always '\-\-with\-http_sub_module'

# 2. add two directives below at HTTP level

# nginx.conf
http {
        # ......

        sub_filter  '</head>' '<style type="text/css">html{ filter:progid:DXImageTransform.Microsoft.BasicImage(grayscale=1); -webkit-filter: grayscale(100%); filter: url("data:image/svg+xml;utf8,<svg xmlns=\'http://www.w3.org/2000/svg\'><filter id=\'grayscale\'><feColorMatrix type=\'matrix\' values=\'0.3333 0.3333 0.3333 0 0 0.3333 0.3333 0.3333 0 0 0.3333 0.3333 0.3333 0 0 0 0 0 1 0\'/></filter></svg>#grayscale"); /* Firefox 10+, Firefox on Android */

Zenuncl

# -*- coding: utf-8 -*
#########################################################################
#假设类似CTRL + A这样的组合按键算一次
#实现思路：
#首先开始直接输出A的个数必须为3，4，5中的一个，因为1和2对其做复制得不偿失，而6的时候已经相当于3个A作一次复制
#（在测试时发现使M最大的情况中直接输出5个A的情况没有出现过，但是没有找到什么理由不去考虑5个A，也许N足够大会用到5？）
#其次，输出A后需要紧接着作一次“全选复制粘贴”
#第三，再往后需要“全选复制粘贴”和单独“粘贴”做任意顺序组合，找出实现最大化的情况
#ps：这个程序在跑到N = 38的时候我的笔记本就很吃力了，所以只测试了38以下
#ps：发现规律：按键基本形式为4A(or 3A) 3 2 3 2 3 2 。。。（4A代表直接输出4个A，3代表全选复制粘贴，2代表单独两次粘贴）

Zenuncl

git_inspect_branch() {
    git branch 2> /dev/null | grep ^* | sed 's/^\* \(.*\)$/:\1/g'
}

git_inspect_added() {
    [[ $(git status 2> /dev/null | grep 'Untracked files:') != '' ]] && echo '+'
}

git_inspect_modified() {
    [[ $(git status 2> /dev/null | grep 'modified:')        != '' ]] && echo '*'