[groff] 03/10: [troff]: Refactor (int_stack -> bool_stack).

[G. Branden Robinson]

gbranden pushed a commit to branch master
in repository groff.

commit 1eae9bb562994fe099f0a84ffdeac38d0baabf97
Author: G. Branden Robinson <g.branden.robinson@gmail.com>
AuthorDate: Sat Apr 13 09:35:48 2024 -0500

    [troff]: Refactor (int_stack -> bool_stack).
    
    * src/roff/troff/input.cpp: Slightly refactor.  Reconstruct class
      `int_stack` as `bool_stack` since all we require are Boolean values.
---
 ChangeLog                |  6 ++++++
 src/roff/troff/input.cpp | 30 +++++++++++++++---------------
 2 files changed, 21 insertions(+), 15 deletions(-)

diff --git a/ChangeLog b/ChangeLog
index 05b806a5f..cbebb4fd7 100644
--- a/ChangeLog
+++ b/ChangeLog
@@ -1,3 +1,9 @@
+2024-04-04  G. Branden Robinson <g.branden.robinson@gmail.com>
+
+       * src/roff/troff/input.cpp: Slightly refactor.  Reconstruct
+       class `int_stack` as `bool_stack` since all we require are
+       Boolean values.
+
 2024-04-04  G. Branden Robinson <g.branden.robinson@gmail.com>
 
        * src/roff/troff/input.cpp: Slightly refactor.  Boolify.  Demote
diff --git a/src/roff/troff/input.cpp b/src/roff/troff/input.cpp
index 80d3cd7b1..3ee318088 100644
--- a/src/roff/troff/input.cpp
+++ b/src/roff/troff/input.cpp
@@ -2874,50 +2874,50 @@ static int transparent_translate(int cc)
   return cc;
 }
 
-class int_stack {
-  struct int_stack_element {
+class bool_stack {
+  struct bool_stack_element {
     int n;
-    int_stack_element *next;
+    bool_stack_element *next;
   } *top;
 public:
-  int_stack();
-  ~int_stack();
+  bool_stack();
+  ~bool_stack();
   void push(int);
   int is_empty();
   int pop();
 };
 
-int_stack::int_stack()
+bool_stack::bool_stack()
 {
   top = 0;
 }
 
-int_stack::~int_stack()
+bool_stack::~bool_stack()
 {
   while (top != 0) {
-    int_stack_element *temp = top;
+    bool_stack_element *temp = top;
     top = top->next;
     delete temp;
   }
 }
 
-int int_stack::is_empty()
+int bool_stack::is_empty()
 {
   return top == 0;
 }
 
-void int_stack::push(int n)
+void bool_stack::push(int n)
 {
-  int_stack_element *p = new int_stack_element;
+  bool_stack_element *p = new bool_stack_element;
   p->next = top;
   p->n = n;
   top = p;
 }
 
-int int_stack::pop()
+int bool_stack::pop()
 {
   assert(top != 0);
-  int_stack_element *p = top;
+  bool_stack_element *p = top;
   top = top->next;
   int n = p->n;
   delete p;
@@ -2981,7 +2981,7 @@ static int leading_spaces_space = 0;
 
 void process_input_stack()
 {
-  int_stack trap_bol_stack;
+  bool_stack trap_bol_stack;
   int bol = 1;
   for (;;) {
     int suppress_next = 0;
@@ -5978,7 +5978,7 @@ static void nop_request()
     tok.next();
 }
 
-static int_stack if_else_stack;
+static bool_stack if_else_stack;
 
 static bool do_if_request()
 {