You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Sorted Collection for PHP. Insertion, search, and removal compute in `log(n)` time where `n` is the number of items present in the collection. It uses AVL threaded tree [see @Knuth97, 1:320, Sect. 2.3.1] as internal structure.
14
14
@@ -72,12 +72,12 @@ This should print
72
72
[0,1,2,3,4,5,6,7,8,9]
73
73
~~~
74
74
75
-
See the [examples](https://github.com/chdemko/php-sorted-collections/tree/master/examples) and [benchmarks](https://github.com/chdemko/php-sorted-collections/tree/master/benchmarks) folder for more information.
75
+
See the [examples](https://github.com/chdemko/php-sorted-collections/tree/develop/examples) and [benchmarks](https://github.com/chdemko/php-sorted-collections/tree/develop/benchmarks) folder for more information.
76
76
77
77
Citation
78
78
--------
79
79
80
-
If you are using this project including publication in research activities, you have to cite it using ([BibTeX format](https://raw.github.com/chdemko/php-sorted-collections/master/cite.bib)). You are also pleased to send me an email to [email protected].
80
+
If you are using this project including publication in research activities, you have to cite it using ([BibTeX format](https://raw.github.com/chdemko/php-sorted-collections/develop/cite.bib)). You are also pleased to send me an email to [email protected].
81
81
* authors: Christophe Demko
82
82
* title: php-sorted-collections: a PHP library for handling sorted collections
0 commit comments