Testing Keyboards

Question

My Problem

At my current place of employment, I single-handedly (ok dual-handedly because I'm missing no limbs) maintain approximately 700 laptops. Due to the nature and frequency of their use, I often find they are returned with a bit of damage. For this problem, my primary concern is when a laptop is returned with a broken or defunct keyboard. When the hardware repairman fixes these broken keyboards, it becomes necessary to test them. The test involves using each...and...every...single...key. What a drag right? The problem is, sometimes I lose track of if I typed a key or not.

A solution?

Write a program/script that:

1. Takes user input
2. Upon submission (in whatever way you deem fit), determines whether each key was pressed.
3. Outputs yes or no or any way to indicate that either I was successful in pressing all the keys or not. (Indicate in your answer the two possible outputs if it's not something obvious).

Assumptions:

1. Uppercase, lowercase, both? Whichever way you deem fit. As long as it's [A-Z], [a-z] or [A-Za-z]. Same goes with numbers and other symbols. (So if = was typed in, + doesn't matter). Your choice if you want to include shifted characters or not.
2. You needn't worry about tabs or spaces
3. No needs for function keys, CTRL, ALT, Esc or any other keys that don't output something on the screen
4. This assumes an EN-US keyboard and the laptops do not include a numpad.
5. OS agnostic, whatever language you prefer
6. It doesn't matter if the key has been pressed multiple times (for when the tester just gets lazy and starts button smashing like it's Mortal Kombat)

Here's a potential input set that would return true (or yes, or "You did it!")

`1234567890-=qwertyuiop[]\asdfghjkl;'zxcvbnm,./

Winner is determined by the least number of characters.

Answer 1

GolfScript, 6 bytes

.&,94=

If all ASCII characters with codes between 33 and 127 are present, it prints 1. Otherwise, it prints 0.

This approach will fail if the input contains other characters (including a final newline), which has been allowed by the OP and is also true for the existing GolfScript solution.

Usage

$ echo -n '!"#$%&'"'"'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~' |
> golfscript <(echo '.&,94=')
1

How it works

.&  # Compute the intersection of the input string with itself. This removes duplicates.
,   # Compute the length of the resulting string.
94= # Push 1 if the length is 94, otherwise push 0.

Answer 2

GolfScript, 11

Printable ASCII isn’t that interesting…

127,32,-^,!

Ruby, 68

With flag -rset for 4 characters.

p Set.new(?`..?z)+(?,..?9)+%w{[ ] \\ ; '}==Set.new(gets.split'')

and

Python 3, 76

print(set("`1234567890-=qwertyuiop[]\\asdfghjkl;'zxcvbnm,./")==set(input()))

Answer 3

JavaScript - 62 70

alert(!(47-prompt().match(/([',-\/\d;=a-z\[-\]`]?)(?!.*\1)/g).length))

And a bit shorter:

alert(!!prompt().match(/([',-\/\d;=a-z\[-\]`])(?!.*\1)/g)[46])

Answer 4

CJam - 9

',33>q-!

It checks for the "shifted" characters too (including uppercase letters).
Try it at http://cjam.aditsu.net/

Note: there is an invisible character (with code 127) after the apostrophe.

Answer 5

PHP

    foreach (str_split("`1234567890-=qwertyuiop[]\asdfghjkl;'zxcvbnm,./") as $v) {
        if (strpos($_GET['i'],$v)!==false)die(NO);
    }

$_GET['i'] is the input

Answer 6

Python 72:

f=lambda x:set(x)==set("`1234567890-=qwertyuiop[]\asdfghjkl;'zxcvbnm,./")

Answer 7

Haskell, 41 (two solutions)

interact(\y->show$all(`elem`y)[' '..'`'])

or (point-free style)

interact$show.(`all`[' '..'`']).flip elem

Need to input at least these characters:

 !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`

in any order, any number of times. Extra characters are allowed. Run in an interpreter. Must hit Enter when you are done, but if you hit Enter before you are done, you can keep entering characters, and press Enter again. Will print True if you have hit every character, otherwise it won't print anything.

Answer 8

Perl, 70 characters

say[sort grep!$s{$_}++,<>=~/\S/g]~~[sort"',-./;=[\]`"=~/./g,0..9,a..z]

Usage:

echo `134223423567890-=qwertyuiop[]\asdfghjkl;'zxcvbnm,./ | perl -E 'say[sort grep!$s{$_}++,pop=~/\S/g]~~[sort"',-./;=[\]`"=~/./g,0..9,a..z]'

Prints 1 if all keystrokes present, else prints nothing.

Answer 9

C, 97 characters

main(long a,char**u){a=0xfb0000000750003d;for(u++;**u;a|=2L<<*(*u)++-39);a=48+!~a;write(1,&a,1);}

Need to call the program with argument containing at least the letters:

`1234567890-=AZERTYUIOPQSDFGHJKLMWXCVBN[]\;',./

and get answer 1 (true). The charset can be changed by changing the initialization value of a.