| Package Information |
| Summary |
Provides extra data structures and iterable/array functionality. |
| Maintainers |
Tyson Andre (lead)
[details]
|
| License |
BSD-3-Clause |
| Description |
teds (Tentative Extra Data Structures) is a collection of data structures and iterable functionality |
| Homepage |
https://github.com/TysonAndre/pecl-teds
|
Release notes
Version 0.9.1
(stable)
|
* Make SortedStrictSet/SortedStrictMap use a binary search tree (not yet a balanced tree).
* Associate iterators on SortedStrictSet/SortedStrictMap with nodes of the tree.
Invalidate iterators pointing to a node when that node of the set/map is removed.
* Fix sorting order when instantiating StableSortedListSet/SortedStrictSet/SortedStrictMap from unsorted arrays. |
