# Linked lists

A collection of helpers around linked lists.

Values:

llprev  After a llfind or a llitern, llprev is the element preceding the result.
        It is 0 when no iteration took place.
llidx   After a llfind or a llitern, llidx is the number of iterations that took
        place.

Words:

llinsert  elem ll --   Insert "elem" between "ll" and its next element. If "ll"
                       is the last element of the list, this is equivalent to
                       "llappend".
llcnt     ll -- n      Yield the number of elements in "ll".
llfind    elem ll -- f Check whether "elem" exists in "ll".
llitern   n ll -- elem Iterate "n" time in "ll" and return the resulting element
                       or 0 if end of list was reached.
