ABC words: Difference between revisions

{{draft task}}

;Definition

A word is an   ''ABC word''   if the letters  "'''a'''",  "'''b'''"  and  "'''c'''"  appear in the word in alphabetical order.

{{Template:Strings}}

<br><br>

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

IF FILE input file;

STRING file name = "unixdict.txt";

OD;

close( input file )

{{out}}

<pre>

54: tabernacle

55: tablecloth

</pre>

 

The following one-liner entered into a Posix shell returns the same 55 words as other entries.

 

 

Takes an optional command line for other character combinations. User can specify any reasonable number of unique characters. Caveat: see discussion page for issue about specifying repeated characters.

static void Main(string[] args) { int bi, i = 0; string chars = args.Length < 1 ? "abc" : args[0];

foreach (var item in System.IO.File.ReadAllLines("unixdict.txt")) {

skip: ; } }

}

{{out}}

Without command line arguments:

 

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

#include <fstream>

#include <iostream>

}

return EXIT_SUCCESS;

 

{{out}}

8: abreact

9: abscess

10: abscissa

11: abscissae

 

=={{header|FreeBASIC}}==

#define NOTINSTRING 9999

 

end if

wend

{{out}}

<pre>

54. tabernacle

55. tablecloth</pre>

 

=={{header|Go}}==

 

import (

}

}

 

{{out}}

55: tablecloth

</pre>

 

=={{header|Java}}==

import java.io.FileReader;

 

}

}

}

}

} catch (Exception e) {

e.printStackTrace();

return false;

}

 

{{out}}

22: programmer 23: programming 24: promethium

25: pummel 26: supremum

</pre>

 

=={{header|Julia}}==

positions = [findfirst(c -> c == ch, w) for ch in "abc"]

return all(!isnothing, positions) && issorted(positions) ? w : ""

 

foreachword("unixdict.txt", isabcword)

<pre>

Word source: unixdict.txt

paperback parabolic playback prefabricate quarterback razorback

roadblock sabbatical snapback strabismic syllabic tabernacle

tablecloth

</pre>

=={{header|Perl}}==

Outputs same 55 words everyone else finds.

 

@ARGV = 'unixdict.txt';

 

=={{header|Phix}}==

{{out}}

<pre>

55 abc words found: aback, abacus, abc, ..., syllabic, tabernacle, tablecloth

</pre>

 

=={{header|Python}}==

Outputs the same 55 words as other examples when entered in a Posix terminal shell

 

import sys

for ln in sys.stdin:

print(ln.rstrip())

' < unixdict.txt

 

=={{header|Raku}}==

{{out}}

 

=={{header|REXX}}==

 

It also allows the &nbsp; (ABC) &nbsp; characters to be specified on the command line (CL) as well as the dictionary file identifier.

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

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

end /*j*/

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

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

<pre>

 

=={{header|Ring}}==

cStr = read("unixdict.txt")

wordList = str2list(cStr)

ok

next

Output:

<pre>

54. tabernacle

55. tablecloth

</pre>

 

=={{header|Swift}}==

 

func loadDictionary(_ path: String) throws -> [String] {

} catch {

print(error)

 

{{out}}

=={{header|Wren}}==

{{libheader|Wren-fmt}}

 

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

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

}

 

{{out}}

 

=={{header|XPL0}}==

int I, J, K, Ch, Len;

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

];

until Ch = EOF;

 

{{out}}

tablecloth

</pre>