老生常谈PHP中的数据结构:DS扩展


Posted in PHP onJuly 17, 2017

PHP7以上才能安装和使用该数据结构扩展,安装比较简单:

1. 运行命令 pecl install ds

2. 在php.ini中添加 extension=ds.so

3. 重启PHP或重载配置

Collection Interface:包含本库中所有数据结构通用功能的基本interface。 It guarantees that all structures are traversable, countable, and can be converted to json using json_encode().

Ds\Collection implements Traversable , Countable , JsonSerializable {
/* 方法 */
abstract public void clear ( void )
abstract public Ds\Collection copy ( void )
abstract public bool isEmpty ( void )
abstract public array toArray ( void )
}

Hashable Interface:which allows objects to be used as keys.

Ds\Hashable {
/* 方法 */
abstract public bool equals ( object $obj )
abstract public mixed hash ( void )
}

Sequence Interface:A Sequence 相当于一个一维的数字key数组, with the exception of a few characteristics:

Values will always be indexed as [0, 1, 2, …, size - 1].

Only allowed to access values by index in the range [0, size - 1].

Use cases:

Wherever you would use an array as a list (not concerned with keys).

A more efficient alternative to SplDoublyLinkedList and SplFixedArray.

Vector Class:Vector是自动增长和收缩的连续缓冲区中的一系列值。它是最有效的顺序结构,值的索引直接映射到缓冲区中索引,增长因子不绑定到特定的倍数或指数。其具有以下优缺点:

Supports array syntax (square brackets).

Uses less overall memory than an array for the same number of values.

Automatically frees allocated memory when its size drops low enough.

Capacity does not have to be a power of 2.

get(), set(), push(), pop() are all O(1).

但是 shift(), unshift(), insert() and remove() are all O(n).

Ds\Vector::allocate — Allocates enough memory for a required capacity.
Ds\Vector::apply — Updates all values by applying a callback function to each value.
Ds\Vector::capacity — Returns the current capacity.
Ds\Vector::clear — Removes all values.
Ds\Vector::__construct — Creates a new instance.
Ds\Vector::contains — Determines if the vector contains given values.
Ds\Vector::copy — Returns a shallow copy of the vector.
Ds\Vector::count — Returns the number of values in the collection.
Ds\Vector::filter — Creates a new vector using a callable to determine which values to include.
Ds\Vector::find — Attempts to find a value's index.
Ds\Vector::first — Returns the first value in the vector.
Ds\Vector::get — Returns the value at a given index.
Ds\Vector::insert — Inserts values at a given index.
Ds\Vector::isEmpty — Returns whether the vector is empty
Ds\Vector::join — Joins all values together as a string.
Ds\Vector::jsonSerialize — Returns a representation that can be converted to JSON.
Ds\Vector::last — Returns the last value.
Ds\Vector::map — Returns the result of applying a callback to each value.
Ds\Vector::merge — Returns the result of adding all given values to the vector.
Ds\Vector::pop — Removes and returns the last value.
Ds\Vector::push — Adds values to the end of the vector.
Ds\Vector::reduce — Reduces the vector to a single value using a callback function.
Ds\Vector::remove — Removes and returns a value by index.
Ds\Vector::reverse — Reverses the vector in-place.
Ds\Vector::reversed — Returns a reversed copy.
Ds\Vector::rotate — Rotates the vector by a given number of rotations.
Ds\Vector::set — Updates a value at a given index.
Ds\Vector::shift — Removes and returns the first value.
Ds\Vector::slice — Returns a sub-vector of a given range.
Ds\Vector::sort — Sorts the vector in-place.
Ds\Vector::sorted — Returns a sorted copy.
Ds\Vector::sum — Returns the sum of all values in the vector.
Ds\Vector::toArray — Converts the vector to an array.
Ds\Vector::unshift — Adds values to the front of the vector.

Deque Class:“双端队列”的缩写,也用于Ds\Queue中,拥有head、tail两个指针。The pointers can “wrap around” the end of the buffer, which avoids the need to move other values around to make room. This makes shift and unshift very fast —  something a Ds\Vector can't compete with. 其具有以下优缺点:

Supports array syntax (square brackets).

Uses less overall memory than an array for the same number of values.

Automatically frees allocated memory when its size drops low enough.

get(), set(), push(), pop(), shift(), and unshift() are all O(1).

但Capacity must be a power of 2.insert() and remove() are O(n).

Map Class:键值对的连续集合,几乎与数组相同。键可以是任何类型,但必须是唯一的。如果使用相同的键添加到map中,则将替换值。其拥有以下优缺点:

Keys and values can be any type, including objects.

Supports array syntax (square brackets).

Insertion order is preserved.

Performance and memory efficiency is very similar to an array.

Automatically frees allocated memory when its size drops low enough.

Can't be converted to an array when objects are used as keys.

Pair Class:A pair is used by Ds\Map to pair keys with values.

Ds\Pair implements JsonSerializable {
/* 方法 */
public __construct ([ mixed $key [, mixed $value ]] )
}

Set Class:唯一值序列。 This implementation uses the same hash table as Ds\Map, where values are used as keys and the mapped value is ignored.其拥有以下优缺点:

Values can be any type, including objects.

Supports array syntax (square brackets).

Insertion order is preserved.

Automatically frees allocated memory when its size drops low enough.

add(), remove() and contains() are all O(1).

但Doesn't support push(), pop(), insert(), shift(), or unshift(). get() is O(n) if there are deleted values in the buffer before the accessed index, O(1) otherwise.

Stack Class: “last in, first out”集合,只允许在结构顶部进行访问和迭代。

Ds\Stack implements Ds\Collection {
/* 方法 */
public void allocate ( int $capacity )
public int capacity ( void )
public void clear ( void )
public Ds\Stack copy ( void )
public bool isEmpty ( void )
public mixed peek ( void )
public mixed pop ( void )
public void push ([ mixed $...values ] )
public array toArray ( void )
}

Queue Class:“first in, first out”集合,只允许在结构前端进行访问和迭代。

Ds\Queue implements Ds\Collection {
/* Constants */
const int MIN_CAPACITY = 8 ;
/* 方法 */
public void allocate ( int $capacity )
public int capacity ( void )
public void clear ( void )
public Ds\Queue copy ( void )
public bool isEmpty ( void )
public mixed peek ( void )
public mixed pop ( void )
public void push ([ mixed $...values ] )
public array toArray ( void )
}

PriorityQueue Class:优先级队列与队列是非常相似的,但值以指定的优先级被推入队列,优先级最高的值总是位于队列的前面,同优先级元素“先入先出”顺序任然保留。在一个PriorityQueue上递代是具有破坏性的,相当于连续弹出操作直到队列为空。Implemented using a max heap.

Ds\PriorityQueue implements Ds\Collection {
/* Constants */
const int MIN_CAPACITY = 8 ;
/* 方法 */
public void allocate ( int $capacity )
public int capacity ( void )
public void clear ( void )
public Ds\PriorityQueue copy ( void )
public bool isEmpty ( void )
public mixed peek ( void )
public mixed pop ( void )
public void push ( mixed $value , int $priority )
public array toArray ( void )
}

以上这篇老生常谈PHP中的数据结构:DS扩展就是小编分享给大家的全部内容了,希望能给大家一个参考,也希望大家多多支持三水点靠木。

PHP 相关文章推荐
关于PHP中操作MySQL数据库的一些要注意的问题
Oct 09 PHP
PHP系统流量分析的程序
Oct 09 PHP
PHP脚本的10个技巧(4)
Oct 09 PHP
PHP 程序授权验证开发思路
Jul 09 PHP
PHP 引用是个坏习惯
Mar 12 PHP
用Json实现PHP与JavaScript间数据交换的方法详解
Jun 20 PHP
smarty内置函数section的用法
Jan 22 PHP
php验证码生成代码
Nov 11 PHP
PHP实现负载均衡的加权轮询方法分析
Aug 22 PHP
ThinkPHP3.2.3框架Memcache缓存使用方法实例总结
Apr 15 PHP
TP5框架实现签到功能的方法分析
Apr 05 PHP
php实现商城购物车的思路和源码分析
Jul 23 PHP
PHPstorm快捷键(分享)
Jul 17 #PHP
利用PHP_XLSXWriter代替PHPExcel的方法示例
Jul 16 #PHP
PHP常用操作类之通信数据封装类的实现
Jul 16 #PHP
Laravel网站打开速度优化的方法汇总
Jul 16 #PHP
PHP实现创建微信自定义菜单的方法示例
Jul 14 #PHP
PHP微信公众号开发之微信红包实现方法分析
Jul 14 #PHP
PHP机器学习库php-ml的简单测试和使用方法
Jul 14 #PHP
You might like
php 获取百度的热词数据的代码
2012/02/18 PHP
深入解析PHP的引用计数机制
2013/06/14 PHP
PHP多进程之pcntl_fork的实例详解
2017/10/15 PHP
PHP面向对象五大原则之接口隔离原则(ISP)详解
2018/04/04 PHP
Nigma vs Liquid BO3 第一场2.13
2021/03/10 DOTA
简单的无缝滚动程序-仅几行代码
2007/05/08 Javascript
prototype Element学习笔记(篇一)
2008/10/26 Javascript
javascript 验证日期的函数
2010/03/18 Javascript
jQuery如何获取同一个类标签的所有值(默认无法获取)
2014/09/25 Javascript
浅谈angularjs module返回对象的坑(推荐)
2016/10/21 Javascript
js实现文字跑马灯效果
2017/02/23 Javascript
基于JS实现限时抢购倒计时间表代码
2017/05/09 Javascript
React-Native实现ListView组件之上拉刷新实例(iOS和Android通用)
2017/07/11 Javascript
AngularJS实现的根据数量与单价计算总价功能示例
2017/12/26 Javascript
微信小程序嵌入腾讯视频源过程详解
2019/08/08 Javascript
Vue开发环境中修改端口号的实现方法
2019/08/15 Javascript
解决layui的table插件无法多层级获取json数据的问题
2019/09/19 Javascript
微信小程序后端(java)开发流程的详细步骤
2019/11/13 Javascript
ant-design-vue 时间选择器赋值默认时间的操作
2020/10/27 Javascript
Ant Design Vue table中列超长显示...并加提示语的实例
2020/10/31 Javascript
Python自动扫雷实现方法
2015/07/25 Python
利用Python如何生成便签图片详解
2018/07/09 Python
Python类的继承、多态及获取对象信息操作详解
2019/02/28 Python
python随机生成大小写字母数字混合密码(仅20行代码)
2020/02/01 Python
python目标检测给图画框,bbox画到图上并保存案例
2020/03/10 Python
CSS3 实现飘动的云朵动画
2020/12/01 HTML / CSS
HTML5单页面手势滑屏切换原理
2016/03/21 HTML / CSS
h5实现获取用户地理定位的实例代码
2017/07/17 HTML / CSS
小学体育教学反思
2014/01/31 职场文书
幼儿园元旦家长感言
2014/02/27 职场文书
护理目标管理责任书
2014/07/25 职场文书
社区四风存在问题及整改措施
2014/10/26 职场文书
工地材料员岗位职责
2015/04/11 职场文书
python pyhs2 的安装操作
2021/04/07 Python
MySQL中in和exists区别详解
2021/06/03 MySQL
通过shell脚本对mysql的增删改查及my.cnf的配置
2021/07/07 MySQL