From c931fda9ea44a3e9181d97a76567d3b9d37d8490 Mon Sep 17 00:00:00 2001
From: aaron <aaron@openbsd.org>
Date: Tue, 14 Mar 2000 20:25:46 +0000
Subject: [PATCH] Better mdoc formatting.

---
 bin/ksh/ksh.1    | 18 ++++++++++++------
 bin/ksh/ksh.1tbl | 18 ++++++++++++------
 2 files changed, 24 insertions(+), 12 deletions(-)

diff --git a/bin/ksh/ksh.1 b/bin/ksh/ksh.1
index fa2566a8de2..4e843d2e9ff 100644
--- a/bin/ksh/ksh.1
+++ b/bin/ksh/ksh.1
@@ -1,4 +1,4 @@
-.\"	$OpenBSD: ksh.1,v 1.29 1999/11/20 07:58:02 dugsong Exp $
+.\"	$OpenBSD: ksh.1,v 1.30 2000/03/14 20:25:46 aaron Exp $
 .\"
 .\" Copyright (c) 1980, 1990, 1993
 .\"     The Regents of the University of California.  All rights reserved.
@@ -1139,14 +1139,17 @@ is
 not specified, or the length of the string value of parameter
 .Ar name .
 .It Xo Ic ${# Ns Ar name Ns
-.Ic \&[\&*\&]\&} , ${# Ns Ar name Ns Ic \&[\&@\&]\&}
+.Ic [*\&]} , ${# Ns Ar name Ns Ic [@\&]}
 .Xc
 The number of elements in the array
 .Ar name .
 .Sm off
 .It Xo
-.Ic ${ Ar name Ic \&# Ar pattern Ic \&},\ \&
-.Ic ${ Ar name Ic \&#\&# Ar pattern Ic \&}
+.Ic ${ Ar name Ic # Ar pattern
+.Sm on
+.Ic } ,
+.Sm off
+.Ic ${ Ar name Ic ## Ar pattern Ic \&}
 .Xc
 .Sm on
 If
@@ -1159,8 +1162,11 @@ results in the shortest match, and two
 of them result in the longest match.
 .Sm off
 .It Xo
-.Ic ${ Ar name Ic \&% Ar pattern Ic \&},\ \&
-.Ic ${ Ar name Ic \&%\&% Ar pattern Ic \&}
+.Ic ${ Ar name Ic % Ar pattern
+.Sm on
+.Ic } ,
+.Sm off
+.Ic ${ Ar name Ic %% Ar pattern Ic }
 .Xc
 .Sm on
 Like
diff --git a/bin/ksh/ksh.1tbl b/bin/ksh/ksh.1tbl
index b12e4e9d9b5..a89f84f0499 100644
--- a/bin/ksh/ksh.1tbl
+++ b/bin/ksh/ksh.1tbl
@@ -1,4 +1,4 @@
-.\"	$OpenBSD: ksh.1tbl,v 1.29 1999/11/20 07:58:02 dugsong Exp $
+.\"	$OpenBSD: ksh.1tbl,v 1.30 2000/03/14 20:25:46 aaron Exp $
 .\"
 .\" Copyright (c) 1980, 1990, 1993
 .\"     The Regents of the University of California.  All rights reserved.
@@ -1139,14 +1139,17 @@ is
 not specified, or the length of the string value of parameter
 .Ar name .
 .It Xo Ic ${# Ns Ar name Ns
-.Ic \&[\&*\&]\&} , ${# Ns Ar name Ns Ic \&[\&@\&]\&}
+.Ic [*\&]} , ${# Ns Ar name Ns Ic [@\&]}
 .Xc
 The number of elements in the array
 .Ar name .
 .Sm off
 .It Xo
-.Ic ${ Ar name Ic \&# Ar pattern Ic \&},\ \&
-.Ic ${ Ar name Ic \&#\&# Ar pattern Ic \&}
+.Ic ${ Ar name Ic # Ar pattern
+.Sm on
+.Ic } ,
+.Sm off
+.Ic ${ Ar name Ic ## Ar pattern Ic \&}
 .Xc
 .Sm on
 If
@@ -1159,8 +1162,11 @@ results in the shortest match, and two
 of them result in the longest match.
 .Sm off
 .It Xo
-.Ic ${ Ar name Ic \&% Ar pattern Ic \&},\ \&
-.Ic ${ Ar name Ic \&%\&% Ar pattern Ic \&}
+.Ic ${ Ar name Ic % Ar pattern
+.Sm on
+.Ic } ,
+.Sm off
+.Ic ${ Ar name Ic %% Ar pattern Ic }
 .Xc
 .Sm on
 Like
-- 
2.20.1