Hi Marc,

> Just one note: The documentation needs to be updated in section 14.8
> as well ([1]).

Right. Thank you for the reminder. Done through the patch below. Note that
it can take a couple of months until the doc on www.gnu.org is updated; we
don't push a doc update that frequently.


2020-05-08  Bruno Haible  <br...@clisp.org>

        list: Update documentation.
        Reported by Marc Nieper-Wißkirchen <marc.nieper+...@gmail.com> in
        <https://lists.gnu.org/archive/html/bug-gnulib/2020-05/msg00062.html>.
        * doc/containers.texi (Container data types): Document the new list
        operations and their complexity.

diff --git a/doc/containers.texi b/doc/containers.texi
index b3f154d..dd92529 100644
--- a/doc/containers.texi
+++ b/doc/containers.texi
@@ -160,6 +160,24 @@ for the ``sequential list'' data type are:
 @tab @math{O(n)}
 @tab @math{O(@log n)}
 @tab @math{O(@log n)}
+@item @code{gl_list_get_first}
+@tab @math{O(1)}
+@tab @math{O(1)}
+@tab @math{O(1)}
+@tab @math{O(@log n)}
+@tab @math{O(1)}
+@tab @math{O(1)}
+@tab @math{O(@log n)}
+@tab @math{O(@log n)}
+@item @code{gl_list_get_last}
+@tab @math{O(1)}
+@tab @math{O(1)}
+@tab @math{O(1)}
+@tab @math{O(@log n)}
+@tab @math{O(1)}
+@tab @math{O(1)}
+@tab @math{O(@log n)}
+@tab @math{O(@log n)}
 @item @code{gl_list_set_at}
 @tab @math{O(1)}
 @tab @math{O(1)}
@@ -169,6 +187,24 @@ for the ``sequential list'' data type are:
 @tab @math{O(n)}
 @tab @math{O((@log n)@mathopsup{2})}
 @tab @math{O(@log n)}
+@item @code{gl_list_set_first}
+@tab @math{O(1)}
+@tab @math{O(1)}
+@tab @math{O(1)}
+@tab @math{O(@log n)}
+@tab @math{O(n)}
+@tab @math{O(1)}
+@tab @math{O((@log n)@mathopsup{2})}
+@tab @math{O(@log n)}
+@item @code{gl_list_set_last}
+@tab @math{O(1)}
+@tab @math{O(1)}
+@tab @math{O(1)}
+@tab @math{O(@log n)}
+@tab @math{O(n)}
+@tab @math{O(1)}
+@tab @math{O((@log n)@mathopsup{2})}
+@tab @math{O(@log n)}
 @item @code{gl_list_search}
 @tab @math{O(n)}
 @tab @math{O(n)}
@@ -286,6 +322,24 @@ for the ``sequential list'' data type are:
 @tab @math{O(n)}
 @tab @math{O((@log n)@mathopsup{2})}
 @tab @math{O(@log n)}
+@item @code{gl_list_remove_first}
+@tab @math{O(n)}
+@tab @math{O(1)}
+@tab @math{O(1)}
+@tab @math{O(@log n)}
+@tab @math{O(n)}
+@tab @math{O(1)}
+@tab @math{O((@log n)@mathopsup{2})}
+@tab @math{O(@log n)}
+@item @code{gl_list_remove_last}
+@tab @math{O(1)}
+@tab @math{O(1)}
+@tab @math{O(1)}
+@tab @math{O(@log n)}
+@tab @math{O(n)}
+@tab @math{O(1)}
+@tab @math{O((@log n)@mathopsup{2})}
+@tab @math{O(@log n)}
 @item @code{gl_list_remove}
 @tab @math{O(n)}
 @tab @math{O(n)}


Reply via email to