I. What is SPL? SPL is a set of interfaces and classes that are used to solve typical problems (standard problems). Data structure:1. Implementing a bidirectional list Spldoublylinkedlist implements Iterator, Arrayaccess, countable {}2A . Stack (stack) is a special linear table because it can only insert or delete elements at one end of a linear table (that is, the stack and the stack) Splstack extends Spldoublylinkedlist implements Iterator, A Rrayaccess, countable {}3the. Queue (Splqueue) is like a queue in our life, and as with the stack, its features are FIFO. Splqueue extends Spldoublylinkedlist implements Iterator, Arrayaccess, countable {}4The priority queue Splpriorityqueue is implemented based on the heap (described below). Splpriorityqueue implements Iterator, countable {}5The heap is a data structure designed to implement the priority queue Splpriorityqueue, which is implemented by constructing a two-fork heap (a binary tree). AbstractSplheap implements Iterator, countable {}6The array handles a large number of fixed-length arrays with Splfixedarray implements Iterator, Arrayaccess, countable {}7mapping is used to store a set of objects, especially when you need to uniquely identify an object. Splobjectstorage implements countable, Iterator, Serializable, arrayaccess {}
Php--spl Extended Learning notes