Isograms and heterograms: Difference between revisions

 

=={{header|ALGOL 68}}==

# times as the others ) and heterograms ( words where each letter occurs #

# once ). Note a heterogram is an isogram of order 1 #

OD

FI

{{out}}

<pre>

=={{header|Factor}}==

{{works with|Factor|0.99 2022-04-03}}

io.encodings.ascii io.files kernel literals math math.order

math.statistics sequences sets sorting ;

 

"List of heterograms of length > 10:" print

{{out}}

<pre>

For this task, we want to know the value of n for n-isograms. This value would be zero for words which are not n-isograms. We can implement this by counting how many times each character occurs and determining whether that value is unique. (If it's the unique value, n is the number of times the first character occurs):

 

 

Also, it's worth noting that unixdict.txt is already in sorted order, even after coercing its contents to lower case:

 

 

With this tool and this knowledge, we are ready to tackle this task (the /: expression sorts, and the #~ expression selects):

 

aaa

iii

thunderclap

valedictory

 

=={{header|Julia}}==

wchars, uchars = collect(word), unique(collect(word))

ulen, wlen = length(uchars), length(wchars)

println("\nHeterogram Length\n", "-"^20)

foreach(t -> println(rpad(t[3], 12), lpad(t[2], 5)), heterograms)

<pre>

N-Isogram N Length

 

=={{header|Perl}}==

use warnings;

use feature 'say';

}

 

{{out}}

<pre style="height:40ex">2 3-isograms:

 

=={{header|Phix}}==

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #008080;">function</span> <span style="color: #000000;">isogram</span><span style="color: #0000FF;">(</span><span style="color: #004080;">string</span> <span style="color: #000000;">word</span><span style="color: #0000FF;">)</span>

<span style="color: #004080;">sequence</span> <span style="color: #000000;">res</span> <span style="color: #0000FF;">=</span> <span style="color: #7060A8;">sort_columns</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">filter</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">apply</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">unix_dict</span><span style="color: #0000FF;">(),</span><span style="color: #000000;">isogram</span><span style="color: #0000FF;">),</span><span style="color: #008000;">"!="</span><span style="color: #0000FF;">,</span><span style="color: #000000;">0</span><span style="color: #0000FF;">),{-</span><span style="color: #000000;">2</span><span style="color: #0000FF;">,-</span><span style="color: #000000;">3</span><span style="color: #0000FF;">,</span><span style="color: #000000;">1</span><span style="color: #0000FF;">})</span>

<span style="color: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"word n length\n%s\n"</span><span style="color: #0000FF;">,{</span><span style="color: #7060A8;">join</span><span style="color: #0000FF;">(</span><span style="color: #000000;">res</span><span style="color: #0000FF;">,</span><span style="color: #008000;">'\n'</span><span style="color: #0000FF;">,</span><span style="color: #000000;">fmt</span><span style="color: #0000FF;">:=</span><span style="color: #008000;">"%-14s %d %6d"</span><span style="color: #0000FF;">)})</span>

{{out}}

<pre>

 

=={{header|Raku}}==

 

my @words = $file.IO.slurp.words.race.map: { $_ => .comb.Bag };

say "\n({+$_}) heterograms with more than $minchars characters:\n" ~

.sort({[-.chars, ~$_]}).join: "\n" given

{{out}}

<pre>(2) 3-isograms:

=={{header|Wren}}==

{{libheader|Wren-str}}

import "./str" for Str

 

.toList

System.print("\nList of heterograms(%(heterograms.count)) of length > 10:")

 

{{out}}