Return to fmt.1 CVS log

Up to [CSRG BSD Unix] / 43BSDReno / usr.bin / fmt

Annotation of 43BSDReno/usr.bin/fmt/fmt.1, revision 1.1

1.1     ! root        1: .\" Copyright (c) 1980, 1990 The Regents of the University of California.
        !             2: .\" All rights reserved.
        !             3: .\"
        !             4: .\" Redistribution and use in source and binary forms are permitted provided
        !             5: .\" that: (1) source distributions retain this entire copyright notice and
        !             6: .\" comment, and (2) distributions including binaries display the following
        !             7: .\" acknowledgement:  ``This product includes software developed by the
        !             8: .\" University of California, Berkeley and its contributors'' in the
        !             9: .\" documentation or other materials provided with the distribution and in
        !            10: .\" all advertising materials mentioning features or use of this software.
        !            11: .\" Neither the name of the University nor the names of its contributors may
        !            12: .\" be used to endorse or promote products derived from this software without
        !            13: .\" specific prior written permission.
        !            14: .\" THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
        !            15: .\" WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
        !            16: .\" MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
        !            17: .\"
        !            18: .\"     @(#)fmt.1      6.6 (Berkeley) 7/24/90
        !            19: .\"
        !            20: .Dd July 24, 1990
        !            21: .Dt FMT 1
        !            22: .Sh NAME
        !            23: .Nm fmt
        !            24: .Nd simple text formatter
        !            25: .Sh SYNOPSIS
        !            26: .Nm fmt
        !            27: .Ob
        !            28: .Ar goal
        !            29: .Op Ar maximum
        !            30: .Oe
        !            31: .Op name ...
        !            32: .Sh DESCRIPTION
        !            33: .Nm Fmt
        !            34: is a simple text formatter which reads the concatenation of input
        !            35: files (or standard input if none are given) and produces on standard
        !            36: output a version of its input with lines as close to the
        !            37: .Ar goal
        !            38: length
        !            39: as possible without exceeding the maximum.  The
        !            40: .Ar goal
        !            41: length defaults
        !            42: to 65 and the maximum to 75.  The spacing at the beginning of the
        !            43: input lines is preserved in the output, as are blank lines and
        !            44: interword spacing.
        !            45: .Pp
        !            46: .Nm Fmt
        !            47: is meant to format mail messages prior to sending, but may also be useful
        !            48: for other simple tasks.
        !            49: For instance,
        !            50: within visual mode of the
        !            51: .Xr ex 1
        !            52: editor (e.g.
        !            53: .Xr vi 1 )
        !            54: the command
        !            55: .Pp
        !            56: .Dl \&!}fmt
        !            57: .Pp
        !            58: will reformat a paragraph,
        !            59: evening the lines.
        !            60: .Sh SEE ALSO
        !            61: .Xr nroff 1 ,
        !            62: .Xr mail 1
        !            63: .Sh HISTORY
        !            64: .Nm Fmt
        !            65: appeared in 3 BSD.
        !            66: .Sh AUTHOR
        !            67: Kurt Shoens
        !            68: .br
        !            69: Liz Allen (added goal length concept)
        !            70: .Sh BUGS
        !            71: The program was designed to be simple and fast \- for more complex
        !            72: operations, the standard text processors are likely to be more appropriate.

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.