老生常谈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 相关文章推荐
php4的session功能评述(二)
Oct 09 PHP
PHP 内存缓存加速功能memcached安装与用法
Sep 03 PHP
使用HMAC-SHA1签名方法详解
Jun 26 PHP
使用PHP Socket写的POP3类
Oct 30 PHP
PHP整数取余返回负数的相关解决方法
May 15 PHP
thinkphp模板输出技巧汇总
Nov 24 PHP
PHP模板引擎smarty详细介绍
May 26 PHP
编写PHP脚本过滤用户上传的图片
Jul 03 PHP
Linux安装配置php环境的方法
Jan 14 PHP
PHP Include文件实例讲解
Feb 15 PHP
php判断某个方法是否存在函数function_exists (),method_exists()与is_callable()区别与用法解析
Apr 20 PHP
PHP设计模式入门之迭代器模式原理与实现方法分析
Apr 26 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 什么是PEAR?(第三篇)
2009/03/19 PHP
php socket客户端及服务器端应用实例
2014/07/04 PHP
PHP中比较时间大小实例
2014/08/21 PHP
Yii2中使用join、joinwith多表关联查询
2016/06/30 PHP
PHP实现微信提现(企业付款到零钱)
2019/08/01 PHP
通过PHP实现用户注册后邮箱验证激活
2020/11/10 PHP
JQuery,Extjs,YUI,Prototype,Dojo 等JS框架的区别和应用场景简述
2010/04/15 Javascript
js日历功能对象
2012/01/12 Javascript
javascript自然分类法算法实现代码
2013/10/11 Javascript
动态加载jquery库的方法
2014/02/12 Javascript
JavaScript中的闭包介绍
2015/03/15 Javascript
laypage分页控件使用实例详解
2016/05/19 Javascript
使用nodejs爬取前程无忧前端技能排行
2017/05/06 NodeJs
js轮播图的插件化封装详解
2017/07/17 Javascript
基于JavaScript实现数码时钟效果
2020/03/30 Javascript
JavaScript中关于class的调用方法
2017/11/28 Javascript
js登录滑动验证的实现(不滑动无法登陆)
2018/01/03 Javascript
在vue中使用css modules替代scroped的方法
2018/03/10 Javascript
JavaScript canvas实现雪花随机动态飘落
2020/02/08 Javascript
[01:42]DOTA2 – 虚无之灵
2019/08/25 DOTA
Python实现动态图解析、合成与倒放
2018/01/18 Python
python logging日志模块以及多进程日志详解
2018/04/18 Python
python list是否包含另一个list所有元素的实例
2018/05/04 Python
python opencv3实现人脸识别(windows)
2018/05/25 Python
python3 实现验证码图片切割的方法
2018/12/07 Python
python3 字符串/列表/元组(str/list/tuple)相互转换方法及join()函数的使用
2019/04/03 Python
python自动化之Ansible的安装教程
2019/06/13 Python
Python pandas实现excel工作表合并功能详解
2019/08/29 Python
python连接打印机实现打印文档、图片、pdf文件等功能
2020/02/07 Python
实例代码讲解Python 线程池
2020/08/24 Python
介绍一下SQL注入攻击的种类和防范手段
2012/02/18 面试题
高一物理教学反思
2014/01/24 职场文书
2015年治庸问责工作总结
2015/07/27 职场文书
公司借款担保书
2015/09/22 职场文书
CSS实现多个元素在盒子内两端对齐效果
2021/03/30 HTML / CSS
实战 快速定位MySQL的慢SQL
2022/03/22 MySQL