diff mbox series

[05/10] queue.3, slist.3: EXAMPLES: Move example program from queue.3 to slist.3

Message ID 20201022123821.22602-6-colomar.6.4.3@gmail.com
State Not Applicable
Headers show
Series slist.3: fork from queue.3 | expand

Commit Message

Alejandro Colomar Oct. 22, 2020, 12:38 p.m. UTC
Signed-off-by: Alejandro Colomar <colomar.6.4.3@gmail.com>
---
 man3/queue.3 | 57 ----------------------------------------------------
 man3/slist.3 | 57 ++++++++++++++++++++++++++++++++++++++++++++++++++++
 2 files changed, 57 insertions(+), 57 deletions(-)
diff mbox series

Patch

diff --git a/man3/queue.3 b/man3/queue.3
index cf5ab60b2..6cf13beb7 100644
--- a/man3/queue.3
+++ b/man3/queue.3
@@ -847,63 +847,6 @@  removes the element
 .Fa elm
 from the circular queue.
 .Sh EXAMPLES
-.Ss Singly-linked list example
-.Bd -literal
-
-#include <stddef.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <sys/queue.h>
-
-struct entry {
-    int data;
-    SLIST_ENTRY(entry) entries;             /* Singly-linked List. */
-};
-
-SLIST_HEAD(slisthead, entry);
-
-int
-main(void)
-{
-    struct entry    *n1, *n2, *n3, *np;
-    struct slisthead head;                  /* Singly-linked List
-                                               head. */
-
-    SLIST_INIT(&head);                      /* Initialize the queue. */
-
-    n1 = malloc(sizeof(struct entry));      /* Insert at the head. */
-    SLIST_INSERT_HEAD(&head, n1, entries);
-
-    n2 = malloc(sizeof(struct entry));      /* Insert after. */
-    SLIST_INSERT_AFTER(n1, n2, entries);
-
-    SLIST_REMOVE(&head, n2, entry, entries);/* Deletion. */
-    free(n2);
-
-    n3 = SLIST_FIRST(&head);
-    SLIST_REMOVE_HEAD(&head, entries);      /* Deletion from the head. */
-    free(n3);
-
-    for (int i = 0; i < 5; i++) {
-        n1 = malloc(sizeof(struct entry));
-        SLIST_INSERT_HEAD(&head, n1, entries);
-        n1->data = i;
-    }
-
-                                            /* Forward traversal. */
-    SLIST_FOREACH(np, &head, entries)
-        printf("%i\en", np->data);
-
-    while (!SLIST_EMPTY(&head)) {           /* List Deletion. */
-        n1 = SLIST_FIRST(&head);
-        SLIST_REMOVE_HEAD(&head, entries);
-        free(n1);
-    }
-    SLIST_INIT(&head);
-
-    exit(EXIT_SUCCESS);
-}
-.Ed
 .Ss Singly-linked tail queue example
 .Bd -literal
 #include <stddef.h>
diff --git a/man3/slist.3 b/man3/slist.3
index e29953a1d..291c8753b 100644
--- a/man3/slist.3
+++ b/man3/slist.3
@@ -227,4 +227,61 @@  See the EXAMPLES section below for an example program using a singly-linked list
 .SH CONFORMING TO
 .SH BUGS
 .SH EXAMPLES
+.Ss Singly-linked list example
+.Bd -literal
+
+#include <stddef.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <sys/queue.h>
+
+struct entry {
+    int data;
+    SLIST_ENTRY(entry) entries;             /* Singly-linked List. */
+};
+
+SLIST_HEAD(slisthead, entry);
+
+int
+main(void)
+{
+    struct entry    *n1, *n2, *n3, *np;
+    struct slisthead head;                  /* Singly-linked List
+                                               head. */
+
+    SLIST_INIT(&head);                      /* Initialize the queue. */
+
+    n1 = malloc(sizeof(struct entry));      /* Insert at the head. */
+    SLIST_INSERT_HEAD(&head, n1, entries);
+
+    n2 = malloc(sizeof(struct entry));      /* Insert after. */
+    SLIST_INSERT_AFTER(n1, n2, entries);
+
+    SLIST_REMOVE(&head, n2, entry, entries);/* Deletion. */
+    free(n2);
+
+    n3 = SLIST_FIRST(&head);
+    SLIST_REMOVE_HEAD(&head, entries);      /* Deletion from the head. */
+    free(n3);
+
+    for (int i = 0; i < 5; i++) {
+        n1 = malloc(sizeof(struct entry));
+        SLIST_INSERT_HEAD(&head, n1, entries);
+        n1->data = i;
+    }
+
+                                            /* Forward traversal. */
+    SLIST_FOREACH(np, &head, entries)
+        printf("%i\en", np->data);
+
+    while (!SLIST_EMPTY(&head)) {           /* List Deletion. */
+        n1 = SLIST_FIRST(&head);
+        SLIST_REMOVE_HEAD(&head, entries);
+        free(n1);
+    }
+    SLIST_INIT(&head);
+
+    exit(EXIT_SUCCESS);
+}
+.Ed
 .SH SEE ALSO