Anadromes: Difference between revisions

So you will need to use another compiler under Windows.<br>

As in the Wren sample, the words are quicksorted so binary searching can be used to find the reversed words.

# in-place quick sort an array of strings #

PROC s quicksort = ( REF[]STRING a, INT lb, ub )VOID:

OD;

print( ( newline, "Found ", whole( a count, 0 ), " anadromes", newline ) )

{{out}}

<pre>

 

=={{header|AppleScript}}==

use framework "Foundation"

use scripting additions

end Anadromes

 

 

{{output}}

degener <--> reneged

deifier <--> reified

reliver <--> reviler

revotes <--> setover

 

=={{header|AWK}}==

# syntax: GAWK -f ANADROMES.AWK WORDS.TXT

#

return(rts)

}

{{out}}

<pre>

 

=={{header|C++}}==

#include <cstdlib>

#include <fstream>

}

return EXIT_SUCCESS;

 

{{out}}

 

=={{header|F_Sharp|F#}}==

// Anadromes. Nigel Galloway: June 26th., 2022

let words=seq{use n=System.IO.File.OpenText("words.txt") in while not n.EndOfStream do yield n.ReadLine()}|>Seq.filter(fun n->6<(Seq.length n))|>Seq.map(fun n->n.ToCharArray())|>Set.ofSeq

Set.intersect words (words|>Set.map(Array.rev))|>Set.iter(fun n->if n<Array.rev n then printfn "%s" (System.String n))

=={{header|Factor}}==

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

kernel math prettyprint sequences sets sets.extras ;

 

"words.txt" ascii file-lines [ length 6 > ] filter dup >hash-set '[ reverse _ in? ] filter

{{out}}

<pre>

 

=={{header|Haskell}}==

import qualified Data.Text as T

import qualified Data.Text.IO as TIO

main = TIO.interact (T.unlines . map anaShow . anadromes . longEnough . T.lines)

where longEnough = filter ((> 6) . T.length)

 

{{out}}

Anyways, the basic approach here is to identify a canonical key for each word, look for paired keys and organize the words based on those keys:

 

canon=: {.@/:~@(,:|.) each words

akeys=: (~. #~ 2 = #/.~) canon

tkeys=: (#~ 6 < #@>) akeys

order=: /: canon

 

This gives us:

 

┌────────┬────────┐

│amaroid │diorama │

├────────┼────────┤

│sallets │stellas │

 

=={{header|Julia}}==

words = Set(filter(w -> length(w) >= minsize, split((csense ? identity : lowercase)(read(fname, String)), r"\s+")))

found = [(w, reverse(w)) for w in words if (r = reverse(w)) in words && w < r]

anadromes(7)

anadromes(7, false)

<pre>

Total 17 case sensitive anadrome pairs found.

 

=={{header|Perl}}==

use warnings;

 

}

 

{{out}}

<pre> amaroid ↔ diorama

 

=={{header|Phix}}==

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

<span style="color: #004080;">integer</span> <span style="color: #000000;">m</span> <span style="color: #0000FF;">=</span> <span style="color: #008080;">iff</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">platform</span><span style="color: #0000FF;">()=</span><span style="color: #004600;">JS</span><span style="color: #0000FF;">?</span><span style="color: #000000;">5</span><span style="color: #0000FF;">:</span><span style="color: #000000;">7</span><span style="color: #0000FF;">)</span>

<span style="color: #000000;">t</span> <span style="color: #0000FF;">=</span> <span style="color: #7060A8;">join</span><span style="color: #0000FF;">(</span><span style="color: #000000;">s</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;">"%8s &lt;=&gt; %-8s"</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;">"Found %d anadromes:\n%s\n"</span><span style="color: #0000FF;">,{</span><span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #000000;">r</span><span style="color: #0000FF;">),</span><span style="color: #000000;">t</span><span style="color: #0000FF;">})</span>

{{out}}

On the desktop:

 

=={{header|Raku}}==

 

my %words = @words.pairs.invert;

 

{{out}}

<pre> amaroid ↔ diorama

 

=={{header|Rust}}==

use std::fs::File;

use std::io::{self, BufRead};

Err(error) => eprintln!("{}", error),

}

 

{{out}}

 

=={{header|Seed7}}==

 

const func boolean: binarySearch (in array string: haystack, in string: needle) is func

end if;

end for;

 

{{out}}

 

=={{header|Sidef}}==

 

File('words.txt').open_r.each {|word|

S{word} = true

}

{{out}}

<pre>

{{libheader|Wren-sort}}

{{libheader|Wren-fmt}}

import "./sort" for Sort, Find

import "./fmt" for Fmt

}

System.print("The anadrome pairs with more than 6 letters are:")

 

{{out}}