Home
last modified time | relevance | path

Searched refs:words (Results 1 – 25 of 80) sorted by relevance

1234

/original-bsd/usr.bin/spell/
H A DREADME8 The new subdirectory "special" contains lists of words in specialized
19 the words in the file special/4bsd, comprising current 4bsd
23 provided which only contains the contents of /usr/dict/words. Managers
25 files hlist{a,b} which contain the words from
29 e.g. troff, emacs, tty, have been included in /usr/share/dict/words.
32 machine, so as to include the words in /usr/share/dict/special/math, as well
60 Complaints, and any additional suggestions for words or wordlists,
70 words -- common words, and important technical terms from all
75 words in one of the above files, but should not be accepted.
76 hlist -- hashed list, formed from the file "words" only.
[all …]
H A D87_changes3 (a) Words to be added to /usr/dict/words:
5 (a1) First, the straightforward cases: useful words not previously
8 typing in words that I guessed might be missing but that seemed common
199 /usr/dict/words because they are common English words not already in
234 (b) Words being deleted from /usr/dict/words:
236 (b1) The following words previously in /usr/dict/words are being
250 complete list of words from such titles in /usr/dict/words. Names of
258 from words in /usr/dict/words (in some cases, words now being added):
282 list called the "stoplist"; words on that list and words which can be
390 those in the next, of words in /usr/dict/words or derivable therefrom;
[all …]
/original-bsd/old/refer/refer/
H A Dglue5.c21 struct words { struct
24 struct words *nst; argument
25 struct words *link; argument
26 struct words *fail; argument
49 www = (struct words *) zalloc(MAXSIZ, sizeof (*www));
108 register struct words *c; in execute()
245 register struct words *s; in cgotofn()
314 struct words *queue[QSIZE]; in cfail()
315 struct words **front, **rear; in cfail()
316 struct words *state; in cfail()
[all …]
/original-bsd/usr.bin/diction/diction/
H A Ddprog.c27 struct words { struct
30 struct words *nst; argument
31 struct words *link; argument
32 struct words *fail; argument
160 register struct words *c;
164 struct words *savc;
187 savc = (struct words *) 0;
360 register struct words *s; in cgotofn()
418 struct words *queue[QSIZE]; in cfail()
420 struct words *state; in cfail()
[all …]
/original-bsd/usr.bin/grep/old.fgrep/
H A Dold.fgrep.c35 struct words { struct
38 struct words *nst; argument
39 struct words *link; argument
40 struct words *fail; argument
148 register struct words *c;
286 register struct words *s; in cgotofn()
352 struct words *queue[QSIZE]; in cfail()
353 struct words **front, **rear; in cfail()
354 struct words *state; in cfail()
357 register struct words *s; in cfail()
/original-bsd/old/boggle/
H A Dinst2 as many words as possible in a 4 by 4 grid of letters. Words may be formed
6 play amongst humans, each player is given credit for those of his words
12 grid and lists all the words from the online dictionary found therein.
14 you, let you enter words for 3 minutes, and then tell you how well you
17 In interactive play, enter your words separated by spaces, tabs,
21 entering words, your erase character is only effective within the current
H A DMakefile14 bogdict: /usr/share/dict/words comp sfile
15 sed -f ${.CURDIR}/sfile /usr/share/dict/words | uniq | ./comp >bogdict
/original-bsd/usr.bin/f77/pass1.vax/
H A Dsetfmt.c46 putshrts( words, count ) in putshrts() argument
47 short *words; in putshrts()
50 fprintf( asmfile, ".word %d\n", *words++ );
/original-bsd/games/boggle/boggle/
H A Dhelpfile20 words you found, the words you missed, and your running statistics to be
43 You have 3 minutes to find as many words as possible in the Boggle board.
63 - If there are a great many words in the cube the final display of the words
64 may scroll off of the screen. (On a 25 line screen about 130 words can be
71 - When using the '+' or '++' options the display of words found in the board
/original-bsd/lib/libc/mips/string/
H A Dbcmp.s50 and a3, a2, ~3 # compute number of whole words left
54 lw v0, 0(a0) # compare words
76 and a3, a2, ~3 # compute number of whole words left
80 LWHI v0, 0(a0) # compare words a0 unaligned, a1 aligned
H A Dbcopy.s68 and v0, a2, 3 # compute number of words left
73 LWHI v0, 0(a0) # copy words a0 unaligned, a1 aligned
89 and v0, a2, 3 # compute number of whole words left
94 lw v0, 0(a0) # copy words
H A Dbzero.s29 and v0, a1, 3 # compute number of words left
34 addu a0, a0, 4 # clear words
/original-bsd/usr.bin/systat/
H A Diostat.c276 double atime, words, xtime, itime; local
280 words = s.dk_wds[dn]*32.0; /* number of words transferred */
281 xtime = dk_mspw[dn]*words; /* transfer time */
289 words / 512 / etime, s.dk_xfer[dn] / etime,
294 histogram(words / 512 / etime, 50, 1.0);
/original-bsd/lib/libc/db/test/hash.tests/
H A Dmakedb.sh5 awk '{i++; print $0; print i;}' /usr/share/dict/words > WORDS
/original-bsd/share/dict/
H A DMakefile3 FILES= README connectives propernames web2 web2a words
H A DREADME5 Welcome to web2 (Webster's Second International) all 234,936 words worth.
/original-bsd/lib/libc/tahoe/sys/
H A Dsyscall.s19 shrl $2,r1,r1 # convert to words
/original-bsd/usr.sbin/iostat/
H A Diostat.c319 double atime, itime, msps, words, xtime; in dkstats() local
324 words = cur.dk_wds[dn] * 32; /* words xfer'd */ in dkstats()
326 words / (DEV_BSIZE / 2) / etime); in dkstats()
333 xtime = words / dk_wpms[dn]; /* transfer time */ in dkstats()
/original-bsd/usr.bin/tn3270/ctlr/
H A Dapi.h354 struct words { struct
367 struct words x; argument
/original-bsd/lib/libcompat/regexp/
H A Dtests114 multiple words of text uh-uh n - -
115 multiple words multiple words, yeah y & multiple words
/original-bsd/games/battlestar/
H A DMakefile6 globals.c dayfile.c nightfile.c dayobjs.c nightobjs.c words.c
H A Dbattlestar.c55 next = getword(next, words[wordcount], -1);
/original-bsd/games/boggle/
H A DMakefile6 mkdict/obj/mkdict < /usr/share/dict/words > \
/original-bsd/local/local.cmd/
H A DCorrect.sh21 DICT=/usr/share/dict/words
/original-bsd/usr.bin/pascal/pdx/sym/
H A Dsym.rep37 struct { /* information for reserved words */

1234