拉链法解决Hash节点冲突相关问题
hash
php
冲突
存储
相关
节点
解决
问题
<?<span>php </span><span>/*</span><span> * hash::拉链法解决hash节点存储冲突问题 * ::2014-07-02 * ::Small_Kind </span><span>*/</span> <span>class</span><span> small_hash { </span><span>private</span> <span>$size</span> = 20;<span>//</span><span>hash节点大小</span> <span>private</span> <span>$zone</span> = <span>null</span>;<span>//</span><span>hash空间 //实例化函数,并设置一个初始hash节点大小,如果节点大小为null,则为默认节点大小</span> <span>final</span> <span>public</span> <span>function</span> __construct(<span>$size</span> = <span>null</span><span>){ </span><span>if</span>(!<span>is_null</span>(<span>$size</span>))<span>$this</span>->size = <span>$size</span>;<span>// </span> <span>$this</span>->zone = <span>new</span> SplFixedArray(<span>$this</span>->size);<span>// </span><span> } </span><span>//</span><span>times33::计算key的hash值,并进行节点大小的取模工作 //::实现流程1、计算key长度2、循环长度,并将每个字符转换成asicc码后*33</span> <span>final</span> <span>private</span> <span>function</span> hash_times33(<span>$key</span><span>){ </span><span>if</span>(<span>empty</span>(<span>$key</span>))<span>return</span> <span>false</span>;<span>//</span><span>key==>empty</span> <span>$strlen</span> = <span>strlen</span>(<span>$key</span><span>); </span><span>$hash_val</span> = 0<span>; </span><span>for</span>(<span>$i</span>=0;<span>$i</span><<span>$strlen</span>;<span>$i</span>++<span>){ </span><span>$hash_val</span> += (<span>$hash_val</span> * 33) + <span>ord</span>(<span>$key</span>{<span>$i</span><span>}); } </span><span>return</span> (<span>$hash_val</span> & 0x7FFFFFFF) % <span>$this</span>-><span>size; } </span><span>//</span><span>set::通过拉链法进行key->value对应的值设置</span> <span>final</span> <span>public</span> <span>function</span> set(<span>$key</span>,<span>$value</span><span>){ </span><span>if</span>(<span>empty</span>(<span>$key</span>) || <span>empty</span>(<span>$value</span>))<span>return</span> <span>false</span>;<span>//</span><span>empty</span> <span>$index</span> = <span>$this</span>->hash_times33(<span>$key</span><span>); </span><span>//</span><span>如果不存在此节点的数据,则向该节点添加第一组数据</span> <span>if</span>(<span>isset</span>(<span>$this</span>->zone[<span>$index</span><span>])){ </span><span>//</span><span>key、value、拉链对象[当该节点已存在1个或多组数据的时候,将之前的数据赋值给最新的一组data] //也就是说在查询时候相当于一种后进先出的原则,不断将最新的数据放在最前面,以此形成一种阶梯形式</span> <span>$data</span> = <span>array</span>(<span>$key</span>,<span>serialize</span>(<span>$value</span>),<span>$this</span>->zone[<span>$index</span><span>]); }</span><span>else</span><span>{ </span><span>$data</span> = <span>array</span>(<span>$key</span>,<span>serialize</span>(<span>$value</span>),<span>null</span>);<span>//</span><span>key、value、拉链对象[当该节点是第一次有值的时候,拉链对象为null]</span> <span> } </span><span>return</span> <span>$this</span>->zone[<span>$index</span>] = <span>$data</span>;<span>//</span><span>最后将完整的data赋值给该节点</span> <span> } </span><span>//</span><span>get::通过key获取对应hash后对应的的节点,循环该对象节点,然后通过key值匹配节点中的key,并将值进行返回</span> <span>final</span> <span>public</span> <span>function</span> get(<span>$key</span><span>){ </span><span>$index</span> = <span>$this</span>->hash_times33(<span>$key</span><span>); </span><span>$handle</span> = <span>new</span> stdClass();<span>//</span><span>初始化一个对象</span> <span>$handle</span> = (<span>array</span>)<span>$this</span>->zone[<span>$index</span>];<span>//</span><span>查询该key对应的节点</span> <span>return</span> <span>$this</span>->for_match(<span>$key</span>,<span>$handle</span>);<span>//</span><span>将对象数组送入匹配函数进行迭代查询</span> <span> } </span><span>//</span><span>for_match::通过key对handle进行迭代查询,查询到了即返回,没有查询到则返回一个false</span> <span>final</span> <span>public</span> <span>function</span> for_match(<span>$key</span>,<span>$handle</span><span>){ </span><span>if</span>(<span>is_array</span>(<span>$handle</span><span>)){ </span><span>if</span>(<span>$handle</span>[0] == <span>$key</span><span>){ </span><span>return</span> <span>unserialize</span>(<span>$handle</span>[1]);<span>//</span><span>如果找到值了,则对值进行返回</span> }<span>else</span><span>{ </span><span>return</span> <span>$this</span>->for_match(<span>$key</span>,<span>$handle</span>[2]);<span>//</span><span>否则继续迭代该方法</span> <span> } } } } </span><span>$hand</span> = <span>new</span><span> small_hash(); </span><span>$hand</span>->set('Libin','WWW.BAIDU.COM'<span>); </span><span>$hand</span>->set('d24150ddd','WWW.PHP.COM'<span>); </span><span>var_dump</span>(<span>$hand</span>->get('Libin'<span>)); </span><span>var_dump</span>(<span>$hand</span>->get('d24150ddd'<span>)); </span>?>
登录后复制
本站声明
本文内容由网友自发贡献,版权归原作者所有,本站不承担相应法律责任。如您发现有涉嫌抄袭侵权的内容,请联系admin@php.cn

热AI工具

Undresser.AI Undress
人工智能驱动的应用程序,用于创建逼真的裸体照片

AI Clothes Remover
用于从照片中去除衣服的在线人工智能工具。

Undress AI Tool
免费脱衣服图片

Clothoff.io
AI脱衣机

AI Hentai Generator
免费生成ai无尽的。

热门文章
R.E.P.O.能量晶体解释及其做什么(黄色晶体)
3 周前
By 尊渡假赌尊渡假赌尊渡假赌
R.E.P.O.最佳图形设置
3 周前
By 尊渡假赌尊渡假赌尊渡假赌
刺客信条阴影:贝壳谜语解决方案
1 周前
By DDD
R.E.P.O.如果您听不到任何人,如何修复音频
3 周前
By 尊渡假赌尊渡假赌尊渡假赌
在哪里可以找到原子中的起重机控制钥匙卡
1 周前
By DDD

热工具

记事本++7.3.1
好用且免费的代码编辑器

SublimeText3汉化版
中文版,非常好用

禅工作室 13.0.1
功能强大的PHP集成开发环境

Dreamweaver CS6
视觉化网页开发工具

SublimeText3 Mac版
神级代码编辑软件(SublimeText3)

PHP 8.4 带来了多项新功能、安全性改进和性能改进,同时弃用和删除了大量功能。 本指南介绍了如何在 Ubuntu、Debian 或其衍生版本上安装 PHP 8.4 或升级到 PHP 8.4

CakePHP 是 PHP 的开源框架。它的目的是使应用程序的开发、部署和维护变得更加容易。 CakePHP 基于类似 MVC 的架构,功能强大且易于掌握。模型、视图和控制器 gu
