Ordered words: Difference between revisions

{{task|text processing}}

 

 

=={{header|Ada}}==

 

procedure Ordered_Words is

package Word_Vectors is new Ada.Containers.Indefinite_Vectors

(Index_Type => Positive, Element_Type => String);

Max_Length : Positive := 1;

begin

declare

begin

end if;

end if;

end;

end loop;

 

Output:

 

=={{header|Aime}}==

{

 

a = 1;

 

}

}

 

}

 

main(void)

{

file f;

text s;

 

 

}

}

 

 

return 0;

{{out}}

<pre>abbott

glossy

knotty</pre>

 

=={{header|AutoHotkey}}==

StringLower could be used. This script assumes a locally downloaded copy of the dictionary, but UrlDownloadToFile could be used.

The purpose of the GUI is simply to display a field where the user can copy the list. MsgBox could be used, or FileAppend.

MaxLen=0

Loop, Read, UnixDict.txt ; Assigns A_LoopReadLine to each line of the file

GUIClose:

ExitApp

Output:

<pre>abbott, accent, accept, access, accost, almost, bellow, billow, biopsy, chilly, choosy, choppy, effort, floppy, glossy, knotty</pre>

=={{header|AWK}}==

abc = "abcdefghijklmnopqrstuvwxyz"

}

for (i = 1; i <= best["count"]; i++)

print best[i]

 

You must provide <tt>unixdict.txt</tt> as input.

 

<pre>$ awk -f ordered-words.awk unixdict.txt

abbott

accent

=={{header|BBC BASIC}}==

An optimisation is that the word isn't checked for being ordered unless it is at least as long as the current maximum.

IF dict%=0 ERROR 100, "Failed to open dictionary file"

CLOSE #dict%

PRINT list$

'''Output:'''

<pre>

</pre>

 

=={{header|Bracmat}}==

= bow result longestLength word character

. 0:?bow

| !result

)

<pre> knotty

glossy

 

=={{header|Burlesque}}==

 

{{Out}}

 

=={{header|C}}==

#include <string.h>

#include <stdio.h>

 

return EXIT_SUCCESS;

Output:

<pre>abbott

knotty</pre>

Alternative version with dynamic array:

#include <string.h>

#include <stdio.h>

 

return EXIT_SUCCESS;

===Mmap===

Shorter and potentially much faster version with <code>mmap (2)</code>. No stinky <code>malloc</code> or <code>scanf</code> calls.

#include <sys/mman.h>

#include <sys/types.h>

close(fd);

return 0;

 

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

 

#include <fstream>

#include <iostream>

}

std::copy(words.begin(), words.end(), std::ostream_iterator<std::string>(std::cout, "\n"));

Output:

<pre>

knotty

</pre>

 

=={{header|Clojure}}==

 

(not-any? pos? (map compare coll (next coll))))

 

take-while-eqcount

(clojure.string/join ", ")

 

Output

 

=={{header|CoffeeScript}}==

ordered_word = (word) ->

for i in [0...word.length - 1]

dict_words = file_content.toString().split '\n'

show_longest_ordered_words dict_words, dict_file_name

output

> coffee ordered_words.coffee

Longest Ordered Words (source=unixdict.txt):

glossy

knotty

 

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

(reduce (lambda (prev curr)

(when (char> prev curr) (return-from orderedp nil))

("abbott" "accent" "accept" "access" "accost" "almost" "bellow" "billow"

"biopsy" "chilly" "choosy" "choppy" "effort" "floppy" "glossy" "knotty")

 

=={{header|D}}==

===Simple Procedural Version===

import std.stdio, std.algorithm, std.range, std.string;

 

 

writefln("%-(%s\n%)", result);

{{out}}

<pre>abbott

===Faster Procedural Version===

Faster, same output.

import std.stdio, std.algorithm, std.file, std.range;

 

 

writefln("%-(%s\n%)", result);

 

===Functional Version===

Shorter, same output.

import std.stdio, std.algorithm, std.range, std.file, std.string;

 

immutable maxLen = words.map!q{a.length}.reduce!max;

writefln("%-(%s\n%)", words.filter!(w => w.length == maxLen));

 

===Fastest Memory Mapped Version===

Lower level, much faster with large input files (about as fast as the memory mapped C version). The output is the same. It works only with ASCII texts, but unlike the C entry this is portable.

{{trans|C}}

 

const(char)[] findWord(const char[] s) pure nothrow @safe @nogc {

 

txt[0 .. outStart].write;

 

=={{header|Delphi}}==

program POrderedWords;

 

end;

end.

 

Output: dictionary directly processed from the URL

 

abbott accent accept access accost almost bellow billow biopsy chilly choosy choppy effort floppy glossy knotty

 

=={{header|E}}==

{{trans|Python}}

 

 

def words := <http://www.puzzlers.org/pub/wordlists/unixdict.txt>.getText().split("\n")

def maxLen := accum 0 for word in ordered { _.max(word.size()) }

def maxOrderedWords := accum [] for word ? (word.size() <=> maxLen) in ordered { _.with(word) }

 

One-pass procedural algorithm which avoids keeping the entire data set in memory:

 

for `@word$\n` ? (word.sort() <=> word) in <http://www.puzzlers.org/pub/wordlists/unixdict.txt> {

if (best.size() == 0) {

}

}

 

 

=={{header|Erlang}}==

-module( ordered_words ).

 

 

words() -> anagrams_deranged:words_from_url( "http://www.puzzlers.org/pub/wordlists/unixdict.txt" ).

{{out}}

<pre>

 

=={{header|Euphoria}}==

 

type ordered(sequence s)

close(fn)

 

 

Output:

 

=={{header|F Sharp|F#}}==

open System.IO

|> Seq.head |> snd

 

 

Output:

 

=={{header|Factor}}==

USING: grouping http.client io io.encodings.utf8 io.files

io.files.temp kernel math memoize sequences sequences.extras

word-list [ ordered-word? ] filter

all-longest [ print ] each ;

 

Output: <pre>( scratchpad ) USING: ordered-words-main ;

=={{header|Fantom}}==

 

class Main

{

}

}

 

Output:

<pre>abbott accent accept access accost almost bellow billow biopsy chilly choosy choppy effort floppy glossy knotty

</pre>

=={{header|FBSL}}==

Downloads the list from puzzlers.org.

 

FUNCTION RESTfulGET(url)

RETURN TRUE

END FUNCTION

Output

<pre> abbott accent accept access accost almost bellow billow biopsy chilly choosy choppy effort floppy glossy knotty

This program uses a string stack, which means that all matching words are stored on a stack.

The longest word ends up on the top of the stack.

include lib/stmstack.4th \ include string stack library

 

; \ open file, clear the stack, read file

\ read it back and close the file

Since the longest word is on top of the stack, the only thing to be done is to pop

all words from the stack until a shorter word is encountered. Consequently, all

=={{header|Fortran}}==

 

!***************************************************************************************

module ordered_module

end program main

!****************************************************

 

'''Output'''

<pre>abbott accent accept access accost almost bellow billow biopsy chilly choosy choppy effort floppy glossy knotty </pre>

=={{header|Go}}==

Go has strings and Unicode and stuff, but with the dictionary all ASCII

and lower case, strings and Unicode seem overkill. I just worked with byte slices here, only converting the final result to strings for easy output.

 

import (

fmt.Println(string(bs))

}

Output:

<pre>

=={{header|Groovy}}==

Solution:

assert isOrdered('abbey')

assert !isOrdered('cat')

def owMax = orderedWords*.size().max()

 

 

Output:

glossy

knotty</pre>

=={{header|Haskell}}==

-- Words are read from the standard input. We keep in memory only the current

-- set of longest, ordered words.

let ws = longestOrderedWords $ words str

mapM_ putStrLn ws

 

Output:

abbott

accent

glossy

knotty

Alternative version:

 

isSorted wws@(_ : ws) = and $ zipWith (<=) wws ws

let ow = filter isSorted ls

let maxl = foldr max 0 (map length ow)

 

=={{header|Icon}} and {{header|Unicon}}==

 

procedure main(A)

}

every write(!\maxList)

 

{{libheader|Icon Programming Library}}

knotty

-></pre>

 

=={{header|J}}==

 

Recap:

 

# select the longest ordered words (<code>(#~ (= >./)@:(#@>))oWords</code>)

# format for display (using ;:inv)

=={{header|Java}}==

{{works with|Java|1.5+}}

This example assumes there is a local copy of the dictionary whose path is given as the first argument to the program.

import java.io.FileReader;

import java.io.IOException;

}

}

Output:

<pre>abbott

glossy

knotty</pre>

 

=={{header|JavaScript}}==

Using [http://nodejs.org/ node.js]:

 

fs.readFile('./unixdict.txt', 'ascii', function (err, data) {

var is_ordered = function(word){return word.split('').sort().join('') === word;},

};

print(longest.sort().join(', ') + '\n');

 

Output:

Alternative version (also using Node.js):

 

 

http.get({

console.log(ordered.join(', '));

});

=={{header|jq}}==

 

def longest_ordered_words:

# avoid string manipulation:

map(select(is_ordered))

| (map(length)|max) as $max

 

 

{{out}}

["abbott","accent","accept","access","accost","almost","bellow","billow","biopsy","chilly","choosy","choppy","effort","floppy","glossy","knotty"]

 

=={{header|Julia}}==

 

 

 

{{out}}

 

=={{header|K}}==

("abbott"

"accent"

"floppy"

"glossy"

 

=={{header|Lang5}}==

"" split

"&'0123456789abcdefghijklmnopqrstuvwxyz" "" split

fh fin filtering fh close ;

 

{{out}}

<pre>[ abbott accent accept access accost almost bellow billow biopsy chilly choosy choppy effort floppy glossy knotty ]</pre>

 

=={{header|Lasso}}==

#f->dowithclose => {

#f->foreachLine => {

with w in #ordered

where #w->size == #maxleng

{{out}}

<pre>abbott accent accept access accost almost bellow billow biopsy chilly choosy choppy effort floppy glossy knotty</pre>

 

=={{header|Liberty BASIC}}==

'Ordered wordsFrom Rosetta Code

open "unixdict.txt" for input as #1

close #1

print wordList$

 

Output:

glossy

knotty </pre>

 

=={{header|Lua}}==

 

maxlen = 0

end

 

Output:

<pre>abbott

knotty</pre>

 

 

data = Select[Import["http://www.puzzlers.org/pub/wordlists/unixdict.txt", "List"],

OrderedQ[Characters[#]] &]},

max = Max[StringLength /@ data];

Select[data, StringLength[#] == max &]]

 

However Mathematica has built in dictionaries for many languages, so here is a more general version...

 

max = Max[StringLength /@ data];

Select[data, StringLength[#] == max &]]

 

<pre>

=={{header|MATLAB}} / {{header|Octave}}==

 

listlen= 0;

fid = fopen('unixdict.txt','r');

end

fclose(fid);

 

Returns:

glossy

knotty</pre>

 

=={{header|NetRexx}}==

options replace format comments java crossref savelog symbols binary

 

Arrays.sort(wchars)

return dword.equalsIgnoreCase(String(wchars))

;Output

<pre>

 

=={{header|Nim}}==

 

for c in s:

last = c

 

 

if word.len > mx:

mx = word.len

<pre>abbott accent accept access accost almost bellow billow biopsy chilly choosy choppy effort floppy glossy knotty</pre>

 

=={{header|OCaml}}==

 

try Some(input_line ic)

with End_of_file -> None

let ordered_words = List.filter is_ordered lower_words in

let longest_ordered_words = longest_words ordered_words in

 

Output:

=={{header|Oforth}}==

 

| w longest l s |

0 ->longest

w size dup ->s longest < ifTrue: [ continue ]

w sort w == ifFalse: [ continue ]

s longest > ifTrue: [ s ->longest ListBuffer new ->l ]

l add(w)

 

{{out}}

<pre>

[abbott, accent, accept, access, accost, almost, bellow, billow, biopsy, chilly, choosy, choppy, effort, floppy, glossy, knotty]

</pre>

 

=={{header|Perl}}==

use strict;

use warnings;

close FH;

print "@{$words[-1]}\n";

Output:

<pre>

</pre>

 

<pre>

</pre>

 

=={{header|PicoLisp}}==

(mapc prinl

(maxi '((L) (length (car L)))

(by length group

(filter '((S) (apply <= S))

Output:

<pre>abbott

 

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

order: procedure options (main); /* 24/11/2011 */

declare word character (20) varying;

end in_order;

end order;

OUTPUT:

<pre>

accent

abbott

</pre>

 

Works with SWI-Prolog

 

 

ordered_words :-

my_compare(R, K1-_V1, K2-_V2) :-

( K1 < K2 -> R = >; K1 > K2 -> R = <; =).

Output :

<pre> ?- ordered_words.

 

=={{header|PureBasic}}==

Protected Dim letters.c(wordLength)

Protected *letAdr = @letters()

CopyMemoryString(*word, @*letAdr)

SortArray(letters(), #PB_Sort_Ascending, 0, wordLength - 1)

ProcedureReturn PeekS(@letters(), wordLength)

EndProcedure

Structure orderedWord

word.s

length.i

EndStructure

Define filename.s = "unixdict.txt", fileNum = 0, word.s

If OpenConsole()

NewList orderedWords.orderedWord()

EndIf

Wend

EndIf

Define maxLength

FirstElement(orderedWords())

EndIf

Next

Print(#CRLF$ + #CRLF$ + "Press ENTER to exit"): Input()

CloseConsole()

Sample output:

<pre>abbott accent accept access accost almost bellow billow biopsy chilly

 

=={{header|Python}}==

 

url = 'http://www.puzzlers.org/pub/wordlists/unixdict.txt'

maxlen = len(max(ordered, key=len))

maxorderedwords = [word for word in ordered if len(word) == maxlen]

 

 

mx, url = 0, 'http://www.puzzlers.org/pub/wordlists/unixdict.txt'

words, mx = [], lenword

words.append(word)

 

'''Sample Output'''

<pre>abbott accent accept access accost almost bellow billow biopsy chilly choosy choppy effort floppy glossy knotty</pre>

 

=={{header|Racket}}==

 

#lang racket

(require net/url)

(loop len longs words)

(loop wlen (cons word (if (> wlen len) '() longs)) words)))))

 

Output:

glossy

knotty

</pre>

 

<br>but since the word list &nbsp; (in this case) &nbsp; is already in alphabetical order, this would-be improvement is

<br>mostly moot.

<pre>

16 words found (of length 6)

glossy

knotty

</pre>

 

=={{header|Ruby}}==

ordered_words = open('http://www.puzzlers.org/pub/wordlists/unixdict.txt', 'r').select do |word|

word.strip!

 

grouped = ordered_words.group_by &:size

 

'''Sample Output'''

knotty</pre>

Local version:

 

=={{header|Run BASIC}}==

j = 1

i = instr(a$,chr$(10),j)

if len(a3$) = maxL then print a3$

n = n + 1

<pre>abbott

accent

 

=={{header|Rust}}==

 

fn is_ordered(s: &str) -> bool {

let mut prev = '\x00';

if c < prev {

return false;

}

 

let mut longest_length = 0;

 

let n = s.len();

if n > longest_length {

}

if n == longest_length {

}

}

 

fn main() {

 

let longest_ordered = find_longest_ordered_words(lines);

 

for s in longest_ordered.iter() {

}

 

=={{header|Scala}}==

 

/**

val ww = orderedWords( wordsAll ).sortBy( -_.length )

 

{{out}}

<pre>

knotty

</pre>

=={{header|Scheme}}==

The following implementation uses a <tt>char>=?</tt> procedure that accepts an arbitrary number of arguments. This is allowed, but not required, by R5RS, and is provided by many Scheme implementations. It has been tested under GNU Guile 1.8.8.

 

(define sorted-words

(let ((port (open-input-file "unixdict.txt")))

(newline)))

sorted-words)

 

Output:

 

=={{header|Seed7}}==

 

const func boolean: isOrdered (in string: word) is func

end if;

write(wordList);

 

Output:

 

=={{header|Sidef}}==

 

 

fh.each { |line|

 

{{out}}

<pre>abbott accent accept access accost almost bellow billow biopsy chilly choosy choppy effort floppy glossy knotty</pre>

 

=={{header|Smalltalk}}==

{{works with|GNU Smalltalk}}

 

file := FileStream open: 'unixdict.txt' mode: FileStream read.

dict := Set new.

r := (r select: [:w| (w size) = ((r at: 1) size)]) asSortedCollection.

 

 

Output:

knotty</pre>

 

 

=={{header|Tcl}}==

 

# Pick the ordered words (of maximal length) from a list

set t [http::geturl "http://www.puzzlers.org/pub/wordlists/unixdict.txt"]

puts [chooseOrderedWords [http::data $t]]

Output:

<pre>

abbott accent accept access accost almost bellow billow biopsy chilly choosy choppy effort floppy glossy knotty

</pre>

 

=={{header|TUSCRIPT}}==

$$ MODE TUSCRIPT

SET data = REQUEST ("http://www.puzzlers.org/pub/wordlists/unixdict.txt")

ENDLOOP

ENDCOMPILE

Output:

<pre>

15. glossy

16. knotty

</pre>

 

=={{header|Ursala}}==

 

#show+

 

* <code>leql</code> is a binary predicate testing a pair of lists for less or equal length

* <code>eql</code> tests for equal length

 

=={{header|VBA}}==

Public Sub orderedwords(fname As String)

' find ordered words in dict file that have the longest word length

End If

End Function

 

Results:

knotty

</pre>

 

=={{header|Vedit macro language}}==

#1 = 2 // length of longest word found

Repeat (ALL) {

}

Buf_Quit(OK) // close file

 

<pre>abbott

knotty </pre>

 

 

 

 

 

{{out}}

accent

accept

floppy

glossy

 

=={{header|zkl}}==

One pass, dictionary stays on disk:

fcn isLex(word){ word.reduce(fcn(p,c){ (p<=c) and c or T(Void.Stop,False) }) }

File("dict.txt").pump(Void,fcn(w){

})

println("Num words: %d, all size %d\n".fmt(words.len(),sz));

Or, reading dictionary into memory:

lwords:=File("dict.txt").readln(*).apply("strip").filter(isLex);

max:=lwords.reduce(fcn(n,w){ w.len()>n and w.len() or n },0);

lwords=lwords.filter(fcn(w,n){ w.len()==n },max);

println("Num words: %d, all size %d\n".fmt(lwords.len(),max));

{{out}}

<pre>

knotty

</pre>