<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<head><meta forua="true" http-equiv="Cache-Control" content="max-age=0" /></head>
<card title="[times33哈希算法] php-perl哈希算法实现" id="card1">
<p> 游客</p><p>
标题:[times33哈希算法] php-perl哈希算法实现<br/>
正文:<br/>
代码如下:<br/>APR_DECLARE_NONSTD(unsigned int) apr_hashfunc_default(const char *char_key,<br/>                                                      apr_ssize_t *klen)<br/>{<br/>    unsigned int hash = 0;<br/>    const unsigned char *key = (const unsigned char *)char_key;<br/>    const unsigned char *p;<br/>    apr_ssize_t i;<br/><br/>    /*<br/>     * This is the popular `times 33' hash algorithm which is used by<br/>     * perl and also appears in Berkeley DB. This is one of the best<br/>     * known hash functions for strings because it is both comput<br/><a href="http://camnpr.com/wap.asp?mode=WAP&amp;act=View&amp;id=882&amp;Page=1">[&lt;&lt;]</a><a href="http://camnpr.com/wap.asp?mode=WAP&amp;act=View&amp;id=882&amp;Page=1">[[1]]</a><a href="http://camnpr.com/wap.asp?mode=WAP&amp;act=View&amp;id=882&amp;Page=2">[2]</a><a href="http://camnpr.com/wap.asp?mode=WAP&amp;act=View&amp;id=882&amp;Page=3">[3]</a><a href="http://camnpr.com/wap.asp?mode=WAP&amp;act=View&amp;id=882&amp;Page=6">[&gt;&gt;]</a><br/>
<br/>
<a href="wap.asp?act=Com&amp;id=882">查看评论(0)</a><br/>
<a href="wap.asp?act=AddCom&amp;inpId=882">发表评论</a><br/><br/>

<br/>

<br/>
<a href="http://camnpr.com/wap.asp">首页</a>
</p>
</card>
</wml>