aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Data update

Browse source
This commit is contained in:
Ingy döt Net 2024-07-13 15:19:22 -07:00
parent 29a5eea0d4
commit 5c1bb7bfa9
2011 changed files with 35081 additions and 3229 deletions
Download patch file Download diff file Expand all files Collapse all files

72
Task/Teacup-rim-text/REXX/teacup-rim-text.rexx
View file

@ -1,31 +1,45 @@
/*REXX pgm finds circular words (length>2), using a dictionary, suppress permutations.*/
parse arg iFID L . /*obtain optional arguments from the CL*/
if iFID==''|iFID=="," then iFID= 'wordlist.10k' /*Not specified? Then use the default.*/
if L==''| L=="," then L= 3 /* " " " " " " */
#= 0 /*number of words in dictionary, Len>L.*/
@.= /*stemmed array of non─duplicated words*/
do r=0 while lines(iFID) \== 0 /*read all lines (words) in dictionary.*/
parse upper value linein(iFID) with z . /*obtain a word from the dictionary. */
if length(z)<L | @.z\=='' then iterate /*length must be L or more, no dups.*/
if \datatype(z, 'U') then iterate /*Word contains non-letters? Then skip*/
@.z = z /*assign a word from the dictionary. */
#= # + 1; $.#= z /*bump word count; append word to list.*/
end /*r*/ /* [↑] dictionary need not be sorted. */
cw= 0 /*the number of circular words (so far)*/
say "There're " r ' entries in the dictionary (of all types): ' iFID
say "There're " # ' words in the dictionary of at least length ' L
/*REXX pgm finds circular words (length>2), using a dictionary, suppress permutations.*/
parse arg iFID L . /*obtain optional arguments from the CL */
if iFID==''|iFID=="," then iFID='unixdict.txt' /*Not specified? Then use the default*/
if L==''| L=="," then L=3 /* " " " " " " */
word.=0
have.=0
do r=0 while lines(iFID)>0 /*read all lines (words) in dictionary.*/
parse upper value linein(iFID) with w . /*obtain a word from the dictionary. */
if length(w)>=3 &, /*length must be L or more */
datatype(w,'U') &, /*Word must be all letters */
have.w=0 then do /*No duplicates */
z=word.0+1 /* number of eligible words */
word.0=z
word.z=w /*Word number z */
have.w=1 /*is available */
end /*r*/ /*dictionary need not be sorted. */
End
cw=0 /*the number of circular words (so far)*/
say 'There''re ' r ' entries (of all types) in the dictionary' iFID
say 'There''re ' word.0 ' words in the dictionary of at least length 'L
say
do j=1 for #; x= $.j; y= x /*obtain the Jth word in the list. */
if x=='' then iterate /*if a null, don't show variants. */
yy= y /*the start of a list of the variants. */
do k=1 for length(x)-1 /*"circulate" the litters in the word. */
y= substr(y, 2)left(y, 1) /*add the left letter to the right end.*/
if @.y=='' then iterate j /*if not a word, then skip this word. */
yy= yy',' y /*append to the list of the variants. */
@.y= /*nullify word to suppress permutations*/
end /*k*/
cw= cw + 1 /*bump counter of circular words found.*/
say 'circular word: ' yy /*display a circular word and variants.*/
end /*j*/
do j=1 To word.0 /* loop through words */
if word.j>'' then do /* word is available */
w=word.j /* base for circulation */
lw=length(w) /* number of letters */
cl=w
ci=1
do k=1 for lw-1 /*'circulate' the letters in the word. */
w=substr(w,2)left(w,1) /*move the first letter to the end. */
If have.w Then Do /*available word */
cl=cl','w /*add it to list */
ci=ci+1 /*list items */
have.w=0 /*no longer available */
End
Else
Leave
end /*k*/
If ci=lw Then Do /*complete list */
say 'circular word: ' cl /*display a circular word and variants.*/
cw=cw + 1 /*bump counter of circular words found.*/
End
End
end /*j*/
say
say cw ' circular words were found.' /*stick a fork in it, we're all done. */
say cw ' circular words were found.' /*stick a fork in it, we're all done. */