circleq.3, list.3, queue.3, slist.3, stailq.3, tailq.3: Minor grammar fix

Don't hyphenate after adjective ending in "ly". See, for example:
https://www.dragoman.ist/compound-modifiers-with-words-ending-in-ly/
https://www.merriam-webster.com/words-at-play/6-common-hypercorrections-and-how-to-avoid-them/between-you-and-i

Signed-off-by: Michael Kerrisk <mtk.manpages@gmail.com>

6 files changed, 33 insertions, 33 deletions

diff --git a/man3/circleq.3 b/man3/circleq.3
index 66d7aaa0b3..dc74dc9102 100644
--- a/man3/circleq.3
+++ b/man3/circleq.3
@@ -49,7 +49,7 @@ CIRCLEQ_LOOP_PREV,
 CIRCLEQ_NEXT,
 CIRCLEQ_PREV,
 CIRCLEQ_REMOVE
-\- implementation of a double-linked circular queue
+\- implementation of a doubly linked circular queue
 .SH SYNOPSIS
 .nf
 .B #include <sys/queue.h>
@@ -100,7 +100,7 @@ CIRCLEQ_REMOVE
 .BI "                CIRCLEQ_ENTRY " NAME ");"
 .fi
 .SH DESCRIPTION
-These macros define and operate on doubly-linked circular queues.
+These macros define and operate on doubly linked circular queues.
 .PP
 In the macro definitions,
 .I TYPE
diff --git a/man3/list.3 b/man3/list.3
index 94ccc5c399..e70b6729b3 100644
--- a/man3/list.3
+++ b/man3/list.3
@@ -48,7 +48,7 @@ LIST_NEXT,
 LIST_PREV,
 LIST_REMOVE
 .\"LIST_SWAP
-\- implementation of a doubly-linked list
+\- implementation of a doubly linked list
 .SH SYNOPSIS
 .nf
 .B #include <sys/queue.h>
@@ -91,7 +91,7 @@ LIST_REMOVE
 .\".BI "void LIST_SWAP(LIST_HEAD *" head1 ", LIST_HEAD *" head2 ", struct TYPE, LIST_ENTRY " NAME ");"
 .fi
 .SH DESCRIPTION
-These macros define and operate on doubly-linked lists.
+These macros define and operate on doubly linked lists.
 .PP
 In the macro definitions,
 .I TYPE
diff --git a/man3/queue.3 b/man3/queue.3
index 8cb42d0231..cbe72e29df 100644
--- a/man3/queue.3
+++ b/man3/queue.3
@@ -38,15 +38,15 @@ The
 header file provides a set of macros that
 define and operate on the following data structures:
 .IP * 3
-singly-linked lists (SLIST)
+singly linked lists (SLIST)
 .IP *
-doubly-linked lists (LIST)
+doubly linked lists (LIST)
 .IP *
-singly-linked tail queues (STAILQ)
+singly linked tail queues (STAILQ)
 .IP *
-doubly-linked tail queues (TAILQ)
+doubly linked tail queues (TAILQ)
 .IP *
-doubly-linked circular queues (CIRCLEQ)
+doubly linked circular queues (CIRCLEQ)
 .PP
 All structures support the following functionality:
 .IP * 3
@@ -63,17 +63,17 @@ Forward traversal through the list.
 Code size and execution time
 depend on the complexity of the data structure being used,
 so programmers should take care to choose the appropriate one.
-.SS Singly-linked lists (SLIST)
-Singly-linked lists are the simplest
+.SS Singly linked lists (SLIST)
+Singly linked lists are the simplest
 and support only the above functionality.
-Singly-linked lists are ideal for applications with
+Singly linked lists are ideal for applications with
 large datasets and few or no removals,
 or for implementing a LIFO queue.
-Singly-linked lists add the following functionality:
+Singly linked lists add the following functionality:
 .IP * 3
 O(n) removal of any entry in the list.
-.SS Singly-linked tail queues (STAILQ)
-Singly-linked tail queues add the following functionality:
+.SS Singly linked tail queues (STAILQ)
+Singly linked tail queues add the following functionality:
 .IP * 3
 Entries can be added at the end of a list.
 .IP *
@@ -87,10 +87,10 @@ All list insertions must specify the head of the list.
 .IP *
 Each head entry requires two pointers rather than one.
 .PP
-Singly-linked tail queues are ideal for applications with
+Singly linked tail queues are ideal for applications with
 large datasets and few or no removals,
 or for implementing a FIFO queue.
-.SS Doubly-linked data structures
+.SS Doubly linked data structures
 All doubly linked types of data structures (lists and tail queues)
 additionally allow:
 .IP * 3
@@ -101,7 +101,7 @@ O(1) removal of any entry in the list.
 However:
 .IP * 3
 Each element requires two pointers rather than one.
-.SS Doubly-linked lists (LIST)
+.SS Doubly linked lists (LIST)
 Linked lists are the simplest of the doubly linked data structures.
 They add the following functionality over the above:
 .IP * 3
@@ -111,7 +111,7 @@ However:
 .IP * 3
 To traverse backwards, an entry to begin the traversal and the list in
 which it is contained must be specified.
-.SS Doubly-linked tail queues (TAILQ)
+.SS Doubly linked tail queues (TAILQ)
 Tail queues add the following functionality:
 .IP * 3
 Entries can be added at the end of a list.
@@ -125,7 +125,7 @@ However:
 All list insertions and removals must specify the head of the list.
 .IP *
 Each head entry requires two pointers rather than one.
-.SS Doubly-linked circular queues (CIRCLEQ)
+.SS Doubly linked circular queues (CIRCLEQ)
 Circular queues add the following functionality over the above:
 .IP * 3
 The first and last entries are connected.
diff --git a/man3/slist.3 b/man3/slist.3
index 3ca9ea0d87..53e310f0a9 100644
--- a/man3/slist.3
+++ b/man3/slist.3
@@ -48,7 +48,7 @@ SLIST_REMOVE,
 .\"SLIST_REMOVE_AFTER,
 SLIST_REMOVE_HEAD
 .\"SLIST_SWAP
-\- implementation of a singly-linked list
+\- implementation of a singly linked list
 .SH SYNOPSIS
 .nf
 .B #include <sys/queue.h>
@@ -90,7 +90,7 @@ SLIST_REMOVE_HEAD
 .\".BI "void SLIST_SWAP(SLIST_HEAD *" head1 ", SLIST_HEAD *" head2 ", SLIST_ENTRY " NAME ");"
 .fi
 .SH DESCRIPTION
-These macros define and operate on doubly-linked lists.
+These macros define and operate on doubly linked lists.
 .PP
 In the macro definitions,
 .I TYPE
@@ -105,7 +105,7 @@ is the name of a user-defined structure that must be declared
 using the macro
 .BR SLIST_HEAD ().
 .PP
-A singly-linked list is headed by a structure defined by the
+A singly linked list is headed by a structure defined by the
 .BR SLIST_HEAD ()
 macro.
 This structure contains a single pointer to the first element
@@ -305,7 +305,7 @@ without interfering with the traversal.
 
 struct entry {
     int data;
-    SLIST_ENTRY(entry) entries;             /* Singly-linked List. */
+    SLIST_ENTRY(entry) entries;             /* Singly linked List. */
 };
 
 SLIST_HEAD(slisthead, entry);
@@ -314,7 +314,7 @@ int
 main(void)
 {
     struct entry *n1, *n2, *n3, *np;
-    struct slisthead head;                  /* Singly-linked List
+    struct slisthead head;                  /* Singly linked List
                                                head. */
 
     SLIST_INIT(&head);                      /* Initialize the queue. */
diff --git a/man3/stailq.3 b/man3/stailq.3
index b7f4721367..aa8ece5171 100644
--- a/man3/stailq.3
+++ b/man3/stailq.3
@@ -51,7 +51,7 @@ STAILQ_REMOVE,
 .\"STAILQ_REMOVE_AFTER,
 STAILQ_REMOVE_HEAD,
 .\"STAILQ_SWAP
-\- implementation of a singly-linked tail queue
+\- implementation of a singly linked tail queue
 .SH SYNOPSIS
 .nf
 .B #include <sys/queue.h>
@@ -103,7 +103,7 @@ STAILQ_REMOVE_HEAD,
 .\" .BI "                STAILQ_ENTRY " NAME ");"
 .fi
 .SH DESCRIPTION
-These macros define and operate on singly-linked tail queues.
+These macros define and operate on singly linked tail queues.
 .PP
 In the macro definitions,
 .I TYPE
@@ -117,8 +117,8 @@ The argument
 is the name of a user-defined structure that must be declared
 using the macro
 .BR STAILQ_HEAD ().
-.Ss Singly-linked tail queues
-A singly-linked tail queue is headed by a structure defined by the
+.Ss Singly linked tail queues
+A singly linked tail queue is headed by a structure defined by the
 .BR STAILQ_HEAD ()
 macro.
 This structure contains a pair of pointers,
@@ -338,7 +338,7 @@ without interfering with the traversal.
 
 struct entry {
     int data;
-    STAILQ_ENTRY(entry) entries;        /* Singly-linked tail queue. */
+    STAILQ_ENTRY(entry) entries;        /* Singly linked tail queue. */
 };
 
 STAILQ_HEAD(stailhead, entry);
@@ -347,7 +347,7 @@ int
 main(void)
 {
     struct entry *n1, *n2, *n3, *np;
-    struct stailhead head;              /* Singly-linked tail queue
+    struct stailhead head;              /* Singly linked tail queue
                                            head. */
 
     STAILQ_INIT(&head);                 /* Initialize the queue. */
diff --git a/man3/tailq.3 b/man3/tailq.3
index 1588d32acc..d3face5a3a 100644
--- a/man3/tailq.3
+++ b/man3/tailq.3
@@ -55,7 +55,7 @@ TAILQ_NEXT,
 TAILQ_PREV,
 TAILQ_REMOVE
 .\"TAILQ_SWAP
-\- implementation of a doubly-linked tail queue
+\- implementation of a doubly linked tail queue
 .SH SYNOPSIS
 .nf
 .B #include sys/queue.h
@@ -114,7 +114,7 @@ TAILQ_REMOVE
 .\" .PP
 .\" .BI "void TAILQ_SWAP(TAILQ_HEAD *" head1 ", TAILQ_HEAD *" head2 ", TYPE, TAILQ_ENTRY " NAME ");"
 .SH DESCRIPTION
-These macros define and operate on doubly-linked tail queues.
+These macros define and operate on doubly linked tail queues.
 .PP
 In the macro definitions,
 .I TYPE