summaryrefslogtreecommitdiffstats
path: root/doc/developer/lists.rst
diff options
context:
space:
mode:
authorDavid Lamparter <equinox@opensourcerouting.org>2021-10-14 19:19:23 +0200
committerDavid Lamparter <equinox@opensourcerouting.org>2021-10-14 19:19:44 +0200
commit4c0e52367af58878ee777d251b3fb6990861532b (patch)
treeb945e64a65dfb33779f87faea696ce2ac0e7b2c6 /doc/developer/lists.rst
parentdoc/developer: use :c:macro: where appropriate (diff)
downloadfrr-4c0e52367af58878ee777d251b3fb6990861532b.tar.xz
frr-4c0e52367af58878ee777d251b3fb6990861532b.zip
doc/developer: fix duplicate const prototypes
The const ones have const in the name. Signed-off-by: David Lamparter <equinox@opensourcerouting.org>
Diffstat (limited to '')
-rw-r--r--doc/developer/lists.rst8
1 files changed, 4 insertions, 4 deletions
diff --git a/doc/developer/lists.rst b/doc/developer/lists.rst
index ea7ca02bd..718e40476 100644
--- a/doc/developer/lists.rst
+++ b/doc/developer/lists.rst
@@ -297,7 +297,7 @@ The following documentation assumes that a list has been defined using
affected by the "modification while iterating" problem. To remove
all items from a hash table, use the loop demonstrated above.
-.. c:function:: const itemtype *Z_next(const struct Z_head *, const itemtype *prev)
+.. c:function:: const itemtype *Z_const_next(const struct Z_head *, const itemtype *prev)
.. c:function:: itemtype *Z_next(struct Z_head *, itemtype *prev)
Return the item that follows after ``prev``, or ``NULL`` if ``prev`` is
@@ -439,7 +439,7 @@ sorted lists can be searched for a value.
For ``_NONUNIQ`` lists, this function always returns NULL since ``item``
can always be successfully added to the list.
-.. c:function:: const itemtype *Z_find(const struct Z_head *, const itemtype *ref)
+.. c:function:: const itemtype *Z_const_find(const struct Z_head *, const itemtype *ref)
.. c:function:: itemtype *Z_find(struct Z_head *, const itemtype *ref)
Search the list for an item that compares equal to ``ref``. If no equal
@@ -461,13 +461,13 @@ sorted lists can be searched for a value.
containing non-unique items, more than one item may compare as equal to
the item that is searched for.
-.. c:function:: const itemtype *Z_find_gteq(const struct Z_head *, const itemtype *ref)
+.. c:function:: const itemtype *Z_const_find_gteq(const struct Z_head *, const itemtype *ref)
.. c:function:: itemtype *Z_find_gteq(struct Z_head *, const itemtype *ref)
Search the list for an item that compares greater or equal to
``ref``. See :c:func:`Z_find()` above.
-.. c:function:: const itemtype *Z_find_lt(const struct Z_head *, const itemtype *ref)
+.. c:function:: const itemtype *Z_const_find_lt(const struct Z_head *, const itemtype *ref)
.. c:function:: itemtype *Z_find_lt(struct Z_head *, const itemtype *ref)
Search the list for an item that compares less than