Changeset 5546f50b for doc/theses/mike_brooks_MMath/programs/lst-issues-attach-reduction.hpp

Timestamp:

Mar 10, 2024, 11:21:18 AM (4 months ago)

Author:

Peter A. Buhr <pabuhr@…>

Branches:

master

Children:

9398177

Parents:

b64d0f4

Message:

more switch to tabs

File:

• doc/theses/mike_brooks_MMath/programs/lst-issues-attach-reduction.hpp (modified) (2 diffs)

doc/theses/mike_brooks_MMath/programs/lst-issues-attach-reduction.hpp

@@ -100 +100 @@
 template<typename El>
 class list {
-    struct node {
-        LIST_ENTRY(node) links;
-        El elem;
-    };
-    LIST_HEAD(Impl, node);
-    Impl impl;
+        struct node {
+                LIST_ENTRY(node) links;
+                El elem;
+        };
+        LIST_HEAD(Impl, node);
+        Impl impl;
   public:
-    list() {
-        LIST_INIT(&impl);
-    }
-    void push_front( const El & src ) {
-        node * n = new node();
-        n->elem = src;
-        LIST_INSERT_HEAD(&impl, n, links);
-    }
-    // ... `emplace` elided
+        list() {
+                LIST_INIT(&impl);
+        }
+        void push_front( const El & src ) {
+                node * n = new node();
+                n->elem = src;
+                LIST_INSERT_HEAD(&impl, n, links);
+        }
+        // ... `emplace` elided
 
 
@@ -129 +129 @@
 
 
-    template<typename... CtorArgs>
-    void emplace_front( CtorArgs... args ) {  
-        El tempEl{args...}; // (mock: avoid real emplacing to keep `struct node` simple; disucssion is about allocation, not copying)
-        push_front(tempEl);
-    }
-    class IType {
-        node* p;
-      public:
-        IType(node* p) : p(p) {}
-        bool operator!=(IType rhs) {return p != rhs.p;}
-        const El& operator*() {return p->elem;}
-        void operator++() { p = LIST_NEXT(p, links); }
-    };
-    IType begin() {return IType(LIST_FIRST(&impl)); }
-    IType end() {return IType(NULL); }
+        template<typename... CtorArgs>
+        void emplace_front( CtorArgs... args ) {  
+                El tempEl{args...}; // (mock: avoid real emplacing to keep `struct node` simple; disucssion is about allocation, not copying)
+                push_front(tempEl);
+        }
+        class IType {
+                node* p;
+          public:
+                IType(node* p) : p(p) {}
+                bool operator!=(IType rhs) {return p != rhs.p;}
+                const El& operator*() {return p->elem;}
+                void operator++() { p = LIST_NEXT(p, links); }
+        };
+        IType begin() {return IType(LIST_FIRST(&impl)); }
+        IType end() {return IType(NULL); }