Standard PHP Library (SPL)

• Introduction
• Installing/Configuring
  • Installation
  • Runtime Configuration
  • Resource Types
• Predefined Constants
• Datastructures
• SPL Functions
  • class_implements — Return the interfaces which are implemented by the given class
  • class_parents — Return the parent classes of the given class
  • iterator_count — Count the elements in an iterator
  • iterator_to_array — Copy the iterator into an array
  • spl_autoload_call — Try all registered __autoload() function to load the requested class
  • spl_autoload_extensions — Register and return default file extensions for spl_autoload
  • spl_autoload_functions — Return all registered __autoload() functions
  • spl_autoload_register — Register given function as __autoload() implementation
  • spl_autoload_unregister — Unregister given function as __autoload() implementation
  • spl_autoload — Default implementation for __autoload()
  • spl_classes — Return available SPL classes
  • spl_object_hash — Return hash id for given object
• ArrayIterator — The ArrayIterator class
  • ArrayIterator::current — Return current array entry
  • ArrayIterator::key — Return current array key
  • ArrayIterator::next — Move to next entry
  • ArrayIterator::rewind — Rewind array back to the start
  • ArrayIterator::seek — Seek to position
  • ArrayIterator::valid — Check whether array contains more entries
• ArrayObject — The ArrayObject class
  • ArrayObject::append — Appends the value
  • ArrayObject::__construct — Construct a new array object
  • ArrayObject::count — Get the number of elements in the Iterator
  • ArrayObject::getIterator — Create a new iterator from an ArrayObject instance
  • ArrayObject::offsetExists — Returns whether the requested $index exists
  • ArrayObject::offsetGet — Returns the value at the specified $index
  • ArrayObject::offsetSet — Sets the value at the specified $index to $newval
  • ArrayObject::offsetUnset — Unsets the value at the specified $index
• CachingIterator — The CachingIterator class
  • CachingIterator::hasNext — Check whether the inner iterator has a valid next element
  • CachingIterator::next — Move the iterator forward
  • CachingIterator::rewind — Rewind the iterator
  • CachingIterator::__toString — Return the string representation of the current element
  • CachingIterator::valid — Check whether the current element is valid
• RecursiveCachingIterator — The RecursiveCachingIterator class
  • RecursiveCachingIterator::getChildren — Return the inner iterator's children as a RecursiveCachingIterator
  • RecursiveCachingIterator::hasChildren — Check whether the current element of the inner iterator has children
• DirectoryIterator — The DirectoryIterator class
  • DirectoryIterator::__construct — Constructs a new dir iterator from a path
  • DirectoryIterator::current — Return this (needed for Iterator interface)
  • DirectoryIterator::getATime — Get last access time of file
  • DirectoryIterator::getCTime — Get inode modification time of file
  • DirectoryIterator::getFilename — Return filename of current dir entry
  • DirectoryIterator::getGroup — Get file group
  • DirectoryIterator::getInode — Get file inode
  • DirectoryIterator::getMTime — Get last modification time of file
  • DirectoryIterator::getOwner — Get file owner
  • DirectoryIterator::getPath — Return directory path
  • DirectoryIterator::getPathname — Return path and filename of current dir entry
  • DirectoryIterator::getPerms — Get file permissions
  • DirectoryIterator::getSize — Get file size
  • DirectoryIterator::getType — Get file type
  • DirectoryIterator::isDir — Returns true if file is directory
  • DirectoryIterator::isDot — Returns true if current entry is '.' or '..'
  • DirectoryIterator::isExecutable — Returns true if file is executable
  • DirectoryIterator::isFile — Returns true if file is a regular file
  • DirectoryIterator::isLink — Returns true if file is symbolic link
  • DirectoryIterator::isReadable — Returns true if file can be read
  • DirectoryIterator::isWritable — Returns true if file can be written
  • DirectoryIterator::key — Return current dir entry
  • DirectoryIterator::next — Move to next entry
  • DirectoryIterator::rewind — Rewind dir back to the start
  • DirectoryIterator::valid — Check whether dir contains more entries
• FilterIterator — The FilterIterator class
  • FilterIterator::current — Get the current element value
  • FilterIterator::getInnerIterator — Get the inner iterator
  • FilterIterator::key — Get the current key
  • FilterIterator::next — Move the iterator forward
  • FilterIterator::rewind — Rewind the iterator
  • FilterIterator::valid — Check whether the current element is valid
• LimitIterator — The LimitIterator class
  • LimitIterator::getPosition — Return the current position
  • LimitIterator::next — Move the iterator forward
  • LimitIterator::rewind — Rewind the iterator to the specified starting offset
  • LimitIterator::seek — Seek to the given position
  • LimitIterator::valid — Check whether the current element is valid
• ParentIterator — The ParentIterator class
  • ParentIterator::getChildren — Return the inner iterator's children contained in a ParentIterator
  • ParentIterator::hasChildren — Check whether the inner iterator's current element has children
  • ParentIterator::next — Move the iterator forward
  • ParentIterator::rewind — Rewind the iterator
• RecursiveDirectoryIterator — The RecursiveDirectoryIterator class
  • RecursiveDirectoryIterator::getChildren — Returns an iterator for the current entry if it is a directory
  • RecursiveDirectoryIterator::hasChildren — Returns whether current entry is a directory and not '.' or '..'
  • RecursiveDirectoryIterator::key — Return path and filename of current dir entry
  • RecursiveDirectoryIterator::next — Move to next entry
  • RecursiveDirectoryIterator::rewind — Rewind dir back to the start
• RecursiveIteratorIterator — The RecursiveIteratorIterator class
  • RecursiveIteratorIterator::current — Access the current element value
  • RecursiveIteratorIterator::getDepth — Get the current depth of the recursive iteration
  • RecursiveIteratorIterator::getSubIterator — The current active sub iterator
  • RecursiveIteratorIterator::key — Access the current key
  • RecursiveIteratorIterator::next — Move forward to the next element
  • RecursiveIteratorIterator::rewind — Rewind the iterator to the first element of the top level inner iterator
  • RecursiveIteratorIterator::valid — Check whether the current position is valid
• SimpleXMLIterator — The SimpleXMLIterator class
  • SimpleXMLIterator::current — Return current SimpleXML entry
  • SimpleXMLIterator::getChildren — Returns an iterator for the current entry if it is a SimpleXML object
  • SimpleXMLIterator::hasChildren — Returns whether current entry is a SimpleXML object
  • SimpleXMLIterator::key — Return current SimpleXML key
  • SimpleXMLIterator::next — Move to next entry
  • SimpleXMLIterator::rewind — Rewind SimpleXML back to the start
  • SimpleXMLIterator::valid — Check whether SimpleXML contains more entries
• SplDoublyLinkedList — The SplDoublyLinkedList class
  • SplDoublyLinkedList::bottom — Peaks at the node from the beginning of the doubly linked list
  • SplDoublyLinkedList::__construct — Constructs a new doubly linked list
  • SplDoublyLinkedList::count — Counts the number of elements in the doubly linked list.
  • SplDoublyLinkedList::current — Return current array entry
  • SplDoublyLinkedList::getIteratorMode — Returns the mode of iteration
  • SplDoublyLinkedList::isEmpty — Checks whether the doubly linked list is empty.
  • SplDoublyLinkedList::key — Return current node index
  • SplDoublyLinkedList::next — Move to next entry
  • SplDoublyLinkedList::offsetExists — Returns whether the requested $index exists
  • SplDoublyLinkedList::offsetGet — Returns the value at the specified $index
  • SplDoublyLinkedList::offsetSet — Sets the value at the specified $index to $newval
  • SplDoublyLinkedList::offsetUnset — Unsets the value at the specified $index
  • SplDoublyLinkedList::pop — Pops a node from the end of the doubly linked list
  • SplDoublyLinkedList::push — Pushes an element at the end of the doubly linked list
  • SplDoublyLinkedList::rewind — Rewind iterator back to the start
  • SplDoublyLinkedList::setIteratorMode — Sets the mode of iteration
  • SplDoublyLinkedList::shift — Shifts a node from the beginning of the doubly linked list
  • SplDoublyLinkedList::top — Peaks at the node from the end of the doubly linked list
  • SplDoublyLinkedList::unshift — Prepends the doubly linked list with an element
  • SplDoublyLinkedList::valid — Check whether the doubly linked list contains more nodes
• SplStack — The SplStack class
  • SplStack::__construct — Constructs a new stack implemented using a doubly linked list
  • SplStack::setIteratorMode — Sets the mode of iteration
• SplQueue — The SplQueue class
  • SplQueue::__construct — Constructs a new queue implemented using a doubly linked list
  • SplQueue::dequeue — Dequeues a node from the queue
  • SplQueue::enqueue — Adds an element to the queue.
  • SplQueue::setIteratorMode — Sets the mode of iteration
• SplHeap — The SplHeap class
  • SplHeap::compare — Compare elements in order to place them correctly in the heap while sifting up.
  • SplHeap::__construct — Constructs a new empty heap
  • SplHeap::count — Counts the number of elements in the heap.
  • SplHeap::current — Return current node pointed by the iterator
  • SplHeap::extract — Extracts a node from top of the heap and sift up.
  • SplHeap::insert — Inserts an element in the heap by sifting it up.
  • SplHeap::isEmpty — Checks whether the heap is empty.
  • SplHeap::key — Return current node index
  • SplHeap::next — Move to the next node
  • SplHeap::recoverFromCorruption — Recover from the corrupted state and allow further actions on the heap.
  • SplHeap::rewind — Rewind iterator back to the start (no-op)
  • SplHeap::top — Peaks at the node from the top of the heap
  • SplHeap::valid — Check whether the heap contains more nodes
• SplMaxHeap — The SplMaxHeap class
  • SplMaxHeap::compare — Compare elements in order to place them correctly in the heap while sifting up.
• SplMinHeap — The SplMinHeap class
  • SplMinHeap::compare — Compare elements in order to place them correctly in the heap while sifting up.
• SplPriorityQueue — The SplPriorityQueue class
  • SplPriorityQueue::compare — Compare priorities in order to place elements correctly in the heap while sifting up.
  • SplPriorityQueue::__construct — Constructs a new empty queue
  • SplPriorityQueue::count — Counts the number of elements in the queue.
  • SplPriorityQueue::current — Return current node pointed by the iterator
  • SplPriorityQueue::extract — Extracts a node from top of the heap and sift up.
  • SplPriorityQueue::insert — Inserts an element in the queue by sifting it up.
  • SplPriorityQueue::isEmpty — Checks whether the queue is empty.
  • SplPriorityQueue::key — Return current node index
  • SplPriorityQueue::next — Move to the next node
  • SplPriorityQueue::recoverFromCorruption — Recover from the corrupted state and allow further actions on the queue.
  • SplPriorityQueue::rewind — Rewind iterator back to the start (no-op)
  • SplPriorityQueue::setExtractFlags — Sets the mode of extraction
  • SplPriorityQueue::top — Peaks at the node from the top of the queue
  • SplPriorityQueue::valid — Check whether the queue contains more nodes

---

	Free Tutorial
	สอน Google Maps Api สอน Windows Service สอน Entity Framework สอน Android สอน Java เขียน Java Java GUI Swing สอน JSP (Web App) iOS (iPhone,iPad) Windows Phone Windows Azure Windows Store Laravel Framework Yii PHP Framework สอน jQuery สอน jQuery กับ Ajax สอน PHP OOP (Vdo) Ajax Tutorials SQL Tutorials สอน SQL (Part 2) JavaScript Tutorial Javascript Tips VBScript Tutorial VBScript Validation Microsoft Access MySQL Tutorials -- Stored Procedure MariaDB Database SQL Server Tutorial SQL Server 2005 SQL Server 2008 SQL Server 2012 -- Stored Procedure Oracle Database -- Stored Procedure SVN (Subversion) แนวทางการทำ SEO ปรับแต่งเว็บให้โหลดเร็ว

	Hit Link
	นำเข้าสินค้าจากจีน Taobao เฟอร์นิเจอร์ ของพรีเมี่ยม ร่ม ปากกา power bank แฟลชไดร์ฟ กระบอกน้ำ แลกเปลี่ยน Exchange Link

© www.ThaiCreate.Com. 2003-2024 All Rights Reserved.
ไทยครีเอทบริการ จัดทำดูแลแก้ไข Web Application ทุกรูปแบบ (PHP, .Net Application, VB.Net, C#)
[Conditions Privacy Statement] ติดต่อโฆษณา 081-987-6107 อัตราราคา คลิกที่นี่