《PHP教程:老生常談PHP中的數據結構:DS擴展》要點:
本文介紹了PHP教程:老生常談PHP中的數據結構:DS擴展,希望對您有用。如果有疑問,可以聯系我們。
PHP實戰PHP7以上才能安裝和使用該數據結構擴展,安裝比較簡單:
PHP實戰1. 運行命令 pecl install ds
PHP實戰2. 在php.ini中添加 extension=ds.so
PHP實戰3. 重啟PHP或重載配置
PHP實戰Collection Interface:包含本庫中所有數據結構通用功能的基本interface. It guarantees that all structures are traversable, countable, and can be converted to json using json_encode().
PHP實戰
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 )
}
PHP實戰Hashable Interface:which allows objects to be used as keys.
PHP實戰
Ds\Hashable {
/* 方法 */
abstract public bool equals ( object $obj )
abstract public mixed hash ( void )
}
PHP實戰Sequence Interface:A Sequence 相當于一個一維的數字key數組, with the exception of a few characteristics:
PHP實戰Values will always be indexed as [0, 1, 2, …, size - 1].
PHP實戰Only allowed to access values by index in the range [0, size - 1].
PHP實戰Use cases:
PHP實戰Wherever you would use an array as a list (not concerned with keys).
PHP實戰A more efficient alternative to SplDoublyLinkedList and SplFixedArray.
PHP實戰Vector Class:Vector是自動增長和收縮的連續緩沖區中的一系列值.它是最有效的順序結構,值的索引直接映射到緩沖區中索引,增長因子不綁定到特定的倍數或指數.其具有以下優缺點:
PHP實戰Supports array syntax (square brackets).
PHP實戰Uses less overall memory than an array for the same number of values.
PHP實戰Automatically frees allocated memory when its size drops low enough.
PHP實戰Capacity does not have to be a power of 2.
PHP實戰get(), set(), push(), pop() are all O(1).
PHP實戰但是 shift(), unshift(), insert() and remove() are all O(n).
PHP實戰
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.
PHP實戰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. 其具有以下優缺點:
PHP實戰Supports array syntax (square brackets).
PHP實戰Uses less overall memory than an array for the same number of values.
PHP實戰Automatically frees allocated memory when its size drops low enough.
PHP實戰get(), set(), push(), pop(), shift(), and unshift() are all O(1).
PHP實戰但Capacity must be a power of 2.insert() and remove() are O(n).
PHP實戰Map Class:鍵值對的連續集合,幾乎與數組相同.鍵可以是任何類型,但必須是唯一的.如果使用相同的鍵添加到map中,則將替換值.其擁有以下優缺點:
PHP實戰Keys and values can be any type, including objects.
PHP實戰Supports array syntax (square brackets).
PHP實戰Insertion order is preserved.
PHP實戰Performance and memory efficiency is very similar to an array.
PHP實戰Automatically frees allocated memory when its size drops low enough.
PHP實戰Can't be converted to an array when objects are used as keys.
PHP實戰Pair Class:A pair is used by Ds\Map to pair keys with values.
PHP實戰
Ds\Pair implements JsonSerializable {
/* 方法 */
public __construct ([ mixed $key [, mixed $value ]] )
}
PHP實戰Set Class:唯一值序列. This implementation uses the same hash table as Ds\Map, where values are used as keys and the mapped value is ignored.其擁有以下優缺點:
PHP實戰Values can be any type, including objects.
PHP實戰Supports array syntax (square brackets).
PHP實戰Insertion order is preserved.
PHP實戰Automatically frees allocated memory when its size drops low enough.
PHP實戰add(), remove() and contains() are all O(1).
PHP實戰但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.
PHP實戰Stack Class: “last in, first out”集合,只允許在結構頂部進行訪問和迭代.
PHP實戰
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 )
}
PHP實戰Queue Class:“first in, first out”集合,只允許在結構前端進行訪問和迭代.
PHP實戰
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 )
}
PHP實戰PriorityQueue Class:優先級隊列與隊列是非常相似的,但值以指定的優先級被推入隊列,優先級最高的值總是位于隊列的前面,同優先級元素“先入先出”順序任然保留.在一個PriorityQueue上遞代是具有破壞性的,相當于連續彈出操作直到隊列為空.Implemented using a max heap.
PHP實戰
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實戰以上這篇老生常談PHP中的數據結構:DS擴展就是小編分享給大家的全部內容了,希望能給大家一個參考,也希望大家多多支持維易PHP.
轉載請注明本頁網址:
http://www.snjht.com/jiaocheng/485.html