Write a stripped down version of the wc command. The program can simply open a file which does not need to be configurable or read from stdin until it encounters the end of file. When the program is finished reading, it should print:
Program must at least work with ascii but bonus points if it works on other encodings.
Shortest code wins.
l=length
main=interact$ \s->show$map($s)[l,l,l.lines,maximum.map l.lines,l.words]
If a source file that is not empty does not end in a new-line character, or ends in a new-line character immediately preceded by a backslash character before any such splicing takes place, the behavior is undefined.
\$\endgroup\$
Commented
Oct 13, 2011 at 16:04
$c+=$x=y!!!c,$w+=split,$m=$m<$x?$x-1:$m,$l++for<>;say"$c,$c,$l,$m,$w"
I think it can be shortened further but I don't know how.
(edit: used Zaid's suggestion)
(edit 2: changed length to y!!!c)
(edit 3: changed print to say)
while with a for to save two chars.
\$\endgroup\$
say instead of print that is allowed without penalties (meta.codegolf.stackexchange.com/questions/273/…) and save 2 chars.
\$\endgroup\$
Implementation is almost right out of K&R. Relies on K&R semantics for main (unspecified return type), but I think it otherwise conforms to c89. Output format is specified below (but it assumes that chars == bytes).
#include <stdio.h>
int b,w,l,t,L;main(int c,char**v){FILE*f=fopen(v[1],"r");for(;(c=getc(f))
!=-1;++b){t++;if(c=='\n')l++,L=t>L?t:L,t=0;else if(c==' '||c=='\t')w++;}
L=t>L?t:L;printf("%d (%d) %d %d %d\n",l,L,w,b,b);}
There is some ambiguity in the meaning of "words" as yet. This version defines words as breaking only on '[ \t\n] and does not account for a word that ends with EOF. This will work for files following the old unix convention of always ending with a newline, but break for those that stop hard on EOF.
It does test lines that end of EOF for maximal length.
#include <stdio.h>
int b, /* bytes */
w, /* words */
l, /* lines */
t, /*this line*/
L; /* longest line */
main(int c,char**v){
FILE*f=fopen(v[1],"r");
for(;(c=getc(f))!=-1;++b){
t++;
if(c=='\n') l++, L = t>L ? t : L, t=0;
else if(c==' '||c=='\t')w++;
}
L = t>L ? t : L;
/* Output format is lines (max line length) words chars bytes */
printf("%d (%d) %d %d %d\n",l,L,w,b,b);
}
$ gcc -o wc wordcount_golf.c
$ ./wc wordcount.c
17 (67) 82 410 410
$ ./wc wordcount_golf.c
4 (74) 9 217 217
$ wc wordcount.c
17 67 410 wordcount.c
$ wc wordcount_golf.c
4 13 217 wordcount_golf.c
t=readlines;s=t*'';p [s.size]*2+[t.size,t.map(&:size).max,s.split.size]
This solution uses a functional style similar to trinithis's Haskell solution.
I assume ASCII text and space-separated words.
awk 'x=1+length{w+=NF;if(m<x)m=x;c+=x}END{print NR,w,c,m}'
a={it.size()};[s=a(t=f.text),s,a(z=t.split"\n"),z*.size().max(),a(t.split(/\s/))]
for(<>){$t+=$l=y!!!c,$m=$l-1if$m<$l,$w+=split}say"$. $w $t $m $t"
I managed to save a couple of bytes by letting Perl handle the number of lines, using the $. variable. Other than that, even without looking, I ended up with what Marinus got, for the most part.
Here's the program I used to verify it:
#!/bin/bash
function test1() {
cat <<EOF
Lorem ipsum dolor sit amet,
consectetur adipiscing elit. Duis eget
neque vel ipsum porta bibendum
dictum in ante. Ut accumsan
magna id nisl bibendum et
tincidunt turpis eleifend. Duis nec
mi hendrerit lorem hendrerit convallis.
Quisque sit amet tincidunt diam.
Sed vehicula velit sed risus
pellentesque vitae auctor nisi semper.
Nulla erat massa, semper sit
amet luctus non, bibendum id
eros. Etiam non lacus odio.
Donec vitae nisl vitae nisi
elementum suscipit. Cras ut mollis
mauris.
EOF
}
function test2() {
cat <<EOF
Curabitur quis elit turpis. Vestibulum
ut elementum magna. Lorem ipsum
dolor sit amet, consectetur adipiscing
elit. Nam sit amet quam
ante. Nullam in risus est,
quis cursus magna. Vestibulum feugiat
nisl nec velit scelerisque molestie.
Pellentesque habitant morbi tristique senectus
et netus et malesuada fames
ac turpis egestas. Vestibulum feugiat
sem vitae mauris aliquet eget
ullamcorper velit molestie.
EOF
}
function test3() {
cat <<EOF
Proin diam elit, imperdiet id
gravida et, facilisis nec lectus.
Nullam placerat enim sed nulla
porttitor hendrerit. Praesent eu quam
enim, et commodo orci. Nam
eu purus ut ipsum malesuada
rhoncus vitae ut turpis. Morbi
a risus eu ligula faucibus
tincidunt. Cum sociis natoque penatibus
et magnis dis parturient montes,
nascetur ridiculus mus. Nulla faucibus
vehicula diam at tempus. Aliquam
tristique, erat vel fringilla scelerisque,
magna purus venenatis nulla, at
elementum mi lectus vitae nibh.
Phasellus nibh neque, tempus commodo
pretium eget, gravida quis felis.
Vivamus venenatis tristique volutpat. Nunc
vulputate accumsan magna, sit amet
vehicula orci imperdiet vel. Nam
vitae laoreet purus.
EOF
}
PROG1=wc
PROG2='perl5.14.2 -Mv5.10 wc-golfed.pl'
for((i=1;i<4;i++)); do
wc=( $(test$i | $PROG1) )
golf=( $(test$i | $PROG2) )
for((j=0;j<2;j++)); do
if [ ! ${wc[$j]} = ${golf[$j]} ]; then
echo "Test #$i failed"
echo " wc: ${wc[@]}"
echo " golf: ${golf[@]}"
continue 2
fi
done
echo "Test #$i passed"
done
This is based on dmckee's code with FUZxxl's improvements, but shortened further and converted to standard C. The code reads from standard input only. Any sequence of one or more consecutive characters with ASCII code >= 33 is counted as a word.
#include<stdio.h>
int b,w,l,t,L,c,s;int main(void){for(;c=getchar()+1;++b)t-=c==11?l++,t>L?L=t:t:-1,s=c>33?w+=!s:0;printf("%d %d %d %d\n",l,t>L?t:L,w,b);return 0;}
#include <stdio.h>
int b, /* bytes */
w, /* words */
l, /* lines */
t, /* this line */
L, /* longest line */
c, /* current character */
s; /* s==1 if the current word has been counted */
int main(void) {
for (; c = getchar()+1; ++b)
t -= (c==11 ? (l++, (t>L ? L=t : t))
: -1),
s = (c>33 ? w += !s
: 0);
printf("%d %d %d %d\n", l, (t>L ? t : L), w, b);
return 0;
}
Golfed
x=scan(w="c",se="\n");n=nchar(x);sum(n);length(x);max(n);sum(sapply(strsplit(x," "),length))
Ungolfed
x=scan(what="c",sep="\n")
n=nchar(x)
num.char=sum(n)
num.lines=length(x)
max.line.length=max(n)
word.count=sum(sapply(strsplit(x," "),length))
Output
> x=scan(what="c",sep="\n");n=nchar(x);sum(n);length(x);max(n);sum(sapply(strsplit(x," "),length))
1: This is a test
2: of how well
3: the program works!
4:
Read 3 items
[1] 43
[1] 3
[1] 18
[1] 10
Alternatives
x=scan(w="c",se="\n");n=nchar(x);sum(n);length(x);max(n);length(unlist(gregexpr("\\w+",x)))
Saves a character at the expense of not really matching everything.
x=scan(,"",se="\n");n=nchar(x);sum(n);l=length;l(x);max(n);sum(sapply(strsplit(x," "),l))
\$\endgroup\$
length() to save some characters - 87 now. sum(n<-nchar(x<-scan(,"",se="\n")));(l=length)(x);max(n);sum(sapply(strsplit(x," "),l))
\$\endgroup\$
The java file i/o calls take up a lot of space. But I didn't realize you call java so easily from javascript and thought that was pretty neat:
var r=new BufferedReader(new FileReader(f));var s=true;var n=0,l=0,m=0,w=0;while(s){s=r.readLine();if(s){n+=s.length();l+=1;m=m<s.length()?s.length():m;w+=s.split("\\s+").length;}}print(n+','+n+','+l+','+m+','+w);
var reader = new BufferedReader( new FileReader(filename) );
var s = true;
var n=0,l=0,m=0,w=0;
while (s) {
s = reader.readLine();
if (s) {
n+=s.length();
l+=1;
m = m<s.length()?s.length():m;
w += s.split("\\s+").length;
}
}
System.out.println('bytes/chars: '+n+', Lines: '+l+', Max Line: '+m+', Words: '+w);
Python 160
Your file name is assigned to variable q.
g=len
z=open(q,'r')
w=z.read()
z.close()
b,e,f=g(w),g(w.replace('\n',' ').split()),w.split('\n')
d,c,a=g(max(f)),g(f),g(open(q,'rb').read())
for i in 'abcde':
print eval(i)
This prints the 5 requirements in order:
bytes read
characters read
lines read
max line length
words read
(TyrantWaves suggestion implemented)
the\nbear is one word, while it should be two. you could do w.split(w.replace('\n', ' '))
\$\endgroup\$
close and the read/write mode. do z=open(q).read()
\$\endgroup\$
Commented
May 10, 2012 at 4:56
{a:0:x;(#a;+/b;max b:#:'a;+/#:'" "\:'a)}
Prints linecount, char count, max line length, word count.
Words are space-separated.
l=len
f=open(q).read()
j=f.split("\n")
for i in (l(f),l(f),l(j),max(j,key=l),l(f.split())):print i
98 is including newlines. Do newlines count?
\r\n newlines (invalid bytes count). q is not defined (OP allows a fixed name such as 'q' or use sys.stdin). It expects only ascii (invalid character count). There is missing l() call around max() (it prints line instead of its length)
\$\endgroup\$
<?$f=file($argv[1]);$l=0;foreach($f as$i)$l=$l<strlen($i)?strlen($i):$l;$n=count($f);$c=strlen($g=implode($f));$w=count(explode(' ',$g))+$n-1;echo"$c $c $n $l $w";
