Find words which contains all the vowels: Difference between revisions

 

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

I word.len > 10

L(vowel) (‘a’, ‘e’, ‘i’, ‘o’, ‘u’)

L.break

L.was_no_break

 

{{out}}

=={{header|Action!}}==

In the following solution the input file [https://gitlab.com/amarok8bit/action-rosetta-code/-/blob/master/source/unixdict.txt unixdict.txt] 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.

BYTE i,n

 

 

FindWords(fname)

{{out}}

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

 

=={{header|Ada}}==

with Ada.Strings.Maps;

with Ada.Strings.Fixed;

end loop;

Close (File);

 

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

 

# read the list of words and look for suitable words #

OD;

close( input file )

{{out}}

<pre>

=={{header|Arturo}}==

 

vowels: ["a" "e" "i" "o" "u"]

containsAllVowels?: function [w][

print word

]

 

{{out}}

 

=={{header|AutoHotkey}}==

vowels := ["a", "e", "i", "o", "u"]

main:

result .= word "`n"

}

{{out}}

<pre>ambidextrous

 

=={{header|AWK}}==

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

{ if (length($0) <= 10) {

exit(0)

}

{{out}}

<pre>

 

=={{header|BASIC}}==

20 OPEN "I",1,"UNIXDICT.TXT"

30 IF EOF(1) THEN CLOSE #1: END

140 NEXT N

150 IF A=1 AND E=1 AND I=1 AND O=1 AND U=1 THEN PRINT W,

{{out}}

<pre>ambidextrous bimolecular cauliflower communicable communicate

 

=={{header|BCPL}}==

 

let reads(v) = valof

while reads(word) if testword(word) do writef("%S*N", word)

endread()

{{out}}

<pre>ambidextrous

 

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

#include <cctype>

#include <cstdlib>

}

return EXIT_SUCCESS;

 

{{out}}

 

=={{header|CLU}}==

vowels: string := "aeiou"

vowel_counts: array[int] := array[int]$fill(1,string$size(vowels),0)

stream$close(fstream)

end

{{out}}

<pre>ambidextrous

 

=={{header|COBOL}}==

PROGRAM-ID. ALL-VOWELS.

IF LEN IS GREATER THAN 10

AND 1 IS EQUAL TO A AND E AND I AND O AND U,

{{out}}

<pre>ambidextrous

=={{header|Common Lisp}}==

 

(with-open-file (dictionary file-name :if-does-not-exist nil)

(loop for word = (read-line dictionary nil nil)

(write-line word))))

 

 

=={{header|Delphi}}==

{{libheader| System.SysUtils}}

{{libheader| System.IoUtils}}

program Find_words_which_contains_all_the_vowels;

 

 

readln;

{{out}}

<pre> 1: ambidextrous

 

=={{header|Draco}}==

 

proc all_vowels(*char line) bool:

close(dict)

{{out}}

<pre>ambidextrous

 

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

// Words which containing all the vowels once . Nigel Galloway: February 17th., 2021

let fN g=if String.length g < 11 then false else let n=Map.ofSeq (Seq.countBy id g) in let fN g=n.ContainsKey g && n.[g]=1 in fN 'a' && fN 'i' && fN 'o' && fN 'u' && fN 'e'

seq{use n=System.IO.File.OpenText("unixdict.txt") in while not n.EndOfStream do yield n.ReadLine()}|>Seq.filter fN|>Seq.iter(printfn "%s")

{{out}}

<pre>

 

=={{header|Factor}}==

sequences sets.extras ;

 

[ length 10 > ] filter

[ non-repeating "aeiou" superset? ] filter

{{out}}

<pre>

=={{header|Forth}}==

{{works with|Gforth}}

0 { vowels }

0 do

 

main

 

{{out}}

 

=={{header|FreeBASIC}}==

dim as string s, c, q(1 to 5) = {"a","e","i","o","u"}

dim as integer i, j, n

 

close #1

{{out}}<pre>

ambidextrous

 

=={{header|Frink}}==

{

d = countToDict[charList[word]]

if d@"a" == 1 and d@"e" == 1 and d@"i" == 1 and d@"o" == 1 and d@"u" == 1

println[word]

{{out}}

<pre>

 

=={{header|Go}}==

 

import (

}

}

 

{{out}}

 

=={{header|J}}==

ambidextrous

bimolecular

praseodymium

stupefaction

 

=={{header|jq}}==

{{works with|jq}}

'''Works with gojq, the Go implementation of jq'''

select(length > 10)

| . as $w

| select( all("a","e","i","o","u";

. as $v | ($w | test($v) and (test( "\($v).*\($v)")|not))))

{{out}}

Invocation example: jq -Rr -f program.jq unixdict.txt

=={{header|Julia}}==

See [[Alternade_words]] for the foreachword function.

foreachword("unixdict.txt", hassallthevowels, colwidth=18, minlen=11, numcols=5)

Word source: unixdict.txt

 

 

=={{header|Ksh}}==

#!/bin/ksh

 

_allvowels "$REPLY"

(( $? )) && print "$((++i)). $REPLY"

{{out}}<pre>1. ambidextrous

2. bimolecular

 

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

dict=Once[Import["https://web.archive.org/web/20180611003215/http://www.puzzlers.org/pub/wordlists/unixdict.txt"]];

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

dict//=Select[Last/*DuplicateFreeQ];

dict//=Select[Last/*Length/*EqualTo[Length[vowels]]];

{{out}}

<pre>{ambidextrous, bimolecular, cauliflower, communicable, communicate, consanguine, consultative, countervail, exclusionary, grandiloquent, importunate, incommutable, incomputable, insupportable, loudspeaking, malnourished, mensuration, oneupmanship, pandemonium, permutation, perturbation, portraiture, praseodymium, stupefaction, sulfonamide}</pre>

 

=={{header|Modula-2}}==

IMPORT SeqIO;

IMPORT Texts;

ts := Texts.Disconnect(dict);

fs := SeqIO.Close(file);

{{out}}

<pre>ambidextrous

 

=={{header|Nim}}==

 

const Vowels = ['a', 'e', 'i', 'o', 'u']

break checkWord

inc count

 

{{out}}

 

=={{header|Perl}}==

 

use strict;

 

@ARGV = 'unixdict.txt';

{{out}}

ambidextrous

 

=={{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;">onev</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;">integer</span> <span style="color: #000000;">vowel</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">return</span> <span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">find_all</span><span style="color: #0000FF;">(</span><span style="color: #000000;">vowel</span><span style="color: #0000FF;">,</span><span style="color: #000000;">word</span><span style="color: #0000FF;">))=</span><span style="color: #000000;">1</span> <span style="color: #008080;">end</span> <span style="color: #008080;">function</span>

<span style="color: #004080;">sequence</span> <span style="color: #000000;">fivev</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;">allv</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 words: %s\n"</span><span style="color: #0000FF;">,{</span><span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #000000;">fivev</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;">fivev</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>

{{out}}

<pre>

 

=={{header|PL/I}}==

countChar: procedure(str, ch) returns(fixed);

declare str char(32) varying, ch char, (i, n) fixed;

end;

end;

{{out}}

<pre>ambidextrous

=={{header|Python}}==

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.

import urllib.request

from collections import Counter

if frequency['a']==frequency['e']==frequency['i']==frequency['o']==frequency['u']==1:

print(word)

{{out}}

<pre>

=={{header|R}}==

Adapting this from https://rosettacode.org/wiki/Find_words_which_contain_the_most_consonants#R is trivial.

dictBig <- dict[nchar(dict) > 10]

#The following line is equivalent to sapply(c("a", "e", "i", "o", "u"), function(x) stringr::str_count(dictBig, x))

#As with all things with strings in R, life is easier with stringr or stringi.

vowelCount <- sapply(c("a", "e", "i", "o", "u"), function(x) lengths(regmatches(dictBig, gregexec(x, dictBig))))

 

=={{header|Raku}}==

Yet another "Filter a word list" task.

 

.grep({ .chars > 10 and all(.comb.Bag<a e i o u>) == 1 })\

 

{{out}}

 

=={{header|Red}}==

 

vowels: charset "aeiou"

print word

]

{{out}}

<pre>

They also allows the minimum length to be specified on the command line (CL) as well as the dictionary file identifier.

=== version 1 ===

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

if minL=='' | minL=="," then minL= 11 /*Not specified? Then use the default.*/

/*stick a fork in it, we're all done. */

say copies('─',30) finds ' words found with only one each of every vowel,' ,

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

<pre>

=== version 2 ===

This REXX version uses the &nbsp; '''countstr''' &nbsp; BIF which returns the count of (a particular) character in a string.

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

if minL=='' | minL=="," then minL= 11 /*Not specified? Then use the default.*/

/*stick a fork in it, we're all done. */

say copies('─',30) finds ' words found with only one each of every vowel,' ,

{{out|output|text=&nbsp; is identical to the 1^st REXX version.}} <br><br>

 

=={{header|Ring}}==

load "stdlib.ring"

 

end

return sum

{{out}}

<pre>

 

=={{header|Ruby}}==

puts word if word.size > 10 && word.chars.tally.values_at('a','e','i','o','u').all?(1)

end

{{out}}

<pre>ambidextrous

 

=={{header|Swift}}==

 

func containsAllVowelsOnce(_ word: String) -> Bool {

} catch {

print(error.localizedDescription)

 

{{out}}

=={{header|Wren}}==

{{libheader|Wren-fmt}}

import "/fmt" for Fmt

 

count = count + 1

Fmt.print("$2d: $s", count, w)

 

{{out}}

 

=={{header|XPL0}}==

int I, Ch, Len;

char Word(100); \(longest word in unixdict.txt is 22 chars)

if AllVowels then [Text(0, Word); CrLf(0)];

until Ch = EOF;

 

{{out}}