|  support |  documentation |  report a bug |  advanced search |  search howto |  statistics |  random bug |  login
Doc Bug #66489 Runtime of operations on SPL Datastructures not documented
Submitted: 2014-01-15 15:59 UTC Modified: 2016-08-25 00:15 UTC
From: ysangkok at gmail dot com Assigned:
Status: Open Package: SPL related
PHP Version: Irrelevant OS:
Private report: No CVE-ID: None
View Add Comment Developer Edit
Welcome! If you don't have a Git account, you can't do anything here.
You can add a comment by following this link or if you reported this bug, you can edit this bug over here.
Block user comment
Status: Assign to:
Bug Type:
From: ysangkok at gmail dot com
New email:
PHP Version: OS:


 [2014-01-15 15:59 UTC] ysangkok at gmail dot com
It is absolutely critical to a whole bunch of use cases that the runtime of different operations on SPL datastructures is known.

For example, count() on an SPL doubly-linked list might be O(n). Or maybe there is a counter being decremented/incremented each time something is removed, which would make it O(1).

Expected result:
A note on each page denoting asymptotic worst case, average case, and best case runtime, and a table for overview.


Add a Patch

Pull Requests

Add a Pull Request


AllCommentsChangesGit/SVN commitsRelated reports
 [2016-08-25 00:15 UTC]
-Package: Documentation problem +Package: SPL related
PHP Copyright © 2001-2024 The PHP Group
All rights reserved.
Last updated: Sun Apr 14 11:01:29 2024 UTC