diff options
author | Tim J. Robbins <tjr@FreeBSD.org> | 2002-07-03 14:42:53 +0000 |
---|---|---|
committer | Tim J. Robbins <tjr@FreeBSD.org> | 2002-07-03 14:42:53 +0000 |
commit | bfed7b64855c417fdde638992116f50139e732d7 (patch) | |
tree | 2cfb2500a69fe5c76b5405b6a60f6aa1163df43c | |
parent | ccece3d626da41772d501aa1335198db6cfa1346 (diff) | |
download | src-bfed7b64855c417fdde638992116f50139e732d7.tar.gz src-bfed7b64855c417fdde638992116f50139e732d7.zip |
Note that two carriage returns aren't required after entering the
initial setup anymore (since process.c rev. 1.25). Add $FreeBSD$.
MFC after: 2 weeks
Notes
Notes:
svn path=/head/; revision=99355
-rw-r--r-- | tools/regression/usr.bin/sed/hanoi.sed | 5 | ||||
-rw-r--r-- | usr.bin/sed/TEST/hanoi.sed | 5 |
2 files changed, 6 insertions, 4 deletions
diff --git a/tools/regression/usr.bin/sed/hanoi.sed b/tools/regression/usr.bin/sed/hanoi.sed index d29c64836b33..5641a625ab1d 100644 --- a/tools/regression/usr.bin/sed/hanoi.sed +++ b/tools/regression/usr.bin/sed/hanoi.sed @@ -1,14 +1,15 @@ # Towers of Hanoi in sed. # # @(#)hanoi.sed 8.1 (Berkeley) 6/6/93 +# $FreeBSD$ # # # Ex: # Run "sed -f hanoi.sed", and enter: # -# :abcd: : :<CR><CR> +# :abcd: : :<CR> # -# note -- TWO carriage returns, a peculiarity of sed), this will output the +# note -- TWO carriage returns were once required, this will output the # sequence of states involved in moving 4 rings, the largest called "a" and # the smallest called "d", from the first to the second of three towers, so # that the rings on any tower at any time are in descending order of size. diff --git a/usr.bin/sed/TEST/hanoi.sed b/usr.bin/sed/TEST/hanoi.sed index d29c64836b33..5641a625ab1d 100644 --- a/usr.bin/sed/TEST/hanoi.sed +++ b/usr.bin/sed/TEST/hanoi.sed @@ -1,14 +1,15 @@ # Towers of Hanoi in sed. # # @(#)hanoi.sed 8.1 (Berkeley) 6/6/93 +# $FreeBSD$ # # # Ex: # Run "sed -f hanoi.sed", and enter: # -# :abcd: : :<CR><CR> +# :abcd: : :<CR> # -# note -- TWO carriage returns, a peculiarity of sed), this will output the +# note -- TWO carriage returns were once required, this will output the # sequence of states involved in moving 4 rings, the largest called "a" and # the smallest called "d", from the first to the second of three towers, so # that the rings on any tower at any time are in descending order of size. |