Anagrams: Difference between revisions
m
Replace deprecated function
(Added Quackery.) |
m (Replace deprecated function) |
||
| (37 intermediate revisions by 22 users not shown) | |||
Line 3:
When two or more words are composed of the same characters, but in a different order, they are called [[wp:Anagram|anagrams]].
;Task
Using the word list at http://wiki.puzzlers.org/pub/wordlists/unixdict.txt,
<br>find the sets of words that share the same characters that contain the most words in them.
{{Related tasks/Word plays}}
Line 16 ⟶ 17:
=={{header|11l}}==
{{trans|Python}}
<
L(word) File(‘unixdict.txt’).read().split("\n")
anagram[sorted(word
V count = max(anagram.values().map(ana -> ana.len))
Line 24 ⟶ 25:
L(ana) anagram.values()
I ana.len == count
print(ana)</
{{out}}
<pre>
Line 36 ⟶ 37:
=={{header|8th}}==
<
\
\ anagrams.8th
Line 169 ⟶ 170:
bye
;
</syntaxhighlight>
=={{header|AArch64 Assembly}}==
{{works with|as|Raspberry Pi 3B version Buster 64 bits <br> or android 64 bits with application Termux }}
<syntaxhighlight lang="aarch64 assembly">
/* ARM assembly AARCH64 Raspberry PI 3B */
/* program anagram64.s */
/*******************************************/
/* Constantes file */
/*******************************************/
/* for this file see task include a file in language AArch64 assembly*/
.include "../includeConstantesARM64.inc"
.equ MAXI, 40000
.equ BUFFERSIZE, 300000
/*********************************/
/* Initialized data */
/*********************************/
.data
szFileName: .asciz "./listword.txt"
szMessErreur: .asciz "FILE ERROR."
szCarriageReturn: .asciz "\n"
szMessSpace: .asciz " "
ptBuffex1: .quad sBuffex1
/*********************************/
/* UnInitialized data */
/*********************************/
.bss
ptTabBuffer: .skip 8 * MAXI
ptTabAna: .skip 8 * MAXI
tbiCptAna: .skip 8 * MAXI
iNBword: .skip 8
sBuffer: .skip BUFFERSIZE
sBuffex1: .skip BUFFERSIZE
/*********************************/
/* code section */
/*********************************/
.text
.global main
main: // entry of program
mov x4,#0 // loop indice
mov x0,AT_FDCWD // current directory
ldr x1,qAdrszFileName // file name
mov x2,#O_RDWR // flags
mov x3,#0 // mode
mov x8,#OPEN //
svc 0
cmp x0,#0 // error open
ble 99f
mov x19,x0 // FD save Fd
ldr x1,qAdrsBuffer // buffer address
ldr x2,qSizeBuf // buffersize
mov x8, #READ
svc 0
cmp x0,#0 // error read ?
blt 99f
mov x5,x0 // save size read bytes
ldr x4,qAdrsBuffer // buffer address
ldr x0,qAdrsBuffer // start word address
mov x2,#0
mov x1,#0 // word length
1:
cmp x2,x5
bge 2f
ldrb w3,[x4,x2]
cmp w3,#0xD // end word ?
cinc x1,x1,ne // increment word length
cinc x2,x2,ne // increment indice
bne 1b // and loop
strb wzr,[x4,x2] // store final zero
bl anaWord // sort word letters
add x2,x2,#2 // jump OD and 0A
add x0,x4,x2 // new address begin word
mov x1,#0 // init length
b 1b // and loop
2:
strb wzr,[x4,x2] // zero final
bl anaWord // last word
mov x0,x19 // file Fd
mov x8, #CLOSE
svc 0
cmp x0,#0 // error close ?
blt 99f
ldr x0,qAdrptTabAna // address sorted string area
mov x1,#0 // first indice
ldr x2,qAdriNBword
ldr x2,[x2] // last indice
ldr x3,qAdrptTabBuffer // address sorted string area
bl triRapide // quick sort
ldr x4,qAdrptTabAna // address sorted string area
ldr x7,qAdrptTabBuffer // address sorted string area
ldr x10,qAdrtbiCptAna // address counter occurences
mov x9,x2 // size word array
mov x8,#0 // indice first occurence
ldr x3,[x4,x8,lsl #3] // load first value
mov x2,#1 // loop indice
mov x6,#0 // counter
mov x12,#0 // counter value max
3:
ldr x5,[x4,x2,lsl #3] // load next value
mov x0,x3
mov x1,x5
bl comparStrings
cmp x0,#0 // sorted strings equal ?
bne 4f
add x6,x6,#1 // yes increment counter
b 5f
4: // no
str x6,[x10,x8,lsl #3] // store counter in first occurence
cmp x6,x12 // counter > value max
csel x12,x6,x12,gt // yes counter -> value max
//movgt x12,x6 // yes counter -> value max
mov x6,#0 // raz counter
mov x8,x2 // init index first occurence
mov x3,x5 // init value first occurence
5:
add x2,x2,#1 // increment indice
cmp x2,x9 // end word array ?
blt 3b // no -> loop
mov x2,#0 // raz indice
6: // display loop
ldr x6,[x10,x2,lsl #3] // load counter
cmp x6,x12 // equal to max value ?
bne 8f
ldr x0,[x7,x2,lsl #3] // load address first word
bl affichageMess
add x3,x2,#1 // increment new indixe
mov x4,#0 // counter
7:
ldr x0,qAdrszMessSpace
bl affichageMess
ldr x0,[x7,x3,lsl #3] // load address other word
bl affichageMess
add x3,x3,#1 // increment indice
add x4,x4,#1 // increment counter
cmp x4,x6 // max value ?
blt 7b // no loop
ldr x0,qAdrszCarriageReturn
bl affichageMess
8:
add x2,x2,#1 // increment indice
cmp x2,x9 // maxi ?
blt 6b // no -> loop
b 100f
99: // display error
ldr x0,qAdrszMessErreur
bl affichageMess
100: // standard end of the program
mov x0, #0 // return code
mov x8, #EXIT // request to exit program
svc #0 // perform the system call
qAdrszCarriageReturn: .quad szCarriageReturn
qAdrszFileName: .quad szFileName
qAdrszMessErreur: .quad szMessErreur
qAdrsBuffer: .quad sBuffer
qSizeBuf: .quad BUFFERSIZE
qAdrszMessSpace: .quad szMessSpace
qAdrtbiCptAna: .quad tbiCptAna
/******************************************************************/
/* analizing word */
/******************************************************************/
/* x0 word address */
/* x1 word length */
anaWord:
stp x1,lr,[sp,-16]! // save registers
stp x2,x3,[sp,-16]! // save registers
stp x4,x5,[sp,-16]! // save registers
stp x6,x7,[sp,-16]! // save registers
mov x5,x0
mov x6,x1
ldr x1,qAdrptTabBuffer
ldr x2,qAdriNBword
ldr x3,[x2]
str x0,[x1,x3,lsl #3]
ldr x1,qAdrptTabAna
ldr x4,qAdrptBuffex1
ldr x0,[x4]
add x6,x6,x0
add x6,x6,#1
str x6,[x4]
str x0,[x1,x3,lsl #3]
add x3,x3,#1
str x3,[x2]
mov x1,x0
mov x0,x5
bl triLetters // sort word letters
mov x2,#0
100:
ldp x6,x7,[sp],16 // restaur 2 registers
ldp x4,x5,[sp],16 // restaur 2 registers
ldp x2,x3,[sp],16 // restaur 2 registers
ldp x1,lr,[sp],16 // restaur 2 registers
ret // return to address lr x30
qAdrptTabBuffer: .quad ptTabBuffer
qAdrptTabAna: .quad ptTabAna
qAdriNBword: .quad iNBword
qAdrptBuffex1: .quad ptBuffex1
/******************************************************************/
/* sort word letters */
/******************************************************************/
/* x0 address begin word */
/* x1 address recept array */
triLetters:
stp x1,lr,[sp,-16]! // save registers
stp x2,x3,[sp,-16]! // save registers
stp x4,x5,[sp,-16]! // save registers
stp x6,x7,[sp,-16]! // save registers
mov x2,#0
1:
ldrb w3,[x0,x2] // load letter
cmp w3,#0 // end word ?
beq 6f
cmp x2,#0 // first letter ?
bne 2f
strb w3,[x1,x2] // yes store in first position
add x2,x2,#1 // increment indice
b 1b // and loop
2:
mov x4,#0
3: // begin loop to search insertion position
ldrb w5,[x1,x4] // load letter
cmp w3,w5 // compare
blt 4f // to low -> insertion
add x4,x4,#1 // increment indice
cmp x4,x2 // compare to letters number in place
blt 3b // search loop
strb w3,[x1,x2] // else store in last position
add x2,x2,#1
b 1b // and loop
4: // move first letters in one position
sub x6,x2,#1 // start indice
5:
ldrb w5,[x1,x6] // load letter
add x7,x6,#1 // store indice - 1
strb w5,[x1,x7] // store letter
sub x6,x6,#1 // decrement indice
cmp x6,x4 // end ?
bge 5b // no loop
strb w3,[x1,x4] // else store letter in free position
add x2,x2,#1
b 1b // and loop
6:
strb wzr,[x1,x2] // final zéro
100:
ldp x6,x7,[sp],16 // restaur 2 registers
ldp x4,x5,[sp],16 // restaur 2 registers
ldp x2,x3,[sp],16 // restaur 2 registers
ldp x1,lr,[sp],16 // restaur 2 registers
ret // return to address lr x30
/***************************************************/
/* Appel récursif Tri Rapide quicksort */
/***************************************************/
/* x0 contains the address of table */
/* x1 contains index of first item */
/* x2 contains the number of elements > 0 */
/* x3 contains the address of table 2 */
triRapide:
stp x1,lr,[sp,-16]! // save registers
stp x2,x3,[sp,-16]! // save registers
stp x4,x5,[sp,-16]! // save registers
stp x6,x7,[sp,-16]! // save registers
mov x6,x3
sub x2,x2,#1 // last item index
cmp x1,x2 // first > last ?
bge 100f // yes -> end
mov x4,x0 // save x0
mov x5,x2 // save x2
mov x3,x6
bl partition1 // cutting.quado 2 parts
mov x2,x0 // index partition
mov x0,x4 // table address
bl triRapide // sort lower part
mov x0,x4 // table address
add x1,x2,#1 // index begin = index partition + 1
add x2,x5,#1 // number of elements
bl triRapide // sort higter part
100: // end function
ldp x6,x7,[sp],16 // restaur 2 registers
ldp x4,x5,[sp],16 // restaur 2 registers
ldp x2,x3,[sp],16 // restaur 2 registers
ldp x1,lr,[sp],16 // restaur 2 registers
ret // return to address lr x30
/******************************************************************/
/* Partition table elements */
/******************************************************************/
/* x0 contains the address of table */
/* x1 contains index of first item */
/* x2 contains index of last item */
/* x3 contains the address of table 2 */
partition1:
stp x1,lr,[sp,-16]! // save registers
stp x2,x3,[sp,-16]! // save registers
stp x4,x5,[sp,-16]! // save registers
stp x6,x7,[sp,-16]! // save registers
stp x8,x9,[sp,-16]! // save registers
stp x10,x12,[sp,-16]! // save registers
mov x8,x0 // save address table 2
mov x9,x1
ldr x10,[x8,x2,lsl #3] // load string address last index
mov x4,x9 // init with first index
mov x5,x9 // init with first index
1: // begin loop
ldr x6,[x8,x5,lsl #3] // load string address
mov x0,x6
mov x1,x10
bl comparStrings
cmp x0,#0
bge 2f
ldr x7,[x8,x4,lsl #3] // if < swap value table
str x6,[x8,x4,lsl #3]
str x7,[x8,x5,lsl #3]
ldr x7,[x3,x4,lsl #3] // swap array 2
ldr x12,[x3,x5,lsl #3]
str x7,[x3,x5,lsl #3]
str x12,[x3,x4,lsl #3]
add x4,x4,#1 // and increment index 1
2:
add x5,x5,#1 // increment index 2
cmp x5,x2 // end ?
blt 1b // no -> loop
ldr x7,[x8,x4,lsl #3] // swap value
str x10,[x8,x4,lsl #3]
str x7,[x8,x2,lsl #3]
ldr x7,[x3,x4,lsl #3] // swap array 2
ldr x12,[x3,x2,lsl #3]
str x7,[x3,x2,lsl #3]
str x12,[x3,x4,lsl #3]
mov x0,x4 // return index partition
100:
ldp x10,x12,[sp],16 // restaur 2 registers
ldp x8,x9,[sp],16 // restaur 2 registers
ldp x6,x7,[sp],16 // restaur 2 registers
ldp x4,x5,[sp],16 // restaur 2 registers
ldp x2,x3,[sp],16 // restaur 2 registers
ldp x1,lr,[sp],16 // restaur 2 registers
ret // return to address lr x30
/************************************/
/* Strings case sensitive comparisons */
/************************************/
/* x0 et x1 contains the address of strings */
/* return 0 in x0 if equals */
/* return -1 if string x0 < string x1 */
/* return 1 if string x0 > string x1 */
comparStrings:
stp x1,lr,[sp,-16]! // save registers
stp x2,x3,[sp,-16]! // save registers
stp x4,x5,[sp,-16]! // save registers
mov x2,#0 // counter
1:
ldrb w3,[x0,x2] // byte string 1
ldrb w4,[x1,x2] // byte string 2
cmp w3,w4
blt 2f // small
bgt 3f // greather
cmp x3,#0 // 0 end string
beq 4f // end string
add x2,x2,#1 // else add 1 in counter
b 1b // and loop
2:
mov x0,#-1 // small
b 100f
3:
mov x0,#1 // greather
b 100f
4:
mov x0,#0 // equal
100:
ldp x4,x5,[sp],16 // restaur 2 registers
ldp x2,x3,[sp],16 // restaur 2 registers
ldp x1,lr,[sp],16 // restaur 2 registers
ret // return to address lr x30
/********************************************************/
/* File Include fonctions */
/********************************************************/
/* for this file see task include a file in language AArch64 assembly */
.include "../includeARM64.inc"
</syntaxhighlight>
<pre>
~/.../rosetta/asm1 $ anagram64
bale able bela abel elba
cater carte crate caret trace
galen glean angle lange angel
regal glare alger lager large
lena lane lean elan neal
veil levi live vile evil
</pre>
=={{header|ABAP}}==
<
define update_progress.
call function 'SAPGUI_PROGRESS_INDICATOR'
Line 273 ⟶ 673:
return.
endif.
endform.</
{{out}}
<pre>[ angel , angle , galen , glean , lange ]
Line 283 ⟶ 683:
=={{header|Ada}}==
<
with Ada.Containers.Indefinite_Ordered_Maps;
Line 351 ⟶ 751:
Iterate (Result, Put'Access);
Close (File);
end Words_Of_Equal_Characters;</
{{out}}
<pre>
Line 364 ⟶ 764:
=={{header|ALGOL 68}}==
{{works with|ALGOL 68G|Any - tested with release 2.8.3.win32}} Uses the "read" PRAGMA of Algol 68 G to include the associative array code from the [[Associative_array/Iteration]] task.
<
# use the associative array in the Associate array/iteration task #
PR read "aArray.a68" PR
Line 456 ⟶ 856:
e := NEXT words
OD
FI</
{{out}}
<pre>
Line 466 ⟶ 866:
alger|glare|lager|large|regal
caret|carte|cater|crate|trace
</pre>
=={{header|Amazing Hopper}}==
<syntaxhighlight lang="c">
#include <basico.h>
#define MAX_LINE 30
algoritmo
fd=0, filas=0
word={}, 2da columna={}
old_word="",new_word=""
dimensionar (1,2) matriz de cadenas 'result'
pos=0
token.separador'""'
abrir para leer("basica/unixdict.txt",fd)
iterar mientras ' no es fin de archivo (fd) '
usando 'MAX_LINE', leer línea desde(fd),
---copiar en 'old_word'---, separar para 'word '
word, ---retener--- ordenar esto,
encadenar en 'new_word'
matriz.buscar en tabla (1,new_word,result)
copiar en 'pos'
si ' es negativo? '
new_word,old_word, pegar fila en 'result'
sino
#( result[pos,2] = cat(result[pos,2],cat(",",old_word) ) )
fin si
reiterar
cerrar archivo(fd)
guardar 'filas de (result)' en 'filas'
#( 2da columna = result[2:filas, 2] )
fijar separador '","'
tomar '2da columna'
contar tokens en '2da columna' ---retener resultado,
obtener máximo valor,es mayor o igual?, replicar esto
compactar esto
fijar separador 'NL', luego imprime todo
terminar
</syntaxhighlight>
{{out}}
<pre>
abel,able,bale,bela,elba
alger,glare,lager,large,regal
angel,angle,galen,glean,lange
caret,carte,cater,crate,trace
elan,lane,lean,lena,neal
evil,levi,live,veil,vile
</pre>
Line 473 ⟶ 931:
This is a rough translation of the J version, intermediate values are kept and verb trains are not used for clarity of data flow.
<syntaxhighlight lang="apl">
anagrams←{
tie←⍵ ⎕NTIE 0
Line 481 ⟶ 939:
({~' '∊¨(⊃/¯1↑[2]⍵)}ana)⌿ana ⋄ ⎕NUNTIE
}
</syntaxhighlight>
On a unix system we can assume wget exists and can use it from dyalog to download the file.
Line 487 ⟶ 945:
'''Example:'''
<syntaxhighlight lang="apl">
⎕SH'wget http://wiki.puzzlers.org/pub/wordlists/unixdict.txt'
]display anagrams 'unixdict.txt'
</syntaxhighlight>
'''Output:'''
<pre>
Line 516 ⟶ 974:
=={{header|AppleScript}}==
<syntaxhighlight lang="applescript">use AppleScript version "2.3.1" -- OS X 10.9 (Mavericks) or later.
use sorter : script ¬
"Custom Iterative Ternary Merge Sort" -- <www.macscripter.net/t/timsort-and-nigsort/71383/3>
use scripting additions
on join(lst, delim)
set astid to AppleScript's text item delimiters
set AppleScript's text item delimiters to delim
set txt to lst as text
set AppleScript's text item delimiters to astid
return txt
end join
on largestAnagramGroups(listOfWords)
script o
property wordList : listOfWords
property
property
property
on judgeGroup(i, j)
set groupSize to j - i + 1
if (groupSize < largestGroupSize) then -- Most likely.
else if (groupSize = largestGroupSize) then -- Next most likely.
set end of largestGroupRanges to {i, j}
else -- Largest group so far.
set largestGroupRanges to {{i, j}}
set largestGroupSize to groupSize
end if
end judgeGroup
on isGreater(a, b)
return a's beginning > b's beginning
end isGreater
end script
set wordCount to (count o's wordList)
ignoring case
--
set
tell sorter to sort(chrs, 1, -1, {})
set
end repeat
-- Sort the list to group its contents and echo the moves in the original word list.
tell sorter to sort(o's groupingTexts, 1, wordCount, {slave:{o's wordList}})
--
set i to 1
set currentText to beginning of o's
repeat with j from 2 to
set thisText to
if (thisText is not currentText) then
set currentText to thisText
set i to j
end if
end repeat
--
set output to {}
repeat with thisRange in o's
set {i, j} to thisRange
set thisGroup to o's wordList's items i thru j
tell sorter to sort(thisGroup, 1, -1, {}) -- Not necessary with unixdict.txt. But hey.
set end of output to thisGroup
end repeat
-- As a final flourish, sort the
tell sorter to sort(output, 1, -1, {comparer:o})
end ignoring
return
end largestAnagramGroups
local wordFile, wordList
set wordFile to ((path to desktop as text) & "www.rosettacode.org:unixdict.txt") as «class furl»
set wordList to paragraphs of (read wordFile as «class utf8»)
return largestAnagramGroups(wordList)</
{{output}}
<
=={{header|ARM Assembly}}==
{{works with|as|Raspberry Pi <br> or android 32 bits with application Termux}}
<syntaxhighlight lang="arm assembly">
/* ARM assembly Raspberry PI */
/* program anagram.s */
/* REMARK 1 : this program use routines in a include file
see task Include a file language arm assembly
for the routine affichageMess conversion10
see at end of this program the instruction include */
/* for constantes see task include a file in arm assembly */
/************************************/
/* Constantes */
/************************************/
.include "../constantes.inc"
.equ MAXI, 40000
.equ BUFFERSIZE, 300000
.equ READ, 3 @ system call
.equ OPEN, 5 @ system call
.equ CLOSE, 6 @ system call
.equ O_RDWR, 0x0002 @ open for reading and writing
/*********************************/
/* Initialized data */
/*********************************/
.data
szFileName: .asciz "./listword.txt"
szMessErreur: .asciz "FILE ERROR."
szCarriageReturn: .asciz "\n"
szMessSpace: .asciz " "
ptBuffer1: .int sBuffer1
/*********************************/
/* UnInitialized data */
/*********************************/
.bss
ptTabBuffer: .skip 4 * MAXI
ptTabAna: .skip 4 * MAXI
tbiCptAna: .skip 4 * MAXI
iNBword: .skip 4
sBuffer: .skip BUFFERSIZE
sBuffer1: .skip BUFFERSIZE
/*********************************/
/* code section */
/*********************************/
.text
.global main
main: @ entry of program
mov r4,#0 @ loop indice
ldr r0,iAdrszFileName @ file name
mov r1,#O_RDWR @ flags
mov r2,#0 @ mode
mov r7,#OPEN @
svc 0
cmp r0,#0 @ error open
ble 99f
mov r8,r0 @ FD save Fd
ldr r1,iAdrsBuffer @ buffer address
ldr r2,iSizeBuf @ buffersize
mov r7, #READ
svc 0
cmp r0,#0 @ error read ?
blt 99f
mov r5,r0 @ save size read bytes
ldr r4,iAdrsBuffer @ buffer address
ldr r0,iAdrsBuffer @ start word address
mov r2,#0
mov r1,#0 @ word length
1:
cmp r2,r5
bge 2f
ldrb r3,[r4,r2]
cmp r3,#0xD @ end word ?
addne r1,r1,#1 @ increment word length
addne r2,r2,#1 @ increment indice
bne 1b @ and loop
mov r3,#0
strb r3,[r4,r2] @ store final zero
bl anaWord @ sort word letters
add r2,r2,#2 @ jump OD and 0A
add r0,r4,r2 @ new address begin word
mov r1,#0 @ init length
b 1b @ and loop
2:
mov r3,#0 @ last word
strb r3,[r4,r2]
bl anaWord
mov r0,r8 @ file Fd
mov r7, #CLOSE
svc 0
cmp r0,#0 @ error close ?
blt 99f
ldr r0,iAdrptTabAna @ address sorted string area
mov r1,#0 @ first indice
ldr r2,iAdriNBword
ldr r2,[r2] @ last indice
ldr r3,iAdrptTabBuffer @ address sorted string area
bl triRapide @ quick sort
ldr r4,iAdrptTabAna @ address sorted string area
ldr r7,iAdrptTabBuffer @ address sorted string area
ldr r10,iAdrtbiCptAna @ address counter occurences
mov r9,r2 @ size word array
mov r8,#0 @ indice first occurence
ldr r3,[r4,r8,lsl #2] @ load first value
mov r2,#1 @ loop indice
mov r6,#0 @ counter
mov r12,#0 @ counter value max
3:
ldr r5,[r4,r2,lsl #2] @ load next value
mov r0,r3
mov r1,r5
bl comparStrings
cmp r0,#0 @ sorted strings equal ?
bne 4f
add r6,r6,#1 @ yes increment counter
b 5f
4: @ no
str r6,[r10,r8,lsl #2] @ store counter in first occurence
cmp r6,r12 @ counter > value max
movgt r12,r6 @ yes counter -> value max
mov r6,#0 @ raz counter
mov r8,r2 @ init index first occurence
mov r3,r5 @ init value first occurence
5:
add r2,r2,#1 @ increment indice
cmp r2,r9 @ end word array ?
blt 3b @ no -> loop
mov r2,#0 @ raz indice
6: @ display loop
ldr r6,[r10,r2,lsl #2] @ load counter
cmp r6,r12 @ equal to max value ?
bne 8f
ldr r0,[r7,r2,lsl #2] @ load address first word
bl affichageMess
add r3,r2,#1 @ increment new indixe
mov r4,#0 @ counter
7:
ldr r0,iAdrszMessSpace
bl affichageMess
ldr r0,[r7,r3,lsl #2] @ load address other word
bl affichageMess
add r3,r3,#1 @ increment indice
add r4,r4,#1 @ increment counter
cmp r4,r6 @ max value ?
blt 7b @ no loop
ldr r0,iAdrszCarriageReturn
bl affichageMess
8:
add r2,r2,#1 @ increment indice
cmp r2,r9 @ maxi ?
blt 6b @ no -> loop
b 100f
99: @ display error
ldr r1,iAdrszMessErreur
bl displayError
100: @ standard end of the program
mov r0, #0 @ return code
mov r7, #EXIT @ request to exit program
svc #0 @ perform the system call
iAdrszCarriageReturn: .int szCarriageReturn
iAdrszFileName: .int szFileName
iAdrszMessErreur: .int szMessErreur
iAdrsBuffer: .int sBuffer
iSizeBuf: .int BUFFERSIZE
iAdrszMessSpace: .int szMessSpace
iAdrtbiCptAna: .int tbiCptAna
/******************************************************************/
/* analizing word */
/******************************************************************/
/* r0 word address */
/* r1 word length */
anaWord:
push {r1-r6,lr}
mov r5,r0
mov r6,r1
ldr r1,iAdrptTabBuffer
ldr r2,iAdriNBword
ldr r3,[r2]
str r0,[r1,r3,lsl #2]
ldr r1,iAdrptTabAna
ldr r4,iAdrptBuffer1
ldr r0,[r4]
add r6,r6,r0
add r6,r6,#1
str r6,[r4]
str r0,[r1,r3,lsl #2]
add r3,r3,#1
str r3,[r2]
mov r1,r0
mov r0,r5
bl triLetters @ sort word letters
mov r2,#0
100:
pop {r1-r6,pc}
iAdrptTabBuffer: .int ptTabBuffer
iAdrptTabAna: .int ptTabAna
iAdriNBword: .int iNBword
iAdrptBuffer1: .int ptBuffer1
/******************************************************************/
/* sort word letters */
/******************************************************************/
/* r0 address begin word */
/* r1 address recept array */
triLetters:
push {r1-r7,lr}
mov r2,#0
1:
ldrb r3,[r0,r2] @ load letter
cmp r3,#0 @ end word ?
beq 6f
cmp r2,#0 @ first letter ?
bne 2f
strb r3,[r1,r2] @ yes store in first position
add r2,r2,#1 @ increment indice
b 1b @ and loop
2:
mov r4,#0
3: @ begin loop to search insertion position
ldrb r5,[r1,r4] @ load letter
cmp r3,r5 @ compare
blt 4f @ to low -> insertion
add r4,r4,#1 @ increment indice
cmp r4,r2 @ compare to letters number in place
blt 3b @ search loop
strb r3,[r1,r2] @ else store in last position
add r2,r2,#1
b 1b @ and loop
4: @ move first letters in one position
sub r6,r2,#1 @ start indice
5:
ldrb r5,[r1,r6] @ load letter
add r7,r6,#1 @ store indice - 1
strb r5,[r1,r7] @ store letter
sub r6,r6,#1 @ decrement indice
cmp r6,r4 @ end ?
bge 5b @ no loop
strb r3,[r1,r4] @ else store letter in free position
add r2,r2,#1
b 1b @ and loop
6:
mov r3,#0 @ final zéro
strb r3,[r1,r2]
100:
pop {r1-r7,pc}
/***************************************************/
/* Appel récursif Tri Rapide quicksort */
/***************************************************/
/* r0 contains the address of table */
/* r1 contains index of first item */
/* r2 contains the number of elements > 0 */
/* r3 contains the address of table 2 */
triRapide:
push {r2-r6,lr} @ save registers
mov r6,r3
sub r2,#1 @ last item index
cmp r1,r2 @ first > last ?
bge 100f @ yes -> end
mov r4,r0 @ save r0
mov r5,r2 @ save r2
mov r3,r6
bl partition1 @ cutting into 2 parts
mov r2,r0 @ index partition
mov r0,r4 @ table address
bl triRapide @ sort lower part
mov r0,r4 @ table address
add r1,r2,#1 @ index begin = index partition + 1
add r2,r5,#1 @ number of elements
bl triRapide @ sort higter part
100: @ end function
pop {r2-r6,lr} @ restaur registers
bx lr @ return
/******************************************************************/
/* Partition table elements */
/******************************************************************/
/* r0 contains the address of table */
/* r1 contains index of first item */
/* r2 contains index of last item */
/* r3 contains the address of table 2 */
partition1:
push {r1-r12,lr} @ save registers
mov r8,r0 @ save address table 2
mov r9,r1
ldr r10,[r8,r2,lsl #2] @ load string address last index
mov r4,r9 @ init with first index
mov r5,r9 @ init with first index
1: @ begin loop
ldr r6,[r8,r5,lsl #2] @ load string address
mov r0,r6
mov r1,r10
bl comparStrings
cmp r0,#0
ldrlt r7,[r8,r4,lsl #2] @ if < swap value table
strlt r6,[r8,r4,lsl #2]
strlt r7,[r8,r5,lsl #2]
ldrlt r7,[r3,r4,lsl #2] @ swap array 2
ldrlt r12,[r3,r5,lsl #2]
strlt r7,[r3,r5,lsl #2]
strlt r12,[r3,r4,lsl #2]
addlt r4,#1 @ and increment index 1
add r5,#1 @ increment index 2
cmp r5,r2 @ end ?
blt 1b @ no -> loop
ldr r7,[r8,r4,lsl #2] @ swap value
str r10,[r8,r4,lsl #2]
str r7,[r8,r2,lsl #2]
ldr r7,[r3,r4,lsl #2] @ swap array 2
ldr r12,[r3,r2,lsl #2]
str r7,[r3,r2,lsl #2]
str r12,[r3,r4,lsl #2]
mov r0,r4 @ return index partition
100:
pop {r1-r12,lr}
bx lr
/************************************/
/* Strings case sensitive comparisons */
/************************************/
/* r0 et r1 contains the address of strings */
/* return 0 in r0 if equals */
/* return -1 if string r0 < string r1 */
/* return 1 if string r0 > string r1 */
comparStrings:
push {r1-r4} @ save des registres
mov r2,#0 @ counter
1:
ldrb r3,[r0,r2] @ byte string 1
ldrb r4,[r1,r2] @ byte string 2
cmp r3,r4
movlt r0,#-1 @ small
movgt r0,#1 @ greather
bne 100f @ not equals
cmp r3,#0 @ 0 end string
moveq r0,#0 @ equals
beq 100f @ end string
add r2,r2,#1 @ else add 1 in counter
b 1b @ and loop
100:
pop {r1-r4}
bx lr
/***************************************************/
/* ROUTINES INCLUDE */
/***************************************************/
.include "../affichage.inc"
</syntaxhighlight>
<pre>
bale able bela abel elba
cater carte crate caret trace
galen glean angle lange angel
regal glare alger lager large
lena lane lean elan neal
veil levi live vile evil
</pre>
=={{header|Arturo}}==
<syntaxhighlight lang="rebol">wordset: map read.lines relative "unixdict.txt" => strip
anagrams: #[]
loop wordset 'word [
anagram: sort to [:char] word
unless key? anagrams anagram ->
anagrams\[anagram]: new []
anagrams\[anagram]: anagrams\[anagram] ++ word
]
loop select values anagrams 'x [5 =< size x] 'words ->
print join.with:", " words</syntaxhighlight>
{{out}}
<pre>abel, able, bale, bela, elba
alger, glare, lager, large, regal
angel, angle, galen, glean, lange
caret, carte, cater, crate, trace
elan, lane, lean, lena, neal
evil, levi, live, veil, vile</pre>
=={{header|AutoHotkey}}==
Following code should work for AHK 1.0.* and 1.1* versions:
<
Loop, Parse, Contents, % "`n", % "`r"
{ ; parsing each line of the file we just read
Line 634 ⟶ 1,482:
Else ; output only those sets of letters that scored the maximum amount of common words
Break
MsgBox, % ClipBoard := SubStr(var_Output,2) ; the result is also copied to the clipboard</
{{out}}
<pre>
Line 646 ⟶ 1,494:
=={{header|AWK}}==
<
# syntax: GAWK -f JUMBLEA.AWK UNIXDICT.TXT
{ for (i=1; i<=NF; i++) {
Line 671 ⟶ 1,519:
}
return(str)
}</
{{out}}
<pre>
Line 684 ⟶ 1,532:
Alternatively, non-POSIX version:
{{works with|gawk}}
<
{ patsplit($0, chars, ".")
Line 700 ⟶ 1,548:
if (count[i] == countMax)
print substr(accum[i], 2)
}</
=={{header|
==={{header|BaCon}}===
<syntaxhighlight lang="freebasic">OPTION COLLAPSE TRUE
DECLARE idx$ ASSOC STRING
Line 722 ⟶ 1,571:
FOR y = 0 TO x-1
IF MaxCount = AMOUNT(idx$(n$[y])) THEN PRINT n$[y], ": ", idx$(n$[y])
NEXT</
{{out}}
<pre>
Line 735 ⟶ 1,584:
</pre>
==={{header|BBC BASIC}}===
{{works with|BBC BASIC for Windows}}
<
sort% = FN_sortinit(0,0)
Line 800 ⟶ 1,649:
C% = LEN(word$)
CALL sort%, char&(0)
= $$^char&(0)</
{{out}}
<pre>
Line 810 ⟶ 1,659:
evil levi live veil vile
</pre>
=={{header|BQN}}==
<syntaxhighlight lang="bqn">words ← •FLines "unixdict.txt"
•Show¨{𝕩/˜(⊢=⌈´)≠¨𝕩} (⊐∧¨)⊸⊔ words</syntaxhighlight>
<syntaxhighlight lang="bqn">⟨ "abel" "able" "bale" "bela" "elba" ⟩
⟨ "alger" "glare" "lager" "large" "regal" ⟩
⟨ "angel" "angle" "galen" "glean" "lange" ⟩
⟨ "caret" "carte" "cater" "crate" "trace" ⟩
⟨ "elan" "lane" "lean" "lena" "neal" ⟩
⟨ "evil" "levi" "live" "veil" "vile" ⟩</syntaxhighlight>
Assumes that <code>unixdict.txt</code> is in the same folder. The [[mlochbaum/BQN|JS implementation]] must be run in Node.js to have access to the filesystem.
<code>(⊐∧¨)⊸⊔</code> is an expression which sorts all words and groups based on them.
=={{header|Bracmat}}==
Line 815 ⟶ 1,679:
This solution makes extensive use of Bracmat's computer algebra mechanisms. A trick is needed to handle words that are merely repetitions of a single letter, such as <code>iii</code>. That's why the variabe <code>sum</code> isn't initialised with <code>0</code>, but with a non-number, in this case the empty string. Also te correct handling of characters 0-9 needs a trick so that they are not numerically added: they are prepended with a non-digit, an <code>N</code> in this case. After completely traversing the word list, the program writes a file <code>product.txt</code> that can be visually inspected.
The program is not fast. (Minutes rather than seconds.)
<
& 1:?product
& whl
Line 842 ⟶ 1,706:
| out$!group
)
);</
{{out}}
<pre> abel+able+bale+bela+elba
Line 852 ⟶ 1,716:
=={{header|C}}==
<
#include <stdlib.h>
#include <string.h>
Line 1,011 ⟶ 1,875:
fclose(f1);
return 0;
}</
{{out}} (less than 1 second on old P500)
<pre>5:vile, veil, live, levi, evil,
Line 1,021 ⟶ 1,885:
</pre>
A much shorter version with no fancy data structures:
<
#include <stdlib.h>
#include <string.h>
Line 1,121 ⟶ 1,985:
close(fd);
return 0;
}</
{{out}}
<pre>
Line 1,133 ⟶ 1,997:
=={{header|C sharp|C#}}==
<
using System.IO;
using System.Linq;
Line 1,162 ⟶ 2,026:
}
}
}</
{{out}}
<pre>
Line 1,174 ⟶ 2,038:
=={{header|C++}}==
<
#include <fstream>
#include <string>
Line 1,208 ⟶ 2,072:
}
return 0;
}</
{{out}}
abel, able, bale, bela, elba,
Line 1,219 ⟶ 2,083:
=={{header|Clojure}}==
Assume ''wordfile'' is the path of the local file containing the words. This code makes a map (''groups'') whose keys are sorted letters and values are lists of the key's anagrams. It then determines the length of the longest list, and prints out all the lists of that length.
<
(def groups
Line 1,228 ⟶ 2,092:
maxlength (count (first wordlists))]
(doseq [wordlist (take-while #(= (count %) maxlength) wordlists)]
(println wordlist))</
<
(->> (slurp "http://wiki.puzzlers.org/pub/wordlists/unixdict.txt")
clojure.string/split-lines
Line 1,245 ⟶ 2,109:
;; ["evil" "levi" "live" "veil" "vile"]
;; ["abel" "able" "bale" "bela" "elba"])
</syntaxhighlight>
=={{header|CLU}}==
<syntaxhighlight lang="clu">% Keep a list of anagrams
anagrams = cluster is new, add, largest_size, sets
anagram_set = struct[letters: string, words: array[string]]
rep = array[anagram_set]
new = proc () returns (cvt)
return(rep$[])
end new
% Sort the letters in a string
sort = proc (s: string) returns (string)
chars: array[int] := array[int]$fill(0,256,0) % Assuming ASCII here
for c: char in string$chars(s) do
i: int := char$c2i(c)
chars[i] := chars[i] + 1
end
sorted: array[char] := array[char]$predict(1,string$size(s))
for i: int in array[int]$indexes(chars) do
for j: int in int$from_to(1,chars[i]) do
array[char]$addh(sorted,char$i2c(i))
end
end
return(string$ac2s(sorted))
end sort
% Add a word
add = proc (a: cvt, s: string)
letters: string := sort(s)
as: anagram_set
begin
for t_as: anagram_set in rep$elements(a) do
if t_as.letters = letters then
as := t_as
exit found
end
end
as := anagram_set${letters: letters, words: array[string]$[]}
rep$addh(a, as)
end except when found: end
array[string]$addh(as.words, s)
end add
% Find the size of the largest set
largest_size = proc (a: cvt) returns (int)
size: int := 0
for as: anagram_set in rep$elements(a) do
cur: int := array[string]$size(as.words)
if cur > size then size := cur end
end
return(size)
end largest_size
% Yield all sets of a given size
sets = iter (a: cvt, s: int) yields (sequence[string])
for as: anagram_set in rep$elements(a) do
if array[string]$size(as.words) = s then
yield(sequence[string]$a2s(as.words))
end
end
end sets
end anagrams
start_up = proc ()
an: anagrams := anagrams$new()
dict: stream := stream$open(file_name$parse("unixdict.txt"), "read")
while true do
anagrams$add(an, stream$getl(dict))
except when end_of_file: break end
end
stream$close(dict)
po: stream := stream$primary_output()
max: int := anagrams$largest_size(an)
stream$putl(po, "Largest amount of anagrams per set: " || int$unparse(max))
stream$putl(po, "")
for words: sequence[string] in anagrams$sets(an, max) do
for word: string in sequence[string]$elements(words) do
stream$putleft(po, word, 7)
end
stream$putl(po, "")
end
end start_up</syntaxhighlight>
{{out}}
<pre>Largest amount of anagrams per set: 5
abel able bale bela elba
alger glare lager large regal
angel angle galen glean lange
caret carte cater crate trace
elan lane lean lena neal
evil levi live veil vile</pre>
=={{header|COBOL}}==
Tested with GnuCOBOL 2.0. ALLWORDS output display trimmed for width.
<
*> wget http://wiki.puzzlers.org/pub/wordlists/unixdict.txt
*> or visit https://sourceforge.net/projects/souptonuts/files
Line 1,492 ⟶ 2,450:
.
end program anagrams.</
{{out}}
Line 1,524 ⟶ 2,482:
=={{header|CoffeeScript}}==
<
show_large_anagram_sets = (word_lst) ->
Line 1,554 ⟶ 2,512:
req.end()
get_word_list show_large_anagram_sets</
{{out}}
<
[ 'abel', 'able', 'bale', 'bela', 'elba' ]
[ 'alger', 'glare', 'lager', 'large', 'regal' ]
Line 1,562 ⟶ 2,520:
[ 'caret', 'carte', 'cater', 'crate', 'trace' ]
[ 'elan', 'lane', 'lean', 'lena', 'neal' ]
[ 'evil', 'levi', 'live', 'veil', 'vile' ]</
=={{header|Common Lisp}}==
{{libheader|DRAKMA}} to retrieve the wordlist.
<
(let ((words (drakma:http-request url :want-stream t))
(wordsets (make-hash-table :test 'equalp)))
Line 1,588 ⟶ 2,546:
else if (eql (car pair) maxcount)
do (push (cdr pair) maxwordsets)
finally (return (values maxwordsets maxcount)))))</
Evalutating
<
(pprint wordsets)
(print count))</
{{out}}
<pre>(("vile" "veil" "live" "levi" "evil")
Line 1,602 ⟶ 2,560:
5</pre>
Another method, assuming file is local:
<
(with-open-file (stream file)
(loop with w = "" while w collect (setf w (read-line stream nil)))))
Line 1,620 ⟶ 2,578:
longest))
(format t "~{~{~a ~}~^~%~}" (anagram "unixdict.txt"))</
{{out}}
<pre>elba bela bale able abel
Line 1,631 ⟶ 2,589:
=={{header|Component Pascal}}==
BlackBox Component Builder
<
MODULE BbtAnagrams;
IMPORT StdLog,Files,Strings,Args;
Line 1,807 ⟶ 2,765:
END BbtAnagrams.
</syntaxhighlight>
Execute:^Q BbtAnagrams.DoProcess unixdict.txt~<br/>
{{out}}
Line 1,824 ⟶ 2,782:
=={{header|Crystal}}==
{{trans|Ruby}}
<
response = HTTP::Client.get("http://wiki.puzzlers.org/pub/wordlists/unixdict.txt")
Line 1,846 ⟶ 2,804:
anagram.each_value { |ana| puts ana if ana.size >= count }
end
</syntaxhighlight>
{{out}}
Line 1,860 ⟶ 2,818:
=={{header|D}}==
===Short Functional Version===
<
void main() {
Line 1,868 ⟶ 2,826:
immutable m = an.byValue.map!q{ a.length }.reduce!max;
writefln("%(%s\n%)", an.byValue.filter!(ws => ws.length == m));
}</
{{out}}
<pre>["caret", "carte", "cater", "crate", "trace"]
Line 1,880 ⟶ 2,838:
===Faster Version===
Less safe, same output.
<
import std.stdio, std.algorithm, std.file, std.string;
Line 1,893 ⟶ 2,851:
immutable m = anags.byValue.map!q{ a.length }.reduce!max;
writefln("%(%-(%s %)\n%)", anags.byValue.filter!(ws => ws.length == m));
}</
Runtime: about 0.06 seconds.
Line 1,900 ⟶ 2,858:
{{libheader| System.Classes}}
{{libheader| System.Diagnostics}}
<syntaxhighlight lang="delphi">
program AnagramsTest;
Line 2,027 ⟶ 2,985:
end.
</syntaxhighlight>
{{out}}
Line 2,046 ⟶ 3,004:
=={{header|E}}==
<
when (def wordText := <http://wiki.puzzlers.org/pub/wordlists/unixdict.txt> <- getText()) -> {
def words := wordText.split("\n")
Line 2,067 ⟶ 3,025:
println(anagramGroup.snapshot())
}
}</
=={{header|EchoLisp}}==
For a change, we will use the french dictionary - '''(lib 'dico.fr)''' - delivered within EchoLisp.
<
(require 'struct)
(require 'hash)
Line 2,107 ⟶ 3,065:
(cdr h))
))
</syntaxhighlight>
{{out}}
<
(length mots-français)
→ 209315
Line 2,119 ⟶ 3,077:
→ { alisen enlias enlisa ensila islaen islean laines lianes salien saline selina }
</syntaxhighlight>
=={{header|Eiffel}}==
<syntaxhighlight lang="eiffel">
class
ANAGRAMS
Line 2,210 ⟶ 3,168:
end
</syntaxhighlight>
{{out}}
<pre>
Line 2,223 ⟶ 3,181:
=={{header|Ela}}==
{{trans|Haskell}}
<
groupon f x y = f x == f y
Line 2,236 ⟶ 3,194:
let wix = groupBy (groupon fst) << sort $ zip (map sort words) words
let mxl = maximum $ map length wix
mapM_ (putLn << map snd) << filter ((==mxl) << length) $ wix</
{{out}}<pre>["vile","veil","live","levi","evil"]
Line 2,247 ⟶ 3,205:
=={{header|Elena}}==
ELENA
<
import system'calendar;
import system'io;
Line 2,255 ⟶ 3,213:
import extensions'routines;
import extensions'text;
import algorithms;
extension op
Line 2,268 ⟶ 3,227:
auto dictionary := new Map<string,object>();
File.assign("unixdict.txt").forEachLine::(word)
{
var key := word.normalized();
Line 2,278 ⟶ 3,237:
};
item.append
};
dictionary.Values
.
.top
.forEach::(pair){ console.printLine(pair.Item2) };
var end := now;
Line 2,293 ⟶ 3,252:
console.readChar()
}</
{{out}}
<pre>
abel,able,bale,bela,elba
alger,glare,lager,large,regal
evil,levi,live,veil,vile
elan,lane,lean,lena,neal
caret,carte,cater,crate,trace
angel,angle,galen,glean,lange
are,ear,era,rae
dare,dear,erda,read
diet,edit,tide,tied
cereus,recuse,rescue,secure
ames,mesa,same,seam
emit,item,mite,time
amen,mane,mean,name
enol,leon,lone,noel
esprit,priest,sprite,stripe
beard,bread,debar,debra
hare,hear,hera,rhea
apt,pat,pta,tap
aires,aries,arise,raise
keats,skate,stake,steak
</pre>
=={{header|Elixir}}==
<
def find(file) do
File.read!(file)
Line 2,334 ⟶ 3,293:
end
Anagrams.find("unixdict.txt")</
{{out}}
Line 2,347 ⟶ 3,306:
The same output, using <code>File.Stream!</code> to generate <code>tuples</code> containing the word and it's sorted value as <code>strings</code>.
<
|> Stream.map(&String.strip &1)
|> Enum.group_by(&String.codepoints(&1) |> Enum.sort)
Line 2,354 ⟶ 3,313:
|> Enum.max
|> elem(1)
|> Enum.each(fn n -> Enum.sort(n) |> Enum.join(" ") |> IO.puts end)</
{{out}}
Line 2,368 ⟶ 3,327:
=={{header|Erlang}}==
The function fetch/2 is used to solve [[Anagrams/Deranged_anagrams]]. Please keep backwards compatibility when editing. Or update the other module, too.
<
-compile(export_all).
Line 2,397 ⟶ 3,356:
get_value([], _, _, L) ->
L.
</syntaxhighlight>
{{out}}
<pre>
Line 2,411 ⟶ 3,370:
=={{header|Euphoria}}==
<
function compare_keys(sequence a, sequence b)
Line 2,459 ⟶ 3,418:
puts(1,"\n")
end if
end for</
{{out}}
<pre>abel bela bale elba able
Line 2,471 ⟶ 3,430:
=={{header|F Sharp|F#}}==
Read the lines in the dictionary, group by the sorted letters in each word, find the length of the longest sets of anagrams, extract the longest sequences of words sharing the same letters (i.e. anagrams):
<
Seq.map snd xss |> Seq.filter (Seq.length >> ( = ) (Seq.map (snd >> Seq.length) xss |> Seq.max))</
Note that it is necessary to convert the sorted letters in each word from sequences to arrays because the groupBy function uses the default comparison and sequences do not compare structurally (but arrays do in F#).
Takes 0.8s to return:
<
seq
[seq ["abel"; "able"; "bale"; "bela"; "elba"];
Line 2,483 ⟶ 3,442:
seq ["caret"; "carte"; "cater"; "crate"; "trace"];
seq ["elan"; "lane"; "lean"; "lena"; "neal"];
seq ["evil"; "levi"; "live"; "veil"; "vile"]]</
=={{header|Fantom}}==
<
{
// take given word and return a string rearranging characters in order
Line 2,528 ⟶ 3,487:
}
}
}</
{{out}}
Line 2,541 ⟶ 3,500:
=={{header|Fortran}}==
This program:
<
module anagram_routines
!***************************************************************************************
Line 2,715 ⟶ 3,674:
!***************************************************************************************
end program main
!***************************************************************************************</
{{out}}
Line 2,733 ⟶ 3,692:
=={{header|FBSL}}==
'''A little bit of cheating: literatim re-implementation of C solution in FBSL's Dynamic C layer.'''
<
DIM gtc = GetTickCount()
Line 2,892 ⟶ 3,851:
fclose(f1);
}
END DYNC</
{{out}} (2.2GHz Intel Core2 Duo)
<pre>25104 words in dictionary max ana=5
Line 2,907 ⟶ 3,866:
=={{header|Factor}}==
<
[ [ natural-sort >string ] keep ] { } map>assoc sort-keys
[ [ first ] compare +eq+ = ] monotonic-split
dup 0 [ length max ] reduce '[ length _ = ] filter [ values ] map .</
<
{ "abel" "able" "bale" "bela" "elba" }
{ "caret" "carte" "cater" "crate" "trace" }
Line 2,918 ⟶ 3,877:
{ "elan" "lane" "lean" "lena" "neal" }
{ "evil" "levi" "live" "veil" "vile" }
}</
=={{header|FreeBASIC}}==
<
Type IndexedWord
Line 3,056 ⟶ 4,015:
Print
Print "Press any key to quit"
Sleep</
{{out}}
Line 3,074 ⟶ 4,033:
=={{header|Frink}}==
<
d = new dict
for w = lines["http://wiki.puzzlers.org/pub/wordlists/unixdict.txt"]
Line 3,091 ⟶ 4,050:
i = i + 1
}
</syntaxhighlight>
=={{header|FutureBasic}}==
Applications in the latest versions of Macintosh OS X 10.x are sandboxed and require setting special permissions to link to internet files. For illustration purposes here, this code uses the internal Unix dictionary file available
<syntaxhighlight lang="futurebasic">
include "NSLog.incl"
local fn Dictionary as CFArrayRef
CFURLRef url = fn URLFileURLWithPath( @"/usr/share/dict/words" )
CFStringRef string = fn StringWithContentsOfURL( url, NSUTF8StringEncoding, NULL )
end fn = fn StringComponentsSeparatedByString( string, @"\n" )
local fn IsAnagram( wrd1 as CFStringRef, wrd2 as CFStringRef ) as BOOL
NSUInteger i
BOOL result = NO
if ( len(wrd1) != len(wrd2) ) then exit fn
if ( fn StringCompare( wrd1, wrd2 ) == NSOrderedSame ) then exit fn
CFMutableArrayRef mutArr1 = fn MutableArrayWithCapacity(0) : CFMutableArrayRef mutArr2 = fn MutableArrayWithCapacity(0)
for i = 0 to len(wrd1) - 1
MutableArrayAddObject( mutArr1, fn StringWithFormat( @"%C", fn StringCharacterAtIndex( wrd1, i ) ) )
MutableArrayAddObject( mutArr2, fn StringWithFormat( @"%C", fn StringCharacterAtIndex( wrd2, i ) ) )
next
SortDescriptorRef sd = fn SortDescriptorWithKeyAndSelector( NULL, YES, @"caseInsensitiveCompare:" )
if ( fn ArrayIsEqual( fn ArraySortedArrayUsingDescriptors( mutArr1, @[sd] ), fn ArraySortedArrayUsingDescriptors( mutArr2, @[sd] ) ) ) then result = YES
end fn = result
void local fn FindAnagramsInDictionary( wd as CFStringRef, dict as CFArrayRef )
CFStringRef string, temp
CFMutableArrayRef words = fn MutableArrayWithCapacity(0)
if ( fn IsAnagram( lcase( wd ), temp ) ) then MutableArrayAddObject( words, temp )
next
string = fn ArrayComponentsJoinedByString( words, @", " )
NSLogSetTextColor( fn ColorText ) : NSLog( @"Anagrams for %@:", lcase(wd) )
NSLogSetTextColor( fn ColorSystemBlue ) : NSLog(@"%@\n",string)
end fn
void local fn DoIt
CFArrayRef dictionary = fn Dictionary
dispatchglobal
CFStringRef string
CFArrayRef words = @[@"bade",@"abet",@"beast",@"tuba",@"mace",@"scare",@"marine",@"antler",@"spare",@"leading",@"alerted",@"allergy",@"research",@"hustle",@"oriental",@"creationism",@"resistance",@"mountaineer"]
for string in words
fn FindAnagramsInDictionary( string, dictionary )
next
dispatchend
end fn
fn DoIt
HandleEvents
</syntaxhighlight>
Output:
<pre>
Line 3,219 ⟶ 4,129:
</pre>
This version fulfils the task description.
<syntaxhighlight lang="futurebasic">
include "NSLog.incl"
#plist NSAppTransportSecurity @{NSAllowsArbitraryLoads:YES}
local fn Dictionary as CFArrayRef
CFURLRef url = fn URLWithString( @"http://wiki.puzzlers.org/pub/wordlists/unixdict.txt" )
CFStringRef string = fn StringWithContentsOfURL( url, NSUTF8StringEncoding, NULL )
end fn = fn StringComponentsSeparatedByCharactersInSet( string, fn CharacterSetNewlineSet )
local fn TestIndexes( array as CFArrayRef, obj as CFTypeRef, index as NSUInteger, stp as ^BOOL, userData as ptr ) as BOOL
end fn = fn StringIsEqual( obj, userData )
void local fn IndexSetEnumerator( set as IndexSetRef, index as NSUInteger, stp as ^BOOL, userData as ptr )
NSLog(@"\t%@\b",fn ArrayObjectAtIndex( userData, index ))
end fn
void local fn
CFArrayRef words
CFStringRef string, sortedString
IndexSetRef indexes
long i, j, count, indexCount, maxCount = 0, length
CFMutableDictionaryRef anagrams
CFTimeInterval ti
ti = fn CACurrentMediaTime
NSLog(@"Searching...")
// create another word list with sorted letters
words = fn Dictionary
count = len(words)
sortedWords = fn MutableArrayWithCapacity(count)
for string in words
length = len(string)
letters = fn MutableArrayWithCapacity(length)
for i = 0 to length - 1
MutableArrayAddObject( letters, mid(string,i,1) )
next
MutableArraySortUsingSelector( letters, @"compare:" )
sortedString = fn ArrayComponentsJoinedByString( letters, @"" )
MutableArrayAddObject( sortedWords, sortedString )
next
// search for identical sorted words
anagrams = fn MutableDictionaryWithCapacity(0)
for i = 0 to count - 2
j = i + 1
indexes = fn ArrayIndexesOfObjectsAtIndexesPassingTest( sortedWords, fn IndexSetWithIndexesInRange( fn CFRangeMake(j,count-j) ), NSEnumerationConcurrent, @fn TestIndexes, (ptr)sortedWords[i] )
indexCount = len(indexes)
if ( indexCount > maxCount )
maxCount = indexCount
MutableDictionaryRemoveAllObjects( anagrams )
end if
if ( indexCount == maxCount )
MutableDictionarySetValueForKey( anagrams, indexes, words[i] )
end if
next
// show results
NSLogClear
for string in anagrams
NSLog(@"%@\b",string)
indexes = anagrams[string]
IndexSetEnumerateIndexes( indexes, @fn IndexSetEnumerator, (ptr)words )
NSLog(@"")
next
NSLog(@"\nCalculated in %0.6fs",fn CACurrentMediaTime - ti)
end fn
dispatchglobal
fn DoIt
dispatchend
HandleEvents
</syntaxhighlight>
{{out}}
<pre>
alger glare lager large regal
caret carte cater crate trace
elan lane lean lena neal
abel able bale bela elba
evil levi live veil vile
angel angle galen glean lange
Calculated in 2.409008s
</pre>
=={{header|GAP}}==
<
local f, p, L, line, word, words, swords, res, cur, r;
words := [ ];
Line 3,449 ⟶ 4,277:
# [ "alger", "glare", "lager", "large", "regal" ],
# [ "elan", "lane", "lean", "lena", "neal" ],
# [ "evil", "levi", "live", "veil", "vile" ] ]</
=={{header|Go}}==
<
import (
Line 3,498 ⟶ 4,326:
func (b byteSlice) Len() int { return len(b) }
func (b byteSlice) Swap(i, j int) { b[i], b[j] = b[j], b[i] }
func (b byteSlice) Less(i, j int) bool { return b[i] < b[j] }</
{{out}}
<pre>
Line 3,511 ⟶ 4,339:
=={{header|Groovy}}==
This program:
<
def groups = words.groupBy{ it.toList().sort() }
def bigGroupSize = groups.collect{ it.value.size() }.max()
def isBigAnagram = { it.value.size() == bigGroupSize }
println groups.findAll(isBigAnagram).collect{ it.value }.collect{ it.join(' ') }.join('\n')</
{{out}}
<pre>
Line 3,527 ⟶ 4,355:
=={{header|Haskell}}==
<
groupon f x y = f x == f y
Line 3,536 ⟶ 4,364:
wix = groupBy (groupon fst) . sort $ zip (map sort words) words
mxl = maximum $ map length wix
mapM_ (print . map snd) . filter ((==mxl).length) $ wix</
{{out}}
<
["abel","able","bale","bela","elba"]
["caret","carte","cater","crate","trace"]
Line 3,544 ⟶ 4,372:
["alger","glare","lager","large","regal"]
["elan","lane","lean","lena","neal"]
["evil","levi","live","veil","vile"]</
and we can noticeably speed up the second stage sorting and grouping by packing the String lists of Chars to the Text type:
<
import Data.Ord (comparing)
import Data.Function (on)
Line 3,559 ⟶ 4,387:
mapM_
(print . fmap snd)
(filter ((length (maximumBy (comparing length) ws) ==) . length) ws)</
{{Out}}
<pre>["abel","able","bale","bela","elba"]
Line 3,569 ⟶ 4,397:
=={{header|Icon}} and {{header|Unicon}}==
<
every writeSet(!getLongestAnagramSets())
end
Line 3,602 ⟶ 4,430:
every (s := "") ||:= (find(c := !cset(w),w),c)
return s
end</
Sample run:
<pre>->an <unixdict.txt
Line 3,615 ⟶ 4,443:
=={{header|J}}==
If the unixdict file has been retrieved and saved in the current directory (for example, using wget):
<
+-----+-----+-----+-----+-----+
|abel |able |bale |bela |elba |
Line 3,628 ⟶ 4,456:
+-----+-----+-----+-----+-----+
|evil |levi |live |veil |vile |
+-----+-----+-----+-----+-----+</
Explanation:
<
This reads in the dictionary and produces a list of boxes. Each box contains one line (one word) from the dictionary.
<
This groups the words into rows where anagram equivalents appear in the same row. In other words, creates a copy of the original list where the characters contained in each box have been sorted. Then it organizes the contents of the original list in rows, with each new row keyed by the values in the new list.
<
This selects rows whose last element is not an empty box.<br>
(In the previous step we created an array of rows of boxes. The short rows were automatically padded with empty boxes so that all rows would be the same length.)
Line 3,641 ⟶ 4,469:
The key to this algorithm is the sorting of the characters in each word from the dictionary. The line <tt>Arrays.sort(chars);</tt> sorts all of the letters in the word in ascending order using a built-in [[quicksort]], so all of the words in the first group in the result end up under the key "aegln" in the anagrams map.
{{works with|Java|1.5+}}
<
import java.io.*;
import java.util.*;
Line 3,670 ⟶ 4,498:
System.out.println(ana);
}
}</
{{works with|Java|1.8+}}
<
import java.io.*;
import java.util.*;
Line 3,724 ⟶ 4,552:
;
}
}</
{{out}}
[angel, angle, galen, glean, lange]
Line 3,736 ⟶ 4,564:
===ES5===
{{Works with|Node.js}}
<
var words = fs.readFileSync('unixdict.txt', 'UTF-8').split('\n');
Line 3,758 ⟶ 4,586:
}
}
}</
{{Out}}
Line 3,769 ⟶ 4,597:
Alternative using reduce:
<
var dictionary = fs.readFileSync('unixdict.txt', 'UTF-8').split('\n');
Line 3,790 ⟶ 4,618:
keysSortedByFrequency.slice(0, 10).forEach(function (key) {
console.log(sortedDict[key].join(' '));
});</
Line 3,798 ⟶ 4,626:
Using JavaScript for Automation
(A JavaScriptCore interpreter on macOS with an Automation library).
<
'use strict';
Line 3,965 ⟶ 4,793:
// MAIN ---
return main();
})();</
{{Out}}
<pre>[
Line 4,013 ⟶ 4,841:
=={{header|jq}}==
<
(reduce .[] as $word (
{table: {}, max: 0}; # state
Line 4,024 ⟶ 4,852:
# The task:
split("\n") | anagrams
</syntaxhighlight>
{{Out}}
<syntaxhighlight lang="sh">
$ jq -M -s -c -R -f anagrams.jq unixdict.txt
["abel","able","bale","bela","elba"]
Line 4,034 ⟶ 4,862:
["elan","lane","lean","lena","neal"]
["evil","levi","live","veil","vile"]
</syntaxhighlight>
=={{header|Jsish}}==
From Javascript, nodejs entry.
<
var datafile = 'unixdict.txt';
if (console.args[0] == '-more' && Interp.conf('maxArrayList') > 500000)
Line 4,076 ⟶ 4,904:
evil levi live veil vile
=!EXPECTEND!=
*/</
{{out}}
Line 4,086 ⟶ 4,914:
=={{header|Julia}}==
{{works with|Julia|1.6}}
<
wordlist = open(readlines, download(url))
Line 4,101 ⟶ 4,929:
end
println.(anagram(wordlist))</
{{out}}
Line 4,112 ⟶ 4,940:
=={{header|K}}==
<
=={{header|Kotlin}}==
{{trans|Java}}
<
import java.io.InputStreamReader
import java.net.URL
Line 4,141 ⟶ 4,969:
.filter { it.size == count }
.forEach { println(it) }
}</
{{out}}
Line 4,154 ⟶ 4,982:
=={{header|Lasso}}==
<
anagrams = map,
words = include_url('http://wiki.puzzlers.org/pub/wordlists/unixdict.txt')->split('\n'),
Line 4,181 ⟶ 5,009:
#findings -> join('<br />\n')
</syntaxhighlight>
{{out}}
<pre>abel, able, bale, bela, elba
Line 4,191 ⟶ 5,019:
=={{header|Liberty BASIC}}==
<
open "unixdict.txt" for input as #1
while not(eof(#1))
Line 4,261 ⟶ 5,089:
sorted$=sorted$+chrSort$(chr)
next
end function</
=={{header|LiveCode}}==
LiveCode could definitely use a sort characters command. As it is this code converts the letters into items and then sorts that. I wrote a merge sort for characters, but the conversion to items, built-in-sort, conversion back to string is about 10% faster, and certainly easier to write.
<
put mostCommonAnagrams(url "http://wiki.puzzlers.org/pub/wordlists/unixdict.txt")
end mouseUp
Line 4,304 ⟶ 5,132:
replace comma with empty in X
return X
end itemsToChars</
{{out}}
<pre>abel,able,bale,bela,elba
Line 4,315 ⟶ 5,143:
=={{header|Lua}}==
Lua's core library is very small and does not include built-in network functionality. If a networking library were imported, the local file in the following script could be replaced with the remote dictionary file.
<
local bytes = {word:byte(1, -1)}
table.sort(bytes)
return string.char(table.unpack(bytes))
end
Line 4,338 ⟶ 5,166:
print('') -- Finish with a newline.
end
end</
{{out}}
<pre>abel able bale bela elba
Line 4,348 ⟶ 5,176:
=={{header|M4}}==
<
changequote(`[',`]')
define([for],
Line 4,393 ⟶ 5,221:
_max
for([x],1,_n,[ifelse(_get([count],x),_max,[_get([list],x)
])])</
Memory limitations keep this program from working on the full-sized dictionary.
Line 4,411 ⟶ 5,239:
The convert call discards the hashes, which have done their job, and leaves us with a list L of anagram sets.
Finally, we just note the size of the largest sets of anagrams, and pick those off.
<syntaxhighlight lang="maple">
words := HTTP:-Get( "http://wiki.puzzlers.org/pub/wordlists/unixdict.txt" )[2]: # ignore errors
use StringTools, ListTools in
Line 4,419 ⟶ 5,247:
m := max( map( nops, L ) ); # what is the largest set?
A := select( s -> evalb( nops( s ) = m ), L ); # get the maximal sets of anagrams
</syntaxhighlight>
The result of running this code is
<syntaxhighlight lang="maple">
A := [{"abel", "able", "bale", "bela", "elba"}, {"angel", "angle", "galen",
"glean", "lange"}, {"alger", "glare", "lager", "large", "regal"}, {"evil",
"levi", "live", "veil", "vile"}, {"caret", "carte", "cater", "crate", "trace"}
, {"elan", "lane", "lean", "lena", "neal"}];
</syntaxhighlight>
=={{header|Mathematica}}/{{header|Wolfram Language}}==
Download the dictionary, split the lines, split the word in characters and sort them. Now sort by those words, and find sequences of equal 'letter-hashes'. Return the longest sequences:
<
text={#,StringJoin@@Sort[Characters[#]]}&/@list;
text=SortBy[text,#[[2]]&];
splits=Split[text,#1[[2]]==#2[[2]]&][[All,All,1]];
maxlen=Max[Length/@splits];
Select[splits,Length[#]==maxlen&]</
gives back:
<
An alternative is faster, but requires version 7 (for <code>Gather</code>):
<
maxlen = Max[Length /@ splits];
Select[splits, Length[#] == maxlen &]</
Or using build-in functions for sorting and gathering elements in lists it can be implimented as:
<
anagramGroups[[-1]]</
Also, Mathematica's own word list is available; replacing the list definition with <code>list = WordData[];</code> and forcing <code>maxlen</code> to 5 yields instead this result:
Line 4,467 ⟶ 5,295:
Also if using Mathematica 10 it gets really concise:
<
MaximalBy[GatherBy[list, Sort@*Characters], Length]</
=={{header|Maxima}}==
<
while stringp(s: readline(file)) do L: cons(s, L), close(file), L)$
Line 4,509 ⟶ 5,337:
["angel", "angle", "galen", "glean", "lange"],
["caret", "carte", "cater", "crate", "trace"],
["abel", "able", "bale", "bela", "elba"]] */</
=={{header|MiniScript}}==
This implementation is for use with the [http://miniscript.org/MiniMicro Mini Micro] version of MiniScript. The command-line version does not include a HTTP library. The script can be modified to use the file class to read a local copy of the word list.
<syntaxhighlight lang="miniscript">
wordList = http.get("http://wiki.puzzlers.org/pub/wordlists/unixdict.txt").split(char(10))
makeKey = function(word)
return word.split("").sort.join("")
end function
wordSets = {}
for word in wordList
k = makeKey(word)
if not wordSets.hasIndex(k) then
wordSets[k] = [word]
else
wordSets[k].push(word)
end if
end for
counts = []
for wordSet in wordSets.values
counts.push([wordSet.len, wordSet])
end for
counts.sort(0, false)
maxCount = counts[0][0]
for count in counts
if count[0] == maxCount then print count[1]
end for
</syntaxhighlight>
{{out}}
<pre>
["abel", "able", "bale", "bela", "elba"]
["alger", "glare", "lager", "large", "regal"]
["angel", "angle", "galen", "glean", "lange"]
["caret", "carte", "cater", "crate", "trace"]
["elan", "lane", "lean", "lena", "neal"]
["evil", "levi", "live", "veil", "vile"]</pre>
=={{header|MUMPS}}==
<
Set file="unixdict.txt"
Open file:"r" Use file
Line 4,546 ⟶ 5,415:
Quit
Do Anagrams</
<pre>
The anagrams with the most variations:
Line 4,562 ⟶ 5,431:
===Java–Like===
{{trans|Java}}
<
options replace format comments java crossref symbols nobinary
Line 4,622 ⟶ 5,491:
return
</syntaxhighlight>
{{out}}
<pre>
Line 4,636 ⟶ 5,505:
===Rexx–Like===
Implemented with more NetRexx idioms such as indexed strings, <tt>PARSE</tt> and the NetRexx "built–in functions".
<
options replace format comments java crossref symbols nobinary
Line 4,693 ⟶ 5,562:
Return
</syntaxhighlight>
{{out}}
<pre>
Line 4,706 ⟶ 5,575:
=={{header|NewLisp}}==
<syntaxhighlight lang="newlisp">
;;; Get the words as a list, splitting at newline
(setq data
Line 4,734 ⟶ 5,603:
;;; Print out only groups of more than 4 words
(map println (filter (fn(x) (> (length x) 4)) (group-by-key)))
</syntaxhighlight>
{{out}}
<pre>
Line 4,746 ⟶ 5,615:
=={{header|Nim}}==
<
import tables, strutils, algorithm
Line 4,765 ⟶ 5,634:
main()
</syntaxhighlight>
{{out}}
<pre>
Line 4,778 ⟶ 5,647:
=={{header|Oberon-2}}==
Oxford Oberon-2
<
MODULE Anagrams;
IMPORT Files,Out,In,Strings;
Line 4,935 ⟶ 5,804:
DoProcess("unixdict.txt");
END Anagrams.
</syntaxhighlight>
{{out}}
<pre>
Line 4,947 ⟶ 5,816:
=={{header|Objeck}}==
<
use Collection;
Line 4,987 ⟶ 5,856:
}
}
</syntaxhighlight>
{{out}}
<pre>[abel,able,bale,bela,elba]
Line 4,997 ⟶ 5,866:
=={{header|OCaml}}==
<
let l = ref [] in
let n = String.length str in
Line 5,029 ⟶ 5,898:
( List.iter (Printf.printf " %s") lw;
print_newline () )
) h</
=={{header|Oforth}}==
<
import: collect
import: quicksort
Line 5,043 ⟶ 5,912:
filter( #[ second size m == ] )
apply ( #[ second .cr ] )
;</
{{out}}
Line 5,059 ⟶ 5,928:
Two versions of this, using different collection classes.
===Version 1: Directory of arrays===
<syntaxhighlight lang="oorexx">
-- This assumes you've already downloaded the following file and placed it
-- in the current directory: http://wiki.puzzlers.org/pub/wordlists/unixdict.txt
Line 5,095 ⟶ 5,964:
say letters":" list~makestring("l", ", ")
end
</syntaxhighlight>
===Version 2: Using the relation class===
This version appears to be the fastest.
<syntaxhighlight lang="oorexx">
-- This assumes you've already downloaded the following file and placed it
-- in the current directory: http://wiki.puzzlers.org/pub/wordlists/unixdict.txt
Line 5,145 ⟶ 6,014:
say letters":" words~makestring("l", ", ")
end
</syntaxhighlight>
Timings taken on my laptop:
<pre>
Line 5,171 ⟶ 6,040:
=={{header|Oz}}==
<
%% Helper function
fun {ReadLines Filename}
Line 5,199 ⟶ 6,068:
%% Display result (make sure strings are shown as string, not as number lists)
{Inspector.object configureEntry(widgetShowStrings true)}
{Inspect LargestSets}</
=={{header|Pascal}}==
<
// assumes a local file
Line 5,289 ⟶ 6,158:
AnagramList[i].Destroy;
end.</
{{out}}
<pre>
Line 5,302 ⟶ 6,171:
=={{header|Perl}}==
<
my @words = split "\n", do { local( @ARGV, $/ ) = ( 'unixdict.txt' ); <> };
Line 5,313 ⟶ 6,182:
for my $ana (values %anagram) {
print "@$ana\n" if @$ana == $count;
}</
If we calculate <code>$max</code>, then we don't need the CPAN module:
<
$max > @$_ or $max = @$_ for values %anagram;
@$_ == $max and print "@$_\n" for values %anagram;</
{{out}}
alger glare lager large regal
Line 5,328 ⟶ 6,197:
=={{header|Phix}}==
copied from Euphoria and cleaned up slightly
<!--<
<span style="color: #004080;">integer</span> <span style="color: #000000;">fn</span> <span style="color: #0000FF;">=</span> <span style="color: #7060A8;">open</span><span style="color: #0000FF;">(</span><span style="color: #008000;">"demo/unixdict.txt"</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"r"</span><span style="color: #0000FF;">)</span>
<span style="color: #004080;">sequence</span> <span style="color: #000000;">words</span> <span style="color: #0000FF;">=</span> <span style="color: #0000FF;">{},</span> <span style="color: #000000;">anagrams</span> <span style="color: #0000FF;">=</span> <span style="color: #0000FF;">{},</span> <span style="color: #000000;">last</span><span style="color: #0000FF;">=</span><span style="color: #008000;">""</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">letters</span>
Line 5,365 ⟶ 6,234:
<span style="color: #008080;">end</span> <span style="color: #008080;">if</span>
<span style="color: #008080;">end</span> <span style="color: #008080;">for</span>
<!--</
{{out}}
<pre>
Line 5,378 ⟶ 6,247:
=={{header|Phixmonti}}==
<
"unixdict.txt" "r" fopen var f
Line 5,418 ⟶ 6,287:
len for
get len maxlen == if ? else drop endif
endfor</
Other solution
<
( )
Line 5,457 ⟶ 6,326:
len for
get len maxlen == if ? else drop endif
endfor</
{{out}}<pre>["abel", "able", "bale", "bela", "elba"]
Line 5,469 ⟶ 6,338:
=={{header|PHP}}==
<
$words = explode("\n", file_get_contents('http://wiki.puzzlers.org/pub/wordlists/unixdict.txt'));
foreach ($words as $word) {
Line 5,481 ⟶ 6,350:
if (count($ana) == $best)
print_r($ana);
?></
=={{header|Picat}}==
Using foreach loop:
<syntaxhighlight lang="picat">go =>
Dict = new_map(),
foreach(Line in read_file_lines("unixdict.txt"))
Sorted = Line.sort(),
Dict.put(Sorted, Dict.get(Sorted,"") ++ [Line] )
end,
MaxLen = max([Value.length : _Key=Value in Dict]),
println(maxLen=MaxLen),
foreach(_Key=Value in Dict, Value.length == MaxLen)
println(Value)
end,
nl.</syntaxhighlight>
{{out}}
<pre>maxLen = 5
[alger,glare,lager,large,regal]
[evil,levi,live,veil,vile]
[abel,able,bale,bela,elba]
[caret,carte,cater,crate,trace]
[angel,angle,galen,glean,lange]
[elan,lane,lean,lena,neal]</pre>
Same idea, but shorter version by (mis)using list comprehensions.
<syntaxhighlight lang="picat">go2 =>
M = new_map(),
_ = [_:W in read_file_lines("unixdict.txt"),S=sort(W),M.put(S,M.get(S,"")++[W])],
X = max([V.len : _K=V in M]),
println(maxLen=X),
[V : _=V in M, V.len=X].println.</syntaxhighlight>
{{out}}
<pre>maxLen = 5
[[evil,levi,live,veil,vile],[abel,able,bale,bela,elba],[caret,carte,cater,crate,trace],[angel,angle,galen,glean,lange],[elan,lane,lean,lena,neal],[alger,glare,lager,large,regal]]</pre>
=={{header|PicoLisp}}==
A straight-forward implementation using 'group' takes 48 seconds on a 1.7 GHz Pentium:
<
(by length sort
(by '((L) (sort (copy L))) group
(in "unixdict.txt" (make (while (line) (link @)))) ) ) )</
Using a binary tree with the 'idx' function, it takes only 0.42 seconds on the same machine, a factor of 100 faster:
<
(in "unixdict.txt"
(while (line)
Line 5,497 ⟶ 6,402:
(push (car @) Word)
(set Key (list Word)) ) ) ) )
(flip (by length sort (mapcar val (idx 'Words)))) )</
{{out}}
<pre>-> (("vile" "veil" "live" "levi" "evil") ("trace" "crate" "cater" "carte" "caret
Line 5,505 ⟶ 6,410:
=={{header|PL/I}}==
<
word_test: proc options (main);
Line 5,571 ⟶ 6,476:
end is_anagram;
end word_test;</
{{out}}
<pre>
Line 5,580 ⟶ 6,485:
=={{header|Pointless}}==
<
readFileLines("unixdict.txt")
|> reduce(logWord, {})
Line 5,593 ⟶ 6,498:
getMax(groups) =
groups |> filter(g => length(g) == maxLength)
where maxLength = groups |> map(length) |> maximum</
{{out}}
Line 5,605 ⟶ 6,510:
=={{header|PowerShell}}==
{{works with|PowerShell|2}}
<
$words = -split ($c.DownloadString('http://wiki.puzzlers.org/pub/wordlists/unixdict.txt'))
$top_anagrams = $words `
Line 5,617 ⟶ 6,522:
| Select-Object -First 1
$top_anagrams.Group | ForEach-Object { $_.Group -join ', ' }</
{{out}}
<pre>abel, able, bale, bela, elba
Line 5,626 ⟶ 6,531:
evil, levi, live, veil, vile</pre>
Another way with more .Net methods is quite a different style, but drops the runtime from 2 minutes to 1.5 seconds:
<
$uri = 'http://wiki.puzzlers.org/pub/wordlists/unixdict.txt'
Line 5,668 ⟶ 6,573:
[string]::join('', $entry.Value)
}
}</
=={{header|Processing}}==
<
void setup() {
Line 5,696 ⟶ 6,601:
}
}
}</
{{out}}
Line 5,708 ⟶ 6,613:
=={{header|Prolog}}==
{{works with|SWI-Prolog|5.10.0}}
<
anagrams:-
Line 5,756 ⟶ 6,661:
length(V1, L1),
length(V2, L2),
( L1 < L2 -> R = >; L1 > L2 -> R = <; compare(R, K1, K2)).</
The result is
<pre>[abel,able,bale,bela,elba]
Line 5,768 ⟶ 6,673:
=={{header|PureBasic}}==
{{works with|PureBasic|4.4}}
<
OpenConsole()
Line 5,843 ⟶ 6,748:
PrintN("Press any key"): Repeat: Until Inkey() <> ""
EndIf
EndIf</
{{out}}
<pre>evil, levi, live, veil, vile
Line 5,855 ⟶ 6,760:
===Python 3.X Using defaultdict===
Python 3.2 shell input (IDLE)
<
>>> from collections import defaultdict
>>> words = urllib.request.urlopen('http://wiki.puzzlers.org/pub/wordlists/unixdict.txt').read().split()
Line 5,866 ⟶ 6,771:
>>> for ana in anagram.values():
if len(ana) >= count:
print ([x.decode() for x in ana])</
===Python 2.7 version===
Python 2.7 shell input (IDLE)
<
>>> from collections import defaultdict
>>> words = urllib.urlopen('http://wiki.puzzlers.org/pub/wordlists/unixdict.txt').read().split()
Line 5,894 ⟶ 6,799:
>>> count
5
>>></
===Python: Using groupby===
{{trans|Haskell}}
{{works with|Python|2.6}} sort and then group using groupby()
<
>>> words = urllib.urlopen('http://wiki.puzzlers.org/pub/wordlists/unixdict.txt').read().split()
>>> len(words)
Line 5,920 ⟶ 6,825:
>>> count
5
>>></
Or, disaggregating, speeding up a bit by avoiding the slightly expensive use of ''sorted'' as a key, updating for Python 3, and using a local ''unixdict.txt'':
{{Works with|Python|3.7}}
<
from os.path import expanduser
Line 6,035 ⟶ 6,940:
# MAIN ---
if __name__ == '__main__':
main()</
{{Out}}
<pre>caret carte cater crate creat creta react recta trace
Line 6,042 ⟶ 6,947:
=={{header|QB64}}==
<syntaxhighlight lang="qb64">
$CHECKING:OFF
' Warning: Keep the above line commented out until you know your newly edited code works.
Line 6,192 ⟶ 7,097:
IF i < Finish THEN QSort i, Finish
END SUB
</syntaxhighlight>
'''2nd solution (by Steve McNeill):'''
<syntaxhighlight lang="qb64">
$CHECKING:OFF
SCREEN _NEWIMAGE(640, 480, 32)
Line 6,341 ⟶ 7,246:
LOOP UNTIL gap = 1 AND swapped = 0
END SUB
</syntaxhighlight>
'''Output:'''
<syntaxhighlight lang="qb64">
LOOPER: 7134 executions from start to finish, in one second.
Note, this is including disk access for new data each time.
Line 6,356 ⟶ 7,261:
caret, trace, crate, carte, cater
bale, abel, able, elba, bela
</syntaxhighlight>
=={{header|Quackery}}==
<
[]
[ dup sort
nested swap nested join
nested join ]
sortwith [ 0 peek swap 0 peek $< ]
dup
[ dup [] ' [ [ ] ] rot
witheach
[ tuck
[ tuck nested join swap ] ]
drop
dup [] != while
nip again ]
drop
witheach
[ over witheach
[ 2dup
[ 1 peek echo$ sp ]
else drop ]
drop cr ]
drop</
{{out}}
Line 6,383 ⟶ 7,295:
alger glare lager large regal
elan lane lean lena neal
evil levi live veil vile
</pre>
=={{header|R}}==
<
word_group <- sapply(
strsplit(words, split=""), # this will split all words to single letters...
Line 6,408 ⟶ 7,320:
"angel, angle, galen, glean, lange" "alger, glare, lager, large, regal"
aeln eilv
"elan, lane, lean, lena, neal" "evil, levi, live, veil, vile" </
=={{header|Racket}}==
<
#lang racket
Line 6,433 ⟶ 7,345:
(get-maxes (hash-words (get-lines "http://wiki.puzzlers.org/pub/wordlists/unixdict.txt")))
</syntaxhighlight>
{{out}}
<pre>
Line 6,448 ⟶ 7,360:
{{works with|Rakudo|2016.08}}
<syntaxhighlight lang="raku"
my $max = @anagrams».elems.max;
.put for @anagrams.grep(*.elems == $max);</
{{out}}
Line 6,465 ⟶ 7,377:
{{works with|Rakudo|2016.08}}
<syntaxhighlight lang="raku"
'unixdict.txt'.IO.words # load words from file
.classify(*.comb.sort.join) # group by common anagram
.classify(*.value.elems) # group by number of anagrams in a group
.max(*.key).value # get the group with highest number of anagrams
.map(*.value) # get all groups of anagrams in the group just selected</
=={{header|RapidQ}}==
<syntaxhighlight lang="vb">
dim x as integer, y as integer
dim SortX as integer
Line 6,538 ⟶ 7,450:
End
</syntaxhighlight>
{{out}}
<pre>
Line 6,550 ⟶ 7,462:
=={{header|Rascal}}==
<
list[str] OrderedRep(str word){
Line 6,560 ⟶ 7,472:
longest = max([size(group) | group <- range(AnagramMap)]);
return [AnagramMap[rep]| rep <- AnagramMap, size(AnagramMap[rep]) == longest];
}</
Returns:
<
{"glean","galen","lange","angle","angel"},
{"glare","lager","regal","large","alger"},
Line 6,569 ⟶ 7,481:
{"able","bale","abel","bela","elba"},
{"levi","live","vile","evil","veil"}
]</
=={{header|Red}}==
<
m: make map! [] 25000
Line 6,588 ⟶ 7,500:
]
foreach v values-of m [ if maxx = length? v [print v] ]
</syntaxhighlight>
{{out}}
<pre>abel able bale bela elba
Line 6,603 ⟶ 7,515:
This version doesn't assume that the dictionary is in alphabetical order, nor does it assume the
<br>words are in any specific case (lower/upper/mixed).
<
iFID= 'unixdict.txt' /*the dictionary input File IDentifier.*/
$=; !.=; ww=0; uw=0; most=0 /*initialize a bunch of REXX variables.*/
Line 6,632 ⟶ 7,544:
/*reassemble word with sorted letters. */
return @.a || @.b || @.c || @.d || @.e || @.f||@.g||@.h||@.i||@.j||@.k||@.l||@.m||,
@.n || @.o || @.p || @.q || @.r || @.s||@.t||@.u||@.v||@.w||@.x||@.y||@.z</
Programming note: the long (wide) assignment for '''return @.a||'''... could've been coded as an elegant '''do''' loop instead of hardcoding 26 letters,<br>but since the dictionary (word list) is rather large, a rather expaciated method was used for speed.
Line 6,651 ⟶ 7,563:
===version 1.2, optimized===
This optimized version eliminates the '''sortA''' subroutine and puts that subroutine's code in-line.
<
iFID= 'unixdict.txt' /*the dictionary input File IDentifier.*/
$=; !.=; ww=0; uw=0; most=0 /*initialize a bunch of REXX variables.*/
Line 6,680 ⟶ 7,592:
/*reassemble word with sorted letters. */
return @.a || @.b || @.c || @.d || @.e || @.f||@.g||@.h||@.i||@.j||@.k||@.l||@.m||,
@.n || @.o || @.p || @.q || @.r || @.s||@.t||@.u||@.v||@.w||@.x||@.y||@.z</
{{out|output|text= is the same as REXX version 1.1}}
Line 6,688 ⟶ 7,600:
===annotated version using PARSE===
(This algorithm actually utilizes a ''bin'' sort, one bin for each Latin letter.)
<
upper u /*fast method to uppercase a variable. */
/*another: u = translate(u) */
Line 6,710 ⟶ 7,622:
/*Note: the ? is prefixed to the letter to avoid */
/*collisions with other REXX one-character variables.*/
say 'z=' z</
{{out|output|:}}
<pre>
Line 6,718 ⟶ 7,630:
===annotated version using a DO loop===
<
upper u /*fast method to uppercase a variable. */
L=length(u) /*get the length of the word (in bytes)*/
Line 6,735 ⟶ 7,647:
_.?n||_.?o||_.?p||_.?q||_.?r||_.?s||_.?t||_.?u||_.?v||_.?w||_.?x||_.?y||_.?z
say 'z=' z</
{{out|output|:}}
<pre>
Line 6,744 ⟶ 7,656:
===version 2===
<
* 07.08.2013 Walter Pachl
* sorta for word compression courtesy Gerard Schildberger,
Line 6,804 ⟶ 7,716:
End
Return c.a||c.b||c.c||c.d||c.e||c.f||c.g||c.h||c.i||c.j||c.k||c.l||,
c.m||c.n||c.o||c.p||c.q||c.r||c.s||c.t||c.u||c.v||c.w||c.x||c.y||c.z</
{{out}}
<pre>
Line 6,822 ⟶ 7,734:
=={{header|Ring}}==
<
# Project : Anagrams
Line 6,903 ⟶ 7,815:
end
return cnt
</syntaxhighlight>
Output:
<pre>
Line 6,926 ⟶ 7,838:
=={{header|Ruby}}==
<
anagram = Hash.new {|hash, key| hash[key] = []} # map sorted chars to anagrams
Line 6,942 ⟶ 7,854:
p ana
end
end</
{{out}}
<pre>
Line 6,954 ⟶ 7,866:
Short version (with lexical ordered result).
<
anagrams = open('http://wiki.puzzlers.org/pub/wordlists/unixdict.txt'){|f| f.read.split.group_by{|w| w.each_char.sort} }
anagrams.values.group_by(&:size).max.last.each{|group| puts group.join(", ") }
</syntaxhighlight>
{{Out}}
<pre>
Line 6,970 ⟶ 7,882:
=={{header|Run BASIC}}==
<
mem$ = "CREATE TABLE anti(gram,ordr);
CREATE INDEX ord ON anti(ordr)"
Line 7,033 ⟶ 7,945:
print
next i
end</
<pre>
abel able bale bela elba
Line 7,046 ⟶ 7,958:
Unicode is hard so the solution depends on what you consider to be an anagram: two strings that have the same bytes, the same codepoints, or the same graphemes. The first two are easily accomplished in Rust proper, but the latter requires an external library. Graphemes are probably the most correct way, but it is also the least efficient since graphemes are variable size and thus require a heap allocation per grapheme.
<
use std::fs::File;
use std::io::{BufRead,BufReader};
Line 7,075 ⟶ 7,987:
}
}
}</
{{out}}
<pre>
Line 7,088 ⟶ 8,000:
If we assume an ASCII string, we can map each character to a prime number and multiply these together to create a number which uniquely maps to each anagram.
<
use std::path::Path;
use std::io::{self, BufRead, BufReader};
Line 7,129 ⟶ 8,041:
}
Ok(map.into_iter().map(|(_, entry)| entry).collect())
}</
=={{header|Scala}}==
<
val vls = src.getLines.toList.groupBy(_.sorted).values
val max = vls.map(_.size).max
vls filter (_.size == max) map (_ mkString " ") mkString "\n"</
{{out}}
<pre>
Line 7,147 ⟶ 8,059:
----
Another take:
<
.fromURL("http://wiki.puzzlers.org/pub/wordlists/unixdict.txt").getLines.toList
.groupBy(_.sorted).values
.groupBy(_.size).maxBy(_._1)._2
.map(_.mkString("\t"))
.foreach(println)</
{{out}}
<pre>
Line 7,167 ⟶ 8,079:
Uses two SRFI libraries: SRFI 125 for hash tables and SRFI 132 for sorting.
<
(import (scheme base)
(scheme char)
Line 7,209 ⟶ 8,121:
(map (lambda (grp) (list-sort string<? grp))
(largest-groups (read-groups)))))
</syntaxhighlight>
{{out}}
Line 7,222 ⟶ 8,134:
=={{header|Seed7}}==
<
include "gethttp.s7i";
include "strifile.s7i";
Line 7,257 ⟶ 8,169:
var integer: maxLength is 0;
begin
dictFile :=
while hasNext(dictFile) do
readln(dictFile, word);
Line 7,277 ⟶ 8,189:
end if;
end for;
end func;</
{{out}}
Line 7,290 ⟶ 8,202:
=={{header|SETL}}==
<
anagrams := {};
while not eof(h) loop
Line 7,329 ⟶ 8,241:
end loop;
return A;
end procedure;</
{{out}}
<pre>{abel able bale bela elba}
Line 7,339 ⟶ 8,251:
=={{header|Sidef}}==
<
file.open_r(\var fh, \var err) ->
|| die "Can't open file `#{file}' for reading: #{err}\n";
Line 7,348 ⟶ 8,260:
}
main(%f'/tmp/unixdict.txt');</
{{out}}
<pre>alger glare lager large regal
Line 7,358 ⟶ 8,270:
=={{header|Simula}}==
<
$ cim -m64 anagrams-hashmap.sim
;
Line 7,627 ⟶ 8,539:
END
</syntaxhighlight>
{{out}}
<pre>
Line 7,642 ⟶ 8,554:
=={{header|Smalltalk}}==
<
dict:= Dictionary new.
list do: [:val|
Line 7,648 ⟶ 8,560:
add: val.
].
sorted:=dict asSortedCollection: [:a :b| a size > b size].</
Documentation:
<pre>
Line 7,666 ⟶ 8,578:
{{works with|Smalltalk/X}}
instead of asking for the strings, read the file:
<
'unixdict.txt' asFilename
readingLinesDo:[:eachWord |
Line 7,675 ⟶ 8,587:
sortBySelector:#size)
reverse
do:[:s | s printCR]</
{{out}}
<pre>
Line 7,687 ⟶ 8,599:
...</pre>
not sure if getting the dictionary via http is part of the task; if so, replace the file-reading with:
<
=={{header|SNOBOL4}}==
{{works with|Macro Spitbol}}
Note: unixdict.txt is passed in locally via STDIN. Newlines must be converted for Win/DOS environment.
<
define('sortw(str)a,i,j') :(sortw_end)
sortw a = array(size(str))
Line 7,714 ⟶ 8,626:
L3 j = j + 1; key = kv<j,1>; val = kv<j,2> :f(end)
output = eq(countw(val),max) key ': ' val :(L3)
end</
{{out}}
<pre>abel: abel able bale bela elba
Line 7,724 ⟶ 8,636:
=={{header|Stata}}==
<
mata
a=st_sdata(.,.)
Line 7,739 ⟶ 8,651:
reshape wide v1, i(k) j(group) string
drop k
list, noobs noheader</
'''Output'''
Line 7,752 ⟶ 8,664:
=={{header|SuperCollider}}==
<syntaxhighlight lang="supercollider">(
var text, words, sorted, dict = IdentityDictionary.new, findMax;
File.use("unixdict.txt".resolveRelative, "r", { |f| text = f.readAllString });
Line 7,771 ⟶ 8,683:
};
findMax.(dict)
)</
Answers:
<
=={{header|Swift}}==
{{works with|Swift 2.0}}
<
let wordsURL = NSURL(string: "http://wiki.puzzlers.org/pub/wordlists/unixdict.txt")!
Line 7,820 ⟶ 8,732:
print("set \(i): \(thislist.sort())")
}
</syntaxhighlight>
{{out}}
Line 7,835 ⟶ 8,747:
=={{header|Tcl}}==
<
package require http
Line 7,858 ⟶ 8,770:
puts $anagrams($key)
}
}</
{{out}}
<pre>evil levi live veil vile
Line 7,868 ⟶ 8,780:
=={{header|Transd}}==
<
MainModule: {
_start: (λ
(with fs FileStream() words String()
(open-r fs "/mnt/proj/tmp/unixdict.txt")
(textin
(
)
))
}</syntaxhighlight>{{out}}
<pre>
[[abel, able, bale, bela, elba],
Line 7,896 ⟶ 8,808:
=={{header|TUSCRIPT}}==
<
requestdata = REQUEST ("http://wiki.puzzlers.org/pub/wordlists/unixdict.txt")
Line 7,923 ⟶ 8,835:
PRINT cs," ",f,": ",a
ENDLOOP
ENDCOMPILE</
{{out}}
<pre>
Line 7,944 ⟶ 8,856:
Process substitutions eliminate the need for command pipelines.
<
local host=$1
local uri=$2
Line 7,979 ⟶ 8,891:
done
printf "%s\n" "${maxwords[@]}"</
{{output}}
Line 7,993 ⟶ 8,905:
The algorithm is to group the words together that are made from the same unordered lists of letters, then collect the groups together that have the same number of words in
them, and then show the collection associated with the highest number.
<
#show+
anagrams = mat` * leql$^&h eql|=@rK2tFlSS ^(~&,-<&)* unixdict_dot_txt</
{{out}}
<pre>
Line 8,008 ⟶ 8,920:
=={{header|VBA}}==
<syntaxhighlight lang="vb">
Option Explicit
Line 8,170 ⟶ 9,082:
If (mini < j) Then Call SortTwoDimArray(myArr, mini, j, Colonne)
If (i < Maxi) Then Call SortTwoDimArray(myArr, i, Maxi, Colonne)
End Sub</
{{out}}
<pre>25104 words, in the dictionary
Line 8,183 ⟶ 9,095:
Time to go : 2,464844 seconds.</pre>
=={{header|VBScript}}==
A little convoluted, uses a dictionary and a recordset...
<syntaxhighlight lang="vb">
Const adInteger = 3
Const adVarChar = 200
function charcnt(s,ch)
charcnt=0
for i=1 to len(s)
if mid(s,i,1)=ch then charcnt=charcnt+1
next
end function
set fso=createobject("Scripting.Filesystemobject")
dim a(122)
sfn=WScript.ScriptFullName
sfn= Left(sfn, InStrRev(sfn, "\"))
set f=fso.opentextfile(sfn & "unixdict.txt",1)
'words to dictionnary using acronym as key
set d=createobject("Scripting.Dictionary")
while not f.AtEndOfStream
erase a :cnt=0
s=trim(f.readline)
'tally chars
for i=1 to len(s)
n=asc(mid(s,i,1))
a(n)=a(n)+1
next
'build the anagram
k=""
for i= 48 to 122
if a(i) then k=k & string(a(i),chr(i))
next
'add to dict
if d.exists(k) then
b=d(k)
d(k)=b & " " & s
else
d(k)=s
end if
wend
'copy dictionnary to recorset to be able to sort it .Add nr of items as a new field
Set rs = CreateObject("ADODB.Recordset")
rs.Fields.Append "anag", adVarChar, 30
rs.Fields.Append "items", adInteger
rs.Fields.Append "words", adVarChar, 200
rs.open
for each k in d.keys
rs.addnew
rs("anag")=k
s=d(k)
rs("words")=s
rs("items")=charcnt(s," ")+1
rs.update
next
d.removeall
'do the query
rs.sort="items DESC, anag ASC"
rs.movefirst
it=rs("items")
while rs("items")=it
wscript.echo rs("items") & " (" &rs("anag") & ") " & rs("words")
rs.movenext
wend
rs.close
</syntaxhighlight>
The output:
<pre>
5 (abel) abel able bale bela elba
5 (acert) caret carte cater crate trace
5 (aegln) angel angle galen glean lange
5 (aeglr) alger glare lager large regal
5 (aeln) elan lane lean lena neal
5 (eilv) evil levi live veil vile
</pre>
=={{header|Vedit macro language}}==
Line 8,190 ⟶ 9,186:
The word list is expected to be in the same directory as the script.
<
Repeat(ALL) {
Line 8,255 ⟶ 9,251:
Ins_Char(#8, OVERWRITE)
}
return</
{{out}}
<pre>
Line 8,265 ⟶ 9,261:
evil levi live veil vile
</pre>
=={{header|Visual Basic .NET}}==
<
Imports System.Collections.ObjectModel
Line 8,331 ⟶ 9,326:
End Function
End Module</
{{out}}
<PRE>
Line 8,341 ⟶ 9,336:
[EILV] evil, levi, live, veil, vile
</PRE>
=={{header|V (Vlang)}}==
{{trans|Wren}}
<syntaxhighlight lang="v (vlang)">import os
fn main(){
words := os.read_lines('unixdict.txt')?
mut m := map[string][]string{}
mut ma := 0
for word in words {
mut letters := word.split('')
letters.sort()
sorted_word := letters.join('')
if sorted_word in m {
m[sorted_word] << word
} else {
m[sorted_word] = [word]
}
if m[sorted_word].len > ma {
ma = m[sorted_word].len
}
}
for _, a in m {
if a.len == ma {
println(a)
}
}
}</syntaxhighlight>
{{out}}
<pre>
['abel', 'able', 'bale', 'bela', 'elba']
['alger', 'glare', 'lager', 'large', 'regal']
['angel', 'angle', 'galen', 'glean', 'lange']
['caret', 'carte', 'cater', 'crate', 'trace']
['elan', 'lane', 'lean', 'lena', 'neal']
['evil', 'levi', 'live', 'veil', 'vile']
</pre>
=={{header|Wren}}==
{{libheader|Wren-sort}}
<
import "./sort" for Sort
var words = File.read("unixdict.txt").split("\n").map { |w| w.trim() }
Line 8,362 ⟶ 9,396:
for (key in wordMap.keys) {
if (wordMap[key].count == most) System.print(wordMap[key])
}</
{{out}}
Line 8,375 ⟶ 9,409:
=={{header|Yabasic}}==
<
maxw = 0 : c = 0 : dimens(c)
i = 0
Line 8,455 ⟶ 9,489:
d(j,p) = c
end if
end sub</
=={{header|zkl}}==
<
// blob to dictionary: key is word "fuzzed", values are anagram words
.pump(Void,T(fcn(w,d){
Line 8,470 ⟶ 9,504:
"%d:%s: %s".fmt(v.len(),zz.strip(),
v.apply("strip").concat(","))
});</
{{out}}
<pre>
Line 8,486 ⟶ 9,520:
</pre>
In the case where it is desirable to get the dictionary from the web, use this code:
<
var ZC=Import("zklCurl");
unixdict:=ZC().get(URL); //--> T(Data,bytes of header, bytes of trailer)
unixdict=unixdict[0].del(0,unixdict[1]); // remove HTTP header
File("unixdict.txt","w").write(unixdict);</
{{omit from|6502 Assembly|unixdict.txt is much larger than the CPU's address space.}}
{{omit from|8080 Assembly|See 6502 Assembly.}}
{{omit from|PARI/GP|No real capacity for string manipulation}}
{{omit from|Z80 Assembly|See 6502 Assembly.}}
| |||