16 The optional Search-Order word set

Make the compilation word list the same as the first word list in the search order. Specifies that the names of subsequent definitions will be placed in the compilation word list. Subsequent changes in the search order will not affect the compilation word list.

Find the definition named in the counted string at c-addr. If the definition is not found after searching all the word lists in the search order, return c-addr and zero. If the definition is found, return xt. If the definition is immediate, also return one (1); otherwise also return minus-one (-1). For a given string, the values returned by FIND while compiling may differ from those returned while not compiling.

Return wid, the identifier of the word list that includes all standard words provided by the implementation. This word list is initially the compilation word list and is part of the initial search order.

Return wid, the identifier of the compilation word list.

Returns the number of word lists n in the search order and the word list identifiers wid_n ... wid₁ identifying these word lists. wid₁ identifies the word list that is searched first, and wid_n the word list that is searched last. The search order is unaffected.

Find the definition identified by the string c-addr u in the word list identified by wid. If the definition is not found, return zero. If the definition is found, return its execution token xt and one (1) if the definition is immediate, minus-one (-1) otherwise.

Set the compilation word list to the word list identified by wid.

Set the search order to the word lists identified by wid_n ... wid₁. Subsequently, word list wid₁ will be searched first, and word list wid_n searched last. If n is zero, empty the search order. If n is minus one, set the search order to the implementation-defined minimum search order. The minimum search order shall include the words FORTH-WORDLIST and SET-ORDER. A system shall allow n to be at least eight.

Create a new empty word list, returning its word list identifier wid. The new word list may be returned from a pool of preallocated word lists or may be dynamically allocated in data space. A system shall allow the creation of at least 8 new word lists in addition to any provided as part of the system.

Transform the search order consisting of wid_n, ... wid₂, wid₁ (where wid₁ is searched first) into wid_n, ... wid₂, wid₁, wid₁. An ambiguous condition exists if there are too many word lists in the search order.

Transform the search order consisting of wid_n, ... wid₂, wid₁ (where wid₁ is searched first) into wid_n, ... wid₂, wid_{FORTH-WORDLIST}.

Set the search order to the implementation-defined minimum search order. The minimum search order shall include the words FORTH-WORDLIST and SET-ORDER.

Display the word lists in the search order in their search order sequence, from first searched to last searched. Also display the word list into which new definitions will be placed. The display format is implementation dependent.

ORDER may be implemented using pictured numeric output words. Consequently, its use may corrupt the transient region identified by #>.

Transform the search order consisting of wid_n, ... wid₂, wid₁ (where wid₁ is searched first) into wid_n, ... wid₂. An ambiguous condition exists if the search order was empty before PREVIOUS was executed.