mirror of
https://github.com/sigmasternchen/php-doc-en
synced 2025-03-18 18:08:54 +00:00
2fd3f0c96d
git-svn-id: https://svn.php.net/repository/phpdoc/en/trunk@297078 c90b9560-bf6c-de11-be94-00142212c4b1
129 lines
3.3 KiB
XML
129 lines
3.3 KiB
XML
<?xml version='1.0' encoding="utf-8"?>
|
|
<!-- $Revision$ -->
|
|
|
|
<part xml:id="spl.datastructures" xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink">
|
|
|
|
&spl.datastructures.intro.title;
|
|
|
|
<partintro>
|
|
<para>
|
|
SPL provides a set of standard datastructures. They are grouped here by their
|
|
underlying implementation which usually defines their general field of
|
|
application.
|
|
</para>
|
|
|
|
<section>
|
|
<title>Doubly Linked Lists</title>
|
|
|
|
<para>
|
|
A Doubly Linked List (DLL) is a list of nodes linked in both directions to
|
|
each others. Iterator's operations, access to both ends, addition or
|
|
removal of nodes have a cost of O(1) when the underlying structure is a DLL.
|
|
It hence provides a decent implementation for stacks and queues.
|
|
</para>
|
|
|
|
<itemizedlist>
|
|
<listitem>
|
|
<simpara><classname>SplDoublyLinkedList</classname></simpara>
|
|
<itemizedlist>
|
|
<listitem><simpara><classname>SplStack</classname></simpara></listitem>
|
|
<listitem><simpara><classname>SplQueue</classname></simpara></listitem>
|
|
</itemizedlist>
|
|
</listitem>
|
|
</itemizedlist>
|
|
|
|
</section>
|
|
<section>
|
|
<title>Heaps</title>
|
|
|
|
<para>
|
|
Heaps are tree-like structures that follow the heap-property: each node
|
|
is greater than or equal to its children, when compared using the
|
|
implemented compare method which is global to the heap.
|
|
</para>
|
|
|
|
<itemizedlist>
|
|
<listitem>
|
|
<simpara><classname>SplHeap</classname></simpara>
|
|
<itemizedlist>
|
|
<listitem><simpara><classname>SplMaxHeap</classname></simpara></listitem>
|
|
<listitem><simpara><classname>SplMinHeap</classname></simpara></listitem>
|
|
</itemizedlist>
|
|
</listitem>
|
|
<listitem>
|
|
<simpara><classname>SplPriorityQueue</classname></simpara>
|
|
</listitem>
|
|
</itemizedlist>
|
|
|
|
</section>
|
|
|
|
<section>
|
|
<title>Arrays</title>
|
|
|
|
<para>
|
|
Arrays are structures that store the data in a continuous way, accessible
|
|
via indexes. Don't confuse them with PHP arrays: PHP arrays are in fact
|
|
implemented as ordered hashtables.
|
|
</para>
|
|
|
|
<itemizedlist>
|
|
<listitem>
|
|
<simpara><classname>SplFixedArray</classname></simpara>
|
|
</listitem>
|
|
</itemizedlist>
|
|
|
|
</section>
|
|
|
|
<section>
|
|
<title>Map</title>
|
|
|
|
<para>
|
|
A map is a datastructure holding key-value pairs. PHP arrays can be seen as maps from integers/strings to values. SPL provides a map from objects to data. This map can also be used as an object set.
|
|
</para>
|
|
|
|
<itemizedlist>
|
|
<listitem>
|
|
<simpara><classname>SplObjectStorage</classname></simpara>
|
|
</listitem>
|
|
</itemizedlist>
|
|
|
|
</section>
|
|
</partintro>
|
|
|
|
&reference.spl.spldoublylinkedlist;
|
|
&reference.spl.splstack;
|
|
&reference.spl.splqueue;
|
|
|
|
&reference.spl.splheap;
|
|
&reference.spl.splmaxheap;
|
|
&reference.spl.splminheap;
|
|
&reference.spl.splpriorityqueue;
|
|
|
|
&reference.spl.splfixedarray;
|
|
&reference.spl.splobjectstorage;
|
|
|
|
</part>
|
|
|
|
|
|
|
|
<!-- Keep this comment at the end of the file
|
|
Local variables:
|
|
mode: sgml
|
|
sgml-omittag:t
|
|
sgml-shorttag:t
|
|
sgml-minimize-attributes:nil
|
|
sgml-always-quote-attributes:t
|
|
sgml-indent-step:1
|
|
sgml-indent-data:t
|
|
indent-tabs-mode:nil
|
|
sgml-parent-document:nil
|
|
sgml-default-dtd-file:"~/.phpdoc/manual.ced"
|
|
sgml-exposed-tags:nil
|
|
sgml-local-catalogs:nil
|
|
sgml-local-ecat-files:nil
|
|
End:
|
|
vim600: syn=xml fen fdm=syntax fdl=2 si
|
|
vim: et tw=78 syn=sgml
|
|
vi: ts=1 sw=1
|
|
-->
|
|
|