Remove wid and xt from the stack. Execute xt once for every word in the wordlist wid, passing the name token nt of the word to xt, until the wordlist is exhausted or until xt returns false.
The invoked xt has the stack effect ( k * x nt -- l * x flag ).
If flag is true, TRAVERSE-WORDLIST will continue with the next name, otherwise it will return. TRAVERSE-WORDLIST does not put any items other than nt on the stack when calling xt, so that xt can access and modify the rest of the stack.
TRAVERSE-WORDLIST may visit words in any order, with one exception: words with the same name are called in the order newest-to-oldest (possibly with other words in between).
An ambiguous condition exists if words are added to or deleted from the wordlist wid during the execution of TRAVERSE-WORDLIST.
184.108.40.2069.20 NAME>INTERPRET, 220.127.116.119.10 NAME>COMPILE.
prints a count of the number of words in the FORTH-WORDLIST.
GerryJackson TRAVERSE-WORDLIST is in the wrong word setComment2016-05-22 20:03:53
Despite TRAVERSE-WORDLIST being regarded as a programming tool it cannot be used or tested unless wordlists can be created which requires at least some of the words in the Search-Order word set. Therefore it belongs in the Search-Order word set.
ruv Unfindable definitionsComment2019-09-20 23:23:52
If a definition is available via
TRAVERSE-WORDLIST, can we say that it is findable in the dictionary?
Perhaps, for clarity, we should mention that unfindable definitions (e.g. not ended, or nameless, or quotations) shall not be available via
TRAVERSE-WORDLIST. Otherwise, among other issues,
SEARCH-WORDLIST cannot be correctly implemented via