blocks|key|1779921|text|PHP中唯一的原生数据结构是array。幸运的是，数组非常灵活，也可以用作哈希表。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1779922|http://www.php.net/array|offset|length|1779923|但是，也有一些SPL，它是C%2B%2B+STL的克隆。|1779924|http://www.php.net/manual/en/book.spl.php|1779925|entityMap|0|LINK|mutability|MUTABLE|url|1^0|0|0|O|0|0|0|0|15|1|0^^$0|@$1|2|3|4|5|6|7|R|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|S|8|@]|9|@$D|T|E|U|1|V]]|A|$]]|$1|F|3|G|5|6|7|W|8|@]|9|@]|A|$]]|$1|H|3|I|5|6|7|X|8|@]|9|@$D|Y|E|Z|1|10]]|A|$]]|$1|J|3|-4|5|6|7|11|8|@]|9|@]|A|$]]]|K|$L|$5|M|N|O|A|$P|C]]|Q|$5|M|N|O|A|$P|I]]]]

The only native data structure in PHP is array. Fortunately, arrays are quite flexible and can be used as hash tables as well.

<a href="http://www.php.net/array" rel="noreferrer">http://www.php.net/array</a>

However, there is SPL which is sort of a clone of C++ STL.

<a href="http://www.php.net/manual/en/book.spl.php" rel="noreferrer">http://www.php.net/manual/en/book.spl.php</a>

blocks|key|1780117|text|关联数组可用于最基本的数据结构哈希表、队列、堆栈。但如果你想要像树或堆这样的东西，我不认为它们默认存在，但我相信任何地方都有免费的库。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1780118|要让数组模拟堆栈，请使用array_push()来添加，使用array_pop()来实现|offset|length|style|CODE|1780119|要让数组模拟队列，请使用array_push()入队，使用array_shift()出队|1780120|默认情况下，关联数组是一个哈希。在PHP中，它们被允许使用字符串作为索引，因此这可以按预期工作：|1780121|$array['key']+=+'value';|code-block|syntax|javascript|1780122|最后，您可以使用可能会浪费空间的数组来模拟二叉树。如果你知道你将会有一棵小树，这是很有用的。使用线性数组，您可以说对于任何索引(i)，将其左子元素放在索引(2i%2B1)中，将右子元素放在索引(2i%2B2)中。|1780123|关于如何让JavaScript数组模拟更高级别的数据结构，this+article很好地介绍了所有这些方法。|1780124|entityMap|0|LINK|mutability|MUTABLE|url|http://javascript-reference.info/9-javascript-tips-you-may-not-know.htm^0|0|C|C|U|B|0|C|C|T|D|0|0|0|0|T|C|0|0^^$0|@$1|2|3|4|5|6|7|12|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|13|8|@$D|14|E|15|F|G]|$D|16|E|17|F|G]]|9|@]|A|$]]|$1|H|3|I|5|6|7|18|8|@$D|19|E|1A|F|G]|$D|1B|E|1C|F|G]]|9|@]|A|$]]|$1|J|3|K|5|6|7|1D|8|@]|9|@]|A|$]]|$1|L|3|M|5|N|7|1E|8|@]|9|@]|A|$O|P]]|$1|Q|3|R|5|6|7|1F|8|@]|9|@]|A|$]]|$1|S|3|T|5|6|7|1G|8|@]|9|@$D|1H|E|1I|1|1J]]|A|$]]|$1|U|3|-4|5|6|7|1K|8|@]|9|@]|A|$]]]|V|$W|$5|X|Y|Z|A|$10|11]]]]

The associative array can be used for most basic data structures hashtable, queue, stack. But if you want something like a tree or heap I don't think they exist by default but I'm sure there are free libraries anywhere.

To have an array emulate a stack use <code>array_push()</code> to add and <code>array_pop()</code> to take off

To have an array emulate a queue use <code>array_push()</code> to enqueue and <code>array_shift()</code> to dequeue

An associative array is a hash by default. In PHP they are allowed to have strings as indexes so this works as expected:

<pre><code>$array['key'] = 'value';
</code></pre>

Finally, you can kind of emulate a binary tree with an array with the potential to have wasted space. Its useful if you know you're going to have a small tree. Using a linear array, you say for any index (i) you put its left child at index (2i+1) and right child at index (2i+2).

All of these methods are covered nicely in <a href="http://javascript-reference.info/9-javascript-tips-you-may-not-know.htm" rel="noreferrer">this article</a> on how to make JavaScript arrays emulate higher level data structures.

blocks|key|1564744|text|PHP的数组实际上是关联数组，也可以用作集合。像许多解释型语言一样，PHP在一个引擎盖下提供了所有这些，而不是提供不同的显式数据类型。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1564745|例如。|1564746|$lst+=+array(1,+2,+3);
$hsh+=+array(1+=>+"This",+2+=>+"is+a",+3+=>+"test");|code-block|syntax|javascript|1564747|/Edit:还有，看看in+the+manual。|offset|length|1564748|entityMap|0|LINK|mutability|MUTABLE|url|http://www.php.net/manual/en/language.types.array.php^0|0|0|0|B|D|0|0^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|V|8|@]|9|@]|A|$]]|$1|D|3|E|5|F|7|W|8|@]|9|@]|A|$G|H]]|$1|I|3|J|5|6|7|X|8|@]|9|@$K|Y|L|Z|1|10]]|A|$]]|$1|M|3|-4|5|6|7|11|8|@]|9|@]|A|$]]]|N|$O|$5|P|Q|R|A|$S|T]]]]

PHP has arrays which are actually associative arrays and can also be used as sets. Like many interpreted languages, PHP offers all this under one hood instead of providing different explicit data types.

E.g.

<pre><code>$lst = array(1, 2, 3);
$hsh = array(1 =&gt; "This", 2 =&gt; "is a", 3 =&gt; "test");
</code></pre>

/Edit: Also, take a look <a href="http://www.php.net/manual/en/language.types.array.php" rel="noreferrer">in the manual</a>.

blocks|key|1564865|text|PHP的array兼具列表和字典的双重功能。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1564866|$myArray+=+array("Apples",+"Oranges",+"Pears");
$myScalar+=+$myArray[0]+//+==+"Apples"|code-block|syntax|javascript|1564867|或者将其用作关联数组：|1564868|$myArray+=+array("a"=>"Apples",+"b"=>"Oranges",+"c"=>"Pears");
$myScalar+=+$myArray["a"]+//+==+"Apples"|1564869|entityMap|0|LINK|mutability|MUTABLE|url|http://hudzilla.org/phpwiki/index.php?title=Arrays^0|4|5|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@$A|V|B|W|1|X]]|C|$]]|$1|D|3|E|5|F|7|Y|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|6|7|Z|8|@]|9|@]|C|$]]|$1|K|3|L|5|F|7|10|8|@]|9|@]|C|$G|H]]|$1|M|3|-4|5|6|7|11|8|@]|9|@]|C|$]]]|N|$O|$5|P|Q|R|C|$S|T]]]]

PHP's <a href="http://hudzilla.org/phpwiki/index.php?title=Arrays" rel="noreferrer">array</a> doubles as both a list and a dictionary.

<pre><code>$myArray = array("Apples", "Oranges", "Pears");
$myScalar = $myArray[0] // == "Apples"
</code></pre>

Or to use it as an associative array:

<pre><code>$myArray = array("a"=&gt;"Apples", "b"=&gt;"Oranges", "c"=&gt;"Pears");
$myScalar = $myArray["a"] // == "Apples"
</code></pre>

blocks|key|1780005|text|我想你可能想说得更具体一点，当你说到数据结构时，我的脑海里有几个方向……|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1780006|数组-它们肯定有很好的文档记录，并可在。(http://us.php.net/manual/en/book.array.php)|offset|length|1780007|SQL数据-取决于您正在使用的数据库，但大多数都是可用的。(http://us.php.net/manual/en/book.mysql.php)|1780008|OOP+-根据版本的不同，可以设计和实现对象。(http://us.php.net/manual/en/language.oop.php)我不得不搜索OOP才能在php站点上找到它。|1780009|希望这会有帮助，如果没有的话，很抱歉。|1780010|entityMap|0|LINK|mutability|MUTABLE|url|http://us.php.net/manual/en/book.array.php|1|http://us.php.net/manual/en/book.mysql.php|2|http://us.php.net/manual/en/language.oop.php^0|0|L|16|0|0|U|16|1|0|O|18|2|0|0^^$0|@$1|2|3|4|5|6|7|X|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|Y|8|@]|9|@$D|Z|E|10|1|11]]|A|$]]|$1|F|3|G|5|6|7|12|8|@]|9|@$D|13|E|14|1|15]]|A|$]]|$1|H|3|I|5|6|7|16|8|@]|9|@$D|17|E|18|1|19]]|A|$]]|$1|J|3|K|5|6|7|1A|8|@]|9|@]|A|$]]|$1|L|3|-4|5|6|7|1B|8|@]|9|@]|A|$]]]|M|$N|$5|O|P|Q|A|$R|S]]|T|$5|O|P|Q|A|$R|U]]|V|$5|O|P|Q|A|$R|W]]]]

I think you might want to be a bit more specific, when you say data structures my mind goes in a few directions...

Arrays - They are certainly well documented and available in. (<a href="http://us.php.net/manual/en/book.array.php" rel="noreferrer">http://us.php.net/manual/en/book.array.php</a>)

SQL Data - Depends on the database you are using, but most are available. (<a href="http://us.php.net/manual/en/book.mysql.php" rel="noreferrer">http://us.php.net/manual/en/book.mysql.php</a>)

OOP - Depending on the version objects can be designed and implemented. (<a href="http://us.php.net/manual/en/language.oop.php" rel="noreferrer">http://us.php.net/manual/en/language.oop.php</a>) I had to search for OOP to find this on the php site.

Hope that helps, sorry if it does not.

blocks|key|1564975|text|当然，PHP也有数据结构。php中的数组非常灵活。下面是一些例子：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1564976|$foo+=+array(
++'bar'+=>+array(1,'two',3),
++'baz'+=>+explode("+",+"Some+nice+words")
);|code-block|syntax|javascript|1564977|然后你就有了绝对过多的数组函数，可以用来映射/过滤/遍历等结构，或者转换，翻转，反转等。|1564978|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|M|8|@]|9|@]|A|$]]|$1|I|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|J|$]]

Of course PHP has data structures. The array in php is incredibly flexible. Some examples:

<pre><code>$foo = array(
 'bar' =&gt; array(1,'two',3),
 'baz' =&gt; explode(" ", "Some nice words")
);
</code></pre>

Then you have an absolute plethora of array functions available to map/filter/walk/etc the structures, or convert, flip, reverse, etc.

blocks|key|1780137|text|如果您不觉得PHP包含特定类型的数据结构，您可以随时创建自己的数据结构。例如，下面是一个由数组支持的简单集合数据结构。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1780138|ArraySet：https://github.com/abelperez/collections/blob/master/ArraySet.php|offset|length|1780139|class+ArraySet
{
++++/**+Elements+in+this+set+*/
++++private+$elements;

++++/**+the+number+of+elements+in+this+set+*/
++++private+$size+=+0;

++++/**
+++++*+Constructs+this+set.
+++++*/+
++++public+function+ArraySet()+{
++++++++$this->elements+=+array();
++++}

++++/**
+++++*+Adds+the+specified+element+to+this+set+if+
+++++*+it+is+not+already+present.
+++++*+
+++++*+@param+any+$element
+++++*
+++++*+@returns+true+if+the+specified+element+was
+++++*+added+to+this+set.
+++++*/
++++public+function+add($element)+{
++++++++if+(!+in_array($element,+$this->elements))+{
++++++++++++$this->elements[]+=+$element;
++++++++++++$this->size%2B%2B;
++++++++++++return+true;
++++++++}
++++++++return+false;
++++}

++++/**
+++++*+Adds+all+of+the+elements+in+the+specified+
+++++*+collection+to+this+set+if+they're+not+already+present.
+++++*+
+++++*+@param+array+$collection
+++++*+
+++++*+@returns+true+if+any+of+the+elements+in+the
+++++*+specified+collection+where+added+to+this+set.+
+++++*/+
++++public+function+addAll($collection)+{
++++++++$changed+=+false;
++++++++foreach+($collection+as+$element)+{
++++++++++++if+($this->add($element))+{
++++++++++++++++$changed+=+true;
++++++++++++}
++++++++}
++++++++return+$changed;
++++}

++++/**
+++++*+Removes+all+the+elements+from+this+set.
+++++*/+
++++public+function+clear()+{
++++++++$this->elements+=+array();
++++++++$this->size+=+0;
++++}

++++/**
+++++*+Checks+if+this+set+contains+the+specified+element.+
+++++*+
+++++*+@param+any+$element
+++++*
+++++*+@returns+true+if+this+set+contains+the+specified
+++++*+element.
+++++*/+
++++public+function+contains($element)+{
++++++++return+in_array($element,+$this->elements);
++++}

++++/**
+++++*+Checks+if+this+set+contains+all+the+specified+
+++++*+element.
+++++*+
+++++*+@param+array+$collection
+++++*+
+++++*+@returns+true+if+this+set+contains+all+the+specified
+++++*+element.+
+++++*/+
++++public+function+containsAll($collection)+{
++++++++foreach+($collection+as+$element)+{
++++++++++++if+(!+in_array($element,+$this->elements))+{
++++++++++++++++return+false;
++++++++++++}
++++++++}
++++++++return+true;
++++}

++++/**
+++++*+Checks+if+this+set+contains+elements.
+++++*+
+++++*+@returns+true+if+this+set+contains+no+elements.+
+++++*/+
++++public+function+isEmpty()+{
++++++++return+count($this->elements)+<=+0;
++++}

++++/**
+++++*+Get's+an+iterator+over+the+elements+in+this+set.
+++++*+
+++++*+@returns+an+iterator+over+the+elements+in+this+set.
+++++*/+
++++public+function+iterator()+{
++++++++return+new+SimpleIterator($this->elements);
++++}

++++/**
+++++*+Removes+the+specified+element+from+this+set.
+++++*+
+++++*+@param+any+$element
+++++*
+++++*+@returns+true+if+the+specified+element+is+removed.
+++++*/+
++++public+function+remove($element)+{
++++++++if+(!+in_array($element,+$this->elements))+return+false;

++++++++foreach+($this->elements+as+$k+=>+$v)+{
++++++++++++if+($element+==+$v)+{
++++++++++++++++unset($this->elements[$k]);
++++++++++++++++$this->size--;
++++++++++++++++return+true;
++++++++++++}
++++++++}+++++++
++++}

++++/**
+++++*+Removes+all+the+specified+elements+from+this+set.
+++++*+
+++++*+@param+array+$collection
+++++*
+++++*+@returns+true+if+all+the+specified+elemensts
+++++*+are+removed+from+this+set.+
+++++*/+
++++public+function+removeAll($collection)+{
++++++++$changed+=+false;
++++++++foreach+($collection+as+$element)+{
++++++++++++if+($this->remove($element))+{
++++++++++++++++$changed+=+true;
++++++++++++}+
++++++++}
++++++++return+$changed;
++++}

++++/**
+++++*+Retains+the+elements+in+this+set+that+are
+++++*+in+the+specified+collection.++If+the+specified
+++++*+collection+is+also+a+set,+this+method+effectively
+++++*+modifies+this+set+into+the+intersection+of+
+++++*+this+set+and+the+specified+collection.
+++++*+
+++++*+@param+array+$collection
+++++*
+++++*+@returns+true+if+this+set+changed+as+a+result
+++++*+of+the+specified+collection.
+++++*/+
++++public+function+retainAll($collection)+{
++++++++$changed+=+false;
++++++++foreach+($this->elements+as+$k+=>+$v)+{
++++++++++++if+(!+in_array($v,+$collection))+{
++++++++++++++++unset($this->elements[$k]);
++++++++++++++++$this->size--;
++++++++++++++++$changed+=+true;
++++++++++++}
++++++++}
++++++++return+$changed;
++++}

++++/**
+++++*+Returns+the+number+of+elements+in+this+set.
+++++*+
+++++*+@returns+the+number+of+elements+in+this+set.
+++++*/+
++++public+function+size()+{
++++++++return+$this->size;+
++++}

++++/**
+++++*+Returns+an+array+that+contains+all+the+
+++++*+elements+in+this+set.
+++++*+
+++++*+@returns+an+array+that+contains+all+the+
+++++*+elements+in+this+set.
+++++*/+
++++public+function+toArray()+{
++++++++$elements+=+$this->elements;
++++++++return+$elements;+++
++++}
}|code-block|syntax|javascript|1780140|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/abelperez/collections/blob/master/ArraySet.php^0|0|9|1T|0|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|T|8|@]|9|@$D|U|E|V|1|W]]|A|$]]|$1|F|3|G|5|H|7|X|8|@]|9|@]|A|$I|J]]|$1|K|3|-4|5|6|7|Y|8|@]|9|@]|A|$]]]|L|$M|$5|N|O|P|A|$Q|R]]]]

You can always create your own if you don't feel PHP includes a specific type of data structure. For example, here is a simple Set data structure backed by an Array.

ArraySet: <a href="https://github.com/abelperez/collections/blob/master/ArraySet.php" rel="nofollow">https://github.com/abelperez/collections/blob/master/ArraySet.php</a>

<pre><code>class ArraySet
{
 /** Elements in this set */
 private $elements;

 /** the number of elements in this set */
 private $size = 0;

 /**
 * Constructs this set.
 */ 
 public function ArraySet() {
 $this-&gt;elements = array();
 }

 /**
 * Adds the specified element to this set if 
 * it is not already present.
 * 
 * @param any $element
 *
 * @returns true if the specified element was
 * added to this set.
 */
 public function add($element) {
 if (! in_array($element, $this-&gt;elements)) {
 $this-&gt;elements[] = $element;
 $this-&gt;size++;
 return true;
 }
 return false;
 }

 /**
 * Adds all of the elements in the specified 
 * collection to this set if they're not already present.
 * 
 * @param array $collection
 * 
 * @returns true if any of the elements in the
 * specified collection where added to this set. 
 */ 
 public function addAll($collection) {
 $changed = false;
 foreach ($collection as $element) {
 if ($this-&gt;add($element)) {
 $changed = true;
 }
 }
 return $changed;
 }

 /**
 * Removes all the elements from this set.
 */ 
 public function clear() {
 $this-&gt;elements = array();
 $this-&gt;size = 0;
 }

 /**
 * Checks if this set contains the specified element. 
 * 
 * @param any $element
 *
 * @returns true if this set contains the specified
 * element.
 */ 
 public function contains($element) {
 return in_array($element, $this-&gt;elements);
 }

 /**
 * Checks if this set contains all the specified 
 * element.
 * 
 * @param array $collection
 * 
 * @returns true if this set contains all the specified
 * element. 
 */ 
 public function containsAll($collection) {
 foreach ($collection as $element) {
 if (! in_array($element, $this-&gt;elements)) {
 return false;
 }
 }
 return true;
 }

 /**
 * Checks if this set contains elements.
 * 
 * @returns true if this set contains no elements. 
 */ 
 public function isEmpty() {
 return count($this-&gt;elements) &lt;= 0;
 }

 /**
 * Get's an iterator over the elements in this set.
 * 
 * @returns an iterator over the elements in this set.
 */ 
 public function iterator() {
 return new SimpleIterator($this-&gt;elements);
 }

 /**
 * Removes the specified element from this set.
 * 
 * @param any $element
 *
 * @returns true if the specified element is removed.
 */ 
 public function remove($element) {
 if (! in_array($element, $this-&gt;elements)) return false;

 foreach ($this-&gt;elements as $k =&gt; $v) {
 if ($element == $v) {
 unset($this-&gt;elements[$k]);
 $this-&gt;size--;
 return true;
 }
 } 
 }

 /**
 * Removes all the specified elements from this set.
 * 
 * @param array $collection
 *
 * @returns true if all the specified elemensts
 * are removed from this set. 
 */ 
 public function removeAll($collection) {
 $changed = false;
 foreach ($collection as $element) {
 if ($this-&gt;remove($element)) {
 $changed = true;
 } 
 }
 return $changed;
 }

 /**
 * Retains the elements in this set that are
 * in the specified collection. If the specified
 * collection is also a set, this method effectively
 * modifies this set into the intersection of 
 * this set and the specified collection.
 * 
 * @param array $collection
 *
 * @returns true if this set changed as a result
 * of the specified collection.
 */ 
 public function retainAll($collection) {
 $changed = false;
 foreach ($this-&gt;elements as $k =&gt; $v) {
 if (! in_array($v, $collection)) {
 unset($this-&gt;elements[$k]);
 $this-&gt;size--;
 $changed = true;
 }
 }
 return $changed;
 }

 /**
 * Returns the number of elements in this set.
 * 
 * @returns the number of elements in this set.
 */ 
 public function size() {
 return $this-&gt;size; 
 }

 /**
 * Returns an array that contains all the 
 * elements in this set.
 * 
 * @returns an array that contains all the 
 * elements in this set.
 */ 
 public function toArray() {
 $elements = $this-&gt;elements;
 return $elements; 
 }
}
</code></pre>

blocks|key|1565268|text|到目前为止(PHP7.4)，只有原生结构是array。但是从PHP7扩展DS出现，它包含了新的数据结构，并且它们都比其他实现(包括在accepted中推荐的)要快得多。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1565269|DS+extension+-+PHP+Manual|1565270|接口：Collection、Hashable、Sequence|1565271|类：Vector、Deque、Map、Pair、Set、Stack、Queue、PriorityQueue|1565272|Orginal+article+about+extension|1565273|entityMap|0|LINK|mutability|MUTABLE|url|https://www.php.net/manual/en/book.ds.php|1|https://medium.com/@rtheunissen/efficient-data-structures-for-php-7-9dda7af674cd^0|L|5|0|0|P|0|0|3|A|E|8|N|8|0|2|6|9|5|F|3|J|4|O|3|S|5|Y|5|14|D|0|0|V|1|0^^$0|@$1|2|3|4|5|6|7|X|8|@$9|Y|A|Z|B|C]]|D|@]|E|$]]|$1|F|3|G|5|6|7|10|8|@]|D|@$9|11|A|12|1|13]]|E|$]]|$1|H|3|I|5|6|7|14|8|@$9|15|A|16|B|C]|$9|17|A|18|B|C]|$9|19|A|1A|B|C]]|D|@]|E|$]]|$1|J|3|K|5|6|7|1B|8|@$9|1C|A|1D|B|C]|$9|1E|A|1F|B|C]|$9|1G|A|1H|B|C]|$9|1I|A|1J|B|C]|$9|1K|A|1L|B|C]|$9|1M|A|1N|B|C]|$9|1O|A|1P|B|C]|$9|1Q|A|1R|B|C]]|D|@]|E|$]]|$1|L|3|M|5|6|7|1S|8|@]|D|@$9|1T|A|1U|1|1V]]|E|$]]|$1|N|3|-4|5|6|7|1W|8|@]|D|@]|E|$]]]|O|$P|$5|Q|R|S|E|$T|U]]|V|$5|Q|R|S|E|$T|W]]]]

As for today (PHP 7.4), only native structure is an <code>array</code>. But from PHP7 extension DS appeared that includes new data structures and all of them are much faster than other implementations (including SPL recommended in accepted answer).

<a href="https://www.php.net/manual/en/book.ds.php" rel="nofollow noreferrer">DS extension - PHP Manual</a>

Interfaces: <code>Collection</code>, <code>Hashable</code>, <code>Sequence</code>

Classes: <code>Vector</code>, <code>Deque</code>, <code>Map</code>, <code>Pair</code>, <code>Set</code>, <code>Stack</code>, <code>Queue</code>, <code>PriorityQueue</code>

<a href="https://medium.com/@rtheunissen/efficient-data-structures-for-php-7-9dda7af674cd" rel="nofollow noreferrer">Orginal article about extension</a>

blocks|key|1565178|text|是的，确实如此。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1565179|<?php
$my_array+=+array("Bird","Cat","Cow");

list($a,+$b,+$c)+=+$my_array;
echo+"I+have+several+animals,+a+$a,+a+$b+and+a+$c.";
?>|code-block|syntax|javascript|1565180|http://www.w3schools.com/php/func_array_list.asp|offset|length|1565181|entityMap|0|LINK|mutability|MUTABLE|url^0|0|0|0|1C|0|0^^$0|@$1|2|3|4|5|6|7|R|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|S|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|T|8|@]|9|@$I|U|J|V|1|W]]|A|$]]|$1|K|3|-4|5|6|7|X|8|@]|9|@]|A|$]]]|L|$M|$5|N|O|P|A|$Q|H]]]]

Yes it does. 

<pre><code>&lt;?php
$my_array = array("Bird","Cat","Cow");

list($a, $b, $c) = $my_array;
echo "I have several animals, a $a, a $b and a $c.";
?&gt;
</code></pre>

<a href="http://www.w3schools.com/php/func_array_list.asp" rel="nofollow">http://www.w3schools.com/php/func_array_list.asp</a>

blocks|key|1780188|text|C语言将允许创建一个结构，然后像字符串(字符/字节)缓冲区一样填充它。一旦它被填充，代码就会通过结构成员访问缓冲区。解析结构化的(数据库、图像等)真的很棒。文件是这样的。我不认为你可以用PHP结构做到这一点--或者我(希望)错了。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1780189|好吧，PHP确实有unpack和pack+--功能相同，但不是很优雅。|1780190|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|F|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|G|8|@]|9|@]|A|$]]|$1|D|3|-4|5|6|7|H|8|@]|9|@]|A|$]]]|E|$]]

C languages will allow creating a structure and then filling it like a string (char/byte) buffer. Once it's filled the code accesses the buffer via the structure members. It's really nice to parse structured (database,image,etc.) files that way. I don't think you can do that with PHP structures - or am I (hopefully) wrong.

Ok - well PHP does have unpack and pack - functionally the same, but not as elegant.

I'm looking at the <a href="http://www.php.net/manual/en/" rel="noreferrer">PHP Manual</a>, and I'm not seeing a section on data structures that most languages have, such as lists and sets. Am I just blind or does PHP not have anything like this built in?

Does PHP have built-in data structures?

数据结构

数据库

我正在研究，但我没有看到关于大多数语言都有的数据结构的部分，比如列表和集合。我是不是太盲目了，或者PHP没有类似的内置功能？

问PHP有内置的数据结构吗？
EN

回答 10

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问PHP有内置的数据结构吗？EN

回答 10

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问PHP有内置的数据结构吗？
EN