AT&T UNIX™PC Unix System V Users Manual - tenox
AT&T UNIX™PC Unix System V Users Manual - tenox AT&T UNIX™PC Unix System V Users Manual - tenox
SORT(l) SORT(l) 0 The next argument is the name of an output file to use instead of the standard output. This file may be the same as one of the inputs. EXAMPLES Print in alphabetical order all the unique spellings in a list of words (capitalized words differ from uncapitalized): l sort -u +Of +0 list Print the password file (passwd(4)) sorted by user ID (the third colon-separated field): sort -t: +2n fetcfpasswd Print the first instance of each month in an already sorted file of (month-day) entries (the options - u rn with just one input file make the choice of a unique representative from a set of equal lines predictable): sort -urn +0 - 1 dates FILES /usr/tmpfstm??? SEE ALSO comm(l), join( l), uniq(l). DIAGNOSTICS Comments and exits with non-zero status for various trouble conditions and for disorder discovered under option -c. BUGS Very long lines are silently truncated. - 2-
SPELL ( 1) SPELL (l) NAME spell, hashmake, spellin, hashcheck - find spelling errors SYNOPSIS spell [ -v ] [ -b ] [ -x ] [ -1 ] [ +local_file ] [ files ] /usr/lib/spell/hashmake jusr/lib/spell/spellin n /usr/lib/spell/hashcheck spelling_list DESCRIPTION Spell collects words from the named files and looks them up in a spelling list. Words that neither occur among nor are derivable (by applying certain inflections, prefixes, and/or suffixes) from words in the spelling list are printed on the standard output. If no files are named, words are collected from the standard input. Spell ignores most nroff(l), tbl(l), and eqn(l) constructions. Under the -v option, all words not literally in the spelling list are printed, and plausible derivations from the words in the spelling list are indicated. Under the -b option, British spelling is checked. Besides preferring centre, colour, programme, speciality , traveled, etc., this option insists upon -ise in words like standardise, Fowler and the OED to the contrary notwithstanding. Under the -x option, every plausible stem is printed with = for each word. By default, spell (like deroff(l)) follows chains of included files ( .so and .nx troff requests), unless the names of such included files begin with /usr/lib. Under the -1 option, spell will follow the chains of all included files. Under the +local_file option, words found in local_file are removed from spell 's output. Local_file is the name of a userprovided file that contains a sorted list of words, one per line. With this option, the user can specify a set of words that are correct spellings (in addition to spell 's own spelling list) for each job. The spelling list is based on many sources, and while more haphazard than an ordinary dictionary, is also more effective with respect to proper names and popular technical words. Coverage of the specialized vocabularies of biology, medicine, and chemistry is light. Pertinent auxiliary files may be specified by name arguments, indicated below with their default settings (see FILES). Copies of all output are accumulated in the history file. The stop list filters out misspellings (e.g., thier=thy-y+ier) that would otherwise pass. Three routines help maintain and check the hash lists used by spell : hashmake Reads a list of words from the standard input and writes the corresponding nine-digit hash code on the - 1-
- Page 487 and 488: REGCMP ( 1 ) REGCMP (l) NAME regcmp
- Page 489: RM ( l ) RM (l) NAME rm, rmdir - re
- Page 492 and 493: I�
- Page 495: SCCSDIFF ( 1 ) SCCSDIFF ( 1 ) NAME
- Page 499 and 500: SDB ( l ) SDB ( 1) NAME sdb - symbo
- Page 501 and 502: � I SDB ( 1) SDB ( 1) file may ov
- Page 503 and 504: SDB ( 1) SDB ( 1) e directory file-
- Page 505 and 506: SDB ( 1 ) SDB ( 1 ) execution. B Pr
- Page 507: SDB ( 1 ) SDB ( 1 ) WARNINGS BUGS W
- Page 510 and 511: SDIFF ( 1) SDIFF(l) On exit from th
- Page 512 and 513: SED ( 1) SED ( 1) In the following
- Page 515 and 516: SETPRINT ( 1 ) SETPRINT ( 1 ) NAME
- Page 517 and 518: -� SH ( l ) NAME SH ( l ) sh, rsh
- Page 519 and 520: SH ( 1 ) SH(l) positional parameter
- Page 521 and 522: SH ( 1 ) word >> word
- Page 523 and 524: SH ( 1 ) SH ( 1) cd [ arg ] Change
- Page 525 and 526: SH (l) SH (l) Invocation . If the s
- Page 527 and 528: SHFORM (I) {AT&T UNIX PC only ) SHF
- Page 529 and 530: ( \ SHFORM(I) (AT&T UNIX PC only )
- Page 531 and 532: SIZE ( 1 ) SIZE ( 1) NAME size - pr
- Page 533: �· ! SLEEP (I) SLEEP (I) NAME sl
- Page 538 and 539: SPELL {l) SPELL (l) FILES spellin s
- Page 540 and 541: n__
- Page 543 and 544: STTY ( 1) STTY(l) NAME stty - set t
- Page 545: STTY ( 1) lfkc ( -lfkc) echonl ( -e
- Page 548 and 549: �· ·· .... . _ .....
- Page 550 and 551: �- . .�
- Page 552 and 553: � ·. ____ .
- Page 554 and 555: TABS (1) TABS ( 1) -u 1,12,20,44 UN
- Page 556 and 557: � \_ )
- Page 559 and 560: TAR ( 1 ) TAR ( 1) NAME tar - tape
- Page 561 and 562: TBL ( I ) TBL ( I ) NAME tbl - form
- Page 563 and 564: TBL(l) TBL(l) BUGS See BUGS under n
- Page 565: TC ( l ) TC ( l ) NAME tc - phototy
- Page 571 and 572: TEE(l) TEE(l) NAME tee - pipe fitti
- Page 573 and 574: TEST ( 1 ) TEST (I) NAME test - con
- Page 575 and 576: TIME ( 1) TIME ( 1) NAME time - tim
- Page 577: TOUCH (!) TOUCH (!) NAME touch - up
- Page 581 and 582: TRUE ( ! ) NAME true, false - provi
- Page 583 and 584: TSET ( 1) {AT&T UNIX PC only ) TSET
- Page 585: TSORT ( l ) TSORT ( 1) NAME tsort -
SORT(l) SORT(l)<br />
0 The next argument is the name of an output file to use<br />
instead of the standard output. This file may be the same<br />
as one of the inputs.<br />
EXAMPLES<br />
Print in alphabetical order all the unique spellings in a list of<br />
words (capitalized words differ from uncapitalized): l<br />
sort -u +Of +0 list<br />
Print the password file (passwd(4)) sorted by user ID (the third<br />
colon-separated field):<br />
sort -t: +2n fetcfpasswd<br />
Print the first instance of each month in an already sorted file of<br />
(month-day) entries (the options - u rn with just one input file<br />
make the choice of a unique representative from a set of equal<br />
lines predictable):<br />
sort -urn +0 - 1 dates<br />
FILES<br />
/usr/tmpfstm???<br />
SEE ALSO<br />
comm(l), join( l), uniq(l).<br />
DIAGNOSTICS<br />
Comments and exits with non-zero status for various trouble conditions<br />
and for disorder discovered under option -c.<br />
BUGS<br />
Very long lines are silently truncated.<br />
- 2-
Change language