<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>CanleiSky Blog &#187; Java</title>
	<atom:link href="http://www.oioq.com/weblog/category/java/feed" rel="self" type="application/rss+xml" />
	<link>http://www.oioq.com</link>
	<description>生活的理想是为了理想的生活.</description>
	<lastBuildDate>Sun, 30 May 2010 09:14:05 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>Java版Discuz! AuthCode</title>
		<link>http://www.oioq.com/weblog/20100309/java%e7%89%88discuz-authcode</link>
		<comments>http://www.oioq.com/weblog/20100309/java%e7%89%88discuz-authcode#comments</comments>
		<pubDate>Mon, 08 Mar 2010 16:31:20 +0000</pubDate>
		<dc:creator>CanleiSky</dc:creator>
				<category><![CDATA[Java]]></category>

		<guid isPermaLink="false">http://www.oioq.com/?p=70</guid>
		<description><![CDATA[package discuz;
import java.security.MessageDigest;
import java.security.NoSuchAlgorithmException;
import java.util.Calendar;
import java.util.Random;
import sun.misc.BASE64Decoder;
import sun.misc.BASE64Encoder;
public class AuthCode {
    static BASE64Encoder encoder = new BASE64Encoder();
    static BASE64Decoder decoder = new BASE64Decoder();
    public enum DiscuzAuthcodeMode {
        Encode, Decode
    };
    public static void main(String[] args){
        System.out.print(&#8221;["+authcodeDecode("672d+9y5HQ0zqsONrBpSv5HwfTBASYjqVPyQ4O3RMN7xQcg", "soonyo")+"]&#8220;);
    }
    public static String CutString(String str, int startIndex, int length){
        if (startIndex &#62;= 0) {
            if (length &#60; [...]]]></description>
			<content:encoded><![CDATA[<p>package discuz;</p>
<p>import java.security.MessageDigest;<br />
import java.security.NoSuchAlgorithmException;<br />
import java.util.Calendar;<br />
import java.util.Random;<br />
import sun.misc.BASE64Decoder;<br />
import sun.misc.BASE64Encoder;</p>
<p>public class AuthCode {<br />
    static BASE64Encoder encoder = new BASE64Encoder();<br />
    static BASE64Decoder decoder = new BASE64Decoder();<br />
    public enum DiscuzAuthcodeMode {<br />
        Encode, Decode<br />
    };</p>
<p>    public static void main(String[] args){<br />
        System.out.print(&#8221;["+authcodeDecode("672d+9y5HQ0zqsONrBpSv5HwfTBASYjqVPyQ4O3RMN7xQcg", "soonyo")+"]&#8220;);<br />
    }</p>
<p>    public static String CutString(String str, int startIndex, int length){<br />
        if (startIndex &gt;= 0) {<br />
            if (length &lt; 0) {<br />
                length = length * -1;<br />
                if(startIndex &#8211; length &lt; 0) {<br />
                    length = startIndex;<br />
                    startIndex = 0;<br />
                } else {<br />
                    startIndex = startIndex &#8211; length;<br />
                }<br />
            }</p>
<p>            if (startIndex &gt; str.length()) {<br />
                return &#8220;&#8221;;<br />
            }</p>
<p>        } else {<br />
            if (length &lt; 0) {<br />
                return &#8220;&#8221;;<br />
            } else {<br />
                if (length + startIndex &gt; 0) {<br />
                    length = length + startIndex;<br />
                    startIndex = 0;<br />
                } else {<br />
                    return &#8220;&#8221;;<br />
                }<br />
            }<br />
        }</p>
<p>        if (str.length() &#8211; startIndex &lt; length) {</p>
<p>            length = str.length() &#8211; startIndex;<br />
        }</p>
<p>        return str.substring(startIndex, startIndex + length);<br />
    }</p>
<p>    public static String CutString(String str, int startIndex) {<br />
        return CutString(str, startIndex, str.length());<br />
    }</p>
<p>    public static String MD5(String pass) {<br />
        byte[] defaultBytes = pass.getBytes();<br />
        try{<br />
             MessageDigest algorithm = MessageDigest.getInstance(&#8221;MD5&#8243;);<br />
             algorithm.reset();<br />
             algorithm.update(defaultBytes);<br />
             byte messageDigest[] = algorithm.digest();</p>
<p>             StringBuffer hexString = new StringBuffer();<br />
             for (int i=0;i&lt;messageDigest.length;i++) {<br />
            String hex = Integer.toHexString(0xFF &amp; messageDigest[i]);<br />
            if(hex.length()==1)<br />
            hexString.append(&#8221;0&#8243; );</p>
<p>            hexString.append(hex);<br />
             }<br />
             return hexString.toString();<br />
        }<br />
        catch(NoSuchAlgorithmException nsae){<br />
        }</p>
<p>        return &#8220;&#8221;;<br />
    }</p>
<p>    public static boolean StrIsNullOrEmpty(String str) {<br />
        //#if NET1<br />
        if (str == null || str.trim().equals(&#8221;")) {<br />
            return true;<br />
        }</p>
<p>        return false;<br />
    }</p>
<p>    static private byte[] GetKey(byte[] pass, int kLen) {<br />
        byte[] mBox = new byte[kLen];</p>
<p>        for (int i = 0; i &lt; kLen; i++) {<br />
            mBox[i] = (byte) i;<br />
        }</p>
<p>        int j = 0;<br />
        for (int i = 0; i &lt; kLen; i++) {</p>
<p>            j = (j + (int) ((mBox[i] + 256) % 256) + pass[i % pass.length])<br />
                    % kLen;</p>
<p>            byte temp = mBox[i];<br />
            mBox[i] = mBox[j];<br />
            mBox[j] = temp;<br />
        }</p>
<p>        return mBox;<br />
    }</p>
<p>    public static String RandomString(int lens) {<br />
        String[] CharArray = {&#8221;a&#8221;, &#8220;b&#8221;, &#8220;c&#8221;, &#8220;d&#8221;, &#8220;e&#8221;, &#8220;f&#8221;, &#8220;g&#8221;, &#8220;h&#8221;, &#8220;j&#8221;, &#8220;k&#8221;, &#8220;l&#8221;, &#8220;m&#8221;, &#8220;n&#8221;, &#8220;o&#8221;, &#8220;p&#8221;, &#8220;q&#8221;, &#8220;r&#8221;, &#8220;s&#8221;, &#8220;t&#8221;, &#8220;u&#8221;, &#8220;v&#8221;, &#8220;w&#8221;, &#8220;x&#8221;, &#8220;y&#8221;, &#8220;z&#8221;, &#8220;0&#8243; , &#8220;1&#8243; , &#8220;2&#8243; , &#8220;3&#8243; , &#8220;4&#8243; , &#8220;5&#8243; , &#8220;6&#8243; , &#8220;7&#8243; , &#8220;8&#8243; , &#8220;9&#8243; };<br />
        int clens = CharArray.length;<br />
        String sCode = &#8220;&#8221;;<br />
        Random random = new Random();<br />
        for (int i = 0; i &lt; lens; i++) {<br />
            sCode += CharArray[Math.abs(random.nextInt(clens))];<br />
        }<br />
        return sCode;<br />
    }</p>
<p>    public static String authcodeEncode(String source, String key, int expiry) {<br />
        return authcode(source, key, DiscuzAuthcodeMode.Encode, expiry);</p>
<p>    }</p>
<p>    public static String authcodeEncode(String source, String key) {<br />
        return authcode(source, key, DiscuzAuthcodeMode.Encode, 0);</p>
<p>    }</p>
<p>    public static String authcodeDecode(String source, String key) {<br />
        return authcode(source, key, DiscuzAuthcodeMode.Decode, 0);</p>
<p>    }</p>
<p>    private static String authcode(String source, String key,<br />
            DiscuzAuthcodeMode operation, int expiry) {<br />
        try {<br />
            if (source == null || key == null) {<br />
                return &#8220;&#8221;;<br />
            }</p>
<p>            int ckey_length = 4;<br />
            String keya, keyb, keyc, cryptkey, result;</p>
<p>            key = MD5(key);</p>
<p>            keya = MD5(CutString(key, 0, 16));</p>
<p>            keyb = MD5(CutString(key, 16, 16));</p>
<p>            keyc = ckey_length &gt; 0 ? (operation == DiscuzAuthcodeMode.Decode ? CutString(<br />
                    source, 0, ckey_length)<br />
                    : RandomString(ckey_length))<br />
                    : &#8220;&#8221;;</p>
<p>            cryptkey = keya + MD5(keya + keyc);</p>
<p>            if (operation == DiscuzAuthcodeMode.Decode) {<br />
                byte[] temp;<br />
                temp = decoder.decodeBuffer(CutString(source, ckey_length));<br />
                result = new String(RC4(temp, cryptkey));<br />
                if (CutString(result, 10, 16).equals(CutString(MD5(CutString(result, 26) + keyb), 0, 16))) {<br />
                    return CutString(result, 26);<br />
                } else {<br />
                    temp = decoder.decodeBuffer(CutString(source+&#8221;=&#8221;, ckey_length));<br />
                    result = new String(RC4(temp, cryptkey));<br />
                    if (CutString(result, 10, 16).equals(CutString(MD5(CutString(result, 26) + keyb), 0, 16))) {<br />
                        return CutString(result, 26);<br />
                    } else {<br />
                        temp = decoder.decodeBuffer(CutString(source+&#8221;==&#8221;, ckey_length));<br />
                        result = new String(RC4(temp, cryptkey));<br />
                        if (CutString(result, 10, 16).equals(CutString(MD5(CutString(result, 26) + keyb), 0, 16))) {<br />
                            return CutString(result, 26);<br />
                        }else{<br />
                            return &#8220;&#8221;;<br />
                        }<br />
                    }<br />
                }<br />
            } else {<br />
                source = &#8220;0000000000&#8243; + CutString(MD5(source + keyb), 0, 16)<br />
                        + source;</p>
<p>                byte[] temp = RC4(source.getBytes(&#8221;GBK&#8221;), cryptkey);</p>
<p>                return keyc + encoder.encodeBuffer(temp);</p>
<p>            }<br />
        } catch (Exception e) {<br />
            return &#8220;&#8221;;<br />
        }</p>
<p>    }</p>
<p>    private static byte[] RC4(byte[] input, String pass) {<br />
        if (input == null || pass == null)<br />
            return null;</p>
<p>        byte[] output = new byte[input.length];<br />
        byte[] mBox = GetKey(pass.getBytes(), 256);</p>
<p>        int i = 0;<br />
        int j = 0;</p>
<p>        for (int offset = 0; offset &lt; input.length; offset++) {<br />
            i = (i + 1) % mBox.length;<br />
            j = (j + (int) ((mBox[i] + 256) % 256)) % mBox.length;</p>
<p>            byte temp = mBox[i];<br />
            mBox[i] = mBox[j];<br />
            mBox[j] = temp;<br />
            byte a = input[offset];</p>
<p>            byte b = mBox[(toInt(mBox[i]) + toInt(mBox[j])) % mBox.length];</p>
<p>            output[offset] = (byte) ((int) a ^ (int) toInt(b));<br />
        }</p>
<p>        return output;<br />
    }</p>
<p>    public static int toInt(byte b) {<br />
        return (int) ((b + 256) % 256);<br />
    }</p>
<p>    public long getUnixTimestamp() {<br />
        Calendar cal = Calendar.getInstance();<br />
        return cal.getTimeInMillis() / 1000;<br />
    }</p>
<p>}</p>
<p>记录一下，挺实有的函数，加解密从方式上看貌似与PHP版不同，但结果出来是一样滴~</p>
]]></content:encoded>
			<wfw:commentRss>http://www.oioq.com/weblog/20100309/java%e7%89%88discuz-authcode/feed</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
		<item>
		<title>正则零宽断言之双单标签混合解析</title>
		<link>http://www.oioq.com/weblog/20100108/%e6%ad%a3%e5%88%99%e9%9b%b6%e5%ae%bd%e6%96%ad%e8%a8%80%e4%b9%8b%e5%8f%8c%e5%8d%95%e6%a0%87%e7%ad%be%e6%b7%b7%e5%90%88%e8%a7%a3%e6%9e%90</link>
		<comments>http://www.oioq.com/weblog/20100108/%e6%ad%a3%e5%88%99%e9%9b%b6%e5%ae%bd%e6%96%ad%e8%a8%80%e4%b9%8b%e5%8f%8c%e5%8d%95%e6%a0%87%e7%ad%be%e6%b7%b7%e5%90%88%e8%a7%a3%e6%9e%90#comments</comments>
		<pubDate>Fri, 08 Jan 2010 12:39:25 +0000</pubDate>
		<dc:creator>eays</dc:creator>
				<category><![CDATA[Java]]></category>
		<category><![CDATA[JavaScript]]></category>
		<category><![CDATA[PHP]]></category>

		<guid isPermaLink="false">http://www.oioq.com/?p=65</guid>
		<description><![CDATA[断言用来声明一个应该为真的事实。正则表达式中只有当断言为真时才会继续进行匹配。
正则表达式内容：
\{Tag:([a-zA-z0-9]*)\s([^}\/]*)\}(((?!\{\/Tag:)[\s\S])*?)\{/Tag:([a-zA-z0-9]*)\}
匹配字符串1：
{Tag:test param=&#8221;1&#8243;}test{/Tag:test}
和字符串2：
{Tag:test param=&#8221;1&#8243;}{Tag:test2 param=&#8221;2&#8243;/}{/Tag:test}
匹配字符串1非常简单，字符串2相对困难些，思考了一下午，看来只有零宽断言能解决，一时没体会到零宽断言的意思。
正则零宽断言部份：(((?!\{\/Tag:)[\s\S])*?)
中文说明：：(((?!排除的字符)匹配所有表达式)无限次但尽可能少重复)
?!    是 负向零宽先行断言标志，(((?!\{\/Tag:)[\s\S])*?) 的意思是 断言匹配内容为{/Tag:外的所有内容，后跟\s\S括号*表示当断言为真时匹配所有内容。
]]></description>
			<content:encoded><![CDATA[<p>断言用来声明一个应该为真的事实。正则表达式中只有当断言为真时才会继续进行匹配。</p>
<p>正则表达式内容：<br />
\{Tag:([a-zA-z0-9]*)\s([^}\/]*)\}(((?!\{\/Tag:)[\s\S])*?)\{/Tag:([a-zA-z0-9]*)\}</p>
<p>匹配字符串1：<br />
{Tag:test param=&#8221;1&#8243;}test{/Tag:test}</p>
<p>和字符串2：<br />
{Tag:test param=&#8221;1&#8243;}{Tag:test2 param=&#8221;2&#8243;/}{/Tag:test}</p>
<p>匹配字符串1非常简单，字符串2相对困难些，思考了一下午，看来只有零宽断言能解决，一时没体会到零宽断言的意思。</p>
<p>正则零宽断言部份：(((?!\{\/Tag:)[\s\S])*?)</p>
<p>中文说明：：(((?!排除的字符)匹配所有表达式)无限次但尽可能少重复)</p>
<p>?!    是 负向零宽先行断言标志，(((?!\{\/Tag:)[\s\S])*?) 的意思是 断言匹配内容为{/Tag:外的所有内容，后跟\s\S括号*表示当断言为真时匹配所有内容。</p>
]]></content:encoded>
			<wfw:commentRss>http://www.oioq.com/weblog/20100108/%e6%ad%a3%e5%88%99%e9%9b%b6%e5%ae%bd%e6%96%ad%e8%a8%80%e4%b9%8b%e5%8f%8c%e5%8d%95%e6%a0%87%e7%ad%be%e6%b7%b7%e5%90%88%e8%a7%a3%e6%9e%90/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Socket 编程</title>
		<link>http://www.oioq.com/weblog/20090905/socket-%e7%bc%96%e7%a8%8b</link>
		<comments>http://www.oioq.com/weblog/20090905/socket-%e7%bc%96%e7%a8%8b#comments</comments>
		<pubDate>Sat, 05 Sep 2009 04:43:33 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Java]]></category>

		<guid isPermaLink="false">http://www.oioq.com/?p=5</guid>
		<description><![CDATA[在windows上相信不少程序员都知道Socket,winsock应该就是windows socket的缩写。
Socket是个强大的东东，我也做过Socket编程，Socket之所以强大是因为它是基于TCP/IP协议的编程方式，如今品种繁多的协议也只不过是通过一定方式封装了TCP/IP协议的结果，我们可以使用Socket来编程，也就可以通过封装它而得到一个新的协议，所以Socket的灵活性是非常强的，基本可以满足任何网络通信应用。
]]></description>
			<content:encoded><![CDATA[<p>在windows上相信不少程序员都知道Socket,winsock应该就是windows socket的缩写。</p>
<p>Socket是个强大的东东，我也做过Socket编程，Socket之所以强大是因为它是基于TCP/IP协议的编程方式，如今品种繁多的协议也只不过是通过一定方式封装了TCP/IP协议的结果，我们可以使用Socket来编程，也就可以通过封装它而得到一个新的协议，所以Socket的灵活性是非常强的，基本可以满足任何网络通信应用。</p>
]]></content:encoded>
			<wfw:commentRss>http://www.oioq.com/weblog/20090905/socket-%e7%bc%96%e7%a8%8b/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
