-\ @(#) wordslik.fth 98/01/26 1.2\r
-\\r
-\ WORDS.LIKE ( <string> -- , search for words that contain string )\r
-\\r
-\ Enter: WORDS.LIKE +\r
-\ Enter: WORDS.LIKE EMIT\r
-\\r
-\ Author: Phil Burk\r
-\ Copyright 1994 3DO, Phil Burk, Larry Polansky, Devid Rosenboom\r
-\\r
-\ The pForth software code is dedicated to the public domain,\r
-\ and any third party may reproduce, distribute and modify\r
-\ the pForth software code or any derivative works thereof\r
-\ without any compensation or license. The pForth software\r
-\ code is provided on an "as is" basis without any warranty\r
-\ of any kind, including, without limitation, the implied\r
-\ warranties of merchantability and fitness for a particular\r
-\ purpose and their equivalents under the laws of any jurisdiction.\r
-\r
-anew task-wordslik.fth\r
-decimal\r
-\r
-\r
-: PARTIAL.MATCH.NAME ( $str1 nfa -- flag , is $str1 in nfa ??? )\r
- count $ 1F and\r
- rot count\r
- search\r
- >r 2drop r>\r
-;\r
-\r
-: WORDS.LIKE ( <name> -- , print all words containing substring )\r
- BL word latest\r
- >newline\r
- BEGIN\r
- prevname dup 0<> \ get previous name in dictionary\r
- WHILE\r
- 2dup partial.match.name\r
- IF\r
- dup id. tab\r
- cr?\r
- THEN\r
- REPEAT 2drop\r
- >newline\r
-;\r
+\ @(#) wordslik.fth 98/01/26 1.2
+\
+\ WORDS.LIKE ( <string> -- , search for words that contain string )
+\
+\ Enter: WORDS.LIKE +
+\ Enter: WORDS.LIKE EMIT
+\
+\ Author: Phil Burk
+\ Copyright 1994 3DO, Phil Burk, Larry Polansky, Devid Rosenboom
+\
+\ The pForth software code is dedicated to the public domain,
+\ and any third party may reproduce, distribute and modify
+\ the pForth software code or any derivative works thereof
+\ without any compensation or license. The pForth software
+\ code is provided on an "as is" basis without any warranty
+\ of any kind, including, without limitation, the implied
+\ warranties of merchantability and fitness for a particular
+\ purpose and their equivalents under the laws of any jurisdiction.
+
+anew task-wordslik.fth
+decimal
+
+
+: PARTIAL.MATCH.NAME ( $str1 nfa -- flag , is $str1 in nfa ??? )
+ count $ 1F and
+ rot count
+ search
+ >r 2drop r>
+;
+
+: WORDS.LIKE ( <name> -- , print all words containing substring )
+ BL word latest
+ >newline
+ BEGIN
+ prevname dup 0<> \ get previous name in dictionary
+ WHILE
+ 2dup partial.match.name
+ IF
+ dup id. tab
+ cr?
+ THEN
+ REPEAT 2drop
+ >newline
+;