Words containing "the" substring: Difference between revisions

 

;Task:

<br>then display the found words (on this page).

 

 

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

I ‘the’ C word & word.len > 11

 

{{out}}

weatherstrip

weatherstripping

</pre>

 

=={{header|Ada}}==

with Ada.Strings.Fixed; use Ada.Strings.Fixed;

with Ada.Characters.Latin_1; use Ada.Characters.Latin_1;

Close (The_File);

end Main;

{{output}}

<pre>

 

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

IF FILE input file;

STRING file name = "unixdict.txt";

print( ( newline, "found ", whole( the count, 0 ), " ""the"" words", newline ) );

close( input file )

{{out}}

<pre>

 

Using just the core language — 'words':

script o

property wordList : missing value

return o's output

 

Using just the core language — 'text items':

script o

property textItems : missing value

return o's output

 

Using a shell script:

-- Set up and execute a shell script which uses grep to find words containing the search text

-- (matching AppleScript's current case-sensitivity setting) and awk to pass those which

return paragraphs of (do shell script shellCode)

 

Using Foundation methods (AppleScriptObjC):

use framework "Foundation"

use scripting additions

return (theWords's filteredArrayUsingPredicate:(filter)) as list

 

Test code for the task with any of the above:

set textFile to ((path to desktop as text) & "unixdict.txt") as «class furl»

-- considering case -- Uncomment this and the corresponding 'end' line for case-sensitive searches.

set output to wordsContaining(textFile, "the", 12)

-- end considering

 

{{output}}

 

=={{header|Arturo}}==

 

 

 

=={{header|AutoIt}}==

; Includes not needed if you don't want to use the constants

#include <FileConstants.au3>

 

ConsoleWrite("Found " & $iFoundResults & " words containing '" & $sStrToFind & "'")

{{out}}

<pre>

The following is an awk one-liner entered at a Posix shell.

 

authenticate

chemotherapy

weatherstrip

weatherstripping

 

=={{header|BASIC}}==

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

30 LINE INPUT #1,W$

40 IF LEN(W$)>11 AND INSTR(W$,"the") THEN PRINT W$

{{out}}

<pre>authenticate

weatherstrip

weatherstripping</pre>

 

=={{header|BCPL}}==

 

let read(word) = valof

endread()

$)

{{out}}

<pre style='height:50ex;'>authenticate

 

=={{header|C}}==

#include <string.h>

 

fclose(f);

return 0;

{{out}}

<pre style="height:50ex;">authenticate

 

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

#include <fstream>

 

}

return 0;

{{out}}

<pre style="height:50ex;">authenticate

 

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

(defun print-words-containing-substring (str len path)

(with-open-file (s path :direction :input)

 

(print-words-containing-substring "the" 11 "unixdict.txt")

{{out}}

<pre>authenticate

{{libheader| System.IOUtils}}

{{Trans|Go}}

program Words_containing_the_substring;

 

 

readln;

 

=={{header|Factor}}==

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

 

"unixdict.txt" ascii file-lines

[ length 11 > ] filter

[ "the" swap subseq? ] filter

{{out}}

<pre style="height:18em">

weatherstripping

</pre>

 

=={{header|Forth}}==

Developed with Gforth 0.7.9

128 constant max-line

 

 

Test

{{out}}

<pre>

==============

Found 32 Words

</pre>

 

=={{header|FreeBASIC}}==

Reuses some code from [[Odd words#FreeBASIC]]

 

type node

next i

curr = curr->nxt

{{out}}

<pre>

weatherstrip

weatherstripping</pre>

 

=={{header|Go}}==

 

import (

}

}

 

{{out}}

 

=={{header|Haskell}}==

import Data.List (isInfixOf)

 

let res = [ w | w <- lines txt, isInfixOf "the" w, length w > 11 ]

putStrLn $ show (length res) ++ " words were found:"

<pre>λ> main

32 words were found:

weatherstrip

weatherstripping</pre>

 

=={{header|JavaScript}}==

document.write(`

<p>Select a file: <input type="file" id="file"></p>

fr.readAsText(f);

}

{{out}}

<pre>

 

=={{header|jq}}==

One could also use `test("the")` here instead, the difference being that the argument of `test` is a JSON string interpreted as a regular expression.

{{out}}

=={{header|Julia}}==

See [[Alternade_words]] for the foreachword function.

foreachword("unixdict.txt", containsthe, minlen = 12)

<pre>

Word source: unixdict.txt

 

=={{header|Lua}}==

if #word > 11 and word:find("the") then

print(word)

end

{{out}}

<pre>authenticate

 

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

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

dict //= Select[StringLength /* GreaterThan[11]];

{{out}}

<pre>{authenticate, chemotherapy, chrysanthemum, clothesbrush, clotheshorse, eratosthenes, featherbedding, featherbrain, featherweight, gaithersburg, hydrothermal, lighthearted, mathematician, neurasthenic, nevertheless, northeastern, northernmost, otherworldly, parasympathetic, physiotherapist, physiotherapy, psychotherapeutic, psychotherapist, psychotherapy, radiotherapy, southeastern, southernmost, theoretician, weatherbeaten, weatherproof, weatherstrip, weatherstripping}</pre>

=={{header|min}}==

{{works with|min|0.27.1}}

(length 11 >) filter

("the" indexof -1 !=) filter

{{out}}

<pre style="height:18em">

 

=={{header|Nanoquery}}==

for word in words

if (word .contains. "the") and (len(word) > 11)

println word

end if

 

=={{header|Nim}}==

 

var count = 0

if word.len > 11 and word.contains("the"):

inc count

 

{{out}}

 

=={{header|Objeck}}==

class Thes {

function : Main(args : String[]) ~ Nil {

};

}

 

{{out}}

southernmost theoretician weatherbeaten weatherproof weatherstrip

weatherstripping</pre>

 

=={{header|Perl}}==

Perl one-liner entered from a Posix shell:

 

authenticate

chemotherapy

weatherstrip

weatherstripping

 

=={{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;">the</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;">length</span><span style="color: #0000FF;">(</span><span style="color: #000000;">word</span><span style="color: #0000FF;">)></span><span style="color: #000000;">11</span> <span style="color: #008080;">and</span> <span style="color: #7060A8;">match</span><span style="color: #0000FF;">(</span><span style="color: #008000;">"the"</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;">the</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 'the' words:\n%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>

authenticate, chemotherapy, chrysanthemum, ..., weatherproof, weatherstrip, weatherstripping

</pre>

 

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

Start up.

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

Repeat.

Wait for the escape key.

{{out}}

<pre style="height:18em">

 

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

declare dict file;

open file(dict) title('unixdict.txt');

close file(dict);

{{out}}

<pre>authenticate

 

=={{header|Processing}}==

for (String word : words) {

if (word.contains("the") && word.length() > 11) {

println(word);

}

{{out}}

<pre style="height:18em">authenticate

 

=={{header|Python}}==

 

chemotherapy

chrysanthemum

weatherproof

weatherstrip

 

=={{header|Quackery}}==

Presented as a dialogue in the Quackery shell (REPL).

 

... [ dup

... [ $ 'the' buildfsm ] constant

weatherstripping

 

 

 

=={{header|Raku}}==

A trivial modification of the [[ABC_words#Raku|ABC words]] task.

 

{{out}}

<pre>32 words:

northernmost otherworldly parasympathetic physiotherapist physiotherapy psychotherapeutic psychotherapist psychotherapy

radiotherapy southeastern southernmost theoretician weatherbeaten weatherproof weatherstrip weatherstripping </pre>

 

=={{header|REXX}}==

Programming note: &nbsp; If the minimum length is negative, &nbsp; it indicates to find the words &nbsp; (but not display them), &nbsp; and

<br>only the display the count of found words.

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

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

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

say copies('─', 25) finds " words (with a min. length of" ,

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

<pre>

 

=={{header|Ring}}==

cStr = read("unixdict.txt")

wordList = str2list(cStr)

 

see "done..." + nl

Output:

<pre>

32. weatherstripping

done...

</pre>

 

 

{{works with|Smalltalk/X}}

select:[:word | (word size > 11) and:[word includesString:'the']]

 

if counting per word is required (which is overkill here, as there are no duplicates in the file), keep them in a bag:

'unixdict.txt' asFilename contents

select:[:word | (word size > 11) and:[word includesString:'the']]

 

bagOfWords transcribeCR.

 

Note: #transcribeCR is a method in Object which says: "Transcript showCR:self".

{{works with|Smalltalk/X}}

Variant (as script file). Save to file: "filter.st":

[Stdin atEnd] whileFalse:[

|word|

Stdout nextPutLine: word

]

Execute with:

 

The output from the above counting snippet:

 

32</pre>

 

=={{header|Standard ML}}==

 

fun isThe12 s = size s > 11 andalso hasThe s

o List.filter isThe12

o String.tokens Char.isSpace

{{out}}

<pre>authenticate chemotherapy chrysanthemum clothesbrush clotheshorse eratosthenes featherbedding featherbrain featherweight gaithersburg hydrothermal lighthearted mathematician neurasthenic nevertheless northeastern northernmost otherworldly parasympathetic physiotherapist physiotherapy psychotherapeutic psychotherapist psychotherapy radiotherapy southeastern southernmost theoretician weatherbeaten weatherproof weatherstrip weatherstripping</pre>

 

=={{header|Swift}}==

 

let minLength = 12

} catch {

print(error.localizedDescription)

 

{{out}}

 

=={{header|Tcl}}==

if {[string first the $w] != -1 && [string length $w] > 11} {

puts $w

}

{{out}}

<pre>authenticate

 

=={{header|VBA}}==

Dim ListeWords() As String, Book As String, i As Long, out() As String, count As Integer

Book = Read_File("C:\Users\" & Environ("Username") & "\Desktop\unixdict.txt")

Read_File = Input(LOF(Nb), #Nb)

Close #Nb

{{out}}

<pre>Found : 32 words : authenticate, chemotherapy, chrysanthemum, clothesbrush, clotheshorse, eratosthenes, featherbedding, featherbrain,

otherworldly, parasympathetic, physiotherapist, physiotherapy, psychotherapeutic, psychotherapist, psychotherapy, radiotherapy,

southeastern, southernmost, theoretician, weatherbeaten, weatherproof, weatherstrip, weatherstripping

</pre>

 

=={{header|Wren}}==

{{libheader|Wren-fmt}}

 

var wordList = "unixdict.txt" // local copy

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

}

 

{{out}}

 

=={{header|XPL0}}==

int I, Ch, Len;

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

[Text(0, Word); CrLf(0)];

until Ch = EOF;

 

{{out}}

</pre>

 

 

{{omit from|6502 Assembly|unixdict.txt is much larger than the CPU's address space.}}

{{omit from|8080 Assembly|See 6502 Assembly.}}

{{omit from|Z80 Assembly|See 6502 Assembly.}}