Prime words: Difference between revisions

<br><br>

=={{header|11l}}==

I a == 2

R 1B

L.break

L.was_no_break

{{out}}

In the following solution the input file is loaded from H6 drive. Altirra emulator automatically converts CR/LF character from ASCII into 155 character in ATASCII charset used by Atari 8-bit computer when one from H6-H10 hard drive under DOS 2.5 is used.

{{libheader|Action! Sieve of Eratosthenes}}

BYTE FUNC IsPrimeWord(CHAR ARRAY word BYTE ARRAY primes)

Sieve(primes,MAX+1)

FindPrimeWords(fname,primes)

{{out}}

[https://gitlab.com/amarok8bit/action-rosetta-code/-/raw/master/images/Prime_words.png Screenshot from Atari 8-bit computer]

Does not distinguish between letters and non-letter ASCII codes (as with the REXX sample).

{{libheader|ALGOL 68-primes}}

IF FILE input file;

STRING file name = "unixdict.txt";

OD;

close( input file )

{{out}}

<pre>

=={{header|Arturo}}==

loop words 'word [

if every? split word 'ch -> prime? to :integer to :char ch ->

print word

{{out}}

=={{header|AWK}}==

# syntax: GAWK -f PRIME_WORDS.AWK unixdict.txt

BEGIN {

return(1)

}

{{out}}

<pre>

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

#include <cstdlib>

#include <fstream>

}

return EXIT_SUCCESS;

Contents of prime_sieve.hpp:

#define PRIME_SIEVE_HPP

}

{{out}}

=={{header|Factor}}==

{{works with|Factor|0.99 2020-08-14}}

{{out}}

<pre style="height: 45ex">

=={{header|FreeBASIC}}==

dim shared as boolean prime(0 to 29) =_

{false, true, false, true, true, false, false, true, false, true, false, false, true, false,_

close #1

end

{{out}}

<pre>

=={{header|Go}}==

import (

}

}

{{out}}

=={{header|J}}==

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

│a │aaa│age │agee│ak │am │ama │e │egg │

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

│ma │mae│magma│make│mamma│me │meek│meg│q │

=={{header|jq}}==

definition of `is_prime_word` should focus on the alphabetic characters,

perhaps along the lines of:

All such variations are as easy to accommodate as to envision, but for unixdict.txt the following suffices:

{{out}}

Invocation (example): jq -Rrn -f prime-words.jq unixdict.txt

=={{header|Julia}}==

See [[Alternade_words#Julia]] for the foreachword function.

isprimeword(w, _) = all(c -> Int(c) in primelettervalues, collect(w)) ? w : ""

foreachword("unixdict.txt", isprimeword, colwidth=10, numcols=9)

<pre>

Word source: unixdict.txt

=={{header|Mathematica}}/{{header|Wolfram Language}}==

dict//=StringSplit[#,"\n"]&;

chars=CharacterRange["A","Z"]~Join~CharacterRange["a","z"];

chars//=Select[ToCharacterCode/*First/*PrimeQ];

{{out}}

<pre>a

=={{header|Nim}}==

func isPrime(n: Natural): bool =

if word.allCharsInSet(PrimeChars):

inc count

{{out}}

=={{header|Perl}}==

use strict;

my $pat = join '', grep +(1 x ord) !~ /^(11+)\1+$/, 'a'..'z', 'A'..'Z';

@ARGV = 'unixdict.txt';

{{out}}

<pre>

=={{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;">sap</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: #008080;">return</span> <span style="color: #7060A8;">sum</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">apply</span><span style="color: #0000FF;">(</span><span style="color: #000000;">word</span><span style="color: #0000FF;">,</span><span style="color: #7060A8;">is_prime</span><span style="color: #0000FF;">))==</span><span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #000000;">word</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">end</span> <span style="color: #008080;">function</span>

<span style="color: #004080;">sequence</span> <span style="color: #000000;">words</span> <span style="color: #0000FF;">=</span> <span style="color: #7060A8;">filter</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">unix_dict</span><span style="color: #0000FF;">(),</span><span style="color: #000000;">sap</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;">"%d prime words found: %s\n"</span><span style="color: #0000FF;">,{</span><span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #000000;">words</span><span style="color: #0000FF;">),</span><span style="color: #7060A8;">join</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">shorten</span><span style="color: #0000FF;">(</span><span style="color: #000000;">words</span><span style="color: #0000FF;">,</span><span style="color: #008000;">""</span><span style="color: #0000FF;">,</span><span style="color: #000000;">3</span><span style="color: #0000FF;">),</span><span style="color: #008000;">", "</span><span style="color: #0000FF;">)})</span>

{{out}}

<pre>

=={{header|Plain English}}==

Start up.

Put "c:\unixdict.txt" into a path.

If the substring's first's target is not prime, say no.

Add 1 to the substring's first.

{{out}}

<pre style="height:18em">

Here is the brute force pre-processor, again this can be done easily manually, but if you are feeling lazy, like me :)

for i in range(65,123):

check = 1

if check==1:

print(chr(i),end='')

This produces the following string :

Tested on Python 3+, the file download will work only if the link is still active. It is possible that you may be able to fetch the file in your browser but download via code may still fail. Check whether you are connected to a VPN, it works on open networks.

#Aamrun, 6th November 2021

[print(word) for word in wordList if len(set(word).difference(primeSet))==0]

And here's the final output :

In an effort to anticipate / head-off a rash of tiny variant tasks, a series of one-liners:

sub display ($n, @n, $s = "First 20: ") {"$n;\n{$s}{@n.join: ', '}"}

say "\nNumber of words that are prime in custom base 26, whose digits are all prime, and whose digital sum is prime: ",

{{out}}

<pre>Number of words whose ords are all prime: 36;

=={{header|REXX}}==

No attempt was made to exclude any "word" if it contained any non-letter (Latin alphabet) characters.

parse arg iFID . /*obtain optional arguments from the CL*/

if iFID=='' | iFID=="," then iFID='unixdict.txt' /*Not specified? Then use the default.*/

67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 ,

157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251

{{out|output|text=&nbsp; when using the default input:}}

<pre>

=={{header|Ring}}==

load "stdlib.ring"

see "Prime words are:" + nl

see Words

Output:

<pre>

=={{header|Ruby}}==

puts File.open("unixdict.txt").select{|line| line.chomp.chars.all?{|c| c.ord.prime?} }

{{out}}

<pre>a

=={{header|Rust}}==

// primal = "0.3"

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

}

{{out}}

=={{header|Swift}}==

class BitArray {

} catch {

print(error.localizedDescription)

{{out}}

{{libheader|Wren-math}}

{{libheader|Wren-trait}}

import "/math" for Int

import "/trait" for Stepped

for (word in words) {

if (word.all { |c| primeChars.contains(c) }) System.print(word)

{{out}}

=={{header|XPL0}}==

int N, I;

[if N <= 2 then return N = 2;

];

until Ch = EOF;

{{out}}